33 	node->prev = node;  in list_node_init()
46 	node->prev = list->prev;  in list_node_append()
47 	list->prev->next = node;  in list_node_append()
48 	list->prev = node;  in list_node_append()
54 	if (node->prev == node || node->next == node)  in list_node_remove()
57 	node->prev->next = node->next;  in list_node_remove()
58 	node->next->prev = node->prev;  in list_node_remove()
71 	node->prev = list;  in list_node_insert_after()
73 	list->next->prev = node;  in list_node_insert_after()
86 	node->prev = list->prev;  in list_node_insert_before()
87 	list->prev->next = node;  in list_node_insert_before()
88 	list->prev = node;  in list_node_insert_before()
101 	list1->prev->next = list2;  in list_node_append_list()
102 	list2->prev->next = list1;  in list_node_append_list()
105 	list1_last = list1->prev;  in list_node_append_list()
107 	list1->prev = list2->prev;  in list_node_append_list()
108 	list2->prev = list1_last;  in list_node_append_list()
268 	return container_of(curr->node.prev, struct kmod_list, node);  in kmod_list_prev()
313 	return container_of(list->node.prev, struct kmod_list, node);  in kmod_list_last()