listelm           201 sys/queue.h    #define LIST_INSERT_AFTER(listelm, elm, field) do {			\
listelm           202 sys/queue.h    	if (((elm)->field.le_next = (listelm)->field.le_next) != NULL)	\
listelm           203 sys/queue.h    		(listelm)->field.le_next->field.le_prev =		\
listelm           205 sys/queue.h    	(listelm)->field.le_next = (elm);				\
listelm           206 sys/queue.h    	(elm)->field.le_prev = &(listelm)->field.le_next;		\
listelm           209 sys/queue.h    #define	LIST_INSERT_BEFORE(listelm, elm, field) do {			\
listelm           210 sys/queue.h    	(elm)->field.le_prev = (listelm)->field.le_prev;		\
listelm           211 sys/queue.h    	(elm)->field.le_next = (listelm);				\
listelm           212 sys/queue.h    	*(listelm)->field.le_prev = (elm);				\
listelm           213 sys/queue.h    	(listelm)->field.le_prev = &(elm)->field.le_next;		\
listelm           292 sys/queue.h    #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\
listelm           293 sys/queue.h    	if (((elm)->field.sqe_next = (listelm)->field.sqe_next) == NULL)\
listelm           295 sys/queue.h    	(listelm)->field.sqe_next = (elm);				\
listelm           370 sys/queue.h    #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\
listelm           371 sys/queue.h    	if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
listelm           376 sys/queue.h    	(listelm)->field.tqe_next = (elm);				\
listelm           377 sys/queue.h    	(elm)->field.tqe_prev = &(listelm)->field.tqe_next;		\
listelm           380 sys/queue.h    #define	TAILQ_INSERT_BEFORE(listelm, elm, field) do {			\
listelm           381 sys/queue.h    	(elm)->field.tqe_prev = (listelm)->field.tqe_prev;		\
listelm           382 sys/queue.h    	(elm)->field.tqe_next = (listelm);				\
listelm           383 sys/queue.h    	*(listelm)->field.tqe_prev = (elm);				\
listelm           384 sys/queue.h    	(listelm)->field.tqe_prev = &(elm)->field.tqe_next;		\
listelm           457 sys/queue.h    #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\
listelm           458 sys/queue.h    	(elm)->field.cqe_next = (listelm)->field.cqe_next;		\
listelm           459 sys/queue.h    	(elm)->field.cqe_prev = (listelm);				\
listelm           460 sys/queue.h    	if ((listelm)->field.cqe_next == CIRCLEQ_END(head))		\
listelm           463 sys/queue.h    		(listelm)->field.cqe_next->field.cqe_prev = (elm);	\
listelm           464 sys/queue.h    	(listelm)->field.cqe_next = (elm);				\
listelm           467 sys/queue.h    #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do {		\
listelm           468 sys/queue.h    	(elm)->field.cqe_next = (listelm);				\
listelm           469 sys/queue.h    	(elm)->field.cqe_prev = (listelm)->field.cqe_prev;		\
listelm           470 sys/queue.h    	if ((listelm)->field.cqe_prev == CIRCLEQ_END(head))		\
listelm           473 sys/queue.h    		(listelm)->field.cqe_prev->field.cqe_next = (elm);	\
listelm           474 sys/queue.h    	(listelm)->field.cqe_prev = (elm);				\