Code Coverage: vinyl-cache/include/vqueue.h
 
82217aa4fc7094b3610340078afaf78cd95a8ec9
 
0
/*-
1
 * SPDX-License-Identifier: BSD-3-Clause
2
 *
3
 * Copyright (c) 1991, 1993
4
 *      The Regents of the University of California.  All rights reserved.
5
 *
6
 * Redistribution and use in source and binary forms, with or without
7
 * modification, are permitted provided that the following conditions
8
 * are met:
9
 * 1. Redistributions of source code must retain the above copyright
10
 *    notice, this list of conditions and the following disclaimer.
11
 * 2. Redistributions in binary form must reproduce the above copyright
12
 *    notice, this list of conditions and the following disclaimer in the
13
 *    documentation and/or other materials provided with the distribution.
14
 * 3. Neither the name of the University nor the names of its contributors
15
 *    may be used to endorse or promote products derived from this software
16
 *    without specific prior written permission.
17
 *
18
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
19
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
22
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28
 * SUCH DAMAGE.
29
 *
30
 *      @(#)queue.h     8.5 (Berkeley) 8/20/94
31
 * $FreeBSD: head/sys/sys/queue.h 251887 2013-06-18 02:57:56Z lstewart $
32
 */
33
34
#ifndef VINYL_QUEUE_H
35
#define VINYL_QUEUE_H
36
37
/*
38
 * This file defines four types of data structures: singly-linked lists,
39
 * singly-linked tail queues, lists and tail queues.
40
 *
41
 * A singly-linked list is headed by a single forward pointer. The elements
42
 * are singly linked for minimum space and pointer manipulation overhead at
43
 * the expense of O(n) removal for arbitrary elements. New elements can be
44
 * added to the list after an existing element or at the head of the list.
45
 * Elements being removed from the head of the list should use the explicit
46
 * macro for this purpose for optimum efficiency. A singly-linked list may
47
 * only be traversed in the forward direction.  Singly-linked lists are ideal
48
 * for applications with large datasets and few or no removals or for
49
 * implementing a LIFO queue.
50
 *
51
 * A singly-linked tail queue is headed by a pair of pointers, one to the
52
 * head of the list and the other to the tail of the list. The elements are
53
 * singly linked for minimum space and pointer manipulation overhead at the
54
 * expense of O(n) removal for arbitrary elements. New elements can be added
55
 * to the list after an existing element, at the head of the list, or at the
56
 * end of the list. Elements being removed from the head of the tail queue
57
 * should use the explicit macro for this purpose for optimum efficiency.
58
 * A singly-linked tail queue may only be traversed in the forward direction.
59
 * Singly-linked tail queues are ideal for applications with large datasets
60
 * and few or no removals or for implementing a FIFO queue.
61
 *
62
 * A list is headed by a single forward pointer (or an array of forward
63
 * pointers for a hash table header). The elements are doubly linked
64
 * so that an arbitrary element can be removed without a need to
65
 * traverse the list. New elements can be added to the list before
66
 * or after an existing element or at the head of the list. A list
67
 * may be traversed in either direction.
68
 *
69
 * A tail queue is headed by a pair of pointers, one to the head of the
70
 * list and the other to the tail of the list. The elements are doubly
71
 * linked so that an arbitrary element can be removed without a need to
72
 * traverse the list. New elements can be added to the list before or
73
 * after an existing element, at the head of the list, or at the end of
74
 * the list. A tail queue may be traversed in either direction.
75
 *
76
 * For details on the use of these macros, see the queue(3) manual page.
77
 *
78
 *
79
 *                              VSLIST  VLIST   VSTAILQ VTAILQ
80
 * _HEAD                        +       +       +       +
81
 * _HEAD_INITIALIZER            +       +       +       +
82
 * _ENTRY                       +       +       +       +
83
 * _INIT                        +       +       +       +
84
 * _EMPTY                       +       +       +       +
85
 * _FIRST                       +       +       +       +
86
 * _NEXT                        +       +       +       +
87
 * _PREV                        -       +       -       +
88
 * _LAST                        -       -       +       +
89
 * _FOREACH                     +       +       +       +
90
 * _FOREACH_FROM                +       +       +       +
91
 * _FOREACH_SAFE                +       +       +       +
92
 * _FOREACH_FROM_SAFE           +       +       +       +
93
 * _FOREACH_REVERSE             -       -       -       +
94
 * _FOREACH_REVERSE_FROM        -       -       -       +
95
 * _FOREACH_REVERSE_SAFE        -       -       -       +
96
 * _FOREACH_REVERSE_FROM_SAFE   -       -       -       +
97
 * _INSERT_HEAD                 +       +       +       +
98
 * _INSERT_BEFORE               -       +       -       +
99
 * _INSERT_AFTER                +       +       +       +
100
 * _INSERT_TAIL                 -       -       +       +
101
 * _CONCAT                      -       -       +       +
102
 * _REMOVE_AFTER                +       -       +       -
103
 * _REMOVE_HEAD                 +       -       +       -
104
 * _REMOVE                      +       +       +       +
105
 * _SWAP                        +       +       +       +
106
 *
107
 */
