timb_dma.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845
  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 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. DMA_TO_DEVICE);
  144. else
  145. dma_unmap_page(chan2dev(&td_chan->chan), addr, len,
  146. DMA_TO_DEVICE);
  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_DEV_TO_MEM) {
  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_DEV_TO_MEM)
  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->chan.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 = dma_cookie_assign(txd);
  291. if (list_empty(&td_chan->active_list)) {
  292. dev_dbg(chan2dev(txd->chan), "%s: started %u\n", __func__,
  293. txd->cookie);
  294. list_add_tail(&td_desc->desc_node, &td_chan->active_list);
  295. __td_start_dma(td_chan);
  296. } else {
  297. dev_dbg(chan2dev(txd->chan), "tx_submit: queued %u\n",
  298. txd->cookie);
  299. list_add_tail(&td_desc->desc_node, &td_chan->queue);
  300. }
  301. spin_unlock_bh(&td_chan->lock);
  302. return cookie;
  303. }
  304. static struct timb_dma_desc *td_alloc_init_desc(struct timb_dma_chan *td_chan)
  305. {
  306. struct dma_chan *chan = &td_chan->chan;
  307. struct timb_dma_desc *td_desc;
  308. int err;
  309. td_desc = kzalloc(sizeof(struct timb_dma_desc), GFP_KERNEL);
  310. if (!td_desc) {
  311. dev_err(chan2dev(chan), "Failed to alloc descriptor\n");
  312. goto out;
  313. }
  314. td_desc->desc_list_len = td_chan->desc_elems * TIMB_DMA_DESC_SIZE;
  315. td_desc->desc_list = kzalloc(td_desc->desc_list_len, GFP_KERNEL);
  316. if (!td_desc->desc_list) {
  317. dev_err(chan2dev(chan), "Failed to alloc descriptor\n");
  318. goto err;
  319. }
  320. dma_async_tx_descriptor_init(&td_desc->txd, chan);
  321. td_desc->txd.tx_submit = td_tx_submit;
  322. td_desc->txd.flags = DMA_CTRL_ACK;
  323. td_desc->txd.phys = dma_map_single(chan2dmadev(chan),
  324. td_desc->desc_list, td_desc->desc_list_len, DMA_TO_DEVICE);
  325. err = dma_mapping_error(chan2dmadev(chan), td_desc->txd.phys);
  326. if (err) {
  327. dev_err(chan2dev(chan), "DMA mapping error: %d\n", err);
  328. goto err;
  329. }
  330. return td_desc;
  331. err:
  332. kfree(td_desc->desc_list);
  333. kfree(td_desc);
  334. out:
  335. return NULL;
  336. }
  337. static void td_free_desc(struct timb_dma_desc *td_desc)
  338. {
  339. dev_dbg(chan2dev(td_desc->txd.chan), "Freeing desc: %p\n", td_desc);
  340. dma_unmap_single(chan2dmadev(td_desc->txd.chan), td_desc->txd.phys,
  341. td_desc->desc_list_len, DMA_TO_DEVICE);
  342. kfree(td_desc->desc_list);
  343. kfree(td_desc);
  344. }
  345. static void td_desc_put(struct timb_dma_chan *td_chan,
  346. struct timb_dma_desc *td_desc)
  347. {
  348. dev_dbg(chan2dev(&td_chan->chan), "Putting desc: %p\n", td_desc);
  349. spin_lock_bh(&td_chan->lock);
  350. list_add(&td_desc->desc_node, &td_chan->free_list);
  351. spin_unlock_bh(&td_chan->lock);
  352. }
  353. static struct timb_dma_desc *td_desc_get(struct timb_dma_chan *td_chan)
  354. {
  355. struct timb_dma_desc *td_desc, *_td_desc;
  356. struct timb_dma_desc *ret = NULL;
  357. spin_lock_bh(&td_chan->lock);
  358. list_for_each_entry_safe(td_desc, _td_desc, &td_chan->free_list,
  359. desc_node) {
  360. if (async_tx_test_ack(&td_desc->txd)) {
  361. list_del(&td_desc->desc_node);
  362. ret = td_desc;
  363. break;
  364. }
  365. dev_dbg(chan2dev(&td_chan->chan), "desc %p not ACKed\n",
  366. td_desc);
  367. }
  368. spin_unlock_bh(&td_chan->lock);
  369. return ret;
  370. }
  371. static int td_alloc_chan_resources(struct dma_chan *chan)
  372. {
  373. struct timb_dma_chan *td_chan =
  374. container_of(chan, struct timb_dma_chan, chan);
  375. int i;
  376. dev_dbg(chan2dev(chan), "%s: entry\n", __func__);
  377. BUG_ON(!list_empty(&td_chan->free_list));
  378. for (i = 0; i < td_chan->descs; i++) {
  379. struct timb_dma_desc *td_desc = td_alloc_init_desc(td_chan);
  380. if (!td_desc) {
  381. if (i)
  382. break;
  383. else {
  384. dev_err(chan2dev(chan),
  385. "Couldnt allocate any descriptors\n");
  386. return -ENOMEM;
  387. }
  388. }
  389. td_desc_put(td_chan, td_desc);
  390. }
  391. spin_lock_bh(&td_chan->lock);
  392. chan->completed_cookie = 1;
  393. chan->cookie = 1;
  394. spin_unlock_bh(&td_chan->lock);
  395. return 0;
  396. }
  397. static void td_free_chan_resources(struct dma_chan *chan)
  398. {
  399. struct timb_dma_chan *td_chan =
  400. container_of(chan, struct timb_dma_chan, chan);
  401. struct timb_dma_desc *td_desc, *_td_desc;
  402. LIST_HEAD(list);
  403. dev_dbg(chan2dev(chan), "%s: Entry\n", __func__);
  404. /* check that all descriptors are free */
  405. BUG_ON(!list_empty(&td_chan->active_list));
  406. BUG_ON(!list_empty(&td_chan->queue));
  407. spin_lock_bh(&td_chan->lock);
  408. list_splice_init(&td_chan->free_list, &list);
  409. spin_unlock_bh(&td_chan->lock);
  410. list_for_each_entry_safe(td_desc, _td_desc, &list, desc_node) {
  411. dev_dbg(chan2dev(chan), "%s: Freeing desc: %p\n", __func__,
  412. td_desc);
  413. td_free_desc(td_desc);
  414. }
  415. }
  416. static enum dma_status td_tx_status(struct dma_chan *chan, dma_cookie_t cookie,
  417. struct dma_tx_state *txstate)
  418. {
  419. struct timb_dma_chan *td_chan =
  420. container_of(chan, struct timb_dma_chan, chan);
  421. dma_cookie_t last_used;
  422. dma_cookie_t last_complete;
  423. int ret;
  424. dev_dbg(chan2dev(chan), "%s: Entry\n", __func__);
  425. last_complete = chan->completed_cookie;
  426. last_used = chan->cookie;
  427. ret = dma_async_is_complete(cookie, last_complete, last_used);
  428. dma_set_tx_state(txstate, last_complete, last_used, 0);
  429. dev_dbg(chan2dev(chan),
  430. "%s: exit, ret: %d, last_complete: %d, last_used: %d\n",
  431. __func__, ret, last_complete, last_used);
  432. return ret;
  433. }
  434. static void td_issue_pending(struct dma_chan *chan)
  435. {
  436. struct timb_dma_chan *td_chan =
  437. container_of(chan, struct timb_dma_chan, chan);
  438. dev_dbg(chan2dev(chan), "%s: Entry\n", __func__);
  439. spin_lock_bh(&td_chan->lock);
  440. if (!list_empty(&td_chan->active_list))
  441. /* transfer ongoing */
  442. if (__td_dma_done_ack(td_chan))
  443. __td_finish(td_chan);
  444. if (list_empty(&td_chan->active_list) && !list_empty(&td_chan->queue))
  445. __td_start_next(td_chan);
  446. spin_unlock_bh(&td_chan->lock);
  447. }
  448. static struct dma_async_tx_descriptor *td_prep_slave_sg(struct dma_chan *chan,
  449. struct scatterlist *sgl, unsigned int sg_len,
  450. enum dma_transfer_direction direction, unsigned long flags)
  451. {
  452. struct timb_dma_chan *td_chan =
  453. container_of(chan, struct timb_dma_chan, chan);
  454. struct timb_dma_desc *td_desc;
  455. struct scatterlist *sg;
  456. unsigned int i;
  457. unsigned int desc_usage = 0;
  458. if (!sgl || !sg_len) {
  459. dev_err(chan2dev(chan), "%s: No SG list\n", __func__);
  460. return NULL;
  461. }
  462. /* even channels are for RX, odd for TX */
  463. if (td_chan->direction != direction) {
  464. dev_err(chan2dev(chan),
  465. "Requesting channel in wrong direction\n");
  466. return NULL;
  467. }
  468. td_desc = td_desc_get(td_chan);
  469. if (!td_desc) {
  470. dev_err(chan2dev(chan), "Not enough descriptors available\n");
  471. return NULL;
  472. }
  473. td_desc->interrupt = (flags & DMA_PREP_INTERRUPT) != 0;
  474. for_each_sg(sgl, sg, sg_len, i) {
  475. int err;
  476. if (desc_usage > td_desc->desc_list_len) {
  477. dev_err(chan2dev(chan), "No descriptor space\n");
  478. return NULL;
  479. }
  480. err = td_fill_desc(td_chan, td_desc->desc_list + desc_usage, sg,
  481. i == (sg_len - 1));
  482. if (err) {
  483. dev_err(chan2dev(chan), "Failed to update desc: %d\n",
  484. err);
  485. td_desc_put(td_chan, td_desc);
  486. return NULL;
  487. }
  488. desc_usage += TIMB_DMA_DESC_SIZE;
  489. }
  490. dma_sync_single_for_device(chan2dmadev(chan), td_desc->txd.phys,
  491. td_desc->desc_list_len, DMA_MEM_TO_DEV);
  492. return &td_desc->txd;
  493. }
  494. static int td_control(struct dma_chan *chan, enum dma_ctrl_cmd cmd,
  495. unsigned long arg)
  496. {
  497. struct timb_dma_chan *td_chan =
  498. container_of(chan, struct timb_dma_chan, chan);
  499. struct timb_dma_desc *td_desc, *_td_desc;
  500. dev_dbg(chan2dev(chan), "%s: Entry\n", __func__);
  501. if (cmd != DMA_TERMINATE_ALL)
  502. return -ENXIO;
  503. /* first the easy part, put the queue into the free list */
  504. spin_lock_bh(&td_chan->lock);
  505. list_for_each_entry_safe(td_desc, _td_desc, &td_chan->queue,
  506. desc_node)
  507. list_move(&td_desc->desc_node, &td_chan->free_list);
  508. /* now tear down the running */
  509. __td_finish(td_chan);
  510. spin_unlock_bh(&td_chan->lock);
  511. return 0;
  512. }
  513. static void td_tasklet(unsigned long data)
  514. {
  515. struct timb_dma *td = (struct timb_dma *)data;
  516. u32 isr;
  517. u32 ipr;
  518. u32 ier;
  519. int i;
  520. isr = ioread32(td->membase + TIMBDMA_ISR);
  521. ipr = isr & __td_ier_mask(td);
  522. /* ack the interrupts */
  523. iowrite32(ipr, td->membase + TIMBDMA_ISR);
  524. for (i = 0; i < td->dma.chancnt; i++)
  525. if (ipr & (1 << i)) {
  526. struct timb_dma_chan *td_chan = td->channels + i;
  527. spin_lock(&td_chan->lock);
  528. __td_finish(td_chan);
  529. if (!list_empty(&td_chan->queue))
  530. __td_start_next(td_chan);
  531. spin_unlock(&td_chan->lock);
  532. }
  533. ier = __td_ier_mask(td);
  534. iowrite32(ier, td->membase + TIMBDMA_IER);
  535. }
  536. static irqreturn_t td_irq(int irq, void *devid)
  537. {
  538. struct timb_dma *td = devid;
  539. u32 ipr = ioread32(td->membase + TIMBDMA_IPR);
  540. if (ipr) {
  541. /* disable interrupts, will be re-enabled in tasklet */
  542. iowrite32(0, td->membase + TIMBDMA_IER);
  543. tasklet_schedule(&td->tasklet);
  544. return IRQ_HANDLED;
  545. } else
  546. return IRQ_NONE;
  547. }
  548. static int __devinit td_probe(struct platform_device *pdev)
  549. {
  550. struct timb_dma_platform_data *pdata = pdev->dev.platform_data;
  551. struct timb_dma *td;
  552. struct resource *iomem;
  553. int irq;
  554. int err;
  555. int i;
  556. if (!pdata) {
  557. dev_err(&pdev->dev, "No platform data\n");
  558. return -EINVAL;
  559. }
  560. iomem = platform_get_resource(pdev, IORESOURCE_MEM, 0);
  561. if (!iomem)
  562. return -EINVAL;
  563. irq = platform_get_irq(pdev, 0);
  564. if (irq < 0)
  565. return irq;
  566. if (!request_mem_region(iomem->start, resource_size(iomem),
  567. DRIVER_NAME))
  568. return -EBUSY;
  569. td = kzalloc(sizeof(struct timb_dma) +
  570. sizeof(struct timb_dma_chan) * pdata->nr_channels, GFP_KERNEL);
  571. if (!td) {
  572. err = -ENOMEM;
  573. goto err_release_region;
  574. }
  575. dev_dbg(&pdev->dev, "Allocated TD: %p\n", td);
  576. td->membase = ioremap(iomem->start, resource_size(iomem));
  577. if (!td->membase) {
  578. dev_err(&pdev->dev, "Failed to remap I/O memory\n");
  579. err = -ENOMEM;
  580. goto err_free_mem;
  581. }
  582. /* 32bit addressing */
  583. iowrite32(TIMBDMA_32BIT_ADDR, td->membase + TIMBDMA_ACR);
  584. /* disable and clear any interrupts */
  585. iowrite32(0x0, td->membase + TIMBDMA_IER);
  586. iowrite32(0xFFFFFFFF, td->membase + TIMBDMA_ISR);
  587. tasklet_init(&td->tasklet, td_tasklet, (unsigned long)td);
  588. err = request_irq(irq, td_irq, IRQF_SHARED, DRIVER_NAME, td);
  589. if (err) {
  590. dev_err(&pdev->dev, "Failed to request IRQ\n");
  591. goto err_tasklet_kill;
  592. }
  593. td->dma.device_alloc_chan_resources = td_alloc_chan_resources;
  594. td->dma.device_free_chan_resources = td_free_chan_resources;
  595. td->dma.device_tx_status = td_tx_status;
  596. td->dma.device_issue_pending = td_issue_pending;
  597. dma_cap_set(DMA_SLAVE, td->dma.cap_mask);
  598. dma_cap_set(DMA_PRIVATE, td->dma.cap_mask);
  599. td->dma.device_prep_slave_sg = td_prep_slave_sg;
  600. td->dma.device_control = td_control;
  601. td->dma.dev = &pdev->dev;
  602. INIT_LIST_HEAD(&td->dma.channels);
  603. for (i = 0; i < pdata->nr_channels; i++) {
  604. struct timb_dma_chan *td_chan = &td->channels[i];
  605. struct timb_dma_platform_data_channel *pchan =
  606. pdata->channels + i;
  607. /* even channels are RX, odd are TX */
  608. if ((i % 2) == pchan->rx) {
  609. dev_err(&pdev->dev, "Wrong channel configuration\n");
  610. err = -EINVAL;
  611. goto err_free_irq;
  612. }
  613. td_chan->chan.device = &td->dma;
  614. td_chan->chan.cookie = 1;
  615. spin_lock_init(&td_chan->lock);
  616. INIT_LIST_HEAD(&td_chan->active_list);
  617. INIT_LIST_HEAD(&td_chan->queue);
  618. INIT_LIST_HEAD(&td_chan->free_list);
  619. td_chan->descs = pchan->descriptors;
  620. td_chan->desc_elems = pchan->descriptor_elements;
  621. td_chan->bytes_per_line = pchan->bytes_per_line;
  622. td_chan->direction = pchan->rx ? DMA_DEV_TO_MEM :
  623. DMA_MEM_TO_DEV;
  624. td_chan->membase = td->membase +
  625. (i / 2) * TIMBDMA_INSTANCE_OFFSET +
  626. (pchan->rx ? 0 : TIMBDMA_INSTANCE_TX_OFFSET);
  627. dev_dbg(&pdev->dev, "Chan: %d, membase: %p\n",
  628. i, td_chan->membase);
  629. list_add_tail(&td_chan->chan.device_node, &td->dma.channels);
  630. }
  631. err = dma_async_device_register(&td->dma);
  632. if (err) {
  633. dev_err(&pdev->dev, "Failed to register async device\n");
  634. goto err_free_irq;
  635. }
  636. platform_set_drvdata(pdev, td);
  637. dev_dbg(&pdev->dev, "Probe result: %d\n", err);
  638. return err;
  639. err_free_irq:
  640. free_irq(irq, td);
  641. err_tasklet_kill:
  642. tasklet_kill(&td->tasklet);
  643. iounmap(td->membase);
  644. err_free_mem:
  645. kfree(td);
  646. err_release_region:
  647. release_mem_region(iomem->start, resource_size(iomem));
  648. return err;
  649. }
  650. static int __devexit td_remove(struct platform_device *pdev)
  651. {
  652. struct timb_dma *td = platform_get_drvdata(pdev);
  653. struct resource *iomem = platform_get_resource(pdev, IORESOURCE_MEM, 0);
  654. int irq = platform_get_irq(pdev, 0);
  655. dma_async_device_unregister(&td->dma);
  656. free_irq(irq, td);
  657. tasklet_kill(&td->tasklet);
  658. iounmap(td->membase);
  659. kfree(td);
  660. release_mem_region(iomem->start, resource_size(iomem));
  661. platform_set_drvdata(pdev, NULL);
  662. dev_dbg(&pdev->dev, "Removed...\n");
  663. return 0;
  664. }
  665. static struct platform_driver td_driver = {
  666. .driver = {
  667. .name = DRIVER_NAME,
  668. .owner = THIS_MODULE,
  669. },
  670. .probe = td_probe,
  671. .remove = __exit_p(td_remove),
  672. };
  673. module_platform_driver(td_driver);
  674. MODULE_LICENSE("GPL v2");
  675. MODULE_DESCRIPTION("Timberdale DMA controller driver");
  676. MODULE_AUTHOR("Pelagicore AB <info@pelagicore.com>");
  677. MODULE_ALIAS("platform:"DRIVER_NAME);