542 	cache_node_t *cnp;  in read_nodes()  local
565 		cnp = node_insert(hdp, pcnp, path, INSERT_HEAD);  in read_nodes()
566 		if (cnp == NULL) {  in read_nodes()
574 		if (read_minors(hdp, cnp, dnp->minor) != 0 ||  in read_nodes()
575 		    read_nodes(hdp, cnp, dnp->child) != 0) {  in read_nodes()
580 		    cnp->path);  in read_nodes()
798 	cache_node_t *cnp,  in write_nodes()  argument
807 	for (; cnp != NULL; cnp = cnp->sib) {  in write_nodes()
809 		assert(cnp->path != NULL);  in write_nodes()
812 		if ((pdnp == NULL) ^ (cnp == CACHE_ROOT(hdp))) {  in write_nodes()
814 			    fcn, cnp->path);  in write_nodes()
819 		assert((strcmp(cnp->path, "/") != 0) ^  in write_nodes()
820 		    (cnp == CACHE_ROOT(hdp)));  in write_nodes()
828 		dnp->path = write_string(hdp, cnp->path, next);  in write_nodes()
845 		    cnp->path);  in write_nodes()
847 		if (write_minors(hdp, dnp, cnp->minor, next) != 0 ||  in write_nodes()
848 		    write_nodes(hdp, dnp, cnp->child, next) != 0) {  in write_nodes()
853 	return (cnp ? -1 : 0);  in write_nodes()
1313 	cache_node_t *cnp = *pp;  in node_free()  local
1317 	if (cnp == NULL)  in node_free()
1320 	free(cnp->path);  in node_free()
1321 	free(cnp);  in node_free()
1464 	cache_node_t *cnp;  in get_last_node()  local
1479 	cnp = CACHE_LAST(hdp)->node;  in get_last_node()
1480 	if (strcmp(cnp->path, path) == 0) {  in get_last_node()
1481 		return (cnp);  in get_last_node()
1484 	cnp = cnp->sib;  in get_last_node()
1485 	if (cnp && strcmp(cnp->path, path) == 0) {  in get_last_node()
1486 		return (cnp);  in get_last_node()
1606 		cache_node_t *cnp = tnp->node;  in visit_node()  local
1608 		cnp = (cnp) ? cnp->child : CACHE_ROOT(tnp->handle);  in visit_node()
1610 		for (; cnp != NULL; cnp = cnp->sib) {  in visit_node()
1611 			if (strcmp(cnp->path, path) == 0)  in visit_node()
1614 		if (cnp == NULL && CREATE_ELEM(tnp->flags)) {  in visit_node()
1615 			cnp = node_insert(tnp->handle, tnp->node, path,  in visit_node()
1618 		tnp->node = cnp;  in visit_node()
1686 delete_unused_nodes(di_devlink_handle_t hdp, cache_node_t *cnp)  in delete_unused_nodes()  argument
1691 	if (cnp == NULL)  in delete_unused_nodes()
1694 	if (cnp->minor != NULL || cnp->child != NULL)  in delete_unused_nodes()
1698 	    cnp->path);  in delete_unused_nodes()
1701 	if (cnp->parent != NULL) {  in delete_unused_nodes()
1702 		npp = &cnp->parent->child;  in delete_unused_nodes()
1704 			if (*npp == cnp)  in delete_unused_nodes()
1710 			    cnp->path);  in delete_unused_nodes()
1712 			*npp = cnp->sib;  in delete_unused_nodes()
1714 	} else if (cnp == CACHE_ROOT(hdp)) {  in delete_unused_nodes()
1718 		    cnp->path);  in delete_unused_nodes()
1721 	delete_unused_nodes(hdp, cnp->parent);  in delete_unused_nodes()
1723 	cnp->parent = cnp->sib = NULL;  in delete_unused_nodes()
1725 	node_free(&cnp);  in delete_unused_nodes()
2649 	cache_node_t *cnp;  in node_insert()  local
2657 	if ((cnp = calloc(1, sizeof (cache_node_t))) == NULL) {  in node_insert()
2662 	if ((cnp->path = strdup(path)) == NULL) {  in node_insert()
2664 		free(cnp);  in node_insert()
2668 	cnp->parent = pcnp;  in node_insert()
2673 		CACHE(hdp)->root = cnp;  in node_insert()
2675 		cnp->sib = pcnp->child;  in node_insert()
2676 		pcnp->child = cnp;  in node_insert()
2681 		CACHE_LAST(hdp)->node->sib = cnp;  in node_insert()
2688 		*pp = cnp;  in node_insert()
2691 	return (cnp);  in node_insert()
2981 count_node(cache_node_t *cnp, uint32_t *count)  in count_node()  argument
2985 	if (cnp == NULL)  in count_node()
2989 	count_string(cnp->path, count);  in count_node()
2991 	for (cmnp = cnp->minor; cmnp != NULL; cmnp = cmnp->sib) {  in count_node()
2995 	for (cnp = cnp->child; cnp != NULL; cnp = cnp->sib) {  in count_node()
2996 		count_node(cnp, count);  in count_node()
3704 	cache_node_t *cnp;  in walk_cache_node()  local
3708 	if ((cnp = lookup_node(hdp, (char *)path, TYPE_CACHE)) == NULL) {  in walk_cache_node()
3713 	for (cmnp = cnp->minor; cmnp != NULL; cmnp = cmnp->sib) {  in walk_cache_node()