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