1 /* $NetBSD: isa_machdep.c,v 1.31 2011/10/18 23:43:36 dyoung 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.31 2011/10/18 23:43:36 dyoung 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 #include <sys/bus.h> 78 #include <sys/cpu.h> 79 80 #include <machine/bus_private.h> 81 #include <machine/pio.h> 82 #include <machine/cpufunc.h> 83 #include <machine/autoconf.h> 84 #include <machine/bootinfo.h> 85 86 #include <dev/isa/isareg.h> 87 #include <dev/isa/isavar.h> 88 89 #include <uvm/uvm_extern.h> 90 91 #include "acpica.h" 92 #include "opt_acpi.h" 93 #include "ioapic.h" 94 95 #if NIOAPIC > 0 96 #include <machine/i82093var.h> 97 #include <machine/mpbiosvar.h> 98 #endif 99 100 static int _isa_dma_may_bounce(bus_dma_tag_t, bus_dmamap_t, int, int *); 101 102 struct x86_bus_dma_tag isa_bus_dma_tag = { 103 ._tag_needs_free = 0, 104 ._bounce_thresh = ISA_DMA_BOUNCE_THRESHOLD, 105 ._bounce_alloc_lo = 0, 106 ._bounce_alloc_hi = ISA_DMA_BOUNCE_THRESHOLD, 107 ._may_bounce = _isa_dma_may_bounce, 108 }; 109 110 #define IDTVEC(name) __CONCAT(X,name) 111 typedef void (vector)(void); 112 extern vector *IDTVEC(intr)[]; 113 114 #define LEGAL_IRQ(x) ((x) >= 0 && (x) < NUM_LEGACY_IRQS && (x) != 2) 115 116 int 117 isa_intr_alloc(isa_chipset_tag_t ic, int mask, int type, int *irq) 118 { 119 int i, tmp, bestirq, count; 120 struct intrhand **p, *q; 121 struct intrsource *isp; 122 struct cpu_info *ci; 123 124 if (type == IST_NONE) 125 panic("intr_alloc: bogus type"); 126 127 ci = &cpu_info_primary; 128 129 bestirq = -1; 130 count = -1; 131 132 /* some interrupts should never be dynamically allocated */ 133 mask &= 0xdef8; 134 135 /* 136 * XXX some interrupts will be used later (6 for fdc, 12 for pms). 137 * the right answer is to do "breadth-first" searching of devices. 138 */ 139 mask &= 0xefbf; 140 141 mutex_enter(&cpu_lock); 142 143 for (i = 0; i < NUM_LEGACY_IRQS; i++) { 144 if (LEGAL_IRQ(i) == 0 || (mask & (1<<i)) == 0) 145 continue; 146 isp = ci->ci_isources[i]; 147 if (isp == NULL) { 148 /* 149 * if nothing's using the irq, just return it 150 */ 151 *irq = i; 152 mutex_exit(&cpu_lock); 153 return (0); 154 } 155 156 switch(isp->is_type) { 157 case IST_EDGE: 158 case IST_LEVEL: 159 if (type != isp->is_type) 160 continue; 161 /* 162 * if the irq is shareable, count the number of other 163 * handlers, and if it's smaller than the last irq like 164 * this, remember it 165 * 166 * XXX We should probably also consider the 167 * interrupt level and stick IPL_TTY with other 168 * IPL_TTY, etc. 169 */ 170 for (p = &isp->is_handlers, tmp = 0; (q = *p) != NULL; 171 p = &q->ih_next, tmp++) 172 ; 173 if ((bestirq == -1) || (count > tmp)) { 174 bestirq = i; 175 count = tmp; 176 } 177 break; 178 179 case IST_PULSE: 180 /* this just isn't shareable */ 181 continue; 182 } 183 } 184 185 mutex_exit(&cpu_lock); 186 187 if (bestirq == -1) 188 return (1); 189 190 *irq = bestirq; 191 192 return (0); 193 } 194 195 const struct evcnt * 196 isa_intr_evcnt(isa_chipset_tag_t ic, int irq) 197 { 198 199 /* XXX for now, no evcnt parent reported */ 200 return NULL; 201 } 202 203 void * 204 isa_intr_establish( 205 isa_chipset_tag_t ic, 206 int irq, 207 int type, 208 int level, 209 int (*ih_fun)(void *), 210 void *ih_arg 211 ) 212 { 213 struct pic *pic; 214 int pin; 215 #if NIOAPIC > 0 216 int mpih; 217 struct ioapic_softc *ioapic; 218 #endif 219 220 pin = irq; 221 pic = &i8259_pic; 222 223 #if NIOAPIC > 0 224 if (mp_busses != NULL) { 225 if (intr_find_mpmapping(mp_isa_bus, irq, &mpih) == 0 || 226 intr_find_mpmapping(mp_eisa_bus, irq, &mpih) == 0) { 227 if (!APIC_IRQ_ISLEGACY(mpih)) { 228 pin = APIC_IRQ_PIN(mpih); 229 ioapic = ioapic_find(APIC_IRQ_APIC(mpih)); 230 if (ioapic == NULL) { 231 printf("isa_intr_establish: " 232 "unknown apic %d\n", 233 APIC_IRQ_APIC(mpih)); 234 return NULL; 235 } 236 pic = &ioapic->sc_pic; 237 } 238 } else 239 printf("isa_intr_establish: no MP mapping found\n"); 240 } 241 #endif 242 return intr_establish(irq, pic, pin, type, level, ih_fun, ih_arg, false); 243 } 244 245 /* 246 * Deregister an interrupt handler. 247 */ 248 void 249 isa_intr_disestablish(isa_chipset_tag_t ic, void *arg) 250 { 251 struct intrhand *ih = arg; 252 253 if (!LEGAL_IRQ(ih->ih_pin)) 254 panic("intr_disestablish: bogus irq"); 255 256 intr_disestablish(ih); 257 } 258 259 void 260 isa_attach_hook(device_t parent, device_t self, 261 struct isabus_attach_args *iba) 262 { 263 extern struct x86_isa_chipset x86_isa_chipset; 264 extern int isa_has_been_seen; 265 266 /* 267 * Notify others that might need to know that the ISA bus 268 * has now been attached. 269 */ 270 if (isa_has_been_seen) 271 panic("isaattach: ISA bus already seen!"); 272 isa_has_been_seen = 1; 273 274 /* 275 * Since we can only have one ISA bus, we just use a single 276 * statically allocated ISA chipset structure. Pass it up 277 * now. 278 */ 279 iba->iba_ic = &x86_isa_chipset; 280 } 281 282 void 283 isa_detach_hook(isa_chipset_tag_t ic, device_t self) 284 { 285 extern int isa_has_been_seen; 286 287 isa_has_been_seen = 0; 288 } 289 290 int 291 isa_mem_alloc(bus_space_tag_t t, bus_size_t size, bus_size_t align, 292 bus_addr_t boundary, int flags, bus_addr_t *addrp, bus_space_handle_t *bshp) 293 { 294 295 /* 296 * Allocate physical address space in the ISA hole. 297 */ 298 return (bus_space_alloc(t, IOM_BEGIN, IOM_END - 1, size, align, 299 boundary, flags, addrp, bshp)); 300 } 301 302 void 303 isa_mem_free(bus_space_tag_t t, bus_space_handle_t bsh, bus_size_t size) 304 { 305 306 bus_space_free(t, bsh, size); 307 } 308 309 /* 310 * ISA only has 24-bits of address space. This means 311 * we can't DMA to pages over 16M. In order to DMA to 312 * arbitrary buffers, we use "bounce buffers" - pages 313 * in memory below the 16M boundary. On DMA reads, 314 * DMA happens to the bounce buffers, and is copied into 315 * the caller's buffer. On writes, data is copied into 316 * but bounce buffer, and the DMA happens from those 317 * pages. To software using the DMA mapping interface, 318 * this looks simply like a data cache. 319 * 320 * If we have more than 16M of RAM in the system, we may 321 * need bounce buffers. We check and remember that here. 322 * 323 * There are exceptions, however. VLB devices can do 324 * 32-bit DMA, and indicate that here. 325 * 326 * ...or, there is an opposite case. The most segments 327 * a transfer will require is (maxxfer / PAGE_SIZE) + 1. If 328 * the caller can't handle that many segments (e.g. the 329 * ISA DMA controller), we may have to bounce it as well. 330 */ 331 static int 332 _isa_dma_may_bounce(bus_dma_tag_t t, bus_dmamap_t map, int flags, 333 int *cookieflagsp) 334 { 335 if ((flags & ISABUS_DMA_32BIT) != 0) 336 map->_dm_bounce_thresh = 0; 337 338 if (((map->_dm_size / PAGE_SIZE) + 1) > map->_dm_segcnt) 339 *cookieflagsp |= X86_DMA_MIGHT_NEED_BOUNCE; 340 return 0; 341 } 342 343 device_t 344 device_isa_register(device_t dev, void *aux) 345 { 346 347 /* 348 * Handle network interfaces here, the attachment information is 349 * not available driver-independently later. 350 * 351 * For disks, there is nothing useful available at attach time. 352 */ 353 if (device_class(dev) == DV_IFNET) { 354 struct btinfo_netif *bin = lookup_bootinfo(BTINFO_NETIF); 355 if (bin == NULL) 356 return NULL; 357 358 /* 359 * We don't check the driver name against the device name 360 * passed by the boot ROM. The ROM should stay usable if 361 * the driver becomes obsolete. The physical attachment 362 * information (checked below) must be sufficient to 363 * idenfity the device. 364 */ 365 if (bin->bus == BI_BUS_ISA && 366 device_is_a(device_parent(dev), "isa")) { 367 struct isa_attach_args *iaa = aux; 368 369 /* Compare IO base address */ 370 /* XXXJRT What about multiple IO addrs? */ 371 if (iaa->ia_nio > 0 && 372 bin->addr.iobase == iaa->ia_io[0].ir_addr) 373 return dev; 374 } 375 } 376 #if NACPICA > 0 377 #if notyet 378 if (device_is_a(dev, "isa") && acpi_active) { 379 if (!(AcpiGbl_FADT.BootFlags & ACPI_FADT_LEGACY_DEVICES)) 380 prop_dictionary_set_bool(device_properties(dev), 381 "no-legacy-devices", true); 382 } 383 #endif 384 #endif /* NACPICA > 0 */ 385 return NULL; 386 } 387