| /frameworks/base/core/java/android/os/ |
| Looper.java | 62 * based on MessageQueue. APIs that affect the state of the queue should be
64 * idle handlers and sync barriers are defined on the queue whereas preparing the
134 * Run the message queue in this thread. Be sure to call
142 final MessageQueue queue = me.mQueue; local
160 Message msg = queue.next(); // might block
162 // No message indicates that the message queue is quitting.
209 // Once we write a slow delivery log, suppress until the queue drains.
310 * more messages in the message queue.
312 * Any attempt to post messages to the queue after the looper is asked to quit will fail.
330 * in the message queue that are already due to be delivered have been handled
[all...] |
| ParcelFileDescriptor.java | 262 final MessageQueue queue = handler.getLooper().getQueue(); local
263 queue.addOnFileDescriptorEventListener(comm[1],
275 queue.removeOnFileDescriptorEventListener(fd);
[all...] |
| /frameworks/base/core/jni/ |
| android_view_InputQueue.cpp | 204 sp<InputQueue> queue = InputQueue::createQueue(queueWeak, messageQueue->getLooper()); local
205 if (!queue.get()) {
209 queue->incStrong(&gInputQueueClassInfo);
210 return reinterpret_cast<jlong>(queue.get());
214 sp<InputQueue> queue = reinterpret_cast<InputQueue*>(ptr); local
215 queue->detachLooper();
216 queue->decStrong(&gInputQueueClassInfo);
221 InputQueue* queue = reinterpret_cast<InputQueue*>(ptr); local
222 KeyEvent* event = queue->createKeyEvent();
225 queue->recycleInputEvent(event)
239 sp<InputQueue> queue = reinterpret_cast<InputQueue*>(ptr); local
[all...] |
| /frameworks/base/native/android/ |
| sensor.cpp | 58 if (queue == nullptr) { \
59 ERROR_INVALID_PARAMETER("queue cannot be NULL"); \
113 sp<SensorEventQueue> queue = local
115 if (queue != 0) {
116 ALooper_addFd(looper, queue->getFd(), ident, ALOOPER_EVENT_INPUT, callback, data);
117 queue->looper = looper;
118 queue->incStrong(manager);
120 return static_cast<ASensorEventQueue*>(queue.get());
123 int ASensorManager_destroyEventQueue(ASensorManager* manager, ASensorEventQueue* queue) {
127 sp<SensorEventQueue> q = static_cast<SensorEventQueue*>(queue);
[all...] |
| /frameworks/base/tests/touchlag/ |
| touchlag.cpp | 189 struct Queue {
195 Queue() : index(0) { }
251 Queue queue; local
277 queue.push(x, y);
278 queue.get(lag, &lag_x, &lag_y);
|
| /frameworks/base/tests/utils/testutils/java/android/os/test/ |
| TestLooper.java | 36 * Creates a looper whose message queue can be manipulated
95 MessageQueue queue = mLooper.getQueue(); local
96 return (Message) MESSAGE_QUEUE_MESSAGES_FIELD.get(queue);
127 // the queue.
155 * @return true if there are pending messages in the message queue
164 * @return the next message in the Looper's message queue or null if there is none
175 * Dispatch the next message in the queue
176 * Asserts that there is a message in the queue
188 * Dispatch all messages currently in the queue
|
| /frameworks/hardware/interfaces/sensorservice/libsensorndkbridge/ |
| ASensorManager.cpp | 161 sp<ASensorEventQueue> queue = local
164 ::android::hardware::setMinSchedulerPolicy(queue, SCHED_FIFO, 98);
168 queue, [&](const sp<IEventQueue> &queueImpl, auto tmpResult) {
174 queue->setImpl(queueImpl);
178 LOG(ERROR) << "FAILED to create event queue";
182 queue->incStrong(NULL /* id */);
184 LOG(VERBOSE) << "Returning event queue " << queue.get();
185 return queue.get();
188 void ASensorManager::destroyEventQueue(ASensorEventQueue *queue) {
[all...] |
| /frameworks/native/libs/vr/libbufferhubqueue/tests/ |
| buffer_hub_queue_producer-test.cpp | 98 auto queue = ProducerQueue::Create(config, UsagePolicy{}); local
99 ASSERT_TRUE(queue != nullptr);
101 mProducer = BufferHubProducer::Create(std::move(queue));
205 EXPECT_FALSE(value); // Can't run behind when we haven't touched the queue
252 // Queue the buffer back into the BQ
404 // queue the first buffer to enable max dequeued buffer count checking
498 // Shouldn't be able to queue buffer after disconnect.
534 // Dequeue, request, and queue all buffers.
545 // Dequeue, request, and queue all buffers.
|
| /frameworks/native/libs/vr/libvrflinger/ |
| display_surface.cpp | 164 std::shared_ptr<ConsumerQueue> queue; member in struct:android::dvr::State
171 state.surface->OnQueueEvent(state.queue, events);
224 "queue!");
234 "queue: %s",
253 // Always give the queue a chance to handle its internal bookkeeping.
256 // Check for hangup and remove a queue that is no longer needed.
258 ALOGD_IF(TRACE, "ApplicationDisplaySurface::OnQueueEvent: Removing queue.");
297 "queue!");
309 "queue: %s",
327 // Always give the queue a chance to handle its internal bookkeeping
[all...] |
| /hardware/google/av/codec2/hidl/1.0/utils/ |
| Component.cpp | 200 Return<Status> Component::queue(const WorkBundle& workBundle) { function in class:hardware::google::media::c2::V1_0::utils::Component
201 ALOGV("queue -- converting input");
206 ALOGV("queue -- corrupted");
209 ALOGV("queue -- calling");
|
| /libcore/metrictests/memory/host/src/libcore/heapmetrics/ |
| HeapCategorization.java | 31 import java.util.Queue;
294 Queue<AhatInstance> queue = new ArrayDeque<>(); local
296 queue.add(rooted);
297 while (!queue.isEmpty()) {
298 AhatInstance instance = queue.remove();
317 queue.add(reference);
|
| /libcore/ojluni/src/main/java/sun/nio/ch/ |
| EPollPort.java | 77 // queue of events for cases that a polling thread dequeues more than one
79 private final ArrayBlockingQueue<Event> queue; field in class:EPollPort
106 // create the queue and offer the special event to ensure that the first
108 this.queue = new ArrayBlockingQueue<Event>(MAX_EPOLL_EVENTS);
109 this.queue.offer(NEED_TO_POLL);
197 * corresponding channel in batch and queue n-1 so that
214 // queue special event if there are more events
217 queue.offer(EXECUTE_TASK_OR_SHUTDOWN);
231 queue.offer(ev);
244 queue.offer(NEED_TO_POLL)
[all...] |
| /packages/apps/UnifiedEmail/src/com/android/mail/browse/ |
| MessageAttachmentTile.java | 139 PriorityQueue<MessageAttachmentTile> queue = new PriorityQueue<MessageAttachmentTile>( local
143 queue.add(tile);
150 MessageAttachmentTile tile = queue.remove();
|
| /prebuilts/jdk/jdk8/darwin-x86/sample/jmx/jmx-scandir/test/com/sun/jmx/examples/scandir/ |
| DirectoryScannerTest.java | 98 final LinkedBlockingQueue<Notification> queue = local
105 queue.put(notification);
107 System.err.println("Failed to queue notif: "+x);
121 queue.poll(3000,TimeUnit.MILLISECONDS);
202 final BlockingQueue<Notification> queue =
208 queue.put(notification);
216 final Notification n = queue.poll(10,TimeUnit.SECONDS);
|
| /prebuilts/jdk/jdk8/linux-x86/sample/jmx/jmx-scandir/test/com/sun/jmx/examples/scandir/ |
| DirectoryScannerTest.java | 98 final LinkedBlockingQueue<Notification> queue = local
105 queue.put(notification);
107 System.err.println("Failed to queue notif: "+x);
121 queue.poll(3000,TimeUnit.MILLISECONDS);
202 final BlockingQueue<Notification> queue =
208 queue.put(notification);
216 final Notification n = queue.poll(10,TimeUnit.SECONDS);
|
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/util/ |
| huffman_codec.h | 23 #include <queue>
72 // The queue is sorted in ascending order by weight (or by node id if
78 queue(std::bind(&HuffmanCodec::LeftIsBigger, this,
82 // Put all leaves in the queue.
88 queue.push(node);
92 // and pushing the root of the new tree in the queue.
94 // We push a node at the end of each iteration, so the queue is never
97 assert(!queue.empty());
98 const uint32_t right = queue.top();
99 queue.pop()
182 std::queue<std::pair<uint32_t, std::string>> queue; local
359 std::queue<Context> queue; local
[all...] |
| /prebuilts/ndk/r16/sources/third_party/vulkan/src/layers/ |
| object_tracker.h | 67 // Track Queue information
70 VkQueue queue; member in struct:object_tracker::OT_QUEUE_INFO
112 // Map of queue information structures, one per queue
138 "Queue", // VK_DEBUG_REPORT_OBJECT_TYPE_QUEUE_EXT
|
| /system/core/storaged/include/ |
| storaged_diskstats.h | 39 uint64_t read_merges; // number of read I/Os merged with in-queue I/Os
43 uint64_t write_merges; // number of write I/Os merged with in-queue I/Os
110 uint32_t queue; // I/Os in queue member in struct:disk_perf
113 write_perf == 0 && write_ios == 0 && queue == 0;
152 std::queue<struct disk_perf> mBuffer;
158 stream_stats queue; // I/Os in queue member in struct:disk_stats_monitor::__anon2957
|
| /test/vti/dashboard/src/main/java/com/android/vts/job/ |
| VtsCoverageAlertJobServlet.java | 34 import com.google.appengine.api.taskqueue.Queue;
82 * @param messages The email Message queue.
273 Queue queue = QueueFactory.getDefaultQueue(); local
275 queue.add(
|
| /tools/tradefederation/core/src/com/android/tradefed/util/sl4a/ |
| Sl4aEventDispatcher.java | 31 * Event dispatcher polls for event and queue them by name to be queried.
83 LinkedList<EventSl4aObject> queue = new LinkedList<>(); local
84 queue.add(event);
85 mEventQueue.put(event.getName(), queue); local
|
| /tools/tradefederation/core/tests/src/com/android/tradefed/util/ |
| ConditionPriorityBlockingQueueTest.java | 42 * Test {@link ConditionPriorityBlockingQueue#poll()} when queue is empty.
49 * Test {@link ConditionPriorityBlockingQueue#take()} when a single object is in queue.
59 * Test {@link ConditionPriorityBlockingQueue#take()} when multiple objects are in queue, and
211 * Test {@link ConditionPriorityBlockingQueue#poll(IMatcher)} when queue is empty.
218 * Test {@link ConditionPriorityBlockingQueue#poll(long, TimeUnit, IMatcher)} when queue is
280 * Test behavior when queue is modified during iteration
284 final ConditionPriorityBlockingQueue<Integer> queue = local
287 queue.add(i);
294 for (@SuppressWarnings("unused") Integer i : queue) {
305 queue.add(i)
[all...] |
| /libcore/luni/src/test/java/libcore/java/util/ |
| CollectionsTest.java | 40 import java.util.Queue;
430 Queue queue = checkedQueue(new LinkedBlockingDeque<>(2), CharSequence.class); local
431 assertQueueEmpty(queue);
435 assertTrue(queue.add(firstElement));
436 assertFalse(queue.isEmpty());
437 assertTrue(queue.add("second element"));
438 assertEquals(2, queue.size());
440 assertFalse(queue.offer("third element")); // queue is at capacit
[all...] |
| /cts/tests/tests/os/src/android/os/cts/ |
| MessageQueueTest.java | 130 // Queue should initially be idle.
154 // The first message is blocked so the second should still be in the queue.
155 // At this point the queue will not be idle because there is a pending message.
158 // Let the first message complete and wait for the second to leave the queue.
159 // At this point the queue will be idle because it is empty.
192 * Use MessageQueue, send message at front of queue.
221 MessageQueue queue = Looper.getMainLooper().getQueue(); local
223 queue.addOnFileDescriptorEventListener(null, 0,
237 MessageQueue queue = Looper.getMainLooper().getQueue(); local
242 queue.addOnFileDescriptorEventListener(reader.getFileDescriptor(), 0, null)
251 MessageQueue queue = Looper.getMainLooper().getQueue(); local
262 MessageQueue queue = Looper.getMainLooper().getQueue(); local
277 final MessageQueue queue = thread.getLooper().getQueue(); local
406 final MessageQueue queue = thread.getLooper().getQueue(); local
485 final MessageQueue queue = thread.getLooper().getQueue(); local
574 final MessageQueue queue = thread.getLooper().getQueue(); local
662 final MessageQueue queue = thread.getLooper().getQueue(); local
764 MessageQueue queue = Looper.getMainLooper().getQueue(); local
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| MinMaxPriorityQueueTest.java | 53 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
55 assertEquals(11, queue.capacity());
56 checkUnbounded(queue);
57 checkNatural(queue);
61 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
64 assertEquals(11, queue.capacity());
65 checkUnbounded(queue);
66 assertSame(SOME_COMPARATOR, queue.comparator());
70 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
73 assertEquals(8, queue.capacity())
79 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
89 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
98 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
108 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
121 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
130 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
140 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
150 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
162 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue local
[all...] |
| /packages/apps/Car/LocalMediaPlayer/src/com/android/car/media/localmediaplayer/ |
| Player.java | 235 List<QueueItem> queue = new ArrayList<>(); local
247 foundIdx = queue.size();
258 queue.add(new QueueItem(description, song.queueId));
261 if (queue.isEmpty()) {
265 mQueue = queue;
290 Log.e(TAG, "Restored queue, but couldn't resume playback.");
311 List<QueueItem> queue = mDataModel.getQueue(); local
314 for (QueueItem item : queue) {
327 mQueue = new ArrayList<>(queue);
438 // Keep looping around when we run off the end of our current queue
[all...] |
