sir_queue_node     38 src/libsir/include/sir/queue.h sir_queue_node* _sir_queue_node_create(void* data);
sir_queue_node     42 src/libsir/include/sir/queue.h bool _sir_queue_node_destroy(sir_queue_node** node, void** data);
sir_queue_node    392 src/libsir/include/sir/types.h     sir_queue_node* head; /**< The first node in the linked list. */
sir_queue_node     36 src/libsir/src/sirqueue.c sir_queue_node* _sir_queue_node_create(void* data) {
sir_queue_node     37 src/libsir/src/sirqueue.c     sir_queue_node* retval = calloc(1, sizeof(sir_queue_node));
sir_queue_node     46 src/libsir/src/sirqueue.c bool _sir_queue_node_destroy(sir_queue_node** node, void** data) {
sir_queue_node     75 src/libsir/src/sirqueue.c         sir_queue_node* next = (*q)->head;
sir_queue_node     77 src/libsir/src/sirqueue.c             sir_queue_node* this_node = next;
sir_queue_node     95 src/libsir/src/sirqueue.c     sir_queue_node* next = q->head->next;
sir_queue_node    117 src/libsir/src/sirqueue.c             sir_queue_node* next = q->head;
sir_queue_node    138 src/libsir/src/sirqueue.c         sir_queue_node* old_head = q->head;