pagewalk.c 4.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194
  1. #include <linux/mm.h>
  2. #include <linux/highmem.h>
  3. #include <linux/sched.h>
  4. #include <linux/hugetlb.h>
  5. static int walk_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end,
  6. struct mm_walk *walk)
  7. {
  8. pte_t *pte;
  9. int err = 0;
  10. pte = pte_offset_map(pmd, addr);
  11. for (;;) {
  12. err = walk->pte_entry(pte, addr, addr + PAGE_SIZE, walk);
  13. if (err)
  14. break;
  15. addr += PAGE_SIZE;
  16. if (addr == end)
  17. break;
  18. pte++;
  19. }
  20. pte_unmap(pte);
  21. return err;
  22. }
  23. static int walk_pmd_range(pud_t *pud, unsigned long addr, unsigned long end,
  24. struct mm_walk *walk)
  25. {
  26. pmd_t *pmd;
  27. unsigned long next;
  28. int err = 0;
  29. pmd = pmd_offset(pud, addr);
  30. do {
  31. next = pmd_addr_end(addr, end);
  32. if (pmd_none_or_clear_bad(pmd)) {
  33. if (walk->pte_hole)
  34. err = walk->pte_hole(addr, next, walk);
  35. if (err)
  36. break;
  37. continue;
  38. }
  39. if (walk->pmd_entry)
  40. err = walk->pmd_entry(pmd, addr, next, walk);
  41. if (!err && walk->pte_entry)
  42. err = walk_pte_range(pmd, addr, next, walk);
  43. if (err)
  44. break;
  45. } while (pmd++, addr = next, addr != end);
  46. return err;
  47. }
  48. static int walk_pud_range(pgd_t *pgd, unsigned long addr, unsigned long end,
  49. struct mm_walk *walk)
  50. {
  51. pud_t *pud;
  52. unsigned long next;
  53. int err = 0;
  54. pud = pud_offset(pgd, addr);
  55. do {
  56. next = pud_addr_end(addr, end);
  57. if (pud_none_or_clear_bad(pud)) {
  58. if (walk->pte_hole)
  59. err = walk->pte_hole(addr, next, walk);
  60. if (err)
  61. break;
  62. continue;
  63. }
  64. if (walk->pud_entry)
  65. err = walk->pud_entry(pud, addr, next, walk);
  66. if (!err && (walk->pmd_entry || walk->pte_entry))
  67. err = walk_pmd_range(pud, addr, next, walk);
  68. if (err)
  69. break;
  70. } while (pud++, addr = next, addr != end);
  71. return err;
  72. }
  73. #ifdef CONFIG_HUGETLB_PAGE
  74. static unsigned long hugetlb_entry_end(struct hstate *h, unsigned long addr,
  75. unsigned long end)
  76. {
  77. unsigned long boundary = (addr & huge_page_mask(h)) + huge_page_size(h);
  78. return boundary < end ? boundary : end;
  79. }
  80. static int walk_hugetlb_range(struct vm_area_struct *vma,
  81. unsigned long addr, unsigned long end,
  82. struct mm_walk *walk)
  83. {
  84. struct hstate *h = hstate_vma(vma);
  85. unsigned long next;
  86. unsigned long hmask = huge_page_mask(h);
  87. pte_t *pte;
  88. int err = 0;
  89. do {
  90. next = hugetlb_entry_end(h, addr, end);
  91. pte = huge_pte_offset(walk->mm, addr & hmask);
  92. if (pte && walk->hugetlb_entry)
  93. err = walk->hugetlb_entry(pte, hmask, addr, next, walk);
  94. if (err)
  95. return err;
  96. } while (addr = next, addr != end);
  97. return 0;
  98. }
  99. #endif
  100. /**
  101. * walk_page_range - walk a memory map's page tables with a callback
  102. * @mm: memory map to walk
  103. * @addr: starting address
  104. * @end: ending address
  105. * @walk: set of callbacks to invoke for each level of the tree
  106. *
  107. * Recursively walk the page table for the memory area in a VMA,
  108. * calling supplied callbacks. Callbacks are called in-order (first
  109. * PGD, first PUD, first PMD, first PTE, second PTE... second PMD,
  110. * etc.). If lower-level callbacks are omitted, walking depth is reduced.
  111. *
  112. * Each callback receives an entry pointer and the start and end of the
  113. * associated range, and a copy of the original mm_walk for access to
  114. * the ->private or ->mm fields.
  115. *
  116. * No locks are taken, but the bottom level iterator will map PTE
  117. * directories from highmem if necessary.
  118. *
  119. * If any callback returns a non-zero value, the walk is aborted and
  120. * the return value is propagated back to the caller. Otherwise 0 is returned.
  121. */
  122. int walk_page_range(unsigned long addr, unsigned long end,
  123. struct mm_walk *walk)
  124. {
  125. pgd_t *pgd;
  126. unsigned long next;
  127. int err = 0;
  128. struct vm_area_struct *vma;
  129. if (addr >= end)
  130. return err;
  131. if (!walk->mm)
  132. return -EINVAL;
  133. pgd = pgd_offset(walk->mm, addr);
  134. do {
  135. next = pgd_addr_end(addr, end);
  136. /*
  137. * handle hugetlb vma individually because pagetable walk for
  138. * the hugetlb page is dependent on the architecture and
  139. * we can't handled it in the same manner as non-huge pages.
  140. */
  141. vma = find_vma(walk->mm, addr);
  142. #ifdef CONFIG_HUGETLB_PAGE
  143. if (vma && is_vm_hugetlb_page(vma)) {
  144. if (vma->vm_end < next)
  145. next = vma->vm_end;
  146. /*
  147. * Hugepage is very tightly coupled with vma, so
  148. * walk through hugetlb entries within a given vma.
  149. */
  150. err = walk_hugetlb_range(vma, addr, next, walk);
  151. if (err)
  152. break;
  153. pgd = pgd_offset(walk->mm, next);
  154. continue;
  155. }
  156. #endif
  157. if (pgd_none_or_clear_bad(pgd)) {
  158. if (walk->pte_hole)
  159. err = walk->pte_hole(addr, next, walk);
  160. if (err)
  161. break;
  162. pgd++;
  163. continue;
  164. }
  165. if (walk->pgd_entry)
  166. err = walk->pgd_entry(pgd, addr, next, walk);
  167. if (!err &&
  168. (walk->pud_entry || walk->pmd_entry || walk->pte_entry))
  169. err = walk_pud_range(pgd, addr, next, walk);
  170. if (err)
  171. break;
  172. pgd++;
  173. } while (addr = next, addr != end);
  174. return err;
  175. }