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