Go to the documentation of this file.
84 #if defined(QUEUE_MACRO_DEBUG) || (defined(_KERNEL) && defined(DIAGNOSTIC))
85 #define _Q_INVALIDATE(a) (a) = ((void *)-1)
87 #define _Q_INVALIDATE(a)
93 #define SLIST_HEAD(name, type) \
95 struct type *slh_first; \
98 #define SLIST_HEAD_INITIALIZER(head) \
101 #define SLIST_ENTRY(type) \
103 struct type *sle_next; \
109 #define SLIST_FIRST(head) ((head)->slh_first)
110 #define SLIST_END(head) NULL
111 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head))
112 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
114 #define SLIST_FOREACH(var, head, field) \
115 for((var) = SLIST_FIRST(head); \
116 (var) != SLIST_END(head); \
117 (var) = SLIST_NEXT(var, field))
119 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \
120 for ((varp) = &SLIST_FIRST((head)); \
121 ((var) = *(varp)) != SLIST_END(head); \
122 (varp) = &SLIST_NEXT((var), field))
127 #define SLIST_INIT(head) { \
128 SLIST_FIRST(head) = SLIST_END(head); \
131 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
132 (elm)->field.sle_next = (slistelm)->field.sle_next; \
133 (slistelm)->field.sle_next = (elm); \
136 #define SLIST_INSERT_HEAD(head, elm, field) do { \
137 (elm)->field.sle_next = (head)->slh_first; \
138 (head)->slh_first = (elm); \
141 #define SLIST_REMOVE_NEXT(head, elm, field) do { \
142 (elm)->field.sle_next = (elm)->field.sle_next->field.sle_next; \
145 #define SLIST_REMOVE_HEAD(head, field) do { \
146 (head)->slh_first = (head)->slh_first->field.sle_next; \
149 #define SLIST_REMOVE(head, elm, type, field) do { \
150 if ((head)->slh_first == (elm)) { \
151 SLIST_REMOVE_HEAD((head), field); \
153 struct type *curelm = (head)->slh_first; \
155 while (curelm->field.sle_next != (elm)) \
156 curelm = curelm->field.sle_next; \
157 curelm->field.sle_next = \
158 curelm->field.sle_next->field.sle_next; \
159 _Q_INVALIDATE((elm)->field.sle_next); \
166 #define LIST_HEAD(name, type) \
168 struct type *lh_first; \
171 #define LIST_HEAD_INITIALIZER(head) \
174 #define LIST_ENTRY(type) \
176 struct type *le_next; \
177 struct type **le_prev; \
183 #define LIST_FIRST(head) ((head)->lh_first)
184 #define LIST_END(head) NULL
185 #define LIST_EMPTY(head) (LIST_FIRST(head) == LIST_END(head))
186 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
188 #define LIST_FOREACH(var, head, field) \
189 for((var) = LIST_FIRST(head); \
190 (var)!= LIST_END(head); \
191 (var) = LIST_NEXT(var, field))
196 #define LIST_INIT(head) do { \
197 LIST_FIRST(head) = LIST_END(head); \
200 #define LIST_INSERT_AFTER(listelm, elm, field) do { \
201 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
202 (listelm)->field.le_next->field.le_prev = \
203 &(elm)->field.le_next; \
204 (listelm)->field.le_next = (elm); \
205 (elm)->field.le_prev = &(listelm)->field.le_next; \
208 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \
209 (elm)->field.le_prev = (listelm)->field.le_prev; \
210 (elm)->field.le_next = (listelm); \
211 *(listelm)->field.le_prev = (elm); \
212 (listelm)->field.le_prev = &(elm)->field.le_next; \
215 #define LIST_INSERT_HEAD(head, elm, field) do { \
216 if (((elm)->field.le_next = (head)->lh_first) != NULL) \
217 (head)->lh_first->field.le_prev = &(elm)->field.le_next;\
218 (head)->lh_first = (elm); \
219 (elm)->field.le_prev = &(head)->lh_first; \
222 #define LIST_REMOVE(elm, field) do { \
223 if ((elm)->field.le_next != NULL) \
224 (elm)->field.le_next->field.le_prev = \
225 (elm)->field.le_prev; \
226 *(elm)->field.le_prev = (elm)->field.le_next; \
227 _Q_INVALIDATE((elm)->field.le_prev); \
228 _Q_INVALIDATE((elm)->field.le_next); \
231 #define LIST_REPLACE(elm, elm2, field) do { \
232 if (((elm2)->field.le_next = (elm)->field.le_next) != NULL) \
233 (elm2)->field.le_next->field.le_prev = \
234 &(elm2)->field.le_next; \
235 (elm2)->field.le_prev = (elm)->field.le_prev; \
236 *(elm2)->field.le_prev = (elm2); \
237 _Q_INVALIDATE((elm)->field.le_prev); \
238 _Q_INVALIDATE((elm)->field.le_next); \
244 #define SIMPLEQ_HEAD(name, type) \
246 struct type *sqh_first; \
247 struct type **sqh_last; \
250 #define SIMPLEQ_HEAD_INITIALIZER(head) \
251 { NULL, &(head).sqh_first }
253 #define SIMPLEQ_ENTRY(type) \
255 struct type *sqe_next; \
261 #define SIMPLEQ_FIRST(head) ((head)->sqh_first)
262 #define SIMPLEQ_END(head) NULL
263 #define SIMPLEQ_EMPTY(head) (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head))
264 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next)
266 #define SIMPLEQ_FOREACH(var, head, field) \
267 for((var) = SIMPLEQ_FIRST(head); \
268 (var) != SIMPLEQ_END(head); \
269 (var) = SIMPLEQ_NEXT(var, field))
274 #define SIMPLEQ_INIT(head) do { \
275 (head)->sqh_first = NULL; \
276 (head)->sqh_last = &(head)->sqh_first; \
279 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \
280 if (((elm)->field.sqe_next = (head)->sqh_first) == NULL) \
281 (head)->sqh_last = &(elm)->field.sqe_next; \
282 (head)->sqh_first = (elm); \
285 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \
286 (elm)->field.sqe_next = NULL; \
287 *(head)->sqh_last = (elm); \
288 (head)->sqh_last = &(elm)->field.sqe_next; \
291 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \
292 if (((elm)->field.sqe_next = (listelm)->field.sqe_next) == NULL)\
293 (head)->sqh_last = &(elm)->field.sqe_next; \
294 (listelm)->field.sqe_next = (elm); \
297 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \
298 if (((head)->sqh_first = (head)->sqh_first->field.sqe_next) == NULL) \
299 (head)->sqh_last = &(head)->sqh_first; \
305 #define TAILQ_HEAD(name, type) \
307 struct type *tqh_first; \
308 struct type **tqh_last; \
311 #define TAILQ_HEAD_INITIALIZER(head) \
312 { NULL, &(head).tqh_first }
314 #define TAILQ_ENTRY(type) \
316 struct type *tqe_next; \
317 struct type **tqe_prev; \
323 #define TAILQ_FIRST(head) ((head)->tqh_first)
324 #define TAILQ_END(head) NULL
325 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
326 #define TAILQ_LAST(head, headname) \
327 (*(((struct headname *)((head)->tqh_last))->tqh_last))
329 #define TAILQ_PREV(elm, headname, field) \
330 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
331 #define TAILQ_EMPTY(head) \
332 (TAILQ_FIRST(head) == TAILQ_END(head))
334 #define TAILQ_FOREACH(var, head, field) \
335 for((var) = TAILQ_FIRST(head); \
336 (var) != TAILQ_END(head); \
337 (var) = TAILQ_NEXT(var, field))
339 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \
340 for((var) = TAILQ_LAST(head, headname); \
341 (var) != TAILQ_END(head); \
342 (var) = TAILQ_PREV(var, headname, field))
347 #define TAILQ_INIT(head) do { \
348 (head)->tqh_first = NULL; \
349 (head)->tqh_last = &(head)->tqh_first; \
352 #define TAILQ_INSERT_HEAD(head, elm, field) do { \
353 if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \
354 (head)->tqh_first->field.tqe_prev = \
355 &(elm)->field.tqe_next; \
357 (head)->tqh_last = &(elm)->field.tqe_next; \
358 (head)->tqh_first = (elm); \
359 (elm)->field.tqe_prev = &(head)->tqh_first; \
362 #define TAILQ_INSERT_TAIL(head, elm, field) do { \
363 (elm)->field.tqe_next = NULL; \
364 (elm)->field.tqe_prev = (head)->tqh_last; \
365 *(head)->tqh_last = (elm); \
366 (head)->tqh_last = &(elm)->field.tqe_next; \
369 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
370 if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
371 (elm)->field.tqe_next->field.tqe_prev = \
372 &(elm)->field.tqe_next; \
374 (head)->tqh_last = &(elm)->field.tqe_next; \
375 (listelm)->field.tqe_next = (elm); \
376 (elm)->field.tqe_prev = &(listelm)->field.tqe_next; \
379 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \
380 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
381 (elm)->field.tqe_next = (listelm); \
382 *(listelm)->field.tqe_prev = (elm); \
383 (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \
386 #define TAILQ_REMOVE(head, elm, field) do { \
387 if (((elm)->field.tqe_next) != NULL) \
388 (elm)->field.tqe_next->field.tqe_prev = \
389 (elm)->field.tqe_prev; \
391 (head)->tqh_last = (elm)->field.tqe_prev; \
392 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
393 _Q_INVALIDATE((elm)->field.tqe_prev); \
394 _Q_INVALIDATE((elm)->field.tqe_next); \
397 #define TAILQ_REPLACE(head, elm, elm2, field) do { \
398 if (((elm2)->field.tqe_next = (elm)->field.tqe_next) != NULL) \
399 (elm2)->field.tqe_next->field.tqe_prev = \
400 &(elm2)->field.tqe_next; \
402 (head)->tqh_last = &(elm2)->field.tqe_next; \
403 (elm2)->field.tqe_prev = (elm)->field.tqe_prev; \
404 *(elm2)->field.tqe_prev = (elm2); \
405 _Q_INVALIDATE((elm)->field.tqe_prev); \
406 _Q_INVALIDATE((elm)->field.tqe_next); \
410 #define TAILQ_SWAP(first, second, head, field) do { \
411 *((first)->field.tqe_prev) = (second); \
412 (second)->field.tqe_prev = (first)->field.tqe_prev; \
413 (first)->field.tqe_prev = &((second)->field.tqe_next); \
414 (first)->field.tqe_next = (second)->field.tqe_next; \
415 if ((second)->field.tqe_next) \
416 (second)->field.tqe_next->field.tqe_prev = &((first)->field.tqe_next); \
417 (second)->field.tqe_next = first; \
418 if ((head)->tqh_last == &((second)->field.tqe_next)) \
419 (head)->tqh_last = &((first)->field.tqe_next); \
425 #define CIRCLEQ_HEAD(name, type) \
427 struct type *cqh_first; \
428 struct type *cqh_last; \
431 #define CIRCLEQ_HEAD_INITIALIZER(head) \
432 { CIRCLEQ_END(&head), CIRCLEQ_END(&head) }
434 #define CIRCLEQ_ENTRY(type) \
436 struct type *cqe_next; \
437 struct type *cqe_prev; \
443 #define CIRCLEQ_FIRST(head) ((head)->cqh_first)
444 #define CIRCLEQ_LAST(head) ((head)->cqh_last)
445 #define CIRCLEQ_END(head) ((void *)(head))
446 #define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next)
447 #define CIRCLEQ_PREV(elm, field) ((elm)->field.cqe_prev)
448 #define CIRCLEQ_EMPTY(head) \
449 (CIRCLEQ_FIRST(head) == CIRCLEQ_END(head))
451 #define CIRCLEQ_FOREACH(var, head, field) \
452 for((var) = CIRCLEQ_FIRST(head); \
453 (var) != CIRCLEQ_END(head); \
454 (var) = CIRCLEQ_NEXT(var, field))
456 #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \
457 for((var) = CIRCLEQ_LAST(head); \
458 (var) != CIRCLEQ_END(head); \
459 (var) = CIRCLEQ_PREV(var, field))
464 #define CIRCLEQ_INIT(head) do { \
465 (head)->cqh_first = CIRCLEQ_END(head); \
466 (head)->cqh_last = CIRCLEQ_END(head); \
469 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \
470 (elm)->field.cqe_next = (listelm)->field.cqe_next; \
471 (elm)->field.cqe_prev = (listelm); \
472 if ((listelm)->field.cqe_next == CIRCLEQ_END(head)) \
473 (head)->cqh_last = (elm); \
475 (listelm)->field.cqe_next->field.cqe_prev = (elm); \
476 (listelm)->field.cqe_next = (elm); \
479 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \
480 (elm)->field.cqe_next = (listelm); \
481 (elm)->field.cqe_prev = (listelm)->field.cqe_prev; \
482 if ((listelm)->field.cqe_prev == CIRCLEQ_END(head)) \
483 (head)->cqh_first = (elm); \
485 (listelm)->field.cqe_prev->field.cqe_next = (elm); \
486 (listelm)->field.cqe_prev = (elm); \
489 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \
490 (elm)->field.cqe_next = (head)->cqh_first; \
491 (elm)->field.cqe_prev = CIRCLEQ_END(head); \
492 if ((head)->cqh_last == CIRCLEQ_END(head)) \
493 (head)->cqh_last = (elm); \
495 (head)->cqh_first->field.cqe_prev = (elm); \
496 (head)->cqh_first = (elm); \
499 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \
500 (elm)->field.cqe_next = CIRCLEQ_END(head); \
501 (elm)->field.cqe_prev = (head)->cqh_last; \
502 if ((head)->cqh_first == CIRCLEQ_END(head)) \
503 (head)->cqh_first = (elm); \
505 (head)->cqh_last->field.cqe_next = (elm); \
506 (head)->cqh_last = (elm); \
509 #define CIRCLEQ_REMOVE(head, elm, field) do { \
510 if ((elm)->field.cqe_next == CIRCLEQ_END(head)) \
511 (head)->cqh_last = (elm)->field.cqe_prev; \
513 (elm)->field.cqe_next->field.cqe_prev = \
514 (elm)->field.cqe_prev; \
515 if ((elm)->field.cqe_prev == CIRCLEQ_END(head)) \
516 (head)->cqh_first = (elm)->field.cqe_next; \
518 (elm)->field.cqe_prev->field.cqe_next = \
519 (elm)->field.cqe_next; \
520 _Q_INVALIDATE((elm)->field.cqe_prev); \
521 _Q_INVALIDATE((elm)->field.cqe_next); \
524 #define CIRCLEQ_REPLACE(head, elm, elm2, field) do { \
525 if (((elm2)->field.cqe_next = (elm)->field.cqe_next) == \
527 (head)->cqh_last = (elm2); \
529 (elm2)->field.cqe_next->field.cqe_prev = (elm2); \
530 if (((elm2)->field.cqe_prev = (elm)->field.cqe_prev) == \
532 (head)->cqh_first = (elm2); \
534 (elm2)->field.cqe_prev->field.cqe_next = (elm2); \
535 _Q_INVALIDATE((elm)->field.cqe_prev); \
536 _Q_INVALIDATE((elm)->field.cqe_next); \