uba.c revision 1.56 1 1.56 thorpej /* $NetBSD: uba.c,v 1.56 2001/04/12 20:08:09 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.13 mycroft #include <sys/param.h>
41 1.13 mycroft #include <sys/types.h>
42 1.13 mycroft #include <sys/time.h>
43 1.13 mycroft #include <sys/systm.h>
44 1.13 mycroft #include <sys/map.h>
45 1.13 mycroft #include <sys/buf.h>
46 1.13 mycroft #include <sys/proc.h>
47 1.13 mycroft #include <sys/user.h>
48 1.13 mycroft #include <sys/conf.h>
49 1.13 mycroft #include <sys/dkstat.h>
50 1.13 mycroft #include <sys/kernel.h>
51 1.13 mycroft #include <sys/malloc.h>
52 1.13 mycroft #include <sys/device.h>
53 1.1 ragge
54 1.55 mrg #include <uvm/uvm_extern.h>
55 1.9 ragge
56 1.43 ragge #include <machine/bus.h>
57 1.43 ragge #include <machine/scb.h>
58 1.13 mycroft #include <machine/cpu.h>
59 1.9 ragge
60 1.51 ragge #include <dev/qbus/ubareg.h>
61 1.47 ragge #include <dev/qbus/ubavar.h>
62 1.1 ragge
63 1.47 ragge #include "ioconf.h"
64 1.26 ragge
65 1.52 matt static int ubasearch (struct device *, struct cfdata *, void *);
66 1.52 matt static int ubaprint (void *, const char *);
67 1.26 ragge
68 1.1 ragge /*
69 1.47 ragge * If we failed to allocate uba resources, put us on a queue to wait
70 1.47 ragge * until there is available resources. Resources to compete about
71 1.47 ragge * are map registers and BDPs. This is normally only a problem on
72 1.47 ragge * Unibus systems, Qbus systems have more map registers than usable.
73 1.1 ragge */
74 1.47 ragge void
75 1.52 matt uba_enqueue(struct uba_unit *uu)
76 1.1 ragge {
77 1.47 ragge struct uba_softc *uh;
78 1.47 ragge int s;
79 1.1 ragge
80 1.23 ragge uh = (void *)((struct device *)(uu->uu_softc))->dv_parent;
81 1.26 ragge
82 1.56 thorpej s = spluba();
83 1.26 ragge SIMPLEQ_INSERT_TAIL(&uh->uh_resq, uu, uu_resq);
84 1.1 ragge splx(s);
85 1.1 ragge }
86 1.1 ragge
87 1.1 ragge /*
88 1.47 ragge * When a routine that uses resources is finished, the next device
89 1.47 ragge * in queue for map registers etc is called. If it succeeds to get
90 1.47 ragge * resources, call next, and next, and next...
91 1.56 thorpej * This routine must be called at spluba.
92 1.1 ragge */
93 1.16 ragge void
94 1.52 matt uba_done(struct uba_softc *uh)
95 1.1 ragge {
96 1.26 ragge struct uba_unit *uu;
97 1.1 ragge
98 1.47 ragge while ((uu = SIMPLEQ_FIRST(&uh->uh_resq))) {
99 1.26 ragge SIMPLEQ_REMOVE_HEAD(&uh->uh_resq, uu, uu_resq);
100 1.47 ragge if ((*uu->uu_ready)(uu) == 0) {
101 1.47 ragge SIMPLEQ_INSERT_HEAD(&uh->uh_resq, uu, uu_resq);
102 1.26 ragge break;
103 1.47 ragge }
104 1.1 ragge }
105 1.1 ragge }
106 1.1 ragge
107 1.1 ragge /*
108 1.51 ragge * Each device that needs some handling if an ubareset occurs must
109 1.51 ragge * register for reset first through this routine.
110 1.51 ragge */
111 1.51 ragge void
112 1.51 ragge uba_reset_establish(void (*reset)(struct device *), struct device *dev)
113 1.51 ragge {
114 1.51 ragge struct uba_softc *uh = (void *)dev->dv_parent;
115 1.51 ragge struct uba_reset *ur;
116 1.51 ragge
117 1.51 ragge ur = malloc(sizeof(struct uba_reset), M_DEVBUF, M_NOWAIT);
118 1.51 ragge ur->ur_dev = dev;
119 1.51 ragge ur->ur_reset = reset;
120 1.51 ragge
121 1.51 ragge SIMPLEQ_INSERT_TAIL(&uh->uh_resetq, ur, ur_resetq);
122 1.51 ragge }
123 1.51 ragge
124 1.51 ragge /*
125 1.25 ragge * Generate a reset on uba number uban. Then
126 1.21 ragge * call each device that asked to be called during attach,
127 1.1 ragge * giving it a chance to clean up so as to be able to continue.
128 1.1 ragge */
129 1.21 ragge void
130 1.51 ragge ubareset(struct uba_softc *uh)
131 1.1 ragge {
132 1.51 ragge struct uba_reset *ur;
133 1.51 ragge int s;
134 1.1 ragge
135 1.56 thorpej s = spluba();
136 1.26 ragge SIMPLEQ_INIT(&uh->uh_resq);
137 1.29 christos printf("%s: reset", uh->uh_dev.dv_xname);
138 1.26 ragge (*uh->uh_ubainit)(uh);
139 1.26 ragge
140 1.51 ragge ur = SIMPLEQ_FIRST(&uh->uh_resetq);
141 1.51 ragge if (ur) do {
142 1.51 ragge printf(" %s", ur->ur_dev->dv_xname);
143 1.51 ragge (*ur->ur_reset)(ur->ur_dev);
144 1.51 ragge } while ((ur = SIMPLEQ_NEXT(ur, ur_resetq)));
145 1.51 ragge
146 1.29 christos printf("\n");
147 1.1 ragge splx(s);
148 1.1 ragge }
149 1.1 ragge
150 1.16 ragge /*
151 1.47 ragge * The common attach routine:
152 1.16 ragge * Calls the scan routine to search for uba devices.
153 1.16 ragge */
154 1.5 ragge void
155 1.52 matt uba_attach(struct uba_softc *sc, paddr_t iopagephys)
156 1.5 ragge {
157 1.5 ragge
158 1.9 ragge /*
159 1.26 ragge * Set last free interrupt vector for devices with
160 1.26 ragge * programmable interrupt vectors. Use is to decrement
161 1.26 ragge * this number and use result as interrupt vector.
162 1.9 ragge */
163 1.26 ragge sc->uh_lastiv = 0x200;
164 1.26 ragge SIMPLEQ_INIT(&sc->uh_resq);
165 1.51 ragge SIMPLEQ_INIT(&sc->uh_resetq);
166 1.26 ragge
167 1.9 ragge /*
168 1.43 ragge * Allocate place for unibus I/O space in virtual space.
169 1.9 ragge */
170 1.44 ragge if (bus_space_map(sc->uh_iot, iopagephys, UBAIOSIZE, 0, &sc->uh_ioh))
171 1.43 ragge return;
172 1.9 ragge
173 1.26 ragge if (sc->uh_beforescan)
174 1.26 ragge (*sc->uh_beforescan)(sc);
175 1.10 ragge /*
176 1.10 ragge * Now start searching for devices.
177 1.10 ragge */
178 1.32 ragge config_search(ubasearch,(struct device *)sc, NULL);
179 1.10 ragge
180 1.26 ragge if (sc->uh_afterscan)
181 1.26 ragge (*sc->uh_afterscan)(sc);
182 1.5 ragge }
183 1.5 ragge
184 1.32 ragge int
185 1.52 matt ubasearch(struct device *parent, struct cfdata *cf, void *aux)
186 1.10 ragge {
187 1.10 ragge struct uba_softc *sc = (struct uba_softc *)parent;
188 1.10 ragge struct uba_attach_args ua;
189 1.40 ragge int i, vec, br;
190 1.10 ragge
191 1.44 ragge ua.ua_ioh = ubdevreg(cf->cf_loc[0]) + sc->uh_ioh;
192 1.44 ragge ua.ua_iot = sc->uh_iot;
193 1.47 ragge ua.ua_dmat = sc->uh_dmat;
194 1.10 ragge
195 1.44 ragge if (badaddr((caddr_t)ua.ua_ioh, 2) ||
196 1.43 ragge (sc->uh_errchk ? (*sc->uh_errchk)(sc):0))
197 1.10 ragge goto forgetit;
198 1.10 ragge
199 1.40 ragge scb_vecref(0, 0); /* Clear vector ref */
200 1.32 ragge i = (*cf->cf_attach->ca_match) (parent, cf, &ua);
201 1.10 ragge
202 1.26 ragge if (sc->uh_errchk)
203 1.26 ragge if ((*sc->uh_errchk)(sc))
204 1.26 ragge goto forgetit;
205 1.10 ragge if (i == 0)
206 1.10 ragge goto forgetit;
207 1.10 ragge
208 1.40 ragge i = scb_vecref(&vec, &br);
209 1.40 ragge if (i == 0)
210 1.40 ragge goto fail;
211 1.40 ragge if (vec == 0)
212 1.10 ragge goto fail;
213 1.49 matt
214 1.40 ragge ua.ua_br = br;
215 1.40 ragge ua.ua_cvec = vec;
216 1.32 ragge ua.ua_iaddr = cf->cf_loc[0];
217 1.53 matt ua.ua_evcnt = NULL;
218 1.10 ragge
219 1.32 ragge config_attach(parent, cf, &ua, ubaprint);
220 1.32 ragge return 0;
221 1.10 ragge
222 1.10 ragge fail:
223 1.40 ragge printf("%s%d at %s csr %o %s\n",
224 1.40 ragge cf->cf_driver->cd_name, cf->cf_unit, parent->dv_xname,
225 1.40 ragge cf->cf_loc[0], (i ? "zero vector" : "didn't interrupt"));
226 1.10 ragge
227 1.10 ragge forgetit:
228 1.32 ragge return 0;
229 1.10 ragge }
230 1.10 ragge
231 1.16 ragge /*
232 1.16 ragge * Print out some interesting info common to all unibus devices.
233 1.16 ragge */
234 1.10 ragge int
235 1.52 matt ubaprint(void *aux, const char *uba)
236 1.10 ragge {
237 1.10 ragge struct uba_attach_args *ua = aux;
238 1.10 ragge
239 1.29 christos printf(" csr %o vec %o ipl %x", ua->ua_iaddr,
240 1.40 ragge ua->ua_cvec & 511, ua->ua_br);
241 1.10 ragge return UNCONF;
242 1.49 matt }
243 1.49 matt
244 1.49 matt /*
245 1.49 matt * Move to machdep eventually
246 1.49 matt */
247 1.49 matt void
248 1.52 matt uba_intr_establish(void *icookie, int vec, void (*ifunc)(void *iarg),
249 1.52 matt void *iarg, struct evcnt *ev)
250 1.49 matt {
251 1.52 matt scb_vecalloc(vec, ifunc, iarg, SCB_ISTACK, ev);
252 1.10 ragge }
253