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

1234567891011>>

/freebsd-11-stable/sys/contrib/vchiq/interface/vchiq_arm/
H A Dvchiq_util.c41 int vchiu_queue_init(VCHIU_QUEUE_T *queue, int size) argument
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);
61 vchiu_queue_delete(VCHIU_QUEUE_T *queue) argument
67 vchiu_queue_is_empty(VCHIU_QUEUE_T *queue) argument
72 vchiu_queue_is_full(VCHIU_QUEUE_T *queue) argument
77 vchiu_queue_push(VCHIU_QUEUE_T *queue, VCHIQ_HEADER_T *header) argument
107 vchiu_queue_peek(VCHIU_QUEUE_T *queue) argument
126 vchiu_queue_pop(VCHIU_QUEUE_T *queue) argument
[all...]
H A Dvchiq_util.h55 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);
/freebsd-11-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-11-stable/contrib/libstdc++/include/backward/
H A Dqueue.h32 #include <queue>
34 using std::queue;
/freebsd-11-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-11-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-11-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-11-stable/share/man/man3/
H A DMakefile17 queue.3 \
72 MLINKS+= queue.3 LIST_CLASS_ENTRY.3 \
73 queue.3 LIST_CLASS_HEAD.3 \
74 queue.3 LIST_EMPTY.3 \
75 queue.3 LIST_ENTRY.3 \
76 queue.3 LIST_FIRST.3 \
77 queue.3 LIST_FOREACH.3 \
78 queue.3 LIST_FOREACH_FROM.3 \
79 queue.3 LIST_FOREACH_FROM_SAFE.3 \
80 queue
[all...]
/freebsd-11-stable/sys/netinet/
H A Dtcp_pcap.h33 void tcp_pcap_add(struct tcphdr *th, struct mbuf *m, struct mbufq *queue);
34 void tcp_pcap_drain(struct mbufq *queue);
36 void tcp_pcap_set_sock_max(struct mbufq *queue, int newval);
37 int tcp_pcap_get_sock_max(struct mbufq *queue);
/freebsd-11-stable/sys/nfsserver/
H A Dnfsrvcache.h39 #include <sys/queue.h>
/freebsd-11-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-11-stable/sys/kern/
H A Dsubr_taskqueue.c106 _timeout_task_init(struct taskqueue *queue, struct timeout_task *timeout_task, argument
111 callout_init_mtx(&timeout_task->c, &queue->tq_mutex,
113 timeout_task->q = queue;
130 struct taskqueue *queue; local
137 queue = malloc(sizeof(struct taskqueue), M_TASKQUEUE, mflags | M_ZERO);
138 if (queue == NULL) {
145 STAILQ_INIT(&queue->tq_queue);
146 LIST_INIT(&queue->tq_active);
147 queue->tq_enqueue = enqueue;
148 queue
172 taskqueue_set_callback(struct taskqueue *queue, enum taskqueue_callback_type cb_type, taskqueue_callback_fn callback, void *context) argument
202 taskqueue_free(struct taskqueue *queue) argument
217 taskqueue_enqueue_locked(struct taskqueue *queue, struct task *task) argument
274 taskqueue_enqueue(struct taskqueue *queue, struct task *task) argument
288 struct taskqueue *queue; local
301 taskqueue_enqueue_timeout_sbt(struct taskqueue *queue, struct timeout_task *timeout_task, sbintime_t sbt, sbintime_t pr, int flags) argument
338 taskqueue_enqueue_timeout(struct taskqueue *queue, struct timeout_task *ttask, int ticks) argument
357 taskqueue_drain_tq_queue(struct taskqueue *queue) argument
392 taskqueue_drain_tq_active(struct taskqueue *queue) argument
421 taskqueue_block(struct taskqueue *queue) argument
430 taskqueue_unblock(struct taskqueue *queue) argument
441 taskqueue_run_locked(struct taskqueue *queue) argument
472 taskqueue_run(struct taskqueue *queue) argument
481 task_is_running(struct taskqueue *queue, struct task *task) argument
499 taskqueue_poll_is_busy(struct taskqueue *queue, struct task *task) argument
511 taskqueue_cancel_locked(struct taskqueue *queue, struct task *task, u_int *pendp) argument
527 taskqueue_cancel(struct taskqueue *queue, struct task *task, u_int *pendp) argument
539 taskqueue_cancel_timeout(struct taskqueue *queue, struct timeout_task *timeout_task, u_int *pendp) argument
560 taskqueue_drain(struct taskqueue *queue, struct task *task) argument
573 taskqueue_drain_all(struct taskqueue *queue) argument
586 taskqueue_drain_timeout(struct taskqueue *queue, struct timeout_task *timeout_task) argument
611 taskqueue_quiesce(struct taskqueue *queue) argument
840 taskqueue_member(struct taskqueue *queue, struct thread *td) argument
[all...]
/freebsd-11-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-11-stable/sys/contrib/ck/include/spinlock/
H A Dmcs.h48 ck_spinlock_mcs_init(struct ck_spinlock_mcs **queue) argument
51 *queue = NULL;
57 ck_spinlock_mcs_trylock(struct ck_spinlock_mcs **queue, argument
66 r = ck_pr_cas_ptr(queue, NULL, node);
72 ck_spinlock_mcs_locked(struct ck_spinlock_mcs **queue) argument
76 r = ck_pr_load_ptr(queue) != NULL;
82 ck_spinlock_mcs_lock(struct ck_spinlock_mcs **queue, argument
97 * returns NULL, it means the queue was empty. If the queue was empty,
100 previous = ck_pr_fas_ptr(queue, nod
116 ck_spinlock_mcs_unlock(struct ck_spinlock_mcs **queue, struct ck_spinlock_mcs *node) argument
[all...]
/freebsd-11-stable/sys/contrib/ck/src/
H A Dck_barrier_combining.c39 ck_barrier_combining_queue_dequeue(struct ck_barrier_combining_queue *queue) argument
43 if (queue->head != NULL) {
44 front = queue->head;
45 queue->head = queue->head->next;
72 * into the barrier's tree. We use a queue to implement this
76 ck_barrier_combining_queue_enqueue(struct ck_barrier_combining_queue *queue, argument
81 if (queue->head == NULL) {
82 queue->head = queue
99 struct ck_barrier_combining_queue queue; local
[all...]
/freebsd-11-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
202 camq_change_priority(struct camq *queue, int index, u_int32_t new_priority) argument
[all...]
/freebsd-11-stable/usr.sbin/nscd/
H A Dsingletons.h37 int queue; member in struct:runtime_env
/freebsd-11-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-11-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...]
/freebsd-11-stable/contrib/dma/
H A Dspool.c55 * 'Q'id files (queue):
64 * Each queue file needs to have a corresponding data file.
72 newspoolf(struct queue *queue) argument
90 queue->tmpf = strdup(fn);
91 if (queue->tmpf == NULL)
95 * Assign queue id
99 if (asprintf(&queue->id, "%"PRIxMAX, (uintmax_t)st.st_ino) < 0)
102 queue->mailf = fdopen(fd, "r+");
103 if (queue
154 readqueuef(struct queue *queue, char *queuefn) argument
232 linkspool(struct queue *queue) argument
279 load_queue(struct queue *queue) argument
385 dropspool(struct queue *queue, struct qitem *keep) argument
[all...]
H A Ddma.c40 #include <sys/queue.h>
98 set_from(struct queue *queue, const char *osender) argument
133 queue->sender = sender;
157 do_alias(struct queue *queue, const char *addr) argument
167 if (add_recp(queue, sit->str, EXPAND_ADDR) != 0)
177 add_recp(struct queue *queue, const char *str, int expand) argument
191 it->sender = queue
244 go_background(struct queue *queue) argument
376 run_queue(struct queue *queue) argument
389 show_queue(struct queue *queue) argument
425 struct queue queue; local
[all...]
/freebsd-11-stable/sys/cddl/compat/opensolaris/kern/
H A Dopensolaris_dtrace.c33 #include <sys/queue.h>
/freebsd-11-stable/contrib/subversion/subversion/include/private/
H A Dsvn_sorts_private.h167 * to the ones used with qsort. The first element in the queue is always
169 * queue.
178 * Return a priority queue containing all provided @a elements and prioritize
181 * @note The priority queue will use the existing @a elements array for data
182 * storage. So, you must not manipulate that array while using the queue.
183 * Also, the lifetime of the queue is bound to that of the array.
190 * Returns the number of elements in the @a queue.
193 svn_priority_queue__size(svn_priority_queue__t *queue);
196 * Returns a reference to the first element in the @a queue. The queue
[all...]
/freebsd-11-stable/sys/sys/
H A Dtaskqueue.h36 #include <sys/queue.h>
67 * queue to arrange to run itself later (e.g., by scheduling a software
79 int taskqueue_enqueue(struct taskqueue *queue, struct task *task);
80 int taskqueue_enqueue_timeout(struct taskqueue *queue,
82 int taskqueue_enqueue_timeout_sbt(struct taskqueue *queue,
85 int taskqueue_poll_is_busy(struct taskqueue *queue, struct task *task);
86 int taskqueue_cancel(struct taskqueue *queue, struct task *task,
88 int taskqueue_cancel_timeout(struct taskqueue *queue,
90 void taskqueue_drain(struct taskqueue *queue, struct task *task);
91 void taskqueue_drain_timeout(struct taskqueue *queue,
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_subr/
H A Dsorts.c401 /* Our priority queue data structure:
406 /* the queue elements, ordered as a heap according to COMPARE_FUNC */
417 heap_is_less(svn_priority_queue__t *queue,
421 char *lhs_value = queue->elements->elts + lhs * queue->elements->elt_size;
422 char *rhs_value = queue->elements->elts + rhs * queue->elements->elt_size;
425 assert(lhs < (apr_size_t)queue->elements->nelts);
426 assert(rhs < (apr_size_t)queue->elements->nelts);
427 return queue
415 heap_is_less(svn_priority_queue__t *queue, apr_size_t lhs, apr_size_t rhs) argument
431 heap_swap(svn_priority_queue__t *queue, apr_size_t lhs, apr_size_t rhs) argument
451 heap_bubble_down(svn_priority_queue__t *queue, int idx) argument
465 heap_bubble_up(svn_priority_queue__t *queue, int idx) argument
492 svn_priority_queue__t *queue = apr_pcalloc(elements->pool, sizeof(*queue)); local
503 svn_priority_queue__size(svn_priority_queue__t *queue) argument
509 svn_priority_queue__peek(svn_priority_queue__t *queue) argument
515 svn_priority_queue__update(svn_priority_queue__t *queue) argument
521 svn_priority_queue__pop(svn_priority_queue__t *queue) argument
535 svn_priority_queue__push(svn_priority_queue__t *queue, const void *element) argument
[all...]

Completed in 508 milliseconds

1234567891011>>