Searched refs:prev_node (Results 1 – 3 of 3) sorted by relevance
89 bool list_insert_after(list_t* list, list_node_t* prev_node, void* data) { in list_insert_after() argument91 CHECK(prev_node != NULL); in list_insert_after()97 node->next = prev_node->next; in list_insert_after()99 prev_node->next = node; in list_insert_after()100 if (list->tail == prev_node) list->tail = node; in list_insert_after()
142 struct ufdt_node **prev_node, struct ufdt_node_pool *node_pool) { in ufdt_combine_fixup() argument184 if (*prev_node != NULL) { in ufdt_combine_fixup()185 ufdt_node_merge_into(*prev_node, target_node, node_pool); in ufdt_combine_fixup()187 *prev_node = target_node; in ufdt_combine_fixup()
78 bool list_insert_after(list_t* list, list_node_t* prev_node, void* data);