108
#define TRACEBUF
109
#define TRACEBUF_INITIALIZER
110
#define TRASHIT(x)
111
112
/*
113
 * Singly-linked List declarations.
114
 */
115
#define VSLIST_HEAD(name, type)                                         \
116
struct name {                                                           \
117
        struct type *vslh_first;        /* first element */             \
118
}
119
120
#define VSLIST_HEAD_INITIALIZER(head)                                   \
121
        { NULL }
122
123
#define VSLIST_ENTRY(type)                                              \
124
struct {                                                                \
125
        struct type *vsle_next; /* next element */                      \
126
}
127
128
/*
129
 * Singly-linked List functions.
130
 */
131
#define VSLIST_EMPTY(head)      ((head)->vslh_first == NULL)
132
133 141548
#define VSLIST_FIRST(head)      ((head)->vslh_first)
134
135
#define VSLIST_FOREACH(var, head, field)                                \
136
        for ((var) = VSLIST_FIRST((head));                              \
137
            (var);                                                      \
138
            (var) = VSLIST_NEXT((var), field))
139
140
#define VSLIST_FOREACH_FROM(var, head, field)                           \
141
        for ((var) = ((var) ? (var) : VSLIST_FIRST((head)));            \
142
            (var);                                                      \
143
            (var) = VSLIST_NEXT((var), field))
144
145
#define VSLIST_FOREACH_SAFE(var, head, field, tvar)                     \
146
        for ((var) = VSLIST_FIRST((head));                              \
147
            (var) && ((tvar) = VSLIST_NEXT((var), field), 1);           \
148
            (var) = (tvar))
149
150
#define VSLIST_FOREACH_FROM_SAFE(var, head, field, tvar)                        \
151
        for ((var) = ((var) ? (var) : VSLIST_FIRST((head)));            \
152
            (var) && ((tvar) = VSLIST_NEXT((var), field), 1);           \
153
            (var) = (tvar))
154
155
#define VSLIST_FOREACH_PREVPTR(var, varp, head, field)                  \
156
        for ((varp) = &VSLIST_FIRST((head));                            \
157
            ((var) = *(varp)) != NULL;                                  \
158
            (varp) = &VSLIST_NEXT((var), field))
159
160
#define VSLIST_INIT(head) do {                                          \
161
        VSLIST_FIRST((head)) = NULL;                                    \
162
} while (0)
163
164
#define VSLIST_INSERT_AFTER(slistelm, elm, field) do {                  \
165
        VSLIST_NEXT((elm), field) = VSLIST_NEXT((slistelm), field);     \
166
        VSLIST_NEXT((slistelm), field) = (elm);                         \
167
} while (0)
168
169 2243
#define VSLIST_INSERT_HEAD(head, elm, field) do {                       \
170 2243
        VSLIST_NEXT((elm), field) = VSLIST_FIRST((head));               \
171 2243
        VSLIST_FIRST((head)) = (elm);                                   \
172 2243
} while (0)
173
174 6719
#define VSLIST_NEXT(elm, field) ((elm)->field.vsle_next)
175
176 10
#define VSLIST_REMOVE(head, elm, type, field) do {                      \
177 10
        if (VSLIST_FIRST((head)) == (elm)) {                            \
178 10
                VSLIST_REMOVE_HEAD((head), field);                      \
179 10
        }                                                               \
180 10
        else {                                                          \
181 0
                struct type *curelm = VSLIST_FIRST((head));             \
182 0
                while (VSLIST_NEXT(curelm, field) != (elm))             \
183 0
                        curelm = VSLIST_NEXT(curelm, field);            \
184 0
                VSLIST_REMOVE_AFTER(curelm, field);                     \
185 0
        }                                                               \
