Lines Matching full:head
46 * added to the list after an existing element or at the head of the list.
47 * Elements being removed from the head of the list should use the explicit
54 * head of the list and the other to the tail of the list. The elements are
57 * to the list after an existing element, at the head of the list, or at the
58 * end of the list. Elements being removed from the head of the tail queue
68 * or after an existing element or at the head of the list. A list
71 * A tail queue is headed by a pair of pointers, one to the head of the
75 * after an existing element, at the head of the list, or at the end of
119 /* Store the last 2 places the queue element or head was altered */
132 #define QMD_TRACE_HEAD(head) do { \ argument
133 (head)->trace.prevline = (head)->trace.lastline; \
134 (head)->trace.prevfile = (head)->trace.lastfile; \
135 (head)->trace.lastline = __LINE__; \
136 (head)->trace.lastfile = __FILE__; \
148 #define QMD_TRACE_HEAD(head) argument
189 #define SLIST_HEAD_INITIALIZER(head) \ argument
228 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
230 #define SLIST_FIRST(head) ((head)->slh_first) argument
232 #define SLIST_FOREACH(var, head, field) \ argument
233 for ((var) = SLIST_FIRST((head)); \
237 #define SLIST_FOREACH_FROM(var, head, field) \ argument
238 for ((var) = ((var) ? (var) : SLIST_FIRST((head))); \
242 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
243 for ((var) = SLIST_FIRST((head)); \
247 #define SLIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
248 for ((var) = ((var) ? (var) : SLIST_FIRST((head))); \
252 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
253 for ((varp) = &SLIST_FIRST((head)); \
257 #define SLIST_INIT(head) do { \ argument
258 SLIST_FIRST((head)) = NULL; \
266 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
267 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
268 SLIST_FIRST((head)) = (elm); \
273 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
275 if (SLIST_FIRST((head)) == (elm)) { \
276 SLIST_REMOVE_HEAD((head), field); \
279 QUEUE_TYPEOF(type) *curelm = SLIST_FIRST(head); \
292 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
293 SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \
308 #define SLIST_END(head) NULL argument
325 #define STAILQ_HEAD_INITIALIZER(head) \ argument
326 { NULL, &(head).stqh_first }
349 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL) argument
351 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
353 #define STAILQ_FOREACH(var, head, field) \ argument
354 for((var) = STAILQ_FIRST((head)); \
358 #define STAILQ_FOREACH_FROM(var, head, field) \ argument
359 for ((var) = ((var) ? (var) : STAILQ_FIRST((head))); \
363 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
364 for ((var) = STAILQ_FIRST((head)); \
368 #define STAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
369 for ((var) = ((var) ? (var) : STAILQ_FIRST((head))); \
373 #define STAILQ_INIT(head) do { \ argument
374 STAILQ_FIRST((head)) = NULL; \
375 (head)->stqh_last = &STAILQ_FIRST((head)); \
378 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
380 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
384 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
385 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
386 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
387 STAILQ_FIRST((head)) = (elm); \
390 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
392 *(head)->stqh_last = (elm); \
393 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
396 #define STAILQ_LAST(head, type, field) \ argument
397 (STAILQ_EMPTY((head)) ? NULL : \
398 __containerof((head)->stqh_last, \
403 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
405 if (STAILQ_FIRST((head)) == (elm)) { \
406 STAILQ_REMOVE_HEAD((head), field); \
409 QUEUE_TYPEOF(type) *curelm = STAILQ_FIRST(head); \
412 STAILQ_REMOVE_AFTER(head, curelm, field); \
417 #define STAILQ_REMOVE_AFTER(head, elm, field) do { \ argument
420 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
423 #define STAILQ_REMOVE_HEAD(head, field) do { \ argument
424 if ((STAILQ_FIRST((head)) = \
425 STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \
426 (head)->stqh_last = &STAILQ_FIRST((head)); \
442 #define STAILQ_END(head) NULL argument
458 #define LIST_HEAD_INITIALIZER(head) \ argument
479 * QMD_LIST_CHECK_HEAD(LIST_HEAD *head, LIST_ENTRY NAME)
482 * points back at 'head.'
484 #define QMD_LIST_CHECK_HEAD(head, field) do { \ argument
485 if (LIST_FIRST((head)) != NULL && \
486 LIST_FIRST((head))->field.le_prev != \
487 &LIST_FIRST((head))) \
488 panic("Bad list head %p first->prev != head", (head)); \
507 * Validates that the previous element (or head of the list) points to 'elm.'
514 #define QMD_LIST_CHECK_HEAD(head, field) argument
536 #define LIST_EMPTY(head) ((head)->lh_first == NULL) argument
538 #define LIST_FIRST(head) ((head)->lh_first) argument
540 #define LIST_FOREACH(var, head, field) \ argument
541 for ((var) = LIST_FIRST((head)); \
545 #define LIST_FOREACH_FROM(var, head, field) \ argument
546 for ((var) = ((var) ? (var) : LIST_FIRST((head))); \
550 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
551 for ((var) = LIST_FIRST((head)); \
555 #define LIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
556 for ((var) = ((var) ? (var) : LIST_FIRST((head))); \
560 #define LIST_INIT(head) do { \ argument
561 LIST_FIRST((head)) = NULL; \
581 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
582 QMD_LIST_CHECK_HEAD((head), field); \
583 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
584 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
585 LIST_FIRST((head)) = (elm); \
586 (elm)->field.le_prev = &LIST_FIRST((head)); \
591 #define LIST_PREV(elm, head, type, field) \ argument
592 ((elm)->field.le_prev == &LIST_FIRST((head)) ? NULL : \
619 #define LIST_END(head) NULL argument
638 #define TAILQ_HEAD_INITIALIZER(head) \ argument
639 { NULL, &(head).tqh_first, TRACEBUF_INITIALIZER }
660 * QMD_TAILQ_CHECK_HEAD(TAILQ_HEAD *head, TAILQ_ENTRY NAME)
663 * points back at 'head.'
665 #define QMD_TAILQ_CHECK_HEAD(head, field) do { \ argument
666 if (!TAILQ_EMPTY(head) && \
667 TAILQ_FIRST((head))->field.tqe_prev != \
668 &TAILQ_FIRST((head))) \
669 panic("Bad tailq head %p first->prev != head", (head)); \
673 * QMD_TAILQ_CHECK_TAIL(TAILQ_HEAD *head, TAILQ_ENTRY NAME)
677 #define QMD_TAILQ_CHECK_TAIL(head, field) do { \ argument
678 if (*(head)->tqh_last != NULL) \
679 panic("Bad tailq NEXT(%p->tqh_last) != NULL", (head)); \
698 * Validates that the previous element (or head of the tailq) points to 'elm.'
705 #define QMD_TAILQ_CHECK_HEAD(head, field) argument
706 #define QMD_TAILQ_CHECK_TAIL(head, headname) argument
722 #define TAILQ_EMPTY(head) ((head)->tqh_first == NULL) argument
724 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
726 #define TAILQ_FOREACH(var, head, field) \ argument
727 for ((var) = TAILQ_FIRST((head)); \
731 #define TAILQ_FOREACH_FROM(var, head, field) \ argument
732 for ((var) = ((var) ? (var) : TAILQ_FIRST((head))); \
736 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
737 for ((var) = TAILQ_FIRST((head)); \
741 #define TAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
742 for ((var) = ((var) ? (var) : TAILQ_FIRST((head))); \
746 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
747 for ((var) = TAILQ_LAST((head), headname); \
751 #define TAILQ_FOREACH_REVERSE_FROM(var, head, headname, field) \ argument
752 for ((var) = ((var) ? (var) : TAILQ_LAST((head), headname)); \
756 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \ argument
757 for ((var) = TAILQ_LAST((head), headname); \
761 #define TAILQ_FOREACH_REVERSE_FROM_SAFE(var, head, headname, field, tvar) \ argument
762 for ((var) = ((var) ? (var) : TAILQ_LAST((head), headname)); \
766 #define TAILQ_INIT(head) do { \ argument
767 TAILQ_FIRST((head)) = NULL; \
768 (head)->tqh_last = &TAILQ_FIRST((head)); \
769 QMD_TRACE_HEAD(head); \
772 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
778 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
779 QMD_TRACE_HEAD(head); \
797 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
798 QMD_TAILQ_CHECK_HEAD(head, field); \
799 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
800 TAILQ_FIRST((head))->field.tqe_prev = \
803 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
804 TAILQ_FIRST((head)) = (elm); \
805 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
806 QMD_TRACE_HEAD(head); \
810 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
811 QMD_TAILQ_CHECK_TAIL(head, field); \
813 (elm)->field.tqe_prev = (head)->tqh_last; \
814 *(head)->tqh_last = (elm); \
815 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
816 QMD_TRACE_HEAD(head); \
820 #define TAILQ_LAST(head, headname) \ argument
821 (*(((struct headname *)((head)->tqh_last))->tqh_last))
825 * then the access to the head. The standard LAST function above
830 #define TAILQ_LAST_FAST(head, type, field) \ argument
831 (TAILQ_EMPTY(head) ? NULL : __containerof((head)->tqh_last, QUEUE_TYPEOF(type), field.tqe_next))
838 #define TAILQ_PREV_FAST(elm, head, type, field) \ argument
839 ((elm)->field.tqe_prev == &(head)->tqh_first ? NULL : \
842 #define TAILQ_REMOVE(head, elm, field) do { \ argument
851 (head)->tqh_last = (elm)->field.tqe_prev; \
852 QMD_TRACE_HEAD(head); \
877 #define TAILQ_END(head) NULL argument