HomeSort by: relevance | last modified time | path
    Searched defs:queue (Results 1 - 25 of 193) sorted by relevancy

1 2 3 4 5 6 7 8

  /src/usr.sbin/lpr/common_source/
lp.h 93 struct queue { struct
112 int getq(struct queue *(*[]));
113 void freeq(struct queue **, u_int);
  /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/external/apache2/mDNSResponder/dist/ServiceRegistration/
tls-macos.h 34 dispatch_queue_t queue; member in struct:tls_config_context
  /src/sys/external/bsd/drm2/amdgpu/
amdgpu_task.h 35 #include <sys/queue.h>
40 SIMPLEQ_ENTRY(amdgpu_task) queue; member in union:amdgpu_task::__anon4280
  /src/sys/external/bsd/drm2/dist/drm/vmwgfx/
ttm_lock.h 68 * @queue: Queue for processes waiting for lock change-of-status.
76 drm_waitqueue_t queue; member in struct:ttm_lock
  /src/sys/external/bsd/drm2/i915drm/
i915_pci.h 35 #include <sys/queue.h>
40 SIMPLEQ_ENTRY(i915drmkms_task) queue; member in union:i915drmkms_task::__anon6009
  /src/sys/external/bsd/drm2/nouveau/
nouveau_pci.h 35 #include <sys/queue.h>
40 SIMPLEQ_ENTRY(nouveau_pci_task) queue; member in union:nouveau_pci_task::__anon6034
  /src/sys/external/bsd/drm2/radeon/
radeon_task.h 35 #include <sys/queue.h>
40 SIMPLEQ_ENTRY(radeon_task) queue; member in union:radeon_task::__anon6035
  /src/sys/external/bsd/drm2/vmwgfx/
vmwgfx_task.h 32 #include <sys/queue.h>
37 SIMPLEQ_ENTRY(vmwgfx_task) queue; member in union:vmwgfx_task::__anon6037
  /src/external/ibm-public/postfix/dist/src/oqmgr/
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_error.c 7 /* look up/create error/retry queue
25 /* qmgr_error_queue() looks up an error queue for the specified
26 /* service and problem. The result is null if the queue is not
85 /* qmgr_error_queue - look up error queue for specified service and problem */
90 QMGR_QUEUE *queue; local
100 * Find or create queue.
103 if ((queue = qmgr_queue_find(transport, nexthop)) == 0)
104 queue = qmgr_queue_create(transport, nexthop, nexthop);
106 if (QMGR_QUEUE_THROTTLED(queue))
112 return (queue);
    [all...]
  /src/external/ibm-public/postfix/dist/src/qmgr/
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_error.c 7 /* look up/create error/retry queue
25 /* qmgr_error_queue() looks up an error queue for the specified
26 /* service and problem. The result is null if the queue is not
85 /* qmgr_error_queue - look up error queue for specified service and problem */
90 QMGR_QUEUE *queue; local
100 * Find or create queue.
103 if ((queue = qmgr_queue_find(transport, nexthop)) == 0)
104 queue = qmgr_queue_create(transport, nexthop, nexthop);
106 if (QMGR_QUEUE_THROTTLED(queue))
112 return (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_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...]
  /src/external/gpl3/gdb.old/dist/gdbserver/
notif.h 26 keep a queue of these to push to GDB. It can be extended if
50 /* A queue of events to GDB. A new notif_event can be enque'ed
51 into QUEUE at any appropriate time, and the notif_reply is
53 std::list<notif_event *> queue; member in struct:notif_server
  /src/external/gpl3/gdb/dist/gdbserver/
notif.h 26 keep a queue of these to push to GDB. It can be extended if
50 /* A queue of events to GDB. A new notif_event can be enque'ed
51 into QUEUE at any appropriate time, and the notif_reply is
53 std::list<notif_event *> queue; member in struct:notif_server
  /src/sys/dev/raidframe/
rf_sstf.h 35 RF_DiskQueueData_t *queue; member in struct:RF_SstfQ_s
  /src/sys/external/bsd/drm2/dist/drm/i915/gt/
intel_reset_types.h 55 drm_waitqueue_t queue; member in struct:intel_reset
  /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/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/gpl3/binutils/dist/gprofng/src/
DbeThread.h 55 DbeQueue *volatile queue; member in class:DbeThreadPool
  /src/external/gpl3/binutils.old/dist/gprofng/src/
DbeThread.h 55 DbeQueue *volatile queue; member in class:DbeThreadPool
  /src/external/lgpl2/userspace-rcu/dist/tests/unit/
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...]

Completed in 33 milliseconds

1 2 3 4 5 6 7 8