]> git.proxmox.com Git - mirror_frr.git/blob - lib/freebsd-queue.h
projects / mirror_frr.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
Merge pull request #1025 from qlyoung/no-ospf
[mirror_frr.git] / lib / freebsd-queue.h
1 /*-
2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 *
29 * @(#)queue.h 8.5 (Berkeley) 8/20/94
30 * $FreeBSD$
31 */
32
33 #ifndef _SYS_QUEUE_H_
34 #define _SYS_QUEUE_H_
35
36 /*
37 * This file defines four types of data structures: singly-linked lists,
38 * singly-linked tail queues, lists and tail queues.
39 *
40 * A singly-linked list is headed by a single forward pointer. The elements
41 * are singly linked for minimum space and pointer manipulation overhead at
42 * the expense of O(n) removal for arbitrary elements. New elements can be
43 * added to the list after an existing element or at the head of the list.
44 * Elements being removed from the head of the list should use the explicit
45 * macro for this purpose for optimum efficiency. A singly-linked list may
46 * only be traversed in the forward direction. Singly-linked lists are ideal
47 * for applications with large datasets and few or no removals or for
48 * implementing a LIFO queue.
49 *
50 * A singly-linked tail queue is headed by a pair of pointers, one to the
51 * head of the list and the other to the tail of the list. The elements are
52 * singly linked for minimum space and pointer manipulation overhead at the
53 * expense of O(n) removal for arbitrary elements. New elements can be added
54 * to the list after an existing element, at the head of the list, or at the
55 * end of the list. Elements being removed from the head of the tail queue
56 * should use the explicit macro for this purpose for optimum efficiency.
57 * A singly-linked tail queue may only be traversed in the forward direction.
58 * Singly-linked tail queues are ideal for applications with large datasets
59 * and few or no removals or for implementing a FIFO queue.
60 *
61 * A list is headed by a single forward pointer (or an array of forward
62 * pointers for a hash table header). The elements are doubly linked
63 * so that an arbitrary element can be removed without a need to
64 * traverse the list. New elements can be added to the list before
65 * or after an existing element or at the head of the list. A list
66 * may only be traversed in the forward direction.
67 *
68 * A tail queue is headed by a pair of pointers, one to the head of the
69 * list and the other to the tail of the list. The elements are doubly
70 * linked so that an arbitrary element can be removed without a need to
71 * traverse the list. New elements can be added to the list before or
72 * after an existing element, at the head of the list, or at the end of
73 * the list. A tail queue may be traversed in either direction.
74 *
75 * For details on the use of these macros, see the queue(3) manual page.
76 *
77 *
78 * SLIST LIST STAILQ TAILQ
79 * _HEAD + + + +
80 * _HEAD_INITIALIZER + + + +
81 * _ENTRY + + + +
82 * _INIT + + + +
83 * _EMPTY + + + +
84 * _FIRST + + + +
85 * _NEXT + + + +
86 * _PREV - - - +
87 * _LAST - - + +
88 * _FOREACH + + + +
89 * _FOREACH_SAFE + + + +
90 * _FOREACH_REVERSE - - - +
91 * _FOREACH_REVERSE_SAFE - - - +
92 * _INSERT_HEAD + + + +
93 * _INSERT_BEFORE - + - +
94 * _INSERT_AFTER + + + +
95 * _INSERT_TAIL - - + +
96 * _CONCAT - - + +
97 * _REMOVE_AFTER + - + -
98 * _REMOVE_HEAD + - + -
99 * _REMOVE + + + +
100 * _SWAP + + + +
101 *
102 */
103 #ifdef QUEUE_MACRO_DEBUG
104 /* Store the last 2 places the queue element or head was altered */
105 struct qm_trace {
106 char *lastfile;
107 int lastline;
108 char *prevfile;
109 int prevline;
110 };
111
112 #define TRACEBUF struct qm_trace trace;
113 #define TRASHIT(x) do {(x) = (void *)-1;} while (0)
114 #define QMD_SAVELINK(name, link) void **name = (void *)&(link)
115
116 #define QMD_TRACE_HEAD(head) \
117 do { \
118 (head)->trace.prevline = (head)->trace.lastline; \
119 (head)->trace.prevfile = (head)->trace.lastfile; \
120 (head)->trace.lastline = __LINE__; \
121 (head)->trace.lastfile = __FILE__; \
122 } while (0)
123
124 #define QMD_TRACE_ELEM(elem) \
125 do { \
126 (elem)->trace.prevline = (elem)->trace.lastline; \
127 (elem)->trace.prevfile = (elem)->trace.lastfile; \
128 (elem)->trace.lastline = __LINE__; \
129 (elem)->trace.lastfile = __FILE__; \
130 } while (0)
131
132 #else
133 #define QMD_TRACE_ELEM(elem)
134 #define QMD_TRACE_HEAD(head)
135 #define QMD_SAVELINK(name, link)
136 #define TRACEBUF
137 #define TRASHIT(x)
138 #endif /* QUEUE_MACRO_DEBUG */
139
140 /*
141 * Singly-linked List declarations.
142 */
143 #define SLIST_HEAD(name, type) \
144 struct name { \
145 struct type *slh_first; /* first element */ \
146 }
147
148 #define SLIST_HEAD_INITIALIZER(head) \
149 { \
150 NULL \
151 }
152
153 #define SLIST_ENTRY(type) \
154 struct { \
155 struct type *sle_next; /* next element */ \
156 }
157
158 /*
159 * Singly-linked List functions.
160 */
161 #define SLIST_EMPTY(head) ((head)->slh_first == NULL)
162
163 #define SLIST_FIRST(head) ((head)->slh_first)
164
165 #define SLIST_FOREACH(var, head, field) \
166 for ((var) = SLIST_FIRST((head)); (var); \
167 (var) = SLIST_NEXT((var), field))
168
169 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \
170 for ((var) = SLIST_FIRST((head)); \
171 (var) && ((tvar) = SLIST_NEXT((var), field), 1); (var) = (tvar))
172
173 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \
174 for ((varp) = &SLIST_FIRST((head)); ((var) = *(varp)) != NULL; \
175 (varp) = &SLIST_NEXT((var), field))
176
177 #define SLIST_INIT(head) \
178 do { \
179 SLIST_FIRST((head)) = NULL; \
180 } while (0)
181
182 #define SLIST_INSERT_AFTER(slistelm, elm, field) \
183 do { \
184 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
185 SLIST_NEXT((slistelm), field) = (elm); \
186 } while (0)
187
188 #define SLIST_INSERT_HEAD(head, elm, field) \
189 do { \
190 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
191 SLIST_FIRST((head)) = (elm); \
192 } while (0)
193
194 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
195
196 #define SLIST_REMOVE(head, elm, type, field) \
197 do { \
198 QMD_SAVELINK(oldnext, (elm)->field.sle_next); \
199 if (SLIST_FIRST((head)) == (elm)) { \
200 SLIST_REMOVE_HEAD((head), field); \
201 } else { \
202 struct type *curelm = SLIST_FIRST((head)); \
203 while (SLIST_NEXT(curelm, field) != (elm)) \
204 curelm = SLIST_NEXT(curelm, field); \
205 SLIST_REMOVE_AFTER(curelm, field); \
206 } \
207 TRASHIT(*oldnext); \
208 } while (0)
209
210 #define SLIST_REMOVE_AFTER(elm, field) \
211 do { \
212 SLIST_NEXT(elm, field) = \
213 SLIST_NEXT(SLIST_NEXT(elm, field), field); \
214 } while (0)
215
216 #define SLIST_REMOVE_HEAD(head, field) \
217 do { \
218 SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \
219 } while (0)
220
221 #define SLIST_SWAP(head1, head2, type) \
222 do { \
223 struct type *swap_first = SLIST_FIRST(head1); \
224 SLIST_FIRST(head1) = SLIST_FIRST(head2); \
225 SLIST_FIRST(head2) = swap_first; \
226 } while (0)
227
228 /*
229 * Singly-linked Tail queue declarations.
230 */
231 #define STAILQ_HEAD(name, type) \
232 struct name { \
233 struct type *stqh_first; /* first element */ \
234 struct type **stqh_last; /* addr of last next element */ \
235 }
236
237 #define STAILQ_HEAD_INITIALIZER(head) \
238 { \
239 NULL, &(head).stqh_first \
240 }
241
242 #define STAILQ_ENTRY(type) \
243 struct { \
244 struct type *stqe_next; /* next element */ \
245 }
246
247 /*
248 * Singly-linked Tail queue functions.
249 */
250 #define STAILQ_CONCAT(head1, head2) \
251 do { \
252 if (!STAILQ_EMPTY((head2))) { \
253 *(head1)->stqh_last = (head2)->stqh_first; \
254 (head1)->stqh_last = (head2)->stqh_last; \
255 STAILQ_INIT((head2)); \
256 } \
257 } while (0)
258
259 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL)
260
261 #define STAILQ_FIRST(head) ((head)->stqh_first)
262
263 #define STAILQ_FOREACH(var, head, field) \
264 for ((var) = STAILQ_FIRST((head)); (var); \
265 (var) = STAILQ_NEXT((var), field))
266
267
268 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \
269 for ((var) = STAILQ_FIRST((head)); \
270 (var) && ((tvar) = STAILQ_NEXT((var), field), 1); (var) = (tvar))
271
272 #define STAILQ_INIT(head) \
273 do { \
274 STAILQ_FIRST((head)) = NULL; \
275 (head)->stqh_last = &STAILQ_FIRST((head)); \
276 } while (0)
277
278 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) \
279 do { \
280 if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) \
281 == NULL) \
282 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
283 STAILQ_NEXT((tqelm), field) = (elm); \
284 } while (0)
285
286 #define STAILQ_INSERT_HEAD(head, elm, field) \
287 do { \
288 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) \
289 == NULL) \
290 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
291 STAILQ_FIRST((head)) = (elm); \
292 } while (0)
293
294 #define STAILQ_INSERT_TAIL(head, elm, field) \
295 do { \
296 STAILQ_NEXT((elm), field) = NULL; \
297 *(head)->stqh_last = (elm); \
298 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
299 } while (0)
300
301 #define STAILQ_LAST(head, type, field) \
302 (STAILQ_EMPTY((head)) \
303 ? NULL \
304 : ((struct type *)(void *)((char *)((head)->stqh_last) \
305 - offsetof(struct type, \
306 field))))
307
308 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next)
309
310 #define STAILQ_REMOVE(head, elm, type, field) \
311 do { \
312 QMD_SAVELINK(oldnext, (elm)->field.stqe_next); \
313 if (STAILQ_FIRST((head)) == (elm)) { \
314 STAILQ_REMOVE_HEAD((head), field); \
315 } else { \
316 struct type *curelm = STAILQ_FIRST((head)); \
317 while (STAILQ_NEXT(curelm, field) != (elm)) \
318 curelm = STAILQ_NEXT(curelm, field); \
319 STAILQ_REMOVE_AFTER(head, curelm, field); \
320 } \
321 TRASHIT(*oldnext); \
322 } while (0)
323
324 #define STAILQ_REMOVE_AFTER(head, elm, field) \
325 do { \
326 if ((STAILQ_NEXT(elm, field) = \
327 STAILQ_NEXT(STAILQ_NEXT(elm, field), field)) \
328 == NULL) \
329 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
330 } while (0)
331
332 #define STAILQ_REMOVE_HEAD(head, field) \
333 do { \
334 if ((STAILQ_FIRST((head)) = \
335 STAILQ_NEXT(STAILQ_FIRST((head)), field)) \
336 == NULL) \
337 (head)->stqh_last = &STAILQ_FIRST((head)); \
338 } while (0)
339
340 #define STAILQ_SWAP(head1, head2, type) \
341 do { \
342 struct type *swap_first = STAILQ_FIRST(head1); \
343 struct type **swap_last = (head1)->stqh_last; \
344 STAILQ_FIRST(head1) = STAILQ_FIRST(head2); \
345 (head1)->stqh_last = (head2)->stqh_last; \
346 STAILQ_FIRST(head2) = swap_first; \
347 (head2)->stqh_last = swap_last; \
348 if (STAILQ_EMPTY(head1)) \
349 (head1)->stqh_last = &STAILQ_FIRST(head1); \
350 if (STAILQ_EMPTY(head2)) \
351 (head2)->stqh_last = &STAILQ_FIRST(head2); \
352 } while (0)
353
354
355 /*
356 * List declarations.
357 */
358 #define LIST_HEAD(name, type) \
359 struct name { \
360 struct type *lh_first; /* first element */ \
361 }
362
363 #define LIST_HEAD_INITIALIZER(head) \
364 { \
365 NULL \
366 }
367
368 #define LIST_ENTRY(type) \
369 struct { \
370 struct type *le_next; /* next element */ \
371 struct type **le_prev; /* address of previous next element */ \
372 }
373
374 /*
375 * List functions.
376 */
377
378 #if (defined(_KERNEL) && defined(INVARIANTS))
379 #define QMD_LIST_CHECK_HEAD(head, field) \
380 do { \
381 if (LIST_FIRST((head)) != NULL \
382 && LIST_FIRST((head))->field.le_prev \
383 != &LIST_FIRST((head))) \
384 panic("Bad list head %p first->prev != head", (head)); \
385 } while (0)
386
387 #define QMD_LIST_CHECK_NEXT(elm, field) \
388 do { \
389 if (LIST_NEXT((elm), field) != NULL \
390 && LIST_NEXT((elm), field)->field.le_prev \
391 != &((elm)->field.le_next)) \
392 panic("Bad link elm %p next->prev != elm", (elm)); \
393 } while (0)
394
395 #define QMD_LIST_CHECK_PREV(elm, field) \
396 do { \
397 if (*(elm)->field.le_prev != (elm)) \
398 panic("Bad link elm %p prev->next != elm", (elm)); \
399 } while (0)
400 #else
401 #define QMD_LIST_CHECK_HEAD(head, field)
402 #define QMD_LIST_CHECK_NEXT(elm, field)
403 #define QMD_LIST_CHECK_PREV(elm, field)
404 #endif /* (_KERNEL && INVARIANTS) */
405
406 #define LIST_EMPTY(head) ((head)->lh_first == NULL)
407
408 #define LIST_FIRST(head) ((head)->lh_first)
409
410 #define LIST_FOREACH(var, head, field) \
411 for ((var) = LIST_FIRST((head)); (var); (var) = LIST_NEXT((var), field))
412
413 #define LIST_FOREACH_SAFE(var, head, field, tvar) \
414 for ((var) = LIST_FIRST((head)); \
415 (var) && ((tvar) = LIST_NEXT((var), field), 1); (var) = (tvar))
416
417 #define LIST_INIT(head) \
418 do { \
419 LIST_FIRST((head)) = NULL; \
420 } while (0)
421
422 #define LIST_INSERT_AFTER(listelm, elm, field) \
423 do { \
424 QMD_LIST_CHECK_NEXT(listelm, field); \
425 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) \
426 != NULL) \
427 LIST_NEXT((listelm), field)->field.le_prev = \
428 &LIST_NEXT((elm), field); \
429 LIST_NEXT((listelm), field) = (elm); \
430 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \
431 } while (0)
432
433 #define LIST_INSERT_BEFORE(listelm, elm, field) \
434 do { \
435 QMD_LIST_CHECK_PREV(listelm, field); \
436 (elm)->field.le_prev = (listelm)->field.le_prev; \
437 LIST_NEXT((elm), field) = (listelm); \
438 *(listelm)->field.le_prev = (elm); \
439 (listelm)->field.le_prev = &LIST_NEXT((elm), field); \
440 } while (0)
441
442 #define LIST_INSERT_HEAD(head, elm, field) \
443 do { \
444 QMD_LIST_CHECK_HEAD((head), field); \
445 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
446 LIST_FIRST((head))->field.le_prev = \
447 &LIST_NEXT((elm), field); \
448 LIST_FIRST((head)) = (elm); \
449 (elm)->field.le_prev = &LIST_FIRST((head)); \
450 } while (0)
451
452 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
453
454 #define LIST_REMOVE(elm, field) \
455 do { \
456 QMD_SAVELINK(oldnext, (elm)->field.le_next); \
457 QMD_SAVELINK(oldprev, (elm)->field.le_prev); \
458 QMD_LIST_CHECK_NEXT(elm, field); \
459 QMD_LIST_CHECK_PREV(elm, field); \
460 if (LIST_NEXT((elm), field) != NULL) \
461 LIST_NEXT((elm), field)->field.le_prev = \
462 (elm)->field.le_prev; \
463 *(elm)->field.le_prev = LIST_NEXT((elm), field); \
464 TRASHIT(*oldnext); \
465 TRASHIT(*oldprev); \
466 } while (0)
467
468 #define LIST_SWAP(head1, head2, type, field) \
469 do { \
470 struct type *swap_tmp = LIST_FIRST((head1)); \
471 LIST_FIRST((head1)) = LIST_FIRST((head2)); \
472 LIST_FIRST((head2)) = swap_tmp; \
473 if ((swap_tmp = LIST_FIRST((head1))) != NULL) \
474 swap_tmp->field.le_prev = &LIST_FIRST((head1)); \
475 if ((swap_tmp = LIST_FIRST((head2))) != NULL) \
476 swap_tmp->field.le_prev = &LIST_FIRST((head2)); \
477 } while (0)
478
479 /*
480 * Tail queue declarations.
481 */
482 #define TAILQ_HEAD(name, type) \
483 struct name { \
484 struct type *tqh_first; /* first element */ \
485 struct type **tqh_last; /* addr of last next element */ \
486 TRACEBUF \
487 }
488
489 #define TAILQ_HEAD_INITIALIZER(head) \
490 { \
491 NULL, &(head).tqh_first \
492 }
493
494 #define TAILQ_ENTRY(type) \
495 struct { \
496 struct type *tqe_next; /* next element */ \
497 struct type **tqe_prev; /* address of previous next element */ \
498 TRACEBUF \
499 }
500
501 /*
502 * Tail queue functions.
503 */
504 #if (defined(_KERNEL) && defined(INVARIANTS))
505 #define QMD_TAILQ_CHECK_HEAD(head, field) \
506 do { \
507 if (!TAILQ_EMPTY(head) \
508 && TAILQ_FIRST((head))->field.tqe_prev \
509 != &TAILQ_FIRST((head))) \
510 panic("Bad tailq head %p first->prev != head", \
511 (head)); \
512 } while (0)
513
514 #define QMD_TAILQ_CHECK_TAIL(head, field) \
515 do { \
516 if (*(head)->tqh_last != NULL) \
517 panic("Bad tailq NEXT(%p->tqh_last) != NULL", (head)); \
518 } while (0)
519
520 #define QMD_TAILQ_CHECK_NEXT(elm, field) \
521 do { \
522 if (TAILQ_NEXT((elm), field) != NULL \
523 && TAILQ_NEXT((elm), field)->field.tqe_prev \
524 != &((elm)->field.tqe_next)) \
525 panic("Bad link elm %p next->prev != elm", (elm)); \
526 } while (0)
527
528 #define QMD_TAILQ_CHECK_PREV(elm, field) \
529 do { \
530 if (*(elm)->field.tqe_prev != (elm)) \
531 panic("Bad link elm %p prev->next != elm", (elm)); \
532 } while (0)
533 #else
534 #define QMD_TAILQ_CHECK_HEAD(head, field)
535 #define QMD_TAILQ_CHECK_TAIL(head, headname)
536 #define QMD_TAILQ_CHECK_NEXT(elm, field)
537 #define QMD_TAILQ_CHECK_PREV(elm, field)
538 #endif /* (_KERNEL && INVARIANTS) */
539
540 #define TAILQ_CONCAT(head1, head2, field) \
541 do { \
542 if (!TAILQ_EMPTY(head2)) { \
543 *(head1)->tqh_last = (head2)->tqh_first; \
544 (head2)->tqh_first->field.tqe_prev = \
545 (head1)->tqh_last; \
546 (head1)->tqh_last = (head2)->tqh_last; \
547 TAILQ_INIT((head2)); \
548 QMD_TRACE_HEAD(head1); \
549 QMD_TRACE_HEAD(head2); \
550 } \
551 } while (0)
552
553 #define TAILQ_EMPTY(head) ((head)->tqh_first == NULL)
554
555 #define TAILQ_FIRST(head) ((head)->tqh_first)
556
557 #define TAILQ_FOREACH(var, head, field) \
558 for ((var) = TAILQ_FIRST((head)); (var); \
559 (var) = TAILQ_NEXT((var), field))
560
561 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \
562 for ((var) = TAILQ_FIRST((head)); \
563 (var) && ((tvar) = TAILQ_NEXT((var), field), 1); (var) = (tvar))
564
565 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \
566 for ((var) = TAILQ_LAST((head), headname); (var); \
567 (var) = TAILQ_PREV((var), headname, field))
568
569 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \
570 for ((var) = TAILQ_LAST((head), headname); \
571 (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1); \
572 (var) = (tvar))
573
574 #define TAILQ_INIT(head) \
575 do { \
576 TAILQ_FIRST((head)) = NULL; \
577 (head)->tqh_last = &TAILQ_FIRST((head)); \
578 QMD_TRACE_HEAD(head); \
579 } while (0)
580
581 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) \
582 do { \
583 QMD_TAILQ_CHECK_NEXT(listelm, field); \
584 if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) \
585 != NULL) \
586 TAILQ_NEXT((elm), field)->field.tqe_prev = \
587 &TAILQ_NEXT((elm), field); \
588 else { \
589 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
590 QMD_TRACE_HEAD(head); \
591 } \
592 TAILQ_NEXT((listelm), field) = (elm); \
593 (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field); \
594 QMD_TRACE_ELEM(&(elm)->field); \
595 QMD_TRACE_ELEM(&listelm->field); \
596 } while (0)
597
598 #define TAILQ_INSERT_BEFORE(listelm, elm, field) \
599 do { \
600 QMD_TAILQ_CHECK_PREV(listelm, field); \
601 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
602 TAILQ_NEXT((elm), field) = (listelm); \
603 *(listelm)->field.tqe_prev = (elm); \
604 (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field); \
605 QMD_TRACE_ELEM(&(elm)->field); \
606 QMD_TRACE_ELEM(&listelm->field); \
607 } while (0)
608
609 #define TAILQ_INSERT_HEAD(head, elm, field) \
610 do { \
611 QMD_TAILQ_CHECK_HEAD(head, field); \
612 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
613 TAILQ_FIRST((head))->field.tqe_prev = \
614 &TAILQ_NEXT((elm), field); \
615 else \
616 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
617 TAILQ_FIRST((head)) = (elm); \
618 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
619 QMD_TRACE_HEAD(head); \
620 QMD_TRACE_ELEM(&(elm)->field); \
621 } while (0)
622
623 #define TAILQ_INSERT_TAIL(head, elm, field) \
624 do { \
625 QMD_TAILQ_CHECK_TAIL(head, field); \
626 TAILQ_NEXT((elm), field) = NULL; \
627 (elm)->field.tqe_prev = (head)->tqh_last; \
628 *(head)->tqh_last = (elm); \
629 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
630 QMD_TRACE_HEAD(head); \
631 QMD_TRACE_ELEM(&(elm)->field); \
632 } while (0)
633
634 #define TAILQ_LAST(head, headname) \
635 (*(((struct headname *)((head)->tqh_last))->tqh_last))
636
637 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
638
639 #define TAILQ_PREV(elm, headname, field) \
640 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
641
642 #define TAILQ_REMOVE(head, elm, field) \
643 do { \
644 QMD_SAVELINK(oldnext, (elm)->field.tqe_next); \
645 QMD_SAVELINK(oldprev, (elm)->field.tqe_prev); \
646 QMD_TAILQ_CHECK_NEXT(elm, field); \
647 QMD_TAILQ_CHECK_PREV(elm, field); \
648 if ((TAILQ_NEXT((elm), field)) != NULL) \
649 TAILQ_NEXT((elm), field)->field.tqe_prev = \
650 (elm)->field.tqe_prev; \
651 else { \
652 (head)->tqh_last = (elm)->field.tqe_prev; \
653 QMD_TRACE_HEAD(head); \
654 } \
655 *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field); \
656 TRASHIT(*oldnext); \
657 TRASHIT(*oldprev); \
658 QMD_TRACE_ELEM(&(elm)->field); \
659 } while (0)
660
661 #define TAILQ_SWAP(head1, head2, type, field) \
662 do { \
663 struct type *swap_first = (head1)->tqh_first; \
664 struct type **swap_last = (head1)->tqh_last; \
665 (head1)->tqh_first = (head2)->tqh_first; \
666 (head1)->tqh_last = (head2)->tqh_last; \
667 (head2)->tqh_first = swap_first; \
668 (head2)->tqh_last = swap_last; \
669 if ((swap_first = (head1)->tqh_first) != NULL) \
670 swap_first->field.tqe_prev = &(head1)->tqh_first; \
671 else \
672 (head1)->tqh_last = &(head1)->tqh_first; \
673 if ((swap_first = (head2)->tqh_first) != NULL) \
674 swap_first->field.tqe_prev = &(head2)->tqh_first; \
675 else \
676 (head2)->tqh_last = &(head2)->tqh_first; \
677 } while (0)
678
679 #endif /* !_SYS_QUEUE_H_ */
FRRouting mirror