1 /* $NetBSD: devopen.c,v 1.2 2000/09/26 09:48:35 wdk Exp $ */ 2 3 /*- 4 * Copyright (c) 1992, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * Ralph Campbell. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 * 38 * @(#)devopen.c 8.1 (Berkeley) 6/10/93 39 */ 40 41 #include <lib/libsa/stand.h> 42 43 /* 44 * Decode the string 'fname', open the device and return the remaining 45 * file name if any. 46 */ 47 int 48 devopen(f, fname, file) 49 struct open_file *f; 50 const char *fname; 51 char **file; /* out */ 52 { 53 int ctlr = 0, unit = 0, part = 0; 54 int c, rc; 55 char namebuf[20]; 56 const char *cp; 57 char *ncp; 58 #if !defined(LIBSA_SINGLE_DEVICE) 59 int i; 60 struct devsw *dp; 61 #endif 62 63 cp = fname; 64 ncp = namebuf; 65 66 /* expect a string like 'dksd(0,0,0)netbsd' */ 67 while ((c = *cp) != '\0') { 68 if (c == '(') { 69 cp++; 70 break; 71 } 72 if (ncp < namebuf + sizeof(namebuf) - 1) 73 *ncp++ = c; 74 cp++; 75 } 76 77 /* get controller number */ 78 if ((c = *cp) >= '0' && c <= '9') { 79 ctlr = c - '0'; 80 c = *++cp; 81 } 82 83 if (c == ',') { 84 /* get SCSI device number */ 85 if ((c = *++cp) >= '0' && c <= '9') { 86 unit = c - '0'; 87 c = *++cp; 88 } 89 90 if (c == ',') { 91 /* get partition number */ 92 if ((c = *++cp) >= '0' && c <= '9') { 93 part = c - '0'; 94 /* dksd(,,8)boot -> dksd(,,) */ 95 if (part >= 8) 96 part = 0; 97 c = *++cp; 98 } 99 } 100 } 101 if (c != ')') 102 return (ENXIO); 103 cp++; 104 105 *ncp = '\0'; 106 107 #ifdef LIBSA_SINGLE_DEVICE 108 rc = DEV_OPEN(dp)(f, ctlr, unit, part); 109 #else /* !LIBSA_SINGLE_DEVICE */ 110 for (dp = devsw, i = 0; i < ndevs; dp++, i++) 111 if (dp->dv_name && strcmp(namebuf, dp->dv_name) == 0) 112 goto fnd; 113 printf("Unknown device '%s'\nKnown devices are:", namebuf); 114 for (dp = devsw, i = 0; i < ndevs; dp++, i++) 115 if (dp->dv_name) 116 printf(" %s", dp->dv_name); 117 printf("\n"); 118 return (ENXIO); 119 120 fnd: 121 #ifdef BOOTNET 122 if (strcmp(namebuf, "tftp") == 0) 123 rc = (dp->dv_open)(f, namebuf); 124 else 125 #endif /* BOOTNET */ 126 rc = (dp->dv_open)(f, ctlr, unit, part); 127 #endif /* !LIBSA_SINGLE_DEVICE */ 128 if (rc) 129 return (rc); 130 131 #ifndef LIBSA_SINGLE_DEVICE 132 f->f_dev = dp; 133 #endif 134 if (file && *cp != '\0') 135 *file = (char *)cp; /* XXX */ 136 return (0); 137 } 138