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