timb_dma.c 19 KB

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