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