589 	cache_minor_t *cmnp;  in read_minors()  local
608 		cmnp = minor_insert(hdp, pcnp, name, nodetype, NULL);  in read_minors()
609 		if (cmnp == NULL) {  in read_minors()
615 		    cmnp->name);  in read_minors()
617 		if (read_links(hdp, cmnp, dmp->link) != 0) {  in read_minors()
860 	cache_minor_t *cmnp,  in write_minors()  argument
871 		    cmnp ? cmnp->name : "<NULL>");  in write_minors()
876 	for (; cmnp != NULL; cmnp = cmnp->sib) {  in write_minors()
878 		assert(cmnp->name != NULL);  in write_minors()
886 		dmp->name = write_string(hdp, cmnp->name, next);  in write_minors()
887 		dmp->nodetype = write_string(hdp, cmnp->nodetype, next);  in write_minors()
901 		    cmnp->name);  in write_minors()
903 		if (write_links(hdp, dmp, cmnp->link, next) != 0) {  in write_minors()
908 	return (cmnp ? -1 : 0);  in write_minors()
1108 	cache_minor_t *cmnp;  in subtree_free()  local
1120 		cmnp = (*pp)->minor;  in subtree_free()
1121 		(*pp)->minor = cmnp->sib;  in subtree_free()
1123 		while (cmnp->link != NULL) {  in subtree_free()
1124 			clp = cmnp->link;  in subtree_free()
1125 			cmnp->link = clp->sib;  in subtree_free()
1129 		minor_free(hdp, &cmnp);  in subtree_free()
1287 	cache_minor_t *cmnp;  in resolve_dangling_links()  local
1292 		if ((cmnp = link2minor(hdp, clp)) != NULL) {  in resolve_dangling_links()
1294 			clp->sib = cmnp->link;  in resolve_dangling_links()
1295 			cmnp->link = clp;  in resolve_dangling_links()
1297 			clp->minor = cmnp;  in resolve_dangling_links()
1327 	cache_minor_t *cmnp = *pp;  in minor_free()  local
1331 	if (cmnp == NULL)  in minor_free()
1334 	if (CACHE_LAST(hdp) == cmnp) {  in minor_free()
1335 		dprintf(DBG_STEP, "minor_free: last_minor(%s)\n", cmnp->name);  in minor_free()
1339 	free(cmnp->name);  in minor_free()
1340 	free(cmnp->nodetype);  in minor_free()
1341 	free(cmnp);  in minor_free()
1499 	cache_minor_t *cmnp;  in get_last_minor()  local
1513 	cmnp = CACHE_LAST(hdp);  in get_last_minor()
1514 	if (strcmp(cmnp->name, minor_name) == 0 && cmnp->node &&  in get_last_minor()
1515 	    strcmp(cmnp->node->path, devfs_path) == 0) {  in get_last_minor()
1516 		return (cmnp);  in get_last_minor()
1519 	cmnp = cmnp->sib;  in get_last_minor()
1520 	if (cmnp && strcmp(cmnp->name, minor_name) == 0 && cmnp->node &&  in get_last_minor()
1521 	    strcmp(cmnp->node->path, devfs_path) == 0) {  in get_last_minor()
1522 		set_last_minor(hdp, cmnp, TYPE_CACHE);  in get_last_minor()
1523 		return (cmnp);  in get_last_minor()
1530 set_last_minor(struct di_devlink_handle *hdp, cache_minor_t *cmnp, int flags)  in set_last_minor()  argument
1540 	if (LOOKUP_CACHE(flags) && cmnp) {  in set_last_minor()
1541 		CACHE_LAST(hdp) = cmnp;  in set_last_minor()
1642 minor_delete(di_devlink_handle_t hdp, cache_minor_t *cmnp)  in minor_delete()  argument
1648 	(void) dprintf(DBG_STEP, "%s: removing minor: %s\n", fcn, cmnp->name);  in minor_delete()
1651 	if (cmnp->node != NULL) {  in minor_delete()
1652 		mpp = &cmnp->node->minor;  in minor_delete()
1654 			if (*mpp == cmnp)  in minor_delete()
1660 			    fcn, cmnp->name);  in minor_delete()
1662 			*mpp = cmnp->sib;  in minor_delete()
1666 		    cmnp->name);  in minor_delete()
1669 	delete_unused_nodes(hdp, cmnp->node);  in minor_delete()
1671 	cmnp->node = NULL;  in minor_delete()
1672 	cmnp->sib = NULL;  in minor_delete()
1675 	for (lpp = &cmnp->link; *lpp != NULL; lpp = &(*lpp)->sib) {  in minor_delete()
1679 	CACHE(hdp)->dngl = cmnp->link;  in minor_delete()
1680 	cmnp->link = NULL;  in minor_delete()
1682 	minor_free(hdp, &cmnp);  in minor_delete()
1797 delete_unused_minor(di_devlink_handle_t hdp, cache_minor_t *cmnp)  in delete_unused_minor()  argument
1799 	if (cmnp == NULL)  in delete_unused_minor()
1802 	if (cmnp->link != NULL)  in delete_unused_minor()
1806 	    cmnp->name);  in delete_unused_minor()
1808 	minor_delete(hdp, cmnp);  in delete_unused_minor()
1830 	cache_minor_t *cmnp;  in add_link()  local
1859 		if ((cmnp = lookup_minor(hdp, minor_path, NULL,  in add_link()
1870 		cmnp = NULL;  in add_link()
1874 	return (link_insert(hdp, cmnp, link, content, attr));  in add_link()
2706 	cache_minor_t *cmnp;  in minor_insert()  local
2721 	if ((cmnp = calloc(1, sizeof (cache_minor_t))) == NULL) {  in minor_insert()
2726 	cmnp->name = strdup(name);  in minor_insert()
2727 	cmnp->nodetype = strdup(nodetype);  in minor_insert()
2728 	if (cmnp->name == NULL || cmnp->nodetype == NULL) {  in minor_insert()
2730 		free(cmnp->name);  in minor_insert()
2731 		free(cmnp->nodetype);  in minor_insert()
2732 		free(cmnp);  in minor_insert()
2736 	cmnp->node = pcnp;  in minor_insert()
2740 		cmnp->sib = pcnp->minor;  in minor_insert()
2741 		pcnp->minor = cmnp;  in minor_insert()
2744 		*prev = cmnp;  in minor_insert()
2747 	return (cmnp);  in minor_insert()
2753 	cache_minor_t *cmnp,  in link_insert()  argument
2781 	clp->minor = cmnp;  in link_insert()
2784 	if (cmnp != NULL) {  in link_insert()
2785 		clp->sib = cmnp->link;  in link_insert()
2786 		cmnp->link = clp;  in link_insert()
2983 	cache_minor_t *cmnp;  in count_node()  local
2991 	for (cmnp = cnp->minor; cmnp != NULL; cmnp = cmnp->sib) {  in count_node()
2992 		count_minor(cmnp, count);  in count_node()
3002 count_minor(cache_minor_t *cmnp, uint32_t *count)  in count_minor()  argument
3006 	if (cmnp == NULL)  in count_minor()
3010 	count_string(cmnp->name, count);  in count_minor()
3011 	count_string(cmnp->nodetype, count);  in count_minor()
3013 	for (clp = cmnp->link; clp != NULL; clp = clp->sib) {  in count_minor()
3689 	cache_minor_t *cmnp;  in walk_cache_minor()  local
3693 	if ((cmnp = lookup_minor(hdp, mpath, NULL, TYPE_CACHE)) != NULL) {  in walk_cache_minor()
3694 		(void) walk_cache_links(hdp, cmnp->link, linkp);  in walk_cache_minor()
3703 	cache_minor_t *cmnp;  in walk_cache_node()  local
3713 	for (cmnp = cnp->minor; cmnp != NULL; cmnp = cmnp->sib) {  in walk_cache_node()
3714 		if (walk_cache_links(hdp, cmnp->link, linkp)  in walk_cache_node()