Lines Matching full:queue

252 or for implementing a LIFO queue.
283 or for implementing a FIFO queue.
422 A singly-linked tail queue should be used if this macro is needed in
586 A singly-linked tail queue is headed by a structure defined by the
590 one to the first element in the tail queue and the other to
591 the last element in the tail queue.
595 New elements can be added to the tail queue after an existing element,
596 at the head of the tail queue, or at the end of the tail queue.
608 is the type of the elements to be linked into the tail queue.
609 A pointer to the head of the tail queue can later be declared as:
622 evaluates to an initializer for the tail queue
627 concatenates the tail queue headed by
635 evaluates to true if there are no items on the tail queue.
640 the tail queue.
644 returns the first item on the tail queue or NULL if the tail queue
649 traverses the tail queue referenced by
670 traverses the tail queue referenced by
697 initializes the tail queue referenced by
704 at the head of the tail queue.
710 at the end of the tail queue.
721 returns the last item on the tail queue.
722 If the tail queue is empty the return value is
727 returns the next item on the tail queue, or NULL this item is the last.
733 from the tail queue.
736 this macro does not traverse the entire tail queue.
740 removes the element at the head of the tail queue.
742 elements being removed from the head of the tail queue should
751 from the tail queue.
753 A doubly-linked tail queue should be used if this macro is needed in
762 .Sh SINGLY-LINKED TAIL QUEUE EXAMPLE
766 struct stailhead *headp;		/* Singly-linked tail queue head. */
769 	STAILQ_ENTRY(entry) entries;	/* Tail queue. */
773 STAILQ_INIT(&head);			/* Initialize the queue. */
863 A tail queue should be used if this macro is needed in
1037 A tail queue is headed by a structure defined by the
1041 one to the first element in the tail queue and the other to
1042 the last element in the tail queue.
1044 removed without traversing the tail queue.
1045 New elements can be added to the tail queue after an existing element,
1046 before an existing element, at the head of the tail queue,
1047 or at the end of the tail queue.
1059 is the type of the elements to be linked into the tail queue.
1060 A pointer to the head of the tail queue can later be declared as:
1073 evaluates to an initializer for the tail queue
1078 concatenates the tail queue headed by
1086 evaluates to true if there are no items on the tail queue.
1091 the tail queue.
1095 returns the first item on the tail queue or NULL if the tail queue
1100 traverses the tail queue referenced by
1124 traverses the tail queue referenced by
1188 initializes the tail queue referenced by
1195 at the head of the tail queue.
1201 at the end of the tail queue.
1219 returns the last item on the tail queue.
1220 If the tail queue is empty the return value is
1225 returns the next item on the tail queue, or NULL if this item is the last.
1229 returns the previous item on the tail queue, or NULL if this item
1236 from the tail queue.
1244 in the tail queue.
1255 .Sh TAIL QUEUE EXAMPLE
1259 struct tailhead *headp;			/* Tail queue head. */
1262 	TAILQ_ENTRY(entry) entries;	/* Tail queue. */
1266 TAILQ_INIT(&head);			/* Initialize the queue. */
1316 .Nm queue(3) ,
1317 it can be useful to trace queue changes.
1322 It can also be useful to trash pointers that have been unlinked from a queue,
1363 .Nm queue