coap_list.h File Reference

Go to the source code of this file.

Data Structures
struct	coap_linkedlistnode

Typedefs
typedef struct coap_linkedlistnode	coap_list_t

Functions
int	coap_insert (coap_list_t **queue, coap_list_t *node, int(*order)(void *, void *))
	Adds node to given queue, ordered by specified order function. More...
int	coap_delete (coap_list_t *node)
void	coap_delete_list (coap_list_t *queue)
coap_list_t *	coap_new_listnode (void *data, void(*delete_func)(void *))
	Creates a new list node and adds the given data object. More...

Typedef Documentation

typedef struct coap_linkedlistnode coap_list_t

Definition at line 23 of file coap_list.h.

Function Documentation

int coap_delete

(

coap_list_t *

node

)

Definition at line 52 of file coap_list.c.

void coap_delete_list

(

coap_list_t *

queue

)

Definition at line 65 of file coap_list.c.

int coap_insert	(	coap_list_t **	queue,
		coap_list_t *	node,
		int(*)(void *, void *)	order
	)

Adds node to given queue, ordered by specified order function.

Returns 1 when insert was successful, 0 otherwise.

coap_list_t* coap_new_listnode	(	void *	data,
		void(*)(void *)	delete_func
	)

Creates a new list node and adds the given data object.

The memory allocated by data will be released by coap_delete() with the new node. Returns the new list node.

Definition at line 74 of file coap_list.c.