Lines Matching defs:cnp
546 cache_node_t *cnp;
569 cnp = node_insert(hdp, pcnp, path, INSERT_HEAD);
570 if (cnp == NULL) {
578 if (read_minors(hdp, cnp, dnp->minor) != 0 ||
579 read_nodes(hdp, cnp, dnp->child) != 0) {
584 cnp->path);
802 cache_node_t *cnp,
811 for (; cnp != NULL; cnp = cnp->sib) {
813 assert(cnp->path != NULL);
816 if ((pdnp == NULL) ^ (cnp == CACHE_ROOT(hdp))) {
818 fcn, cnp->path);
823 assert((strcmp(cnp->path, "/") != 0) ^
824 (cnp == CACHE_ROOT(hdp)));
832 dnp->path = write_string(hdp, cnp->path, next);
849 cnp->path);
851 if (write_minors(hdp, dnp, cnp->minor, next) != 0 ||
852 write_nodes(hdp, dnp, cnp->child, next) != 0) {
857 return (cnp ? -1 : 0);
1317 cache_node_t *cnp = *pp;
1321 if (cnp == NULL)
1324 free(cnp->path);
1325 free(cnp);
1468 cache_node_t *cnp;
1483 cnp = CACHE_LAST(hdp)->node;
1484 if (strcmp(cnp->path, path) == 0) {
1485 return (cnp);
1488 cnp = cnp->sib;
1489 if (cnp && strcmp(cnp->path, path) == 0) {
1490 return (cnp);
1610 cache_node_t *cnp = tnp->node;
1612 cnp = (cnp) ? cnp->child : CACHE_ROOT(tnp->handle);
1614 for (; cnp != NULL; cnp = cnp->sib) {
1615 if (strcmp(cnp->path, path) == 0)
1618 if (cnp == NULL && CREATE_ELEM(tnp->flags)) {
1619 cnp = node_insert(tnp->handle, tnp->node, path,
1622 tnp->node = cnp;
1690 delete_unused_nodes(di_devlink_handle_t hdp, cache_node_t *cnp)
1695 if (cnp == NULL)
1698 if (cnp->minor != NULL || cnp->child != NULL)
1702 cnp->path);
1705 if (cnp->parent != NULL) {
1706 npp = &cnp->parent->child;
1708 if (*npp == cnp)
1714 cnp->path);
1716 *npp = cnp->sib;
1718 } else if (cnp == CACHE_ROOT(hdp)) {
1722 cnp->path);
1725 delete_unused_nodes(hdp, cnp->parent);
1727 cnp->parent = cnp->sib = NULL;
1729 node_free(&cnp);
2653 cache_node_t *cnp;
2661 if ((cnp = calloc(1, sizeof (cache_node_t))) == NULL) {
2666 if ((cnp->path = strdup(path)) == NULL) {
2668 free(cnp);
2672 cnp->parent = pcnp;
2677 CACHE(hdp)->root = cnp;
2679 cnp->sib = pcnp->child;
2680 pcnp->child = cnp;
2685 CACHE_LAST(hdp)->node->sib = cnp;
2692 *pp = cnp;
2695 return (cnp);
2985 count_node(cache_node_t *cnp, uint32_t *count)
2989 if (cnp == NULL)
2993 count_string(cnp->path, count);
2995 for (cmnp = cnp->minor; cmnp != NULL; cmnp = cmnp->sib) {
2999 for (cnp = cnp->child; cnp != NULL; cnp = cnp->sib) {
3000 count_node(cnp, count);
3640 cache_node_t *cnp;
3644 if ((cnp = lookup_node(hdp, (char *)path, TYPE_CACHE)) == NULL) {
3649 for (cmnp = cnp->minor; cmnp != NULL; cmnp = cmnp->sib) {