Home | History | Annotate | Line # | Download | only in qbus
ubavar.h revision 1.24
      1  1.23    ragge /*	$NetBSD: ubavar.h,v 1.24 1999/05/27 16:04:48 ragge Exp $	*/
      2   1.2      cgd 
      3   1.1    ragge /*
      4   1.1    ragge  * Copyright (c) 1982, 1986 Regents of the University of California.
      5   1.1    ragge  * All rights reserved.
      6   1.1    ragge  *
      7   1.1    ragge  * Redistribution and use in source and binary forms, with or without
      8   1.1    ragge  * modification, are permitted provided that the following conditions
      9   1.1    ragge  * are met:
     10   1.1    ragge  * 1. Redistributions of source code must retain the above copyright
     11   1.1    ragge  *    notice, this list of conditions and the following disclaimer.
     12   1.1    ragge  * 2. Redistributions in binary form must reproduce the above copyright
     13   1.1    ragge  *    notice, this list of conditions and the following disclaimer in the
     14   1.1    ragge  *    documentation and/or other materials provided with the distribution.
     15   1.1    ragge  * 3. All advertising materials mentioning features or use of this software
     16   1.1    ragge  *    must display the following acknowledgement:
     17   1.1    ragge  *	This product includes software developed by the University of
     18   1.1    ragge  *	California, Berkeley and its contributors.
     19   1.1    ragge  * 4. Neither the name of the University nor the names of its contributors
     20   1.1    ragge  *    may be used to endorse or promote products derived from this software
     21   1.1    ragge  *    without specific prior written permission.
     22   1.1    ragge  *
     23   1.1    ragge  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24   1.1    ragge  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25   1.1    ragge  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26   1.1    ragge  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27   1.1    ragge  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28   1.1    ragge  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29   1.1    ragge  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30   1.1    ragge  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31   1.1    ragge  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32   1.1    ragge  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33   1.1    ragge  * SUCH DAMAGE.
     34   1.1    ragge  *
     35   1.2      cgd  *	@(#)ubavar.h	7.7 (Berkeley) 6/28/90
     36   1.1    ragge  */
     37   1.1    ragge 
     38   1.1    ragge /*
     39   1.1    ragge  * This file contains definitions related to the kernel structures
     40   1.1    ragge  * for dealing with the unibus adapters.
     41   1.1    ragge  *
     42   1.7    ragge  * Each uba has a uba_softc structure.
     43   1.1    ragge  * Each unibus controller which is not a device has a uba_ctlr structure.
     44   1.1    ragge  * Each unibus device has a uba_device structure.
     45   1.1    ragge  */
     46   1.1    ragge 
     47  1.10  mycroft #include <sys/buf.h>
     48  1.10  mycroft #include <sys/device.h>
     49  1.12    ragge 
     50  1.12    ragge #include <machine/trap.h> /* For struct ivec_dsp */
     51   1.1    ragge /*
     52   1.1    ragge  * Per-uba structure.
     53   1.1    ragge  *
     54   1.1    ragge  * This structure holds the interrupt vector for the uba,
     55   1.1    ragge  * and its address in physical and virtual space.  At boot time
     56   1.1    ragge  * we determine the devices attached to the uba's and their
     57   1.1    ragge  * interrupt vectors, filling in uh_vec.  We free the map
     58   1.1    ragge  * register and bdp resources of the uba into the structures
     59   1.1    ragge  * defined here.
     60   1.1    ragge  *
     61   1.1    ragge  * During normal operation, resources are allocated and returned
     62   1.1    ragge  * to the structures here.  We watch the number of passive releases
     63   1.1    ragge  * on each uba, and if the number is excessive may reset the uba.
     64   1.1    ragge  *
     65   1.1    ragge  * When uba resources are needed and not available, or if a device
     66   1.1    ragge  * which can tolerate no other uba activity (rk07) gets on the bus,
     67   1.1    ragge  * then device drivers may have to wait to get to the bus and are
     68   1.1    ragge  * queued here.  It is also possible for processes to block in
     69   1.1    ragge  * the unibus driver in resource wait (mrwant, bdpwant); these
     70   1.1    ragge  * wait states are also recorded here.
     71   1.1    ragge  */
     72   1.7    ragge struct	uba_softc {
     73   1.7    ragge 	struct	device uh_dev;		/* Device struct, autoconfig */
     74  1.18    ragge 	SIMPLEQ_HEAD(, uba_unit) uh_resq;	/* resource wait chain */
     75   1.1    ragge 	int	uh_type;		/* type of adaptor */
     76   1.1    ragge 	struct	uba_regs *uh_uba;	/* virt addr of uba adaptor regs */
     77   1.1    ragge 	struct	pte *uh_mr;		/* start of page map */
     78   1.1    ragge 	int	uh_memsize;		/* size of uba memory, pages */
     79   1.1    ragge 	caddr_t	uh_iopage;		/* start of uba io page */
     80  1.15    ragge 	void	(**uh_reset) __P((int));/* UBA reset function array */
     81  1.14    ragge 	int	*uh_resarg;		/* array of ubareset args */
     82  1.14    ragge 	int	uh_resno;		/* Number of devices to reset */
     83   1.1    ragge 	short	uh_mrwant;		/* someone is waiting for map reg */
     84   1.1    ragge 	short	uh_bdpwant;		/* someone awaits bdp's */
     85   1.1    ragge 	int	uh_bdpfree;		/* free bdp's */
     86   1.1    ragge 	int	uh_zvcnt;		/* number of recent 0 vectors */
     87   1.1    ragge 	long	uh_zvtime;		/* time over which zvcnt accumulated */
     88   1.1    ragge 	int	uh_zvtotal;		/* total number of 0 vectors */
     89   1.1    ragge 	int	uh_lastiv;		/* last free interrupt vector */
     90   1.1    ragge 	short	uh_users;		/* transient bdp use count */
     91   1.1    ragge 	short	uh_xclu;		/* an rk07 is using this uba! */
     92   1.1    ragge 	int	uh_lastmem;		/* limit of any unibus memory */
     93   1.1    ragge 	struct	map *uh_map;		/* register free map */
     94  1.18    ragge 	int	(*uh_errchk) __P((struct uba_softc *));
     95  1.18    ragge 	void	(*uh_beforescan) __P((struct uba_softc *));
     96  1.18    ragge 	void	(*uh_afterscan) __P((struct uba_softc *));
     97  1.18    ragge 	void	(*uh_ubainit) __P((struct uba_softc *));
     98  1.18    ragge 	void	(*uh_ubapurge) __P((struct uba_softc *, int));
     99  1.18    ragge 	short	uh_nr;			/* Unibus sequential number */
    100  1.18    ragge 	short	uh_nbdp;		/* # of BDP's */
    101  1.21    ragge 	int	uh_ibase;		/* Base address for vectors */
    102  1.23    ragge 	bus_space_tag_t	uh_iot;		/* Tag for this Unibus */
    103  1.22    ragge 	bus_space_handle_t uh_ioh;	/* Handle for I/O space */
    104   1.1    ragge };
    105   1.1    ragge 
    106  1.18    ragge #define	UAMSIZ	100
    107  1.18    ragge 
    108   1.1    ragge /*
    109   1.1    ragge  * Per-controller structure.
    110  1.16    ragge  * The unit struct is common to both the adapter and the controller
    111  1.16    ragge  * to which it belongs. It is only used on controllers that handles
    112  1.16    ragge  * BDP's, and calls the adapter queueing subroutines.
    113  1.16    ragge  */
    114  1.16    ragge struct	uba_unit {
    115  1.18    ragge 	SIMPLEQ_ENTRY(uba_unit) uu_resq;/* Queue while waiting for resources */
    116  1.16    ragge 	void	*uu_softc;	/* Pointer to units softc */
    117  1.16    ragge 	int	uu_ubinfo;	/* save unibus registers, etc */
    118  1.16    ragge 	int	uu_bdp;		/* for controllers that hang on to bdp's */
    119  1.18    ragge 	int    (*uu_ready) __P((struct uba_unit *));
    120  1.16    ragge 	short   uu_xclu;        /* want exclusive use of bdp's */
    121  1.16    ragge 	short   uu_keepbdp;     /* hang on to bdp's once allocated */
    122   1.1    ragge };
    123   1.8    ragge 
    124   1.8    ragge /*
    125   1.8    ragge  * uba_attach_args is used during autoconfiguration. It is sent
    126   1.8    ragge  * from ubascan() to each (possible) device.
    127   1.8    ragge  */
    128   1.8    ragge struct uba_attach_args {
    129  1.23    ragge 	bus_space_tag_t	ua_iot;		/* Tag for this bus I/O-space */
    130  1.23    ragge 	bus_addr_t	ua_ioh;		/* I/O regs addr */
    131  1.22    ragge 		    /* Pointer to int routine, filled in by probe*/
    132  1.22    ragge 	void		(*ua_ivec) __P((int));
    133  1.22    ragge 		    /* UBA reset routine, filled in by probe */
    134  1.22    ragge 	void		(*ua_reset) __P((int));
    135  1.23    ragge 	int		ua_iaddr;	/* Full CSR address of device */
    136  1.23    ragge 	int		ua_br;		/* IPL this dev interrupted on */
    137  1.23    ragge 	int		ua_cvec;	/* Vector for this device */
    138   1.8    ragge };
    139   1.1    ragge 
    140   1.1    ragge /*
    141   1.1    ragge  * Flags to UBA map/bdp allocation routines
    142   1.1    ragge  */
    143   1.1    ragge #define	UBA_NEEDBDP	0x01		/* transfer needs a bdp */
    144   1.1    ragge #define	UBA_CANTWAIT	0x02		/* don't block me */
    145   1.1    ragge #define	UBA_NEED16	0x04		/* need 16 bit addresses only */
    146   1.1    ragge #define	UBA_HAVEBDP	0x08		/* use bdp specified in high bits */
    147   1.1    ragge 
    148   1.1    ragge /*
    149   1.1    ragge  * Macros to bust return word from map allocation routines.
    150   1.1    ragge  * SHOULD USE STRUCTURE TO STORE UBA RESOURCE ALLOCATION:
    151   1.1    ragge  */
    152   1.1    ragge #ifdef notyet
    153   1.1    ragge struct ubinfo {
    154   1.1    ragge 	long	ub_addr;	/* unibus address: mr + boff */
    155   1.1    ragge 	int	ub_nmr;		/* number of registers, 0 if empty */
    156   1.1    ragge 	int	ub_bdp;		/* bdp number, 0 if none */
    157   1.1    ragge };
    158   1.1    ragge #define	UBAI_MR(i)	(((i) >> 9) & 0x7ff)	/* starting map register */
    159   1.1    ragge #define	UBAI_BOFF(i)	((i)&0x1ff)		/* page offset */
    160   1.1    ragge #else
    161   1.1    ragge #define	UBAI_BDP(i)	((int)(((unsigned)(i)) >> 28))
    162   1.1    ragge #define	BDPMASK		0xf0000000
    163   1.1    ragge #define	UBAI_NMR(i)	((int)((i) >> 20) & 0xff)	/* max 255 (=127.5K) */
    164   1.1    ragge #define	UBA_MAXNMR	255
    165   1.1    ragge #define	UBAI_MR(i)	((int)((i) >> 9) & 0x7ff)	/* max 2047 */
    166   1.1    ragge #define	UBA_MAXMR	2047
    167   1.1    ragge #define	UBAI_BOFF(i)	((int)((i) & 0x1ff))
    168   1.1    ragge #define	UBAI_ADDR(i)	((int)((i) & 0xfffff))	/* uba addr (boff+mr) */
    169   1.1    ragge #define	UBAI_INFO(off, mr, nmr, bdp) \
    170   1.1    ragge 	(((bdp) << 28) | ((nmr) << 20) | ((mr) << 9) | (off))
    171   1.1    ragge #endif
    172   1.1    ragge 
    173   1.9  mycroft #ifndef _LOCORE
    174   1.6      jtc #ifdef _KERNEL
    175  1.18    ragge #define	ubago(ui)	ubaqueue(ui)
    176  1.16    ragge #define b_forw  b_hash.le_next	/* Nice to have when handling uba queues */
    177   1.8    ragge 
    178  1.20    ragge void	uba_attach __P((struct uba_softc *, unsigned long));
    179  1.18    ragge int	uballoc __P((struct uba_softc *, caddr_t, int, int));
    180  1.18    ragge void	ubarelse __P((struct uba_softc *, int *));
    181  1.18    ragge int	ubaqueue __P((struct uba_unit *, struct buf *));
    182  1.16    ragge void	ubadone __P((struct uba_unit *));
    183  1.15    ragge void	ubareset __P((int));
    184  1.20    ragge int	ubasetup __P((struct uba_softc *, struct buf *, int));
    185   1.1    ragge 
    186   1.6      jtc #endif /* _KERNEL */
    187   1.9  mycroft #endif !_LOCORE
    188