.. | .. |
---|
3 | 3 | #include <linux/mm.h> |
---|
4 | 4 | #include <linux/slab.h> |
---|
5 | 5 | #include <linux/uaccess.h> |
---|
6 | | -#include <linux/bootmem.h> |
---|
| 6 | +#include <linux/memblock.h> |
---|
7 | 7 | #include <linux/stacktrace.h> |
---|
8 | 8 | #include <linux/page_owner.h> |
---|
9 | 9 | #include <linux/jump_label.h> |
---|
10 | 10 | #include <linux/migrate.h> |
---|
11 | 11 | #include <linux/stackdepot.h> |
---|
12 | 12 | #include <linux/seq_file.h> |
---|
| 13 | +#include <linux/sched/clock.h> |
---|
13 | 14 | |
---|
14 | 15 | #include "internal.h" |
---|
15 | 16 | |
---|
.. | .. |
---|
24 | 25 | short last_migrate_reason; |
---|
25 | 26 | gfp_t gfp_mask; |
---|
26 | 27 | depot_stack_handle_t handle; |
---|
| 28 | + depot_stack_handle_t free_handle; |
---|
| 29 | + u64 ts_nsec; |
---|
| 30 | + u64 free_ts_nsec; |
---|
| 31 | + pid_t pid; |
---|
27 | 32 | }; |
---|
28 | 33 | |
---|
29 | | -static bool page_owner_disabled = true; |
---|
| 34 | +bool page_owner_enabled; |
---|
30 | 35 | DEFINE_STATIC_KEY_FALSE(page_owner_inited); |
---|
31 | 36 | |
---|
32 | 37 | static depot_stack_handle_t dummy_handle; |
---|
.. | .. |
---|
41 | 46 | return -EINVAL; |
---|
42 | 47 | |
---|
43 | 48 | if (strcmp(buf, "on") == 0) |
---|
44 | | - page_owner_disabled = false; |
---|
| 49 | + page_owner_enabled = true; |
---|
45 | 50 | |
---|
46 | 51 | return 0; |
---|
47 | 52 | } |
---|
.. | .. |
---|
49 | 54 | |
---|
50 | 55 | static bool need_page_owner(void) |
---|
51 | 56 | { |
---|
52 | | - if (page_owner_disabled) |
---|
53 | | - return false; |
---|
54 | | - |
---|
55 | | - return true; |
---|
| 57 | + return page_owner_enabled; |
---|
56 | 58 | } |
---|
57 | 59 | |
---|
58 | 60 | static __always_inline depot_stack_handle_t create_dummy_stack(void) |
---|
59 | 61 | { |
---|
60 | 62 | unsigned long entries[4]; |
---|
61 | | - struct stack_trace dummy; |
---|
| 63 | + unsigned int nr_entries; |
---|
62 | 64 | |
---|
63 | | - dummy.nr_entries = 0; |
---|
64 | | - dummy.max_entries = ARRAY_SIZE(entries); |
---|
65 | | - dummy.entries = &entries[0]; |
---|
66 | | - dummy.skip = 0; |
---|
67 | | - |
---|
68 | | - save_stack_trace(&dummy); |
---|
69 | | - return depot_save_stack(&dummy, GFP_KERNEL); |
---|
| 65 | + nr_entries = stack_trace_save(entries, ARRAY_SIZE(entries), 0); |
---|
| 66 | + return stack_depot_save(entries, nr_entries, GFP_KERNEL); |
---|
70 | 67 | } |
---|
71 | 68 | |
---|
72 | 69 | static noinline void register_dummy_stack(void) |
---|
.. | .. |
---|
86 | 83 | |
---|
87 | 84 | static void init_page_owner(void) |
---|
88 | 85 | { |
---|
89 | | - if (page_owner_disabled) |
---|
| 86 | + if (!page_owner_enabled) |
---|
90 | 87 | return; |
---|
91 | 88 | |
---|
92 | 89 | register_dummy_stack(); |
---|
.. | .. |
---|
102 | 99 | .init = init_page_owner, |
---|
103 | 100 | }; |
---|
104 | 101 | |
---|
105 | | -static inline struct page_owner *get_page_owner(struct page_ext *page_ext) |
---|
| 102 | +struct page_owner *get_page_owner(struct page_ext *page_ext) |
---|
106 | 103 | { |
---|
107 | 104 | return (void *)page_ext + page_owner_ops.offset; |
---|
108 | 105 | } |
---|
| 106 | +EXPORT_SYMBOL_GPL(get_page_owner); |
---|
109 | 107 | |
---|
110 | | -void __reset_page_owner(struct page *page, unsigned int order) |
---|
| 108 | +depot_stack_handle_t get_page_owner_handle(struct page_ext *page_ext, unsigned long pfn) |
---|
111 | 109 | { |
---|
112 | | - int i; |
---|
113 | | - struct page_ext *page_ext; |
---|
| 110 | + struct page_owner *page_owner; |
---|
| 111 | + depot_stack_handle_t handle; |
---|
114 | 112 | |
---|
115 | | - for (i = 0; i < (1 << order); i++) { |
---|
116 | | - page_ext = lookup_page_ext(page + i); |
---|
117 | | - if (unlikely(!page_ext)) |
---|
118 | | - continue; |
---|
119 | | - __clear_bit(PAGE_EXT_OWNER, &page_ext->flags); |
---|
120 | | - } |
---|
| 113 | + if (!page_owner_enabled) |
---|
| 114 | + return 0; |
---|
| 115 | + |
---|
| 116 | + page_owner = get_page_owner(page_ext); |
---|
| 117 | + |
---|
| 118 | + /* skip handle for tail pages of higher order allocations */ |
---|
| 119 | + if (!IS_ALIGNED(pfn, 1 << page_owner->order)) |
---|
| 120 | + return 0; |
---|
| 121 | + |
---|
| 122 | + handle = READ_ONCE(page_owner->handle); |
---|
| 123 | + return handle; |
---|
121 | 124 | } |
---|
| 125 | +EXPORT_SYMBOL_GPL(get_page_owner_handle); |
---|
122 | 126 | |
---|
123 | | -static inline bool check_recursive_alloc(struct stack_trace *trace, |
---|
124 | | - unsigned long ip) |
---|
| 127 | +static inline bool check_recursive_alloc(unsigned long *entries, |
---|
| 128 | + unsigned int nr_entries, |
---|
| 129 | + unsigned long ip) |
---|
125 | 130 | { |
---|
126 | | - int i; |
---|
| 131 | + unsigned int i; |
---|
127 | 132 | |
---|
128 | | - if (!trace->nr_entries) |
---|
129 | | - return false; |
---|
130 | | - |
---|
131 | | - for (i = 0; i < trace->nr_entries; i++) { |
---|
132 | | - if (trace->entries[i] == ip) |
---|
| 133 | + for (i = 0; i < nr_entries; i++) { |
---|
| 134 | + if (entries[i] == ip) |
---|
133 | 135 | return true; |
---|
134 | 136 | } |
---|
135 | | - |
---|
136 | 137 | return false; |
---|
137 | 138 | } |
---|
138 | 139 | |
---|
139 | 140 | static noinline depot_stack_handle_t save_stack(gfp_t flags) |
---|
140 | 141 | { |
---|
141 | 142 | unsigned long entries[PAGE_OWNER_STACK_DEPTH]; |
---|
142 | | - struct stack_trace trace = { |
---|
143 | | - .nr_entries = 0, |
---|
144 | | - .entries = entries, |
---|
145 | | - .max_entries = PAGE_OWNER_STACK_DEPTH, |
---|
146 | | - .skip = 2 |
---|
147 | | - }; |
---|
148 | 143 | depot_stack_handle_t handle; |
---|
| 144 | + unsigned int nr_entries; |
---|
149 | 145 | |
---|
150 | | - save_stack_trace(&trace); |
---|
151 | | - if (trace.nr_entries != 0 && |
---|
152 | | - trace.entries[trace.nr_entries-1] == ULONG_MAX) |
---|
153 | | - trace.nr_entries--; |
---|
| 146 | + nr_entries = stack_trace_save(entries, ARRAY_SIZE(entries), 2); |
---|
154 | 147 | |
---|
155 | 148 | /* |
---|
156 | | - * We need to check recursion here because our request to stackdepot |
---|
157 | | - * could trigger memory allocation to save new entry. New memory |
---|
158 | | - * allocation would reach here and call depot_save_stack() again |
---|
159 | | - * if we don't catch it. There is still not enough memory in stackdepot |
---|
160 | | - * so it would try to allocate memory again and loop forever. |
---|
| 149 | + * We need to check recursion here because our request to |
---|
| 150 | + * stackdepot could trigger memory allocation to save new |
---|
| 151 | + * entry. New memory allocation would reach here and call |
---|
| 152 | + * stack_depot_save_entries() again if we don't catch it. There is |
---|
| 153 | + * still not enough memory in stackdepot so it would try to |
---|
| 154 | + * allocate memory again and loop forever. |
---|
161 | 155 | */ |
---|
162 | | - if (check_recursive_alloc(&trace, _RET_IP_)) |
---|
| 156 | + if (check_recursive_alloc(entries, nr_entries, _RET_IP_)) |
---|
163 | 157 | return dummy_handle; |
---|
164 | 158 | |
---|
165 | | - handle = depot_save_stack(&trace, flags); |
---|
| 159 | + handle = stack_depot_save(entries, nr_entries, flags); |
---|
166 | 160 | if (!handle) |
---|
167 | 161 | handle = failure_handle; |
---|
168 | 162 | |
---|
169 | 163 | return handle; |
---|
170 | 164 | } |
---|
171 | 165 | |
---|
172 | | -static inline void __set_page_owner_handle(struct page_ext *page_ext, |
---|
173 | | - depot_stack_handle_t handle, unsigned int order, gfp_t gfp_mask) |
---|
| 166 | +void __reset_page_owner(struct page *page, unsigned int order) |
---|
| 167 | +{ |
---|
| 168 | + int i; |
---|
| 169 | + struct page_ext *page_ext; |
---|
| 170 | + depot_stack_handle_t handle = 0; |
---|
| 171 | + struct page_owner *page_owner; |
---|
| 172 | + u64 free_ts_nsec = local_clock(); |
---|
| 173 | + |
---|
| 174 | + handle = save_stack(GFP_NOWAIT | __GFP_NOWARN); |
---|
| 175 | + |
---|
| 176 | + page_ext = page_ext_get(page); |
---|
| 177 | + if (unlikely(!page_ext)) |
---|
| 178 | + return; |
---|
| 179 | + for (i = 0; i < (1 << order); i++) { |
---|
| 180 | + __clear_bit(PAGE_EXT_OWNER_ALLOCATED, &page_ext->flags); |
---|
| 181 | + page_owner = get_page_owner(page_ext); |
---|
| 182 | + page_owner->free_handle = handle; |
---|
| 183 | + page_owner->free_ts_nsec = free_ts_nsec; |
---|
| 184 | + page_ext = page_ext_next(page_ext); |
---|
| 185 | + } |
---|
| 186 | + page_ext_put(page_ext); |
---|
| 187 | +} |
---|
| 188 | + |
---|
| 189 | +static inline void __set_page_owner_handle(struct page *page, |
---|
| 190 | + struct page_ext *page_ext, depot_stack_handle_t handle, |
---|
| 191 | + unsigned int order, gfp_t gfp_mask) |
---|
174 | 192 | { |
---|
175 | 193 | struct page_owner *page_owner; |
---|
| 194 | + int i; |
---|
176 | 195 | |
---|
177 | | - page_owner = get_page_owner(page_ext); |
---|
178 | | - page_owner->handle = handle; |
---|
179 | | - page_owner->order = order; |
---|
180 | | - page_owner->gfp_mask = gfp_mask; |
---|
181 | | - page_owner->last_migrate_reason = -1; |
---|
| 196 | + for (i = 0; i < (1 << order); i++) { |
---|
| 197 | + page_owner = get_page_owner(page_ext); |
---|
| 198 | + page_owner->handle = handle; |
---|
| 199 | + page_owner->order = order; |
---|
| 200 | + page_owner->gfp_mask = gfp_mask; |
---|
| 201 | + page_owner->last_migrate_reason = -1; |
---|
| 202 | + page_owner->pid = current->pid; |
---|
| 203 | + page_owner->ts_nsec = local_clock(); |
---|
| 204 | + __set_bit(PAGE_EXT_OWNER, &page_ext->flags); |
---|
| 205 | + __set_bit(PAGE_EXT_OWNER_ALLOCATED, &page_ext->flags); |
---|
182 | 206 | |
---|
183 | | - __set_bit(PAGE_EXT_OWNER, &page_ext->flags); |
---|
| 207 | + page_ext = page_ext_next(page_ext); |
---|
| 208 | + } |
---|
184 | 209 | } |
---|
185 | 210 | |
---|
186 | 211 | noinline void __set_page_owner(struct page *page, unsigned int order, |
---|
187 | 212 | gfp_t gfp_mask) |
---|
188 | 213 | { |
---|
189 | | - struct page_ext *page_ext = lookup_page_ext(page); |
---|
| 214 | + struct page_ext *page_ext; |
---|
190 | 215 | depot_stack_handle_t handle; |
---|
191 | 216 | |
---|
| 217 | + handle = save_stack(gfp_mask); |
---|
| 218 | + |
---|
| 219 | + page_ext = page_ext_get(page); |
---|
192 | 220 | if (unlikely(!page_ext)) |
---|
193 | 221 | return; |
---|
194 | | - |
---|
195 | | - handle = save_stack(gfp_mask); |
---|
196 | | - __set_page_owner_handle(page_ext, handle, order, gfp_mask); |
---|
| 222 | + __set_page_owner_handle(page, page_ext, handle, order, gfp_mask); |
---|
| 223 | + page_ext_put(page_ext); |
---|
197 | 224 | } |
---|
198 | 225 | |
---|
199 | 226 | void __set_page_owner_migrate_reason(struct page *page, int reason) |
---|
200 | 227 | { |
---|
201 | | - struct page_ext *page_ext = lookup_page_ext(page); |
---|
| 228 | + struct page_ext *page_ext = page_ext_get(page); |
---|
202 | 229 | struct page_owner *page_owner; |
---|
203 | 230 | |
---|
204 | 231 | if (unlikely(!page_ext)) |
---|
.. | .. |
---|
206 | 233 | |
---|
207 | 234 | page_owner = get_page_owner(page_ext); |
---|
208 | 235 | page_owner->last_migrate_reason = reason; |
---|
| 236 | + page_ext_put(page_ext); |
---|
209 | 237 | } |
---|
210 | 238 | |
---|
211 | | -void __split_page_owner(struct page *page, unsigned int order) |
---|
| 239 | +void __split_page_owner(struct page *page, unsigned int nr) |
---|
212 | 240 | { |
---|
213 | 241 | int i; |
---|
214 | | - struct page_ext *page_ext = lookup_page_ext(page); |
---|
| 242 | + struct page_ext *page_ext = page_ext_get(page); |
---|
215 | 243 | struct page_owner *page_owner; |
---|
216 | 244 | |
---|
217 | 245 | if (unlikely(!page_ext)) |
---|
218 | 246 | return; |
---|
219 | 247 | |
---|
220 | | - page_owner = get_page_owner(page_ext); |
---|
221 | | - page_owner->order = 0; |
---|
222 | | - for (i = 1; i < (1 << order); i++) |
---|
223 | | - __copy_page_owner(page, page + i); |
---|
| 248 | + for (i = 0; i < nr; i++) { |
---|
| 249 | + page_owner = get_page_owner(page_ext); |
---|
| 250 | + page_owner->order = 0; |
---|
| 251 | + page_ext = page_ext_next(page_ext); |
---|
| 252 | + } |
---|
| 253 | + page_ext_put(page_ext); |
---|
224 | 254 | } |
---|
225 | 255 | |
---|
226 | 256 | void __copy_page_owner(struct page *oldpage, struct page *newpage) |
---|
227 | 257 | { |
---|
228 | | - struct page_ext *old_ext = lookup_page_ext(oldpage); |
---|
229 | | - struct page_ext *new_ext = lookup_page_ext(newpage); |
---|
| 258 | + struct page_ext *old_ext; |
---|
| 259 | + struct page_ext *new_ext; |
---|
230 | 260 | struct page_owner *old_page_owner, *new_page_owner; |
---|
231 | 261 | |
---|
232 | | - if (unlikely(!old_ext || !new_ext)) |
---|
| 262 | + old_ext = page_ext_get(oldpage); |
---|
| 263 | + if (unlikely(!old_ext)) |
---|
233 | 264 | return; |
---|
| 265 | + |
---|
| 266 | + new_ext = page_ext_get(newpage); |
---|
| 267 | + if (unlikely(!new_ext)) { |
---|
| 268 | + page_ext_put(old_ext); |
---|
| 269 | + return; |
---|
| 270 | + } |
---|
234 | 271 | |
---|
235 | 272 | old_page_owner = get_page_owner(old_ext); |
---|
236 | 273 | new_page_owner = get_page_owner(new_ext); |
---|
.. | .. |
---|
239 | 276 | new_page_owner->last_migrate_reason = |
---|
240 | 277 | old_page_owner->last_migrate_reason; |
---|
241 | 278 | new_page_owner->handle = old_page_owner->handle; |
---|
| 279 | + new_page_owner->pid = old_page_owner->pid; |
---|
| 280 | + new_page_owner->ts_nsec = old_page_owner->ts_nsec; |
---|
| 281 | + new_page_owner->free_ts_nsec = old_page_owner->ts_nsec; |
---|
242 | 282 | |
---|
243 | 283 | /* |
---|
244 | 284 | * We don't clear the bit on the oldpage as it's going to be freed |
---|
.. | .. |
---|
250 | 290 | * the new page, which will be freed. |
---|
251 | 291 | */ |
---|
252 | 292 | __set_bit(PAGE_EXT_OWNER, &new_ext->flags); |
---|
| 293 | + __set_bit(PAGE_EXT_OWNER_ALLOCATED, &new_ext->flags); |
---|
| 294 | + page_ext_put(new_ext); |
---|
| 295 | + page_ext_put(old_ext); |
---|
253 | 296 | } |
---|
254 | 297 | |
---|
255 | 298 | void pagetypeinfo_showmixedcount_print(struct seq_file *m, |
---|
.. | .. |
---|
297 | 340 | if (PageBuddy(page)) { |
---|
298 | 341 | unsigned long freepage_order; |
---|
299 | 342 | |
---|
300 | | - freepage_order = page_order_unsafe(page); |
---|
| 343 | + freepage_order = buddy_order_unsafe(page); |
---|
301 | 344 | if (freepage_order < MAX_ORDER) |
---|
302 | 345 | pfn += (1UL << freepage_order) - 1; |
---|
303 | 346 | continue; |
---|
.. | .. |
---|
306 | 349 | if (PageReserved(page)) |
---|
307 | 350 | continue; |
---|
308 | 351 | |
---|
309 | | - page_ext = lookup_page_ext(page); |
---|
| 352 | + page_ext = page_ext_get(page); |
---|
310 | 353 | if (unlikely(!page_ext)) |
---|
311 | 354 | continue; |
---|
312 | 355 | |
---|
313 | | - if (!test_bit(PAGE_EXT_OWNER, &page_ext->flags)) |
---|
314 | | - continue; |
---|
| 356 | + if (!test_bit(PAGE_EXT_OWNER_ALLOCATED, &page_ext->flags)) |
---|
| 357 | + goto ext_put_continue; |
---|
315 | 358 | |
---|
316 | 359 | page_owner = get_page_owner(page_ext); |
---|
317 | | - page_mt = gfpflags_to_migratetype( |
---|
318 | | - page_owner->gfp_mask); |
---|
| 360 | + page_mt = gfp_migratetype(page_owner->gfp_mask); |
---|
319 | 361 | if (pageblock_mt != page_mt) { |
---|
320 | 362 | if (is_migrate_cma(pageblock_mt)) |
---|
321 | 363 | count[MIGRATE_MOVABLE]++; |
---|
.. | .. |
---|
323 | 365 | count[pageblock_mt]++; |
---|
324 | 366 | |
---|
325 | 367 | pfn = block_end_pfn; |
---|
| 368 | + page_ext_put(page_ext); |
---|
326 | 369 | break; |
---|
327 | 370 | } |
---|
328 | 371 | pfn += (1UL << page_owner->order) - 1; |
---|
| 372 | +ext_put_continue: |
---|
| 373 | + page_ext_put(page_ext); |
---|
329 | 374 | } |
---|
330 | 375 | } |
---|
331 | 376 | |
---|
.. | .. |
---|
341 | 386 | struct page *page, struct page_owner *page_owner, |
---|
342 | 387 | depot_stack_handle_t handle) |
---|
343 | 388 | { |
---|
344 | | - int ret; |
---|
345 | | - int pageblock_mt, page_mt; |
---|
| 389 | + int ret, pageblock_mt, page_mt; |
---|
| 390 | + unsigned long *entries; |
---|
| 391 | + unsigned int nr_entries; |
---|
346 | 392 | char *kbuf; |
---|
347 | | - unsigned long entries[PAGE_OWNER_STACK_DEPTH]; |
---|
348 | | - struct stack_trace trace = { |
---|
349 | | - .nr_entries = 0, |
---|
350 | | - .entries = entries, |
---|
351 | | - .max_entries = PAGE_OWNER_STACK_DEPTH, |
---|
352 | | - .skip = 0 |
---|
353 | | - }; |
---|
354 | 393 | |
---|
| 394 | + count = min_t(size_t, count, PAGE_SIZE); |
---|
355 | 395 | kbuf = kmalloc(count, GFP_KERNEL); |
---|
356 | 396 | if (!kbuf) |
---|
357 | 397 | return -ENOMEM; |
---|
358 | 398 | |
---|
359 | 399 | ret = snprintf(kbuf, count, |
---|
360 | | - "Page allocated via order %u, mask %#x(%pGg)\n", |
---|
| 400 | + "Page allocated via order %u, mask %#x(%pGg), pid %d, ts %llu ns, free_ts %llu ns\n", |
---|
361 | 401 | page_owner->order, page_owner->gfp_mask, |
---|
362 | | - &page_owner->gfp_mask); |
---|
| 402 | + &page_owner->gfp_mask, page_owner->pid, |
---|
| 403 | + page_owner->ts_nsec, page_owner->free_ts_nsec); |
---|
363 | 404 | |
---|
364 | 405 | if (ret >= count) |
---|
365 | 406 | goto err; |
---|
366 | 407 | |
---|
367 | 408 | /* Print information relevant to grouping pages by mobility */ |
---|
368 | 409 | pageblock_mt = get_pageblock_migratetype(page); |
---|
369 | | - page_mt = gfpflags_to_migratetype(page_owner->gfp_mask); |
---|
| 410 | + page_mt = gfp_migratetype(page_owner->gfp_mask); |
---|
370 | 411 | ret += snprintf(kbuf + ret, count - ret, |
---|
371 | 412 | "PFN %lu type %s Block %lu type %s Flags %#lx(%pGp)\n", |
---|
372 | 413 | pfn, |
---|
.. | .. |
---|
378 | 419 | if (ret >= count) |
---|
379 | 420 | goto err; |
---|
380 | 421 | |
---|
381 | | - depot_fetch_stack(handle, &trace); |
---|
382 | | - ret += snprint_stack_trace(kbuf + ret, count - ret, &trace, 0); |
---|
| 422 | + nr_entries = stack_depot_fetch(handle, &entries); |
---|
| 423 | + ret += stack_trace_snprint(kbuf + ret, count - ret, entries, nr_entries, 0); |
---|
383 | 424 | if (ret >= count) |
---|
384 | 425 | goto err; |
---|
385 | 426 | |
---|
.. | .. |
---|
408 | 449 | |
---|
409 | 450 | void __dump_page_owner(struct page *page) |
---|
410 | 451 | { |
---|
411 | | - struct page_ext *page_ext = lookup_page_ext(page); |
---|
| 452 | + struct page_ext *page_ext = page_ext_get((void *)page); |
---|
412 | 453 | struct page_owner *page_owner; |
---|
413 | | - unsigned long entries[PAGE_OWNER_STACK_DEPTH]; |
---|
414 | | - struct stack_trace trace = { |
---|
415 | | - .nr_entries = 0, |
---|
416 | | - .entries = entries, |
---|
417 | | - .max_entries = PAGE_OWNER_STACK_DEPTH, |
---|
418 | | - .skip = 0 |
---|
419 | | - }; |
---|
420 | 454 | depot_stack_handle_t handle; |
---|
| 455 | + unsigned long *entries; |
---|
| 456 | + unsigned int nr_entries; |
---|
421 | 457 | gfp_t gfp_mask; |
---|
422 | 458 | int mt; |
---|
423 | 459 | |
---|
.. | .. |
---|
428 | 464 | |
---|
429 | 465 | page_owner = get_page_owner(page_ext); |
---|
430 | 466 | gfp_mask = page_owner->gfp_mask; |
---|
431 | | - mt = gfpflags_to_migratetype(gfp_mask); |
---|
| 467 | + mt = gfp_migratetype(gfp_mask); |
---|
432 | 468 | |
---|
433 | 469 | if (!test_bit(PAGE_EXT_OWNER, &page_ext->flags)) { |
---|
434 | | - pr_alert("page_owner info is not active (free page?)\n"); |
---|
| 470 | + pr_alert("page_owner info is not present (never set?)\n"); |
---|
| 471 | + page_ext_put(page_ext); |
---|
435 | 472 | return; |
---|
436 | 473 | } |
---|
| 474 | + |
---|
| 475 | + if (test_bit(PAGE_EXT_OWNER_ALLOCATED, &page_ext->flags)) |
---|
| 476 | + pr_alert("page_owner tracks the page as allocated\n"); |
---|
| 477 | + else |
---|
| 478 | + pr_alert("page_owner tracks the page as freed\n"); |
---|
| 479 | + |
---|
| 480 | + pr_alert("page last allocated via order %u, migratetype %s, gfp_mask %#x(%pGg), pid %d, ts %llu, free_ts %llu\n", |
---|
| 481 | + page_owner->order, migratetype_names[mt], gfp_mask, &gfp_mask, |
---|
| 482 | + page_owner->pid, page_owner->ts_nsec, page_owner->free_ts_nsec); |
---|
437 | 483 | |
---|
438 | 484 | handle = READ_ONCE(page_owner->handle); |
---|
439 | 485 | if (!handle) { |
---|
440 | | - pr_alert("page_owner info is not active (free page?)\n"); |
---|
441 | | - return; |
---|
| 486 | + pr_alert("page_owner allocation stack trace missing\n"); |
---|
| 487 | + } else { |
---|
| 488 | + nr_entries = stack_depot_fetch(handle, &entries); |
---|
| 489 | + stack_trace_print(entries, nr_entries, 0); |
---|
442 | 490 | } |
---|
443 | 491 | |
---|
444 | | - depot_fetch_stack(handle, &trace); |
---|
445 | | - pr_alert("PFN 0x%lx allocated via order %u, migratetype %s, gfp_mask %#x(%pGg)\n", |
---|
446 | | - page_to_pfn(page), |
---|
447 | | - page_owner->order, migratetype_names[mt], gfp_mask, &gfp_mask); |
---|
448 | | - print_stack_trace(&trace, 0); |
---|
| 492 | + handle = READ_ONCE(page_owner->free_handle); |
---|
| 493 | + if (!handle) { |
---|
| 494 | + pr_alert("page_owner free stack trace missing\n"); |
---|
| 495 | + } else { |
---|
| 496 | + nr_entries = stack_depot_fetch(handle, &entries); |
---|
| 497 | + pr_alert("page last free stack trace:\n"); |
---|
| 498 | + stack_trace_print(entries, nr_entries, 0); |
---|
| 499 | + } |
---|
449 | 500 | |
---|
450 | 501 | if (page_owner->last_migrate_reason != -1) |
---|
451 | 502 | pr_alert("page has been migrated, last migrate reason: %s\n", |
---|
452 | 503 | migrate_reason_names[page_owner->last_migrate_reason]); |
---|
| 504 | + page_ext_put(page_ext); |
---|
453 | 505 | } |
---|
454 | 506 | |
---|
455 | 507 | static ssize_t |
---|
.. | .. |
---|
476 | 528 | /* Find an allocated page */ |
---|
477 | 529 | for (; pfn < max_pfn; pfn++) { |
---|
478 | 530 | /* |
---|
| 531 | + * This temporary page_owner is required so |
---|
| 532 | + * that we can avoid the context switches while holding |
---|
| 533 | + * the rcu lock and copying the page owner information to |
---|
| 534 | + * user through copy_to_user() or GFP_KERNEL allocations. |
---|
| 535 | + */ |
---|
| 536 | + struct page_owner page_owner_tmp; |
---|
| 537 | + |
---|
| 538 | + /* |
---|
479 | 539 | * If the new page is in a new MAX_ORDER_NR_PAGES area, |
---|
480 | 540 | * validate the area as existing, skip it if not |
---|
481 | 541 | */ |
---|
.. | .. |
---|
490 | 550 | |
---|
491 | 551 | page = pfn_to_page(pfn); |
---|
492 | 552 | if (PageBuddy(page)) { |
---|
493 | | - unsigned long freepage_order = page_order_unsafe(page); |
---|
| 553 | + unsigned long freepage_order = buddy_order_unsafe(page); |
---|
494 | 554 | |
---|
495 | 555 | if (freepage_order < MAX_ORDER) |
---|
496 | 556 | pfn += (1UL << freepage_order) - 1; |
---|
497 | 557 | continue; |
---|
498 | 558 | } |
---|
499 | 559 | |
---|
500 | | - page_ext = lookup_page_ext(page); |
---|
| 560 | + page_ext = page_ext_get(page); |
---|
501 | 561 | if (unlikely(!page_ext)) |
---|
502 | 562 | continue; |
---|
503 | 563 | |
---|
.. | .. |
---|
506 | 566 | * because we don't hold the zone lock. |
---|
507 | 567 | */ |
---|
508 | 568 | if (!test_bit(PAGE_EXT_OWNER, &page_ext->flags)) |
---|
509 | | - continue; |
---|
| 569 | + goto ext_put_continue; |
---|
| 570 | + |
---|
| 571 | + /* |
---|
| 572 | + * Although we do have the info about past allocation of free |
---|
| 573 | + * pages, it's not relevant for current memory usage. |
---|
| 574 | + */ |
---|
| 575 | + if (!test_bit(PAGE_EXT_OWNER_ALLOCATED, &page_ext->flags)) |
---|
| 576 | + goto ext_put_continue; |
---|
510 | 577 | |
---|
511 | 578 | page_owner = get_page_owner(page_ext); |
---|
| 579 | + |
---|
| 580 | + /* |
---|
| 581 | + * Don't print "tail" pages of high-order allocations as that |
---|
| 582 | + * would inflate the stats. |
---|
| 583 | + */ |
---|
| 584 | + if (!IS_ALIGNED(pfn, 1 << page_owner->order)) |
---|
| 585 | + goto ext_put_continue; |
---|
512 | 586 | |
---|
513 | 587 | /* |
---|
514 | 588 | * Access to page_ext->handle isn't synchronous so we should |
---|
.. | .. |
---|
516 | 590 | */ |
---|
517 | 591 | handle = READ_ONCE(page_owner->handle); |
---|
518 | 592 | if (!handle) |
---|
519 | | - continue; |
---|
| 593 | + goto ext_put_continue; |
---|
520 | 594 | |
---|
521 | 595 | /* Record the next PFN to read in the file offset */ |
---|
522 | 596 | *ppos = (pfn - min_low_pfn) + 1; |
---|
523 | 597 | |
---|
| 598 | + page_owner_tmp = *page_owner; |
---|
| 599 | + page_ext_put(page_ext); |
---|
524 | 600 | return print_page_owner(buf, count, pfn, page, |
---|
525 | | - page_owner, handle); |
---|
| 601 | + &page_owner_tmp, handle); |
---|
| 602 | +ext_put_continue: |
---|
| 603 | + page_ext_put(page_ext); |
---|
526 | 604 | } |
---|
527 | 605 | |
---|
528 | 606 | return 0; |
---|
.. | .. |
---|
570 | 648 | * heavy lock contention. |
---|
571 | 649 | */ |
---|
572 | 650 | if (PageBuddy(page)) { |
---|
573 | | - unsigned long order = page_order_unsafe(page); |
---|
| 651 | + unsigned long order = buddy_order_unsafe(page); |
---|
574 | 652 | |
---|
575 | 653 | if (order > 0 && order < MAX_ORDER) |
---|
576 | 654 | pfn += (1UL << order) - 1; |
---|
.. | .. |
---|
580 | 658 | if (PageReserved(page)) |
---|
581 | 659 | continue; |
---|
582 | 660 | |
---|
583 | | - page_ext = lookup_page_ext(page); |
---|
| 661 | + page_ext = page_ext_get(page); |
---|
584 | 662 | if (unlikely(!page_ext)) |
---|
585 | 663 | continue; |
---|
586 | 664 | |
---|
587 | 665 | /* Maybe overlapping zone */ |
---|
588 | 666 | if (test_bit(PAGE_EXT_OWNER, &page_ext->flags)) |
---|
589 | | - continue; |
---|
| 667 | + goto ext_put_continue; |
---|
590 | 668 | |
---|
591 | 669 | /* Found early allocated page */ |
---|
592 | | - __set_page_owner_handle(page_ext, early_handle, 0, 0); |
---|
| 670 | + __set_page_owner_handle(page, page_ext, early_handle, |
---|
| 671 | + 0, 0); |
---|
593 | 672 | count++; |
---|
| 673 | +ext_put_continue: |
---|
| 674 | + page_ext_put(page_ext); |
---|
594 | 675 | } |
---|
595 | 676 | cond_resched(); |
---|
596 | 677 | } |
---|
.. | .. |
---|
626 | 707 | |
---|
627 | 708 | static int __init pageowner_init(void) |
---|
628 | 709 | { |
---|
629 | | - struct dentry *dentry; |
---|
630 | | - |
---|
631 | 710 | if (!static_branch_unlikely(&page_owner_inited)) { |
---|
632 | 711 | pr_info("page_owner is disabled\n"); |
---|
633 | 712 | return 0; |
---|
634 | 713 | } |
---|
635 | 714 | |
---|
636 | | - dentry = debugfs_create_file("page_owner", 0400, NULL, |
---|
637 | | - NULL, &proc_page_owner_operations); |
---|
| 715 | + debugfs_create_file("page_owner", 0400, NULL, NULL, |
---|
| 716 | + &proc_page_owner_operations); |
---|
638 | 717 | |
---|
639 | | - return PTR_ERR_OR_ZERO(dentry); |
---|
| 718 | + return 0; |
---|
640 | 719 | } |
---|
641 | 720 | late_initcall(pageowner_init) |
---|