| /prebuilts/go/linux-x86/src/math/big/ |
| rat.go | 473 // Add sets z to the sum x+y and returns z.
474 func (z *Rat) Add(x, y *Rat) *Rat {
477 z.a.Add(a1, a2)
|
| /prebuilts/go/linux-x86/src/net/http/ |
| header.go | 21 // Add adds the key, value pair to the header.
23 func (h Header) Add(key, value string) {
24 textproto.MIMEHeader(h).Add(key, value)
|
| /art/compiler/utils/ |
| dedupe_set-inl.h | 70 const StoreKey* Add(Thread* self, size_t hash, const InKey& in_key) REQUIRES(!lock_) {
188 const StoreKey* DedupeSet<InKey, StoreKey, Alloc, HashType, HashFunc, kShard>::Add(
201 return shards_[shard_bin]->Add(self, shard_hash, key);
|
| /art/runtime/ |
| indirect_reference_table.cc | 127 // To keep the IRT compact, we want to fill "holes" created by non-stack-discipline Add & Remove
140 // cannot do work when the segment changes. Thus, Add and Remove need to ensure the current
147 // 1) Segment with holes (current_num_holes_ > 0), push new segment, add/remove reference
148 // 2) Segment with holes (current_num_holes_ > 0), pop segment, add/remove reference
149 // 3) Segment with holes (current_num_holes_ > 0), push new segment, pop segment, add/remove
151 // 4) Empty segment, push new segment, create a hole, pop a segment, add/remove a reference
152 // 5) Base segment, push new segment, create a hole, pop a segment, push new segment, add/remove
226 IndirectRef IndirectReferenceTable::Add(IRTSegmentState previous_state,
229 LOG(INFO) << "+++ Add: previous_state=" << previous_state.top_index
265 // add to the end of the list
[all...] |
| /bionic/linker/ |
| linker_cfi.cpp | 100 void CFIShadowWriter::Add(uintptr_t begin, uintptr_t end, uintptr_t cfi_check) {
170 INFO("[ CFI add 0x%zx + 0x%zx %s ]", static_cast<uintptr_t>(si->base),
176 INFO("[ CFI add 0x%zx + 0x%zx %s: 0x%zx ]", static_cast<uintptr_t>(si->base),
190 Add(si->base, si->base + si->size, cfi_check);
236 // Init shadow and add all currently loaded libraries (not just the new ones).
257 // Add the new library to the CFI shadow.
|
| /build/blueprint/parser/ |
| parser.go | 240 err := p.scope.Add(assignment)
577 func (s *Scope) Add(assignment *Assignment) error {
|
| /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Foundation/Efi/Protocol/Arp/ |
| Arp.h | 124 EFI_ARP_ADD Add;
|
| /device/linaro/bootloader/edk2/MdePkg/Include/Protocol/ |
| Arp.h | 160 by the Add() function may be static (will not time out) or dynamic (will time out).
171 @param TargetSwAddress Pointer to a protocol address to add (or deny).
173 @param TargetHwAddress Pointer to a hardware address to add (or deny).
373 EFI_ARP_ADD Add;
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_flag_parser.cc | 31 void Add(const char *name) {
154 unknown_flags.Add(name);
|
| /external/gemmlowp/internal/ |
| fixedpoint_neon.h | 48 inline int32x4_t Add(int32x4_t a, int32x4_t b) {
|
| /external/google-breakpad/src/common/linux/ |
| synth_elf.h | 69 empty_string = Add("");
72 // Add the string s to the string table, and return
75 Label Add(const string& s) {
100 // Add the Section section to the section header table and append it
107 // Add a segment containing from section index start to section index end.
168 // Add an Elf32_Sym.
171 // Add an Elf64_Sym.
187 // Add a note.
|
| /external/google-breakpad/src/common/ |
| stabs_reader_unittest.cc | 75 // Add the string S to this StringAssembler, and return the string's
78 size_t Add(const string &s) {
161 // As above, but automatically add NAME to our StringAssembler.
164 return Stab(type, other, descriptor, value, string_assembler_->Add(name));
178 string_assembler_->Add(name));
|
| /external/google-breakpad/src/processor/ |
| synth_minidump.h | 63 // minidump.Add(&stack1);
64 // minidump.Add(&context1);
65 // minidump.Add(&thread1);
81 // The dump.Add(thing) functions append THINGS's contents to the
84 // - dump.Add(thing) invokes thing->Finish, which tells *thing the
89 // of list or directory, then dump.Add(THING) automatically creates
96 // to other Sections do not take care of 'Add'ing their arguments to
98 // references to a Memory and a Context, it does not add them to the
100 // 'Add'ing every section they create. This allows Sections to be
105 // If you forget to Add some Section, the Dump::GetContents call wil
[all...] |
| /external/libbrillo/brillo/dbus/ |
| dbus_object.h | 90 // The important functionality for the users is the ability to add D-Bus method
126 Handler<SimpleDBusInterfaceMethodHandler<R, Args...>>::Add(
135 Handler<SimpleDBusInterfaceMethodHandler<R, Args...>>::Add(
145 Handler<SimpleDBusInterfaceMethodHandler<R, Args...>>::Add(
154 Handler<SimpleDBusInterfaceMethodHandler<R, Args...>>::Add(
163 Handler<SimpleDBusInterfaceMethodHandlerWithError<Args...>>::Add(
173 Handler<SimpleDBusInterfaceMethodHandlerWithError<Args...>>::Add(
184 Handler<SimpleDBusInterfaceMethodHandlerWithError<Args...>>::Add(
194 Handler<SimpleDBusInterfaceMethodHandlerWithError<Args...>>::Add(
205 Handler<SimpleDBusInterfaceMethodHandlerWithErrorAndMessage<Args...>>::Add(
[all...] |
| /external/libchrome/sandbox/linux/seccomp-bpf/ |
| trap.cc | 160 // TODO(jln): add a DCHECK or move back to FATAL.
260 uint16_t Trap::Add(TrapFnc fnc, const void* aux, bool safe) {
|
| /external/libtextclassifier/common/ |
| registry.h | 143 bool Add(const char *key, T *value) {
258 static bool once = registry()->Add( \
|
| /external/llvm/include/llvm/Support/ |
| Registry.h | 104 /// Registry<Collector>::Add<FancyGC>
111 class Add {
118 Add(const char *Name, const char *Desc)
|
| /external/llvm/lib/TableGen/ |
| SetTheory.cpp | 28 // (add a, b, ...) Evaluate and union all arguments.
36 // (sub Add, Sub, ...) Set difference.
43 RecSet Add, Sub;
44 ST.evaluate(*Expr->arg_begin(), Add, Loc);
46 for (RecSet::iterator I = Add.begin(), E = Add.end(); I != E; ++I)
248 addOperator("add", llvm::make_unique<AddOp>());
|
| /external/pdfium/xfa/fgas/crt/ |
| fgas_utils.h | 45 int32_t Add(const baseType& element) {
|
| /external/protobuf/python/google/protobuf/ |
| descriptor_pool.py | 46 pool.Add(file_descriptor_proto)
98 specified in a call to FindFileByName() and not require the call to Add()
111 def Add(self, file_desc_proto):
115 file_desc_proto: The FileDescriptorProto to add.
118 self._internal_db.Add(file_desc_proto)
125 FileDescriptorProto to add.
132 self.Add(file_desc_proto)
336 # Just add them to this descriptor pool.
397 self.Add(file_proto)
|
| /external/protobuf/src/google/protobuf/ |
| repeated_field_reflection.h | 91 virtual void Add(Field* data, const Value* value) const = 0;
144 void Add(Field* data, const ValueType& value) const {
154 Add(data, static_cast<const Value*>(&tmp));
|
| /external/regex-re2/re2/ |
| prefilter_tree.cc | 69 void PrefilterTree::Add(Prefilter *f) {
71 LOG(DFATAL) << "Add after Compile.";
165 // Add the top level nodes of each regexp prefilter.
176 // Now add all the descendant nodes.
258 // To the child, we want to add to parent indices.
|
| /external/skia/src/core/ |
| SkBitmapCache.cpp | 105 SkDebugf("-- add [%d %d] %d [%d %d %d %d]\n",
155 bool SkBitmapCache::Add(const SkBitmapCacheDesc& desc, const SkBitmap& result,
160 CHECK_LOCAL(localCache, add, Add, rec);
254 CHECK_LOCAL(localCache, add, Add, rec);
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| ImmutableIntervalMap.h | 100 TreeTy *Add(TreeTy *T, value_type_ref V) {
170 // Add back the unoverlapped part of the current key.
220 ImmutableIntervalMap add(ImmutableIntervalMap Old, function in class:llvm::ImmutableIntervalMap::Factory
222 TreeTy *T = F.add(Old.Root, std::pair<key_type, data_type>(K, D));
|
| /external/v8/src/base/ |
| atomic-utils.h | 220 void Add(E element) { ATOMIC_SET_WRITE(|, Mask(element)); }
222 void Add(const AtomicEnumSet& set) { ATOMIC_SET_WRITE(|, set.ToIntegral()); }
|
