Searched refs:queue (Results 1 - 7 of 7) sorted by relevance
/art/runtime/gc/ |
H A D | reference_queue_test.cc | 34 Mutex lock("Reference queue lock"); 35 ReferenceQueue queue(&lock); 36 ASSERT_TRUE(queue.IsEmpty()); 37 ASSERT_EQ(queue.GetLength(), 0U); 46 queue.EnqueueReference(ref1.Get()); 47 ASSERT_TRUE(!queue.IsEmpty()); 48 ASSERT_EQ(queue.GetLength(), 1U); 49 queue.EnqueueReference(ref2.Get()); 50 ASSERT_TRUE(!queue.IsEmpty()); 51 ASSERT_EQ(queue [all...] |
/art/test/079-phantom/src/ |
H A D | Bitmap.java | 114 ReferenceQueue<PhantomWrapper> queue, int nativeDataPtr) 116 super(wrapper, queue); 129 BitmapWatcher(ReferenceQueue<PhantomWrapper> queue) { argument 130 mQueue = queue; 113 PhantomWrapper(Bitmap.NativeWrapper wrapper, ReferenceQueue<PhantomWrapper> queue, int nativeDataPtr) argument
|
/art/dexlayout/ |
H A D | dex_writer.cc | 21 #include <queue> 530 std::priority_queue<MapItemContainer> queue; local 533 queue.push(MapItemContainer(DexFile::kDexTypeHeaderItem, 1, 0)); 535 queue.push(MapItemContainer(DexFile::kDexTypeStringIdItem, collection.StringIdsSize(), 539 queue.push(MapItemContainer(DexFile::kDexTypeTypeIdItem, collection.TypeIdsSize(), 543 queue.push(MapItemContainer(DexFile::kDexTypeProtoIdItem, collection.ProtoIdsSize(), 547 queue.push(MapItemContainer(DexFile::kDexTypeFieldIdItem, collection.FieldIdsSize(), 551 queue.push(MapItemContainer(DexFile::kDexTypeMethodIdItem, collection.MethodIdsSize(), 555 queue.push(MapItemContainer(DexFile::kDexTypeClassDefItem, collection.ClassDefsSize(), 559 queue [all...] |
/art/runtime/ |
H A D | oat_file_manager.cc | 20 #include <queue> 208 // They are sorted lexicographically. Thus, the priority-queue must be a min-queue. 475 // Populate the queue of dex file and class pairs with the loaded and unloaded dex files. 476 std::priority_queue<DexFileAndClassPair> queue; local 479 queue.emplace(dex_files_loaded[i], &loaded_types[i], /*from_loaded_oat*/true); 484 queue.emplace(dex_files_unloaded[i], &unloaded_types[i], /*from_loaded_oat*/false); 488 // Now drain the queue. 491 while (!queue.empty()) { 493 DexFileAndClassPair compare_pop(queue [all...] |
H A D | class_linker.cc | 24 #include <queue> 284 // Note that the priority queue returns the largest element, so operator() 291 // Adds largest aligned gaps to queue of gaps. 782 ArtField* queue = java_lang_ref_Reference->GetInstanceField(1); local 783 CHECK_STREQ(queue->GetName(), "queue"); 784 CHECK_STREQ(queue->GetTypeDescriptor(), "Ljava/lang/ref/ReferenceQueue;");
|
/art/runtime/base/ |
H A D | arena_containers.h | 21 #include <queue> 53 using ArenaQueue = std::queue<T, ArenaDeque<T>>;
|
H A D | scoped_arena_containers.h | 21 #include <queue> 49 using ScopedArenaQueue = std::queue<T, ScopedArenaDeque<T>>;
|
Completed in 195 milliseconds