Lines Matching refs:minor
73 * to a given minor.
117 * Readers can lookup /dev links for a specific minor or
119 * and minor segments are not mapped in and the reader
574 if (read_minors(hdp, cnp, dnp->minor) != 0 ||
597 (void) dprintf(DBG_ERR, "%s: minor[%u]: orphan minor\n", fcn,
614 (void) dprintf(DBG_STEP, "%s: minor[%u]: %s\n", fcn, nidx,
626 * If the link is dangling the corresponding minor will be absent.
639 (void) dprintf(DBG_ERR, "read_links: invalid minor or"
847 if (write_minors(hdp, dnp, cnp->minor, next) != 0 ||
870 (void) dprintf(DBG_ERR, "%s: no node for minor: %s\n", fcn,
894 /* Commit writes to this minor */
897 dmp->sib = pdnp->minor;
898 pdnp->minor = idx;
900 (void) dprintf(DBG_STEP, "%s: minor[%u]: %s\n", fcn, idx,
924 /* A NULL minor if and only if the links are dangling */
926 (void) dprintf(DBG_ERR, "%s: invalid minor for link\n", fcn);
935 if ((pdmp == NULL) ^ (clp->minor == NULL)) {
936 (void) dprintf(DBG_ERR, "%s: invalid minor for link"
1066 assert(clp->minor == NULL);
1119 while ((*pp)->minor != NULL) {
1120 cmnp = (*pp)->minor;
1121 (*pp)->minor = cmnp->sib;
1234 * Lookup the primary link if possible and find its minor.
1236 if ((plp = link_hash(hdp, cp, 0)) != NULL && plp->minor != NULL) {
1237 return (plp->minor);
1296 assert(clp->minor == NULL);
1297 clp->minor = cmnp;
1360 * Returns the ':' preceding the minor name
1394 (void) dprintf(DBG_ERR, "%s: invalid minor path(%s)\n", fcn,
1414 pp = &((cache_node_t *)vp)->minor;
1431 nidx = (((struct db_node *)vp)->minor);
1504 "minor cache\n");
1535 "minor cache\n");
1648 (void) dprintf(DBG_STEP, "%s: removing minor: %s\n", fcn, cmnp->name);
1650 /* detach minor from node */
1652 mpp = &cmnp->node->minor;
1659 (void) dprintf(DBG_ERR, "%s: dangling minor: %s\n",
1665 (void) dprintf(DBG_ERR, "%s: orphan minor(%s)\n", fcn,
1676 (*lpp)->minor = NULL;
1694 if (cnp->minor != NULL || cnp->child != NULL)
1772 if (clp->minor == NULL)
1775 pp = &clp->minor->link;
1789 delete_unused_minor(hdp, clp->minor);
1791 clp->minor = NULL;
1805 dprintf(DBG_STEP, "delete_unused_minor: removing minor(%s)\n",
1866 * Defer resolving a secondary link to a minor until the
2130 * Walk all links in database if no minor path is specified.
2278 * If a minor matching the path exists, walk that minor's devlinks list.
2359 * Filter based on minor path
2365 * derive minor path
2695 * Allocate a new minor and link it in either at the tail or head
2696 * of the minor list depending on the value of "prev".
2738 /* Add to node's minor list */
2740 cmnp->sib = pcnp->minor;
2741 pcnp->minor = cmnp;
2781 clp->minor = cmnp;
2783 /* Add to minor's link list */
2991 for (cmnp = cnp->minor; cmnp != NULL; cmnp = cmnp->sib) {
3189 * returns 1 if contents is a minor node in /devices.
3262 * /pseudo/foo@0:X => devlinks for minor X
3328 * root'\0'minor'\0'driver'\0'
3330 * The driver and minor are optional. If present they have a non-zero
3626 * First search the links under the specified minor. On the
3696 dprintf(DBG_ERR, "lookup minor failed: %s\n", mpath);
3713 for (cmnp = cnp->minor; cmnp != NULL; cmnp = cmnp->sib) {
3725 * path path to a node or minor node.