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