blob: 0731802f876f77ac88521fdf0ff3b48343b8fe15 [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;
Steven J. Magnani76bd0612010-02-28 22:18:16 -070034#define DMA_MIN_COOKIE 1
35#define DMA_MAX_COOKIE INT_MAX
Chris Leechc13c8262006-05-23 17:18:44 -070036
37#define dma_submit_error(cookie) ((cookie) < 0 ? 1 : 0)
38
39/**
40 * enum dma_status - DMA transaction status
41 * @DMA_SUCCESS: transaction completed successfully
42 * @DMA_IN_PROGRESS: transaction not yet processed
43 * @DMA_ERROR: transaction failed
44 */
45enum dma_status {
46 DMA_SUCCESS,
47 DMA_IN_PROGRESS,
48 DMA_ERROR,
49};
50
51/**
Dan Williams7405f742007-01-02 11:10:43 -070052 * enum dma_transaction_type - DMA transaction types/indexes
Dan Williams138f4c32009-09-08 17:42:51 -070053 *
54 * Note: The DMA_ASYNC_TX capability is not to be set by drivers. It is
55 * automatically set as dma devices are registered.
Dan Williams7405f742007-01-02 11:10:43 -070056 */
57enum dma_transaction_type {
58 DMA_MEMCPY,
59 DMA_XOR,
Dan Williamsb2f46fd2009-07-14 12:20:36 -070060 DMA_PQ,
Dan Williams099f53c2009-04-08 14:28:37 -070061 DMA_XOR_VAL,
62 DMA_PQ_VAL,
Dan Williams7405f742007-01-02 11:10:43 -070063 DMA_MEMSET,
Dan Williams7405f742007-01-02 11:10:43 -070064 DMA_INTERRUPT,
Dan Williams59b5ec22009-01-06 11:38:15 -070065 DMA_PRIVATE,
Dan Williams138f4c32009-09-08 17:42:51 -070066 DMA_ASYNC_TX,
Haavard Skinnemoendc0ee6432008-07-08 11:59:35 -070067 DMA_SLAVE,
Dan Williams7405f742007-01-02 11:10:43 -070068};
69
70/* last transaction type for creation of the capabilities mask */
Haavard Skinnemoendc0ee6432008-07-08 11:59:35 -070071#define DMA_TX_TYPE_END (DMA_SLAVE + 1)
72
Dan Williams7405f742007-01-02 11:10:43 -070073
74/**
Dan Williams636bdea2008-04-17 20:17:26 -070075 * enum dma_ctrl_flags - DMA flags to augment operation preparation,
Dan Williamsb2f46fd2009-07-14 12:20:36 -070076 * control completion, and communicate status.
Dan Williamsd4c56f92008-02-02 19:49:58 -070077 * @DMA_PREP_INTERRUPT - trigger an interrupt (callback) upon completion of
Dan Williamsb2f46fd2009-07-14 12:20:36 -070078 * this transaction
Guennadi Liakhovetskia88f6662009-12-10 18:35:15 +010079 * @DMA_CTRL_ACK - if clear, the descriptor cannot be reused until the client
Dan Williamsb2f46fd2009-07-14 12:20:36 -070080 * acknowledges receipt, i.e. has has a chance to establish any dependency
81 * chains
Dan Williamse1d181e2008-07-04 00:13:40 -070082 * @DMA_COMPL_SKIP_SRC_UNMAP - set to disable dma-unmapping the source buffer(s)
83 * @DMA_COMPL_SKIP_DEST_UNMAP - set to disable dma-unmapping the destination(s)
Maciej Sosnowski4f005db2009-04-23 12:31:51 +020084 * @DMA_COMPL_SRC_UNMAP_SINGLE - set to do the source dma-unmapping as single
85 * (if not set, do the source dma-unmapping as page)
86 * @DMA_COMPL_DEST_UNMAP_SINGLE - set to do the destination dma-unmapping as single
87 * (if not set, do the destination dma-unmapping as page)
Dan Williamsb2f46fd2009-07-14 12:20:36 -070088 * @DMA_PREP_PQ_DISABLE_P - prevent generation of P while generating Q
89 * @DMA_PREP_PQ_DISABLE_Q - prevent generation of Q while generating P
90 * @DMA_PREP_CONTINUE - indicate to a driver that it is reusing buffers as
91 * sources that were the result of a previous operation, in the case of a PQ
92 * operation it continues the calculation with new sources
Dan Williams0403e382009-09-08 17:42:50 -070093 * @DMA_PREP_FENCE - tell the driver that subsequent operations depend
94 * on the result of this operation
Dan Williamsd4c56f92008-02-02 19:49:58 -070095 */
Dan Williams636bdea2008-04-17 20:17:26 -070096enum dma_ctrl_flags {
Dan Williamsd4c56f92008-02-02 19:49:58 -070097 DMA_PREP_INTERRUPT = (1 << 0),
Dan Williams636bdea2008-04-17 20:17:26 -070098 DMA_CTRL_ACK = (1 << 1),
Dan Williamse1d181e2008-07-04 00:13:40 -070099 DMA_COMPL_SKIP_SRC_UNMAP = (1 << 2),
100 DMA_COMPL_SKIP_DEST_UNMAP = (1 << 3),
Maciej Sosnowski4f005db2009-04-23 12:31:51 +0200101 DMA_COMPL_SRC_UNMAP_SINGLE = (1 << 4),
102 DMA_COMPL_DEST_UNMAP_SINGLE = (1 << 5),
Dan Williamsf9dd2132009-09-08 17:42:29 -0700103 DMA_PREP_PQ_DISABLE_P = (1 << 6),
104 DMA_PREP_PQ_DISABLE_Q = (1 << 7),
105 DMA_PREP_CONTINUE = (1 << 8),
Dan Williams0403e382009-09-08 17:42:50 -0700106 DMA_PREP_FENCE = (1 << 9),
Dan Williamsd4c56f92008-02-02 19:49:58 -0700107};
108
109/**
Linus Walleijc3635c72010-03-26 16:44:01 -0700110 * enum dma_ctrl_cmd - DMA operations that can optionally be exercised
111 * on a running channel.
112 * @DMA_TERMINATE_ALL: terminate all ongoing transfers
113 * @DMA_PAUSE: pause ongoing transfers
114 * @DMA_RESUME: resume paused transfer
115 */
116enum dma_ctrl_cmd {
117 DMA_TERMINATE_ALL,
118 DMA_PAUSE,
119 DMA_RESUME,
120};
121
122/**
Dan Williamsad283ea2009-08-29 19:09:26 -0700123 * enum sum_check_bits - bit position of pq_check_flags
124 */
125enum sum_check_bits {
126 SUM_CHECK_P = 0,
127 SUM_CHECK_Q = 1,
128};
129
130/**
131 * enum pq_check_flags - result of async_{xor,pq}_zero_sum operations
132 * @SUM_CHECK_P_RESULT - 1 if xor zero sum error, 0 otherwise
133 * @SUM_CHECK_Q_RESULT - 1 if reed-solomon zero sum error, 0 otherwise
134 */
135enum sum_check_flags {
136 SUM_CHECK_P_RESULT = (1 << SUM_CHECK_P),
137 SUM_CHECK_Q_RESULT = (1 << SUM_CHECK_Q),
138};
139
140
141/**
Dan Williams7405f742007-01-02 11:10:43 -0700142 * dma_cap_mask_t - capabilities bitmap modeled after cpumask_t.
143 * See linux/cpumask.h
144 */
145typedef struct { DECLARE_BITMAP(bits, DMA_TX_TYPE_END); } dma_cap_mask_t;
146
147/**
Chris Leechc13c8262006-05-23 17:18:44 -0700148 * struct dma_chan_percpu - the per-CPU part of struct dma_chan
Chris Leechc13c8262006-05-23 17:18:44 -0700149 * @memcpy_count: transaction counter
150 * @bytes_transferred: byte counter
151 */
152
153struct dma_chan_percpu {
Chris Leechc13c8262006-05-23 17:18:44 -0700154 /* stats */
155 unsigned long memcpy_count;
156 unsigned long bytes_transferred;
157};
158
159/**
160 * struct dma_chan - devices supply DMA channels, clients use them
Randy Dunlapfe4ada22006-07-03 19:44:51 -0700161 * @device: ptr to the dma device who supplies this channel, always !%NULL
Chris Leechc13c8262006-05-23 17:18:44 -0700162 * @cookie: last cookie value returned to client
Randy Dunlapfe4ada22006-07-03 19:44:51 -0700163 * @chan_id: channel ID for sysfs
Dan Williams41d5e592009-01-06 11:38:21 -0700164 * @dev: class device for sysfs
Chris Leechc13c8262006-05-23 17:18:44 -0700165 * @device_node: used to add this to the device chan list
166 * @local: per-cpu pointer to a struct dma_chan_percpu
Dan Williams7cc5bf92008-07-08 11:58:21 -0700167 * @client-count: how many clients are using this channel
Dan Williamsbec08512009-01-06 11:38:14 -0700168 * @table_count: number of appearances in the mem-to-mem allocation table
Dan Williams287d8592009-02-18 14:48:26 -0800169 * @private: private data for certain client-channel associations
Chris Leechc13c8262006-05-23 17:18:44 -0700170 */
171struct dma_chan {
Chris Leechc13c8262006-05-23 17:18:44 -0700172 struct dma_device *device;
173 dma_cookie_t cookie;
174
175 /* sysfs */
176 int chan_id;
Dan Williams41d5e592009-01-06 11:38:21 -0700177 struct dma_chan_dev *dev;
Chris Leechc13c8262006-05-23 17:18:44 -0700178
Chris Leechc13c8262006-05-23 17:18:44 -0700179 struct list_head device_node;
Tejun Heoa29d8b82010-02-02 14:39:15 +0900180 struct dma_chan_percpu __percpu *local;
Dan Williams7cc5bf92008-07-08 11:58:21 -0700181 int client_count;
Dan Williamsbec08512009-01-06 11:38:14 -0700182 int table_count;
Dan Williams287d8592009-02-18 14:48:26 -0800183 void *private;
Chris Leechc13c8262006-05-23 17:18:44 -0700184};
185
Dan Williams41d5e592009-01-06 11:38:21 -0700186/**
187 * struct dma_chan_dev - relate sysfs device node to backing channel device
188 * @chan - driver channel device
189 * @device - sysfs device
Dan Williams864498a2009-01-06 11:38:21 -0700190 * @dev_id - parent dma_device dev_id
191 * @idr_ref - reference count to gate release of dma_device dev_id
Dan Williams41d5e592009-01-06 11:38:21 -0700192 */
193struct dma_chan_dev {
194 struct dma_chan *chan;
195 struct device device;
Dan Williams864498a2009-01-06 11:38:21 -0700196 int dev_id;
197 atomic_t *idr_ref;
Dan Williams41d5e592009-01-06 11:38:21 -0700198};
199
200static inline const char *dma_chan_name(struct dma_chan *chan)
201{
202 return dev_name(&chan->dev->device);
203}
Dan Williamsd379b012007-07-09 11:56:42 -0700204
Chris Leechc13c8262006-05-23 17:18:44 -0700205void dma_chan_cleanup(struct kref *kref);
206
Chris Leechc13c8262006-05-23 17:18:44 -0700207/**
Dan Williams59b5ec22009-01-06 11:38:15 -0700208 * typedef dma_filter_fn - callback filter for dma_request_channel
209 * @chan: channel to be reviewed
210 * @filter_param: opaque parameter passed through dma_request_channel
211 *
212 * When this optional parameter is specified in a call to dma_request_channel a
213 * suitable channel is passed to this routine for further dispositioning before
214 * being returned. Where 'suitable' indicates a non-busy channel that
Dan Williams7dd60252009-01-06 11:38:19 -0700215 * satisfies the given capability mask. It returns 'true' to indicate that the
216 * channel is suitable.
Dan Williams59b5ec22009-01-06 11:38:15 -0700217 */
Dan Williams7dd60252009-01-06 11:38:19 -0700218typedef bool (*dma_filter_fn)(struct dma_chan *chan, void *filter_param);
Dan Williams59b5ec22009-01-06 11:38:15 -0700219
Dan Williams7405f742007-01-02 11:10:43 -0700220typedef void (*dma_async_tx_callback)(void *dma_async_param);
221/**
222 * struct dma_async_tx_descriptor - async transaction descriptor
223 * ---dma generic offload fields---
224 * @cookie: tracking cookie for this transaction, set to -EBUSY if
225 * this tx is sitting on a dependency list
Dan Williams636bdea2008-04-17 20:17:26 -0700226 * @flags: flags to augment operation preparation, control completion, and
227 * communicate status
Dan Williams7405f742007-01-02 11:10:43 -0700228 * @phys: physical address of the descriptor
Dan Williams7405f742007-01-02 11:10:43 -0700229 * @chan: target channel for this operation
230 * @tx_submit: set the prepared descriptor(s) to be executed by the engine
Dan Williams7405f742007-01-02 11:10:43 -0700231 * @callback: routine to call after this operation is complete
232 * @callback_param: general parameter to pass to the callback routine
233 * ---async_tx api specific fields---
Dan Williams19242d72008-04-17 20:17:25 -0700234 * @next: at completion submit this descriptor
Dan Williams7405f742007-01-02 11:10:43 -0700235 * @parent: pointer to the next level up in the dependency chain
Dan Williams19242d72008-04-17 20:17:25 -0700236 * @lock: protect the parent and next pointers
Dan Williams7405f742007-01-02 11:10:43 -0700237 */
238struct dma_async_tx_descriptor {
239 dma_cookie_t cookie;
Dan Williams636bdea2008-04-17 20:17:26 -0700240 enum dma_ctrl_flags flags; /* not a 'long' to pack with cookie */
Dan Williams7405f742007-01-02 11:10:43 -0700241 dma_addr_t phys;
Dan Williams7405f742007-01-02 11:10:43 -0700242 struct dma_chan *chan;
243 dma_cookie_t (*tx_submit)(struct dma_async_tx_descriptor *tx);
Dan Williams7405f742007-01-02 11:10:43 -0700244 dma_async_tx_callback callback;
245 void *callback_param;
Dan Williams19242d72008-04-17 20:17:25 -0700246 struct dma_async_tx_descriptor *next;
Dan Williams7405f742007-01-02 11:10:43 -0700247 struct dma_async_tx_descriptor *parent;
248 spinlock_t lock;
249};
250
Chris Leechc13c8262006-05-23 17:18:44 -0700251/**
252 * struct dma_device - info on the entity supplying DMA services
253 * @chancnt: how many DMA channels are supported
Atsushi Nemoto0f571512009-03-06 20:07:14 +0900254 * @privatecnt: how many DMA channels are requested by dma_request_channel
Chris Leechc13c8262006-05-23 17:18:44 -0700255 * @channels: the list of struct dma_chan
256 * @global_node: list_head for global dma_device_list
Dan Williams7405f742007-01-02 11:10:43 -0700257 * @cap_mask: one or more dma_capability flags
258 * @max_xor: maximum number of xor sources, 0 if no capability
Dan Williamsb2f46fd2009-07-14 12:20:36 -0700259 * @max_pq: maximum number of PQ sources and PQ-continue capability
Dan Williams83544ae2009-09-08 17:42:53 -0700260 * @copy_align: alignment shift for memcpy operations
261 * @xor_align: alignment shift for xor operations
262 * @pq_align: alignment shift for pq operations
263 * @fill_align: alignment shift for memset operations
Randy Dunlapfe4ada22006-07-03 19:44:51 -0700264 * @dev_id: unique device ID
Dan Williams7405f742007-01-02 11:10:43 -0700265 * @dev: struct device reference for dma mapping api
Randy Dunlapfe4ada22006-07-03 19:44:51 -0700266 * @device_alloc_chan_resources: allocate resources and return the
267 * number of allocated descriptors
268 * @device_free_chan_resources: release DMA channel's resources
Dan Williams7405f742007-01-02 11:10:43 -0700269 * @device_prep_dma_memcpy: prepares a memcpy operation
270 * @device_prep_dma_xor: prepares a xor operation
Dan Williams099f53c2009-04-08 14:28:37 -0700271 * @device_prep_dma_xor_val: prepares a xor validation operation
Dan Williamsb2f46fd2009-07-14 12:20:36 -0700272 * @device_prep_dma_pq: prepares a pq operation
273 * @device_prep_dma_pq_val: prepares a pqzero_sum operation
Dan Williams7405f742007-01-02 11:10:43 -0700274 * @device_prep_dma_memset: prepares a memset operation
275 * @device_prep_dma_interrupt: prepares an end of chain interrupt operation
Haavard Skinnemoendc0ee6432008-07-08 11:59:35 -0700276 * @device_prep_slave_sg: prepares a slave dma operation
Linus Walleijc3635c72010-03-26 16:44:01 -0700277 * @device_control: manipulate all pending operations on a channel, returns
278 * zero or error code
Johannes Weiner1d93e522009-02-11 08:47:19 -0700279 * @device_is_tx_complete: poll for transaction completion
Dan Williams7405f742007-01-02 11:10:43 -0700280 * @device_issue_pending: push pending transactions to hardware
Chris Leechc13c8262006-05-23 17:18:44 -0700281 */
282struct dma_device {
283
284 unsigned int chancnt;
Atsushi Nemoto0f571512009-03-06 20:07:14 +0900285 unsigned int privatecnt;
Chris Leechc13c8262006-05-23 17:18:44 -0700286 struct list_head channels;
287 struct list_head global_node;
Dan Williams7405f742007-01-02 11:10:43 -0700288 dma_cap_mask_t cap_mask;
Dan Williamsb2f46fd2009-07-14 12:20:36 -0700289 unsigned short max_xor;
290 unsigned short max_pq;
Dan Williams83544ae2009-09-08 17:42:53 -0700291 u8 copy_align;
292 u8 xor_align;
293 u8 pq_align;
294 u8 fill_align;
Dan Williamsb2f46fd2009-07-14 12:20:36 -0700295 #define DMA_HAS_PQ_CONTINUE (1 << 15)
Chris Leechc13c8262006-05-23 17:18:44 -0700296
Chris Leechc13c8262006-05-23 17:18:44 -0700297 int dev_id;
Dan Williams7405f742007-01-02 11:10:43 -0700298 struct device *dev;
Chris Leechc13c8262006-05-23 17:18:44 -0700299
Dan Williamsaa1e6f12009-01-06 11:38:17 -0700300 int (*device_alloc_chan_resources)(struct dma_chan *chan);
Chris Leechc13c8262006-05-23 17:18:44 -0700301 void (*device_free_chan_resources)(struct dma_chan *chan);
Dan Williams7405f742007-01-02 11:10:43 -0700302
303 struct dma_async_tx_descriptor *(*device_prep_dma_memcpy)(
Dan Williams00367312008-02-02 19:49:57 -0700304 struct dma_chan *chan, dma_addr_t dest, dma_addr_t src,
Dan Williamsd4c56f92008-02-02 19:49:58 -0700305 size_t len, unsigned long flags);
Dan Williams7405f742007-01-02 11:10:43 -0700306 struct dma_async_tx_descriptor *(*device_prep_dma_xor)(
Dan Williams00367312008-02-02 19:49:57 -0700307 struct dma_chan *chan, dma_addr_t dest, dma_addr_t *src,
Dan Williamsd4c56f92008-02-02 19:49:58 -0700308 unsigned int src_cnt, size_t len, unsigned long flags);
Dan Williams099f53c2009-04-08 14:28:37 -0700309 struct dma_async_tx_descriptor *(*device_prep_dma_xor_val)(
Dan Williams00367312008-02-02 19:49:57 -0700310 struct dma_chan *chan, dma_addr_t *src, unsigned int src_cnt,
Dan Williamsad283ea2009-08-29 19:09:26 -0700311 size_t len, enum sum_check_flags *result, unsigned long flags);
Dan Williamsb2f46fd2009-07-14 12:20:36 -0700312 struct dma_async_tx_descriptor *(*device_prep_dma_pq)(
313 struct dma_chan *chan, dma_addr_t *dst, dma_addr_t *src,
314 unsigned int src_cnt, const unsigned char *scf,
315 size_t len, unsigned long flags);
316 struct dma_async_tx_descriptor *(*device_prep_dma_pq_val)(
317 struct dma_chan *chan, dma_addr_t *pq, dma_addr_t *src,
318 unsigned int src_cnt, const unsigned char *scf, size_t len,
319 enum sum_check_flags *pqres, unsigned long flags);
Dan Williams7405f742007-01-02 11:10:43 -0700320 struct dma_async_tx_descriptor *(*device_prep_dma_memset)(
Dan Williams00367312008-02-02 19:49:57 -0700321 struct dma_chan *chan, dma_addr_t dest, int value, size_t len,
Dan Williamsd4c56f92008-02-02 19:49:58 -0700322 unsigned long flags);
Dan Williams7405f742007-01-02 11:10:43 -0700323 struct dma_async_tx_descriptor *(*device_prep_dma_interrupt)(
Dan Williams636bdea2008-04-17 20:17:26 -0700324 struct dma_chan *chan, unsigned long flags);
Dan Williams7405f742007-01-02 11:10:43 -0700325
Haavard Skinnemoendc0ee6432008-07-08 11:59:35 -0700326 struct dma_async_tx_descriptor *(*device_prep_slave_sg)(
327 struct dma_chan *chan, struct scatterlist *sgl,
328 unsigned int sg_len, enum dma_data_direction direction,
329 unsigned long flags);
Linus Walleijc3635c72010-03-26 16:44:01 -0700330 int (*device_control)(struct dma_chan *chan, enum dma_ctrl_cmd cmd);
Haavard Skinnemoendc0ee6432008-07-08 11:59:35 -0700331
Dan Williams7405f742007-01-02 11:10:43 -0700332 enum dma_status (*device_is_tx_complete)(struct dma_chan *chan,
Chris Leechc13c8262006-05-23 17:18:44 -0700333 dma_cookie_t cookie, dma_cookie_t *last,
334 dma_cookie_t *used);
Dan Williams7405f742007-01-02 11:10:43 -0700335 void (*device_issue_pending)(struct dma_chan *chan);
Chris Leechc13c8262006-05-23 17:18:44 -0700336};
337
Dan Williams83544ae2009-09-08 17:42:53 -0700338static inline bool dmaengine_check_align(u8 align, size_t off1, size_t off2, size_t len)
339{
340 size_t mask;
341
342 if (!align)
343 return true;
344 mask = (1 << align) - 1;
345 if (mask & (off1 | off2 | len))
346 return false;
347 return true;
348}
349
350static inline bool is_dma_copy_aligned(struct dma_device *dev, size_t off1,
351 size_t off2, size_t len)
352{
353 return dmaengine_check_align(dev->copy_align, off1, off2, len);
354}
355
356static inline bool is_dma_xor_aligned(struct dma_device *dev, size_t off1,
357 size_t off2, size_t len)
358{
359 return dmaengine_check_align(dev->xor_align, off1, off2, len);
360}
361
362static inline bool is_dma_pq_aligned(struct dma_device *dev, size_t off1,
363 size_t off2, size_t len)
364{
365 return dmaengine_check_align(dev->pq_align, off1, off2, len);
366}
367
368static inline bool is_dma_fill_aligned(struct dma_device *dev, size_t off1,
369 size_t off2, size_t len)
370{
371 return dmaengine_check_align(dev->fill_align, off1, off2, len);
372}
373
Dan Williamsb2f46fd2009-07-14 12:20:36 -0700374static inline void
375dma_set_maxpq(struct dma_device *dma, int maxpq, int has_pq_continue)
376{
377 dma->max_pq = maxpq;
378 if (has_pq_continue)
379 dma->max_pq |= DMA_HAS_PQ_CONTINUE;
380}
381
382static inline bool dmaf_continue(enum dma_ctrl_flags flags)
383{
384 return (flags & DMA_PREP_CONTINUE) == DMA_PREP_CONTINUE;
385}
386
387static inline bool dmaf_p_disabled_continue(enum dma_ctrl_flags flags)
388{
389 enum dma_ctrl_flags mask = DMA_PREP_CONTINUE | DMA_PREP_PQ_DISABLE_P;
390
391 return (flags & mask) == mask;
392}
393
394static inline bool dma_dev_has_pq_continue(struct dma_device *dma)
395{
396 return (dma->max_pq & DMA_HAS_PQ_CONTINUE) == DMA_HAS_PQ_CONTINUE;
397}
398
399static unsigned short dma_dev_to_maxpq(struct dma_device *dma)
400{
401 return dma->max_pq & ~DMA_HAS_PQ_CONTINUE;
402}
403
404/* dma_maxpq - reduce maxpq in the face of continued operations
405 * @dma - dma device with PQ capability
406 * @flags - to check if DMA_PREP_CONTINUE and DMA_PREP_PQ_DISABLE_P are set
407 *
408 * When an engine does not support native continuation we need 3 extra
409 * source slots to reuse P and Q with the following coefficients:
410 * 1/ {00} * P : remove P from Q', but use it as a source for P'
411 * 2/ {01} * Q : use Q to continue Q' calculation
412 * 3/ {00} * Q : subtract Q from P' to cancel (2)
413 *
414 * In the case where P is disabled we only need 1 extra source:
415 * 1/ {01} * Q : use Q to continue Q' calculation
416 */
417static inline int dma_maxpq(struct dma_device *dma, enum dma_ctrl_flags flags)
418{
419 if (dma_dev_has_pq_continue(dma) || !dmaf_continue(flags))
420 return dma_dev_to_maxpq(dma);
421 else if (dmaf_p_disabled_continue(flags))
422 return dma_dev_to_maxpq(dma) - 1;
423 else if (dmaf_continue(flags))
424 return dma_dev_to_maxpq(dma) - 3;
425 BUG();
426}
427
Chris Leechc13c8262006-05-23 17:18:44 -0700428/* --- public DMA engine API --- */
429
Dan Williams649274d2009-01-11 00:20:39 -0800430#ifdef CONFIG_DMA_ENGINE
Dan Williams209b84a2009-01-06 11:38:17 -0700431void dmaengine_get(void);
432void dmaengine_put(void);
Dan Williams649274d2009-01-11 00:20:39 -0800433#else
434static inline void dmaengine_get(void)
435{
436}
437static inline void dmaengine_put(void)
438{
439}
440#endif
441
David S. Millerb4bd07c2009-02-06 22:06:43 -0800442#ifdef CONFIG_NET_DMA
443#define net_dmaengine_get() dmaengine_get()
444#define net_dmaengine_put() dmaengine_put()
445#else
446static inline void net_dmaengine_get(void)
447{
448}
449static inline void net_dmaengine_put(void)
450{
451}
452#endif
453
Dan Williams729b5d12009-03-25 09:13:25 -0700454#ifdef CONFIG_ASYNC_TX_DMA
455#define async_dmaengine_get() dmaengine_get()
456#define async_dmaengine_put() dmaengine_put()
Dan Williams138f4c32009-09-08 17:42:51 -0700457#ifdef CONFIG_ASYNC_TX_DISABLE_CHANNEL_SWITCH
458#define async_dma_find_channel(type) dma_find_channel(DMA_ASYNC_TX)
459#else
Dan Williams729b5d12009-03-25 09:13:25 -0700460#define async_dma_find_channel(type) dma_find_channel(type)
Dan Williams138f4c32009-09-08 17:42:51 -0700461#endif /* CONFIG_ASYNC_TX_DISABLE_CHANNEL_SWITCH */
Dan Williams729b5d12009-03-25 09:13:25 -0700462#else
463static inline void async_dmaengine_get(void)
464{
465}
466static inline void async_dmaengine_put(void)
467{
468}
469static inline struct dma_chan *
470async_dma_find_channel(enum dma_transaction_type type)
471{
472 return NULL;
473}
Dan Williams138f4c32009-09-08 17:42:51 -0700474#endif /* CONFIG_ASYNC_TX_DMA */
Dan Williams729b5d12009-03-25 09:13:25 -0700475
Dan Williams7405f742007-01-02 11:10:43 -0700476dma_cookie_t dma_async_memcpy_buf_to_buf(struct dma_chan *chan,
477 void *dest, void *src, size_t len);
478dma_cookie_t dma_async_memcpy_buf_to_pg(struct dma_chan *chan,
479 struct page *page, unsigned int offset, void *kdata, size_t len);
480dma_cookie_t dma_async_memcpy_pg_to_pg(struct dma_chan *chan,
Chris Leechc13c8262006-05-23 17:18:44 -0700481 struct page *dest_pg, unsigned int dest_off, struct page *src_pg,
Dan Williams7405f742007-01-02 11:10:43 -0700482 unsigned int src_off, size_t len);
483void dma_async_tx_descriptor_init(struct dma_async_tx_descriptor *tx,
484 struct dma_chan *chan);
Chris Leechc13c8262006-05-23 17:18:44 -0700485
Dan Williams08398752008-07-17 17:59:56 -0700486static inline void async_tx_ack(struct dma_async_tx_descriptor *tx)
Dan Williams7405f742007-01-02 11:10:43 -0700487{
Dan Williams636bdea2008-04-17 20:17:26 -0700488 tx->flags |= DMA_CTRL_ACK;
489}
490
Guennadi Liakhovetskief560682009-01-19 15:36:21 -0700491static inline void async_tx_clear_ack(struct dma_async_tx_descriptor *tx)
492{
493 tx->flags &= ~DMA_CTRL_ACK;
494}
495
Dan Williams08398752008-07-17 17:59:56 -0700496static inline bool async_tx_test_ack(struct dma_async_tx_descriptor *tx)
Dan Williams636bdea2008-04-17 20:17:26 -0700497{
Dan Williams08398752008-07-17 17:59:56 -0700498 return (tx->flags & DMA_CTRL_ACK) == DMA_CTRL_ACK;
Chris Leechc13c8262006-05-23 17:18:44 -0700499}
500
Dan Williams7405f742007-01-02 11:10:43 -0700501#define first_dma_cap(mask) __first_dma_cap(&(mask))
502static inline int __first_dma_cap(const dma_cap_mask_t *srcp)
503{
504 return min_t(int, DMA_TX_TYPE_END,
505 find_first_bit(srcp->bits, DMA_TX_TYPE_END));
506}
507
508#define next_dma_cap(n, mask) __next_dma_cap((n), &(mask))
509static inline int __next_dma_cap(int n, const dma_cap_mask_t *srcp)
510{
511 return min_t(int, DMA_TX_TYPE_END,
512 find_next_bit(srcp->bits, DMA_TX_TYPE_END, n+1));
513}
514
515#define dma_cap_set(tx, mask) __dma_cap_set((tx), &(mask))
516static inline void
517__dma_cap_set(enum dma_transaction_type tx_type, dma_cap_mask_t *dstp)
518{
519 set_bit(tx_type, dstp->bits);
520}
521
Atsushi Nemoto0f571512009-03-06 20:07:14 +0900522#define dma_cap_clear(tx, mask) __dma_cap_clear((tx), &(mask))
523static inline void
524__dma_cap_clear(enum dma_transaction_type tx_type, dma_cap_mask_t *dstp)
525{
526 clear_bit(tx_type, dstp->bits);
527}
528
Dan Williams33df8ca2009-01-06 11:38:15 -0700529#define dma_cap_zero(mask) __dma_cap_zero(&(mask))
530static inline void __dma_cap_zero(dma_cap_mask_t *dstp)
531{
532 bitmap_zero(dstp->bits, DMA_TX_TYPE_END);
533}
534
Dan Williams7405f742007-01-02 11:10:43 -0700535#define dma_has_cap(tx, mask) __dma_has_cap((tx), &(mask))
536static inline int
537__dma_has_cap(enum dma_transaction_type tx_type, dma_cap_mask_t *srcp)
538{
539 return test_bit(tx_type, srcp->bits);
540}
541
542#define for_each_dma_cap_mask(cap, mask) \
543 for ((cap) = first_dma_cap(mask); \
544 (cap) < DMA_TX_TYPE_END; \
545 (cap) = next_dma_cap((cap), (mask)))
546
Chris Leechc13c8262006-05-23 17:18:44 -0700547/**
Dan Williams7405f742007-01-02 11:10:43 -0700548 * dma_async_issue_pending - flush pending transactions to HW
Randy Dunlapfe4ada22006-07-03 19:44:51 -0700549 * @chan: target DMA channel
Chris Leechc13c8262006-05-23 17:18:44 -0700550 *
551 * This allows drivers to push copies to HW in batches,
552 * reducing MMIO writes where possible.
553 */
Dan Williams7405f742007-01-02 11:10:43 -0700554static inline void dma_async_issue_pending(struct dma_chan *chan)
Chris Leechc13c8262006-05-23 17:18:44 -0700555{
Dan Williamsec8670f2008-03-01 07:51:29 -0700556 chan->device->device_issue_pending(chan);
Chris Leechc13c8262006-05-23 17:18:44 -0700557}
558
Dan Williams7405f742007-01-02 11:10:43 -0700559#define dma_async_memcpy_issue_pending(chan) dma_async_issue_pending(chan)
560
Chris Leechc13c8262006-05-23 17:18:44 -0700561/**
Dan Williams7405f742007-01-02 11:10:43 -0700562 * dma_async_is_tx_complete - poll for transaction completion
Chris Leechc13c8262006-05-23 17:18:44 -0700563 * @chan: DMA channel
564 * @cookie: transaction identifier to check status of
565 * @last: returns last completed cookie, can be NULL
566 * @used: returns last issued cookie, can be NULL
567 *
568 * If @last and @used are passed in, upon return they reflect the driver
569 * internal state and can be used with dma_async_is_complete() to check
570 * the status of multiple cookies without re-checking hardware state.
571 */
Dan Williams7405f742007-01-02 11:10:43 -0700572static inline enum dma_status dma_async_is_tx_complete(struct dma_chan *chan,
Chris Leechc13c8262006-05-23 17:18:44 -0700573 dma_cookie_t cookie, dma_cookie_t *last, dma_cookie_t *used)
574{
Dan Williams7405f742007-01-02 11:10:43 -0700575 return chan->device->device_is_tx_complete(chan, cookie, last, used);
Chris Leechc13c8262006-05-23 17:18:44 -0700576}
577
Dan Williams7405f742007-01-02 11:10:43 -0700578#define dma_async_memcpy_complete(chan, cookie, last, used)\
579 dma_async_is_tx_complete(chan, cookie, last, used)
580
Chris Leechc13c8262006-05-23 17:18:44 -0700581/**
582 * dma_async_is_complete - test a cookie against chan state
583 * @cookie: transaction identifier to test status of
584 * @last_complete: last know completed transaction
585 * @last_used: last cookie value handed out
586 *
587 * dma_async_is_complete() is used in dma_async_memcpy_complete()
Sebastian Siewior8a5703f2008-04-21 22:38:45 +0000588 * the test logic is separated for lightweight testing of multiple cookies
Chris Leechc13c8262006-05-23 17:18:44 -0700589 */
590static inline enum dma_status dma_async_is_complete(dma_cookie_t cookie,
591 dma_cookie_t last_complete, dma_cookie_t last_used)
592{
593 if (last_complete <= last_used) {
594 if ((cookie <= last_complete) || (cookie > last_used))
595 return DMA_SUCCESS;
596 } else {
597 if ((cookie <= last_complete) && (cookie > last_used))
598 return DMA_SUCCESS;
599 }
600 return DMA_IN_PROGRESS;
601}
602
Dan Williams7405f742007-01-02 11:10:43 -0700603enum dma_status dma_sync_wait(struct dma_chan *chan, dma_cookie_t cookie);
Dan Williams07f22112009-01-05 17:14:31 -0700604#ifdef CONFIG_DMA_ENGINE
605enum dma_status dma_wait_for_async_tx(struct dma_async_tx_descriptor *tx);
Dan Williamsc50331e2009-01-19 15:33:14 -0700606void dma_issue_pending_all(void);
Dan Williams07f22112009-01-05 17:14:31 -0700607#else
608static inline enum dma_status dma_wait_for_async_tx(struct dma_async_tx_descriptor *tx)
609{
610 return DMA_SUCCESS;
611}
Dan Williamsc50331e2009-01-19 15:33:14 -0700612static inline void dma_issue_pending_all(void)
613{
614 do { } while (0);
615}
Dan Williams07f22112009-01-05 17:14:31 -0700616#endif
Chris Leechc13c8262006-05-23 17:18:44 -0700617
618/* --- DMA device --- */
619
620int dma_async_device_register(struct dma_device *device);
621void dma_async_device_unregister(struct dma_device *device);
Dan Williams07f22112009-01-05 17:14:31 -0700622void dma_run_dependencies(struct dma_async_tx_descriptor *tx);
Dan Williamsbec08512009-01-06 11:38:14 -0700623struct dma_chan *dma_find_channel(enum dma_transaction_type tx_type);
Dan Williams59b5ec22009-01-06 11:38:15 -0700624#define dma_request_channel(mask, x, y) __dma_request_channel(&(mask), x, y)
625struct dma_chan *__dma_request_channel(dma_cap_mask_t *mask, dma_filter_fn fn, void *fn_param);
626void dma_release_channel(struct dma_chan *chan);
Chris Leechc13c8262006-05-23 17:18:44 -0700627
Chris Leechde5506e2006-05-23 17:50:37 -0700628/* --- Helper iov-locking functions --- */
629
630struct dma_page_list {
Al Virob2ddb902008-03-29 03:09:38 +0000631 char __user *base_address;
Chris Leechde5506e2006-05-23 17:50:37 -0700632 int nr_pages;
633 struct page **pages;
634};
635
636struct dma_pinned_list {
637 int nr_iovecs;
638 struct dma_page_list page_list[0];
639};
640
641struct dma_pinned_list *dma_pin_iovec_pages(struct iovec *iov, size_t len);
642void dma_unpin_iovec_pages(struct dma_pinned_list* pinned_list);
643
644dma_cookie_t dma_memcpy_to_iovec(struct dma_chan *chan, struct iovec *iov,
645 struct dma_pinned_list *pinned_list, unsigned char *kdata, size_t len);
646dma_cookie_t dma_memcpy_pg_to_iovec(struct dma_chan *chan, struct iovec *iov,
647 struct dma_pinned_list *pinned_list, struct page *page,
648 unsigned int offset, size_t len);
649
Chris Leechc13c8262006-05-23 17:18:44 -0700650#endif /* DMAENGINE_H */