io/drm/queue.h

60405de4d8688d96dd05157c28db3ade5c9bc234kz/* BEGIN CSTYLED */
60405de4d8688d96dd05157c28db3ade5c9bc234kz/*-
60405de4d8688d96dd05157c28db3ade5c9bc234kz * Copyright (c) 1991, 1993
60405de4d8688d96dd05157c28db3ade5c9bc234kz *  The Regents of the University of California.  All rights reserved.
60405de4d8688d96dd05157c28db3ade5c9bc234kz *
60405de4d8688d96dd05157c28db3ade5c9bc234kz * Redistribution and use in source and binary forms, with or without
60405de4d8688d96dd05157c28db3ade5c9bc234kz * modification, are permitted provided that the following conditions
60405de4d8688d96dd05157c28db3ade5c9bc234kz * are met:
60405de4d8688d96dd05157c28db3ade5c9bc234kz * 1. Redistributions of source code must retain the above copyright
60405de4d8688d96dd05157c28db3ade5c9bc234kz *    notice, this list of conditions and the following disclaimer.
60405de4d8688d96dd05157c28db3ade5c9bc234kz * 2. Redistributions in binary form must reproduce the above copyright
60405de4d8688d96dd05157c28db3ade5c9bc234kz *    notice, this list of conditions and the following disclaimer in the
60405de4d8688d96dd05157c28db3ade5c9bc234kz *    documentation and/or other materials provided with the distribution.
60405de4d8688d96dd05157c28db3ade5c9bc234kz * 4. Neither the name of the University nor the names of its contributors
60405de4d8688d96dd05157c28db3ade5c9bc234kz *    may be used to endorse or promote products derived from this software
60405de4d8688d96dd05157c28db3ade5c9bc234kz *    without specific prior written permission.
60405de4d8688d96dd05157c28db3ade5c9bc234kz *
60405de4d8688d96dd05157c28db3ade5c9bc234kz * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
60405de4d8688d96dd05157c28db3ade5c9bc234kz * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
60405de4d8688d96dd05157c28db3ade5c9bc234kz * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
60405de4d8688d96dd05157c28db3ade5c9bc234kz * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
60405de4d8688d96dd05157c28db3ade5c9bc234kz * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
60405de4d8688d96dd05157c28db3ade5c9bc234kz * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
60405de4d8688d96dd05157c28db3ade5c9bc234kz * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
60405de4d8688d96dd05157c28db3ade5c9bc234kz * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
60405de4d8688d96dd05157c28db3ade5c9bc234kz * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
60405de4d8688d96dd05157c28db3ade5c9bc234kz * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
60405de4d8688d96dd05157c28db3ade5c9bc234kz * SUCH DAMAGE.
60405de4d8688d96dd05157c28db3ade5c9bc234kz *
60405de4d8688d96dd05157c28db3ade5c9bc234kz *  @(#)queue.h 8.5 (Berkeley) 8/20/94
60405de4d8688d96dd05157c28db3ade5c9bc234kz * $FreeBSD: /repoman/r/ncvs/src/sys/sys/queue.h,v 1.66 2006/05/26 18:17:53 emaste Exp $
60405de4d8688d96dd05157c28db3ade5c9bc234kz */
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#ifndef _SYS_QUEUE_H_
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define _SYS_QUEUE_H_
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#pragma ident   "%Z%%M% %I% %E% SMI"
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz/*
60405de4d8688d96dd05157c28db3ade5c9bc234kz * This file defines four types of data structures: singly-linked lists,
60405de4d8688d96dd05157c28db3ade5c9bc234kz * singly-linked tail queues, lists and tail queues.
60405de4d8688d96dd05157c28db3ade5c9bc234kz *
60405de4d8688d96dd05157c28db3ade5c9bc234kz * A singly-linked list is headed by a single forward pointer. The elements
60405de4d8688d96dd05157c28db3ade5c9bc234kz * are singly linked for minimum space and pointer manipulation overhead at
60405de4d8688d96dd05157c28db3ade5c9bc234kz * the expense of O(n) removal for arbitrary elements. New elements can be
60405de4d8688d96dd05157c28db3ade5c9bc234kz * added to the list after an existing element or at the head of the list.
60405de4d8688d96dd05157c28db3ade5c9bc234kz * Elements being removed from the head of the list should use the explicit
60405de4d8688d96dd05157c28db3ade5c9bc234kz * macro for this purpose for optimum efficiency. A singly-linked list may
60405de4d8688d96dd05157c28db3ade5c9bc234kz * only be traversed in the forward direction.  Singly-linked lists are ideal
60405de4d8688d96dd05157c28db3ade5c9bc234kz * for applications with large datasets and few or no removals or for
60405de4d8688d96dd05157c28db3ade5c9bc234kz * implementing a LIFO queue.
60405de4d8688d96dd05157c28db3ade5c9bc234kz *
60405de4d8688d96dd05157c28db3ade5c9bc234kz * A singly-linked tail queue is headed by a pair of pointers, one to the
60405de4d8688d96dd05157c28db3ade5c9bc234kz * head of the list and the other to the tail of the list. The elements are
60405de4d8688d96dd05157c28db3ade5c9bc234kz * singly linked for minimum space and pointer manipulation overhead at the
60405de4d8688d96dd05157c28db3ade5c9bc234kz * expense of O(n) removal for arbitrary elements. New elements can be added
60405de4d8688d96dd05157c28db3ade5c9bc234kz * to the list after an existing element, at the head of the list, or at the
60405de4d8688d96dd05157c28db3ade5c9bc234kz * end of the list. Elements being removed from the head of the tail queue
60405de4d8688d96dd05157c28db3ade5c9bc234kz * should use the explicit macro for this purpose for optimum efficiency.
60405de4d8688d96dd05157c28db3ade5c9bc234kz * A singly-linked tail queue may only be traversed in the forward direction.
60405de4d8688d96dd05157c28db3ade5c9bc234kz * Singly-linked tail queues are ideal for applications with large datasets
60405de4d8688d96dd05157c28db3ade5c9bc234kz * and few or no removals or for implementing a FIFO queue.
60405de4d8688d96dd05157c28db3ade5c9bc234kz *
60405de4d8688d96dd05157c28db3ade5c9bc234kz * A list is headed by a single forward pointer (or an array of forward
60405de4d8688d96dd05157c28db3ade5c9bc234kz * pointers for a hash table header). The elements are doubly linked
60405de4d8688d96dd05157c28db3ade5c9bc234kz * so that an arbitrary element can be removed without a need to
60405de4d8688d96dd05157c28db3ade5c9bc234kz * traverse the list. New elements can be added to the list before
60405de4d8688d96dd05157c28db3ade5c9bc234kz * or after an existing element or at the head of the list. A list
60405de4d8688d96dd05157c28db3ade5c9bc234kz * may only be traversed in the forward direction.
60405de4d8688d96dd05157c28db3ade5c9bc234kz *
60405de4d8688d96dd05157c28db3ade5c9bc234kz * A tail queue is headed by a pair of pointers, one to the head of the
60405de4d8688d96dd05157c28db3ade5c9bc234kz * list and the other to the tail of the list. The elements are doubly
60405de4d8688d96dd05157c28db3ade5c9bc234kz * linked so that an arbitrary element can be removed without a need to
60405de4d8688d96dd05157c28db3ade5c9bc234kz * traverse the list. New elements can be added to the list before or
60405de4d8688d96dd05157c28db3ade5c9bc234kz * after an existing element, at the head of the list, or at the end of
60405de4d8688d96dd05157c28db3ade5c9bc234kz * the list. A tail queue may be traversed in either direction.
60405de4d8688d96dd05157c28db3ade5c9bc234kz *
60405de4d8688d96dd05157c28db3ade5c9bc234kz * For details on the use of these macros, see the queue(3) manual page.
60405de4d8688d96dd05157c28db3ade5c9bc234kz *
60405de4d8688d96dd05157c28db3ade5c9bc234kz *
60405de4d8688d96dd05157c28db3ade5c9bc234kz *              SLIST   LIST    STAILQ  TAILQ
60405de4d8688d96dd05157c28db3ade5c9bc234kz * _HEAD            +   +   +   +
60405de4d8688d96dd05157c28db3ade5c9bc234kz * _HEAD_INITIALIZER        +   +   +   +
60405de4d8688d96dd05157c28db3ade5c9bc234kz * _ENTRY           +   +   +   +
60405de4d8688d96dd05157c28db3ade5c9bc234kz * _INIT            +   +   +   +
60405de4d8688d96dd05157c28db3ade5c9bc234kz * _EMPTY           +   +   +   +
60405de4d8688d96dd05157c28db3ade5c9bc234kz * _FIRST           +   +   +   +
60405de4d8688d96dd05157c28db3ade5c9bc234kz * _NEXT            +   +   +   +
60405de4d8688d96dd05157c28db3ade5c9bc234kz * _PREV            -   -   -   +
60405de4d8688d96dd05157c28db3ade5c9bc234kz * _LAST            -   -   +   +
60405de4d8688d96dd05157c28db3ade5c9bc234kz * _FOREACH         +   +   +   +
60405de4d8688d96dd05157c28db3ade5c9bc234kz * _FOREACH_SAFE        +   +   +   +
60405de4d8688d96dd05157c28db3ade5c9bc234kz * _FOREACH_REVERSE     -   -   -   +
60405de4d8688d96dd05157c28db3ade5c9bc234kz * _FOREACH_REVERSE_SAFE    -   -   -   +
60405de4d8688d96dd05157c28db3ade5c9bc234kz * _INSERT_HEAD         +   +   +   +
60405de4d8688d96dd05157c28db3ade5c9bc234kz * _INSERT_BEFORE       -   +   -   +
60405de4d8688d96dd05157c28db3ade5c9bc234kz * _INSERT_AFTER        +   +   +   +
60405de4d8688d96dd05157c28db3ade5c9bc234kz * _INSERT_TAIL         -   -   +   +
60405de4d8688d96dd05157c28db3ade5c9bc234kz * _CONCAT          -   -   +   +
60405de4d8688d96dd05157c28db3ade5c9bc234kz * _REMOVE_HEAD         +   -   +   -
60405de4d8688d96dd05157c28db3ade5c9bc234kz * _REMOVE          +   +   +   +
60405de4d8688d96dd05157c28db3ade5c9bc234kz *
60405de4d8688d96dd05157c28db3ade5c9bc234kz */
60405de4d8688d96dd05157c28db3ade5c9bc234kz#ifdef QUEUE_MACRO_DEBUG
60405de4d8688d96dd05157c28db3ade5c9bc234kz/* Store the last 2 places the queue element or head was altered */
60405de4d8688d96dd05157c28db3ade5c9bc234kzstruct qm_trace {
60405de4d8688d96dd05157c28db3ade5c9bc234kz    char * lastfile;
60405de4d8688d96dd05157c28db3ade5c9bc234kz    int lastline;
60405de4d8688d96dd05157c28db3ade5c9bc234kz    char * prevfile;
60405de4d8688d96dd05157c28db3ade5c9bc234kz    int prevline;
60405de4d8688d96dd05157c28db3ade5c9bc234kz};
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TRACEBUF    struct qm_trace trace;
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TRASHIT(x)  do {(x) = (void *)-1;} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define QMD_TRACE_HEAD(head) do {                   \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (head)->trace.prevline = (head)->trace.lastline;        \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (head)->trace.prevfile = (head)->trace.lastfile;        \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (head)->trace.lastline = __LINE__;              \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (head)->trace.lastfile = __FILE__;              \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define QMD_TRACE_ELEM(elem) do {                   \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (elem)->trace.prevline = (elem)->trace.lastline;        \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (elem)->trace.prevfile = (elem)->trace.lastfile;        \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (elem)->trace.lastline = __LINE__;              \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (elem)->trace.lastfile = __FILE__;              \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#else
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define QMD_TRACE_ELEM(elem)
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define QMD_TRACE_HEAD(head)
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TRACEBUF
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TRASHIT(x)
60405de4d8688d96dd05157c28db3ade5c9bc234kz#endif  /* QUEUE_MACRO_DEBUG */
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz/*
60405de4d8688d96dd05157c28db3ade5c9bc234kz * Singly-linked List declarations.
60405de4d8688d96dd05157c28db3ade5c9bc234kz */
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define SLIST_HEAD(name, type)                      \
60405de4d8688d96dd05157c28db3ade5c9bc234kzstruct name {                               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    struct type *slh_first; /* first element */         \
60405de4d8688d96dd05157c28db3ade5c9bc234kz}
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define SLIST_HEAD_INITIALIZER(head)                    \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    { NULL }
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define SLIST_ENTRY(type)                       \
60405de4d8688d96dd05157c28db3ade5c9bc234kzstruct {                                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    struct type *sle_next;  /* next element */          \
60405de4d8688d96dd05157c28db3ade5c9bc234kz}
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz/*
60405de4d8688d96dd05157c28db3ade5c9bc234kz * Singly-linked List functions.
60405de4d8688d96dd05157c28db3ade5c9bc234kz */
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define SLIST_EMPTY(head)   ((head)->slh_first == NULL)
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define SLIST_FIRST(head)   ((head)->slh_first)
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define SLIST_FOREACH(var, head, field)                 \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    for ((var) = SLIST_FIRST((head));               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (var);                          \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (var) = SLIST_NEXT((var), field))
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define SLIST_FOREACH_SAFE(var, head, field, tvar)          \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    for ((var) = SLIST_FIRST((head));               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (var) && ((tvar) = SLIST_NEXT((var), field), 1);        \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (var) = (tvar))
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define SLIST_FOREACH_PREVPTR(var, varp, head, field)           \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    for ((varp) = &SLIST_FIRST((head));             \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        ((var) = *(varp)) != NULL;                  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (varp) = &SLIST_NEXT((var), field))
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define SLIST_INIT(head) do {                       \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    SLIST_FIRST((head)) = NULL;                 \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define SLIST_INSERT_AFTER(slistelm, elm, field) do {           \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field);   \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    SLIST_NEXT((slistelm), field) = (elm);              \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define SLIST_INSERT_HEAD(head, elm, field) do {            \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    SLIST_NEXT((elm), field) = SLIST_FIRST((head));         \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    SLIST_FIRST((head)) = (elm);                    \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define SLIST_NEXT(elm, field)  ((elm)->field.sle_next)
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define SLIST_REMOVE(head, elm, type, field) do {           \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if (SLIST_FIRST((head)) == (elm)) {             \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        SLIST_REMOVE_HEAD((head), field);           \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    }                               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    else {                              \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        struct type *curelm = SLIST_FIRST((head));      \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        while (SLIST_NEXT(curelm, field) != (elm))      \
60405de4d8688d96dd05157c28db3ade5c9bc234kz            curelm = SLIST_NEXT(curelm, field);     \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        SLIST_NEXT(curelm, field) =             \
60405de4d8688d96dd05157c28db3ade5c9bc234kz            SLIST_NEXT(SLIST_NEXT(curelm, field), field);   \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    }                               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    TRASHIT((elm)->field.sle_next);                 \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define SLIST_REMOVE_HEAD(head, field) do {             \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field);   \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz/*
60405de4d8688d96dd05157c28db3ade5c9bc234kz * Singly-linked Tail queue declarations.
60405de4d8688d96dd05157c28db3ade5c9bc234kz */
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define STAILQ_HEAD(name, type)                     \
60405de4d8688d96dd05157c28db3ade5c9bc234kzstruct name {                               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    struct type *stqh_first;/* first element */         \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    struct type **stqh_last;/* addr of last next element */     \
60405de4d8688d96dd05157c28db3ade5c9bc234kz}
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define STAILQ_HEAD_INITIALIZER(head)                   \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    { NULL, &(head).stqh_first }
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define STAILQ_ENTRY(type)                      \
60405de4d8688d96dd05157c28db3ade5c9bc234kzstruct {                                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    struct type *stqe_next; /* next element */          \
60405de4d8688d96dd05157c28db3ade5c9bc234kz}
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz/*
60405de4d8688d96dd05157c28db3ade5c9bc234kz * Singly-linked Tail queue functions.
60405de4d8688d96dd05157c28db3ade5c9bc234kz */
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define STAILQ_CONCAT(head1, head2) do {                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if (!STAILQ_EMPTY((head2))) {                   \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        *(head1)->stqh_last = (head2)->stqh_first;      \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (head1)->stqh_last = (head2)->stqh_last;        \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        STAILQ_INIT((head2));                   \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    }                               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define STAILQ_EMPTY(head)  ((head)->stqh_first == NULL)
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define STAILQ_FIRST(head)  ((head)->stqh_first)
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define STAILQ_FOREACH(var, head, field)                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    for((var) = STAILQ_FIRST((head));               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz       (var);                           \
60405de4d8688d96dd05157c28db3ade5c9bc234kz       (var) = STAILQ_NEXT((var), field))
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define STAILQ_FOREACH_SAFE(var, head, field, tvar)         \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    for ((var) = STAILQ_FIRST((head));              \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (var) && ((tvar) = STAILQ_NEXT((var), field), 1);       \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (var) = (tvar))
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define STAILQ_INIT(head) do {                      \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    STAILQ_FIRST((head)) = NULL;                    \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (head)->stqh_last = &STAILQ_FIRST((head));          \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do {       \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (head)->stqh_last = &STAILQ_NEXT((elm), field);     \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    STAILQ_NEXT((tqelm), field) = (elm);                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define STAILQ_INSERT_HEAD(head, elm, field) do {           \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (head)->stqh_last = &STAILQ_NEXT((elm), field);     \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    STAILQ_FIRST((head)) = (elm);                   \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define STAILQ_INSERT_TAIL(head, elm, field) do {           \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    STAILQ_NEXT((elm), field) = NULL;               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    *(head)->stqh_last = (elm);                 \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (head)->stqh_last = &STAILQ_NEXT((elm), field);         \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define STAILQ_LAST(head, type, field)                  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (STAILQ_EMPTY((head)) ?                     \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        NULL :                          \
60405de4d8688d96dd05157c28db3ade5c9bc234kz            ((struct type *)(void *)                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        ((char *)((head)->stqh_last) - __offsetof(struct type, field))))
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next)
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define STAILQ_REMOVE(head, elm, type, field) do {          \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if (STAILQ_FIRST((head)) == (elm)) {                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        STAILQ_REMOVE_HEAD((head), field);          \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    }                               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    else {                              \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        struct type *curelm = STAILQ_FIRST((head));     \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        while (STAILQ_NEXT(curelm, field) != (elm))     \
60405de4d8688d96dd05157c28db3ade5c9bc234kz            curelm = STAILQ_NEXT(curelm, field);        \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        if ((STAILQ_NEXT(curelm, field) =           \
60405de4d8688d96dd05157c28db3ade5c9bc234kz             STAILQ_NEXT(STAILQ_NEXT(curelm, field), field)) == NULL)\
60405de4d8688d96dd05157c28db3ade5c9bc234kz            (head)->stqh_last = &STAILQ_NEXT((curelm), field);\
60405de4d8688d96dd05157c28db3ade5c9bc234kz    }                               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    TRASHIT((elm)->field.stqe_next);                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define STAILQ_REMOVE_HEAD(head, field) do {                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if ((STAILQ_FIRST((head)) =                 \
60405de4d8688d96dd05157c28db3ade5c9bc234kz         STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL)     \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (head)->stqh_last = &STAILQ_FIRST((head));      \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do {         \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if ((STAILQ_FIRST((head)) = STAILQ_NEXT((elm), field)) == NULL) \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (head)->stqh_last = &STAILQ_FIRST((head));      \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz/*
60405de4d8688d96dd05157c28db3ade5c9bc234kz * List declarations.
60405de4d8688d96dd05157c28db3ade5c9bc234kz */
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define LIST_HEAD(name, type)                       \
60405de4d8688d96dd05157c28db3ade5c9bc234kzstruct name {                               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    struct type *lh_first;  /* first element */         \
60405de4d8688d96dd05157c28db3ade5c9bc234kz}
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define LIST_HEAD_INITIALIZER(head)                 \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    { NULL }
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define LIST_ENTRY(type)                        \
60405de4d8688d96dd05157c28db3ade5c9bc234kzstruct {                                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    struct type *le_next;   /* next element */          \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    struct type **le_prev;  /* address of previous next element */  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz}
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz/*
60405de4d8688d96dd05157c28db3ade5c9bc234kz * List functions.
60405de4d8688d96dd05157c28db3ade5c9bc234kz */
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#if (defined(_KERNEL) && defined(INVARIANTS))
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define QMD_LIST_CHECK_HEAD(head, field) do {               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if (LIST_FIRST((head)) != NULL &&               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        LIST_FIRST((head))->field.le_prev !=            \
60405de4d8688d96dd05157c28db3ade5c9bc234kz         &LIST_FIRST((head)))                   \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        panic("Bad list head %p first->prev != head", (head));  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define QMD_LIST_CHECK_NEXT(elm, field) do {                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if (LIST_NEXT((elm), field) != NULL &&              \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        LIST_NEXT((elm), field)->field.le_prev !=           \
60405de4d8688d96dd05157c28db3ade5c9bc234kz         &((elm)->field.le_next))                   \
60405de4d8688d96dd05157c28db3ade5c9bc234kz            panic("Bad link elm %p next->prev != elm", (elm));  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define QMD_LIST_CHECK_PREV(elm, field) do {                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if (*(elm)->field.le_prev != (elm))             \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        panic("Bad link elm %p prev->next != elm", (elm));  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz#else
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define QMD_LIST_CHECK_HEAD(head, field)
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define QMD_LIST_CHECK_NEXT(elm, field)
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define QMD_LIST_CHECK_PREV(elm, field)
60405de4d8688d96dd05157c28db3ade5c9bc234kz#endif /* (_KERNEL && INVARIANTS) */
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define LIST_EMPTY(head)    ((head)->lh_first == NULL)
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define LIST_FIRST(head)    ((head)->lh_first)
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define LIST_FOREACH(var, head, field)                  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    for ((var) = LIST_FIRST((head));                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (var);                          \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (var) = LIST_NEXT((var), field))
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define LIST_FOREACH_SAFE(var, head, field, tvar)           \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    for ((var) = LIST_FIRST((head));                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (var) && ((tvar) = LIST_NEXT((var), field), 1);     \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (var) = (tvar))
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define LIST_INIT(head) do {                        \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    LIST_FIRST((head)) = NULL;                  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define LIST_INSERT_AFTER(listelm, elm, field) do {         \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_LIST_CHECK_NEXT(listelm, field);                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
60405de4d8688d96dd05157c28db3ade5c9bc234kz        LIST_NEXT((listelm), field)->field.le_prev =        \
60405de4d8688d96dd05157c28db3ade5c9bc234kz            &LIST_NEXT((elm), field);               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    LIST_NEXT((listelm), field) = (elm);                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (elm)->field.le_prev = &LIST_NEXT((listelm), field);        \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define LIST_INSERT_BEFORE(listelm, elm, field) do {            \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_LIST_CHECK_PREV(listelm, field);                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (elm)->field.le_prev = (listelm)->field.le_prev;        \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    LIST_NEXT((elm), field) = (listelm);                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    *(listelm)->field.le_prev = (elm);              \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (listelm)->field.le_prev = &LIST_NEXT((elm), field);        \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define LIST_INSERT_HEAD(head, elm, field) do {             \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_LIST_CHECK_HEAD((head), field);             \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
60405de4d8688d96dd05157c28db3ade5c9bc234kz    LIST_FIRST((head)) = (elm);                 \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (elm)->field.le_prev = &LIST_FIRST((head));         \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define LIST_NEXT(elm, field)   ((elm)->field.le_next)
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define LIST_REMOVE(elm, field) do {                    \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_LIST_CHECK_NEXT(elm, field);                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_LIST_CHECK_PREV(elm, field);                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if (LIST_NEXT((elm), field) != NULL)                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        LIST_NEXT((elm), field)->field.le_prev =        \
60405de4d8688d96dd05157c28db3ade5c9bc234kz            (elm)->field.le_prev;               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    *(elm)->field.le_prev = LIST_NEXT((elm), field);        \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    TRASHIT((elm)->field.le_next);                  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    TRASHIT((elm)->field.le_prev);                  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz/*
60405de4d8688d96dd05157c28db3ade5c9bc234kz * Tail queue declarations.
60405de4d8688d96dd05157c28db3ade5c9bc234kz */
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TAILQ_HEAD(name, type)                      \
60405de4d8688d96dd05157c28db3ade5c9bc234kzstruct name {                               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    struct type *tqh_first; /* first element */         \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    struct type **tqh_last; /* addr of last next element */     \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    TRACEBUF                            \
60405de4d8688d96dd05157c28db3ade5c9bc234kz}
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TAILQ_HEAD_INITIALIZER(head)                    \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    { NULL, &(head).tqh_first }
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TAILQ_ENTRY(type)                       \
60405de4d8688d96dd05157c28db3ade5c9bc234kzstruct {                                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    struct type *tqe_next;  /* next element */          \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    struct type **tqe_prev; /* address of previous next element */  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    TRACEBUF                            \
60405de4d8688d96dd05157c28db3ade5c9bc234kz}
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz/*
60405de4d8688d96dd05157c28db3ade5c9bc234kz * Tail queue functions.
60405de4d8688d96dd05157c28db3ade5c9bc234kz */
60405de4d8688d96dd05157c28db3ade5c9bc234kz#if (defined(_KERNEL) && defined(INVARIANTS))
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define QMD_TAILQ_CHECK_HEAD(head, field) do {              \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if (!TAILQ_EMPTY(head) &&                   \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        TAILQ_FIRST((head))->field.tqe_prev !=          \
60405de4d8688d96dd05157c28db3ade5c9bc234kz         &TAILQ_FIRST((head)))                  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        panic("Bad tailq head %p first->prev != head", (head)); \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define QMD_TAILQ_CHECK_TAIL(head, field) do {              \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if (*(head)->tqh_last != NULL)                  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz            panic("Bad tailq NEXT(%p->tqh_last) != NULL", (head));  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define QMD_TAILQ_CHECK_NEXT(elm, field) do {               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if (TAILQ_NEXT((elm), field) != NULL &&             \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        TAILQ_NEXT((elm), field)->field.tqe_prev !=         \
60405de4d8688d96dd05157c28db3ade5c9bc234kz         &((elm)->field.tqe_next))                  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        panic("Bad link elm %p next->prev != elm", (elm));  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define QMD_TAILQ_CHECK_PREV(elm, field) do {               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if (*(elm)->field.tqe_prev != (elm))                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        panic("Bad link elm %p prev->next != elm", (elm));  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz#else
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define QMD_TAILQ_CHECK_HEAD(head, field)
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define QMD_TAILQ_CHECK_TAIL(head, headname)
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define QMD_TAILQ_CHECK_NEXT(elm, field)
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define QMD_TAILQ_CHECK_PREV(elm, field)
60405de4d8688d96dd05157c28db3ade5c9bc234kz#endif /* (_KERNEL && INVARIANTS) */
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TAILQ_CONCAT(head1, head2, field) do {              \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if (!TAILQ_EMPTY(head2)) {                  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        *(head1)->tqh_last = (head2)->tqh_first;        \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (head2)->tqh_first->field.tqe_prev = (head1)->tqh_last; \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (head1)->tqh_last = (head2)->tqh_last;          \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        TAILQ_INIT((head2));                    \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        QMD_TRACE_HEAD(head1);                  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        QMD_TRACE_HEAD(head2);                  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    }                               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TAILQ_EMPTY(head)   ((head)->tqh_first == NULL)
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TAILQ_FIRST(head)   ((head)->tqh_first)
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TAILQ_FOREACH(var, head, field)                 \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    for ((var) = TAILQ_FIRST((head));               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (var);                          \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (var) = TAILQ_NEXT((var), field))
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TAILQ_FOREACH_SAFE(var, head, field, tvar)          \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    for ((var) = TAILQ_FIRST((head));               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (var) && ((tvar) = TAILQ_NEXT((var), field), 1);        \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (var) = (tvar))
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TAILQ_FOREACH_REVERSE(var, head, headname, field)       \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    for ((var) = TAILQ_LAST((head), headname);          \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (var);                          \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (var) = TAILQ_PREV((var), headname, field))
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar)    \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    for ((var) = TAILQ_LAST((head), headname);          \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1);  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (var) = (tvar))
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TAILQ_INIT(head) do {                       \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    TAILQ_FIRST((head)) = NULL;                 \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (head)->tqh_last = &TAILQ_FIRST((head));            \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_TRACE_HEAD(head);                       \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TAILQ_INSERT_AFTER(head, listelm, elm, field) do {      \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_TAILQ_CHECK_NEXT(listelm, field);               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\
60405de4d8688d96dd05157c28db3ade5c9bc234kz        TAILQ_NEXT((elm), field)->field.tqe_prev =      \
60405de4d8688d96dd05157c28db3ade5c9bc234kz            &TAILQ_NEXT((elm), field);              \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    else {                              \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (head)->tqh_last = &TAILQ_NEXT((elm), field);       \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        QMD_TRACE_HEAD(head);                   \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    }                               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    TAILQ_NEXT((listelm), field) = (elm);               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field);      \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_TRACE_ELEM(&(elm)->field);                  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_TRACE_ELEM(&listelm->field);                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TAILQ_INSERT_BEFORE(listelm, elm, field) do {           \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_TAILQ_CHECK_PREV(listelm, field);               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (elm)->field.tqe_prev = (listelm)->field.tqe_prev;      \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    TAILQ_NEXT((elm), field) = (listelm);               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    *(listelm)->field.tqe_prev = (elm);             \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field);      \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_TRACE_ELEM(&(elm)->field);                  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_TRACE_ELEM(&listelm->field);                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TAILQ_INSERT_HEAD(head, elm, field) do {            \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_TAILQ_CHECK_HEAD(head, field);              \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL)   \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        TAILQ_FIRST((head))->field.tqe_prev =           \
60405de4d8688d96dd05157c28db3ade5c9bc234kz            &TAILQ_NEXT((elm), field);              \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    else                                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (head)->tqh_last = &TAILQ_NEXT((elm), field);       \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    TAILQ_FIRST((head)) = (elm);                    \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (elm)->field.tqe_prev = &TAILQ_FIRST((head));           \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_TRACE_HEAD(head);                       \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_TRACE_ELEM(&(elm)->field);                  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TAILQ_INSERT_TAIL(head, elm, field) do {            \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_TAILQ_CHECK_TAIL(head, field);              \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    TAILQ_NEXT((elm), field) = NULL;                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (elm)->field.tqe_prev = (head)->tqh_last;           \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    *(head)->tqh_last = (elm);                  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (head)->tqh_last = &TAILQ_NEXT((elm), field);           \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_TRACE_HEAD(head);                       \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_TRACE_ELEM(&(elm)->field);                  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TAILQ_LAST(head, headname)                  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (*(((struct headname *)((head)->tqh_last))->tqh_last))
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TAILQ_PREV(elm, headname, field)                \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#define TAILQ_REMOVE(head, elm, field) do {             \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_TAILQ_CHECK_NEXT(elm, field);               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_TAILQ_CHECK_PREV(elm, field);               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    if ((TAILQ_NEXT((elm), field)) != NULL)             \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        TAILQ_NEXT((elm), field)->field.tqe_prev =      \
60405de4d8688d96dd05157c28db3ade5c9bc234kz            (elm)->field.tqe_prev;              \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    else {                              \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        (head)->tqh_last = (elm)->field.tqe_prev;       \
60405de4d8688d96dd05157c28db3ade5c9bc234kz        QMD_TRACE_HEAD(head);                   \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    }                               \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field);      \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    TRASHIT((elm)->field.tqe_next);                 \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    TRASHIT((elm)->field.tqe_prev);                 \
60405de4d8688d96dd05157c28db3ade5c9bc234kz    QMD_TRACE_ELEM(&(elm)->field);                  \
60405de4d8688d96dd05157c28db3ade5c9bc234kz} while (*"\0")
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#ifdef _KERNEL
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#endif /* _KERNEL */
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz#endif /* !_SYS_QUEUE_H_ */
60405de4d8688d96dd05157c28db3ade5c9bc234kz
60405de4d8688d96dd05157c28db3ade5c9bc234kz/* END CSTYLED */