[linux-2.6-block.git] / arch / powerpc / mm / dump_linuxpagetables.c

/*
 * Copyright 2016, Rashmica Gupta, IBM Corp.
 *
 * This traverses the kernel pagetables and dumps the
 * information about the used sections of memory to
 * /sys/kernel/debug/kernel_pagetables.
 *
 * Derived from the arm64 implementation:
 * Copyright (c) 2014, The Linux Foundation, Laura Abbott.
 * (C) Copyright 2008 Intel Corporation, Arjan van de Ven.
 *
 * 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/fs.h>
#include <linux/io.h>
#include <linux/mm.h>
#include <linux/sched.h>
#include <linux/seq_file.h>
#include <asm/fixmap.h>
#include <asm/pgtable.h>
#include <linux/const.h>
#include <asm/page.h>
#include <asm/pgalloc.h>

/*
 * To visualise what is happening,
 *
 *  - PTRS_PER_P** = how many entries there are in the corresponding P**
 *  - P**_SHIFT = how many bits of the address we use to index into the
 * corresponding P**
 *  - P**_SIZE is how much memory we can access through the table - not the
 * size of the table itself.
 * P**={PGD, PUD, PMD, PTE}
 *
 *
 * Each entry of the PGD points to a PUD. Each entry of a PUD points to a
 * PMD. Each entry of a PMD points to a PTE. And every PTE entry points to
 * a page.
 *
 * In the case where there are only 3 levels, the PUD is folded into the
 * PGD: every PUD has only one entry which points to the PMD.
 *
 * 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 - ie PTEs that are virtually contiguous
 * with the same PTE flags are chunked together. This is to make it clear how
 * different areas of the kernel virtual memory are used.
 *
 */
struct pg_state {
	struct seq_file *seq;
	const struct addr_marker *marker;
	unsigned long start_address;
	unsigned int level;
	u64 current_flags;
};

struct addr_marker {
	unsigned long start_address;
	const char *name;
};

static struct addr_marker address_markers[] = {
	{ 0,	"Start of kernel VM" },
	{ 0,	"vmalloc() Area" },
	{ 0,	"vmalloc() End" },
	{ 0,	"isa I/O start" },
	{ 0,	"isa I/O end" },
	{ 0,	"phb I/O start" },
	{ 0,	"phb I/O end" },
	{ 0,	"I/O remap start" },
	{ 0,	"I/O remap end" },
	{ 0,	"vmemmap start" },
	{ -1,	NULL },
};

struct flag_info {
	u64		mask;
	u64		val;
	const char	*set;
	const char	*clear;
	bool		is_val;
	int		shift;
};

