46 #define	list_empty(a) ((a)->list_head.list_next == &(a)->list_head)
78 	list->list_head.list_next = list->list_head.list_prev =  in list_create()
79 	    &list->list_head;  in list_create()
85 	list_node_t *node = &list->list_head;  in list_destroy()
88 	ASSERT(list->list_head.list_next == node);  in list_destroy()
89 	ASSERT(list->list_head.list_prev == node);  in list_destroy()
119 	list_node_t *lold = &list->list_head;  in list_insert_head()
126 	list_node_t *lold = &list->list_head;  in list_insert_tail()
142 	list_node_t *head = list->list_head.list_next;  in list_remove_head()
143 	if (head == &list->list_head)  in list_remove_head()
152 	list_node_t *tail = list->list_head.list_prev;  in list_remove_tail()
153 	if (tail == &list->list_head)  in list_remove_tail()
160 list_head(list_t *list)  in list_head()  function
164 	return (list_object(list, list->list_head.list_next));  in list_head()
172 	return (list_object(list, list->list_head.list_prev));  in list_tail()
180 	if (node->list_next != &list->list_head)  in list_next()
191 	if (node->list_prev != &list->list_head)  in list_prev()
203 	list_node_t *dstnode = &dst->list_head;  in list_move_tail()
204 	list_node_t *srcnode = &src->list_head;  in list_move_tail()