iommu.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671
  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/bitmap.h>
  32. #include <linux/iommu-helper.h>
  33. #include <linux/crash_dump.h>
  34. #include <asm/io.h>
  35. #include <asm/prom.h>
  36. #include <asm/iommu.h>
  37. #include <asm/pci-bridge.h>
  38. #include <asm/machdep.h>
  39. #include <asm/kdump.h>
  40. #define DBG(...)
  41. static int novmerge;
  42. static void __iommu_free(struct iommu_table *, dma_addr_t, unsigned int);
  43. static int __init setup_iommu(char *str)
  44. {
  45. if (!strcmp(str, "novmerge"))
  46. novmerge = 1;
  47. else if (!strcmp(str, "vmerge"))
  48. novmerge = 0;
  49. return 1;
  50. }
  51. __setup("iommu=", setup_iommu);
  52. static unsigned long iommu_range_alloc(struct device *dev,
  53. struct iommu_table *tbl,
  54. unsigned long npages,
  55. unsigned long *handle,
  56. unsigned long mask,
  57. unsigned int align_order)
  58. {
  59. unsigned long n, end, start;
  60. unsigned long limit;
  61. int largealloc = npages > 15;
  62. int pass = 0;
  63. unsigned long align_mask;
  64. unsigned long boundary_size;
  65. align_mask = 0xffffffffffffffffl >> (64 - align_order);
  66. /* This allocator was derived from x86_64's bit string search */
  67. /* Sanity check */
  68. if (unlikely(npages == 0)) {
  69. if (printk_ratelimit())
  70. WARN_ON(1);
  71. return DMA_ERROR_CODE;
  72. }
  73. if (handle && *handle)
  74. start = *handle;
  75. else
  76. start = largealloc ? tbl->it_largehint : tbl->it_hint;
  77. /* Use only half of the table for small allocs (15 pages or less) */
  78. limit = largealloc ? tbl->it_size : tbl->it_halfpoint;
  79. if (largealloc && start < tbl->it_halfpoint)
  80. start = tbl->it_halfpoint;
  81. /* The case below can happen if we have a small segment appended
  82. * to a large, or when the previous alloc was at the very end of
  83. * the available space. If so, go back to the initial start.
  84. */
  85. if (start >= limit)
  86. start = largealloc ? tbl->it_largehint : tbl->it_hint;
  87. again:
  88. if (limit + tbl->it_offset > mask) {
  89. limit = mask - tbl->it_offset + 1;
  90. /* If we're constrained on address range, first try
  91. * at the masked hint to avoid O(n) search complexity,
  92. * but on second pass, start at 0.
  93. */
  94. if ((start & mask) >= limit || pass > 0)
  95. start = 0;
  96. else
  97. start &= mask;
  98. }
  99. if (dev)
  100. boundary_size = ALIGN(dma_get_seg_boundary(dev) + 1,
  101. 1 << IOMMU_PAGE_SHIFT);
  102. else
  103. boundary_size = ALIGN(1UL << 32, 1 << IOMMU_PAGE_SHIFT);
  104. /* 4GB boundary for iseries_hv_alloc and iseries_hv_map */
  105. n = iommu_area_alloc(tbl->it_map, limit, start, npages,
  106. tbl->it_offset, boundary_size >> IOMMU_PAGE_SHIFT,
  107. align_mask);
  108. if (n == -1) {
  109. if (likely(pass < 2)) {
  110. /* First failure, just rescan the half of the table.
  111. * Second failure, rescan the other half of the table.
  112. */
  113. start = (largealloc ^ pass) ? tbl->it_halfpoint : 0;
  114. limit = pass ? tbl->it_size : limit;
  115. pass++;
  116. goto again;
  117. } else {
  118. /* Third failure, give up */
  119. return DMA_ERROR_CODE;
  120. }
  121. }
  122. end = n + npages;
  123. /* Bump the hint to a new block for small allocs. */
  124. if (largealloc) {
  125. /* Don't bump to new block to avoid fragmentation */
  126. tbl->it_largehint = end;
  127. } else {
  128. /* Overflow will be taken care of at the next allocation */
  129. tbl->it_hint = (end + tbl->it_blocksize - 1) &
  130. ~(tbl->it_blocksize - 1);
  131. }
  132. /* Update handle for SG allocations */
  133. if (handle)
  134. *handle = end;
  135. return n;
  136. }
  137. static dma_addr_t iommu_alloc(struct device *dev, struct iommu_table *tbl,
  138. void *page, unsigned int npages,
  139. enum dma_data_direction direction,
  140. unsigned long mask, unsigned int align_order,
  141. struct dma_attrs *attrs)
  142. {
  143. unsigned long entry, flags;
  144. dma_addr_t ret = DMA_ERROR_CODE;
  145. int build_fail;
  146. spin_lock_irqsave(&(tbl->it_lock), flags);
  147. entry = iommu_range_alloc(dev, tbl, npages, NULL, mask, align_order);
  148. if (unlikely(entry == DMA_ERROR_CODE)) {
  149. spin_unlock_irqrestore(&(tbl->it_lock), flags);
  150. return DMA_ERROR_CODE;
  151. }
  152. entry += tbl->it_offset; /* Offset into real TCE table */
  153. ret = entry << IOMMU_PAGE_SHIFT; /* Set the return dma address */
  154. /* Put the TCEs in the HW table */
  155. build_fail = ppc_md.tce_build(tbl, entry, npages,
  156. (unsigned long)page & IOMMU_PAGE_MASK,
  157. direction, attrs);
  158. /* ppc_md.tce_build() only returns non-zero for transient errors.
  159. * Clean up the table bitmap in this case and return
  160. * DMA_ERROR_CODE. For all other errors the functionality is
  161. * not altered.
  162. */
  163. if (unlikely(build_fail)) {
  164. __iommu_free(tbl, ret, npages);
  165. spin_unlock_irqrestore(&(tbl->it_lock), flags);
  166. return DMA_ERROR_CODE;
  167. }
  168. /* Flush/invalidate TLB caches if necessary */
  169. if (ppc_md.tce_flush)
  170. ppc_md.tce_flush(tbl);
  171. spin_unlock_irqrestore(&(tbl->it_lock), flags);
  172. /* Make sure updates are seen by hardware */
  173. mb();
  174. return ret;
  175. }
  176. static void __iommu_free(struct iommu_table *tbl, dma_addr_t dma_addr,
  177. unsigned int npages)
  178. {
  179. unsigned long entry, free_entry;
  180. entry = dma_addr >> IOMMU_PAGE_SHIFT;
  181. free_entry = entry - tbl->it_offset;
  182. if (((free_entry + npages) > tbl->it_size) ||
  183. (entry < tbl->it_offset)) {
  184. if (printk_ratelimit()) {
  185. printk(KERN_INFO "iommu_free: invalid entry\n");
  186. printk(KERN_INFO "\tentry = 0x%lx\n", entry);
  187. printk(KERN_INFO "\tdma_addr = 0x%llx\n", (u64)dma_addr);
  188. printk(KERN_INFO "\tTable = 0x%llx\n", (u64)tbl);
  189. printk(KERN_INFO "\tbus# = 0x%llx\n", (u64)tbl->it_busno);
  190. printk(KERN_INFO "\tsize = 0x%llx\n", (u64)tbl->it_size);
  191. printk(KERN_INFO "\tstartOff = 0x%llx\n", (u64)tbl->it_offset);
  192. printk(KERN_INFO "\tindex = 0x%llx\n", (u64)tbl->it_index);
  193. WARN_ON(1);
  194. }
  195. return;
  196. }
  197. ppc_md.tce_free(tbl, entry, npages);
  198. bitmap_clear(tbl->it_map, free_entry, npages);
  199. }
  200. static void iommu_free(struct iommu_table *tbl, dma_addr_t dma_addr,
  201. unsigned int npages)
  202. {
  203. unsigned long flags;
  204. spin_lock_irqsave(&(tbl->it_lock), flags);
  205. __iommu_free(tbl, dma_addr, npages);
  206. /* Make sure TLB cache is flushed if the HW needs it. We do
  207. * not do an mb() here on purpose, it is not needed on any of
  208. * the current platforms.
  209. */
  210. if (ppc_md.tce_flush)
  211. ppc_md.tce_flush(tbl);
  212. spin_unlock_irqrestore(&(tbl->it_lock), flags);
  213. }
  214. int iommu_map_sg(struct device *dev, struct iommu_table *tbl,
  215. struct scatterlist *sglist, int nelems,
  216. unsigned long mask, enum dma_data_direction direction,
  217. struct dma_attrs *attrs)
  218. {
  219. dma_addr_t dma_next = 0, dma_addr;
  220. unsigned long flags;
  221. struct scatterlist *s, *outs, *segstart;
  222. int outcount, incount, i, build_fail = 0;
  223. unsigned int align;
  224. unsigned long handle;
  225. unsigned int max_seg_size;
  226. BUG_ON(direction == DMA_NONE);
  227. if ((nelems == 0) || !tbl)
  228. return 0;
  229. outs = s = segstart = &sglist[0];
  230. outcount = 1;
  231. incount = nelems;
  232. handle = 0;
  233. /* Init first segment length for backout at failure */
  234. outs->dma_length = 0;
  235. DBG("sg mapping %d elements:\n", nelems);
  236. spin_lock_irqsave(&(tbl->it_lock), flags);
  237. max_seg_size = dma_get_max_seg_size(dev);
  238. for_each_sg(sglist, s, nelems, i) {
  239. unsigned long vaddr, npages, entry, slen;
  240. slen = s->length;
  241. /* Sanity check */
  242. if (slen == 0) {
  243. dma_next = 0;
  244. continue;
  245. }
  246. /* Allocate iommu entries for that segment */
  247. vaddr = (unsigned long) sg_virt(s);
  248. npages = iommu_num_pages(vaddr, slen, IOMMU_PAGE_SIZE);
  249. align = 0;
  250. if (IOMMU_PAGE_SHIFT < PAGE_SHIFT && slen >= PAGE_SIZE &&
  251. (vaddr & ~PAGE_MASK) == 0)
  252. align = PAGE_SHIFT - IOMMU_PAGE_SHIFT;
  253. entry = iommu_range_alloc(dev, tbl, npages, &handle,
  254. mask >> IOMMU_PAGE_SHIFT, align);
  255. DBG(" - vaddr: %lx, size: %lx\n", vaddr, slen);
  256. /* Handle failure */
  257. if (unlikely(entry == DMA_ERROR_CODE)) {
  258. if (printk_ratelimit())
  259. dev_info(dev, "iommu_alloc failed, tbl %p "
  260. "vaddr %lx npages %lu\n", tbl, vaddr,
  261. npages);
  262. goto failure;
  263. }
  264. /* Convert entry to a dma_addr_t */
  265. entry += tbl->it_offset;
  266. dma_addr = entry << IOMMU_PAGE_SHIFT;
  267. dma_addr |= (s->offset & ~IOMMU_PAGE_MASK);
  268. DBG(" - %lu pages, entry: %lx, dma_addr: %lx\n",
  269. npages, entry, dma_addr);
  270. /* Insert into HW table */
  271. build_fail = ppc_md.tce_build(tbl, entry, npages,
  272. vaddr & IOMMU_PAGE_MASK,
  273. direction, attrs);
  274. if(unlikely(build_fail))
  275. goto failure;
  276. /* If we are in an open segment, try merging */
  277. if (segstart != s) {
  278. DBG(" - trying merge...\n");
  279. /* We cannot merge if:
  280. * - allocated dma_addr isn't contiguous to previous allocation
  281. */
  282. if (novmerge || (dma_addr != dma_next) ||
  283. (outs->dma_length + s->length > max_seg_size)) {
  284. /* Can't merge: create a new segment */
  285. segstart = s;
  286. outcount++;
  287. outs = sg_next(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 = sg_next(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_each_sg(sglist, s, nelems, i) {
  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_PAGE_SIZE);
  327. __iommu_free(tbl, vaddr, npages);
  328. s->dma_address = DMA_ERROR_CODE;
  329. s->dma_length = 0;
  330. }
  331. if (s == outs)
  332. break;
  333. }
  334. spin_unlock_irqrestore(&(tbl->it_lock), flags);
  335. return 0;
  336. }
  337. void iommu_unmap_sg(struct iommu_table *tbl, struct scatterlist *sglist,
  338. int nelems, enum dma_data_direction direction,
  339. struct dma_attrs *attrs)
  340. {
  341. struct scatterlist *sg;
  342. unsigned long flags;
  343. BUG_ON(direction == DMA_NONE);
  344. if (!tbl)
  345. return;
  346. spin_lock_irqsave(&(tbl->it_lock), flags);
  347. sg = sglist;
  348. while (nelems--) {
  349. unsigned int npages;
  350. dma_addr_t dma_handle = sg->dma_address;
  351. if (sg->dma_length == 0)
  352. break;
  353. npages = iommu_num_pages(dma_handle, sg->dma_length,
  354. IOMMU_PAGE_SIZE);
  355. __iommu_free(tbl, dma_handle, npages);
  356. sg = sg_next(sg);
  357. }
  358. /* Flush/invalidate TLBs if necessary. As for iommu_free(), we
  359. * do not do an mb() here, the affected platforms do not need it
  360. * when freeing.
  361. */
  362. if (ppc_md.tce_flush)
  363. ppc_md.tce_flush(tbl);
  364. spin_unlock_irqrestore(&(tbl->it_lock), flags);
  365. }
  366. static void iommu_table_clear(struct iommu_table *tbl)
  367. {
  368. if (!is_kdump_kernel()) {
  369. /* Clear the table in case firmware left allocations in it */
  370. ppc_md.tce_free(tbl, tbl->it_offset, tbl->it_size);
  371. return;
  372. }
  373. #ifdef CONFIG_CRASH_DUMP
  374. if (ppc_md.tce_get) {
  375. unsigned long index, tceval, tcecount = 0;
  376. /* Reserve the existing mappings left by the first kernel. */
  377. for (index = 0; index < tbl->it_size; index++) {
  378. tceval = ppc_md.tce_get(tbl, index + tbl->it_offset);
  379. /*
  380. * Freed TCE entry contains 0x7fffffffffffffff on JS20
  381. */
  382. if (tceval && (tceval != 0x7fffffffffffffffUL)) {
  383. __set_bit(index, tbl->it_map);
  384. tcecount++;
  385. }
  386. }
  387. if ((tbl->it_size - tcecount) < KDUMP_MIN_TCE_ENTRIES) {
  388. printk(KERN_WARNING "TCE table is full; freeing ");
  389. printk(KERN_WARNING "%d entries for the kdump boot\n",
  390. KDUMP_MIN_TCE_ENTRIES);
  391. for (index = tbl->it_size - KDUMP_MIN_TCE_ENTRIES;
  392. index < tbl->it_size; index++)
  393. __clear_bit(index, tbl->it_map);
  394. }
  395. }
  396. #endif
  397. }
  398. /*
  399. * Build a iommu_table structure. This contains a bit map which
  400. * is used to manage allocation of the tce space.
  401. */
  402. struct iommu_table *iommu_init_table(struct iommu_table *tbl, int nid)
  403. {
  404. unsigned long sz;
  405. static int welcomed = 0;
  406. struct page *page;
  407. /* Set aside 1/4 of the table for large allocations. */
  408. tbl->it_halfpoint = tbl->it_size * 3 / 4;
  409. /* number of bytes needed for the bitmap */
  410. sz = (tbl->it_size + 7) >> 3;
  411. page = alloc_pages_node(nid, GFP_ATOMIC, get_order(sz));
  412. if (!page)
  413. panic("iommu_init_table: Can't allocate %ld bytes\n", sz);
  414. tbl->it_map = page_address(page);
  415. memset(tbl->it_map, 0, sz);
  416. tbl->it_hint = 0;
  417. tbl->it_largehint = tbl->it_halfpoint;
  418. spin_lock_init(&tbl->it_lock);
  419. iommu_table_clear(tbl);
  420. if (!welcomed) {
  421. printk(KERN_INFO "IOMMU table initialized, virtual merging %s\n",
  422. novmerge ? "disabled" : "enabled");
  423. welcomed = 1;
  424. }
  425. return tbl;
  426. }
  427. void iommu_free_table(struct iommu_table *tbl, const char *node_name)
  428. {
  429. unsigned long bitmap_sz, i;
  430. unsigned int order;
  431. if (!tbl || !tbl->it_map) {
  432. printk(KERN_ERR "%s: expected TCE map for %s\n", __func__,
  433. node_name);
  434. return;
  435. }
  436. /* verify that table contains no entries */
  437. /* it_size is in entries, and we're examining 64 at a time */
  438. for (i = 0; i < (tbl->it_size/64); i++) {
  439. if (tbl->it_map[i] != 0) {
  440. printk(KERN_WARNING "%s: Unexpected TCEs for %s\n",
  441. __func__, node_name);
  442. break;
  443. }
  444. }
  445. /* calculate bitmap size in bytes */
  446. bitmap_sz = (tbl->it_size + 7) / 8;
  447. /* free bitmap */
  448. order = get_order(bitmap_sz);
  449. free_pages((unsigned long) tbl->it_map, order);
  450. /* free table */
  451. kfree(tbl);
  452. }
  453. /* Creates TCEs for a user provided buffer. The user buffer must be
  454. * contiguous real kernel storage (not vmalloc). The address passed here
  455. * comprises a page address and offset into that page. The dma_addr_t
  456. * returned will point to the same byte within the page as was passed in.
  457. */
  458. dma_addr_t iommu_map_page(struct device *dev, struct iommu_table *tbl,
  459. struct page *page, unsigned long offset, size_t size,
  460. unsigned long mask, enum dma_data_direction direction,
  461. struct dma_attrs *attrs)
  462. {
  463. dma_addr_t dma_handle = DMA_ERROR_CODE;
  464. void *vaddr;
  465. unsigned long uaddr;
  466. unsigned int npages, align;
  467. BUG_ON(direction == DMA_NONE);
  468. vaddr = page_address(page) + offset;
  469. uaddr = (unsigned long)vaddr;
  470. npages = iommu_num_pages(uaddr, size, IOMMU_PAGE_SIZE);
  471. if (tbl) {
  472. align = 0;
  473. if (IOMMU_PAGE_SHIFT < PAGE_SHIFT && size >= PAGE_SIZE &&
  474. ((unsigned long)vaddr & ~PAGE_MASK) == 0)
  475. align = PAGE_SHIFT - IOMMU_PAGE_SHIFT;
  476. dma_handle = iommu_alloc(dev, tbl, vaddr, npages, direction,
  477. mask >> IOMMU_PAGE_SHIFT, align,
  478. attrs);
  479. if (dma_handle == DMA_ERROR_CODE) {
  480. if (printk_ratelimit()) {
  481. dev_info(dev, "iommu_alloc failed, tbl %p "
  482. "vaddr %p npages %d\n", tbl, vaddr,
  483. npages);
  484. }
  485. } else
  486. dma_handle |= (uaddr & ~IOMMU_PAGE_MASK);
  487. }
  488. return dma_handle;
  489. }
  490. void iommu_unmap_page(struct iommu_table *tbl, dma_addr_t dma_handle,
  491. size_t size, enum dma_data_direction direction,
  492. struct dma_attrs *attrs)
  493. {
  494. unsigned int npages;
  495. BUG_ON(direction == DMA_NONE);
  496. if (tbl) {
  497. npages = iommu_num_pages(dma_handle, size, IOMMU_PAGE_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 device *dev, struct iommu_table *tbl,
  506. size_t size, dma_addr_t *dma_handle,
  507. unsigned long mask, gfp_t flag, int node)
  508. {
  509. void *ret = NULL;
  510. dma_addr_t mapping;
  511. unsigned int order;
  512. unsigned int nio_pages, io_order;
  513. struct page *page;
  514. size = PAGE_ALIGN(size);
  515. order = get_order(size);
  516. /*
  517. * Client asked for way too much space. This is checked later
  518. * anyway. It is easier to debug here for the drivers than in
  519. * the tce tables.
  520. */
  521. if (order >= IOMAP_MAX_ORDER) {
  522. dev_info(dev, "iommu_alloc_consistent size too large: 0x%lx\n",
  523. size);
  524. return NULL;
  525. }
  526. if (!tbl)
  527. return NULL;
  528. /* Alloc enough pages (and possibly more) */
  529. page = alloc_pages_node(node, flag, order);
  530. if (!page)
  531. return NULL;
  532. ret = page_address(page);
  533. memset(ret, 0, size);
  534. /* Set up tces to cover the allocated range */
  535. nio_pages = size >> IOMMU_PAGE_SHIFT;
  536. io_order = get_iommu_order(size);
  537. mapping = iommu_alloc(dev, tbl, ret, nio_pages, DMA_BIDIRECTIONAL,
  538. mask >> IOMMU_PAGE_SHIFT, io_order, NULL);
  539. if (mapping == DMA_ERROR_CODE) {
  540. free_pages((unsigned long)ret, order);
  541. return NULL;
  542. }
  543. *dma_handle = mapping;
  544. return ret;
  545. }
  546. void iommu_free_coherent(struct iommu_table *tbl, size_t size,
  547. void *vaddr, dma_addr_t dma_handle)
  548. {
  549. if (tbl) {
  550. unsigned int nio_pages;
  551. size = PAGE_ALIGN(size);
  552. nio_pages = size >> IOMMU_PAGE_SHIFT;
  553. iommu_free(tbl, dma_handle, nio_pages);
  554. size = PAGE_ALIGN(size);
  555. free_pages((unsigned long)vaddr, get_order(size));
  556. }
  557. }