/art/compiler/utils/ |
H A D | atomic_dex_ref_map-inl.h | 78 inline bool AtomicDexRefMap<DexFileReferenceType, Value>::Remove(const DexFileReferenceType& ref, function in class:art::AtomicDexRefMap
|
H A D | intrusive_forward_list_test.cc | 105 void Remove(); 565 void IntrusiveForwardListTest::Remove() { function in class:art::IntrusiveForwardListTest 587 TEST_F(IntrusiveForwardListTest, Remove) { 588 Remove<IFLTestValueList>(); 589 Remove<ConstIFLTestValueList>(); 590 Remove<IFLTestValue2List>();
|
/art/openjdkjvmti/ |
H A D | jvmti_weak_table-inl.h | 90 bool JvmtiWeakTable<T>::Remove(art::mirror::Object* obj, /* out */ T* tag) { function in class:openjdkjvmti::JvmtiWeakTable
|
/art/runtime/ |
H A D | class_table.cc | 186 bool ClassTable::Remove(const char* descriptor) { function in class:art::ClassTable
|
H A D | reference_table.cc | 59 void ReferenceTable::Remove(ObjPtr<mirror::Object> obj) { function in class:art::ReferenceTable
|
H A D | runtime_callbacks.cc | 31 static inline void Remove(T* cb, std::vector<T*>* data) { function in namespace:art 43 Remove(cb, &ddm_callbacks_); 57 Remove(cb, &debugger_control_callbacks_); 86 Remove(cb, &method_inspection_callbacks_); 151 Remove(cb, &monitor_callbacks_); 155 Remove(cb, &thread_callbacks_); 175 Remove(cb, &class_callbacks_); 225 Remove(cb, &sigquit_callbacks_); 239 Remove(cb, &phase_callbacks_); 253 Remove(c [all...] |
H A D | indirect_reference_table.cc | 133 // To keep the IRT compact, we want to fill "holes" created by non-stack-discipline Add & Remove 146 // cannot do work when the segment changes. Thus, Add and Remove need to ensure the current 342 bool IndirectReferenceTable::Remove(IRTSegmentState previous_state, IndirectRef iref) { function in class:art::IndirectReferenceTable 344 LOG(INFO) << "+++ Remove: previous_state=" << previous_state.top_index
|
H A D | intern_table.cc | 75 strong_interns_.Remove(old_ref); 148 strong_interns_.Remove(s); 156 weak_interns_.Remove(s); 404 void InternTable::Table::Remove(ObjPtr<mirror::String> s) { function in class:art::InternTable::Table
|
/art/libartbase/base/ |
H A D | variant_map.h | 254 map_.Remove(key_); 289 Remove(key); 307 // Remove the value for a given key, or a no-op if there was no previously set value. 309 void Remove(const TKey<TValue>& key) { function in struct:art::VariantMap 320 // Remove all key/value pairs.
|
/art/runtime/gc/allocator/ |
H A D | rosalloc.h | 157 Slot* Remove() { function in class:art::gc::allocator::RosAlloc::SlotFreeList
|
/art/compiler/optimizing/ |
H A D | nodes.cc | 97 // Remove the environment use records of the instruction for users. 166 // Remove the block from the list of blocks, so that further analyses 189 // (2) Remove instructions and phis from blocks not visited during 194 // (3) Remove blocks not visited during the initial DFS. 737 void HLoopInformation::Remove(HBasicBlock* block) { function in class:art::HLoopInformation 1044 static void Remove(HInstructionList* instruction_list, function in namespace:art 1060 Remove(&instructions_, this, instruction, ensure_safety); 1064 Remove(&phis_, this, phi, ensure_safety); 1388 // Remove the inputs first, otherwise removing the instruction 2110 // Remove thi [all...] |