isa_machdep.c revision 1.14 1 1.14 christos /* $NetBSD: isa_machdep.c,v 1.14 2006/10/12 01:30:44 christos Exp $ */
2 1.1 fvdl
3 1.1 fvdl /*-
4 1.1 fvdl * Copyright (c) 1996, 1997, 1998 The NetBSD Foundation, Inc.
5 1.1 fvdl * All rights reserved.
6 1.1 fvdl *
7 1.1 fvdl * This code is derived from software contributed to The NetBSD Foundation
8 1.1 fvdl * by Charles M. Hannum and by Jason R. Thorpe of the Numerical Aerospace
9 1.1 fvdl * Simulation Facility, NASA Ames Research Center.
10 1.1 fvdl *
11 1.1 fvdl * Redistribution and use in source and binary forms, with or without
12 1.1 fvdl * modification, are permitted provided that the following conditions
13 1.1 fvdl * are met:
14 1.1 fvdl * 1. Redistributions of source code must retain the above copyright
15 1.1 fvdl * notice, this list of conditions and the following disclaimer.
16 1.1 fvdl * 2. Redistributions in binary form must reproduce the above copyright
17 1.1 fvdl * notice, this list of conditions and the following disclaimer in the
18 1.1 fvdl * documentation and/or other materials provided with the distribution.
19 1.1 fvdl * 3. All advertising materials mentioning features or use of this software
20 1.1 fvdl * must display the following acknowledgement:
21 1.1 fvdl * This product includes software developed by the NetBSD
22 1.1 fvdl * Foundation, Inc. and its contributors.
23 1.1 fvdl * 4. Neither the name of The NetBSD Foundation nor the names of its
24 1.1 fvdl * contributors may be used to endorse or promote products derived
25 1.1 fvdl * from this software without specific prior written permission.
26 1.1 fvdl *
27 1.1 fvdl * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
28 1.1 fvdl * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
29 1.1 fvdl * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
30 1.1 fvdl * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
31 1.1 fvdl * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
32 1.1 fvdl * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
33 1.1 fvdl * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
34 1.1 fvdl * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
35 1.1 fvdl * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
36 1.1 fvdl * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
37 1.1 fvdl * POSSIBILITY OF SUCH DAMAGE.
38 1.1 fvdl */
39 1.1 fvdl
40 1.1 fvdl /*-
41 1.1 fvdl * Copyright (c) 1991 The Regents of the University of California.
42 1.1 fvdl * All rights reserved.
43 1.1 fvdl *
44 1.1 fvdl * This code is derived from software contributed to Berkeley by
45 1.1 fvdl * William Jolitz.
46 1.1 fvdl *
47 1.1 fvdl * Redistribution and use in source and binary forms, with or without
48 1.1 fvdl * modification, are permitted provided that the following conditions
49 1.1 fvdl * are met:
50 1.1 fvdl * 1. Redistributions of source code must retain the above copyright
51 1.1 fvdl * notice, this list of conditions and the following disclaimer.
52 1.1 fvdl * 2. Redistributions in binary form must reproduce the above copyright
53 1.1 fvdl * notice, this list of conditions and the following disclaimer in the
54 1.1 fvdl * documentation and/or other materials provided with the distribution.
55 1.8 agc * 3. Neither the name of the University nor the names of its contributors
56 1.1 fvdl * may be used to endorse or promote products derived from this software
57 1.1 fvdl * without specific prior written permission.
58 1.1 fvdl *
59 1.1 fvdl * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
60 1.1 fvdl * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
61 1.1 fvdl * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
62 1.1 fvdl * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
63 1.1 fvdl * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
64 1.1 fvdl * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
65 1.1 fvdl * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
66 1.1 fvdl * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
67 1.1 fvdl * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
68 1.1 fvdl * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
69 1.1 fvdl * SUCH DAMAGE.
70 1.1 fvdl *
71 1.1 fvdl * @(#)isa.c 7.2 (Berkeley) 5/13/91
72 1.1 fvdl */
73 1.1 fvdl
74 1.1 fvdl #include <sys/cdefs.h>
75 1.14 christos __KERNEL_RCSID(0, "$NetBSD: isa_machdep.c,v 1.14 2006/10/12 01:30:44 christos Exp $");
76 1.1 fvdl
77 1.1 fvdl #include <sys/param.h>
78 1.1 fvdl #include <sys/systm.h>
79 1.1 fvdl #include <sys/kernel.h>
80 1.1 fvdl #include <sys/syslog.h>
81 1.1 fvdl #include <sys/device.h>
82 1.1 fvdl #include <sys/malloc.h>
83 1.1 fvdl #include <sys/proc.h>
84 1.1 fvdl #include <sys/mbuf.h>
85 1.1 fvdl
86 1.1 fvdl #include <machine/bus.h>
87 1.12 yamt #include <machine/bus_private.h>
88 1.1 fvdl
89 1.1 fvdl #include <machine/pio.h>
90 1.1 fvdl #include <machine/cpufunc.h>
91 1.1 fvdl
92 1.1 fvdl #include <dev/isa/isareg.h>
93 1.1 fvdl #include <dev/isa/isavar.h>
94 1.1 fvdl
95 1.1 fvdl #include <uvm/uvm_extern.h>
96 1.1 fvdl
97 1.1 fvdl #include "ioapic.h"
98 1.1 fvdl
99 1.1 fvdl #if NIOAPIC > 0
100 1.1 fvdl #include <machine/i82093var.h>
101 1.1 fvdl #include <machine/mpbiosvar.h>
102 1.2 fvdl #endif
103 1.1 fvdl
104 1.7 fvdl static int _isa_dma_may_bounce(bus_dma_tag_t, bus_dmamap_t, int, int *);
105 1.1 fvdl
106 1.1 fvdl struct x86_bus_dma_tag isa_bus_dma_tag = {
107 1.7 fvdl ISA_DMA_BOUNCE_THRESHOLD, /* _bounce_thresh */
108 1.7 fvdl 0, /* _bounce_alloc_lo */
109 1.7 fvdl ISA_DMA_BOUNCE_THRESHOLD, /* _bounce_alloc_hi */
110 1.7 fvdl _isa_dma_may_bounce,
111 1.7 fvdl _bus_dmamap_create,
112 1.7 fvdl _bus_dmamap_destroy,
113 1.7 fvdl _bus_dmamap_load,
114 1.7 fvdl _bus_dmamap_load_mbuf,
115 1.7 fvdl _bus_dmamap_load_uio,
116 1.7 fvdl _bus_dmamap_load_raw,
117 1.7 fvdl _bus_dmamap_unload,
118 1.7 fvdl _bus_dmamap_sync,
119 1.7 fvdl _bus_dmamem_alloc,
120 1.1 fvdl _bus_dmamem_free,
121 1.1 fvdl _bus_dmamem_map,
122 1.1 fvdl _bus_dmamem_unmap,
123 1.1 fvdl _bus_dmamem_mmap,
124 1.1 fvdl };
125 1.1 fvdl
126 1.7 fvdl #define IDTVEC(name) __CONCAT(X,name)
127 1.7 fvdl typedef void (vector) __P((void));
128 1.7 fvdl extern vector *IDTVEC(intr)[];
129 1.7 fvdl
130 1.1 fvdl #define LEGAL_IRQ(x) ((x) >= 0 && (x) < NUM_LEGACY_IRQS && (x) != 2)
131 1.1 fvdl
132 1.1 fvdl int
133 1.14 christos isa_intr_alloc(isa_chipset_tag_t ic __unused, int mask, int type, int *irq)
134 1.1 fvdl {
135 1.1 fvdl int i, tmp, bestirq, count;
136 1.1 fvdl struct intrhand **p, *q;
137 1.1 fvdl struct intrsource *isp;
138 1.1 fvdl struct cpu_info *ci;
139 1.1 fvdl
140 1.1 fvdl if (type == IST_NONE)
141 1.1 fvdl panic("intr_alloc: bogus type");
142 1.1 fvdl
143 1.1 fvdl ci = &cpu_info_primary;
144 1.1 fvdl
145 1.1 fvdl bestirq = -1;
146 1.1 fvdl count = -1;
147 1.1 fvdl
148 1.1 fvdl /* some interrupts should never be dynamically allocated */
149 1.1 fvdl mask &= 0xdef8;
150 1.1 fvdl
151 1.1 fvdl /*
152 1.1 fvdl * XXX some interrupts will be used later (6 for fdc, 12 for pms).
153 1.1 fvdl * the right answer is to do "breadth-first" searching of devices.
154 1.1 fvdl */
155 1.1 fvdl mask &= 0xefbf;
156 1.1 fvdl
157 1.1 fvdl simple_lock(&ci->ci_slock);
158 1.1 fvdl
159 1.1 fvdl for (i = 0; i < NUM_LEGACY_IRQS; i++) {
160 1.1 fvdl if (LEGAL_IRQ(i) == 0 || (mask & (1<<i)) == 0)
161 1.1 fvdl continue;
162 1.1 fvdl isp = ci->ci_isources[i];
163 1.1 fvdl if (isp == NULL) {
164 1.1 fvdl /*
165 1.1 fvdl * if nothing's using the irq, just return it
166 1.1 fvdl */
167 1.1 fvdl *irq = i;
168 1.1 fvdl simple_unlock(&ci->ci_slock);
169 1.1 fvdl return (0);
170 1.1 fvdl }
171 1.1 fvdl
172 1.1 fvdl switch(isp->is_type) {
173 1.1 fvdl case IST_EDGE:
174 1.1 fvdl case IST_LEVEL:
175 1.1 fvdl if (type != isp->is_type)
176 1.1 fvdl continue;
177 1.1 fvdl /*
178 1.1 fvdl * if the irq is shareable, count the number of other
179 1.1 fvdl * handlers, and if it's smaller than the last irq like
180 1.1 fvdl * this, remember it
181 1.1 fvdl *
182 1.1 fvdl * XXX We should probably also consider the
183 1.1 fvdl * interrupt level and stick IPL_TTY with other
184 1.1 fvdl * IPL_TTY, etc.
185 1.1 fvdl */
186 1.1 fvdl for (p = &isp->is_handlers, tmp = 0; (q = *p) != NULL;
187 1.1 fvdl p = &q->ih_next, tmp++)
188 1.1 fvdl ;
189 1.1 fvdl if ((bestirq == -1) || (count > tmp)) {
190 1.1 fvdl bestirq = i;
191 1.1 fvdl count = tmp;
192 1.1 fvdl }
193 1.1 fvdl break;
194 1.1 fvdl
195 1.1 fvdl case IST_PULSE:
196 1.1 fvdl /* this just isn't shareable */
197 1.1 fvdl continue;
198 1.1 fvdl }
199 1.1 fvdl }
200 1.1 fvdl
201 1.1 fvdl simple_unlock(&ci->ci_slock);
202 1.1 fvdl
203 1.1 fvdl if (bestirq == -1)
204 1.1 fvdl return (1);
205 1.1 fvdl
206 1.1 fvdl *irq = bestirq;
207 1.1 fvdl
208 1.1 fvdl return (0);
209 1.1 fvdl }
210 1.1 fvdl
211 1.1 fvdl const struct evcnt *
212 1.14 christos isa_intr_evcnt(isa_chipset_tag_t ic __unused, int irq __unused)
213 1.1 fvdl {
214 1.1 fvdl
215 1.1 fvdl /* XXX for now, no evcnt parent reported */
216 1.1 fvdl return NULL;
217 1.1 fvdl }
218 1.1 fvdl
219 1.1 fvdl void *
220 1.14 christos isa_intr_establish(
221 1.14 christos isa_chipset_tag_t ic __unused,
222 1.14 christos int irq,
223 1.14 christos int type,
224 1.14 christos int level,
225 1.14 christos int (*ih_fun)(void *),
226 1.14 christos void *ih_arg
227 1.14 christos )
228 1.1 fvdl {
229 1.1 fvdl struct pic *pic;
230 1.1 fvdl int pin;
231 1.1 fvdl #if NIOAPIC > 0
232 1.1 fvdl int mpih;
233 1.1 fvdl #endif
234 1.1 fvdl
235 1.1 fvdl pin = irq;
236 1.1 fvdl pic = &i8259_pic;
237 1.1 fvdl
238 1.1 fvdl #if NIOAPIC > 0
239 1.1 fvdl if (mp_busses != NULL) {
240 1.10 fvdl if (intr_find_mpmapping(mp_isa_bus, irq, &mpih) == 0 ||
241 1.10 fvdl intr_find_mpmapping(mp_eisa_bus, irq, &mpih) == 0) {
242 1.1 fvdl if (!APIC_IRQ_ISLEGACY(mpih)) {
243 1.1 fvdl pin = APIC_IRQ_PIN(mpih);
244 1.1 fvdl pic = (struct pic *)
245 1.1 fvdl ioapic_find(APIC_IRQ_APIC(mpih));
246 1.1 fvdl if (pic == NULL) {
247 1.1 fvdl printf("isa_intr_establish: "
248 1.1 fvdl "unknown apic %d\n",
249 1.1 fvdl APIC_IRQ_APIC(mpih));
250 1.1 fvdl return NULL;
251 1.1 fvdl }
252 1.1 fvdl }
253 1.1 fvdl } else
254 1.1 fvdl printf("isa_intr_establish: no MP mapping found\n");
255 1.1 fvdl }
256 1.1 fvdl #endif
257 1.1 fvdl return intr_establish(irq, pic, pin, type, level, ih_fun, ih_arg);
258 1.1 fvdl }
259 1.1 fvdl
260 1.1 fvdl /*
261 1.1 fvdl * Deregister an interrupt handler.
262 1.1 fvdl */
263 1.1 fvdl void
264 1.14 christos isa_intr_disestablish(isa_chipset_tag_t ic __unused, void *arg)
265 1.1 fvdl {
266 1.1 fvdl struct intrhand *ih = arg;
267 1.1 fvdl
268 1.1 fvdl if (!LEGAL_IRQ(ih->ih_pin))
269 1.1 fvdl panic("intr_disestablish: bogus irq");
270 1.1 fvdl
271 1.1 fvdl intr_disestablish(ih);
272 1.1 fvdl }
273 1.1 fvdl
274 1.1 fvdl void
275 1.14 christos isa_attach_hook(struct device *parent __unused, struct device *self __unused,
276 1.14 christos struct isabus_attach_args *iba)
277 1.1 fvdl {
278 1.4 fvdl extern struct x86_isa_chipset x86_isa_chipset;
279 1.1 fvdl extern int isa_has_been_seen;
280 1.1 fvdl
281 1.1 fvdl /*
282 1.1 fvdl * Notify others that might need to know that the ISA bus
283 1.1 fvdl * has now been attached.
284 1.1 fvdl */
285 1.1 fvdl if (isa_has_been_seen)
286 1.1 fvdl panic("isaattach: ISA bus already seen!");
287 1.1 fvdl isa_has_been_seen = 1;
288 1.1 fvdl
289 1.1 fvdl /*
290 1.1 fvdl * Since we can only have one ISA bus, we just use a single
291 1.1 fvdl * statically allocated ISA chipset structure. Pass it up
292 1.1 fvdl * now.
293 1.1 fvdl */
294 1.4 fvdl iba->iba_ic = &x86_isa_chipset;
295 1.1 fvdl }
296 1.1 fvdl
297 1.1 fvdl int
298 1.1 fvdl isa_mem_alloc(t, size, align, boundary, flags, addrp, bshp)
299 1.1 fvdl bus_space_tag_t t;
300 1.1 fvdl bus_size_t size, align;
301 1.1 fvdl bus_addr_t boundary;
302 1.1 fvdl int flags;
303 1.1 fvdl bus_addr_t *addrp;
304 1.1 fvdl bus_space_handle_t *bshp;
305 1.1 fvdl {
306 1.1 fvdl
307 1.1 fvdl /*
308 1.1 fvdl * Allocate physical address space in the ISA hole.
309 1.1 fvdl */
310 1.1 fvdl return (bus_space_alloc(t, IOM_BEGIN, IOM_END - 1, size, align,
311 1.1 fvdl boundary, flags, addrp, bshp));
312 1.1 fvdl }
313 1.1 fvdl
314 1.1 fvdl void
315 1.1 fvdl isa_mem_free(t, bsh, size)
316 1.1 fvdl bus_space_tag_t t;
317 1.1 fvdl bus_space_handle_t bsh;
318 1.1 fvdl bus_size_t size;
319 1.1 fvdl {
320 1.1 fvdl
321 1.1 fvdl bus_space_free(t, bsh, size);
322 1.1 fvdl }
323 1.1 fvdl
324 1.1 fvdl /*
325 1.7 fvdl * ISA only has 24-bits of address space. This means
326 1.7 fvdl * we can't DMA to pages over 16M. In order to DMA to
327 1.7 fvdl * arbitrary buffers, we use "bounce buffers" - pages
328 1.7 fvdl * in memory below the 16M boundary. On DMA reads,
329 1.7 fvdl * DMA happens to the bounce buffers, and is copied into
330 1.7 fvdl * the caller's buffer. On writes, data is copied into
331 1.7 fvdl * but bounce buffer, and the DMA happens from those
332 1.7 fvdl * pages. To software using the DMA mapping interface,
333 1.7 fvdl * this looks simply like a data cache.
334 1.7 fvdl *
335 1.7 fvdl * If we have more than 16M of RAM in the system, we may
336 1.7 fvdl * need bounce buffers. We check and remember that here.
337 1.7 fvdl *
338 1.7 fvdl * There are exceptions, however. VLB devices can do
339 1.7 fvdl * 32-bit DMA, and indicate that here.
340 1.7 fvdl *
341 1.7 fvdl * ...or, there is an opposite case. The most segments
342 1.7 fvdl * a transfer will require is (maxxfer / PAGE_SIZE) + 1. If
343 1.7 fvdl * the caller can't handle that many segments (e.g. the
344 1.7 fvdl * ISA DMA controller), we may have to bounce it as well.
345 1.7 fvdl */
346 1.7 fvdl static int
347 1.14 christos _isa_dma_may_bounce(bus_dma_tag_t t __unused, bus_dmamap_t map, int flags,
348 1.14 christos int *cookieflagsp)
349 1.1 fvdl {
350 1.7 fvdl if ((flags & ISABUS_DMA_32BIT) != 0)
351 1.1 fvdl map->_dm_bounce_thresh = 0;
352 1.1 fvdl
353 1.7 fvdl if (((map->_dm_size / PAGE_SIZE) + 1) > map->_dm_segcnt)
354 1.11 thorpej *cookieflagsp |= X86_DMA_MIGHT_NEED_BOUNCE;
355 1.7 fvdl return 0;
356 1.1 fvdl }
357