listelm           113 source4/heimdal/lib/asn1/asn1_queue.h #define	ASN1_TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\
listelm           114 source4/heimdal/lib/asn1/asn1_queue.h 	QUEUEDEBUG_ASN1_TAILQ_OP((listelm), field)			\
listelm           115 source4/heimdal/lib/asn1/asn1_queue.h 	if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
listelm           120 source4/heimdal/lib/asn1/asn1_queue.h 	(listelm)->field.tqe_next = (elm);				\
listelm           121 source4/heimdal/lib/asn1/asn1_queue.h 	(elm)->field.tqe_prev = &(listelm)->field.tqe_next;		\
listelm           124 source4/heimdal/lib/asn1/asn1_queue.h #define	ASN1_TAILQ_INSERT_BEFORE(listelm, elm, field) do {		\
listelm           125 source4/heimdal/lib/asn1/asn1_queue.h 	QUEUEDEBUG_ASN1_TAILQ_OP((listelm), field)			\
listelm           126 source4/heimdal/lib/asn1/asn1_queue.h 	(elm)->field.tqe_prev = (listelm)->field.tqe_prev;		\
listelm           127 source4/heimdal/lib/asn1/asn1_queue.h 	(elm)->field.tqe_next = (listelm);				\
listelm           128 source4/heimdal/lib/asn1/asn1_queue.h 	*(listelm)->field.tqe_prev = (elm);				\
listelm           129 source4/heimdal/lib/asn1/asn1_queue.h 	(listelm)->field.tqe_prev = &(elm)->field.tqe_next;		\