490 free_node_list(struct node_list **headp)  in free_node_list()  argument
494 	while (*headp) {  in free_node_list()
495 		tmp = *headp;  in free_node_list()
496 		*headp = (*headp)->next;  in free_node_list()
502 append_node_list(struct node_list **headp, struct node_list *list)  in append_node_list()  argument
506 	if (*headp == NULL) {  in append_node_list()
507 		*headp = list;  in append_node_list()
514 	tmp = *headp;  in append_node_list()
522 prepend_node_list(struct node_list **headp, struct node_list *list)  in prepend_node_list()  argument
529 	tmp = *headp;  in prepend_node_list()
530 	*headp = list;  in prepend_node_list()
567 insert_node_list(struct node_list **headp, struct node_list *list,  in insert_node_list()  argument
575 	tmp = *headp;  in insert_node_list()
577 		*headp = list;  in insert_node_list()
582 		prepend_node_list(headp, list);  in insert_node_list()
595 	append_node_list(headp, tmp1);  in insert_node_list()
642 prune_sib(struct node_list **headp)  in prune_sib()  argument
650 	if ((parent = di_parent_node((*headp)->node)) == DI_NODE_NIL) {  in prune_sib()
657 		if ((*headp)->next)  in prune_sib()
660 		free(*headp);  in prune_sib()
661 		*headp = NULL;  in prune_sib()
674 	prev = *headp;  in prune_sib()
694 	curr = *headp;  in prune_sib()
695 	*headp = curr->next;  in prune_sib()
705 update_node_list(int action, uint_t flag, struct node_list **headp)  in update_node_list()  argument
708 	di_node_t parent = di_parent_node((*headp)->node);  in update_node_list()
716 		free_node_list(headp);  in update_node_list()
723 		children = get_children((*headp)->node);  in update_node_list()
724 		prune_sib(headp);  in update_node_list()
732 		tmp = *headp;  in update_node_list()
733 		*headp = tmp->next;  in update_node_list()
742 		children = get_children((*headp)->node);  in update_node_list()
743 		tmp = *headp;  in update_node_list()
744 		*headp = tmp->next;  in update_node_list()
754 		prepend_node_list(headp, children);  in update_node_list()
758 		append_node_list(headp, children);  in update_node_list()
763 		insert_node_list(headp, children, parent);  in update_node_list()
774 walk_one_node(struct node_list **headp, uint_t flag, void *arg,  in walk_one_node()  argument
777 	DPRINTF((DI_TRACE, "Walking node %s\n", di_node_name((*headp)->node)));  in walk_one_node()
779 	update_node_list(callback((*headp)->node, arg),  in walk_one_node()
780 	    flag & DI_WALK_MASK, headp);  in walk_one_node()
820 walk_one_minor_list(struct node_list **headp, const char *desired_type,  in walk_one_minor_list()  argument
827 	di_node_t node = (*headp)->node;  in walk_one_minor_list()
851 	update_node_list(action, DI_WALK_LINKGEN, headp);  in walk_one_minor_list()
3581 walk_one_link(struct node_list **headp, uint_t ep,  in walk_one_link()  argument
3586 	di_node_t	node = (*headp)->node;  in walk_one_link()
3595 	update_node_list(action, DI_WALK_LINKGEN, headp);  in walk_one_link()
3646 walk_one_lnode(struct node_list **headp, void *arg,  in walk_one_lnode()  argument
3651 	di_node_t	node = (*headp)->node;  in walk_one_lnode()
3660 	update_node_list(action, DI_WALK_LINKGEN, headp);  in walk_one_lnode()