Blame view
mm/page_owner.c
14.7 KB
48c96a368 mm/page_owner: ke... |
1 2 3 4 5 6 7 |
#include <linux/debugfs.h> #include <linux/mm.h> #include <linux/slab.h> #include <linux/uaccess.h> #include <linux/bootmem.h> #include <linux/stacktrace.h> #include <linux/page_owner.h> |
7dd80b8af mm, page_owner: c... |
8 |
#include <linux/jump_label.h> |
7cd12b4ab mm, page_owner: t... |
9 |
#include <linux/migrate.h> |
f2ca0b557 mm/page_owner: us... |
10 |
#include <linux/stackdepot.h> |
e2f612e67 mm/page_owner: mo... |
11 |
#include <linux/seq_file.h> |
f2ca0b557 mm/page_owner: us... |
12 |
|
48c96a368 mm/page_owner: ke... |
13 |
#include "internal.h" |
f2ca0b557 mm/page_owner: us... |
14 15 16 17 18 |
/* * TODO: teach PAGE_OWNER_STACK_DEPTH (__dump_page_owner and save_stack) * to use off stack temporal storage */ #define PAGE_OWNER_STACK_DEPTH (16) |
9300d8dfd mm/page_owner: do... |
19 20 21 22 23 24 |
struct page_owner { unsigned int order; gfp_t gfp_mask; int last_migrate_reason; depot_stack_handle_t handle; }; |
48c96a368 mm/page_owner: ke... |
25 |
static bool page_owner_disabled = true; |
7dd80b8af mm, page_owner: c... |
26 |
DEFINE_STATIC_KEY_FALSE(page_owner_inited); |
48c96a368 mm/page_owner: ke... |
27 |
|
f2ca0b557 mm/page_owner: us... |
28 29 |
static depot_stack_handle_t dummy_handle; static depot_stack_handle_t failure_handle; |
61cf5febd mm/page_owner: co... |
30 |
static void init_early_allocated_pages(void); |
48c96a368 mm/page_owner: ke... |
31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 |
static int early_page_owner_param(char *buf) { if (!buf) return -EINVAL; if (strcmp(buf, "on") == 0) page_owner_disabled = false; return 0; } early_param("page_owner", early_page_owner_param); static bool need_page_owner(void) { if (page_owner_disabled) return false; return true; } |
f2ca0b557 mm/page_owner: us... |
50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 |
static noinline void register_dummy_stack(void) { unsigned long entries[4]; struct stack_trace dummy; dummy.nr_entries = 0; dummy.max_entries = ARRAY_SIZE(entries); dummy.entries = &entries[0]; dummy.skip = 0; save_stack_trace(&dummy); dummy_handle = depot_save_stack(&dummy, GFP_KERNEL); } static noinline void register_failure_stack(void) { unsigned long entries[4]; struct stack_trace failure; failure.nr_entries = 0; failure.max_entries = ARRAY_SIZE(entries); failure.entries = &entries[0]; failure.skip = 0; save_stack_trace(&failure); failure_handle = depot_save_stack(&failure, GFP_KERNEL); } |
48c96a368 mm/page_owner: ke... |
77 78 79 80 |
static void init_page_owner(void) { if (page_owner_disabled) return; |
f2ca0b557 mm/page_owner: us... |
81 82 |
register_dummy_stack(); register_failure_stack(); |
7dd80b8af mm, page_owner: c... |
83 |
static_branch_enable(&page_owner_inited); |
61cf5febd mm/page_owner: co... |
84 |
init_early_allocated_pages(); |
48c96a368 mm/page_owner: ke... |
85 86 87 |
} struct page_ext_operations page_owner_ops = { |
9300d8dfd mm/page_owner: do... |
88 |
.size = sizeof(struct page_owner), |
48c96a368 mm/page_owner: ke... |
89 90 91 |
.need = need_page_owner, .init = init_page_owner, }; |
9300d8dfd mm/page_owner: do... |
92 93 94 95 |
static inline struct page_owner *get_page_owner(struct page_ext *page_ext) { return (void *)page_ext + page_owner_ops.offset; } |
48c96a368 mm/page_owner: ke... |
96 97 98 99 100 101 102 |
void __reset_page_owner(struct page *page, unsigned int order) { int i; struct page_ext *page_ext; for (i = 0; i < (1 << order); i++) { page_ext = lookup_page_ext(page + i); |
f86e42719 mm: check the ret... |
103 104 |
if (unlikely(!page_ext)) continue; |
48c96a368 mm/page_owner: ke... |
105 106 107 |
__clear_bit(PAGE_EXT_OWNER, &page_ext->flags); } } |
f2ca0b557 mm/page_owner: us... |
108 109 |
static inline bool check_recursive_alloc(struct stack_trace *trace, unsigned long ip) |
48c96a368 mm/page_owner: ke... |
110 |
{ |
f2ca0b557 mm/page_owner: us... |
111 112 113 114 115 116 117 118 119 |
int i, count; if (!trace->nr_entries) return false; for (i = 0, count = 0; i < trace->nr_entries; i++) { if (trace->entries[i] == ip && ++count == 2) return true; } |
f86e42719 mm: check the ret... |
120 |
|
f2ca0b557 mm/page_owner: us... |
121 122 123 124 125 126 |
return false; } static noinline depot_stack_handle_t save_stack(gfp_t flags) { unsigned long entries[PAGE_OWNER_STACK_DEPTH]; |
94f759d62 mm/page_owner.c: ... |
127 128 |
struct stack_trace trace = { .nr_entries = 0, |
f2ca0b557 mm/page_owner: us... |
129 130 131 |
.entries = entries, .max_entries = PAGE_OWNER_STACK_DEPTH, .skip = 0 |
94f759d62 mm/page_owner.c: ... |
132 |
}; |
f2ca0b557 mm/page_owner: us... |
133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 |
depot_stack_handle_t handle; save_stack_trace(&trace); if (trace.nr_entries != 0 && trace.entries[trace.nr_entries-1] == ULONG_MAX) trace.nr_entries--; /* * We need to check recursion here because our request to stackdepot * could trigger memory allocation to save new entry. New memory * allocation would reach here and call depot_save_stack() again * if we don't catch it. There is still not enough memory in stackdepot * so it would try to allocate memory again and loop forever. */ if (check_recursive_alloc(&trace, _RET_IP_)) return dummy_handle; handle = depot_save_stack(&trace, flags); if (!handle) handle = failure_handle; return handle; } noinline void __set_page_owner(struct page *page, unsigned int order, gfp_t gfp_mask) { struct page_ext *page_ext = lookup_page_ext(page); |
9300d8dfd mm/page_owner: do... |
161 |
struct page_owner *page_owner; |
48c96a368 mm/page_owner: ke... |
162 |
|
f86e42719 mm: check the ret... |
163 164 |
if (unlikely(!page_ext)) return; |
9300d8dfd mm/page_owner: do... |
165 166 167 168 169 |
page_owner = get_page_owner(page_ext); page_owner->handle = save_stack(gfp_mask); page_owner->order = order; page_owner->gfp_mask = gfp_mask; page_owner->last_migrate_reason = -1; |
48c96a368 mm/page_owner: ke... |
170 171 172 |
__set_bit(PAGE_EXT_OWNER, &page_ext->flags); } |
7cd12b4ab mm, page_owner: t... |
173 174 175 |
void __set_page_owner_migrate_reason(struct page *page, int reason) { struct page_ext *page_ext = lookup_page_ext(page); |
9300d8dfd mm/page_owner: do... |
176 |
struct page_owner *page_owner; |
f86e42719 mm: check the ret... |
177 178 |
if (unlikely(!page_ext)) return; |
7cd12b4ab mm, page_owner: t... |
179 |
|
9300d8dfd mm/page_owner: do... |
180 181 |
page_owner = get_page_owner(page_ext); page_owner->last_migrate_reason = reason; |
7cd12b4ab mm, page_owner: t... |
182 |
} |
a9627bc5e mm/page_owner: in... |
183 |
void __split_page_owner(struct page *page, unsigned int order) |
e2cfc9112 mm/page_owner: se... |
184 |
{ |
a9627bc5e mm/page_owner: in... |
185 |
int i; |
e2cfc9112 mm/page_owner: se... |
186 |
struct page_ext *page_ext = lookup_page_ext(page); |
9300d8dfd mm/page_owner: do... |
187 |
struct page_owner *page_owner; |
a9627bc5e mm/page_owner: in... |
188 |
|
f86e42719 mm: check the ret... |
189 |
if (unlikely(!page_ext)) |
a9627bc5e mm/page_owner: in... |
190 |
return; |
e2cfc9112 mm/page_owner: se... |
191 |
|
9300d8dfd mm/page_owner: do... |
192 193 |
page_owner = get_page_owner(page_ext); page_owner->order = 0; |
a9627bc5e mm/page_owner: in... |
194 195 |
for (i = 1; i < (1 << order); i++) __copy_page_owner(page, page + i); |
e2cfc9112 mm/page_owner: se... |
196 |
} |
d435edca9 mm, page_owner: c... |
197 198 199 200 |
void __copy_page_owner(struct page *oldpage, struct page *newpage) { struct page_ext *old_ext = lookup_page_ext(oldpage); struct page_ext *new_ext = lookup_page_ext(newpage); |
9300d8dfd mm/page_owner: do... |
201 |
struct page_owner *old_page_owner, *new_page_owner; |
d435edca9 mm, page_owner: c... |
202 |
|
f86e42719 mm: check the ret... |
203 204 |
if (unlikely(!old_ext || !new_ext)) return; |
9300d8dfd mm/page_owner: do... |
205 206 207 208 209 210 211 |
old_page_owner = get_page_owner(old_ext); new_page_owner = get_page_owner(new_ext); new_page_owner->order = old_page_owner->order; new_page_owner->gfp_mask = old_page_owner->gfp_mask; new_page_owner->last_migrate_reason = old_page_owner->last_migrate_reason; new_page_owner->handle = old_page_owner->handle; |
d435edca9 mm, page_owner: c... |
212 213 214 215 216 217 218 219 220 221 222 223 |
/* * We don't clear the bit on the oldpage as it's going to be freed * after migration. Until then, the info can be useful in case of * a bug, and the overal stats will be off a bit only temporarily. * Also, migrate_misplaced_transhuge_page() can still fail the * migration and then we want the oldpage to retain the info. But * in that case we also don't need to explicitly clear the info from * the new page, which will be freed. */ __set_bit(PAGE_EXT_OWNER, &new_ext->flags); } |
e2f612e67 mm/page_owner: mo... |
224 225 226 227 228 |
void pagetypeinfo_showmixedcount_print(struct seq_file *m, pg_data_t *pgdat, struct zone *zone) { struct page *page; struct page_ext *page_ext; |
9300d8dfd mm/page_owner: do... |
229 |
struct page_owner *page_owner; |
e2f612e67 mm/page_owner: mo... |
230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 |
unsigned long pfn = zone->zone_start_pfn, block_end_pfn; unsigned long end_pfn = pfn + zone->spanned_pages; unsigned long count[MIGRATE_TYPES] = { 0, }; int pageblock_mt, page_mt; int i; /* Scan block by block. First and last block may be incomplete */ pfn = zone->zone_start_pfn; /* * Walk the zone in pageblock_nr_pages steps. If a page block spans * a zone boundary, it will be double counted between zones. This does * not matter as the mixed block count will still be correct */ for (; pfn < end_pfn; ) { if (!pfn_valid(pfn)) { pfn = ALIGN(pfn + 1, MAX_ORDER_NR_PAGES); continue; } block_end_pfn = ALIGN(pfn + 1, pageblock_nr_pages); block_end_pfn = min(block_end_pfn, end_pfn); page = pfn_to_page(pfn); pageblock_mt = get_pageblock_migratetype(page); for (; pfn < block_end_pfn; pfn++) { if (!pfn_valid_within(pfn)) continue; page = pfn_to_page(pfn); if (page_zone(page) != zone) continue; if (PageBuddy(page)) { pfn += (1UL << page_order(page)) - 1; continue; } if (PageReserved(page)) continue; page_ext = lookup_page_ext(page); if (unlikely(!page_ext)) continue; if (!test_bit(PAGE_EXT_OWNER, &page_ext->flags)) continue; |
9300d8dfd mm/page_owner: do... |
279 280 281 |
page_owner = get_page_owner(page_ext); page_mt = gfpflags_to_migratetype( page_owner->gfp_mask); |
e2f612e67 mm/page_owner: mo... |
282 283 284 285 286 287 288 289 290 |
if (pageblock_mt != page_mt) { if (is_migrate_cma(pageblock_mt)) count[MIGRATE_MOVABLE]++; else count[pageblock_mt]++; pfn = block_end_pfn; break; } |
9300d8dfd mm/page_owner: do... |
291 |
pfn += (1UL << page_owner->order) - 1; |
e2f612e67 mm/page_owner: mo... |
292 293 294 295 296 297 298 299 300 301 |
} } /* Print counts */ seq_printf(m, "Node %d, zone %8s ", pgdat->node_id, zone->name); for (i = 0; i < MIGRATE_TYPES; i++) seq_printf(m, "%12lu ", count[i]); seq_putc(m, ' '); } |
48c96a368 mm/page_owner: ke... |
302 303 |
static ssize_t print_page_owner(char __user *buf, size_t count, unsigned long pfn, |
9300d8dfd mm/page_owner: do... |
304 |
struct page *page, struct page_owner *page_owner, |
f2ca0b557 mm/page_owner: us... |
305 |
depot_stack_handle_t handle) |
48c96a368 mm/page_owner: ke... |
306 307 308 309 |
{ int ret; int pageblock_mt, page_mt; char *kbuf; |
f2ca0b557 mm/page_owner: us... |
310 |
unsigned long entries[PAGE_OWNER_STACK_DEPTH]; |
94f759d62 mm/page_owner.c: ... |
311 |
struct stack_trace trace = { |
f2ca0b557 mm/page_owner: us... |
312 313 314 315 |
.nr_entries = 0, .entries = entries, .max_entries = PAGE_OWNER_STACK_DEPTH, .skip = 0 |
94f759d62 mm/page_owner.c: ... |
316 |
}; |
48c96a368 mm/page_owner: ke... |
317 318 319 320 321 322 |
kbuf = kmalloc(count, GFP_KERNEL); if (!kbuf) return -ENOMEM; ret = snprintf(kbuf, count, |
60f30350f mm, page_owner: p... |
323 324 |
"Page allocated via order %u, mask %#x(%pGg) ", |
9300d8dfd mm/page_owner: do... |
325 326 |
page_owner->order, page_owner->gfp_mask, &page_owner->gfp_mask); |
48c96a368 mm/page_owner: ke... |
327 328 329 330 331 |
if (ret >= count) goto err; /* Print information relevant to grouping pages by mobility */ |
0b423ca22 mm, page_alloc: i... |
332 |
pageblock_mt = get_pageblock_migratetype(page); |
9300d8dfd mm/page_owner: do... |
333 |
page_mt = gfpflags_to_migratetype(page_owner->gfp_mask); |
48c96a368 mm/page_owner: ke... |
334 |
ret += snprintf(kbuf + ret, count - ret, |
60f30350f mm, page_owner: p... |
335 336 |
"PFN %lu type %s Block %lu type %s Flags %#lx(%pGp) ", |
48c96a368 mm/page_owner: ke... |
337 |
pfn, |
60f30350f mm, page_owner: p... |
338 |
migratetype_names[page_mt], |
48c96a368 mm/page_owner: ke... |
339 |
pfn >> pageblock_order, |
60f30350f mm, page_owner: p... |
340 341 |
migratetype_names[pageblock_mt], page->flags, &page->flags); |
48c96a368 mm/page_owner: ke... |
342 343 344 |
if (ret >= count) goto err; |
f2ca0b557 mm/page_owner: us... |
345 |
depot_fetch_stack(handle, &trace); |
94f759d62 mm/page_owner.c: ... |
346 |
ret += snprint_stack_trace(kbuf + ret, count - ret, &trace, 0); |
48c96a368 mm/page_owner: ke... |
347 348 |
if (ret >= count) goto err; |
9300d8dfd mm/page_owner: do... |
349 |
if (page_owner->last_migrate_reason != -1) { |
7cd12b4ab mm, page_owner: t... |
350 351 352 |
ret += snprintf(kbuf + ret, count - ret, "Page has been migrated, last migrate reason: %s ", |
9300d8dfd mm/page_owner: do... |
353 |
migrate_reason_names[page_owner->last_migrate_reason]); |
7cd12b4ab mm, page_owner: t... |
354 355 356 |
if (ret >= count) goto err; } |
48c96a368 mm/page_owner: ke... |
357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 |
ret += snprintf(kbuf + ret, count - ret, " "); if (ret >= count) goto err; if (copy_to_user(buf, kbuf, ret)) ret = -EFAULT; kfree(kbuf); return ret; err: kfree(kbuf); return -ENOMEM; } |
4e462112e mm, page_owner: d... |
372 373 374 |
void __dump_page_owner(struct page *page) { struct page_ext *page_ext = lookup_page_ext(page); |
9300d8dfd mm/page_owner: do... |
375 |
struct page_owner *page_owner; |
f2ca0b557 mm/page_owner: us... |
376 |
unsigned long entries[PAGE_OWNER_STACK_DEPTH]; |
4e462112e mm, page_owner: d... |
377 |
struct stack_trace trace = { |
f2ca0b557 mm/page_owner: us... |
378 379 380 381 |
.nr_entries = 0, .entries = entries, .max_entries = PAGE_OWNER_STACK_DEPTH, .skip = 0 |
4e462112e mm, page_owner: d... |
382 |
}; |
f2ca0b557 mm/page_owner: us... |
383 |
depot_stack_handle_t handle; |
8285027fc mm/page_owner: av... |
384 385 |
gfp_t gfp_mask; int mt; |
4e462112e mm, page_owner: d... |
386 |
|
f86e42719 mm: check the ret... |
387 388 389 390 391 |
if (unlikely(!page_ext)) { pr_alert("There is not page extension available. "); return; } |
9300d8dfd mm/page_owner: do... |
392 393 394 |
page_owner = get_page_owner(page_ext); gfp_mask = page_owner->gfp_mask; |
8285027fc mm/page_owner: av... |
395 |
mt = gfpflags_to_migratetype(gfp_mask); |
f86e42719 mm: check the ret... |
396 |
|
4e462112e mm, page_owner: d... |
397 398 399 400 401 |
if (!test_bit(PAGE_EXT_OWNER, &page_ext->flags)) { pr_alert("page_owner info is not active (free page?) "); return; } |
9300d8dfd mm/page_owner: do... |
402 |
handle = READ_ONCE(page_owner->handle); |
f2ca0b557 mm/page_owner: us... |
403 404 405 406 407 408 409 |
if (!handle) { pr_alert("page_owner info is not active (free page?) "); return; } depot_fetch_stack(handle, &trace); |
756a025f0 mm: coalesce spli... |
410 411 |
pr_alert("page allocated via order %u, migratetype %s, gfp_mask %#x(%pGg) ", |
9300d8dfd mm/page_owner: do... |
412 |
page_owner->order, migratetype_names[mt], gfp_mask, &gfp_mask); |
4e462112e mm, page_owner: d... |
413 |
print_stack_trace(&trace, 0); |
9300d8dfd mm/page_owner: do... |
414 |
if (page_owner->last_migrate_reason != -1) |
4e462112e mm, page_owner: d... |
415 416 |
pr_alert("page has been migrated, last migrate reason: %s ", |
9300d8dfd mm/page_owner: do... |
417 |
migrate_reason_names[page_owner->last_migrate_reason]); |
4e462112e mm, page_owner: d... |
418 |
} |
48c96a368 mm/page_owner: ke... |
419 420 421 422 423 424 |
static ssize_t read_page_owner(struct file *file, char __user *buf, size_t count, loff_t *ppos) { unsigned long pfn; struct page *page; struct page_ext *page_ext; |
9300d8dfd mm/page_owner: do... |
425 |
struct page_owner *page_owner; |
f2ca0b557 mm/page_owner: us... |
426 |
depot_stack_handle_t handle; |
48c96a368 mm/page_owner: ke... |
427 |
|
7dd80b8af mm, page_owner: c... |
428 |
if (!static_branch_unlikely(&page_owner_inited)) |
48c96a368 mm/page_owner: ke... |
429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 |
return -EINVAL; page = NULL; pfn = min_low_pfn + *ppos; /* Find a valid PFN or the start of a MAX_ORDER_NR_PAGES area */ while (!pfn_valid(pfn) && (pfn & (MAX_ORDER_NR_PAGES - 1)) != 0) pfn++; drain_all_pages(NULL); /* Find an allocated page */ for (; pfn < max_pfn; pfn++) { /* * If the new page is in a new MAX_ORDER_NR_PAGES area, * validate the area as existing, skip it if not */ if ((pfn & (MAX_ORDER_NR_PAGES - 1)) == 0 && !pfn_valid(pfn)) { pfn += MAX_ORDER_NR_PAGES - 1; continue; } /* Check for holes within a MAX_ORDER area */ if (!pfn_valid_within(pfn)) continue; page = pfn_to_page(pfn); if (PageBuddy(page)) { unsigned long freepage_order = page_order_unsafe(page); if (freepage_order < MAX_ORDER) pfn += (1UL << freepage_order) - 1; continue; } page_ext = lookup_page_ext(page); |
f86e42719 mm: check the ret... |
465 466 |
if (unlikely(!page_ext)) continue; |
48c96a368 mm/page_owner: ke... |
467 468 |
/* |
61cf5febd mm/page_owner: co... |
469 470 |
* Some pages could be missed by concurrent allocation or free, * because we don't hold the zone lock. |
48c96a368 mm/page_owner: ke... |
471 472 473 |
*/ if (!test_bit(PAGE_EXT_OWNER, &page_ext->flags)) continue; |
9300d8dfd mm/page_owner: do... |
474 |
page_owner = get_page_owner(page_ext); |
f2ca0b557 mm/page_owner: us... |
475 476 477 478 |
/* * Access to page_ext->handle isn't synchronous so we should * be careful to access it. */ |
9300d8dfd mm/page_owner: do... |
479 |
handle = READ_ONCE(page_owner->handle); |
f2ca0b557 mm/page_owner: us... |
480 481 |
if (!handle) continue; |
48c96a368 mm/page_owner: ke... |
482 483 |
/* Record the next PFN to read in the file offset */ *ppos = (pfn - min_low_pfn) + 1; |
f2ca0b557 mm/page_owner: us... |
484 |
return print_page_owner(buf, count, pfn, page, |
9300d8dfd mm/page_owner: do... |
485 |
page_owner, handle); |
48c96a368 mm/page_owner: ke... |
486 487 488 489 |
} return 0; } |
61cf5febd mm/page_owner: co... |
490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 |
static void init_pages_in_zone(pg_data_t *pgdat, struct zone *zone) { struct page *page; struct page_ext *page_ext; unsigned long pfn = zone->zone_start_pfn, block_end_pfn; unsigned long end_pfn = pfn + zone->spanned_pages; unsigned long count = 0; /* Scan block by block. First and last block may be incomplete */ pfn = zone->zone_start_pfn; /* * Walk the zone in pageblock_nr_pages steps. If a page block spans * a zone boundary, it will be double counted between zones. This does * not matter as the mixed block count will still be correct */ for (; pfn < end_pfn; ) { if (!pfn_valid(pfn)) { pfn = ALIGN(pfn + 1, MAX_ORDER_NR_PAGES); continue; } block_end_pfn = ALIGN(pfn + 1, pageblock_nr_pages); block_end_pfn = min(block_end_pfn, end_pfn); page = pfn_to_page(pfn); for (; pfn < block_end_pfn; pfn++) { if (!pfn_valid_within(pfn)) continue; page = pfn_to_page(pfn); |
9d43f5aec mm/page_owner: ad... |
522 523 |
if (page_zone(page) != zone) continue; |
61cf5febd mm/page_owner: co... |
524 525 526 527 528 529 530 531 532 533 534 535 536 |
/* * We are safe to check buddy flag and order, because * this is init stage and only single thread runs. */ if (PageBuddy(page)) { pfn += (1UL << page_order(page)) - 1; continue; } if (PageReserved(page)) continue; page_ext = lookup_page_ext(page); |
f86e42719 mm: check the ret... |
537 538 |
if (unlikely(!page_ext)) continue; |
61cf5febd mm/page_owner: co... |
539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 |
/* Maybe overraping zone */ if (test_bit(PAGE_EXT_OWNER, &page_ext->flags)) continue; /* Found early allocated page */ set_page_owner(page, 0, 0); count++; } } pr_info("Node %d, zone %8s: page owner found early allocated %lu pages ", pgdat->node_id, zone->name, count); } static void init_zones_in_node(pg_data_t *pgdat) { struct zone *zone; struct zone *node_zones = pgdat->node_zones; unsigned long flags; for (zone = node_zones; zone - node_zones < MAX_NR_ZONES; ++zone) { if (!populated_zone(zone)) continue; spin_lock_irqsave(&zone->lock, flags); init_pages_in_zone(pgdat, zone); spin_unlock_irqrestore(&zone->lock, flags); } } static void init_early_allocated_pages(void) { pg_data_t *pgdat; drain_all_pages(NULL); for_each_online_pgdat(pgdat) init_zones_in_node(pgdat); } |
48c96a368 mm/page_owner: ke... |
579 580 581 582 583 584 585 |
static const struct file_operations proc_page_owner_operations = { .read = read_page_owner, }; static int __init pageowner_init(void) { struct dentry *dentry; |
7dd80b8af mm, page_owner: c... |
586 |
if (!static_branch_unlikely(&page_owner_inited)) { |
48c96a368 mm/page_owner: ke... |
587 588 589 590 591 592 593 594 595 596 597 598 |
pr_info("page_owner is disabled "); return 0; } dentry = debugfs_create_file("page_owner", S_IRUSR, NULL, NULL, &proc_page_owner_operations); if (IS_ERR(dentry)) return PTR_ERR(dentry); return 0; } |
44c5af96d mm/page_owner.c: ... |
599 |
late_initcall(pageowner_init) |