| /src/sys/external/bsd/vchiq/dist/interface/vchiq_arm/ |
| vchiq_util.c | 41 int vchiu_queue_init(VCHIU_QUEUE_T *queue, int size)
45 queue->size = size;
46 queue->read = 0;
47 queue->write = 0;
48 queue->initialized = 1;
50 _sema_init(&queue->pop, 0);
51 _sema_init(&queue->push, 0);
53 queue->storage = kzalloc(size * sizeof(VCHIQ_HEADER_T *), GFP_KERNEL);
54 if (queue->storage == NULL) {
55 vchiu_queue_delete(queue);
[all...] |
| vchiq_util.h | 55 extern int vchiu_queue_init(VCHIU_QUEUE_T *queue, int size);
56 extern void vchiu_queue_delete(VCHIU_QUEUE_T *queue);
58 extern int vchiu_queue_is_empty(VCHIU_QUEUE_T *queue);
59 extern int vchiu_queue_is_full(VCHIU_QUEUE_T *queue);
61 extern void vchiu_queue_push(VCHIU_QUEUE_T *queue, VCHIQ_HEADER_T *header);
63 extern VCHIQ_HEADER_T *vchiu_queue_peek(VCHIU_QUEUE_T *queue);
64 extern VCHIQ_HEADER_T *vchiu_queue_pop(VCHIU_QUEUE_T *queue);
|
| /src/external/ibm-public/postfix/dist/src/oqmgr/ |
| qmgr_queue.c | 18 /* void qmgr_queue_done(queue)
19 /* QMGR_QUEUE *queue;
28 /* void qmgr_queue_throttle(queue, dsn)
29 /* QMGR_QUEUE *queue;
32 /* void qmgr_queue_unthrottle(queue)
33 /* QMGR_QUEUE *queue;
35 /* void qmgr_queue_suspend(queue, delay)
36 /* QMGR_QUEUE *queue;
40 /* Each queue corresponds to a specific transport and destination.
41 /* Each queue has a `todo' list of delivery requests for tha
134 QMGR_QUEUE *queue = (QMGR_QUEUE *) context; local
186 QMGR_QUEUE *queue = (QMGR_QUEUE *) context; local
357 QMGR_QUEUE *queue; local
412 QMGR_QUEUE *queue; local
[all...] |
| qmgr_enable.c | 11 /* void qmgr_enable_queue(queue)
12 /* QMGR_QUEUE *queue;
81 QMGR_QUEUE *queue; local
92 for (queue = transport->queue_list.next; queue; queue = next) {
93 next = queue->peers.next;
94 qmgr_enable_queue(queue);
98 /* qmgr_enable_queue - enable and possibly delete queue */
100 void qmgr_enable_queue(QMGR_QUEUE *queue)
[all...] |
| qmgr_entry.c | 7 /* per-site queue entries
11 /* QMGR_ENTRY *qmgr_entry_create(queue, message)
12 /* QMGR_QUEUE *queue;
19 /* QMGR_ENTRY *qmgr_entry_select(queue)
20 /* QMGR_QUEUE *queue;
22 /* void qmgr_entry_unselect(queue, entry)
23 /* QMGR_QUEUE *queue;
33 /* qmgr_entry_create() creates an entry for the named queue and
34 /* message, and appends the entry to the queue's todo list.
38 /* qmgr_entry_done() discards a per-site queue entry. Th
217 QMGR_QUEUE *queue = entry->queue; local
[all...] |
| /src/external/ibm-public/postfix/dist/src/qmgr/ |
| qmgr_queue.c | 18 /* void qmgr_queue_done(queue)
19 /* QMGR_QUEUE *queue;
25 /* void qmgr_queue_throttle(queue, dsn)
26 /* QMGR_QUEUE *queue;
29 /* void qmgr_queue_unthrottle(queue)
30 /* QMGR_QUEUE *queue;
32 /* void qmgr_queue_suspend(queue, delay)
33 /* QMGR_QUEUE *queue;
37 /* Each queue corresponds to a specific transport and destination.
38 /* Each queue has a `todo' list of delivery requests for tha
140 QMGR_QUEUE *queue = (QMGR_QUEUE *) context; local
203 QMGR_QUEUE *queue = (QMGR_QUEUE *) context; local
408 QMGR_QUEUE *queue; local
[all...] |
| qmgr_enable.c | 11 /* void qmgr_enable_queue(queue)
12 /* QMGR_QUEUE *queue;
81 QMGR_QUEUE *queue; local
92 for (queue = transport->queue_list.next; queue; queue = next) {
93 next = queue->peers.next;
94 qmgr_enable_queue(queue);
98 /* qmgr_enable_queue - enable and possibly delete queue */
100 void qmgr_enable_queue(QMGR_QUEUE *queue)
[all...] |
| qmgr_peer.c | 11 /* QMGR_PEER *qmgr_peer_create(job, queue)
13 /* QMGR_QUEUE *queue;
15 /* QMGR_PEER *qmgr_peer_find(job, queue)
17 /* QMGR_QUEUE *queue;
19 /* QMGR_PEER *qmgr_peer_obtain(job, queue)
21 /* QMGR_QUEUE *queue;
32 /* It is similar to per-transport queue structure, but groups
80 QMGR_PEER *qmgr_peer_create(QMGR_JOB *job, QMGR_QUEUE *queue)
85 peer->queue = queue;
100 QMGR_QUEUE *queue = peer->queue; local
138 QMGR_QUEUE *queue; local
[all...] |
| qmgr_entry.c | 7 /* per-site queue entries
19 /* QMGR_ENTRY *qmgr_entry_select(queue)
20 /* QMGR_QUEUE *queue;
22 /* void qmgr_entry_unselect(queue, entry)
23 /* QMGR_QUEUE *queue;
34 /* and appends the entry to the peer's list and its queue's todo list.
38 /* qmgr_entry_done() discards a per-site queue entry. The
40 /* of the site's `busy' list (i.e. queue entries that have been
42 /* of the site's `todo' list (i.e. queue entries awaiting selection
48 /* qmgr_entry_done() triggers cleanup of the per-site queue whe
116 QMGR_QUEUE *queue; local
187 QMGR_QUEUE *queue = entry->queue; local
254 QMGR_QUEUE *queue = entry->queue; local
365 QMGR_QUEUE *queue = peer->queue; local
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/vmwgfx/ |
| vmwgfx_marker.c | 42 void vmw_marker_queue_init(struct vmw_marker_queue *queue)
44 INIT_LIST_HEAD(&queue->head);
45 queue->lag = 0;
46 queue->lag_time = ktime_get_raw_ns();
47 spin_lock_init(&queue->lock);
50 void vmw_marker_queue_takedown(struct vmw_marker_queue *queue)
54 list_for_each_entry_safe(marker, next, &queue->head, head) {
57 spin_lock_destroy(&queue->lock);
60 int vmw_marker_push(struct vmw_marker_queue *queue,
70 spin_lock(&queue->lock)
[all...] |
| /src/sys/external/bsd/drm2/dist/include/drm/ |
| spsc_queue.h | 32 /** SPSC lockless queue */
50 static inline void spsc_queue_init(struct spsc_queue *queue)
52 queue->head = NULL;
53 atomic_long_set(&queue->tail, (long)&queue->head);
54 atomic_set(&queue->job_count, 0);
57 static inline struct spsc_node *spsc_queue_peek(struct spsc_queue *queue)
59 return queue->head;
62 static inline int spsc_queue_count(struct spsc_queue *queue)
64 return atomic_read(&queue->job_count)
[all...] |
| /src/external/ibm-public/postfix/dist/src/cleanup/ |
| cleanup_milter.in10a | 4 # one region at the end of the queue file with the remainder of the
7 open test-queue-file10.tmp
|
| cleanup_milter.in10b | 7 open test-queue-file10.tmp
|
| cleanup_milter.in10c | 9 open test-queue-file10.tmp
|
| cleanup_milter.in11 | 5 open test-queue-file11.tmp
|
| /src/external/mpl/bind/dist/lib/isc/include/isc/ |
| queue.h | 1 /* $NetBSD: queue.h,v 1.8 2025/05/21 14:48:05 christos Exp $ */
40 isc_queue_init(isc_queue_t *queue) {
41 __cds_wfcq_init(&(queue)->head, &(queue)->tail);
45 isc_queue_destroy(isc_queue_t *queue) {
46 UNUSED(queue);
50 isc_queue_empty(isc_queue_t *queue) {
51 return cds_wfcq_empty(&(queue)->head, &(queue)->tail);
55 isc_queue_enqueue(isc_queue_t *queue, isc_queue_node_t *node)
[all...] |
| /src/external/bsd/zstd/dist/contrib/pzstd/utils/test/ |
| WorkQueueTest.cpp | 23 WorkQueue<int>* queue; member in struct:__anon8550::Popper
29 while (queue->pop(result)) {
38 WorkQueue<int> queue; local
41 queue.push(5);
42 EXPECT_TRUE(queue.pop(result));
45 queue.push(1);
46 queue.push(2);
47 EXPECT_TRUE(queue.pop(result));
49 EXPECT_TRUE(queue.pop(result));
52 queue.push(1)
65 WorkQueue<int> queue; local
93 WorkQueue<int> queue; local
116 WorkQueue<int> queue; local
243 WorkQueue<std::unique_ptr<int>> queue; local
256 BufferWorkQueue queue; local
261 BufferWorkQueue queue; local
267 BufferWorkQueue queue; local
274 BufferWorkQueue queue; local
[all...] |
| /src/external/lgpl2/userspace-rcu/dist/tests/unit/ |
| test_wfcqueue.c | 25 struct queue { struct
30 static void async_run(struct queue *queue)
36 cds_wfcq_enqueue(&queue->head, &queue->tail, node);
38 static void do_async_loop(size_t *k, struct queue *queue)
40 struct queue my_queue;
48 &queue->head,
49 &queue->tail)
88 struct queue queue; local
[all...] |
| test_lfstack.c | 25 static void async_run(struct cds_lfs_stack *queue)
31 cds_lfs_push(queue, node);
34 static void *async_loop(void *queue)
39 free(cds_lfs_pop_blocking(queue));
46 static void *spawn_jobs(void *queue)
49 async_run(queue);
59 struct cds_lfs_stack queue; local
63 cds_lfs_init(&queue);
64 pthread_create(&consumer, NULL, async_loop, &queue);
67 pthread_create(&producers[k], NULL, spawn_jobs, &queue);
[all...] |
| test_wfqueue.c | 26 static void async_run(struct cds_wfq_queue *queue)
32 cds_wfq_enqueue(queue, node);
35 static void *async_loop(void *queue)
40 free(cds_wfq_dequeue_blocking(queue));
47 static void *spawn_jobs(void *queue)
50 async_run(queue);
60 struct cds_wfq_queue queue; local
64 cds_wfq_init(&queue);
65 pthread_create(&consumer, NULL, async_loop, &queue);
68 pthread_create(&producers[k], NULL, spawn_jobs, &queue);
[all...] |
| /src/external/gpl3/gdb/dist/sim/ppc/ |
| events.h | 35 (event_queue *queue); variable
42 (event_queue *queue,
49 (event_queue *queue,
56 (event_queue *queue,
65 (event_queue *queue); variable
76 (event_queue *queue); variable
|
| /src/external/gpl3/gdb.old/dist/sim/ppc/ |
| events.h | 35 (event_queue *queue); variable
42 (event_queue *queue,
49 (event_queue *queue,
56 (event_queue *queue,
65 (event_queue *queue); variable
76 (event_queue *queue); variable
|
| /src/share/man/man3/ |
| Makefile | 13 makedev.3 offsetof.3 param.3 paths.3 queue.3 rbtree.3 sigevent.3 \
19 USETBL= # used by queue.3
142 MLINKS+=queue.3 LIST.3 \
143 queue.3 LIST_EMPTY.3 \
144 queue.3 LIST_ENTRY.3 \
145 queue.3 LIST_FIRST.3 \
146 queue.3 LIST_FOREACH.3 \
147 queue.3 LIST_FOREACH_SAFE.3 \
148 queue.3 LIST_HEAD.3 \
149 queue.3 LIST_HEAD_INITIALIZER.3
[all...] |
| /src/external/bsd/ntp/dist/include/ |
| ntp_prio_q.h | 6 * priority queue implementation used by the discrete event simulator.
19 /* Structures for storing a priority queue
33 typedef struct Queue {
37 } queue; typedef in typeref:struct:Queue
43 /* Define a function to create a FIFO queue */
46 void destroy_queue(queue *my_queue);
49 int empty(queue *my_queue);
50 void *queue_head(queue *my_queue);
51 queue *enqueue(queue *my_queue, void *my_node)
[all...] |
| /src/external/bsd/jemalloc/dist/include/jemalloc/internal/ |
| mpsc_queue.h | 7 * A concurrent implementation of a multi-producer, single-consumer queue. It
15 * The implementation is the simple two-stack queue built on a Treiber stack.
17 * hot code. In fact, we don't really even need queue semantics in any
22 * get faster. Since we're currently providing queue semantics though, we use
35 /* Initialize a queue. */ \
37 a_prefix##new(a_queue_type *queue); \
38 /* Insert all items in src into the queue, clearing src. */ \
40 a_prefix##push_batch(a_queue_type *queue, a_list_type *src); \
41 /* Insert node into the queue. */ \
43 a_prefix##push(a_queue_type *queue, a_type *node);
[all...] |
