Lines Matching full:tail

131 .Nd implementations of singly-linked lists, singly-linked tail queues,
132 lists and tail queues
248 Singly-linked tail queues
250 Tail queues
281 Singly-linked tail queues add the following functionality:
301 Singly-linked tail queues are ideal for applications with large datasets and
305 All doubly linked types of data structures (lists and tail queues)
337 Tail queues add the following functionality:
342 They may be traversed backwards, from tail to head.
442 A singly-linked tail queue should be used if this macro is needed in
620 .Sh SINGLY-LINKED TAIL QUEUES
621 A singly-linked tail queue is headed by a structure defined by the
625 one to the first element in the tail queue and the other to
626 the last element in the tail queue.
630 New elements can be added to the tail queue after an existing element,
631 at the head of the tail queue, or at the end of the tail queue.
643 is the type of the elements to be linked into the tail queue.
644 A pointer to the head of the tail queue can later be declared as:
657 evaluates to an initializer for the tail queue
662 concatenates the tail queue headed by
670 evaluates to true if there are no items on the tail queue.
679 the tail queue.
683 returns the first item on the tail queue or NULL if the tail queue
688 traverses the tail queue referenced by
709 traverses the tail queue referenced by
736 initializes the tail queue referenced by
743 at the head of the tail queue.
749 at the end of the tail queue.
760 returns the last item on the tail queue.
761 If the tail queue is empty the return value is
766 returns the next item on the tail queue, or NULL this item is the last.
772 from the tail queue.
775 this macro does not traverse the entire tail queue.
779 removes the element at the head of the tail queue.
781 elements being removed from the head of the tail queue should
790 from the tail queue.
792 A doubly-linked tail queue should be used if this macro is needed in
793 high-usage code paths or to operate on long tail queues.
801 splits the tail queue referenced by
805 reference the tail queue formed by elements after
816 .Sh SINGLY-LINKED TAIL QUEUE EXAMPLE
820 struct stailhead *headp;		/* Singly-linked tail queue head. */
823 	STAILQ_ENTRY(entry) entries;	/* Tail queue. */
832 n1 = malloc(sizeof(struct entry));	/* Insert at the tail. */
917 A tail queue should be used if this macro is needed in
1105 .Sh TAIL QUEUES
1106 A tail queue is headed by a structure defined by the
1110 one to the first element in the tail queue and the other to
1111 the last element in the tail queue.
1113 removed without traversing the tail queue.
1114 New elements can be added to the tail queue after an existing element,
1115 before an existing element, at the head of the tail queue,
1116 or at the end of the tail queue.
1128 is the type of the elements to be linked into the tail queue.
1129 A pointer to the head of the tail queue can later be declared as:
1142 evaluates to an initializer for the tail queue
1147 concatenates the tail queue headed by
1155 evaluates to true if there are no items on the tail queue.
1164 the tail queue.
1168 returns the first item on the tail queue or NULL if the tail queue
1173 traverses the tail queue referenced by
1197 traverses the tail queue referenced by
1261 initializes the tail queue referenced by
1268 at the head of the tail queue.
1274 at the end of the tail queue.
1292 returns the last item on the tail queue.
1293 If the tail queue is empty the return value is
1298 returns the next item on the tail queue, or NULL if this item is the last.
1302 returns the previous item on the tail queue, or NULL if this item
1309 from the tail queue.
1317 in the tail queue.
1324 splits the tail queue referenced by
1328 reference the tail queue formed by elements after
1339 .Sh TAIL QUEUE EXAMPLE
1343 struct tailhead *headp;			/* Tail queue head. */
1346 	TAILQ_ENTRY(entry) entries;	/* Tail queue. */
1355 n1 = malloc(sizeof(struct entry));	/* Insert at the tail. */
1463 Note that, at the moment, only macros for regular tail queues have been