mirror of
https://gitlab.freedesktop.org/pulseaudio/pulseaudio.git
synced 2025-11-09 13:29:59 -05:00
304449002c
2) Add support to synchronize multiple playback streams 3) add two tests for 1) and 2) 4) s/PA_ERROR/PA_ERR/ 5) s/PA_ERROR_OK/PA_OK/ 6) update simple API to deal properly with new peek/drop recording API 7) add beginnings of proper validity checking on API calls in client libs (needs to be extended) 8) report playback buffer overflows/underflows to the client 9) move client side recording mcalign stuff into the memblockq 10) create typedefs for a bunch of API callback prototypes 11) simplify handling of HUP poll() events Yes, i know, it's usually better to commit a lot of small patches instead of a single big one. In this case however, this would have contradicted the other rule: never commit broken or incomplete stuff. *** This stuff needs a lot of additional testing! *** git-svn-id: file:///home/lennart/svn/public/pulseaudio/trunk@511 fefdeb5f-60dc-0310-8127-8f9354f1896f
79 lines
3 KiB
C
79 lines
3 KiB
C
#ifndef foollistfoo
|
|
#define foollistfoo
|
|
|
|
/* $Id$ */
|
|
|
|
/***
|
|
This file is part of polypaudio.
|
|
|
|
polypaudio is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as
|
|
published by the Free Software Foundation; either version 2 of the
|
|
License, or (at your option) any later version.
|
|
|
|
polypaudio is distributed in the hope that it will be useful, but
|
|
WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public
|
|
License along with polypaudio; if not, write to the Free Software
|
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
|
|
USA.
|
|
***/
|
|
|
|
/* Some macros for maintaining doubly linked lists */
|
|
|
|
/* The head of the linked list. Use this in the structure that shall
|
|
* contain the head of the linked list */
|
|
#define PA_LLIST_HEAD(t,name) t *name
|
|
|
|
/* The pointers in the linked list's items. Use this in the item structure */
|
|
#define PA_LLIST_FIELDS(t) t *next, *prev
|
|
|
|
/* Initialize the list's head */
|
|
#define PA_LLIST_HEAD_INIT(t,item) do { (item) = NULL; } while(0)
|
|
|
|
/* Initialize a list item */
|
|
#define PA_LLIST_INIT(t,item) do { \
|
|
t *_item = (item); \
|
|
assert(_item); \
|
|
_item->prev = _item->next = NULL; \
|
|
} while(0)
|
|
|
|
/* Prepend an item to the list */
|
|
#define PA_LLIST_PREPEND(t,head,item) do { \
|
|
t **_head = &(head), *_item = (item); \
|
|
assert(_item); \
|
|
if ((_item->next = *_head)) \
|
|
_item->next->prev = _item; \
|
|
_item->prev = NULL; \
|
|
*_head = _item; \
|
|
} while (0)
|
|
|
|
/* Remove an item from the list */
|
|
#define PA_LLIST_REMOVE(t,head,item) do { \
|
|
t **_head = &(head), *_item = (item); \
|
|
assert(_item); \
|
|
if (_item->next) \
|
|
_item->next->prev = _item->prev; \
|
|
if (_item->prev) \
|
|
_item->prev->next = _item->next; \
|
|
else {\
|
|
assert(*_head == _item); \
|
|
*_head = _item->next; \
|
|
} \
|
|
_item->next = _item->prev = NULL; \
|
|
} while(0)
|
|
|
|
#define PA_LLIST_FIND_HEAD(t,item,head) \
|
|
do { \
|
|
t **_head = (head), *_item = (item); \
|
|
*_head = _item; \
|
|
assert(_head); \
|
|
while ((*_head)->prev) \
|
|
*_head = (*_head)->prev; \
|
|
} while (0) \
|
|
|
|
|
|
#endif
|