Lines Matching refs:head
136 #define QMD_TRACE_HEAD(head) do { \ argument
137 (head)->trace.prevline = (head)->trace.lastline; \
138 (head)->trace.prevfile = (head)->trace.lastfile; \
139 (head)->trace.lastline = __LINE__; \
140 (head)->trace.lastfile = __FILE__; \
152 #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); \
323 #define STAILQ_HEAD_INITIALIZER(head) \ argument
324 { NULL, &(head).stqh_first }
347 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL) argument
349 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
351 #define STAILQ_FOREACH(var, head, field) \ argument
352 for((var) = STAILQ_FIRST((head)); \
356 #define STAILQ_FOREACH_FROM(var, head, field) \ argument
357 for ((var) = ((var) ? (var) : STAILQ_FIRST((head))); \
361 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
362 for ((var) = STAILQ_FIRST((head)); \
366 #define STAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
367 for ((var) = ((var) ? (var) : STAILQ_FIRST((head))); \
371 #define STAILQ_INIT(head) do { \ argument
372 STAILQ_FIRST((head)) = NULL; \
373 (head)->stqh_last = &STAILQ_FIRST((head)); \
376 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
378 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
382 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
383 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
384 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
385 STAILQ_FIRST((head)) = (elm); \
388 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
390 *(head)->stqh_last = (elm); \
391 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
394 #define STAILQ_LAST(head, type, field) \ argument
395 (STAILQ_EMPTY((head)) ? NULL : \
396 __containerof((head)->stqh_last, \
401 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
403 if (STAILQ_FIRST((head)) == (elm)) { \
404 STAILQ_REMOVE_HEAD((head), field); \
407 QUEUE_TYPEOF(type) *curelm = STAILQ_FIRST(head); \
410 STAILQ_REMOVE_AFTER(head, curelm, field); \
415 #define STAILQ_REMOVE_AFTER(head, elm, field) do { \ argument
418 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
421 #define STAILQ_REMOVE_HEAD(head, field) do { \ argument
422 if ((STAILQ_FIRST((head)) = \
423 STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \
424 (head)->stqh_last = &STAILQ_FIRST((head)); \
453 #define LIST_HEAD_INITIALIZER(head) \ argument
479 #define QMD_LIST_CHECK_HEAD(head, field) do { \ argument
480 if (LIST_FIRST((head)) != NULL && \
481 LIST_FIRST((head))->field.le_prev != \
482 &LIST_FIRST((head))) \
483 panic("Bad list head %p first->prev != head", (head)); \
509 #define QMD_LIST_CHECK_HEAD(head, field) argument
531 #define LIST_EMPTY(head) ((head)->lh_first == NULL) argument
533 #define LIST_FIRST(head) ((head)->lh_first) argument
535 #define LIST_FOREACH(var, head, field) \ argument
536 for ((var) = LIST_FIRST((head)); \
540 #define LIST_FOREACH_FROM(var, head, field) \ argument
541 for ((var) = ((var) ? (var) : LIST_FIRST((head))); \
545 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
546 for ((var) = LIST_FIRST((head)); \
550 #define LIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
551 for ((var) = ((var) ? (var) : LIST_FIRST((head))); \
555 #define LIST_INIT(head) do { \ argument
556 LIST_FIRST((head)) = NULL; \
576 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
577 QMD_LIST_CHECK_HEAD((head), field); \
578 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
579 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
580 LIST_FIRST((head)) = (elm); \
581 (elm)->field.le_prev = &LIST_FIRST((head)); \
586 #define LIST_PREV(elm, head, type, field) \ argument
587 ((elm)->field.le_prev == &LIST_FIRST((head)) ? NULL : \
631 #define TAILQ_HEAD_INITIALIZER(head) \ argument
632 { NULL, &(head).tqh_first, TRACEBUF_INITIALIZER }
658 #define QMD_TAILQ_CHECK_HEAD(head, field) do { \ argument
659 if (!TAILQ_EMPTY(head) && \
660 TAILQ_FIRST((head))->field.tqe_prev != \
661 &TAILQ_FIRST((head))) \
662 panic("Bad tailq head %p first->prev != head", (head)); \
670 #define QMD_TAILQ_CHECK_TAIL(head, field) do { \ argument
671 if (*(head)->tqh_last != NULL) \
672 panic("Bad tailq NEXT(%p->tqh_last) != NULL", (head)); \
698 #define QMD_TAILQ_CHECK_HEAD(head, field) argument
699 #define QMD_TAILQ_CHECK_TAIL(head, headname) argument
715 #define TAILQ_EMPTY(head) ((head)->tqh_first == NULL) argument
717 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
719 #define TAILQ_FOREACH(var, head, field) \ argument
720 for ((var) = TAILQ_FIRST((head)); \
724 #define TAILQ_FOREACH_FROM(var, head, field) \ argument
725 for ((var) = ((var) ? (var) : TAILQ_FIRST((head))); \
729 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
730 for ((var) = TAILQ_FIRST((head)); \
734 #define TAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
735 for ((var) = ((var) ? (var) : TAILQ_FIRST((head))); \
739 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
740 for ((var) = TAILQ_LAST((head), headname); \
744 #define TAILQ_FOREACH_REVERSE_FROM(var, head, headname, field) \ argument
745 for ((var) = ((var) ? (var) : TAILQ_LAST((head), headname)); \
749 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \ argument
750 for ((var) = TAILQ_LAST((head), headname); \
754 #define TAILQ_FOREACH_REVERSE_FROM_SAFE(var, head, headname, field, tvar) \ argument
755 for ((var) = ((var) ? (var) : TAILQ_LAST((head), headname)); \
759 #define TAILQ_INIT(head) do { \ argument
760 TAILQ_FIRST((head)) = NULL; \
761 (head)->tqh_last = &TAILQ_FIRST((head)); \
762 QMD_TRACE_HEAD(head); \
765 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
771 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
772 QMD_TRACE_HEAD(head); \
790 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
791 QMD_TAILQ_CHECK_HEAD(head, field); \
792 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
793 TAILQ_FIRST((head))->field.tqe_prev = \
796 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
797 TAILQ_FIRST((head)) = (elm); \
798 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
799 QMD_TRACE_HEAD(head); \
803 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
804 QMD_TAILQ_CHECK_TAIL(head, field); \
806 (elm)->field.tqe_prev = (head)->tqh_last; \
807 *(head)->tqh_last = (elm); \
808 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
809 QMD_TRACE_HEAD(head); \
813 #define TAILQ_LAST(head, headname) \ argument
814 (*(((struct headname *)((head)->tqh_last))->tqh_last))
823 #define TAILQ_LAST_FAST(head, type, field) \ argument
824 (TAILQ_EMPTY(head) ? NULL : __containerof((head)->tqh_last, QUEUE_TYPEOF(type), field.tqe_next))
831 #define TAILQ_PREV_FAST(elm, head, type, field) \ argument
832 ((elm)->field.tqe_prev == &(head)->tqh_first ? NULL : \
835 #define TAILQ_REMOVE(head, elm, field) do { \ argument
844 (head)->tqh_last = (elm)->field.tqe_prev; \
845 QMD_TRACE_HEAD(head); \