164 #define QMD_TRACE_HEAD(head) do {                                       \  argument
180 #define QMD_TRACE_HEAD(head)  argument
250 #define SLIST_HEAD_INITIALIZER(head)                                    \  argument
265 #define SLIST_EMPTY(head)       ((head)->slh_first == NULL)  argument
267 #define SLIST_FIRST(head)       ((head)->slh_first)  argument
269 #define SLIST_FOREACH(var, head, field)                                 \  argument
274 #define SLIST_FOREACH_SAFE(var, head, field, tvar)                      \  argument
279 #define SLIST_FOREACH_PREVPTR(var, varp, head, field)                   \  argument
284 #define SLIST_INIT(head) do {                                           \  argument
293 #define SLIST_INSERT_HEAD(head, elm, field) do {                        \  argument
300 #define SLIST_REMOVE(head, elm, type, field)                            \  argument
323 #define SLIST_REMOVE_HEAD(head, field) do {                             \  argument
340 #define STAILQ_HEAD_INITIALIZER(head)                                   \  argument
363 #define STAILQ_EMPTY(head)      ((head)->stqh_first == NULL)  argument
365 #define STAILQ_FIRST(head)      ((head)->stqh_first)  argument
367 #define STAILQ_FOREACH(var, head, field)                                \  argument
373 #define STAILQ_FOREACH_SAFE(var, head, field, tvar)                     \  argument
378 #define STAILQ_INIT(head) do {                                          \  argument
383 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do {               \  argument
389 #define STAILQ_INSERT_HEAD(head, elm, field) do {                       \  argument
395 #define STAILQ_INSERT_TAIL(head, elm, field) do {                       \  argument
401 #define STAILQ_LAST(head, type, field)                                  \  argument
413 #define STAILQ_REMOVE(head, elm, type, field)                           \  argument
431 #define STAILQ_REMOVE_HEAD(head, field) do {                            \  argument
437 #define STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do {                 \  argument
442 #define STAILQ_REMOVE_AFTER(head, elm, field) do {                      \  argument
479 #define LIST_HEAD_INITIALIZER(head)                                     \  argument
497 #define LIST_CHECK_HEAD(head, field) do {                               \  argument
521 #define LIST_CHECK_HEAD(head, field)  argument
526 #define LIST_EMPTY(head)        ((head)->lh_first == NULL)  argument
528 #define LIST_FIRST(head)        ((head)->lh_first)  argument
530 #define LIST_FOREACH(var, head, field)                                  \  argument
535 #define LIST_FOREACH_SAFE(var, head, field, tvar)                       \  argument
540 #define LIST_INIT(head) do {                                            \  argument
561 #define LIST_INSERT_HEAD(head, elm, field) do {                         \  argument
611 #define TAILQ_HEAD_INITIALIZER(head)                                    \  argument
629 #define TAILQ_CHECK_HEAD(head, field) do {                              \  argument
653 #define TAILQ_CHECK_HEAD(head, field)  argument
669 #define TAILQ_EMPTY(head)       ((head)->tqh_first == NULL)  argument
671 #define TAILQ_FIRST(head)       ((head)->tqh_first)  argument
673 #define TAILQ_FOREACH(var, head, field)                                 \  argument
678 #define TAILQ_FOREACH_SAFE(var, head, field, tvar)                      \  argument
683 #define TAILQ_FOREACH_REVERSE(var, head, headname, field)               \  argument
688 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar)    \  argument
699 #define TAILQ_INIT_AFTER_BZERO(head) do {                               \  argument
704 #define TAILQ_INIT(head) do {                                           \  argument
711 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do {              \  argument
736 #define TAILQ_INSERT_HEAD(head, elm, field) do {                        \  argument
749 #define TAILQ_INSERT_TAIL(head, elm, field) do {                        \  argument
758 #define TAILQ_LAST(head, headname)                                      \  argument
774 #define TAILQ_REMOVE(head, elm, field) do {                             \  argument
842 #define CIRCLEQ_CHECK_HEAD(head, field) do {                            \  argument
849 #define CIRCLEQ_CHECK_NEXT(head, elm, field) do {                       \  argument
856 #define CIRCLEQ_CHECK_PREV(head, elm, field) do {                       \  argument
864 #define CIRCLEQ_CHECK_HEAD(head, field)  argument
865 #define CIRCLEQ_CHECK_NEXT(head, elm, field)  argument
866 #define CIRCLEQ_CHECK_PREV(head, elm, field)  argument
869 #define CIRCLEQ_EMPTY(head) ((head)->cqh_first == (void *)(head))  argument
871 #define CIRCLEQ_FIRST(head) ((head)->cqh_first)  argument
873 #define CIRCLEQ_FOREACH(var, head, field)                               \  argument
878 #define CIRCLEQ_INIT(head) do {                                         \  argument
883 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do {            \  argument
894 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do {           \  argument
905 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do {                      \  argument
916 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do {                      \  argument
926 #define CIRCLEQ_LAST(head) ((head)->cqh_last)  argument
932 #define CIRCLEQ_REMOVE(head, elm, field) do {                           \  argument
991 	    *head = (struct quehead *)b;  in insque()  local