Searched refs:queue (Results 126 - 150 of 1262) sorted by relevance

1234567891011>>

/freebsd-10.0-release/sys/contrib/octeon-sdk/
H A Dcvmx-cmd-queue.h52 * The common command queue infrastructure abstracts out the
53 * software necessary for adding to Octeon's chained queue
59 * call cvmx-cmd-queue functions directly. Instead the hardware
65 * cvmx-cmd-queue, knowledge of its internal workings can help
68 * Command queue pointers are stored in a global named block
70 * hardware queue is stored in its own cache line to reduce SMP
72 * every 16th queue is next to each other in memory. This scheme
75 * the first queue for each port is in the same cache area. The
82 * In addition to the memory pointer layout, cvmx-cmd-queue
110 * don't use it and it slows down the command queue processin
[all...]
/freebsd-10.0-release/contrib/openbsm/libbsm/
H A Dbsm_mask.c37 #include <sys/queue.h>
39 #include <compat/queue.h>
/freebsd-10.0-release/sys/cam/
H A Dcam_sim.c65 int max_tagged_dev_transactions, struct cam_devq *queue)
89 sim->devq = queue;
62 cam_sim_alloc(sim_action_func sim_action, sim_poll_func sim_poll, const char *sim_name, void *softc, u_int32_t unit, struct mtx *mtx, int max_dev_transactions, int max_tagged_dev_transactions, struct cam_devq *queue) argument
/freebsd-10.0-release/sys/dev/aic7xxx/aicasm/
H A Daicasm_macro_scan.l54 #include <sys/queue.h>
/freebsd-10.0-release/sys/geom/concat/
H A Dg_concat.c244 struct bio_queue_head queue; local
249 bioq_init(&queue);
253 for (cbp = bioq_first(&queue); cbp != NULL;
254 cbp = bioq_first(&queue)) {
255 bioq_remove(&queue, cbp);
263 bioq_insert_tail(&queue, cbp);
268 for (cbp = bioq_first(&queue); cbp != NULL; cbp = bioq_first(&queue)) {
269 bioq_remove(&queue, cbp);
280 struct bio_queue_head queue; local
[all...]
/freebsd-10.0-release/sys/kern/
H A Dsubr_sleepqueue.c31 * Implementation of sleep queues used to hold queue of threads blocked on
36 * and sleep queue implementations. (Note: turnstiles were implemented
39 * a linked list of queues. An individual queue is located by using a hash
41 * for the queue. This means that a wait channel object does not need to
42 * embed it's queue head just as locks do not embed their turnstile queue
43 * head. Threads also carry around a sleep queue that they lend to the
44 * wait channel when blocking. Just as in turnstiles, the queue includes
91 * Constants for the hash table of sleep queue chains.
103 * via the sq_hash entries. The first list is the sleep queue chai
282 sleepq_add(void *wchan, struct lock_object *lock, const char *wmesg, int flags, int queue) argument
382 sleepq_sleepcnt(void *wchan, int queue) argument
811 sleepq_signal(void *wchan, int flags, int pri, int queue) argument
848 sleepq_broadcast(void *wchan, int flags, int pri, int queue) argument
[all...]
H A Dkern_lock.c192 const char *wmesg, int pri, int timo, int queue)
204 (queue == SQ_EXCLUSIVE_QUEUE) ? "exclusive" : "shared");
208 if (queue == SQ_EXCLUSIVE_QUEUE && (flags & LK_SLEEPFAIL) != 0)
212 SLEEPQ_INTERRUPTIBLE : 0), queue);
239 int queue, wakeup_swapper; local
260 * If there are not waiters on the exclusive queue, drop the
282 * If interruptible sleeps left the exclusive queue empty
284 * queue by giving them precedence and cleaning up the
297 queue = SQ_EXCLUSIVE_QUEUE;
305 "%s: %p waking up threads on the exclusive queue",
191 sleeplk(struct lock *lk, u_int flags, struct lock_object *ilk, const char *wmesg, int pri, int timo, int queue) argument
456 int error, ipri, itimo, queue, wakeup_swapper; local
[all...]
/freebsd-10.0-release/sys/sys/
H A Dbio.h41 #include <sys/queue.h>
56 #define BIO_ONQUEUE 0x04 /* This bio is in a queue & not yet taken. */
58 * This bio must be executed after all previous bios in the queue have been
98 TAILQ_ENTRY(bio) bio_queue; /* Disksort queue. */
129 TAILQ_HEAD(bio_queue, bio) queue; member in struct:bio_queue_head
/freebsd-10.0-release/tools/tools/net80211/w00t/expand/
H A Dexpand.c51 struct queue { struct
57 struct queue *next;
75 struct queue *q;
116 struct queue *q = p->q;
119 struct queue *last = NULL;
137 q = (struct queue*) malloc(sizeof(*q));
183 struct queue *q = p->q;
306 struct queue *q = p->q;
/freebsd-10.0-release/usr.sbin/jail/
H A Dstate.c259 if (!--dj->ndeps && dj->queue == &depend)
392 requeue(struct cfjail *j, struct cfjails *queue) argument
394 if (j->queue != queue) {
395 TAILQ_REMOVE(j->queue, j, tq);
396 TAILQ_INSERT_TAIL(queue, j, tq);
397 j->queue = queue;
/freebsd-10.0-release/usr.sbin/ndiscvt/
H A Dinf-parse.y39 #include <sys/queue.h>
/freebsd-10.0-release/sys/vm/
H A Dvm_pageout.c228 * paging queue. In principle, this function only needs to set the flag
233 vm_pageout_init_marker(vm_page_t marker, u_short queue) argument
239 marker->queue = queue;
247 * known to have failed and page queue must be either PQ_ACTIVE or
249 * while locking the vm object. Use marker page to detect page queue
250 * changes and maintain notion of next page on page queue. Return
263 u_short queue; local
266 queue = m->queue;
302 u_short queue; local
[all...]
/freebsd-10.0-release/sys/geom/vinum/
H A Dgeom_vinum_raid5.c86 TAILQ_FOREACH_SAFE(bq, &wp->bits, queue, bq2) {
87 TAILQ_REMOVE(&wp->bits, bq, queue);
107 TAILQ_FOREACH_SAFE(bq, &wp->bits, queue, bq2) {
108 TAILQ_REMOVE(&wp->bits, bq, queue);
227 TAILQ_INSERT_TAIL(&wp->bits, bq, queue);
322 TAILQ_INSERT_TAIL(&wp->bits, bq, queue);
452 TAILQ_INSERT_TAIL(&wp->bits, bq, queue);
493 TAILQ_INSERT_TAIL(&wp->bits, bq, queue);
515 TAILQ_INSERT_TAIL(&wp->bits, bq, queue);
533 TAILQ_INSERT_TAIL(&wp->bits, bq, queue);
[all...]
/freebsd-10.0-release/tools/tools/net80211/w00t/redir/
H A Dredir.c52 struct queue { struct
59 struct queue *next;
84 struct queue *q;
157 struct queue *q = p->q;
160 struct queue *last = NULL;
178 q = (struct queue*) malloc(sizeof(*q));
255 void send_header(struct params *p, struct queue *q)
323 struct queue *q = p->q;
336 struct queue *q = p->q;
479 struct queue *
[all...]
/freebsd-10.0-release/contrib/llvm/include/llvm/ADT/
H A DPriorityQueue.h18 #include <queue>
42 /// erase_one - Erase one element from the queue, regardless of its
64 /// reheapify - If an element in the queue has changed in a way that
65 /// affects its standing in the comparison function, the queue's
67 /// queue's state, making it valid again. This operation has time
68 /// complexity proportional to the number of elements in the queue,
75 /// clear - Erase all elements from the queue.
/freebsd-10.0-release/contrib/mtree/
H A Dexcludes.c43 #include <sys/queue.h>
/freebsd-10.0-release/contrib/ngatm/libngatm/
H A Dsscfucust.h34 #include <sys/queue.h>
/freebsd-10.0-release/contrib/ntp/include/
H A Dntpsim.h72 Queue queue P((Event, Queue ));
/freebsd-10.0-release/contrib/nvi/ex/
H A Dex_file.c17 #include <sys/queue.h>
H A Dex_preserve.c17 #include <sys/queue.h>
/freebsd-10.0-release/contrib/nvi/vi/
H A Dv_at.c17 #include <sys/queue.h>
78 * push it onto the terminal queue and continue.
H A Dv_delete.c17 #include <sys/queue.h>
H A Dv_put.c17 #include <sys/queue.h>
H A Dv_undo.c17 #include <sys/queue.h>
/freebsd-10.0-release/contrib/openbsm/bin/auditdistd/
H A Dproto_impl.h35 #include <sys/queue.h>

Completed in 162 milliseconds

1234567891011>>