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