xref: /freebsd/sys/i386/include/bus_dma.h (revision e0c27215058b5786c78fcfb3963eebe61a989511)
1 /*	$NetBSD: bus.h,v 1.12 1997/10/01 08:25:15 fvdl Exp $	*/
2 
3 /*-
4  * Copyright (c) 1996, 1997 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) 1996 Charles M. Hannum.  All rights reserved.
42  * Copyright (c) 1996 Christopher G. Demetriou.  All rights reserved.
43  *
44  * Redistribution and use in source and binary forms, with or without
45  * modification, are permitted provided that the following conditions
46  * are met:
47  * 1. Redistributions of source code must retain the above copyright
48  *    notice, this list of conditions and the following disclaimer.
49  * 2. Redistributions in binary form must reproduce the above copyright
50  *    notice, this list of conditions and the following disclaimer in the
51  *    documentation and/or other materials provided with the distribution.
52  * 3. All advertising materials mentioning features or use of this software
53  *    must display the following acknowledgement:
54  *      This product includes software developed by Christopher G. Demetriou
55  *	for the NetBSD Project.
56  * 4. The name of the author may not be used to endorse or promote products
57  *    derived from this software without specific prior written permission
58  *
59  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
60  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
61  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
62  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
63  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
64  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
65  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
66  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
67  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
68  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
69  */
70 /* $FreeBSD$ */
71 
72 #ifndef _I386_BUS_DMA_H_
73 #define _I386_BUS_DMA_H_
74 
75 /*
76  * Flags used in various bus DMA methods.
77  */
78 #define	BUS_DMA_WAITOK		0x00	/* safe to sleep (pseudo-flag) */
79 #define	BUS_DMA_NOWAIT		0x01	/* not safe to sleep */
80 #define	BUS_DMA_ALLOCNOW	0x02	/* perform resource allocation now */
81 #define	BUS_DMA_COHERENT	0x04	/* hint: map memory in a coherent way */
82 #define	BUS_DMA_BUS1		0x10	/* placeholders for bus functions... */
83 #define	BUS_DMA_BUS2		0x20
84 #define	BUS_DMA_BUS3		0x40
85 #define	BUS_DMA_BUS4		0x80
86 
87 /* Forwards needed by prototypes below. */
88 struct mbuf;
89 struct uio;
90 
91 /*
92  * Operations performed by bus_dmamap_sync().
93  */
94 typedef int bus_dmasync_op_t;
95 #define	BUS_DMASYNC_PREREAD	1
96 #define	BUS_DMASYNC_POSTREAD	2
97 #define	BUS_DMASYNC_PREWRITE	4
98 #define	BUS_DMASYNC_POSTWRITE	8
99 
100 /*
101  *	bus_dma_tag_t
102  *
103  *	A machine-dependent opaque type describing the characteristics
104  *	of how to perform DMA mappings.  This structure encapsultes
105  *	information concerning address and alignment restrictions, number
106  *	of S/G	segments, amount of data per S/G segment, etc.
107  */
108 typedef struct bus_dma_tag	*bus_dma_tag_t;
109 
110 /*
111  *	bus_dmamap_t
112  *
113  *	DMA mapping instance information.
114  */
115 typedef struct bus_dmamap	*bus_dmamap_t;
116 
117 /*
118  *	bus_dma_segment_t
119  *
120  *	Describes a single contiguous DMA transaction.  Values
121  *	are suitable for programming into DMA registers.
122  */
123 typedef struct bus_dma_segment {
124 	bus_addr_t	ds_addr;	/* DMA address */
125 	bus_size_t	ds_len;		/* length of transfer */
126 } bus_dma_segment_t;
127 
128 /*
129  * A function that returns 1 if the address cannot be accessed by
130  * a device and 0 if it can be.
131  */
132 typedef int bus_dma_filter_t(void *, bus_addr_t);
133 
134 /*
135  * A function that performs driver-specific syncronization on behalf of
136  * busdma.
137  */
138 typedef enum {
139 	BUS_DMA_LOCK	= 0x01,
140 	BUS_DMA_UNLOCK	= 0x02,
141 } bus_dma_lock_op_t;
142 
143 typedef void bus_dma_lock_t(void *, bus_dma_lock_op_t);
144 
145 /*
146  * Allocate a device specific dma_tag encapsulating the constraints of
147  * the parent tag in addition to other restrictions specified:
148  *
149  *	alignment:	alignment for segments.
150  *	boundary:	Boundary that segments cannot cross.
151  *	lowaddr:	Low restricted address that cannot appear in a mapping.
152  *	highaddr:	High restricted address that cannot appear in a mapping.
153  *	filtfunc:	An optional function to further test if an address
154  *			within the range of lowaddr and highaddr cannot appear
155  *			in a mapping.
156  *	filtfuncarg:	An argument that will be passed to filtfunc in addition
157  *			to the address to test.
158  *	maxsize:	Maximum mapping size supported by this tag.
159  *	nsegments:	Number of discontinuities allowed in maps.
160  *	maxsegsz:	Maximum size of a segment in the map.
161  *	flags:		Bus DMA flags.
162  *	dmat:		A pointer to set to a valid dma tag should the return
163  *			value of this function indicate success.
164  */
165 /* XXX Should probably allow specification of alignment */
166 int bus_dma_tag_create(bus_dma_tag_t parent, bus_size_t alignment,
167 		       bus_size_t boundary, bus_addr_t lowaddr,
168 		       bus_addr_t highaddr, bus_dma_filter_t *filtfunc,
169 		       void *filtfuncarg, bus_size_t maxsize, int nsegments,
170 		       bus_size_t maxsegsz, int flags, bus_dma_lock_t *lockfunc,
171 		       void *lockfuncarg, bus_dma_tag_t *dmat);
172 
173 int bus_dma_tag_destroy(bus_dma_tag_t dmat);
174 
175 /*
176  * Allocate a handle for mapping from kva/uva/physical
177  * address space into bus device space.
178  */
179 int bus_dmamap_create(bus_dma_tag_t dmat, int flags, bus_dmamap_t *mapp);
180 
181 /*
182  * Destroy  a handle for mapping from kva/uva/physical
183  * address space into bus device space.
184  */
185 int bus_dmamap_destroy(bus_dma_tag_t dmat, bus_dmamap_t map);
186 
187 /*
188  * Allocate a piece of memory that can be efficiently mapped into
189  * bus device space based on the constraints lited in the dma tag.
190  * A dmamap to for use with dmamap_load is also allocated.
191  */
192 int bus_dmamem_alloc(bus_dma_tag_t dmat, void** vaddr, int flags,
193 		     bus_dmamap_t *mapp);
194 
195 /*
196  * Free a piece of memory and it's allociated dmamap, that was allocated
197  * via bus_dmamem_alloc.
198  */
199 void bus_dmamem_free(bus_dma_tag_t dmat, void *vaddr, bus_dmamap_t map);
200 
201 /*
202  * A function that processes a successfully loaded dma map or an error
203  * from a delayed load map.
204  */
205 typedef void bus_dmamap_callback_t(void *, bus_dma_segment_t *, int, int);
206 
207 /*
208  * Map the buffer buf into bus space using the dmamap map.
209  */
210 int bus_dmamap_load(bus_dma_tag_t dmat, bus_dmamap_t map, void *buf,
211 		    bus_size_t buflen, bus_dmamap_callback_t *callback,
212 		    void *callback_arg, int flags);
213 
214 /*
215  * Like bus_dmamap_callback but includes map size in bytes.  This is
216  * defined as a separate interface to maintain compatiiblity for users
217  * of bus_dmamap_callback_t--at some point these interfaces should be merged.
218  */
219 typedef void bus_dmamap_callback2_t(void *, bus_dma_segment_t *, int, bus_size_t, int);
220 /*
221  * Like bus_dmamap_load but for mbufs.  Note the use of the
222  * bus_dmamap_callback2_t interface.
223  */
224 int bus_dmamap_load_mbuf(bus_dma_tag_t dmat, bus_dmamap_t map,
225 			 struct mbuf *mbuf,
226 			 bus_dmamap_callback2_t *callback, void *callback_arg,
227 			 int flags);
228 /*
229  * Like bus_dmamap_load but for uios.  Note the use of the
230  * bus_dmamap_callback2_t interface.
231  */
232 int bus_dmamap_load_uio(bus_dma_tag_t dmat, bus_dmamap_t map,
233 			struct uio *ui,
234 			bus_dmamap_callback2_t *callback, void *callback_arg,
235 			int flags);
236 
237 /*
238  * Perform a syncronization operation on the given map.
239  */
240 void _bus_dmamap_sync(bus_dma_tag_t, bus_dmamap_t, bus_dmasync_op_t);
241 #define bus_dmamap_sync(dmat, dmamap, op) 		\
242 	if ((dmamap) != NULL)				\
243 		_bus_dmamap_sync(dmat, dmamap, op)
244 
245 /*
246  * Release the mapping held by map.
247  */
248 void _bus_dmamap_unload(bus_dma_tag_t dmat, bus_dmamap_t map);
249 #define bus_dmamap_unload(dmat, dmamap) 		\
250 	if ((dmamap) != NULL)				\
251 		_bus_dmamap_unload(dmat, dmamap)
252 
253 /*
254  * Generic helper function for manipulating mutexes.
255  */
256 void busdma_lock_mutex(void *arg, bus_dma_lock_op_t op);
257 #endif /* _I386_BUS_DMA_H_ */
258