38 #define	list_empty(a) ((a)->list_head.next == &(a)->list_head)
43 	lnew->next = (node)->next;		\
44 	(node)->next->prev = lnew;		\
45 	(node)->next = lnew;			\
50 	lnew->next = (node);			\
52 	(node)->prev->next = lnew;		\
57 	(node)->prev->next = (node)->next;	\
58 	(node)->next->prev = (node)->prev;	\
59 	(node)->next = (node)->prev = NULL
71 	list->list_head.next = list->list_head.prev = &list->list_head;  in list_create()
80 	ASSERT(list->list_head.next == node);  in list_destroy()
83 	node->next = node->prev = NULL;  in list_destroy()
127 	ASSERT(lold->next != NULL);  in list_remove()
134 	list_node_t *head = list->list_head.next;  in list_remove_head()
156 	return (list_object(list, list->list_head.next));  in list_head()
172 	if (node->next != &list->list_head)  in list_next()
173 		return (list_object(list, node->next));  in list_next()
203 	dstnode->prev->next = srcnode->next;  in list_move_tail()
204 	srcnode->next->prev = dstnode->prev;  in list_move_tail()
206 	srcnode->prev->next = dstnode;  in list_move_tail()
209 	srcnode->next = srcnode->prev = srcnode;  in list_move_tail()
218 	lnew->next = lold->next;  in list_link_replace()
220 	lold->prev->next = lnew;  in list_link_replace()
221 	lold->next->prev = lnew;  in list_link_replace()
222 	lold->next = lold->prev = NULL;  in list_link_replace()
228 	ln->next = NULL;  in list_link_init()
235 	EQUIV(ln->next == NULL, ln->prev == NULL);  in list_link_active()
236 	return (ln->next != NULL);  in list_link_active()