iommu_common.c 5.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248
  1. /* $Id: iommu_common.c,v 1.9 2001/12/17 07:05:09 davem Exp $
  2. * iommu_common.c: UltraSparc SBUS/PCI common iommu code.
  3. *
  4. * Copyright (C) 1999 David S. Miller (davem@redhat.com)
  5. */
  6. #include <linux/dma-mapping.h>
  7. #include "iommu_common.h"
  8. /* You are _strongly_ advised to enable the following debugging code
  9. * any time you make changes to the sg code below, run it for a while
  10. * with filesystems mounted read-only before buying the farm... -DaveM
  11. */
  12. #ifdef VERIFY_SG
  13. static int verify_lengths(struct scatterlist *sglist, int nents, int npages)
  14. {
  15. int sg_len, dma_len;
  16. int i, pgcount;
  17. struct scatterlist *sg;
  18. sg_len = 0;
  19. for_each_sg(sglist, sg, nents, i)
  20. sg_len += sg->length;
  21. dma_len = 0;
  22. for_each_sg(sglist, sg, nents, i) {
  23. if (!sg->dma_length)
  24. break;
  25. dma_len += sg->dma_length;
  26. }
  27. if (sg_len != dma_len) {
  28. printk("verify_lengths: Error, different, sg[%d] dma[%d]\n",
  29. sg_len, dma_len);
  30. return -1;
  31. }
  32. pgcount = 0;
  33. for_each_sg(sglist, sg, nents, i) {
  34. unsigned long start, end;
  35. if (!sg->dma_length)
  36. break;
  37. start = sg->dma_address;
  38. start = start & IO_PAGE_MASK;
  39. end = sg->dma_address + sg->dma_length;
  40. end = (end + (IO_PAGE_SIZE - 1)) & IO_PAGE_MASK;
  41. pgcount += ((end - start) >> IO_PAGE_SHIFT);
  42. }
  43. if (pgcount != npages) {
  44. printk("verify_lengths: Error, page count wrong, "
  45. "npages[%d] pgcount[%d]\n",
  46. npages, pgcount);
  47. return -1;
  48. }
  49. /* This test passes... */
  50. return 0;
  51. }
  52. static int verify_one_map(struct scatterlist *dma_sg, struct scatterlist **__sg, int nents, iopte_t **__iopte)
  53. {
  54. struct scatterlist *sg = *__sg;
  55. iopte_t *iopte = *__iopte;
  56. u32 dlen = dma_sg->dma_length;
  57. u32 daddr;
  58. unsigned int sglen;
  59. unsigned long sgaddr;
  60. daddr = dma_sg->dma_address;
  61. sglen = sg->length;
  62. sgaddr = (unsigned long) sg_virt(sg);
  63. while (dlen > 0) {
  64. unsigned long paddr;
  65. /* SG and DMA_SG must begin at the same sub-page boundary. */
  66. if ((sgaddr & ~IO_PAGE_MASK) != (daddr & ~IO_PAGE_MASK)) {
  67. printk("verify_one_map: Wrong start offset "
  68. "sg[%08lx] dma[%08x]\n",
  69. sgaddr, daddr);
  70. nents = -1;
  71. goto out;
  72. }
  73. /* Verify the IOPTE points to the right page. */
  74. paddr = iopte_val(*iopte) & IOPTE_PAGE;
  75. if ((paddr + PAGE_OFFSET) != (sgaddr & IO_PAGE_MASK)) {
  76. printk("verify_one_map: IOPTE[%08lx] maps the "
  77. "wrong page, should be [%08lx]\n",
  78. iopte_val(*iopte), (sgaddr & IO_PAGE_MASK) - PAGE_OFFSET);
  79. nents = -1;
  80. goto out;
  81. }
  82. /* If this SG crosses a page, adjust to that next page
  83. * boundary and loop.
  84. */
  85. if ((sgaddr & IO_PAGE_MASK) ^ ((sgaddr + sglen - 1) & IO_PAGE_MASK)) {
  86. unsigned long next_page, diff;
  87. next_page = (sgaddr + IO_PAGE_SIZE) & IO_PAGE_MASK;
  88. diff = next_page - sgaddr;
  89. sgaddr += diff;
  90. daddr += diff;
  91. sglen -= diff;
  92. dlen -= diff;
  93. if (dlen > 0)
  94. iopte++;
  95. continue;
  96. }
  97. /* SG wholly consumed within this page. */
  98. daddr += sglen;
  99. dlen -= sglen;
  100. if (dlen > 0 && ((daddr & ~IO_PAGE_MASK) == 0))
  101. iopte++;
  102. sg = sg_next(sg);
  103. if (--nents <= 0)
  104. break;
  105. sgaddr = (unsigned long) sg_virt(sg);
  106. sglen = sg->length;
  107. }
  108. if (dlen < 0) {
  109. /* Transfer overrun, big problems. */
  110. printk("verify_one_map: Transfer overrun by %d bytes.\n",
  111. -dlen);
  112. nents = -1;
  113. } else {
  114. /* Advance to next dma_sg implies that the next iopte will
  115. * begin it.
  116. */
  117. iopte++;
  118. }
  119. out:
  120. *__sg = sg;
  121. *__iopte = iopte;
  122. return nents;
  123. }
  124. static int verify_maps(struct scatterlist *sg, int nents, iopte_t *iopte)
  125. {
  126. struct scatterlist *dma_sg = sg;
  127. struct scatterlist *orig_dma_sg = dma_sg;
  128. int orig_nents = nents;
  129. for (;;) {
  130. nents = verify_one_map(dma_sg, &sg, nents, &iopte);
  131. if (nents <= 0)
  132. break;
  133. dma_sg = sg_next(dma_sg);
  134. if (dma_sg->dma_length == 0)
  135. break;
  136. }
  137. if (nents > 0) {
  138. printk("verify_maps: dma maps consumed by some sgs remain (%d)\n",
  139. nents);
  140. return -1;
  141. }
  142. if (nents < 0) {
  143. printk("verify_maps: Error, messed up mappings, "
  144. "at sg %d dma_sg %d\n",
  145. (int) (orig_nents + nents), (int) (dma_sg - orig_dma_sg));
  146. return -1;
  147. }
  148. /* This test passes... */
  149. return 0;
  150. }
  151. void verify_sglist(struct scatterlist *sglist, int nents, iopte_t *iopte, int npages)
  152. {
  153. struct scatterlist *sg;
  154. if (verify_lengths(sglist, nents, npages) < 0 ||
  155. verify_maps(sglist, nents, iopte) < 0) {
  156. int i;
  157. printk("verify_sglist: Crap, messed up mappings, dumping, iodma at ");
  158. printk("%016lx.\n", sglist->dma_address & IO_PAGE_MASK);
  159. for_each_sg(sglist, sg, nents, i) {
  160. printk("sg(%d): page_addr(%p) off(%x) length(%x) "
  161. "dma_address[%016x] dma_length[%016x]\n",
  162. i,
  163. page_address(sg_page(sg)), sg->offset,
  164. sg->length,
  165. sg->dma_address, sg->dma_length);
  166. }
  167. }
  168. /* Seems to be ok */
  169. }
  170. #endif
  171. unsigned long prepare_sg(struct device *dev, struct scatterlist *sg, int nents)
  172. {
  173. struct scatterlist *dma_sg = sg;
  174. unsigned long prev;
  175. u32 dent_addr, dent_len;
  176. unsigned int max_seg_size;
  177. prev = (unsigned long) sg_virt(sg);
  178. prev += (unsigned long) (dent_len = sg->length);
  179. dent_addr = (u32) ((unsigned long)(sg_virt(sg)) & (IO_PAGE_SIZE - 1UL));
  180. max_seg_size = dma_get_max_seg_size(dev);
  181. while (--nents) {
  182. unsigned long addr;
  183. sg = sg_next(sg);
  184. addr = (unsigned long) sg_virt(sg);
  185. if (! VCONTIG(prev, addr) ||
  186. dent_len + sg->length > max_seg_size) {
  187. dma_sg->dma_address = dent_addr;
  188. dma_sg->dma_length = dent_len;
  189. dma_sg = sg_next(dma_sg);
  190. dent_addr = ((dent_addr +
  191. dent_len +
  192. (IO_PAGE_SIZE - 1UL)) >> IO_PAGE_SHIFT);
  193. dent_addr <<= IO_PAGE_SHIFT;
  194. dent_addr += addr & (IO_PAGE_SIZE - 1UL);
  195. dent_len = 0;
  196. }
  197. dent_len += sg->length;
  198. prev = addr + sg->length;
  199. }
  200. dma_sg->dma_address = dent_addr;
  201. dma_sg->dma_length = dent_len;
  202. if (dma_sg != sg) {
  203. dma_sg = sg_next(dma_sg);
  204. dma_sg->dma_length = 0;
  205. }
  206. return ((unsigned long) dent_addr +
  207. (unsigned long) dent_len +
  208. (IO_PAGE_SIZE - 1UL)) >> IO_PAGE_SHIFT;
  209. }