timb_dma.c 20 KB

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