540 read_nodes(struct di_devlink_handle *hdp, cache_node_t *pcnp, uint32_t nidx)  in read_nodes()
543 	cache_node_t *cnp;  in read_nodes()
588 read_minors(struct di_devlink_handle *hdp, cache_node_t *pcnp, uint32_t nidx)  in read_minors()
799 	cache_node_t *cnp,  in write_nodes()
1105 subtree_free(struct di_devlink_handle *hdp, cache_node_t **pp)  in subtree_free()
1107 	cache_node_t *np;  in subtree_free()
1312 node_free(cache_node_t **pp)  in node_free()
1314 	cache_node_t *cnp = *pp;  in node_free()
1415 		pp = &((cache_node_t *)vp)->minor;  in lookup_minor()
1465 	cache_node_t *cnp;  in get_last_node()
1607 		cache_node_t *cnp = tnp->node;  in visit_node()
1687 delete_unused_nodes(di_devlink_handle_t hdp, cache_node_t *cnp)  in delete_unused_nodes()
1689 	cache_node_t **npp;  in delete_unused_nodes()
2643 static cache_node_t *
2646 	cache_node_t *pcnp,  in node_insert()
2650 	cache_node_t *cnp;  in node_insert()
2658 	if ((cnp = calloc(1, sizeof (cache_node_t))) == NULL) {  in node_insert()
2685 		cache_node_t **pp;  in node_insert()
2702 	cache_node_t *pcnp,  in minor_insert()
2982 count_node(cache_node_t *cnp, uint32_t *count)  in count_node()
3705 	cache_node_t *cnp;  in walk_cache_node()