page_owner.c 8.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378
  1. #include <linux/debugfs.h>
  2. #include <linux/mm.h>
  3. #include <linux/slab.h>
  4. #include <linux/uaccess.h>
  5. #include <linux/bootmem.h>
  6. #include <linux/stacktrace.h>
  7. #include <linux/page_owner.h>
  8. #include <linux/jump_label.h>
  9. #include <linux/migrate.h>
  10. #include "internal.h"
  11. static bool page_owner_disabled = true;
  12. DEFINE_STATIC_KEY_FALSE(page_owner_inited);
  13. static void init_early_allocated_pages(void);
  14. static int early_page_owner_param(char *buf)
  15. {
  16. if (!buf)
  17. return -EINVAL;
  18. if (strcmp(buf, "on") == 0)
  19. page_owner_disabled = false;
  20. return 0;
  21. }
  22. early_param("page_owner", early_page_owner_param);
  23. static bool need_page_owner(void)
  24. {
  25. if (page_owner_disabled)
  26. return false;
  27. return true;
  28. }
  29. static void init_page_owner(void)
  30. {
  31. if (page_owner_disabled)
  32. return;
  33. static_branch_enable(&page_owner_inited);
  34. init_early_allocated_pages();
  35. }
  36. struct page_ext_operations page_owner_ops = {
  37. .need = need_page_owner,
  38. .init = init_page_owner,
  39. };
  40. void __reset_page_owner(struct page *page, unsigned int order)
  41. {
  42. int i;
  43. struct page_ext *page_ext;
  44. for (i = 0; i < (1 << order); i++) {
  45. page_ext = lookup_page_ext(page + i);
  46. __clear_bit(PAGE_EXT_OWNER, &page_ext->flags);
  47. }
  48. }
  49. void __set_page_owner(struct page *page, unsigned int order, gfp_t gfp_mask)
  50. {
  51. struct page_ext *page_ext = lookup_page_ext(page);
  52. struct stack_trace trace = {
  53. .nr_entries = 0,
  54. .max_entries = ARRAY_SIZE(page_ext->trace_entries),
  55. .entries = &page_ext->trace_entries[0],
  56. .skip = 3,
  57. };
  58. save_stack_trace(&trace);
  59. page_ext->order = order;
  60. page_ext->gfp_mask = gfp_mask;
  61. page_ext->nr_entries = trace.nr_entries;
  62. page_ext->last_migrate_reason = -1;
  63. __set_bit(PAGE_EXT_OWNER, &page_ext->flags);
  64. }
  65. void __set_page_owner_migrate_reason(struct page *page, int reason)
  66. {
  67. struct page_ext *page_ext = lookup_page_ext(page);
  68. page_ext->last_migrate_reason = reason;
  69. }
  70. gfp_t __get_page_owner_gfp(struct page *page)
  71. {
  72. struct page_ext *page_ext = lookup_page_ext(page);
  73. return page_ext->gfp_mask;
  74. }
  75. void __copy_page_owner(struct page *oldpage, struct page *newpage)
  76. {
  77. struct page_ext *old_ext = lookup_page_ext(oldpage);
  78. struct page_ext *new_ext = lookup_page_ext(newpage);
  79. int i;
  80. new_ext->order = old_ext->order;
  81. new_ext->gfp_mask = old_ext->gfp_mask;
  82. new_ext->nr_entries = old_ext->nr_entries;
  83. for (i = 0; i < ARRAY_SIZE(new_ext->trace_entries); i++)
  84. new_ext->trace_entries[i] = old_ext->trace_entries[i];
  85. /*
  86. * We don't clear the bit on the oldpage as it's going to be freed
  87. * after migration. Until then, the info can be useful in case of
  88. * a bug, and the overal stats will be off a bit only temporarily.
  89. * Also, migrate_misplaced_transhuge_page() can still fail the
  90. * migration and then we want the oldpage to retain the info. But
  91. * in that case we also don't need to explicitly clear the info from
  92. * the new page, which will be freed.
  93. */
  94. __set_bit(PAGE_EXT_OWNER, &new_ext->flags);
  95. }
  96. static ssize_t
  97. print_page_owner(char __user *buf, size_t count, unsigned long pfn,
  98. struct page *page, struct page_ext *page_ext)
  99. {
  100. int ret;
  101. int pageblock_mt, page_mt;
  102. char *kbuf;
  103. struct stack_trace trace = {
  104. .nr_entries = page_ext->nr_entries,
  105. .entries = &page_ext->trace_entries[0],
  106. };
  107. kbuf = kmalloc(count, GFP_KERNEL);
  108. if (!kbuf)
  109. return -ENOMEM;
  110. ret = snprintf(kbuf, count,
  111. "Page allocated via order %u, mask %#x(%pGg)\n",
  112. page_ext->order, page_ext->gfp_mask,
  113. &page_ext->gfp_mask);
  114. if (ret >= count)
  115. goto err;
  116. /* Print information relevant to grouping pages by mobility */
  117. pageblock_mt = get_pfnblock_migratetype(page, pfn);
  118. page_mt = gfpflags_to_migratetype(page_ext->gfp_mask);
  119. ret += snprintf(kbuf + ret, count - ret,
  120. "PFN %lu type %s Block %lu type %s Flags %#lx(%pGp)\n",
  121. pfn,
  122. migratetype_names[page_mt],
  123. pfn >> pageblock_order,
  124. migratetype_names[pageblock_mt],
  125. page->flags, &page->flags);
  126. if (ret >= count)
  127. goto err;
  128. ret += snprint_stack_trace(kbuf + ret, count - ret, &trace, 0);
  129. if (ret >= count)
  130. goto err;
  131. if (page_ext->last_migrate_reason != -1) {
  132. ret += snprintf(kbuf + ret, count - ret,
  133. "Page has been migrated, last migrate reason: %s\n",
  134. migrate_reason_names[page_ext->last_migrate_reason]);
  135. if (ret >= count)
  136. goto err;
  137. }
  138. ret += snprintf(kbuf + ret, count - ret, "\n");
  139. if (ret >= count)
  140. goto err;
  141. if (copy_to_user(buf, kbuf, ret))
  142. ret = -EFAULT;
  143. kfree(kbuf);
  144. return ret;
  145. err:
  146. kfree(kbuf);
  147. return -ENOMEM;
  148. }
  149. void __dump_page_owner(struct page *page)
  150. {
  151. struct page_ext *page_ext = lookup_page_ext(page);
  152. struct stack_trace trace = {
  153. .nr_entries = page_ext->nr_entries,
  154. .entries = &page_ext->trace_entries[0],
  155. };
  156. gfp_t gfp_mask = page_ext->gfp_mask;
  157. int mt = gfpflags_to_migratetype(gfp_mask);
  158. if (!test_bit(PAGE_EXT_OWNER, &page_ext->flags)) {
  159. pr_alert("page_owner info is not active (free page?)\n");
  160. return;
  161. }
  162. pr_alert("page allocated via order %u, migratetype %s, "
  163. "gfp_mask %#x(%pGg)\n", page_ext->order,
  164. migratetype_names[mt], gfp_mask, &gfp_mask);
  165. print_stack_trace(&trace, 0);
  166. if (page_ext->last_migrate_reason != -1)
  167. pr_alert("page has been migrated, last migrate reason: %s\n",
  168. migrate_reason_names[page_ext->last_migrate_reason]);
  169. }
  170. static ssize_t
  171. read_page_owner(struct file *file, char __user *buf, size_t count, loff_t *ppos)
  172. {
  173. unsigned long pfn;
  174. struct page *page;
  175. struct page_ext *page_ext;
  176. if (!static_branch_unlikely(&page_owner_inited))
  177. return -EINVAL;
  178. page = NULL;
  179. pfn = min_low_pfn + *ppos;
  180. /* Find a valid PFN or the start of a MAX_ORDER_NR_PAGES area */
  181. while (!pfn_valid(pfn) && (pfn & (MAX_ORDER_NR_PAGES - 1)) != 0)
  182. pfn++;
  183. drain_all_pages(NULL);
  184. /* Find an allocated page */
  185. for (; pfn < max_pfn; pfn++) {
  186. /*
  187. * If the new page is in a new MAX_ORDER_NR_PAGES area,
  188. * validate the area as existing, skip it if not
  189. */
  190. if ((pfn & (MAX_ORDER_NR_PAGES - 1)) == 0 && !pfn_valid(pfn)) {
  191. pfn += MAX_ORDER_NR_PAGES - 1;
  192. continue;
  193. }
  194. /* Check for holes within a MAX_ORDER area */
  195. if (!pfn_valid_within(pfn))
  196. continue;
  197. page = pfn_to_page(pfn);
  198. if (PageBuddy(page)) {
  199. unsigned long freepage_order = page_order_unsafe(page);
  200. if (freepage_order < MAX_ORDER)
  201. pfn += (1UL << freepage_order) - 1;
  202. continue;
  203. }
  204. page_ext = lookup_page_ext(page);
  205. /*
  206. * Some pages could be missed by concurrent allocation or free,
  207. * because we don't hold the zone lock.
  208. */
  209. if (!test_bit(PAGE_EXT_OWNER, &page_ext->flags))
  210. continue;
  211. /* Record the next PFN to read in the file offset */
  212. *ppos = (pfn - min_low_pfn) + 1;
  213. return print_page_owner(buf, count, pfn, page, page_ext);
  214. }
  215. return 0;
  216. }
  217. static void init_pages_in_zone(pg_data_t *pgdat, struct zone *zone)
  218. {
  219. struct page *page;
  220. struct page_ext *page_ext;
  221. unsigned long pfn = zone->zone_start_pfn, block_end_pfn;
  222. unsigned long end_pfn = pfn + zone->spanned_pages;
  223. unsigned long count = 0;
  224. /* Scan block by block. First and last block may be incomplete */
  225. pfn = zone->zone_start_pfn;
  226. /*
  227. * Walk the zone in pageblock_nr_pages steps. If a page block spans
  228. * a zone boundary, it will be double counted between zones. This does
  229. * not matter as the mixed block count will still be correct
  230. */
  231. for (; pfn < end_pfn; ) {
  232. if (!pfn_valid(pfn)) {
  233. pfn = ALIGN(pfn + 1, MAX_ORDER_NR_PAGES);
  234. continue;
  235. }
  236. block_end_pfn = ALIGN(pfn + 1, pageblock_nr_pages);
  237. block_end_pfn = min(block_end_pfn, end_pfn);
  238. page = pfn_to_page(pfn);
  239. for (; pfn < block_end_pfn; pfn++) {
  240. if (!pfn_valid_within(pfn))
  241. continue;
  242. page = pfn_to_page(pfn);
  243. /*
  244. * We are safe to check buddy flag and order, because
  245. * this is init stage and only single thread runs.
  246. */
  247. if (PageBuddy(page)) {
  248. pfn += (1UL << page_order(page)) - 1;
  249. continue;
  250. }
  251. if (PageReserved(page))
  252. continue;
  253. page_ext = lookup_page_ext(page);
  254. /* Maybe overraping zone */
  255. if (test_bit(PAGE_EXT_OWNER, &page_ext->flags))
  256. continue;
  257. /* Found early allocated page */
  258. set_page_owner(page, 0, 0);
  259. count++;
  260. }
  261. }
  262. pr_info("Node %d, zone %8s: page owner found early allocated %lu pages\n",
  263. pgdat->node_id, zone->name, count);
  264. }
  265. static void init_zones_in_node(pg_data_t *pgdat)
  266. {
  267. struct zone *zone;
  268. struct zone *node_zones = pgdat->node_zones;
  269. unsigned long flags;
  270. for (zone = node_zones; zone - node_zones < MAX_NR_ZONES; ++zone) {
  271. if (!populated_zone(zone))
  272. continue;
  273. spin_lock_irqsave(&zone->lock, flags);
  274. init_pages_in_zone(pgdat, zone);
  275. spin_unlock_irqrestore(&zone->lock, flags);
  276. }
  277. }
  278. static void init_early_allocated_pages(void)
  279. {
  280. pg_data_t *pgdat;
  281. drain_all_pages(NULL);
  282. for_each_online_pgdat(pgdat)
  283. init_zones_in_node(pgdat);
  284. }
  285. static const struct file_operations proc_page_owner_operations = {
  286. .read = read_page_owner,
  287. };
  288. static int __init pageowner_init(void)
  289. {
  290. struct dentry *dentry;
  291. if (!static_branch_unlikely(&page_owner_inited)) {
  292. pr_info("page_owner is disabled\n");
  293. return 0;
  294. }
  295. dentry = debugfs_create_file("page_owner", S_IRUSR, NULL,
  296. NULL, &proc_page_owner_operations);
  297. if (IS_ERR(dentry))
  298. return PTR_ERR(dentry);
  299. return 0;
  300. }
  301. late_initcall(pageowner_init)