usr/src/lib/libsmbfs/smb/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  * 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 #pragma ident   "%Z%%M% %I%     %E% SMI"
  37
  38 /*
  39  * This file [used to define] five types of data structures:
  40  *   singly-linked lists, ...
  41  * [ all other types of lists removed ]
  42  *
  43  * Using excerpts of FreeBSD 4.5 sys/queue.h here,
  44  * but only temporarily, until rcfile.c is replaced
  45  * by SMF integration code.
  46  *
  47  * Yes we also have queue.h in uts/common/fs/smbclnt
  48  * but don't want to make that part of the exported
  49  * interface to the user-level code.
  50  */
  51
  52 /*
  53  * Singly-linked List declarations.
  54  */
  55 #define SLIST_HEAD(name, type)                                          \
  56 struct name {                                                           \
  57         struct type *slh_first; /* first element */                     \
  58 }
  59
  60 #define SLIST_ENTRY(type)                                               \
  61 struct {                                                                \
  62         struct type *sle_next;  /* next element */                      \
  63 }
  64
  65 /*
  66  * Singly-linked List functions.
  67  */
  68 #define SLIST_EMPTY(head)       ((head)->slh_first == NULL)
  69
  70 #define SLIST_FIRST(head)       ((head)->slh_first)
  71
  72 #define SLIST_FOREACH(var, head, field)                                 \
  73         for ((var) = SLIST_FIRST((head));                               \
  74             (var);                                                      \
  75             (var) = SLIST_NEXT((var), field))
  76
  77 #define SLIST_INIT(head) do {                                           \
  78         SLIST_FIRST((head)) = NULL;                                     \
  79 } while (0)
  80
  81 #define SLIST_INSERT_AFTER(slistelm, elm, field) do {                   \
  82         SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field);       \
  83         SLIST_NEXT((slistelm), field) = (elm);                          \
  84 } while (0)
  85
  86 #define SLIST_INSERT_HEAD(head, elm, field) do {                        \
  87         SLIST_NEXT((elm), field) = SLIST_FIRST((head));                 \
  88         SLIST_FIRST((head)) = (elm);                                    \
  89 } while (0)
  90
  91 #define SLIST_NEXT(elm, field)  ((elm)->field.sle_next)
  92
  93 #define SLIST_REMOVE(head, elm, type, field) do {                       \
  94         if (SLIST_FIRST((head)) == (elm)) {                             \
  95                 SLIST_REMOVE_HEAD((head), field);                       \
  96         }                                                               \
  97         else {                                                          \
  98                 struct type *curelm = SLIST_FIRST((head));              \
  99                 while (SLIST_NEXT(curelm, field) != (elm))              \
 100                         curelm = SLIST_NEXT(curelm, field);             \
 101                 SLIST_NEXT(curelm, field) =                             \
 102                     SLIST_NEXT(SLIST_NEXT(curelm, field), field);       \
 103         }                                                               \
 104 } while (0)
 105
 106 #define SLIST_REMOVE_HEAD(head, field) do {                             \
 107         SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field);   \
 108 } while (0)
 109