lib/asn1/asn1_queue.h

59 #define	QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field)		\
61 	    (head)->tqh_first->field.tqe_prev != &(head)->tqh_first)	\
63 #define	QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field)		\
66 #define	QUEUEDEBUG_ASN1_TAILQ_OP(elm, field)				\
67 	if ((elm)->field.tqe_next &&					\
68 	    (elm)->field.tqe_next->field.tqe_prev !=			\
69 	    &(elm)->field.tqe_next)					\
71 	if (*(elm)->field.tqe_prev != (elm))				\
73 #define	QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field)		\
74 	if ((elm)->field.tqe_next == NULL &&				\
75 	    (head)->tqh_last != &(elm)->field.tqe_next)			\
78 #define	QUEUEDEBUG_ASN1_TAILQ_POSTREMOVE(elm, field)			\
79 	(elm)->field.tqe_next = (void *)1L;				\
80 	(elm)->field.tqe_prev = (void *)1L;
82 #define	QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field)
83 #define	QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field)
84 #define	QUEUEDEBUG_ASN1_TAILQ_OP(elm, field)
85 #define	QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field)
86 #define	QUEUEDEBUG_ASN1_TAILQ_POSTREMOVE(elm, field)
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 =			\
98 		    &(elm)->field.tqe_next;				\
100 		(head)->tqh_last = &(elm)->field.tqe_next;		\
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)		\
107 	(elm)->field.tqe_next = NULL;					\
108 	(elm)->field.tqe_prev = (head)->tqh_last;			\
110 	(head)->tqh_last = &(elm)->field.tqe_next;			\
113 #define	ASN1_TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\
114 	QUEUEDEBUG_ASN1_TAILQ_OP((listelm), field)			\
115 	if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
116 		(elm)->field.tqe_next->field.tqe_prev = 		\
117 		    &(elm)->field.tqe_next;				\
119 		(head)->tqh_last = &(elm)->field.tqe_next;		\
120 	(listelm)->field.tqe_next = (elm);				\
121 	(elm)->field.tqe_prev = &(listelm)->field.tqe_next;		\
124 #define	ASN1_TAILQ_INSERT_BEFORE(listelm, elm, field) do {		\
125 	QUEUEDEBUG_ASN1_TAILQ_OP((listelm), field)			\
126 	(elm)->field.tqe_prev = (listelm)->field.tqe_prev;		\
127 	(elm)->field.tqe_next = (listelm);				\
128 	*(listelm)->field.tqe_prev = (elm);				\
129 	(listelm)->field.tqe_prev = &(elm)->field.tqe_next;		\
132 #define	ASN1_TAILQ_REMOVE(head, elm, field) do {			\
133 	QUEUEDEBUG_ASN1_TAILQ_PREREMOVE((head), (elm), field)		\
134 	QUEUEDEBUG_ASN1_TAILQ_OP((elm), field)				\
135 	if (((elm)->field.tqe_next) != NULL)				\
136 		(elm)->field.tqe_next->field.tqe_prev = 		\
137 		    (elm)->field.tqe_prev;				\
139 		(head)->tqh_last = (elm)->field.tqe_prev;		\
140 	*(elm)->field.tqe_prev = (elm)->field.tqe_next;			\
141 	QUEUEDEBUG_ASN1_TAILQ_POSTREMOVE((elm), field);			\
144 #define	ASN1_TAILQ_FOREACH(var, head, field)				\
147 		(var) = ((var)->field.tqe_next))
149 #define	ASN1_TAILQ_FOREACH_REVERSE(var, head, headname, field)		\
152 		(var) = (*(((struct headname *)((var)->field.tqe_prev))->tqh_last)))
159 #define	ASN1_TAILQ_NEXT(elm, field)		((elm)->field.tqe_next)
163 #define	ASN1_TAILQ_PREV(elm, headname, field) \
164 	(*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))