232 #define LIST_REPLACE(elm, elm2, field) do {				\  argument
233 	if (((elm2)->field.le_next = (elm)->field.le_next) != NULL)	\
234 		(elm2)->field.le_next->field.le_prev =			\
235 		    &(elm2)->field.le_next;				\
236 	(elm2)->field.le_prev = (elm)->field.le_prev;			\
237 	*(elm2)->field.le_prev = (elm2);				\
398 #define TAILQ_REPLACE(head, elm, elm2, field) do {			\  argument
399 	if (((elm2)->field.tqe_next = (elm)->field.tqe_next) != NULL)	\
400 		(elm2)->field.tqe_next->field.tqe_prev =		\
401 		    &(elm2)->field.tqe_next;				\
403 		(head)->tqh_last = &(elm2)->field.tqe_next;		\
404 	(elm2)->field.tqe_prev = (elm)->field.tqe_prev;			\
405 	*(elm2)->field.tqe_prev = (elm2);				\
512 #define CIRCLEQ_REPLACE(head, elm, elm2, field) do {			\  argument
513 	if (((elm2)->field.cqe_next = (elm)->field.cqe_next) ==		\
515 		(head).cqh_last = (elm2);				\
517 		(elm2)->field.cqe_next->field.cqe_prev = (elm2);	\
518 	if (((elm2)->field.cqe_prev = (elm)->field.cqe_prev) ==		\
520 		(head).cqh_first = (elm2);				\
522 		(elm2)->field.cqe_prev->field.cqe_next = (elm2);	\