]>
code.delx.au - pulseaudio/blob - src/pulsecore/llist.h
7 This file is part of PulseAudio.
9 PulseAudio is free software; you can redistribute it and/or modify
10 it under the terms of the GNU Lesser General Public License as
11 published by the Free Software Foundation; either version 2 of the
12 License, or (at your option) any later version.
14 PulseAudio is distributed in the hope that it will be useful, but
15 WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 General Public License for more details.
19 You should have received a copy of the GNU Lesser General Public
20 License along with PulseAudio; if not, write to the Free Software
21 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
27 /* Some macros for maintaining doubly linked lists */
29 /* The head of the linked list. Use this in the structure that shall
30 * contain the head of the linked list */
31 #define PA_LLIST_HEAD(t,name) t *name
33 /* The pointers in the linked list's items. Use this in the item structure */
34 #define PA_LLIST_FIELDS(t) t *next, *prev
36 /* Initialize the list's head */
37 #define PA_LLIST_HEAD_INIT(t,item) do { (item) = NULL; } while(0)
39 /* Initialize a list item */
40 #define PA_LLIST_INIT(t,item) do { \
43 _item->prev = _item->next = NULL; \
46 /* Prepend an item to the list */
47 #define PA_LLIST_PREPEND(t,head,item) do { \
48 t **_head = &(head), *_item = (item); \
50 if ((_item->next = *_head)) \
51 _item->next->prev = _item; \
56 /* Remove an item from the list */
57 #define PA_LLIST_REMOVE(t,head,item) do { \
58 t **_head = &(head), *_item = (item); \
61 _item->next->prev = _item->prev; \
63 _item->prev->next = _item->next; \
65 assert(*_head == _item); \
66 *_head = _item->next; \
68 _item->next = _item->prev = NULL; \
71 #define PA_LLIST_FIND_HEAD(t,item,head) \
73 t **_head = (head), *_item = (item); \
76 while ((*_head)->prev) \
77 *_head = (*_head)->prev; \
80 #define PA_LLIST_INSERT_AFTER(t,head,a,b) \
82 t **_head = &(head), *_a = (a), *_b = (b); \
85 if ((_b->next = *_head)) \
86 _b->next->prev = _b; \
90 if ((_b->next = _a->next)) \
91 _b->next->prev = _b; \