Cross Reference: /illumos-gate/usr/src/lib/libdevinfo/devinfo.c

Lines Matching defs:headp
488 free_node_list(struct node_list **headp)
492 	while (*headp) {
493 		tmp = *headp;
494 		*headp = (*headp)->next;
500 append_node_list(struct node_list **headp, struct node_list *list)
504 	if (*headp == NULL) {
505 		*headp = list;
512 	tmp = *headp;
520 prepend_node_list(struct node_list **headp, struct node_list *list)
527 	tmp = *headp;
528 	*headp = list;
565 insert_node_list(struct node_list **headp, struct node_list *list,
573 	tmp = *headp;
575 		*headp = list;
580 		prepend_node_list(headp, list);
593 	append_node_list(headp, tmp1);
640 prune_sib(struct node_list **headp)
648 	if ((parent = di_parent_node((*headp)->node)) == DI_NODE_NIL) {
655 		if ((*headp)->next)
658 		free(*headp);
659 		*headp = NULL;
672 	prev = *headp;
692 	curr = *headp;
693 	*headp = curr->next;
703 update_node_list(int action, uint_t flag, struct node_list **headp)
706 	di_node_t parent = di_parent_node((*headp)->node);
714 		free_node_list(headp);
721 		children = get_children((*headp)->node);
722 		prune_sib(headp);
730 		tmp = *headp;
731 		*headp = tmp->next;
740 		children = get_children((*headp)->node);
741 		tmp = *headp;
742 		*headp = tmp->next;
752 		prepend_node_list(headp, children);
756 		append_node_list(headp, children);
761 		insert_node_list(headp, children, parent);
772 walk_one_node(struct node_list **headp, uint_t flag, void *arg,
775 	DPRINTF((DI_TRACE, "Walking node %s\n", di_node_name((*headp)->node)));
777 	update_node_list(callback((*headp)->node, arg),
778 	    flag & DI_WALK_MASK, headp);
812  *   on node_list headp, and place children of first node on the list.
818 walk_one_minor_list(struct node_list **headp, const char *desired_type,
825 	di_node_t node = (*headp)->node;
849 	update_node_list(action, DI_WALK_LINKGEN, headp);
3573  *   on node_list headp, and place children of first node on the list.
3579 walk_one_link(struct node_list **headp, uint_t ep,
3584 	di_node_t	node = (*headp)->node;
3593 	update_node_list(action, DI_WALK_LINKGEN, headp);
3638  *   on node_list headp, and place children of first node on the list.
3644 walk_one_lnode(struct node_list **headp, void *arg,
3649 	di_node_t	node = (*headp)->node;
3658 	update_node_list(action, DI_WALK_LINKGEN, headp);