mirrors/qemu
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update sys-queue.h (Gerd Hoffmann)

Browse Source 
- got recent copy from netbsd.
 - deleted debug code.
 - deleted some list implementations, left in only the ones which
   qemu already has.

Signed-off-by: Gerd Hoffmann <kraxel@redhat.com>
Signed-off-by: Anthony Liguori <aliguori@us.ibm.com>



git-svn-id: svn://svn.savannah.nongnu.org/qemu/trunk@4973 c046a42c-6fe2-441c-8c8c-71466251a162
This commit is contained in:
aliguori 2008-07-29 20:00:31 +00:00
parent c6a6a5e3bb
commit 23cde8bb12
1 changed files with 338 additions and 241 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

579
audio/sys-queue.h
View File

@ -1,241 +1,338 @@
/* /* $NetBSD: queue.h,v 1.45.14.1 2007/07/18 20:13:24 liamjfoy Exp $ */
* Copyright (c) 1991, 1993
* The Regents of the University of California. All rights reserved. /*
* * Qemu version: Copy from netbsd, removed debug code, removed some of
* Redistribution and use in source and binary forms, with or without * the implementations. Left in lists, tail queues and circular queues.
* 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. * Copyright (c) 1991, 1993
* 2. Redistributions in binary form must reproduce the above copyright * The Regents of the University of California. All rights reserved.
* notice, this list of conditions and the following disclaimer in the *
* documentation and/or other materials provided with the distribution. * Redistribution and use in source and binary forms, with or without
* 4. Neither the name of the University nor the names of its contributors * modification, are permitted provided that the following conditions
* may be used to endorse or promote products derived from this software * are met:
* without specific prior written permission. * 1. Redistributions of source code must retain the above copyright
* * notice, this list of conditions and the following disclaimer.
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * 2. Redistributions in binary form must reproduce the above copyright
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * notice, this list of conditions and the following disclaimer in the
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * documentation and/or other materials provided with the distribution.
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * 3. Neither the name of the University nor the names of its contributors
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * may be used to endorse or promote products derived from this software
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * without specific prior written permission.
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) *
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* SUCH DAMAGE. * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* @(#)queue.h 8.3 (Berkeley) 12/13/93 * 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
#ifndef _SYS_QUEUE_H * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
#define _SYS_QUEUE_H 1 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
/* *
* This file defines three types of data structures: lists, tail queues, * @(#)queue.h 8.5 (Berkeley) 8/20/94
* and circular queues. */
*
* A list is headed by a single forward pointer (or an array of forward #ifndef _SYS_QUEUE_H_
* pointers for a hash table header). The elements are doubly linked #define _SYS_QUEUE_H_
* so that an arbitrary element can be removed without a need to
* traverse the list. New elements can be added to the list after /*
* an existing element or at the head of the list. A list may only be * This file defines three types of data structures:
* traversed in the forward direction. * lists, tail queues, and circular queues.
* *
* A tail queue is headed by a pair of pointers, one to the head of the * A list is headed by a single forward pointer (or an array of forward
* list and the other to the tail of the list. The elements are doubly * pointers for a hash table header). The elements are doubly linked
* linked so that an arbitrary element can be removed without a need to * so that an arbitrary element can be removed without a need to
* traverse the list. New elements can be added to the list after * traverse the list. New elements can be added to the list before
* an existing element, at the head of the list, or at the end of the * or after an existing element or at the head of the list. A list
* list. A tail queue may only be traversed in the forward direction. * may only be traversed in the forward direction.
* *
* A circle queue is headed by a pair of pointers, one to the head of the * 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 * 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 * 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 * traverse the list. New elements can be added to the list before or
* an existing element, at the head of the list, or at the end of the list. * after an existing element, at the head of the list, or at the end of
* A circle queue may be traversed in either direction, but has a more * the list. A tail queue may be traversed in either direction.
* complex end of list detection. *
* * A circle queue is headed by a pair of pointers, one to the head of the
* For details on the use of these macros, see the queue(3) manual page. * 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.
* List definitions. * A circle queue may be traversed in either direction, but has a more
*/ * complex end of list detection.
#define LIST_HEAD(name, type) \ *
struct name { \ * For details on the use of these macros, see the queue(3) manual page.
struct type *lh_first; /* first element */ \ */
}
/*
#define LIST_ENTRY(type) \ * List definitions.
struct { \ */
struct type *le_next; /* next element */ \ #define LIST_HEAD(name, type) \
struct type **le_prev; /* address of previous next element */ \ struct name { \
} struct type *lh_first; /* first element */ \
}
/*
* List functions. #define LIST_HEAD_INITIALIZER(head) \
*/ { NULL }
#define LIST_INIT(head) { \
(head)->lh_first = NULL; \ #define LIST_ENTRY(type) \
} struct { \
struct type *le_next; /* next element */ \
#define LIST_INSERT_AFTER(listelm, elm, field) { \ struct type **le_prev; /* address of previous next element */ \
if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \ }
(listelm)->field.le_next->field.le_prev = \
&(elm)->field.le_next; \ /*
(listelm)->field.le_next = (elm); \ * List functions.
(elm)->field.le_prev = &(listelm)->field.le_next; \ */
} #define LIST_INIT(head) do { \
(head)->lh_first = NULL; \
#define LIST_INSERT_HEAD(head, elm, field) { \ } while (/*CONSTCOND*/0)
if (((elm)->field.le_next = (head)->lh_first) != NULL) \
(head)->lh_first->field.le_prev = &(elm)->field.le_next;\ #define LIST_INSERT_AFTER(listelm, elm, field) do { \
(head)->lh_first = (elm); \ if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
(elm)->field.le_prev = &(head)->lh_first; \ (listelm)->field.le_next->field.le_prev = \
} &(elm)->field.le_next; \
(listelm)->field.le_next = (elm); \
#define LIST_REMOVE(elm, field) { \ (elm)->field.le_prev = &(listelm)->field.le_next; \
if ((elm)->field.le_next != NULL) \ } while (/*CONSTCOND*/0)
(elm)->field.le_next->field.le_prev = \
(elm)->field.le_prev; \ #define LIST_INSERT_BEFORE(listelm, elm, field) do { \
*(elm)->field.le_prev = (elm)->field.le_next; \ (elm)->field.le_prev = (listelm)->field.le_prev; \
} (elm)->field.le_next = (listelm); \
*(listelm)->field.le_prev = (elm); \
/* (listelm)->field.le_prev = &(elm)->field.le_next; \
* Tail queue definitions. } while (/*CONSTCOND*/0)
*/
#define TAILQ_HEAD(name, type) \ #define LIST_INSERT_HEAD(head, elm, field) do { \
struct name { \ if (((elm)->field.le_next = (head)->lh_first) != NULL) \
struct type *tqh_first; /* first element */ \ (head)->lh_first->field.le_prev = &(elm)->field.le_next;\
struct type **tqh_last; /* addr of last next element */ \ (head)->lh_first = (elm); \
} (elm)->field.le_prev = &(head)->lh_first; \
} while (/*CONSTCOND*/0)
#define TAILQ_ENTRY(type) \
struct { \ #define LIST_REMOVE(elm, field) do { \
struct type *tqe_next; /* next element */ \ if ((elm)->field.le_next != NULL) \
struct type **tqe_prev; /* address of previous next element */ \ (elm)->field.le_next->field.le_prev = \
} (elm)->field.le_prev; \
*(elm)->field.le_prev = (elm)->field.le_next; \
/* } while (/*CONSTCOND*/0)
* Tail queue functions.
*/ #define LIST_FOREACH(var, head, field) \
#define TAILQ_INIT(head) { \ for ((var) = ((head)->lh_first); \
(head)->tqh_first = NULL; \ (var); \
(head)->tqh_last = &(head)->tqh_first; \ (var) = ((var)->field.le_next))
}
/*
#define TAILQ_INSERT_HEAD(head, elm, field) { \ * List access methods.
if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \ */
(elm)->field.tqe_next->field.tqe_prev = \ #define LIST_EMPTY(head) ((head)->lh_first == NULL)
&(elm)->field.tqe_next; \ #define LIST_FIRST(head) ((head)->lh_first)
else \ #define LIST_NEXT(elm, field) ((elm)->field.le_next)
(head)->tqh_last = &(elm)->field.tqe_next; \
(head)->tqh_first = (elm); \
(elm)->field.tqe_prev = &(head)->tqh_first; \ /*
} * Tail queue definitions.
*/
#define TAILQ_INSERT_TAIL(head, elm, field) { \ #define _TAILQ_HEAD(name, type, qual) \
(elm)->field.tqe_next = NULL; \ struct name { \
(elm)->field.tqe_prev = (head)->tqh_last; \ qual type *tqh_first; /* first element */ \
*(head)->tqh_last = (elm); \ qual type *qual *tqh_last; /* addr of last next element */ \
(head)->tqh_last = &(elm)->field.tqe_next; \ }
} #define TAILQ_HEAD(name, type) _TAILQ_HEAD(name, struct type,)
#define TAILQ_INSERT_AFTER(head, listelm, elm, field) { \ #define TAILQ_HEAD_INITIALIZER(head) \
if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\ { NULL, &(head).tqh_first }
(elm)->field.tqe_next->field.tqe_prev = \
&(elm)->field.tqe_next; \ #define _TAILQ_ENTRY(type, qual) \
else \ struct { \
(head)->tqh_last = &(elm)->field.tqe_next; \ qual type *tqe_next; /* next element */ \
(listelm)->field.tqe_next = (elm); \ qual type *qual *tqe_prev; /* address of previous next element */\
(elm)->field.tqe_prev = &(listelm)->field.tqe_next; \ }
} #define TAILQ_ENTRY(type) _TAILQ_ENTRY(struct type,)
#define TAILQ_REMOVE(head, elm, field) { \ /*
if (((elm)->field.tqe_next) != NULL) \ * Tail queue functions.
(elm)->field.tqe_next->field.tqe_prev = \ */
(elm)->field.tqe_prev; \ #define TAILQ_INIT(head) do { \
else \ (head)->tqh_first = NULL; \
(head)->tqh_last = (elm)->field.tqe_prev; \ (head)->tqh_last = &(head)->tqh_first; \
*(elm)->field.tqe_prev = (elm)->field.tqe_next; \ } while (/*CONSTCOND*/0)
}
#define TAILQ_INSERT_HEAD(head, elm, field) do { \
/* if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \
* Circular queue definitions. (head)->tqh_first->field.tqe_prev = \
*/ &(elm)->field.tqe_next; \
#define CIRCLEQ_HEAD(name, type) \ else \
struct name { \ (head)->tqh_last = &(elm)->field.tqe_next; \
struct type *cqh_first; /* first element */ \ (head)->tqh_first = (elm); \
struct type *cqh_last; /* last element */ \ (elm)->field.tqe_prev = &(head)->tqh_first; \
} } while (/*CONSTCOND*/0)
#define CIRCLEQ_ENTRY(type) \ #define TAILQ_INSERT_TAIL(head, elm, field) do { \
struct { \ (elm)->field.tqe_next = NULL; \
struct type *cqe_next; /* next element */ \ (elm)->field.tqe_prev = (head)->tqh_last; \
struct type *cqe_prev; /* previous element */ \ *(head)->tqh_last = (elm); \
} (head)->tqh_last = &(elm)->field.tqe_next; \
} while (/*CONSTCOND*/0)
/*
* Circular queue functions. #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
*/ if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
#define CIRCLEQ_INIT(head) { \ (elm)->field.tqe_next->field.tqe_prev = \
(head)->cqh_first = (void *)(head); \ &(elm)->field.tqe_next; \
(head)->cqh_last = (void *)(head); \ else \
} (head)->tqh_last = &(elm)->field.tqe_next; \
(listelm)->field.tqe_next = (elm); \
#define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) { \ (elm)->field.tqe_prev = &(listelm)->field.tqe_next; \
(elm)->field.cqe_next = (listelm)->field.cqe_next; \ } while (/*CONSTCOND*/0)
(elm)->field.cqe_prev = (listelm); \
if ((listelm)->field.cqe_next == (void *)(head)) \ #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \
(head)->cqh_last = (elm); \ (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
else \ (elm)->field.tqe_next = (listelm); \
(listelm)->field.cqe_next->field.cqe_prev = (elm); \ *(listelm)->field.tqe_prev = (elm); \
(listelm)->field.cqe_next = (elm); \ (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \
} } while (/*CONSTCOND*/0)
#define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) { \ #define TAILQ_REMOVE(head, elm, field) do { \
(elm)->field.cqe_next = (listelm); \ if (((elm)->field.tqe_next) != NULL) \
(elm)->field.cqe_prev = (listelm)->field.cqe_prev; \ (elm)->field.tqe_next->field.tqe_prev = \
if ((listelm)->field.cqe_prev == (void *)(head)) \ (elm)->field.tqe_prev; \
(head)->cqh_first = (elm); \ else \
else \ (head)->tqh_last = (elm)->field.tqe_prev; \
(listelm)->field.cqe_prev->field.cqe_next = (elm); \ *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
(listelm)->field.cqe_prev = (elm); \ } while (/*CONSTCOND*/0)
}
#define TAILQ_FOREACH(var, head, field) \
#define CIRCLEQ_INSERT_HEAD(head, elm, field) { \ for ((var) = ((head)->tqh_first); \
(elm)->field.cqe_next = (head)->cqh_first; \ (var); \
(elm)->field.cqe_prev = (void *)(head); \ (var) = ((var)->field.tqe_next))
if ((head)->cqh_last == (void *)(head)) \
(head)->cqh_last = (elm); \ #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \
else \ for ((var) = (*(((struct headname *)((head)->tqh_last))->tqh_last)); \
(head)->cqh_first->field.cqe_prev = (elm); \ (var); \
(head)->cqh_first = (elm); \ (var) = (*(((struct headname *)((var)->field.tqe_prev))->tqh_last)))
}
/*
#define CIRCLEQ_INSERT_TAIL(head, elm, field) { \ * Tail queue access methods.
(elm)->field.cqe_next = (void *)(head); \ */
(elm)->field.cqe_prev = (head)->cqh_last; \ #define TAILQ_EMPTY(head) ((head)->tqh_first == NULL)
if ((head)->cqh_first == (void *)(head)) \ #define TAILQ_FIRST(head) ((head)->tqh_first)
(head)->cqh_first = (elm); \ #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
else \
(head)->cqh_last->field.cqe_next = (elm); \ #define TAILQ_LAST(head, headname) \
(head)->cqh_last = (elm); \ (*(((struct headname *)((head)->tqh_last))->tqh_last))
} #define TAILQ_PREV(elm, headname, field) \
(*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
#define CIRCLEQ_REMOVE(head, elm, field) { \
if ((elm)->field.cqe_next == (void *)(head)) \
(head)->cqh_last = (elm)->field.cqe_prev; \ /*
else \ * Circular queue definitions.
(elm)->field.cqe_next->field.cqe_prev = \ */
(elm)->field.cqe_prev; \ #define CIRCLEQ_HEAD(name, type) \
if ((elm)->field.cqe_prev == (void *)(head)) \ struct name { \
(head)->cqh_first = (elm)->field.cqe_next; \ struct type *cqh_first; /* first element */ \
else \ struct type *cqh_last; /* last element */ \
(elm)->field.cqe_prev->field.cqe_next = \ }
(elm)->field.cqe_next; \
} #define CIRCLEQ_HEAD_INITIALIZER(head) \
#endif /* sys/queue.h */ { (void *)&head, (void *)&head }
#define CIRCLEQ_ENTRY(type) \
struct { \
struct type *cqe_next; /* next element */ \
struct type *cqe_prev; /* previous element */ \
}
/*
* Circular queue functions.
*/
#define CIRCLEQ_INIT(head) do { \
(head)->cqh_first = (void *)(head); \
(head)->cqh_last = (void *)(head); \
} while (/*CONSTCOND*/0)
#define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \
(elm)->field.cqe_next = (listelm)->field.cqe_next; \
(elm)->field.cqe_prev = (listelm); \
if ((listelm)->field.cqe_next == (void *)(head)) \
(head)->cqh_last = (elm); \
else \
(listelm)->field.cqe_next->field.cqe_prev = (elm); \
(listelm)->field.cqe_next = (elm); \
} while (/*CONSTCOND*/0)
#define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \
(elm)->field.cqe_next = (listelm); \
(elm)->field.cqe_prev = (listelm)->field.cqe_prev; \
if ((listelm)->field.cqe_prev == (void *)(head)) \
(head)->cqh_first = (elm); \
else \
(listelm)->field.cqe_prev->field.cqe_next = (elm); \
(listelm)->field.cqe_prev = (elm); \
} while (/*CONSTCOND*/0)
#define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \
(elm)->field.cqe_next = (head)->cqh_first; \
(elm)->field.cqe_prev = (void *)(head); \
if ((head)->cqh_last == (void *)(head)) \
(head)->cqh_last = (elm); \
else \
(head)->cqh_first->field.cqe_prev = (elm); \
(head)->cqh_first = (elm); \
} while (/*CONSTCOND*/0)
#define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \
(elm)->field.cqe_next = (void *)(head); \
(elm)->field.cqe_prev = (head)->cqh_last; \
if ((head)->cqh_first == (void *)(head)) \
(head)->cqh_first = (elm); \
else \
(head)->cqh_last->field.cqe_next = (elm); \
(head)->cqh_last = (elm); \
} while (/*CONSTCOND*/0)
#define CIRCLEQ_REMOVE(head, elm, field) do { \
if ((elm)->field.cqe_next == (void *)(head)) \
(head)->cqh_last = (elm)->field.cqe_prev; \
else \
(elm)->field.cqe_next->field.cqe_prev = \
(elm)->field.cqe_prev; \
if ((elm)->field.cqe_prev == (void *)(head)) \
(head)->cqh_first = (elm)->field.cqe_next; \
else \
(elm)->field.cqe_prev->field.cqe_next = \
(elm)->field.cqe_next; \
} while (/*CONSTCOND*/0)
#define CIRCLEQ_FOREACH(var, head, field) \
for ((var) = ((head)->cqh_first); \
(var) != (const void *)(head); \
(var) = ((var)->field.cqe_next))
#define CIRCLEQ_FOREACH_REVERSE(var, head, field) \
for ((var) = ((head)->cqh_last); \
(var) != (const void *)(head); \
(var) = ((var)->field.cqe_prev))
/*
* Circular queue access methods.
*/
#define CIRCLEQ_EMPTY(head) ((head)->cqh_first == (void *)(head))
#define CIRCLEQ_FIRST(head) ((head)->cqh_first)
#define CIRCLEQ_LAST(head) ((head)->cqh_last)
#define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next)
#define CIRCLEQ_PREV(elm, field) ((elm)->field.cqe_prev)
#define CIRCLEQ_LOOP_NEXT(head, elm, field) \
(((elm)->field.cqe_next == (void *)(head)) \
? ((head)->cqh_first) \
: (elm->field.cqe_next))
#define CIRCLEQ_LOOP_PREV(head, elm, field) \
(((elm)->field.cqe_prev == (void *)(head)) \
? ((head)->cqh_last) \
: (elm->field.cqe_prev))
#endif /* !_SYS_QUEUE_H_ */