115 #define	QMD_TRACE_HEAD(head) do {					\  argument
131 #define	QMD_TRACE_HEAD(head)  argument
144 #define	SLIST_HEAD_INITIALIZER(head)					\  argument
155 #define	SLIST_EMPTY(head)	((head)->slh_first == NULL)  argument
157 #define	SLIST_FIRST(head)	((head)->slh_first)  argument
159 #define	SLIST_FOREACH(var, head, field)					\  argument
164 #define	SLIST_FOREACH_SAFE(var, head, field, tvar)			\  argument
169 #define	SLIST_FOREACH_PREVPTR(var, varp, head, field)			\  argument
174 #define	SLIST_INIT(head) do {						\  argument
183 #define	SLIST_INSERT_HEAD(head, elm, field) do {			\  argument
190 #define	SLIST_REMOVE(head, elm, type, field) do {			\  argument
204 #define	SLIST_REMOVE_HEAD(head, field) do {				\  argument
217 #define	STAILQ_HEAD_INITIALIZER(head)					\  argument
236 #define	STAILQ_EMPTY(head)	((head)->stqh_first == NULL)  argument
238 #define	STAILQ_FIRST(head)	((head)->stqh_first)  argument
240 #define	STAILQ_FOREACH(var, head, field)				\  argument
246 #define	STAILQ_FOREACH_SAFE(var, head, field, tvar)			\  argument
251 #define	STAILQ_INIT(head) do {						\  argument
256 #define	STAILQ_INSERT_AFTER(head, tqelm, elm, field) do {		\  argument
262 #define	STAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
268 #define	STAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
274 #define	STAILQ_LAST(head, type, field)					\  argument
282 #define	STAILQ_REMOVE(head, elm, type, field) do {			\  argument
297 #define	STAILQ_REMOVE_HEAD(head, field) do {				\  argument
311 #define	LIST_HEAD_INITIALIZER(head)					\  argument
325 #define	QMD_LIST_CHECK_HEAD(head, field) do {				\  argument
344 #define	QMD_LIST_CHECK_HEAD(head, field)  argument
349 #define	LIST_EMPTY(head)	((head)->lh_first == NULL)  argument
351 #define	LIST_FIRST(head)	((head)->lh_first)  argument
353 #define	LIST_FOREACH(var, head, field)					\  argument
358 #define	LIST_FOREACH_SAFE(var, head, field, tvar)			\  argument
363 #define	LIST_INIT(head) do {						\  argument
384 #define	LIST_INSERT_HEAD(head, elm, field) do {				\  argument
415 #define	TAILQ_HEAD_INITIALIZER(head)					\  argument
429 #define	QMD_TAILQ_CHECK_HEAD(head, field) do {				\  argument
436 #define	QMD_TAILQ_CHECK_TAIL(head, field) do {				\  argument
453 #define	QMD_TAILQ_CHECK_HEAD(head, field)  argument
454 #define	QMD_TAILQ_CHECK_TAIL(head, headname)  argument
470 #define	TAILQ_EMPTY(head)	((head)->tqh_first == NULL)  argument
472 #define	TAILQ_FIRST(head)	((head)->tqh_first)  argument
474 #define	TAILQ_FOREACH(var, head, field)					\  argument
479 #define	TAILQ_FOREACH_SAFE(var, head, field, tvar)			\  argument
484 #define	TAILQ_FOREACH_REVERSE(var, head, headname, field)		\  argument
489 #define	TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar)	\  argument
494 #define	TAILQ_INIT(head) do {						\  argument
500 #define	TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
525 #define	TAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
538 #define	TAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
548 #define	TAILQ_LAST(head, headname)					\  argument
556 #define	TAILQ_REMOVE(head, elm, field) do {				\  argument
591 		 *head = (struct quehead *)b;  in insque()  local