| /frameworks/base/services/core/java/com/android/server/am/ |
| BroadcastRecord.java | 79 BroadcastQueue queue; // the outbound queue handling this broadcast field in class:BroadcastRecord
226 queue = _queue;
291 queue = from.queue;
|
| /frameworks/ml/nn/runtime/ |
| ExecutionPlan.cpp | 30 #include <queue>
858 auto& queue = perDeviceQueue[deviceIndex]; local
[all...] |
| /frameworks/native/libs/vr/libdvr/tests/ |
| dvr_display_manager-test.cpp | 133 DvrWriteBufferQueue* queue; local
136 metadata_size, &queue);
140 return {UniqueDvrWriteBufferQueue(queue)};
156 DvrReadBufferQueue* queue; local
158 display_manager_.get(), surface_id, queue_id, &queue);
162 return {UniqueDvrReadBufferQueue(queue)};
776 // Create a new queue in the surface.
812 // Verify that destroying the queue generates a surface update event.
819 // Verify that the queue ids reflect the change.
838 // Create a new queue in the surface
[all...] |
| /frameworks/support/media/api21/android/support/v4/media/session/ |
| MediaControllerCompatApi21.java | 84 List<MediaSession.QueueItem> queue = ((MediaController) controllerObj).getQueue(); local
85 if (queue == null) {
88 List<Object> queueObjs = new ArrayList<Object>(queue);
274 public void onQueueChanged(List<?> queue);
308 public void onQueueChanged(List<MediaSession.QueueItem> queue) {
309 mCallback.onQueueChanged(queue);
|
| /hardware/google/av/codec2/hidl/client/ |
| client.cpp | 368 // release input buffers potentially held by the component from queue
839 c2_status_t Codec2Client::Component::queue( function in class:android::Codec2Client::Component
852 ALOGI("duplicate input index %llu in queue", (long long)inputIndex);
864 ALOGE("queue -- bad input.");
867 Return<Status> transStatus = base()->queue(workBundle);
869 ALOGE("queue -- transaction failed.");
[all...] |
| /hardware/libhardware/modules/sensors/ |
| multihal.cpp | 134 SensorEventQueue* queue; member in struct:TaskContext
141 SensorEventQueue* queue = ctx->queue; local
146 if (queue->waitForSpace(&queue_mutex)) {
149 int bufferSize = queue->getWritableRegion(SENSOR_EVENT_QUEUE_CAPACITY, &buffer);
164 queue->markAsWritten(eventsPolled);
225 SensorEventQueue *queue = new SensorEventQueue(SENSOR_EVENT_QUEUE_CAPACITY); local
226 this->queues.push_back(queue);
230 taskContext->queue = queue;
371 SensorEventQueue* queue = this->queues.at(this->nextReadIndex); local
[all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| PriorityQueue.java | 31 * An unbounded priority {@linkplain Queue queue} based on a priority heap.
32 * The elements of the priority queue are ordered according to their
34 * provided at queue construction time, depending on which constructor is
35 * used. A priority queue does not permit {@code null} elements.
36 * A priority queue relying on natural ordering also does not permit
40 * <p>The <em>head</em> of this queue is the <em>least</em> element
43 * broken arbitrarily. The queue retrieval operations {@code poll},
45 * element at the head of the queue.
47 * <p>A priority queue is unbounded, but has an interna
97 transient Object[] queue; \/\/ non-private to simplify nested class access field in class:PriorityQueue
[all...] |
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedQueue.java | 44 import java.util.Queue;
54 * An unbounded thread-safe {@linkplain Queue queue} based on linked nodes.
55 * This queue orders elements FIFO (first-in-first-out).
56 * The <em>head</em> of the queue is that element that has been on the
57 * queue the longest time.
58 * The <em>tail</em> of the queue is that element that has been on the
59 * queue the shortest time. New elements
60 * are inserted at the tail of the queue, and the queue retrieva
817 final ConcurrentLinkedQueue<E> queue; field in class:ConcurrentLinkedQueue.CLQSpliterator
[all...] |
| LinkedBlockingQueue.java | 54 * An optionally-bounded {@linkplain BlockingQueue blocking queue} based on
56 * This queue orders elements FIFO (first-in-first-out).
57 * The <em>head</em> of the queue is that element that has been on the
58 * queue the longest time.
59 * The <em>tail</em> of the queue is that element that has been on the
60 * queue the shortest time. New elements
61 * are inserted at the tail of the queue, and the queue retrieval
62 * operations obtain elements at the head of the queue.
67 * way to prevent excessive queue expansion. The capacity, if unspecified
831 final LinkedBlockingQueue<E> queue; field in class:LinkedBlockingQueue.LBQSpliterator
[all...] |
| PriorityBlockingQueue.java | 45 import java.util.Queue;
57 * An unbounded {@linkplain BlockingQueue blocking queue} that uses
59 * blocking retrieval operations. While this queue is logically
62 * {@code null} elements. A priority queue relying on {@linkplain
106 * @param <E> the type of elements held in this queue
143 * Priority queue represented as a balanced binary heap: the two
144 * children of queue[n] are queue[2*n+1] and queue[2*(n+1)]. The
145 * priority queue is ordered by comparator, or by the elements
150 private transient Object[] queue; field in class:PriorityBlockingQueue
936 final PriorityBlockingQueue<E> queue; field in class:PriorityBlockingQueue.PBQSpliterator
[all...] |
| /prebuilts/misc/windows/sdl2/test/ |
| testatomic.c | 249 /* This is useful to test the impact of another thread locking the queue
297 static void InitEventQueue(SDL_EventQueue *queue)
302 SDL_AtomicSet(&queue->entries[i].sequence, i);
304 SDL_AtomicSet(&queue->enqueue_pos, 0);
305 SDL_AtomicSet(&queue->dequeue_pos, 0);
307 queue->lock = 0;
308 SDL_AtomicSet(&queue->rwcount, 0);
310 queue->active = SDL_TRUE;
313 static SDL_bool EnqueueEvent_LockFree(SDL_EventQueue *queue, const SDL_Event *event)
322 /* This is a gate so an external thread can lock the queue */
480 SDL_EventQueue *queue; member in struct:__anon472
490 SDL_EventQueue *queue; member in struct:__anon473
500 SDL_EventQueue *queue = data->queue; local
535 SDL_EventQueue *queue = data->queue; local
574 SDL_EventQueue *queue = (SDL_EventQueue *)_data; local
595 SDL_EventQueue queue; local
[all...] |
| /prebuilts/ndk/r16/sources/third_party/vulkan/src/layers/ |
| swapchain.h | 258 VkQueue queue; member in struct:SwpQueue
|
| /prebuilts/ndk/r16/sources/third_party/vulkan/src/tests/ |
| vktestbinding.cpp | 241 for (std::vector<Queue *>::iterator it = queues_[i].begin(); it != queues_[i].end(); it++)
317 VkQueue queue; local
322 vkGetDeviceQueue(handle(), i, j, &queue); local
325 queues_[GRAPHICS].push_back(new Queue(queue, i));
329 queues_[COMPUTE].push_back(new Queue(queue, i));
333 queues_[DMA].push_back(new Queue(queue, i));
384 void Queue::submit(const std::vector<const CommandBuffer *> &cmds, Fence &fence)
[all...] |
| /prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-cloudwatchmetrics/1.11.18/ |
| aws-java-sdk-cloudwatchmetrics-1.11.18.jar | |
| /system/bt/osi/src/ |
| alarm.cc | 102 fixed_queue_t* queue; // The processing queue to add this alarm to member in struct:alarm_t
138 // Default alarm callback thread and queue
147 fixed_queue_t* queue, bool for_msg_loop);
152 static void alarm_queue_ready(fixed_queue_t* queue, void* context);
158 // Registers |queue| for processing alarm callbacks on |thread|.
159 // |queue| may not be NULL. |thread| may not be NULL.
160 static void alarm_register_processing_queue(fixed_queue_t* queue,
232 fixed_queue_t* queue, bool for_msg_loop) {
241 alarm->queue = queue
[all...] |
| /system/bt/stack/rfcomm/ |
| port_int.h | 57 fixed_queue_t* queue; /* Queue of buffers waiting to be sent */ member in struct:__anon2507
60 uint32_t queue_size; /* Number of data bytes in the queue */
92 fixed_queue_t* cmd_q; /* Queue for command messages on this mux */
202 uint16_t rx_buf_critical; /* port receive queue critical watermark level */
|
| /test/vti/dashboard/src/main/java/com/android/vts/job/ |
| VtsAlertJobServlet.java | 44 import com.google.appengine.api.taskqueue.Queue;
225 * @param messages The email Message queue.
489 Queue queue = QueueFactory.getDefaultQueue(); local
491 queue.add(
|
| /cts/tests/tests/media/src/android/media/cts/ |
| MediaSessionTest.java | 191 List<QueueItem> queue = new ArrayList<>(); local
194 queue.add(item);
195 mSession.setQueue(queue);
206 assertEquals(queue.size(), mCallback.mQueue.size());
211 assertEquals(queue.size(), controller.getQueue().size());
619 public void onQueueChanged(List<QueueItem> queue) {
622 mQueue = queue;
|
| /frameworks/base/core/java/android/hardware/ |
| SystemSensorManager.java | 170 SensorEventQueue queue = mSensorListeners.get(listener); local
171 if (queue == null) {
177 queue = new SensorEventQueue(listener, looper, this, fullClassName);
178 if (!queue.addSensor(sensor, delayUs, maxBatchReportLatencyUs)) {
179 queue.dispose();
182 mSensorListeners.put(listener, queue);
185 return queue.addSensor(sensor, delayUs, maxBatchReportLatencyUs);
199 SensorEventQueue queue = mSensorListeners.get(listener); local
200 if (queue != null) {
203 result = queue.removeAllSensors()
231 TriggerEventQueue queue = mTriggerListeners.get(listener); local
258 TriggerEventQueue queue = mTriggerListeners.get(listener); local
280 SensorEventQueue queue = mSensorListeners.get(listener); local
[all...] |
| /external/ImageMagick/MagickCore/ |
| opencl.c | 611 % AcquireOpenCLCommandQueue() acquires an OpenCL command queue
626 queue;
636 queue=device->command_queues[device->command_queues_index--];
645 queue=openCL_library->clCreateCommandQueue(device->context,
648 return(queue);
625 queue; local
1409 queue; local
[all...] |
| /external/brotli/c/enc/ |
| backward_references_hq.c | 350 /* Maintains "ZopfliNode array invariant" and pushes node to the queue, if it
355 const ZopfliCostModel* model, StartPosQueue* queue, ZopfliNode* nodes) {
368 StartPosQueuePush(queue, &posdata);
379 StartPosQueue* queue, ZopfliNode* nodes) {
392 model, queue, nodes);
395 const PosData* posdata = StartPosQueueAt(queue, 0);
403 for (k = 0; k < max_iters && k < StartPosQueueSize(queue); ++k) {
404 const PosData* posdata = StartPosQueueAt(queue, k);
594 StartPosQueue queue; local
599 InitStartPosQueue(&queue);
640 StartPosQueue queue; local
[all...] |
| /external/clang/lib/Sema/ |
| SemaLookup.cpp | 156 SmallVector<DeclContext*, 4> queue; local
162 queue.push_back(NS);
166 if (queue.empty())
169 DC = queue.pop_back_val();
[all...] |
| /external/deqp/external/vulkancts/modules/vulkan/api/ |
| vktApiBufferViewAccessTests.cpp | 755 const VkQueue queue = m_context.getUniversalQueue(); local
770 VK_CHECK(vk.queueSubmit(queue, 1, &submitInfo, *m_fence));
787 VK_CHECK(vk.queueSubmit(queue, 1, &submitInfo, *m_fence));
[all...] |
| /external/deqp/external/vulkancts/modules/vulkan/draw/ |
| vktBasicDrawTests.cpp | 658 const vk::VkQueue queue = m_context.getUniversalQueue(); local
683 VK_CHECK(m_vk.queueSubmit(queue, 1, &submitInfo, DE_NULL));
699 VK_CHECK(m_vk.queueWaitIdle(queue));
702 const tcu::ConstPixelBufferAccess renderedFrame = m_colorTargetImage->readSurface(queue, m_context.getDefaultAllocator(),
756 const vk::VkQueue queue = m_context.getUniversalQueue(); local
811 VK_CHECK(m_vk.queueSubmit(queue, 1, &submitInfo, DE_NULL));
828 VK_CHECK(m_vk.queueWaitIdle(queue));
831 const tcu::ConstPixelBufferAccess renderedFrame = m_colorTargetImage->readSurface(queue, m_context.getDefaultAllocator(),
884 const vk::VkQueue queue = m_context.getUniversalQueue(); local
1049 const vk::VkQueue queue = m_context.getUniversalQueue(); local
[all...] |
| vktDrawInstancedTests.cpp | 436 const vk::VkQueue queue = m_context.getUniversalQueue(); local
576 VK_CHECK(m_vk.queueSubmit(queue, 1, &submitInfo, DE_NULL));
578 VK_CHECK(m_vk.queueWaitIdle(queue));
627 const tcu::ConstPixelBufferAccess renderedFrame = m_colorTargetImage->readSurface(queue, m_context.getDefaultAllocator(),
|
