255 #define SLIST_SWAP(head1, head2, type) do {				\  argument
256 	QUEUE_TYPEOF(type) *swap_first = SLIST_FIRST(head1);		\
257 	SLIST_FIRST(head1) = SLIST_FIRST(head2);			\
292 #define	STAILQ_CONCAT(head1, head2) do {				\  argument
294 		*(head1)->stqh_last = (head2)->stqh_first;		\
295 		(head1)->stqh_last = (head2)->stqh_last;		\
380 #define STAILQ_SWAP(head1, head2, type) do {				\  argument
381 	QUEUE_TYPEOF(type) *swap_first = STAILQ_FIRST(head1);		\
382 	QUEUE_TYPEOF(type) **swap_last = (head1)->stqh_last;		\
383 	STAILQ_FIRST(head1) = STAILQ_FIRST(head2);			\
384 	(head1)->stqh_last = (head2)->stqh_last;			\
387 	if (STAILQ_EMPTY(head1))					\
388 		(head1)->stqh_last = &STAILQ_FIRST(head1);		\
524 #define LIST_SWAP(head1, head2, type, field) do {			\  argument
525 	QUEUE_TYPEOF(type) *swap_tmp = LIST_FIRST(head1);		\
526 	LIST_FIRST((head1)) = LIST_FIRST((head2));			\
528 	if ((swap_tmp = LIST_FIRST((head1))) != NULL)			\
529 		swap_tmp->field.le_prev = &LIST_FIRST((head1));		\
602 #define	TAILQ_CONCAT(head1, head2, field) do {				\  argument
604 		*(head1)->tqh_last = (head2)->tqh_first;		\
605 		(head2)->tqh_first->field.tqe_prev = (head1)->tqh_last;	\
606 		(head1)->tqh_last = (head2)->tqh_last;			\
608 		QMD_TRACE_HEAD(head1);					\
737 #define TAILQ_SWAP(head1, head2, type, field) do {			\  argument
738 	QUEUE_TYPEOF(type) *swap_first = (head1)->tqh_first;		\
739 	QUEUE_TYPEOF(type) **swap_last = (head1)->tqh_last;		\
740 	(head1)->tqh_first = (head2)->tqh_first;			\
741 	(head1)->tqh_last = (head2)->tqh_last;				\
744 	if ((swap_first = (head1)->tqh_first) != NULL)			\
745 		swap_first->field.tqe_prev = &(head1)->tqh_first;	\
747 		(head1)->tqh_last = &(head1)->tqh_first;		\