186 10
        TRASHIT(*oldnext);                                              \
187 10
} while (0)
188
189 0
#define VSLIST_REMOVE_AFTER(elm, field) do {                            \
190 0
        VSLIST_NEXT(elm, field) =                                       \
191 0
            VSLIST_NEXT(VSLIST_NEXT(elm, field), field);                        \
192 0
} while (0)
193
194 10
#define VSLIST_REMOVE_HEAD(head, field) do {                            \
195 10
        VSLIST_FIRST((head)) = VSLIST_NEXT(VSLIST_FIRST((head)), field);\
196 10
} while (0)
197
198
#define VSLIST_SWAP(head1, head2, type) do {                            \
199
        struct type *swap_first = VSLIST_FIRST(head1);                  \
200
        VSLIST_FIRST(head1) = VSLIST_FIRST(head2);                      \
201
        VSLIST_FIRST(head2) = swap_first;                               \
202
} while (0)
203
204
/*
205
 * Singly-linked Tail queue declarations.
206
 */
207
#define VSTAILQ_HEAD(name, type)                                        \
208
struct name {                                                           \
209
        struct type *vstqh_first;/* first element */                    \
210
        struct type **vstqh_last;/* addr of last next element */        \
211
}
212
213
#define VSTAILQ_HEAD_INITIALIZER(head)                                  \
214
        { NULL, &(head).vstqh_first }
215
216
#define VSTAILQ_ENTRY(type)                                             \
217
struct {                                                                \
218
        struct type *vstqe_next;        /* next element */              \
219
}
220
221
/*
222
 * Singly-linked Tail queue functions.
223
 */
224 1024
#define VSTAILQ_CONCAT(head1, head2) do {                               \
225 1024
        if (!VSTAILQ_EMPTY((head2))) {                                  \
226 0
                *(head1)->vstqh_last = (head2)->vstqh_first;            \
227 0
                (head1)->vstqh_last = (head2)->vstqh_last;              \
228 0
                VSTAILQ_INIT((head2));                                  \
229 0
        }                                                               \
230 1024
} while (0)
231
232 3477
#define VSTAILQ_EMPTY(head)     ((head)->vstqh_first == NULL)
233
234 24794
#define VSTAILQ_FIRST(head)     ((head)->vstqh_first)
235
236
#define VSTAILQ_FOREACH(var, head, field)                               \
237 2141
        for ((var) = VSTAILQ_FIRST((head));                             \
238 4834
           (var);                                                       \
239 2693
           (var) = VSTAILQ_NEXT((var), field))
240
241
#define VSTAILQ_FOREACH_FROM(var, head, field)                          \
242 36
        for ((var) = ((var) ? (var) : VSTAILQ_FIRST((head)));           \
243 170
           (var);                                                       \
244 134
           (var) = VSTAILQ_NEXT((var), field))
245
246
#define VSTAILQ_FOREACH_SAFE(var, head, field, tvar)                    \
247 1024
        for ((var) = VSTAILQ_FIRST((head));                             \
248 1024
            (var) && ((tvar) = VSTAILQ_NEXT((var), field), 1);          \
249 1024
            (var) = (tvar))
250
251
#define VSTAILQ_FOREACH_FROM_SAFE(var, head, field, tvar)               \
252
        for ((var) = ((var) ? (var) : VSTAILQ_FIRST((head)));           \
253
            (var) && ((tvar) = VSTAILQ_NEXT((var), field), 1);          \
254
            (var) = (tvar))
255
256 3192
#define VSTAILQ_INIT(head) do {                                         \
257 3192
        VSTAILQ_FIRST((head)) = NULL;                                   \
258 3192
        (head)->vstqh_last = &VSTAILQ_FIRST((head));                    \
259 3192
} while (0)
260
261
#define VSTAILQ_INSERT_AFTER(head, tqelm, elm, field) do {              \
262
        if ((VSTAILQ_NEXT((elm), field) = VSTAILQ_NEXT((tqelm), field)) == NULL)\
263
                (head)->vstqh_last = &VSTAILQ_NEXT((elm), field);       \
264
        VSTAILQ_NEXT((tqelm), field) = (elm);                           \
265
} while (0)
266
267 281
#define VSTAILQ_INSERT_HEAD(head, elm, field) do {                      \
268 281
        if ((VSTAILQ_NEXT((elm), field) = VSTAILQ_FIRST((head))) == NULL)\
