62   for (const list_node_t *node = list_begin(list); node != list_end(list); node = list_next(node)) {  in list_contains()  local
63     if (list_node(node) == data) {  in list_contains()
76   for (list_node_t *node = list_begin(list); node != list_end(list); node = list_next(node)) {  in list_get_node()  local
77     if (list_node(node) == data) {  in list_get_node()
78       p_node_ret = node;  in list_get_node()
118     list_node_t *node = (list_node_t *)osi_calloc(sizeof(list_node_t));  in list_insert_after()  local
119     if (!node) {  in list_insert_after()
123     node->next = prev_node->next;  in list_insert_after()
124     node->data = data;  in list_insert_after()
125     prev_node->next = node;  in list_insert_after()
127         list->tail = node;  in list_insert_after()
137     list_node_t *node = (list_node_t *)osi_calloc(sizeof(list_node_t));  in list_prepend()  local
138     if (!node) {  in list_prepend()
142     node->next = list->head;  in list_prepend()
143     node->data = data;  in list_prepend()
144     list->head = node;  in list_prepend()
156     list_node_t *node = (list_node_t *)osi_calloc(sizeof(list_node_t));  in list_append()  local
157     if (!node) {  in list_append()
161     node->next = NULL;  in list_append()
162     node->data = data;  in list_append()
164         list->head = node;  in list_append()
165         list->tail = node;  in list_append()
167         list->tail->next = node;  in list_append()
168         list->tail = node;  in list_append()
192 …for (list_node_t *prev = list->head, *node = list->head->next; node; prev = node, node = node->nex…  in list_remove()  local
193         if (node->data == data) {  in list_remove()
194             prev->next = list_free_node(list, node);  in list_remove()
195             if (list->tail == node) {  in list_remove()
222 …for (list_node_t *prev = list->head, *node = list->head->next; node; prev = node, node = node->nex…  in list_delete()  local
223         if (node->data == data) {  in list_delete()
224             prev->next = list_delete_node(list, node);  in list_delete()
225             if (list->tail == node) {  in list_delete()
237     for (list_node_t *node = list->head; node; ) {  in list_clear()  local
238         node = list_free_node(list, node);  in list_clear()
250   for (list_node_t *node = list->head; node; ) {  in list_foreach()  local
251     list_node_t *next = node->next;  in list_foreach()
252     if (!callback(node->data, context)) {  in list_foreach()
253       return node;  in list_foreach()
255     node = next;  in list_foreach()
272 list_node_t *list_next(const list_node_t *node)  in list_next()  argument
274     assert(node != NULL);  in list_next()
275     return node->next;  in list_next()
278 void *list_node(const list_node_t *node)  in list_node()  argument
280     assert(node != NULL);  in list_node()
281     return node->data;  in list_node()
284 list_node_t *list_free_node(list_t *list, list_node_t *node)  in list_free_node()  argument
287     assert(node != NULL);  in list_free_node()
289     list_node_t *next = node->next;  in list_free_node()
292         list->free_cb(node->data);  in list_free_node()
294     osi_free(node);  in list_free_node()
301 list_node_t *list_delete_node(list_t *list, list_node_t *node)  in list_delete_node()  argument
304     assert(node != NULL);  in list_delete_node()
306     list_node_t *next = node->next;  in list_delete_node()
308     osi_free(node);  in list_delete_node()