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