timb_dma.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861
  1. /*
  2. * timb_dma.c timberdale FPGA DMA driver
  3. * Copyright (c) 2010 Intel Corporation
  4. *
  5. * This program is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License version 2 as
  7. * published by the Free Software Foundation.
  8. *
  9. * This program is distributed in the hope that it will be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. * GNU General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU General Public License
  15. * along with this program; if not, write to the Free Software
  16. * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  17. */
  18. /* Supports:
  19. * Timberdale FPGA DMA engine
  20. */
  21. #include <linux/dmaengine.h>
  22. #include <linux/dma-mapping.h>
  23. #include <linux/init.h>
  24. #include <linux/interrupt.h>
  25. #include <linux/io.h>
  26. #include <linux/module.h>
  27. #include <linux/platform_device.h>
  28. #include <linux/mfd/core.h>
  29. #include <linux/slab.h>
  30. #include <linux/timb_dma.h>
  31. #define DRIVER_NAME "timb-dma"
  32. /* Global DMA registers */
  33. #define TIMBDMA_ACR 0x34
  34. #define TIMBDMA_32BIT_ADDR 0x01
  35. #define TIMBDMA_ISR 0x080000
  36. #define TIMBDMA_IPR 0x080004
  37. #define TIMBDMA_IER 0x080008
  38. /* Channel specific registers */
  39. /* RX instances base addresses are 0x00, 0x40, 0x80 ...
  40. * TX instances base addresses are 0x18, 0x58, 0x98 ...
  41. */
  42. #define TIMBDMA_INSTANCE_OFFSET 0x40
  43. #define TIMBDMA_INSTANCE_TX_OFFSET 0x18
  44. /* RX registers, relative the instance base */
  45. #define TIMBDMA_OFFS_RX_DHAR 0x00
  46. #define TIMBDMA_OFFS_RX_DLAR 0x04
  47. #define TIMBDMA_OFFS_RX_LR 0x0C
  48. #define TIMBDMA_OFFS_RX_BLR 0x10
  49. #define TIMBDMA_OFFS_RX_ER 0x14
  50. #define TIMBDMA_RX_EN 0x01
  51. /* bytes per Row, video specific register
  52. * which is placed after the TX registers...
  53. */
  54. #define TIMBDMA_OFFS_RX_BPRR 0x30
  55. /* TX registers, relative the instance base */
  56. #define TIMBDMA_OFFS_TX_DHAR 0x00
  57. #define TIMBDMA_OFFS_TX_DLAR 0x04
  58. #define TIMBDMA_OFFS_TX_BLR 0x0C
  59. #define TIMBDMA_OFFS_TX_LR 0x14
  60. #define TIMB_DMA_DESC_SIZE 8
  61. struct timb_dma_desc {
  62. struct list_head desc_node;
  63. struct dma_async_tx_descriptor txd;
  64. u8 *desc_list;
  65. unsigned int desc_list_len;
  66. bool interrupt;
  67. };
  68. struct timb_dma_chan {
  69. struct dma_chan chan;
  70. void __iomem *membase;
  71. spinlock_t lock; /* Used to protect data structures,
  72. especially the lists and descriptors,
  73. from races between the tasklet and calls
  74. from above */
  75. dma_cookie_t last_completed_cookie;
  76. bool ongoing;
  77. struct list_head active_list;
  78. struct list_head queue;
  79. struct list_head free_list;
  80. unsigned int bytes_per_line;
  81. enum dma_data_direction direction;
  82. unsigned int descs; /* Descriptors to allocate */
  83. unsigned int desc_elems; /* number of elems per descriptor */
  84. };
  85. struct timb_dma {
  86. struct dma_device dma;
  87. void __iomem *membase;
  88. struct tasklet_struct tasklet;
  89. struct timb_dma_chan channels[0];
  90. };
  91. static struct device *chan2dev(struct dma_chan *chan)
  92. {
  93. return &chan->dev->device;
  94. }
  95. static struct device *chan2dmadev(struct dma_chan *chan)
  96. {
  97. return chan2dev(chan)->parent->parent;
  98. }
  99. static struct timb_dma *tdchantotd(struct timb_dma_chan *td_chan)
  100. {
  101. int id = td_chan->chan.chan_id;
  102. return (struct timb_dma *)((u8 *)td_chan -
  103. id * sizeof(struct timb_dma_chan) - sizeof(struct timb_dma));
  104. }
  105. /* Must be called with the spinlock held */
  106. static void __td_enable_chan_irq(struct timb_dma_chan *td_chan)
  107. {
  108. int id = td_chan->chan.chan_id;
  109. struct timb_dma *td = tdchantotd(td_chan);
  110. u32 ier;
  111. /* enable interrupt for this channel */
  112. ier = ioread32(td->membase + TIMBDMA_IER);
  113. ier |= 1 << id;
  114. dev_dbg(chan2dev(&td_chan->chan), "Enabling irq: %d, IER: 0x%x\n", id,
  115. ier);
  116. iowrite32(ier, td->membase + TIMBDMA_IER);
  117. }
  118. /* Should be called with the spinlock held */
  119. static bool __td_dma_done_ack(struct timb_dma_chan *td_chan)
  120. {
  121. int id = td_chan->chan.chan_id;
  122. struct timb_dma *td = (struct timb_dma *)((u8 *)td_chan -
  123. id * sizeof(struct timb_dma_chan) - sizeof(struct timb_dma));
  124. u32 isr;
  125. bool done = false;
  126. dev_dbg(chan2dev(&td_chan->chan), "Checking irq: %d, td: %p\n", id, td);
  127. isr = ioread32(td->membase + TIMBDMA_ISR) & (1 << id);
  128. if (isr) {
  129. iowrite32(isr, td->membase + TIMBDMA_ISR);
  130. done = true;
  131. }
  132. return done;
  133. }
  134. static void __td_unmap_desc(struct timb_dma_chan *td_chan, const u8 *dma_desc,
  135. bool single)
  136. {
  137. dma_addr_t addr;
  138. int len;
  139. addr = (dma_desc[7] << 24) | (dma_desc[6] << 16) | (dma_desc[5] << 8) |
  140. dma_desc[4];
  141. len = (dma_desc[3] << 8) | dma_desc[2];
  142. if (single)
  143. dma_unmap_single(chan2dev(&td_chan->chan), addr, len,
  144. td_chan->direction);
  145. else
  146. dma_unmap_page(chan2dev(&td_chan->chan), addr, len,
  147. td_chan->direction);
  148. }
  149. static void __td_unmap_descs(struct timb_dma_desc *td_desc, bool single)
  150. {
  151. struct timb_dma_chan *td_chan = container_of(td_desc->txd.chan,
  152. struct timb_dma_chan, chan);
  153. u8 *descs;
  154. for (descs = td_desc->desc_list; ; descs += TIMB_DMA_DESC_SIZE) {
  155. __td_unmap_desc(td_chan, descs, single);
  156. if (descs[0] & 0x02)
  157. break;
  158. }
  159. }
  160. static int td_fill_desc(struct timb_dma_chan *td_chan, u8 *dma_desc,
  161. struct scatterlist *sg, bool last)
  162. {
  163. if (sg_dma_len(sg) > USHRT_MAX) {
  164. dev_err(chan2dev(&td_chan->chan), "Too big sg element\n");
  165. return -EINVAL;
  166. }
  167. /* length must be word aligned */
  168. if (sg_dma_len(sg) % sizeof(u32)) {
  169. dev_err(chan2dev(&td_chan->chan), "Incorrect length: %d\n",
  170. sg_dma_len(sg));
  171. return -EINVAL;
  172. }
  173. dev_dbg(chan2dev(&td_chan->chan), "desc: %p, addr: 0x%llx\n",
  174. dma_desc, (unsigned long long)sg_dma_address(sg));
  175. dma_desc[7] = (sg_dma_address(sg) >> 24) & 0xff;
  176. dma_desc[6] = (sg_dma_address(sg) >> 16) & 0xff;
  177. dma_desc[5] = (sg_dma_address(sg) >> 8) & 0xff;
  178. dma_desc[4] = (sg_dma_address(sg) >> 0) & 0xff;
  179. dma_desc[3] = (sg_dma_len(sg) >> 8) & 0xff;
  180. dma_desc[2] = (sg_dma_len(sg) >> 0) & 0xff;
  181. dma_desc[1] = 0x00;
  182. dma_desc[0] = 0x21 | (last ? 0x02 : 0); /* tran, valid */
  183. return 0;
  184. }
  185. /* Must be called with the spinlock held */
  186. static void __td_start_dma(struct timb_dma_chan *td_chan)
  187. {
  188. struct timb_dma_desc *td_desc;
  189. if (td_chan->ongoing) {
  190. dev_err(chan2dev(&td_chan->chan),
  191. "Transfer already ongoing\n");
  192. return;
  193. }
  194. td_desc = list_entry(td_chan->active_list.next, struct timb_dma_desc,
  195. desc_node);
  196. dev_dbg(chan2dev(&td_chan->chan),
  197. "td_chan: %p, chan: %d, membase: %p\n",
  198. td_chan, td_chan->chan.chan_id, td_chan->membase);
  199. if (td_chan->direction == DMA_FROM_DEVICE) {
  200. /* descriptor address */
  201. iowrite32(0, td_chan->membase + TIMBDMA_OFFS_RX_DHAR);
  202. iowrite32(td_desc->txd.phys, td_chan->membase +
  203. TIMBDMA_OFFS_RX_DLAR);
  204. /* Bytes per line */
  205. iowrite32(td_chan->bytes_per_line, td_chan->membase +
  206. TIMBDMA_OFFS_RX_BPRR);
  207. /* enable RX */
  208. iowrite32(TIMBDMA_RX_EN, td_chan->membase + TIMBDMA_OFFS_RX_ER);
  209. } else {
  210. /* address high */
  211. iowrite32(0, td_chan->membase + TIMBDMA_OFFS_TX_DHAR);
  212. iowrite32(td_desc->txd.phys, td_chan->membase +
  213. TIMBDMA_OFFS_TX_DLAR);
  214. }
  215. td_chan->ongoing = true;
  216. if (td_desc->interrupt)
  217. __td_enable_chan_irq(td_chan);
  218. }
  219. static void __td_finish(struct timb_dma_chan *td_chan)
  220. {
  221. dma_async_tx_callback callback;
  222. void *param;
  223. struct dma_async_tx_descriptor *txd;
  224. struct timb_dma_desc *td_desc;
  225. /* can happen if the descriptor is canceled */
  226. if (list_empty(&td_chan->active_list))
  227. return;
  228. td_desc = list_entry(td_chan->active_list.next, struct timb_dma_desc,
  229. desc_node);
  230. txd = &td_desc->txd;
  231. dev_dbg(chan2dev(&td_chan->chan), "descriptor %u complete\n",
  232. txd->cookie);
  233. /* make sure to stop the transfer */
  234. if (td_chan->direction == DMA_FROM_DEVICE)
  235. iowrite32(0, td_chan->membase + TIMBDMA_OFFS_RX_ER);
  236. /* Currently no support for stopping DMA transfers
  237. else
  238. iowrite32(0, td_chan->membase + TIMBDMA_OFFS_TX_DLAR);
  239. */
  240. td_chan->last_completed_cookie = txd->cookie;
  241. td_chan->ongoing = false;
  242. callback = txd->callback;
  243. param = txd->callback_param;
  244. list_move(&td_desc->desc_node, &td_chan->free_list);
  245. if (!(txd->flags & DMA_COMPL_SKIP_SRC_UNMAP))
  246. __td_unmap_descs(td_desc,
  247. txd->flags & DMA_COMPL_SRC_UNMAP_SINGLE);
  248. /*
  249. * The API requires that no submissions are done from a
  250. * callback, so we don't need to drop the lock here
  251. */
  252. if (callback)
  253. callback(param);
  254. }
  255. static u32 __td_ier_mask(struct timb_dma *td)
  256. {
  257. int i;
  258. u32 ret = 0;
  259. for (i = 0; i < td->dma.chancnt; i++) {
  260. struct timb_dma_chan *td_chan = td->channels + i;
  261. if (td_chan->ongoing) {
  262. struct timb_dma_desc *td_desc =
  263. list_entry(td_chan->active_list.next,
  264. struct timb_dma_desc, desc_node);
  265. if (td_desc->interrupt)
  266. ret |= 1 << i;
  267. }
  268. }
  269. return ret;
  270. }
  271. static void __td_start_next(struct timb_dma_chan *td_chan)
  272. {
  273. struct timb_dma_desc *td_desc;
  274. BUG_ON(list_empty(&td_chan->queue));
  275. BUG_ON(td_chan->ongoing);
  276. td_desc = list_entry(td_chan->queue.next, struct timb_dma_desc,
  277. desc_node);
  278. dev_dbg(chan2dev(&td_chan->chan), "%s: started %u\n",
  279. __func__, td_desc->txd.cookie);
  280. list_move(&td_desc->desc_node, &td_chan->active_list);
  281. __td_start_dma(td_chan);
  282. }
  283. static dma_cookie_t td_tx_submit(struct dma_async_tx_descriptor *txd)
  284. {
  285. struct timb_dma_desc *td_desc = container_of(txd, struct timb_dma_desc,
  286. txd);
  287. struct timb_dma_chan *td_chan = container_of(txd->chan,
  288. struct timb_dma_chan, chan);
  289. dma_cookie_t cookie;
  290. spin_lock_bh(&td_chan->lock);
  291. cookie = txd->chan->cookie;
  292. if (++cookie < 0)
  293. cookie = 1;
  294. txd->chan->cookie = cookie;
  295. txd->cookie = cookie;
  296. if (list_empty(&td_chan->active_list)) {
  297. dev_dbg(chan2dev(txd->chan), "%s: started %u\n", __func__,
  298. txd->cookie);
  299. list_add_tail(&td_desc->desc_node, &td_chan->active_list);
  300. __td_start_dma(td_chan);
  301. } else {
  302. dev_dbg(chan2dev(txd->chan), "tx_submit: queued %u\n",
  303. txd->cookie);
  304. list_add_tail(&td_desc->desc_node, &td_chan->queue);
  305. }
  306. spin_unlock_bh(&td_chan->lock);
  307. return cookie;
  308. }
  309. static struct timb_dma_desc *td_alloc_init_desc(struct timb_dma_chan *td_chan)
  310. {
  311. struct dma_chan *chan = &td_chan->chan;
  312. struct timb_dma_desc *td_desc;
  313. int err;
  314. td_desc = kzalloc(sizeof(struct timb_dma_desc), GFP_KERNEL);
  315. if (!td_desc) {
  316. dev_err(chan2dev(chan), "Failed to alloc descriptor\n");
  317. goto out;
  318. }
  319. td_desc->desc_list_len = td_chan->desc_elems * TIMB_DMA_DESC_SIZE;
  320. td_desc->desc_list = kzalloc(td_desc->desc_list_len, GFP_KERNEL);
  321. if (!td_desc->desc_list) {
  322. dev_err(chan2dev(chan), "Failed to alloc descriptor\n");
  323. goto err;
  324. }
  325. dma_async_tx_descriptor_init(&td_desc->txd, chan);
  326. td_desc->txd.tx_submit = td_tx_submit;
  327. td_desc->txd.flags = DMA_CTRL_ACK;
  328. td_desc->txd.phys = dma_map_single(chan2dmadev(chan),
  329. td_desc->desc_list, td_desc->desc_list_len, DMA_TO_DEVICE);
  330. err = dma_mapping_error(chan2dmadev(chan), td_desc->txd.phys);
  331. if (err) {
  332. dev_err(chan2dev(chan), "DMA mapping error: %d\n", err);
  333. goto err;
  334. }
  335. return td_desc;
  336. err:
  337. kfree(td_desc->desc_list);
  338. kfree(td_desc);
  339. out:
  340. return NULL;
  341. }
  342. static void td_free_desc(struct timb_dma_desc *td_desc)
  343. {
  344. dev_dbg(chan2dev(td_desc->txd.chan), "Freeing desc: %p\n", td_desc);
  345. dma_unmap_single(chan2dmadev(td_desc->txd.chan), td_desc->txd.phys,
  346. td_desc->desc_list_len, DMA_TO_DEVICE);
  347. kfree(td_desc->desc_list);
  348. kfree(td_desc);
  349. }
  350. static void td_desc_put(struct timb_dma_chan *td_chan,
  351. struct timb_dma_desc *td_desc)
  352. {
  353. dev_dbg(chan2dev(&td_chan->chan), "Putting desc: %p\n", td_desc);
  354. spin_lock_bh(&td_chan->lock);
  355. list_add(&td_desc->desc_node, &td_chan->free_list);
  356. spin_unlock_bh(&td_chan->lock);
  357. }
  358. static struct timb_dma_desc *td_desc_get(struct timb_dma_chan *td_chan)
  359. {
  360. struct timb_dma_desc *td_desc, *_td_desc;
  361. struct timb_dma_desc *ret = NULL;
  362. spin_lock_bh(&td_chan->lock);
  363. list_for_each_entry_safe(td_desc, _td_desc, &td_chan->free_list,
  364. desc_node) {
  365. if (async_tx_test_ack(&td_desc->txd)) {
  366. list_del(&td_desc->desc_node);
  367. ret = td_desc;
  368. break;
  369. }
  370. dev_dbg(chan2dev(&td_chan->chan), "desc %p not ACKed\n",
  371. td_desc);
  372. }
  373. spin_unlock_bh(&td_chan->lock);
  374. return ret;
  375. }
  376. static int td_alloc_chan_resources(struct dma_chan *chan)
  377. {
  378. struct timb_dma_chan *td_chan =
  379. container_of(chan, struct timb_dma_chan, chan);
  380. int i;
  381. dev_dbg(chan2dev(chan), "%s: entry\n", __func__);
  382. BUG_ON(!list_empty(&td_chan->free_list));
  383. for (i = 0; i < td_chan->descs; i++) {
  384. struct timb_dma_desc *td_desc = td_alloc_init_desc(td_chan);
  385. if (!td_desc) {
  386. if (i)
  387. break;
  388. else {
  389. dev_err(chan2dev(chan),
  390. "Couldnt allocate any descriptors\n");
  391. return -ENOMEM;
  392. }
  393. }
  394. td_desc_put(td_chan, td_desc);
  395. }
  396. spin_lock_bh(&td_chan->lock);
  397. td_chan->last_completed_cookie = 1;
  398. chan->cookie = 1;
  399. spin_unlock_bh(&td_chan->lock);
  400. return 0;
  401. }
  402. static void td_free_chan_resources(struct dma_chan *chan)
  403. {
  404. struct timb_dma_chan *td_chan =
  405. container_of(chan, struct timb_dma_chan, chan);
  406. struct timb_dma_desc *td_desc, *_td_desc;
  407. LIST_HEAD(list);
  408. dev_dbg(chan2dev(chan), "%s: Entry\n", __func__);
  409. /* check that all descriptors are free */
  410. BUG_ON(!list_empty(&td_chan->active_list));
  411. BUG_ON(!list_empty(&td_chan->queue));
  412. spin_lock_bh(&td_chan->lock);
  413. list_splice_init(&td_chan->free_list, &list);
  414. spin_unlock_bh(&td_chan->lock);
  415. list_for_each_entry_safe(td_desc, _td_desc, &list, desc_node) {
  416. dev_dbg(chan2dev(chan), "%s: Freeing desc: %p\n", __func__,
  417. td_desc);
  418. td_free_desc(td_desc);
  419. }
  420. }
  421. static enum dma_status td_tx_status(struct dma_chan *chan, dma_cookie_t cookie,
  422. struct dma_tx_state *txstate)
  423. {
  424. struct timb_dma_chan *td_chan =
  425. container_of(chan, struct timb_dma_chan, chan);
  426. dma_cookie_t last_used;
  427. dma_cookie_t last_complete;
  428. int ret;
  429. dev_dbg(chan2dev(chan), "%s: Entry\n", __func__);
  430. last_complete = td_chan->last_completed_cookie;
  431. last_used = chan->cookie;
  432. ret = dma_async_is_complete(cookie, last_complete, last_used);
  433. dma_set_tx_state(txstate, last_complete, last_used, 0);
  434. dev_dbg(chan2dev(chan),
  435. "%s: exit, ret: %d, last_complete: %d, last_used: %d\n",
  436. __func__, ret, last_complete, last_used);
  437. return ret;
  438. }
  439. static void td_issue_pending(struct dma_chan *chan)
  440. {
  441. struct timb_dma_chan *td_chan =
  442. container_of(chan, struct timb_dma_chan, chan);
  443. dev_dbg(chan2dev(chan), "%s: Entry\n", __func__);
  444. spin_lock_bh(&td_chan->lock);
  445. if (!list_empty(&td_chan->active_list))
  446. /* transfer ongoing */
  447. if (__td_dma_done_ack(td_chan))
  448. __td_finish(td_chan);
  449. if (list_empty(&td_chan->active_list) && !list_empty(&td_chan->queue))
  450. __td_start_next(td_chan);
  451. spin_unlock_bh(&td_chan->lock);
  452. }
  453. static struct dma_async_tx_descriptor *td_prep_slave_sg(struct dma_chan *chan,
  454. struct scatterlist *sgl, unsigned int sg_len,
  455. enum dma_data_direction direction, unsigned long flags)
  456. {
  457. struct timb_dma_chan *td_chan =
  458. container_of(chan, struct timb_dma_chan, chan);
  459. struct timb_dma_desc *td_desc;
  460. struct scatterlist *sg;
  461. unsigned int i;
  462. unsigned int desc_usage = 0;
  463. if (!sgl || !sg_len) {
  464. dev_err(chan2dev(chan), "%s: No SG list\n", __func__);
  465. return NULL;
  466. }
  467. /* even channels are for RX, odd for TX */
  468. if (td_chan->direction != direction) {
  469. dev_err(chan2dev(chan),
  470. "Requesting channel in wrong direction\n");
  471. return NULL;
  472. }
  473. td_desc = td_desc_get(td_chan);
  474. if (!td_desc) {
  475. dev_err(chan2dev(chan), "Not enough descriptors available\n");
  476. return NULL;
  477. }
  478. td_desc->interrupt = (flags & DMA_PREP_INTERRUPT) != 0;
  479. for_each_sg(sgl, sg, sg_len, i) {
  480. int err;
  481. if (desc_usage > td_desc->desc_list_len) {
  482. dev_err(chan2dev(chan), "No descriptor space\n");
  483. return NULL;
  484. }
  485. err = td_fill_desc(td_chan, td_desc->desc_list + desc_usage, sg,
  486. i == (sg_len - 1));
  487. if (err) {
  488. dev_err(chan2dev(chan), "Failed to update desc: %d\n",
  489. err);
  490. td_desc_put(td_chan, td_desc);
  491. return NULL;
  492. }
  493. desc_usage += TIMB_DMA_DESC_SIZE;
  494. }
  495. dma_sync_single_for_device(chan2dmadev(chan), td_desc->txd.phys,
  496. td_desc->desc_list_len, DMA_TO_DEVICE);
  497. return &td_desc->txd;
  498. }
  499. static int td_control(struct dma_chan *chan, enum dma_ctrl_cmd cmd,
  500. unsigned long arg)
  501. {
  502. struct timb_dma_chan *td_chan =
  503. container_of(chan, struct timb_dma_chan, chan);
  504. struct timb_dma_desc *td_desc, *_td_desc;
  505. dev_dbg(chan2dev(chan), "%s: Entry\n", __func__);
  506. if (cmd != DMA_TERMINATE_ALL)
  507. return -ENXIO;
  508. /* first the easy part, put the queue into the free list */
  509. spin_lock_bh(&td_chan->lock);
  510. list_for_each_entry_safe(td_desc, _td_desc, &td_chan->queue,
  511. desc_node)
  512. list_move(&td_desc->desc_node, &td_chan->free_list);
  513. /* now tear down the running */
  514. __td_finish(td_chan);
  515. spin_unlock_bh(&td_chan->lock);
  516. return 0;
  517. }
  518. static void td_tasklet(unsigned long data)
  519. {
  520. struct timb_dma *td = (struct timb_dma *)data;
  521. u32 isr;
  522. u32 ipr;
  523. u32 ier;
  524. int i;
  525. isr = ioread32(td->membase + TIMBDMA_ISR);
  526. ipr = isr & __td_ier_mask(td);
  527. /* ack the interrupts */
  528. iowrite32(ipr, td->membase + TIMBDMA_ISR);
  529. for (i = 0; i < td->dma.chancnt; i++)
  530. if (ipr & (1 << i)) {
  531. struct timb_dma_chan *td_chan = td->channels + i;
  532. spin_lock(&td_chan->lock);
  533. __td_finish(td_chan);
  534. if (!list_empty(&td_chan->queue))
  535. __td_start_next(td_chan);
  536. spin_unlock(&td_chan->lock);
  537. }
  538. ier = __td_ier_mask(td);
  539. iowrite32(ier, td->membase + TIMBDMA_IER);
  540. }
  541. static irqreturn_t td_irq(int irq, void *devid)
  542. {
  543. struct timb_dma *td = devid;
  544. u32 ipr = ioread32(td->membase + TIMBDMA_IPR);
  545. if (ipr) {
  546. /* disable interrupts, will be re-enabled in tasklet */
  547. iowrite32(0, td->membase + TIMBDMA_IER);
  548. tasklet_schedule(&td->tasklet);
  549. return IRQ_HANDLED;
  550. } else
  551. return IRQ_NONE;
  552. }
  553. static int __devinit td_probe(struct platform_device *pdev)
  554. {
  555. struct timb_dma_platform_data *pdata = mfd_get_data(pdev);
  556. struct timb_dma *td;
  557. struct resource *iomem;
  558. int irq;
  559. int err;
  560. int i;
  561. if (!pdata) {
  562. dev_err(&pdev->dev, "No platform data\n");
  563. return -EINVAL;
  564. }
  565. iomem = platform_get_resource(pdev, IORESOURCE_MEM, 0);
  566. if (!iomem)
  567. return -EINVAL;
  568. irq = platform_get_irq(pdev, 0);
  569. if (irq < 0)
  570. return irq;
  571. if (!request_mem_region(iomem->start, resource_size(iomem),
  572. DRIVER_NAME))
  573. return -EBUSY;
  574. td = kzalloc(sizeof(struct timb_dma) +
  575. sizeof(struct timb_dma_chan) * pdata->nr_channels, GFP_KERNEL);
  576. if (!td) {
  577. err = -ENOMEM;
  578. goto err_release_region;
  579. }
  580. dev_dbg(&pdev->dev, "Allocated TD: %p\n", td);
  581. td->membase = ioremap(iomem->start, resource_size(iomem));
  582. if (!td->membase) {
  583. dev_err(&pdev->dev, "Failed to remap I/O memory\n");
  584. err = -ENOMEM;
  585. goto err_free_mem;
  586. }
  587. /* 32bit addressing */
  588. iowrite32(TIMBDMA_32BIT_ADDR, td->membase + TIMBDMA_ACR);
  589. /* disable and clear any interrupts */
  590. iowrite32(0x0, td->membase + TIMBDMA_IER);
  591. iowrite32(0xFFFFFFFF, td->membase + TIMBDMA_ISR);
  592. tasklet_init(&td->tasklet, td_tasklet, (unsigned long)td);
  593. err = request_irq(irq, td_irq, IRQF_SHARED, DRIVER_NAME, td);
  594. if (err) {
  595. dev_err(&pdev->dev, "Failed to request IRQ\n");
  596. goto err_tasklet_kill;
  597. }
  598. td->dma.device_alloc_chan_resources = td_alloc_chan_resources;
  599. td->dma.device_free_chan_resources = td_free_chan_resources;
  600. td->dma.device_tx_status = td_tx_status;
  601. td->dma.device_issue_pending = td_issue_pending;
  602. dma_cap_set(DMA_SLAVE, td->dma.cap_mask);
  603. dma_cap_set(DMA_PRIVATE, td->dma.cap_mask);
  604. td->dma.device_prep_slave_sg = td_prep_slave_sg;
  605. td->dma.device_control = td_control;
  606. td->dma.dev = &pdev->dev;
  607. INIT_LIST_HEAD(&td->dma.channels);
  608. for (i = 0; i < pdata->nr_channels; i++, td->dma.chancnt++) {
  609. struct timb_dma_chan *td_chan = &td->channels[i];
  610. struct timb_dma_platform_data_channel *pchan =
  611. pdata->channels + i;
  612. /* even channels are RX, odd are TX */
  613. if ((i % 2) == pchan->rx) {
  614. dev_err(&pdev->dev, "Wrong channel configuration\n");
  615. err = -EINVAL;
  616. goto err_tasklet_kill;
  617. }
  618. td_chan->chan.device = &td->dma;
  619. td_chan->chan.cookie = 1;
  620. td_chan->chan.chan_id = i;
  621. spin_lock_init(&td_chan->lock);
  622. INIT_LIST_HEAD(&td_chan->active_list);
  623. INIT_LIST_HEAD(&td_chan->queue);
  624. INIT_LIST_HEAD(&td_chan->free_list);
  625. td_chan->descs = pchan->descriptors;
  626. td_chan->desc_elems = pchan->descriptor_elements;
  627. td_chan->bytes_per_line = pchan->bytes_per_line;
  628. td_chan->direction = pchan->rx ? DMA_FROM_DEVICE :
  629. DMA_TO_DEVICE;
  630. td_chan->membase = td->membase +
  631. (i / 2) * TIMBDMA_INSTANCE_OFFSET +
  632. (pchan->rx ? 0 : TIMBDMA_INSTANCE_TX_OFFSET);
  633. dev_dbg(&pdev->dev, "Chan: %d, membase: %p\n",
  634. i, td_chan->membase);
  635. list_add_tail(&td_chan->chan.device_node, &td->dma.channels);
  636. }
  637. err = dma_async_device_register(&td->dma);
  638. if (err) {
  639. dev_err(&pdev->dev, "Failed to register async device\n");
  640. goto err_free_irq;
  641. }
  642. platform_set_drvdata(pdev, td);
  643. dev_dbg(&pdev->dev, "Probe result: %d\n", err);
  644. return err;
  645. err_free_irq:
  646. free_irq(irq, td);
  647. err_tasklet_kill:
  648. tasklet_kill(&td->tasklet);
  649. iounmap(td->membase);
  650. err_free_mem:
  651. kfree(td);
  652. err_release_region:
  653. release_mem_region(iomem->start, resource_size(iomem));
  654. return err;
  655. }
  656. static int __devexit td_remove(struct platform_device *pdev)
  657. {
  658. struct timb_dma *td = platform_get_drvdata(pdev);
  659. struct resource *iomem = platform_get_resource(pdev, IORESOURCE_MEM, 0);
  660. int irq = platform_get_irq(pdev, 0);
  661. dma_async_device_unregister(&td->dma);
  662. free_irq(irq, td);
  663. tasklet_kill(&td->tasklet);
  664. iounmap(td->membase);
  665. kfree(td);
  666. release_mem_region(iomem->start, resource_size(iomem));
  667. platform_set_drvdata(pdev, NULL);
  668. dev_dbg(&pdev->dev, "Removed...\n");
  669. return 0;
  670. }
  671. static struct platform_driver td_driver = {
  672. .driver = {
  673. .name = DRIVER_NAME,
  674. .owner = THIS_MODULE,
  675. },
  676. .probe = td_probe,
  677. .remove = __exit_p(td_remove),
  678. };
  679. static int __init td_init(void)
  680. {
  681. return platform_driver_register(&td_driver);
  682. }
  683. module_init(td_init);
  684. static void __exit td_exit(void)
  685. {
  686. platform_driver_unregister(&td_driver);
  687. }
  688. module_exit(td_exit);
  689. MODULE_LICENSE("GPL v2");
  690. MODULE_DESCRIPTION("Timberdale DMA controller driver");
  691. MODULE_AUTHOR("Pelagicore AB <info@pelagicore.com>");
  692. MODULE_ALIAS("platform:"DRIVER_NAME);