cache_node_t
subtree_free(struct di_devlink_handle *hdp, cache_node_t **pp)
cache_node_t *np;
node_free(cache_node_t **pp)
cache_node_t *cnp = *pp;
pp = &((cache_node_t *)vp)->minor;
cache_node_t *cnp;
cache_node_t *cnp = tnp->node;
delete_unused_nodes(di_devlink_handle_t hdp, cache_node_t *cnp)
cache_node_t **npp;
static cache_node_t *
cache_node_t *pcnp,
cache_node_t *cnp;
if ((cnp = calloc(1, sizeof (cache_node_t))) == NULL) {
cache_node_t **pp;
cache_node_t *pcnp,
count_node(cache_node_t *cnp, uint32_t *count)
cache_node_t *cnp;
read_nodes(struct di_devlink_handle *hdp, cache_node_t *pcnp, uint32_t nidx)
cache_node_t *cnp;
read_minors(struct di_devlink_handle *hdp, cache_node_t *pcnp, uint32_t nidx)
cache_node_t *cnp,
cache_node_t *root; /* root of cache tree */
static int read_nodes(struct di_devlink_handle *hdp, cache_node_t *pcnp,
static int read_minors(struct di_devlink_handle *hdp, cache_node_t *pcnp,
static cache_node_t *node_insert(struct di_devlink_handle *hdp,
cache_node_t *pcnp, const char *path, int insert);
cache_node_t *pcnp, const char *name, const char *nodetype,
cache_node_t *cnp, uint32_t *next);
static void subtree_free(struct di_devlink_handle *hdp, cache_node_t **pp);
static void node_free(cache_node_t **pp);
static void count_node(cache_node_t *cnp, uint32_t *count);
static void delete_unused_nodes(di_devlink_handle_t hdp, cache_node_t *cnp);