Loading...
1// SPDX-License-Identifier: GPL-2.0
2#include <linux/set_memory.h>
3#include <linux/ptdump.h>
4#include <linux/seq_file.h>
5#include <linux/debugfs.h>
6#include <linux/mm.h>
7#include <linux/kfence.h>
8#include <linux/kasan.h>
9#include <asm/ptdump.h>
10#include <asm/kasan.h>
11#include <asm/abs_lowcore.h>
12#include <asm/nospec-branch.h>
13#include <asm/sections.h>
14#include <asm/maccess.h>
15
16static unsigned long max_addr;
17
18struct addr_marker {
19 unsigned long start_address;
20 const char *name;
21};
22
23enum address_markers_idx {
24 IDENTITY_BEFORE_NR = 0,
25 IDENTITY_BEFORE_END_NR,
26 AMODE31_START_NR,
27 AMODE31_END_NR,
28 KERNEL_START_NR,
29 KERNEL_END_NR,
30#ifdef CONFIG_KFENCE
31 KFENCE_START_NR,
32 KFENCE_END_NR,
33#endif
34 IDENTITY_AFTER_NR,
35 IDENTITY_AFTER_END_NR,
36#ifdef CONFIG_KASAN
37 KASAN_SHADOW_START_NR,
38 KASAN_SHADOW_END_NR,
39#endif
40 VMEMMAP_NR,
41 VMEMMAP_END_NR,
42 VMALLOC_NR,
43 VMALLOC_END_NR,
44 MODULES_NR,
45 MODULES_END_NR,
46 ABS_LOWCORE_NR,
47 ABS_LOWCORE_END_NR,
48 MEMCPY_REAL_NR,
49 MEMCPY_REAL_END_NR,
50};
51
52static struct addr_marker address_markers[] = {
53 [IDENTITY_BEFORE_NR] = {0, "Identity Mapping Start"},
54 [IDENTITY_BEFORE_END_NR] = {(unsigned long)_stext, "Identity Mapping End"},
55 [AMODE31_START_NR] = {0, "Amode31 Area Start"},
56 [AMODE31_END_NR] = {0, "Amode31 Area End"},
57 [KERNEL_START_NR] = {(unsigned long)_stext, "Kernel Image Start"},
58 [KERNEL_END_NR] = {(unsigned long)_end, "Kernel Image End"},
59#ifdef CONFIG_KFENCE
60 [KFENCE_START_NR] = {0, "KFence Pool Start"},
61 [KFENCE_END_NR] = {0, "KFence Pool End"},
62#endif
63 [IDENTITY_AFTER_NR] = {(unsigned long)_end, "Identity Mapping Start"},
64 [IDENTITY_AFTER_END_NR] = {0, "Identity Mapping End"},
65#ifdef CONFIG_KASAN
66 [KASAN_SHADOW_START_NR] = {KASAN_SHADOW_START, "Kasan Shadow Start"},
67 [KASAN_SHADOW_END_NR] = {KASAN_SHADOW_END, "Kasan Shadow End"},
68#endif
69 [VMEMMAP_NR] = {0, "vmemmap Area Start"},
70 [VMEMMAP_END_NR] = {0, "vmemmap Area End"},
71 [VMALLOC_NR] = {0, "vmalloc Area Start"},
72 [VMALLOC_END_NR] = {0, "vmalloc Area End"},
73 [MODULES_NR] = {0, "Modules Area Start"},
74 [MODULES_END_NR] = {0, "Modules Area End"},
75 [ABS_LOWCORE_NR] = {0, "Lowcore Area Start"},
76 [ABS_LOWCORE_END_NR] = {0, "Lowcore Area End"},
77 [MEMCPY_REAL_NR] = {0, "Real Memory Copy Area Start"},
78 [MEMCPY_REAL_END_NR] = {0, "Real Memory Copy Area End"},
79 { -1, NULL }
80};
81
82struct pg_state {
83 struct ptdump_state ptdump;
84 struct seq_file *seq;
85 int level;
86 unsigned int current_prot;
87 bool check_wx;
88 unsigned long wx_pages;
89 unsigned long start_address;
90 const struct addr_marker *marker;
91};
92
93#define pt_dump_seq_printf(m, fmt, args...) \
94({ \
95 struct seq_file *__m = (m); \
96 \
97 if (__m) \
98 seq_printf(__m, fmt, ##args); \
99})
100
101#define pt_dump_seq_puts(m, fmt) \
102({ \
103 struct seq_file *__m = (m); \
104 \
105 if (__m) \
106 seq_printf(__m, fmt); \
107})
108
109static void print_prot(struct seq_file *m, unsigned int pr, int level)
110{
111 static const char * const level_name[] =
112 { "ASCE", "PGD", "PUD", "PMD", "PTE" };
113
114 pt_dump_seq_printf(m, "%s ", level_name[level]);
115 if (pr & _PAGE_INVALID) {
116 pt_dump_seq_printf(m, "I\n");
117 return;
118 }
119 pt_dump_seq_puts(m, (pr & _PAGE_PROTECT) ? "RO " : "RW ");
120 pt_dump_seq_puts(m, (pr & _PAGE_NOEXEC) ? "NX\n" : "X\n");
121}
122
123static void note_prot_wx(struct pg_state *st, unsigned long addr)
124{
125#ifdef CONFIG_DEBUG_WX
126 if (!st->check_wx)
127 return;
128 if (st->current_prot & _PAGE_INVALID)
129 return;
130 if (st->current_prot & _PAGE_PROTECT)
131 return;
132 if (st->current_prot & _PAGE_NOEXEC)
133 return;
134 /*
135 * The first lowcore page is W+X if spectre mitigations are using
136 * trampolines or the BEAR enhancements facility is not installed,
137 * in which case we have two lpswe instructions in lowcore that need
138 * to be executable.
139 */
140 if (addr == PAGE_SIZE && (nospec_uses_trampoline() || !static_key_enabled(&cpu_has_bear)))
141 return;
142 WARN_ONCE(1, "s390/mm: Found insecure W+X mapping at address %pS\n",
143 (void *)st->start_address);
144 st->wx_pages += (addr - st->start_address) / PAGE_SIZE;
145#endif /* CONFIG_DEBUG_WX */
146}
147
148static void note_page(struct ptdump_state *pt_st, unsigned long addr, int level, u64 val)
149{
150 int width = sizeof(unsigned long) * 2;
151 static const char units[] = "KMGTPE";
152 const char *unit = units;
153 unsigned long delta;
154 struct pg_state *st;
155 struct seq_file *m;
156 unsigned int prot;
157
158 st = container_of(pt_st, struct pg_state, ptdump);
159 m = st->seq;
160 prot = val & (_PAGE_PROTECT | _PAGE_NOEXEC);
161 if (level == 4 && (val & _PAGE_INVALID))
162 prot = _PAGE_INVALID;
163 /* For pmd_none() & friends val gets passed as zero. */
164 if (level != 4 && !val)
165 prot = _PAGE_INVALID;
166 /* Final flush from generic code. */
167 if (level == -1)
168 addr = max_addr;
169 if (st->level == -1) {
170 pt_dump_seq_printf(m, "---[ %s ]---\n", st->marker->name);
171 st->start_address = addr;
172 st->current_prot = prot;
173 st->level = level;
174 } else if (prot != st->current_prot || level != st->level ||
175 addr >= st->marker[1].start_address) {
176 note_prot_wx(st, addr);
177 pt_dump_seq_printf(m, "0x%0*lx-0x%0*lx ",
178 width, st->start_address,
179 width, addr);
180 delta = (addr - st->start_address) >> 10;
181 while (!(delta & 0x3ff) && unit[1]) {
182 delta >>= 10;
183 unit++;
184 }
185 pt_dump_seq_printf(m, "%9lu%c ", delta, *unit);
186 print_prot(m, st->current_prot, st->level);
187 while (addr >= st->marker[1].start_address) {
188 st->marker++;
189 pt_dump_seq_printf(m, "---[ %s ]---\n", st->marker->name);
190 }
191 st->start_address = addr;
192 st->current_prot = prot;
193 st->level = level;
194 }
195}
196
197#ifdef CONFIG_DEBUG_WX
198void ptdump_check_wx(void)
199{
200 struct pg_state st = {
201 .ptdump = {
202 .note_page = note_page,
203 .range = (struct ptdump_range[]) {
204 {.start = 0, .end = max_addr},
205 {.start = 0, .end = 0},
206 }
207 },
208 .seq = NULL,
209 .level = -1,
210 .current_prot = 0,
211 .check_wx = true,
212 .wx_pages = 0,
213 .start_address = 0,
214 .marker = (struct addr_marker[]) {
215 { .start_address = 0, .name = NULL},
216 { .start_address = -1, .name = NULL},
217 },
218 };
219
220 if (!MACHINE_HAS_NX)
221 return;
222 ptdump_walk_pgd(&st.ptdump, &init_mm, NULL);
223 if (st.wx_pages)
224 pr_warn("Checked W+X mappings: FAILED, %lu W+X pages found\n", st.wx_pages);
225 else
226 pr_info("Checked W+X mappings: passed, no %sW+X pages found\n",
227 (nospec_uses_trampoline() || !static_key_enabled(&cpu_has_bear)) ?
228 "unexpected " : "");
229}
230#endif /* CONFIG_DEBUG_WX */
231
232#ifdef CONFIG_PTDUMP_DEBUGFS
233static int ptdump_show(struct seq_file *m, void *v)
234{
235 struct pg_state st = {
236 .ptdump = {
237 .note_page = note_page,
238 .range = (struct ptdump_range[]) {
239 {.start = 0, .end = max_addr},
240 {.start = 0, .end = 0},
241 }
242 },
243 .seq = m,
244 .level = -1,
245 .current_prot = 0,
246 .check_wx = false,
247 .wx_pages = 0,
248 .start_address = 0,
249 .marker = address_markers,
250 };
251
252 get_online_mems();
253 mutex_lock(&cpa_mutex);
254 ptdump_walk_pgd(&st.ptdump, &init_mm, NULL);
255 mutex_unlock(&cpa_mutex);
256 put_online_mems();
257 return 0;
258}
259DEFINE_SHOW_ATTRIBUTE(ptdump);
260#endif /* CONFIG_PTDUMP_DEBUGFS */
261
262/*
263 * Heapsort from lib/sort.c is not a stable sorting algorithm, do a simple
264 * insertion sort to preserve the original order of markers with the same
265 * start address.
266 */
267static void sort_address_markers(void)
268{
269 struct addr_marker tmp;
270 int i, j;
271
272 for (i = 1; i < ARRAY_SIZE(address_markers) - 1; i++) {
273 tmp = address_markers[i];
274 for (j = i - 1; j >= 0 && address_markers[j].start_address > tmp.start_address; j--)
275 address_markers[j + 1] = address_markers[j];
276 address_markers[j + 1] = tmp;
277 }
278}
279
280static int pt_dump_init(void)
281{
282#ifdef CONFIG_KFENCE
283 unsigned long kfence_start = (unsigned long)__kfence_pool;
284#endif
285 /*
286 * Figure out the maximum virtual address being accessible with the
287 * kernel ASCE. We need this to keep the page table walker functions
288 * from accessing non-existent entries.
289 */
290 max_addr = (S390_lowcore.kernel_asce & _REGION_ENTRY_TYPE_MASK) >> 2;
291 max_addr = 1UL << (max_addr * 11 + 31);
292 address_markers[IDENTITY_AFTER_END_NR].start_address = ident_map_size;
293 address_markers[AMODE31_START_NR].start_address = __samode31;
294 address_markers[AMODE31_END_NR].start_address = __eamode31;
295 address_markers[MODULES_NR].start_address = MODULES_VADDR;
296 address_markers[MODULES_END_NR].start_address = MODULES_END;
297 address_markers[ABS_LOWCORE_NR].start_address = __abs_lowcore;
298 address_markers[ABS_LOWCORE_END_NR].start_address = __abs_lowcore + ABS_LOWCORE_MAP_SIZE;
299 address_markers[MEMCPY_REAL_NR].start_address = __memcpy_real_area;
300 address_markers[MEMCPY_REAL_END_NR].start_address = __memcpy_real_area + PAGE_SIZE;
301 address_markers[VMEMMAP_NR].start_address = (unsigned long) vmemmap;
302 address_markers[VMEMMAP_END_NR].start_address = (unsigned long)vmemmap + vmemmap_size;
303 address_markers[VMALLOC_NR].start_address = VMALLOC_START;
304 address_markers[VMALLOC_END_NR].start_address = VMALLOC_END;
305#ifdef CONFIG_KFENCE
306 address_markers[KFENCE_START_NR].start_address = kfence_start;
307 address_markers[KFENCE_END_NR].start_address = kfence_start + KFENCE_POOL_SIZE;
308#endif
309 sort_address_markers();
310#ifdef CONFIG_PTDUMP_DEBUGFS
311 debugfs_create_file("kernel_page_tables", 0400, NULL, NULL, &ptdump_fops);
312#endif /* CONFIG_PTDUMP_DEBUGFS */
313 return 0;
314}
315device_initcall(pt_dump_init);
1#include <linux/seq_file.h>
2#include <linux/debugfs.h>
3#include <linux/module.h>
4#include <linux/mm.h>
5#include <asm/sections.h>
6#include <asm/pgtable.h>
7
8static unsigned long max_addr;
9
10struct addr_marker {
11 unsigned long start_address;
12 const char *name;
13};
14
15enum address_markers_idx {
16 IDENTITY_NR = 0,
17 KERNEL_START_NR,
18 KERNEL_END_NR,
19 VMEMMAP_NR,
20 VMALLOC_NR,
21 MODULES_NR,
22};
23
24static struct addr_marker address_markers[] = {
25 [IDENTITY_NR] = {0, "Identity Mapping"},
26 [KERNEL_START_NR] = {(unsigned long)&_stext, "Kernel Image Start"},
27 [KERNEL_END_NR] = {(unsigned long)&_end, "Kernel Image End"},
28 [VMEMMAP_NR] = {0, "vmemmap Area"},
29 [VMALLOC_NR] = {0, "vmalloc Area"},
30 [MODULES_NR] = {0, "Modules Area"},
31 { -1, NULL }
32};
33
34struct pg_state {
35 int level;
36 unsigned int current_prot;
37 unsigned long start_address;
38 unsigned long current_address;
39 const struct addr_marker *marker;
40};
41
42static void print_prot(struct seq_file *m, unsigned int pr, int level)
43{
44 static const char * const level_name[] =
45 { "ASCE", "PGD", "PUD", "PMD", "PTE" };
46
47 seq_printf(m, "%s ", level_name[level]);
48 if (pr & _PAGE_INVALID) {
49 seq_printf(m, "I\n");
50 return;
51 }
52 seq_printf(m, "%s", pr & _PAGE_PROTECT ? "RO " : "RW ");
53 seq_putc(m, '\n');
54}
55
56static void note_page(struct seq_file *m, struct pg_state *st,
57 unsigned int new_prot, int level)
58{
59 static const char units[] = "KMGTPE";
60 int width = sizeof(unsigned long) * 2;
61 const char *unit = units;
62 unsigned int prot, cur;
63 unsigned long delta;
64
65 /*
66 * If we have a "break" in the series, we need to flush the state
67 * that we have now. "break" is either changing perms, levels or
68 * address space marker.
69 */
70 prot = new_prot;
71 cur = st->current_prot;
72
73 if (!st->level) {
74 /* First entry */
75 st->current_prot = new_prot;
76 st->level = level;
77 st->marker = address_markers;
78 seq_printf(m, "---[ %s ]---\n", st->marker->name);
79 } else if (prot != cur || level != st->level ||
80 st->current_address >= st->marker[1].start_address) {
81 /* Print the actual finished series */
82 seq_printf(m, "0x%0*lx-0x%0*lx",
83 width, st->start_address,
84 width, st->current_address);
85 delta = (st->current_address - st->start_address) >> 10;
86 while (!(delta & 0x3ff) && unit[1]) {
87 delta >>= 10;
88 unit++;
89 }
90 seq_printf(m, "%9lu%c ", delta, *unit);
91 print_prot(m, st->current_prot, st->level);
92 if (st->current_address >= st->marker[1].start_address) {
93 st->marker++;
94 seq_printf(m, "---[ %s ]---\n", st->marker->name);
95 }
96 st->start_address = st->current_address;
97 st->current_prot = new_prot;
98 st->level = level;
99 }
100}
101
102/*
103 * The actual page table walker functions. In order to keep the
104 * implementation of print_prot() short, we only check and pass
105 * _PAGE_INVALID and _PAGE_PROTECT flags to note_page() if a region,
106 * segment or page table entry is invalid or read-only.
107 * After all it's just a hint that the current level being walked
108 * contains an invalid or read-only entry.
109 */
110static void walk_pte_level(struct seq_file *m, struct pg_state *st,
111 pmd_t *pmd, unsigned long addr)
112{
113 unsigned int prot;
114 pte_t *pte;
115 int i;
116
117 for (i = 0; i < PTRS_PER_PTE && addr < max_addr; i++) {
118 st->current_address = addr;
119 pte = pte_offset_kernel(pmd, addr);
120 prot = pte_val(*pte) & (_PAGE_PROTECT | _PAGE_INVALID);
121 note_page(m, st, prot, 4);
122 addr += PAGE_SIZE;
123 }
124}
125
126static void walk_pmd_level(struct seq_file *m, struct pg_state *st,
127 pud_t *pud, unsigned long addr)
128{
129 unsigned int prot;
130 pmd_t *pmd;
131 int i;
132
133 for (i = 0; i < PTRS_PER_PMD && addr < max_addr; i++) {
134 st->current_address = addr;
135 pmd = pmd_offset(pud, addr);
136 if (!pmd_none(*pmd)) {
137 if (pmd_large(*pmd)) {
138 prot = pmd_val(*pmd) & _SEGMENT_ENTRY_PROTECT;
139 note_page(m, st, prot, 3);
140 } else
141 walk_pte_level(m, st, pmd, addr);
142 } else
143 note_page(m, st, _PAGE_INVALID, 3);
144 addr += PMD_SIZE;
145 }
146}
147
148static void walk_pud_level(struct seq_file *m, struct pg_state *st,
149 pgd_t *pgd, unsigned long addr)
150{
151 unsigned int prot;
152 pud_t *pud;
153 int i;
154
155 for (i = 0; i < PTRS_PER_PUD && addr < max_addr; i++) {
156 st->current_address = addr;
157 pud = pud_offset(pgd, addr);
158 if (!pud_none(*pud))
159 if (pud_large(*pud)) {
160 prot = pud_val(*pud) & _REGION_ENTRY_PROTECT;
161 note_page(m, st, prot, 2);
162 } else
163 walk_pmd_level(m, st, pud, addr);
164 else
165 note_page(m, st, _PAGE_INVALID, 2);
166 addr += PUD_SIZE;
167 }
168}
169
170static void walk_pgd_level(struct seq_file *m)
171{
172 unsigned long addr = 0;
173 struct pg_state st;
174 pgd_t *pgd;
175 int i;
176
177 memset(&st, 0, sizeof(st));
178 for (i = 0; i < PTRS_PER_PGD && addr < max_addr; i++) {
179 st.current_address = addr;
180 pgd = pgd_offset_k(addr);
181 if (!pgd_none(*pgd))
182 walk_pud_level(m, &st, pgd, addr);
183 else
184 note_page(m, &st, _PAGE_INVALID, 1);
185 addr += PGDIR_SIZE;
186 }
187 /* Flush out the last page */
188 st.current_address = max_addr;
189 note_page(m, &st, 0, 0);
190}
191
192static int ptdump_show(struct seq_file *m, void *v)
193{
194 walk_pgd_level(m);
195 return 0;
196}
197
198static int ptdump_open(struct inode *inode, struct file *filp)
199{
200 return single_open(filp, ptdump_show, NULL);
201}
202
203static const struct file_operations ptdump_fops = {
204 .open = ptdump_open,
205 .read = seq_read,
206 .llseek = seq_lseek,
207 .release = single_release,
208};
209
210static int pt_dump_init(void)
211{
212 /*
213 * Figure out the maximum virtual address being accessible with the
214 * kernel ASCE. We need this to keep the page table walker functions
215 * from accessing non-existent entries.
216 */
217 max_addr = (S390_lowcore.kernel_asce & _REGION_ENTRY_TYPE_MASK) >> 2;
218 max_addr = 1UL << (max_addr * 11 + 31);
219 address_markers[MODULES_NR].start_address = MODULES_VADDR;
220 address_markers[VMEMMAP_NR].start_address = (unsigned long) vmemmap;
221 address_markers[VMALLOC_NR].start_address = VMALLOC_START;
222 debugfs_create_file("kernel_page_tables", 0400, NULL, NULL, &ptdump_fops);
223 return 0;
224}
225device_initcall(pt_dump_init);