Go to the documentation of this file.
85 #if defined(QUEUE_MACRO_DEBUG) || (defined(_KERNEL) && defined(DIAGNOSTIC))
86 #define _Q_INVALIDATE(a) (a) = ((void *)-1)
88 #define _Q_INVALIDATE(a)
94 #define SLIST_HEAD(name, type) \
96 struct type *slh_first; \
99 #define SLIST_HEAD_INITIALIZER(head) \
102 #define SLIST_ENTRY(type) \
104 struct type *sle_next; \
110 #define SLIST_FIRST(head) ((head)->slh_first)
111 #define SLIST_END(head) NULL
112 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head))
113 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
115 #define SLIST_FOREACH(var, head, field) \
116 for((var) = SLIST_FIRST(head); \
117 (var) != SLIST_END(head); \
118 (var) = SLIST_NEXT(var, field))
120 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \
121 for ((varp) = &SLIST_FIRST((head)); \
122 ((var) = *(varp)) != SLIST_END(head); \
123 (varp) = &SLIST_NEXT((var), field))
128 #define SLIST_INIT(head) { \
129 SLIST_FIRST(head) = SLIST_END(head); \
132 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
133 (elm)->field.sle_next = (slistelm)->field.sle_next; \
134 (slistelm)->field.sle_next = (elm); \
137 #define SLIST_INSERT_HEAD(head, elm, field) do { \
138 (elm)->field.sle_next = (head)->slh_first; \
139 (head)->slh_first = (elm); \
142 #define SLIST_REMOVE_NEXT(head, elm, field) do { \
143 (elm)->field.sle_next = (elm)->field.sle_next->field.sle_next; \
146 #define SLIST_REMOVE_HEAD(head, field) do { \
147 (head)->slh_first = (head)->slh_first->field.sle_next; \
150 #define SLIST_REMOVE(head, elm, type, field) do { \
151 if ((head)->slh_first == (elm)) { \
152 SLIST_REMOVE_HEAD((head), field); \
154 struct type *curelm = (head)->slh_first; \
156 while (curelm->field.sle_next != (elm)) \
157 curelm = curelm->field.sle_next; \
158 curelm->field.sle_next = \
159 curelm->field.sle_next->field.sle_next; \
160 _Q_INVALIDATE((elm)->field.sle_next); \
167 #define LIST_HEAD(name, type) \
169 struct type *lh_first; \
172 #define LIST_HEAD_INITIALIZER(head) \
175 #define LIST_ENTRY(type) \
177 struct type *le_next; \
178 struct type **le_prev; \
184 #define LIST_FIRST(head) ((head)->lh_first)
185 #define LIST_END(head) NULL
186 #define LIST_EMPTY(head) (LIST_FIRST(head) == LIST_END(head))
187 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
189 #define LIST_FOREACH(var, head, field) \
190 for((var) = LIST_FIRST(head); \
191 (var)!= LIST_END(head); \
192 (var) = LIST_NEXT(var, field))
197 #define LIST_INIT(head) do { \
198 LIST_FIRST(head) = LIST_END(head); \
201 #define LIST_INSERT_AFTER(listelm, elm, field) do { \
202 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
203 (listelm)->field.le_next->field.le_prev = \
204 &(elm)->field.le_next; \
205 (listelm)->field.le_next = (elm); \
206 (elm)->field.le_prev = &(listelm)->field.le_next; \
209 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \
210 (elm)->field.le_prev = (listelm)->field.le_prev; \
211 (elm)->field.le_next = (listelm); \
212 *(listelm)->field.le_prev = (elm); \
213 (listelm)->field.le_prev = &(elm)->field.le_next; \
216 #define LIST_INSERT_HEAD(head, elm, field) do { \
217 if (((elm)->field.le_next = (head)->lh_first) != NULL) \
218 (head)->lh_first->field.le_prev = &(elm)->field.le_next;\
219 (head)->lh_first = (elm); \
220 (elm)->field.le_prev = &(head)->lh_first; \
223 #define LIST_REMOVE(elm, field) do { \
224 if ((elm)->field.le_next != NULL) \
225 (elm)->field.le_next->field.le_prev = \
226 (elm)->field.le_prev; \
227 *(elm)->field.le_prev = (elm)->field.le_next; \
228 _Q_INVALIDATE((elm)->field.le_prev); \
229 _Q_INVALIDATE((elm)->field.le_next); \
232 #define LIST_REPLACE(elm, elm2, field) do { \
233 if (((elm2)->field.le_next = (elm)->field.le_next) != NULL) \
234 (elm2)->field.le_next->field.le_prev = \
235 &(elm2)->field.le_next; \
236 (elm2)->field.le_prev = (elm)->field.le_prev; \
237 *(elm2)->field.le_prev = (elm2); \
238 _Q_INVALIDATE((elm)->field.le_prev); \
239 _Q_INVALIDATE((elm)->field.le_next); \
245 #define SIMPLEQ_HEAD(name, type) \
247 struct type *sqh_first; \
248 struct type **sqh_last; \
251 #define SIMPLEQ_HEAD_INITIALIZER(head) \
252 { NULL, &(head).sqh_first }
254 #define SIMPLEQ_ENTRY(type) \
256 struct type *sqe_next; \
262 #define SIMPLEQ_FIRST(head) ((head)->sqh_first)
263 #define SIMPLEQ_END(head) NULL
264 #define SIMPLEQ_EMPTY(head) (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head))
265 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next)
267 #define SIMPLEQ_FOREACH(var, head, field) \
268 for((var) = SIMPLEQ_FIRST(head); \
269 (var) != SIMPLEQ_END(head); \
270 (var) = SIMPLEQ_NEXT(var, field))
275 #define SIMPLEQ_INIT(head) do { \
276 (head)->sqh_first = NULL; \
277 (head)->sqh_last = &(head)->sqh_first; \
280 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \
281 if (((elm)->field.sqe_next = (head)->sqh_first) == NULL) \
282 (head)->sqh_last = &(elm)->field.sqe_next; \
283 (head)->sqh_first = (elm); \
286 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \
287 (elm)->field.sqe_next = NULL; \
288 *(head)->sqh_last = (elm); \
289 (head)->sqh_last = &(elm)->field.sqe_next; \
292 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \
293 if (((elm)->field.sqe_next = (listelm)->field.sqe_next) == NULL)\
294 (head)->sqh_last = &(elm)->field.sqe_next; \
295 (listelm)->field.sqe_next = (elm); \
298 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \
299 if (((head)->sqh_first = (head)->sqh_first->field.sqe_next) == NULL) \
300 (head)->sqh_last = &(head)->sqh_first; \
306 #define TAILQ_HEAD(name, type) \
308 struct type *tqh_first; \
309 struct type **tqh_last; \
312 #define TAILQ_HEAD_INITIALIZER(head) \
313 { NULL, &(head).tqh_first }
315 #define TAILQ_ENTRY(type) \
317 struct type *tqe_next; \
318 struct type **tqe_prev; \
324 #define TAILQ_FIRST(head) ((head)->tqh_first)
325 #define TAILQ_END(head) NULL
326 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
327 #define TAILQ_LAST(head, headname) \
328 (*(((struct headname *)((head)->tqh_last))->tqh_last))
330 #define TAILQ_PREV(elm, headname, field) \
331 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
332 #define TAILQ_EMPTY(head) \
333 (TAILQ_FIRST(head) == TAILQ_END(head))
335 #define TAILQ_FOREACH(var, head, field) \
336 for((var) = TAILQ_FIRST(head); \
337 (var) != TAILQ_END(head); \
338 (var) = TAILQ_NEXT(var, field))
340 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \
341 for((var) = TAILQ_LAST(head, headname); \
342 (var) != TAILQ_END(head); \
343 (var) = TAILQ_PREV(var, headname, field))
348 #define TAILQ_INIT(head) do { \
349 (head)->tqh_first = NULL; \
350 (head)->tqh_last = &(head)->tqh_first; \
353 #define TAILQ_INSERT_HEAD(head, elm, field) do { \
354 if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \
355 (head)->tqh_first->field.tqe_prev = \
356 &(elm)->field.tqe_next; \
358 (head)->tqh_last = &(elm)->field.tqe_next; \
359 (head)->tqh_first = (elm); \
360 (elm)->field.tqe_prev = &(head)->tqh_first; \
363 #define TAILQ_INSERT_TAIL(head, elm, field) do { \
364 (elm)->field.tqe_next = NULL; \
365 (elm)->field.tqe_prev = (head)->tqh_last; \
366 *(head)->tqh_last = (elm); \
367 (head)->tqh_last = &(elm)->field.tqe_next; \
370 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
371 if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
372 (elm)->field.tqe_next->field.tqe_prev = \
373 &(elm)->field.tqe_next; \
375 (head)->tqh_last = &(elm)->field.tqe_next; \
376 (listelm)->field.tqe_next = (elm); \
377 (elm)->field.tqe_prev = &(listelm)->field.tqe_next; \
380 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \
381 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
382 (elm)->field.tqe_next = (listelm); \
383 *(listelm)->field.tqe_prev = (elm); \
384 (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \
387 #define TAILQ_REMOVE(head, elm, field) do { \
388 if (((elm)->field.tqe_next) != NULL) \
389 (elm)->field.tqe_next->field.tqe_prev = \
390 (elm)->field.tqe_prev; \
392 (head)->tqh_last = (elm)->field.tqe_prev; \
393 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
394 _Q_INVALIDATE((elm)->field.tqe_prev); \
395 _Q_INVALIDATE((elm)->field.tqe_next); \
398 #define TAILQ_REPLACE(head, elm, elm2, field) do { \
399 if (((elm2)->field.tqe_next = (elm)->field.tqe_next) != NULL) \
400 (elm2)->field.tqe_next->field.tqe_prev = \
401 &(elm2)->field.tqe_next; \
403 (head)->tqh_last = &(elm2)->field.tqe_next; \
404 (elm2)->field.tqe_prev = (elm)->field.tqe_prev; \
405 *(elm2)->field.tqe_prev = (elm2); \
406 _Q_INVALIDATE((elm)->field.tqe_prev); \
407 _Q_INVALIDATE((elm)->field.tqe_next); \
411 #define TAILQ_SWAP(first, second, head, field) do { \
412 *((first)->field.tqe_prev) = (second); \
413 (second)->field.tqe_prev = (first)->field.tqe_prev; \
414 (first)->field.tqe_prev = &((second)->field.tqe_next); \
415 (first)->field.tqe_next = (second)->field.tqe_next; \
416 if ((second)->field.tqe_next) \
417 (second)->field.tqe_next->field.tqe_prev = &((first)->field.tqe_next); \
418 (second)->field.tqe_next = first; \
419 if ((head)->tqh_last == &((second)->field.tqe_next)) \
420 (head)->tqh_last = &((first)->field.tqe_next); \
426 #define CIRCLEQ_HEAD(name, type) \
428 struct type *cqh_first; \
429 struct type *cqh_last; \
432 #define CIRCLEQ_HEAD_INITIALIZER(head) \
433 { CIRCLEQ_END(&head), CIRCLEQ_END(&head) }
435 #define CIRCLEQ_ENTRY(type) \
437 struct type *cqe_next; \
438 struct type *cqe_prev; \
444 #define CIRCLEQ_FIRST(head) ((head)->cqh_first)
445 #define CIRCLEQ_LAST(head) ((head)->cqh_last)
446 #define CIRCLEQ_END(head) ((void *)(head))
447 #define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next)
448 #define CIRCLEQ_PREV(elm, field) ((elm)->field.cqe_prev)
449 #define CIRCLEQ_EMPTY(head) \
450 (CIRCLEQ_FIRST(head) == CIRCLEQ_END(head))
452 #define CIRCLEQ_FOREACH(var, head, field) \
453 for((var) = CIRCLEQ_FIRST(head); \
454 (var) != CIRCLEQ_END(head); \
455 (var) = CIRCLEQ_NEXT(var, field))
457 #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \
458 for((var) = CIRCLEQ_LAST(head); \
459 (var) != CIRCLEQ_END(head); \
460 (var) = CIRCLEQ_PREV(var, field))
465 #define CIRCLEQ_INIT(head) do { \
466 (head)->cqh_first = CIRCLEQ_END(head); \
467 (head)->cqh_last = CIRCLEQ_END(head); \
470 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \
471 (elm)->field.cqe_next = (listelm)->field.cqe_next; \
472 (elm)->field.cqe_prev = (listelm); \
473 if ((listelm)->field.cqe_next == CIRCLEQ_END(head)) \
474 (head)->cqh_last = (elm); \
476 (listelm)->field.cqe_next->field.cqe_prev = (elm); \
477 (listelm)->field.cqe_next = (elm); \
480 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \
481 (elm)->field.cqe_next = (listelm); \
482 (elm)->field.cqe_prev = (listelm)->field.cqe_prev; \
483 if ((listelm)->field.cqe_prev == CIRCLEQ_END(head)) \
484 (head)->cqh_first = (elm); \
486 (listelm)->field.cqe_prev->field.cqe_next = (elm); \
487 (listelm)->field.cqe_prev = (elm); \
490 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \
491 (elm)->field.cqe_next = (head)->cqh_first; \
492 (elm)->field.cqe_prev = CIRCLEQ_END(head); \
493 if ((head)->cqh_last == CIRCLEQ_END(head)) \
494 (head)->cqh_last = (elm); \
496 (head)->cqh_first->field.cqe_prev = (elm); \
497 (head)->cqh_first = (elm); \
500 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \
501 (elm)->field.cqe_next = CIRCLEQ_END(head); \
502 (elm)->field.cqe_prev = (head)->cqh_last; \
503 if ((head)->cqh_first == CIRCLEQ_END(head)) \
504 (head)->cqh_first = (elm); \
506 (head)->cqh_last->field.cqe_next = (elm); \
507 (head)->cqh_last = (elm); \
510 #define CIRCLEQ_REMOVE(head, elm, field) do { \
511 if ((elm)->field.cqe_next == CIRCLEQ_END(head)) \
512 (head)->cqh_last = (elm)->field.cqe_prev; \
514 (elm)->field.cqe_next->field.cqe_prev = \
515 (elm)->field.cqe_prev; \
516 if ((elm)->field.cqe_prev == CIRCLEQ_END(head)) \
517 (head)->cqh_first = (elm)->field.cqe_next; \
519 (elm)->field.cqe_prev->field.cqe_next = \
520 (elm)->field.cqe_next; \
521 _Q_INVALIDATE((elm)->field.cqe_prev); \
522 _Q_INVALIDATE((elm)->field.cqe_next); \
525 #define CIRCLEQ_REPLACE(head, elm, elm2, field) do { \
526 if (((elm2)->field.cqe_next = (elm)->field.cqe_next) == \
528 (head)->cqh_last = (elm2); \
530 (elm2)->field.cqe_next->field.cqe_prev = (elm2); \
531 if (((elm2)->field.cqe_prev = (elm)->field.cqe_prev) == \
533 (head)->cqh_first = (elm2); \
535 (elm2)->field.cqe_prev->field.cqe_next = (elm2); \
536 _Q_INVALIDATE((elm)->field.cqe_prev); \
537 _Q_INVALIDATE((elm)->field.cqe_next); \