dmavar.h revision 1.7 1 /* $NetBSD: dmavar.h,v 1.7 1997/01/30 09:04:35 thorpej Exp $ */
2
3 /*
4 * Copyright (c) 1997 Jason R. Thorpe. All rights reserved.
5 * Copyright (c) 1982, 1990, 1993
6 * The Regents of the University of California. All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * SUCH DAMAGE.
35 *
36 * @(#)dmavar.h 8.1 (Berkeley) 6/10/93
37 */
38
39 #include <sys/queue.h>
40
41 /* dmago flags */
42 #define DMAGO_BYTE 0x00 /* do byte (8 bit) transfers */
43 #define DMAGO_WORD 0x01 /* do word (16 bit) transfers */
44 #define DMAGO_LWORD 0x02 /* do longword (32 bit) transfers */
45 #define DMAGO_PRI 0x04 /* do "priority" DMA */
46 #define DMAGO_READ 0x08 /* transfer is a read */
47 #define DMAGO_NOINT 0x80 /* don't interrupt on completion */
48
49 /* dma "controllers" (channels) */
50 #define DMA0 0x1
51 #define DMA1 0x2
52
53 /*
54 * A DMA queue entry. Initiator drivers each have one of these,
55 * used to queue access to the DMA controller.
56 */
57 struct dmaqueue {
58 TAILQ_ENTRY(dmaqueue) dq_list; /* entry on the queue */
59 int dq_chan; /* OR of channels initiator can use */
60 void *dq_softc; /* initiator's softc */
61
62 /*
63 * These functions are called to start the initiator when
64 * it has been given the DMA controller, and to stop the
65 * initiator when the DMA controller has stopped.
66 */
67 void (*dq_start) __P((void *));
68 void (*dq_done) __P((void *));
69 };
70
71 #ifdef _KERNEL
72 extern void dmago(), dmafree();
73 extern int dmareq();
74 extern void dmacomputeipl __P((void));
75 #endif
76