| /art/runtime/ |
| D | linear_alloc.cc | 51 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()
|
| D | class_table_test.cc | 103 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()
|
| D | handle_scope-inl.h | 101 inline bool HandleScope::Contains(StackReference<mirror::Object>* handle_scope_entry) const { in Contains() function
161 inline bool BaseHandleScope::Contains(StackReference<mirror::Object>* handle_scope_entry) const { in Contains() function
163 ? AsHandleScope()->Contains(handle_scope_entry) in Contains()
164 : AsVariableSized()->Contains(handle_scope_entry); in Contains()
236 inline bool VariableSizedHandleScope::Contains(StackReference<mirror::Object>* handle_scope_entry) in Contains() function
240 if (cur->Contains(handle_scope_entry)) { in Contains()
|
| D | handle_scope_test.cc | 109 EXPECT_TRUE(hs.Contains(handles.back().GetReference())); in TEST_F()
110 EXPECT_TRUE(base->Contains(handles.back().GetReference())); in TEST_F()
119 EXPECT_TRUE(base->Contains(ref)); in TEST_F()
|
| D | managed_stack.cc | 49 if (current_frame->Contains(shadow_frame_entry)) { in ShadowFramesContain()
|
| D | linear_alloc.h | 50 bool Contains(void* ptr) const REQUIRES(!lock_);
|
| D | handle_scope.h | 54 ALWAYS_INLINE bool Contains(StackReference<mirror::Object>* handle_scope_entry) const;
119 ALWAYS_INLINE bool Contains(StackReference<mirror::Object>* handle_scope_entry) const;
255 ALWAYS_INLINE bool Contains(StackReference<mirror::Object>* handle_scope_entry) const;
|
| D | thread_list.h | 185 bool Contains(Thread* thread) REQUIRES(Locks::thread_list_lock_);
186 bool Contains(pid_t tid) REQUIRES(Locks::thread_list_lock_);
|
| D | thread_list.cc | 99 contains = Contains(self); in ShutDown()
118 bool ThreadList::Contains(Thread* thread) { in Contains() function in art::ThreadList
122 bool ThreadList::Contains(pid_t tid) { in Contains() function in art::ThreadList
187 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()
1455 if (!Contains(self)) { in Unregister()
|
| /art/test/616-cha-unloading/ |
| D | cha_unload.cc | 40 is_found = alloc->Contains(ptr_); in Visit()
66 if (Runtime::Current()->GetLinearAlloc()->Contains(ptr)) { in Java_Main_reuseArenaOfMethod()
84 } while (!alloc->Contains(ptr)); in Java_Main_reuseArenaOfMethod()
|
| /art/compiler/optimizing/ |
| D | locations.h | 304 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()
|
| D | loop_analysis.cc | 36 if (!loop_info->Contains(*successor)) { in CalculateLoopBasicProperties()
45 if (hif != nullptr && !loop_info->Contains(*hif->InputAt(0)->GetBlock())) { in CalculateLoopBasicProperties()
|
| D | superblock_cloner_test.cc | 258 EXPECT_TRUE(loop_info->Contains(*loop_body)); in TEST_F()
542 EXPECT_TRUE(loop1->Contains(*loop2_header)); in TEST_F()
543 EXPECT_TRUE(loop1->Contains(*loop3_header)); in TEST_F()
544 EXPECT_TRUE(loop1->Contains(*loop3_header->GetLoopInformation()->GetPreHeader())); in TEST_F()
599 EXPECT_TRUE(loop1_header->GetLoopInformation()->Contains(*loop3_long_exit)); in TEST_F()
608 EXPECT_TRUE(loop1->Contains(*loop3_long_exit)); in TEST_F()
612 EXPECT_TRUE(loop1->Contains(*loop3_header)); in TEST_F()
613 EXPECT_TRUE(loop1->Contains(*loop3_header->GetLoopInformation()->GetPreHeader())); in TEST_F()
|
| D | linear_order.cc | 67 if (loop->Contains(*block)) { in IsLinearOrderWellFormed()
|
| /art/runtime/gc/space/ |
| D | large_object_space.h | 100 bool Contains(const mirror::Object* obj) const override { in Contains() function
163 bool Contains(const mirror::Object* obj) const override NO_THREAD_SAFETY_ANALYSIS;
203 DCHECK(Contains(reinterpret_cast<mirror::Object*>(address))); in GetSlotIndexForAddress()
|
| D | dlmalloc_space-inl.h | 62 CHECK(Contains(result)) << "Allocation (" << reinterpret_cast<void*>(result) in AllocWithoutGrowthLocked()
|
| D | rosalloc_space-inl.h | 47 CHECK(Contains(result)) << "Allocation (" << reinterpret_cast<void*>(result) in AllocCommon()
|
| D | large_object_space.cc | 85 bool Contains(const mirror::Object* obj) const override { in Contains() function in art::gc::space::MemoryToolLargeObjectMapSpace
86 return LargeObjectMapSpace::Contains(ObjectWithRedzone(obj)); in Contains()
218 CHECK(Contains(ptrs[i])); in FreeList()
241 bool LargeObjectMapSpace::Contains(const mirror::Object* obj) const { in Contains() function in art::gc::space::LargeObjectMapSpace
424 DCHECK(Contains(obj)) << reinterpret_cast<void*>(Begin()) << " " << obj << " " in Free()
482 DCHECK(Contains(obj)); in AllocationSize()
|
| D | dlmalloc_space.cc | 187 CHECK(!kDebugSpaces || Contains(result)); in AllocWithGrowth()
230 CHECK(Contains(ptr)) << "Free (" << ptr << ") not in bounds of heap " << *this; in Free()
265 if (!Contains(ptrs[i])) { in FreeList()
|
| D | rosalloc_space.cc | 220 CHECK(!kDebugSpaces || result == nullptr || Contains(result)); in AllocWithGrowth()
263 CHECK(Contains(ptr)) << "Free (" << ptr << ") not in bounds of heap " << *this; in Free()
295 if (!Contains(ptrs[i])) { in FreeList()
|
| /art/libartbase/base/ |
| D | memory_type_table.h | 56 bool Contains(uintptr_t address) const { in Contains() function
106 DCHECK(ranges_[m].Contains(address)) in Lookup()
273 if (it != ranges_.end() && it->second.Contains(address)) { in Lookup()
|
| D | memory_type_table_test.cc | 34 EXPECT_FALSE(r.Contains(0x0fffu)); in TEST()
35 EXPECT_TRUE(r.Contains(0x1000u)); in TEST()
36 EXPECT_TRUE(r.Contains(0x1fffu)); in TEST()
37 EXPECT_FALSE(r.Contains(0x2000u)); in TEST()
|
| D | arena_allocator.cc | 313 bool ArenaAllocator::Contains(const void* ptr) const { in Contains() function in art::ArenaAllocator
318 if (cur_arena->Contains(ptr)) { in Contains()
|
| /art/libdexfile/dex/ |
| D | dex_file_layout.h | 76 bool Contains(uint32_t offset) const { in Contains() function
|
| /art/tools/veridex/ |
| D | hidden_api.cc | 40 if (sdk_uses_only != membership.Contains(hiddenapi::ApiList::Whitelist())) { in HiddenApi()
|