Go to the documentation of this file.
40 #ifndef SURICATA_QUEUE_H
41 #define SURICATA_QUEUE_H
54 #if defined(HAVE_SYS_QUEUE_H) && !defined(__clang_analyzer__)
55 #include <sys/queue.h>
58 #if defined(__clang_analyzer__)
59 #define _Q_ASSERT(a) assert((a))
77 #define CIRCLEQ_HEAD(name, type) \
79 struct type *cqh_first; \
80 struct type *cqh_last; \
83 #define CIRCLEQ_HEAD_INITIALIZER(head) \
84 { CIRCLEQ_END(&head), CIRCLEQ_END(&head) }
86 #define CIRCLEQ_ENTRY(type) \
88 struct type *cqe_next; \
89 struct type *cqe_prev; \
95 #define CIRCLEQ_FIRST(head) ((head)->cqh_first)
96 #define CIRCLEQ_LAST(head) ((head)->cqh_last)
97 #define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next)
98 #define CIRCLEQ_PREV(elm, field) ((elm)->field.cqe_prev)
99 #define CIRCLEQ_EMPTY(head) \
100 (CIRCLEQ_FIRST(head) == CIRCLEQ_END(head))
102 #define CIRCLEQ_FOREACH(var, head, field) \
103 for((var) = CIRCLEQ_FIRST(head); \
104 (var) != CIRCLEQ_END(head); \
105 (var) = CIRCLEQ_NEXT(var, field))
107 #define CIRCLEQ_FOREACH_SAFE(var, head, field, tvar) \
108 for ((var) = CIRCLEQ_FIRST(head); \
109 (var) != CIRCLEQ_END(head) && \
110 ((tvar) = CIRCLEQ_NEXT(var, field), 1); \
113 #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \
114 for((var) = CIRCLEQ_LAST(head); \
115 (var) != CIRCLEQ_END(head); \
116 (var) = CIRCLEQ_PREV(var, field))
118 #define CIRCLEQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \
119 for ((var) = CIRCLEQ_LAST(head, headname); \
120 (var) != CIRCLEQ_END(head) && \
121 ((tvar) = CIRCLEQ_PREV(var, headname, field), 1); \
127 #define CIRCLEQ_INIT(head) do { \
128 (head)->cqh_first = CIRCLEQ_END(head); \
129 (head)->cqh_last = CIRCLEQ_END(head); \
132 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \
133 (elm)->field.cqe_next = (listelm)->field.cqe_next; \
134 (elm)->field.cqe_prev = (listelm); \
135 if ((listelm)->field.cqe_next == CIRCLEQ_END(head)) \
136 (head)->cqh_last = (elm); \
138 (listelm)->field.cqe_next->field.cqe_prev = (elm); \
139 (listelm)->field.cqe_next = (elm); \
142 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \
143 (elm)->field.cqe_next = (listelm); \
144 (elm)->field.cqe_prev = (listelm)->field.cqe_prev; \
145 if ((listelm)->field.cqe_prev == CIRCLEQ_END(head)) \
146 (head)->cqh_first = (elm); \
148 (listelm)->field.cqe_prev->field.cqe_next = (elm); \
149 (listelm)->field.cqe_prev = (elm); \
152 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \
153 (elm)->field.cqe_next = (head)->cqh_first; \
154 (elm)->field.cqe_prev = CIRCLEQ_END(head); \
155 if ((head)->cqh_last == CIRCLEQ_END(head)) \
156 (head)->cqh_last = (elm); \
158 (head)->cqh_first->field.cqe_prev = (elm); \
159 (head)->cqh_first = (elm); \
162 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \
163 (elm)->field.cqe_next = CIRCLEQ_END(head); \
164 (elm)->field.cqe_prev = (head)->cqh_last; \
165 if ((head)->cqh_first == CIRCLEQ_END(head)) \
166 (head)->cqh_first = (elm); \
168 (head)->cqh_last->field.cqe_next = (elm); \
169 (head)->cqh_last = (elm); \
172 #define CIRCLEQ_REMOVE(head, elm, field) do { \
173 if ((elm)->field.cqe_next == CIRCLEQ_END(head)) \
174 (head)->cqh_last = (elm)->field.cqe_prev; \
176 (elm)->field.cqe_next->field.cqe_prev = \
177 (elm)->field.cqe_prev; \
178 if ((elm)->field.cqe_prev == CIRCLEQ_END(head)) \
179 (head)->cqh_first = (elm)->field.cqe_next; \
181 (elm)->field.cqe_prev->field.cqe_next = \
182 (elm)->field.cqe_next; \
185 #define CIRCLEQ_REPLACE(head, elm, elm2, field) do { \
186 if (((elm2)->field.cqe_next = (elm)->field.cqe_next) == \
188 (head)->cqh_last = (elm2); \
190 (elm2)->field.cqe_next->field.cqe_prev = (elm2); \
191 if (((elm2)->field.cqe_prev = (elm)->field.cqe_prev) == \
193 (head)->cqh_first = (elm2); \
195 (elm2)->field.cqe_prev->field.cqe_next = (elm2); \
202 #define CIRCLEQ_END(head) ((void *)(head))
205 #ifndef CIRCLEQ_FOREACH_SAFE
206 #define CIRCLEQ_FOREACH_SAFE(var, head, field, tvar) \
207 for ((var) = CIRCLEQ_FIRST(head); \
208 (var) != CIRCLEQ_END(head) && \
209 ((tvar) = CIRCLEQ_NEXT(var, field), 1); \
212 #define CIRCLEQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \
213 for ((var) = CIRCLEQ_LAST(head, headname); \
214 (var) != CIRCLEQ_END(head) && \
215 ((tvar) = CIRCLEQ_PREV(var, headname, field), 1); \
231 #define TAILQ_HEAD(name, type) \
233 struct type *tqh_first; \
234 struct type **tqh_last; \
237 #define TAILQ_HEAD_INITIALIZER(head) \
238 { NULL, &(head).tqh_first }
240 #define TAILQ_ENTRY(type) \
242 struct type *tqe_next; \
243 struct type **tqe_prev; \
249 #define TAILQ_EMPTY(head) ((head)->tqh_first == NULL)
251 #define TAILQ_FIRST(head) ((head)->tqh_first)
253 #define TAILQ_FOREACH(var, head, field) \
254 for ((var) = TAILQ_FIRST((head)); \
256 (var) = TAILQ_NEXT((var), field))
258 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \
259 for ((var) = TAILQ_LAST((head), headname); \
261 (var) = TAILQ_PREV((var), headname, field))
263 #define TAILQ_INIT(head) do { \
264 TAILQ_FIRST((head)) = NULL; \
265 (head)->tqh_last = &TAILQ_FIRST((head)); \
268 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
269 if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\
270 TAILQ_NEXT((elm), field)->field.tqe_prev = \
271 &TAILQ_NEXT((elm), field); \
273 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
274 TAILQ_NEXT((listelm), field) = (elm); \
275 (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field); \
278 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \
279 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
280 TAILQ_NEXT((elm), field) = (listelm); \
281 *(listelm)->field.tqe_prev = (elm); \
282 (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field); \
285 #define TAILQ_INSERT_HEAD(head, elm, field) do { \
286 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
287 TAILQ_FIRST((head))->field.tqe_prev = \
288 &TAILQ_NEXT((elm), field); \
290 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
291 TAILQ_FIRST((head)) = (elm); \
292 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
295 #define TAILQ_INSERT_TAIL(head, elm, field) do { \
298 TAILQ_NEXT((elm), field) = NULL; \
299 (elm)->field.tqe_prev = (head)->tqh_last; \
300 *(head)->tqh_last = (elm); \
301 _Q_ASSERT(*(head)->tqh_last); \
302 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
305 #define TAILQ_LAST(head, headname) \
306 (*(((struct headname *)((head)->tqh_last))->tqh_last))
308 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
310 #define TAILQ_PREV(elm, headname, field) \
311 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
313 #define TAILQ_REMOVE(head, elm, field) do { \
314 if ((TAILQ_NEXT((elm), field)) != NULL) \
315 TAILQ_NEXT((elm), field)->field.tqe_prev = \
316 (elm)->field.tqe_prev; \
318 (head)->tqh_last = (elm)->field.tqe_prev; \
319 _Q_ASSERT((head)->tqh_first != (elm)); \
320 *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field); \
329 #ifndef TAILQ_FOREACH_SAFE
330 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \
331 for ((var) = TAILQ_FIRST((head)); \
332 (var) && ((tvar) = TAILQ_NEXT((var), field), 1); \