1 1.45 kardel /* $NetBSD: scsipiconf.c,v 1.45 2019/03/28 10:44:29 kardel Exp $ */ 2 1.2 bouyer 3 1.7 mycroft /*- 4 1.25 mycroft * Copyright (c) 1998, 1999, 2004 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 * 20 1.7 mycroft * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 21 1.7 mycroft * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 22 1.7 mycroft * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 23 1.7 mycroft * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 24 1.7 mycroft * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 25 1.7 mycroft * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 26 1.7 mycroft * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 27 1.7 mycroft * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 28 1.7 mycroft * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 29 1.7 mycroft * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 30 1.7 mycroft * POSSIBILITY OF SUCH DAMAGE. 31 1.2 bouyer */ 32 1.2 bouyer 33 1.2 bouyer /* 34 1.2 bouyer * Originally written by Julian Elischer (julian (at) tfs.com) 35 1.2 bouyer * for TRW Financial Systems for use under the MACH(2.5) operating system. 36 1.2 bouyer * 37 1.2 bouyer * TRW Financial Systems, in accordance with their agreement with Carnegie 38 1.2 bouyer * Mellon University, makes this software available to CMU to distribute 39 1.2 bouyer * or use in any manner that they see fit as long as this message is kept with 40 1.2 bouyer * the software. For this reason TFS also grants any other persons or 41 1.2 bouyer * organisations permission to use or modify this software. 42 1.2 bouyer * 43 1.2 bouyer * TFS supplies this software to be publicly redistributed 44 1.2 bouyer * on the understanding that TFS is not responsible for the correct 45 1.2 bouyer * functioning of this software in any circumstances. 46 1.2 bouyer * 47 1.2 bouyer * Ported to run under 386BSD by Julian Elischer (julian (at) tfs.com) Sept 1992 48 1.2 bouyer */ 49 1.15 lukem 50 1.15 lukem #include <sys/cdefs.h> 51 1.45 kardel __KERNEL_RCSID(0, "$NetBSD: scsipiconf.c,v 1.45 2019/03/28 10:44:29 kardel Exp $"); 52 1.2 bouyer 53 1.2 bouyer #include <sys/param.h> 54 1.2 bouyer #include <sys/systm.h> 55 1.2 bouyer #include <sys/malloc.h> 56 1.38 pgoyette #include <sys/module.h> 57 1.2 bouyer #include <sys/device.h> 58 1.10 enami #include <sys/proc.h> 59 1.10 enami 60 1.2 bouyer #include <dev/scsipi/scsipi_all.h> 61 1.2 bouyer #include <dev/scsipi/scsipiconf.h> 62 1.25 mycroft #include <dev/scsipi/scsipi_base.h> 63 1.10 enami 64 1.12 ad 65 1.37 pgoyette /* Function pointers and stub routines for scsiverbose module */ 66 1.38 pgoyette int (*scsipi_print_sense)(struct scsipi_xfer *, int) = scsipi_print_sense_stub; 67 1.38 pgoyette void (*scsipi_print_sense_data)(struct scsi_sense_data *, int) = 68 1.37 pgoyette scsipi_print_sense_data_stub; 69 1.37 pgoyette 70 1.38 pgoyette int scsi_verbose_loaded = 0; 71 1.37 pgoyette 72 1.42 mlelstv int 73 1.42 mlelstv scsipi_print_sense_stub(struct scsipi_xfer * xs, int verbosity) 74 1.37 pgoyette { 75 1.44 christos scsipi_load_verbose(); 76 1.38 pgoyette if (scsi_verbose_loaded) 77 1.38 pgoyette return scsipi_print_sense(xs, verbosity); 78 1.38 pgoyette else 79 1.38 pgoyette return 0; 80 1.37 pgoyette } 81 1.37 pgoyette 82 1.42 mlelstv void 83 1.42 mlelstv scsipi_print_sense_data_stub(struct scsi_sense_data *sense, int verbosity) 84 1.37 pgoyette { 85 1.44 christos scsipi_load_verbose(); 86 1.38 pgoyette if (scsi_verbose_loaded) 87 1.38 pgoyette scsipi_print_sense_data(sense, verbosity); 88 1.37 pgoyette } 89 1.37 pgoyette 90 1.10 enami int 91 1.26 mycroft scsipi_command(struct scsipi_periph *periph, struct scsipi_generic *cmd, 92 1.30 reinoud int cmdlen, u_char *data_addr, int datalen, int retries, int timeout, 93 1.26 mycroft struct buf *bp, int flags) 94 1.10 enami { 95 1.26 mycroft struct scsipi_xfer *xs; 96 1.42 mlelstv int rc; 97 1.31 perry 98 1.42 mlelstv /* 99 1.42 mlelstv * execute unlocked to allow waiting for memory 100 1.42 mlelstv */ 101 1.42 mlelstv xs = scsipi_make_xs_unlocked(periph, cmd, cmdlen, data_addr, datalen, retries, 102 1.26 mycroft timeout, bp, flags); 103 1.26 mycroft if (!xs) 104 1.26 mycroft return (ENOMEM); 105 1.25 mycroft 106 1.42 mlelstv mutex_enter(chan_mtx(periph->periph_channel)); 107 1.42 mlelstv rc = scsipi_execute_xs(xs); 108 1.42 mlelstv mutex_exit(chan_mtx(periph->periph_channel)); 109 1.42 mlelstv 110 1.42 mlelstv return rc; 111 1.10 enami } 112 1.2 bouyer 113 1.44 christos /* 114 1.44 christos * Load the scsiverbose module 115 1.44 christos */ 116 1.44 christos void 117 1.44 christos scsipi_load_verbose(void) 118 1.44 christos { 119 1.44 christos if (scsi_verbose_loaded == 0) 120 1.44 christos module_autoload("scsiverbose", MODULE_CLASS_MISC); 121 1.44 christos } 122 1.44 christos 123 1.2 bouyer /* 124 1.13 bouyer * allocate and init a scsipi_periph structure for a new device. 125 1.13 bouyer */ 126 1.13 bouyer struct scsipi_periph * 127 1.21 thorpej scsipi_alloc_periph(int malloc_flag) 128 1.13 bouyer { 129 1.13 bouyer struct scsipi_periph *periph; 130 1.30 reinoud u_int i; 131 1.13 bouyer 132 1.17 tsutsui periph = malloc(sizeof(*periph), M_DEVBUF, malloc_flag|M_ZERO); 133 1.13 bouyer if (periph == NULL) 134 1.13 bouyer return NULL; 135 1.13 bouyer 136 1.13 bouyer periph->periph_dev = NULL; 137 1.45 kardel periph->periph_opcs = NULL; 138 1.13 bouyer 139 1.13 bouyer /* 140 1.13 bouyer * Start with one command opening. The periph driver 141 1.13 bouyer * will grow this if it knows it can take advantage of it. 142 1.13 bouyer */ 143 1.31 perry periph->periph_openings = 1; 144 1.31 perry periph->periph_active = 0; 145 1.13 bouyer 146 1.13 bouyer for (i = 0; i < PERIPH_NTAGWORDS; i++) 147 1.13 bouyer periph->periph_freetags[i] = 0xffffffff; 148 1.13 bouyer 149 1.13 bouyer TAILQ_INIT(&periph->periph_xferq); 150 1.35 ad callout_init(&periph->periph_callout, 0); 151 1.42 mlelstv cv_init(&periph->periph_cv, "periph"); 152 1.13 bouyer 153 1.13 bouyer return periph; 154 1.13 bouyer } 155 1.13 bouyer 156 1.13 bouyer /* 157 1.42 mlelstv * cleanup and free scsipi_periph structure 158 1.42 mlelstv */ 159 1.42 mlelstv void 160 1.42 mlelstv scsipi_free_periph(struct scsipi_periph *periph) 161 1.42 mlelstv { 162 1.45 kardel scsipi_free_opcodeinfo(periph); 163 1.42 mlelstv cv_destroy(&periph->periph_cv); 164 1.42 mlelstv free(periph, M_DEVBUF); 165 1.42 mlelstv } 166 1.42 mlelstv 167 1.42 mlelstv /* 168 1.2 bouyer * Return a priority based on how much of the inquiry data matches 169 1.2 bouyer * the patterns for the particular driver. 170 1.2 bouyer */ 171 1.32 christos const void * 172 1.32 christos scsipi_inqmatch(struct scsipi_inquiry_pattern *inqbuf, const void *base, 173 1.32 christos size_t nmatches, size_t matchsize, int *bestpriority) 174 1.2 bouyer { 175 1.30 reinoud u_int8_t type; 176 1.32 christos const struct scsipi_inquiry_pattern *bestmatch; 177 1.2 bouyer 178 1.2 bouyer /* Include the qualifier to catch vendor-unique types. */ 179 1.2 bouyer type = inqbuf->type; 180 1.2 bouyer 181 1.32 christos for (*bestpriority = 0, bestmatch = 0; nmatches--; 182 1.32 christos base = (const char *)base + matchsize) { 183 1.32 christos const struct scsipi_inquiry_pattern *match = base; 184 1.2 bouyer int priority, len; 185 1.2 bouyer 186 1.2 bouyer if (type != match->type) 187 1.2 bouyer continue; 188 1.2 bouyer if (inqbuf->removable != match->removable) 189 1.2 bouyer continue; 190 1.2 bouyer priority = 2; 191 1.2 bouyer len = strlen(match->vendor); 192 1.14 thorpej if (memcmp(inqbuf->vendor, match->vendor, len)) 193 1.2 bouyer continue; 194 1.2 bouyer priority += len; 195 1.2 bouyer len = strlen(match->product); 196 1.14 thorpej if (memcmp(inqbuf->product, match->product, len)) 197 1.2 bouyer continue; 198 1.2 bouyer priority += len; 199 1.2 bouyer len = strlen(match->revision); 200 1.14 thorpej if (memcmp(inqbuf->revision, match->revision, len)) 201 1.2 bouyer continue; 202 1.2 bouyer priority += len; 203 1.2 bouyer 204 1.13 bouyer #ifdef SCSIPI_DEBUG 205 1.2 bouyer printf("scsipi_inqmatch: %d/%d/%d <%s, %s, %s>\n", 206 1.2 bouyer priority, match->type, match->removable, 207 1.2 bouyer match->vendor, match->product, match->revision); 208 1.2 bouyer #endif 209 1.2 bouyer if (priority > *bestpriority) { 210 1.2 bouyer *bestpriority = priority; 211 1.2 bouyer bestmatch = base; 212 1.2 bouyer } 213 1.2 bouyer } 214 1.2 bouyer 215 1.2 bouyer return (bestmatch); 216 1.2 bouyer } 217 1.2 bouyer 218 1.22 thorpej const char * 219 1.21 thorpej scsipi_dtype(int type) 220 1.2 bouyer { 221 1.23 thorpej const char *dtype; 222 1.3 enami 223 1.2 bouyer switch (type) { 224 1.2 bouyer case T_DIRECT: 225 1.18 soren dtype = "disk"; 226 1.4 thorpej break; 227 1.2 bouyer case T_SEQUENTIAL: 228 1.18 soren dtype = "tape"; 229 1.2 bouyer break; 230 1.2 bouyer case T_PRINTER: 231 1.2 bouyer dtype = "printer"; 232 1.2 bouyer break; 233 1.2 bouyer case T_PROCESSOR: 234 1.2 bouyer dtype = "processor"; 235 1.2 bouyer break; 236 1.4 thorpej case T_WORM: 237 1.4 thorpej dtype = "worm"; 238 1.4 thorpej break; 239 1.2 bouyer case T_CDROM: 240 1.2 bouyer dtype = "cdrom"; 241 1.2 bouyer break; 242 1.2 bouyer case T_SCANNER: 243 1.2 bouyer dtype = "scanner"; 244 1.2 bouyer break; 245 1.2 bouyer case T_OPTICAL: 246 1.2 bouyer dtype = "optical"; 247 1.2 bouyer break; 248 1.2 bouyer case T_CHANGER: 249 1.2 bouyer dtype = "changer"; 250 1.2 bouyer break; 251 1.2 bouyer case T_COMM: 252 1.2 bouyer dtype = "communication"; 253 1.4 thorpej break; 254 1.4 thorpej case T_IT8_1: 255 1.4 thorpej case T_IT8_2: 256 1.9 dante dtype = "graphic arts pre-press"; 257 1.4 thorpej break; 258 1.4 thorpej case T_STORARRAY: 259 1.4 thorpej dtype = "storage array"; 260 1.4 thorpej break; 261 1.4 thorpej case T_ENCLOSURE: 262 1.4 thorpej dtype = "enclosure services"; 263 1.9 dante break; 264 1.9 dante case T_SIMPLE_DIRECT: 265 1.9 dante dtype = "simplified direct"; 266 1.9 dante break; 267 1.9 dante case T_OPTIC_CARD_RW: 268 1.9 dante dtype = "optical card r/w"; 269 1.9 dante break; 270 1.9 dante case T_OBJECT_STORED: 271 1.9 dante dtype = "object-based storage"; 272 1.2 bouyer break; 273 1.2 bouyer case T_NODEVICE: 274 1.2 bouyer panic("scsipi_dtype: impossible device type"); 275 1.2 bouyer default: 276 1.2 bouyer dtype = "unknown"; 277 1.2 bouyer break; 278 1.2 bouyer } 279 1.3 enami return (dtype); 280 1.2 bouyer } 281