sys-queue.h revision 4af48bf7c72ef1e201c64bd475377b5af9d8e8a1
/* $NetBSD: queue.h,v 1.45.14.1 2007/07/18 20:13:24 liamjfoy Exp $ */
/*
* Qemu version: Copy from netbsd, removed debug code, removed some of
* the implementations. Left in lists, tail queues and circular queues.
*/
/*
* Copyright (c) 1991, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* @(#)queue.h 8.5 (Berkeley) 8/20/94
*/
#ifndef _SYS_QUEUE_H_
#define _SYS_QUEUE_H_
/*
* This file defines three types of data structures:
* lists, tail queues, and circular queues.
*
* A list is headed by a single forward pointer (or an array of forward
* pointers for a hash table header). The elements are doubly linked
* so that an arbitrary element can be removed without a need to
* traverse the list. New elements can be added to the list before
* or after an existing element or at the head of the list. A list
* may only be traversed in the forward direction.
*
* A tail queue is headed by a pair of pointers, one to the head of the
* list and the other to the tail of the list. The elements are doubly
* linked so that an arbitrary element can be removed without a need to
* traverse the list. New elements can be added to the list before or
* after an existing element, at the head of the list, or at the end of
* the list. A tail queue may be traversed in either direction.
*
* A circle queue is headed by a pair of pointers, one to the head of the
* list and the other to the tail of the list. The elements are doubly
* linked so that an arbitrary element can be removed without a need to
* traverse the list. New elements can be added to the list before or after
* an existing element, at the head of the list, or at the end of the list.
* A circle queue may be traversed in either direction, but has a more
* complex end of list detection.
*
* For details on the use of these macros, see the queue(3) manual page.
*/
/*
* List definitions.
*/
struct name { \
}
#define LIST_HEAD_INITIALIZER(head) \
{ NULL }
#define LIST_ENTRY(type) \
struct { \
}
/*
* List functions.
*/
} while (/*CONSTCOND*/0)
} while (/*CONSTCOND*/0)
} while (/*CONSTCOND*/0)
} while (/*CONSTCOND*/0)
} while (/*CONSTCOND*/0)
(var); \
/*
* List access methods.
*/
/*
* Tail queue definitions.
*/
struct name { \
}
#define TAILQ_HEAD_INITIALIZER(head) \
struct { \
}
/*
* Tail queue functions.
*/
#define TAILQ_INIT(head) do { \
} while (/*CONSTCOND*/0)
else \
} while (/*CONSTCOND*/0)
} while (/*CONSTCOND*/0)
else \
} while (/*CONSTCOND*/0)
} while (/*CONSTCOND*/0)
else \
} while (/*CONSTCOND*/0)
(var); \
(var); \
/*
* Tail queue access methods.
*/
/*
* Circular queue definitions.
*/
struct name { \
}
#define CIRCLEQ_HEAD_INITIALIZER(head) \
#define CIRCLEQ_ENTRY(type) \
struct { \
}
/*
* Circular queue functions.
*/
#define CIRCLEQ_INIT(head) do { \
} while (/*CONSTCOND*/0)
else \
} while (/*CONSTCOND*/0)
else \
} while (/*CONSTCOND*/0)
else \
} while (/*CONSTCOND*/0)
else \
} while (/*CONSTCOND*/0)
else \
else \
} while (/*CONSTCOND*/0)
/*
* Circular queue access methods.
*/
#endif /* !_SYS_QUEUE_H_ */