Home | History | Annotate | Line # | Download | only in scsipi
scsipiconf.c revision 1.12.2.10
      1   1.12.2.9   nathanw /*	$NetBSD: scsipiconf.c,v 1.12.2.10 2002/11/11 22:12:20 nathanw Exp $	*/
      2        1.2    bouyer 
      3        1.7   mycroft /*-
      4   1.12.2.2   nathanw  * 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.12.2.2   nathanw  * by Charles M. Hannum; by Jason R. Thorpe of the Numerical Aerospace
      9   1.12.2.2   nathanw  * 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.12.2.4   nathanw 
     57   1.12.2.4   nathanw #include <sys/cdefs.h>
     58   1.12.2.9   nathanw __KERNEL_RCSID(0, "$NetBSD: scsipiconf.c,v 1.12.2.10 2002/11/11 22:12:20 nathanw 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.12.2.2   nathanw scsipi_command(periph, cmd, cmdlen, data_addr, datalen, retries, timeout, bp,
     75   1.12.2.2   nathanw      flags)
     76   1.12.2.2   nathanw 	struct scsipi_periph *periph;
     77       1.10     enami 	struct scsipi_generic *cmd;
     78       1.10     enami 	int cmdlen;
     79       1.10     enami 	u_char *data_addr;
     80       1.10     enami 	int datalen;
     81       1.10     enami 	int retries;
     82       1.10     enami 	int timeout;
     83       1.10     enami 	struct buf *bp;
     84       1.10     enami 	int flags;
     85       1.10     enami {
     86       1.10     enami 	int error;
     87   1.12.2.2   nathanw 
     88       1.10     enami 	if ((flags & XS_CTL_DATA_ONSTACK) != 0) {
     89       1.10     enami 		/*
     90       1.10     enami 		 * If the I/O buffer is allocated on stack, the
     91       1.10     enami 		 * process must NOT be swapped out, as the device will
     92       1.10     enami 		 * be accessing the stack.
     93       1.10     enami 		 */
     94   1.12.2.7   nathanw 		PHOLD(curlwp);
     95       1.10     enami 	}
     96   1.12.2.2   nathanw 	error = (*periph->periph_channel->chan_bustype->bustype_cmd)(periph,
     97   1.12.2.2   nathanw 	    cmd, cmdlen, data_addr, datalen, retries, timeout, bp, flags);
     98       1.10     enami 	if ((flags & XS_CTL_DATA_ONSTACK) != 0)
     99   1.12.2.7   nathanw 		PRELE(curlwp);
    100       1.10     enami 	return (error);
    101       1.10     enami }
    102        1.2    bouyer 
    103        1.2    bouyer /*
    104   1.12.2.2   nathanw  * allocate and init a scsipi_periph structure for a new device.
    105   1.12.2.2   nathanw  */
    106   1.12.2.2   nathanw struct scsipi_periph *
    107   1.12.2.2   nathanw scsipi_alloc_periph(malloc_flag)
    108   1.12.2.2   nathanw 	int malloc_flag;
    109   1.12.2.2   nathanw {
    110   1.12.2.2   nathanw 	struct scsipi_periph *periph;
    111  1.12.2.10   nathanw 	u_int i;
    112   1.12.2.2   nathanw 
    113   1.12.2.6   nathanw 	periph = malloc(sizeof(*periph), M_DEVBUF, malloc_flag|M_ZERO);
    114   1.12.2.2   nathanw 	if (periph == NULL)
    115   1.12.2.2   nathanw 		return NULL;
    116   1.12.2.2   nathanw 
    117   1.12.2.2   nathanw 	periph->periph_dev = NULL;
    118   1.12.2.2   nathanw 
    119   1.12.2.2   nathanw 	/*
    120   1.12.2.2   nathanw 	 * Start with one command opening.  The periph driver
    121   1.12.2.2   nathanw 	 * will grow this if it knows it can take advantage of it.
    122   1.12.2.2   nathanw 	 */
    123   1.12.2.2   nathanw 	periph->periph_openings = 1;
    124   1.12.2.2   nathanw 	periph->periph_active = 0;
    125   1.12.2.2   nathanw 
    126   1.12.2.2   nathanw 	for (i = 0; i < PERIPH_NTAGWORDS; i++)
    127   1.12.2.2   nathanw 		periph->periph_freetags[i] = 0xffffffff;
    128   1.12.2.2   nathanw 
    129   1.12.2.2   nathanw 	TAILQ_INIT(&periph->periph_xferq);
    130   1.12.2.2   nathanw 	callout_init(&periph->periph_callout);
    131   1.12.2.2   nathanw 
    132   1.12.2.2   nathanw 	return periph;
    133   1.12.2.2   nathanw }
    134   1.12.2.2   nathanw 
    135   1.12.2.2   nathanw /*
    136        1.2    bouyer  * Return a priority based on how much of the inquiry data matches
    137        1.2    bouyer  * the patterns for the particular driver.
    138        1.2    bouyer  */
    139        1.2    bouyer caddr_t
    140        1.2    bouyer scsipi_inqmatch(inqbuf, base, nmatches, matchsize, bestpriority)
    141        1.2    bouyer 	struct scsipi_inquiry_pattern *inqbuf;
    142        1.2    bouyer 	caddr_t base;
    143        1.2    bouyer 	int nmatches, matchsize;
    144        1.2    bouyer 	int *bestpriority;
    145        1.2    bouyer {
    146        1.2    bouyer 	u_int8_t type;
    147        1.2    bouyer 	caddr_t bestmatch;
    148        1.2    bouyer 
    149        1.2    bouyer 	/* Include the qualifier to catch vendor-unique types. */
    150        1.2    bouyer 	type = inqbuf->type;
    151        1.2    bouyer 
    152        1.2    bouyer 	for (*bestpriority = 0, bestmatch = 0; nmatches--; base += matchsize) {
    153        1.2    bouyer 		struct scsipi_inquiry_pattern *match = (void *)base;
    154        1.2    bouyer 		int priority, len;
    155        1.2    bouyer 
    156        1.2    bouyer 		if (type != match->type)
    157        1.2    bouyer 			continue;
    158        1.2    bouyer 		if (inqbuf->removable != match->removable)
    159        1.2    bouyer 			continue;
    160        1.2    bouyer 		priority = 2;
    161        1.2    bouyer 		len = strlen(match->vendor);
    162   1.12.2.3   nathanw 		if (memcmp(inqbuf->vendor, match->vendor, len))
    163        1.2    bouyer 			continue;
    164        1.2    bouyer 		priority += len;
    165        1.2    bouyer 		len = strlen(match->product);
    166   1.12.2.3   nathanw 		if (memcmp(inqbuf->product, match->product, len))
    167        1.2    bouyer 			continue;
    168        1.2    bouyer 		priority += len;
    169        1.2    bouyer 		len = strlen(match->revision);
    170   1.12.2.3   nathanw 		if (memcmp(inqbuf->revision, match->revision, len))
    171        1.2    bouyer 			continue;
    172        1.2    bouyer 		priority += len;
    173        1.2    bouyer 
    174   1.12.2.2   nathanw #ifdef SCSIPI_DEBUG
    175        1.2    bouyer 		printf("scsipi_inqmatch: %d/%d/%d <%s, %s, %s>\n",
    176        1.2    bouyer 		    priority, match->type, match->removable,
    177        1.2    bouyer 		    match->vendor, match->product, match->revision);
    178        1.2    bouyer #endif
    179        1.2    bouyer 		if (priority > *bestpriority) {
    180        1.2    bouyer 			*bestpriority = priority;
    181        1.2    bouyer 			bestmatch = base;
    182        1.2    bouyer 		}
    183        1.2    bouyer 	}
    184        1.2    bouyer 
    185        1.2    bouyer 	return (bestmatch);
    186        1.2    bouyer }
    187        1.2    bouyer 
    188        1.2    bouyer char *
    189        1.2    bouyer scsipi_dtype(type)
    190        1.2    bouyer 	int type;
    191        1.2    bouyer {
    192        1.2    bouyer 	char *dtype;
    193        1.3     enami 
    194        1.2    bouyer 	switch (type) {
    195        1.2    bouyer 	case T_DIRECT:
    196   1.12.2.9   nathanw 		dtype = "disk";
    197        1.4   thorpej 		break;
    198        1.2    bouyer 	case T_SEQUENTIAL:
    199   1.12.2.9   nathanw 		dtype = "tape";
    200        1.2    bouyer 		break;
    201        1.2    bouyer 	case T_PRINTER:
    202        1.2    bouyer 		dtype = "printer";
    203        1.2    bouyer 		break;
    204        1.2    bouyer 	case T_PROCESSOR:
    205        1.2    bouyer 		dtype = "processor";
    206        1.2    bouyer 		break;
    207        1.4   thorpej 	case T_WORM:
    208        1.4   thorpej 		dtype = "worm";
    209        1.4   thorpej 		break;
    210        1.2    bouyer 	case T_CDROM:
    211        1.2    bouyer 		dtype = "cdrom";
    212        1.2    bouyer 		break;
    213        1.2    bouyer 	case T_SCANNER:
    214        1.2    bouyer 		dtype = "scanner";
    215        1.2    bouyer 		break;
    216        1.2    bouyer 	case T_OPTICAL:
    217        1.2    bouyer 		dtype = "optical";
    218        1.2    bouyer 		break;
    219        1.2    bouyer 	case T_CHANGER:
    220        1.2    bouyer 		dtype = "changer";
    221        1.2    bouyer 		break;
    222        1.2    bouyer 	case T_COMM:
    223        1.2    bouyer 		dtype = "communication";
    224        1.4   thorpej 		break;
    225        1.4   thorpej 	case T_IT8_1:
    226        1.4   thorpej 	case T_IT8_2:
    227        1.9     dante 		dtype = "graphic arts pre-press";
    228        1.4   thorpej 		break;
    229        1.4   thorpej 	case T_STORARRAY:
    230        1.4   thorpej 		dtype = "storage array";
    231        1.4   thorpej 		break;
    232        1.4   thorpej 	case T_ENCLOSURE:
    233        1.4   thorpej 		dtype = "enclosure services";
    234        1.9     dante 		break;
    235        1.9     dante 	case T_SIMPLE_DIRECT:
    236        1.9     dante 		dtype = "simplified direct";
    237        1.9     dante 		break;
    238        1.9     dante 	case T_OPTIC_CARD_RW:
    239        1.9     dante 		dtype = "optical card r/w";
    240        1.9     dante 		break;
    241        1.9     dante 	case T_OBJECT_STORED:
    242        1.9     dante 		dtype = "object-based storage";
    243        1.2    bouyer 		break;
    244        1.2    bouyer 	case T_NODEVICE:
    245        1.2    bouyer 		panic("scsipi_dtype: impossible device type");
    246        1.2    bouyer 	default:
    247        1.2    bouyer 		dtype = "unknown";
    248        1.2    bouyer 		break;
    249        1.2    bouyer 	}
    250        1.3     enami 	return (dtype);
    251        1.2    bouyer }
    252        1.2    bouyer 
    253        1.2    bouyer void
    254        1.5  drochner scsipi_strvis(dst, dlen, src, slen)
    255        1.2    bouyer 	u_char *dst, *src;
    256        1.5  drochner 	int dlen, slen;
    257        1.2    bouyer {
    258        1.2    bouyer 
    259        1.2    bouyer 	/* Trim leading and trailing blanks and NULs. */
    260       1.12        ad 	while (slen > 0 && STRVIS_ISWHITE(src[0]))
    261        1.5  drochner 		++src, --slen;
    262       1.12        ad 	while (slen > 0 && STRVIS_ISWHITE(src[slen - 1]))
    263        1.5  drochner 		--slen;
    264        1.2    bouyer 
    265        1.5  drochner 	while (slen > 0) {
    266        1.2    bouyer 		if (*src < 0x20 || *src >= 0x80) {
    267        1.2    bouyer 			/* non-printable characters */
    268        1.5  drochner 			dlen -= 4;
    269        1.5  drochner 			if (dlen < 1)
    270        1.5  drochner 				break;
    271        1.2    bouyer 			*dst++ = '\\';
    272        1.2    bouyer 			*dst++ = ((*src & 0300) >> 6) + '0';
    273        1.2    bouyer 			*dst++ = ((*src & 0070) >> 3) + '0';
    274        1.2    bouyer 			*dst++ = ((*src & 0007) >> 0) + '0';
    275        1.2    bouyer 		} else if (*src == '\\') {
    276        1.2    bouyer 			/* quote characters */
    277        1.5  drochner 			dlen -= 2;
    278        1.5  drochner 			if (dlen < 1)
    279        1.5  drochner 				break;
    280        1.2    bouyer 			*dst++ = '\\';
    281        1.2    bouyer 			*dst++ = '\\';
    282        1.2    bouyer 		} else {
    283        1.2    bouyer 			/* normal characters */
    284        1.5  drochner 			if (--dlen < 1)
    285        1.5  drochner 				break;
    286        1.2    bouyer 			*dst++ = *src;
    287        1.2    bouyer 		}
    288        1.5  drochner 		++src, --slen;
    289        1.2    bouyer 	}
    290        1.2    bouyer 
    291        1.2    bouyer 	*dst++ = 0;
    292        1.2    bouyer }
    293