Home
last modified time | relevance | path

Searched refs:Contains (Results 1 – 25 of 54) sorted by relevance

123

/art/runtime/
Dlinear_alloc.cc51 bool LinearAlloc::Contains(void* ptr) const { in Contains() function in art::LinearAlloc
53 return allocator_.Contains(ptr); in Contains()
57 return allocator_.Contains(ptr); in ContainsUnsafe()
Dclass_table_test.cc103 EXPECT_FALSE(table.Contains(h_Y.Get())); in TEST_F()
107 EXPECT_TRUE(table.Contains(h_X.Get())); in TEST_F()
108 EXPECT_TRUE(table.Contains(h_Y.Get())); in TEST_F()
145 EXPECT_FALSE(table.Contains(h_X.Get())); in TEST_F()
156 EXPECT_TRUE(table2.Contains(h_X.Get())); in TEST_F()
157 EXPECT_TRUE(table2.Contains(h_Y.Get())); in TEST_F()
Dhandle_scope-inl.h100 inline bool HandleScope::Contains(StackReference<mirror::Object>* handle_scope_entry) const { in Contains() function
151 inline bool BaseHandleScope::Contains(StackReference<mirror::Object>* handle_scope_entry) const { in Contains() function
153 ? AsHandleScope()->Contains(handle_scope_entry) in Contains()
154 : AsVariableSized()->Contains(handle_scope_entry); in Contains()
226 inline bool VariableSizedHandleScope::Contains(StackReference<mirror::Object>* handle_scope_entry) in Contains() function
230 if (cur->Contains(handle_scope_entry)) { in Contains()
Dhandle_scope_test.cc108 EXPECT_TRUE(hs.Contains(handles.back().GetReference())); in TEST_F()
109 EXPECT_TRUE(base->Contains(handles.back().GetReference())); in TEST_F()
118 EXPECT_TRUE(base->Contains(ref)); in TEST_F()
Dmanaged_stack.cc49 if (current_frame->Contains(shadow_frame_entry)) { in ShadowFramesContain()
Dlinear_alloc.h49 bool Contains(void* ptr) const REQUIRES(!lock_);
Dhandle_scope.h51 ALWAYS_INLINE bool Contains(StackReference<mirror::Object>* handle_scope_entry) const;
116 ALWAYS_INLINE bool Contains(StackReference<mirror::Object>* handle_scope_entry) const;
296 ALWAYS_INLINE bool Contains(StackReference<mirror::Object>* handle_scope_entry) const;
Dthread_list.h188 bool Contains(Thread* thread) REQUIRES(Locks::thread_list_lock_);
189 bool Contains(pid_t tid) REQUIRES(Locks::thread_list_lock_);
Dthread_list.cc98 contains = Contains(self); in ShutDown()
117 bool ThreadList::Contains(Thread* thread) { in Contains() function in art::ThreadList
121 bool ThreadList::Contains(pid_t tid) { in Contains() function in art::ThreadList
186 contains = Contains(tid); in DumpUnattachedThreads()
849 if (!Contains(thread)) { in Resume()
929 if (!Contains(thread)) { in SuspendThreadByPeer()
1047 DCHECK(Contains(thread)); in SuspendThreadByThreadId()
1411 CHECK(!Contains(self)); in Register()
1453 if (!Contains(self)) { in Unregister()
Doat_quick_method_header.h137 bool Contains(uintptr_t pc) const { in Contains() function
Dstack.cc648 if (!linear_alloc->Contains(method)) { in SanityCheckFrame()
657 if (!class_linear_alloc->Contains(canonical)) { in SanityCheckFrame()
667 if (methods.Contains(offset) || runtime_methods.Contains(offset)) { in SanityCheckFrame()
/art/compiler/optimizing/
Dlocations.h304 bool Contains(Location other) const { in Contains() function
315 bool overlap = Contains(other) || other.Contains(*this); in OverlapsWith()
320 DCHECK(!Contains(other.ToLow())); in OverlapsWith()
321 DCHECK(!Contains(other.ToHigh())); in OverlapsWith()
457 return Contains(core_registers_, id); in ContainsCoreRegister()
461 return Contains(floating_point_registers_, id); in ContainsFloatingPointRegister()
464 static bool Contains(uint32_t register_set, uint32_t reg) { in Contains() function
625 return RegisterSet::Contains(register_mask_, reg_id); in RegisterContainsObject()
Dlinear_order.cc63 if (loop->Contains(*block)) { in IsLinearOrderWellFormed()
Dgvn.cc115 bool Contains(HInstruction* instruction) const { in Contains() function in art::ValueSet
152 return !predecessor->Contains(node->GetInstruction()); in IntersectWith()
/art/runtime/gc/space/
Dlarge_object_space.h94 bool Contains(const mirror::Object* obj) const { in Contains() function
144 bool Contains(const mirror::Object* obj) const NO_THREAD_SAFETY_ANALYSIS;
186 DCHECK(Contains(reinterpret_cast<mirror::Object*>(address))); in GetSlotIndexForAddress()
Ddlmalloc_space-inl.h62 CHECK(Contains(result)) << "Allocation (" << reinterpret_cast<void*>(result) in AllocWithoutGrowthLocked()
Drosalloc_space-inl.h47 CHECK(Contains(result)) << "Allocation (" << reinterpret_cast<void*>(result) in AllocCommon()
Dlarge_object_space.cc86 bool Contains(const mirror::Object* obj) const OVERRIDE { in Contains() function in art::gc::space::FINAL
87 return LargeObjectMapSpace::Contains(ObjectWithRedzone(obj)); in Contains()
217 CHECK(Contains(ptrs[i])); in FreeList()
233 bool LargeObjectMapSpace::Contains(const mirror::Object* obj) const { in Contains() function in art::gc::space::LargeObjectMapSpace
404 DCHECK(Contains(obj)) << reinterpret_cast<void*>(Begin()) << " " << obj << " " in Free()
462 DCHECK(Contains(obj)); in AllocationSize()
Ddlmalloc_space.cc149 CHECK(!kDebugSpaces || Contains(result)); in AllocWithGrowth()
172 CHECK(Contains(ptr)) << "Free (" << ptr << ") not in bounds of heap " << *this; in Free()
207 if (!Contains(ptrs[i])) { in FreeList()
Drosalloc_space.cc173 CHECK(!kDebugSpaces || result == nullptr || Contains(result)); in AllocWithGrowth()
195 CHECK(Contains(ptr)) << "Free (" << ptr << ") not in bounds of heap " << *this; in Free()
227 if (!Contains(ptrs[i])) { in FreeList()
Dspace.h96 virtual bool Contains(const mirror::Object* obj) const = 0;
313 bool Contains(const mirror::Object* obj) const { in Contains() function
Dregion_space.h146 bool Contains(const mirror::Object* obj) const { in Contains() function
438 bool Contains(mirror::Object* ref) const { in Contains() function
493 DCHECK(reg->Contains(ref)); in RefToRegionLocked()
Dbump_pointer_space.h129 bool Contains(const mirror::Object* obj) const { in Contains() function
/art/runtime/base/
Darena_allocator.h226 bool Contains(const void* ptr) const { in Contains() function
380 bool Contains(const void* ptr) const;
Darray_slice.h132 bool Contains(const T* element) const { in Contains() function

123