Lines Matching defs:devid
43 #include <devid.h>
57 ddi_devid_t devid;
483 ddi_devid_t devid /* device id */
490 dnlp->devid = devid;
500 * Differentiate between matching on name/dev_t and devid. In the latter
542 * Case 2 - Both devices have a devid
544 * devices have a devid then the compare will is all
547 * Case 3 - One or more devices does not have a devid
591 * use its devid. Otherwise do the expensive operations
592 * of opening the device, getting the devid, and closing the
600 * involve 2 opens, closes, and devid gets for each existing soft
607 devid1 = dnlp->devid;
616 devid2 = dnlp->devid;
629 * The process here is open each disk, get the devid for each
630 * disk. If they both have a devid compare them and return
640 /* add the name and devid to the cache */
651 /* add the name and devid to the cache */
658 retval = IDENTICAL_DEVIDS; /* same devid */
780 return (mduseerror(ep, /* same devid */