43 	lnew->prev = (node);			\
45 	(node)->next->prev = lnew;		\
52 	lnew->prev = (node)->prev;		\
53 	(node)->prev->next = lnew;		\
54 	(node)->prev = lnew;			\
58 	(node)->prev->next = (node)->next;	\
59 	(node)->next->prev = (node)->prev;	\
60 	(node)->next = (node)->prev = NULL
72 	list->list_head.next = list->list_head.prev = &list->list_head;  in list_create()
82 	ASSERT(list->list_head.prev == node);  in list_destroy()
84 	node->next = node->prev = NULL;  in list_destroy()
145 	list_node_t *tail = list->list_head.prev;  in list_remove_tail()
165 	return (list_object(list, list->list_head.prev));  in list_tail()
184 	if (node->prev != &list->list_head)  in list_prev()
185 		return (list_object(list, node->prev));  in list_prev()
204 	dstnode->prev->next = srcnode->next;  in list_move_tail()
205 	srcnode->next->prev = dstnode->prev;  in list_move_tail()
206 	dstnode->prev = srcnode->prev;  in list_move_tail()
207 	srcnode->prev->next = dstnode;  in list_move_tail()
210 	srcnode->next = srcnode->prev = srcnode;  in list_move_tail()
220 	lnew->prev = lold->prev;  in list_link_replace()
221 	lold->prev->next = lnew;  in list_link_replace()
222 	lold->next->prev = lnew;  in list_link_replace()
223 	lold->next = lold->prev = NULL;  in list_link_replace()
230 	ln->prev = NULL;  in list_link_init()
236 	EQUIV(ln->next == NULL, ln->prev == NULL);  in list_link_active()