mirrors/pulseaudio
1
0
Fork 0
mirror of https://gitlab.freedesktop.org/pulseaudio/pulseaudio.git synced 2025-11-06 13:29:56 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions

reindent, and s/assert/pa_assert/g

Browse source 
git-svn-id: file:///home/lennart/svn/public/pulseaudio/branches/lennart@1814 fefdeb5f-60dc-0310-8127-8f9354f1896f
This commit is contained in:
Lennart Poettering 2007-09-12 22:50:44 +00:00
parent 4137865815
commit 03f311a464
1 changed files with 64 additions and 55 deletions
Download patch file Download diff file Expand all files Collapse all files

119
src/pulsecore/llist.h
View file

@ -24,77 +24,86 @@
USA. USA.
***/ ***/
#include <assert.h> #include <pulsecore/macro.h>
/* Some macros for maintaining doubly linked lists */ /* Some macros for maintaining doubly linked lists */
/* The head of the linked list. Use this in the structure that shall /* The head of the linked list. Use this in the structure that shall
* contain the head of the linked list */ * contain the head of the linked list */
#define PA_LLIST_HEAD(t,name) t *name #define PA_LLIST_HEAD(t,name) \
t *name
/* The pointers in the linked list's items. Use this in the item structure */ /* The pointers in the linked list's items. Use this in the item structure */
#define PA_LLIST_FIELDS(t) t *next, *prev #define PA_LLIST_FIELDS(t) \
t *next, *prev
/* Initialize the list's head */ /* Initialize the list's head */
#define PA_LLIST_HEAD_INIT(t,item) do { (item) = (t*) NULL; } while(0) #define PA_LLIST_HEAD_INIT(t,item) \
do { \
(item) = (t*) NULL; } \
while(0)
/* Initialize a list item */ /* Initialize a list item */
#define PA_LLIST_INIT(t,item) do { \ #define PA_LLIST_INIT(t,item) \
t *_item = (item); \ do { \
assert(_item); \ t *_item = (item); \
_item->prev = _item->next = NULL; \ pa_assert(_item); \
} while(0) _item->prev = _item->next = NULL; \
} while(0)
/* Prepend an item to the list */ /* Prepend an item to the list */
#define PA_LLIST_PREPEND(t,head,item) do { \ #define PA_LLIST_PREPEND(t,head,item) \
t **_head = &(head), *_item = (item); \ do { \
assert(_item); \ t **_head = &(head), *_item = (item); \
if ((_item->next = *_head)) \ pa_assert(_item); \
_item->next->prev = _item; \ if ((_item->next = *_head)) \
_item->prev = NULL; \ _item->next->prev = _item; \
*_head = _item; \ _item->prev = NULL; \
} while (0) *_head = _item; \
} while (0)
/* Remove an item from the list */ /* Remove an item from the list */
#define PA_LLIST_REMOVE(t,head,item) do { \ #define PA_LLIST_REMOVE(t,head,item) \
t **_head = &(head), *_item = (item); \ do { \
assert(_item); \ t **_head = &(head), *_item = (item); \
if (_item->next) \ pa_assert(_item); \
_item->next->prev = _item->prev; \ if (_item->next) \
if (_item->prev) \ _item->next->prev = _item->prev; \
_item->prev->next = _item->next; \ if (_item->prev) \
else {\ _item->prev->next = _item->next; \
assert(*_head == _item); \ else { \
*_head = _item->next; \ pa_assert(*_head == _item); \
} \ *_head = _item->next; \
_item->next = _item->prev = NULL; \ } \
} while(0) _item->next = _item->prev = NULL; \
} while(0)
#define PA_LLIST_FIND_HEAD(t,item,head) \ /* Find the head of the list */
do { \ #define PA_LLIST_FIND_HEAD(t,item,head) \
t **_head = (head), *_item = (item); \ do { \
*_head = _item; \ t **_head = (head), *_item = (item); \
assert(_head); \ *_head = _item; \
while ((*_head)->prev) \ pa_assert(_head); \
*_head = (*_head)->prev; \ while ((*_head)->prev) \
} while (0) *_head = (*_head)->prev; \
} while (0)
#define PA_LLIST_INSERT_AFTER(t,head,a,b) \
do { \
t **_head = &(head), *_a = (a), *_b = (b); \
assert(_b); \
if (!_a) { \
if ((_b->next = *_head)) \
_b->next->prev = _b; \
_b->prev = NULL; \
*_head = _b; \
} else { \
if ((_b->next = _a->next)) \
_b->next->prev = _b; \
_b->prev = _a; \
_a->next = _b; \
} \
} while (0)
/* Insert an item after another one (a = where, b = what) */
#define PA_LLIST_INSERT_AFTER(t,head,a,b) \
do { \
t **_head = &(head), *_a = (a), *_b = (b); \
pa_assert(_b); \
if (!_a) { \
if ((_b->next = *_head)) \
_b->next->prev = _b; \
_b->prev = NULL; \
*_head = _b; \
} else { \
if ((_b->next = _a->next)) \
_b->next->prev = _b; \
_b->prev = _a; \
_a->next = _b; \
} \
} while (0)
#endif #endif