Lines Matching refs:head
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); \
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)); \
454 #define LIST_HEAD_INITIALIZER(head) \ argument
480 #define QMD_LIST_CHECK_HEAD(head, field) do { \ argument
481 if (LIST_FIRST((head)) != NULL && \
482 LIST_FIRST((head))->field.le_prev != \
483 &LIST_FIRST((head))) \
484 panic("Bad list head %p first->prev != head", (head)); \
510 #define QMD_LIST_CHECK_HEAD(head, field) argument
532 #define LIST_EMPTY(head) ((head)->lh_first == NULL) argument
534 #define LIST_FIRST(head) ((head)->lh_first) argument
536 #define LIST_FOREACH(var, head, field) \ argument
537 for ((var) = LIST_FIRST((head)); \
541 #define LIST_FOREACH_FROM(var, head, field) \ argument
542 for ((var) = ((var) ? (var) : LIST_FIRST((head))); \
546 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
547 for ((var) = LIST_FIRST((head)); \
551 #define LIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
552 for ((var) = ((var) ? (var) : LIST_FIRST((head))); \
556 #define LIST_INIT(head) do { \ argument
557 LIST_FIRST((head)) = NULL; \
577 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
578 QMD_LIST_CHECK_HEAD((head), field); \
579 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
580 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
581 LIST_FIRST((head)) = (elm); \
582 (elm)->field.le_prev = &LIST_FIRST((head)); \
587 #define LIST_PREV(elm, head, type, field) \ argument
588 ((elm)->field.le_prev == &LIST_FIRST((head)) ? NULL : \
632 #define TAILQ_HEAD_INITIALIZER(head) \ argument
633 { NULL, &(head).tqh_first, TRACEBUF_INITIALIZER }
659 #define QMD_TAILQ_CHECK_HEAD(head, field) do { \ argument
660 if (!TAILQ_EMPTY(head) && \
661 TAILQ_FIRST((head))->field.tqe_prev != \
662 &TAILQ_FIRST((head))) \
663 panic("Bad tailq head %p first->prev != head", (head)); \
671 #define QMD_TAILQ_CHECK_TAIL(head, field) do { \ argument
672 if (*(head)->tqh_last != NULL) \
673 panic("Bad tailq NEXT(%p->tqh_last) != NULL", (head)); \
699 #define QMD_TAILQ_CHECK_HEAD(head, field) argument
700 #define QMD_TAILQ_CHECK_TAIL(head, headname) argument
716 #define TAILQ_EMPTY(head) ((head)->tqh_first == NULL) argument
718 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
720 #define TAILQ_FOREACH(var, head, field) \ argument
721 for ((var) = TAILQ_FIRST((head)); \
725 #define TAILQ_FOREACH_FROM(var, head, field) \ argument
726 for ((var) = ((var) ? (var) : TAILQ_FIRST((head))); \
730 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
731 for ((var) = TAILQ_FIRST((head)); \
735 #define TAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
736 for ((var) = ((var) ? (var) : TAILQ_FIRST((head))); \
740 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
741 for ((var) = TAILQ_LAST((head), headname); \
745 #define TAILQ_FOREACH_REVERSE_FROM(var, head, headname, field) \ argument
746 for ((var) = ((var) ? (var) : TAILQ_LAST((head), headname)); \
750 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \ argument
751 for ((var) = TAILQ_LAST((head), headname); \
755 #define TAILQ_FOREACH_REVERSE_FROM_SAFE(var, head, headname, field, tvar) \ argument
756 for ((var) = ((var) ? (var) : TAILQ_LAST((head), headname)); \
760 #define TAILQ_INIT(head) do { \ argument
761 TAILQ_FIRST((head)) = NULL; \
762 (head)->tqh_last = &TAILQ_FIRST((head)); \
763 QMD_TRACE_HEAD(head); \
766 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
772 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
773 QMD_TRACE_HEAD(head); \
791 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
792 QMD_TAILQ_CHECK_HEAD(head, field); \
793 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
794 TAILQ_FIRST((head))->field.tqe_prev = \
797 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
798 TAILQ_FIRST((head)) = (elm); \
799 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
800 QMD_TRACE_HEAD(head); \
804 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
805 QMD_TAILQ_CHECK_TAIL(head, field); \
807 (elm)->field.tqe_prev = (head)->tqh_last; \
808 *(head)->tqh_last = (elm); \
809 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
810 QMD_TRACE_HEAD(head); \
814 #define TAILQ_LAST(head, headname) \ argument
815 (*(((struct headname *)((head)->tqh_last))->tqh_last))
824 #define TAILQ_LAST_FAST(head, type, field) \ argument
825 (TAILQ_EMPTY(head) ? NULL : __containerof((head)->tqh_last, QUEUE_TYPEOF(type), field.tqe_next))
832 #define TAILQ_PREV_FAST(elm, head, type, field) \ argument
833 ((elm)->field.tqe_prev == &(head)->tqh_first ? NULL : \
836 #define TAILQ_REMOVE(head, elm, field) do { \ argument
845 (head)->tqh_last = (elm)->field.tqe_prev; \
846 QMD_TRACE_HEAD(head); \