269 281
                (head)->vstqh_last = &VSTAILQ_NEXT((elm), field);       \
270 281
        VSTAILQ_FIRST((head)) = (elm);                                  \
271 281
} while (0)
272
273 4277
#define VSTAILQ_INSERT_TAIL(head, elm, field) do {                      \
274 4277
        VSTAILQ_NEXT((elm), field) = NULL;                              \
275 4277
        *(head)->vstqh_last = (elm);                                    \
276 4277
        (head)->vstqh_last = &VSTAILQ_NEXT((elm), field);               \
277 4277
} while (0)
278
279
#define VSTAILQ_LAST(head, type, field)                                 \
280 2453
        (VSTAILQ_EMPTY((head)) ? NULL :                                 \
281 2453
            __containerof((head)->vstqh_last, struct type, field.vstqe_next))
282
283 16034
#define VSTAILQ_NEXT(elm, field)        ((elm)->field.vstqe_next)
284
285 1785
#define VSTAILQ_REMOVE(head, elm, type, field) do {                     \
286 1785
        if (VSTAILQ_FIRST((head)) == (elm)) {                           \
287 1785
                VSTAILQ_REMOVE_HEAD((head), field);                     \
288 1785
        }                                                               \
289 1785
        else {                                                          \
290 0
                struct type *curelm = VSTAILQ_FIRST((head));            \
291 0
                while (VSTAILQ_NEXT(curelm, field) != (elm))            \
292 0
                        curelm = VSTAILQ_NEXT(curelm, field);           \
293 0
                VSTAILQ_REMOVE_AFTER(head, curelm, field);              \
294 0
        }                                                               \
295 1785
        TRASHIT(*oldnext);                                              \
296 1785
} while (0)
297
298 0
#define VSTAILQ_REMOVE_AFTER(head, elm, field) do {                     \
299 0
        if ((VSTAILQ_NEXT(elm, field) =                                 \
300 0
             VSTAILQ_NEXT(VSTAILQ_NEXT(elm, field), field)) == NULL)    \
301 0
                (head)->vstqh_last = &VSTAILQ_NEXT((elm), field);               \
302 0
} while (0)
303
304 1789
#define VSTAILQ_REMOVE_HEAD(head, field) do {                           \
305 1789
        if ((VSTAILQ_FIRST((head)) =                                    \
306 1789
             VSTAILQ_NEXT(VSTAILQ_FIRST((head)), field)) == NULL)       \
307 1789
                (head)->vstqh_last = &VSTAILQ_FIRST((head));            \
308 1789
} while (0)
309
310
#define VSTAILQ_SWAP(head1, head2, type) do {                           \
311
        struct type *swap_first = VSTAILQ_FIRST(head1);                 \
312
        struct type **swap_last = (head1)->vstqh_last;                  \
313
        VSTAILQ_FIRST(head1) = VSTAILQ_FIRST(head2);                    \
314
        (head1)->vstqh_last = (head2)->vstqh_last;                      \
315
        VSTAILQ_FIRST(head2) = swap_first;                              \
316
        (head2)->vstqh_last = swap_last;                                        \
317
        if (VSTAILQ_EMPTY(head1))                                       \
318
                (head1)->vstqh_last = &VSTAILQ_FIRST(head1);            \
319
        if (VSTAILQ_EMPTY(head2))                                       \
320
                (head2)->vstqh_last = &VSTAILQ_FIRST(head2);            \
321
} while (0)
322
323
324
/*
325
 * List declarations.
326
 */
327
#define VLIST_HEAD(name, type)                                          \
328
struct name {                                                           \
329
        struct type *vlh_first; /* first element */                     \
330
}
331
332
#define VLIST_HEAD_INITIALIZER(head)                                    \
333
        { NULL }
334
335
#define VLIST_ENTRY(type)                                               \
336
struct {                                                                \
337
        struct type *vle_next;  /* next element */                      \
338
        struct type **vle_prev; /* address of previous next element */  \
339
}
340
341
/*
342
 * List functions.
343
 */
344
345
346
#define VLIST_EMPTY(head)       ((head)->vlh_first == NULL)
347
348
#define VLIST_FIRST(head)       ((head)->vlh_first)
349
350
#define VLIST_FOREACH(var, head, field)                                 \
351
        for ((var) = VLIST_FIRST((head));                               \
352
            (var);                                                      \
353
            (var) = VLIST_NEXT((var), field))
