| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_open/ |
| 21-1.c | 14 * queue does not exist.
32 mqd_t queue; local
36 queue = mq_open(qname, O_RDWR, S_IRUSR | S_IWUSR, NULL);
37 if (queue != (mqd_t) - 1) {
39 mq_close(queue);
|
| 27-1.c | 28 mqd_t queue; local
33 /* Ensures queue name will have > PATH_MAX chars */
37 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
38 if (queue != (mqd_t) - 1) {
39 printf("mq_open() should have failed with queue name %s\n",
42 mq_close(queue);
|
| 27-2.c | 31 mqd_t queue; local
36 /* Ensures queue name will have > NAME_MAX chars */
40 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
41 if (queue != (mqd_t) - 1) {
42 printf("mq_open() should have failed with queue name %s\n",
45 mq_close(queue);
|
| 29-1.c | 10 * Test that mq_open() fails with ENOENT if the named message queue does
29 mqd_t queue; local
33 queue = mq_open(qname, O_RDWR, S_IRUSR | S_IWUSR, NULL);
34 if (queue != (mqd_t) - 1) {
37 mq_close(queue);
45 mq_close(queue);
|
| 3-1.c | 11 * name does not refer to an already existing message queue.
28 mqd_t queue; local
32 queue = mq_open(qname, O_RDWR, S_IRUSR | S_IWUSR, NULL);
33 if (queue != (mqd_t) - 1) {
36 mq_close(queue);
|
| 12-1.c | 34 mqd_t queue; local
39 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
40 if (queue == (mqd_t) - 1) {
46 if (mq_getattr(queue, &attr) != 0) {
49 mq_close(queue);
54 mq_close(queue);
|
| 15-1.c | 10 * Test that if O_EXCL and O_CREAT are set and message queue name already
28 mqd_t queue, queue2; local
32 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
33 if (queue == (mqd_t) - 1) {
40 * Open queue qname again with O_CREAT and O_EXCL set
46 printf("O_EXCL on an already opened queue.\n");
48 mq_close(queue);
54 mq_close(queue);
|
| 23-1.c | 11 * but the message queue already exists.
29 mqd_t queue, queue2; local
33 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
34 if (queue == (mqd_t) - 1) {
41 * Open queue qname again with O_CREAT and O_EXCL set
47 printf("O_EXCL on an already opened queue.\n");
49 mq_close(queue);
61 mq_close(queue);
69 mq_close(queue);
|
| 1-1.c | 31 mqd_t queue; local
36 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
37 if (queue == (mqd_t) - 1) {
43 if (mq_send(queue, msgptr, strlen(msgptr), 1) != 0) {
48 mq_close(queue);
|
| 11-1.c | 11 * a currently existing message queue, then the current call has no effect.
34 mqd_t queue, queue2; local
38 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
39 if (queue == (mqd_t) - 1) {
45 if (mq_send(queue, msgptr, strlen(msgptr), 1) != 0) {
48 mq_close(queue);
60 mq_close(queue);
68 mq_close(queue);
74 mq_close(queue);
|
| 18-1.c | 30 mqd_t queue; local
34 queue = mq_open(qname, O_CREAT | O_RDWR | O_NONBLOCK,
36 if (queue == (mqd_t) - 1) {
42 if (mq_send(queue, msgptr, strlen(msgptr), 1) != 0) {
45 /* close queue and exit */
46 mq_close(queue);
51 mq_close(queue);
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_open/speculative/ |
| 2-2.c | 28 mqd_t queue; local
32 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
33 if (queue == (mqd_t) - 1) {
35 printf("message queue names that do not start with /.\n");
39 mq_close(queue);
42 printf("This implementation may support message queue\n");
|
| 2-3.c | 10 * Test that if there are two /s in a message queue name, the behavior
28 mqd_t queue; local
32 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
33 if (queue == (mqd_t) - 1) {
35 printf("message queue names with two /s in them.\n");
39 mq_close(queue);
42 printf("This implementation may support message queue\n");
|
| 6-1.c | 32 mqd_t queue; local
36 queue = mq_open(qname, O_CREAT | O_RDWR | O_WRONLY,
38 if (queue != (mqd_t) - 1) {
41 mq_close(queue);
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_close/ |
| 1-1.c | 10 * mq_close test case that attempts to open a new message queue,
11 * close the message queue and verify that mq_close returns 0.
28 mqd_t queue; local
32 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
33 if (queue == (mqd_t) - 1) {
38 if (mq_close(queue) != 0) {
|
| 3-1.c | 11 1. Create a new message queue
12 2. Close the message queue, verify success
33 mqd_t queue; local
37 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
38 if (queue == (mqd_t) - 1) {
43 if (mq_close(queue) == -1) {
54 if (mq_close(queue) != -1) {
|
| 4-1.c | 10 Test that a closed message queue descriptor has been disassociated from
11 its message queue by attempting to set a notification on the descriptor
31 mqd_t queue; local
36 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
37 if (queue == (mqd_t) - 1) {
42 if (mq_close(queue) == -1) {
50 if (mq_notify(queue, &se) != -1) {
|
| /external/tensorflow/tensorflow/core/kernels/ |
| fifo_queue_op.cc | 38 // Defines a FIFOQueueOp, which produces a Queue (specifically, one
51 FIFOQueue* queue = new FIFOQueue(capacity_, component_types_, local
53 return CreateTypedQueue(queue, ret);
|
| padding_fifo_queue_op.cc | 39 // Defines a PaddingFIFOQueueOp, which produces a Queue (specifically, one
58 PaddingFIFOQueue* queue = new PaddingFIFOQueue( local
60 return CreateTypedQueue(queue, ret);
|
| priority_queue_op.cc | 37 // Defines a PriorityQueueOp, which produces a Queue (specifically, one
55 PriorityQueue* queue = new PriorityQueue(capacity_, component_types_, local
57 return CreateTypedQueue(queue, ret);
|
| /hardware/intel/common/wrs_omxil_core/utils/inc/ |
| queue.h | 2 * queue.h, queue
28 struct queue { struct
34 void __queue_init(struct queue *queue);
35 struct queue *queue_alloc(void);
37 inline void __queue_free(struct queue *queue);
39 void queue_free_all(struct queue *queue);
[all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| Timer.java | 79 * it uses a binary heap to represent its task queue, so the cost to schedule
92 * The timer task queue. This data structure is shared with the timer
95 * and removing them from the queue when they're obsolete.
101 private final TaskQueue queue = new TaskQueue(); field in class:Timer
108 private final TimerThread thread = new TimerThread(queue);
113 * tasks in the timer queue. It is used in preference to a finalizer on
119 synchronized(queue) {
121 queue.notify(); // In case queue is empty.
402 synchronized(queue) {
504 private TaskQueue queue; field in class:TimerThread
[all...] |
| /external/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
| pop_back.invalidation.pass.cpp | 40 std::deque<int> queue; local
42 queue.push_back(i);
44 while (queue.size() > 1)
46 test(queue);
47 queue.pop_back();
|
| pop_front.invalidation.pass.cpp | 40 std::deque<int> queue; local
42 queue.push_back(i);
44 while (queue.size() > 1)
46 test(queue);
47 queue.pop_back();
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_timedsend/ |
| 18-1.c | 10 * Basic test that if the queue already has room, then mq_timedsend()
14 * on an empty queue. Should succeed.
35 mqd_t queue; local
39 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
40 if (queue == (mqd_t) - 1) {
48 if (mq_timedsend(queue, msgptr, strlen(msgptr), 1, &ts) != 0) {
49 perror("mq_timedsend() did not return success on empty queue");
51 mq_close(queue);
56 mq_close(queue);
|