static const struct flag_info flag_array[] = {
	{
#ifdef CONFIG_PPC_STD_MMU_64
		.mask	= _PAGE_PRIVILEGED,
		.val	= 0,
#else
		.mask	= _PAGE_USER,
		.val	= _PAGE_USER,
#endif
		.set	= "user",
		.clear	= "    ",
	}, {
		.mask	= _PAGE_RW,
		.val	= _PAGE_RW,
		.set	= "rw",
		.clear	= "ro",
	}, {
		.mask	= _PAGE_EXEC,
		.val	= _PAGE_EXEC,
		.set	= " X ",
		.clear	= "   ",
	}, {
		.mask	= _PAGE_PTE,
		.val	= _PAGE_PTE,
		.set	= "pte",
		.clear	= "   ",
	}, {
		.mask	= _PAGE_PRESENT,
		.val	= _PAGE_PRESENT,
		.set	= "present",
		.clear	= "       ",
	}, {
#ifdef CONFIG_PPC_STD_MMU_64
		.mask	= H_PAGE_HASHPTE,
		.val	= H_PAGE_HASHPTE,
#else
		.mask	= _PAGE_HASHPTE,
		.val	= _PAGE_HASHPTE,
#endif
		.set	= "hpte",
		.clear	= "    ",
	}, {
#ifndef CONFIG_PPC_STD_MMU_64
		.mask	= _PAGE_GUARDED,
		.val	= _PAGE_GUARDED,
		.set	= "guarded",
		.clear	= "       ",
	}, {
#endif
		.mask	= _PAGE_DIRTY,
		.val	= _PAGE_DIRTY,
		.set	= "dirty",
		.clear	= "     ",
	}, {
		.mask	= _PAGE_ACCESSED,
		.val	= _PAGE_ACCESSED,
		.set	= "accessed",
		.clear	= "        ",
	}, {
#ifndef CONFIG_PPC_STD_MMU_64
		.mask	= _PAGE_WRITETHRU,
		.val	= _PAGE_WRITETHRU,
		.set	= "write through",
		.clear	= "             ",
	}, {
#endif
		.mask	= _PAGE_NO_CACHE,
		.val	= _PAGE_NO_CACHE,
		.set	= "no cache",
		.clear	= "        ",
	}, {
		.mask	= H_PAGE_BUSY,
		.val	= H_PAGE_BUSY,
		.set	= "busy",
	}, {
#ifdef CONFIG_PPC_64K_PAGES
		.mask	= H_PAGE_COMBO,
		.val	= H_PAGE_COMBO,
		.set	= "combo",
	}, {
		.mask	= H_PAGE_4K_PFN,
		.val	= H_PAGE_4K_PFN,
		.set	= "4K_pfn",
	}, {
#endif
		.mask	= H_PAGE_F_GIX,
		.val	= H_PAGE_F_GIX,
		.set	= "f_gix",
		.is_val	= true,
		.shift	= H_PAGE_F_GIX_SHIFT,
	}, {
		.mask	= H_PAGE_F_SECOND,
		.val	= H_PAGE_F_SECOND,
		.set	= "f_second",
	}, {
		.mask	= _PAGE_SPECIAL,
		.val	= _PAGE_SPECIAL,
		.set	= "special",
	}
};

struct pgtable_level {
	const struct flag_info *flag;
	size_t num;
	u64 mask;
};

static struct pgtable_level pg_level[] = {
	{
	}, { /* pgd */
		.flag	= flag_array,
		.num	= ARRAY_SIZE(flag_array),
	}, { /* pud */
		.flag	= flag_array,
		.num	= ARRAY_SIZE(flag_array),
	}, { /* pmd */
		.flag	= flag_array,
		.num	= ARRAY_SIZE(flag_array),
	}, { /* pte */
		.flag	= flag_array,
		.num	= ARRAY_SIZE(flag_array),
	},
};

static void dump_flag_info(struct pg_state *st, const struct flag_info
		*flag, u64 pte, int num)
{
	unsigned int i;

	for (i = 0; i < num; i++, flag++) {
		const char *s = NULL;
		u64 val;

		/* flag not defined so don't check it */
		if (flag->mask == 0)
			continue;
		/* Some 'flags' are actually values */
		if (flag->is_val) {
			val = pte & flag->val;
			if (flag->shift)
				val = val >> flag->shift;
			seq_printf(st->seq, "  %s:%llx", flag->set, val);
		} else {
			if ((pte & flag->mask) == flag->val)
				s = flag->set;
			else
				s = flag->clear;
			if (s)
				seq_printf(st->seq, "  %s", s);
		}
		st->current_flags &= ~flag->mask;
	}
	if (st->current_flags != 0)
		seq_printf(st->seq, "  unknown flags:%llx", st->current_flags);
}

static void dump_addr(struct pg_state *st, unsigned long addr)
{
	static const char units[] = "KMGTPE";
	const char *unit = units;
	unsigned long delta;

	seq_printf(st->seq, "0x%016lx-0x%016lx   ", st->start_address, addr-1);
	delta = (addr - st->start_address) >> 10;
	/* Work out what appropriate unit to use */
	while (!(delta & 1023) && unit[1]) {
		delta >>= 10;
		unit++;
	}
	seq_printf(st->seq, "%9lu%c", delta, *unit);

}

