Lines Matching refs:head
125 #define QMD_TRACE_HEAD(head) do { \ argument
126 (head)->trace.prevline = (head)->trace.lastline; \
127 (head)->trace.prevfile = (head)->trace.lastfile; \
128 (head)->trace.lastline = __LINE__; \
129 (head)->trace.lastfile = __FILE__; \
141 #define QMD_TRACE_HEAD(head) argument
170 #define SLIST_HEAD_INITIALIZER(head) \ argument
186 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
188 #define SLIST_FIRST(head) ((head)->slh_first) argument
190 #define SLIST_FOREACH(var, head, field) \ argument
191 for ((var) = SLIST_FIRST((head)); \
195 #define SLIST_FOREACH_FROM(var, head, field) \ argument
196 for ((var) = ((var) ? (var) : SLIST_FIRST((head))); \
200 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
201 for ((var) = SLIST_FIRST((head)); \
205 #define SLIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
206 for ((var) = ((var) ? (var) : SLIST_FIRST((head))); \
210 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
211 for ((varp) = &SLIST_FIRST((head)); \
215 #define SLIST_INIT(head) do { \ argument
216 SLIST_FIRST((head)) = NULL; \
224 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
225 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
226 SLIST_FIRST((head)) = (elm); \
231 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
233 if (SLIST_FIRST((head)) == (elm)) { \
234 SLIST_REMOVE_HEAD((head), field); \
237 QUEUE_TYPEOF(type) *curelm = SLIST_FIRST(head); \
250 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
251 SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \
275 #define STAILQ_HEAD_INITIALIZER(head) \ argument
276 { NULL, &(head).stqh_first }
299 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL) argument
301 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
303 #define STAILQ_FOREACH(var, head, field) \ argument
304 for((var) = STAILQ_FIRST((head)); \
308 #define STAILQ_FOREACH_FROM(var, head, field) \ argument
309 for ((var) = ((var) ? (var) : STAILQ_FIRST((head))); \
313 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
314 for ((var) = STAILQ_FIRST((head)); \
318 #define STAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
319 for ((var) = ((var) ? (var) : STAILQ_FIRST((head))); \
323 #define STAILQ_INIT(head) do { \ argument
324 STAILQ_FIRST((head)) = NULL; \
325 (head)->stqh_last = &STAILQ_FIRST((head)); \
328 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
330 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
334 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
335 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
336 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
337 STAILQ_FIRST((head)) = (elm); \
340 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
342 *(head)->stqh_last = (elm); \
343 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
346 #define STAILQ_LAST(head, type, field) \ argument
347 (STAILQ_EMPTY((head)) ? NULL : \
348 __containerof((head)->stqh_last, \
353 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
355 if (STAILQ_FIRST((head)) == (elm)) { \
356 STAILQ_REMOVE_HEAD((head), field); \
359 QUEUE_TYPEOF(type) *curelm = STAILQ_FIRST(head); \
362 STAILQ_REMOVE_AFTER(head, curelm, field); \
367 #define STAILQ_REMOVE_AFTER(head, elm, field) do { \ argument
370 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
373 #define STAILQ_REMOVE_HEAD(head, field) do { \ argument
374 if ((STAILQ_FIRST((head)) = \
375 STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \
376 (head)->stqh_last = &STAILQ_FIRST((head)); \
406 #define LIST_HEAD_INITIALIZER(head) \ argument
426 #define QMD_LIST_CHECK_HEAD(head, field) do { \ argument
427 if (LIST_FIRST((head)) != NULL && \
428 LIST_FIRST((head))->field.le_prev != \
429 &LIST_FIRST((head))) \
430 panic("Bad list head %p first->prev != head", (head)); \
445 #define QMD_LIST_CHECK_HEAD(head, field) argument
450 #define LIST_EMPTY(head) ((head)->lh_first == NULL) argument
452 #define LIST_FIRST(head) ((head)->lh_first) argument
454 #define LIST_FOREACH(var, head, field) \ argument
455 for ((var) = LIST_FIRST((head)); \
459 #define LIST_FOREACH_FROM(var, head, field) \ argument
460 for ((var) = ((var) ? (var) : LIST_FIRST((head))); \
464 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
465 for ((var) = LIST_FIRST((head)); \
469 #define LIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
470 for ((var) = ((var) ? (var) : LIST_FIRST((head))); \
474 #define LIST_INIT(head) do { \ argument
475 LIST_FIRST((head)) = NULL; \
495 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
496 QMD_LIST_CHECK_HEAD((head), field); \
497 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
498 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
499 LIST_FIRST((head)) = (elm); \
500 (elm)->field.le_prev = &LIST_FIRST((head)); \
505 #define LIST_PREV(elm, head, type, field) \ argument
506 ((elm)->field.le_prev == &LIST_FIRST((head)) ? NULL : \
550 #define TAILQ_HEAD_INITIALIZER(head) \ argument
551 { NULL, &(head).tqh_first, TRACEBUF_INITIALIZER }
571 #define QMD_TAILQ_CHECK_HEAD(head, field) do { \ argument
572 if (!TAILQ_EMPTY(head) && \
573 TAILQ_FIRST((head))->field.tqe_prev != \
574 &TAILQ_FIRST((head))) \
575 panic("Bad tailq head %p first->prev != head", (head)); \
578 #define QMD_TAILQ_CHECK_TAIL(head, field) do { \ argument
579 if (*(head)->tqh_last != NULL) \
580 panic("Bad tailq NEXT(%p->tqh_last) != NULL", (head)); \
595 #define QMD_TAILQ_CHECK_HEAD(head, field) argument
596 #define QMD_TAILQ_CHECK_TAIL(head, headname) argument
612 #define TAILQ_EMPTY(head) ((head)->tqh_first == NULL) argument
614 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
616 #define TAILQ_FOREACH(var, head, field) \ argument
617 for ((var) = TAILQ_FIRST((head)); \
621 #define TAILQ_FOREACH_FROM(var, head, field) \ argument
622 for ((var) = ((var) ? (var) : TAILQ_FIRST((head))); \
626 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
627 for ((var) = TAILQ_FIRST((head)); \
631 #define TAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
632 for ((var) = ((var) ? (var) : TAILQ_FIRST((head))); \
636 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
637 for ((var) = TAILQ_LAST((head), headname); \
641 #define TAILQ_FOREACH_REVERSE_FROM(var, head, headname, field) \ argument
642 for ((var) = ((var) ? (var) : TAILQ_LAST((head), headname)); \
646 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \ argument
647 for ((var) = TAILQ_LAST((head), headname); \
651 #define TAILQ_FOREACH_REVERSE_FROM_SAFE(var, head, headname, field, tvar) \ argument
652 for ((var) = ((var) ? (var) : TAILQ_LAST((head), headname)); \
656 #define TAILQ_INIT(head) do { \ argument
657 TAILQ_FIRST((head)) = NULL; \
658 (head)->tqh_last = &TAILQ_FIRST((head)); \
659 QMD_TRACE_HEAD(head); \
662 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
668 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
669 QMD_TRACE_HEAD(head); \
687 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
688 QMD_TAILQ_CHECK_HEAD(head, field); \
689 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
690 TAILQ_FIRST((head))->field.tqe_prev = \
693 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
694 TAILQ_FIRST((head)) = (elm); \
695 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
696 QMD_TRACE_HEAD(head); \
700 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
701 QMD_TAILQ_CHECK_TAIL(head, field); \
703 (elm)->field.tqe_prev = (head)->tqh_last; \
704 *(head)->tqh_last = (elm); \
705 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
706 QMD_TRACE_HEAD(head); \
710 #define TAILQ_LAST(head, headname) \ argument
711 (*(((struct headname *)((head)->tqh_last))->tqh_last))
718 #define TAILQ_REMOVE(head, elm, field) do { \ argument
727 (head)->tqh_last = (elm)->field.tqe_prev; \
728 QMD_TRACE_HEAD(head); \