blob: 86853ed7970bde1ea423ea90c990d5a554845651 [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
Dan Williams138f4c32009-09-08 17:42:51 -070051 *
52 * Note: The DMA_ASYNC_TX capability is not to be set by drivers. It is
53 * automatically set as dma devices are registered.
Dan Williams7405f742007-01-02 11:10:43 -070054 */
55enum dma_transaction_type {
56 DMA_MEMCPY,
57 DMA_XOR,
Dan Williamsb2f46fd2009-07-14 12:20:36 -070058 DMA_PQ,
Dan Williams7405f742007-01-02 11:10:43 -070059 DMA_DUAL_XOR,
60 DMA_PQ_UPDATE,
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,
64 DMA_MEMCPY_CRC32C,
65 DMA_INTERRUPT,
Dan Williams59b5ec22009-01-06 11:38:15 -070066 DMA_PRIVATE,
Dan Williams138f4c32009-09-08 17:42:51 -070067 DMA_ASYNC_TX,
Haavard Skinnemoendc0ee6432008-07-08 11:59:35 -070068 DMA_SLAVE,
Dan Williams7405f742007-01-02 11:10:43 -070069};
70
71/* last transaction type for creation of the capabilities mask */
Haavard Skinnemoendc0ee6432008-07-08 11:59:35 -070072#define DMA_TX_TYPE_END (DMA_SLAVE + 1)
73
Dan Williams7405f742007-01-02 11:10:43 -070074
75/**
Dan Williams636bdea2008-04-17 20:17:26 -070076 * enum dma_ctrl_flags - DMA flags to augment operation preparation,
Dan Williamsb2f46fd2009-07-14 12:20:36 -070077 * control completion, and communicate status.
Dan Williamsd4c56f92008-02-02 19:49:58 -070078 * @DMA_PREP_INTERRUPT - trigger an interrupt (callback) upon completion of
Dan Williamsb2f46fd2009-07-14 12:20:36 -070079 * this transaction
Dan Williams636bdea2008-04-17 20:17:26 -070080 * @DMA_CTRL_ACK - the descriptor cannot be reused until the client
Dan Williamsb2f46fd2009-07-14 12:20:36 -070081 * acknowledges receipt, i.e. has has a chance to establish any dependency
82 * chains
Dan Williamse1d181e2008-07-04 00:13:40 -070083 * @DMA_COMPL_SKIP_SRC_UNMAP - set to disable dma-unmapping the source buffer(s)
84 * @DMA_COMPL_SKIP_DEST_UNMAP - set to disable dma-unmapping the destination(s)
Maciej Sosnowski4f005db2009-04-23 12:31:51 +020085 * @DMA_COMPL_SRC_UNMAP_SINGLE - set to do the source dma-unmapping as single
86 * (if not set, do the source dma-unmapping as page)
87 * @DMA_COMPL_DEST_UNMAP_SINGLE - set to do the destination dma-unmapping as single
88 * (if not set, do the destination dma-unmapping as page)
Dan Williamsb2f46fd2009-07-14 12:20:36 -070089 * @DMA_PREP_PQ_DISABLE_P - prevent generation of P while generating Q
90 * @DMA_PREP_PQ_DISABLE_Q - prevent generation of Q while generating P
91 * @DMA_PREP_CONTINUE - indicate to a driver that it is reusing buffers as
92 * sources that were the result of a previous operation, in the case of a PQ
93 * operation it continues the calculation with new sources
Dan Williams0403e382009-09-08 17:42:50 -070094 * @DMA_PREP_FENCE - tell the driver that subsequent operations depend
95 * on the result of this operation
Dan Williamsd4c56f92008-02-02 19:49:58 -070096 */
Dan Williams636bdea2008-04-17 20:17:26 -070097enum dma_ctrl_flags {
Dan Williamsd4c56f92008-02-02 19:49:58 -070098 DMA_PREP_INTERRUPT = (1 << 0),
Dan Williams636bdea2008-04-17 20:17:26 -070099 DMA_CTRL_ACK = (1 << 1),
Dan Williamse1d181e2008-07-04 00:13:40 -0700100 DMA_COMPL_SKIP_SRC_UNMAP = (1 << 2),
101 DMA_COMPL_SKIP_DEST_UNMAP = (1 << 3),
Maciej Sosnowski4f005db2009-04-23 12:31:51 +0200102 DMA_COMPL_SRC_UNMAP_SINGLE = (1 << 4),
103 DMA_COMPL_DEST_UNMAP_SINGLE = (1 << 5),
Dan Williamsf9dd2132009-09-08 17:42:29 -0700104 DMA_PREP_PQ_DISABLE_P = (1 << 6),
105 DMA_PREP_PQ_DISABLE_Q = (1 << 7),
106 DMA_PREP_CONTINUE = (1 << 8),
Dan Williams0403e382009-09-08 17:42:50 -0700107 DMA_PREP_FENCE = (1 << 9),
Dan Williamsd4c56f92008-02-02 19:49:58 -0700108};
109
110/**
Dan Williamsad283ea2009-08-29 19:09:26 -0700111 * enum sum_check_bits - bit position of pq_check_flags
112 */
113enum sum_check_bits {
114 SUM_CHECK_P = 0,
115 SUM_CHECK_Q = 1,
116};
117
118/**
119 * enum pq_check_flags - result of async_{xor,pq}_zero_sum operations
120 * @SUM_CHECK_P_RESULT - 1 if xor zero sum error, 0 otherwise
121 * @SUM_CHECK_Q_RESULT - 1 if reed-solomon zero sum error, 0 otherwise
122 */
123enum sum_check_flags {
124 SUM_CHECK_P_RESULT = (1 << SUM_CHECK_P),
125 SUM_CHECK_Q_RESULT = (1 << SUM_CHECK_Q),
126};
127
128
129/**
Dan Williams7405f742007-01-02 11:10:43 -0700130 * dma_cap_mask_t - capabilities bitmap modeled after cpumask_t.
131 * See linux/cpumask.h
132 */
133typedef struct { DECLARE_BITMAP(bits, DMA_TX_TYPE_END); } dma_cap_mask_t;
134
135/**
Chris Leechc13c8262006-05-23 17:18:44 -0700136 * struct dma_chan_percpu - the per-CPU part of struct dma_chan
Chris Leechc13c8262006-05-23 17:18:44 -0700137 * @memcpy_count: transaction counter
138 * @bytes_transferred: byte counter
139 */
140
141struct dma_chan_percpu {
Chris Leechc13c8262006-05-23 17:18:44 -0700142 /* stats */
143 unsigned long memcpy_count;
144 unsigned long bytes_transferred;
145};
146
147/**
148 * struct dma_chan - devices supply DMA channels, clients use them
Randy Dunlapfe4ada22006-07-03 19:44:51 -0700149 * @device: ptr to the dma device who supplies this channel, always !%NULL
Chris Leechc13c8262006-05-23 17:18:44 -0700150 * @cookie: last cookie value returned to client
Randy Dunlapfe4ada22006-07-03 19:44:51 -0700151 * @chan_id: channel ID for sysfs
Dan Williams41d5e592009-01-06 11:38:21 -0700152 * @dev: class device for sysfs
Chris Leechc13c8262006-05-23 17:18:44 -0700153 * @device_node: used to add this to the device chan list
154 * @local: per-cpu pointer to a struct dma_chan_percpu
Dan Williams7cc5bf92008-07-08 11:58:21 -0700155 * @client-count: how many clients are using this channel
Dan Williamsbec08512009-01-06 11:38:14 -0700156 * @table_count: number of appearances in the mem-to-mem allocation table
Dan Williams287d8592009-02-18 14:48:26 -0800157 * @private: private data for certain client-channel associations
Chris Leechc13c8262006-05-23 17:18:44 -0700158 */
159struct dma_chan {
Chris Leechc13c8262006-05-23 17:18:44 -0700160 struct dma_device *device;
161 dma_cookie_t cookie;
162
163 /* sysfs */
164 int chan_id;
Dan Williams41d5e592009-01-06 11:38:21 -0700165 struct dma_chan_dev *dev;
Chris Leechc13c8262006-05-23 17:18:44 -0700166
Chris Leechc13c8262006-05-23 17:18:44 -0700167 struct list_head device_node;
168 struct dma_chan_percpu *local;
Dan Williams7cc5bf92008-07-08 11:58:21 -0700169 int client_count;
Dan Williamsbec08512009-01-06 11:38:14 -0700170 int table_count;
Dan Williams287d8592009-02-18 14:48:26 -0800171 void *private;
Chris Leechc13c8262006-05-23 17:18:44 -0700172};
173
Dan Williams41d5e592009-01-06 11:38:21 -0700174/**
175 * struct dma_chan_dev - relate sysfs device node to backing channel device
176 * @chan - driver channel device
177 * @device - sysfs device
Dan Williams864498a2009-01-06 11:38:21 -0700178 * @dev_id - parent dma_device dev_id
179 * @idr_ref - reference count to gate release of dma_device dev_id
Dan Williams41d5e592009-01-06 11:38:21 -0700180 */
181struct dma_chan_dev {
182 struct dma_chan *chan;
183 struct device device;
Dan Williams864498a2009-01-06 11:38:21 -0700184 int dev_id;
185 atomic_t *idr_ref;
Dan Williams41d5e592009-01-06 11:38:21 -0700186};
187
188static inline const char *dma_chan_name(struct dma_chan *chan)
189{
190 return dev_name(&chan->dev->device);
191}
Dan Williamsd379b012007-07-09 11:56:42 -0700192
Chris Leechc13c8262006-05-23 17:18:44 -0700193void dma_chan_cleanup(struct kref *kref);
194
Chris Leechc13c8262006-05-23 17:18:44 -0700195/**
Dan Williams59b5ec22009-01-06 11:38:15 -0700196 * typedef dma_filter_fn - callback filter for dma_request_channel
197 * @chan: channel to be reviewed
198 * @filter_param: opaque parameter passed through dma_request_channel
199 *
200 * When this optional parameter is specified in a call to dma_request_channel a
201 * suitable channel is passed to this routine for further dispositioning before
202 * being returned. Where 'suitable' indicates a non-busy channel that
Dan Williams7dd60252009-01-06 11:38:19 -0700203 * satisfies the given capability mask. It returns 'true' to indicate that the
204 * channel is suitable.
Dan Williams59b5ec22009-01-06 11:38:15 -0700205 */
Dan Williams7dd60252009-01-06 11:38:19 -0700206typedef bool (*dma_filter_fn)(struct dma_chan *chan, void *filter_param);
Dan Williams59b5ec22009-01-06 11:38:15 -0700207
Dan Williams7405f742007-01-02 11:10:43 -0700208typedef void (*dma_async_tx_callback)(void *dma_async_param);
209/**
210 * struct dma_async_tx_descriptor - async transaction descriptor
211 * ---dma generic offload fields---
212 * @cookie: tracking cookie for this transaction, set to -EBUSY if
213 * this tx is sitting on a dependency list
Dan Williams636bdea2008-04-17 20:17:26 -0700214 * @flags: flags to augment operation preparation, control completion, and
215 * communicate status
Dan Williams7405f742007-01-02 11:10:43 -0700216 * @phys: physical address of the descriptor
217 * @tx_list: driver common field for operations that require multiple
218 * descriptors
219 * @chan: target channel for this operation
220 * @tx_submit: set the prepared descriptor(s) to be executed by the engine
Dan Williams7405f742007-01-02 11:10:43 -0700221 * @callback: routine to call after this operation is complete
222 * @callback_param: general parameter to pass to the callback routine
223 * ---async_tx api specific fields---
Dan Williams19242d72008-04-17 20:17:25 -0700224 * @next: at completion submit this descriptor
Dan Williams7405f742007-01-02 11:10:43 -0700225 * @parent: pointer to the next level up in the dependency chain
Dan Williams19242d72008-04-17 20:17:25 -0700226 * @lock: protect the parent and next pointers
Dan Williams7405f742007-01-02 11:10:43 -0700227 */
228struct dma_async_tx_descriptor {
229 dma_cookie_t cookie;
Dan Williams636bdea2008-04-17 20:17:26 -0700230 enum dma_ctrl_flags flags; /* not a 'long' to pack with cookie */
Dan Williams7405f742007-01-02 11:10:43 -0700231 dma_addr_t phys;
232 struct list_head tx_list;
233 struct dma_chan *chan;
234 dma_cookie_t (*tx_submit)(struct dma_async_tx_descriptor *tx);
Dan Williams7405f742007-01-02 11:10:43 -0700235 dma_async_tx_callback callback;
236 void *callback_param;
Dan Williams19242d72008-04-17 20:17:25 -0700237 struct dma_async_tx_descriptor *next;
Dan Williams7405f742007-01-02 11:10:43 -0700238 struct dma_async_tx_descriptor *parent;
239 spinlock_t lock;
240};
241
Chris Leechc13c8262006-05-23 17:18:44 -0700242/**
243 * struct dma_device - info on the entity supplying DMA services
244 * @chancnt: how many DMA channels are supported
Atsushi Nemoto0f571512009-03-06 20:07:14 +0900245 * @privatecnt: how many DMA channels are requested by dma_request_channel
Chris Leechc13c8262006-05-23 17:18:44 -0700246 * @channels: the list of struct dma_chan
247 * @global_node: list_head for global dma_device_list
Dan Williams7405f742007-01-02 11:10:43 -0700248 * @cap_mask: one or more dma_capability flags
249 * @max_xor: maximum number of xor sources, 0 if no capability
Dan Williamsb2f46fd2009-07-14 12:20:36 -0700250 * @max_pq: maximum number of PQ sources and PQ-continue capability
Randy Dunlapfe4ada22006-07-03 19:44:51 -0700251 * @dev_id: unique device ID
Dan Williams7405f742007-01-02 11:10:43 -0700252 * @dev: struct device reference for dma mapping api
Randy Dunlapfe4ada22006-07-03 19:44:51 -0700253 * @device_alloc_chan_resources: allocate resources and return the
254 * number of allocated descriptors
255 * @device_free_chan_resources: release DMA channel's resources
Dan Williams7405f742007-01-02 11:10:43 -0700256 * @device_prep_dma_memcpy: prepares a memcpy operation
257 * @device_prep_dma_xor: prepares a xor operation
Dan Williams099f53c2009-04-08 14:28:37 -0700258 * @device_prep_dma_xor_val: prepares a xor validation operation
Dan Williamsb2f46fd2009-07-14 12:20:36 -0700259 * @device_prep_dma_pq: prepares a pq operation
260 * @device_prep_dma_pq_val: prepares a pqzero_sum operation
Dan Williams7405f742007-01-02 11:10:43 -0700261 * @device_prep_dma_memset: prepares a memset operation
262 * @device_prep_dma_interrupt: prepares an end of chain interrupt operation
Haavard Skinnemoendc0ee6432008-07-08 11:59:35 -0700263 * @device_prep_slave_sg: prepares a slave dma operation
264 * @device_terminate_all: terminate all pending operations
Johannes Weiner1d93e522009-02-11 08:47:19 -0700265 * @device_is_tx_complete: poll for transaction completion
Dan Williams7405f742007-01-02 11:10:43 -0700266 * @device_issue_pending: push pending transactions to hardware
Chris Leechc13c8262006-05-23 17:18:44 -0700267 */
268struct dma_device {
269
270 unsigned int chancnt;
Atsushi Nemoto0f571512009-03-06 20:07:14 +0900271 unsigned int privatecnt;
Chris Leechc13c8262006-05-23 17:18:44 -0700272 struct list_head channels;
273 struct list_head global_node;
Dan Williams7405f742007-01-02 11:10:43 -0700274 dma_cap_mask_t cap_mask;
Dan Williamsb2f46fd2009-07-14 12:20:36 -0700275 unsigned short max_xor;
276 unsigned short max_pq;
277 #define DMA_HAS_PQ_CONTINUE (1 << 15)
Chris Leechc13c8262006-05-23 17:18:44 -0700278
Chris Leechc13c8262006-05-23 17:18:44 -0700279 int dev_id;
Dan Williams7405f742007-01-02 11:10:43 -0700280 struct device *dev;
Chris Leechc13c8262006-05-23 17:18:44 -0700281
Dan Williamsaa1e6f12009-01-06 11:38:17 -0700282 int (*device_alloc_chan_resources)(struct dma_chan *chan);
Chris Leechc13c8262006-05-23 17:18:44 -0700283 void (*device_free_chan_resources)(struct dma_chan *chan);
Dan Williams7405f742007-01-02 11:10:43 -0700284
285 struct dma_async_tx_descriptor *(*device_prep_dma_memcpy)(
Dan Williams00367312008-02-02 19:49:57 -0700286 struct dma_chan *chan, dma_addr_t dest, dma_addr_t src,
Dan Williamsd4c56f92008-02-02 19:49:58 -0700287 size_t len, unsigned long flags);
Dan Williams7405f742007-01-02 11:10:43 -0700288 struct dma_async_tx_descriptor *(*device_prep_dma_xor)(
Dan Williams00367312008-02-02 19:49:57 -0700289 struct dma_chan *chan, dma_addr_t dest, dma_addr_t *src,
Dan Williamsd4c56f92008-02-02 19:49:58 -0700290 unsigned int src_cnt, size_t len, unsigned long flags);
Dan Williams099f53c2009-04-08 14:28:37 -0700291 struct dma_async_tx_descriptor *(*device_prep_dma_xor_val)(
Dan Williams00367312008-02-02 19:49:57 -0700292 struct dma_chan *chan, dma_addr_t *src, unsigned int src_cnt,
Dan Williamsad283ea2009-08-29 19:09:26 -0700293 size_t len, enum sum_check_flags *result, unsigned long flags);
Dan Williamsb2f46fd2009-07-14 12:20:36 -0700294 struct dma_async_tx_descriptor *(*device_prep_dma_pq)(
295 struct dma_chan *chan, dma_addr_t *dst, dma_addr_t *src,
296 unsigned int src_cnt, const unsigned char *scf,
297 size_t len, unsigned long flags);
298 struct dma_async_tx_descriptor *(*device_prep_dma_pq_val)(
299 struct dma_chan *chan, dma_addr_t *pq, dma_addr_t *src,
300 unsigned int src_cnt, const unsigned char *scf, size_t len,
301 enum sum_check_flags *pqres, unsigned long flags);
Dan Williams7405f742007-01-02 11:10:43 -0700302 struct dma_async_tx_descriptor *(*device_prep_dma_memset)(
Dan Williams00367312008-02-02 19:49:57 -0700303 struct dma_chan *chan, dma_addr_t dest, int value, size_t len,
Dan Williamsd4c56f92008-02-02 19:49:58 -0700304 unsigned long flags);
Dan Williams7405f742007-01-02 11:10:43 -0700305 struct dma_async_tx_descriptor *(*device_prep_dma_interrupt)(
Dan Williams636bdea2008-04-17 20:17:26 -0700306 struct dma_chan *chan, unsigned long flags);
Dan Williams7405f742007-01-02 11:10:43 -0700307
Haavard Skinnemoendc0ee6432008-07-08 11:59:35 -0700308 struct dma_async_tx_descriptor *(*device_prep_slave_sg)(
309 struct dma_chan *chan, struct scatterlist *sgl,
310 unsigned int sg_len, enum dma_data_direction direction,
311 unsigned long flags);
312 void (*device_terminate_all)(struct dma_chan *chan);
313
Dan Williams7405f742007-01-02 11:10:43 -0700314 enum dma_status (*device_is_tx_complete)(struct dma_chan *chan,
Chris Leechc13c8262006-05-23 17:18:44 -0700315 dma_cookie_t cookie, dma_cookie_t *last,
316 dma_cookie_t *used);
Dan Williams7405f742007-01-02 11:10:43 -0700317 void (*device_issue_pending)(struct dma_chan *chan);
Chris Leechc13c8262006-05-23 17:18:44 -0700318};
319
Dan Williamsb2f46fd2009-07-14 12:20:36 -0700320static inline void
321dma_set_maxpq(struct dma_device *dma, int maxpq, int has_pq_continue)
322{
323 dma->max_pq = maxpq;
324 if (has_pq_continue)
325 dma->max_pq |= DMA_HAS_PQ_CONTINUE;
326}
327
328static inline bool dmaf_continue(enum dma_ctrl_flags flags)
329{
330 return (flags & DMA_PREP_CONTINUE) == DMA_PREP_CONTINUE;
331}
332
333static inline bool dmaf_p_disabled_continue(enum dma_ctrl_flags flags)
334{
335 enum dma_ctrl_flags mask = DMA_PREP_CONTINUE | DMA_PREP_PQ_DISABLE_P;
336
337 return (flags & mask) == mask;
338}
339
340static inline bool dma_dev_has_pq_continue(struct dma_device *dma)
341{
342 return (dma->max_pq & DMA_HAS_PQ_CONTINUE) == DMA_HAS_PQ_CONTINUE;
343}
344
345static unsigned short dma_dev_to_maxpq(struct dma_device *dma)
346{
347 return dma->max_pq & ~DMA_HAS_PQ_CONTINUE;
348}
349
350/* dma_maxpq - reduce maxpq in the face of continued operations
351 * @dma - dma device with PQ capability
352 * @flags - to check if DMA_PREP_CONTINUE and DMA_PREP_PQ_DISABLE_P are set
353 *
354 * When an engine does not support native continuation we need 3 extra
355 * source slots to reuse P and Q with the following coefficients:
356 * 1/ {00} * P : remove P from Q', but use it as a source for P'
357 * 2/ {01} * Q : use Q to continue Q' calculation
358 * 3/ {00} * Q : subtract Q from P' to cancel (2)
359 *
360 * In the case where P is disabled we only need 1 extra source:
361 * 1/ {01} * Q : use Q to continue Q' calculation
362 */
363static inline int dma_maxpq(struct dma_device *dma, enum dma_ctrl_flags flags)
364{
365 if (dma_dev_has_pq_continue(dma) || !dmaf_continue(flags))
366 return dma_dev_to_maxpq(dma);
367 else if (dmaf_p_disabled_continue(flags))
368 return dma_dev_to_maxpq(dma) - 1;
369 else if (dmaf_continue(flags))
370 return dma_dev_to_maxpq(dma) - 3;
371 BUG();
372}
373
Chris Leechc13c8262006-05-23 17:18:44 -0700374/* --- public DMA engine API --- */
375
Dan Williams649274d2009-01-11 00:20:39 -0800376#ifdef CONFIG_DMA_ENGINE
Dan Williams209b84a2009-01-06 11:38:17 -0700377void dmaengine_get(void);
378void dmaengine_put(void);
Dan Williams649274d2009-01-11 00:20:39 -0800379#else
380static inline void dmaengine_get(void)
381{
382}
383static inline void dmaengine_put(void)
384{
385}
386#endif
387
David S. Millerb4bd07c2009-02-06 22:06:43 -0800388#ifdef CONFIG_NET_DMA
389#define net_dmaengine_get() dmaengine_get()
390#define net_dmaengine_put() dmaengine_put()
391#else
392static inline void net_dmaengine_get(void)
393{
394}
395static inline void net_dmaengine_put(void)
396{
397}
398#endif
399
Dan Williams729b5d12009-03-25 09:13:25 -0700400#ifdef CONFIG_ASYNC_TX_DMA
401#define async_dmaengine_get() dmaengine_get()
402#define async_dmaengine_put() dmaengine_put()
Dan Williams138f4c32009-09-08 17:42:51 -0700403#ifdef CONFIG_ASYNC_TX_DISABLE_CHANNEL_SWITCH
404#define async_dma_find_channel(type) dma_find_channel(DMA_ASYNC_TX)
405#else
Dan Williams729b5d12009-03-25 09:13:25 -0700406#define async_dma_find_channel(type) dma_find_channel(type)
Dan Williams138f4c32009-09-08 17:42:51 -0700407#endif /* CONFIG_ASYNC_TX_DISABLE_CHANNEL_SWITCH */
Dan Williams729b5d12009-03-25 09:13:25 -0700408#else
409static inline void async_dmaengine_get(void)
410{
411}
412static inline void async_dmaengine_put(void)
413{
414}
415static inline struct dma_chan *
416async_dma_find_channel(enum dma_transaction_type type)
417{
418 return NULL;
419}
Dan Williams138f4c32009-09-08 17:42:51 -0700420#endif /* CONFIG_ASYNC_TX_DMA */
Dan Williams729b5d12009-03-25 09:13:25 -0700421
Dan Williams7405f742007-01-02 11:10:43 -0700422dma_cookie_t dma_async_memcpy_buf_to_buf(struct dma_chan *chan,
423 void *dest, void *src, size_t len);
424dma_cookie_t dma_async_memcpy_buf_to_pg(struct dma_chan *chan,
425 struct page *page, unsigned int offset, void *kdata, size_t len);
426dma_cookie_t dma_async_memcpy_pg_to_pg(struct dma_chan *chan,
Chris Leechc13c8262006-05-23 17:18:44 -0700427 struct page *dest_pg, unsigned int dest_off, struct page *src_pg,
Dan Williams7405f742007-01-02 11:10:43 -0700428 unsigned int src_off, size_t len);
429void dma_async_tx_descriptor_init(struct dma_async_tx_descriptor *tx,
430 struct dma_chan *chan);
Chris Leechc13c8262006-05-23 17:18:44 -0700431
Dan Williams08398752008-07-17 17:59:56 -0700432static inline void async_tx_ack(struct dma_async_tx_descriptor *tx)
Dan Williams7405f742007-01-02 11:10:43 -0700433{
Dan Williams636bdea2008-04-17 20:17:26 -0700434 tx->flags |= DMA_CTRL_ACK;
435}
436
Guennadi Liakhovetskief560682009-01-19 15:36:21 -0700437static inline void async_tx_clear_ack(struct dma_async_tx_descriptor *tx)
438{
439 tx->flags &= ~DMA_CTRL_ACK;
440}
441
Dan Williams08398752008-07-17 17:59:56 -0700442static inline bool async_tx_test_ack(struct dma_async_tx_descriptor *tx)
Dan Williams636bdea2008-04-17 20:17:26 -0700443{
Dan Williams08398752008-07-17 17:59:56 -0700444 return (tx->flags & DMA_CTRL_ACK) == DMA_CTRL_ACK;
Chris Leechc13c8262006-05-23 17:18:44 -0700445}
446
Dan Williams7405f742007-01-02 11:10:43 -0700447#define first_dma_cap(mask) __first_dma_cap(&(mask))
448static inline int __first_dma_cap(const dma_cap_mask_t *srcp)
449{
450 return min_t(int, DMA_TX_TYPE_END,
451 find_first_bit(srcp->bits, DMA_TX_TYPE_END));
452}
453
454#define next_dma_cap(n, mask) __next_dma_cap((n), &(mask))
455static inline int __next_dma_cap(int n, const dma_cap_mask_t *srcp)
456{
457 return min_t(int, DMA_TX_TYPE_END,
458 find_next_bit(srcp->bits, DMA_TX_TYPE_END, n+1));
459}
460
461#define dma_cap_set(tx, mask) __dma_cap_set((tx), &(mask))
462static inline void
463__dma_cap_set(enum dma_transaction_type tx_type, dma_cap_mask_t *dstp)
464{
465 set_bit(tx_type, dstp->bits);
466}
467
Atsushi Nemoto0f571512009-03-06 20:07:14 +0900468#define dma_cap_clear(tx, mask) __dma_cap_clear((tx), &(mask))
469static inline void
470__dma_cap_clear(enum dma_transaction_type tx_type, dma_cap_mask_t *dstp)
471{
472 clear_bit(tx_type, dstp->bits);
473}
474
Dan Williams33df8ca2009-01-06 11:38:15 -0700475#define dma_cap_zero(mask) __dma_cap_zero(&(mask))
476static inline void __dma_cap_zero(dma_cap_mask_t *dstp)
477{
478 bitmap_zero(dstp->bits, DMA_TX_TYPE_END);
479}
480
Dan Williams7405f742007-01-02 11:10:43 -0700481#define dma_has_cap(tx, mask) __dma_has_cap((tx), &(mask))
482static inline int
483__dma_has_cap(enum dma_transaction_type tx_type, dma_cap_mask_t *srcp)
484{
485 return test_bit(tx_type, srcp->bits);
486}
487
488#define for_each_dma_cap_mask(cap, mask) \
489 for ((cap) = first_dma_cap(mask); \
490 (cap) < DMA_TX_TYPE_END; \
491 (cap) = next_dma_cap((cap), (mask)))
492
Chris Leechc13c8262006-05-23 17:18:44 -0700493/**
Dan Williams7405f742007-01-02 11:10:43 -0700494 * dma_async_issue_pending - flush pending transactions to HW
Randy Dunlapfe4ada22006-07-03 19:44:51 -0700495 * @chan: target DMA channel
Chris Leechc13c8262006-05-23 17:18:44 -0700496 *
497 * This allows drivers to push copies to HW in batches,
498 * reducing MMIO writes where possible.
499 */
Dan Williams7405f742007-01-02 11:10:43 -0700500static inline void dma_async_issue_pending(struct dma_chan *chan)
Chris Leechc13c8262006-05-23 17:18:44 -0700501{
Dan Williamsec8670f2008-03-01 07:51:29 -0700502 chan->device->device_issue_pending(chan);
Chris Leechc13c8262006-05-23 17:18:44 -0700503}
504
Dan Williams7405f742007-01-02 11:10:43 -0700505#define dma_async_memcpy_issue_pending(chan) dma_async_issue_pending(chan)
506
Chris Leechc13c8262006-05-23 17:18:44 -0700507/**
Dan Williams7405f742007-01-02 11:10:43 -0700508 * dma_async_is_tx_complete - poll for transaction completion
Chris Leechc13c8262006-05-23 17:18:44 -0700509 * @chan: DMA channel
510 * @cookie: transaction identifier to check status of
511 * @last: returns last completed cookie, can be NULL
512 * @used: returns last issued cookie, can be NULL
513 *
514 * If @last and @used are passed in, upon return they reflect the driver
515 * internal state and can be used with dma_async_is_complete() to check
516 * the status of multiple cookies without re-checking hardware state.
517 */
Dan Williams7405f742007-01-02 11:10:43 -0700518static inline enum dma_status dma_async_is_tx_complete(struct dma_chan *chan,
Chris Leechc13c8262006-05-23 17:18:44 -0700519 dma_cookie_t cookie, dma_cookie_t *last, dma_cookie_t *used)
520{
Dan Williams7405f742007-01-02 11:10:43 -0700521 return chan->device->device_is_tx_complete(chan, cookie, last, used);
Chris Leechc13c8262006-05-23 17:18:44 -0700522}
523
Dan Williams7405f742007-01-02 11:10:43 -0700524#define dma_async_memcpy_complete(chan, cookie, last, used)\
525 dma_async_is_tx_complete(chan, cookie, last, used)
526
Chris Leechc13c8262006-05-23 17:18:44 -0700527/**
528 * dma_async_is_complete - test a cookie against chan state
529 * @cookie: transaction identifier to test status of
530 * @last_complete: last know completed transaction
531 * @last_used: last cookie value handed out
532 *
533 * dma_async_is_complete() is used in dma_async_memcpy_complete()
Sebastian Siewior8a5703f2008-04-21 22:38:45 +0000534 * the test logic is separated for lightweight testing of multiple cookies
Chris Leechc13c8262006-05-23 17:18:44 -0700535 */
536static inline enum dma_status dma_async_is_complete(dma_cookie_t cookie,
537 dma_cookie_t last_complete, dma_cookie_t last_used)
538{
539 if (last_complete <= last_used) {
540 if ((cookie <= last_complete) || (cookie > last_used))
541 return DMA_SUCCESS;
542 } else {
543 if ((cookie <= last_complete) && (cookie > last_used))
544 return DMA_SUCCESS;
545 }
546 return DMA_IN_PROGRESS;
547}
548
Dan Williams7405f742007-01-02 11:10:43 -0700549enum dma_status dma_sync_wait(struct dma_chan *chan, dma_cookie_t cookie);
Dan Williams07f22112009-01-05 17:14:31 -0700550#ifdef CONFIG_DMA_ENGINE
551enum dma_status dma_wait_for_async_tx(struct dma_async_tx_descriptor *tx);
Dan Williamsc50331e2009-01-19 15:33:14 -0700552void dma_issue_pending_all(void);
Dan Williams07f22112009-01-05 17:14:31 -0700553#else
554static inline enum dma_status dma_wait_for_async_tx(struct dma_async_tx_descriptor *tx)
555{
556 return DMA_SUCCESS;
557}
Dan Williamsc50331e2009-01-19 15:33:14 -0700558static inline void dma_issue_pending_all(void)
559{
560 do { } while (0);
561}
Dan Williams07f22112009-01-05 17:14:31 -0700562#endif
Chris Leechc13c8262006-05-23 17:18:44 -0700563
564/* --- DMA device --- */
565
566int dma_async_device_register(struct dma_device *device);
567void dma_async_device_unregister(struct dma_device *device);
Dan Williams07f22112009-01-05 17:14:31 -0700568void dma_run_dependencies(struct dma_async_tx_descriptor *tx);
Dan Williamsbec08512009-01-06 11:38:14 -0700569struct dma_chan *dma_find_channel(enum dma_transaction_type tx_type);
Dan Williams59b5ec22009-01-06 11:38:15 -0700570#define dma_request_channel(mask, x, y) __dma_request_channel(&(mask), x, y)
571struct dma_chan *__dma_request_channel(dma_cap_mask_t *mask, dma_filter_fn fn, void *fn_param);
572void dma_release_channel(struct dma_chan *chan);
Chris Leechc13c8262006-05-23 17:18:44 -0700573
Chris Leechde5506e2006-05-23 17:50:37 -0700574/* --- Helper iov-locking functions --- */
575
576struct dma_page_list {
Al Virob2ddb902008-03-29 03:09:38 +0000577 char __user *base_address;
Chris Leechde5506e2006-05-23 17:50:37 -0700578 int nr_pages;
579 struct page **pages;
580};
581
582struct dma_pinned_list {
583 int nr_iovecs;
584 struct dma_page_list page_list[0];
585};
586
587struct dma_pinned_list *dma_pin_iovec_pages(struct iovec *iov, size_t len);
588void dma_unpin_iovec_pages(struct dma_pinned_list* pinned_list);
589
590dma_cookie_t dma_memcpy_to_iovec(struct dma_chan *chan, struct iovec *iov,
591 struct dma_pinned_list *pinned_list, unsigned char *kdata, size_t len);
592dma_cookie_t dma_memcpy_pg_to_iovec(struct dma_chan *chan, struct iovec *iov,
593 struct dma_pinned_list *pinned_list, struct page *page,
594 unsigned int offset, size_t len);
595
Chris Leechc13c8262006-05-23 17:18:44 -0700596#endif /* DMAENGINE_H */