dmaengine.c 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029
  1. /*
  2. * Copyright(c) 2004 - 2006 Intel Corporation. All rights reserved.
  3. *
  4. * This program is free software; you can redistribute it and/or modify it
  5. * under the terms of the GNU General Public License as published by the Free
  6. * Software Foundation; either version 2 of the License, or (at your option)
  7. * any later version.
  8. *
  9. * This program is distributed in the hope that it will be useful, but WITHOUT
  10. * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11. * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
  12. * more details.
  13. *
  14. * You should have received a copy of the GNU General Public License along with
  15. * this program; if not, write to the Free Software Foundation, Inc., 59
  16. * Temple Place - Suite 330, Boston, MA 02111-1307, USA.
  17. *
  18. * The full GNU General Public License is included in this distribution in the
  19. * file called COPYING.
  20. */
  21. /*
  22. * This code implements the DMA subsystem. It provides a HW-neutral interface
  23. * for other kernel code to use asynchronous memory copy capabilities,
  24. * if present, and allows different HW DMA drivers to register as providing
  25. * this capability.
  26. *
  27. * Due to the fact we are accelerating what is already a relatively fast
  28. * operation, the code goes to great lengths to avoid additional overhead,
  29. * such as locking.
  30. *
  31. * LOCKING:
  32. *
  33. * The subsystem keeps a global list of dma_device structs it is protected by a
  34. * mutex, dma_list_mutex.
  35. *
  36. * A subsystem can get access to a channel by calling dmaengine_get() followed
  37. * by dma_find_channel(), or if it has need for an exclusive channel it can call
  38. * dma_request_channel(). Once a channel is allocated a reference is taken
  39. * against its corresponding driver to disable removal.
  40. *
  41. * Each device has a channels list, which runs unlocked but is never modified
  42. * once the device is registered, it's just setup by the driver.
  43. *
  44. * See Documentation/dmaengine.txt for more details
  45. */
  46. #include <linux/init.h>
  47. #include <linux/module.h>
  48. #include <linux/mm.h>
  49. #include <linux/device.h>
  50. #include <linux/dmaengine.h>
  51. #include <linux/hardirq.h>
  52. #include <linux/spinlock.h>
  53. #include <linux/percpu.h>
  54. #include <linux/rcupdate.h>
  55. #include <linux/mutex.h>
  56. #include <linux/jiffies.h>
  57. #include <linux/rculist.h>
  58. #include <linux/idr.h>
  59. static DEFINE_MUTEX(dma_list_mutex);
  60. static LIST_HEAD(dma_device_list);
  61. static long dmaengine_ref_count;
  62. static struct idr dma_idr;
  63. /* --- sysfs implementation --- */
  64. /**
  65. * dev_to_dma_chan - convert a device pointer to the its sysfs container object
  66. * @dev - device node
  67. *
  68. * Must be called under dma_list_mutex
  69. */
  70. static struct dma_chan *dev_to_dma_chan(struct device *dev)
  71. {
  72. struct dma_chan_dev *chan_dev;
  73. chan_dev = container_of(dev, typeof(*chan_dev), device);
  74. return chan_dev->chan;
  75. }
  76. static ssize_t show_memcpy_count(struct device *dev, struct device_attribute *attr, char *buf)
  77. {
  78. struct dma_chan *chan;
  79. unsigned long count = 0;
  80. int i;
  81. int err;
  82. mutex_lock(&dma_list_mutex);
  83. chan = dev_to_dma_chan(dev);
  84. if (chan) {
  85. for_each_possible_cpu(i)
  86. count += per_cpu_ptr(chan->local, i)->memcpy_count;
  87. err = sprintf(buf, "%lu\n", count);
  88. } else
  89. err = -ENODEV;
  90. mutex_unlock(&dma_list_mutex);
  91. return err;
  92. }
  93. static ssize_t show_bytes_transferred(struct device *dev, struct device_attribute *attr,
  94. char *buf)
  95. {
  96. struct dma_chan *chan;
  97. unsigned long count = 0;
  98. int i;
  99. int err;
  100. mutex_lock(&dma_list_mutex);
  101. chan = dev_to_dma_chan(dev);
  102. if (chan) {
  103. for_each_possible_cpu(i)
  104. count += per_cpu_ptr(chan->local, i)->bytes_transferred;
  105. err = sprintf(buf, "%lu\n", count);
  106. } else
  107. err = -ENODEV;
  108. mutex_unlock(&dma_list_mutex);
  109. return err;
  110. }
  111. static ssize_t show_in_use(struct device *dev, struct device_attribute *attr, char *buf)
  112. {
  113. struct dma_chan *chan;
  114. int err;
  115. mutex_lock(&dma_list_mutex);
  116. chan = dev_to_dma_chan(dev);
  117. if (chan)
  118. err = sprintf(buf, "%d\n", chan->client_count);
  119. else
  120. err = -ENODEV;
  121. mutex_unlock(&dma_list_mutex);
  122. return err;
  123. }
  124. static struct device_attribute dma_attrs[] = {
  125. __ATTR(memcpy_count, S_IRUGO, show_memcpy_count, NULL),
  126. __ATTR(bytes_transferred, S_IRUGO, show_bytes_transferred, NULL),
  127. __ATTR(in_use, S_IRUGO, show_in_use, NULL),
  128. __ATTR_NULL
  129. };
  130. static void chan_dev_release(struct device *dev)
  131. {
  132. struct dma_chan_dev *chan_dev;
  133. chan_dev = container_of(dev, typeof(*chan_dev), device);
  134. if (atomic_dec_and_test(chan_dev->idr_ref)) {
  135. mutex_lock(&dma_list_mutex);
  136. idr_remove(&dma_idr, chan_dev->dev_id);
  137. mutex_unlock(&dma_list_mutex);
  138. kfree(chan_dev->idr_ref);
  139. }
  140. kfree(chan_dev);
  141. }
  142. static struct class dma_devclass = {
  143. .name = "dma",
  144. .dev_attrs = dma_attrs,
  145. .dev_release = chan_dev_release,
  146. };
  147. /* --- client and device registration --- */
  148. #define dma_device_satisfies_mask(device, mask) \
  149. __dma_device_satisfies_mask((device), &(mask))
  150. static int
  151. __dma_device_satisfies_mask(struct dma_device *device, dma_cap_mask_t *want)
  152. {
  153. dma_cap_mask_t has;
  154. bitmap_and(has.bits, want->bits, device->cap_mask.bits,
  155. DMA_TX_TYPE_END);
  156. return bitmap_equal(want->bits, has.bits, DMA_TX_TYPE_END);
  157. }
  158. static struct module *dma_chan_to_owner(struct dma_chan *chan)
  159. {
  160. return chan->device->dev->driver->owner;
  161. }
  162. /**
  163. * balance_ref_count - catch up the channel reference count
  164. * @chan - channel to balance ->client_count versus dmaengine_ref_count
  165. *
  166. * balance_ref_count must be called under dma_list_mutex
  167. */
  168. static void balance_ref_count(struct dma_chan *chan)
  169. {
  170. struct module *owner = dma_chan_to_owner(chan);
  171. while (chan->client_count < dmaengine_ref_count) {
  172. __module_get(owner);
  173. chan->client_count++;
  174. }
  175. }
  176. /**
  177. * dma_chan_get - try to grab a dma channel's parent driver module
  178. * @chan - channel to grab
  179. *
  180. * Must be called under dma_list_mutex
  181. */
  182. static int dma_chan_get(struct dma_chan *chan)
  183. {
  184. int err = -ENODEV;
  185. struct module *owner = dma_chan_to_owner(chan);
  186. if (chan->client_count) {
  187. __module_get(owner);
  188. err = 0;
  189. } else if (try_module_get(owner))
  190. err = 0;
  191. if (err == 0)
  192. chan->client_count++;
  193. /* allocate upon first client reference */
  194. if (chan->client_count == 1 && err == 0) {
  195. int desc_cnt = chan->device->device_alloc_chan_resources(chan);
  196. if (desc_cnt < 0) {
  197. err = desc_cnt;
  198. chan->client_count = 0;
  199. module_put(owner);
  200. } else if (!dma_has_cap(DMA_PRIVATE, chan->device->cap_mask))
  201. balance_ref_count(chan);
  202. }
  203. return err;
  204. }
  205. /**
  206. * dma_chan_put - drop a reference to a dma channel's parent driver module
  207. * @chan - channel to release
  208. *
  209. * Must be called under dma_list_mutex
  210. */
  211. static void dma_chan_put(struct dma_chan *chan)
  212. {
  213. if (!chan->client_count)
  214. return; /* this channel failed alloc_chan_resources */
  215. chan->client_count--;
  216. module_put(dma_chan_to_owner(chan));
  217. if (chan->client_count == 0)
  218. chan->device->device_free_chan_resources(chan);
  219. }
  220. enum dma_status dma_sync_wait(struct dma_chan *chan, dma_cookie_t cookie)
  221. {
  222. enum dma_status status;
  223. unsigned long dma_sync_wait_timeout = jiffies + msecs_to_jiffies(5000);
  224. dma_async_issue_pending(chan);
  225. do {
  226. status = dma_async_is_tx_complete(chan, cookie, NULL, NULL);
  227. if (time_after_eq(jiffies, dma_sync_wait_timeout)) {
  228. printk(KERN_ERR "dma_sync_wait_timeout!\n");
  229. return DMA_ERROR;
  230. }
  231. } while (status == DMA_IN_PROGRESS);
  232. return status;
  233. }
  234. EXPORT_SYMBOL(dma_sync_wait);
  235. /**
  236. * dma_cap_mask_all - enable iteration over all operation types
  237. */
  238. static dma_cap_mask_t dma_cap_mask_all;
  239. /**
  240. * dma_chan_tbl_ent - tracks channel allocations per core/operation
  241. * @chan - associated channel for this entry
  242. */
  243. struct dma_chan_tbl_ent {
  244. struct dma_chan *chan;
  245. };
  246. /**
  247. * channel_table - percpu lookup table for memory-to-memory offload providers
  248. */
  249. static struct dma_chan_tbl_ent *channel_table[DMA_TX_TYPE_END];
  250. static int __init dma_channel_table_init(void)
  251. {
  252. enum dma_transaction_type cap;
  253. int err = 0;
  254. bitmap_fill(dma_cap_mask_all.bits, DMA_TX_TYPE_END);
  255. /* 'interrupt', 'private', and 'slave' are channel capabilities,
  256. * but are not associated with an operation so they do not need
  257. * an entry in the channel_table
  258. */
  259. clear_bit(DMA_INTERRUPT, dma_cap_mask_all.bits);
  260. clear_bit(DMA_PRIVATE, dma_cap_mask_all.bits);
  261. clear_bit(DMA_SLAVE, dma_cap_mask_all.bits);
  262. for_each_dma_cap_mask(cap, dma_cap_mask_all) {
  263. channel_table[cap] = alloc_percpu(struct dma_chan_tbl_ent);
  264. if (!channel_table[cap]) {
  265. err = -ENOMEM;
  266. break;
  267. }
  268. }
  269. if (err) {
  270. pr_err("dmaengine: initialization failure\n");
  271. for_each_dma_cap_mask(cap, dma_cap_mask_all)
  272. if (channel_table[cap])
  273. free_percpu(channel_table[cap]);
  274. }
  275. return err;
  276. }
  277. arch_initcall(dma_channel_table_init);
  278. /**
  279. * dma_find_channel - find a channel to carry out the operation
  280. * @tx_type: transaction type
  281. */
  282. struct dma_chan *dma_find_channel(enum dma_transaction_type tx_type)
  283. {
  284. struct dma_chan *chan;
  285. int cpu;
  286. cpu = get_cpu();
  287. chan = per_cpu_ptr(channel_table[tx_type], cpu)->chan;
  288. put_cpu();
  289. return chan;
  290. }
  291. EXPORT_SYMBOL(dma_find_channel);
  292. /**
  293. * dma_issue_pending_all - flush all pending operations across all channels
  294. */
  295. void dma_issue_pending_all(void)
  296. {
  297. struct dma_device *device;
  298. struct dma_chan *chan;
  299. rcu_read_lock();
  300. list_for_each_entry_rcu(device, &dma_device_list, global_node) {
  301. if (dma_has_cap(DMA_PRIVATE, device->cap_mask))
  302. continue;
  303. list_for_each_entry(chan, &device->channels, device_node)
  304. if (chan->client_count)
  305. device->device_issue_pending(chan);
  306. }
  307. rcu_read_unlock();
  308. }
  309. EXPORT_SYMBOL(dma_issue_pending_all);
  310. /**
  311. * nth_chan - returns the nth channel of the given capability
  312. * @cap: capability to match
  313. * @n: nth channel desired
  314. *
  315. * Defaults to returning the channel with the desired capability and the
  316. * lowest reference count when 'n' cannot be satisfied. Must be called
  317. * under dma_list_mutex.
  318. */
  319. static struct dma_chan *nth_chan(enum dma_transaction_type cap, int n)
  320. {
  321. struct dma_device *device;
  322. struct dma_chan *chan;
  323. struct dma_chan *ret = NULL;
  324. struct dma_chan *min = NULL;
  325. list_for_each_entry(device, &dma_device_list, global_node) {
  326. if (!dma_has_cap(cap, device->cap_mask) ||
  327. dma_has_cap(DMA_PRIVATE, device->cap_mask))
  328. continue;
  329. list_for_each_entry(chan, &device->channels, device_node) {
  330. if (!chan->client_count)
  331. continue;
  332. if (!min)
  333. min = chan;
  334. else if (chan->table_count < min->table_count)
  335. min = chan;
  336. if (n-- == 0) {
  337. ret = chan;
  338. break; /* done */
  339. }
  340. }
  341. if (ret)
  342. break; /* done */
  343. }
  344. if (!ret)
  345. ret = min;
  346. if (ret)
  347. ret->table_count++;
  348. return ret;
  349. }
  350. /**
  351. * dma_channel_rebalance - redistribute the available channels
  352. *
  353. * Optimize for cpu isolation (each cpu gets a dedicated channel for an
  354. * operation type) in the SMP case, and operation isolation (avoid
  355. * multi-tasking channels) in the non-SMP case. Must be called under
  356. * dma_list_mutex.
  357. */
  358. static void dma_channel_rebalance(void)
  359. {
  360. struct dma_chan *chan;
  361. struct dma_device *device;
  362. int cpu;
  363. int cap;
  364. int n;
  365. /* undo the last distribution */
  366. for_each_dma_cap_mask(cap, dma_cap_mask_all)
  367. for_each_possible_cpu(cpu)
  368. per_cpu_ptr(channel_table[cap], cpu)->chan = NULL;
  369. list_for_each_entry(device, &dma_device_list, global_node) {
  370. if (dma_has_cap(DMA_PRIVATE, device->cap_mask))
  371. continue;
  372. list_for_each_entry(chan, &device->channels, device_node)
  373. chan->table_count = 0;
  374. }
  375. /* don't populate the channel_table if no clients are available */
  376. if (!dmaengine_ref_count)
  377. return;
  378. /* redistribute available channels */
  379. n = 0;
  380. for_each_dma_cap_mask(cap, dma_cap_mask_all)
  381. for_each_online_cpu(cpu) {
  382. if (num_possible_cpus() > 1)
  383. chan = nth_chan(cap, n++);
  384. else
  385. chan = nth_chan(cap, -1);
  386. per_cpu_ptr(channel_table[cap], cpu)->chan = chan;
  387. }
  388. }
  389. static struct dma_chan *private_candidate(dma_cap_mask_t *mask, struct dma_device *dev,
  390. dma_filter_fn fn, void *fn_param)
  391. {
  392. struct dma_chan *chan;
  393. if (!__dma_device_satisfies_mask(dev, mask)) {
  394. pr_debug("%s: wrong capabilities\n", __func__);
  395. return NULL;
  396. }
  397. /* devices with multiple channels need special handling as we need to
  398. * ensure that all channels are either private or public.
  399. */
  400. if (dev->chancnt > 1 && !dma_has_cap(DMA_PRIVATE, dev->cap_mask))
  401. list_for_each_entry(chan, &dev->channels, device_node) {
  402. /* some channels are already publicly allocated */
  403. if (chan->client_count)
  404. return NULL;
  405. }
  406. list_for_each_entry(chan, &dev->channels, device_node) {
  407. if (chan->client_count) {
  408. pr_debug("%s: %s busy\n",
  409. __func__, dma_chan_name(chan));
  410. continue;
  411. }
  412. if (fn && !fn(chan, fn_param)) {
  413. pr_debug("%s: %s filter said false\n",
  414. __func__, dma_chan_name(chan));
  415. continue;
  416. }
  417. return chan;
  418. }
  419. return NULL;
  420. }
  421. /**
  422. * dma_request_channel - try to allocate an exclusive channel
  423. * @mask: capabilities that the channel must satisfy
  424. * @fn: optional callback to disposition available channels
  425. * @fn_param: opaque parameter to pass to dma_filter_fn
  426. */
  427. struct dma_chan *__dma_request_channel(dma_cap_mask_t *mask, dma_filter_fn fn, void *fn_param)
  428. {
  429. struct dma_device *device, *_d;
  430. struct dma_chan *chan = NULL;
  431. int err;
  432. /* Find a channel */
  433. mutex_lock(&dma_list_mutex);
  434. list_for_each_entry_safe(device, _d, &dma_device_list, global_node) {
  435. chan = private_candidate(mask, device, fn, fn_param);
  436. if (chan) {
  437. /* Found a suitable channel, try to grab, prep, and
  438. * return it. We first set DMA_PRIVATE to disable
  439. * balance_ref_count as this channel will not be
  440. * published in the general-purpose allocator
  441. */
  442. dma_cap_set(DMA_PRIVATE, device->cap_mask);
  443. device->privatecnt++;
  444. err = dma_chan_get(chan);
  445. if (err == -ENODEV) {
  446. pr_debug("%s: %s module removed\n", __func__,
  447. dma_chan_name(chan));
  448. list_del_rcu(&device->global_node);
  449. } else if (err)
  450. pr_err("dmaengine: failed to get %s: (%d)\n",
  451. dma_chan_name(chan), err);
  452. else
  453. break;
  454. if (--device->privatecnt == 0)
  455. dma_cap_clear(DMA_PRIVATE, device->cap_mask);
  456. chan->private = NULL;
  457. chan = NULL;
  458. }
  459. }
  460. mutex_unlock(&dma_list_mutex);
  461. pr_debug("%s: %s (%s)\n", __func__, chan ? "success" : "fail",
  462. chan ? dma_chan_name(chan) : NULL);
  463. return chan;
  464. }
  465. EXPORT_SYMBOL_GPL(__dma_request_channel);
  466. void dma_release_channel(struct dma_chan *chan)
  467. {
  468. mutex_lock(&dma_list_mutex);
  469. WARN_ONCE(chan->client_count != 1,
  470. "chan reference count %d != 1\n", chan->client_count);
  471. dma_chan_put(chan);
  472. /* drop PRIVATE cap enabled by __dma_request_channel() */
  473. if (--chan->device->privatecnt == 0)
  474. dma_cap_clear(DMA_PRIVATE, chan->device->cap_mask);
  475. chan->private = NULL;
  476. mutex_unlock(&dma_list_mutex);
  477. }
  478. EXPORT_SYMBOL_GPL(dma_release_channel);
  479. /**
  480. * dmaengine_get - register interest in dma_channels
  481. */
  482. void dmaengine_get(void)
  483. {
  484. struct dma_device *device, *_d;
  485. struct dma_chan *chan;
  486. int err;
  487. mutex_lock(&dma_list_mutex);
  488. dmaengine_ref_count++;
  489. /* try to grab channels */
  490. list_for_each_entry_safe(device, _d, &dma_device_list, global_node) {
  491. if (dma_has_cap(DMA_PRIVATE, device->cap_mask))
  492. continue;
  493. list_for_each_entry(chan, &device->channels, device_node) {
  494. err = dma_chan_get(chan);
  495. if (err == -ENODEV) {
  496. /* module removed before we could use it */
  497. list_del_rcu(&device->global_node);
  498. break;
  499. } else if (err)
  500. pr_err("dmaengine: failed to get %s: (%d)\n",
  501. dma_chan_name(chan), err);
  502. }
  503. }
  504. /* if this is the first reference and there were channels
  505. * waiting we need to rebalance to get those channels
  506. * incorporated into the channel table
  507. */
  508. if (dmaengine_ref_count == 1)
  509. dma_channel_rebalance();
  510. mutex_unlock(&dma_list_mutex);
  511. }
  512. EXPORT_SYMBOL(dmaengine_get);
  513. /**
  514. * dmaengine_put - let dma drivers be removed when ref_count == 0
  515. */
  516. void dmaengine_put(void)
  517. {
  518. struct dma_device *device;
  519. struct dma_chan *chan;
  520. mutex_lock(&dma_list_mutex);
  521. dmaengine_ref_count--;
  522. BUG_ON(dmaengine_ref_count < 0);
  523. /* drop channel references */
  524. list_for_each_entry(device, &dma_device_list, global_node) {
  525. if (dma_has_cap(DMA_PRIVATE, device->cap_mask))
  526. continue;
  527. list_for_each_entry(chan, &device->channels, device_node)
  528. dma_chan_put(chan);
  529. }
  530. mutex_unlock(&dma_list_mutex);
  531. }
  532. EXPORT_SYMBOL(dmaengine_put);
  533. static int get_dma_id(struct dma_device *device)
  534. {
  535. int rc;
  536. idr_retry:
  537. if (!idr_pre_get(&dma_idr, GFP_KERNEL))
  538. return -ENOMEM;
  539. mutex_lock(&dma_list_mutex);
  540. rc = idr_get_new(&dma_idr, NULL, &device->dev_id);
  541. mutex_unlock(&dma_list_mutex);
  542. if (rc == -EAGAIN)
  543. goto idr_retry;
  544. else if (rc != 0)
  545. return rc;
  546. return 0;
  547. }
  548. /**
  549. * dma_async_device_register - registers DMA devices found
  550. * @device: &dma_device
  551. */
  552. int dma_async_device_register(struct dma_device *device)
  553. {
  554. int chancnt = 0, rc;
  555. struct dma_chan* chan;
  556. atomic_t *idr_ref;
  557. if (!device)
  558. return -ENODEV;
  559. /* validate device routines */
  560. BUG_ON(dma_has_cap(DMA_MEMCPY, device->cap_mask) &&
  561. !device->device_prep_dma_memcpy);
  562. BUG_ON(dma_has_cap(DMA_XOR, device->cap_mask) &&
  563. !device->device_prep_dma_xor);
  564. BUG_ON(dma_has_cap(DMA_ZERO_SUM, device->cap_mask) &&
  565. !device->device_prep_dma_zero_sum);
  566. BUG_ON(dma_has_cap(DMA_MEMSET, device->cap_mask) &&
  567. !device->device_prep_dma_memset);
  568. BUG_ON(dma_has_cap(DMA_INTERRUPT, device->cap_mask) &&
  569. !device->device_prep_dma_interrupt);
  570. BUG_ON(dma_has_cap(DMA_SLAVE, device->cap_mask) &&
  571. !device->device_prep_slave_sg);
  572. BUG_ON(dma_has_cap(DMA_SLAVE, device->cap_mask) &&
  573. !device->device_terminate_all);
  574. BUG_ON(!device->device_alloc_chan_resources);
  575. BUG_ON(!device->device_free_chan_resources);
  576. BUG_ON(!device->device_is_tx_complete);
  577. BUG_ON(!device->device_issue_pending);
  578. BUG_ON(!device->dev);
  579. idr_ref = kmalloc(sizeof(*idr_ref), GFP_KERNEL);
  580. if (!idr_ref)
  581. return -ENOMEM;
  582. rc = get_dma_id(device);
  583. if (rc != 0) {
  584. kfree(idr_ref);
  585. return rc;
  586. }
  587. atomic_set(idr_ref, 0);
  588. /* represent channels in sysfs. Probably want devs too */
  589. list_for_each_entry(chan, &device->channels, device_node) {
  590. rc = -ENOMEM;
  591. chan->local = alloc_percpu(typeof(*chan->local));
  592. if (chan->local == NULL)
  593. goto err_out;
  594. chan->dev = kzalloc(sizeof(*chan->dev), GFP_KERNEL);
  595. if (chan->dev == NULL) {
  596. free_percpu(chan->local);
  597. chan->local = NULL;
  598. goto err_out;
  599. }
  600. chan->chan_id = chancnt++;
  601. chan->dev->device.class = &dma_devclass;
  602. chan->dev->device.parent = device->dev;
  603. chan->dev->chan = chan;
  604. chan->dev->idr_ref = idr_ref;
  605. chan->dev->dev_id = device->dev_id;
  606. atomic_inc(idr_ref);
  607. dev_set_name(&chan->dev->device, "dma%dchan%d",
  608. device->dev_id, chan->chan_id);
  609. rc = device_register(&chan->dev->device);
  610. if (rc) {
  611. free_percpu(chan->local);
  612. chan->local = NULL;
  613. kfree(chan->dev);
  614. atomic_dec(idr_ref);
  615. goto err_out;
  616. }
  617. chan->client_count = 0;
  618. }
  619. device->chancnt = chancnt;
  620. mutex_lock(&dma_list_mutex);
  621. /* take references on public channels */
  622. if (dmaengine_ref_count && !dma_has_cap(DMA_PRIVATE, device->cap_mask))
  623. list_for_each_entry(chan, &device->channels, device_node) {
  624. /* if clients are already waiting for channels we need
  625. * to take references on their behalf
  626. */
  627. if (dma_chan_get(chan) == -ENODEV) {
  628. /* note we can only get here for the first
  629. * channel as the remaining channels are
  630. * guaranteed to get a reference
  631. */
  632. rc = -ENODEV;
  633. mutex_unlock(&dma_list_mutex);
  634. goto err_out;
  635. }
  636. }
  637. list_add_tail_rcu(&device->global_node, &dma_device_list);
  638. if (dma_has_cap(DMA_PRIVATE, device->cap_mask))
  639. device->privatecnt++; /* Always private */
  640. dma_channel_rebalance();
  641. mutex_unlock(&dma_list_mutex);
  642. return 0;
  643. err_out:
  644. /* if we never registered a channel just release the idr */
  645. if (atomic_read(idr_ref) == 0) {
  646. mutex_lock(&dma_list_mutex);
  647. idr_remove(&dma_idr, device->dev_id);
  648. mutex_unlock(&dma_list_mutex);
  649. kfree(idr_ref);
  650. return rc;
  651. }
  652. list_for_each_entry(chan, &device->channels, device_node) {
  653. if (chan->local == NULL)
  654. continue;
  655. mutex_lock(&dma_list_mutex);
  656. chan->dev->chan = NULL;
  657. mutex_unlock(&dma_list_mutex);
  658. device_unregister(&chan->dev->device);
  659. free_percpu(chan->local);
  660. }
  661. return rc;
  662. }
  663. EXPORT_SYMBOL(dma_async_device_register);
  664. /**
  665. * dma_async_device_unregister - unregister a DMA device
  666. * @device: &dma_device
  667. *
  668. * This routine is called by dma driver exit routines, dmaengine holds module
  669. * references to prevent it being called while channels are in use.
  670. */
  671. void dma_async_device_unregister(struct dma_device *device)
  672. {
  673. struct dma_chan *chan;
  674. mutex_lock(&dma_list_mutex);
  675. list_del_rcu(&device->global_node);
  676. dma_channel_rebalance();
  677. mutex_unlock(&dma_list_mutex);
  678. list_for_each_entry(chan, &device->channels, device_node) {
  679. WARN_ONCE(chan->client_count,
  680. "%s called while %d clients hold a reference\n",
  681. __func__, chan->client_count);
  682. mutex_lock(&dma_list_mutex);
  683. chan->dev->chan = NULL;
  684. mutex_unlock(&dma_list_mutex);
  685. device_unregister(&chan->dev->device);
  686. }
  687. }
  688. EXPORT_SYMBOL(dma_async_device_unregister);
  689. /**
  690. * dma_async_memcpy_buf_to_buf - offloaded copy between virtual addresses
  691. * @chan: DMA channel to offload copy to
  692. * @dest: destination address (virtual)
  693. * @src: source address (virtual)
  694. * @len: length
  695. *
  696. * Both @dest and @src must be mappable to a bus address according to the
  697. * DMA mapping API rules for streaming mappings.
  698. * Both @dest and @src must stay memory resident (kernel memory or locked
  699. * user space pages).
  700. */
  701. dma_cookie_t
  702. dma_async_memcpy_buf_to_buf(struct dma_chan *chan, void *dest,
  703. void *src, size_t len)
  704. {
  705. struct dma_device *dev = chan->device;
  706. struct dma_async_tx_descriptor *tx;
  707. dma_addr_t dma_dest, dma_src;
  708. dma_cookie_t cookie;
  709. int cpu;
  710. dma_src = dma_map_single(dev->dev, src, len, DMA_TO_DEVICE);
  711. dma_dest = dma_map_single(dev->dev, dest, len, DMA_FROM_DEVICE);
  712. tx = dev->device_prep_dma_memcpy(chan, dma_dest, dma_src, len,
  713. DMA_CTRL_ACK);
  714. if (!tx) {
  715. dma_unmap_single(dev->dev, dma_src, len, DMA_TO_DEVICE);
  716. dma_unmap_single(dev->dev, dma_dest, len, DMA_FROM_DEVICE);
  717. return -ENOMEM;
  718. }
  719. tx->callback = NULL;
  720. cookie = tx->tx_submit(tx);
  721. cpu = get_cpu();
  722. per_cpu_ptr(chan->local, cpu)->bytes_transferred += len;
  723. per_cpu_ptr(chan->local, cpu)->memcpy_count++;
  724. put_cpu();
  725. return cookie;
  726. }
  727. EXPORT_SYMBOL(dma_async_memcpy_buf_to_buf);
  728. /**
  729. * dma_async_memcpy_buf_to_pg - offloaded copy from address to page
  730. * @chan: DMA channel to offload copy to
  731. * @page: destination page
  732. * @offset: offset in page to copy to
  733. * @kdata: source address (virtual)
  734. * @len: length
  735. *
  736. * Both @page/@offset and @kdata must be mappable to a bus address according
  737. * to the DMA mapping API rules for streaming mappings.
  738. * Both @page/@offset and @kdata must stay memory resident (kernel memory or
  739. * locked user space pages)
  740. */
  741. dma_cookie_t
  742. dma_async_memcpy_buf_to_pg(struct dma_chan *chan, struct page *page,
  743. unsigned int offset, void *kdata, size_t len)
  744. {
  745. struct dma_device *dev = chan->device;
  746. struct dma_async_tx_descriptor *tx;
  747. dma_addr_t dma_dest, dma_src;
  748. dma_cookie_t cookie;
  749. int cpu;
  750. dma_src = dma_map_single(dev->dev, kdata, len, DMA_TO_DEVICE);
  751. dma_dest = dma_map_page(dev->dev, page, offset, len, DMA_FROM_DEVICE);
  752. tx = dev->device_prep_dma_memcpy(chan, dma_dest, dma_src, len,
  753. DMA_CTRL_ACK);
  754. if (!tx) {
  755. dma_unmap_single(dev->dev, dma_src, len, DMA_TO_DEVICE);
  756. dma_unmap_page(dev->dev, dma_dest, len, DMA_FROM_DEVICE);
  757. return -ENOMEM;
  758. }
  759. tx->callback = NULL;
  760. cookie = tx->tx_submit(tx);
  761. cpu = get_cpu();
  762. per_cpu_ptr(chan->local, cpu)->bytes_transferred += len;
  763. per_cpu_ptr(chan->local, cpu)->memcpy_count++;
  764. put_cpu();
  765. return cookie;
  766. }
  767. EXPORT_SYMBOL(dma_async_memcpy_buf_to_pg);
  768. /**
  769. * dma_async_memcpy_pg_to_pg - offloaded copy from page to page
  770. * @chan: DMA channel to offload copy to
  771. * @dest_pg: destination page
  772. * @dest_off: offset in page to copy to
  773. * @src_pg: source page
  774. * @src_off: offset in page to copy from
  775. * @len: length
  776. *
  777. * Both @dest_page/@dest_off and @src_page/@src_off must be mappable to a bus
  778. * address according to the DMA mapping API rules for streaming mappings.
  779. * Both @dest_page/@dest_off and @src_page/@src_off must stay memory resident
  780. * (kernel memory or locked user space pages).
  781. */
  782. dma_cookie_t
  783. dma_async_memcpy_pg_to_pg(struct dma_chan *chan, struct page *dest_pg,
  784. unsigned int dest_off, struct page *src_pg, unsigned int src_off,
  785. size_t len)
  786. {
  787. struct dma_device *dev = chan->device;
  788. struct dma_async_tx_descriptor *tx;
  789. dma_addr_t dma_dest, dma_src;
  790. dma_cookie_t cookie;
  791. int cpu;
  792. dma_src = dma_map_page(dev->dev, src_pg, src_off, len, DMA_TO_DEVICE);
  793. dma_dest = dma_map_page(dev->dev, dest_pg, dest_off, len,
  794. DMA_FROM_DEVICE);
  795. tx = dev->device_prep_dma_memcpy(chan, dma_dest, dma_src, len,
  796. DMA_CTRL_ACK);
  797. if (!tx) {
  798. dma_unmap_page(dev->dev, dma_src, len, DMA_TO_DEVICE);
  799. dma_unmap_page(dev->dev, dma_dest, len, DMA_FROM_DEVICE);
  800. return -ENOMEM;
  801. }
  802. tx->callback = NULL;
  803. cookie = tx->tx_submit(tx);
  804. cpu = get_cpu();
  805. per_cpu_ptr(chan->local, cpu)->bytes_transferred += len;
  806. per_cpu_ptr(chan->local, cpu)->memcpy_count++;
  807. put_cpu();
  808. return cookie;
  809. }
  810. EXPORT_SYMBOL(dma_async_memcpy_pg_to_pg);
  811. void dma_async_tx_descriptor_init(struct dma_async_tx_descriptor *tx,
  812. struct dma_chan *chan)
  813. {
  814. tx->chan = chan;
  815. spin_lock_init(&tx->lock);
  816. INIT_LIST_HEAD(&tx->tx_list);
  817. }
  818. EXPORT_SYMBOL(dma_async_tx_descriptor_init);
  819. /* dma_wait_for_async_tx - spin wait for a transaction to complete
  820. * @tx: in-flight transaction to wait on
  821. *
  822. * This routine assumes that tx was obtained from a call to async_memcpy,
  823. * async_xor, async_memset, etc which ensures that tx is "in-flight" (prepped
  824. * and submitted). Walking the parent chain is only meant to cover for DMA
  825. * drivers that do not implement the DMA_INTERRUPT capability and may race with
  826. * the driver's descriptor cleanup routine.
  827. */
  828. enum dma_status
  829. dma_wait_for_async_tx(struct dma_async_tx_descriptor *tx)
  830. {
  831. enum dma_status status;
  832. struct dma_async_tx_descriptor *iter;
  833. struct dma_async_tx_descriptor *parent;
  834. if (!tx)
  835. return DMA_SUCCESS;
  836. WARN_ONCE(tx->parent, "%s: speculatively walking dependency chain for"
  837. " %s\n", __func__, dma_chan_name(tx->chan));
  838. /* poll through the dependency chain, return when tx is complete */
  839. do {
  840. iter = tx;
  841. /* find the root of the unsubmitted dependency chain */
  842. do {
  843. parent = iter->parent;
  844. if (!parent)
  845. break;
  846. else
  847. iter = parent;
  848. } while (parent);
  849. /* there is a small window for ->parent == NULL and
  850. * ->cookie == -EBUSY
  851. */
  852. while (iter->cookie == -EBUSY)
  853. cpu_relax();
  854. status = dma_sync_wait(iter->chan, iter->cookie);
  855. } while (status == DMA_IN_PROGRESS || (iter != tx));
  856. return status;
  857. }
  858. EXPORT_SYMBOL_GPL(dma_wait_for_async_tx);
  859. /* dma_run_dependencies - helper routine for dma drivers to process
  860. * (start) dependent operations on their target channel
  861. * @tx: transaction with dependencies
  862. */
  863. void dma_run_dependencies(struct dma_async_tx_descriptor *tx)
  864. {
  865. struct dma_async_tx_descriptor *dep = tx->next;
  866. struct dma_async_tx_descriptor *dep_next;
  867. struct dma_chan *chan;
  868. if (!dep)
  869. return;
  870. /* we'll submit tx->next now, so clear the link */
  871. tx->next = NULL;
  872. chan = dep->chan;
  873. /* keep submitting up until a channel switch is detected
  874. * in that case we will be called again as a result of
  875. * processing the interrupt from async_tx_channel_switch
  876. */
  877. for (; dep; dep = dep_next) {
  878. spin_lock_bh(&dep->lock);
  879. dep->parent = NULL;
  880. dep_next = dep->next;
  881. if (dep_next && dep_next->chan == chan)
  882. dep->next = NULL; /* ->next will be submitted */
  883. else
  884. dep_next = NULL; /* submit current dep and terminate */
  885. spin_unlock_bh(&dep->lock);
  886. dep->tx_submit(dep);
  887. }
  888. chan->device->device_issue_pending(chan);
  889. }
  890. EXPORT_SYMBOL_GPL(dma_run_dependencies);
  891. static int __init dma_bus_init(void)
  892. {
  893. idr_init(&dma_idr);
  894. mutex_init(&dma_list_mutex);
  895. return class_register(&dma_devclass);
  896. }
  897. arch_initcall(dma_bus_init);