scsipiconf.c revision 1.21 1 1.21 thorpej /* $NetBSD: scsipiconf.c,v 1.21 2004/08/21 21:29:39 thorpej Exp $ */
2 1.2 bouyer
3 1.7 mycroft /*-
4 1.13 bouyer * Copyright (c) 1998, 1999 The NetBSD Foundation, Inc.
5 1.7 mycroft * All rights reserved.
6 1.7 mycroft *
7 1.7 mycroft * This code is derived from software contributed to The NetBSD Foundation
8 1.13 bouyer * by Charles M. Hannum; by Jason R. Thorpe of the Numerical Aerospace
9 1.13 bouyer * Simulation Facility, NASA Ames Research Center.
10 1.2 bouyer *
11 1.2 bouyer * Redistribution and use in source and binary forms, with or without
12 1.2 bouyer * modification, are permitted provided that the following conditions
13 1.2 bouyer * are met:
14 1.2 bouyer * 1. Redistributions of source code must retain the above copyright
15 1.2 bouyer * notice, this list of conditions and the following disclaimer.
16 1.2 bouyer * 2. Redistributions in binary form must reproduce the above copyright
17 1.2 bouyer * notice, this list of conditions and the following disclaimer in the
18 1.2 bouyer * documentation and/or other materials provided with the distribution.
19 1.2 bouyer * 3. All advertising materials mentioning features or use of this software
20 1.2 bouyer * must display the following acknowledgement:
21 1.7 mycroft * This product includes software developed by the NetBSD
22 1.7 mycroft * Foundation, Inc. and its contributors.
23 1.7 mycroft * 4. Neither the name of The NetBSD Foundation nor the names of its
24 1.7 mycroft * contributors may be used to endorse or promote products derived
25 1.7 mycroft * from this software without specific prior written permission.
26 1.2 bouyer *
27 1.7 mycroft * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
28 1.7 mycroft * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
29 1.7 mycroft * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
30 1.7 mycroft * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
31 1.7 mycroft * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
32 1.7 mycroft * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
33 1.7 mycroft * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
34 1.7 mycroft * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
35 1.7 mycroft * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
36 1.7 mycroft * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
37 1.7 mycroft * POSSIBILITY OF SUCH DAMAGE.
38 1.2 bouyer */
39 1.2 bouyer
40 1.2 bouyer /*
41 1.2 bouyer * Originally written by Julian Elischer (julian (at) tfs.com)
42 1.2 bouyer * for TRW Financial Systems for use under the MACH(2.5) operating system.
43 1.2 bouyer *
44 1.2 bouyer * TRW Financial Systems, in accordance with their agreement with Carnegie
45 1.2 bouyer * Mellon University, makes this software available to CMU to distribute
46 1.2 bouyer * or use in any manner that they see fit as long as this message is kept with
47 1.2 bouyer * the software. For this reason TFS also grants any other persons or
48 1.2 bouyer * organisations permission to use or modify this software.
49 1.2 bouyer *
50 1.2 bouyer * TFS supplies this software to be publicly redistributed
51 1.2 bouyer * on the understanding that TFS is not responsible for the correct
52 1.2 bouyer * functioning of this software in any circumstances.
53 1.2 bouyer *
54 1.2 bouyer * Ported to run under 386BSD by Julian Elischer (julian (at) tfs.com) Sept 1992
55 1.2 bouyer */
56 1.15 lukem
57 1.15 lukem #include <sys/cdefs.h>
58 1.21 thorpej __KERNEL_RCSID(0, "$NetBSD: scsipiconf.c,v 1.21 2004/08/21 21:29:39 thorpej Exp $");
59 1.2 bouyer
60 1.2 bouyer #include <sys/param.h>
61 1.2 bouyer #include <sys/systm.h>
62 1.2 bouyer #include <sys/malloc.h>
63 1.2 bouyer #include <sys/device.h>
64 1.10 enami #include <sys/proc.h>
65 1.10 enami
66 1.11 mrg #include <uvm/uvm_extern.h>
67 1.2 bouyer
68 1.2 bouyer #include <dev/scsipi/scsipi_all.h>
69 1.2 bouyer #include <dev/scsipi/scsipiconf.h>
70 1.10 enami
71 1.12 ad #define STRVIS_ISWHITE(x) ((x) == ' ' || (x) == '\0' || (x) == (u_char)'\377')
72 1.12 ad
73 1.10 enami int
74 1.21 thorpej scsipi_command(struct scsipi_periph *periph, struct scsipi_generic *cmd,
75 1.21 thorpej int cmdlen, u_char *data_addr, int datalen, int retries, int timeout,
76 1.21 thorpej struct buf *bp, int flags)
77 1.10 enami {
78 1.10 enami int error;
79 1.13 bouyer
80 1.10 enami if ((flags & XS_CTL_DATA_ONSTACK) != 0) {
81 1.10 enami /*
82 1.10 enami * If the I/O buffer is allocated on stack, the
83 1.10 enami * process must NOT be swapped out, as the device will
84 1.10 enami * be accessing the stack.
85 1.10 enami */
86 1.20 martin PHOLD(curlwp);
87 1.10 enami }
88 1.13 bouyer error = (*periph->periph_channel->chan_bustype->bustype_cmd)(periph,
89 1.13 bouyer cmd, cmdlen, data_addr, datalen, retries, timeout, bp, flags);
90 1.10 enami if ((flags & XS_CTL_DATA_ONSTACK) != 0)
91 1.20 martin PRELE(curlwp);
92 1.10 enami return (error);
93 1.10 enami }
94 1.2 bouyer
95 1.2 bouyer /*
96 1.13 bouyer * allocate and init a scsipi_periph structure for a new device.
97 1.13 bouyer */
98 1.13 bouyer struct scsipi_periph *
99 1.21 thorpej scsipi_alloc_periph(int malloc_flag)
100 1.13 bouyer {
101 1.13 bouyer struct scsipi_periph *periph;
102 1.19 thorpej u_int i;
103 1.13 bouyer
104 1.17 tsutsui periph = malloc(sizeof(*periph), M_DEVBUF, malloc_flag|M_ZERO);
105 1.13 bouyer if (periph == NULL)
106 1.13 bouyer return NULL;
107 1.13 bouyer
108 1.13 bouyer periph->periph_dev = NULL;
109 1.13 bouyer
110 1.13 bouyer /*
111 1.13 bouyer * Start with one command opening. The periph driver
112 1.13 bouyer * will grow this if it knows it can take advantage of it.
113 1.13 bouyer */
114 1.13 bouyer periph->periph_openings = 1;
115 1.13 bouyer periph->periph_active = 0;
116 1.13 bouyer
117 1.13 bouyer for (i = 0; i < PERIPH_NTAGWORDS; i++)
118 1.13 bouyer periph->periph_freetags[i] = 0xffffffff;
119 1.13 bouyer
120 1.13 bouyer TAILQ_INIT(&periph->periph_xferq);
121 1.13 bouyer callout_init(&periph->periph_callout);
122 1.13 bouyer
123 1.13 bouyer return periph;
124 1.13 bouyer }
125 1.13 bouyer
126 1.13 bouyer /*
127 1.2 bouyer * Return a priority based on how much of the inquiry data matches
128 1.2 bouyer * the patterns for the particular driver.
129 1.2 bouyer */
130 1.2 bouyer caddr_t
131 1.21 thorpej scsipi_inqmatch(struct scsipi_inquiry_pattern *inqbuf, caddr_t base,
132 1.21 thorpej int nmatches, int matchsize, int *bestpriority)
133 1.2 bouyer {
134 1.2 bouyer u_int8_t type;
135 1.2 bouyer caddr_t bestmatch;
136 1.2 bouyer
137 1.2 bouyer /* Include the qualifier to catch vendor-unique types. */
138 1.2 bouyer type = inqbuf->type;
139 1.2 bouyer
140 1.2 bouyer for (*bestpriority = 0, bestmatch = 0; nmatches--; base += matchsize) {
141 1.2 bouyer struct scsipi_inquiry_pattern *match = (void *)base;
142 1.2 bouyer int priority, len;
143 1.2 bouyer
144 1.2 bouyer if (type != match->type)
145 1.2 bouyer continue;
146 1.2 bouyer if (inqbuf->removable != match->removable)
147 1.2 bouyer continue;
148 1.2 bouyer priority = 2;
149 1.2 bouyer len = strlen(match->vendor);
150 1.14 thorpej if (memcmp(inqbuf->vendor, match->vendor, len))
151 1.2 bouyer continue;
152 1.2 bouyer priority += len;
153 1.2 bouyer len = strlen(match->product);
154 1.14 thorpej if (memcmp(inqbuf->product, match->product, len))
155 1.2 bouyer continue;
156 1.2 bouyer priority += len;
157 1.2 bouyer len = strlen(match->revision);
158 1.14 thorpej if (memcmp(inqbuf->revision, match->revision, len))
159 1.2 bouyer continue;
160 1.2 bouyer priority += len;
161 1.2 bouyer
162 1.13 bouyer #ifdef SCSIPI_DEBUG
163 1.2 bouyer printf("scsipi_inqmatch: %d/%d/%d <%s, %s, %s>\n",
164 1.2 bouyer priority, match->type, match->removable,
165 1.2 bouyer match->vendor, match->product, match->revision);
166 1.2 bouyer #endif
167 1.2 bouyer if (priority > *bestpriority) {
168 1.2 bouyer *bestpriority = priority;
169 1.2 bouyer bestmatch = base;
170 1.2 bouyer }
171 1.2 bouyer }
172 1.2 bouyer
173 1.2 bouyer return (bestmatch);
174 1.2 bouyer }
175 1.2 bouyer
176 1.2 bouyer char *
177 1.21 thorpej scsipi_dtype(int type)
178 1.2 bouyer {
179 1.2 bouyer char *dtype;
180 1.3 enami
181 1.2 bouyer switch (type) {
182 1.2 bouyer case T_DIRECT:
183 1.18 soren dtype = "disk";
184 1.4 thorpej break;
185 1.2 bouyer case T_SEQUENTIAL:
186 1.18 soren dtype = "tape";
187 1.2 bouyer break;
188 1.2 bouyer case T_PRINTER:
189 1.2 bouyer dtype = "printer";
190 1.2 bouyer break;
191 1.2 bouyer case T_PROCESSOR:
192 1.2 bouyer dtype = "processor";
193 1.2 bouyer break;
194 1.4 thorpej case T_WORM:
195 1.4 thorpej dtype = "worm";
196 1.4 thorpej break;
197 1.2 bouyer case T_CDROM:
198 1.2 bouyer dtype = "cdrom";
199 1.2 bouyer break;
200 1.2 bouyer case T_SCANNER:
201 1.2 bouyer dtype = "scanner";
202 1.2 bouyer break;
203 1.2 bouyer case T_OPTICAL:
204 1.2 bouyer dtype = "optical";
205 1.2 bouyer break;
206 1.2 bouyer case T_CHANGER:
207 1.2 bouyer dtype = "changer";
208 1.2 bouyer break;
209 1.2 bouyer case T_COMM:
210 1.2 bouyer dtype = "communication";
211 1.4 thorpej break;
212 1.4 thorpej case T_IT8_1:
213 1.4 thorpej case T_IT8_2:
214 1.9 dante dtype = "graphic arts pre-press";
215 1.4 thorpej break;
216 1.4 thorpej case T_STORARRAY:
217 1.4 thorpej dtype = "storage array";
218 1.4 thorpej break;
219 1.4 thorpej case T_ENCLOSURE:
220 1.4 thorpej dtype = "enclosure services";
221 1.9 dante break;
222 1.9 dante case T_SIMPLE_DIRECT:
223 1.9 dante dtype = "simplified direct";
224 1.9 dante break;
225 1.9 dante case T_OPTIC_CARD_RW:
226 1.9 dante dtype = "optical card r/w";
227 1.9 dante break;
228 1.9 dante case T_OBJECT_STORED:
229 1.9 dante dtype = "object-based storage";
230 1.2 bouyer break;
231 1.2 bouyer case T_NODEVICE:
232 1.2 bouyer panic("scsipi_dtype: impossible device type");
233 1.2 bouyer default:
234 1.2 bouyer dtype = "unknown";
235 1.2 bouyer break;
236 1.2 bouyer }
237 1.3 enami return (dtype);
238 1.2 bouyer }
239 1.2 bouyer
240 1.2 bouyer void
241 1.21 thorpej scsipi_strvis(u_char *dst, int dlen, u_char *src, int slen)
242 1.2 bouyer {
243 1.2 bouyer
244 1.2 bouyer /* Trim leading and trailing blanks and NULs. */
245 1.12 ad while (slen > 0 && STRVIS_ISWHITE(src[0]))
246 1.5 drochner ++src, --slen;
247 1.12 ad while (slen > 0 && STRVIS_ISWHITE(src[slen - 1]))
248 1.5 drochner --slen;
249 1.2 bouyer
250 1.5 drochner while (slen > 0) {
251 1.2 bouyer if (*src < 0x20 || *src >= 0x80) {
252 1.2 bouyer /* non-printable characters */
253 1.5 drochner dlen -= 4;
254 1.5 drochner if (dlen < 1)
255 1.5 drochner break;
256 1.2 bouyer *dst++ = '\\';
257 1.2 bouyer *dst++ = ((*src & 0300) >> 6) + '0';
258 1.2 bouyer *dst++ = ((*src & 0070) >> 3) + '0';
259 1.2 bouyer *dst++ = ((*src & 0007) >> 0) + '0';
260 1.2 bouyer } else if (*src == '\\') {
261 1.2 bouyer /* quote characters */
262 1.5 drochner dlen -= 2;
263 1.5 drochner if (dlen < 1)
264 1.5 drochner break;
265 1.2 bouyer *dst++ = '\\';
266 1.2 bouyer *dst++ = '\\';
267 1.2 bouyer } else {
268 1.2 bouyer /* normal characters */
269 1.5 drochner if (--dlen < 1)
270 1.5 drochner break;
271 1.2 bouyer *dst++ = *src;
272 1.2 bouyer }
273 1.5 drochner ++src, --slen;
274 1.2 bouyer }
275 1.2 bouyer
276 1.2 bouyer *dst++ = 0;
277 1.2 bouyer }
278