Searched refs:queue (Results 1 - 25 of 1391) sorted by relevance

1234567891011>>

/freebsd-10-stable/contrib/apr-util/misc/
H A Dapr_queue.c48 unsigned int bounds;/**< max size of queue */
73 #define apr_queue_full(queue) ((queue)->nelts == (queue)->bounds)
79 #define apr_queue_empty(queue) ((queue)->nelts == 0)
87 apr_queue_t *queue = data; local
91 apr_thread_cond_destroy(queue->not_empty);
92 apr_thread_cond_destroy(queue->not_full);
93 apr_thread_mutex_destroy(queue
106 apr_queue_t *queue; local
251 apr_queue_size(apr_queue_t *queue) argument
[all...]
/freebsd-10-stable/contrib/libstdc++/include/backward/
H A Dqueue.h32 #include <queue>
34 using std::queue;
/freebsd-10-stable/contrib/ntp/lib/isc/include/isc/
H A Dqueue.h20 * This is a generic implementation of a two-lock concurrent queue.
21 * There are built-in mutex locks for the head and tail of the queue,
51 #define ISC_QUEUE_INIT(queue, link) \
53 isc_mutex_init(&(queue).headlock); \
54 isc_mutex_init(&(queue).taillock); \
55 (queue).head = (void *) &((queue).headnode); \
56 (queue).tail = (void *) &((queue).headnode); \
57 ISC_QLINK_INIT((queue)
[all...]
/freebsd-10-stable/sys/dev/nxge/xgehal/
H A Dxge-queue.c29 #include <dev/nxge/include/xge-queue.h>
38 * user-defined portion of the queue item.
46 * __queue_consume - (Lockless) dequeue an item from the specified queue.
48 * @queue: Event queue.
52 __queue_consume(xge_queue_t *queue, int data_max_size, xge_queue_item_t *item) argument
57 if (xge_list_is_empty(&queue->list_head))
60 elem = (xge_queue_item_t *)queue->list_head.next;
66 if (queue->head_ptr == elem) {
67 queue
147 xge_queue_t *queue = (xge_queue_t *)queueh; local
264 xge_queue_t *queue; local
301 xge_queue_t *queue = (xge_queue_t *)queueh; local
328 xge_queue_t *queue = (xge_queue_t *)queueh; local
399 xge_queue_t *queue = (xge_queue_t *)queueh; local
447 xge_queue_t* queue = (xge_queue_t*)qh; local
[all...]
/freebsd-10-stable/contrib/apr-util/include/
H A Dapr_queue.h22 * @brief Thread Safe FIFO bounded queue
23 * @note Since most implementations of the queue are backed by a condition
39 * @defgroup APR_Util_FIFO Thread Safe FIFO bounded queue
50 * create a FIFO queue
51 * @param queue The new queue
52 * @param queue_capacity maximum size of the queue
53 * @param a pool to allocate queue from
55 APU_DECLARE(apr_status_t) apr_queue_create(apr_queue_t **queue,
60 * push/add an object to the queue, blockin
113 APU_DECLARE(unsigned int) apr_queue_size(apr_queue_t *queue); variable
120 APU_DECLARE(apr_status_t) apr_queue_interrupt_all(apr_queue_t *queue); variable
128 APU_DECLARE(apr_status_t) apr_queue_term(apr_queue_t *queue); variable
[all...]
/freebsd-10-stable/sys/nfsserver/
H A Dnfsrvcache.h39 #include <sys/queue.h>
/freebsd-10-stable/share/man/man3/
H A DMakefile15 queue.3 \
68 MLINKS+= queue.3 LIST_CLASS_ENTRY.3 \
69 queue.3 LIST_CLASS_HEAD.3 \
70 queue.3 LIST_EMPTY.3 \
71 queue.3 LIST_ENTRY.3 \
72 queue.3 LIST_FIRST.3 \
73 queue.3 LIST_FOREACH.3 \
74 queue.3 LIST_FOREACH_FROM_SAFE.3 \
75 queue.3 LIST_FOREACH_SAFE.3 \
76 queue
[all...]
/freebsd-10-stable/sys/dev/vxge/vxgehal/
H A Dvxge-queue.c42 * user-defined portion of the queue item.
51 * __queue_consume - (Lockless) dequeue an item from the specified queue.
53 * @queue: Event queue.
59 __queue_consume(vxge_queue_t *queue, argument
67 vxge_assert(queue != NULL);
69 hldev = (__hal_device_t *) queue->hldev;
75 "queue = 0x"VXGE_OS_STXFMT", size = %d, item = 0x"VXGE_OS_STXFMT,
76 (ptr_t) queue, data_max_size, (ptr_t) item);
78 if (vxge_list_is_empty(&queue
170 vxge_queue_t *queue = (vxge_queue_t *) queueh; local
303 vxge_queue_t *queue; local
363 vxge_queue_t *queue = (vxge_queue_t *) queueh; local
405 vxge_queue_t *queue = (vxge_queue_t *) queueh; local
500 vxge_queue_t *queue = (vxge_queue_t *) queueh; local
540 vxge_queue_t *queue = (vxge_queue_t *) queueh; local
579 vxge_queue_t *queue = (vxge_queue_t *) queueh; local
[all...]
/freebsd-10-stable/sys/kern/
H A Dsubr_taskqueue.c99 _timeout_task_init(struct taskqueue *queue, struct timeout_task *timeout_task, argument
104 callout_init_mtx(&timeout_task->c, &queue->tq_mutex,
106 timeout_task->q = queue;
124 struct taskqueue *queue; local
126 queue = malloc(sizeof(struct taskqueue), M_TASKQUEUE, mflags | M_ZERO);
127 if (!queue)
130 STAILQ_INIT(&queue->tq_queue);
131 TAILQ_INIT(&queue->tq_active);
132 queue->tq_enqueue = enqueue;
133 queue
155 taskqueue_set_callback(struct taskqueue *queue, enum taskqueue_callback_type cb_type, taskqueue_callback_fn callback, void *context) argument
185 taskqueue_free(struct taskqueue *queue) argument
199 taskqueue_enqueue_locked(struct taskqueue *queue, struct task *task) argument
245 taskqueue_enqueue(struct taskqueue *queue, struct task *task) argument
259 struct taskqueue *queue; local
272 taskqueue_enqueue_timeout(struct taskqueue *queue, struct timeout_task *timeout_task, int ticks) argument
309 taskqueue_drain_running(struct taskqueue *queue) argument
318 taskqueue_block(struct taskqueue *queue) argument
327 taskqueue_unblock(struct taskqueue *queue) argument
338 taskqueue_run_locked(struct taskqueue *queue) argument
372 taskqueue_run(struct taskqueue *queue) argument
381 task_is_running(struct taskqueue *queue, struct task *task) argument
399 taskqueue_poll_is_busy(struct taskqueue *queue, struct task *task) argument
411 taskqueue_cancel_locked(struct taskqueue *queue, struct task *task, u_int *pendp) argument
424 taskqueue_cancel(struct taskqueue *queue, struct task *task, u_int *pendp) argument
436 taskqueue_cancel_timeout(struct taskqueue *queue, struct timeout_task *timeout_task, u_int *pendp) argument
457 taskqueue_drain(struct taskqueue *queue, struct task *task) argument
470 taskqueue_drain_all(struct taskqueue *queue) argument
506 taskqueue_drain_timeout(struct taskqueue *queue, struct timeout_task *timeout_task) argument
690 taskqueue_enqueue_fast(struct taskqueue *queue, struct task *task) argument
714 taskqueue_member(struct taskqueue *queue, struct thread *td) argument
[all...]
/freebsd-10-stable/contrib/ntp/include/
H A Dntp_prio_q.h4 * priority queue implementation used by the discrete event simulator.
17 /* Structures for storing a priority queue
35 } queue; typedef in typeref:struct:Queue
41 /* Define a function to create a FIFO queue */
44 void destroy_queue(queue *my_queue);
47 int empty(queue *my_queue);
48 void *queue_head(queue *my_queue);
49 queue *enqueue(queue *my_queue, void *my_node);
50 void append_queue(queue *q
[all...]
/freebsd-10-stable/sys/cam/
H A Dcam_queue.c2 * CAM request queue management functions.
43 static MALLOC_DEFINE(M_CAMQ, "CAM queue", "CAM queue buffers");
44 static MALLOC_DEFINE(M_CAMDEVQ, "CAM dev queue", "CAM dev queue buffers");
45 static MALLOC_DEFINE(M_CAMCCBQ, "CAM ccb queue", "CAM ccb queue buffers");
94 * obtained a camq structure. The XPT should ensure that the queue
98 camq_free(struct camq *queue) argument
100 if (queue !
107 camq_fini(struct camq *queue) argument
120 camq_resize(struct camq *queue, int new_size) argument
155 camq_insert(struct camq *queue, cam_pinfo *new_entry) argument
175 camq_remove(struct camq *queue, int index) argument
199 camq_change_priority(struct camq *queue, int index, u_int32_t new_priority) argument
[all...]
/freebsd-10-stable/cddl/contrib/dtracetoolkit/Bin/
H A Ddispqlen.d3 * dispqlen.d - dispatcher queue length by CPU.
10 * NOTES: The dispatcher queue length is an indication of CPU saturation.
12 * utilised when the dispatcher queue reports a length of zero.
45 @queue[cpu] =
51 printa(" CPU %d%@d\n", @queue);
/freebsd-10-stable/cddl/contrib/dtracetoolkit/Cpu/
H A Ddispqlen.d3 * dispqlen.d - dispatcher queue length by CPU.
10 * NOTES: The dispatcher queue length is an indication of CPU saturation.
12 * utilised when the dispatcher queue reports a length of zero.
45 @queue[cpu] =
51 printa(" CPU %d%@d\n", @queue);
/freebsd-10-stable/usr.sbin/nscd/
H A Dsingletons.h37 int queue; member in struct:runtime_env
/freebsd-10-stable/contrib/ntp/lib/isc/tests/
H A Dqueue_test.c28 #include <isc/queue.h>
52 atf_tc_set_md_var(tc, "descr", "Check queue validity");
56 item_queue_t queue; local
62 ISC_QUEUE_INIT(queue, qlink);
73 ATF_CHECK(ISC_QUEUE_EMPTY(queue));
75 ISC_QUEUE_POP(queue, qlink, p);
79 ISC_QUEUE_PUSH(queue, &one, qlink);
82 ATF_CHECK(! ISC_QUEUE_EMPTY(queue));
84 ISC_QUEUE_POP(queue, qlink, p);
87 ATF_CHECK(ISC_QUEUE_EMPTY(queue));
[all...]
/freebsd-10-stable/sys/contrib/octeon-sdk/
H A Dcvmx-zip.c57 #include "cvmx-cmd-queue.h"
91 * @param queue : ZIP instruction queue
92 * @param zcoremask : ZIP coremask to use for this queue
96 int cvmx_zip_queue_initialize(int queue, int zcoremask) argument
104 /* Previous Octeon models has only one instruction queue, call
110 result = cvmx_cmd_queue_initialize(CVMX_CMD_QUEUE_ZIP_QUE(queue), 0,
117 size configured for each instruction queue */
122 zip_que_buf.s.ptr = cvmx_ptr_to_phys(cvmx_cmd_queue_buffer(CVMX_CMD_QUEUE_ZIP_QUE(queue)))>>7;
123 cvmx_write_csr(CVMX_ZIP_QUEX_BUF(queue), zip_que_bu
183 cvmx_zip_queue_shutdown(int queue) argument
225 cvmx_zip_queue_submit(cvmx_zip_command_t *command, int queue) argument
[all...]
H A Dcvmx-pko.c185 * For a given PKO port number, return the base output queue
189 * @return Base output queue
247 cvmx_dprintf("pko_port %d (interface%d index%d) has %d queues (queue base = %d)\n",
287 int queue, base_queue, num_queues; local
301 * Give the user a chance to override the per queue priorities.
307 * static queue priority validation
309 for (queue = 0; queue < num_queues; queue++)
312 priorities[queue]
729 int queue; local
792 uint64_t queue; local
[all...]
/freebsd-10-stable/sys/cddl/compat/opensolaris/kern/
H A Dopensolaris_dtrace.c33 #include <sys/queue.h>
/freebsd-10-stable/contrib/subversion/subversion/include/private/
H A Dsvn_sorts_private.h164 * to the ones used with qsort. The first element in the queue is always
166 * queue.
175 * Return a priority queue containing all provided @a elements and prioritize
178 * @note The priority queue will use the existing @a elements array for data
179 * storage. So, you must not manipulate that array while using the queue.
180 * Also, the lifetime of the queue is bound to that of the array.
187 * Returns the number of elements in the @a queue.
190 svn_priority_queue__size(svn_priority_queue__t *queue);
193 * Returns a reference to the first element in the @a queue. The queue
[all...]
/freebsd-10-stable/contrib/subversion/subversion/libsvn_subr/
H A Dsorts.c390 /* Our priority queue data structure:
395 /* the queue elements, ordered as a heap according to COMPARE_FUNC */
406 heap_is_less(svn_priority_queue__t *queue,
410 char *lhs_value = queue->elements->elts + lhs * queue->elements->elt_size;
411 char *rhs_value = queue->elements->elts + rhs * queue->elements->elt_size;
414 assert(lhs < (apr_size_t)queue->elements->nelts);
415 assert(rhs < (apr_size_t)queue->elements->nelts);
416 return queue
404 heap_is_less(svn_priority_queue__t *queue, apr_size_t lhs, apr_size_t rhs) argument
420 heap_swap(svn_priority_queue__t *queue, apr_size_t lhs, apr_size_t rhs) argument
440 heap_bubble_down(svn_priority_queue__t *queue, int idx) argument
454 heap_bubble_up(svn_priority_queue__t *queue, int idx) argument
481 svn_priority_queue__t *queue = apr_pcalloc(elements->pool, sizeof(*queue)); local
492 svn_priority_queue__size(svn_priority_queue__t *queue) argument
498 svn_priority_queue__peek(svn_priority_queue__t *queue) argument
504 svn_priority_queue__update(svn_priority_queue__t *queue) argument
510 svn_priority_queue__pop(svn_priority_queue__t *queue) argument
524 svn_priority_queue__push(svn_priority_queue__t *queue, const void *element) argument
[all...]
/freebsd-10-stable/sys/sys/
H A Dtaskqueue.h36 #include <sys/queue.h>
64 * queue to arrange to run itself later (e.g., by scheduling a software
74 int taskqueue_enqueue(struct taskqueue *queue, struct task *task);
75 int taskqueue_enqueue_timeout(struct taskqueue *queue,
77 int taskqueue_poll_is_busy(struct taskqueue *queue, struct task *task);
78 int taskqueue_cancel(struct taskqueue *queue, struct task *task,
80 int taskqueue_cancel_timeout(struct taskqueue *queue,
82 void taskqueue_drain(struct taskqueue *queue, struct task *task);
83 void taskqueue_drain_timeout(struct taskqueue *queue,
85 void taskqueue_drain_all(struct taskqueue *queue);
[all...]
H A D_task.h32 #include <sys/queue.h>
47 STAILQ_ENTRY(task) ta_link; /* (q) link for queue */
/freebsd-10-stable/contrib/ntp/ntpd/
H A Dntp_prio_q.c3 * This file contains the priority queue implementation used by the
20 * Define a priority queue in which the relative priority of the elements
24 queue *debug_create_priority_queue(
32 queue *my_queue;
35 my_queue = emalloc(sizeof(queue));
38 my_queue = debug_erealloc(NULL, sizeof(queue), sourcefile, line_num);
48 /* Define a function to "destroy" a priority queue, freeing-up
53 queue *my_queue
58 /* Empty out the queue elements if they are not already empty */
65 /* Now free the queue */
[all...]
/freebsd-10-stable/lib/libgssapi/
H A Dcred.h29 #include <sys/queue.h>
/freebsd-10-stable/tools/tools/aac/
H A Daac_checkq.c44 * Simple program to print out the queue stats on the given queue index.
45 * See /sys/sys/aac_ioctl.h for the definitions of each queue index.
59 int fd, retval, queue; local
70 queue = atoi(argv[1]);
71 printf("Getting stats for queue %d\n", queue);
73 sr.as_item = queue;

Completed in 280 milliseconds

1234567891011>>