Home | History | Annotate | Line # | Download | only in ic
uhavar.h revision 1.7 
      1 /*	$NetBSD: uhavar.h,v 1.7 1997/11/04 05:58:30 thorpej Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1994, 1996, 1997 Charles M. Hannum.  All rights reserved.
      5  *
      6  * Redistribution and use in source and binary forms, with or without
      7  * modification, are permitted provided that the following conditions
      8  * are met:
      9  * 1. Redistributions of source code must retain the above copyright
     10  *    notice, this list of conditions and the following disclaimer.
     11  * 2. Redistributions in binary form must reproduce the above copyright
     12  *    notice, this list of conditions and the following disclaimer in the
     13  *    documentation and/or other materials provided with the distribution.
     14  * 3. All advertising materials mentioning features or use of this software
     15  *    must display the following acknowledgement:
     16  *	This product includes software developed by Charles M. Hannum.
     17  * 4. The name of the author may not be used to endorse or promote products
     18  *    derived from this software without specific prior written permission.
     19  *
     20  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     21  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     22  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     23  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     24  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     25  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     26  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     27  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     28  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     29  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     30  */
     31 
     32 #include <sys/queue.h>
     33 
     34 #define UHA_MSCP_MAX	32	/* store up to 32 MSCPs at one time */
     35 #define	MSCP_HASH_SIZE	32	/* hash table size for phystokv */
     36 #define	MSCP_HASH_SHIFT	9
     37 #define MSCP_HASH(x)	((((long)(x))>>MSCP_HASH_SHIFT) & (MSCP_HASH_SIZE - 1))
     38 
     39 struct uha_softc {
     40 	struct device sc_dev;
     41 
     42 	bus_space_tag_t sc_iot;
     43 	bus_space_handle_t sc_ioh;
     44 	bus_dma_tag_t	sc_dmat;
     45 	void *sc_ih;
     46 
     47 	int sc_dmaflags;	/* bus-specific DMA map creation flags */
     48 
     49 	void (*start_mbox) __P((struct uha_softc *, struct uha_mscp *));
     50 	int (*poll) __P((struct uha_softc *, struct scsipi_xfer *, int));
     51 	void (*init) __P((struct uha_softc *));
     52 
     53 	struct uha_mscp *sc_mscphash[MSCP_HASH_SIZE];
     54 	TAILQ_HEAD(, uha_mscp) sc_free_mscp;
     55 	int sc_nummscps;
     56 	struct scsipi_link sc_link;
     57 
     58 	LIST_HEAD(, scsipi_xfer) sc_queue;
     59 	struct scsipi_xfer *sc_queuelast;
     60 };
     61 
     62 struct uha_probe_data {
     63 	int sc_irq, sc_drq;
     64 	int sc_scsi_dev;
     65 };
     66 
     67 void	uha_attach __P((struct uha_softc *, struct uha_probe_data *));
     68 void	uha_timeout __P((void *arg));
     69 struct	uha_mscp *uha_mscp_phys_kv __P((struct uha_softc *, u_long));
     70 void	uha_done __P((struct uha_softc *, struct uha_mscp *));
     71