Lines Matching defs:cmnp
589 cache_minor_t *cmnp;
608 cmnp = minor_insert(hdp, pcnp, name, nodetype, NULL);
609 if (cmnp == NULL) {
615 cmnp->name);
617 if (read_links(hdp, cmnp, dmp->link) != 0) {
860 cache_minor_t *cmnp,
871 cmnp ? cmnp->name : "<NULL>");
876 for (; cmnp != NULL; cmnp = cmnp->sib) {
878 assert(cmnp->name != NULL);
886 dmp->name = write_string(hdp, cmnp->name, next);
887 dmp->nodetype = write_string(hdp, cmnp->nodetype, next);
901 cmnp->name);
903 if (write_links(hdp, dmp, cmnp->link, next) != 0) {
908 return (cmnp ? -1 : 0);
1108 cache_minor_t *cmnp;
1120 cmnp = (*pp)->minor;
1121 (*pp)->minor = cmnp->sib;
1123 while (cmnp->link != NULL) {
1124 clp = cmnp->link;
1125 cmnp->link = clp->sib;
1129 minor_free(hdp, &cmnp);
1287 cache_minor_t *cmnp;
1292 if ((cmnp = link2minor(hdp, clp)) != NULL) {
1294 clp->sib = cmnp->link;
1295 cmnp->link = clp;
1297 clp->minor = cmnp;
1327 cache_minor_t *cmnp = *pp;
1331 if (cmnp == NULL)
1334 if (CACHE_LAST(hdp) == cmnp) {
1335 dprintf(DBG_STEP, "minor_free: last_minor(%s)\n", cmnp->name);
1339 free(cmnp->name);
1340 free(cmnp->nodetype);
1341 free(cmnp);
1499 cache_minor_t *cmnp;
1513 cmnp = CACHE_LAST(hdp);
1514 if (strcmp(cmnp->name, minor_name) == 0 && cmnp->node &&
1515 strcmp(cmnp->node->path, devfs_path) == 0) {
1516 return (cmnp);
1519 cmnp = cmnp->sib;
1520 if (cmnp && strcmp(cmnp->name, minor_name) == 0 && cmnp->node &&
1521 strcmp(cmnp->node->path, devfs_path) == 0) {
1522 set_last_minor(hdp, cmnp, TYPE_CACHE);
1523 return (cmnp);
1530 set_last_minor(struct di_devlink_handle *hdp, cache_minor_t *cmnp, int flags)
1540 if (LOOKUP_CACHE(flags) && cmnp) {
1541 CACHE_LAST(hdp) = cmnp;
1642 minor_delete(di_devlink_handle_t hdp, cache_minor_t *cmnp)
1648 (void) dprintf(DBG_STEP, "%s: removing minor: %s\n", fcn, cmnp->name);
1651 if (cmnp->node != NULL) {
1652 mpp = &cmnp->node->minor;
1654 if (*mpp == cmnp)
1660 fcn, cmnp->name);
1662 *mpp = cmnp->sib;
1666 cmnp->name);
1669 delete_unused_nodes(hdp, cmnp->node);
1671 cmnp->node = NULL;
1672 cmnp->sib = NULL;
1675 for (lpp = &cmnp->link; *lpp != NULL; lpp = &(*lpp)->sib) {
1679 CACHE(hdp)->dngl = cmnp->link;
1680 cmnp->link = NULL;
1682 minor_free(hdp, &cmnp);
1797 delete_unused_minor(di_devlink_handle_t hdp, cache_minor_t *cmnp)
1799 if (cmnp == NULL)
1802 if (cmnp->link != NULL)
1806 cmnp->name);
1808 minor_delete(hdp, cmnp);
1830 cache_minor_t *cmnp;
1859 if ((cmnp = lookup_minor(hdp, minor_path, NULL,
1870 cmnp = NULL;
1874 return (link_insert(hdp, cmnp, link, content, attr));
2706 cache_minor_t *cmnp;
2721 if ((cmnp = calloc(1, sizeof (cache_minor_t))) == NULL) {
2726 cmnp->name = strdup(name);
2727 cmnp->nodetype = strdup(nodetype);
2728 if (cmnp->name == NULL || cmnp->nodetype == NULL) {
2730 free(cmnp->name);
2731 free(cmnp->nodetype);
2732 free(cmnp);
2736 cmnp->node = pcnp;
2740 cmnp->sib = pcnp->minor;
2741 pcnp->minor = cmnp;
2744 *prev = cmnp;
2747 return (cmnp);
2753 cache_minor_t *cmnp,
2781 clp->minor = cmnp;
2784 if (cmnp != NULL) {
2785 clp->sib = cmnp->link;
2786 cmnp->link = clp;
2983 cache_minor_t *cmnp;
2991 for (cmnp = cnp->minor; cmnp != NULL; cmnp = cmnp->sib) {
2992 count_minor(cmnp, count);
3002 count_minor(cache_minor_t *cmnp, uint32_t *count)
3006 if (cmnp == NULL)
3010 count_string(cmnp->name, count);
3011 count_string(cmnp->nodetype, count);
3013 for (clp = cmnp->link; clp != NULL; clp = clp->sib) {
3689 cache_minor_t *cmnp;
3693 if ((cmnp = lookup_minor(hdp, mpath, NULL, TYPE_CACHE)) != NULL) {
3694 (void) walk_cache_links(hdp, cmnp->link, linkp);
3703 cache_minor_t *cmnp;
3713 for (cmnp = cnp->minor; cmnp != NULL; cmnp = cmnp->sib) {
3714 if (walk_cache_links(hdp, cmnp->link, linkp)