354
355
#define VLIST_FOREACH_FROM(var, head, field)                            \
356
        for ((var) = ((var) ? (var) : VLIST_FIRST((head)));             \
357
            (var);                                                      \
358
            (var) = VLIST_NEXT((var), field))
359
360
#define VLIST_FOREACH_SAFE(var, head, field, tvar)                      \
361
        for ((var) = VLIST_FIRST((head));                               \
362
            (var) && ((tvar) = VLIST_NEXT((var), field), 1);            \
363
            (var) = (tvar))
364
365
#define VLIST_FOREACH_FROM_SAFE(var, head, field, tvar)                 \
366
        for ((var) = ((var) ? (var) : VLIST_FIRST((head)));             \
367
            (var) && ((tvar) = VLIST_NEXT((var), field), 1);            \
368
            (var) = (tvar))
369
370
#define VLIST_INIT(head) do {                                           \
371
        VLIST_FIRST((head)) = NULL;                                     \
372
} while (0)
373
374
#define VLIST_INSERT_AFTER(listelm, elm, field) do {                    \
375
        if ((VLIST_NEXT((elm), field) = VLIST_NEXT((listelm), field)) != NULL)\
376
                VLIST_NEXT((listelm), field)->field.vle_prev =          \
377
                    &VLIST_NEXT((elm), field);                          \
378
        VLIST_NEXT((listelm), field) = (elm);                           \
379
        (elm)->field.vle_prev = &VLIST_NEXT((listelm), field);          \
380
} while (0)
381
382
#define VLIST_INSERT_BEFORE(listelm, elm, field) do {                   \
383
        (elm)->field.vle_prev = (listelm)->field.vle_prev;              \
384
        VLIST_NEXT((elm), field) = (listelm);                           \
385
        *(listelm)->field.vle_prev = (elm);                             \
386
        (listelm)->field.vle_prev = &VLIST_NEXT((elm), field);          \
387
} while (0)
388
389
#define VLIST_INSERT_HEAD(head, elm, field) do {                        \
390
        if ((VLIST_NEXT((elm), field) = VLIST_FIRST((head))) != NULL)   \
391
                VLIST_FIRST((head))->field.vle_prev = &VLIST_NEXT((elm), field);\
392
        VLIST_FIRST((head)) = (elm);                                    \
393
        (elm)->field.vle_prev = &VLIST_FIRST((head));                   \
394
} while (0)
395
396
#define VLIST_NEXT(elm, field)  ((elm)->field.vle_next)
397
398
#define VLIST_PREV(elm, head, type, field)                              \
399
        ((elm)->field.vle_prev == &VLIST_FIRST((head)) ? NULL :         \
400
            __containerof((elm)->field.vle_prev, struct type, field.vle_next))
401
402
#define VLIST_REMOVE(elm, field) do {                                   \
403
        if (VLIST_NEXT((elm), field) != NULL)                           \
404
                VLIST_NEXT((elm), field)->field.vle_prev =              \
405
                    (elm)->field.vle_prev;                              \
406
        *(elm)->field.vle_prev = VLIST_NEXT((elm), field);              \
407
        TRASHIT(*oldnext);                                              \
408
        TRASHIT(*oldprev);                                              \
409
} while (0)
410
411
#define VLIST_SWAP(head1, head2, type, field) do {                      \
412
        struct type *swap_tmp = VLIST_FIRST((head1));                   \
413
        VLIST_FIRST((head1)) = VLIST_FIRST((head2));                    \
414
        VLIST_FIRST((head2)) = swap_tmp;                                        \
415
        if ((swap_tmp = VLIST_FIRST((head1))) != NULL)                  \
416
                swap_tmp->field.vle_prev = &VLIST_FIRST((head1));               \
417
        if ((swap_tmp = VLIST_FIRST((head2))) != NULL)                  \
418
                swap_tmp->field.vle_prev = &VLIST_FIRST((head2));               \
419
} while (0)
420
421
/*
422
 * Tail queue declarations.
423
 */
424 3918
#define VTAILQ_HEAD(name, type)                                         \
425 3918
struct name {                                                           \
426 3918
        struct type *vtqh_first;        /* first element */             \
427 3918
        struct type **vtqh_last;        /* addr of last next element */ \
428 3918
        TRACEBUF                                                        \
429 3918
}
430
431
#define VTAILQ_HEAD_INITIALIZER(head)                                   \
432 5708
        { NULL, &(head).vtqh_first, TRACEBUF_INITIALIZER }
