8   struct list_node_t *next;  member
98   node->next = prev_node->next;  in list_insert_after()
100   prev_node->next = node;  in list_insert_after()
114   node->next = list->head;  in list_prepend()
130   node->next = NULL;  in list_append()
136     list->tail->next = node;  in list_append()
151     list_node_t *next = list_free_node_(list, list->head);  in list_remove()  local
153       list->tail = next;  in list_remove()
154     list->head = next;  in list_remove()
158 …or (list_node_t *prev = list->head, *node = list->head->next; node; prev = node, node = node->next)  in list_remove()
160       prev->next = list_free_node_(list, node);  in list_remove()
183     list_node_t *next = node->next;  in list_foreach()  local
186     node = next;  in list_foreach()
203   return node->next;  in list_next()
215   list_node_t *next = node->next;  in list_free_node_()  local
222   return next;  in list_free_node_()