| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_send/ |
| 9-1.c | 12 * The failure case chosen is an invalid message queue descriptor.
37 mqd_t queue; local
46 queue = mq_open(qname, O_CREAT | O_RDWR | O_NONBLOCK,
48 if (queue == (mqd_t) - 1) {
53 if (mq_send(queue + 1, msgptr, strlen(msgptr), 1) != -1) {
54 printf("mq_send() did not return -1 on invalid queue\n");
59 printf("errno was not set on invalid queue\n");
63 if (mq_receive(queue, msgrcd, BUFFER, &pri) != -1) {
73 if (mq_close(queue) != 0) {
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_timedsend/ |
| 1-1.c | 37 mqd_t queue; local
46 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
47 if (queue == (mqd_t) - 1) {
54 if (mq_timedsend(queue, msgptr, strlen(msgptr), 1, &ts) != 0) {
59 if (mq_receive(queue, msgrcd, BUFFER, &pri) == -1) {
69 if (mq_close(queue) != 0) {
|
| 10-1.c | 10 * Test that if O_NONBLOCK is set and the message queue is full, mq_timedsend()
38 mqd_t queue; local
45 queue = mq_open(qname, O_CREAT | O_RDWR | O_NONBLOCK,
47 if (queue == (mqd_t) - 1) {
56 if (mq_timedsend(queue, msgptr, strlen(msgptr), 1, &ts) == -1) {
66 if (mq_close(queue) != 0) {
77 printf("Test inconclusive: Couldn't fill message queue\n");
|
| 13-1.c | 39 mqd_t queue; local
44 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
45 if (queue == (mqd_t) - 1) {
53 if (mq_timedsend(queue, msgptr,
66 if (mq_close(queue) != 0) {
|
| 14-1.c | 38 mqd_t queue; local
50 queue =
52 if (queue == (mqd_t) - 1) {
58 if (mq_timedsend(queue, msgptr, strlen(msgptr), 1, &ts) != -1) {
68 if (mq_close(queue) != 0) {
|
| 19-1.c | 10 * Test that mq_timedsend() will return EINVAL if the message queue is
13 * Fill message queue until full and then call mq_timedsend with invalid
44 mqd_t queue; local
52 queue = mq_open(qname, O_CREAT | O_RDWR | O_NONBLOCK,
54 if (queue == (mqd_t) - 1) {
64 if (mq_timedsend(queue, msgptr, strlen(msgptr), 1, &ts)
72 printf("Test UNRESOLVED: Couldn't fill message queue\n");
73 mq_close(queue);
79 * Message queue is full -- call mq_timedsend() with invalid
81 * First, open message queue as blockin
[all...] |
| 2-1.c | 32 mqd_t queue; local
41 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
42 if (queue == (mqd_t) - 1) {
49 if (mq_timedsend(queue, msgptr, strlen(msgptr), 1, &ts) == 0) {
54 if (mq_close(queue) != 0) {
|
| 4-3.c | 38 mqd_t queue; local
47 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
48 if (queue == (mqd_t) - 1) {
55 if (mq_timedsend(queue, msgptr, strlen(msgptr), MQ_PRIO_MAX - 1, &ts)
61 if (mq_receive(queue, msgrcd, BUFFER, &pri) == -1) {
71 if (mq_close(queue) != 0) {
|
| 8-1.c | 37 mqd_t queue; local
46 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, &attr);
47 if (queue == (mqd_t) - 1) {
54 ret = mq_timedsend(queue, msgptr, strlen(msgptr), 1, &ts);
56 if (mq_receive(queue, msgrcd, BUFFER, &pri) == -1) {
67 if (mq_close(queue) != 0) {
|
| 9-1.c | 12 * The failure case chosen is an invalid message queue descriptor.
39 mqd_t queue; local
48 queue = mq_open(qname, O_CREAT | O_RDWR | O_NONBLOCK,
50 if (queue == (mqd_t) - 1) {
57 if (mq_timedsend(queue + 1, msgptr, strlen(msgptr), 1, &ts) != -1) {
58 printf("mq_timedsend() did not return -1 on invalid queue\n");
63 printf("errno was not set on invalid queue\n");
67 if (mq_receive(queue, msgrcd, BUFFER, &pri) != -1) {
77 if (mq_close(queue) != 0) {
|
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_scene_queue.c | 30 * Scene queue. We'll use two queues. One contains "full" scenes which
49 * A queue of scenes
58 /** Allocate a new scene queue */
62 struct lp_scene_queue *queue = CALLOC_STRUCT(lp_scene_queue); local
63 if (!queue)
66 queue->ring = util_ringbuffer_create( MAX_SCENE_QUEUE *
68 if (queue->ring == NULL)
71 return queue;
74 FREE(queue);
79 /** Delete a scene queue */
[all...] |
| /external/mesa3d/src/gallium/state_trackers/clover/core/ |
| queue.cpp | 23 #include "core/queue.hpp"
38 const command_queue *queue = (const command_queue *)data; local
41 queue->context().notify(buffer);
|
| /external/syslinux/gpxe/src/drivers/net/ath5k/ |
| ath5k_qcu.c | 24 Queue Control Unit, DFS Control Unit Functions
32 * Set properties for a transmit queue
53 * Initialize a transmit queue
58 unsigned int queue; local
61 /* We only use one queue */
62 queue = 0;
65 * Setup internal queue structure
88 * Set a transmit queue inactive
92 /* This queue will be skipped in further operations */
99 * Set DFS properties for a transmit queue on DC
105 const int queue = 0; local
[all...] |
| /external/tensorflow/tensorflow/compiler/xla/service/gpu/ |
| hlo_schedule.cc | 154 // 2. `queue` which contains all HLOs with no incoming edges.
156 // The sorting algorithm repeatedly pops the top from the queue and deletes
158 std::deque<const HloInstruction*> queue; local
162 queue.push_back(hlo);
171 while (!queue.empty()) {
172 const HloInstruction* x = queue.front();
173 queue.pop_front();
178 queue.push_back(y);
|
| /external/volley/src/test/java/com/android/volley/ |
| RequestQueueTest.java | 49 RequestQueue queue = new RequestQueue(new NoCache(), mMockNetwork, 0, mDelivery); local
61 queue.add(req1); // A
62 queue.add(req2); // B
63 queue.add(req3); // A
64 queue.cancelAll(tagA);
65 queue.add(req4); // A
|
| /frameworks/av/media/libstagefright/rtsp/ |
| AMPEG2TSAssembler.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/thread/ |
| ThreadBase.h | 39 WorkQueue& queue() { return mQueue; } function in class:android::uirenderer::ThreadBase
|
| /frameworks/base/test-runner/src/android/test/ |
| LoaderTestCase.java | 56 // The test thread blocks on this queue until the loader puts it's result in
57 final ArrayBlockingQueue<T> queue = new ArrayBlockingQueue<T>(1); local
60 // when it puts the result into the blocking queue
70 queue.add(data);
88 // Block on the queue waiting for the result of the load to be inserted
92 result = queue.take();
|
| /external/glide/library/src/main/java/com/bumptech/glide/ |
| ListPreloader.java | 11 import java.util.Queue;
147 private final Queue<PreloadTarget> queue; field in class:ListPreloader.PreloadTargetQueue
150 queue = Util.createQueue(size);
153 queue.offer(new PreloadTarget());
158 final PreloadTarget result = queue.poll();
159 queue.offer(result);
|
| /external/guava/guava-tests/benchmark/com/google/common/collect/ |
| MinMaxPriorityQueueBenchmark.java | 30 import java.util.Queue;
47 private Queue<Integer> queue; field in class:MinMaxPriorityQueueBenchmark
52 queue = heap.create(comparator.get());
54 queue.add(random.nextInt());
61 queue.add(queue.poll() ^ random.nextInt());
67 queue.clear();
70 queue.add(random.nextInt());
87 protected Queue<T> delegate()
[all...] |
| /libcore/luni/src/test/java/libcore/java/util/ |
| OldPriorityQueueTest.java | 28 PriorityQueue<Object> queue = new PriorityQueue<Object>(100); local
29 assertNotNull(queue);
30 assertEquals(0, queue.size());
31 assertNull(queue.comparator());
42 PriorityQueue<String> queue = new PriorityQueue<String>(10, local
46 queue.offer(array[i]);
48 assertFalse(queue.contains("BB"));
51 assertFalse(queue.remove("BB"));
52 assertTrue(queue.remove("AA"));
|
| /libcore/ojluni/src/main/java/java/lang/ref/ |
| ReferenceQueue.java | 41 // when a reference has been enqueued and removed from its queue.
44 // NOTE: This implementation of ReferenceQueue is FIFO (queue-like) whereas
52 * Constructs a new reference-object queue.
57 * Enqueue the given reference onto this queue.
58 * The caller is responsible for ensuring the lock is held on this queue,
59 * and for calling notifyAll on this queue after the reference has been
72 // of enqueueing it in the queue. Cleaners are associated with dummy queues that
78 // enqueued, but is now removed from the queue.
95 * removed from the queue, assuming this is the reference object's queue
220 ReferenceQueue queue = list.queue; local
[all...] |
| /art/test/004-NativeAllocations/src-art/ |
| Main.java | 42 public static PhantomReference allocPhantom(ReferenceQueue<Object> queue) {
43 return new PhantomReference(new Object(), queue);
54 ReferenceQueue<Object> queue = new ReferenceQueue<Object>(); local
55 ref = allocPhantom(queue);
71 if (queue.remove(maxExpectedGcDurationMs) == null) {
|
| /external/autotest/site_utils/ |
| metadata_reporter.py | 12 import Queue
28 # Number of seconds to wait before checking queue again for uploading data.
39 # Queue to buffer metadata to be reported.
40 metadata_queue = Queue.Queue(_MAX_METADATA_QUEUE_SIZE)
55 def queue(data): function
56 """Queue metadata to be uploaded in reporter thread.
58 If the queue is full, an error will be logged for the first time the queue
59 becomes full. The call does not wait or raise Queue.Full exception, s
[all...] |
| /external/deqp/external/vulkancts/modules/vulkan/protected_memory/ |
| vktProtectedMemImageValidator.cpp | 136 const vk::VkQueue queue = ctx.getQueue(); local
225 VK_CHECK(queueSubmit(ctx, PROTECTION_ENABLED, queue, *resetCmdBuffer, *fence, ~0ull));
243 queueSubmitResult = queueSubmit(ctx, PROTECTION_ENABLED, queue, *cmdBuffer, *fence, oneSec);
|