433
434
#define VTAILQ_ENTRY(type)                                              \
435
struct {                                                                \
436
        struct type *vtqe_next; /* next element */                      \
437
        struct type **vtqe_prev;        /* address of previous next element */\
438
        TRACEBUF                                                        \
439
}
440
441
/*
442
 * Tail queue functions.
443
 */
444
445 2050
#define VTAILQ_CONCAT(head1, head2, field) do {                         \
446 2050
        if (!VTAILQ_EMPTY(head2)) {                                     \
447 1026
                *(head1)->vtqh_last = (head2)->vtqh_first;              \
448 1026
                (head2)->vtqh_first->field.vtqe_prev = (head1)->vtqh_last;\
449 1026
                (head1)->vtqh_last = (head2)->vtqh_last;                \
450 1026
                VTAILQ_INIT((head2));                                   \
451 1026
        }                                                               \
452 2050
} while (0)
453
454 364561
#define VTAILQ_EMPTY(head)      ((head)->vtqh_first == NULL)
455
456 26939668
#define VTAILQ_FIRST(head)      ((head)->vtqh_first)
457
458
#define VTAILQ_FOREACH(var, head, field)                                \
459 16224053
        for ((var) = VTAILQ_FIRST((head));                              \
460 89884842
            (var);                                                      \
461 73691584
            (var) = VTAILQ_NEXT((var), field))
462
463
#define VTAILQ_FOREACH_FROM(var, head, field)                           \
464 88
        for ((var) = ((var) ? (var) : VTAILQ_FIRST((head)));            \
465 152
            (var);                                                      \
466 88
            (var) = VTAILQ_NEXT((var), field))
467
468
#define VTAILQ_FOREACH_SAFE(var, head, field, tvar)                     \
469 72370
        for ((var) = VTAILQ_FIRST((head));                              \
470 213523
            (var) && ((tvar) = VTAILQ_NEXT((var), field), 1);           \
471 147299
            (var) = (tvar))
472
473
#define VTAILQ_FOREACH_FROM_SAFE(var, head, field, tvar)                        \
474
        for ((var) = ((var) ? (var) : VTAILQ_FIRST((head)));            \
475
            (var) && ((tvar) = VTAILQ_NEXT((var), field), 1);           \
476
            (var) = (tvar))
477
478
#define VTAILQ_FOREACH_REVERSE(var, head, headname, field)              \
479 8210
        for ((var) = VTAILQ_LAST((head), headname);                     \
480 39637
            (var);                                                      \
481 31427
            (var) = VTAILQ_PREV((var), headname, field))
482
483
#define VTAILQ_FOREACH_REVERSE_FROM(var, head, headname, field)         \
484 1143
        for ((var) = ((var) ? (var) : VTAILQ_LAST((head), headname));   \
485 2659
            (var);                                                      \
486 1516
            (var) = VTAILQ_PREV((var), headname, field))
487
488
#define VTAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar)   \
489 57
        for ((var) = VTAILQ_LAST((head), headname);                     \
490 92
            (var) && ((tvar) = VTAILQ_PREV((var), headname, field), 1); \
491 57
            (var) = (tvar))
492
493
#define VTAILQ_FOREACH_REVERSE_FROM_SAFE(var, head, headname, field, tvar) \
494
        for ((var) = ((var) ? (var) : VTAILQ_LAST((head), headname));   \
495
            (var) && ((tvar) = VTAILQ_PREV((var), headname, field), 1); \
496
            (var) = (tvar))
497
498 3588397
#define VTAILQ_INIT(head) do {                                          \
499 3586352
        VTAILQ_FIRST((head)) = NULL;                                    \
500 3586352
        (head)->vtqh_last = &VTAILQ_FIRST((head));                      \
501 3586352
} while (0)
502
503 231
#define VTAILQ_INSERT_AFTER(head, listelm, elm, field) do {             \
504 231
        if ((VTAILQ_NEXT((elm), field) = VTAILQ_NEXT((listelm), field)) != NULL)\
505 231
                VTAILQ_NEXT((elm), field)->field.vtqe_prev =            \
506 0
                    &VTAILQ_NEXT((elm), field);                         \
507 231
        else {                                                          \
508 231
                (head)->vtqh_last = &VTAILQ_NEXT((elm), field);         \
509 231
        }                                                               \
