diff options
Diffstat (limited to 'src/xine-utils/list.h')
| -rw-r--r-- | src/xine-utils/list.h | 32 |
1 files changed, 16 insertions, 16 deletions
diff --git a/src/xine-utils/list.h b/src/xine-utils/list.h index 5b5f3532e..9b9506a84 100644 --- a/src/xine-utils/list.h +++ b/src/xine-utils/list.h @@ -17,7 +17,7 @@ * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA * - * $Id: list.h,v 1.3 2006/04/05 22:12:20 valtri Exp $ + * $Id: list.h,v 1.4 2006/09/26 05:19:49 dgp85 Exp $ * * Doubly-linked linked list. * @@ -50,25 +50,25 @@ typedef struct xine_list_s xine_list_t; typedef void* xine_list_iterator_t; /* Constructor */ -xine_list_t *xine_list_new(void); +xine_list_t *xine_list_new(void) XINE_PROTECTED; /* Destructor */ -void xine_list_delete(xine_list_t *list); +void xine_list_delete(xine_list_t *list) XINE_PROTECTED; /* Returns the number of element stored in the list */ -unsigned int xine_list_size(xine_list_t *list); +unsigned int xine_list_size(xine_list_t *list) XINE_PROTECTED; /* Returns true if the number of elements is zero, false otherwise */ -unsigned int xine_list_empty(xine_list_t *list); +unsigned int xine_list_empty(xine_list_t *list) XINE_PROTECTED; /* Adds the element at the beginning of the list */ -void xine_list_push_front(xine_list_t *list, void *value); +void xine_list_push_front(xine_list_t *list, void *value) XINE_PROTECTED; /* Adds the element at the end of the list */ -void xine_list_push_back(xine_list_t *list, void *value); +void xine_list_push_back(xine_list_t *list, void *value) XINE_PROTECTED; /* Remove all elements from a list */ -void xine_list_clear(xine_list_t *list); +void xine_list_clear(xine_list_t *list) XINE_PROTECTED; /* Insert the element elem into the list at the position specified by the iterator (before the element, if any, that was previously at the iterator's @@ -76,31 +76,31 @@ void xine_list_clear(xine_list_t *list); the inserted element. */ xine_list_iterator_t xine_list_insert(xine_list_t *list, xine_list_iterator_t position, - void *value); + void *value) XINE_PROTECTED; /* Remove one element from a list.*/ -void xine_list_remove(xine_list_t *list, xine_list_iterator_t position); +void xine_list_remove(xine_list_t *list, xine_list_iterator_t position) XINE_PROTECTED; /* Returns an iterator that references the first element of the list */ -xine_list_iterator_t xine_list_front(xine_list_t *list); +xine_list_iterator_t xine_list_front(xine_list_t *list) XINE_PROTECTED; /* Returns an iterator that references the last element of the list */ -xine_list_iterator_t xine_list_back(xine_list_t *list); +xine_list_iterator_t xine_list_back(xine_list_t *list) XINE_PROTECTED; /* Perform a linear search of a given value, and returns an iterator that references this value or NULL if not found */ -xine_list_iterator_t xine_list_find(xine_list_t *list, void *value); +xine_list_iterator_t xine_list_find(xine_list_t *list, void *value) XINE_PROTECTED; /* Increments the iterator's value, so it specifies the next element in the list or NULL at the end of the list */ -xine_list_iterator_t xine_list_next(xine_list_t *list, xine_list_iterator_t ite); +xine_list_iterator_t xine_list_next(xine_list_t *list, xine_list_iterator_t ite) XINE_PROTECTED; /* Increments the iterator's value, so it specifies the previous element in the list or NULL at the beginning of the list */ -xine_list_iterator_t xine_list_prev(xine_list_t *list, xine_list_iterator_t ite); +xine_list_iterator_t xine_list_prev(xine_list_t *list, xine_list_iterator_t ite) XINE_PROTECTED; /* Returns the value at the position specified by the iterator */ -void *xine_list_get_value(xine_list_t *list, xine_list_iterator_t ite); +void *xine_list_get_value(xine_list_t *list, xine_list_iterator_t ite) XINE_PROTECTED; #endif |