summaryrefslogtreecommitdiff
path: root/src/xine-utils
diff options
context:
space:
mode:
Diffstat (limited to 'src/xine-utils')
-rw-r--r--src/xine-utils/array.c3
-rw-r--r--src/xine-utils/array.h20
-rw-r--r--src/xine-utils/attributes.h11
-rw-r--r--src/xine-utils/list.c3
-rw-r--r--src/xine-utils/list.h32
-rw-r--r--src/xine-utils/pool.c3
-rw-r--r--src/xine-utils/pool.h10
-rw-r--r--src/xine-utils/ring_buffer.c3
-rw-r--r--src/xine-utils/ring_buffer.h16
-rw-r--r--src/xine-utils/sorted_array.c3
-rw-r--r--src/xine-utils/sorted_array.h18
-rw-r--r--src/xine-utils/xine_buffer.h24
-rw-r--r--src/xine-utils/xmllexer.h8
-rw-r--r--src/xine-utils/xmlparser.h18
14 files changed, 94 insertions, 78 deletions
diff --git a/src/xine-utils/array.c b/src/xine-utils/array.c
index 4c8784b7c..4fcecbb4b 100644
--- a/src/xine-utils/array.c
+++ b/src/xine-utils/array.c
@@ -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: array.c,v 1.2 2006/02/14 19:09:02 dsalt Exp $
+ * $Id: array.c,v 1.3 2006/09/26 05:19:49 dgp85 Exp $
*
*/
#ifdef HAVE_CONFIG_H
@@ -26,6 +26,7 @@
#include <stdlib.h>
#include <string.h>
+#include "attributes.h"
#include "array.h"
#define MIN_CHUNK_SIZE 32
diff --git a/src/xine-utils/array.h b/src/xine-utils/array.h
index f0e0bb521..45fc7b137 100644
--- a/src/xine-utils/array.h
+++ b/src/xine-utils/array.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: array.h,v 1.1 2006/01/16 08:04:44 tmattern Exp $
+ * $Id: array.h,v 1.2 2006/09/26 05:19:49 dgp85 Exp $
*
* Array that can grow automatically when you add elements.
* Inserting an element in the middle of the array implies memory moves.
@@ -29,31 +29,31 @@
typedef struct xine_array_s xine_array_t;
/* Constructor */
-xine_array_t *xine_array_new(size_t initial_size);
+xine_array_t *xine_array_new(size_t initial_size) XINE_PROTECTED;
/* Destructor */
-void xine_array_delete(xine_array_t *array);
+void xine_array_delete(xine_array_t *array) XINE_PROTECTED;
/* Returns the number of element stored in the array */
-size_t xine_array_size(xine_array_t *array);
+size_t xine_array_size(xine_array_t *array) XINE_PROTECTED;
/* Removes all elements from an array */
-void xine_array_clear(xine_array_t *array);
+void xine_array_clear(xine_array_t *array) XINE_PROTECTED;
/* Adds the element at the end of the array */
-void xine_array_add(xine_array_t *array, void *value);
+void xine_array_add(xine_array_t *array, void *value) XINE_PROTECTED;
/* Inserts an element into an array at the position specified */
-void xine_array_insert(xine_array_t *array, unsigned int position, void *value);
+void xine_array_insert(xine_array_t *array, unsigned int position, void *value) XINE_PROTECTED;
/* Removes one element from an array at the position specified */
-void xine_array_remove(xine_array_t *array, unsigned int position);
+void xine_array_remove(xine_array_t *array, unsigned int position) XINE_PROTECTED;
/* Get the element at the position specified */
-void *xine_array_get(xine_array_t *array, unsigned int position);
+void *xine_array_get(xine_array_t *array, unsigned int position) XINE_PROTECTED;
/* Set the element at the position specified */
-void xine_array_set(xine_array_t *array, unsigned int position, void *value);
+void xine_array_set(xine_array_t *array, unsigned int position, void *value) XINE_PROTECTED;
#endif
diff --git a/src/xine-utils/attributes.h b/src/xine-utils/attributes.h
index c468b7ba5..4bf5a21af 100644
--- a/src/xine-utils/attributes.h
+++ b/src/xine-utils/attributes.h
@@ -42,5 +42,16 @@
#endif /* __attribute __*/
#endif
+#ifdef XINE_COMPILE
+# include "config.h"
+#endif
+
+/* Export protected only for libxine functions */
+#if defined(XINE_LIBRARY_COMPILE) && defined(SUPPORT_ATTRIBUTE_VISIBILITY)
+# define XINE_PROTECTED __attribute__((visibility("protected")))
+#else
+# define XINE_PROTECTED
+#endif
+
#endif /* ATTRIBUTE_H_ */
diff --git a/src/xine-utils/list.c b/src/xine-utils/list.c
index 6d5d876bf..2c790c3db 100644
--- a/src/xine-utils/list.c
+++ b/src/xine-utils/list.c
@@ -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.c,v 1.11 2006/04/05 22:12:20 valtri Exp $
+ * $Id: list.c,v 1.12 2006/09/26 05:19:49 dgp85 Exp $
*
*/
@@ -26,6 +26,7 @@
#endif
#include <stdlib.h>
+#include "attributes.h"
#include "list.h"
#define MIN_CHUNK_SIZE 32
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
diff --git a/src/xine-utils/pool.c b/src/xine-utils/pool.c
index 3532def56..39dbccb0c 100644
--- a/src/xine-utils/pool.c
+++ b/src/xine-utils/pool.c
@@ -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: pool.c,v 1.1 2006/01/27 07:53:28 tmattern Exp $
+ * $Id: pool.c,v 1.2 2006/09/26 05:19:49 dgp85 Exp $
*
*/
#ifdef HAVE_CONFIG_H
@@ -25,6 +25,7 @@
#endif
#include <assert.h>
+#include "attributes.h"
#include "pool.h"
#include "array.h"
diff --git a/src/xine-utils/pool.h b/src/xine-utils/pool.h
index d2fa39497..5f6e4bd7e 100644
--- a/src/xine-utils/pool.h
+++ b/src/xine-utils/pool.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: pool.h,v 1.1 2006/01/27 07:53:28 tmattern Exp $
+ * $Id: pool.h,v 1.2 2006/09/26 05:19:49 dgp85 Exp $
*
* Object Pool
*/
@@ -38,13 +38,13 @@ xine_pool_t *xine_pool_new(size_t object_size,
void (create_object)(void *object),
void (prepare_object)(void *object),
void (return_object)(void *object),
- void (delete_object)(void *object));
+ void (delete_object)(void *object)) XINE_PROTECTED;
/* Deletes a pool */
-void xine_pool_delete(xine_pool_t *pool);
+void xine_pool_delete(xine_pool_t *pool) XINE_PROTECTED;
/* Get an object from the pool */
-void *xine_pool_get(xine_pool_t *pool);
+void *xine_pool_get(xine_pool_t *pool) XINE_PROTECTED;
/* Returns an object to the pool */
-void xine_pool_put(xine_pool_t *pool, void *object);
+void xine_pool_put(xine_pool_t *pool, void *object) XINE_PROTECTED;
diff --git a/src/xine-utils/ring_buffer.c b/src/xine-utils/ring_buffer.c
index dbad685d1..0dfd370f1 100644
--- a/src/xine-utils/ring_buffer.c
+++ b/src/xine-utils/ring_buffer.c
@@ -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: ring_buffer.c,v 1.4 2006/06/23 18:24:22 dsalt Exp $
+ * $Id: ring_buffer.c,v 1.5 2006/09/26 05:19:49 dgp85 Exp $
*
*/
#ifdef HAVE_CONFIG_H
@@ -30,6 +30,7 @@
#include <assert.h>
#include <stdio.h>
#include <string.h>
+#include "attributes.h"
#include "pool.h"
#include "list.h"
#include "ring_buffer.h"
diff --git a/src/xine-utils/ring_buffer.h b/src/xine-utils/ring_buffer.h
index ece5e7beb..fc826ba21 100644
--- a/src/xine-utils/ring_buffer.h
+++ b/src/xine-utils/ring_buffer.h
@@ -17,24 +17,24 @@
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
*
- * $Id: ring_buffer.h,v 1.2 2006/01/27 19:37:15 tmattern Exp $
+ * $Id: ring_buffer.h,v 1.3 2006/09/26 05:19:49 dgp85 Exp $
*
* Fifo + Ring Buffer
*/
typedef struct xine_ring_buffer_s xine_ring_buffer_t;
/* Creates a new ring buffer */
-xine_ring_buffer_t *xine_ring_buffer_new(size_t size);
+xine_ring_buffer_t *xine_ring_buffer_new(size_t size) XINE_PROTECTED;
/* Deletes a ring buffer */
-void xine_ring_buffer_delete(xine_ring_buffer_t *ring_buffer);
+void xine_ring_buffer_delete(xine_ring_buffer_t *ring_buffer) XINE_PROTECTED;
/* Returns a new chunk of the specified size */
/* Might block if the ring buffer is full */
-void *xine_ring_buffer_alloc(xine_ring_buffer_t *ring_buffer, size_t size);
+void *xine_ring_buffer_alloc(xine_ring_buffer_t *ring_buffer, size_t size) XINE_PROTECTED;
/* Put a chunk into the ring */
-void xine_ring_buffer_put(xine_ring_buffer_t *ring_buffer, void *chunk);
+void xine_ring_buffer_put(xine_ring_buffer_t *ring_buffer, void *chunk) XINE_PROTECTED;
/* Get a chunk of a specified size from the ring buffer
* Might block if the ring buffer is empty
@@ -43,15 +43,15 @@ void xine_ring_buffer_put(xine_ring_buffer_t *ring_buffer, void *chunk);
* rsize is not equal to size at the end of stream, the caller MUST check
* rsize value.
*/
-void *xine_ring_buffer_get(xine_ring_buffer_t *ring_buffer, size_t size, size_t *rsize);
+void *xine_ring_buffer_get(xine_ring_buffer_t *ring_buffer, size_t size, size_t *rsize) XINE_PROTECTED;
/* Releases the chunk, makes memory available for the alloc function */
-void xine_ring_buffer_release(xine_ring_buffer_t *ring_buffer, void *chunk);
+void xine_ring_buffer_release(xine_ring_buffer_t *ring_buffer, void *chunk) XINE_PROTECTED;
/* Closes the ring buffer
* The writer uses this function to signal the end of stream to the reader.
* The reader MUST check the rsize value returned by the get function.
*/
-void xine_ring_buffer_close(xine_ring_buffer_t *ring_buffer);
+void xine_ring_buffer_close(xine_ring_buffer_t *ring_buffer) XINE_PROTECTED;
diff --git a/src/xine-utils/sorted_array.c b/src/xine-utils/sorted_array.c
index fe5edf277..c69d92d40 100644
--- a/src/xine-utils/sorted_array.c
+++ b/src/xine-utils/sorted_array.c
@@ -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: sorted_array.c,v 1.2 2006/06/23 18:24:22 dsalt Exp $
+ * $Id: sorted_array.c,v 1.3 2006/09/26 05:19:49 dgp85 Exp $
*
*/
#ifdef HAVE_CONFIG_H
@@ -26,6 +26,7 @@
#include <stdlib.h>
#include <string.h>
+#include "attributes.h"
#include "sorted_array.h"
/* Array internal struct */
diff --git a/src/xine-utils/sorted_array.h b/src/xine-utils/sorted_array.h
index 5ca537f88..767a2913c 100644
--- a/src/xine-utils/sorted_array.h
+++ b/src/xine-utils/sorted_array.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: sorted_array.h,v 1.2 2006/06/23 18:24:22 dsalt Exp $
+ * $Id: sorted_array.h,v 1.3 2006/09/26 05:19:49 dgp85 Exp $
*
* Sorted array which grows automatically when you add elements.
* A binary search is used to find the position of a new element.
@@ -66,32 +66,32 @@ typedef struct xine_sarray_s xine_sarray_t;
typedef int (*xine_sarray_comparator_t)(void*, void*);
/* Constructor */
-xine_sarray_t *xine_sarray_new(size_t initial_size, xine_sarray_comparator_t comparator);
+xine_sarray_t *xine_sarray_new(size_t initial_size, xine_sarray_comparator_t comparator) XINE_PROTECTED;
/* Destructor */
-void xine_sarray_delete(xine_sarray_t *sarray);
+void xine_sarray_delete(xine_sarray_t *sarray) XINE_PROTECTED;
/* Returns the number of element stored in the array */
-size_t xine_sarray_size(const xine_sarray_t *sarray);
+size_t xine_sarray_size(const xine_sarray_t *sarray) XINE_PROTECTED;
/* Removes all elements from an array */
-void xine_sarray_clear(xine_sarray_t *sarray);
+void xine_sarray_clear(xine_sarray_t *sarray) XINE_PROTECTED;
/* Adds the element into the array
Returns the insertion position */
-int xine_sarray_add(xine_sarray_t *sarray, void *value);
+int xine_sarray_add(xine_sarray_t *sarray, void *value) XINE_PROTECTED;
/* Removes one element from an array at the position specified */
-void xine_sarray_remove(xine_sarray_t *sarray, unsigned int position);
+void xine_sarray_remove(xine_sarray_t *sarray, unsigned int position) XINE_PROTECTED;
/* Get the element at the position specified */
-void *xine_sarray_get(xine_sarray_t *sarray, unsigned int position);
+void *xine_sarray_get(xine_sarray_t *sarray, unsigned int position) XINE_PROTECTED;
/* Returns the index of the search key, if it is contained in the list.
Otherwise, (-(insertion point) - 1) or ~(insertion point).
The insertion point is defined as the point at which the key would be
inserted into the array. */
-int xine_sarray_binary_search(xine_sarray_t *sarray, void *key);
+int xine_sarray_binary_search(xine_sarray_t *sarray, void *key) XINE_PROTECTED;
#endif
diff --git a/src/xine-utils/xine_buffer.h b/src/xine-utils/xine_buffer.h
index 197807d57..02a9e2cb1 100644
--- a/src/xine-utils/xine_buffer.h
+++ b/src/xine-utils/xine_buffer.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: xine_buffer.h,v 1.6 2006/06/23 18:24:22 dsalt Exp $
+ * $Id: xine_buffer.h,v 1.7 2006/09/26 05:19:49 dgp85 Exp $
*
*
* generic dynamic buffer functions. The goals
@@ -64,40 +64,40 @@
* chunk_size bytes. This will prevent permanent
* reallocation on slow growing buffers.
*/
-void *xine_buffer_init(int chunk_size);
+void *xine_buffer_init(int chunk_size) XINE_PROTECTED;
/*
* frees a buffer, the macro ensures, that a freed
* buffer pointer is set to NULL
*/
#define xine_buffer_free(buf) buf=_xine_buffer_free(buf)
-void *_xine_buffer_free(void *buf);
+void *_xine_buffer_free(void *buf) XINE_PROTECTED;
/*
* duplicates a buffer
*/
-void *xine_buffer_dup(const void *buf);
+void *xine_buffer_dup(const void *buf) XINE_PROTECTED;
/*
* will copy len bytes of data into buf at position index.
*/
#define xine_buffer_copyin(buf,i,data,len) \
buf=_xine_buffer_copyin(buf,i,data,len)
-void *_xine_buffer_copyin(void *buf, int index, const void *data, int len);
+void *_xine_buffer_copyin(void *buf, int index, const void *data, int len) XINE_PROTECTED;
/*
* will copy len bytes out of buf+index into data.
* no checks are made in data. It is treated as an ordinary
* user-malloced data chunk.
*/
-void xine_buffer_copyout(const void *buf, int index, void *data, int len);
+void xine_buffer_copyout(const void *buf, int index, void *data, int len) XINE_PROTECTED;
/*
* set len bytes in buf+index to b.
*/
#define xine_buffer_set(buf,i,b,len) \
buf=_xine_buffer_set(buf,i,b,len)
-void *_xine_buffer_set(void *buf, int index, uint8_t b, int len);
+void *_xine_buffer_set(void *buf, int index, uint8_t b, int len) XINE_PROTECTED;
/*
* concatenates given buf (which should contain a null terminated string)
@@ -105,26 +105,26 @@ void *_xine_buffer_set(void *buf, int index, uint8_t b, int len);
*/
#define xine_buffer_strcat(buf,data) \
buf=_xine_buffer_strcat(buf,data)
-void *_xine_buffer_strcat(void *buf, const char *data);
+void *_xine_buffer_strcat(void *buf, const char *data) XINE_PROTECTED;
/*
* copies given string to buf+index
*/
#define xine_buffer_strcpy(buf,index,data) \
buf=_xine_buffer_strcpy(buf,index,data)
-void *_xine_buffer_strcpy(void *buf, int index, const char *data);
+void *_xine_buffer_strcpy(void *buf, int index, const char *data) XINE_PROTECTED;
/*
* returns a pointer to the first occurence of ch.
* note, that the returned pointer cannot be used
* in any other xine_buffer_* functions.
*/
-char *xine_buffer_strchr(const void *buf, int ch);
+char *xine_buffer_strchr(const void *buf, int ch) XINE_PROTECTED;
/*
* get allocated memory size
*/
-int xine_buffer_get_size(const void *buf);
+int xine_buffer_get_size(const void *buf) XINE_PROTECTED;
/*
* ensures a specified buffer size if the user want to
@@ -133,6 +133,6 @@ int xine_buffer_get_size(const void *buf);
*/
#define xine_buffer_ensure_size(buf,data) \
buf=_xine_buffer_ensure_size(buf,data)
-void *_xine_buffer_ensure_size(void *buf, int size);
+void *_xine_buffer_ensure_size(void *buf, int size) XINE_PROTECTED;
#endif
diff --git a/src/xine-utils/xmllexer.h b/src/xine-utils/xmllexer.h
index abc0189e9..bd69204ff 100644
--- a/src/xine-utils/xmllexer.h
+++ b/src/xine-utils/xmllexer.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: xmllexer.h,v 1.6 2006/02/14 02:25:01 dsalt Exp $
+ * $Id: xmllexer.h,v 1.7 2006/09/26 05:19:49 dgp85 Exp $
*
*/
@@ -48,8 +48,8 @@
/* public functions */
-void lexer_init(const char * buf, int size);
-int lexer_get_token(char * tok, int tok_size);
-char *lexer_decode_entities (const char *tok);
+void lexer_init(const char * buf, int size) XINE_PROTECTED;
+int lexer_get_token(char * tok, int tok_size) XINE_PROTECTED;
+char *lexer_decode_entities (const char *tok) XINE_PROTECTED;
#endif
diff --git a/src/xine-utils/xmlparser.h b/src/xine-utils/xmlparser.h
index 35155fa79..a19c81ec3 100644
--- a/src/xine-utils/xmlparser.h
+++ b/src/xine-utils/xmlparser.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: xmlparser.h,v 1.4 2006/02/14 02:25:01 dsalt Exp $
+ * $Id: xmlparser.h,v 1.5 2006/09/26 05:19:49 dgp85 Exp $
*
*/
#ifndef XML_PARSER_H
@@ -48,17 +48,17 @@ typedef struct xml_node_s {
struct xml_node_s *next;
} xml_node_t;
-void xml_parser_init(const char * buf, int size, int mode);
+void xml_parser_init(const char * buf, int size, int mode) XINE_PROTECTED;
-int xml_parser_build_tree(xml_node_t **root_node);
+int xml_parser_build_tree(xml_node_t **root_node) XINE_PROTECTED;
-void xml_parser_free_tree(xml_node_t *root_node);
+void xml_parser_free_tree(xml_node_t *root_node) XINE_PROTECTED;
-char *xml_parser_get_property (const xml_node_t *node, const char *name);
+char *xml_parser_get_property (const xml_node_t *node, const char *name) XINE_PROTECTED;
int xml_parser_get_property_int (const xml_node_t *node, const char *name,
- int def_value);
+ int def_value) XINE_PROTECTED;
int xml_parser_get_property_bool (const xml_node_t *node, const char *name,
- int def_value);
+ int def_value) XINE_PROTECTED;
/* for output:
* returns an escaped string (free() it when done)
@@ -70,12 +70,12 @@ typedef enum {
XML_ESCAPE_SINGLE_QUOTE,
XML_ESCAPE_DOUBLE_QUOTE
} xml_escape_quote_t;
-char *xml_escape_string (const char *s, xml_escape_quote_t quote_type);
+char *xml_escape_string (const char *s, xml_escape_quote_t quote_type) XINE_PROTECTED;
/* for debugging purposes: dump read-in xml tree in a nicely
* indented fashion
*/
-void xml_parser_dump_tree (const xml_node_t *node) ;
+void xml_parser_dump_tree (const xml_node_t *node) XINE_PROTECTED;
#endif
generated by cgit v1.2.3 (git 2.25.1) at 2025-04-26 06:09:42 +0000