510 231
        VTAILQ_NEXT((listelm), field) = (elm);                          \
511 231
        (elm)->field.vtqe_prev = &VTAILQ_NEXT((listelm), field);        \
512 231
} while (0)
513
514 449539
#define VTAILQ_INSERT_BEFORE(listelm, elm, field) do {                  \
515 449539
        (elm)->field.vtqe_prev = (listelm)->field.vtqe_prev;            \
516 449539
        VTAILQ_NEXT((elm), field) = (listelm);                          \
517 449539
        *(listelm)->field.vtqe_prev = (elm);                            \
518 449539
        (listelm)->field.vtqe_prev = &VTAILQ_NEXT((elm), field);        \
519 449539
} while (0)
520
521 145303
#define VTAILQ_INSERT_HEAD(head, elm, field) do {                       \
522 145303
        if ((VTAILQ_NEXT((elm), field) = VTAILQ_FIRST((head))) != NULL) \
523 145303
                VTAILQ_FIRST((head))->field.vtqe_prev =                 \
524 121678
                    &VTAILQ_NEXT((elm), field);                         \
525 145303
        else                                                            \
526 145303
                (head)->vtqh_last = &VTAILQ_NEXT((elm), field);         \
527 145303
        VTAILQ_FIRST((head)) = (elm);                                   \
528 145303
        (elm)->field.vtqe_prev = &VTAILQ_FIRST((head));                 \
529 145303
} while (0)
530
531 10104175
#define VTAILQ_INSERT_TAIL(head, elm, field) do {                       \
532 10104175
        VTAILQ_NEXT((elm), field) = NULL;                               \
533 10104175
        (elm)->field.vtqe_prev = (head)->vtqh_last;                     \
534 10104175
        *(head)->vtqh_last = (elm);                                     \
535 10104175
        (head)->vtqh_last = &VTAILQ_NEXT((elm), field);                 \
536 10104175
} while (0)
537
538
#define VTAILQ_LAST(head, headname)                                     \
539 72204
        (*(((struct headname *)((head)->vtqh_last))->vtqh_last))
540
541 102997586
#define VTAILQ_NEXT(elm, field) ((elm)->field.vtqe_next)
542
543
#define VTAILQ_PREV(elm, headname, field)                               \
544 172163
        (*(((struct headname *)((elm)->field.vtqe_prev))->vtqh_last))
545
546 775611
#define VTAILQ_REMOVE(head, elm, field) do {                            \
547 775611
        if ((VTAILQ_NEXT((elm), field)) != NULL)                        \
548 775611
                VTAILQ_NEXT((elm), field)->field.vtqe_prev =            \
549 627368
                    (elm)->field.vtqe_prev;                             \
550 775611
        else {                                                          \
551 148243
                (head)->vtqh_last = (elm)->field.vtqe_prev;             \
552 148243
        }                                                               \
553 775611
        *(elm)->field.vtqe_prev = VTAILQ_NEXT((elm), field);            \
554 775611
        TRASHIT(*oldnext);                                              \
555 775611
        TRASHIT(*oldprev);                                              \
556 775611
} while (0)
557
558 2447
#define VTAILQ_SWAP(head1, head2, type, field) do {                     \
559 2447
        struct type *swap_first = (head1)->vtqh_first;                  \
560 2447
        struct type **swap_last = (head1)->vtqh_last;                   \
561 2447
        (head1)->vtqh_first = (head2)->vtqh_first;                      \
562 2447
        (head1)->vtqh_last = (head2)->vtqh_last;                                \
563 2447
        (head2)->vtqh_first = swap_first;                               \
564 2447
        (head2)->vtqh_last = swap_last;                                 \
565 2447
        if ((swap_first = (head1)->vtqh_first) != NULL)                 \
566 2447
                swap_first->field.vtqe_prev = &(head1)->vtqh_first;     \
567 2447
        else                                                            \
568 2447
                (head1)->vtqh_last = &(head1)->vtqh_first;              \
569 2447
        if ((swap_first = (head2)->vtqh_first) != NULL)                 \
570 2447
                swap_first->field.vtqe_prev = &(head2)->vtqh_first;     \
571 2447
        else                                                            \
572 2447
                (head2)->vtqh_last = &(head2)->vtqh_first;              \
573 2447
} while (0)
574
575
#endif /* !VINYL_QUEUE_H */