![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to queue.h CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [ELWIX - Embedded LightWeight unIX -] / embedaddon / sudo / include|
Return to queue.h CVS log | Up to [ELWIX - Embedded LightWeight unIX -] / embedaddon / sudo / include |
1.1 misho 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: * 3. 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: head/sys/sys/queue.h 251887 2013-06-18 02:57:56Z lstewart $
31: */
32:
33: #ifndef _SUDO_QUEUE_H_
34: #define _SUDO_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 be traversed in either 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: * A headless tail queue lacks a head structure, The first element acts
76: * as a de facto list head. It uses the same entry struct as a regular
77: * tail queue for easy conversion from headless to headful.
78: * It is capable of concatenating queues as well as individual elements.
79: * Traversing in reverse is more expensive due to lack of a list head.
80: * Note: elements must be initialized before use.
81: *
82: * For details on the use of these macros, see the queue(3) manual page.
83: *
84: *
85: * SLIST LIST STAILQ TAILQ
86: * _HEAD + + + +
87: * _HEAD_INITIALIZER + + + +
88: * _ENTRY + + + +
89: * _INIT + + + +
90: * _EMPTY + + + +
91: * _FIRST + + + +
92: * _NEXT + + + +
93: * _PREV - + - +
94: * _LAST - - + +
95: * _FOREACH + + + +
96: * _FOREACH_FROM + + + +
97: * _FOREACH_SAFE + + + +
98: * _FOREACH_FROM_SAFE + + + +
99: * _FOREACH_REVERSE - - - +
100: * _FOREACH_REVERSE_FROM - - - +
101: * _FOREACH_REVERSE_SAFE - - - +
102: * _FOREACH_REVERSE_FROM_SAFE - - - +
103: * _INSERT_HEAD + + + +
104: * _INSERT_BEFORE - + - +
105: * _INSERT_AFTER + + + +
106: * _INSERT_TAIL - - + +
107: * _CONCAT - - + +
108: * _REMOVE_AFTER + - + -
109: * _REMOVE_HEAD + - + -
110: * _REMOVE + + + +
111: * _SWAP + + + +
112: *
113: */
114: #ifdef QUEUE_MACRO_DEBUG
115: /* Store the last 2 places the queue element or head was altered */
116: struct qm_trace {
117: unsigned long lastline;
118: unsigned long prevline;
119: const char *lastfile;
120: const char *prevfile;
121: };
122:
123: #undef TRACEBUF
124: #define TRACEBUF struct qm_trace trace;
125: #undef TRACEBUF_INITIALIZER
126: #define TRACEBUF_INITIALIZER { __FILE__, __LINE__, NULL, 0 } ,
127: #undef TRASHIT
128: #define TRASHIT(x) do {(x) = (void *)-1;} while (0)
129: #undef QMD_SAVELINK
130: #define QMD_SAVELINK(name, link) void **name = (void *)&(link)
131:
132: #undef QMD_TRACE_HEAD
133: #define QMD_TRACE_HEAD(head) do { \
134: (head)->trace.prevline = (head)->trace.lastline; \
135: (head)->trace.prevfile = (head)->trace.lastfile; \
136: (head)->trace.lastline = __LINE__; \
137: (head)->trace.lastfile = __FILE__; \
138: } while (0)
139:
140: #undef QMD_TRACE_ELEM
141: #define QMD_TRACE_ELEM(elem) do { \
142: (elem)->trace.prevline = (elem)->trace.lastline; \
143: (elem)->trace.prevfile = (elem)->trace.lastfile; \
144: (elem)->trace.lastline = __LINE__; \
145: (elem)->trace.lastfile = __FILE__; \
146: } while (0)
147:
148: #else
149: #undef QMD_TRACE_ELEM
150: #define QMD_TRACE_ELEM(elem)
151: #undef QMD_TRACE_HEAD
152: #define QMD_TRACE_HEAD(head)
153: #undef QMD_SAVELINK
154: #define QMD_SAVELINK(name, link)
155: #undef TRACEBUF
156: #define TRACEBUF
157: #undef TRACEBUF_INITIALIZER
158: #define TRACEBUF_INITIALIZER
159: #undef TRASHIT
160: #define TRASHIT(x)
161: #endif /* QUEUE_MACRO_DEBUG */
162:
163: /*
164: * Singly-linked List declarations.
165: */
166: #undef SLIST_HEAD
167: #define SLIST_HEAD(name, type) \
168: struct name { \
169: struct type *slh_first; /* first element */ \
170: }
171:
172: #undef SLIST_HEAD_INITIALIZER
173: #define SLIST_HEAD_INITIALIZER(head) \
174: { NULL }
175:
176: #undef SLIST_ENTRY
177: #define SLIST_ENTRY(type) \
178: struct { \
179: struct type *sle_next; /* next element */ \
180: }
181:
182: /*
183: * Singly-linked List functions.
184: */
185: #undef SLIST_EMPTY
186: #define SLIST_EMPTY(head) ((head)->slh_first == NULL)
187:
188: #undef SLIST_FIRST
189: #define SLIST_FIRST(head) ((head)->slh_first)
190:
191: #undef SLIST_FOREACH
192: #define SLIST_FOREACH(var, head, field) \
193: for ((var) = SLIST_FIRST((head)); \
194: (var); \
195: (var) = SLIST_NEXT((var), field))
196:
197: #undef SLIST_FOREACH_FROM
198: #define SLIST_FOREACH_FROM(var, head, field) \
199: for ((var) = ((var) ? (var) : SLIST_FIRST((head))); \
200: (var); \
201: (var) = SLIST_NEXT((var), field))
202:
203: #undef SLIST_FOREACH_SAFE
204: #define SLIST_FOREACH_SAFE(var, head, field, tvar) \
205: for ((var) = SLIST_FIRST((head)); \
206: (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
207: (var) = (tvar))
208:
209: #undef SLIST_FOREACH_FROM_SAFE
210: #define SLIST_FOREACH_FROM_SAFE(var, head, field, tvar) \
211: for ((var) = ((var) ? (var) : SLIST_FIRST((head))); \
212: (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
213: (var) = (tvar))
214:
215: #undef SLIST_FOREACH_PREVPTR
216: #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \
217: for ((varp) = &SLIST_FIRST((head)); \
218: ((var) = *(varp)) != NULL; \
219: (varp) = &SLIST_NEXT((var), field))
220:
221: #undef SLIST_INIT
222: #define SLIST_INIT(head) do { \
223: SLIST_FIRST((head)) = NULL; \
224: } while (0)
225:
226: #undef SLIST_INSERT_AFTER
227: #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
228: SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
229: SLIST_NEXT((slistelm), field) = (elm); \
230: } while (0)
231:
232: #undef SLIST_INSERT_HEAD
233: #define SLIST_INSERT_HEAD(head, elm, field) do { \
234: SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
235: SLIST_FIRST((head)) = (elm); \
236: } while (0)
237:
238: #undef SLIST_NEXT
239: #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
240:
241: #undef SLIST_REMOVE
242: #define SLIST_REMOVE(head, elm, type, field) do { \
243: QMD_SAVELINK(oldnext, (elm)->field.sle_next); \
244: if (SLIST_FIRST((head)) == (elm)) { \
245: SLIST_REMOVE_HEAD((head), field); \
246: } \
247: else { \
248: struct type *curelm = SLIST_FIRST((head)); \
249: while (SLIST_NEXT(curelm, field) != (elm)) \
250: curelm = SLIST_NEXT(curelm, field); \
251: SLIST_REMOVE_AFTER(curelm, field); \
252: } \
253: TRASHIT(*oldnext); \
254: } while (0)
255:
256: #undef SLIST_REMOVE_AFTER
257: #define SLIST_REMOVE_AFTER(elm, field) do { \
258: SLIST_NEXT(elm, field) = \
259: SLIST_NEXT(SLIST_NEXT(elm, field), field); \
260: } while (0)
261:
262: #undef SLIST_REMOVE_HEAD
263: #define SLIST_REMOVE_HEAD(head, field) do { \
264: SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \
265: } while (0)
266:
267: #undef SLIST_SWAP
268: #define SLIST_SWAP(head1, head2, type) do { \
269: struct type *swap_first = SLIST_FIRST(head1); \
270: SLIST_FIRST(head1) = SLIST_FIRST(head2); \
271: SLIST_FIRST(head2) = swap_first; \
272: } while (0)
273:
274: /*
275: * Singly-linked Tail queue declarations.
276: */
277: #undef STAILQ_HEAD
278: #define STAILQ_HEAD(name, type) \
279: struct name { \
280: struct type *stqh_first;/* first element */ \
281: struct type **stqh_last;/* addr of last next element */ \
282: }
283:
284: #undef STAILQ_HEAD_INITIALIZER
285: #define STAILQ_HEAD_INITIALIZER(head) \
286: { NULL, &(head).stqh_first }
287:
288: #undef STAILQ_ENTRY
289: #define STAILQ_ENTRY(type) \
290: struct { \
291: struct type *stqe_next; /* next element */ \
292: }
293:
294: /*
295: * Singly-linked Tail queue functions.
296: */
297: #undef STAILQ_CONCAT
298: #define STAILQ_CONCAT(head1, head2) do { \
299: if (!STAILQ_EMPTY((head2))) { \
300: *(head1)->stqh_last = (head2)->stqh_first; \
301: (head1)->stqh_last = (head2)->stqh_last; \
302: STAILQ_INIT((head2)); \
303: } \
304: } while (0)
305:
306: #undef STAILQ_EMPTY
307: #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL)
308:
309: #undef STAILQ_FIRST
310: #define STAILQ_FIRST(head) ((head)->stqh_first)
311:
312: #undef STAILQ_FOREACH
313: #define STAILQ_FOREACH(var, head, field) \
314: for ((var) = STAILQ_FIRST((head)); \
315: (var); \
316: (var) = STAILQ_NEXT((var), field))
317:
318: #undef STAILQ_FOREACH_FROM
319: #define STAILQ_FOREACH_FROM(var, head, field) \
320: for ((var) = ((var) ? (var) : STAILQ_FIRST((head))); \
321: (var); \
322: (var) = STAILQ_NEXT((var), field))
323:
324: #undef STAILQ_FOREACH_SAFE
325: #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \
326: for ((var) = STAILQ_FIRST((head)); \
327: (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \
328: (var) = (tvar))
329:
330: #undef STAILQ_FOREACH_FROM_SAFE
331: #define STAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \
332: for ((var) = ((var) ? (var) : STAILQ_FIRST((head))); \
333: (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \
334: (var) = (tvar))
335:
336: #undef STAILQ_INIT
337: #define STAILQ_INIT(head) do { \
338: STAILQ_FIRST((head)) = NULL; \
339: (head)->stqh_last = &STAILQ_FIRST((head)); \
340: } while (0)
341:
342: #undef STAILQ_INSERT_AFTER
343: #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \
344: if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\
345: (head)->stqh_last = &STAILQ_NEXT((elm), field); \
346: STAILQ_NEXT((tqelm), field) = (elm); \
347: } while (0)
348:
349: #undef STAILQ_INSERT_HEAD
350: #define STAILQ_INSERT_HEAD(head, elm, field) do { \
351: if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
352: (head)->stqh_last = &STAILQ_NEXT((elm), field); \
353: STAILQ_FIRST((head)) = (elm); \
354: } while (0)
355:
356: #undef STAILQ_INSERT_TAIL
357: #define STAILQ_INSERT_TAIL(head, elm, field) do { \
358: STAILQ_NEXT((elm), field) = NULL; \
359: *(head)->stqh_last = (elm); \
360: (head)->stqh_last = &STAILQ_NEXT((elm), field); \
361: } while (0)
362:
363: #undef STAILQ_LAST
364: #define STAILQ_LAST(head, type, field) \
365: (STAILQ_EMPTY((head)) ? NULL : \
366: __containerof((head)->stqh_last, struct type, field.stqe_next))
367:
368: #undef STAILQ_NEXT
369: #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next)
370:
371: #undef STAILQ_REMOVE
372: #define STAILQ_REMOVE(head, elm, type, field) do { \
373: QMD_SAVELINK(oldnext, (elm)->field.stqe_next); \
374: if (STAILQ_FIRST((head)) == (elm)) { \
375: STAILQ_REMOVE_HEAD((head), field); \
376: } \
377: else { \
378: struct type *curelm = STAILQ_FIRST((head)); \
379: while (STAILQ_NEXT(curelm, field) != (elm)) \
380: curelm = STAILQ_NEXT(curelm, field); \
381: STAILQ_REMOVE_AFTER(head, curelm, field); \
382: } \
383: TRASHIT(*oldnext); \
384: } while (0)
385:
386: #undef STAILQ_REMOVE_AFTER
387: #define STAILQ_REMOVE_AFTER(head, elm, field) do { \
388: if ((STAILQ_NEXT(elm, field) = \
389: STAILQ_NEXT(STAILQ_NEXT(elm, field), field)) == NULL) \
390: (head)->stqh_last = &STAILQ_NEXT((elm), field); \
391: } while (0)
392:
393: #undef STAILQ_REMOVE_HEAD
394: #define STAILQ_REMOVE_HEAD(head, field) do { \
395: if ((STAILQ_FIRST((head)) = \
396: STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \
397: (head)->stqh_last = &STAILQ_FIRST((head)); \
398: } while (0)
399:
400: #undef STAILQ_SWAP
401: #define STAILQ_SWAP(head1, head2, type) do { \
402: struct type *swap_first = STAILQ_FIRST(head1); \
403: struct type **swap_last = (head1)->stqh_last; \
404: STAILQ_FIRST(head1) = STAILQ_FIRST(head2); \
405: (head1)->stqh_last = (head2)->stqh_last; \
406: STAILQ_FIRST(head2) = swap_first; \
407: (head2)->stqh_last = swap_last; \
408: if (STAILQ_EMPTY(head1)) \
409: (head1)->stqh_last = &STAILQ_FIRST(head1); \
410: if (STAILQ_EMPTY(head2)) \
411: (head2)->stqh_last = &STAILQ_FIRST(head2); \
412: } while (0)
413:
414:
415: /*
416: * List declarations.
417: */
418: #undef LIST_HEAD
419: #define LIST_HEAD(name, type) \
420: struct name { \
421: struct type *lh_first; /* first element */ \
422: }
423:
424: #undef LIST_HEAD_INITIALIZER
425: #define LIST_HEAD_INITIALIZER(head) \
426: { NULL }
427:
428: #undef LIST_ENTRY
429: #define LIST_ENTRY(type) \
430: struct { \
431: struct type *le_next; /* next element */ \
432: struct type **le_prev; /* address of previous next element */ \
433: }
434:
435: /*
436: * List functions.
437: */
438: #undef LIST_EMPTY
439: #define LIST_EMPTY(head) ((head)->lh_first == NULL)
440:
441: #undef LIST_FIRST
442: #define LIST_FIRST(head) ((head)->lh_first)
443:
444: #undef LIST_FOREACH
445: #define LIST_FOREACH(var, head, field) \
446: for ((var) = LIST_FIRST((head)); \
447: (var); \
448: (var) = LIST_NEXT((var), field))
449:
450: #undef LIST_FOREACH_FROM
451: #define LIST_FOREACH_FROM(var, head, field) \
452: for ((var) = ((var) ? (var) : LIST_FIRST((head))); \
453: (var); \
454: (var) = LIST_NEXT((var), field))
455:
456: #undef LIST_FOREACH_SAFE
457: #define LIST_FOREACH_SAFE(var, head, field, tvar) \
458: for ((var) = LIST_FIRST((head)); \
459: (var) && ((tvar) = LIST_NEXT((var), field), 1); \
460: (var) = (tvar))
461:
462: #undef LIST_FOREACH_FROM_SAFE
463: #define LIST_FOREACH_FROM_SAFE(var, head, field, tvar) \
464: for ((var) = ((var) ? (var) : LIST_FIRST((head))); \
465: (var) && ((tvar) = LIST_NEXT((var), field), 1); \
466: (var) = (tvar))
467:
468: #undef LIST_INIT
469: #define LIST_INIT(head) do { \
470: LIST_FIRST((head)) = NULL; \
471: } while (0)
472:
473: #undef LIST_INSERT_AFTER
474: #define LIST_INSERT_AFTER(listelm, elm, field) do { \
475: if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
476: LIST_NEXT((listelm), field)->field.le_prev = \
477: &LIST_NEXT((elm), field); \
478: LIST_NEXT((listelm), field) = (elm); \
479: (elm)->field.le_prev = &LIST_NEXT((listelm), field); \
480: } while (0)
481:
482: #undef LIST_INSERT_BEFORE
483: #define LIST_INSERT_BEFORE(listelm, elm, field) do { \
484: (elm)->field.le_prev = (listelm)->field.le_prev; \
485: LIST_NEXT((elm), field) = (listelm); \
486: *(listelm)->field.le_prev = (elm); \
487: (listelm)->field.le_prev = &LIST_NEXT((elm), field); \
488: } while (0)
489:
490: #undef LIST_INSERT_HEAD
491: #define LIST_INSERT_HEAD(head, elm, field) do { \
492: if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
493: LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
494: LIST_FIRST((head)) = (elm); \
495: (elm)->field.le_prev = &LIST_FIRST((head)); \
496: } while (0)
497:
498: #undef LIST_NEXT
499: #define LIST_NEXT(elm, field) ((elm)->field.le_next)
500:
501: #undef LIST_PREV
502: #define LIST_PREV(elm, head, type, field) \
503: ((elm)->field.le_prev == &LIST_FIRST((head)) ? NULL : \
504: __containerof((elm)->field.le_prev, struct type, field.le_next))
505:
506: #undef LIST_REMOVE
507: #define LIST_REMOVE(elm, field) do { \
508: QMD_SAVELINK(oldnext, (elm)->field.le_next); \
509: QMD_SAVELINK(oldprev, (elm)->field.le_prev); \
510: if (LIST_NEXT((elm), field) != NULL) \
511: LIST_NEXT((elm), field)->field.le_prev = \
512: (elm)->field.le_prev; \
513: *(elm)->field.le_prev = LIST_NEXT((elm), field); \
514: TRASHIT(*oldnext); \
515: TRASHIT(*oldprev); \
516: } while (0)
517:
518: #undef LIST_SWAP
519: #define LIST_SWAP(head1, head2, type, field) do { \
520: struct type *swap_tmp = LIST_FIRST((head1)); \
521: LIST_FIRST((head1)) = LIST_FIRST((head2)); \
522: LIST_FIRST((head2)) = swap_tmp; \
523: if ((swap_tmp = LIST_FIRST((head1))) != NULL) \
524: swap_tmp->field.le_prev = &LIST_FIRST((head1)); \
525: if ((swap_tmp = LIST_FIRST((head2))) != NULL) \
526: swap_tmp->field.le_prev = &LIST_FIRST((head2)); \
527: } while (0)
528:
529: /*
530: * Tail queue declarations.
531: */
532: #undef TAILQ_HEAD
533: #define TAILQ_HEAD(name, type) \
534: struct name { \
535: struct type *tqh_first; /* first element */ \
536: struct type **tqh_last; /* addr of last next element */ \
537: TRACEBUF \
538: }
539:
540: #undef TAILQ_HEAD_INITIALIZER
541: #define TAILQ_HEAD_INITIALIZER(head) \
542: { NULL, &(head).tqh_first, TRACEBUF_INITIALIZER }
543:
544: #undef TAILQ_ENTRY
545: #define TAILQ_ENTRY(type) \
546: struct { \
547: struct type *tqe_next; /* next element */ \
548: struct type **tqe_prev; /* address of previous next element */ \
549: TRACEBUF \
550: }
551:
552: /*
553: * Tail queue functions.
554: */
555: #undef TAILQ_CONCAT
556: #define TAILQ_CONCAT(head1, head2, field) do { \
557: if (!TAILQ_EMPTY(head2)) { \
558: *(head1)->tqh_last = (head2)->tqh_first; \
559: (head2)->tqh_first->field.tqe_prev = (head1)->tqh_last; \
560: (head1)->tqh_last = (head2)->tqh_last; \
561: TAILQ_INIT((head2)); \
562: QMD_TRACE_HEAD(head1); \
563: QMD_TRACE_HEAD(head2); \
564: } \
565: } while (0)
566:
567: #undef TAILQ_EMPTY
568: #define TAILQ_EMPTY(head) ((head)->tqh_first == NULL)
569:
570: #undef TAILQ_FIRST
571: #define TAILQ_FIRST(head) ((head)->tqh_first)
572:
573: #undef TAILQ_FOREACH
574: #define TAILQ_FOREACH(var, head, field) \
575: for ((var) = TAILQ_FIRST((head)); \
576: (var); \
577: (var) = TAILQ_NEXT((var), field))
578:
579: #undef TAILQ_FOREACH_FROM
580: #define TAILQ_FOREACH_FROM(var, head, field) \
581: for ((var) = ((var) ? (var) : TAILQ_FIRST((head))); \
582: (var); \
583: (var) = TAILQ_NEXT((var), field))
584:
585: #undef TAILQ_FOREACH_SAFE
586: #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \
587: for ((var) = TAILQ_FIRST((head)); \
588: (var) && ((tvar) = TAILQ_NEXT((var), field), 1); \
589: (var) = (tvar))
590:
591: #undef TAILQ_FOREACH_FROM_SAFE
592: #define TAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \
593: for ((var) = ((var) ? (var) : TAILQ_FIRST((head))); \
594: (var) && ((tvar) = TAILQ_NEXT((var), field), 1); \
595: (var) = (tvar))
596:
597: #undef TAILQ_FOREACH_REVERSE
598: #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \
599: for ((var) = TAILQ_LAST((head), headname); \
600: (var); \
601: (var) = TAILQ_PREV((var), headname, field))
602:
603: #undef TAILQ_FOREACH_REVERSE_FROM
604: #define TAILQ_FOREACH_REVERSE_FROM(var, head, headname, field) \
605: for ((var) = ((var) ? (var) : TAILQ_LAST((head), headname)); \
606: (var); \
607: (var) = TAILQ_PREV((var), headname, field))
608:
609: #undef TAILQ_FOREACH_REVERSE_SAFE
610: #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \
611: for ((var) = TAILQ_LAST((head), headname); \
612: (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1); \
613: (var) = (tvar))
614:
615: #undef TAILQ_FOREACH_REVERSE_FROM_SAFE
616: #define TAILQ_FOREACH_REVERSE_FROM_SAFE(var, head, headname, field, tvar) \
617: for ((var) = ((var) ? (var) : TAILQ_LAST((head), headname)); \
618: (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1); \
619: (var) = (tvar))
620:
621: #undef TAILQ_INIT
622: #define TAILQ_INIT(head) do { \
623: TAILQ_FIRST((head)) = NULL; \
624: (head)->tqh_last = &TAILQ_FIRST((head)); \
625: QMD_TRACE_HEAD(head); \
626: } while (0)
627:
628: #undef TAILQ_INSERT_AFTER
629: #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
630: if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\
631: TAILQ_NEXT((elm), field)->field.tqe_prev = \
632: &TAILQ_NEXT((elm), field); \
633: else { \
634: (head)->tqh_last = &TAILQ_NEXT((elm), field); \
635: QMD_TRACE_HEAD(head); \
636: } \
637: TAILQ_NEXT((listelm), field) = (elm); \
638: (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field); \
639: QMD_TRACE_ELEM(&(elm)->field); \
640: QMD_TRACE_ELEM(&listelm->field); \
641: } while (0)
642:
643: #undef TAILQ_INSERT_BEFORE
644: #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \
645: (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
646: TAILQ_NEXT((elm), field) = (listelm); \
647: *(listelm)->field.tqe_prev = (elm); \
648: (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field); \
649: QMD_TRACE_ELEM(&(elm)->field); \
650: QMD_TRACE_ELEM(&listelm->field); \
651: } while (0)
652:
653: #undef TAILQ_INSERT_HEAD
654: #define TAILQ_INSERT_HEAD(head, elm, field) do { \
655: if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
656: TAILQ_FIRST((head))->field.tqe_prev = \
657: &TAILQ_NEXT((elm), field); \
658: else \
659: (head)->tqh_last = &TAILQ_NEXT((elm), field); \
660: TAILQ_FIRST((head)) = (elm); \
661: (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
662: QMD_TRACE_HEAD(head); \
663: QMD_TRACE_ELEM(&(elm)->field); \
664: } while (0)
665:
666: #undef TAILQ_INSERT_TAIL
667: #define TAILQ_INSERT_TAIL(head, elm, field) do { \
668: TAILQ_NEXT((elm), field) = NULL; \
669: (elm)->field.tqe_prev = (head)->tqh_last; \
670: *(head)->tqh_last = (elm); \
671: (head)->tqh_last = &TAILQ_NEXT((elm), field); \
672: QMD_TRACE_HEAD(head); \
673: QMD_TRACE_ELEM(&(elm)->field); \
674: } while (0)
675:
676: #undef TAILQ_LAST
677: #define TAILQ_LAST(head, headname) \
678: (*(((struct headname *)((head)->tqh_last))->tqh_last))
679:
680: #undef TAILQ_NEXT
681: #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
682:
683: #undef TAILQ_PREV
684: #define TAILQ_PREV(elm, headname, field) \
685: (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
686:
687: #undef TAILQ_REMOVE
688: #define TAILQ_REMOVE(head, elm, field) do { \
689: QMD_SAVELINK(oldnext, (elm)->field.tqe_next); \
690: QMD_SAVELINK(oldprev, (elm)->field.tqe_prev); \
691: if ((TAILQ_NEXT((elm), field)) != NULL) \
692: TAILQ_NEXT((elm), field)->field.tqe_prev = \
693: (elm)->field.tqe_prev; \
694: else { \
695: (head)->tqh_last = (elm)->field.tqe_prev; \
696: QMD_TRACE_HEAD(head); \
697: } \
698: *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field); \
699: TRASHIT(*oldnext); \
700: TRASHIT(*oldprev); \
701: QMD_TRACE_ELEM(&(elm)->field); \
702: } while (0)
703:
704: #undef TAILQ_SWAP
705: #define TAILQ_SWAP(head1, head2, type, field) do { \
706: struct type *swap_first = (head1)->tqh_first; \
707: struct type **swap_last = (head1)->tqh_last; \
708: (head1)->tqh_first = (head2)->tqh_first; \
709: (head1)->tqh_last = (head2)->tqh_last; \
710: (head2)->tqh_first = swap_first; \
711: (head2)->tqh_last = swap_last; \
712: if ((swap_first = (head1)->tqh_first) != NULL) \
713: swap_first->field.tqe_prev = &(head1)->tqh_first; \
714: else \
715: (head1)->tqh_last = &(head1)->tqh_first; \
716: if ((swap_first = (head2)->tqh_first) != NULL) \
717: swap_first->field.tqe_prev = &(head2)->tqh_first; \
718: else \
719: (head2)->tqh_last = &(head2)->tqh_first; \
720: } while (0)
721:
722: /*
723: * Headless Tail queue definitions.
724: */
725: #undef HLTQ_ENTRY
726: #define HLTQ_ENTRY(type) TAILQ_ENTRY(type)
727:
728: #undef HLTQ_INIT
729: #define HLTQ_INIT(entry, field) do { \
730: (entry)->field.tqe_next = NULL; \
731: (entry)->field.tqe_prev = &(entry)->field.tqe_next; \
732: } while (0)
733:
734: #undef HLTQ_INITIALIZER
735: #define HLTQ_INITIALIZER(entry, field) \
736: { NULL, &(entry)->field.tqe_next }
737:
738: #undef HLTQ_FIRST
739: #define HLTQ_FIRST(elm) (elm)
740:
741: #undef HLTQ_END
742: #define HLTQ_END(elm) NULL
743:
744: #undef HLTQ_NEXT
745: #define HLTQ_NEXT(elm, field) ((elm)->field.tqe_next)
746:
747: #undef HLTQ_LAST
748: #define HLTQ_LAST(elm, type, field) \
749: ((elm)->field.tqe_next == NULL ? (elm) : \
750: __containerof((elm)->field.tqe_prev, struct type, field.tqe_next))
751:
752: #undef HLTQ_PREV
753: #define HLTQ_PREV(elm, type, field) \
754: (*(elm)->field.tqe_prev == NULL ? NULL : \
755: __containerof((elm)->field.tqe_prev, struct type, field.tqe_next))
756:
757: #undef HLTQ_FOREACH
758: #define HLTQ_FOREACH(var, head, field) \
759: for ((var) = HLTQ_FIRST(head); \
760: (var) != HLTQ_END(head); \
761: (var) = HLTQ_NEXT(var, field))
762:
763: #undef HLTQ_FOREACH_SAFE
764: #define HLTQ_FOREACH_SAFE(var, head, field, tvar) \
765: for ((var) = HLTQ_FIRST(head); \
766: (var) != HLTQ_END(head) && \
767: ((tvar) = HLTQ_NEXT(var, field), 1); \
768: (var) = (tvar))
769:
770: #undef HLTQ_FOREACH_REVERSE
771: #define HLTQ_FOREACH_REVERSE(var, head, headname, field) \
772: for ((var) = HLTQ_LAST(head, headname); \
773: (var) != HLTQ_END(head); \
774: (var) = HLTQ_PREV(var, headname, field))
775:
776: #undef HLTQ_FOREACH_REVERSE_SAFE
777: #define HLTQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \
778: for ((var) = HLTQ_LAST(head, headname); \
779: (var) != HLTQ_END(head) && \
780: ((tvar) = HLTQ_PREV(var, headname, field), 1); \
781: (var) = (tvar))
782:
783: /* Concatenate queue2 to the end of queue1. */
784: #undef HLTQ_CONCAT
785: #define HLTQ_CONCAT(queue1, queue2, field) do { \
786: (queue2)->field.tqe_prev = (queue1)->field.tqe_prev; \
787: *(queue1)->field.tqe_prev = (queue2); \
788: (queue1)->field.tqe_prev = &(queue2)->field.tqe_next; \
789: } while (0)
790:
791: /* Convert a headless tailq to a headful one. */
792: #define HLTQ_TO_TAILQ(head, hl, field) do { \
793: (head)->tqh_first = (hl); \
794: (head)->tqh_last = (hl)->field.tqe_prev; \
795: (hl)->field.tqe_prev = &(head)->tqh_first; \
796: } while (0)
797:
798: /* Concatenate a headless tail queue to the end of a regular tail queue. */
799: #define TAILQ_CONCAT_HLTQ(head, hl, field) do { \
800: void *last = (hl)->field.tqe_prev; \
801: (hl)->field.tqe_prev = (head)->tqh_last; \
802: *(head)->tqh_last = (hl); \
803: (head)->tqh_last = last; \
804: } while (0)
805:
806: #endif /* !_SUDO_QUEUE_H_ */