Lines Matching refs:head
126 #define QMD_TRACE_HEAD(head) do { \ argument
127 (head)->trace.prevline = (head)->trace.lastline; \
128 (head)->trace.prevfile = (head)->trace.lastfile; \
129 (head)->trace.lastline = __LINE__; \
130 (head)->trace.lastfile = __FILE__; \
142 #define QMD_TRACE_HEAD(head) argument
171 #define SLIST_HEAD_INITIALIZER(head) \ argument
187 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
189 #define SLIST_FIRST(head) ((head)->slh_first) argument
191 #define SLIST_FOREACH(var, head, field) \ argument
192 for ((var) = SLIST_FIRST((head)); \
196 #define SLIST_FOREACH_FROM(var, head, field) \ argument
197 for ((var) = ((var) ? (var) : SLIST_FIRST((head))); \
201 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
202 for ((var) = SLIST_FIRST((head)); \
206 #define SLIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
207 for ((var) = ((var) ? (var) : SLIST_FIRST((head))); \
211 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
212 for ((varp) = &SLIST_FIRST((head)); \
216 #define SLIST_INIT(head) do { \ argument
217 SLIST_FIRST((head)) = NULL; \
225 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
226 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
227 SLIST_FIRST((head)) = (elm); \
232 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
234 if (SLIST_FIRST((head)) == (elm)) { \
235 SLIST_REMOVE_HEAD((head), field); \
238 QUEUE_TYPEOF(type) *curelm = SLIST_FIRST(head); \
251 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
252 SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \
276 #define STAILQ_HEAD_INITIALIZER(head) \ argument
277 { NULL, &(head).stqh_first }
300 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL) argument
302 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
304 #define STAILQ_FOREACH(var, head, field) \ argument
305 for((var) = STAILQ_FIRST((head)); \
309 #define STAILQ_FOREACH_FROM(var, head, field) \ argument
310 for ((var) = ((var) ? (var) : STAILQ_FIRST((head))); \
314 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
315 for ((var) = STAILQ_FIRST((head)); \
319 #define STAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
320 for ((var) = ((var) ? (var) : STAILQ_FIRST((head))); \
324 #define STAILQ_INIT(head) do { \ argument
325 STAILQ_FIRST((head)) = NULL; \
326 (head)->stqh_last = &STAILQ_FIRST((head)); \
329 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
331 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
335 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
336 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
337 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
338 STAILQ_FIRST((head)) = (elm); \
341 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
343 *(head)->stqh_last = (elm); \
344 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
347 #define STAILQ_LAST(head, type, field) \ argument
348 (STAILQ_EMPTY((head)) ? NULL : \
349 __containerof((head)->stqh_last, \
354 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
356 if (STAILQ_FIRST((head)) == (elm)) { \
357 STAILQ_REMOVE_HEAD((head), field); \
360 QUEUE_TYPEOF(type) *curelm = STAILQ_FIRST(head); \
363 STAILQ_REMOVE_AFTER(head, curelm, field); \
368 #define STAILQ_REMOVE_AFTER(head, elm, field) do { \ argument
371 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
374 #define STAILQ_REMOVE_HEAD(head, field) do { \ argument
375 if ((STAILQ_FIRST((head)) = \
376 STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \
377 (head)->stqh_last = &STAILQ_FIRST((head)); \
407 #define LIST_HEAD_INITIALIZER(head) \ argument
427 #define QMD_LIST_CHECK_HEAD(head, field) do { \ argument
428 if (LIST_FIRST((head)) != NULL && \
429 LIST_FIRST((head))->field.le_prev != \
430 &LIST_FIRST((head))) \
431 panic("Bad list head %p first->prev != head", (head)); \
446 #define QMD_LIST_CHECK_HEAD(head, field) argument
451 #define LIST_EMPTY(head) ((head)->lh_first == NULL) argument
453 #define LIST_FIRST(head) ((head)->lh_first) argument
455 #define LIST_FOREACH(var, head, field) \ argument
456 for ((var) = LIST_FIRST((head)); \
460 #define LIST_FOREACH_FROM(var, head, field) \ argument
461 for ((var) = ((var) ? (var) : LIST_FIRST((head))); \
465 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
466 for ((var) = LIST_FIRST((head)); \
470 #define LIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
471 for ((var) = ((var) ? (var) : LIST_FIRST((head))); \
475 #define LIST_INIT(head) do { \ argument
476 LIST_FIRST((head)) = NULL; \
496 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
497 QMD_LIST_CHECK_HEAD((head), field); \
498 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
499 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
500 LIST_FIRST((head)) = (elm); \
501 (elm)->field.le_prev = &LIST_FIRST((head)); \
506 #define LIST_PREV(elm, head, type, field) \ argument
507 ((elm)->field.le_prev == &LIST_FIRST((head)) ? NULL : \
551 #define TAILQ_HEAD_INITIALIZER(head) \ argument
552 { NULL, &(head).tqh_first, TRACEBUF_INITIALIZER }
572 #define QMD_TAILQ_CHECK_HEAD(head, field) do { \ argument
573 if (!TAILQ_EMPTY(head) && \
574 TAILQ_FIRST((head))->field.tqe_prev != \
575 &TAILQ_FIRST((head))) \
576 panic("Bad tailq head %p first->prev != head", (head)); \
579 #define QMD_TAILQ_CHECK_TAIL(head, field) do { \ argument
580 if (*(head)->tqh_last != NULL) \
581 panic("Bad tailq NEXT(%p->tqh_last) != NULL", (head)); \
596 #define QMD_TAILQ_CHECK_HEAD(head, field) argument
597 #define QMD_TAILQ_CHECK_TAIL(head, headname) argument
613 #define TAILQ_EMPTY(head) ((head)->tqh_first == NULL) argument
615 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
617 #define TAILQ_FOREACH(var, head, field) \ argument
618 for ((var) = TAILQ_FIRST((head)); \
622 #define TAILQ_FOREACH_FROM(var, head, field) \ argument
623 for ((var) = ((var) ? (var) : TAILQ_FIRST((head))); \
627 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
628 for ((var) = TAILQ_FIRST((head)); \
632 #define TAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
633 for ((var) = ((var) ? (var) : TAILQ_FIRST((head))); \
637 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
638 for ((var) = TAILQ_LAST((head), headname); \
642 #define TAILQ_FOREACH_REVERSE_FROM(var, head, headname, field) \ argument
643 for ((var) = ((var) ? (var) : TAILQ_LAST((head), headname)); \
647 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \ argument
648 for ((var) = TAILQ_LAST((head), headname); \
652 #define TAILQ_FOREACH_REVERSE_FROM_SAFE(var, head, headname, field, tvar) \ argument
653 for ((var) = ((var) ? (var) : TAILQ_LAST((head), headname)); \
657 #define TAILQ_INIT(head) do { \ argument
658 TAILQ_FIRST((head)) = NULL; \
659 (head)->tqh_last = &TAILQ_FIRST((head)); \
660 QMD_TRACE_HEAD(head); \
663 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
669 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
670 QMD_TRACE_HEAD(head); \
688 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
689 QMD_TAILQ_CHECK_HEAD(head, field); \
690 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
691 TAILQ_FIRST((head))->field.tqe_prev = \
694 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
695 TAILQ_FIRST((head)) = (elm); \
696 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
697 QMD_TRACE_HEAD(head); \
701 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
702 QMD_TAILQ_CHECK_TAIL(head, field); \
704 (elm)->field.tqe_prev = (head)->tqh_last; \
705 *(head)->tqh_last = (elm); \
706 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
707 QMD_TRACE_HEAD(head); \
711 #define TAILQ_LAST(head, headname) \ argument
712 (*(((struct headname *)((head)->tqh_last))->tqh_last))
719 #define TAILQ_REMOVE(head, elm, field) do { \ argument
728 (head)->tqh_last = (elm)->field.tqe_prev; \
729 QMD_TRACE_HEAD(head); \