Home | History | Annotate | Line # | Download | only in qbus
uba.c revision 1.73.6.1
      1 /*	$NetBSD: uba.c,v 1.73.6.1 2006/04/22 11:39:25 simonb Exp $	   */
      2 /*
      3  * Copyright (c) 1982, 1986 The Regents of the University of California.
      4  * 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. Neither the name of the University nor the names of its contributors
     15  *    may be used to endorse or promote products derived from this software
     16  *    without specific prior written permission.
     17  *
     18  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     19  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     20  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     21  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     22  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     23  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     24  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     25  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     26  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     27  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     28  * SUCH DAMAGE.
     29  *
     30  *	@(#)uba.c	7.10 (Berkeley) 12/16/90
     31  *	@(#)autoconf.c	7.20 (Berkeley) 5/9/91
     32  */
     33 
     34 /*
     35  * Copyright (c) 1996 Jonathan Stone.
     36  * Copyright (c) 1994, 1996 Ludd, University of Lule}, Sweden.
     37  * All rights reserved.
     38  *
     39  * Redistribution and use in source and binary forms, with or without
     40  * modification, are permitted provided that the following conditions
     41  * are met:
     42  * 1. Redistributions of source code must retain the above copyright
     43  *    notice, this list of conditions and the following disclaimer.
     44  * 2. Redistributions in binary form must reproduce the above copyright
     45  *    notice, this list of conditions and the following disclaimer in the
     46  *    documentation and/or other materials provided with the distribution.
     47  * 3. All advertising materials mentioning features or use of this software
     48  *    must display the following acknowledgement:
     49  *	This product includes software developed by the University of
     50  *	California, Berkeley and its contributors.
     51  * 4. Neither the name of the University nor the names of its contributors
     52  *    may be used to endorse or promote products derived from this software
     53  *    without specific prior written permission.
     54  *
     55  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     56  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     57  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     58  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     59  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     60  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     61  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     62  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     63  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     64  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     65  * SUCH DAMAGE.
     66  *
     67  *	@(#)uba.c	7.10 (Berkeley) 12/16/90
     68  *	@(#)autoconf.c	7.20 (Berkeley) 5/9/91
     69  */
     70 
     71 #include <sys/cdefs.h>
     72 __KERNEL_RCSID(0, "$NetBSD: uba.c,v 1.73.6.1 2006/04/22 11:39:25 simonb Exp $");
     73 
     74 #include <sys/param.h>
     75 #include <sys/time.h>
     76 #include <sys/systm.h>
     77 #include <sys/buf.h>
     78 #include <sys/proc.h>
     79 #include <sys/user.h>
     80 #include <sys/conf.h>
     81 #include <sys/kernel.h>
     82 #include <sys/malloc.h>
     83 #include <sys/device.h>
     84 
     85 #include <uvm/uvm_extern.h>
     86 
     87 #include <machine/bus.h>
     88 #include <machine/scb.h>
     89 #include <machine/cpu.h>
     90 
     91 #include <dev/qbus/ubareg.h>
     92 #include <dev/qbus/ubavar.h>
     93 
     94 #include "ioconf.h"
     95 #include "locators.h"
     96 
     97 static int ubasearch (struct device *, struct cfdata *,
     98 		      const int *, void *);
     99 static int ubaprint (void *, const char *);
    100 
    101 /*
    102  * If we failed to allocate uba resources, put us on a queue to wait
    103  * until there is available resources. Resources to compete about
    104  * are map registers and BDPs. This is normally only a problem on
    105  * Unibus systems, Qbus systems have more map registers than usable.
    106  */
    107 void
    108 uba_enqueue(struct uba_unit *uu)
    109 {
    110 	struct uba_softc *uh;
    111 	int s;
    112 
    113 	uh = (void *)device_parent((struct device *)(uu->uu_softc));
    114 
    115 	s = spluba();
    116 	SIMPLEQ_INSERT_TAIL(&uh->uh_resq, uu, uu_resq);
    117 	splx(s);
    118 }
    119 
    120 /*
    121  * When a routine that uses resources is finished, the next device
    122  * in queue for map registers etc is called. If it succeeds to get
    123  * resources, call next, and next, and next...
    124  * This routine must be called at spluba.
    125  */
    126 void
    127 uba_done(struct uba_softc *uh)
    128 {
    129 	struct uba_unit *uu;
    130 
    131 	while ((uu = SIMPLEQ_FIRST(&uh->uh_resq))) {
    132 		SIMPLEQ_REMOVE_HEAD(&uh->uh_resq, uu_resq);
    133 		if ((*uu->uu_ready)(uu) == 0) {
    134 			SIMPLEQ_INSERT_HEAD(&uh->uh_resq, uu, uu_resq);
    135 			break;
    136 		}
    137 	}
    138 }
    139 
    140 /*
    141  * Each device that needs some handling if an ubareset occurs must
    142  * register for reset first through this routine.
    143  */
    144 void
    145 uba_reset_establish(void (*reset)(struct device *), struct device *dev)
    146 {
    147 	struct uba_softc *uh = (void *)device_parent(dev);
    148 	struct uba_reset *ur;
    149 
    150 	ur = malloc(sizeof(struct uba_reset), M_DEVBUF, M_NOWAIT);
    151 	if (ur == NULL)
    152 		panic("uba_reset_establish");
    153 	ur->ur_dev = dev;
    154 	ur->ur_reset = reset;
    155 
    156 	SIMPLEQ_INSERT_TAIL(&uh->uh_resetq, ur, ur_resetq);
    157 }
    158 
    159 /*
    160  * Allocate a bunch of map registers and map them to the given address.
    161  */
    162 int
    163 uballoc(struct uba_softc *uh, struct ubinfo *ui, int flags)
    164 {
    165 	int waitok = (flags & UBA_CANTWAIT) == 0;
    166 	int error;
    167 
    168 	if ((error = bus_dmamap_create(uh->uh_dmat, ui->ui_size, 1,
    169 	    ui->ui_size, 0, (waitok ? BUS_DMA_WAITOK : BUS_DMA_NOWAIT),
    170 	    &ui->ui_dmam)))
    171 		return error;
    172 
    173 	if ((error = bus_dmamap_load(uh->uh_dmat, ui->ui_dmam, ui->ui_vaddr,
    174 	    ui->ui_size, NULL, (waitok ? BUS_DMA_WAITOK : BUS_DMA_NOWAIT)))) {
    175 		bus_dmamap_destroy(uh->uh_dmat, ui->ui_dmam);
    176 		return error;
    177 	}
    178 	ui->ui_baddr = ui->ui_dmam->dm_segs[0].ds_addr;
    179 	return 0;
    180 }
    181 
    182 /*
    183  * Allocate DMA-able memory and map it on the unibus.
    184  */
    185 int
    186 ubmemalloc(struct uba_softc *uh, struct ubinfo *ui, int flags)
    187 {
    188 	int waitok = (flags & UBA_CANTWAIT ? BUS_DMA_NOWAIT : BUS_DMA_WAITOK);
    189 	int error;
    190 
    191 	if ((error = bus_dmamem_alloc(uh->uh_dmat, ui->ui_size, PAGE_SIZE, 0,
    192 	    &ui->ui_seg, 1, &ui->ui_rseg, waitok)))
    193 		return error;
    194 	if ((error = bus_dmamem_map(uh->uh_dmat, &ui->ui_seg, ui->ui_rseg,
    195 	    ui->ui_size, &ui->ui_vaddr, waitok|BUS_DMA_COHERENT))) {
    196 		bus_dmamem_free(uh->uh_dmat, &ui->ui_seg, ui->ui_rseg);
    197 		return error;
    198 	}
    199 	if ((error = uballoc(uh, ui, flags))) {
    200 		bus_dmamem_unmap(uh->uh_dmat, ui->ui_vaddr, ui->ui_size);
    201 		bus_dmamem_free(uh->uh_dmat, &ui->ui_seg, ui->ui_rseg);
    202 	}
    203 	return error;
    204 }
    205 
    206 void
    207 ubfree(struct uba_softc *uh, struct ubinfo *ui)
    208 {
    209 	bus_dmamap_unload(uh->uh_dmat, ui->ui_dmam);
    210 	bus_dmamap_destroy(uh->uh_dmat, ui->ui_dmam);
    211 }
    212 
    213 void
    214 ubmemfree(struct uba_softc *uh, struct ubinfo *ui)
    215 {
    216 	bus_dmamem_unmap(uh->uh_dmat, ui->ui_vaddr, ui->ui_size);
    217 	bus_dmamem_free(uh->uh_dmat, &ui->ui_seg, ui->ui_rseg);
    218 	ubfree(uh, ui);
    219 }
    220 
    221 /*
    222  * Generate a reset on uba number uban.	 Then
    223  * call each device that asked to be called during attach,
    224  * giving it a chance to clean up so as to be able to continue.
    225  */
    226 void
    227 ubareset(struct uba_softc *uh)
    228 {
    229 	struct uba_reset *ur;
    230 	int s;
    231 
    232 	s = spluba();
    233 	SIMPLEQ_INIT(&uh->uh_resq);
    234 	printf("%s: reset", uh->uh_dev.dv_xname);
    235 	(*uh->uh_ubainit)(uh);
    236 
    237 	ur = SIMPLEQ_FIRST(&uh->uh_resetq);
    238 	if (ur) do {
    239 		printf(" %s", ur->ur_dev->dv_xname);
    240 		(*ur->ur_reset)(ur->ur_dev);
    241 	} while ((ur = SIMPLEQ_NEXT(ur, ur_resetq)));
    242 
    243 	printf("\n");
    244 	splx(s);
    245 }
    246 
    247 /*
    248  * The common attach routine:
    249  *   Calls the scan routine to search for uba devices.
    250  */
    251 void
    252 uba_attach(struct uba_softc *sc, paddr_t iopagephys)
    253 {
    254 
    255 	/*
    256 	 * Set last free interrupt vector for devices with
    257 	 * programmable interrupt vectors.  Use is to decrement
    258 	 * this number and use result as interrupt vector.
    259 	 */
    260 	sc->uh_lastiv = 0x200;
    261 	SIMPLEQ_INIT(&sc->uh_resq);
    262 	SIMPLEQ_INIT(&sc->uh_resetq);
    263 
    264 	/*
    265 	 * Allocate place for unibus I/O space in virtual space.
    266 	 */
    267 	if (bus_space_map(sc->uh_iot, iopagephys, UBAIOSIZE, 0, &sc->uh_ioh))
    268 		return;
    269 
    270 	/*
    271 	 * Keep track of which addressed devices are found.
    272 	 */
    273 	sc->uh_used = malloc(UBAIOSIZE, M_TEMP, M_WAITOK);
    274 	memset(sc->uh_used, 0, UBAIOSIZE);
    275 
    276 	if (sc->uh_beforescan)
    277 		(*sc->uh_beforescan)(sc);
    278 	/*
    279 	 * Now start searching for devices.
    280 	 */
    281 	config_search_ia(ubasearch,(struct device *)sc, "uba", NULL);
    282 
    283 	if (sc->uh_afterscan)
    284 		(*sc->uh_afterscan)(sc);
    285 
    286 	free(sc->uh_used, M_TEMP);
    287 }
    288 
    289 int
    290 ubasearch(struct device *parent, struct cfdata *cf,
    291 	  const int *ldesc, void *aux)
    292 {
    293 	struct	uba_softc *sc = (struct uba_softc *)parent;
    294 	struct	uba_attach_args ua;
    295 	int	i, csr, vec, br;
    296 
    297 	csr = cf->cf_loc[UBACF_CSR];
    298 	if (sc->uh_used[ubdevreg(csr)])
    299 		return 0; /* something are already at this address */
    300 
    301 	ua.ua_ioh = ubdevreg(csr) + sc->uh_ioh;
    302 	ua.ua_iot = sc->uh_iot;
    303 	ua.ua_dmat = sc->uh_dmat;
    304 
    305 	if (badaddr((caddr_t)ua.ua_ioh, 2) ||
    306 	    (sc->uh_errchk ? (*sc->uh_errchk)(sc):0))
    307 		goto forgetit;
    308 
    309 	scb_vecref(0, 0); /* Clear vector ref */
    310 	i = config_match(parent, cf, &ua);
    311 
    312 	if (sc->uh_errchk)
    313 		if ((*sc->uh_errchk)(sc))
    314 			goto forgetit;
    315 	if (i == 0)
    316 		goto forgetit;
    317 
    318 	i = scb_vecref(&vec, &br);
    319 	if (i == 0)
    320 		goto fail;
    321 	if (vec == 0)
    322 		goto fail;
    323 
    324 	ua.ua_br = br;
    325 	ua.ua_cvec = vec;
    326 	ua.ua_iaddr = csr;
    327 	ua.ua_evcnt = NULL;
    328 
    329 	sc->uh_used[ubdevreg(csr)] = 1;
    330 
    331 	config_attach(parent, cf, &ua, ubaprint);
    332 	return 0;
    333 
    334 fail:
    335 	printf("%s%d at %s csr %o %s\n",
    336 	    cf->cf_name, cf->cf_unit, parent->dv_xname,
    337 	    csr, (i ? "zero vector" : "didn't interrupt"));
    338 
    339 forgetit:
    340 	return 0;
    341 }
    342 
    343 /*
    344  * Print out some interesting info common to all unibus devices.
    345  */
    346 int
    347 ubaprint(void *aux, const char *uba)
    348 {
    349 	struct uba_attach_args *ua = aux;
    350 
    351 	aprint_normal(" csr %o vec %o ipl %x", ua->ua_iaddr,
    352 	    ua->ua_cvec & 511, ua->ua_br);
    353 	return UNCONF;
    354 }
    355 
    356 /*
    357  * Move to machdep eventually
    358  */
    359 void
    360 uba_intr_establish(void *icookie, int vec, void (*ifunc)(void *iarg),
    361 	void *iarg, struct evcnt *ev)
    362 {
    363 	scb_vecalloc(vec, ifunc, iarg, SCB_ISTACK, ev);
    364 }
    365