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