Where Online Learning is simpler!
The C and C++ Include Header Files
/usr/include/ntirpc/misc/queue.h
$ cat -n /usr/include/ntirpc/misc/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 $FreeBSD: 30 * src/sys/sys/queue.h,v 1.75.2.1.2.1 2011/11/11 04:20:22 kensmith Exp 31 * $ 32 */ 33 34 #ifndef _TIRPC_MISC_QUEUE_H_ 35 #define _TIRPC_MISC_QUEUE_H_ 36 37 #if defined(__FreeBSD__) && defined(_SYS_QUEUE_H_) 38 #error misc/queue.h must be included before sys/queue.h 39 #else 40 #define _SYS_QUEUE_H_ 41 #endif 42 43 #include <sys/cdefs.h> 44 45 /* 46 * This file defines four types of data structures: singly-linked lists, 47 * singly-linked tail queues, lists and tail queues. 48 * 49 * A singly-linked list is headed by a single forward pointer. The elements 50 * are singly linked for minimum space and pointer manipulation overhead at 51 * the expense of O(n) removal for arbitrary elements. New elements can be 52 * added to the list after an existing element or at the head of the list. 53 * Elements being removed from the head of the list should use the explicit 54 * macro for this purpose for optimum efficiency. A singly-linked list may 55 * only be traversed in the forward direction. Singly-linked lists are ideal 56 * for applications with large datasets and few or no removals or for 57 * implementing a LIFO queue. 58 * 59 * A singly-linked tail queue is headed by a pair of pointers, one to the 60 * head of the list and the other to the tail of the list. The elements are 61 * singly linked for minimum space and pointer manipulation overhead at the 62 * expense of O(n) removal for arbitrary elements. New elements can be added 63 * to the list after an existing element, at the head of the list, or at the 64 * end of the list. Elements being removed from the head of the tail queue 65 * should use the explicit macro for this purpose for optimum efficiency. 66 * A singly-linked tail queue may only be traversed in the forward direction. 67 * Singly-linked tail queues are ideal for applications with large datasets 68 * and few or no removals or for implementing a FIFO queue. 69 * 70 * A list is headed by a single forward pointer (or an array of forward 71 * pointers for a hash table header). The elements are doubly linked 72 * so that an arbitrary element can be removed without a need to 73 * traverse the list. New elements can be added to the list before 74 * or after an existing element or at the head of the list. A list 75 * may only be traversed in the forward direction. 76 * 77 * A tail queue is headed by a pair of pointers, one to the head of the 78 * list and the other to the tail of the list. The elements are doubly 79 * linked so that an arbitrary element can be removed without a need to 80 * traverse the list. New elements can be added to the list before or 81 * after an existing element, at the head of the list, or at the end of 82 * the list. A tail queue may be traversed in either direction. 83 * 84 * For details on the use of these macros, see the queue(3) manual page. 85 * 86 * 87 * SLIST LIST STAILQ TAILQ 88 * _HEAD + + + + 89 * _HEAD_INITIALIZER + + + + 90 * _ENTRY + + + + 91 * _INIT + + + + 92 * _EMPTY + + + + 93 * _FIRST + + + + 94 * _NEXT + + + + 95 * _PREV - - - + 96 * _LAST - - + + 97 * _FOREACH + + + + 98 * _FOREACH_SAFE + + + + 99 * _FOREACH_REVERSE - - - + 100 * _FOREACH_REVERSE_SAFE - - - + 101 * _INSERT_HEAD + + + + 102 * _INSERT_BEFORE - + - + 103 * _INSERT_AFTER + + + + 104 * _INSERT_TAIL - - + + 105 * _CONCAT - - + + 106 * _REMOVE_AFTER + - + - 107 * _REMOVE_HEAD + - + - 108 * _REMOVE + + + + 109 * _SWAP + + + + 110 * 111 */ 112 #ifdef QUEUE_MACRO_DEBUG 113 /* Store the last 2 places the queue element or head was altered */ 114 struct qm_trace { 115 char *lastfile; 116 int lastline; 117 char *prevfile; 118 int prevline; 119 }; 120 121 #define TRACEBUF struct qm_trace trace; 122 #define TRASHIT(x) do {(x) = (void *)-1; } while (0) 123 #define QMD_SAVELINK(name, link) void **name = (void *)&(link) 124 125 #define QMD_TRACE_HEAD(head) do { \ 126 (head)->trace.prevline = (head)->trace.lastline; \ 127 (head)->trace.prevfile = (head)->trace.lastfile; \ 128 (head)->trace.lastline = __LINE__; \ 129 (head)->trace.lastfile = __FILE__; \ 130 } while (0) 131 132 #define QMD_TRACE_ELEM(elem) do { \ 133 (elem)->trace.prevline = (elem)->trace.lastline; \ 134 (elem)->trace.prevfile = (elem)->trace.lastfile; \ 135 (elem)->trace.lastline = __LINE__; \ 136 (elem)->trace.lastfile = __FILE__; \ 137 } while (0) 138 139 #else 140 #define QMD_TRACE_ELEM(elem) 141 #define QMD_TRACE_HEAD(head) 142 #define QMD_SAVELINK(name, link) 143 #define TRACEBUF 144 #define TRASHIT(x) 145 #endif /* QUEUE_MACRO_DEBUG */ 146 147 /* 148 * Singly-linked List declarations. 149 */ 150 #define SLIST_HEAD(name, type) \ 151 struct name { \ 152 struct type *slh_first; /* first element */ \ 153 } 154 155 #define SLIST_HEAD_INITIALIZER(head) \ 156 { NULL } 157 158 #define SLIST_ENTRY(type) \ 159 struct { \ 160 struct type *sle_next; /* next element */ \ 161 } 162 163 /* 164 * Singly-linked List functions. 165 */ 166 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) 167 168 #define SLIST_FIRST(head) ((head)->slh_first) 169 170 #define SLIST_FOREACH(var, head, field) \ 171 for ((var) = SLIST_FIRST((head)); \ 172 (var); \ 173 (var) = SLIST_NEXT((var), field)) 174 175 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ 176 for ((var) = SLIST_FIRST((head)); \ 177 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \ 178 (var) = (tvar)) 179 180 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ 181 for ((varp) = &SLIST_FIRST((head)); \ 182 ((var) = *(varp)) != NULL; \ 183 (varp) = &SLIST_NEXT((var), field)) 184 185 #define SLIST_INIT(head) do { \ 186 SLIST_FIRST((head)) = NULL; \ 187 } while (0) 188 189 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ 190 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \ 191 SLIST_NEXT((slistelm), field) = (elm); \ 192 } while (0) 193 194 #define SLIST_INSERT_HEAD(head, elm, field) do { \ 195 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \ 196 SLIST_FIRST((head)) = (elm); \ 197 } while (0) 198 199 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) 200 201 #define SLIST_REMOVE(head, elm, type, field) do { \ 202 QMD_SAVELINK(oldnext, (elm)->field.sle_next); \ 203 if (SLIST_FIRST((head)) == (elm)) { \ 204 SLIST_REMOVE_HEAD((head), field); \ 205 } \ 206 else { \ 207 struct type *curelm = SLIST_FIRST((head)); \ 208 while (SLIST_NEXT(curelm, field) != (elm)) \ 209 curelm = SLIST_NEXT(curelm, field); \ 210 SLIST_REMOVE_AFTER(curelm, field); \ 211 } \ 212 TRASHIT(*oldnext); \ 213 } while (0) 214 215 #define SLIST_REMOVE_AFTER(elm, field) do { \ 216 SLIST_NEXT(elm, field) = \ 217 SLIST_NEXT(SLIST_NEXT(elm, field), field); \ 218 } while (0) 219 220 #define SLIST_REMOVE_HEAD(head, field) do { \ 221 SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \ 222 } while (0) 223 224 #define SLIST_SWAP(head1, head2, type) do { \ 225 struct type *swap_first = SLIST_FIRST(head1); \ 226 SLIST_FIRST(head1) = SLIST_FIRST(head2); \ 227 SLIST_FIRST(head2) = swap_first; \ 228 } while (0) 229 230 /* 231 * Singly-linked Tail queue declarations. 232 */ 233 #define STAILQ_HEAD(name, type) \ 234 struct name { \ 235 struct type *stqh_first;/* first element */ \ 236 struct type **stqh_last;/* addr of last next element */ \ 237 } 238 239 #define STAILQ_HEAD_INITIALIZER(head) \ 240 { NULL, &(head).stqh_first } 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) do { \ 251 if (!STAILQ_EMPTY((head2))) { \ 252 *(head1)->stqh_last = (head2)->stqh_first; \ 253 (head1)->stqh_last = (head2)->stqh_last; \ 254 STAILQ_INIT((head2)); \ 255 } \ 256 } while (0) 257 258 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL) 259 260 #define STAILQ_FIRST(head) ((head)->stqh_first) 261 262 #define STAILQ_FOREACH(var, head, field) \ 263 for ((var) = STAILQ_FIRST((head)); \ 264 (var); \ 265 (var) = STAILQ_NEXT((var), field)) 266 267 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ 268 for ((var) = STAILQ_FIRST((head)); \ 269 (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \ 270 (var) = (tvar)) 271 272 #define STAILQ_INIT(head) do { \ 273 STAILQ_FIRST((head)) = NULL; \ 274 (head)->stqh_last = &STAILQ_FIRST((head)); \ 275 } while (0) 276 277 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ 278 if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\ 279 (head)->stqh_last = &STAILQ_NEXT((elm), field); \ 280 STAILQ_NEXT((tqelm), field) = (elm); \ 281 } while (0) 282 283 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ 284 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \ 285 (head)->stqh_last = &STAILQ_NEXT((elm), field); \ 286 STAILQ_FIRST((head)) = (elm); \ 287 } while (0) 288 289 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ 290 STAILQ_NEXT((elm), field) = NULL; \ 291 *(head)->stqh_last = (elm); \ 292 (head)->stqh_last = &STAILQ_NEXT((elm), field); \ 293 } while (0) 294 295 #define STAILQ_LAST(head, type, field) \ 296 (STAILQ_EMPTY((head)) ? \ 297 NULL : \ 298 ((struct type *)(void *) \ 299 ((char *)((head)->stqh_last) - __offsetof(struct type, field)))) 300 301 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) 302 303 #define STAILQ_REMOVE(head, elm, type, field) do { \ 304 QMD_SAVELINK(oldnext, (elm)->field.stqe_next); \ 305 if (STAILQ_FIRST((head)) == (elm)) { \ 306 STAILQ_REMOVE_HEAD((head), field); \ 307 } \ 308 else { \ 309 struct type *curelm = STAILQ_FIRST((head)); \ 310 while (STAILQ_NEXT(curelm, field) != (elm)) \ 311 curelm = STAILQ_NEXT(curelm, field); \ 312 STAILQ_REMOVE_AFTER(head, curelm, field); \ 313 } \ 314 TRASHIT(*oldnext); \ 315 } while (0) 316 317 #define STAILQ_REMOVE_AFTER(head, elm, field) do { \ 318 if ((STAILQ_NEXT(elm, field) = \ 319 STAILQ_NEXT(STAILQ_NEXT(elm, field), field)) == NULL) \ 320 (head)->stqh_last = &STAILQ_NEXT((elm), field); \ 321 } while (0) 322 323 #define STAILQ_REMOVE_HEAD(head, field) do { \ 324 if ((STAILQ_FIRST((head)) = \ 325 STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \ 326 (head)->stqh_last = &STAILQ_FIRST((head)); \ 327 } while (0) 328 329 #define STAILQ_SWAP(head1, head2, type) do { \ 330 struct type *swap_first = STAILQ_FIRST(head1); \ 331 struct type **swap_last = (head1)->stqh_last; \ 332 STAILQ_FIRST(head1) = STAILQ_FIRST(head2); \ 333 (head1)->stqh_last = (head2)->stqh_last; \ 334 STAILQ_FIRST(head2) = swap_first; \ 335 (head2)->stqh_last = swap_last; \ 336 if (STAILQ_EMPTY(head1)) \ 337 (head1)->stqh_last = &STAILQ_FIRST(head1); \ 338 if (STAILQ_EMPTY(head2)) \ 339 (head2)->stqh_last = &STAILQ_FIRST(head2); \ 340 } while (0) 341 342 /* 343 * List declarations. 344 */ 345 #define LIST_HEAD(name, type) \ 346 struct name { \ 347 struct type *lh_first; /* first element */ \ 348 } 349 350 #define LIST_HEAD_INITIALIZER(head) \ 351 { NULL } 352 353 #define LIST_ENTRY(type) \ 354 struct { \ 355 struct type *le_next; /* next element */ \ 356 struct type **le_prev; /* address of previous next element */ \ 357 } 358 359 /* 360 * List functions. 361 */ 362 363 #if (defined(_KERNEL) && defined(INVARIANTS)) 364 #define QMD_LIST_CHECK_HEAD(head, field) do { \ 365 if (LIST_FIRST((head)) != NULL && \ 366 LIST_FIRST((head))->field.le_prev != \ 367 &LIST_FIRST((head))) \ 368 panic("Bad list head %p first->prev != head", (head)); \ 369 } while (0) 370 371 #define QMD_LIST_CHECK_NEXT(elm, field) do { \ 372 if (LIST_NEXT((elm), field) != NULL && \ 373 LIST_NEXT((elm), field)->field.le_prev != \ 374 &((elm)->field.le_next)) \ 375 panic("Bad link elm %p next->prev != elm", (elm)); \ 376 } while (0) 377 378 #define QMD_LIST_CHECK_PREV(elm, field) do { \ 379 if (*(elm)->field.le_prev != (elm)) \ 380 panic("Bad link elm %p prev->next != elm", (elm)); \ 381 } while (0) 382 #else 383 #define QMD_LIST_CHECK_HEAD(head, field) 384 #define QMD_LIST_CHECK_NEXT(elm, field) 385 #define QMD_LIST_CHECK_PREV(elm, field) 386 #endif /* (_KERNEL && INVARIANTS) */ 387 388 #define LIST_EMPTY(head) ((head)->lh_first == NULL) 389 390 #define LIST_FIRST(head) ((head)->lh_first) 391 392 #define LIST_FOREACH(var, head, field) \ 393 for ((var) = LIST_FIRST((head)); \ 394 (var); \ 395 (var) = LIST_NEXT((var), field)) 396 397 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ 398 for ((var) = LIST_FIRST((head)); \ 399 (var) && ((tvar) = LIST_NEXT((var), field), 1); \ 400 (var) = (tvar)) 401 402 #define LIST_INIT(head) do { \ 403 LIST_FIRST((head)) = NULL; \ 404 } while (0) 405 406 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ 407 QMD_LIST_CHECK_NEXT(listelm, field); \ 408 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\ 409 LIST_NEXT((listelm), field)->field.le_prev = \ 410 &LIST_NEXT((elm), field); \ 411 LIST_NEXT((listelm), field) = (elm); \ 412 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \ 413 } while (0) 414 415 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ 416 QMD_LIST_CHECK_PREV(listelm, field); \ 417 (elm)->field.le_prev = (listelm)->field.le_prev; \ 418 LIST_NEXT((elm), field) = (listelm); \ 419 *(listelm)->field.le_prev = (elm); \ 420 (listelm)->field.le_prev = &LIST_NEXT((elm), field); \ 421 } while (0) 422 423 #define LIST_INSERT_HEAD(head, elm, field) do { \ 424 QMD_LIST_CHECK_HEAD((head), field); \ 425 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \ 426 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\ 427 LIST_FIRST((head)) = (elm); \ 428 (elm)->field.le_prev = &LIST_FIRST((head)); \ 429 } while (0) 430 431 #define LIST_NEXT(elm, field) ((elm)->field.le_next) 432 433 #define LIST_REMOVE(elm, field) do { \ 434 QMD_SAVELINK(oldnext, (elm)->field.le_next); \ 435 QMD_SAVELINK(oldprev, (elm)->field.le_prev); \ 436 QMD_LIST_CHECK_NEXT(elm, field); \ 437 QMD_LIST_CHECK_PREV(elm, field); \ 438 if (LIST_NEXT((elm), field) != NULL) \ 439 LIST_NEXT((elm), field)->field.le_prev = \ 440 (elm)->field.le_prev; \ 441 *(elm)->field.le_prev = LIST_NEXT((elm), field); \ 442 TRASHIT(*oldnext); \ 443 TRASHIT(*oldprev); \ 444 } while (0) 445 446 #define LIST_SWAP(head1, head2, type, field) do { \ 447 struct type *swap_tmp = LIST_FIRST((head1)); \ 448 LIST_FIRST((head1)) = LIST_FIRST((head2)); \ 449 LIST_FIRST((head2)) = swap_tmp; \ 450 if ((swap_tmp = LIST_FIRST((head1))) != NULL) \ 451 swap_tmp->field.le_prev = &LIST_FIRST((head1)); \ 452 if ((swap_tmp = LIST_FIRST((head2))) != NULL) \ 453 swap_tmp->field.le_prev = &LIST_FIRST((head2)); \ 454 } while (0) 455 456 /* 457 * Tail queue declarations. 458 */ 459 #define TAILQ_HEAD(name, type) \ 460 struct name { \ 461 struct type *tqh_first; /* first element */ \ 462 struct type **tqh_last; /* addr of last next element */ \ 463 TRACEBUF \ 464 } 465 466 #define TAILQ_HEAD_INITIALIZER(head) \ 467 { NULL, &(head).tqh_first } 468 469 #define TAILQ_ENTRY(type) \ 470 struct { \ 471 struct type *tqe_next; /* next element */ \ 472 struct type **tqe_prev; /* address of previous next element */ \ 473 TRACEBUF \ 474 } 475 476 /* 477 * Tail queue functions. 478 */ 479 #if (defined(_KERNEL) && defined(INVARIANTS)) 480 #define QMD_TAILQ_CHECK_HEAD(head, field) do { \ 481 if (!TAILQ_EMPTY(head) && \ 482 TAILQ_FIRST((head))->field.tqe_prev != \ 483 &TAILQ_FIRST((head))) \ 484 panic("Bad tailq head %p first->prev != head", (head)); \ 485 } while (0) 486 487 #define QMD_TAILQ_CHECK_TAIL(head, field) do { \ 488 if (*(head)->tqh_last != NULL) \ 489 panic("Bad tailq NEXT(%p->tqh_last) != NULL", (head)); \ 490 } while (0) 491 492 #define QMD_TAILQ_CHECK_NEXT(elm, field) do { \ 493 if (TAILQ_NEXT((elm), field) != NULL && \ 494 TAILQ_NEXT((elm), field)->field.tqe_prev != \ 495 &((elm)->field.tqe_next)) \ 496 panic("Bad link elm %p next->prev != elm", (elm)); \ 497 } while (0) 498 499 #define QMD_TAILQ_CHECK_PREV(elm, field) do { \ 500 if (*(elm)->field.tqe_prev != (elm)) \ 501 panic("Bad link elm %p prev->next != elm", (elm)); \ 502 } while (0) 503 #else 504 #define QMD_TAILQ_CHECK_HEAD(head, field) 505 #define QMD_TAILQ_CHECK_TAIL(head, headname) 506 #define QMD_TAILQ_CHECK_NEXT(elm, field) 507 #define QMD_TAILQ_CHECK_PREV(elm, field) 508 #endif /* (_KERNEL && INVARIANTS) */ 509 510 #define TAILQ_CONCAT(head1, head2, field) do { \ 511 if (!TAILQ_EMPTY(head2)) { \ 512 *(head1)->tqh_last = (head2)->tqh_first; \ 513 (head2)->tqh_first->field.tqe_prev = (head1)->tqh_last; \ 514 (head1)->tqh_last = (head2)->tqh_last; \ 515 TAILQ_INIT((head2)); \ 516 QMD_TRACE_HEAD(head1); \ 517 QMD_TRACE_HEAD(head2); \ 518 } \ 519 } while (0) 520 521 #define TAILQ_EMPTY(head) ((head)->tqh_first == NULL) 522 523 #define TAILQ_FIRST(head) ((head)->tqh_first) 524 525 #define TAILQ_FOREACH(var, head, field) \ 526 for ((var) = TAILQ_FIRST((head)); \ 527 (var); \ 528 (var) = TAILQ_NEXT((var), field)) 529 530 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \ 531 for ((var) = TAILQ_FIRST((head)); \ 532 (var) && ((tvar) = TAILQ_NEXT((var), field), 1); \ 533 (var) = (tvar)) 534 535 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ 536 for ((var) = TAILQ_LAST((head), headname); \ 537 (var); \ 538 (var) = TAILQ_PREV((var), headname, field)) 539 540 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \ 541 for ((var) = TAILQ_LAST((head), headname); \ 542 (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1); \ 543 (var) = (tvar)) 544 545 #define TAILQ_INIT(head) do { \ 546 TAILQ_FIRST((head)) = NULL; \ 547 (head)->tqh_last = &TAILQ_FIRST((head)); \ 548 QMD_TRACE_HEAD(head); \ 549 } while (0) 550 551 /* XXX optional IS_ENQUEUED support--entries must be initialized if 552 * IS_ENQUEUED will be used */ 553 #define TAILQ_INIT_ENTRY(elm, field) do { \ 554 (elm)->field.tqe_prev = NULL; \ 555 (elm)->field.tqe_next = NULL; \ 556 } while (0) 557 558 #define TAILQ_IS_ENQUEUED(elm, field) (((elm)->field.tqe_prev != NULL) || \ 559 ((elm)->field.tqe_next != NULL)) 560 561 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ 562 QMD_TAILQ_CHECK_NEXT(listelm, field); \ 563 if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\ 564 TAILQ_NEXT((elm), field)->field.tqe_prev = \ 565 &TAILQ_NEXT((elm), field); \ 566 else { \ 567 (head)->tqh_last = &TAILQ_NEXT((elm), field); \ 568 QMD_TRACE_HEAD(head); \ 569 } \ 570 TAILQ_NEXT((listelm), field) = (elm); \ 571 (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field); \ 572 QMD_TRACE_ELEM(&(elm)->field); \ 573 QMD_TRACE_ELEM(&listelm->field); \ 574 } while (0) 575 576 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ 577 QMD_TAILQ_CHECK_PREV(listelm, field); \ 578 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \ 579 TAILQ_NEXT((elm), field) = (listelm); \ 580 *(listelm)->field.tqe_prev = (elm); \ 581 (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field); \ 582 QMD_TRACE_ELEM(&(elm)->field); \ 583 QMD_TRACE_ELEM(&listelm->field); \ 584 } while (0) 585 586 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ 587 QMD_TAILQ_CHECK_HEAD(head, field); \ 588 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \ 589 TAILQ_FIRST((head))->field.tqe_prev = \ 590 &TAILQ_NEXT((elm), field); \ 591 else \ 592 (head)->tqh_last = &TAILQ_NEXT((elm), field); \ 593 TAILQ_FIRST((head)) = (elm); \ 594 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \ 595 QMD_TRACE_HEAD(head); \ 596 QMD_TRACE_ELEM(&(elm)->field); \ 597 } while (0) 598 599 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ 600 QMD_TAILQ_CHECK_TAIL(head, field); \ 601 TAILQ_NEXT((elm), field) = NULL; \ 602 (elm)->field.tqe_prev = (head)->tqh_last; \ 603 *(head)->tqh_last = (elm); \ 604 (head)->tqh_last = &TAILQ_NEXT((elm), field); \ 605 QMD_TRACE_HEAD(head); \ 606 QMD_TRACE_ELEM(&(elm)->field); \ 607 } while (0) 608 609 #define TAILQ_LAST(head, headname) \ 610 (*(((struct headname *)((head)->tqh_last))->tqh_last)) 611 612 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) 613 614 #define TAILQ_PREV(elm, headname, field) \ 615 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last)) 616 617 #define TAILQ_REMOVE(head, elm, field) do { \ 618 QMD_SAVELINK(oldnext, (elm)->field.tqe_next); \ 619 QMD_SAVELINK(oldprev, (elm)->field.tqe_prev); \ 620 QMD_TAILQ_CHECK_NEXT(elm, field); \ 621 QMD_TAILQ_CHECK_PREV(elm, field); \ 622 if ((TAILQ_NEXT((elm), field)) != NULL) \ 623 TAILQ_NEXT((elm), field)->field.tqe_prev = \ 624 (elm)->field.tqe_prev; \ 625 else { \ 626 (head)->tqh_last = (elm)->field.tqe_prev; \ 627 QMD_TRACE_HEAD(head); \ 628 } \ 629 *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field); \ 630 TRASHIT(*oldnext); \ 631 TRASHIT(*oldprev); \ 632 QMD_TRACE_ELEM(&(elm)->field); \ 633 } while (0) 634 635 #define TAILQ_SWAP(head1, head2, type, field) do { \ 636 struct type *swap_first = (head1)->tqh_first; \ 637 struct type **swap_last = (head1)->tqh_last; \ 638 (head1)->tqh_first = (head2)->tqh_first; \ 639 (head1)->tqh_last = (head2)->tqh_last; \ 640 (head2)->tqh_first = swap_first; \ 641 (head2)->tqh_last = swap_last; \ 642 if ((swap_first = (head1)->tqh_first) != NULL) \ 643 swap_first->field.tqe_prev = &(head1)->tqh_first; \ 644 else \ 645 (head1)->tqh_last = &(head1)->tqh_first; \ 646 if ((swap_first = (head2)->tqh_first) != NULL) \ 647 swap_first->field.tqe_prev = &(head2)->tqh_first; \ 648 else \ 649 (head2)->tqh_last = &(head2)->tqh_first; \ 650 } while (0) 651 652 #endif /* !TIRPC__MISC_QUEUE_H_ */
Contact us
|
About us
|
Term of use
|
Copyright © 2000-2025 MyWebUniversity.com ™
