8   struct list_node_t* next;  member
97   node->next = prev_node->next;  in list_insert_after()
99   prev_node->next = node;  in list_insert_after()
111   node->next = list->head;  in list_prepend()
125   node->next = NULL;  in list_append()
131     list->tail->next = node;  in list_append()
145     list_node_t* next = list_free_node_(list, list->head);  in list_remove()  local
146     if (list->tail == list->head) list->tail = next;  in list_remove()
147     list->head = next;  in list_remove()
151   for (list_node_t *prev = list->head, *node = list->head->next; node;  in list_remove()
152        prev = node, node = node->next)  in list_remove()
154       prev->next = list_free_node_(list, node);  in list_remove()
177     list_node_t* next = node->next;  in list_foreach()  local
179     node = next;  in list_foreach()
196   return node->next;  in list_next()
208   list_node_t* next = node->next;  in list_free_node_()  local
214   return next;  in list_free_node_()