listelm           282 libdb/queue.h  #define LIST_INSERT_AFTER(listelm, elm, field) do {			\
listelm           283 libdb/queue.h  	if (((elm)->field.le_next = (listelm)->field.le_next) != NULL)	\
listelm           284 libdb/queue.h  		(listelm)->field.le_next->field.le_prev =		\
listelm           286 libdb/queue.h  	(listelm)->field.le_next = (elm);				\
listelm           287 libdb/queue.h  	(elm)->field.le_prev = &(listelm)->field.le_next;		\
listelm           290 libdb/queue.h  #define LIST_INSERT_BEFORE(listelm, elm, field) do {			\
listelm           291 libdb/queue.h  	(elm)->field.le_prev = (listelm)->field.le_prev;		\
listelm           292 libdb/queue.h  	(elm)->field.le_next = (listelm);				\
listelm           293 libdb/queue.h  	*(listelm)->field.le_prev = (elm);				\
listelm           294 libdb/queue.h  	(listelm)->field.le_prev = &(elm)->field.le_next;		\
listelm           376 libdb/queue.h  #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\
listelm           377 libdb/queue.h  	if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
listelm           382 libdb/queue.h  	(listelm)->field.tqe_next = (elm);				\
listelm           383 libdb/queue.h  	(elm)->field.tqe_prev = &(listelm)->field.tqe_next;		\
listelm           386 libdb/queue.h  #define TAILQ_INSERT_BEFORE(listelm, elm, field) do {			\
listelm           387 libdb/queue.h  	(elm)->field.tqe_prev = (listelm)->field.tqe_prev;		\
listelm           388 libdb/queue.h  	(elm)->field.tqe_next = (listelm);				\
listelm           389 libdb/queue.h  	*(listelm)->field.tqe_prev = (elm);				\
listelm           390 libdb/queue.h  	(listelm)->field.tqe_prev = &(elm)->field.tqe_next;		\
listelm           439 libdb/queue.h  #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\
listelm           440 libdb/queue.h  	(elm)->field.cqe_next = (listelm)->field.cqe_next;		\
listelm           441 libdb/queue.h  	(elm)->field.cqe_prev = (listelm);				\
listelm           442 libdb/queue.h  	if ((listelm)->field.cqe_next == (void *)(head))		\
listelm           445 libdb/queue.h  		(listelm)->field.cqe_next->field.cqe_prev = (elm);	\
listelm           446 libdb/queue.h  	(listelm)->field.cqe_next = (elm);				\
listelm           449 libdb/queue.h  #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do {		\
listelm           450 libdb/queue.h  	(elm)->field.cqe_next = (listelm);				\
listelm           451 libdb/queue.h  	(elm)->field.cqe_prev = (listelm)->field.cqe_prev;		\
listelm           452 libdb/queue.h  	if ((listelm)->field.cqe_prev == (void *)(head))		\
listelm           455 libdb/queue.h  		(listelm)->field.cqe_prev->field.cqe_next = (elm);	\
listelm           456 libdb/queue.h  	(listelm)->field.cqe_prev = (elm);				\