blob: ce010cd991d2b8c7773d237944480bcaf4b95a77 [file] [log] [blame]
Chris Leechc13c8262006-05-23 17:18:44 -07001/*
2 * Copyright(c) 2004 - 2006 Intel Corporation. All rights reserved.
3 *
4 * This program is free software; you can redistribute it and/or modify it
5 * under the terms of the GNU General Public License as published by the Free
6 * Software Foundation; either version 2 of the License, or (at your option)
7 * any later version.
8 *
9 * This program is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
12 * more details.
13 *
14 * You should have received a copy of the GNU General Public License along with
15 * this program; if not, write to the Free Software Foundation, Inc., 59
16 * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
17 *
18 * The full GNU General Public License is included in this distribution in the
19 * file called COPYING.
20 */
21#ifndef DMAENGINE_H
22#define DMAENGINE_H
David Woodhouse1c0f16e2006-06-27 02:53:56 -070023
Chris Leechc13c8262006-05-23 17:18:44 -070024#include <linux/device.h>
25#include <linux/uio.h>
Dan Williams7405f742007-01-02 11:10:43 -070026#include <linux/dma-mapping.h>
Chris Leechc13c8262006-05-23 17:18:44 -070027
28/**
Randy Dunlapfe4ada22006-07-03 19:44:51 -070029 * typedef dma_cookie_t - an opaque DMA cookie
Chris Leechc13c8262006-05-23 17:18:44 -070030 *
31 * if dma_cookie_t is >0 it's a DMA request cookie, <0 it's an error code
32 */
33typedef s32 dma_cookie_t;
34
35#define dma_submit_error(cookie) ((cookie) < 0 ? 1 : 0)
36
37/**
38 * enum dma_status - DMA transaction status
39 * @DMA_SUCCESS: transaction completed successfully
40 * @DMA_IN_PROGRESS: transaction not yet processed
41 * @DMA_ERROR: transaction failed
42 */
43enum dma_status {
44 DMA_SUCCESS,
45 DMA_IN_PROGRESS,
46 DMA_ERROR,
47};
48
49/**
Dan Williams7405f742007-01-02 11:10:43 -070050 * enum dma_transaction_type - DMA transaction types/indexes
51 */
52enum dma_transaction_type {
53 DMA_MEMCPY,
54 DMA_XOR,
Dan Williamsb2f46fd2009-07-14 12:20:36 -070055 DMA_PQ,
Dan Williams7405f742007-01-02 11:10:43 -070056 DMA_DUAL_XOR,
57 DMA_PQ_UPDATE,
Dan Williams099f53c2009-04-08 14:28:37 -070058 DMA_XOR_VAL,
59 DMA_PQ_VAL,
Dan Williams7405f742007-01-02 11:10:43 -070060 DMA_MEMSET,
61 DMA_MEMCPY_CRC32C,
62 DMA_INTERRUPT,
Dan Williams59b5ec22009-01-06 11:38:15 -070063 DMA_PRIVATE,
Haavard Skinnemoendc0ee6432008-07-08 11:59:35 -070064 DMA_SLAVE,
Dan Williams7405f742007-01-02 11:10:43 -070065};
66
67/* last transaction type for creation of the capabilities mask */
Haavard Skinnemoendc0ee6432008-07-08 11:59:35 -070068#define DMA_TX_TYPE_END (DMA_SLAVE + 1)
69
Dan Williams7405f742007-01-02 11:10:43 -070070
71/**
Dan Williams636bdea2008-04-17 20:17:26 -070072 * enum dma_ctrl_flags - DMA flags to augment operation preparation,
Dan Williamsb2f46fd2009-07-14 12:20:36 -070073 * control completion, and communicate status.
Dan Williamsd4c56f92008-02-02 19:49:58 -070074 * @DMA_PREP_INTERRUPT - trigger an interrupt (callback) upon completion of
Dan Williamsb2f46fd2009-07-14 12:20:36 -070075 * this transaction
Dan Williams636bdea2008-04-17 20:17:26 -070076 * @DMA_CTRL_ACK - the descriptor cannot be reused until the client
Dan Williamsb2f46fd2009-07-14 12:20:36 -070077 * acknowledges receipt, i.e. has has a chance to establish any dependency
78 * chains
Dan Williamse1d181e2008-07-04 00:13:40 -070079 * @DMA_COMPL_SKIP_SRC_UNMAP - set to disable dma-unmapping the source buffer(s)
80 * @DMA_COMPL_SKIP_DEST_UNMAP - set to disable dma-unmapping the destination(s)
Dan Williamsb2f46fd2009-07-14 12:20:36 -070081 * @DMA_PREP_PQ_DISABLE_P - prevent generation of P while generating Q
82 * @DMA_PREP_PQ_DISABLE_Q - prevent generation of Q while generating P
83 * @DMA_PREP_CONTINUE - indicate to a driver that it is reusing buffers as
84 * sources that were the result of a previous operation, in the case of a PQ
85 * operation it continues the calculation with new sources
Dan Williamsd4c56f92008-02-02 19:49:58 -070086 */
Dan Williams636bdea2008-04-17 20:17:26 -070087enum dma_ctrl_flags {
Dan Williamsd4c56f92008-02-02 19:49:58 -070088 DMA_PREP_INTERRUPT = (1 << 0),
Dan Williams636bdea2008-04-17 20:17:26 -070089 DMA_CTRL_ACK = (1 << 1),
Dan Williamse1d181e2008-07-04 00:13:40 -070090 DMA_COMPL_SKIP_SRC_UNMAP = (1 << 2),
91 DMA_COMPL_SKIP_DEST_UNMAP = (1 << 3),
Dan Williamsb2f46fd2009-07-14 12:20:36 -070092 DMA_PREP_PQ_DISABLE_P = (1 << 4),
93 DMA_PREP_PQ_DISABLE_Q = (1 << 5),
94 DMA_PREP_CONTINUE = (1 << 6),
Dan Williamsd4c56f92008-02-02 19:49:58 -070095};
96
97/**
Dan Williamsad283ea2009-08-29 19:09:26 -070098 * enum sum_check_bits - bit position of pq_check_flags
99 */
100enum sum_check_bits {
101 SUM_CHECK_P = 0,
102 SUM_CHECK_Q = 1,
103};
104
105/**
106 * enum pq_check_flags - result of async_{xor,pq}_zero_sum operations
107 * @SUM_CHECK_P_RESULT - 1 if xor zero sum error, 0 otherwise
108 * @SUM_CHECK_Q_RESULT - 1 if reed-solomon zero sum error, 0 otherwise
109 */
110enum sum_check_flags {
111 SUM_CHECK_P_RESULT = (1 << SUM_CHECK_P),
112 SUM_CHECK_Q_RESULT = (1 << SUM_CHECK_Q),
113};
114
115
116/**
Dan Williams7405f742007-01-02 11:10:43 -0700117 * dma_cap_mask_t - capabilities bitmap modeled after cpumask_t.
118 * See linux/cpumask.h
119 */
120typedef struct { DECLARE_BITMAP(bits, DMA_TX_TYPE_END); } dma_cap_mask_t;
121
122/**
Chris Leechc13c8262006-05-23 17:18:44 -0700123 * struct dma_chan_percpu - the per-CPU part of struct dma_chan
Chris Leechc13c8262006-05-23 17:18:44 -0700124 * @memcpy_count: transaction counter
125 * @bytes_transferred: byte counter
126 */
127
128struct dma_chan_percpu {
Chris Leechc13c8262006-05-23 17:18:44 -0700129 /* stats */
130 unsigned long memcpy_count;
131 unsigned long bytes_transferred;
132};
133
134/**
135 * struct dma_chan - devices supply DMA channels, clients use them
Randy Dunlapfe4ada22006-07-03 19:44:51 -0700136 * @device: ptr to the dma device who supplies this channel, always !%NULL
Chris Leechc13c8262006-05-23 17:18:44 -0700137 * @cookie: last cookie value returned to client
Randy Dunlapfe4ada22006-07-03 19:44:51 -0700138 * @chan_id: channel ID for sysfs
Dan Williams41d5e592009-01-06 11:38:21 -0700139 * @dev: class device for sysfs
Chris Leechc13c8262006-05-23 17:18:44 -0700140 * @device_node: used to add this to the device chan list
141 * @local: per-cpu pointer to a struct dma_chan_percpu
Dan Williams7cc5bf92008-07-08 11:58:21 -0700142 * @client-count: how many clients are using this channel
Dan Williamsbec08512009-01-06 11:38:14 -0700143 * @table_count: number of appearances in the mem-to-mem allocation table
Dan Williams287d8592009-02-18 14:48:26 -0800144 * @private: private data for certain client-channel associations
Chris Leechc13c8262006-05-23 17:18:44 -0700145 */
146struct dma_chan {
Chris Leechc13c8262006-05-23 17:18:44 -0700147 struct dma_device *device;
148 dma_cookie_t cookie;
149
150 /* sysfs */
151 int chan_id;
Dan Williams41d5e592009-01-06 11:38:21 -0700152 struct dma_chan_dev *dev;
Chris Leechc13c8262006-05-23 17:18:44 -0700153
Chris Leechc13c8262006-05-23 17:18:44 -0700154 struct list_head device_node;
155 struct dma_chan_percpu *local;
Dan Williams7cc5bf92008-07-08 11:58:21 -0700156 int client_count;
Dan Williamsbec08512009-01-06 11:38:14 -0700157 int table_count;
Dan Williams287d8592009-02-18 14:48:26 -0800158 void *private;
Chris Leechc13c8262006-05-23 17:18:44 -0700159};
160
Dan Williams41d5e592009-01-06 11:38:21 -0700161/**
162 * struct dma_chan_dev - relate sysfs device node to backing channel device
163 * @chan - driver channel device
164 * @device - sysfs device
Dan Williams864498a2009-01-06 11:38:21 -0700165 * @dev_id - parent dma_device dev_id
166 * @idr_ref - reference count to gate release of dma_device dev_id
Dan Williams41d5e592009-01-06 11:38:21 -0700167 */
168struct dma_chan_dev {
169 struct dma_chan *chan;
170 struct device device;
Dan Williams864498a2009-01-06 11:38:21 -0700171 int dev_id;
172 atomic_t *idr_ref;
Dan Williams41d5e592009-01-06 11:38:21 -0700173};
174
175static inline const char *dma_chan_name(struct dma_chan *chan)
176{
177 return dev_name(&chan->dev->device);
178}
Dan Williamsd379b012007-07-09 11:56:42 -0700179
Chris Leechc13c8262006-05-23 17:18:44 -0700180void dma_chan_cleanup(struct kref *kref);
181
Chris Leechc13c8262006-05-23 17:18:44 -0700182/**
Dan Williams59b5ec22009-01-06 11:38:15 -0700183 * typedef dma_filter_fn - callback filter for dma_request_channel
184 * @chan: channel to be reviewed
185 * @filter_param: opaque parameter passed through dma_request_channel
186 *
187 * When this optional parameter is specified in a call to dma_request_channel a
188 * suitable channel is passed to this routine for further dispositioning before
189 * being returned. Where 'suitable' indicates a non-busy channel that
Dan Williams7dd60252009-01-06 11:38:19 -0700190 * satisfies the given capability mask. It returns 'true' to indicate that the
191 * channel is suitable.
Dan Williams59b5ec22009-01-06 11:38:15 -0700192 */
Dan Williams7dd60252009-01-06 11:38:19 -0700193typedef bool (*dma_filter_fn)(struct dma_chan *chan, void *filter_param);
Dan Williams59b5ec22009-01-06 11:38:15 -0700194
Dan Williams7405f742007-01-02 11:10:43 -0700195typedef void (*dma_async_tx_callback)(void *dma_async_param);
196/**
197 * struct dma_async_tx_descriptor - async transaction descriptor
198 * ---dma generic offload fields---
199 * @cookie: tracking cookie for this transaction, set to -EBUSY if
200 * this tx is sitting on a dependency list
Dan Williams636bdea2008-04-17 20:17:26 -0700201 * @flags: flags to augment operation preparation, control completion, and
202 * communicate status
Dan Williams7405f742007-01-02 11:10:43 -0700203 * @phys: physical address of the descriptor
204 * @tx_list: driver common field for operations that require multiple
205 * descriptors
206 * @chan: target channel for this operation
207 * @tx_submit: set the prepared descriptor(s) to be executed by the engine
Dan Williams7405f742007-01-02 11:10:43 -0700208 * @callback: routine to call after this operation is complete
209 * @callback_param: general parameter to pass to the callback routine
210 * ---async_tx api specific fields---
Dan Williams19242d72008-04-17 20:17:25 -0700211 * @next: at completion submit this descriptor
Dan Williams7405f742007-01-02 11:10:43 -0700212 * @parent: pointer to the next level up in the dependency chain
Dan Williams19242d72008-04-17 20:17:25 -0700213 * @lock: protect the parent and next pointers
Dan Williams7405f742007-01-02 11:10:43 -0700214 */
215struct dma_async_tx_descriptor {
216 dma_cookie_t cookie;
Dan Williams636bdea2008-04-17 20:17:26 -0700217 enum dma_ctrl_flags flags; /* not a 'long' to pack with cookie */
Dan Williams7405f742007-01-02 11:10:43 -0700218 dma_addr_t phys;
219 struct list_head tx_list;
220 struct dma_chan *chan;
221 dma_cookie_t (*tx_submit)(struct dma_async_tx_descriptor *tx);
Dan Williams7405f742007-01-02 11:10:43 -0700222 dma_async_tx_callback callback;
223 void *callback_param;
Dan Williams19242d72008-04-17 20:17:25 -0700224 struct dma_async_tx_descriptor *next;
Dan Williams7405f742007-01-02 11:10:43 -0700225 struct dma_async_tx_descriptor *parent;
226 spinlock_t lock;
227};
228
Chris Leechc13c8262006-05-23 17:18:44 -0700229/**
230 * struct dma_device - info on the entity supplying DMA services
231 * @chancnt: how many DMA channels are supported
Atsushi Nemoto0f571512009-03-06 20:07:14 +0900232 * @privatecnt: how many DMA channels are requested by dma_request_channel
Chris Leechc13c8262006-05-23 17:18:44 -0700233 * @channels: the list of struct dma_chan
234 * @global_node: list_head for global dma_device_list
Dan Williams7405f742007-01-02 11:10:43 -0700235 * @cap_mask: one or more dma_capability flags
236 * @max_xor: maximum number of xor sources, 0 if no capability
Dan Williamsb2f46fd2009-07-14 12:20:36 -0700237 * @max_pq: maximum number of PQ sources and PQ-continue capability
Randy Dunlapfe4ada22006-07-03 19:44:51 -0700238 * @dev_id: unique device ID
Dan Williams7405f742007-01-02 11:10:43 -0700239 * @dev: struct device reference for dma mapping api
Randy Dunlapfe4ada22006-07-03 19:44:51 -0700240 * @device_alloc_chan_resources: allocate resources and return the
241 * number of allocated descriptors
242 * @device_free_chan_resources: release DMA channel's resources
Dan Williams7405f742007-01-02 11:10:43 -0700243 * @device_prep_dma_memcpy: prepares a memcpy operation
244 * @device_prep_dma_xor: prepares a xor operation
Dan Williams099f53c2009-04-08 14:28:37 -0700245 * @device_prep_dma_xor_val: prepares a xor validation operation
Dan Williamsb2f46fd2009-07-14 12:20:36 -0700246 * @device_prep_dma_pq: prepares a pq operation
247 * @device_prep_dma_pq_val: prepares a pqzero_sum operation
Dan Williams7405f742007-01-02 11:10:43 -0700248 * @device_prep_dma_memset: prepares a memset operation
249 * @device_prep_dma_interrupt: prepares an end of chain interrupt operation
Haavard Skinnemoendc0ee6432008-07-08 11:59:35 -0700250 * @device_prep_slave_sg: prepares a slave dma operation
251 * @device_terminate_all: terminate all pending operations
Johannes Weiner1d93e522009-02-11 08:47:19 -0700252 * @device_is_tx_complete: poll for transaction completion
Dan Williams7405f742007-01-02 11:10:43 -0700253 * @device_issue_pending: push pending transactions to hardware
Chris Leechc13c8262006-05-23 17:18:44 -0700254 */
255struct dma_device {
256
257 unsigned int chancnt;
Atsushi Nemoto0f571512009-03-06 20:07:14 +0900258 unsigned int privatecnt;
Chris Leechc13c8262006-05-23 17:18:44 -0700259 struct list_head channels;
260 struct list_head global_node;
Dan Williams7405f742007-01-02 11:10:43 -0700261 dma_cap_mask_t cap_mask;
Dan Williamsb2f46fd2009-07-14 12:20:36 -0700262 unsigned short max_xor;
263 unsigned short max_pq;
264 #define DMA_HAS_PQ_CONTINUE (1 << 15)
Chris Leechc13c8262006-05-23 17:18:44 -0700265
Chris Leechc13c8262006-05-23 17:18:44 -0700266 int dev_id;
Dan Williams7405f742007-01-02 11:10:43 -0700267 struct device *dev;
Chris Leechc13c8262006-05-23 17:18:44 -0700268
Dan Williamsaa1e6f12009-01-06 11:38:17 -0700269 int (*device_alloc_chan_resources)(struct dma_chan *chan);
Chris Leechc13c8262006-05-23 17:18:44 -0700270 void (*device_free_chan_resources)(struct dma_chan *chan);
Dan Williams7405f742007-01-02 11:10:43 -0700271
272 struct dma_async_tx_descriptor *(*device_prep_dma_memcpy)(
Dan Williams00367312008-02-02 19:49:57 -0700273 struct dma_chan *chan, dma_addr_t dest, dma_addr_t src,
Dan Williamsd4c56f92008-02-02 19:49:58 -0700274 size_t len, unsigned long flags);
Dan Williams7405f742007-01-02 11:10:43 -0700275 struct dma_async_tx_descriptor *(*device_prep_dma_xor)(
Dan Williams00367312008-02-02 19:49:57 -0700276 struct dma_chan *chan, dma_addr_t dest, dma_addr_t *src,
Dan Williamsd4c56f92008-02-02 19:49:58 -0700277 unsigned int src_cnt, size_t len, unsigned long flags);
Dan Williams099f53c2009-04-08 14:28:37 -0700278 struct dma_async_tx_descriptor *(*device_prep_dma_xor_val)(
Dan Williams00367312008-02-02 19:49:57 -0700279 struct dma_chan *chan, dma_addr_t *src, unsigned int src_cnt,
Dan Williamsad283ea2009-08-29 19:09:26 -0700280 size_t len, enum sum_check_flags *result, unsigned long flags);
Dan Williamsb2f46fd2009-07-14 12:20:36 -0700281 struct dma_async_tx_descriptor *(*device_prep_dma_pq)(
282 struct dma_chan *chan, dma_addr_t *dst, dma_addr_t *src,
283 unsigned int src_cnt, const unsigned char *scf,
284 size_t len, unsigned long flags);
285 struct dma_async_tx_descriptor *(*device_prep_dma_pq_val)(
286 struct dma_chan *chan, dma_addr_t *pq, dma_addr_t *src,
287 unsigned int src_cnt, const unsigned char *scf, size_t len,
288 enum sum_check_flags *pqres, unsigned long flags);
Dan Williams7405f742007-01-02 11:10:43 -0700289 struct dma_async_tx_descriptor *(*device_prep_dma_memset)(
Dan Williams00367312008-02-02 19:49:57 -0700290 struct dma_chan *chan, dma_addr_t dest, int value, size_t len,
Dan Williamsd4c56f92008-02-02 19:49:58 -0700291 unsigned long flags);
Dan Williams7405f742007-01-02 11:10:43 -0700292 struct dma_async_tx_descriptor *(*device_prep_dma_interrupt)(
Dan Williams636bdea2008-04-17 20:17:26 -0700293 struct dma_chan *chan, unsigned long flags);
Dan Williams7405f742007-01-02 11:10:43 -0700294
Haavard Skinnemoendc0ee6432008-07-08 11:59:35 -0700295 struct dma_async_tx_descriptor *(*device_prep_slave_sg)(
296 struct dma_chan *chan, struct scatterlist *sgl,
297 unsigned int sg_len, enum dma_data_direction direction,
298 unsigned long flags);
299 void (*device_terminate_all)(struct dma_chan *chan);
300
Dan Williams7405f742007-01-02 11:10:43 -0700301 enum dma_status (*device_is_tx_complete)(struct dma_chan *chan,
Chris Leechc13c8262006-05-23 17:18:44 -0700302 dma_cookie_t cookie, dma_cookie_t *last,
303 dma_cookie_t *used);
Dan Williams7405f742007-01-02 11:10:43 -0700304 void (*device_issue_pending)(struct dma_chan *chan);
Chris Leechc13c8262006-05-23 17:18:44 -0700305};
306
Dan Williamsb2f46fd2009-07-14 12:20:36 -0700307static inline void
308dma_set_maxpq(struct dma_device *dma, int maxpq, int has_pq_continue)
309{
310 dma->max_pq = maxpq;
311 if (has_pq_continue)
312 dma->max_pq |= DMA_HAS_PQ_CONTINUE;
313}
314
315static inline bool dmaf_continue(enum dma_ctrl_flags flags)
316{
317 return (flags & DMA_PREP_CONTINUE) == DMA_PREP_CONTINUE;
318}
319
320static inline bool dmaf_p_disabled_continue(enum dma_ctrl_flags flags)
321{
322 enum dma_ctrl_flags mask = DMA_PREP_CONTINUE | DMA_PREP_PQ_DISABLE_P;
323
324 return (flags & mask) == mask;
325}
326
327static inline bool dma_dev_has_pq_continue(struct dma_device *dma)
328{
329 return (dma->max_pq & DMA_HAS_PQ_CONTINUE) == DMA_HAS_PQ_CONTINUE;
330}
331
332static unsigned short dma_dev_to_maxpq(struct dma_device *dma)
333{
334 return dma->max_pq & ~DMA_HAS_PQ_CONTINUE;
335}
336
337/* dma_maxpq - reduce maxpq in the face of continued operations
338 * @dma - dma device with PQ capability
339 * @flags - to check if DMA_PREP_CONTINUE and DMA_PREP_PQ_DISABLE_P are set
340 *
341 * When an engine does not support native continuation we need 3 extra
342 * source slots to reuse P and Q with the following coefficients:
343 * 1/ {00} * P : remove P from Q', but use it as a source for P'
344 * 2/ {01} * Q : use Q to continue Q' calculation
345 * 3/ {00} * Q : subtract Q from P' to cancel (2)
346 *
347 * In the case where P is disabled we only need 1 extra source:
348 * 1/ {01} * Q : use Q to continue Q' calculation
349 */
350static inline int dma_maxpq(struct dma_device *dma, enum dma_ctrl_flags flags)
351{
352 if (dma_dev_has_pq_continue(dma) || !dmaf_continue(flags))
353 return dma_dev_to_maxpq(dma);
354 else if (dmaf_p_disabled_continue(flags))
355 return dma_dev_to_maxpq(dma) - 1;
356 else if (dmaf_continue(flags))
357 return dma_dev_to_maxpq(dma) - 3;
358 BUG();
359}
360
Chris Leechc13c8262006-05-23 17:18:44 -0700361/* --- public DMA engine API --- */
362
Dan Williams649274d2009-01-11 00:20:39 -0800363#ifdef CONFIG_DMA_ENGINE
Dan Williams209b84a2009-01-06 11:38:17 -0700364void dmaengine_get(void);
365void dmaengine_put(void);
Dan Williams649274d2009-01-11 00:20:39 -0800366#else
367static inline void dmaengine_get(void)
368{
369}
370static inline void dmaengine_put(void)
371{
372}
373#endif
374
David S. Millerb4bd07c2009-02-06 22:06:43 -0800375#ifdef CONFIG_NET_DMA
376#define net_dmaengine_get() dmaengine_get()
377#define net_dmaengine_put() dmaengine_put()
378#else
379static inline void net_dmaengine_get(void)
380{
381}
382static inline void net_dmaengine_put(void)
383{
384}
385#endif
386
Dan Williams729b5d12009-03-25 09:13:25 -0700387#ifdef CONFIG_ASYNC_TX_DMA
388#define async_dmaengine_get() dmaengine_get()
389#define async_dmaengine_put() dmaengine_put()
390#define async_dma_find_channel(type) dma_find_channel(type)
391#else
392static inline void async_dmaengine_get(void)
393{
394}
395static inline void async_dmaengine_put(void)
396{
397}
398static inline struct dma_chan *
399async_dma_find_channel(enum dma_transaction_type type)
400{
401 return NULL;
402}
403#endif
404
Dan Williams7405f742007-01-02 11:10:43 -0700405dma_cookie_t dma_async_memcpy_buf_to_buf(struct dma_chan *chan,
406 void *dest, void *src, size_t len);
407dma_cookie_t dma_async_memcpy_buf_to_pg(struct dma_chan *chan,
408 struct page *page, unsigned int offset, void *kdata, size_t len);
409dma_cookie_t dma_async_memcpy_pg_to_pg(struct dma_chan *chan,
Chris Leechc13c8262006-05-23 17:18:44 -0700410 struct page *dest_pg, unsigned int dest_off, struct page *src_pg,
Dan Williams7405f742007-01-02 11:10:43 -0700411 unsigned int src_off, size_t len);
412void dma_async_tx_descriptor_init(struct dma_async_tx_descriptor *tx,
413 struct dma_chan *chan);
Chris Leechc13c8262006-05-23 17:18:44 -0700414
Dan Williams08398752008-07-17 17:59:56 -0700415static inline void async_tx_ack(struct dma_async_tx_descriptor *tx)
Dan Williams7405f742007-01-02 11:10:43 -0700416{
Dan Williams636bdea2008-04-17 20:17:26 -0700417 tx->flags |= DMA_CTRL_ACK;
418}
419
Guennadi Liakhovetskief560682009-01-19 15:36:21 -0700420static inline void async_tx_clear_ack(struct dma_async_tx_descriptor *tx)
421{
422 tx->flags &= ~DMA_CTRL_ACK;
423}
424
Dan Williams08398752008-07-17 17:59:56 -0700425static inline bool async_tx_test_ack(struct dma_async_tx_descriptor *tx)
Dan Williams636bdea2008-04-17 20:17:26 -0700426{
Dan Williams08398752008-07-17 17:59:56 -0700427 return (tx->flags & DMA_CTRL_ACK) == DMA_CTRL_ACK;
Chris Leechc13c8262006-05-23 17:18:44 -0700428}
429
Dan Williams7405f742007-01-02 11:10:43 -0700430#define first_dma_cap(mask) __first_dma_cap(&(mask))
431static inline int __first_dma_cap(const dma_cap_mask_t *srcp)
432{
433 return min_t(int, DMA_TX_TYPE_END,
434 find_first_bit(srcp->bits, DMA_TX_TYPE_END));
435}
436
437#define next_dma_cap(n, mask) __next_dma_cap((n), &(mask))
438static inline int __next_dma_cap(int n, const dma_cap_mask_t *srcp)
439{
440 return min_t(int, DMA_TX_TYPE_END,
441 find_next_bit(srcp->bits, DMA_TX_TYPE_END, n+1));
442}
443
444#define dma_cap_set(tx, mask) __dma_cap_set((tx), &(mask))
445static inline void
446__dma_cap_set(enum dma_transaction_type tx_type, dma_cap_mask_t *dstp)
447{
448 set_bit(tx_type, dstp->bits);
449}
450
Atsushi Nemoto0f571512009-03-06 20:07:14 +0900451#define dma_cap_clear(tx, mask) __dma_cap_clear((tx), &(mask))
452static inline void
453__dma_cap_clear(enum dma_transaction_type tx_type, dma_cap_mask_t *dstp)
454{
455 clear_bit(tx_type, dstp->bits);
456}
457
Dan Williams33df8ca2009-01-06 11:38:15 -0700458#define dma_cap_zero(mask) __dma_cap_zero(&(mask))
459static inline void __dma_cap_zero(dma_cap_mask_t *dstp)
460{
461 bitmap_zero(dstp->bits, DMA_TX_TYPE_END);
462}
463
Dan Williams7405f742007-01-02 11:10:43 -0700464#define dma_has_cap(tx, mask) __dma_has_cap((tx), &(mask))
465static inline int
466__dma_has_cap(enum dma_transaction_type tx_type, dma_cap_mask_t *srcp)
467{
468 return test_bit(tx_type, srcp->bits);
469}
470
471#define for_each_dma_cap_mask(cap, mask) \
472 for ((cap) = first_dma_cap(mask); \
473 (cap) < DMA_TX_TYPE_END; \
474 (cap) = next_dma_cap((cap), (mask)))
475
Chris Leechc13c8262006-05-23 17:18:44 -0700476/**
Dan Williams7405f742007-01-02 11:10:43 -0700477 * dma_async_issue_pending - flush pending transactions to HW
Randy Dunlapfe4ada22006-07-03 19:44:51 -0700478 * @chan: target DMA channel
Chris Leechc13c8262006-05-23 17:18:44 -0700479 *
480 * This allows drivers to push copies to HW in batches,
481 * reducing MMIO writes where possible.
482 */
Dan Williams7405f742007-01-02 11:10:43 -0700483static inline void dma_async_issue_pending(struct dma_chan *chan)
Chris Leechc13c8262006-05-23 17:18:44 -0700484{
Dan Williamsec8670f2008-03-01 07:51:29 -0700485 chan->device->device_issue_pending(chan);
Chris Leechc13c8262006-05-23 17:18:44 -0700486}
487
Dan Williams7405f742007-01-02 11:10:43 -0700488#define dma_async_memcpy_issue_pending(chan) dma_async_issue_pending(chan)
489
Chris Leechc13c8262006-05-23 17:18:44 -0700490/**
Dan Williams7405f742007-01-02 11:10:43 -0700491 * dma_async_is_tx_complete - poll for transaction completion
Chris Leechc13c8262006-05-23 17:18:44 -0700492 * @chan: DMA channel
493 * @cookie: transaction identifier to check status of
494 * @last: returns last completed cookie, can be NULL
495 * @used: returns last issued cookie, can be NULL
496 *
497 * If @last and @used are passed in, upon return they reflect the driver
498 * internal state and can be used with dma_async_is_complete() to check
499 * the status of multiple cookies without re-checking hardware state.
500 */
Dan Williams7405f742007-01-02 11:10:43 -0700501static inline enum dma_status dma_async_is_tx_complete(struct dma_chan *chan,
Chris Leechc13c8262006-05-23 17:18:44 -0700502 dma_cookie_t cookie, dma_cookie_t *last, dma_cookie_t *used)
503{
Dan Williams7405f742007-01-02 11:10:43 -0700504 return chan->device->device_is_tx_complete(chan, cookie, last, used);
Chris Leechc13c8262006-05-23 17:18:44 -0700505}
506
Dan Williams7405f742007-01-02 11:10:43 -0700507#define dma_async_memcpy_complete(chan, cookie, last, used)\
508 dma_async_is_tx_complete(chan, cookie, last, used)
509
Chris Leechc13c8262006-05-23 17:18:44 -0700510/**
511 * dma_async_is_complete - test a cookie against chan state
512 * @cookie: transaction identifier to test status of
513 * @last_complete: last know completed transaction
514 * @last_used: last cookie value handed out
515 *
516 * dma_async_is_complete() is used in dma_async_memcpy_complete()
Sebastian Siewior8a5703f2008-04-21 22:38:45 +0000517 * the test logic is separated for lightweight testing of multiple cookies
Chris Leechc13c8262006-05-23 17:18:44 -0700518 */
519static inline enum dma_status dma_async_is_complete(dma_cookie_t cookie,
520 dma_cookie_t last_complete, dma_cookie_t last_used)
521{
522 if (last_complete <= last_used) {
523 if ((cookie <= last_complete) || (cookie > last_used))
524 return DMA_SUCCESS;
525 } else {
526 if ((cookie <= last_complete) && (cookie > last_used))
527 return DMA_SUCCESS;
528 }
529 return DMA_IN_PROGRESS;
530}
531
Dan Williams7405f742007-01-02 11:10:43 -0700532enum dma_status dma_sync_wait(struct dma_chan *chan, dma_cookie_t cookie);
Dan Williams07f22112009-01-05 17:14:31 -0700533#ifdef CONFIG_DMA_ENGINE
534enum dma_status dma_wait_for_async_tx(struct dma_async_tx_descriptor *tx);
Dan Williamsc50331e2009-01-19 15:33:14 -0700535void dma_issue_pending_all(void);
Dan Williams07f22112009-01-05 17:14:31 -0700536#else
537static inline enum dma_status dma_wait_for_async_tx(struct dma_async_tx_descriptor *tx)
538{
539 return DMA_SUCCESS;
540}
Dan Williamsc50331e2009-01-19 15:33:14 -0700541static inline void dma_issue_pending_all(void)
542{
543 do { } while (0);
544}
Dan Williams07f22112009-01-05 17:14:31 -0700545#endif
Chris Leechc13c8262006-05-23 17:18:44 -0700546
547/* --- DMA device --- */
548
549int dma_async_device_register(struct dma_device *device);
550void dma_async_device_unregister(struct dma_device *device);
Dan Williams07f22112009-01-05 17:14:31 -0700551void dma_run_dependencies(struct dma_async_tx_descriptor *tx);
Dan Williamsbec08512009-01-06 11:38:14 -0700552struct dma_chan *dma_find_channel(enum dma_transaction_type tx_type);
Dan Williams59b5ec22009-01-06 11:38:15 -0700553#define dma_request_channel(mask, x, y) __dma_request_channel(&(mask), x, y)
554struct dma_chan *__dma_request_channel(dma_cap_mask_t *mask, dma_filter_fn fn, void *fn_param);
555void dma_release_channel(struct dma_chan *chan);
Chris Leechc13c8262006-05-23 17:18:44 -0700556
Chris Leechde5506e2006-05-23 17:50:37 -0700557/* --- Helper iov-locking functions --- */
558
559struct dma_page_list {
Al Virob2ddb902008-03-29 03:09:38 +0000560 char __user *base_address;
Chris Leechde5506e2006-05-23 17:50:37 -0700561 int nr_pages;
562 struct page **pages;
563};
564
565struct dma_pinned_list {
566 int nr_iovecs;
567 struct dma_page_list page_list[0];
568};
569
570struct dma_pinned_list *dma_pin_iovec_pages(struct iovec *iov, size_t len);
571void dma_unpin_iovec_pages(struct dma_pinned_list* pinned_list);
572
573dma_cookie_t dma_memcpy_to_iovec(struct dma_chan *chan, struct iovec *iov,
574 struct dma_pinned_list *pinned_list, unsigned char *kdata, size_t len);
575dma_cookie_t dma_memcpy_pg_to_iovec(struct dma_chan *chan, struct iovec *iov,
576 struct dma_pinned_list *pinned_list, struct page *page,
577 unsigned int offset, size_t len);
578
Chris Leechc13c8262006-05-23 17:18:44 -0700579#endif /* DMAENGINE_H */