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