bus_dma.h revision 1.1 1 1.1 dbj /* $NetBSD: bus_dma.h,v 1.1 1998/06/09 07:53:05 dbj Exp $ */
2 1.1 dbj
3 1.1 dbj /*-
4 1.1 dbj * Copyright (c) 1997, 1998 The NetBSD Foundation, Inc.
5 1.1 dbj * All rights reserved.
6 1.1 dbj *
7 1.1 dbj * This code is derived from software contributed to The NetBSD Foundation
8 1.1 dbj * by Jason R. Thorpe of the Numerical Aerospace Simulation Facility,
9 1.1 dbj * NASA Ames Research Center.
10 1.1 dbj *
11 1.1 dbj * Redistribution and use in source and binary forms, with or without
12 1.1 dbj * modification, are permitted provided that the following conditions
13 1.1 dbj * are met:
14 1.1 dbj * 1. Redistributions of source code must retain the above copyright
15 1.1 dbj * notice, this list of conditions and the following disclaimer.
16 1.1 dbj * 2. Redistributions in binary form must reproduce the above copyright
17 1.1 dbj * notice, this list of conditions and the following disclaimer in the
18 1.1 dbj * documentation and/or other materials provided with the distribution.
19 1.1 dbj * 3. All advertising materials mentioning features or use of this software
20 1.1 dbj * must display the following acknowledgement:
21 1.1 dbj * This product includes software developed by the NetBSD
22 1.1 dbj * Foundation, Inc. and its contributors.
23 1.1 dbj * 4. Neither the name of The NetBSD Foundation nor the names of its
24 1.1 dbj * contributors may be used to endorse or promote products derived
25 1.1 dbj * from this software without specific prior written permission.
26 1.1 dbj *
27 1.1 dbj * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
28 1.1 dbj * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
29 1.1 dbj * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
30 1.1 dbj * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
31 1.1 dbj * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
32 1.1 dbj * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
33 1.1 dbj * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
34 1.1 dbj * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
35 1.1 dbj * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
36 1.1 dbj * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
37 1.1 dbj * POSSIBILITY OF SUCH DAMAGE.
38 1.1 dbj */
39 1.1 dbj
40 1.1 dbj /*
41 1.1 dbj * Copyright (c) 1996 Carnegie-Mellon University.
42 1.1 dbj * All rights reserved.
43 1.1 dbj *
44 1.1 dbj * Author: Chris G. Demetriou
45 1.1 dbj *
46 1.1 dbj * Permission to use, copy, modify and distribute this software and
47 1.1 dbj * its documentation is hereby granted, provided that both the copyright
48 1.1 dbj * notice and this permission notice appear in all copies of the
49 1.1 dbj * software, derivative works or modified versions, and any portions
50 1.1 dbj * thereof, and that both notices appear in supporting documentation.
51 1.1 dbj *
52 1.1 dbj * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
53 1.1 dbj * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
54 1.1 dbj * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
55 1.1 dbj *
56 1.1 dbj * Carnegie Mellon requests users of this software to return to
57 1.1 dbj *
58 1.1 dbj * Software Distribution Coordinator or Software.Distribution (at) CS.CMU.EDU
59 1.1 dbj * School of Computer Science
60 1.1 dbj * Carnegie Mellon University
61 1.1 dbj * Pittsburgh PA 15213-3890
62 1.1 dbj *
63 1.1 dbj * any improvements or extensions that they make and grant Carnegie the
64 1.1 dbj * rights to redistribute these changes.
65 1.1 dbj */
66 1.1 dbj
67 1.1 dbj #ifndef _BUS_DMA_H_
68 1.1 dbj #define _BUS_DMA_H_
69 1.1 dbj
70 1.1 dbj /*
71 1.1 dbj * Bus DMA methods.
72 1.1 dbj */
73 1.1 dbj
74 1.1 dbj /*
75 1.1 dbj * Flags used in various bus DMA methods.
76 1.1 dbj */
77 1.1 dbj #define BUS_DMA_WAITOK 0x00 /* safe to sleep (pseudo-flag) */
78 1.1 dbj #define BUS_DMA_NOWAIT 0x01 /* not safe to sleep */
79 1.1 dbj #define BUS_DMA_ALLOCNOW 0x02 /* perform resource allocation now */
80 1.1 dbj #define BUS_DMA_COHERENT 0x04 /* hint: map memory DMA coherent */
81 1.1 dbj #define BUS_DMA_BUS1 0x10 /* placeholders for bus functions... */
82 1.1 dbj #define BUS_DMA_BUS2 0x20
83 1.1 dbj #define BUS_DMA_BUS3 0x40
84 1.1 dbj #define BUS_DMA_BUS4 0x80
85 1.1 dbj
86 1.1 dbj /*
87 1.1 dbj * Private flags stored in the DMA map.
88 1.1 dbj */
89 1.1 dbj #define DMAMAP_HAS_SGMAP 0x80000000 /* sgva/len are valid */
90 1.1 dbj
91 1.1 dbj /* Forwards needed by prototypes below. */
92 1.1 dbj struct mbuf;
93 1.1 dbj struct uio;
94 1.1 dbj
95 1.1 dbj /*
96 1.1 dbj * Operations performed by bus_dmamap_sync().
97 1.1 dbj */
98 1.1 dbj #define BUS_DMASYNC_PREREAD 0x01 /* pre-read synchronization */
99 1.1 dbj #define BUS_DMASYNC_POSTREAD 0x02 /* post-read synchronization */
100 1.1 dbj #define BUS_DMASYNC_PREWRITE 0x04 /* pre-write synchronization */
101 1.1 dbj #define BUS_DMASYNC_POSTWRITE 0x08 /* post-write synchronization */
102 1.1 dbj
103 1.1 dbj /*
104 1.1 dbj * generic_bus_t
105 1.1 dbj *
106 1.1 dbj * Busses supported by NetBSD/generic, used by internal
107 1.1 dbj * utility functions. NOT TO BE USED BY MACHINE-INDEPENDENT
108 1.1 dbj * CODE!
109 1.1 dbj */
110 1.1 dbj typedef enum {
111 1.1 dbj GENERIC_BUS_UNKNOWN,
112 1.1 dbj } generic_bus_t;
113 1.1 dbj
114 1.1 dbj typedef struct generic_bus_dma_tag *bus_dma_tag_t;
115 1.1 dbj typedef struct generic_bus_dmamap *bus_dmamap_t;
116 1.1 dbj
117 1.1 dbj /*
118 1.1 dbj * bus_dma_segment_t
119 1.1 dbj *
120 1.1 dbj * Describes a single contiguous DMA transaction. Values
121 1.1 dbj * are suitable for programming into DMA registers.
122 1.1 dbj */
123 1.1 dbj struct generic_bus_dma_segment {
124 1.1 dbj bus_addr_t ds_addr; /* DMA address */
125 1.1 dbj bus_size_t ds_len; /* length of transfer */
126 1.1 dbj };
127 1.1 dbj typedef struct generic_bus_dma_segment bus_dma_segment_t;
128 1.1 dbj
129 1.1 dbj /*
130 1.1 dbj * bus_dma_tag_t
131 1.1 dbj *
132 1.1 dbj * A machine-dependent opaque type describing the implementation of
133 1.1 dbj * DMA for a given bus.
134 1.1 dbj */
135 1.1 dbj struct generic_bus_dma_tag {
136 1.1 dbj void *_cookie; /* cookie used in the guts */
137 1.1 dbj
138 1.1 dbj /*
139 1.1 dbj * Internal-use only utility methods. NOT TO BE USED BY
140 1.1 dbj * MACHINE-INDEPENDENT CODE!
141 1.1 dbj */
142 1.1 dbj bus_dma_tag_t (*_get_tag) __P((bus_dma_tag_t, generic_bus_t));
143 1.1 dbj
144 1.1 dbj /*
145 1.1 dbj * DMA mapping methods.
146 1.1 dbj */
147 1.1 dbj int (*_dmamap_create) __P((bus_dma_tag_t, bus_size_t, int,
148 1.1 dbj bus_size_t, bus_size_t, int, bus_dmamap_t *));
149 1.1 dbj void (*_dmamap_destroy) __P((bus_dma_tag_t, bus_dmamap_t));
150 1.1 dbj int (*_dmamap_load) __P((bus_dma_tag_t, bus_dmamap_t, void *,
151 1.1 dbj bus_size_t, struct proc *, int));
152 1.1 dbj int (*_dmamap_load_mbuf) __P((bus_dma_tag_t, bus_dmamap_t,
153 1.1 dbj struct mbuf *, int));
154 1.1 dbj int (*_dmamap_load_uio) __P((bus_dma_tag_t, bus_dmamap_t,
155 1.1 dbj struct uio *, int));
156 1.1 dbj int (*_dmamap_load_raw) __P((bus_dma_tag_t, bus_dmamap_t,
157 1.1 dbj bus_dma_segment_t *, int, bus_size_t, int));
158 1.1 dbj void (*_dmamap_unload) __P((bus_dma_tag_t, bus_dmamap_t));
159 1.1 dbj void (*_dmamap_sync) __P((bus_dma_tag_t, bus_dmamap_t,
160 1.1 dbj bus_addr_t, bus_size_t, int));
161 1.1 dbj
162 1.1 dbj /*
163 1.1 dbj * DMA memory utility functions.
164 1.1 dbj */
165 1.1 dbj int (*_dmamem_alloc) __P((bus_dma_tag_t, bus_size_t, bus_size_t,
166 1.1 dbj bus_size_t, bus_dma_segment_t *, int, int *, int));
167 1.1 dbj void (*_dmamem_free) __P((bus_dma_tag_t,
168 1.1 dbj bus_dma_segment_t *, int));
169 1.1 dbj int (*_dmamem_map) __P((bus_dma_tag_t, bus_dma_segment_t *,
170 1.1 dbj int, size_t, caddr_t *, int));
171 1.1 dbj void (*_dmamem_unmap) __P((bus_dma_tag_t, caddr_t, size_t));
172 1.1 dbj int (*_dmamem_mmap) __P((bus_dma_tag_t, bus_dma_segment_t *,
173 1.1 dbj int, int, int, int));
174 1.1 dbj };
175 1.1 dbj
176 1.1 dbj #define genericbus_dma_get_tag(t, b) \
177 1.1 dbj (*(t)->_get_tag)(t, b)
178 1.1 dbj
179 1.1 dbj #define bus_dmamap_create(t, s, n, m, b, f, p) \
180 1.1 dbj (*(t)->_dmamap_create)((t), (s), (n), (m), (b), (f), (p))
181 1.1 dbj #define bus_dmamap_destroy(t, p) \
182 1.1 dbj (*(t)->_dmamap_destroy)((t), (p))
183 1.1 dbj #define bus_dmamap_load(t, m, b, s, p, f) \
184 1.1 dbj (*(t)->_dmamap_load)((t), (m), (b), (s), (p), (f))
185 1.1 dbj #define bus_dmamap_load_mbuf(t, m, b, f) \
186 1.1 dbj (*(t)->_dmamap_load_mbuf)((t), (m), (b), (f))
187 1.1 dbj #define bus_dmamap_load_uio(t, m, u, f) \
188 1.1 dbj (*(t)->_dmamap_load_uio)((t), (m), (u), (f))
189 1.1 dbj #define bus_dmamap_load_raw(t, m, sg, n, s, f) \
190 1.1 dbj (*(t)->_dmamap_load_raw)((t), (m), (sg), (n), (s), (f))
191 1.1 dbj #define bus_dmamap_unload(t, p) \
192 1.1 dbj (*(t)->_dmamap_unload)((t), (p))
193 1.1 dbj #define bus_dmamap_sync(t, p, o, l, ops) \
194 1.1 dbj (*(t)->_dmamap_sync)((t), (p), (o), (l), (ops))
195 1.1 dbj #define bus_dmamem_alloc(t, s, a, b, sg, n, r, f) \
196 1.1 dbj (*(t)->_dmamem_alloc)((t), (s), (a), (b), (sg), (n), (r), (f))
197 1.1 dbj #define bus_dmamem_free(t, sg, n) \
198 1.1 dbj (*(t)->_dmamem_free)((t), (sg), (n))
199 1.1 dbj #define bus_dmamem_map(t, sg, n, s, k, f) \
200 1.1 dbj (*(t)->_dmamem_map)((t), (sg), (n), (s), (k), (f))
201 1.1 dbj #define bus_dmamem_unmap(t, k, s) \
202 1.1 dbj (*(t)->_dmamem_unmap)((t), (k), (s))
203 1.1 dbj #define bus_dmamem_mmap(t, sg, n, o, p, f) \
204 1.1 dbj (*(t)->_dmamem_mmap)((t), (sg), (n), (o), (p), (f))
205 1.1 dbj
206 1.1 dbj /*
207 1.1 dbj * bus_dmamap_t
208 1.1 dbj *
209 1.1 dbj * Describes a DMA mapping.
210 1.1 dbj */
211 1.1 dbj struct generic_bus_dmamap {
212 1.1 dbj /*
213 1.1 dbj * PRIVATE MEMBERS: not for use my machine-independent code.
214 1.1 dbj */
215 1.1 dbj bus_size_t _dm_size; /* largest DMA transfer mappable */
216 1.1 dbj int _dm_segcnt; /* number of segs this map can map */
217 1.1 dbj bus_size_t _dm_maxsegsz; /* largest possible segment */
218 1.1 dbj bus_size_t _dm_boundary; /* don't cross this */
219 1.1 dbj int _dm_flags; /* misc. flags */
220 1.1 dbj
221 1.1 dbj #if 0 /* useful on alpha, but not here */
222 1.1 dbj
223 1.1 dbj /*
224 1.1 dbj * This is used only for SGMAP-mapped DMA, but we keep it
225 1.1 dbj * here to avoid pointless indirection.
226 1.1 dbj */
227 1.1 dbj int _dm_pteidx; /* PTE index */
228 1.1 dbj int _dm_ptecnt; /* PTE count */
229 1.1 dbj u_long _dm_sgva; /* allocated sgva */
230 1.1 dbj bus_size_t _dm_sgvalen; /* svga length */
231 1.1 dbj #endif
232 1.1 dbj
233 1.1 dbj /*
234 1.1 dbj * PUBLIC MEMBERS: these are used by machine-independent code.
235 1.1 dbj */
236 1.1 dbj bus_size_t dm_mapsize; /* size of the mapping */
237 1.1 dbj int dm_nsegs; /* # valid segments in mapping */
238 1.1 dbj bus_dma_segment_t dm_segs[1]; /* segments; variable length */
239 1.1 dbj };
240 1.1 dbj
241 1.1 dbj #ifdef _GENERIC_BUS_DMA_PRIVATE
242 1.1 dbj int _bus_dmamap_create __P((bus_dma_tag_t, bus_size_t, int, bus_size_t,
243 1.1 dbj bus_size_t, int, bus_dmamap_t *));
244 1.1 dbj void _bus_dmamap_destroy __P((bus_dma_tag_t, bus_dmamap_t));
245 1.1 dbj
246 1.1 dbj int _bus_dmamap_load_direct __P((bus_dma_tag_t, bus_dmamap_t,
247 1.1 dbj void *, bus_size_t, struct proc *, int));
248 1.1 dbj int _bus_dmamap_load_mbuf_direct __P((bus_dma_tag_t,
249 1.1 dbj bus_dmamap_t, struct mbuf *, int));
250 1.1 dbj int _bus_dmamap_load_uio_direct __P((bus_dma_tag_t,
251 1.1 dbj bus_dmamap_t, struct uio *, int));
252 1.1 dbj int _bus_dmamap_load_raw_direct __P((bus_dma_tag_t,
253 1.1 dbj bus_dmamap_t, bus_dma_segment_t *, int, bus_size_t,
254 1.1 dbj int));
255 1.1 dbj
256 1.1 dbj void _bus_dmamap_unload __P((bus_dma_tag_t, bus_dmamap_t));
257 1.1 dbj void _bus_dmamap_sync __P((bus_dma_tag_t, bus_dmamap_t, bus_addr_t,
258 1.1 dbj bus_size_t, int));
259 1.1 dbj
260 1.1 dbj int _bus_dmamem_alloc __P((bus_dma_tag_t tag, bus_size_t size,
261 1.1 dbj bus_size_t alignment, bus_size_t boundary,
262 1.1 dbj bus_dma_segment_t *segs, int nsegs, int *rsegs, int flags));
263 1.1 dbj void _bus_dmamem_free __P((bus_dma_tag_t tag, bus_dma_segment_t *segs,
264 1.1 dbj int nsegs));
265 1.1 dbj int _bus_dmamem_map __P((bus_dma_tag_t tag, bus_dma_segment_t *segs,
266 1.1 dbj int nsegs, size_t size, caddr_t *kvap, int flags));
267 1.1 dbj void _bus_dmamem_unmap __P((bus_dma_tag_t tag, caddr_t kva,
268 1.1 dbj size_t size));
269 1.1 dbj int _bus_dmamem_mmap __P((bus_dma_tag_t tag, bus_dma_segment_t *segs,
270 1.1 dbj int nsegs, int off, int prot, int flags));
271 1.1 dbj #endif /* _GENERIC_BUS_DMA_PRIVATE */
272 1.1 dbj
273 1.1 dbj #endif /* _BUS_DMA_H_ */
274