1 #include <linux/seq_file.h>
2 #include <linux/debugfs.h>
3 #include <linux/sched.h>
5 #include <asm/sections.h>
6 #include <asm/pgtable.h>
8 static unsigned long max_addr
;
11 unsigned long start_address
;
15 enum address_markers_idx
{
24 static 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"},
36 unsigned int current_prot
;
37 unsigned long start_address
;
38 unsigned long current_address
;
39 const struct addr_marker
*marker
;
42 static void print_prot(struct seq_file
*m
, unsigned int pr
, int level
)
44 static const char * const level_name
[] =
45 { "ASCE", "PGD", "PUD", "PMD", "PTE" };
47 seq_printf(m
, "%s ", level_name
[level
]);
48 if (pr
& _PAGE_INVALID
) {
52 seq_puts(m
, (pr
& _PAGE_PROTECT
) ? "RO " : "RW ");
53 seq_puts(m
, (pr
& _PAGE_NOEXEC
) ? "NX\n" : "X\n");
56 static void note_page(struct seq_file
*m
, struct pg_state
*st
,
57 unsigned int new_prot
, int level
)
59 static const char units
[] = "KMGTPE";
60 int width
= sizeof(unsigned long) * 2;
61 const char *unit
= units
;
62 unsigned int prot
, cur
;
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.
71 cur
= st
->current_prot
;
75 st
->current_prot
= new_prot
;
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]) {
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
) {
94 seq_printf(m
, "---[ %s ]---\n", st
->marker
->name
);
96 st
->start_address
= st
->current_address
;
97 st
->current_prot
= new_prot
;
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.
110 static void walk_pte_level(struct seq_file
*m
, struct pg_state
*st
,
111 pmd_t
*pmd
, unsigned long addr
)
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
) &
121 (_PAGE_PROTECT
| _PAGE_INVALID
| _PAGE_NOEXEC
);
122 note_page(m
, st
, prot
, 4);
127 static void walk_pmd_level(struct seq_file
*m
, struct pg_state
*st
,
128 pud_t
*pud
, unsigned long addr
)
134 for (i
= 0; i
< PTRS_PER_PMD
&& addr
< max_addr
; i
++) {
135 st
->current_address
= addr
;
136 pmd
= pmd_offset(pud
, addr
);
137 if (!pmd_none(*pmd
)) {
138 if (pmd_large(*pmd
)) {
139 prot
= pmd_val(*pmd
) &
140 (_SEGMENT_ENTRY_PROTECT
|
141 _SEGMENT_ENTRY_NOEXEC
);
142 note_page(m
, st
, prot
, 3);
144 walk_pte_level(m
, st
, pmd
, addr
);
146 note_page(m
, st
, _PAGE_INVALID
, 3);
151 static void walk_pud_level(struct seq_file
*m
, struct pg_state
*st
,
152 pgd_t
*pgd
, unsigned long addr
)
158 for (i
= 0; i
< PTRS_PER_PUD
&& addr
< max_addr
; i
++) {
159 st
->current_address
= addr
;
160 pud
= pud_offset(pgd
, addr
);
162 if (pud_large(*pud
)) {
163 prot
= pud_val(*pud
) &
164 (_REGION_ENTRY_PROTECT
|
165 _REGION_ENTRY_NOEXEC
);
166 note_page(m
, st
, prot
, 2);
168 walk_pmd_level(m
, st
, pud
, addr
);
170 note_page(m
, st
, _PAGE_INVALID
, 2);
175 static void walk_pgd_level(struct seq_file
*m
)
177 unsigned long addr
= 0;
182 memset(&st
, 0, sizeof(st
));
183 for (i
= 0; i
< PTRS_PER_PGD
&& addr
< max_addr
; i
++) {
184 st
.current_address
= addr
;
185 pgd
= pgd_offset_k(addr
);
187 walk_pud_level(m
, &st
, pgd
, addr
);
189 note_page(m
, &st
, _PAGE_INVALID
, 1);
193 /* Flush out the last page */
194 st
.current_address
= max_addr
;
195 note_page(m
, &st
, 0, 0);
198 static int ptdump_show(struct seq_file
*m
, void *v
)
204 static int ptdump_open(struct inode
*inode
, struct file
*filp
)
206 return single_open(filp
, ptdump_show
, NULL
);
209 static const struct file_operations ptdump_fops
= {
213 .release
= single_release
,
216 static int pt_dump_init(void)
219 * Figure out the maximum virtual address being accessible with the
220 * kernel ASCE. We need this to keep the page table walker functions
221 * from accessing non-existent entries.
223 max_addr
= (S390_lowcore
.kernel_asce
& _REGION_ENTRY_TYPE_MASK
) >> 2;
224 max_addr
= 1UL << (max_addr
* 11 + 31);
225 address_markers
[MODULES_NR
].start_address
= MODULES_VADDR
;
226 address_markers
[VMEMMAP_NR
].start_address
= (unsigned long) vmemmap
;
227 address_markers
[VMALLOC_NR
].start_address
= VMALLOC_START
;
228 debugfs_create_file("kernel_page_tables", 0400, NULL
, NULL
, &ptdump_fops
);
231 device_initcall(pt_dump_init
);