dmaengine.h 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436
  1. /*
  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
  23. #include <linux/device.h>
  24. #include <linux/uio.h>
  25. #include <linux/kref.h>
  26. #include <linux/completion.h>
  27. #include <linux/rcupdate.h>
  28. #include <linux/dma-mapping.h>
  29. /**
  30. * enum dma_state - resource PNP/power management state
  31. * @DMA_RESOURCE_SUSPEND: DMA device going into low power state
  32. * @DMA_RESOURCE_RESUME: DMA device returning to full power
  33. * @DMA_RESOURCE_AVAILABLE: DMA device available to the system
  34. * @DMA_RESOURCE_REMOVED: DMA device removed from the system
  35. */
  36. enum dma_state {
  37. DMA_RESOURCE_SUSPEND,
  38. DMA_RESOURCE_RESUME,
  39. DMA_RESOURCE_AVAILABLE,
  40. DMA_RESOURCE_REMOVED,
  41. };
  42. /**
  43. * enum dma_state_client - state of the channel in the client
  44. * @DMA_ACK: client would like to use, or was using this channel
  45. * @DMA_DUP: client has already seen this channel, or is not using this channel
  46. * @DMA_NAK: client does not want to see any more channels
  47. */
  48. enum dma_state_client {
  49. DMA_ACK,
  50. DMA_DUP,
  51. DMA_NAK,
  52. };
  53. /**
  54. * typedef dma_cookie_t - an opaque DMA cookie
  55. *
  56. * if dma_cookie_t is >0 it's a DMA request cookie, <0 it's an error code
  57. */
  58. typedef s32 dma_cookie_t;
  59. #define dma_submit_error(cookie) ((cookie) < 0 ? 1 : 0)
  60. /**
  61. * enum dma_status - DMA transaction status
  62. * @DMA_SUCCESS: transaction completed successfully
  63. * @DMA_IN_PROGRESS: transaction not yet processed
  64. * @DMA_ERROR: transaction failed
  65. */
  66. enum dma_status {
  67. DMA_SUCCESS,
  68. DMA_IN_PROGRESS,
  69. DMA_ERROR,
  70. };
  71. /**
  72. * enum dma_transaction_type - DMA transaction types/indexes
  73. */
  74. enum dma_transaction_type {
  75. DMA_MEMCPY,
  76. DMA_XOR,
  77. DMA_PQ_XOR,
  78. DMA_DUAL_XOR,
  79. DMA_PQ_UPDATE,
  80. DMA_ZERO_SUM,
  81. DMA_PQ_ZERO_SUM,
  82. DMA_MEMSET,
  83. DMA_MEMCPY_CRC32C,
  84. DMA_INTERRUPT,
  85. };
  86. /* last transaction type for creation of the capabilities mask */
  87. #define DMA_TX_TYPE_END (DMA_INTERRUPT + 1)
  88. /**
  89. * dma_cap_mask_t - capabilities bitmap modeled after cpumask_t.
  90. * See linux/cpumask.h
  91. */
  92. typedef struct { DECLARE_BITMAP(bits, DMA_TX_TYPE_END); } dma_cap_mask_t;
  93. /**
  94. * struct dma_chan_percpu - the per-CPU part of struct dma_chan
  95. * @refcount: local_t used for open-coded "bigref" counting
  96. * @memcpy_count: transaction counter
  97. * @bytes_transferred: byte counter
  98. */
  99. struct dma_chan_percpu {
  100. local_t refcount;
  101. /* stats */
  102. unsigned long memcpy_count;
  103. unsigned long bytes_transferred;
  104. };
  105. /**
  106. * struct dma_chan - devices supply DMA channels, clients use them
  107. * @device: ptr to the dma device who supplies this channel, always !%NULL
  108. * @cookie: last cookie value returned to client
  109. * @chan_id: channel ID for sysfs
  110. * @class_dev: class device for sysfs
  111. * @refcount: kref, used in "bigref" slow-mode
  112. * @slow_ref: indicates that the DMA channel is free
  113. * @rcu: the DMA channel's RCU head
  114. * @device_node: used to add this to the device chan list
  115. * @local: per-cpu pointer to a struct dma_chan_percpu
  116. */
  117. struct dma_chan {
  118. struct dma_device *device;
  119. dma_cookie_t cookie;
  120. /* sysfs */
  121. int chan_id;
  122. struct device dev;
  123. struct kref refcount;
  124. int slow_ref;
  125. struct rcu_head rcu;
  126. struct list_head device_node;
  127. struct dma_chan_percpu *local;
  128. };
  129. #define to_dma_chan(p) container_of(p, struct dma_chan, dev)
  130. void dma_chan_cleanup(struct kref *kref);
  131. static inline void dma_chan_get(struct dma_chan *chan)
  132. {
  133. if (unlikely(chan->slow_ref))
  134. kref_get(&chan->refcount);
  135. else {
  136. local_inc(&(per_cpu_ptr(chan->local, get_cpu())->refcount));
  137. put_cpu();
  138. }
  139. }
  140. static inline void dma_chan_put(struct dma_chan *chan)
  141. {
  142. if (unlikely(chan->slow_ref))
  143. kref_put(&chan->refcount, dma_chan_cleanup);
  144. else {
  145. local_dec(&(per_cpu_ptr(chan->local, get_cpu())->refcount));
  146. put_cpu();
  147. }
  148. }
  149. /*
  150. * typedef dma_event_callback - function pointer to a DMA event callback
  151. * For each channel added to the system this routine is called for each client.
  152. * If the client would like to use the channel it returns '1' to signal (ack)
  153. * the dmaengine core to take out a reference on the channel and its
  154. * corresponding device. A client must not 'ack' an available channel more
  155. * than once. When a channel is removed all clients are notified. If a client
  156. * is using the channel it must 'ack' the removal. A client must not 'ack' a
  157. * removed channel more than once.
  158. * @client - 'this' pointer for the client context
  159. * @chan - channel to be acted upon
  160. * @state - available or removed
  161. */
  162. struct dma_client;
  163. typedef enum dma_state_client (*dma_event_callback) (struct dma_client *client,
  164. struct dma_chan *chan, enum dma_state state);
  165. /**
  166. * struct dma_client - info on the entity making use of DMA services
  167. * @event_callback: func ptr to call when something happens
  168. * @cap_mask: only return channels that satisfy the requested capabilities
  169. * a value of zero corresponds to any capability
  170. * @global_node: list_head for global dma_client_list
  171. */
  172. struct dma_client {
  173. dma_event_callback event_callback;
  174. dma_cap_mask_t cap_mask;
  175. struct list_head global_node;
  176. };
  177. typedef void (*dma_async_tx_callback)(void *dma_async_param);
  178. /**
  179. * struct dma_async_tx_descriptor - async transaction descriptor
  180. * ---dma generic offload fields---
  181. * @cookie: tracking cookie for this transaction, set to -EBUSY if
  182. * this tx is sitting on a dependency list
  183. * @ack: the descriptor can not be reused until the client acknowledges
  184. * receipt, i.e. has has a chance to establish any dependency chains
  185. * @phys: physical address of the descriptor
  186. * @tx_list: driver common field for operations that require multiple
  187. * descriptors
  188. * @chan: target channel for this operation
  189. * @tx_submit: set the prepared descriptor(s) to be executed by the engine
  190. * @callback: routine to call after this operation is complete
  191. * @callback_param: general parameter to pass to the callback routine
  192. * ---async_tx api specific fields---
  193. * @depend_list: at completion this list of transactions are submitted
  194. * @depend_node: allow this transaction to be executed after another
  195. * transaction has completed, possibly on another channel
  196. * @parent: pointer to the next level up in the dependency chain
  197. * @lock: protect the dependency list
  198. */
  199. struct dma_async_tx_descriptor {
  200. dma_cookie_t cookie;
  201. int ack;
  202. dma_addr_t phys;
  203. struct list_head tx_list;
  204. struct dma_chan *chan;
  205. dma_cookie_t (*tx_submit)(struct dma_async_tx_descriptor *tx);
  206. dma_async_tx_callback callback;
  207. void *callback_param;
  208. struct list_head depend_list;
  209. struct list_head depend_node;
  210. struct dma_async_tx_descriptor *parent;
  211. spinlock_t lock;
  212. };
  213. /**
  214. * struct dma_device - info on the entity supplying DMA services
  215. * @chancnt: how many DMA channels are supported
  216. * @channels: the list of struct dma_chan
  217. * @global_node: list_head for global dma_device_list
  218. * @cap_mask: one or more dma_capability flags
  219. * @max_xor: maximum number of xor sources, 0 if no capability
  220. * @refcount: reference count
  221. * @done: IO completion struct
  222. * @dev_id: unique device ID
  223. * @dev: struct device reference for dma mapping api
  224. * @device_alloc_chan_resources: allocate resources and return the
  225. * number of allocated descriptors
  226. * @device_free_chan_resources: release DMA channel's resources
  227. * @device_prep_dma_memcpy: prepares a memcpy operation
  228. * @device_prep_dma_xor: prepares a xor operation
  229. * @device_prep_dma_zero_sum: prepares a zero_sum operation
  230. * @device_prep_dma_memset: prepares a memset operation
  231. * @device_prep_dma_interrupt: prepares an end of chain interrupt operation
  232. * @device_dependency_added: async_tx notifies the channel about new deps
  233. * @device_issue_pending: push pending transactions to hardware
  234. */
  235. struct dma_device {
  236. unsigned int chancnt;
  237. struct list_head channels;
  238. struct list_head global_node;
  239. dma_cap_mask_t cap_mask;
  240. int max_xor;
  241. struct kref refcount;
  242. struct completion done;
  243. int dev_id;
  244. struct device *dev;
  245. int (*device_alloc_chan_resources)(struct dma_chan *chan);
  246. void (*device_free_chan_resources)(struct dma_chan *chan);
  247. struct dma_async_tx_descriptor *(*device_prep_dma_memcpy)(
  248. struct dma_chan *chan, dma_addr_t dest, dma_addr_t src,
  249. size_t len, int int_en);
  250. struct dma_async_tx_descriptor *(*device_prep_dma_xor)(
  251. struct dma_chan *chan, dma_addr_t dest, dma_addr_t *src,
  252. unsigned int src_cnt, size_t len, int int_en);
  253. struct dma_async_tx_descriptor *(*device_prep_dma_zero_sum)(
  254. struct dma_chan *chan, dma_addr_t *src, unsigned int src_cnt,
  255. size_t len, u32 *result, int int_en);
  256. struct dma_async_tx_descriptor *(*device_prep_dma_memset)(
  257. struct dma_chan *chan, dma_addr_t dest, int value, size_t len,
  258. int int_en);
  259. struct dma_async_tx_descriptor *(*device_prep_dma_interrupt)(
  260. struct dma_chan *chan);
  261. void (*device_dependency_added)(struct dma_chan *chan);
  262. enum dma_status (*device_is_tx_complete)(struct dma_chan *chan,
  263. dma_cookie_t cookie, dma_cookie_t *last,
  264. dma_cookie_t *used);
  265. void (*device_issue_pending)(struct dma_chan *chan);
  266. };
  267. /* --- public DMA engine API --- */
  268. void dma_async_client_register(struct dma_client *client);
  269. void dma_async_client_unregister(struct dma_client *client);
  270. void dma_async_client_chan_request(struct dma_client *client);
  271. dma_cookie_t dma_async_memcpy_buf_to_buf(struct dma_chan *chan,
  272. void *dest, void *src, size_t len);
  273. dma_cookie_t dma_async_memcpy_buf_to_pg(struct dma_chan *chan,
  274. struct page *page, unsigned int offset, void *kdata, size_t len);
  275. dma_cookie_t dma_async_memcpy_pg_to_pg(struct dma_chan *chan,
  276. struct page *dest_pg, unsigned int dest_off, struct page *src_pg,
  277. unsigned int src_off, size_t len);
  278. void dma_async_tx_descriptor_init(struct dma_async_tx_descriptor *tx,
  279. struct dma_chan *chan);
  280. static inline void
  281. async_tx_ack(struct dma_async_tx_descriptor *tx)
  282. {
  283. tx->ack = 1;
  284. }
  285. #define first_dma_cap(mask) __first_dma_cap(&(mask))
  286. static inline int __first_dma_cap(const dma_cap_mask_t *srcp)
  287. {
  288. return min_t(int, DMA_TX_TYPE_END,
  289. find_first_bit(srcp->bits, DMA_TX_TYPE_END));
  290. }
  291. #define next_dma_cap(n, mask) __next_dma_cap((n), &(mask))
  292. static inline int __next_dma_cap(int n, const dma_cap_mask_t *srcp)
  293. {
  294. return min_t(int, DMA_TX_TYPE_END,
  295. find_next_bit(srcp->bits, DMA_TX_TYPE_END, n+1));
  296. }
  297. #define dma_cap_set(tx, mask) __dma_cap_set((tx), &(mask))
  298. static inline void
  299. __dma_cap_set(enum dma_transaction_type tx_type, dma_cap_mask_t *dstp)
  300. {
  301. set_bit(tx_type, dstp->bits);
  302. }
  303. #define dma_has_cap(tx, mask) __dma_has_cap((tx), &(mask))
  304. static inline int
  305. __dma_has_cap(enum dma_transaction_type tx_type, dma_cap_mask_t *srcp)
  306. {
  307. return test_bit(tx_type, srcp->bits);
  308. }
  309. #define for_each_dma_cap_mask(cap, mask) \
  310. for ((cap) = first_dma_cap(mask); \
  311. (cap) < DMA_TX_TYPE_END; \
  312. (cap) = next_dma_cap((cap), (mask)))
  313. /**
  314. * dma_async_issue_pending - flush pending transactions to HW
  315. * @chan: target DMA channel
  316. *
  317. * This allows drivers to push copies to HW in batches,
  318. * reducing MMIO writes where possible.
  319. */
  320. static inline void dma_async_issue_pending(struct dma_chan *chan)
  321. {
  322. return chan->device->device_issue_pending(chan);
  323. }
  324. #define dma_async_memcpy_issue_pending(chan) dma_async_issue_pending(chan)
  325. /**
  326. * dma_async_is_tx_complete - poll for transaction completion
  327. * @chan: DMA channel
  328. * @cookie: transaction identifier to check status of
  329. * @last: returns last completed cookie, can be NULL
  330. * @used: returns last issued cookie, can be NULL
  331. *
  332. * If @last and @used are passed in, upon return they reflect the driver
  333. * internal state and can be used with dma_async_is_complete() to check
  334. * the status of multiple cookies without re-checking hardware state.
  335. */
  336. static inline enum dma_status dma_async_is_tx_complete(struct dma_chan *chan,
  337. dma_cookie_t cookie, dma_cookie_t *last, dma_cookie_t *used)
  338. {
  339. return chan->device->device_is_tx_complete(chan, cookie, last, used);
  340. }
  341. #define dma_async_memcpy_complete(chan, cookie, last, used)\
  342. dma_async_is_tx_complete(chan, cookie, last, used)
  343. /**
  344. * dma_async_is_complete - test a cookie against chan state
  345. * @cookie: transaction identifier to test status of
  346. * @last_complete: last know completed transaction
  347. * @last_used: last cookie value handed out
  348. *
  349. * dma_async_is_complete() is used in dma_async_memcpy_complete()
  350. * the test logic is seperated for lightweight testing of multiple cookies
  351. */
  352. static inline enum dma_status dma_async_is_complete(dma_cookie_t cookie,
  353. dma_cookie_t last_complete, dma_cookie_t last_used)
  354. {
  355. if (last_complete <= last_used) {
  356. if ((cookie <= last_complete) || (cookie > last_used))
  357. return DMA_SUCCESS;
  358. } else {
  359. if ((cookie <= last_complete) && (cookie > last_used))
  360. return DMA_SUCCESS;
  361. }
  362. return DMA_IN_PROGRESS;
  363. }
  364. enum dma_status dma_sync_wait(struct dma_chan *chan, dma_cookie_t cookie);
  365. /* --- DMA device --- */
  366. int dma_async_device_register(struct dma_device *device);
  367. void dma_async_device_unregister(struct dma_device *device);
  368. /* --- Helper iov-locking functions --- */
  369. struct dma_page_list {
  370. char *base_address;
  371. int nr_pages;
  372. struct page **pages;
  373. };
  374. struct dma_pinned_list {
  375. int nr_iovecs;
  376. struct dma_page_list page_list[0];
  377. };
  378. struct dma_pinned_list *dma_pin_iovec_pages(struct iovec *iov, size_t len);
  379. void dma_unpin_iovec_pages(struct dma_pinned_list* pinned_list);
  380. dma_cookie_t dma_memcpy_to_iovec(struct dma_chan *chan, struct iovec *iov,
  381. struct dma_pinned_list *pinned_list, unsigned char *kdata, size_t len);
  382. dma_cookie_t dma_memcpy_pg_to_iovec(struct dma_chan *chan, struct iovec *iov,
  383. struct dma_pinned_list *pinned_list, struct page *page,
  384. unsigned int offset, size_t len);
  385. #endif /* DMAENGINE_H */