/art/runtime/ |
H A D | indirect_reference_table_test.cc | 73 // Add three, check, remove in the order in which they were added. 74 iref0 = irt.Add(cookie, obj0); 77 IndirectRef iref1 = irt.Add(cookie, obj1); 80 IndirectRef iref2 = irt.Add(cookie, obj2); 101 // Add three, remove in the opposite order. 102 iref0 = irt.Add(cookie, obj0); 104 iref1 = irt.Add(cookie, obj1); 106 iref2 = irt.Add(cookie, obj2); 120 // Add three, remove middle / middle / bottom / top. (Second attempt 122 iref0 = irt.Add(cooki [all...] |
H A D | jni_env_ext-inl.h | 28 IndirectRef ref = locals.Add(local_ref_cookie, obj);
|
H A D | signal_set.h | 34 void Add(int signal) { function in class:art::SignalSet
|
H A D | reference_table_test.cc | 53 // Add o1 and check we have 1 element and can dump. 55 rt.Add(o1); 63 // Add a second object 10 times and check dumping is sane. 66 rt.Add(o2);
|
H A D | reference_table.h | 44 void Add(mirror::Object* obj) SHARED_REQUIRES(Locks::mutator_lock_);
|
H A D | signal_catcher.cc | 199 signals.Add(SIGQUIT); 200 signals.Add(SIGUSR1);
|
H A D | indirect_reference_table.cc | 105 IndirectRef IndirectReferenceTable::Add(uint32_t cookie, mirror::Object* obj) { function in class:art::IndirectReferenceTable 140 // Add to the end. 144 table_[index].Add(obj);
|
H A D | indirect_reference_table.h | 202 void Add(mirror::Object* obj) SHARED_REQUIRES(Locks::mutator_lock_) { 274 * Add a new entry. "obj" must be a valid non-nullptr object reference. 279 IndirectRef Add(uint32_t cookie, mirror::Object* obj)
|
H A D | debugger.cc | 739 *class_object_id = gRegistry->Add(c); 754 *superclass_id = gRegistry->Add(c->GetSuperClass()); 765 expandBufAddObjectId(pReply, gRegistry->Add(c->GetClassLoader())); 808 expandBufAddObjectId(reply, gRegistry->Add(monitor_info.owner_->GetPeer())); 810 expandBufAddObjectId(reply, gRegistry->Add(nullptr)); 815 expandBufAddObjectId(reply, gRegistry->Add(monitor_info.waiters_[i]->GetPeer())); 846 visitor->monitors->push_back(gRegistry->Add(owned_monitor)); 883 // Add() requires the thread_list_lock_ not held to avoid the lock 885 *contended_monitor = gRegistry->Add(contended_monitor_obj); 921 instances->push_back(gRegistry->Add(raw_instance 4844 void Add(const std::string& str) { function in class:art::StringTable 4848 void Add(const char* str) { function in class:art::StringTable [all...] |
H A D | jni_env_ext.cc | 83 return reinterpret_cast<jobject>(locals.Add(local_ref_cookie, obj));
|
/art/compiler/utils/ |
H A D | dedupe_set_test.cc | 66 array1 = deduplicator.Add(self, test1); 75 array2 = deduplicator.Add(self, test2); 84 array3 = deduplicator.Add(self, test3);
|
H A D | dedupe_set.h | 31 // Add method. The data-structure is thread-safe through the use of internal locks, it also 41 // Add a new key to the dedupe set if not present. Return the equivalent deduplicated stored key. 42 const StoreKey* Add(Thread* self, const InKey& key);
|
H A D | dedupe_set-inl.h | 69 const StoreKey* Add(Thread* self, size_t hash, const InKey& in_key) REQUIRES(!lock_) { 187 const StoreKey* DedupeSet<InKey, StoreKey, Alloc, HashType, HashFunc, kShard>::Add( function in class:art::DedupeSet 200 return shards_[shard_bin]->Add(self, shard_hash, key);
|
/art/compiler/debug/ |
H A D | elf_symtab_writer.h | 65 continue; // Add symbol only for the first instance. 84 // Add in code delta, e.g., thumb bit 0 for Thumb2 code. 86 symtab->Add(name_offset, text, address, info.code_size, STB_GLOBAL, STT_FUNC); 94 symtab->Add(strtab->Write("$t"), text, address & ~1, 0, STB_LOCAL, STT_NOTYPE);
|
/art/compiler/ |
H A D | elf_builder.h | 251 Elf_Word Add(const void* data, size_t length) { function in class:art::FINAL::CachedSection 294 Elf_Word Add(const std::string& name) { function in class:art::FINAL::FINAL 298 return CachedSection::Add(name.c_str(), name.length() + 1); 352 CachedSection::Add(&null_symbol, sizeof(null_symbol)); 358 void Add(Elf_Word name, function in class:art::FINAL::FINAL 372 Add(name, section_index, addr, size, binding, type); 375 void Add(Elf_Word name, function in class:art::FINAL::FINAL 388 CachedSection::Add(&sym, sizeof(sym)); 645 dynstr_.Add(""); // dynstr should start with empty string. 647 Elf_Word oatdata = dynstr_.Add("oatdat [all...] |
/art/runtime/jdwp/ |
H A D | object_registry.cc | 39 return Add(c); 43 return Add(c_h); 46 JDWP::ObjectId ObjectRegistry::Add(mirror::Object* o) { function in class:art::ObjectRegistry 57 JDWP::ObjectId ObjectRegistry::Add(Handle<T> obj_h) { function in class:art::ObjectRegistry 68 JDWP::ObjectId ObjectRegistry::Add(Handle<mirror::Object> obj_h); 73 JDWP::ObjectId ObjectRegistry::Add(Handle<mirror::Throwable> obj_h);
|
H A D | object_registry.h | 47 // The corresponding id, so we only need one map lookup in Add. 65 JDWP::ObjectId Add(mirror::Object* o) 74 JDWP::ObjectId Add(Handle<T> obj_h)
|
/art/runtime/gc/collector/ |
H A D | garbage_collector.cc | 55 // Add 1ms to prevent possible division by 0. 88 // Add the current timings to the cumulative timings. 142 // Add 1ms to prevent possible division by 0. 176 GetCurrentIteration()->freed_.Add(freed); 180 GetCurrentIteration()->freed_los_.Add(freed);
|
H A D | garbage_collector.h | 49 void Add(const ObjectBytePair& other) { function in struct:art::gc::collector::ObjectBytePair
|
/art/compiler/optimizing/ |
H A D | bounds_check_elimination.cc | 249 // Add a constant to a ValueBound. 252 ValueBound Add(int32_t c, /* out */ bool* overflow, /* out */ bool* underflow) const { function in class:art::ValueBound 350 ValueRange* Add(int32_t constant) const { function in class:art::ValueRange 352 ValueBound lower = lower_.Add(constant, &overflow, &underflow); 358 ValueBound upper = upper_.Add(constant, &overflow, &underflow); 685 right_range->GetBound().Add(left_compensation, &overflow, &underflow)); 693 left_range->GetBound().Add(right_compensation, &overflow, &underflow), 760 ValueBound new_upper = upper.Add(compensation, &overflow, &underflow); 772 ValueBound new_lower = lower.Add(compensation, &overflow, &underflow); 784 ValueBound new_lower = lower.Add(compensatio [all...] |
H A D | intrinsics_arm64.cc | 1048 __ Add(tmp_ptr, base.X(), Operand(offset)); 1166 __ Add(array_temp, obj, Operand(value_offset.Int32Value())); // array_temp := str.value. 1281 __ Add(temp1, temp1, Operand(sizeof(uint64_t))); 1690 __ Add(src_ptr, srcObj, Operand(value_offset)); 1691 __ Add(src_ptr_end, src_ptr, Operand(srcEnd, LSL, 1)); 1692 __ Add(src_ptr, src_ptr, Operand(srcBegin, LSL, 1)); 1695 __ Add(dst_ptr, dstObj, Operand(data_offset)); 1696 __ Add(dst_ptr, dst_ptr, Operand(dstBegin, LSL, 1)); 1829 __ Add(src_base, src, element_size * constant + data_offset); 1831 __ Add(src_bas [all...] |
H A D | gvn.cc | 29 * through the `Add` method, and the `Kill` method. The `Kill` method removes 85 void Add(HInstruction* instruction) { function in class:art::ValueSet 505 set->Add(current);
|
H A D | locations.h | 414 void Add(Location loc) { 559 live_registers_.Add(location);
|
/art/runtime/interpreter/ |
H A D | safe_math_test.cc | 26 TEST(SafeMath, Add) {
|
/art/compiler/driver/ |
H A D | compiled_method_storage.cc | 62 return dedupe_set->Add(Thread::Current(), data);
|