8     struct list_node_t *next;  member
123     node->next = prev_node->next;  in list_insert_after()
125     prev_node->next = node;  in list_insert_after()
142     node->next = list->head;  in list_prepend()
161     node->next = NULL;  in list_append()
167         list->tail->next = node;  in list_append()
184         list_node_t *next = list_free_node(list, list->head);  in list_remove()  local
186             list->tail = next;  in list_remove()
188         list->head = next;  in list_remove()
192 …or (list_node_t *prev = list->head, *node = list->head->next; node; prev = node, node = node->next)  in list_remove()
194             prev->next = list_free_node(list, node);  in list_remove()
214         list_node_t *next = list_delete_node(list, list->head);  in list_delete()  local
216             list->tail = next;  in list_delete()
218         list->head = next;  in list_delete()
222 …or (list_node_t *prev = list->head, *node = list->head->next; node; prev = node, node = node->next)  in list_delete()
224             prev->next = list_delete_node(list, node);  in list_delete()
251     list_node_t *next = node->next;  in list_foreach()  local
255     node = next;  in list_foreach()
275     return node->next;  in list_next()
289     list_node_t *next = node->next;  in list_free_node()  local
297     return next;  in list_free_node()
306     list_node_t *next = node->next;  in list_delete_node()  local
311     return next;  in list_delete_node()