static void note_page(struct pg_state *st, unsigned long addr,
	       unsigned int level, u64 val)
{
	u64 flag = val & pg_level[level].mask;
	/* At first no level is set */
	if (!st->level) {
		st->level = level;
		st->current_flags = flag;
		st->start_address = addr;
		seq_printf(st->seq, "---[ %s ]---\n", st->marker->name);
	/*
	 * Dump the section of virtual memory when:
	 *   - the PTE flags from one entry to the next differs.
	 *   - we change levels in the tree.
	 *   - the address is in a different section of memory and is thus
	 *   used for a different purpose, regardless of the flags.
	 */
	} else if (flag != st->current_flags || level != st->level ||
		   addr >= st->marker[1].start_address) {

		/* Check the PTE flags */
		if (st->current_flags) {
			dump_addr(st, addr);

			/* Dump all the flags */
			if (pg_level[st->level].flag)
				dump_flag_info(st, pg_level[st->level].flag,
					  st->current_flags,
					  pg_level[st->level].num);

			seq_puts(st->seq, "\n");
		}

		/*
		 * Address indicates we have passed the end of the
		 * current section of virtual memory
		 */
		while (addr >= st->marker[1].start_address) {
			st->marker++;
			seq_printf(st->seq, "---[ %s ]---\n", st->marker->name);
		}
		st->start_address = addr;
		st->current_flags = flag;
		st->level = level;
	}
}

static void walk_pte(struct pg_state *st, pmd_t *pmd, unsigned long start)
{
	pte_t *pte = pte_offset_kernel(pmd, 0);
	unsigned long addr;
	unsigned int 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, 0);
	unsigned long addr;
	unsigned int i;

	for (i = 0; i < PTRS_PER_PMD; i++, pmd++) {
		addr = start + i * PMD_SIZE;
		if (!pmd_none(*pmd))
			/* pmd exists */
			walk_pte(st, pmd, addr);
		else
			note_page(st, addr, 3, pmd_val(*pmd));
	}
}

static void walk_pud(struct pg_state *st, pgd_t *pgd, unsigned long start)
{
	pud_t *pud = pud_offset(pgd, 0);
	unsigned long addr;
	unsigned int i;

	for (i = 0; i < PTRS_PER_PUD; i++, pud++) {
		addr = start + i * PUD_SIZE;
		if (!pud_none(*pud))
			/* pud exists */
			walk_pmd(st, pud, addr);
		else
			note_page(st, addr, 2, pud_val(*pud));
	}
}

static void walk_pagetables(struct pg_state *st)
{
	pgd_t *pgd = pgd_offset_k(0UL);
	unsigned int i;
	unsigned long addr;

	/*
	 * Traverse the linux pagetable structure and dump pages that are in
	 * the hash pagetable.
	 */
	for (i = 0; i < PTRS_PER_PGD; i++, pgd++) {
		addr = KERN_VIRT_START + i * PGDIR_SIZE;
		if (!pgd_none(*pgd))
			/* pgd exists */
			walk_pud(st, pgd, addr);
		else
			note_page(st, addr, 1, pgd_val(*pgd));
	}
}

static void populate_markers(void)
{
	address_markers[0].start_address = PAGE_OFFSET;
	address_markers[1].start_address = VMALLOC_START;
	address_markers[2].start_address = VMALLOC_END;
	address_markers[3].start_address = ISA_IO_BASE;
	address_markers[4].start_address = ISA_IO_END;
	address_markers[5].start_address = PHB_IO_BASE;
	address_markers[6].start_address = PHB_IO_END;
	address_markers[7].start_address = IOREMAP_BASE;
	address_markers[8].start_address = IOREMAP_END;
#ifdef CONFIG_PPC_STD_MMU_64
	address_markers[9].start_address =  H_VMEMMAP_BASE;
#else
	address_markers[9].start_address =  VMEMMAP_BASE;
#endif
}

static int ptdump_show(struct seq_file *m, void *v)
{
	struct pg_state st = {
		.seq = m,
		.start_address = KERN_VIRT_START,
		.marker = address_markers,
	};
	/* Traverse kernel page tables */
	walk_pagetables(&st);
	note_page(&st, 0, 0, 0);
	return 0;
}


