dump.c 7.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342
  1. /*
  2. * Copyright (c) 2014, The Linux Foundation. All rights reserved.
  3. * Debug helper to dump the current kernel pagetables of the system
  4. * so that we can see what the various memory ranges are set to.
  5. *
  6. * Derived from x86 and arm implementation:
  7. * (C) Copyright 2008 Intel Corporation
  8. *
  9. * Author: Arjan van de Ven <arjan@linux.intel.com>
  10. *
  11. * This program is free software; you can redistribute it and/or
  12. * modify it under the terms of the GNU General Public License
  13. * as published by the Free Software Foundation; version 2
  14. * of the License.
  15. */
  16. #include <linux/debugfs.h>
  17. #include <linux/errno.h>
  18. #include <linux/fs.h>
  19. #include <linux/io.h>
  20. #include <linux/init.h>
  21. #include <linux/mm.h>
  22. #include <linux/sched.h>
  23. #include <linux/seq_file.h>
  24. #include <asm/fixmap.h>
  25. #include <asm/memory.h>
  26. #include <asm/pgtable.h>
  27. #include <asm/pgtable-hwdef.h>
  28. #define LOWEST_ADDR (UL(0xffffffffffffffff) << VA_BITS)
  29. struct addr_marker {
  30. unsigned long start_address;
  31. const char *name;
  32. };
  33. enum address_markers_idx {
  34. VMALLOC_START_NR = 0,
  35. VMALLOC_END_NR,
  36. #ifdef CONFIG_SPARSEMEM_VMEMMAP
  37. VMEMMAP_START_NR,
  38. VMEMMAP_END_NR,
  39. #endif
  40. FIXADDR_START_NR,
  41. FIXADDR_END_NR,
  42. PCI_START_NR,
  43. PCI_END_NR,
  44. MODULES_START_NR,
  45. MODUELS_END_NR,
  46. KERNEL_SPACE_NR,
  47. };
  48. static struct addr_marker address_markers[] = {
  49. { VMALLOC_START, "vmalloc() Area" },
  50. { VMALLOC_END, "vmalloc() End" },
  51. #ifdef CONFIG_SPARSEMEM_VMEMMAP
  52. { 0, "vmemmap start" },
  53. { 0, "vmemmap end" },
  54. #endif
  55. { FIXADDR_START, "Fixmap start" },
  56. { FIXADDR_TOP, "Fixmap end" },
  57. { PCI_IO_START, "PCI I/O start" },
  58. { PCI_IO_END, "PCI I/O end" },
  59. { MODULES_VADDR, "Modules start" },
  60. { MODULES_END, "Modules end" },
  61. { PAGE_OFFSET, "Kernel Mapping" },
  62. { -1, NULL },
  63. };
  64. struct pg_state {
  65. struct seq_file *seq;
  66. const struct addr_marker *marker;
  67. unsigned long start_address;
  68. unsigned level;
  69. u64 current_prot;
  70. };
  71. struct prot_bits {
  72. u64 mask;
  73. u64 val;
  74. const char *set;
  75. const char *clear;
  76. };
  77. static const struct prot_bits pte_bits[] = {
  78. {
  79. .mask = PTE_USER,
  80. .val = PTE_USER,
  81. .set = "USR",
  82. .clear = " ",
  83. }, {
  84. .mask = PTE_RDONLY,
  85. .val = PTE_RDONLY,
  86. .set = "ro",
  87. .clear = "RW",
  88. }, {
  89. .mask = PTE_PXN,
  90. .val = PTE_PXN,
  91. .set = "NX",
  92. .clear = "x ",
  93. }, {
  94. .mask = PTE_SHARED,
  95. .val = PTE_SHARED,
  96. .set = "SHD",
  97. .clear = " ",
  98. }, {
  99. .mask = PTE_AF,
  100. .val = PTE_AF,
  101. .set = "AF",
  102. .clear = " ",
  103. }, {
  104. .mask = PTE_NG,
  105. .val = PTE_NG,
  106. .set = "NG",
  107. .clear = " ",
  108. }, {
  109. .mask = PTE_UXN,
  110. .val = PTE_UXN,
  111. .set = "UXN",
  112. }, {
  113. .mask = PTE_ATTRINDX_MASK,
  114. .val = PTE_ATTRINDX(MT_DEVICE_nGnRnE),
  115. .set = "DEVICE/nGnRnE",
  116. }, {
  117. .mask = PTE_ATTRINDX_MASK,
  118. .val = PTE_ATTRINDX(MT_DEVICE_nGnRE),
  119. .set = "DEVICE/nGnRE",
  120. }, {
  121. .mask = PTE_ATTRINDX_MASK,
  122. .val = PTE_ATTRINDX(MT_DEVICE_GRE),
  123. .set = "DEVICE/GRE",
  124. }, {
  125. .mask = PTE_ATTRINDX_MASK,
  126. .val = PTE_ATTRINDX(MT_NORMAL_NC),
  127. .set = "MEM/NORMAL-NC",
  128. }, {
  129. .mask = PTE_ATTRINDX_MASK,
  130. .val = PTE_ATTRINDX(MT_NORMAL),
  131. .set = "MEM/NORMAL",
  132. }
  133. };
  134. struct pg_level {
  135. const struct prot_bits *bits;
  136. size_t num;
  137. u64 mask;
  138. };
  139. static struct pg_level pg_level[] = {
  140. {
  141. }, { /* pgd */
  142. .bits = pte_bits,
  143. .num = ARRAY_SIZE(pte_bits),
  144. }, { /* pud */
  145. .bits = pte_bits,
  146. .num = ARRAY_SIZE(pte_bits),
  147. }, { /* pmd */
  148. .bits = pte_bits,
  149. .num = ARRAY_SIZE(pte_bits),
  150. }, { /* pte */
  151. .bits = pte_bits,
  152. .num = ARRAY_SIZE(pte_bits),
  153. },
  154. };
  155. static void dump_prot(struct pg_state *st, const struct prot_bits *bits,
  156. size_t num)
  157. {
  158. unsigned i;
  159. for (i = 0; i < num; i++, bits++) {
  160. const char *s;
  161. if ((st->current_prot & bits->mask) == bits->val)
  162. s = bits->set;
  163. else
  164. s = bits->clear;
  165. if (s)
  166. seq_printf(st->seq, " %s", s);
  167. }
  168. }
  169. static void note_page(struct pg_state *st, unsigned long addr, unsigned level,
  170. u64 val)
  171. {
  172. static const char units[] = "KMGTPE";
  173. u64 prot = val & pg_level[level].mask;
  174. if (!st->level) {
  175. st->level = level;
  176. st->current_prot = prot;
  177. st->start_address = addr;
  178. seq_printf(st->seq, "---[ %s ]---\n", st->marker->name);
  179. } else if (prot != st->current_prot || level != st->level ||
  180. addr >= st->marker[1].start_address) {
  181. const char *unit = units;
  182. unsigned long delta;
  183. if (st->current_prot) {
  184. seq_printf(st->seq, "0x%16lx-0x%16lx ",
  185. st->start_address, addr);
  186. delta = (addr - st->start_address) >> 10;
  187. while (!(delta & 1023) && unit[1]) {
  188. delta >>= 10;
  189. unit++;
  190. }
  191. seq_printf(st->seq, "%9lu%c", delta, *unit);
  192. if (pg_level[st->level].bits)
  193. dump_prot(st, pg_level[st->level].bits,
  194. pg_level[st->level].num);
  195. seq_puts(st->seq, "\n");
  196. }
  197. if (addr >= st->marker[1].start_address) {
  198. st->marker++;
  199. seq_printf(st->seq, "---[ %s ]---\n", st->marker->name);
  200. }
  201. st->start_address = addr;
  202. st->current_prot = prot;
  203. st->level = level;
  204. }
  205. if (addr >= st->marker[1].start_address) {
  206. st->marker++;
  207. seq_printf(st->seq, "---[ %s ]---\n", st->marker->name);
  208. }
  209. }
  210. static void walk_pte(struct pg_state *st, pmd_t *pmd, unsigned long start)
  211. {
  212. pte_t *pte = pte_offset_kernel(pmd, 0);
  213. unsigned long addr;
  214. unsigned i;
  215. for (i = 0; i < PTRS_PER_PTE; i++, pte++) {
  216. addr = start + i * PAGE_SIZE;
  217. note_page(st, addr, 4, pte_val(*pte));
  218. }
  219. }
  220. static void walk_pmd(struct pg_state *st, pud_t *pud, unsigned long start)
  221. {
  222. pmd_t *pmd = pmd_offset(pud, 0);
  223. unsigned long addr;
  224. unsigned i;
  225. for (i = 0; i < PTRS_PER_PMD; i++, pmd++) {
  226. addr = start + i * PMD_SIZE;
  227. if (pmd_none(*pmd) || pmd_sect(*pmd)) {
  228. note_page(st, addr, 3, pmd_val(*pmd));
  229. } else {
  230. BUG_ON(pmd_bad(*pmd));
  231. walk_pte(st, pmd, addr);
  232. }
  233. }
  234. }
  235. static void walk_pud(struct pg_state *st, pgd_t *pgd, unsigned long start)
  236. {
  237. pud_t *pud = pud_offset(pgd, 0);
  238. unsigned long addr;
  239. unsigned i;
  240. for (i = 0; i < PTRS_PER_PUD; i++, pud++) {
  241. addr = start + i * PUD_SIZE;
  242. if (pud_none(*pud) || pud_sect(*pud)) {
  243. note_page(st, addr, 2, pud_val(*pud));
  244. } else {
  245. BUG_ON(pud_bad(*pud));
  246. walk_pmd(st, pud, addr);
  247. }
  248. }
  249. }
  250. static void walk_pgd(struct pg_state *st, struct mm_struct *mm, unsigned long start)
  251. {
  252. pgd_t *pgd = pgd_offset(mm, 0UL);
  253. unsigned i;
  254. unsigned long addr;
  255. for (i = 0; i < PTRS_PER_PGD; i++, pgd++) {
  256. addr = start + i * PGDIR_SIZE;
  257. if (pgd_none(*pgd)) {
  258. note_page(st, addr, 1, pgd_val(*pgd));
  259. } else {
  260. BUG_ON(pgd_bad(*pgd));
  261. walk_pud(st, pgd, addr);
  262. }
  263. }
  264. }
  265. static int ptdump_show(struct seq_file *m, void *v)
  266. {
  267. struct pg_state st = {
  268. .seq = m,
  269. .marker = address_markers,
  270. };
  271. walk_pgd(&st, &init_mm, LOWEST_ADDR);
  272. note_page(&st, 0, 0, 0);
  273. return 0;
  274. }
  275. static int ptdump_open(struct inode *inode, struct file *file)
  276. {
  277. return single_open(file, ptdump_show, NULL);
  278. }
  279. static const struct file_operations ptdump_fops = {
  280. .open = ptdump_open,
  281. .read = seq_read,
  282. .llseek = seq_lseek,
  283. .release = single_release,
  284. };
  285. static int ptdump_init(void)
  286. {
  287. struct dentry *pe;
  288. unsigned i, j;
  289. for (i = 0; i < ARRAY_SIZE(pg_level); i++)
  290. if (pg_level[i].bits)
  291. for (j = 0; j < pg_level[i].num; j++)
  292. pg_level[i].mask |= pg_level[i].bits[j].mask;
  293. #ifdef CONFIG_SPARSEMEM_VMEMMAP
  294. address_markers[VMEMMAP_START_NR].start_address =
  295. (unsigned long)virt_to_page(PAGE_OFFSET);
  296. address_markers[VMEMMAP_END_NR].start_address =
  297. (unsigned long)virt_to_page(high_memory);
  298. #endif
  299. pe = debugfs_create_file("kernel_page_tables", 0400, NULL, NULL,
  300. &ptdump_fops);
  301. return pe ? 0 : -ENOMEM;
  302. }
  303. device_initcall(ptdump_init);