1178825Sdfr/* $NetBSD: queue.h,v 1.38 2004/04/18 14:12:05 lukem Exp $ */ 2233294Sstas/* $Id$ */ 3178825Sdfr 4178825Sdfr/* 5178825Sdfr * Copyright (c) 1991, 1993 6178825Sdfr * The Regents of the University of California. All rights reserved. 7178825Sdfr * 8178825Sdfr * Redistribution and use in source and binary forms, with or without 9178825Sdfr * modification, are permitted provided that the following conditions 10178825Sdfr * are met: 11178825Sdfr * 1. Redistributions of source code must retain the above copyright 12178825Sdfr * notice, this list of conditions and the following disclaimer. 13178825Sdfr * 2. Redistributions in binary form must reproduce the above copyright 14178825Sdfr * notice, this list of conditions and the following disclaimer in the 15178825Sdfr * documentation and/or other materials provided with the distribution. 16178825Sdfr * 3. Neither the name of the University nor the names of its contributors 17178825Sdfr * may be used to endorse or promote products derived from this software 18178825Sdfr * without specific prior written permission. 19178825Sdfr * 20178825Sdfr * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 21178825Sdfr * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22178825Sdfr * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23178825Sdfr * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 24178825Sdfr * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25178825Sdfr * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26178825Sdfr * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27178825Sdfr * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28178825Sdfr * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29178825Sdfr * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30178825Sdfr * SUCH DAMAGE. 31178825Sdfr * 32178825Sdfr * @(#)queue.h 8.5 (Berkeley) 8/20/94 33178825Sdfr */ 34178825Sdfr 35178825Sdfr#ifndef _ASN1_QUEUE_H_ 36178825Sdfr#define _ASN1_QUEUE_H_ 37178825Sdfr 38178825Sdfr/* 39178825Sdfr * Tail queue definitions. 40178825Sdfr */ 41178825Sdfr#define ASN1_TAILQ_HEAD(name, type) \ 42178825Sdfrstruct name { \ 43178825Sdfr struct type *tqh_first; /* first element */ \ 44178825Sdfr struct type **tqh_last; /* addr of last next element */ \ 45178825Sdfr} 46178825Sdfr 47178825Sdfr#define ASN1_TAILQ_HEAD_INITIALIZER(head) \ 48178825Sdfr { NULL, &(head).tqh_first } 49178825Sdfr#define ASN1_TAILQ_ENTRY(type) \ 50178825Sdfrstruct { \ 51178825Sdfr struct type *tqe_next; /* next element */ \ 52178825Sdfr struct type **tqe_prev; /* address of previous next element */ \ 53178825Sdfr} 54178825Sdfr 55178825Sdfr/* 56178825Sdfr * Tail queue functions. 57178825Sdfr */ 58178825Sdfr#if defined(_KERNEL) && defined(QUEUEDEBUG) 59178825Sdfr#define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) \ 60178825Sdfr if ((head)->tqh_first && \ 61178825Sdfr (head)->tqh_first->field.tqe_prev != &(head)->tqh_first) \ 62178825Sdfr panic("ASN1_TAILQ_INSERT_HEAD %p %s:%d", (head), __FILE__, __LINE__); 63178825Sdfr#define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) \ 64178825Sdfr if (*(head)->tqh_last != NULL) \ 65178825Sdfr panic("ASN1_TAILQ_INSERT_TAIL %p %s:%d", (head), __FILE__, __LINE__); 66178825Sdfr#define QUEUEDEBUG_ASN1_TAILQ_OP(elm, field) \ 67178825Sdfr if ((elm)->field.tqe_next && \ 68178825Sdfr (elm)->field.tqe_next->field.tqe_prev != \ 69178825Sdfr &(elm)->field.tqe_next) \ 70178825Sdfr panic("ASN1_TAILQ_* forw %p %s:%d", (elm), __FILE__, __LINE__);\ 71178825Sdfr if (*(elm)->field.tqe_prev != (elm)) \ 72178825Sdfr panic("ASN1_TAILQ_* back %p %s:%d", (elm), __FILE__, __LINE__); 73178825Sdfr#define QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field) \ 74178825Sdfr if ((elm)->field.tqe_next == NULL && \ 75178825Sdfr (head)->tqh_last != &(elm)->field.tqe_next) \ 76178825Sdfr panic("ASN1_TAILQ_PREREMOVE head %p elm %p %s:%d", \ 77178825Sdfr (head), (elm), __FILE__, __LINE__); 78178825Sdfr#define QUEUEDEBUG_ASN1_TAILQ_POSTREMOVE(elm, field) \ 79178825Sdfr (elm)->field.tqe_next = (void *)1L; \ 80178825Sdfr (elm)->field.tqe_prev = (void *)1L; 81178825Sdfr#else 82178825Sdfr#define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) 83178825Sdfr#define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) 84178825Sdfr#define QUEUEDEBUG_ASN1_TAILQ_OP(elm, field) 85178825Sdfr#define QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field) 86178825Sdfr#define QUEUEDEBUG_ASN1_TAILQ_POSTREMOVE(elm, field) 87178825Sdfr#endif 88178825Sdfr 89178825Sdfr#define ASN1_TAILQ_INIT(head) do { \ 90178825Sdfr (head)->tqh_first = NULL; \ 91178825Sdfr (head)->tqh_last = &(head)->tqh_first; \ 92178825Sdfr} while (/*CONSTCOND*/0) 93178825Sdfr 94178825Sdfr#define ASN1_TAILQ_INSERT_HEAD(head, elm, field) do { \ 95178825Sdfr QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD((head), (elm), field) \ 96178825Sdfr if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \ 97178825Sdfr (head)->tqh_first->field.tqe_prev = \ 98178825Sdfr &(elm)->field.tqe_next; \ 99178825Sdfr else \ 100178825Sdfr (head)->tqh_last = &(elm)->field.tqe_next; \ 101178825Sdfr (head)->tqh_first = (elm); \ 102178825Sdfr (elm)->field.tqe_prev = &(head)->tqh_first; \ 103178825Sdfr} while (/*CONSTCOND*/0) 104178825Sdfr 105178825Sdfr#define ASN1_TAILQ_INSERT_TAIL(head, elm, field) do { \ 106178825Sdfr QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL((head), (elm), field) \ 107178825Sdfr (elm)->field.tqe_next = NULL; \ 108178825Sdfr (elm)->field.tqe_prev = (head)->tqh_last; \ 109178825Sdfr *(head)->tqh_last = (elm); \ 110178825Sdfr (head)->tqh_last = &(elm)->field.tqe_next; \ 111178825Sdfr} while (/*CONSTCOND*/0) 112178825Sdfr 113178825Sdfr#define ASN1_TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ 114178825Sdfr QUEUEDEBUG_ASN1_TAILQ_OP((listelm), field) \ 115178825Sdfr if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\ 116178825Sdfr (elm)->field.tqe_next->field.tqe_prev = \ 117178825Sdfr &(elm)->field.tqe_next; \ 118178825Sdfr else \ 119178825Sdfr (head)->tqh_last = &(elm)->field.tqe_next; \ 120178825Sdfr (listelm)->field.tqe_next = (elm); \ 121178825Sdfr (elm)->field.tqe_prev = &(listelm)->field.tqe_next; \ 122178825Sdfr} while (/*CONSTCOND*/0) 123178825Sdfr 124178825Sdfr#define ASN1_TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ 125178825Sdfr QUEUEDEBUG_ASN1_TAILQ_OP((listelm), field) \ 126178825Sdfr (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \ 127178825Sdfr (elm)->field.tqe_next = (listelm); \ 128178825Sdfr *(listelm)->field.tqe_prev = (elm); \ 129178825Sdfr (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \ 130178825Sdfr} while (/*CONSTCOND*/0) 131178825Sdfr 132178825Sdfr#define ASN1_TAILQ_REMOVE(head, elm, field) do { \ 133178825Sdfr QUEUEDEBUG_ASN1_TAILQ_PREREMOVE((head), (elm), field) \ 134178825Sdfr QUEUEDEBUG_ASN1_TAILQ_OP((elm), field) \ 135178825Sdfr if (((elm)->field.tqe_next) != NULL) \ 136178825Sdfr (elm)->field.tqe_next->field.tqe_prev = \ 137178825Sdfr (elm)->field.tqe_prev; \ 138178825Sdfr else \ 139178825Sdfr (head)->tqh_last = (elm)->field.tqe_prev; \ 140178825Sdfr *(elm)->field.tqe_prev = (elm)->field.tqe_next; \ 141178825Sdfr QUEUEDEBUG_ASN1_TAILQ_POSTREMOVE((elm), field); \ 142178825Sdfr} while (/*CONSTCOND*/0) 143178825Sdfr 144178825Sdfr#define ASN1_TAILQ_FOREACH(var, head, field) \ 145178825Sdfr for ((var) = ((head)->tqh_first); \ 146178825Sdfr (var); \ 147178825Sdfr (var) = ((var)->field.tqe_next)) 148178825Sdfr 149178825Sdfr#define ASN1_TAILQ_FOREACH_REVERSE(var, head, headname, field) \ 150178825Sdfr for ((var) = (*(((struct headname *)((head)->tqh_last))->tqh_last)); \ 151178825Sdfr (var); \ 152178825Sdfr (var) = (*(((struct headname *)((var)->field.tqe_prev))->tqh_last))) 153178825Sdfr 154178825Sdfr/* 155178825Sdfr * Tail queue access methods. 156178825Sdfr */ 157178825Sdfr#define ASN1_TAILQ_EMPTY(head) ((head)->tqh_first == NULL) 158178825Sdfr#define ASN1_TAILQ_FIRST(head) ((head)->tqh_first) 159178825Sdfr#define ASN1_TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) 160178825Sdfr 161178825Sdfr#define ASN1_TAILQ_LAST(head, headname) \ 162178825Sdfr (*(((struct headname *)((head)->tqh_last))->tqh_last)) 163178825Sdfr#define ASN1_TAILQ_PREV(elm, headname, field) \ 164178825Sdfr (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last)) 165178825Sdfr 166178825Sdfr 167178825Sdfr#endif /* !_ASN1_QUEUE_H_ */ 168