static int ptdump_open(struct inode *inode, struct file *file)
{
	return single_open(file, ptdump_show, NULL);
}

static const struct file_operations ptdump_fops = {
	.open		= ptdump_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= single_release,
};

static void build_pgtable_complete_mask(void)
{
	unsigned int i, j;

	for (i = 0; i < ARRAY_SIZE(pg_level); i++)
		if (pg_level[i].flag)
			for (j = 0; j < pg_level[i].num; j++)
				pg_level[i].mask |= pg_level[i].flag[j].mask;
}

static int ptdump_init(void)
{
	struct dentry *debugfs_file;

	populate_markers();
	build_pgtable_complete_mask();
	debugfs_file = debugfs_create_file("kernel_pagetables", 0400, NULL,
			NULL, &ptdump_fops);
	return debugfs_file ? 0 : -ENOMEM;
}
device_initcall(ptdump_init);
Commit	Line	Data
8eb07b18 RG	1	/*
	2	* Copyright 2016, Rashmica Gupta, IBM Corp.
	3	*
	4	* This traverses the kernel pagetables and dumps the
	5	* information about the used sections of memory to
	6	* /sys/kernel/debug/kernel_pagetables.
	7	*
	8	* Derived from the arm64 implementation:
	9	* Copyright (c) 2014, The Linux Foundation, Laura Abbott.
	10	* (C) Copyright 2008 Intel Corporation, Arjan van de Ven.
	11	*
	12	* This program is free software; you can redistribute it and/or
	13	* modify it under the terms of the GNU General Public License
	14	* as published by the Free Software Foundation; version 2
	15	* of the License.
	16	*/
	17	#include <linux/debugfs.h>
	18	#include <linux/fs.h>
	19	#include <linux/io.h>
	20	#include <linux/mm.h>
	21	#include <linux/sched.h>
	22	#include <linux/seq_file.h>
	23	#include <asm/fixmap.h>
	24	#include <asm/pgtable.h>
	25	#include <linux/const.h>
	26	#include <asm/page.h>
	27	#include <asm/pgalloc.h>
	28
	29	/*
	30	* To visualise what is happening,
	31	*
	32	* - PTRS_PER_P = how many entries there are in the corresponding P
	33	* - P**_SHIFT = how many bits of the address we use to index into the
	34	* corresponding P**
	35	* - P**_SIZE is how much memory we can access through the table - not the
	36	* size of the table itself.
	37	* P**={PGD, PUD, PMD, PTE}
	38	*
	39	*
	40	* Each entry of the PGD points to a PUD. Each entry of a PUD points to a
	41	* PMD. Each entry of a PMD points to a PTE. And every PTE entry points to
	42	* a page.
	43	*
	44	* In the case where there are only 3 levels, the PUD is folded into the
	45	* PGD: every PUD has only one entry which points to the PMD.
	46	*
	47	* The page dumper groups page table entries of the same type into a single
	48	* description. It uses pg_state to track the range information while
	49	* iterating over the PTE entries. When the continuity is broken it then
	50	* dumps out a description of the range - ie PTEs that are virtually contiguous
	51	* with the same PTE flags are chunked together. This is to make it clear how
	52	* different areas of the kernel virtual memory are used.
	53	*
	54	*/
	55	struct pg_state {
	56	struct seq_file *seq;
	57	const struct addr_marker *marker;
	58	unsigned long start_address;
	59	unsigned int level;
	60	u64 current_flags;
	61	};
	62
	63	struct addr_marker {
	64	unsigned long start_address;
65	const char *name;
66	};
67
68	static struct addr_marker address_markers[] = {
69	{ 0, "Start of kernel VM" },
70	{ 0, "vmalloc() Area" },
71	{ 0, "vmalloc() End" },
72	{ 0, "isa I/O start" },
73	{ 0, "isa I/O end" },
74	{ 0, "phb I/O start" },
75	{ 0, "phb I/O end" },
76	{ 0, "I/O remap start" },
77	{ 0, "I/O remap end" },
78	{ 0, "vmemmap start" },
79	{ -1, NULL },
80	};
81
82	struct flag_info {
83	u64 mask;
84	u64 val;
85	const char *set;
86	const char *clear;
87	bool is_val;
88	int shift;
89	};
90
91	static const struct flag_info flag_array[] = {
92	{
93	#ifdef CONFIG_PPC_STD_MMU_64
94	.mask = _PAGE_PRIVILEGED,
95	.val = 0,
96	#else
97	.mask = _PAGE_USER,
98	.val = _PAGE_USER,
99	#endif
100	.set = "user",
101	.clear = " ",
102	}, {
103	.mask = _PAGE_RW,
104	.val = _PAGE_RW,
105	.set = "rw",
106	.clear = "ro",
107	}, {
108	.mask = _PAGE_EXEC,
109	.val = _PAGE_EXEC,
110	.set = " X ",
111	.clear = " ",
112	}, {
113	.mask = _PAGE_PTE,
114	.val = _PAGE_PTE,
115	.set = "pte",
116	.clear = " ",
117	}, {
118	.mask = _PAGE_PRESENT,
119	.val = _PAGE_PRESENT,
120	.set = "present",
121	.clear = " ",
122	}, {
123	#ifdef CONFIG_PPC_STD_MMU_64
124	.mask = H_PAGE_HASHPTE,
125	.val = H_PAGE_HASHPTE,
126	#else
127	.mask = _PAGE_HASHPTE,
128	.val = _PAGE_HASHPTE,
129	#endif
130	.set = "hpte",
131	.clear = " ",
132	}, {
133	#ifndef CONFIG_PPC_STD_MMU_64
134	.mask = _PAGE_GUARDED,
135	.val = _PAGE_GUARDED,
136	.set = "guarded",
137	.clear = " ",
138	}, {
139	#endif
140	.mask = _PAGE_DIRTY,
141	.val = _PAGE_DIRTY,
142	.set = "dirty",
143	.clear = " ",
144	}, {
145	.mask = _PAGE_ACCESSED,
146	.val = _PAGE_ACCESSED,
147	.set = "accessed",
148	.clear = " ",
149	}, {
150	#ifndef CONFIG_PPC_STD_MMU_64
151	.mask = _PAGE_WRITETHRU,
152	.val = _PAGE_WRITETHRU,
153	.set = "write through",
154	.clear = " ",
155	}, {
156	#endif
157	.mask = _PAGE_NO_CACHE,
158	.val = _PAGE_NO_CACHE,
159	.set = "no cache",
160	.clear = " ",
161	}, {
162	.mask = H_PAGE_BUSY,
163	.val = H_PAGE_BUSY,
164	.set = "busy",
165	}, {
166	#ifdef CONFIG_PPC_64K_PAGES
167	.mask = H_PAGE_COMBO,
168	.val = H_PAGE_COMBO,
169	.set = "combo",
170	}, {
171	.mask = H_PAGE_4K_PFN,
172	.val = H_PAGE_4K_PFN,
173	.set = "4K_pfn",
174	}, {
175	#endif
176	.mask = H_PAGE_F_GIX,
177	.val = H_PAGE_F_GIX,
178	.set = "f_gix",
179	.is_val = true,
180	.shift = H_PAGE_F_GIX_SHIFT,
181	}, {
182	.mask = H_PAGE_F_SECOND,
183	.val = H_PAGE_F_SECOND,
184	.set = "f_second",
185	}, {
186	.mask = _PAGE_SPECIAL,
187	.val = _PAGE_SPECIAL,
188	.set = "special",
189	}
190	};
191
192	struct pgtable_level {
193	const struct flag_info *flag;
194	size_t num;
195	u64 mask;
196	};
197
198	static struct pgtable_level pg_level[] = {
199	{
200	}, { /* pgd */
201	.flag = flag_array,
202	.num = ARRAY_SIZE(flag_array),
203	}, { /* pud */
204	.flag = flag_array,
205	.num = ARRAY_SIZE(flag_array),
206	}, { /* pmd */
207	.flag = flag_array,
208	.num = ARRAY_SIZE(flag_array),
209	}, { /* pte */
210	.flag = flag_array,
211	.num = ARRAY_SIZE(flag_array),
212	},
213	};
214
215	static void dump_flag_info(struct pg_state *st, const struct flag_info
216	*flag, u64 pte, int num)
217	{
218	unsigned int i;
219
220	for (i = 0; i < num; i++, flag++) {
221	const char *s = NULL;
222	u64 val;
223
224	/* flag not defined so don't check it */
225	if (flag->mask == 0)
226	continue;
227	/* Some 'flags' are actually values */
228	if (flag->is_val) {
229	val = pte & flag->val;
230	if (flag->shift)
231	val = val >> flag->shift;
232	seq_printf(st->seq, " %s:%llx", flag->set, val);
233	} else {
234	if ((pte & flag->mask) == flag->val)
235	s = flag->set;
236	else
237	s = flag->clear;
238	if (s)
239	seq_printf(st->seq, " %s", s);
240	}
241	st->current_flags &= ~flag->mask;
242	}
243	if (st->current_flags != 0)
244	seq_printf(st->seq, " unknown flags:%llx", st->current_flags);
245	}
246
247	static void dump_addr(struct pg_state *st, unsigned long addr)
248	{
249	static const char units[] = "KMGTPE";
250	const char *unit = units;
251	unsigned long delta;
252
253	seq_printf(st->seq, "0x%016lx-0x%016lx ", st->start_address, addr-1);
254	delta = (addr - st->start_address) >> 10;
255	/* Work out what appropriate unit to use */
256	while (!(delta & 1023) && unit[1]) {
257	delta >>= 10;
258	unit++;
259	}
260	seq_printf(st->seq, "%9lu%c", delta, *unit);
261
262	}
263
264	static void note_page(struct pg_state *st, unsigned long addr,
265	unsigned int level, u64 val)
266	{
267	u64 flag = val & pg_level[level].mask;
268	/* At first no level is set */
269	if (!st->level) {
270	st->level = level;
271	st->current_flags = flag;
272	st->start_address = addr;
273	seq_printf(st->seq, "---[ %s ]---\n", st->marker->name);
274	/*
275	* Dump the section of virtual memory when:
276	* - the PTE flags from one entry to the next differs.
277	* - we change levels in the tree.
278	* - the address is in a different section of memory and is thus
279	* used for a different purpose, regardless of the flags.
280	*/
281	} else if (flag != st->current_flags \|\| level != st->level \|\|
282	addr >= st->marker[1].start_address) {
283
284	/* Check the PTE flags */
285	if (st->current_flags) {
286	dump_addr(st, addr);
287
288	/* Dump all the flags */
289	if (pg_level[st->level].flag)
290	dump_flag_info(st, pg_level[st->level].flag,
291	st->current_flags,
292	pg_level[st->level].num);
293
294	seq_puts(st->seq, "\n");
295	}
296
297	/*
298	* Address indicates we have passed the end of the
299	* current section of virtual memory
300	*/
301	while (addr >= st->marker[1].start_address) {
302	st->marker++;
303	seq_printf(st->seq, "---[ %s ]---\n", st->marker->name);
304	}
305	st->start_address = addr;
306	st->current_flags = flag;
307	st->level = level;
308	}
309	}
310
311	static void walk_pte(struct pg_state st, pmd_t pmd, unsigned long start)
312	{
313	pte_t *pte = pte_offset_kernel(pmd, 0);
314	unsigned long addr;
315	unsigned int i;
316
317	for (i = 0; i < PTRS_PER_PTE; i++, pte++) {
318	addr = start + i * PAGE_SIZE;
319	note_page(st, addr, 4, pte_val(*pte));
320
321	}
322	}
323
324	static void walk_pmd(struct pg_state st, pud_t pud, unsigned long start)
325	{
326	pmd_t *pmd = pmd_offset(pud, 0);
327	unsigned long addr;
328	unsigned int i;
329
330	for (i = 0; i < PTRS_PER_PMD; i++, pmd++) {
331	addr = start + i * PMD_SIZE;
332	if (!pmd_none(*pmd))
333	/* pmd exists */
334	walk_pte(st, pmd, addr);
335	else
336	note_page(st, addr, 3, pmd_val(*pmd));
337	}
338	}
339
340	static void walk_pud(struct pg_state st, pgd_t pgd, unsigned long start)
341	{
342	pud_t *pud = pud_offset(pgd, 0);
343	unsigned long addr;
344	unsigned int i;
345
346	for (i = 0; i < PTRS_PER_PUD; i++, pud++) {
347	addr = start + i * PUD_SIZE;
348	if (!pud_none(*pud))
349	/* pud exists */
350	walk_pmd(st, pud, addr);
351	else
352	note_page(st, addr, 2, pud_val(*pud));
353	}
354	}
355
356	static void walk_pagetables(struct pg_state *st)
357	{
358	pgd_t *pgd = pgd_offset_k(0UL);
359	unsigned int i;
360	unsigned long addr;
361
362	/*
363	* Traverse the linux pagetable structure and dump pages that are in
364	* the hash pagetable.
365	*/
366	for (i = 0; i < PTRS_PER_PGD; i++, pgd++) {
367	addr = KERN_VIRT_START + i * PGDIR_SIZE;
368	if (!pgd_none(*pgd))
369	/* pgd exists */
370	walk_pud(st, pgd, addr);
371	else
372	note_page(st, addr, 1, pgd_val(*pgd));
373	}
374	}
375
376	static void populate_markers(void)
377	{
378	address_markers[0].start_address = PAGE_OFFSET;
379	address_markers[1].start_address = VMALLOC_START;
380	address_markers[2].start_address = VMALLOC_END;
381	address_markers[3].start_address = ISA_IO_BASE;
382	address_markers[4].start_address = ISA_IO_END;
383	address_markers[5].start_address = PHB_IO_BASE;
384	address_markers[6].start_address = PHB_IO_END;
385	address_markers[7].start_address = IOREMAP_BASE;
386	address_markers[8].start_address = IOREMAP_END;
387	#ifdef CONFIG_PPC_STD_MMU_64
388	address_markers[9].start_address = H_VMEMMAP_BASE;
389	#else
390	address_markers[9].start_address = VMEMMAP_BASE;
391	#endif
392	}
393
394	static int ptdump_show(struct seq_file m, void v)
395	{
396	struct pg_state st = {
397	.seq = m,
398	.start_address = KERN_VIRT_START,
399	.marker = address_markers,
400	};
401	/* Traverse kernel page tables */
402	walk_pagetables(&st);
403	note_page(&st, 0, 0, 0);
404	return 0;
405	}
406
407
408	static int ptdump_open(struct inode inode, struct file file)
409	{
410	return single_open(file, ptdump_show, NULL);
411	}
412
413	static const struct file_operations ptdump_fops = {
414	.open = ptdump_open,
415	.read = seq_read,
416	.llseek = seq_lseek,
417	.release = single_release,
418	};
419
420	static void build_pgtable_complete_mask(void)
421	{
422	unsigned int i, j;
423
424	for (i = 0; i < ARRAY_SIZE(pg_level); i++)
425	if (pg_level[i].flag)
426	for (j = 0; j < pg_level[i].num; j++)
427	pg_level[i].mask \|= pg_level[i].flag[j].mask;
428	}
429
430	static int ptdump_init(void)
431	{
432	struct dentry *debugfs_file;
433
434	populate_markers();
435	build_pgtable_complete_mask();
436	debugfs_file = debugfs_create_file("kernel_pagetables", 0400, NULL,
437	NULL, &ptdump_fops);
438	return debugfs_file ? 0 : -ENOMEM;
439	}
440	device_initcall(ptdump_init);