Searched refs:prev_node (Results 1 – 4 of 4) sorted by relevance
114 bool list_insert_after(list_t *list, list_node_t *prev_node, void *data) { in list_insert_after() argument116 assert(prev_node != NULL); in list_insert_after()123 node->next = prev_node->next; in list_insert_after()125 prev_node->next = node; in list_insert_after()126 if (list->tail == prev_node) { in list_insert_after()
413 genie_snode_t *prev_node, in genie_slist_remove() argument416 if (!prev_node) { in genie_slist_remove()424 prev_node->next = node->next; in genie_slist_remove()428 list->tail = prev_node; in genie_slist_remove()
413 sys_snode_t *prev_node, in sys_slist_remove() argument416 if (!prev_node) { in sys_slist_remove()424 prev_node->next = node->next; in sys_slist_remove()428 list->tail = prev_node; in sys_slist_remove()
62 bool list_insert_after(list_t *list, list_node_t *prev_node, void *data);
