| /external/deqp/external/vulkancts/modules/vulkan/synchronization/ |
| vktSynchronizationBasicFenceTests.cpp | 47 const VkQueue queue = context.getUniversalQueue(); local
83 VK_CHECK(vk.queueSubmit(queue, 1u, &submitInfo, *fence));
105 const VkQueue queue = context.getUniversalQueue(); local
141 VK_CHECK(vk.queueSubmit(queue, 1u, &submitInfo, fence[FISRT_FENCE]));
149 VK_CHECK(vk.queueSubmit(queue, 1u, &submitInfo, fence[FISRT_FENCE]));
154 VK_CHECK(vk.queueSubmit(queue, 1u, &submitInfo, fence[SECOND_FENCE]));
166 const VkQueue queue = context.getUniversalQueue(); local
175 VK_CHECK(vk.queueSubmit(queue, 0u, DE_NULL, *fence));
190 addFunctionCase(basicFenceTests.get(), "empty_submit", "Signal a fence after an empty queue submission", emptySubmitCase);
|
| /external/fio/engines/ |
| fusion-aw.c | 37 static int queue(struct thread_data *td, struct io_u *io_u) function
168 .queue = queue,
|
| /external/ims/rcs/presencepolling/src/com/android/service/ims/presence/ |
| AlarmBroadcastReceiver.java | 63 PollingsQueue queue = PollingsQueue.getInstance(null); local
64 if (queue != null) {
66 queue.retry(id);
|
| /external/libnl/src/ |
| nf-queue.c | 2 * src/nf-queue.c Monitor netfilter queue events
20 #include <netlink/netfilter/queue.h>
27 struct nfnl_queue *queue; local
29 queue = nfnl_queue_alloc();
30 if (!queue)
31 nl_cli_fatal(ENOMEM, "Unable to allocate queue object");
33 return queue;
64 struct nfnl_queue *queue; local
78 printf("Usage: nf-queue family group [ copy_mode ]
[all...] |
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_close/ |
| 2-1.c | 13 3. Create and open message queue, set up notification, sends command
14 4. Child opens message queue and tries to set up notification, sends command
15 5. Parent closes the queue, sends command
97 mqd_t queue; local
102 queue = open_queue(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR);
103 if (queue == (mqd_t) - 1) {
110 if (mq_notify(queue, &se)) {
112 mq_close(queue);
119 mq_close(queue);
126 mq_close(queue);
157 mqd_t queue; local
206 mqd_t queue; local
[all...] |
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_open/ |
| 2-1.c | 11 * calling the message queue with that name will refer to the same
12 * message queue object.
14 * Test by creating a message queue and placing a message within it. Then,
15 * in another process open the first message queue and ensure the message
102 mqd_t queue; local
108 queue = mq_open(qname, O_CREAT | O_RDWR,
110 if (queue == (mqd_t) - 1) {
118 if (mq_send(queue, msgptr, strlen(msgptr) + 1, 1) != 0) {
121 /* close queue, stop child and exit */
122 mq_close(queue);
[all...] |
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_send/ |
| 7-1.c | 10 * Test that if O_NONBLOCK is set and the message queue is full, mq_send()
44 mqd_t queue; local
53 queue = mq_open(qname, O_CREAT | O_RDWR | O_NONBLOCK,
55 if (queue == (mqd_t) - 1) {
62 if (mq_send(queue, msgptr, strlen(msgptr), spri++) == -1) {
72 if (mq_receive(queue, msgrcd, BUFFER, &pri) == -1) {
82 if (mq_close(queue) != 0) {
93 printf("Test inconclusive: Couldn't fill message queue\n");
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_timedsend/ |
| 7-1.c | 10 * Test that if O_NONBLOCK is set and the message queue is full, mq_timedsend()
46 mqd_t queue; local
54 queue = mq_open(qname, O_CREAT | O_RDWR | O_NONBLOCK,
56 if (queue == (mqd_t) - 1) {
66 if (mq_timedsend(queue, msgptr, strlen(msgptr), spri++, &ts)
77 if (mq_receive(queue, msgrcd, BUFFER, &pri) == -1) {
87 if (mq_close(queue) != 0) {
98 printf("Test inconclusive: Couldn't fill message queue\n");
|
| /external/python/cpython3/Lib/ |
| sched.py | 3 Each instance of this class manages its own queue.
13 function is allowed to modify the queue. Time can be expressed as
18 way the queue can be maintained as a priority queue. Execution of the
69 """Enter a new event in the queue at an absolute time.
92 """Remove an event from the queue.
95 If the event is not in the queue, this raises ValueError.
103 """Check whether the queue is empty."""
108 """Execute events until the queue is empty.
114 delay function is called and the event is left in the queue;
158 def queue(self): member in class:scheduler
[all...] |
| /external/tensorflow/tensorflow/python/training/ |
| queue_runner_impl.py | 35 """Holds a list of enqueue operations for a queue, each to be run in a thread.
39 Reader' setup one set of threads generates filenames in a queue; a second set
41 on a second queue; a third set of threads dequeues these input records to
56 def __init__(self, queue=None, enqueue_ops=None, close_op=None,
61 On construction the `QueueRunner` adds an op to close the queue. That op
68 `queue`.
71 queue: A `Queue`.
73 close_op: Op to close the queue. Pending enqueue ops are preserved.
74 cancel_op: Op to close the queue and cancel pending enqueue ops
190 def queue(self): member in class:QueueRunner
[all...] |
| /frameworks/av/media/libstagefright/rtsp/ |
| ARTPSource.h | 44 List<sp<ABuffer> > *queue() { return &mQueue; } function in struct:android::ARTPSource
|
| ARawAudioAssembler.cpp | 55 List<sp<ABuffer> > *queue = source->queue(); local
57 if (queue->empty()) {
62 List<sp<ABuffer> >::iterator it = queue->begin();
63 while (it != queue->end()) {
68 it = queue->erase(it);
71 if (queue->empty()) {
76 sp<ABuffer> buffer = *queue->begin();
90 queue->erase(queue->begin())
[all...] |
| /frameworks/base/libs/hwui/tests/unit/ |
| ThreadBaseTests.cpp | 39 static WorkQueue& queue() { function
40 return thread().queue();
45 queue().post([&ran]() { ran = true; });
57 queue().postDelayed(100_us, [&]() { ranAtPromise.set_value(clock::now()); });
67 auto result = queue().runSync([&otherTid]() -> auto {
80 auto otherTid = queue().async([]() -> auto { return gettid(); });
81 auto otherPid = queue().async([]() -> auto { return getpid(); });
82 auto result = queue().async([]() -> auto { return 42; });
132 queue().runSync([c = std::move(counter)](){});
141 return queue().runSync([t = test]()->int { return t->getStrongCount(); })
[all...] |
| /prebuilts/go/darwin-x86/src/regexp/ |
| exec.go | 12 // A queue is a 'sparse array' holding pending threads of execution.
14 type queue struct { type
19 // An entry is an entry on a queue.
21 // Some queue entries are just place holders so that the machine
43 q0, q1 queue // two queues for runq, nextq
75 m.q0 = queue{make([]uint32, n), make([]entry, 0, n)}
76 m.q1 = queue{make([]uint32, n), make([]entry, 0, n)}
183 // clear frees all threads on the thread queue.
184 func (m *machine) clear(q *queue) {
198 func (m *machine) step(runq, nextq *queue, pos, nextPos int, c rune, nextCond syntax.EmptyOp)
[all...] |
| /prebuilts/go/linux-x86/src/regexp/ |
| exec.go | 12 // A queue is a 'sparse array' holding pending threads of execution.
14 type queue struct { type
19 // An entry is an entry on a queue.
21 // Some queue entries are just place holders so that the machine
43 q0, q1 queue // two queues for runq, nextq
75 m.q0 = queue{make([]uint32, n), make([]entry, 0, n)}
76 m.q1 = queue{make([]uint32, n), make([]entry, 0, n)}
183 // clear frees all threads on the thread queue.
184 func (m *machine) clear(q *queue) {
198 func (m *machine) step(runq, nextq *queue, pos, nextPos int, c rune, nextCond syntax.EmptyOp)
[all...] |
| /system/bt/osi/test/ |
| fixed_queue_test.cc | 39 // Function for performing dequeue operations from the queue when is ready
40 static void fixed_queue_ready(fixed_queue_t* queue, UNUSED_ATTR void* context) {
41 void* msg = fixed_queue_try_dequeue(queue);
55 fixed_queue_t* queue; local
57 // Test a corner case: queue of size 0
58 queue = fixed_queue_new(0);
59 EXPECT_TRUE(queue != NULL);
60 fixed_queue_free(queue, NULL);
62 // Test a corner case: queue of size 1
63 queue = fixed_queue_new(1)
83 fixed_queue_t* queue; local
125 fixed_queue_t* queue; local
147 fixed_queue_t* queue; local
169 fixed_queue_t* queue; local
197 fixed_queue_t* queue = fixed_queue_new(TEST_QUEUE_SIZE); local
234 fixed_queue_t* queue = fixed_queue_new(TEST_QUEUE_SIZE); local
264 fixed_queue_t* queue = fixed_queue_new(TEST_QUEUE_SIZE); local
295 fixed_queue_t* queue = fixed_queue_new(TEST_QUEUE_SIZE); local
[all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| PriorityQueueTest.java | 198 PriorityQueue<Object> queue = new PriorityQueue<Object>(); local
199 assertNotNull(queue);
200 assertEquals(0, queue.size());
201 assertNull(queue.comparator());
208 PriorityQueue<Object> queue = new PriorityQueue<Object>(100); local
209 assertNotNull(queue);
210 assertEquals(0, queue.size());
211 assertNull(queue.comparator());
218 PriorityQueue<Object> queue = new PriorityQueue<Object>(100, local
220 assertNotNull(queue);
318 PriorityQueue<String> queue = new PriorityQueue<String>(4, local
342 PriorityQueue<Integer> queue = new PriorityQueue<Integer>(c); local
393 PriorityQueue<Integer> queue = new PriorityQueue<Integer>(treeSet); local
416 PriorityQueue<String> queue = new PriorityQueue<String>(10, local
434 PriorityQueue<Object> queue = new PriorityQueue<Object>(); local
447 PriorityQueue<Object> queue = new PriorityQueue<Object>(); local
487 PriorityQueue<Object> queue = new PriorityQueue<Object>(); local
510 PriorityQueue<Object> queue = new PriorityQueue<Object>(); local
550 PriorityQueue<Object> queue = new PriorityQueue<Object>(); local
563 PriorityQueue<Object> queue = new PriorityQueue<Object>(); local
602 PriorityQueue<String> queue = new PriorityQueue<String>(10, local
653 PriorityQueue<Object> queue = new PriorityQueue<Object>(); local
663 PriorityQueue<Object> queue = new PriorityQueue<Object>(); local
[all...] |
| /device/google/cuttlefish_common/common/vsoc/shm/ |
| socket_forward_layout.h | 36 // If both are closed then the queue goes back to INACTIVE
42 struct Queue {
46 CircularPacketQueue<16, kMaxPacketSize> queue; member in struct:vsoc::layout::socket_forward::Queue
51 return queue.Recover();
54 ASSERT_SHM_COMPATIBLE(Queue);
57 static constexpr size_t layout_size = 2 * Queue::layout_size + 8;
60 Queue host_to_guest;
62 Queue guest_to_host;
|
| /external/apache-http/src/org/apache/commons/logging/impl/ |
| WeakHashtable.java | 130 private ReferenceQueue queue = new ReferenceQueue(); field in class:WeakHashtable
246 Referenced keyRef = new Referenced(key, queue);
326 synchronized (queue) {
328 while ((key = (WeakKey) queue.poll()) != null) {
340 synchronized (queue) {
341 WeakKey key = (WeakKey) queue.poll();
415 private Referenced(Object key, ReferenceQueue queue) {
416 reference = new WeakKey(key, queue, this);
473 ReferenceQueue queue,
475 super(key, queue);
[all...] |
| /external/deqp/external/vulkancts/modules/vulkan/draw/ |
| vktDrawSimpleTest.cpp | 112 const vk::VkQueue queue = m_context.getUniversalQueue(); local
162 VK_CHECK(m_vk.queueSubmit(queue, 1, &submitInfo, DE_NULL));
164 VK_CHECK(m_vk.queueWaitIdle(queue));
195 const tcu::ConstPixelBufferAccess renderedFrame = m_colorTargetImage->readSurface(queue, m_context.getDefaultAllocator(),
217 const vk::VkQueue queue = m_context.getUniversalQueue(); local
268 VK_CHECK(m_vk.queueSubmit(queue, 1, &submitInfo, DE_NULL));
270 VK_CHECK(m_vk.queueWaitIdle(queue));
273 VK_CHECK(m_vk.queueWaitIdle(queue));
303 const tcu::ConstPixelBufferAccess renderedFrame = m_colorTargetImage->readSurface(queue, m_context.getDefaultAllocator(),
|
| /external/deqp/external/vulkancts/modules/vulkan/dynamic_state/ |
| vktDynamicStateCBTests.cpp | 90 const vk::VkQueue queue = m_context.getUniversalQueue(); local
124 m_vk.queueSubmit(queue, 1, &submitInfo, DE_NULL);
125 VK_CHECK(m_vk.queueWaitIdle(queue));
151 const tcu::ConstPixelBufferAccess renderedFrame = m_colorTargetImage->readSurface(queue, m_context.getDefaultAllocator(),
|
| vktDynamicStateGeneralTests.cpp | 73 const vk::VkQueue queue = m_context.getUniversalQueue(); local
115 m_vk.queueSubmit(queue, 1, &submitInfo, DE_NULL);
118 VK_CHECK(m_vk.queueWaitIdle(queue));
143 const tcu::ConstPixelBufferAccess renderedFrame = m_colorTargetImage->readSurface(queue, m_context.getDefaultAllocator(),
178 const vk::VkQueue queue = m_context.getUniversalQueue(); local
225 m_vk.queueSubmit(queue, 1, &submitInfo, DE_NULL);
228 VK_CHECK(m_vk.queueWaitIdle(queue));
253 const tcu::ConstPixelBufferAccess renderedFrame = m_colorTargetImage->readSurface(queue, m_context.getDefaultAllocator(),
329 const vk::VkQueue queue = m_context.getUniversalQueue(); local
375 m_vk.queueSubmit(queue, 1, &submitInfo, DE_NULL)
[all...] |
| /external/deqp/external/vulkancts/modules/vulkan/protected_memory/ |
| vktProtectedMemAttachmentLoadTests.cpp | 117 const vk::VkQueue queue = ctx.getQueue(); local
216 VK_CHECK(queueSubmit(ctx, PROTECTION_ENABLED, queue, *cmdBuffer, *fence, ~0ull));
|
| /external/deqp/external/vulkancts/modules/vulkan/sparse_resources/ |
| vktSparseResourcesBase.cpp | 64 typedef std::map<vk::VkQueueFlags, std::vector<Queue> > QueuesMap;
108 TCU_THROW(ResourceError, "Device reports an empty set of queue family properties");
116 TCU_THROW(ResourceError, "Device reports an empty set of queue family properties");
133 TCU_THROW(NotSupportedError, "No match found for queue requirements");
141 Queue queue; local
142 queue.queueFamilyIndex = queueFamilyIndex;
143 queue.queueIndex = queueNdx;
145 m_queues[queueRequirement.queueFlags].push_back(queue);
197 Queue& queue = queuesIter->second[queueNdx] local
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| Queues.java | 24 import java.util.Queue;
35 * Static utility methods pertaining to {@link Queue} and {@link Deque} instances.
98 ConcurrentLinkedQueue<E> queue = new ConcurrentLinkedQueue<E>(); local
99 Iterables.addAll(queue, elements);
100 return queue;
163 * @param elements the elements that the queue should contain, in order
170 LinkedBlockingQueue<E> queue = new LinkedBlockingQueue<E>(); local
171 Iterables.addAll(queue, elements);
172 return queue;
193 * this priority queue will be ordered according to the same ordering
202 PriorityBlockingQueue<E> queue = new PriorityBlockingQueue<E>(); local
232 PriorityQueue<E> queue = new PriorityQueue<E>(); local
[all...] |
