head 392 src/libsir/include/sir/types.h sir_queue_node* head; /**< The first node in the linked list. */ head 75 src/libsir/src/sirqueue.c sir_queue_node* next = (*q)->head; head 95 src/libsir/src/sirqueue.c sir_queue_node* next = q->head->next; head 106 src/libsir/src/sirqueue.c return !q || !q->head; head 113 src/libsir/src/sirqueue.c if (!q->head) { head 114 src/libsir/src/sirqueue.c q->head = _sir_queue_node_create(data); head 115 src/libsir/src/sirqueue.c retval = NULL != q->head; head 117 src/libsir/src/sirqueue.c sir_queue_node* next = q->head; head 138 src/libsir/src/sirqueue.c sir_queue_node* old_head = q->head; head 139 src/libsir/src/sirqueue.c q->head = old_head->next;