SIP Witch 1.9.15
|
oSIP list Routines More...
Go to the source code of this file.
Data Structures | |
struct | __node |
Structure for referencing a node in a osip_list_t element. More... | |
struct | osip_list_iterator_t |
struct | osip_list |
Structure for referencing a list of elements. More... | |
Macros | |
#define | osip_list_iterator_has_elem(it) ( 0 != (it).actual && (it).pos < (it).li->nb_elt ) |
Check current iterator state. More... | |
Typedefs | |
typedef struct __node | __node_t |
Structure for referencing a node in a osip_list_t element. More... | |
typedef struct osip_list | osip_list_t |
Structure for referencing a list of elements. More... | |
Functions | |
int | osip_list_init (osip_list_t *li) |
Initialise a osip_list_t element. More... | |
void | osip_list_special_free (osip_list_t *li, void(*free_func)(void *)) |
Free a list of element. More... | |
int | osip_list_clone (const osip_list_t *src, osip_list_t *dst, int(*clone_func)(void *, void **)) |
Clone a list of element. More... | |
void | osip_list_ofchar_free (osip_list_t *li) |
Free a list of element where elements are pointer to 'char'. More... | |
int | osip_list_size (const osip_list_t *li) |
Get the size of a list of element. More... | |
int | osip_list_eol (const osip_list_t *li, int pos) |
Check if the end of list is detected . More... | |
int | osip_list_add (osip_list_t *li, void *element, int pos) |
Add an element in a list. More... | |
void * | osip_list_get (const osip_list_t *li, int pos) |
Get an element from a list. More... | |
int | osip_list_remove (osip_list_t *li, int pos) |
Remove an element from a list. More... | |
void * | osip_list_get_first (const osip_list_t *li, osip_list_iterator_t *it) |
Get first iterator from list. More... | |
void * | osip_list_get_next (osip_list_iterator_t *it) |
GEt next iterator. More... | |
void * | osip_list_iterator_remove (osip_list_iterator_t *it) |
Remove current iterator. More... | |
oSIP list Routines
This is a simple implementation of a linked list.
Definition in file osip_list.h.