255 #define SLIST_SWAP(head1, head2, type) do {				\  argument
257 	SLIST_FIRST(head1) = SLIST_FIRST(head2);			\
258 	SLIST_FIRST(head2) = swap_first;				\
292 #define	STAILQ_CONCAT(head1, head2) do {				\  argument
293 	if (!STAILQ_EMPTY((head2))) {					\
294 		*(head1)->stqh_last = (head2)->stqh_first;		\
295 		(head1)->stqh_last = (head2)->stqh_last;		\
296 		STAILQ_INIT((head2));					\
380 #define STAILQ_SWAP(head1, head2, type) do {				\  argument
383 	STAILQ_FIRST(head1) = STAILQ_FIRST(head2);			\
384 	(head1)->stqh_last = (head2)->stqh_last;			\
385 	STAILQ_FIRST(head2) = swap_first;				\
386 	(head2)->stqh_last = swap_last;					\
389 	if (STAILQ_EMPTY(head2))					\
390 		(head2)->stqh_last = &STAILQ_FIRST(head2);		\
524 #define LIST_SWAP(head1, head2, type, field) do {			\  argument
526 	LIST_FIRST((head1)) = LIST_FIRST((head2));			\
527 	LIST_FIRST((head2)) = swap_tmp;					\
530 	if ((swap_tmp = LIST_FIRST((head2))) != NULL)			\
531 		swap_tmp->field.le_prev = &LIST_FIRST((head2));		\
602 #define	TAILQ_CONCAT(head1, head2, field) do {				\  argument
603 	if (!TAILQ_EMPTY(head2)) {					\
604 		*(head1)->tqh_last = (head2)->tqh_first;		\
605 		(head2)->tqh_first->field.tqe_prev = (head1)->tqh_last;	\
606 		(head1)->tqh_last = (head2)->tqh_last;			\
607 		TAILQ_INIT((head2));					\
609 		QMD_TRACE_HEAD(head2);					\
737 #define TAILQ_SWAP(head1, head2, type, field) do {			\  argument
740 	(head1)->tqh_first = (head2)->tqh_first;			\
741 	(head1)->tqh_last = (head2)->tqh_last;				\
742 	(head2)->tqh_first = swap_first;				\
743 	(head2)->tqh_last = swap_last;					\
748 	if ((swap_first = (head2)->tqh_first) != NULL)			\
749 		swap_first->field.tqe_prev = &(head2)->tqh_first;	\
751 		(head2)->tqh_last = &(head2)->tqh_first;		\