Searched refs:queue (Results 1 - 7 of 7) sorted by relevance

/art/runtime/gc/
H A Dreference_queue_test.cc31 Mutex lock("Reference queue lock");
32 ReferenceQueue queue(&lock);
33 ASSERT_TRUE(queue.IsEmpty());
35 ASSERT_EQ(queue.GetLength(), 0U);
45 queue.EnqueuePendingReference(ref1.Get());
46 ASSERT_TRUE(!queue.IsEmpty());
47 ASSERT_EQ(queue.GetLength(), 1U);
48 queue.EnqueuePendingReference(ref2.Get());
49 ASSERT_TRUE(!queue.IsEmpty());
50 ASSERT_EQ(queue
[all...]
/art/runtime/mirror/
H A Dreference-inl.h33 const Object* queue = GetFieldObject<mirror::Object>(QueueOffset()); local
35 return queue != nullptr && queue_next == nullptr;
/art/test/079-phantom/src/
H A DBitmap.java114 ReferenceQueue<PhantomWrapper> queue, int nativeDataPtr)
116 super(wrapper, queue);
130 BitmapWatcher(ReferenceQueue<PhantomWrapper> queue) { argument
131 mQueue = queue;
113 PhantomWrapper(Bitmap.NativeWrapper wrapper, ReferenceQueue<PhantomWrapper> queue, int nativeDataPtr) argument
/art/runtime/base/
H A Darena_containers.h21 #include <queue>
48 using ArenaQueue = std::queue<T, ArenaDeque<T>>;
H A Dscoped_arena_containers.h21 #include <queue>
47 using ScopedArenaQueue = std::queue<T, ScopedArenaDeque<T>>;
/art/runtime/
H A Dclass_linker.cc22 #include <queue>
202 // Adds largest aligned gaps to queue of gaps.
635 ArtField* queue = java_lang_ref_Reference->GetInstanceField(1); local
636 CHECK_STREQ(queue->GetName(), "queue");
637 CHECK_STREQ(queue->GetTypeDescriptor(), "Ljava/lang/ref/ReferenceQueue;");
731 // They are sorted lexicographically. Thus, the priority-queue must be a min-queue.
847 std::priority_queue<DexFileAndClassPair> queue; local
856 AddDexFilesFromOat(loaded_oat_file, true, &queue);
[all...]
/art/compiler/dex/
H A Dmir_graph.cc20 #include <queue>
1956 // Add entry block to the queue.
1988 // Loop head: it was already processed, mark end and copy exit blocks to the queue.

Completed in 153 milliseconds