171 #define	QUEUE_TYPEOF(type) type  argument
173 #define	QUEUE_TYPEOF(type) struct type  argument
179 #define	SLIST_HEAD(name, type)						\  argument
181 	struct type *slh_first;	/* first element */			\
184 #define	SLIST_CLASS_HEAD(name, type)					\  argument
186 	class type *slh_first;	/* first element */			\
192 #define	SLIST_ENTRY(type)						\  argument
194 	struct type *sle_next;	/* next element */			\
197 #define	SLIST_CLASS_ENTRY(type)						\  argument
199 	class type *sle_next;		/* next element */		\
215 #define SLIST_CONCAT(head1, head2, type, field) do {			\  argument
216 	QUEUE_TYPEOF(type) *curelm = SLIST_FIRST(head1);		\
273 #define	SLIST_REMOVE(head, elm, type, field) do {			\  argument
279 		QUEUE_TYPEOF(type) *curelm = SLIST_FIRST(head);		\
302 #define SLIST_SWAP(head1, head2, type) do {				\  argument
303 	QUEUE_TYPEOF(type) *swap_first = SLIST_FIRST(head1);		\
311 #define	STAILQ_HEAD(name, type)						\  argument
313 	struct type *stqh_first;/* first element */			\
314 	struct type **stqh_last;/* addr of last next element */		\
317 #define	STAILQ_CLASS_HEAD(name, type)					\  argument
319 	class type *stqh_first;	/* first element */			\
320 	class type **stqh_last;	/* addr of last next element */		\
326 #define	STAILQ_ENTRY(type)						\  argument
328 	struct type *stqe_next;	/* next element */			\
331 #define	STAILQ_CLASS_ENTRY(type)					\  argument
333 	class type *stqe_next;	/* next element */			\
394 #define	STAILQ_LAST(head, type, field)				\  argument
397 	    QUEUE_TYPEOF(type), field.stqe_next))
401 #define	STAILQ_REMOVE(head, elm, type, field) do {			\  argument
407 		QUEUE_TYPEOF(type) *curelm = STAILQ_FIRST(head);	\
427 #define STAILQ_SWAP(head1, head2, type) do {				\  argument
428 	QUEUE_TYPEOF(type) *swap_first = STAILQ_FIRST(head1);		\
429 	QUEUE_TYPEOF(type) **swap_last = (head1)->stqh_last;		\
443 #define	LIST_HEAD(name, type)						\  argument
445 	struct type *lh_first;	/* first element */			\
448 #define	LIST_CLASS_HEAD(name, type)					\  argument
450 	class type *lh_first;	/* first element */			\
456 #define	LIST_ENTRY(type)						\  argument
458 	struct type *le_next;	/* next element */			\
459 	struct type **le_prev;	/* address of previous next element */	\
462 #define	LIST_CLASS_ENTRY(type)						\  argument
464 	class type *le_next;	/* next element */			\
465 	class type **le_prev;	/* address of previous next element */	\
514 #define LIST_CONCAT(head1, head2, type, field) do {			      \  argument
515 	QUEUE_TYPEOF(type) *curelm = LIST_FIRST(head1);			      \
586 #define	LIST_PREV(elm, head, type, field)			\  argument
589 	    QUEUE_TYPEOF(type), field.le_next))
604 #define LIST_SWAP(head1, head2, type, field) do {			\  argument
605 	QUEUE_TYPEOF(type) *swap_tmp = LIST_FIRST(head1);		\
617 #define	TAILQ_HEAD(name, type)						\  argument
619 	struct type *tqh_first;	/* first element */			\
620 	struct type **tqh_last;	/* addr of last next element */		\
624 #define	TAILQ_CLASS_HEAD(name, type)					\  argument
626 	class type *tqh_first;	/* first element */			\
627 	class type **tqh_last;	/* addr of last next element */		\
634 #define	TAILQ_ENTRY(type)						\  argument
636 	struct type *tqe_next;	/* next element */			\
637 	struct type **tqe_prev;	/* address of previous next element */	\
641 #define	TAILQ_CLASS_ENTRY(type)						\  argument
643 	class type *tqe_next;	/* next element */			\
644 	class type **tqe_prev;	/* address of previous next element */	\
823 #define	TAILQ_LAST_FAST(head, type, field)			\  argument
824     (TAILQ_EMPTY(head) ? NULL : __containerof((head)->tqh_last, QUEUE_TYPEOF(type), field.tqe_next))
831 #define	TAILQ_PREV_FAST(elm, head, type, field)				\  argument
833      __containerof((elm)->field.tqe_prev, QUEUE_TYPEOF(type), field.tqe_next))
853 #define TAILQ_SWAP(head1, head2, type, field) do {			\  argument
854 	QUEUE_TYPEOF(type) *swap_first = (head1)->tqh_first;		\
855 	QUEUE_TYPEOF(type) **swap_last = (head1)->tqh_last;		\