Home
last modified time | relevance | path

Searched refs:queue (Results 1 – 12 of 12) sorted by relevance

/art/runtime/gc/
Dreference_queue_test.cc36 ReferenceQueue queue(&lock); in TEST_F() local
37 ASSERT_TRUE(queue.IsEmpty()); in TEST_F()
38 ASSERT_EQ(queue.GetLength(), 0U); in TEST_F()
47 queue.EnqueueReference(ref1.Get()); in TEST_F()
48 ASSERT_TRUE(!queue.IsEmpty()); in TEST_F()
49 ASSERT_EQ(queue.GetLength(), 1U); in TEST_F()
50 queue.EnqueueReference(ref2.Get()); in TEST_F()
51 ASSERT_TRUE(!queue.IsEmpty()); in TEST_F()
52 ASSERT_EQ(queue.GetLength(), 2U); in TEST_F()
56 dequeued.insert(queue.DequeuePendingReference().Ptr()); in TEST_F()
[all …]
/art/test/004-NativeAllocations/src-art/
DMain.java43 public static PhantomReference allocPhantom(ReferenceQueue<Object> queue) { in allocPhantom() argument
44 return new PhantomReference(new Object(), queue); in allocPhantom()
54 ReferenceQueue<Object> queue = new ReferenceQueue<Object>(); in checkRegisterNativeAllocation() local
55 ref = allocPhantom(queue); in checkRegisterNativeAllocation()
71 if (queue.remove(MAX_EXPECTED_GC_DURATION_MS) == null) { in checkRegisterNativeAllocation()
/art/test/079-phantom/src/
DBitmap.java121 ReferenceQueue<PhantomWrapper> queue, int nativeDataPtr) in PhantomWrapper() argument
123 super(wrapper, queue); in PhantomWrapper()
138 BitmapWatcher(ReferenceQueue<PhantomWrapper> queue) { in BitmapWatcher() argument
139 mQueue = queue; in BitmapWatcher()
/art/dexlayout/
Ddex_writer.cc710 void DexWriter::WriteMapItems(Stream* stream, MapItemQueue* queue) { in WriteMapItems() argument
712 const uint32_t map_list_size = queue->size(); in WriteMapItems()
714 while (!queue->empty()) { in WriteMapItems()
715 const MapItem& item = queue->top(); in WriteMapItems()
722 queue->pop(); in WriteMapItems()
727 MapItemQueue queue; in GenerateAndWriteMapItems() local
730 queue.AddIfNotEmpty(MapItem(DexFile::kDexTypeHeaderItem, 1, 0)); in GenerateAndWriteMapItems()
731 queue.AddIfNotEmpty(MapItem(DexFile::kDexTypeStringIdItem, in GenerateAndWriteMapItems()
734 queue.AddIfNotEmpty(MapItem(DexFile::kDexTypeTypeIdItem, in GenerateAndWriteMapItems()
737 queue.AddIfNotEmpty(MapItem(DexFile::kDexTypeProtoIdItem, in GenerateAndWriteMapItems()
[all …]
Ddex_writer.h261 void WriteMapItems(Stream* stream, MapItemQueue* queue);
/art/tools/dexanalyze/
Ddexanalyze_strings.cc249 T PopRealTop(Queue<T, Args...>& queue) { in PopRealTop() argument
250 auto pair = queue.top(); in PopRealTop()
251 queue.pop(); in PopRealTop()
255 queue.push(pair); in PopRealTop()
256 pair = queue.top(); in PopRealTop()
257 queue.pop(); in PopRealTop()
266 std::priority_queue<std::pair<int32_t, MatchTrie*>> queue; in ExtractPrefixes() local
280 queue.emplace(elem->Savings(), elem); in ExtractPrefixes()
285 while (max != 0u && !queue.empty()) { in ExtractPrefixes()
286 std::pair<int32_t, MatchTrie*> pair = PopRealTop(queue); in ExtractPrefixes()
/art/runtime/
Doat_file_manager.cc314 std::priority_queue<DexFileAndClassPair> queue; in CheckClassCollision() local
317 queue.emplace(dex_files_loaded[i], &loaded_types[i], /*from_loaded_oat=*/true); in CheckClassCollision()
322 queue.emplace(dex_files_unloaded[i], &unloaded_types[i], /*from_loaded_oat=*/false); in CheckClassCollision()
329 while (!queue.empty()) { in CheckClassCollision()
331 DexFileAndClassPair compare_pop(queue.top()); in CheckClassCollision()
332 queue.pop(); in CheckClassCollision()
335 while (!queue.empty()) { in CheckClassCollision()
336 DexFileAndClassPair top(queue.top()); in CheckClassCollision()
350 queue.pop(); in CheckClassCollision()
351 AddNext(top, queue); in CheckClassCollision()
[all …]
Dclass_linker.cc871 ArtField* queue = java_lang_ref_Reference->GetInstanceField(1); in FinishInit() local
872 CHECK_STREQ(queue->GetName(), "queue"); in FinishInit()
873 CHECK_STREQ(queue->GetTypeDescriptor(), "Ljava/lang/ref/ReferenceQueue;"); in FinishInit()
/art/tools/ahat/src/main/com/android/ahat/heapdump/
DAhatInstance.java727 Queue<Reference> queue = queues.get(reachability); in computeReachability() local
728 while (!queue.isEmpty()) { in computeReachability()
729 Reference ref = queue.poll(); in computeReachability()
740 queue.add(childRef); in computeReachability()
/art/libartbase/base/
Darena_containers.h53 using ArenaQueue = std::queue<T, ArenaDeque<T>>;
Dscoped_arena_containers.h49 using ScopedArenaQueue = std::queue<T, ScopedArenaDeque<T>>;
/art/runtime/verifier/
Dreg_type_test.cc957 std::queue<const RegType*> work_list; in TEST_F()