Lines Matching refs:head
106 #define QMD_TRACE_HEAD(head) do { \ argument
107 (head)->trace.prevline = (head)->trace.lastline; \
108 (head)->trace.prevfile = (head)->trace.lastfile; \
109 (head)->trace.lastline = __LINE__; \
110 (head)->trace.lastfile = __FILE__; \
122 #define QMD_TRACE_HEAD(head) argument
159 #define SLIST_HEAD_INITIALIZER(head) \ argument
198 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
200 #define SLIST_FIRST(head) ((head)->slh_first) argument
202 #define SLIST_FOREACH(var, head, field) \ argument
203 for ((var) = SLIST_FIRST((head)); \
207 #define SLIST_FOREACH_FROM(var, head, field) \ argument
208 for ((var) = ((var) ? (var) : SLIST_FIRST((head))); \
212 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
213 for ((var) = SLIST_FIRST((head)); \
217 #define SLIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
218 for ((var) = ((var) ? (var) : SLIST_FIRST((head))); \
222 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
223 for ((varp) = &SLIST_FIRST((head)); \
227 #define SLIST_INIT(head) do { \ argument
228 SLIST_FIRST((head)) = NULL; \
236 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
237 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
238 SLIST_FIRST((head)) = (elm); \
243 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
245 if (SLIST_FIRST((head)) == (elm)) { \
246 SLIST_REMOVE_HEAD((head), field); \
249 QUEUE_TYPEOF(type) *curelm = SLIST_FIRST(head); \
262 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
263 SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \
293 #define STAILQ_HEAD_INITIALIZER(head) \ argument
294 { NULL, &(head).stqh_first }
317 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL) argument
319 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
321 #define STAILQ_FOREACH(var, head, field) \ argument
322 for((var) = STAILQ_FIRST((head)); \
326 #define STAILQ_FOREACH_FROM(var, head, field) \ argument
327 for ((var) = ((var) ? (var) : STAILQ_FIRST((head))); \
331 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
332 for ((var) = STAILQ_FIRST((head)); \
336 #define STAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
337 for ((var) = ((var) ? (var) : STAILQ_FIRST((head))); \
341 #define STAILQ_INIT(head) do { \ argument
342 STAILQ_FIRST((head)) = NULL; \
343 (head)->stqh_last = &STAILQ_FIRST((head)); \
346 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
348 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
352 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
353 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
354 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
355 STAILQ_FIRST((head)) = (elm); \
358 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
360 *(head)->stqh_last = (elm); \
361 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
364 #define STAILQ_LAST(head, type, field) \ argument
365 (STAILQ_EMPTY((head)) ? NULL : \
366 __containerof((head)->stqh_last, \
371 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
373 if (STAILQ_FIRST((head)) == (elm)) { \
374 STAILQ_REMOVE_HEAD((head), field); \
377 QUEUE_TYPEOF(type) *curelm = STAILQ_FIRST(head); \
380 STAILQ_REMOVE_AFTER(head, curelm, field); \
385 #define STAILQ_REMOVE_AFTER(head, elm, field) do { \ argument
388 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
391 #define STAILQ_REMOVE_HEAD(head, field) do { \ argument
392 if ((STAILQ_FIRST((head)) = \
393 STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \
394 (head)->stqh_last = &STAILQ_FIRST((head)); \
424 #define LIST_HEAD_INITIALIZER(head) \ argument
450 #define QMD_LIST_CHECK_HEAD(head, field) do { \ argument
451 if (LIST_FIRST((head)) != NULL && \
452 LIST_FIRST((head))->field.le_prev != \
453 &LIST_FIRST((head))) \
454 panic("Bad list head %p first->prev != head", (head)); \
480 #define QMD_LIST_CHECK_HEAD(head, field) argument
502 #define LIST_EMPTY(head) ((head)->lh_first == NULL) argument
504 #define LIST_FIRST(head) ((head)->lh_first) argument
506 #define LIST_FOREACH(var, head, field) \ argument
507 for ((var) = LIST_FIRST((head)); \
511 #define LIST_FOREACH_FROM(var, head, field) \ argument
512 for ((var) = ((var) ? (var) : LIST_FIRST((head))); \
516 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
517 for ((var) = LIST_FIRST((head)); \
521 #define LIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
522 for ((var) = ((var) ? (var) : LIST_FIRST((head))); \
526 #define LIST_INIT(head) do { \ argument
527 LIST_FIRST((head)) = NULL; \
547 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
548 QMD_LIST_CHECK_HEAD((head), field); \
549 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
550 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
551 LIST_FIRST((head)) = (elm); \
552 (elm)->field.le_prev = &LIST_FIRST((head)); \
557 #define LIST_PREV(elm, head, type, field) \ argument
558 ((elm)->field.le_prev == &LIST_FIRST((head)) ? NULL : \
602 #define TAILQ_HEAD_INITIALIZER(head) \ argument
603 { NULL, &(head).tqh_first, TRACEBUF_INITIALIZER }
629 #define QMD_TAILQ_CHECK_HEAD(head, field) do { \ argument
630 if (!TAILQ_EMPTY(head) && \
631 TAILQ_FIRST((head))->field.tqe_prev != \
632 &TAILQ_FIRST((head))) \
633 panic("Bad tailq head %p first->prev != head", (head)); \
641 #define QMD_TAILQ_CHECK_TAIL(head, field) do { \ argument
642 if (*(head)->tqh_last != NULL) \
643 panic("Bad tailq NEXT(%p->tqh_last) != NULL", (head)); \
669 #define QMD_TAILQ_CHECK_HEAD(head, field) argument
670 #define QMD_TAILQ_CHECK_TAIL(head, headname) argument
686 #define TAILQ_EMPTY(head) ((head)->tqh_first == NULL) argument
688 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
690 #define TAILQ_FOREACH(var, head, field) \ argument
691 for ((var) = TAILQ_FIRST((head)); \
695 #define TAILQ_FOREACH_FROM(var, head, field) \ argument
696 for ((var) = ((var) ? (var) : TAILQ_FIRST((head))); \
700 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
701 for ((var) = TAILQ_FIRST((head)); \
705 #define TAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
706 for ((var) = ((var) ? (var) : TAILQ_FIRST((head))); \
710 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
711 for ((var) = TAILQ_LAST((head), headname); \
715 #define TAILQ_FOREACH_REVERSE_FROM(var, head, headname, field) \ argument
716 for ((var) = ((var) ? (var) : TAILQ_LAST((head), headname)); \
720 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \ argument
721 for ((var) = TAILQ_LAST((head), headname); \
725 #define TAILQ_FOREACH_REVERSE_FROM_SAFE(var, head, headname, field, tvar) \ argument
726 for ((var) = ((var) ? (var) : TAILQ_LAST((head), headname)); \
730 #define TAILQ_INIT(head) do { \ argument
731 TAILQ_FIRST((head)) = NULL; \
732 (head)->tqh_last = &TAILQ_FIRST((head)); \
733 QMD_TRACE_HEAD(head); \
736 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
742 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
743 QMD_TRACE_HEAD(head); \
761 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
762 QMD_TAILQ_CHECK_HEAD(head, field); \
763 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
764 TAILQ_FIRST((head))->field.tqe_prev = \
767 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
768 TAILQ_FIRST((head)) = (elm); \
769 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
770 QMD_TRACE_HEAD(head); \
774 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
775 QMD_TAILQ_CHECK_TAIL(head, field); \
777 (elm)->field.tqe_prev = (head)->tqh_last; \
778 *(head)->tqh_last = (elm); \
779 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
780 QMD_TRACE_HEAD(head); \
784 #define TAILQ_LAST(head, headname) \ argument
785 (*(((struct headname *)((head)->tqh_last))->tqh_last))
794 #define TAILQ_LAST_FAST(head, type, field) \ argument
795 (TAILQ_EMPTY(head) ? NULL : __containerof((head)->tqh_last, QUEUE_TYPEOF(type), field.tqe_next))
802 #define TAILQ_PREV_FAST(elm, head, type, field) \ argument
803 ((elm)->field.tqe_prev == &(head)->tqh_first ? NULL : \
806 #define TAILQ_REMOVE(head, elm, field) do { \ argument
815 (head)->tqh_last = (elm)->field.tqe_prev; \
816 QMD_TRACE_HEAD(head); \