Lines Matching full:queue
260 or for implementing a LIFO queue.
291 or for implementing a FIFO queue.
430 A singly-linked tail queue should be used if this macro is needed in
598 A singly-linked tail queue is headed by a structure defined by the
602 one to the first element in the tail queue and the other to
603 the last element in the tail queue.
607 New elements can be added to the tail queue after an existing element,
608 at the head of the tail queue, or at the end of the tail queue.
620 is the type of the elements to be linked into the tail queue.
621 A pointer to the head of the tail queue can later be declared as:
634 evaluates to an initializer for the tail queue
639 concatenates the tail queue headed by
647 evaluates to true if there are no items on the tail queue.
651 possible that a different thread is concurrently updating the queue.
656 the tail queue.
660 returns the first item on the tail queue or NULL if the tail queue
665 traverses the tail queue referenced by
686 traverses the tail queue referenced by
713 initializes the tail queue referenced by
720 at the head of the tail queue.
726 at the end of the tail queue.
737 returns the last item on the tail queue.
738 If the tail queue is empty the return value is
743 returns the next item on the tail queue, or NULL this item is the last.
749 from the tail queue.
752 this macro does not traverse the entire tail queue.
756 removes the element at the head of the tail queue.
758 elements being removed from the head of the tail queue should
767 from the tail queue.
769 A doubly-linked tail queue should be used if this macro is needed in
778 .Sh SINGLY-LINKED TAIL QUEUE EXAMPLE
782 struct stailhead *headp; /* Singly-linked tail queue head. */
785 STAILQ_ENTRY(entry) entries; /* Tail queue. */
789 STAILQ_INIT(&head); /* Initialize the queue. */
879 A tail queue should be used if this macro is needed in
1057 A tail queue is headed by a structure defined by the
1061 one to the first element in the tail queue and the other to
1062 the last element in the tail queue.
1064 removed without traversing the tail queue.
1065 New elements can be added to the tail queue after an existing element,
1066 before an existing element, at the head of the tail queue,
1067 or at the end of the tail queue.
1079 is the type of the elements to be linked into the tail queue.
1080 A pointer to the head of the tail queue can later be declared as:
1093 evaluates to an initializer for the tail queue
1098 concatenates the tail queue headed by
1106 evaluates to true if there are no items on the tail queue.
1110 possible that a different thread is concurrently updating the queue.
1115 the tail queue.
1119 returns the first item on the tail queue or NULL if the tail queue
1124 traverses the tail queue referenced by
1148 traverses the tail queue referenced by
1212 initializes the tail queue referenced by
1219 at the head of the tail queue.
1225 at the end of the tail queue.
1243 returns the last item on the tail queue.
1244 If the tail queue is empty the return value is
1249 returns the next item on the tail queue, or NULL if this item is the last.
1253 returns the previous item on the tail queue, or NULL if this item
1260 from the tail queue.
1268 in the tail queue.
1279 .Sh TAIL QUEUE EXAMPLE
1283 struct tailhead *headp; /* Tail queue head. */
1286 TAILQ_ENTRY(entry) entries; /* Tail queue. */
1290 TAILQ_INIT(&head); /* Initialize the queue. */
1340 .Nm queue(3) ,
1341 it can be useful to trace queue changes.
1346 It can also be useful to trash pointers that have been unlinked from a queue,
1387 .Nm queue