uba.c revision 1.66.2.2
1 /* $NetBSD: uba.c,v 1.66.2.2 2004/09/18 14:50:40 skrll 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.66.2.2 2004/09/18 14:50:40 skrll 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 96 static int ubasearch (struct device *, struct cfdata *, 97 const locdesc_t *, void *); 98 static int ubaprint (void *, const char *); 99 100 /* 101 * If we failed to allocate uba resources, put us on a queue to wait 102 * until there is available resources. Resources to compete about 103 * are map registers and BDPs. This is normally only a problem on 104 * Unibus systems, Qbus systems have more map registers than usable. 105 */ 106 void 107 uba_enqueue(struct uba_unit *uu) 108 { 109 struct uba_softc *uh; 110 int s; 111 112 uh = (void *)((struct device *)(uu->uu_softc))->dv_parent; 113 114 s = spluba(); 115 SIMPLEQ_INSERT_TAIL(&uh->uh_resq, uu, uu_resq); 116 splx(s); 117 } 118 119 /* 120 * When a routine that uses resources is finished, the next device 121 * in queue for map registers etc is called. If it succeeds to get 122 * resources, call next, and next, and next... 123 * This routine must be called at spluba. 124 */ 125 void 126 uba_done(struct uba_softc *uh) 127 { 128 struct uba_unit *uu; 129 130 while ((uu = SIMPLEQ_FIRST(&uh->uh_resq))) { 131 SIMPLEQ_REMOVE_HEAD(&uh->uh_resq, uu_resq); 132 if ((*uu->uu_ready)(uu) == 0) { 133 SIMPLEQ_INSERT_HEAD(&uh->uh_resq, uu, uu_resq); 134 break; 135 } 136 } 137 } 138 139 /* 140 * Each device that needs some handling if an ubareset occurs must 141 * register for reset first through this routine. 142 */ 143 void 144 uba_reset_establish(void (*reset)(struct device *), struct device *dev) 145 { 146 struct uba_softc *uh = (void *)dev->dv_parent; 147 struct uba_reset *ur; 148 149 ur = malloc(sizeof(struct uba_reset), M_DEVBUF, M_NOWAIT); 150 if (ur == NULL) 151 panic("uba_reset_establish"); 152 ur->ur_dev = dev; 153 ur->ur_reset = reset; 154 155 SIMPLEQ_INSERT_TAIL(&uh->uh_resetq, ur, ur_resetq); 156 } 157 158 /* 159 * Allocate a bunch of map registers and map them to the given address. 160 */ 161 int 162 uballoc(struct uba_softc *uh, struct ubinfo *ui, int flags) 163 { 164 int waitok = (flags & UBA_CANTWAIT) == 0; 165 int error; 166 167 if ((error = bus_dmamap_create(uh->uh_dmat, ui->ui_size, 1, 168 ui->ui_size, 0, (waitok ? BUS_DMA_WAITOK : BUS_DMA_NOWAIT), 169 &ui->ui_dmam))) 170 return error; 171 172 if ((error = bus_dmamap_load(uh->uh_dmat, ui->ui_dmam, ui->ui_vaddr, 173 ui->ui_size, NULL, (waitok ? BUS_DMA_WAITOK : BUS_DMA_NOWAIT)))) { 174 bus_dmamap_destroy(uh->uh_dmat, ui->ui_dmam); 175 return error; 176 } 177 ui->ui_baddr = ui->ui_dmam->dm_segs[0].ds_addr; 178 return 0; 179 } 180 181 /* 182 * Allocate DMA-able memory and map it on the unibus. 183 */ 184 int 185 ubmemalloc(struct uba_softc *uh, struct ubinfo *ui, int flags) 186 { 187 int waitok = (flags & UBA_CANTWAIT ? BUS_DMA_NOWAIT : BUS_DMA_WAITOK); 188 int error; 189 190 if ((error = bus_dmamem_alloc(uh->uh_dmat, ui->ui_size, PAGE_SIZE, 0, 191 &ui->ui_seg, 1, &ui->ui_rseg, waitok))) 192 return error; 193 if ((error = bus_dmamem_map(uh->uh_dmat, &ui->ui_seg, ui->ui_rseg, 194 ui->ui_size, &ui->ui_vaddr, waitok|BUS_DMA_COHERENT))) { 195 bus_dmamem_free(uh->uh_dmat, &ui->ui_seg, ui->ui_rseg); 196 return error; 197 } 198 if ((error = uballoc(uh, ui, flags))) { 199 bus_dmamem_unmap(uh->uh_dmat, ui->ui_vaddr, ui->ui_size); 200 bus_dmamem_free(uh->uh_dmat, &ui->ui_seg, ui->ui_rseg); 201 } 202 return error; 203 } 204 205 void 206 ubfree(struct uba_softc *uh, struct ubinfo *ui) 207 { 208 bus_dmamap_unload(uh->uh_dmat, ui->ui_dmam); 209 bus_dmamap_destroy(uh->uh_dmat, ui->ui_dmam); 210 } 211 212 void 213 ubmemfree(struct uba_softc *uh, struct ubinfo *ui) 214 { 215 bus_dmamem_unmap(uh->uh_dmat, ui->ui_vaddr, ui->ui_size); 216 bus_dmamem_free(uh->uh_dmat, &ui->ui_seg, ui->ui_rseg); 217 ubfree(uh, ui); 218 } 219 220 /* 221 * Generate a reset on uba number uban. Then 222 * call each device that asked to be called during attach, 223 * giving it a chance to clean up so as to be able to continue. 224 */ 225 void 226 ubareset(struct uba_softc *uh) 227 { 228 struct uba_reset *ur; 229 int s; 230 231 s = spluba(); 232 SIMPLEQ_INIT(&uh->uh_resq); 233 printf("%s: reset", uh->uh_dev.dv_xname); 234 (*uh->uh_ubainit)(uh); 235 236 ur = SIMPLEQ_FIRST(&uh->uh_resetq); 237 if (ur) do { 238 printf(" %s", ur->ur_dev->dv_xname); 239 (*ur->ur_reset)(ur->ur_dev); 240 } while ((ur = SIMPLEQ_NEXT(ur, ur_resetq))); 241 242 printf("\n"); 243 splx(s); 244 } 245 246 /* 247 * The common attach routine: 248 * Calls the scan routine to search for uba devices. 249 */ 250 void 251 uba_attach(struct uba_softc *sc, paddr_t iopagephys) 252 { 253 254 /* 255 * Set last free interrupt vector for devices with 256 * programmable interrupt vectors. Use is to decrement 257 * this number and use result as interrupt vector. 258 */ 259 sc->uh_lastiv = 0x200; 260 SIMPLEQ_INIT(&sc->uh_resq); 261 SIMPLEQ_INIT(&sc->uh_resetq); 262 263 /* 264 * Allocate place for unibus I/O space in virtual space. 265 */ 266 if (bus_space_map(sc->uh_iot, iopagephys, UBAIOSIZE, 0, &sc->uh_ioh)) 267 return; 268 269 /* 270 * Keep track of which addressed devices are found. 271 */ 272 sc->uh_used = malloc(UBAIOSIZE, M_TEMP, M_WAITOK); 273 memset(sc->uh_used, 0, UBAIOSIZE); 274 275 if (sc->uh_beforescan) 276 (*sc->uh_beforescan)(sc); 277 /* 278 * Now start searching for devices. 279 */ 280 config_search_ia(ubasearch,(struct device *)sc, "uba", NULL); 281 282 if (sc->uh_afterscan) 283 (*sc->uh_afterscan)(sc); 284 285 free(sc->uh_used, M_TEMP); 286 } 287 288 int 289 ubasearch(struct device *parent, struct cfdata *cf, 290 const locdesc_t *ldesc, void *aux) 291 { 292 struct uba_softc *sc = (struct uba_softc *)parent; 293 struct uba_attach_args ua; 294 int i, vec, br; 295 296 if (sc->uh_used[ubdevreg(cf->cf_loc[0])]) 297 return 0; /* something are already at this address */ 298 299 ua.ua_ioh = ubdevreg(cf->cf_loc[0]) + sc->uh_ioh; 300 ua.ua_iot = sc->uh_iot; 301 ua.ua_dmat = sc->uh_dmat; 302 303 if (badaddr((caddr_t)ua.ua_ioh, 2) || 304 (sc->uh_errchk ? (*sc->uh_errchk)(sc):0)) 305 goto forgetit; 306 307 scb_vecref(0, 0); /* Clear vector ref */ 308 i = config_match(parent, cf, &ua); 309 310 if (sc->uh_errchk) 311 if ((*sc->uh_errchk)(sc)) 312 goto forgetit; 313 if (i == 0) 314 goto forgetit; 315 316 i = scb_vecref(&vec, &br); 317 if (i == 0) 318 goto fail; 319 if (vec == 0) 320 goto fail; 321 322 ua.ua_br = br; 323 ua.ua_cvec = vec; 324 ua.ua_iaddr = cf->cf_loc[0]; 325 ua.ua_evcnt = NULL; 326 327 sc->uh_used[ubdevreg(cf->cf_loc[0])] = 1; 328 329 config_attach(parent, cf, &ua, ubaprint); 330 return 0; 331 332 fail: 333 printf("%s%d at %s csr %o %s\n", 334 cf->cf_name, cf->cf_unit, parent->dv_xname, 335 cf->cf_loc[0], (i ? "zero vector" : "didn't interrupt")); 336 337 forgetit: 338 return 0; 339 } 340 341 /* 342 * Print out some interesting info common to all unibus devices. 343 */ 344 int 345 ubaprint(void *aux, const char *uba) 346 { 347 struct uba_attach_args *ua = aux; 348 349 aprint_normal(" csr %o vec %o ipl %x", ua->ua_iaddr, 350 ua->ua_cvec & 511, ua->ua_br); 351 return UNCONF; 352 } 353 354 /* 355 * Move to machdep eventually 356 */ 357 void 358 uba_intr_establish(void *icookie, int vec, void (*ifunc)(void *iarg), 359 void *iarg, struct evcnt *ev) 360 { 361 scb_vecalloc(vec, ifunc, iarg, SCB_ISTACK, ev); 362 } 363
Indexes created Wed Oct 22 13:09:56 GMT 2025