Lines Matching refs:cnp
543 cache_node_t *cnp; in read_nodes() local
566 cnp = node_insert(hdp, pcnp, path, INSERT_HEAD); in read_nodes()
567 if (cnp == NULL) { in read_nodes()
575 if (read_minors(hdp, cnp, dnp->minor) != 0 || in read_nodes()
576 read_nodes(hdp, cnp, dnp->child) != 0) { in read_nodes()
581 cnp->path); in read_nodes()
799 cache_node_t *cnp, in write_nodes() argument
808 for (; cnp != NULL; cnp = cnp->sib) { in write_nodes()
810 assert(cnp->path != NULL); in write_nodes()
813 if ((pdnp == NULL) ^ (cnp == CACHE_ROOT(hdp))) { in write_nodes()
815 fcn, cnp->path); in write_nodes()
820 assert((strcmp(cnp->path, "/") != 0) ^ in write_nodes()
821 (cnp == CACHE_ROOT(hdp))); in write_nodes()
829 dnp->path = write_string(hdp, cnp->path, next); in write_nodes()
846 cnp->path); in write_nodes()
848 if (write_minors(hdp, dnp, cnp->minor, next) != 0 || in write_nodes()
849 write_nodes(hdp, dnp, cnp->child, next) != 0) { in write_nodes()
854 return (cnp ? -1 : 0); in write_nodes()
1314 cache_node_t *cnp = *pp; in node_free() local
1318 if (cnp == NULL) in node_free()
1321 free(cnp->path); in node_free()
1322 free(cnp); in node_free()
1465 cache_node_t *cnp; in get_last_node() local
1480 cnp = CACHE_LAST(hdp)->node; in get_last_node()
1481 if (strcmp(cnp->path, path) == 0) { in get_last_node()
1482 return (cnp); in get_last_node()
1485 cnp = cnp->sib; in get_last_node()
1486 if (cnp && strcmp(cnp->path, path) == 0) { in get_last_node()
1487 return (cnp); in get_last_node()
1607 cache_node_t *cnp = tnp->node; in visit_node() local
1609 cnp = (cnp) ? cnp->child : CACHE_ROOT(tnp->handle); in visit_node()
1611 for (; cnp != NULL; cnp = cnp->sib) { in visit_node()
1612 if (strcmp(cnp->path, path) == 0) in visit_node()
1615 if (cnp == NULL && CREATE_ELEM(tnp->flags)) { in visit_node()
1616 cnp = node_insert(tnp->handle, tnp->node, path, in visit_node()
1619 tnp->node = cnp; in visit_node()
1687 delete_unused_nodes(di_devlink_handle_t hdp, cache_node_t *cnp) in delete_unused_nodes() argument
1692 if (cnp == NULL) in delete_unused_nodes()
1695 if (cnp->minor != NULL || cnp->child != NULL) in delete_unused_nodes()
1699 cnp->path); in delete_unused_nodes()
1702 if (cnp->parent != NULL) { in delete_unused_nodes()
1703 npp = &cnp->parent->child; in delete_unused_nodes()
1705 if (*npp == cnp) in delete_unused_nodes()
1711 cnp->path); in delete_unused_nodes()
1713 *npp = cnp->sib; in delete_unused_nodes()
1715 } else if (cnp == CACHE_ROOT(hdp)) { in delete_unused_nodes()
1719 cnp->path); in delete_unused_nodes()
1722 delete_unused_nodes(hdp, cnp->parent); in delete_unused_nodes()
1724 cnp->parent = cnp->sib = NULL; in delete_unused_nodes()
1726 node_free(&cnp); in delete_unused_nodes()
2650 cache_node_t *cnp; in node_insert() local
2658 if ((cnp = calloc(1, sizeof (cache_node_t))) == NULL) { in node_insert()
2663 if ((cnp->path = strdup(path)) == NULL) { in node_insert()
2665 free(cnp); in node_insert()
2669 cnp->parent = pcnp; in node_insert()
2674 CACHE(hdp)->root = cnp; in node_insert()
2676 cnp->sib = pcnp->child; in node_insert()
2677 pcnp->child = cnp; in node_insert()
2682 CACHE_LAST(hdp)->node->sib = cnp; in node_insert()
2689 *pp = cnp; in node_insert()
2692 return (cnp); in node_insert()
2982 count_node(cache_node_t *cnp, uint32_t *count) in count_node() argument
2986 if (cnp == NULL) in count_node()
2990 count_string(cnp->path, count); in count_node()
2992 for (cmnp = cnp->minor; cmnp != NULL; cmnp = cmnp->sib) { in count_node()
2996 for (cnp = cnp->child; cnp != NULL; cnp = cnp->sib) { in count_node()
2997 count_node(cnp, count); in count_node()
3705 cache_node_t *cnp; in walk_cache_node() local
3709 if ((cnp = lookup_node(hdp, (char *)path, TYPE_CACHE)) == NULL) { in walk_cache_node()
3714 for (cmnp = cnp->minor; cmnp != NULL; cmnp = cmnp->sib) { in walk_cache_node()