/freebsd-current/sys/contrib/vchiq/interface/vchiq_arm/ |
H A D | vchiq_util.c | 41 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 D | 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);
|
/freebsd-current/sys/netinet/ |
H A D | tcp_pcap.h | 31 void tcp_pcap_add(struct tcphdr *th, struct mbuf *m, struct mbufq *queue); 32 void tcp_pcap_drain(struct mbufq *queue); 34 void tcp_pcap_set_sock_max(struct mbufq *queue, int newval); 35 int tcp_pcap_get_sock_max(struct mbufq *queue);
|
/freebsd-current/sys/cam/ |
H A D | cam_queue.c | 2 * CAM request queue management functions. 42 static MALLOC_DEFINE(M_CAMQ, "CAM queue", "CAM queue buffers"); 43 static MALLOC_DEFINE(M_CAMDEVQ, "CAM dev queue", "CAM dev queue buffers"); 44 static MALLOC_DEFINE(M_CAMCCBQ, "CAM ccb queue", "CAM ccb queue buffers"); 73 * obtained a camq structure. The XPT should ensure that the queue 77 camq_fini(struct camq *queue) argument 79 if (queue 85 camq_resize(struct camq *queue, int new_size) argument 119 camq_insert(struct camq *queue, cam_pinfo *new_entry) argument 139 camq_remove(struct camq *queue, int index) argument 166 camq_change_priority(struct camq *queue, int index, uint32_t new_priority) argument [all...] |
H A D | cam_queue.h | 2 * CAM request queue management definitions. 38 #include <sys/queue.h> 42 * This structure implements a heap based priority queue. The queue 61 struct camq queue; member in struct:cam_ccbq 102 * Resize a cam queue 104 uint32_t camq_resize(struct camq *queue, int new_size); 114 void camq_fini(struct camq *queue); 117 * cam_queue_insert: Given a CAM queue with at least one open spot, 120 void camq_insert(struct camq *queue, cam_pinf 160 struct camq *queue = &ccbq->queue; local 187 struct camq *queue = &ccbq->queue; local [all...] |
/freebsd-current/contrib/ntp/include/ |
H A D | ntp_prio_q.h | 4 * 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-current/sys/contrib/ck/include/spinlock/ |
H A D | mcs.h | 48 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-current/sys/contrib/ck/src/ |
H A D | ck_barrier_combining.c | 39 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-current/sys/kern/ |
H A D | subr_taskqueue.c | 107 _timeout_task_init(struct taskqueue *queue, struct timeout_task *timeout_task, argument 112 callout_init_mtx(&timeout_task->c, &queue->tq_mutex, 114 timeout_task->q = queue; 127 task_get_busy(struct taskqueue *queue, struct task *task) argument 131 TQ_ASSERT_LOCKED(queue); 132 LIST_FOREACH(tb, &queue->tq_active, tb_link) { 144 struct taskqueue *queue; local 151 queue = malloc(sizeof(struct taskqueue), M_TASKQUEUE, mflags | M_ZERO); 152 if (queue == NULL) { 159 STAILQ_INIT(&queue 186 taskqueue_set_callback(struct taskqueue *queue, enum taskqueue_callback_type cb_type, taskqueue_callback_fn callback, void *context) argument 216 taskqueue_free(struct taskqueue *queue) argument 231 taskqueue_enqueue_locked(struct taskqueue *queue, struct task *task, int flags) argument 304 taskqueue_enqueue_flags(struct taskqueue *queue, struct task *task, int flags) argument 316 taskqueue_enqueue(struct taskqueue *queue, struct task *task) argument 324 struct taskqueue *queue; local 337 taskqueue_enqueue_timeout_sbt(struct taskqueue *queue, struct timeout_task *timeout_task, sbintime_t sbt, sbintime_t pr, int flags) argument 381 taskqueue_enqueue_timeout(struct taskqueue *queue, struct timeout_task *ttask, int ticks) argument 400 taskqueue_drain_tq_queue(struct taskqueue *queue) argument 435 taskqueue_drain_tq_active(struct taskqueue *queue) argument 464 taskqueue_block(struct taskqueue *queue) argument 473 taskqueue_unblock(struct taskqueue *queue) argument 484 taskqueue_run_locked(struct taskqueue *queue) argument 528 taskqueue_run(struct taskqueue *queue) argument 542 taskqueue_poll_is_busy(struct taskqueue *queue, struct task *task) argument 554 taskqueue_cancel_locked(struct taskqueue *queue, struct task *task, u_int *pendp) argument 578 taskqueue_cancel(struct taskqueue *queue, struct task *task, u_int *pendp) argument 590 taskqueue_cancel_timeout(struct taskqueue *queue, struct timeout_task *timeout_task, u_int *pendp) argument 611 taskqueue_drain(struct taskqueue *queue, struct task *task) argument 624 taskqueue_drain_all(struct taskqueue *queue) argument 637 taskqueue_drain_timeout(struct taskqueue *queue, struct timeout_task *timeout_task) argument 662 taskqueue_quiesce(struct taskqueue *queue) argument 903 taskqueue_member(struct taskqueue *queue, struct thread *td) argument [all...] |
H A D | subr_gtaskqueue.c | 51 static int task_is_running(struct gtaskqueue *queue, struct gtask *gtask); 52 static void gtaskqueue_drain_locked(struct gtaskqueue *queue, struct gtask *gtask); 127 struct gtaskqueue *queue; local 136 queue = malloc(sizeof(struct gtaskqueue), M_GTASKQUEUE, mflags | M_ZERO); 137 if (!queue) { 142 STAILQ_INIT(&queue->tq_queue); 143 LIST_INIT(&queue->tq_active); 144 queue->tq_enqueue = enqueue; 145 queue->tq_context = context; 146 queue 170 gtaskqueue_free(struct gtaskqueue *queue) argument 190 struct gtaskqueue *queue = grouptask->gt_taskqueue; local 208 struct gtaskqueue *queue = grouptask->gt_taskqueue; local 223 grouptaskqueue_enqueue(struct gtaskqueue *queue, struct gtask *gtask) argument 259 gtaskqueue_drain_tq_queue(struct gtaskqueue *queue) argument 292 gtaskqueue_drain_tq_active(struct gtaskqueue *queue) argument 320 gtaskqueue_block(struct gtaskqueue *queue) argument 329 gtaskqueue_unblock(struct gtaskqueue *queue) argument 340 gtaskqueue_run_locked(struct gtaskqueue *queue) argument 379 task_is_running(struct gtaskqueue *queue, struct gtask *gtask) argument 392 gtaskqueue_cancel_locked(struct gtaskqueue *queue, struct gtask *gtask) argument 402 gtaskqueue_cancel(struct gtaskqueue *queue, struct gtask *gtask) argument 414 gtaskqueue_drain_locked(struct gtaskqueue *queue, struct gtask *gtask) argument 421 gtaskqueue_drain(struct gtaskqueue *queue, struct gtask *gtask) argument 433 gtaskqueue_drain_all(struct gtaskqueue *queue) argument [all...] |
/freebsd-current/sys/dev/vmware/vmci/ |
H A D | vmci_queue.h | 7 /* Defines the queue structure and helper functions to enqueue/dequeue items. */ 15 * This data type contains the information about a queue. 17 * There are two queues (hence, queue pairs) per transaction model between a 18 * pair of end points, A & B. One queue is used by end point A to transmit 19 * commands and responses to B. The other queue is used by B to transmit 22 * vmci_queue_kernel_if is a per-OS defined queue structure. It contains 51 typedef int vmci_memcpy_to_queue_func(struct vmci_queue *queue, 55 const struct vmci_queue *queue, uint64_t queue_offset, size_t size, 64 * guest end of the queue pair has attached -AND- SetPageStore(). The VMX 67 * the guest notifies the host that it's attached then the queue i 96 vmci_memcpy_to_queue_v_local(struct vmci_queue *queue, uint64_t queue_offset, const void *src, size_t src_offset, size_t size, int buf_type, bool can_block) argument 106 vmci_memcpy_from_queue_v_local(void *dest, size_t dest_offset, const struct vmci_queue *queue, uint64_t queue_offset, size_t size, int buf_type, bool can_block) argument [all...] |
/freebsd-current/sys/cddl/compat/opensolaris/sys/ |
H A D | modctl.h | 32 #include <sys/queue.h>
|
/freebsd-current/usr.sbin/nscd/ |
H A D | singletons.h | 35 int queue; member in struct:runtime_env
|
/freebsd-current/share/man/man3/ |
H A D | Makefile | 25 queue.3 \ 200 MLINKS+= queue.3 LIST_CLASS_ENTRY.3 \ 201 queue.3 LIST_CLASS_HEAD.3 \ 202 queue.3 LIST_EMPTY.3 \ 203 queue.3 LIST_ENTRY.3 \ 204 queue.3 LIST_FIRST.3 \ 205 queue.3 LIST_FOREACH.3 \ 206 queue.3 LIST_FOREACH_FROM.3 \ 207 queue.3 LIST_FOREACH_FROM_SAFE.3 \ 208 queue [all...] |
/freebsd-current/contrib/dma/ |
H A D | spool.c | 58 * 'Q'id files (queue): 67 * Each queue file needs to have a corresponding data file. 75 newspoolf(struct queue *queue) argument 93 queue->tmpf = strdup(fn); 94 if (queue->tmpf == NULL) 98 * Assign queue id 102 if (asprintf(&queue->id, "%"PRIxMAX, (uintmax_t)st.st_ino) < 0) 105 queue->mailf = fdopen(fd, "r+"); 106 if (queue 157 readqueuef(struct queue *queue, char *queuefn) argument 235 linkspool(struct queue *queue) argument 282 load_queue(struct queue *queue) argument 388 dropspool(struct queue *queue, struct qitem *keep) argument [all...] |
H A D | dma.c | 40 #include <sys/queue.h> 99 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 426 struct queue queue; local [all...] |
/freebsd-current/sys/contrib/openzfs/module/os/freebsd/spl/ |
H A D | spl_dtrace.c | 31 #include <sys/queue.h>
|
/freebsd-current/contrib/llvm-project/libcxx/modules/std/ |
H A D | queue.inc | 11 // [queue], class template queue 12 using std::queue; 25 // [priority.queue], class template priority_queue
|
/freebsd-current/contrib/ntp/ntpd/ |
H A D | ntp_prio_q.c | 3 * 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-current/lib/libgssapi/ |
H A D | cred.h | 29 #include <sys/queue.h>
|
/freebsd-current/sys/crypto/ccp/ |
H A D | ccp_lsb.h | 42 unsigned queue);
|
/freebsd-current/tools/tools/mfi/ |
H A D | mfi_checkq.c | 38 * Simple program to print out the queue stats on the given queue index. 39 * See /sys/sys/mfi_ioctl.h for the definitions of each queue index. 53 int fd, retval, queue; local 64 queue = atoi(argv[1]); 65 printf("Getting stats for queue %d\n", queue); 67 sr.ms_item = queue;
|
/freebsd-current/tools/tools/aac/ |
H A D | aac_checkq.c | 41 * Simple program to print out the queue stats on the given queue index. 42 * See /sys/sys/aac_ioctl.h for the definitions of each queue index. 56 int fd, retval, queue; local 67 queue = atoi(argv[1]); 68 printf("Getting stats for queue %d\n", queue); 70 sr.as_item = queue;
|
/freebsd-current/tools/tools/fixwhite/ |
H A D | fixwhite.c | 33 static char *queue = NULL; variable 43 queue = realloc(queue, queuesize); 44 if (queue == NULL) { 49 queue[queuelen++] = c; 68 return (queuelen >= back && queue[queuelen - back] == c); 121 queue[queuelen++] = '\t'; 125 if (fwrite(queue, 1, queuelen, stdout) != queuelen) {
|
/freebsd-current/sys/sys/ |
H A D | sleepqueue.h | 32 * Sleep queue interface. Sleep/wakeup, condition variables, and sx 33 * locks use a sleep queue for the queue of threads blocked on a sleep 36 * A thread calls sleepq_lock() to lock the sleep queue chain associated 38 * add themself onto a sleep queue and call one of the sleepq_wait() 41 * queue chain lock. If the thread also needs to remove itself from a queue 48 * A thread is normally resumed from a sleep queue by either the 54 * be removed from a specified sleep queue using the sleepq_remove() 55 * function. Note that the sleep queue chai [all...] |