ptdump.c 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165
  1. // SPDX-License-Identifier: GPL-2.0
  2. #include <linux/pagewalk.h>
  3. #include <linux/ptdump.h>
  4. #include <linux/kasan.h>
  5. #if defined(CONFIG_KASAN_GENERIC) || defined(CONFIG_KASAN_SW_TAGS)
  6. /*
  7. * This is an optimization for KASAN=y case. Since all kasan page tables
  8. * eventually point to the kasan_early_shadow_page we could call note_page()
  9. * right away without walking through lower level page tables. This saves
  10. * us dozens of seconds (minutes for 5-level config) while checking for
  11. * W+X mapping or reading kernel_page_tables debugfs file.
  12. */
  13. static inline int note_kasan_page_table(struct mm_walk *walk,
  14. unsigned long addr)
  15. {
  16. struct ptdump_state *st = walk->private;
  17. st->note_page(st, addr, 4, pte_val(kasan_early_shadow_pte[0]));
  18. walk->action = ACTION_CONTINUE;
  19. return 0;
  20. }
  21. #endif
  22. static int ptdump_pgd_entry(pgd_t *pgd, unsigned long addr,
  23. unsigned long next, struct mm_walk *walk)
  24. {
  25. struct ptdump_state *st = walk->private;
  26. pgd_t val = READ_ONCE(*pgd);
  27. #if CONFIG_PGTABLE_LEVELS > 4 && \
  28. (defined(CONFIG_KASAN_GENERIC) || defined(CONFIG_KASAN_SW_TAGS))
  29. if (pgd_page(val) == virt_to_page(lm_alias(kasan_early_shadow_p4d)))
  30. return note_kasan_page_table(walk, addr);
  31. #endif
  32. if (st->effective_prot)
  33. st->effective_prot(st, 0, pgd_val(val));
  34. if (pgd_leaf(val)) {
  35. st->note_page(st, addr, 0, pgd_val(val));
  36. walk->action = ACTION_CONTINUE;
  37. }
  38. return 0;
  39. }
  40. static int ptdump_p4d_entry(p4d_t *p4d, unsigned long addr,
  41. unsigned long next, struct mm_walk *walk)
  42. {
  43. struct ptdump_state *st = walk->private;
  44. p4d_t val = READ_ONCE(*p4d);
  45. #if CONFIG_PGTABLE_LEVELS > 3 && \
  46. (defined(CONFIG_KASAN_GENERIC) || defined(CONFIG_KASAN_SW_TAGS))
  47. if (p4d_page(val) == virt_to_page(lm_alias(kasan_early_shadow_pud)))
  48. return note_kasan_page_table(walk, addr);
  49. #endif
  50. if (st->effective_prot)
  51. st->effective_prot(st, 1, p4d_val(val));
  52. if (p4d_leaf(val)) {
  53. st->note_page(st, addr, 1, p4d_val(val));
  54. walk->action = ACTION_CONTINUE;
  55. }
  56. return 0;
  57. }
  58. static int ptdump_pud_entry(pud_t *pud, unsigned long addr,
  59. unsigned long next, struct mm_walk *walk)
  60. {
  61. struct ptdump_state *st = walk->private;
  62. pud_t val = READ_ONCE(*pud);
  63. #if CONFIG_PGTABLE_LEVELS > 2 && \
  64. (defined(CONFIG_KASAN_GENERIC) || defined(CONFIG_KASAN_SW_TAGS))
  65. if (pud_page(val) == virt_to_page(lm_alias(kasan_early_shadow_pmd)))
  66. return note_kasan_page_table(walk, addr);
  67. #endif
  68. if (st->effective_prot)
  69. st->effective_prot(st, 2, pud_val(val));
  70. if (pud_leaf(val)) {
  71. st->note_page(st, addr, 2, pud_val(val));
  72. walk->action = ACTION_CONTINUE;
  73. }
  74. return 0;
  75. }
  76. static int ptdump_pmd_entry(pmd_t *pmd, unsigned long addr,
  77. unsigned long next, struct mm_walk *walk)
  78. {
  79. struct ptdump_state *st = walk->private;
  80. pmd_t val = READ_ONCE(*pmd);
  81. #if defined(CONFIG_KASAN_GENERIC) || defined(CONFIG_KASAN_SW_TAGS)
  82. if (pmd_page(val) == virt_to_page(lm_alias(kasan_early_shadow_pte)))
  83. return note_kasan_page_table(walk, addr);
  84. #endif
  85. if (st->effective_prot)
  86. st->effective_prot(st, 3, pmd_val(val));
  87. if (pmd_leaf(val)) {
  88. st->note_page(st, addr, 3, pmd_val(val));
  89. walk->action = ACTION_CONTINUE;
  90. }
  91. return 0;
  92. }
  93. static int ptdump_pte_entry(pte_t *pte, unsigned long addr,
  94. unsigned long next, struct mm_walk *walk)
  95. {
  96. struct ptdump_state *st = walk->private;
  97. pte_t val = ptep_get(pte);
  98. if (st->effective_prot)
  99. st->effective_prot(st, 4, pte_val(val));
  100. st->note_page(st, addr, 4, pte_val(val));
  101. return 0;
  102. }
  103. static int ptdump_hole(unsigned long addr, unsigned long next,
  104. int depth, struct mm_walk *walk)
  105. {
  106. struct ptdump_state *st = walk->private;
  107. st->note_page(st, addr, depth, 0);
  108. return 0;
  109. }
  110. static const struct mm_walk_ops ptdump_ops = {
  111. .pgd_entry = ptdump_pgd_entry,
  112. .p4d_entry = ptdump_p4d_entry,
  113. .pud_entry = ptdump_pud_entry,
  114. .pmd_entry = ptdump_pmd_entry,
  115. .pte_entry = ptdump_pte_entry,
  116. .pte_hole = ptdump_hole,
  117. };
  118. void ptdump_walk_pgd(struct ptdump_state *st, struct mm_struct *mm, pgd_t *pgd)
  119. {
  120. const struct ptdump_range *range = st->range;
  121. mmap_write_lock(mm);
  122. while (range->start != range->end) {
  123. walk_page_range_novma(mm, range->start, range->end,
  124. &ptdump_ops, pgd, st);
  125. range++;
  126. }
  127. mmap_write_unlock(mm);
  128. /* Flush out the last page */
  129. st->note_page(st, 0, -1, 0);
  130. }