lib/asn1/asn1_queue.h

47 #define	ASN1_TAILQ_HEAD_INITIALIZER(head)				\
48 	{ NULL, &(head).tqh_first }
59 #define	QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field)		\
60 	if ((head)->tqh_first &&					\
61 	    (head)->tqh_first->field.tqe_prev != &(head)->tqh_first)	\
62 		panic("ASN1_TAILQ_INSERT_HEAD %p %s:%d", (head), __FILE__, __LINE__);
63 #define	QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field)		\
64 	if (*(head)->tqh_last != NULL)					\
65 		panic("ASN1_TAILQ_INSERT_TAIL %p %s:%d", (head), __FILE__, __LINE__);
73 #define	QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field)		\
75 	    (head)->tqh_last != &(elm)->field.tqe_next)			\
76 		panic("ASN1_TAILQ_PREREMOVE head %p elm %p %s:%d",	\
77 		      (head), (elm), __FILE__, __LINE__);
82 #define	QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field)
83 #define	QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field)
85 #define	QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field)
89 #define	ASN1_TAILQ_INIT(head) do {					\
90 	(head)->tqh_first = NULL;					\
91 	(head)->tqh_last = &(head)->tqh_first;				\
94 #define	ASN1_TAILQ_INSERT_HEAD(head, elm, field) do {			\
95 	QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD((head), (elm), field)		\
96 	if (((elm)->field.tqe_next = (head)->tqh_first) != NULL)	\
97 		(head)->tqh_first->field.tqe_prev =			\
100 		(head)->tqh_last = &(elm)->field.tqe_next;		\
101 	(head)->tqh_first = (elm);					\
102 	(elm)->field.tqe_prev = &(head)->tqh_first;			\
105 #define	ASN1_TAILQ_INSERT_TAIL(head, elm, field) do {			\
106 	QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL((head), (elm), field)		\
108 	(elm)->field.tqe_prev = (head)->tqh_last;			\
109 	*(head)->tqh_last = (elm);					\
110 	(head)->tqh_last = &(elm)->field.tqe_next;			\
113 #define	ASN1_TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\
119 		(head)->tqh_last = &(elm)->field.tqe_next;		\
132 #define	ASN1_TAILQ_REMOVE(head, elm, field) do {			\
133 	QUEUEDEBUG_ASN1_TAILQ_PREREMOVE((head), (elm), field)		\
139 		(head)->tqh_last = (elm)->field.tqe_prev;		\
144 #define	ASN1_TAILQ_FOREACH(var, head, field)				\
145 	for ((var) = ((head)->tqh_first);				\
149 #define	ASN1_TAILQ_FOREACH_REVERSE(var, head, headname, field)		\
150 	for ((var) = (*(((struct headname *)((head)->tqh_last))->tqh_last)); \
157 #define	ASN1_TAILQ_EMPTY(head)		((head)->tqh_first == NULL)
158 #define	ASN1_TAILQ_FIRST(head)		((head)->tqh_first)
161 #define	ASN1_TAILQ_LAST(head, headname) \
162 	(*(((struct headname *)((head)->tqh_last))->tqh_last))