listelm           293 libdb/queue.h  #define LIST_INSERT_AFTER(listelm, elm, field) do {			\
listelm           294 libdb/queue.h  	if (((elm)->field.le_next = (listelm)->field.le_next) != NULL)	\
listelm           295 libdb/queue.h  		(listelm)->field.le_next->field.le_prev =		\
listelm           297 libdb/queue.h  	(listelm)->field.le_next = (elm);				\
listelm           298 libdb/queue.h  	(elm)->field.le_prev = &(listelm)->field.le_next;		\
listelm           301 libdb/queue.h  #define LIST_INSERT_BEFORE(listelm, elm, field) do {			\
listelm           302 libdb/queue.h  	(elm)->field.le_prev = (listelm)->field.le_prev;		\
listelm           303 libdb/queue.h  	(elm)->field.le_next = (listelm);				\
listelm           304 libdb/queue.h  	*(listelm)->field.le_prev = (elm);				\
listelm           305 libdb/queue.h  	(listelm)->field.le_prev = &(elm)->field.le_next;		\
listelm           391 libdb/queue.h  #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\
listelm           392 libdb/queue.h  	if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
listelm           397 libdb/queue.h  	(listelm)->field.tqe_next = (elm);				\
listelm           398 libdb/queue.h  	(elm)->field.tqe_prev = &(listelm)->field.tqe_next;		\
listelm           401 libdb/queue.h  #define TAILQ_INSERT_BEFORE(listelm, elm, field) do {			\
listelm           402 libdb/queue.h  	(elm)->field.tqe_prev = (listelm)->field.tqe_prev;		\
listelm           403 libdb/queue.h  	(elm)->field.tqe_next = (listelm);				\
listelm           404 libdb/queue.h  	*(listelm)->field.tqe_prev = (elm);				\
listelm           405 libdb/queue.h  	(listelm)->field.tqe_prev = &(elm)->field.tqe_next;		\
listelm           458 libdb/queue.h  #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\
listelm           459 libdb/queue.h  	(elm)->field.cqe_next = (listelm)->field.cqe_next;		\
listelm           460 libdb/queue.h  	(elm)->field.cqe_prev = (listelm);				\
listelm           461 libdb/queue.h  	if ((listelm)->field.cqe_next == (void *)(head))		\
listelm           464 libdb/queue.h  		(listelm)->field.cqe_next->field.cqe_prev = (elm);	\
listelm           465 libdb/queue.h  	(listelm)->field.cqe_next = (elm);				\
listelm           468 libdb/queue.h  #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do {		\
listelm           469 libdb/queue.h  	(elm)->field.cqe_next = (listelm);				\
listelm           470 libdb/queue.h  	(elm)->field.cqe_prev = (listelm)->field.cqe_prev;		\
listelm           471 libdb/queue.h  	if ((listelm)->field.cqe_prev == (void *)(head))		\
listelm           474 libdb/queue.h  		(listelm)->field.cqe_prev->field.cqe_next = (elm);	\
listelm           475 libdb/queue.h  	(listelm)->field.cqe_prev = (elm);				\