iommu_common.c 5.7 KB

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