uba.c revision 1.47 1 1.47 ragge /* $NetBSD: uba.c,v 1.47 1999/06/06 19:14:49 ragge 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.13 mycroft #include <vm/vm.h>
55 1.13 mycroft #include <vm/vm_kern.h>
56 1.9 ragge
57 1.43 ragge #include <machine/bus.h>
58 1.43 ragge #include <machine/scb.h>
59 1.13 mycroft #include <machine/cpu.h>
60 1.9 ragge
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.32 ragge static int ubasearch __P((struct device *, struct cfdata *, void *));
66 1.27 cgd static int ubaprint __P((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.47 ragge uba_enqueue(uu)
76 1.47 ragge struct uba_unit *uu;
77 1.1 ragge {
78 1.47 ragge struct uba_softc *uh;
79 1.47 ragge int s;
80 1.1 ragge
81 1.23 ragge uh = (void *)((struct device *)(uu->uu_softc))->dv_parent;
82 1.26 ragge
83 1.47 ragge s = splimp();
84 1.26 ragge SIMPLEQ_INSERT_TAIL(&uh->uh_resq, uu, uu_resq);
85 1.1 ragge splx(s);
86 1.1 ragge }
87 1.1 ragge
88 1.1 ragge /*
89 1.47 ragge * When a routine that uses resources is finished, the next device
90 1.47 ragge * in queue for map registers etc is called. If it succeeds to get
91 1.47 ragge * resources, call next, and next, and next...
92 1.47 ragge * This routine must be called at splimp.
93 1.1 ragge */
94 1.16 ragge void
95 1.47 ragge uba_done(uh)
96 1.47 ragge 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.25 ragge * Generate a reset on uba number uban. Then
111 1.21 ragge * call each device that asked to be called during attach,
112 1.1 ragge * giving it a chance to clean up so as to be able to continue.
113 1.1 ragge */
114 1.21 ragge void
115 1.1 ragge ubareset(uban)
116 1.1 ragge int uban;
117 1.1 ragge {
118 1.20 ragge register struct uba_softc *uh = uba_cd.cd_devs[uban];
119 1.21 ragge int s, i;
120 1.1 ragge
121 1.47 ragge s = splimp();
122 1.26 ragge SIMPLEQ_INIT(&uh->uh_resq);
123 1.29 christos printf("%s: reset", uh->uh_dev.dv_xname);
124 1.26 ragge (*uh->uh_ubainit)(uh);
125 1.26 ragge
126 1.21 ragge for (i = 0; i < uh->uh_resno; i++)
127 1.21 ragge (*uh->uh_reset[i])(uh->uh_resarg[i]);
128 1.29 christos printf("\n");
129 1.1 ragge splx(s);
130 1.1 ragge }
131 1.1 ragge
132 1.16 ragge /*
133 1.47 ragge * The common attach routine:
134 1.16 ragge * Calls the scan routine to search for uba devices.
135 1.16 ragge */
136 1.5 ragge void
137 1.26 ragge uba_attach(sc, iopagephys)
138 1.26 ragge struct uba_softc *sc;
139 1.42 ragge paddr_t iopagephys;
140 1.5 ragge {
141 1.5 ragge
142 1.9 ragge /*
143 1.26 ragge * Set last free interrupt vector for devices with
144 1.26 ragge * programmable interrupt vectors. Use is to decrement
145 1.26 ragge * this number and use result as interrupt vector.
146 1.9 ragge */
147 1.26 ragge sc->uh_lastiv = 0x200;
148 1.26 ragge SIMPLEQ_INIT(&sc->uh_resq);
149 1.26 ragge
150 1.9 ragge /*
151 1.43 ragge * Allocate place for unibus I/O space in virtual space.
152 1.9 ragge */
153 1.44 ragge if (bus_space_map(sc->uh_iot, iopagephys, UBAIOSIZE, 0, &sc->uh_ioh))
154 1.43 ragge return;
155 1.9 ragge
156 1.26 ragge if (sc->uh_beforescan)
157 1.26 ragge (*sc->uh_beforescan)(sc);
158 1.10 ragge /*
159 1.10 ragge * Now start searching for devices.
160 1.10 ragge */
161 1.32 ragge config_search(ubasearch,(struct device *)sc, NULL);
162 1.10 ragge
163 1.26 ragge if (sc->uh_afterscan)
164 1.26 ragge (*sc->uh_afterscan)(sc);
165 1.5 ragge }
166 1.5 ragge
167 1.32 ragge int
168 1.32 ragge ubasearch(parent, cf, aux)
169 1.10 ragge struct device *parent;
170 1.32 ragge struct cfdata *cf;
171 1.32 ragge void *aux;
172 1.10 ragge {
173 1.10 ragge struct uba_softc *sc = (struct uba_softc *)parent;
174 1.10 ragge struct uba_attach_args ua;
175 1.40 ragge int i, vec, br;
176 1.10 ragge
177 1.44 ragge ua.ua_ioh = ubdevreg(cf->cf_loc[0]) + sc->uh_ioh;
178 1.44 ragge ua.ua_iot = sc->uh_iot;
179 1.47 ragge ua.ua_dmat = sc->uh_dmat;
180 1.21 ragge ua.ua_reset = NULL;
181 1.10 ragge
182 1.44 ragge if (badaddr((caddr_t)ua.ua_ioh, 2) ||
183 1.43 ragge (sc->uh_errchk ? (*sc->uh_errchk)(sc):0))
184 1.10 ragge goto forgetit;
185 1.10 ragge
186 1.40 ragge scb_vecref(0, 0); /* Clear vector ref */
187 1.32 ragge i = (*cf->cf_attach->ca_match) (parent, cf, &ua);
188 1.10 ragge
189 1.26 ragge if (sc->uh_errchk)
190 1.26 ragge if ((*sc->uh_errchk)(sc))
191 1.26 ragge goto forgetit;
192 1.10 ragge if (i == 0)
193 1.10 ragge goto forgetit;
194 1.10 ragge
195 1.40 ragge i = scb_vecref(&vec, &br);
196 1.40 ragge if (i == 0)
197 1.40 ragge goto fail;
198 1.40 ragge if (vec == 0)
199 1.10 ragge goto fail;
200 1.10 ragge
201 1.40 ragge scb_vecalloc(vec, ua.ua_ivec, cf->cf_unit, SCB_ISTACK);
202 1.32 ragge if (ua.ua_reset) { /* device wants ubareset */
203 1.21 ragge if (sc->uh_resno == 0) {
204 1.43 ragge sc->uh_reset = malloc(sizeof(ua.ua_reset),
205 1.43 ragge M_DEVBUF, M_NOWAIT);
206 1.26 ragge sc->uh_resarg = (int *)sc->uh_reset + 128;
207 1.26 ragge }
208 1.26 ragge if (sc->uh_resno > 127) {
209 1.32 ragge printf("%s: Expand reset table, skipping reset %s%d\n",
210 1.32 ragge sc->uh_dev.dv_xname, cf->cf_driver->cd_name,
211 1.32 ragge cf->cf_unit);
212 1.43 ragge } else {
213 1.32 ragge sc->uh_resarg[sc->uh_resno] = cf->cf_unit;
214 1.26 ragge sc->uh_reset[sc->uh_resno++] = ua.ua_reset;
215 1.21 ragge }
216 1.21 ragge }
217 1.40 ragge ua.ua_br = br;
218 1.40 ragge ua.ua_cvec = vec;
219 1.32 ragge ua.ua_iaddr = cf->cf_loc[0];
220 1.10 ragge
221 1.32 ragge config_attach(parent, cf, &ua, ubaprint);
222 1.32 ragge return 0;
223 1.10 ragge
224 1.10 ragge fail:
225 1.40 ragge printf("%s%d at %s csr %o %s\n",
226 1.40 ragge cf->cf_driver->cd_name, cf->cf_unit, parent->dv_xname,
227 1.40 ragge cf->cf_loc[0], (i ? "zero vector" : "didn't interrupt"));
228 1.10 ragge
229 1.10 ragge forgetit:
230 1.32 ragge return 0;
231 1.10 ragge }
232 1.10 ragge
233 1.16 ragge /*
234 1.16 ragge * Print out some interesting info common to all unibus devices.
235 1.16 ragge */
236 1.10 ragge int
237 1.10 ragge ubaprint(aux, uba)
238 1.10 ragge void *aux;
239 1.27 cgd const char *uba;
240 1.10 ragge {
241 1.10 ragge struct uba_attach_args *ua = aux;
242 1.10 ragge
243 1.29 christos printf(" csr %o vec %o ipl %x", ua->ua_iaddr,
244 1.40 ragge ua->ua_cvec & 511, ua->ua_br);
245 1.10 ragge return UNCONF;
246 1.10 ragge }
247