Home | History | Annotate | Line # | Download | only in scsipi
scsipiconf.c revision 1.34.32.1
      1  1.34.32.1       mjf /*	$NetBSD: scsipiconf.c,v 1.34.32.1 2007/07/11 20:08:18 mjf 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  * 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.34.32.1       mjf __KERNEL_RCSID(0, "$NetBSD: scsipiconf.c,v 1.34.32.1 2007/07/11 20:08:18 mjf 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.2    bouyer #include <dev/scsipi/scsipi_all.h>
     67        1.2    bouyer #include <dev/scsipi/scsipiconf.h>
     68       1.25   mycroft #include <dev/scsipi/scsipi_base.h>
     69       1.10     enami 
     70       1.30   reinoud #define	STRVIS_ISWHITE(x) ((x) == ' ' || (x) == '\0' || (x) == (u_char)'\377')
     71       1.12        ad 
     72       1.10     enami int
     73       1.26   mycroft scsipi_command(struct scsipi_periph *periph, struct scsipi_generic *cmd,
     74       1.30   reinoud     int cmdlen, u_char *data_addr, int datalen, int retries, int timeout,
     75       1.26   mycroft     struct buf *bp, int flags)
     76       1.10     enami {
     77       1.26   mycroft 	struct scsipi_xfer *xs;
     78       1.31     perry 
     79       1.26   mycroft 	xs = scsipi_make_xs(periph, cmd, cmdlen, data_addr, datalen, retries,
     80       1.26   mycroft 	    timeout, bp, flags);
     81       1.26   mycroft 	if (!xs)
     82       1.26   mycroft 		return (ENOMEM);
     83       1.25   mycroft 
     84       1.25   mycroft 	return (scsipi_execute_xs(xs));
     85       1.10     enami }
     86        1.2    bouyer 
     87        1.2    bouyer /*
     88       1.13    bouyer  * allocate and init a scsipi_periph structure for a new device.
     89       1.13    bouyer  */
     90       1.13    bouyer struct scsipi_periph *
     91       1.21   thorpej scsipi_alloc_periph(int malloc_flag)
     92       1.13    bouyer {
     93       1.13    bouyer 	struct scsipi_periph *periph;
     94       1.30   reinoud 	u_int i;
     95       1.13    bouyer 
     96       1.17   tsutsui 	periph = malloc(sizeof(*periph), M_DEVBUF, malloc_flag|M_ZERO);
     97       1.13    bouyer 	if (periph == NULL)
     98       1.13    bouyer 		return NULL;
     99       1.13    bouyer 
    100       1.13    bouyer 	periph->periph_dev = NULL;
    101       1.13    bouyer 
    102       1.13    bouyer 	/*
    103       1.13    bouyer 	 * Start with one command opening.  The periph driver
    104       1.13    bouyer 	 * will grow this if it knows it can take advantage of it.
    105       1.13    bouyer 	 */
    106       1.31     perry 	periph->periph_openings = 1;
    107       1.31     perry 	periph->periph_active = 0;
    108       1.13    bouyer 
    109       1.13    bouyer 	for (i = 0; i < PERIPH_NTAGWORDS; i++)
    110       1.13    bouyer 		periph->periph_freetags[i] = 0xffffffff;
    111       1.13    bouyer 
    112       1.13    bouyer 	TAILQ_INIT(&periph->periph_xferq);
    113  1.34.32.1       mjf 	callout_init(&periph->periph_callout, 0);
    114       1.13    bouyer 
    115       1.13    bouyer 	return periph;
    116       1.13    bouyer }
    117       1.13    bouyer 
    118       1.13    bouyer /*
    119        1.2    bouyer  * Return a priority based on how much of the inquiry data matches
    120        1.2    bouyer  * the patterns for the particular driver.
    121        1.2    bouyer  */
    122       1.32  christos const void *
    123       1.32  christos scsipi_inqmatch(struct scsipi_inquiry_pattern *inqbuf, const void *base,
    124       1.32  christos     size_t nmatches, size_t matchsize, int *bestpriority)
    125        1.2    bouyer {
    126       1.30   reinoud 	u_int8_t type;
    127       1.32  christos 	const struct scsipi_inquiry_pattern *bestmatch;
    128        1.2    bouyer 
    129        1.2    bouyer 	/* Include the qualifier to catch vendor-unique types. */
    130        1.2    bouyer 	type = inqbuf->type;
    131        1.2    bouyer 
    132       1.32  christos 	for (*bestpriority = 0, bestmatch = 0; nmatches--;
    133       1.32  christos 	    base = (const char *)base + matchsize) {
    134       1.32  christos 		const struct scsipi_inquiry_pattern *match = base;
    135        1.2    bouyer 		int priority, len;
    136        1.2    bouyer 
    137        1.2    bouyer 		if (type != match->type)
    138        1.2    bouyer 			continue;
    139        1.2    bouyer 		if (inqbuf->removable != match->removable)
    140        1.2    bouyer 			continue;
    141        1.2    bouyer 		priority = 2;
    142        1.2    bouyer 		len = strlen(match->vendor);
    143       1.14   thorpej 		if (memcmp(inqbuf->vendor, match->vendor, len))
    144        1.2    bouyer 			continue;
    145        1.2    bouyer 		priority += len;
    146        1.2    bouyer 		len = strlen(match->product);
    147       1.14   thorpej 		if (memcmp(inqbuf->product, match->product, len))
    148        1.2    bouyer 			continue;
    149        1.2    bouyer 		priority += len;
    150        1.2    bouyer 		len = strlen(match->revision);
    151       1.14   thorpej 		if (memcmp(inqbuf->revision, match->revision, len))
    152        1.2    bouyer 			continue;
    153        1.2    bouyer 		priority += len;
    154        1.2    bouyer 
    155       1.13    bouyer #ifdef SCSIPI_DEBUG
    156        1.2    bouyer 		printf("scsipi_inqmatch: %d/%d/%d <%s, %s, %s>\n",
    157        1.2    bouyer 		    priority, match->type, match->removable,
    158        1.2    bouyer 		    match->vendor, match->product, match->revision);
    159        1.2    bouyer #endif
    160        1.2    bouyer 		if (priority > *bestpriority) {
    161        1.2    bouyer 			*bestpriority = priority;
    162        1.2    bouyer 			bestmatch = base;
    163        1.2    bouyer 		}
    164        1.2    bouyer 	}
    165        1.2    bouyer 
    166        1.2    bouyer 	return (bestmatch);
    167        1.2    bouyer }
    168        1.2    bouyer 
    169       1.22   thorpej const char *
    170       1.21   thorpej scsipi_dtype(int type)
    171        1.2    bouyer {
    172       1.23   thorpej 	const char *dtype;
    173        1.3     enami 
    174        1.2    bouyer 	switch (type) {
    175        1.2    bouyer 	case T_DIRECT:
    176       1.18     soren 		dtype = "disk";
    177        1.4   thorpej 		break;
    178        1.2    bouyer 	case T_SEQUENTIAL:
    179       1.18     soren 		dtype = "tape";
    180        1.2    bouyer 		break;
    181        1.2    bouyer 	case T_PRINTER:
    182        1.2    bouyer 		dtype = "printer";
    183        1.2    bouyer 		break;
    184        1.2    bouyer 	case T_PROCESSOR:
    185        1.2    bouyer 		dtype = "processor";
    186        1.2    bouyer 		break;
    187        1.4   thorpej 	case T_WORM:
    188        1.4   thorpej 		dtype = "worm";
    189        1.4   thorpej 		break;
    190        1.2    bouyer 	case T_CDROM:
    191        1.2    bouyer 		dtype = "cdrom";
    192        1.2    bouyer 		break;
    193        1.2    bouyer 	case T_SCANNER:
    194        1.2    bouyer 		dtype = "scanner";
    195        1.2    bouyer 		break;
    196        1.2    bouyer 	case T_OPTICAL:
    197        1.2    bouyer 		dtype = "optical";
    198        1.2    bouyer 		break;
    199        1.2    bouyer 	case T_CHANGER:
    200        1.2    bouyer 		dtype = "changer";
    201        1.2    bouyer 		break;
    202        1.2    bouyer 	case T_COMM:
    203        1.2    bouyer 		dtype = "communication";
    204        1.4   thorpej 		break;
    205        1.4   thorpej 	case T_IT8_1:
    206        1.4   thorpej 	case T_IT8_2:
    207        1.9     dante 		dtype = "graphic arts pre-press";
    208        1.4   thorpej 		break;
    209        1.4   thorpej 	case T_STORARRAY:
    210        1.4   thorpej 		dtype = "storage array";
    211        1.4   thorpej 		break;
    212        1.4   thorpej 	case T_ENCLOSURE:
    213        1.4   thorpej 		dtype = "enclosure services";
    214        1.9     dante 		break;
    215        1.9     dante 	case T_SIMPLE_DIRECT:
    216        1.9     dante 		dtype = "simplified direct";
    217        1.9     dante 		break;
    218        1.9     dante 	case T_OPTIC_CARD_RW:
    219        1.9     dante 		dtype = "optical card r/w";
    220        1.9     dante 		break;
    221        1.9     dante 	case T_OBJECT_STORED:
    222        1.9     dante 		dtype = "object-based storage";
    223        1.2    bouyer 		break;
    224        1.2    bouyer 	case T_NODEVICE:
    225        1.2    bouyer 		panic("scsipi_dtype: impossible device type");
    226        1.2    bouyer 	default:
    227        1.2    bouyer 		dtype = "unknown";
    228        1.2    bouyer 		break;
    229        1.2    bouyer 	}
    230        1.3     enami 	return (dtype);
    231        1.2    bouyer }
    232        1.2    bouyer 
    233        1.2    bouyer void
    234       1.33  christos scsipi_strvis(u_char *dst, int dlen, const u_char *src, int slen)
    235        1.2    bouyer {
    236        1.2    bouyer 
    237        1.2    bouyer 	/* Trim leading and trailing blanks and NULs. */
    238       1.12        ad 	while (slen > 0 && STRVIS_ISWHITE(src[0]))
    239        1.5  drochner 		++src, --slen;
    240       1.12        ad 	while (slen > 0 && STRVIS_ISWHITE(src[slen - 1]))
    241        1.5  drochner 		--slen;
    242        1.2    bouyer 
    243        1.5  drochner 	while (slen > 0) {
    244        1.2    bouyer 		if (*src < 0x20 || *src >= 0x80) {
    245        1.2    bouyer 			/* non-printable characters */
    246        1.5  drochner 			dlen -= 4;
    247        1.5  drochner 			if (dlen < 1)
    248        1.5  drochner 				break;
    249        1.2    bouyer 			*dst++ = '\\';
    250        1.2    bouyer 			*dst++ = ((*src & 0300) >> 6) + '0';
    251        1.2    bouyer 			*dst++ = ((*src & 0070) >> 3) + '0';
    252        1.2    bouyer 			*dst++ = ((*src & 0007) >> 0) + '0';
    253        1.2    bouyer 		} else if (*src == '\\') {
    254        1.2    bouyer 			/* quote characters */
    255        1.5  drochner 			dlen -= 2;
    256        1.5  drochner 			if (dlen < 1)
    257        1.5  drochner 				break;
    258        1.2    bouyer 			*dst++ = '\\';
    259        1.2    bouyer 			*dst++ = '\\';
    260        1.2    bouyer 		} else {
    261        1.2    bouyer 			/* normal characters */
    262        1.5  drochner 			if (--dlen < 1)
    263        1.5  drochner 				break;
    264        1.2    bouyer 			*dst++ = *src;
    265        1.2    bouyer 		}
    266        1.5  drochner 		++src, --slen;
    267        1.2    bouyer 	}
    268        1.2    bouyer 
    269        1.2    bouyer 	*dst++ = 0;
    270        1.2    bouyer }
    271