165 #define QMD_TRACE_HEAD(head) do {                                       \  argument
181 #define QMD_TRACE_HEAD(head)  argument
251 #define SLIST_HEAD_INITIALIZER(head)                                    \  argument
266 #define SLIST_EMPTY(head)       ((head)->slh_first == NULL)  argument
268 #define SLIST_FIRST(head)       ((head)->slh_first)  argument
270 #define SLIST_FOREACH(var, head, field)                                 \  argument
275 #define SLIST_FOREACH_SAFE(var, head, field, tvar)                      \  argument
280 #define SLIST_FOREACH_PREVPTR(var, varp, head, field)                   \  argument
285 #define SLIST_INIT(head) do {                                           \  argument
294 #define SLIST_INSERT_HEAD(head, elm, field) do {                        \  argument
301 #define SLIST_REMOVE(head, elm, type, field)                            \  argument
324 #define SLIST_REMOVE_HEAD(head, field) do {                             \  argument
341 #define STAILQ_HEAD_INITIALIZER(head)                                   \  argument
364 #define STAILQ_EMPTY(head)      ((head)->stqh_first == NULL)  argument
366 #define STAILQ_FIRST(head)      ((head)->stqh_first)  argument
368 #define STAILQ_FOREACH(var, head, field)                                \  argument
374 #define STAILQ_FOREACH_SAFE(var, head, field, tvar)                     \  argument
379 #define STAILQ_INIT(head) do {                                          \  argument
384 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do {               \  argument
390 #define STAILQ_INSERT_HEAD(head, elm, field) do {                       \  argument
396 #define STAILQ_INSERT_TAIL(head, elm, field) do {                       \  argument
402 #define STAILQ_LAST(head, type, field)                                  \  argument
414 #define STAILQ_REMOVE(head, elm, type, field)                           \  argument
432 #define STAILQ_REMOVE_HEAD(head, field) do {                            \  argument
438 #define STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do {                 \  argument
443 #define STAILQ_REMOVE_AFTER(head, elm, field) do {                      \  argument
480 #define LIST_HEAD_INITIALIZER(head)                                     \  argument
498 #define LIST_CHECK_HEAD(head, field) do {                               \  argument
519 #define LIST_CHECK_HEAD(head, field)  argument
524 #define LIST_EMPTY(head)        ((head)->lh_first == NULL)  argument
526 #define LIST_FIRST(head)        ((head)->lh_first)  argument
528 #define LIST_FOREACH(var, head, field)                                  \  argument
533 #define LIST_FOREACH_SAFE(var, head, field, tvar)                       \  argument
538 #define LIST_INIT(head) do {                                            \  argument
559 #define LIST_INSERT_HEAD(head, elm, field) do {                         \  argument
609 #define TAILQ_HEAD_INITIALIZER(head)                                    \  argument
627 #define TAILQ_CHECK_HEAD(head, field) do {                              \  argument
648 #define TAILQ_CHECK_HEAD(head, field)  argument
664 #define TAILQ_EMPTY(head)       ((head)->tqh_first == NULL)  argument
666 #define TAILQ_FIRST(head)       ((head)->tqh_first)  argument
668 #define TAILQ_FOREACH(var, head, field)                                 \  argument
673 #define TAILQ_FOREACH_SAFE(var, head, field, tvar)                      \  argument
678 #define TAILQ_FOREACH_REVERSE(var, head, headname, field)               \  argument
683 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar)    \  argument
694 #define TAILQ_INIT_AFTER_BZERO(head) do {                               \  argument
699 #define TAILQ_INIT(head) do {                                           \  argument
706 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do {              \  argument
731 #define TAILQ_INSERT_HEAD(head, elm, field) do {                        \  argument
744 #define TAILQ_INSERT_TAIL(head, elm, field) do {                        \  argument
753 #define TAILQ_LAST(head, headname)                                      \  argument
769 #define TAILQ_REMOVE(head, elm, field) do {                             \  argument
837 #define CIRCLEQ_CHECK_HEAD(head, field) do {                            \  argument
843 #define CIRCLEQ_CHECK_NEXT(head, elm, field) do {                       \  argument
849 #define CIRCLEQ_CHECK_PREV(head, elm, field) do {                       \  argument
856 #define CIRCLEQ_CHECK_HEAD(head, field)  argument
857 #define CIRCLEQ_CHECK_NEXT(head, elm, field)  argument
858 #define CIRCLEQ_CHECK_PREV(head, elm, field)  argument
861 #define CIRCLEQ_EMPTY(head) ((head)->cqh_first == (void *)(head))  argument
863 #define CIRCLEQ_FIRST(head) ((head)->cqh_first)  argument
865 #define CIRCLEQ_FOREACH(var, head, field)                               \  argument
870 #define CIRCLEQ_INIT(head) do {                                         \  argument
875 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do {            \  argument
886 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do {           \  argument
897 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do {                      \  argument
908 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do {                      \  argument
918 #define CIRCLEQ_LAST(head) ((head)->cqh_last)  argument
924 #define CIRCLEQ_REMOVE(head, elm, field) do {                           \  argument
983 	    *head = (struct quehead *)b;  in insque()  local