21 	q->head = q->tail = NULL;  in queue_create()
40 	if (q->head == NULL) {  in queue_insert()
41 		q->head = q->tail = newnode;  in queue_insert()
64 	if (q->head == NULL) {  in queue_push()
65 		q->head = q->tail = newnode;  in queue_push()
67 		newnode->next = q->head;  in queue_push()
68 		q->head = newnode;  in queue_push()
82 	if (q->head == NULL)  in queue_remove()
85 	node = q->head;  in queue_remove()
86 	q->head = q->head->next;  in queue_remove()
87 	if (q->head == NULL)  in queue_remove()
101 	if (q->head == NULL)  in queue_head()
104 	return q->head->element;  in queue_head()
114 	p = q->head;  in queue_destroy()
132 	p = q->head;  in queue_map()
153 	p = q->head;  in queue_map_remove_on_error()
162 				q->head = p->next;  in queue_map_remove_on_error()
163 				if (q->head == NULL)  in queue_map_remove_on_error()