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