358 lines
7.9 KiB
C
358 lines
7.9 KiB
C
|
/*
|
||
|
* Copyright (c) 2014, The Linux Foundation. All rights reserved.
|
||
|
* Debug helper to dump the current kernel pagetables of the system
|
||
|
* so that we can see what the various memory ranges are set to.
|
||
|
*
|
||
|
* Derived from x86 and arm implementation:
|
||
|
* (C) Copyright 2008 Intel Corporation
|
||
|
*
|
||
|
* Author: Arjan van de Ven <arjan@linux.intel.com>
|
||
|
*
|
||
|
* This program is free software; you can redistribute it and/or
|
||
|
* modify it under the terms of the GNU General Public License
|
||
|
* as published by the Free Software Foundation; version 2
|
||
|
* of the License.
|
||
|
*/
|
||
|
#include <linux/debugfs.h>
|
||
|
#include <linux/errno.h>
|
||
|
#include <linux/fs.h>
|
||
|
#include <linux/io.h>
|
||
|
#include <linux/init.h>
|
||
|
#include <linux/mm.h>
|
||
|
#include <linux/sched.h>
|
||
|
#include <linux/seq_file.h>
|
||
|
|
||
|
#include <asm/fixmap.h>
|
||
|
#include <asm/kasan.h>
|
||
|
#include <asm/memory.h>
|
||
|
#include <asm/pgtable.h>
|
||
|
#include <asm/pgtable-hwdef.h>
|
||
|
#include <asm/ptdump.h>
|
||
|
|
||
|
static const struct addr_marker address_markers[] = {
|
||
|
#ifdef CONFIG_KASAN
|
||
|
{ KASAN_SHADOW_START, "Kasan shadow start" },
|
||
|
{ KASAN_SHADOW_END, "Kasan shadow end" },
|
||
|
#endif
|
||
|
{ MODULES_VADDR, "Modules start" },
|
||
|
{ MODULES_END, "Modules end" },
|
||
|
{ VMALLOC_START, "vmalloc() Area" },
|
||
|
{ VMALLOC_END, "vmalloc() End" },
|
||
|
{ FIXADDR_START, "Fixmap start" },
|
||
|
{ FIXADDR_TOP, "Fixmap end" },
|
||
|
{ PCI_IO_START, "PCI I/O start" },
|
||
|
{ PCI_IO_END, "PCI I/O end" },
|
||
|
#ifdef CONFIG_SPARSEMEM_VMEMMAP
|
||
|
{ VMEMMAP_START, "vmemmap start" },
|
||
|
{ VMEMMAP_START + VMEMMAP_SIZE, "vmemmap end" },
|
||
|
#endif
|
||
|
{ PAGE_OFFSET, "Linear Mapping" },
|
||
|
{ -1, NULL },
|
||
|
};
|
||
|
|
||
|
/*
|
||
|
* The page dumper groups page table entries of the same type into a single
|
||
|
* description. It uses pg_state to track the range information while
|
||
|
* iterating over the pte entries. When the continuity is broken it then
|
||
|
* dumps out a description of the range.
|
||
|
*/
|
||
|
struct pg_state {
|
||
|
struct seq_file *seq;
|
||
|
const struct addr_marker *marker;
|
||
|
unsigned long start_address;
|
||
|
unsigned level;
|
||
|
u64 current_prot;
|
||
|
};
|
||
|
|
||
|
struct prot_bits {
|
||
|
u64 mask;
|
||
|
u64 val;
|
||
|
const char *set;
|
||
|
const char *clear;
|
||
|
};
|
||
|
|
||
|
static const struct prot_bits pte_bits[] = {
|
||
|
{
|
||
|
.mask = PTE_VALID,
|
||
|
.val = PTE_VALID,
|
||
|
.set = " ",
|
||
|
.clear = "F",
|
||
|
}, {
|
||
|
.mask = PTE_USER,
|
||
|
.val = PTE_USER,
|
||
|
.set = "USR",
|
||
|
.clear = " ",
|
||
|
}, {
|
||
|
.mask = PTE_RDONLY,
|
||
|
.val = PTE_RDONLY,
|
||
|
.set = "ro",
|
||
|
.clear = "RW",
|
||
|
}, {
|
||
|
.mask = PTE_PXN,
|
||
|
.val = PTE_PXN,
|
||
|
.set = "NX",
|
||
|
.clear = "x ",
|
||
|
}, {
|
||
|
.mask = PTE_SHARED,
|
||
|
.val = PTE_SHARED,
|
||
|
.set = "SHD",
|
||
|
.clear = " ",
|
||
|
}, {
|
||
|
.mask = PTE_AF,
|
||
|
.val = PTE_AF,
|
||
|
.set = "AF",
|
||
|
.clear = " ",
|
||
|
}, {
|
||
|
.mask = PTE_NG,
|
||
|
.val = PTE_NG,
|
||
|
.set = "NG",
|
||
|
.clear = " ",
|
||
|
}, {
|
||
|
.mask = PTE_CONT,
|
||
|
.val = PTE_CONT,
|
||
|
.set = "CON",
|
||
|
.clear = " ",
|
||
|
}, {
|
||
|
.mask = PTE_TABLE_BIT,
|
||
|
.val = PTE_TABLE_BIT,
|
||
|
.set = " ",
|
||
|
.clear = "BLK",
|
||
|
}, {
|
||
|
.mask = PTE_UXN,
|
||
|
.val = PTE_UXN,
|
||
|
.set = "UXN",
|
||
|
}, {
|
||
|
.mask = PTE_ATTRINDX_MASK,
|
||
|
.val = PTE_ATTRINDX(MT_DEVICE_nGnRnE),
|
||
|
.set = "DEVICE/nGnRnE",
|
||
|
}, {
|
||
|
.mask = PTE_ATTRINDX_MASK,
|
||
|
.val = PTE_ATTRINDX(MT_DEVICE_nGnRE),
|
||
|
.set = "DEVICE/nGnRE",
|
||
|
}, {
|
||
|
.mask = PTE_ATTRINDX_MASK,
|
||
|
.val = PTE_ATTRINDX(MT_DEVICE_GRE),
|
||
|
.set = "DEVICE/GRE",
|
||
|
}, {
|
||
|
.mask = PTE_ATTRINDX_MASK,
|
||
|
.val = PTE_ATTRINDX(MT_NORMAL_NC),
|
||
|
.set = "MEM/NORMAL-NC",
|
||
|
}, {
|
||
|
.mask = PTE_ATTRINDX_MASK,
|
||
|
.val = PTE_ATTRINDX(MT_NORMAL),
|
||
|
.set = "MEM/NORMAL",
|
||
|
}
|
||
|
};
|
||
|
|
||
|
struct pg_level {
|
||
|
const struct prot_bits *bits;
|
||
|
const char *name;
|
||
|
size_t num;
|
||
|
u64 mask;
|
||
|
};
|
||
|
|
||
|
static struct pg_level pg_level[] = {
|
||
|
{
|
||
|
}, { /* pgd */
|
||
|
.name = "PGD",
|
||
|
.bits = pte_bits,
|
||
|
.num = ARRAY_SIZE(pte_bits),
|
||
|
}, { /* pud */
|
||
|
.name = (CONFIG_PGTABLE_LEVELS > 3) ? "PUD" : "PGD",
|
||
|
.bits = pte_bits,
|
||
|
.num = ARRAY_SIZE(pte_bits),
|
||
|
}, { /* pmd */
|
||
|
.name = (CONFIG_PGTABLE_LEVELS > 2) ? "PMD" : "PGD",
|
||
|
.bits = pte_bits,
|
||
|
.num = ARRAY_SIZE(pte_bits),
|
||
|
}, { /* pte */
|
||
|
.name = "PTE",
|
||
|
.bits = pte_bits,
|
||
|
.num = ARRAY_SIZE(pte_bits),
|
||
|
},
|
||
|
};
|
||
|
|
||
|
static void dump_prot(struct pg_state *st, const struct prot_bits *bits,
|
||
|
size_t num)
|
||
|
{
|
||
|
unsigned i;
|
||
|
|
||
|
for (i = 0; i < num; i++, bits++) {
|
||
|
const char *s;
|
||
|
|
||
|
if ((st->current_prot & bits->mask) == bits->val)
|
||
|
s = bits->set;
|
||
|
else
|
||
|
s = bits->clear;
|
||
|
|
||
|
if (s)
|
||
|
seq_printf(st->seq, " %s", s);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
static void note_page(struct pg_state *st, unsigned long addr, unsigned level,
|
||
|
u64 val)
|
||
|
{
|
||
|
static const char units[] = "KMGTPE";
|
||
|
u64 prot = val & pg_level[level].mask;
|
||
|
|
||
|
if (!st->level) {
|
||
|
st->level = level;
|
||
|
st->current_prot = prot;
|
||
|
st->start_address = addr;
|
||
|
seq_printf(st->seq, "---[ %s ]---\n", st->marker->name);
|
||
|
} else if (prot != st->current_prot || level != st->level ||
|
||
|
addr >= st->marker[1].start_address) {
|
||
|
const char *unit = units;
|
||
|
unsigned long delta;
|
||
|
|
||
|
if (st->current_prot) {
|
||
|
seq_printf(st->seq, "0x%016lx-0x%016lx ",
|
||
|
st->start_address, addr);
|
||
|
|
||
|
delta = (addr - st->start_address) >> 10;
|
||
|
while (!(delta & 1023) && unit[1]) {
|
||
|
delta >>= 10;
|
||
|
unit++;
|
||
|
}
|
||
|
seq_printf(st->seq, "%9lu%c %s", delta, *unit,
|
||
|
pg_level[st->level].name);
|
||
|
if (pg_level[st->level].bits)
|
||
|
dump_prot(st, pg_level[st->level].bits,
|
||
|
pg_level[st->level].num);
|
||
|
seq_puts(st->seq, "\n");
|
||
|
}
|
||
|
|
||
|
if (addr >= st->marker[1].start_address) {
|
||
|
st->marker++;
|
||
|
seq_printf(st->seq, "---[ %s ]---\n", st->marker->name);
|
||
|
}
|
||
|
|
||
|
st->start_address = addr;
|
||
|
st->current_prot = prot;
|
||
|
st->level = level;
|
||
|
}
|
||
|
|
||
|
if (addr >= st->marker[1].start_address) {
|
||
|
st->marker++;
|
||
|
seq_printf(st->seq, "---[ %s ]---\n", st->marker->name);
|
||
|
}
|
||
|
|
||
|
}
|
||
|
|
||
|
static void walk_pte(struct pg_state *st, pmd_t *pmd, unsigned long start)
|
||
|
{
|
||
|
pte_t *pte = pte_offset_kernel(pmd, 0UL);
|
||
|
unsigned long addr;
|
||
|
unsigned i;
|
||
|
|
||
|
for (i = 0; i < PTRS_PER_PTE; i++, pte++) {
|
||
|
addr = start + i * PAGE_SIZE;
|
||
|
note_page(st, addr, 4, pte_val(*pte));
|
||
|
}
|
||
|
}
|
||
|
|
||
|
static void walk_pmd(struct pg_state *st, pud_t *pud, unsigned long start)
|
||
|
{
|
||
|
pmd_t *pmd = pmd_offset(pud, 0UL);
|
||
|
unsigned long addr;
|
||
|
unsigned i;
|
||
|
|
||
|
for (i = 0; i < PTRS_PER_PMD; i++, pmd++) {
|
||
|
addr = start + i * PMD_SIZE;
|
||
|
if (pmd_none(*pmd) || pmd_sect(*pmd)) {
|
||
|
note_page(st, addr, 3, pmd_val(*pmd));
|
||
|
} else {
|
||
|
BUG_ON(pmd_bad(*pmd));
|
||
|
walk_pte(st, pmd, addr);
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
static void walk_pud(struct pg_state *st, pgd_t *pgd, unsigned long start)
|
||
|
{
|
||
|
pud_t *pud = pud_offset(pgd, 0UL);
|
||
|
unsigned long addr;
|
||
|
unsigned i;
|
||
|
|
||
|
for (i = 0; i < PTRS_PER_PUD; i++, pud++) {
|
||
|
addr = start + i * PUD_SIZE;
|
||
|
if (pud_none(*pud) || pud_sect(*pud)) {
|
||
|
note_page(st, addr, 2, pud_val(*pud));
|
||
|
} else {
|
||
|
BUG_ON(pud_bad(*pud));
|
||
|
walk_pmd(st, pud, addr);
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
static void walk_pgd(struct pg_state *st, struct mm_struct *mm,
|
||
|
unsigned long start)
|
||
|
{
|
||
|
pgd_t *pgd = pgd_offset(mm, 0UL);
|
||
|
unsigned i;
|
||
|
unsigned long addr;
|
||
|
|
||
|
for (i = 0; i < PTRS_PER_PGD; i++, pgd++) {
|
||
|
addr = start + i * PGDIR_SIZE;
|
||
|
if (pgd_none(*pgd)) {
|
||
|
note_page(st, addr, 1, pgd_val(*pgd));
|
||
|
} else {
|
||
|
BUG_ON(pgd_bad(*pgd));
|
||
|
walk_pud(st, pgd, addr);
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
static int ptdump_show(struct seq_file *m, void *v)
|
||
|
{
|
||
|
struct ptdump_info *info = m->private;
|
||
|
struct pg_state st = {
|
||
|
.seq = m,
|
||
|
.marker = info->markers,
|
||
|
};
|
||
|
|
||
|
walk_pgd(&st, info->mm, info->base_addr);
|
||
|
|
||
|
note_page(&st, 0, 0, 0);
|
||
|
return 0;
|
||
|
}
|
||
|
|
||
|
static int ptdump_open(struct inode *inode, struct file *file)
|
||
|
{
|
||
|
return single_open(file, ptdump_show, inode->i_private);
|
||
|
}
|
||
|
|
||
|
static const struct file_operations ptdump_fops = {
|
||
|
.open = ptdump_open,
|
||
|
.read = seq_read,
|
||
|
.llseek = seq_lseek,
|
||
|
.release = single_release,
|
||
|
};
|
||
|
|
||
|
int ptdump_register(struct ptdump_info *info, const char *name)
|
||
|
{
|
||
|
struct dentry *pe;
|
||
|
unsigned i, j;
|
||
|
|
||
|
for (i = 0; i < ARRAY_SIZE(pg_level); i++)
|
||
|
if (pg_level[i].bits)
|
||
|
for (j = 0; j < pg_level[i].num; j++)
|
||
|
pg_level[i].mask |= pg_level[i].bits[j].mask;
|
||
|
|
||
|
pe = debugfs_create_file(name, 0400, NULL, info, &ptdump_fops);
|
||
|
return pe ? 0 : -ENOMEM;
|
||
|
}
|
||
|
|
||
|
static struct ptdump_info kernel_ptdump_info = {
|
||
|
.mm = &init_mm,
|
||
|
.markers = address_markers,
|
||
|
.base_addr = VA_START,
|
||
|
};
|
||
|
|
||
|
static int ptdump_init(void)
|
||
|
{
|
||
|
return ptdump_register(&kernel_ptdump_info, "kernel_page_tables");
|
||
|
}
|
||
|
device_initcall(ptdump_init);
|