Lines Matching refs:minor

77  * to a given minor.
121 * Readers can lookup /dev links for a specific minor or
123 * and minor segments are not mapped in and the reader
578 if (read_minors(hdp, cnp, dnp->minor) != 0 ||
601 (void) dprintf(DBG_ERR, "%s: minor[%u]: orphan minor\n", fcn,
618 (void) dprintf(DBG_STEP, "%s: minor[%u]: %s\n", fcn, nidx,
630 * If the link is dangling the corresponding minor will be absent.
643 (void) dprintf(DBG_ERR, "read_links: invalid minor or"
851 if (write_minors(hdp, dnp, cnp->minor, next) != 0 ||
874 (void) dprintf(DBG_ERR, "%s: no node for minor: %s\n", fcn,
898 /* Commit writes to this minor */
901 dmp->sib = pdnp->minor;
902 pdnp->minor = idx;
904 (void) dprintf(DBG_STEP, "%s: minor[%u]: %s\n", fcn, idx,
928 /* A NULL minor if and only if the links are dangling */
930 (void) dprintf(DBG_ERR, "%s: invalid minor for link\n", fcn);
939 if ((pdmp == NULL) ^ (clp->minor == NULL)) {
940 (void) dprintf(DBG_ERR, "%s: invalid minor for link"
1070 assert(clp->minor == NULL);
1123 while ((*pp)->minor != NULL) {
1124 cmnp = (*pp)->minor;
1125 (*pp)->minor = cmnp->sib;
1238 * Lookup the primary link if possible and find its minor.
1240 if ((plp = link_hash(hdp, cp, 0)) != NULL && plp->minor != NULL) {
1241 return (plp->minor);
1300 assert(clp->minor == NULL);
1301 clp->minor = cmnp;
1364 * Returns the ':' preceding the minor name
1398 (void) dprintf(DBG_ERR, "%s: invalid minor path(%s)\n", fcn,
1418 pp = &((cache_node_t *)vp)->minor;
1435 nidx = (((struct db_node *)vp)->minor);
1508 "minor cache\n");
1539 "minor cache\n");
1652 (void) dprintf(DBG_STEP, "%s: removing minor: %s\n", fcn, cmnp->name);
1654 /* detach minor from node */
1656 mpp = &cmnp->node->minor;
1663 (void) dprintf(DBG_ERR, "%s: dangling minor: %s\n",
1669 (void) dprintf(DBG_ERR, "%s: orphan minor(%s)\n", fcn,
1680 (*lpp)->minor = NULL;
1698 if (cnp->minor != NULL || cnp->child != NULL)
1776 if (clp->minor == NULL)
1779 pp = &clp->minor->link;
1793 delete_unused_minor(hdp, clp->minor);
1795 clp->minor = NULL;
1809 dprintf(DBG_STEP, "delete_unused_minor: removing minor(%s)\n",
1870 * Defer resolving a secondary link to a minor until the
2134 * Walk all links in database if no minor path is specified.
2282 * If a minor matching the path exists, walk that minor's devlinks list.
2363 * Filter based on minor path
2369 * derive minor path
2699 * Allocate a new minor and link it in either at the tail or head
2700 * of the minor list depending on the value of "prev".
2742 /* Add to node's minor list */
2744 cmnp->sib = pcnp->minor;
2745 pcnp->minor = cmnp;
2785 clp->minor = cmnp;
2787 /* Add to minor's link list */
2995 for (cmnp = cnp->minor; cmnp != NULL; cmnp = cmnp->sib) {
3193 * returns 1 if contents is a minor node in /devices.
3266 * /pseudo/foo@0:X => devlinks for minor X
3349 * root'\0'minor'\0'driver'\0'
3351 * The driver and minor are optional. If present they have a non-zero
3562 * First search the links under the specified minor. On the
3632 dprintf(DBG_ERR, "lookup minor failed: %s\n", mpath);
3649 for (cmnp = cnp->minor; cmnp != NULL; cmnp = cmnp->sib) {
3661 * path path to a node or minor node.