iommu.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678
  1. /*
  2. * Copyright (C) 2001 Mike Corrigan & Dave Engebretsen, IBM Corporation
  3. *
  4. * Rewrite, cleanup, new allocation schemes, virtual merging:
  5. * Copyright (C) 2004 Olof Johansson, IBM Corporation
  6. * and Ben. Herrenschmidt, IBM Corporation
  7. *
  8. * Dynamic DMA mapping support, bus-independent parts.
  9. *
  10. * This program is free software; you can redistribute it and/or modify
  11. * it under the terms of the GNU General Public License as published by
  12. * the Free Software Foundation; either version 2 of the License, or
  13. * (at your option) any later version.
  14. *
  15. * This program is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  18. * GNU General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU General Public License
  21. * along with this program; if not, write to the Free Software
  22. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  23. */
  24. #include <linux/init.h>
  25. #include <linux/types.h>
  26. #include <linux/slab.h>
  27. #include <linux/mm.h>
  28. #include <linux/spinlock.h>
  29. #include <linux/string.h>
  30. #include <linux/dma-mapping.h>
  31. #include <linux/init.h>
  32. #include <linux/bitops.h>
  33. #include <asm/io.h>
  34. #include <asm/prom.h>
  35. #include <asm/iommu.h>
  36. #include <asm/pci-bridge.h>
  37. #include <asm/machdep.h>
  38. #include <asm/kdump.h>
  39. #define DBG(...)
  40. #ifdef CONFIG_IOMMU_VMERGE
  41. static int novmerge = 0;
  42. #else
  43. static int novmerge = 1;
  44. #endif
  45. static int protect4gb = 1;
  46. static inline unsigned long iommu_num_pages(unsigned long vaddr,
  47. unsigned long slen)
  48. {
  49. unsigned long npages;
  50. npages = IOMMU_PAGE_ALIGN(vaddr + slen) - (vaddr & IOMMU_PAGE_MASK);
  51. npages >>= IOMMU_PAGE_SHIFT;
  52. return npages;
  53. }
  54. static int __init setup_protect4gb(char *str)
  55. {
  56. if (strcmp(str, "on") == 0)
  57. protect4gb = 1;
  58. else if (strcmp(str, "off") == 0)
  59. protect4gb = 0;
  60. return 1;
  61. }
  62. static int __init setup_iommu(char *str)
  63. {
  64. if (!strcmp(str, "novmerge"))
  65. novmerge = 1;
  66. else if (!strcmp(str, "vmerge"))
  67. novmerge = 0;
  68. return 1;
  69. }
  70. __setup("protect4gb=", setup_protect4gb);
  71. __setup("iommu=", setup_iommu);
  72. static unsigned long iommu_range_alloc(struct iommu_table *tbl,
  73. unsigned long npages,
  74. unsigned long *handle,
  75. unsigned long mask,
  76. unsigned int align_order)
  77. {
  78. unsigned long n, end, i, start;
  79. unsigned long start_addr, end_addr;
  80. unsigned long limit;
  81. int largealloc = npages > 15;
  82. int pass = 0;
  83. unsigned long align_mask;
  84. align_mask = 0xffffffffffffffffl >> (64 - align_order);
  85. /* This allocator was derived from x86_64's bit string search */
  86. /* Sanity check */
  87. if (unlikely(npages == 0)) {
  88. if (printk_ratelimit())
  89. WARN_ON(1);
  90. return DMA_ERROR_CODE;
  91. }
  92. if (handle && *handle)
  93. start = *handle;
  94. else
  95. start = largealloc ? tbl->it_largehint : tbl->it_hint;
  96. /* Use only half of the table for small allocs (15 pages or less) */
  97. limit = largealloc ? tbl->it_size : tbl->it_halfpoint;
  98. if (largealloc && start < tbl->it_halfpoint)
  99. start = tbl->it_halfpoint;
  100. /* The case below can happen if we have a small segment appended
  101. * to a large, or when the previous alloc was at the very end of
  102. * the available space. If so, go back to the initial start.
  103. */
  104. if (start >= limit)
  105. start = largealloc ? tbl->it_largehint : tbl->it_hint;
  106. again:
  107. if (limit + tbl->it_offset > mask) {
  108. limit = mask - tbl->it_offset + 1;
  109. /* If we're constrained on address range, first try
  110. * at the masked hint to avoid O(n) search complexity,
  111. * but on second pass, start at 0.
  112. */
  113. if ((start & mask) >= limit || pass > 0)
  114. start = 0;
  115. else
  116. start &= mask;
  117. }
  118. n = find_next_zero_bit(tbl->it_map, limit, start);
  119. /* Align allocation */
  120. n = (n + align_mask) & ~align_mask;
  121. end = n + npages;
  122. if (unlikely(end >= limit)) {
  123. if (likely(pass < 2)) {
  124. /* First failure, just rescan the half of the table.
  125. * Second failure, rescan the other half of the table.
  126. */
  127. start = (largealloc ^ pass) ? tbl->it_halfpoint : 0;
  128. limit = pass ? tbl->it_size : limit;
  129. pass++;
  130. goto again;
  131. } else {
  132. /* Third failure, give up */
  133. return DMA_ERROR_CODE;
  134. }
  135. }
  136. /* DMA cannot cross 4 GB boundary */
  137. start_addr = (n + tbl->it_offset) << PAGE_SHIFT;
  138. end_addr = (end + tbl->it_offset) << PAGE_SHIFT;
  139. if ((start_addr >> 32) != (end_addr >> 32)) {
  140. end_addr &= 0xffffffff00000000l;
  141. start = (end_addr >> PAGE_SHIFT) - tbl->it_offset;
  142. goto again;
  143. }
  144. for (i = n; i < end; i++)
  145. if (test_bit(i, tbl->it_map)) {
  146. start = i+1;
  147. goto again;
  148. }
  149. for (i = n; i < end; i++)
  150. __set_bit(i, tbl->it_map);
  151. /* Bump the hint to a new block for small allocs. */
  152. if (largealloc) {
  153. /* Don't bump to new block to avoid fragmentation */
  154. tbl->it_largehint = end;
  155. } else {
  156. /* Overflow will be taken care of at the next allocation */
  157. tbl->it_hint = (end + tbl->it_blocksize - 1) &
  158. ~(tbl->it_blocksize - 1);
  159. }
  160. /* Update handle for SG allocations */
  161. if (handle)
  162. *handle = end;
  163. return n;
  164. }
  165. static dma_addr_t iommu_alloc(struct iommu_table *tbl, void *page,
  166. unsigned int npages, enum dma_data_direction direction,
  167. unsigned long mask, unsigned int align_order)
  168. {
  169. unsigned long entry, flags;
  170. dma_addr_t ret = DMA_ERROR_CODE;
  171. spin_lock_irqsave(&(tbl->it_lock), flags);
  172. entry = iommu_range_alloc(tbl, npages, NULL, mask, align_order);
  173. if (unlikely(entry == DMA_ERROR_CODE)) {
  174. spin_unlock_irqrestore(&(tbl->it_lock), flags);
  175. return DMA_ERROR_CODE;
  176. }
  177. entry += tbl->it_offset; /* Offset into real TCE table */
  178. ret = entry << IOMMU_PAGE_SHIFT; /* Set the return dma address */
  179. /* Put the TCEs in the HW table */
  180. ppc_md.tce_build(tbl, entry, npages, (unsigned long)page & IOMMU_PAGE_MASK,
  181. direction);
  182. /* Flush/invalidate TLB caches if necessary */
  183. if (ppc_md.tce_flush)
  184. ppc_md.tce_flush(tbl);
  185. spin_unlock_irqrestore(&(tbl->it_lock), flags);
  186. /* Make sure updates are seen by hardware */
  187. mb();
  188. return ret;
  189. }
  190. static void __iommu_free(struct iommu_table *tbl, dma_addr_t dma_addr,
  191. unsigned int npages)
  192. {
  193. unsigned long entry, free_entry;
  194. unsigned long i;
  195. entry = dma_addr >> IOMMU_PAGE_SHIFT;
  196. free_entry = entry - tbl->it_offset;
  197. if (((free_entry + npages) > tbl->it_size) ||
  198. (entry < tbl->it_offset)) {
  199. if (printk_ratelimit()) {
  200. printk(KERN_INFO "iommu_free: invalid entry\n");
  201. printk(KERN_INFO "\tentry = 0x%lx\n", entry);
  202. printk(KERN_INFO "\tdma_addr = 0x%lx\n", (u64)dma_addr);
  203. printk(KERN_INFO "\tTable = 0x%lx\n", (u64)tbl);
  204. printk(KERN_INFO "\tbus# = 0x%lx\n", (u64)tbl->it_busno);
  205. printk(KERN_INFO "\tsize = 0x%lx\n", (u64)tbl->it_size);
  206. printk(KERN_INFO "\tstartOff = 0x%lx\n", (u64)tbl->it_offset);
  207. printk(KERN_INFO "\tindex = 0x%lx\n", (u64)tbl->it_index);
  208. WARN_ON(1);
  209. }
  210. return;
  211. }
  212. ppc_md.tce_free(tbl, entry, npages);
  213. for (i = 0; i < npages; i++)
  214. __clear_bit(free_entry+i, tbl->it_map);
  215. }
  216. static void iommu_free(struct iommu_table *tbl, dma_addr_t dma_addr,
  217. unsigned int npages)
  218. {
  219. unsigned long flags;
  220. spin_lock_irqsave(&(tbl->it_lock), flags);
  221. __iommu_free(tbl, dma_addr, npages);
  222. /* Make sure TLB cache is flushed if the HW needs it. We do
  223. * not do an mb() here on purpose, it is not needed on any of
  224. * the current platforms.
  225. */
  226. if (ppc_md.tce_flush)
  227. ppc_md.tce_flush(tbl);
  228. spin_unlock_irqrestore(&(tbl->it_lock), flags);
  229. }
  230. int iommu_map_sg(struct iommu_table *tbl, struct scatterlist *sglist,
  231. int nelems, unsigned long mask,
  232. enum dma_data_direction direction)
  233. {
  234. dma_addr_t dma_next = 0, dma_addr;
  235. unsigned long flags;
  236. struct scatterlist *s, *outs, *segstart;
  237. int outcount, incount;
  238. unsigned long handle;
  239. BUG_ON(direction == DMA_NONE);
  240. if ((nelems == 0) || !tbl)
  241. return 0;
  242. outs = s = segstart = &sglist[0];
  243. outcount = 1;
  244. incount = nelems;
  245. handle = 0;
  246. /* Init first segment length for backout at failure */
  247. outs->dma_length = 0;
  248. DBG("sg mapping %d elements:\n", nelems);
  249. spin_lock_irqsave(&(tbl->it_lock), flags);
  250. for (s = outs; nelems; nelems--, s++) {
  251. unsigned long vaddr, npages, entry, slen;
  252. slen = s->length;
  253. /* Sanity check */
  254. if (slen == 0) {
  255. dma_next = 0;
  256. continue;
  257. }
  258. /* Allocate iommu entries for that segment */
  259. vaddr = (unsigned long)page_address(s->page) + s->offset;
  260. npages = iommu_num_pages(vaddr, slen);
  261. entry = iommu_range_alloc(tbl, npages, &handle, mask >> IOMMU_PAGE_SHIFT, 0);
  262. DBG(" - vaddr: %lx, size: %lx\n", vaddr, slen);
  263. /* Handle failure */
  264. if (unlikely(entry == DMA_ERROR_CODE)) {
  265. if (printk_ratelimit())
  266. printk(KERN_INFO "iommu_alloc failed, tbl %p vaddr %lx"
  267. " npages %lx\n", tbl, vaddr, npages);
  268. goto failure;
  269. }
  270. /* Convert entry to a dma_addr_t */
  271. entry += tbl->it_offset;
  272. dma_addr = entry << IOMMU_PAGE_SHIFT;
  273. dma_addr |= (s->offset & ~IOMMU_PAGE_MASK);
  274. DBG(" - %lu pages, entry: %lx, dma_addr: %lx\n",
  275. npages, entry, dma_addr);
  276. /* Insert into HW table */
  277. ppc_md.tce_build(tbl, entry, npages, vaddr & IOMMU_PAGE_MASK, direction);
  278. /* If we are in an open segment, try merging */
  279. if (segstart != s) {
  280. DBG(" - trying merge...\n");
  281. /* We cannot merge if:
  282. * - allocated dma_addr isn't contiguous to previous allocation
  283. */
  284. if (novmerge || (dma_addr != dma_next)) {
  285. /* Can't merge: create a new segment */
  286. segstart = s;
  287. outcount++; outs++;
  288. DBG(" can't merge, new segment.\n");
  289. } else {
  290. outs->dma_length += s->length;
  291. DBG(" merged, new len: %ux\n", outs->dma_length);
  292. }
  293. }
  294. if (segstart == s) {
  295. /* This is a new segment, fill entries */
  296. DBG(" - filling new segment.\n");
  297. outs->dma_address = dma_addr;
  298. outs->dma_length = slen;
  299. }
  300. /* Calculate next page pointer for contiguous check */
  301. dma_next = dma_addr + slen;
  302. DBG(" - dma next is: %lx\n", dma_next);
  303. }
  304. /* Flush/invalidate TLB caches if necessary */
  305. if (ppc_md.tce_flush)
  306. ppc_md.tce_flush(tbl);
  307. spin_unlock_irqrestore(&(tbl->it_lock), flags);
  308. DBG("mapped %d elements:\n", outcount);
  309. /* For the sake of iommu_unmap_sg, we clear out the length in the
  310. * next entry of the sglist if we didn't fill the list completely
  311. */
  312. if (outcount < incount) {
  313. outs++;
  314. outs->dma_address = DMA_ERROR_CODE;
  315. outs->dma_length = 0;
  316. }
  317. /* Make sure updates are seen by hardware */
  318. mb();
  319. return outcount;
  320. failure:
  321. for (s = &sglist[0]; s <= outs; s++) {
  322. if (s->dma_length != 0) {
  323. unsigned long vaddr, npages;
  324. vaddr = s->dma_address & IOMMU_PAGE_MASK;
  325. npages = iommu_num_pages(s->dma_address, s->dma_length);
  326. __iommu_free(tbl, vaddr, npages);
  327. s->dma_address = DMA_ERROR_CODE;
  328. s->dma_length = 0;
  329. }
  330. }
  331. spin_unlock_irqrestore(&(tbl->it_lock), flags);
  332. return 0;
  333. }
  334. void iommu_unmap_sg(struct iommu_table *tbl, struct scatterlist *sglist,
  335. int nelems, enum dma_data_direction direction)
  336. {
  337. unsigned long flags;
  338. BUG_ON(direction == DMA_NONE);
  339. if (!tbl)
  340. return;
  341. spin_lock_irqsave(&(tbl->it_lock), flags);
  342. while (nelems--) {
  343. unsigned int npages;
  344. dma_addr_t dma_handle = sglist->dma_address;
  345. if (sglist->dma_length == 0)
  346. break;
  347. npages = iommu_num_pages(dma_handle,sglist->dma_length);
  348. __iommu_free(tbl, dma_handle, npages);
  349. sglist++;
  350. }
  351. /* Flush/invalidate TLBs if necessary. As for iommu_free(), we
  352. * do not do an mb() here, the affected platforms do not need it
  353. * when freeing.
  354. */
  355. if (ppc_md.tce_flush)
  356. ppc_md.tce_flush(tbl);
  357. spin_unlock_irqrestore(&(tbl->it_lock), flags);
  358. }
  359. /*
  360. * Build a iommu_table structure. This contains a bit map which
  361. * is used to manage allocation of the tce space.
  362. */
  363. struct iommu_table *iommu_init_table(struct iommu_table *tbl, int nid)
  364. {
  365. unsigned long sz;
  366. unsigned long start_index, end_index;
  367. unsigned long entries_per_4g;
  368. unsigned long index;
  369. static int welcomed = 0;
  370. struct page *page;
  371. /* Set aside 1/4 of the table for large allocations. */
  372. tbl->it_halfpoint = tbl->it_size * 3 / 4;
  373. /* number of bytes needed for the bitmap */
  374. sz = (tbl->it_size + 7) >> 3;
  375. page = alloc_pages_node(nid, GFP_ATOMIC, get_order(sz));
  376. if (!page)
  377. panic("iommu_init_table: Can't allocate %ld bytes\n", sz);
  378. tbl->it_map = page_address(page);
  379. memset(tbl->it_map, 0, sz);
  380. tbl->it_hint = 0;
  381. tbl->it_largehint = tbl->it_halfpoint;
  382. spin_lock_init(&tbl->it_lock);
  383. #ifdef CONFIG_CRASH_DUMP
  384. if (ppc_md.tce_get) {
  385. unsigned long tceval;
  386. unsigned long tcecount = 0;
  387. /*
  388. * Reserve the existing mappings left by the first kernel.
  389. */
  390. for (index = 0; index < tbl->it_size; index++) {
  391. tceval = ppc_md.tce_get(tbl, index + tbl->it_offset);
  392. /*
  393. * Freed TCE entry contains 0x7fffffffffffffff on JS20
  394. */
  395. if (tceval && (tceval != 0x7fffffffffffffffUL)) {
  396. __set_bit(index, tbl->it_map);
  397. tcecount++;
  398. }
  399. }
  400. if ((tbl->it_size - tcecount) < KDUMP_MIN_TCE_ENTRIES) {
  401. printk(KERN_WARNING "TCE table is full; ");
  402. printk(KERN_WARNING "freeing %d entries for the kdump boot\n",
  403. KDUMP_MIN_TCE_ENTRIES);
  404. for (index = tbl->it_size - KDUMP_MIN_TCE_ENTRIES;
  405. index < tbl->it_size; index++)
  406. __clear_bit(index, tbl->it_map);
  407. }
  408. }
  409. #else
  410. /* Clear the hardware table in case firmware left allocations in it */
  411. ppc_md.tce_free(tbl, tbl->it_offset, tbl->it_size);
  412. #endif
  413. /*
  414. * DMA cannot cross 4 GB boundary. Mark last entry of each 4
  415. * GB chunk as reserved.
  416. */
  417. if (protect4gb) {
  418. entries_per_4g = 0x100000000l >> IOMMU_PAGE_SHIFT;
  419. /* Mark the last bit before a 4GB boundary as used */
  420. start_index = tbl->it_offset | (entries_per_4g - 1);
  421. start_index -= tbl->it_offset;
  422. end_index = tbl->it_size;
  423. for (index = start_index; index < end_index - 1; index += entries_per_4g)
  424. __set_bit(index, tbl->it_map);
  425. }
  426. if (!welcomed) {
  427. printk(KERN_INFO "IOMMU table initialized, virtual merging %s\n",
  428. novmerge ? "disabled" : "enabled");
  429. welcomed = 1;
  430. }
  431. return tbl;
  432. }
  433. void iommu_free_table(struct device_node *dn)
  434. {
  435. struct pci_dn *pdn = dn->data;
  436. struct iommu_table *tbl = pdn->iommu_table;
  437. unsigned long bitmap_sz, i;
  438. unsigned int order;
  439. if (!tbl || !tbl->it_map) {
  440. printk(KERN_ERR "%s: expected TCE map for %s\n", __FUNCTION__,
  441. dn->full_name);
  442. return;
  443. }
  444. /* verify that table contains no entries */
  445. /* it_size is in entries, and we're examining 64 at a time */
  446. for (i = 0; i < (tbl->it_size/64); i++) {
  447. if (tbl->it_map[i] != 0) {
  448. printk(KERN_WARNING "%s: Unexpected TCEs for %s\n",
  449. __FUNCTION__, dn->full_name);
  450. break;
  451. }
  452. }
  453. /* calculate bitmap size in bytes */
  454. bitmap_sz = (tbl->it_size + 7) / 8;
  455. /* free bitmap */
  456. order = get_order(bitmap_sz);
  457. free_pages((unsigned long) tbl->it_map, order);
  458. /* free table */
  459. kfree(tbl);
  460. }
  461. /* Creates TCEs for a user provided buffer. The user buffer must be
  462. * contiguous real kernel storage (not vmalloc). The address of the buffer
  463. * passed here is the kernel (virtual) address of the buffer. The buffer
  464. * need not be page aligned, the dma_addr_t returned will point to the same
  465. * byte within the page as vaddr.
  466. */
  467. dma_addr_t iommu_map_single(struct iommu_table *tbl, void *vaddr,
  468. size_t size, unsigned long mask,
  469. enum dma_data_direction direction)
  470. {
  471. dma_addr_t dma_handle = DMA_ERROR_CODE;
  472. unsigned long uaddr;
  473. unsigned int npages;
  474. BUG_ON(direction == DMA_NONE);
  475. uaddr = (unsigned long)vaddr;
  476. npages = iommu_num_pages(uaddr, size);
  477. if (tbl) {
  478. dma_handle = iommu_alloc(tbl, vaddr, npages, direction,
  479. mask >> IOMMU_PAGE_SHIFT, 0);
  480. if (dma_handle == DMA_ERROR_CODE) {
  481. if (printk_ratelimit()) {
  482. printk(KERN_INFO "iommu_alloc failed, "
  483. "tbl %p vaddr %p npages %d\n",
  484. tbl, vaddr, npages);
  485. }
  486. } else
  487. dma_handle |= (uaddr & ~IOMMU_PAGE_MASK);
  488. }
  489. return dma_handle;
  490. }
  491. void iommu_unmap_single(struct iommu_table *tbl, dma_addr_t dma_handle,
  492. size_t size, enum dma_data_direction direction)
  493. {
  494. unsigned int npages;
  495. BUG_ON(direction == DMA_NONE);
  496. if (tbl) {
  497. npages = iommu_num_pages(dma_handle, size);
  498. iommu_free(tbl, dma_handle, npages);
  499. }
  500. }
  501. /* Allocates a contiguous real buffer and creates mappings over it.
  502. * Returns the virtual address of the buffer and sets dma_handle
  503. * to the dma address (mapping) of the first page.
  504. */
  505. void *iommu_alloc_coherent(struct iommu_table *tbl, size_t size,
  506. dma_addr_t *dma_handle, unsigned long mask, gfp_t flag, int node)
  507. {
  508. void *ret = NULL;
  509. dma_addr_t mapping;
  510. unsigned int order;
  511. unsigned int nio_pages, io_order;
  512. struct page *page;
  513. size = PAGE_ALIGN(size);
  514. order = get_order(size);
  515. /*
  516. * Client asked for way too much space. This is checked later
  517. * anyway. It is easier to debug here for the drivers than in
  518. * the tce tables.
  519. */
  520. if (order >= IOMAP_MAX_ORDER) {
  521. printk("iommu_alloc_consistent size too large: 0x%lx\n", size);
  522. return NULL;
  523. }
  524. if (!tbl)
  525. return NULL;
  526. /* Alloc enough pages (and possibly more) */
  527. page = alloc_pages_node(node, flag, order);
  528. if (!page)
  529. return NULL;
  530. ret = page_address(page);
  531. memset(ret, 0, size);
  532. /* Set up tces to cover the allocated range */
  533. nio_pages = size >> IOMMU_PAGE_SHIFT;
  534. io_order = get_iommu_order(size);
  535. mapping = iommu_alloc(tbl, ret, nio_pages, DMA_BIDIRECTIONAL,
  536. mask >> IOMMU_PAGE_SHIFT, io_order);
  537. if (mapping == DMA_ERROR_CODE) {
  538. free_pages((unsigned long)ret, order);
  539. return NULL;
  540. }
  541. *dma_handle = mapping;
  542. return ret;
  543. }
  544. void iommu_free_coherent(struct iommu_table *tbl, size_t size,
  545. void *vaddr, dma_addr_t dma_handle)
  546. {
  547. if (tbl) {
  548. unsigned int nio_pages;
  549. size = PAGE_ALIGN(size);
  550. nio_pages = size >> IOMMU_PAGE_SHIFT;
  551. iommu_free(tbl, dma_handle, nio_pages);
  552. size = PAGE_ALIGN(size);
  553. free_pages((unsigned long)vaddr, get_order(size));
  554. }
  555. }