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. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * @(#)queue.h 8.5 (Berkeley) 8/20/94 34 */ 35 36 /* 37 * This file [used to define] five types of data structures: 38 * singly-linked lists, ... 39 * [ all other types of lists removed ] 40 * 41 * Using excerpts of FreeBSD 4.5 sys/queue.h here, 42 * but only temporarily, until rcfile.c is replaced 43 * by SMF integration code. 44 * 45 * Yes we also have queue.h in uts/common/fs/smbclnt 46 * but don't want to make that part of the exported 47 * interface to the user-level code. 48 */ 49 50 /* 51 * Singly-linked List declarations. 52 */ 53 #define SLIST_HEAD(name, type) \ 54 struct name { \ 55 struct type *slh_first; /* first element */ \ 56 } 57 58 #define SLIST_ENTRY(type) \ 59 struct { \ 60 struct type *sle_next; /* next element */ \ 61 } 62 63 /* 64 * Singly-linked List functions. 65 */ 66 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) 67 68 #define SLIST_FIRST(head) ((head)->slh_first) 69 70 #define SLIST_FOREACH(var, head, field) \ 71 for ((var) = SLIST_FIRST((head)); \ 72 (var); \ 73 (var) = SLIST_NEXT((var), field)) 74 75 #define SLIST_INIT(head) do { \ 76 SLIST_FIRST((head)) = NULL; \ 77 } while (0) 78 79 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ 80 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \ 81 SLIST_NEXT((slistelm), field) = (elm); \ 82 } while (0) 83 84 #define SLIST_INSERT_HEAD(head, elm, field) do { \ 85 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \ 86 SLIST_FIRST((head)) = (elm); \ 87 } while (0) 88 89 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) 90 91 #define SLIST_REMOVE(head, elm, type, field) do { \ 92 if (SLIST_FIRST((head)) == (elm)) { \ 93 SLIST_REMOVE_HEAD((head), field); \ 94 } \ 95 else { \ 96 struct type *curelm = SLIST_FIRST((head)); \ 97 while (SLIST_NEXT(curelm, field) != (elm)) \ 98 curelm = SLIST_NEXT(curelm, field); \ 99 SLIST_NEXT(curelm, field) = \ 100 SLIST_NEXT(SLIST_NEXT(curelm, field), field); \ 101 } \ 102 } while (0) 103 104 #define SLIST_REMOVE_HEAD(head, field) do { \ 105 SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \ 106 } while (0) 107 108