13     list_node_t *head;  member
30     list->head = list->tail = NULL;  in list_new_internal()
97     return list->head->data;  in list_front()
142     node->next = list->head;  in list_prepend()
144     list->head = node;  in list_prepend()
146         list->tail = list->head;  in list_prepend()
164         list->head = node;  in list_append()
183     if (list->head->data == data) {  in list_remove()
184         list_node_t *next = list_free_node(list, list->head);  in list_remove()
185         if (list->tail == list->head) {  in list_remove()
188         list->head = next;  in list_remove()
192 …for (list_node_t *prev = list->head, *node = list->head->next; node; prev = node, node = node->nex…  in list_remove()
213     if (list->head->data == data) {  in list_delete()
214         list_node_t *next = list_delete_node(list, list->head);  in list_delete()
215         if (list->tail == list->head) {  in list_delete()
218         list->head = next;  in list_delete()
222 …for (list_node_t *prev = list->head, *node = list->head->next; node; prev = node, node = node->nex…  in list_delete()
237     for (list_node_t *node = list->head; node; ) {  in list_clear()
240     list->head = NULL;  in list_clear()
250   for (list_node_t *node = list->head; node; ) {  in list_foreach()
263     return list->head;  in list_begin()