isa_machdep.h revision 1.1
1 /* $NetBSD: isa_machdep.h,v 1.1 2001/02/04 18:32:13 briggs 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 Jason R. Thorpe of the Numerical Aerospace Simulation Facility, 9 * 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 * 3. All advertising materials mentioning features or use of this software 20 * must display the following acknowledgement: 21 * This product includes software developed by the NetBSD 22 * Foundation, Inc. and its contributors. 23 * 4. Neither the name of The NetBSD Foundation nor the names of its 24 * contributors may be used to endorse or promote products derived 25 * from this software without specific prior written permission. 26 * 27 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 28 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 29 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 30 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 31 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 32 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 33 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 34 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 35 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 36 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 37 * POSSIBILITY OF SUCH DAMAGE. 38 */ 39 40 /*- 41 * Copyright (c) 1990 The Regents of the University of California. 42 * All rights reserved. 43 * 44 * This code is derived from software contributed to Berkeley by 45 * William Jolitz. 46 * 47 * Redistribution and use in source and binary forms, with or without 48 * modification, are permitted provided that the following conditions 49 * are met: 50 * 1. Redistributions of source code must retain the above copyright 51 * notice, this list of conditions and the following disclaimer. 52 * 2. Redistributions in binary form must reproduce the above copyright 53 * notice, this list of conditions and the following disclaimer in the 54 * documentation and/or other materials provided with the distribution. 55 * 3. All advertising materials mentioning features or use of this software 56 * must display the following acknowledgement: 57 * This product includes software developed by the University of 58 * California, Berkeley and its contributors. 59 * 4. Neither the name of the University nor the names of its contributors 60 * may be used to endorse or promote products derived from this software 61 * without specific prior written permission. 62 * 63 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 64 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 65 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 66 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 67 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 68 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 69 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 70 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 71 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 72 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 73 * SUCH DAMAGE. 74 * 75 * @(#)isa.h 5.7 (Berkeley) 5/9/91 76 */ 77 78 /* 79 * Various pieces of the sandpoint port want to include this file without 80 * or in spite of using isavar.h, and should be fixed. 81 */ 82 83 #ifndef _SANDPOINT_ISA_MACHDEP_H_ /* XXX */ 84 #define _SANDPOINT_ISA_MACHDEP_H_ /* XXX */ 85 86 #include <machine/bus.h> 87 #include <dev/isa/isadmavar.h> 88 89 /* 90 * XXX THIS FILE IS A MESS. copyright: berkeley's probably. 91 * contents from isavar.h and isareg.h, mostly the latter. 92 * perhaps charles's? 93 * 94 * copyright from berkeley's isa.h which is now dev/isa/isareg.h. 95 */ 96 97 /* 98 * Types provided to machine-independent ISA code. 99 */ 100 struct sandpoint_isa_chipset { 101 struct isa_dma_state ic_dmastate; 102 }; 103 104 typedef struct sandpoint_isa_chipset *isa_chipset_tag_t; 105 106 struct device; /* XXX */ 107 struct isabus_attach_args; /* XXX */ 108 109 /* 110 * Functions provided to machine-independent ISA code. 111 */ 112 void isa_attach_hook(struct device *, struct device *, 113 struct isabus_attach_args *); 114 const struct evcnt *isa_intr_evcnt(isa_chipset_tag_t ic, int irq); 115 void isa_intr_init(void); 116 void *isa_intr_establish(isa_chipset_tag_t ic, int irq, int type, 117 int level, int (*ih_fun)(void *), void *ih_arg); 118 void isa_intr_disestablish(isa_chipset_tag_t ic, void *handler); 119 120 #define isa_dmainit(ic, bst, dmat, d) \ 121 _isa_dmainit(&(ic)->ic_dmastate, (bst), (dmat), (d)) 122 #define isa_dmacascade(ic, c) \ 123 _isa_dmacascade(&(ic)->ic_dmastate, (c)) 124 #define isa_dmamaxsize(ic, c) \ 125 _isa_dmamaxsize(&(ic)->ic_dmastate, (c)) 126 #define isa_dmamap_create(ic, c, s, f) \ 127 _isa_dmamap_create(&(ic)->ic_dmastate, (c), (s), (f)) 128 #define isa_dmamap_destroy(ic, c) \ 129 _isa_dmamap_destroy(&(ic)->ic_dmastate, (c)) 130 #define isa_dmastart(ic, c, a, n, p, f, bf) \ 131 _isa_dmastart(&(ic)->ic_dmastate, (c), (a), (n), (p), (f), (bf)) 132 #define isa_dmaabort(ic, c) \ 133 _isa_dmaabort(&(ic)->ic_dmastate, (c)) 134 #define isa_dmacount(ic, c) \ 135 _isa_dmacount(&(ic)->ic_dmastate, (c)) 136 #define isa_dmafinished(ic, c) \ 137 _isa_dmafinished(&(ic)->ic_dmastate, (c)) 138 #define isa_dmadone(ic, c) \ 139 _isa_dmadone(&(ic)->ic_dmastate, (c)) 140 #define isa_dmafreeze(ic) \ 141 _isa_dmafreeze(&(ic)->ic_dmastate) 142 #define isa_dmathaw(ic) \ 143 _isa_dmathaw(&(ic)->ic_dmastate) 144 #define isa_dmamem_alloc(ic, c, s, ap, f) \ 145 _isa_dmamem_alloc(&(ic)->ic_dmastate, (c), (s), (ap), (f)) 146 #define isa_dmamem_free(ic, c, a, s) \ 147 _isa_dmamem_free(&(ic)->ic_dmastate, (c), (a), (s)) 148 #define isa_dmamem_map(ic, c, a, s, kp, f) \ 149 _isa_dmamem_map(&(ic)->ic_dmastate, (c), (a), (s), (kp), (f)) 150 #define isa_dmamem_unmap(ic, c, k, s) \ 151 _isa_dmamem_unmap(&(ic)->ic_dmastate, (c), (k), (s)) 152 #define isa_dmamem_mmap(ic, c, a, s, o, p, f) \ 153 _isa_dmamem_mmap(&(ic)->ic_dmastate, (c), (a), (s), (o), (p), (f)) 154 #define isa_drq_isfree(ic, c) \ 155 _isa_drq_isfree(&(ic)->ic_dmastate, (c)) 156 #define isa_malloc(ic, c, s, p, f) \ 157 _isa_malloc(&(ic)->ic_dmastate, (c), (s), (p), (f)) 158 #define isa_free(a, p) \ 159 _isa_free((a), (p)) 160 #define isa_mappage(m, o, p) \ 161 _isa_mappage((m), (o), (p)) 162 163 /* 164 * ALL OF THE FOLLOWING ARE MACHINE-DEPENDENT, AND SHOULD NOT BE USED 165 * BY PORTABLE CODE. 166 */ 167 168 #define isa_outb(x,y) outb(SANDPOINT_BUS_SPACE_IO + (x), y) 169 #define isa_inb(x) inb(SANDPOINT_BUS_SPACE_IO + (x)) 170 171 extern struct sandpoint_bus_dma_tag isa_bus_dma_tag; 172 173 /* 174 * Cookie used by ISA dma. A pointer to one of these it stashed in 175 * the DMA map. 176 */ 177 struct sandpoint_isa_dma_cookie { 178 int id_flags; /* flags; see below */ 179 180 /* 181 * Information about the original buffer used during 182 * DMA map syncs. Note that origbuflen is only used 183 * for ID_BUFTYPE_LINEAR. 184 */ 185 void *id_origbuf; /* pointer to orig buffer if 186 bouncing */ 187 bus_size_t id_origbuflen; /* ...and size */ 188 int id_buftype; /* type of buffer */ 189 190 void *id_bouncebuf; /* pointer to the bounce buffer */ 191 bus_size_t id_bouncebuflen; /* ...and size */ 192 int id_nbouncesegs; /* number of valid bounce segs */ 193 bus_dma_segment_t id_bouncesegs[0]; /* array of bounce buffer 194 physical memory segments */ 195 }; 196 197 /* id_flags */ 198 #define ID_MIGHT_NEED_BOUNCE 0x01 /* map could need bounce buffers */ 199 #define ID_HAS_BOUNCE 0x02 /* map currently has bounce buffers */ 200 #define ID_IS_BOUNCING 0x04 /* map is bouncing current xfer */ 201 202 /* id_buftype */ 203 #define ID_BUFTYPE_INVALID 0 204 #define ID_BUFTYPE_LINEAR 1 205 #define ID_BUFTYPE_MBUF 2 206 #define ID_BUFTYPE_UIO 3 207 #define ID_BUFTYPE_RAW 4 208 209 /* 210 * XXX Various seemingly PC-specific constants, some of which may be 211 * unnecessary anyway. 212 */ 213 214 /* 215 * stuff that used to be in pccons.c 216 */ 217 #define MONO_BASE 0x3B4 218 #define MONO_BUF 0xB0000 219 #define CGA_BASE 0x3D4 220 #define CGA_BUF 0xB8000 221 #define IOPHYSMEM 0xA0000 222 223 224 /* 225 * ISA DMA bounce buffers. 226 * XXX should be made partially machine- and bus-mapping-independent. 227 * 228 * DMA_BOUNCE is the number of pages of low-addressed physical memory 229 * to acquire for ISA bounce buffers. 230 * 231 * isaphysmem is the location of those bounce buffers. (They are currently 232 * assumed to be contiguous. 233 */ 234 235 #ifndef DMA_BOUNCE 236 #define DMA_BOUNCE 8 /* one buffer per channel */ 237 #endif 238 239 extern paddr_t isaphysmem; 240 241 /* 242 * Miscellanous functions. 243 */ 244 void sysbeep(int, int); /* beep with the system speaker */ 245 246 void isa_do_pending_int __P((int)); /* Process any pending ISA interrupts */ 247 void isa_intr_calculate_masks __P((int)); 248 249 #endif /* _SANDPOINT_ISA_MACHDEP_H_ XXX */ 250
Indexes created Mon Sep 29 21:09:56 GMT 2025