298 #define LIST_INSERT_AFTER(listelm, elm, field) do {			\  argument
299 	if (((elm)->field.le_next = (listelm)->field.le_next) != NULL)	\
300 		(listelm)->field.le_next->field.le_prev =		\
302 	(listelm)->field.le_next = (elm);				\
303 	(elm)->field.le_prev = &(listelm)->field.le_next;		\
306 #define	LIST_INSERT_BEFORE(listelm, elm, field) do {			\  argument
307 	(elm)->field.le_prev = (listelm)->field.le_prev;		\
308 	(elm)->field.le_next = (listelm);				\
309 	*(listelm)->field.le_prev = (elm);				\
310 	(listelm)->field.le_prev = &(elm)->field.le_next;		\
394 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
395 	if (((elm)->field.sqe_next = (listelm)->field.sqe_next) == NULL)\
397 	(listelm)->field.sqe_next = (elm);				\
477 #define XSIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
478 	if (((elm)->field.sqx_next = (listelm)->field.sqx_next) ==	\
481 	(listelm)->field.sqx_next = XSIMPLEQ_XOR(head, (elm));		\
579 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
580 	if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
585 	(listelm)->field.tqe_next = (elm);				\
586 	(elm)->field.tqe_prev = &(listelm)->field.tqe_next;		\
589 #define	TAILQ_INSERT_BEFORE(listelm, elm, field) do {			\  argument
590 	(elm)->field.tqe_prev = (listelm)->field.tqe_prev;		\
591 	(elm)->field.tqe_next = (listelm);				\
592 	*(listelm)->field.tqe_prev = (elm);				\
593 	(listelm)->field.tqe_prev = &(elm)->field.tqe_next;		\