1156230Smux/*- 2156230Smux * Copyright (c) 1991, 1993 3156230Smux * The Regents of the University of California. All rights reserved. 4156230Smux * 5156230Smux * Redistribution and use in source and binary forms, with or without 6156230Smux * modification, are permitted provided that the following conditions 7156230Smux * are met: 8156230Smux * 1. Redistributions of source code must retain the above copyright 9156230Smux * notice, this list of conditions and the following disclaimer. 10156230Smux * 2. Redistributions in binary form must reproduce the above copyright 11156230Smux * notice, this list of conditions and the following disclaimer in the 12156230Smux * documentation and/or other materials provided with the distribution. 13156230Smux * 4. Neither the name of the University nor the names of its contributors 14156230Smux * may be used to endorse or promote products derived from this software 15156230Smux * without specific prior written permission. 16156230Smux * 17156230Smux * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 18156230Smux * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19156230Smux * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20156230Smux * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 21156230Smux * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22156230Smux * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23156230Smux * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24156230Smux * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25156230Smux * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26156230Smux * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27156230Smux * SUCH DAMAGE. 28156230Smux * 29156230Smux * @(#)queue.h 8.5 (Berkeley) 8/20/94 30156230Smux * $FreeBSD$ 31156230Smux * 32156230Smux * $FreeBSD$ 33156230Smux */ 34156230Smux 35156230Smux#ifndef _QUEUE_H_ 36156230Smux#define _QUEUE_H_ 37156230Smux 38169765Smux#undef __offsetof 39156230Smux#define __offsetof(type, field) ((size_t)(&((type *)0)->field)) 40156230Smux 41156230Smux/* 42156230Smux * Singly-linked Tail queue declarations. 43156230Smux */ 44156230Smux#undef STAILQ_HEAD 45156230Smux#define STAILQ_HEAD(name, type) \ 46156230Smuxstruct name { \ 47156230Smux struct type *stqh_first;/* first element */ \ 48156230Smux struct type **stqh_last;/* addr of last next element */ \ 49156230Smux} 50156230Smux 51156230Smux#undef STAILQ_HEAD_INITIALIZER 52156230Smux#define STAILQ_HEAD_INITIALIZER(head) \ 53156230Smux { NULL, &(head).stqh_first } 54156230Smux 55156230Smux#undef STAILQ_ENTRY 56156230Smux#define STAILQ_ENTRY(type) \ 57156230Smuxstruct { \ 58156230Smux struct type *stqe_next; /* next element */ \ 59156230Smux} 60156230Smux 61156230Smux#undef STAILQ_EMPTY 62156230Smux#define STAILQ_EMPTY(head) ((head)->stqh_first == NULL) 63156230Smux 64156230Smux#undef STAILQ_FIRST 65156230Smux#define STAILQ_FIRST(head) ((head)->stqh_first) 66156230Smux 67156230Smux#undef STAILQ_FOREACH 68156230Smux#define STAILQ_FOREACH(var, head, field) \ 69156230Smux for((var) = STAILQ_FIRST((head)); \ 70156230Smux (var); \ 71156230Smux (var) = STAILQ_NEXT((var), field)) 72156230Smux 73156230Smux#undef STAILQ_FOREACH_SAFE 74156230Smux#define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ 75156230Smux for ((var) = STAILQ_FIRST((head)); \ 76156230Smux (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \ 77156230Smux (var) = (tvar)) 78156230Smux 79156230Smux#undef STAILQ_INIT 80156230Smux#define STAILQ_INIT(head) do { \ 81156230Smux STAILQ_FIRST((head)) = NULL; \ 82156230Smux (head)->stqh_last = &STAILQ_FIRST((head)); \ 83156230Smux} while (0) 84156230Smux 85156230Smux#undef STAILQ_INSERT_AFTER 86156230Smux#define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ 87156230Smux if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\ 88156230Smux (head)->stqh_last = &STAILQ_NEXT((elm), field); \ 89156230Smux STAILQ_NEXT((tqelm), field) = (elm); \ 90156230Smux} while (0) 91156230Smux 92156230Smux#undef STAILQ_INSERT_HEAD 93156230Smux#define STAILQ_INSERT_HEAD(head, elm, field) do { \ 94156230Smux if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \ 95156230Smux (head)->stqh_last = &STAILQ_NEXT((elm), field); \ 96156230Smux STAILQ_FIRST((head)) = (elm); \ 97156230Smux} while (0) 98156230Smux 99156230Smux#undef STAILQ_INSERT_TAIL 100156230Smux#define STAILQ_INSERT_TAIL(head, elm, field) do { \ 101156230Smux STAILQ_NEXT((elm), field) = NULL; \ 102156230Smux *(head)->stqh_last = (elm); \ 103156230Smux (head)->stqh_last = &STAILQ_NEXT((elm), field); \ 104156230Smux} while (0) 105156230Smux 106156230Smux#undef STAILQ_LAST 107156230Smux#define STAILQ_LAST(head, type, field) \ 108156230Smux (STAILQ_EMPTY((head)) ? \ 109156230Smux NULL : \ 110156251Smux ((struct type *)(void *) \ 111156230Smux ((char *)((head)->stqh_last) - __offsetof(struct type, field)))) 112156230Smux 113156230Smux#undef STAILQ_NEXT 114156230Smux#define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) 115156230Smux 116156230Smux#undef STAILQ_REMOVE 117156230Smux#define STAILQ_REMOVE(head, elm, type, field) do { \ 118156230Smux if (STAILQ_FIRST((head)) == (elm)) { \ 119156230Smux STAILQ_REMOVE_HEAD((head), field); \ 120156230Smux } \ 121156230Smux else { \ 122156230Smux struct type *curelm = STAILQ_FIRST((head)); \ 123156230Smux while (STAILQ_NEXT(curelm, field) != (elm)) \ 124156230Smux curelm = STAILQ_NEXT(curelm, field); \ 125156230Smux if ((STAILQ_NEXT(curelm, field) = \ 126156230Smux STAILQ_NEXT(STAILQ_NEXT(curelm, field), field)) == NULL)\ 127156230Smux (head)->stqh_last = &STAILQ_NEXT((curelm), field);\ 128156230Smux } \ 129156230Smux} while (0) 130156230Smux 131156230Smux#undef STAILQ_REMOVE_HEAD 132156230Smux#define STAILQ_REMOVE_HEAD(head, field) do { \ 133156230Smux if ((STAILQ_FIRST((head)) = \ 134156230Smux STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \ 135156230Smux (head)->stqh_last = &STAILQ_FIRST((head)); \ 136156230Smux} while (0) 137156230Smux 138156230Smux#undef STAILQ_REMOVE_HEAD_UNTIL 139156230Smux#define STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do { \ 140156230Smux if ((STAILQ_FIRST((head)) = STAILQ_NEXT((elm), field)) == NULL) \ 141156230Smux (head)->stqh_last = &STAILQ_FIRST((head)); \ 142156230Smux} while (0) 143156230Smux 144156230Smux/* 145156230Smux * List declarations. 146156230Smux */ 147156230Smux#undef LIST_HEAD 148156230Smux#define LIST_HEAD(name, type) \ 149156230Smuxstruct name { \ 150156230Smux struct type *lh_first; /* first element */ \ 151156230Smux} 152156230Smux 153156230Smux#undef LIST_HEAD_INITIALIZER 154156230Smux#define LIST_HEAD_INITIALIZER(head) \ 155156230Smux { NULL } 156156230Smux 157156230Smux#undef LIST_ENTRY 158156230Smux#define LIST_ENTRY(type) \ 159156230Smuxstruct { \ 160156230Smux struct type *le_next; /* next element */ \ 161156230Smux struct type **le_prev; /* address of previous next element */ \ 162156230Smux} 163156230Smux 164156230Smux/* 165156230Smux * List functions. 166156230Smux */ 167156230Smux 168156230Smux#undef LIST_EMPTY 169156230Smux#define LIST_EMPTY(head) ((head)->lh_first == NULL) 170156230Smux 171156230Smux#undef LIST_FIRST 172156230Smux#define LIST_FIRST(head) ((head)->lh_first) 173156230Smux 174156230Smux#undef LIST_FOREACH 175156230Smux#define LIST_FOREACH(var, head, field) \ 176156230Smux for ((var) = LIST_FIRST((head)); \ 177156230Smux (var); \ 178156230Smux (var) = LIST_NEXT((var), field)) 179156230Smux 180156230Smux#undef LIST_FOREACH_SAFE 181156230Smux#define LIST_FOREACH_SAFE(var, head, field, tvar) \ 182156230Smux for ((var) = LIST_FIRST((head)); \ 183156230Smux (var) && ((tvar) = LIST_NEXT((var), field), 1); \ 184156230Smux (var) = (tvar)) 185156230Smux 186156230Smux#undef LIST_INIT 187156230Smux#define LIST_INIT(head) do { \ 188156230Smux LIST_FIRST((head)) = NULL; \ 189156230Smux} while (0) 190156230Smux 191156230Smux#undef LIST_INSERT_AFTER 192156230Smux#define LIST_INSERT_AFTER(listelm, elm, field) do { \ 193156230Smux if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\ 194156230Smux LIST_NEXT((listelm), field)->field.le_prev = \ 195156230Smux &LIST_NEXT((elm), field); \ 196156230Smux LIST_NEXT((listelm), field) = (elm); \ 197156230Smux (elm)->field.le_prev = &LIST_NEXT((listelm), field); \ 198156230Smux} while (0) 199156230Smux 200156230Smux#undef LIST_INSERT_BEFORE 201156230Smux#define LIST_INSERT_BEFORE(listelm, elm, field) do { \ 202156230Smux (elm)->field.le_prev = (listelm)->field.le_prev; \ 203156230Smux LIST_NEXT((elm), field) = (listelm); \ 204156230Smux *(listelm)->field.le_prev = (elm); \ 205156230Smux (listelm)->field.le_prev = &LIST_NEXT((elm), field); \ 206156230Smux} while (0) 207156230Smux 208156230Smux#undef LIST_INSERT_HEAD 209156230Smux#define LIST_INSERT_HEAD(head, elm, field) do { \ 210156230Smux if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \ 211156230Smux LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\ 212156230Smux LIST_FIRST((head)) = (elm); \ 213156230Smux (elm)->field.le_prev = &LIST_FIRST((head)); \ 214156230Smux} while (0) 215156230Smux 216156230Smux#undef LIST_NEXT 217156230Smux#define LIST_NEXT(elm, field) ((elm)->field.le_next) 218156230Smux 219156230Smux#undef LIST_REMOVE 220156230Smux#define LIST_REMOVE(elm, field) do { \ 221156230Smux if (LIST_NEXT((elm), field) != NULL) \ 222156230Smux LIST_NEXT((elm), field)->field.le_prev = \ 223156230Smux (elm)->field.le_prev; \ 224156230Smux *(elm)->field.le_prev = LIST_NEXT((elm), field); \ 225156230Smux} while (0) 226156230Smux 227156230Smux#endif /* !_QUEUE_H_ */ 228