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