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