µEvLoop
A fast and lightweight event loop aimed at embedded platforms in C99.
|
Go to the documentation of this file.
6 #ifndef UEL_LINKED_LIST_H
7 #define UEL_LINKED_LIST_H
123 void uel_llist_insert_at(uel_llist_t *list, uel_llist_node_t *node, uel_closure_t *should_insert);
uel_llist_node_t * uel_llist_pop_head(uel_llist_t *list)
Pops a node from the head of the list.
bool uel_llist_remove(uel_llist_t *list, uel_llist_node_t *node)
Removes a node from the queue.
void uel_llist_push_tail(uel_llist_t *list, uel_llist_node_t *node)
Pushes a node to the tail of the list.
uel_llist_node_t * next
The next node in the list.
Definition: linked-list.h:22
uel_llist_node_t * tail
A pointer to the tail of the list. Is NULL when the list is empty.
Definition: linked-list.h:33
Defines closures, objects that bind functions to creating and calling contexts.
uel_llist_t uel_llist_remove_while(uel_llist_t *list, uel_closure_t *should_remove)
Splits a list in two. The rupture point is determined by the supplied closure.
uel_llist_node_t * uel_llist_peek_head(uel_llist_t *list)
Peeks the element at the head of the list.
uel_llist_node_t * head
A pointer to the head of the list. Is NULL when the list is empty.
Definition: linked-list.h:31
uel_llist_node_t * uel_llist_pop_tail(uel_llist_t *list)
Pops a node from the tail of the list.
void uel_llist_insert_at(uel_llist_t *list, uel_llist_node_t *node, uel_closure_t *should_insert)
Scans a list until it finds a suitable spot to insert the provided node.
void * value
The value of the node, as a void pointer.
Definition: linked-list.h:20
void uel_llist_init(uel_llist_t *list)
Initialised a linked list.
uel_llist_node_t * uel_llist_peek_tail(uel_llist_t *list)
Peeks the element at the tail of the list.
Defines a linked list. If it is empty, head == tail == NULL. Pushing or popping from both the head or...
Definition: linked-list.h:29
void uel_llist_push_head(uel_llist_t *list, uel_llist_node_t *node)
Pushes a node to the head of the list.
uintptr_t count
The count of enqueued nodes.
Definition: linked-list.h:35
Defines a node of the linked list. Holds a void pointer.
Definition: linked-list.h:18