Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * linux/mm/page_alloc.c | |
3 | * | |
4 | * Manages the free list, the system allocates free pages here. | |
5 | * Note that kmalloc() lives in slab.c | |
6 | * | |
7 | * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds | |
8 | * Swap reorganised 29.12.95, Stephen Tweedie | |
9 | * Support of BIGMEM added by Gerhard Wichert, Siemens AG, July 1999 | |
10 | * Reshaped it to be a zoned allocator, Ingo Molnar, Red Hat, 1999 | |
11 | * Discontiguous memory support, Kanoj Sarcar, SGI, Nov 1999 | |
12 | * Zone balancing, Kanoj Sarcar, SGI, Jan 2000 | |
13 | * Per cpu hot/cold page lists, bulk allocation, Martin J. Bligh, Sept 2002 | |
14 | * (lots of bits borrowed from Ingo Molnar & Andrew Morton) | |
15 | */ | |
16 | ||
1da177e4 LT |
17 | #include <linux/stddef.h> |
18 | #include <linux/mm.h> | |
19 | #include <linux/swap.h> | |
20 | #include <linux/interrupt.h> | |
21 | #include <linux/pagemap.h> | |
10ed273f | 22 | #include <linux/jiffies.h> |
1da177e4 | 23 | #include <linux/bootmem.h> |
edbe7d23 | 24 | #include <linux/memblock.h> |
1da177e4 | 25 | #include <linux/compiler.h> |
9f158333 | 26 | #include <linux/kernel.h> |
b1eeab67 | 27 | #include <linux/kmemcheck.h> |
1da177e4 LT |
28 | #include <linux/module.h> |
29 | #include <linux/suspend.h> | |
30 | #include <linux/pagevec.h> | |
31 | #include <linux/blkdev.h> | |
32 | #include <linux/slab.h> | |
a238ab5b | 33 | #include <linux/ratelimit.h> |
5a3135c2 | 34 | #include <linux/oom.h> |
1da177e4 LT |
35 | #include <linux/notifier.h> |
36 | #include <linux/topology.h> | |
37 | #include <linux/sysctl.h> | |
38 | #include <linux/cpu.h> | |
39 | #include <linux/cpuset.h> | |
bdc8cb98 | 40 | #include <linux/memory_hotplug.h> |
1da177e4 LT |
41 | #include <linux/nodemask.h> |
42 | #include <linux/vmalloc.h> | |
a6cccdc3 | 43 | #include <linux/vmstat.h> |
4be38e35 | 44 | #include <linux/mempolicy.h> |
6811378e | 45 | #include <linux/stop_machine.h> |
c713216d MG |
46 | #include <linux/sort.h> |
47 | #include <linux/pfn.h> | |
3fcfab16 | 48 | #include <linux/backing-dev.h> |
933e312e | 49 | #include <linux/fault-inject.h> |
a5d76b54 | 50 | #include <linux/page-isolation.h> |
52d4b9ac | 51 | #include <linux/page_cgroup.h> |
3ac7fe5a | 52 | #include <linux/debugobjects.h> |
dbb1f81c | 53 | #include <linux/kmemleak.h> |
56de7263 | 54 | #include <linux/compaction.h> |
0d3d062a | 55 | #include <trace/events/kmem.h> |
718a3821 | 56 | #include <linux/ftrace_event.h> |
f212ad7c | 57 | #include <linux/memcontrol.h> |
268bb0ce | 58 | #include <linux/prefetch.h> |
6e543d57 | 59 | #include <linux/mm_inline.h> |
041d3a8c | 60 | #include <linux/migrate.h> |
c0a32fc5 | 61 | #include <linux/page-debug-flags.h> |
949f7ec5 | 62 | #include <linux/hugetlb.h> |
8bd75c77 | 63 | #include <linux/sched/rt.h> |
1da177e4 | 64 | |
7ee3d4e8 | 65 | #include <asm/sections.h> |
1da177e4 | 66 | #include <asm/tlbflush.h> |
ac924c60 | 67 | #include <asm/div64.h> |
1da177e4 LT |
68 | #include "internal.h" |
69 | ||
c8e251fa CS |
70 | /* prevent >1 _updater_ of zone percpu pageset ->high and ->batch fields */ |
71 | static DEFINE_MUTEX(pcp_batch_high_lock); | |
72 | ||
72812019 LS |
73 | #ifdef CONFIG_USE_PERCPU_NUMA_NODE_ID |
74 | DEFINE_PER_CPU(int, numa_node); | |
75 | EXPORT_PER_CPU_SYMBOL(numa_node); | |
76 | #endif | |
77 | ||
7aac7898 LS |
78 | #ifdef CONFIG_HAVE_MEMORYLESS_NODES |
79 | /* | |
80 | * N.B., Do NOT reference the '_numa_mem_' per cpu variable directly. | |
81 | * It will not be defined when CONFIG_HAVE_MEMORYLESS_NODES is not defined. | |
82 | * Use the accessor functions set_numa_mem(), numa_mem_id() and cpu_to_mem() | |
83 | * defined in <linux/topology.h>. | |
84 | */ | |
85 | DEFINE_PER_CPU(int, _numa_mem_); /* Kernel "local memory" node */ | |
86 | EXPORT_PER_CPU_SYMBOL(_numa_mem_); | |
87 | #endif | |
88 | ||
1da177e4 | 89 | /* |
13808910 | 90 | * Array of node states. |
1da177e4 | 91 | */ |
13808910 CL |
92 | nodemask_t node_states[NR_NODE_STATES] __read_mostly = { |
93 | [N_POSSIBLE] = NODE_MASK_ALL, | |
94 | [N_ONLINE] = { { [0] = 1UL } }, | |
95 | #ifndef CONFIG_NUMA | |
96 | [N_NORMAL_MEMORY] = { { [0] = 1UL } }, | |
97 | #ifdef CONFIG_HIGHMEM | |
98 | [N_HIGH_MEMORY] = { { [0] = 1UL } }, | |
20b2f52b LJ |
99 | #endif |
100 | #ifdef CONFIG_MOVABLE_NODE | |
101 | [N_MEMORY] = { { [0] = 1UL } }, | |
13808910 CL |
102 | #endif |
103 | [N_CPU] = { { [0] = 1UL } }, | |
104 | #endif /* NUMA */ | |
105 | }; | |
106 | EXPORT_SYMBOL(node_states); | |
107 | ||
c3d5f5f0 JL |
108 | /* Protect totalram_pages and zone->managed_pages */ |
109 | static DEFINE_SPINLOCK(managed_page_count_lock); | |
110 | ||
6c231b7b | 111 | unsigned long totalram_pages __read_mostly; |
cb45b0e9 | 112 | unsigned long totalreserve_pages __read_mostly; |
ab8fabd4 JW |
113 | /* |
114 | * When calculating the number of globally allowed dirty pages, there | |
115 | * is a certain number of per-zone reserves that should not be | |
116 | * considered dirtyable memory. This is the sum of those reserves | |
117 | * over all existing zones that contribute dirtyable memory. | |
118 | */ | |
119 | unsigned long dirty_balance_reserve __read_mostly; | |
120 | ||
1b76b02f | 121 | int percpu_pagelist_fraction; |
dcce284a | 122 | gfp_t gfp_allowed_mask __read_mostly = GFP_BOOT_MASK; |
1da177e4 | 123 | |
452aa699 RW |
124 | #ifdef CONFIG_PM_SLEEP |
125 | /* | |
126 | * The following functions are used by the suspend/hibernate code to temporarily | |
127 | * change gfp_allowed_mask in order to avoid using I/O during memory allocations | |
128 | * while devices are suspended. To avoid races with the suspend/hibernate code, | |
129 | * they should always be called with pm_mutex held (gfp_allowed_mask also should | |
130 | * only be modified with pm_mutex held, unless the suspend/hibernate code is | |
131 | * guaranteed not to run in parallel with that modification). | |
132 | */ | |
c9e664f1 RW |
133 | |
134 | static gfp_t saved_gfp_mask; | |
135 | ||
136 | void pm_restore_gfp_mask(void) | |
452aa699 RW |
137 | { |
138 | WARN_ON(!mutex_is_locked(&pm_mutex)); | |
c9e664f1 RW |
139 | if (saved_gfp_mask) { |
140 | gfp_allowed_mask = saved_gfp_mask; | |
141 | saved_gfp_mask = 0; | |
142 | } | |
452aa699 RW |
143 | } |
144 | ||
c9e664f1 | 145 | void pm_restrict_gfp_mask(void) |
452aa699 | 146 | { |
452aa699 | 147 | WARN_ON(!mutex_is_locked(&pm_mutex)); |
c9e664f1 RW |
148 | WARN_ON(saved_gfp_mask); |
149 | saved_gfp_mask = gfp_allowed_mask; | |
150 | gfp_allowed_mask &= ~GFP_IOFS; | |
452aa699 | 151 | } |
f90ac398 MG |
152 | |
153 | bool pm_suspended_storage(void) | |
154 | { | |
155 | if ((gfp_allowed_mask & GFP_IOFS) == GFP_IOFS) | |
156 | return false; | |
157 | return true; | |
158 | } | |
452aa699 RW |
159 | #endif /* CONFIG_PM_SLEEP */ |
160 | ||
d9c23400 MG |
161 | #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE |
162 | int pageblock_order __read_mostly; | |
163 | #endif | |
164 | ||
d98c7a09 | 165 | static void __free_pages_ok(struct page *page, unsigned int order); |
a226f6c8 | 166 | |
1da177e4 LT |
167 | /* |
168 | * results with 256, 32 in the lowmem_reserve sysctl: | |
169 | * 1G machine -> (16M dma, 800M-16M normal, 1G-800M high) | |
170 | * 1G machine -> (16M dma, 784M normal, 224M high) | |
171 | * NORMAL allocation will leave 784M/256 of ram reserved in the ZONE_DMA | |
172 | * HIGHMEM allocation will leave 224M/32 of ram reserved in ZONE_NORMAL | |
173 | * HIGHMEM allocation will (224M+784M)/256 of ram reserved in ZONE_DMA | |
a2f1b424 AK |
174 | * |
175 | * TBD: should special case ZONE_DMA32 machines here - in those we normally | |
176 | * don't need any ZONE_NORMAL reservation | |
1da177e4 | 177 | */ |
2f1b6248 | 178 | int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES-1] = { |
4b51d669 | 179 | #ifdef CONFIG_ZONE_DMA |
2f1b6248 | 180 | 256, |
4b51d669 | 181 | #endif |
fb0e7942 | 182 | #ifdef CONFIG_ZONE_DMA32 |
2f1b6248 | 183 | 256, |
fb0e7942 | 184 | #endif |
e53ef38d | 185 | #ifdef CONFIG_HIGHMEM |
2a1e274a | 186 | 32, |
e53ef38d | 187 | #endif |
2a1e274a | 188 | 32, |
2f1b6248 | 189 | }; |
1da177e4 LT |
190 | |
191 | EXPORT_SYMBOL(totalram_pages); | |
1da177e4 | 192 | |
15ad7cdc | 193 | static char * const zone_names[MAX_NR_ZONES] = { |
4b51d669 | 194 | #ifdef CONFIG_ZONE_DMA |
2f1b6248 | 195 | "DMA", |
4b51d669 | 196 | #endif |
fb0e7942 | 197 | #ifdef CONFIG_ZONE_DMA32 |
2f1b6248 | 198 | "DMA32", |
fb0e7942 | 199 | #endif |
2f1b6248 | 200 | "Normal", |
e53ef38d | 201 | #ifdef CONFIG_HIGHMEM |
2a1e274a | 202 | "HighMem", |
e53ef38d | 203 | #endif |
2a1e274a | 204 | "Movable", |
2f1b6248 CL |
205 | }; |
206 | ||
1da177e4 | 207 | int min_free_kbytes = 1024; |
42aa83cb | 208 | int user_min_free_kbytes = -1; |
1da177e4 | 209 | |
2c85f51d JB |
210 | static unsigned long __meminitdata nr_kernel_pages; |
211 | static unsigned long __meminitdata nr_all_pages; | |
a3142c8e | 212 | static unsigned long __meminitdata dma_reserve; |
1da177e4 | 213 | |
0ee332c1 TH |
214 | #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP |
215 | static unsigned long __meminitdata arch_zone_lowest_possible_pfn[MAX_NR_ZONES]; | |
216 | static unsigned long __meminitdata arch_zone_highest_possible_pfn[MAX_NR_ZONES]; | |
217 | static unsigned long __initdata required_kernelcore; | |
218 | static unsigned long __initdata required_movablecore; | |
219 | static unsigned long __meminitdata zone_movable_pfn[MAX_NUMNODES]; | |
220 | ||
221 | /* movable_zone is the "real" zone pages in ZONE_MOVABLE are taken from */ | |
222 | int movable_zone; | |
223 | EXPORT_SYMBOL(movable_zone); | |
224 | #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */ | |
c713216d | 225 | |
418508c1 MS |
226 | #if MAX_NUMNODES > 1 |
227 | int nr_node_ids __read_mostly = MAX_NUMNODES; | |
62bc62a8 | 228 | int nr_online_nodes __read_mostly = 1; |
418508c1 | 229 | EXPORT_SYMBOL(nr_node_ids); |
62bc62a8 | 230 | EXPORT_SYMBOL(nr_online_nodes); |
418508c1 MS |
231 | #endif |
232 | ||
9ef9acb0 MG |
233 | int page_group_by_mobility_disabled __read_mostly; |
234 | ||
ee6f509c | 235 | void set_pageblock_migratetype(struct page *page, int migratetype) |
b2a0ac88 | 236 | { |
5d0f3f72 KM |
237 | if (unlikely(page_group_by_mobility_disabled && |
238 | migratetype < MIGRATE_PCPTYPES)) | |
49255c61 MG |
239 | migratetype = MIGRATE_UNMOVABLE; |
240 | ||
b2a0ac88 MG |
241 | set_pageblock_flags_group(page, (unsigned long)migratetype, |
242 | PB_migrate, PB_migrate_end); | |
243 | } | |
244 | ||
7f33d49a RW |
245 | bool oom_killer_disabled __read_mostly; |
246 | ||
13e7444b | 247 | #ifdef CONFIG_DEBUG_VM |
c6a57e19 | 248 | static int page_outside_zone_boundaries(struct zone *zone, struct page *page) |
1da177e4 | 249 | { |
bdc8cb98 DH |
250 | int ret = 0; |
251 | unsigned seq; | |
252 | unsigned long pfn = page_to_pfn(page); | |
b5e6a5a2 | 253 | unsigned long sp, start_pfn; |
c6a57e19 | 254 | |
bdc8cb98 DH |
255 | do { |
256 | seq = zone_span_seqbegin(zone); | |
b5e6a5a2 CS |
257 | start_pfn = zone->zone_start_pfn; |
258 | sp = zone->spanned_pages; | |
108bcc96 | 259 | if (!zone_spans_pfn(zone, pfn)) |
bdc8cb98 DH |
260 | ret = 1; |
261 | } while (zone_span_seqretry(zone, seq)); | |
262 | ||
b5e6a5a2 CS |
263 | if (ret) |
264 | pr_err("page %lu outside zone [ %lu - %lu ]\n", | |
265 | pfn, start_pfn, start_pfn + sp); | |
266 | ||
bdc8cb98 | 267 | return ret; |
c6a57e19 DH |
268 | } |
269 | ||
270 | static int page_is_consistent(struct zone *zone, struct page *page) | |
271 | { | |
14e07298 | 272 | if (!pfn_valid_within(page_to_pfn(page))) |
c6a57e19 | 273 | return 0; |
1da177e4 | 274 | if (zone != page_zone(page)) |
c6a57e19 DH |
275 | return 0; |
276 | ||
277 | return 1; | |
278 | } | |
279 | /* | |
280 | * Temporary debugging check for pages not lying within a given zone. | |
281 | */ | |
282 | static int bad_range(struct zone *zone, struct page *page) | |
283 | { | |
284 | if (page_outside_zone_boundaries(zone, page)) | |
1da177e4 | 285 | return 1; |
c6a57e19 DH |
286 | if (!page_is_consistent(zone, page)) |
287 | return 1; | |
288 | ||
1da177e4 LT |
289 | return 0; |
290 | } | |
13e7444b NP |
291 | #else |
292 | static inline int bad_range(struct zone *zone, struct page *page) | |
293 | { | |
294 | return 0; | |
295 | } | |
296 | #endif | |
297 | ||
d230dec1 KS |
298 | static void bad_page(struct page *page, const char *reason, |
299 | unsigned long bad_flags) | |
1da177e4 | 300 | { |
d936cf9b HD |
301 | static unsigned long resume; |
302 | static unsigned long nr_shown; | |
303 | static unsigned long nr_unshown; | |
304 | ||
2a7684a2 WF |
305 | /* Don't complain about poisoned pages */ |
306 | if (PageHWPoison(page)) { | |
22b751c3 | 307 | page_mapcount_reset(page); /* remove PageBuddy */ |
2a7684a2 WF |
308 | return; |
309 | } | |
310 | ||
d936cf9b HD |
311 | /* |
312 | * Allow a burst of 60 reports, then keep quiet for that minute; | |
313 | * or allow a steady drip of one report per second. | |
314 | */ | |
315 | if (nr_shown == 60) { | |
316 | if (time_before(jiffies, resume)) { | |
317 | nr_unshown++; | |
318 | goto out; | |
319 | } | |
320 | if (nr_unshown) { | |
1e9e6365 HD |
321 | printk(KERN_ALERT |
322 | "BUG: Bad page state: %lu messages suppressed\n", | |
d936cf9b HD |
323 | nr_unshown); |
324 | nr_unshown = 0; | |
325 | } | |
326 | nr_shown = 0; | |
327 | } | |
328 | if (nr_shown++ == 0) | |
329 | resume = jiffies + 60 * HZ; | |
330 | ||
1e9e6365 | 331 | printk(KERN_ALERT "BUG: Bad page state in process %s pfn:%05lx\n", |
3dc14741 | 332 | current->comm, page_to_pfn(page)); |
f0b791a3 | 333 | dump_page_badflags(page, reason, bad_flags); |
3dc14741 | 334 | |
4f31888c | 335 | print_modules(); |
1da177e4 | 336 | dump_stack(); |
d936cf9b | 337 | out: |
8cc3b392 | 338 | /* Leave bad fields for debug, except PageBuddy could make trouble */ |
22b751c3 | 339 | page_mapcount_reset(page); /* remove PageBuddy */ |
373d4d09 | 340 | add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE); |
1da177e4 LT |
341 | } |
342 | ||
1da177e4 LT |
343 | /* |
344 | * Higher-order pages are called "compound pages". They are structured thusly: | |
345 | * | |
346 | * The first PAGE_SIZE page is called the "head page". | |
347 | * | |
348 | * The remaining PAGE_SIZE pages are called "tail pages". | |
349 | * | |
6416b9fa WSH |
350 | * All pages have PG_compound set. All tail pages have their ->first_page |
351 | * pointing at the head page. | |
1da177e4 | 352 | * |
41d78ba5 HD |
353 | * The first tail page's ->lru.next holds the address of the compound page's |
354 | * put_page() function. Its ->lru.prev holds the order of allocation. | |
355 | * This usage means that zero-order pages may not be compound. | |
1da177e4 | 356 | */ |
d98c7a09 HD |
357 | |
358 | static void free_compound_page(struct page *page) | |
359 | { | |
d85f3385 | 360 | __free_pages_ok(page, compound_order(page)); |
d98c7a09 HD |
361 | } |
362 | ||
01ad1c08 | 363 | void prep_compound_page(struct page *page, unsigned long order) |
18229df5 AW |
364 | { |
365 | int i; | |
366 | int nr_pages = 1 << order; | |
367 | ||
368 | set_compound_page_dtor(page, free_compound_page); | |
369 | set_compound_order(page, order); | |
370 | __SetPageHead(page); | |
371 | for (i = 1; i < nr_pages; i++) { | |
372 | struct page *p = page + i; | |
58a84aa9 | 373 | set_page_count(p, 0); |
18229df5 | 374 | p->first_page = page; |
668f9abb DR |
375 | /* Make sure p->first_page is always valid for PageTail() */ |
376 | smp_wmb(); | |
377 | __SetPageTail(p); | |
18229df5 AW |
378 | } |
379 | } | |
380 | ||
59ff4216 | 381 | /* update __split_huge_page_refcount if you change this function */ |
8cc3b392 | 382 | static int destroy_compound_page(struct page *page, unsigned long order) |
1da177e4 LT |
383 | { |
384 | int i; | |
385 | int nr_pages = 1 << order; | |
8cc3b392 | 386 | int bad = 0; |
1da177e4 | 387 | |
0bb2c763 | 388 | if (unlikely(compound_order(page) != order)) { |
f0b791a3 | 389 | bad_page(page, "wrong compound order", 0); |
8cc3b392 HD |
390 | bad++; |
391 | } | |
1da177e4 | 392 | |
6d777953 | 393 | __ClearPageHead(page); |
8cc3b392 | 394 | |
18229df5 AW |
395 | for (i = 1; i < nr_pages; i++) { |
396 | struct page *p = page + i; | |
1da177e4 | 397 | |
f0b791a3 DH |
398 | if (unlikely(!PageTail(p))) { |
399 | bad_page(page, "PageTail not set", 0); | |
400 | bad++; | |
401 | } else if (unlikely(p->first_page != page)) { | |
402 | bad_page(page, "first_page not consistent", 0); | |
8cc3b392 HD |
403 | bad++; |
404 | } | |
d85f3385 | 405 | __ClearPageTail(p); |
1da177e4 | 406 | } |
8cc3b392 HD |
407 | |
408 | return bad; | |
1da177e4 | 409 | } |
1da177e4 | 410 | |
17cf4406 NP |
411 | static inline void prep_zero_page(struct page *page, int order, gfp_t gfp_flags) |
412 | { | |
413 | int i; | |
414 | ||
6626c5d5 AM |
415 | /* |
416 | * clear_highpage() will use KM_USER0, so it's a bug to use __GFP_ZERO | |
417 | * and __GFP_HIGHMEM from hard or soft interrupt context. | |
418 | */ | |
725d704e | 419 | VM_BUG_ON((gfp_flags & __GFP_HIGHMEM) && in_interrupt()); |
17cf4406 NP |
420 | for (i = 0; i < (1 << order); i++) |
421 | clear_highpage(page + i); | |
422 | } | |
423 | ||
c0a32fc5 SG |
424 | #ifdef CONFIG_DEBUG_PAGEALLOC |
425 | unsigned int _debug_guardpage_minorder; | |
426 | ||
427 | static int __init debug_guardpage_minorder_setup(char *buf) | |
428 | { | |
429 | unsigned long res; | |
430 | ||
431 | if (kstrtoul(buf, 10, &res) < 0 || res > MAX_ORDER / 2) { | |
432 | printk(KERN_ERR "Bad debug_guardpage_minorder value\n"); | |
433 | return 0; | |
434 | } | |
435 | _debug_guardpage_minorder = res; | |
436 | printk(KERN_INFO "Setting debug_guardpage_minorder to %lu\n", res); | |
437 | return 0; | |
438 | } | |
439 | __setup("debug_guardpage_minorder=", debug_guardpage_minorder_setup); | |
440 | ||
441 | static inline void set_page_guard_flag(struct page *page) | |
442 | { | |
443 | __set_bit(PAGE_DEBUG_FLAG_GUARD, &page->debug_flags); | |
444 | } | |
445 | ||
446 | static inline void clear_page_guard_flag(struct page *page) | |
447 | { | |
448 | __clear_bit(PAGE_DEBUG_FLAG_GUARD, &page->debug_flags); | |
449 | } | |
450 | #else | |
451 | static inline void set_page_guard_flag(struct page *page) { } | |
452 | static inline void clear_page_guard_flag(struct page *page) { } | |
453 | #endif | |
454 | ||
6aa3001b AM |
455 | static inline void set_page_order(struct page *page, int order) |
456 | { | |
4c21e2f2 | 457 | set_page_private(page, order); |
676165a8 | 458 | __SetPageBuddy(page); |
1da177e4 LT |
459 | } |
460 | ||
461 | static inline void rmv_page_order(struct page *page) | |
462 | { | |
676165a8 | 463 | __ClearPageBuddy(page); |
4c21e2f2 | 464 | set_page_private(page, 0); |
1da177e4 LT |
465 | } |
466 | ||
467 | /* | |
468 | * Locate the struct page for both the matching buddy in our | |
469 | * pair (buddy1) and the combined O(n+1) page they form (page). | |
470 | * | |
471 | * 1) Any buddy B1 will have an order O twin B2 which satisfies | |
472 | * the following equation: | |
473 | * B2 = B1 ^ (1 << O) | |
474 | * For example, if the starting buddy (buddy2) is #8 its order | |
475 | * 1 buddy is #10: | |
476 | * B2 = 8 ^ (1 << 1) = 8 ^ 2 = 10 | |
477 | * | |
478 | * 2) Any buddy B will have an order O+1 parent P which | |
479 | * satisfies the following equation: | |
480 | * P = B & ~(1 << O) | |
481 | * | |
d6e05edc | 482 | * Assumption: *_mem_map is contiguous at least up to MAX_ORDER |
1da177e4 | 483 | */ |
1da177e4 | 484 | static inline unsigned long |
43506fad | 485 | __find_buddy_index(unsigned long page_idx, unsigned int order) |
1da177e4 | 486 | { |
43506fad | 487 | return page_idx ^ (1 << order); |
1da177e4 LT |
488 | } |
489 | ||
490 | /* | |
491 | * This function checks whether a page is free && is the buddy | |
492 | * we can do coalesce a page and its buddy if | |
13e7444b | 493 | * (a) the buddy is not in a hole && |
676165a8 | 494 | * (b) the buddy is in the buddy system && |
cb2b95e1 AW |
495 | * (c) a page and its buddy have the same order && |
496 | * (d) a page and its buddy are in the same zone. | |
676165a8 | 497 | * |
cf6fe945 WSH |
498 | * For recording whether a page is in the buddy system, we set ->_mapcount |
499 | * PAGE_BUDDY_MAPCOUNT_VALUE. | |
500 | * Setting, clearing, and testing _mapcount PAGE_BUDDY_MAPCOUNT_VALUE is | |
501 | * serialized by zone->lock. | |
1da177e4 | 502 | * |
676165a8 | 503 | * For recording page's order, we use page_private(page). |
1da177e4 | 504 | */ |
cb2b95e1 AW |
505 | static inline int page_is_buddy(struct page *page, struct page *buddy, |
506 | int order) | |
1da177e4 | 507 | { |
14e07298 | 508 | if (!pfn_valid_within(page_to_pfn(buddy))) |
13e7444b | 509 | return 0; |
13e7444b | 510 | |
cb2b95e1 AW |
511 | if (page_zone_id(page) != page_zone_id(buddy)) |
512 | return 0; | |
513 | ||
c0a32fc5 | 514 | if (page_is_guard(buddy) && page_order(buddy) == order) { |
309381fe | 515 | VM_BUG_ON_PAGE(page_count(buddy) != 0, buddy); |
c0a32fc5 SG |
516 | return 1; |
517 | } | |
518 | ||
cb2b95e1 | 519 | if (PageBuddy(buddy) && page_order(buddy) == order) { |
309381fe | 520 | VM_BUG_ON_PAGE(page_count(buddy) != 0, buddy); |
6aa3001b | 521 | return 1; |
676165a8 | 522 | } |
6aa3001b | 523 | return 0; |
1da177e4 LT |
524 | } |
525 | ||
526 | /* | |
527 | * Freeing function for a buddy system allocator. | |
528 | * | |
529 | * The concept of a buddy system is to maintain direct-mapped table | |
530 | * (containing bit values) for memory blocks of various "orders". | |
531 | * The bottom level table contains the map for the smallest allocatable | |
532 | * units of memory (here, pages), and each level above it describes | |
533 | * pairs of units from the levels below, hence, "buddies". | |
534 | * At a high level, all that happens here is marking the table entry | |
535 | * at the bottom level available, and propagating the changes upward | |
536 | * as necessary, plus some accounting needed to play nicely with other | |
537 | * parts of the VM system. | |
538 | * At each level, we keep a list of pages, which are heads of continuous | |
cf6fe945 WSH |
539 | * free pages of length of (1 << order) and marked with _mapcount |
540 | * PAGE_BUDDY_MAPCOUNT_VALUE. Page's order is recorded in page_private(page) | |
541 | * field. | |
1da177e4 | 542 | * So when we are allocating or freeing one, we can derive the state of the |
5f63b720 MN |
543 | * other. That is, if we allocate a small block, and both were |
544 | * free, the remainder of the region must be split into blocks. | |
1da177e4 | 545 | * If a block is freed, and its buddy is also free, then this |
5f63b720 | 546 | * triggers coalescing into a block of larger size. |
1da177e4 | 547 | * |
6d49e352 | 548 | * -- nyc |
1da177e4 LT |
549 | */ |
550 | ||
48db57f8 | 551 | static inline void __free_one_page(struct page *page, |
ed0ae21d MG |
552 | struct zone *zone, unsigned int order, |
553 | int migratetype) | |
1da177e4 LT |
554 | { |
555 | unsigned long page_idx; | |
6dda9d55 | 556 | unsigned long combined_idx; |
43506fad | 557 | unsigned long uninitialized_var(buddy_idx); |
6dda9d55 | 558 | struct page *buddy; |
1da177e4 | 559 | |
d29bb978 CS |
560 | VM_BUG_ON(!zone_is_initialized(zone)); |
561 | ||
224abf92 | 562 | if (unlikely(PageCompound(page))) |
8cc3b392 HD |
563 | if (unlikely(destroy_compound_page(page, order))) |
564 | return; | |
1da177e4 | 565 | |
ed0ae21d MG |
566 | VM_BUG_ON(migratetype == -1); |
567 | ||
1da177e4 LT |
568 | page_idx = page_to_pfn(page) & ((1 << MAX_ORDER) - 1); |
569 | ||
309381fe SL |
570 | VM_BUG_ON_PAGE(page_idx & ((1 << order) - 1), page); |
571 | VM_BUG_ON_PAGE(bad_range(zone, page), page); | |
1da177e4 | 572 | |
1da177e4 | 573 | while (order < MAX_ORDER-1) { |
43506fad KC |
574 | buddy_idx = __find_buddy_index(page_idx, order); |
575 | buddy = page + (buddy_idx - page_idx); | |
cb2b95e1 | 576 | if (!page_is_buddy(page, buddy, order)) |
3c82d0ce | 577 | break; |
c0a32fc5 SG |
578 | /* |
579 | * Our buddy is free or it is CONFIG_DEBUG_PAGEALLOC guard page, | |
580 | * merge with it and move up one order. | |
581 | */ | |
582 | if (page_is_guard(buddy)) { | |
583 | clear_page_guard_flag(buddy); | |
584 | set_page_private(page, 0); | |
d1ce749a BZ |
585 | __mod_zone_freepage_state(zone, 1 << order, |
586 | migratetype); | |
c0a32fc5 SG |
587 | } else { |
588 | list_del(&buddy->lru); | |
589 | zone->free_area[order].nr_free--; | |
590 | rmv_page_order(buddy); | |
591 | } | |
43506fad | 592 | combined_idx = buddy_idx & page_idx; |
1da177e4 LT |
593 | page = page + (combined_idx - page_idx); |
594 | page_idx = combined_idx; | |
595 | order++; | |
596 | } | |
597 | set_page_order(page, order); | |
6dda9d55 CZ |
598 | |
599 | /* | |
600 | * If this is not the largest possible page, check if the buddy | |
601 | * of the next-highest order is free. If it is, it's possible | |
602 | * that pages are being freed that will coalesce soon. In case, | |
603 | * that is happening, add the free page to the tail of the list | |
604 | * so it's less likely to be used soon and more likely to be merged | |
605 | * as a higher order page | |
606 | */ | |
b7f50cfa | 607 | if ((order < MAX_ORDER-2) && pfn_valid_within(page_to_pfn(buddy))) { |
6dda9d55 | 608 | struct page *higher_page, *higher_buddy; |
43506fad KC |
609 | combined_idx = buddy_idx & page_idx; |
610 | higher_page = page + (combined_idx - page_idx); | |
611 | buddy_idx = __find_buddy_index(combined_idx, order + 1); | |
0ba8f2d5 | 612 | higher_buddy = higher_page + (buddy_idx - combined_idx); |
6dda9d55 CZ |
613 | if (page_is_buddy(higher_page, higher_buddy, order + 1)) { |
614 | list_add_tail(&page->lru, | |
615 | &zone->free_area[order].free_list[migratetype]); | |
616 | goto out; | |
617 | } | |
618 | } | |
619 | ||
620 | list_add(&page->lru, &zone->free_area[order].free_list[migratetype]); | |
621 | out: | |
1da177e4 LT |
622 | zone->free_area[order].nr_free++; |
623 | } | |
624 | ||
224abf92 | 625 | static inline int free_pages_check(struct page *page) |
1da177e4 | 626 | { |
d230dec1 | 627 | const char *bad_reason = NULL; |
f0b791a3 DH |
628 | unsigned long bad_flags = 0; |
629 | ||
630 | if (unlikely(page_mapcount(page))) | |
631 | bad_reason = "nonzero mapcount"; | |
632 | if (unlikely(page->mapping != NULL)) | |
633 | bad_reason = "non-NULL mapping"; | |
634 | if (unlikely(atomic_read(&page->_count) != 0)) | |
635 | bad_reason = "nonzero _count"; | |
636 | if (unlikely(page->flags & PAGE_FLAGS_CHECK_AT_FREE)) { | |
637 | bad_reason = "PAGE_FLAGS_CHECK_AT_FREE flag(s) set"; | |
638 | bad_flags = PAGE_FLAGS_CHECK_AT_FREE; | |
639 | } | |
640 | if (unlikely(mem_cgroup_bad_page_check(page))) | |
641 | bad_reason = "cgroup check failed"; | |
642 | if (unlikely(bad_reason)) { | |
643 | bad_page(page, bad_reason, bad_flags); | |
79f4b7bf | 644 | return 1; |
8cc3b392 | 645 | } |
90572890 | 646 | page_cpupid_reset_last(page); |
79f4b7bf HD |
647 | if (page->flags & PAGE_FLAGS_CHECK_AT_PREP) |
648 | page->flags &= ~PAGE_FLAGS_CHECK_AT_PREP; | |
649 | return 0; | |
1da177e4 LT |
650 | } |
651 | ||
652 | /* | |
5f8dcc21 | 653 | * Frees a number of pages from the PCP lists |
1da177e4 | 654 | * Assumes all pages on list are in same zone, and of same order. |
207f36ee | 655 | * count is the number of pages to free. |
1da177e4 LT |
656 | * |
657 | * If the zone was previously in an "all pages pinned" state then look to | |
658 | * see if this freeing clears that state. | |
659 | * | |
660 | * And clear the zone's pages_scanned counter, to hold off the "all pages are | |
661 | * pinned" detection logic. | |
662 | */ | |
5f8dcc21 MG |
663 | static void free_pcppages_bulk(struct zone *zone, int count, |
664 | struct per_cpu_pages *pcp) | |
1da177e4 | 665 | { |
5f8dcc21 | 666 | int migratetype = 0; |
a6f9edd6 | 667 | int batch_free = 0; |
72853e29 | 668 | int to_free = count; |
5f8dcc21 | 669 | |
c54ad30c | 670 | spin_lock(&zone->lock); |
1da177e4 | 671 | zone->pages_scanned = 0; |
f2260e6b | 672 | |
72853e29 | 673 | while (to_free) { |
48db57f8 | 674 | struct page *page; |
5f8dcc21 MG |
675 | struct list_head *list; |
676 | ||
677 | /* | |
a6f9edd6 MG |
678 | * Remove pages from lists in a round-robin fashion. A |
679 | * batch_free count is maintained that is incremented when an | |
680 | * empty list is encountered. This is so more pages are freed | |
681 | * off fuller lists instead of spinning excessively around empty | |
682 | * lists | |
5f8dcc21 MG |
683 | */ |
684 | do { | |
a6f9edd6 | 685 | batch_free++; |
5f8dcc21 MG |
686 | if (++migratetype == MIGRATE_PCPTYPES) |
687 | migratetype = 0; | |
688 | list = &pcp->lists[migratetype]; | |
689 | } while (list_empty(list)); | |
48db57f8 | 690 | |
1d16871d NK |
691 | /* This is the only non-empty list. Free them all. */ |
692 | if (batch_free == MIGRATE_PCPTYPES) | |
693 | batch_free = to_free; | |
694 | ||
a6f9edd6 | 695 | do { |
770c8aaa BZ |
696 | int mt; /* migratetype of the to-be-freed page */ |
697 | ||
a6f9edd6 MG |
698 | page = list_entry(list->prev, struct page, lru); |
699 | /* must delete as __free_one_page list manipulates */ | |
700 | list_del(&page->lru); | |
b12c4ad1 | 701 | mt = get_freepage_migratetype(page); |
a7016235 | 702 | /* MIGRATE_MOVABLE list may include MIGRATE_RESERVEs */ |
770c8aaa BZ |
703 | __free_one_page(page, zone, 0, mt); |
704 | trace_mm_page_pcpu_drain(page, 0, mt); | |
194159fb | 705 | if (likely(!is_migrate_isolate_page(page))) { |
97d0da22 WC |
706 | __mod_zone_page_state(zone, NR_FREE_PAGES, 1); |
707 | if (is_migrate_cma(mt)) | |
708 | __mod_zone_page_state(zone, NR_FREE_CMA_PAGES, 1); | |
709 | } | |
72853e29 | 710 | } while (--to_free && --batch_free && !list_empty(list)); |
1da177e4 | 711 | } |
c54ad30c | 712 | spin_unlock(&zone->lock); |
1da177e4 LT |
713 | } |
714 | ||
ed0ae21d MG |
715 | static void free_one_page(struct zone *zone, struct page *page, int order, |
716 | int migratetype) | |
1da177e4 | 717 | { |
006d22d9 | 718 | spin_lock(&zone->lock); |
006d22d9 | 719 | zone->pages_scanned = 0; |
f2260e6b | 720 | |
ed0ae21d | 721 | __free_one_page(page, zone, order, migratetype); |
194159fb | 722 | if (unlikely(!is_migrate_isolate(migratetype))) |
d1ce749a | 723 | __mod_zone_freepage_state(zone, 1 << order, migratetype); |
006d22d9 | 724 | spin_unlock(&zone->lock); |
48db57f8 NP |
725 | } |
726 | ||
ec95f53a | 727 | static bool free_pages_prepare(struct page *page, unsigned int order) |
48db57f8 | 728 | { |
1da177e4 | 729 | int i; |
8cc3b392 | 730 | int bad = 0; |
1da177e4 | 731 | |
b413d48a | 732 | trace_mm_page_free(page, order); |
b1eeab67 VN |
733 | kmemcheck_free_shadow(page, order); |
734 | ||
8dd60a3a AA |
735 | if (PageAnon(page)) |
736 | page->mapping = NULL; | |
737 | for (i = 0; i < (1 << order); i++) | |
738 | bad += free_pages_check(page + i); | |
8cc3b392 | 739 | if (bad) |
ec95f53a | 740 | return false; |
689bcebf | 741 | |
3ac7fe5a | 742 | if (!PageHighMem(page)) { |
b8af2941 PK |
743 | debug_check_no_locks_freed(page_address(page), |
744 | PAGE_SIZE << order); | |
3ac7fe5a TG |
745 | debug_check_no_obj_freed(page_address(page), |
746 | PAGE_SIZE << order); | |
747 | } | |
dafb1367 | 748 | arch_free_page(page, order); |
48db57f8 | 749 | kernel_map_pages(page, 1 << order, 0); |
dafb1367 | 750 | |
ec95f53a KM |
751 | return true; |
752 | } | |
753 | ||
754 | static void __free_pages_ok(struct page *page, unsigned int order) | |
755 | { | |
756 | unsigned long flags; | |
95e34412 | 757 | int migratetype; |
ec95f53a KM |
758 | |
759 | if (!free_pages_prepare(page, order)) | |
760 | return; | |
761 | ||
c54ad30c | 762 | local_irq_save(flags); |
f8891e5e | 763 | __count_vm_events(PGFREE, 1 << order); |
95e34412 MK |
764 | migratetype = get_pageblock_migratetype(page); |
765 | set_freepage_migratetype(page, migratetype); | |
766 | free_one_page(page_zone(page), page, order, migratetype); | |
c54ad30c | 767 | local_irq_restore(flags); |
1da177e4 LT |
768 | } |
769 | ||
170a5a7e | 770 | void __init __free_pages_bootmem(struct page *page, unsigned int order) |
a226f6c8 | 771 | { |
c3993076 | 772 | unsigned int nr_pages = 1 << order; |
e2d0bd2b | 773 | struct page *p = page; |
c3993076 | 774 | unsigned int loop; |
a226f6c8 | 775 | |
e2d0bd2b YL |
776 | prefetchw(p); |
777 | for (loop = 0; loop < (nr_pages - 1); loop++, p++) { | |
778 | prefetchw(p + 1); | |
c3993076 JW |
779 | __ClearPageReserved(p); |
780 | set_page_count(p, 0); | |
a226f6c8 | 781 | } |
e2d0bd2b YL |
782 | __ClearPageReserved(p); |
783 | set_page_count(p, 0); | |
c3993076 | 784 | |
e2d0bd2b | 785 | page_zone(page)->managed_pages += nr_pages; |
c3993076 JW |
786 | set_page_refcounted(page); |
787 | __free_pages(page, order); | |
a226f6c8 DH |
788 | } |
789 | ||
47118af0 | 790 | #ifdef CONFIG_CMA |
9cf510a5 | 791 | /* Free whole pageblock and set its migration type to MIGRATE_CMA. */ |
47118af0 MN |
792 | void __init init_cma_reserved_pageblock(struct page *page) |
793 | { | |
794 | unsigned i = pageblock_nr_pages; | |
795 | struct page *p = page; | |
796 | ||
797 | do { | |
798 | __ClearPageReserved(p); | |
799 | set_page_count(p, 0); | |
800 | } while (++p, --i); | |
801 | ||
802 | set_page_refcounted(page); | |
803 | set_pageblock_migratetype(page, MIGRATE_CMA); | |
804 | __free_pages(page, pageblock_order); | |
3dcc0571 | 805 | adjust_managed_page_count(page, pageblock_nr_pages); |
47118af0 MN |
806 | } |
807 | #endif | |
1da177e4 LT |
808 | |
809 | /* | |
810 | * The order of subdivision here is critical for the IO subsystem. | |
811 | * Please do not alter this order without good reasons and regression | |
812 | * testing. Specifically, as large blocks of memory are subdivided, | |
813 | * the order in which smaller blocks are delivered depends on the order | |
814 | * they're subdivided in this function. This is the primary factor | |
815 | * influencing the order in which pages are delivered to the IO | |
816 | * subsystem according to empirical testing, and this is also justified | |
817 | * by considering the behavior of a buddy system containing a single | |
818 | * large block of memory acted on by a series of small allocations. | |
819 | * This behavior is a critical factor in sglist merging's success. | |
820 | * | |
6d49e352 | 821 | * -- nyc |
1da177e4 | 822 | */ |
085cc7d5 | 823 | static inline void expand(struct zone *zone, struct page *page, |
b2a0ac88 MG |
824 | int low, int high, struct free_area *area, |
825 | int migratetype) | |
1da177e4 LT |
826 | { |
827 | unsigned long size = 1 << high; | |
828 | ||
829 | while (high > low) { | |
830 | area--; | |
831 | high--; | |
832 | size >>= 1; | |
309381fe | 833 | VM_BUG_ON_PAGE(bad_range(zone, &page[size]), &page[size]); |
c0a32fc5 SG |
834 | |
835 | #ifdef CONFIG_DEBUG_PAGEALLOC | |
836 | if (high < debug_guardpage_minorder()) { | |
837 | /* | |
838 | * Mark as guard pages (or page), that will allow to | |
839 | * merge back to allocator when buddy will be freed. | |
840 | * Corresponding page table entries will not be touched, | |
841 | * pages will stay not present in virtual address space | |
842 | */ | |
843 | INIT_LIST_HEAD(&page[size].lru); | |
844 | set_page_guard_flag(&page[size]); | |
845 | set_page_private(&page[size], high); | |
846 | /* Guard pages are not available for any usage */ | |
d1ce749a BZ |
847 | __mod_zone_freepage_state(zone, -(1 << high), |
848 | migratetype); | |
c0a32fc5 SG |
849 | continue; |
850 | } | |
851 | #endif | |
b2a0ac88 | 852 | list_add(&page[size].lru, &area->free_list[migratetype]); |
1da177e4 LT |
853 | area->nr_free++; |
854 | set_page_order(&page[size], high); | |
855 | } | |
1da177e4 LT |
856 | } |
857 | ||
1da177e4 LT |
858 | /* |
859 | * This page is about to be returned from the page allocator | |
860 | */ | |
2a7684a2 | 861 | static inline int check_new_page(struct page *page) |
1da177e4 | 862 | { |
d230dec1 | 863 | const char *bad_reason = NULL; |
f0b791a3 DH |
864 | unsigned long bad_flags = 0; |
865 | ||
866 | if (unlikely(page_mapcount(page))) | |
867 | bad_reason = "nonzero mapcount"; | |
868 | if (unlikely(page->mapping != NULL)) | |
869 | bad_reason = "non-NULL mapping"; | |
870 | if (unlikely(atomic_read(&page->_count) != 0)) | |
871 | bad_reason = "nonzero _count"; | |
872 | if (unlikely(page->flags & PAGE_FLAGS_CHECK_AT_PREP)) { | |
873 | bad_reason = "PAGE_FLAGS_CHECK_AT_PREP flag set"; | |
874 | bad_flags = PAGE_FLAGS_CHECK_AT_PREP; | |
875 | } | |
876 | if (unlikely(mem_cgroup_bad_page_check(page))) | |
877 | bad_reason = "cgroup check failed"; | |
878 | if (unlikely(bad_reason)) { | |
879 | bad_page(page, bad_reason, bad_flags); | |
689bcebf | 880 | return 1; |
8cc3b392 | 881 | } |
2a7684a2 WF |
882 | return 0; |
883 | } | |
884 | ||
885 | static int prep_new_page(struct page *page, int order, gfp_t gfp_flags) | |
886 | { | |
887 | int i; | |
888 | ||
889 | for (i = 0; i < (1 << order); i++) { | |
890 | struct page *p = page + i; | |
891 | if (unlikely(check_new_page(p))) | |
892 | return 1; | |
893 | } | |
689bcebf | 894 | |
4c21e2f2 | 895 | set_page_private(page, 0); |
7835e98b | 896 | set_page_refcounted(page); |
cc102509 NP |
897 | |
898 | arch_alloc_page(page, order); | |
1da177e4 | 899 | kernel_map_pages(page, 1 << order, 1); |
17cf4406 NP |
900 | |
901 | if (gfp_flags & __GFP_ZERO) | |
902 | prep_zero_page(page, order, gfp_flags); | |
903 | ||
904 | if (order && (gfp_flags & __GFP_COMP)) | |
905 | prep_compound_page(page, order); | |
906 | ||
689bcebf | 907 | return 0; |
1da177e4 LT |
908 | } |
909 | ||
56fd56b8 MG |
910 | /* |
911 | * Go through the free lists for the given migratetype and remove | |
912 | * the smallest available page from the freelists | |
913 | */ | |
728ec980 MG |
914 | static inline |
915 | struct page *__rmqueue_smallest(struct zone *zone, unsigned int order, | |
56fd56b8 MG |
916 | int migratetype) |
917 | { | |
918 | unsigned int current_order; | |
b8af2941 | 919 | struct free_area *area; |
56fd56b8 MG |
920 | struct page *page; |
921 | ||
922 | /* Find a page of the appropriate size in the preferred list */ | |
923 | for (current_order = order; current_order < MAX_ORDER; ++current_order) { | |
924 | area = &(zone->free_area[current_order]); | |
925 | if (list_empty(&area->free_list[migratetype])) | |
926 | continue; | |
927 | ||
928 | page = list_entry(area->free_list[migratetype].next, | |
929 | struct page, lru); | |
930 | list_del(&page->lru); | |
931 | rmv_page_order(page); | |
932 | area->nr_free--; | |
56fd56b8 | 933 | expand(zone, page, order, current_order, area, migratetype); |
5bcc9f86 | 934 | set_freepage_migratetype(page, migratetype); |
56fd56b8 MG |
935 | return page; |
936 | } | |
937 | ||
938 | return NULL; | |
939 | } | |
940 | ||
941 | ||
b2a0ac88 MG |
942 | /* |
943 | * This array describes the order lists are fallen back to when | |
944 | * the free lists for the desirable migrate type are depleted | |
945 | */ | |
47118af0 MN |
946 | static int fallbacks[MIGRATE_TYPES][4] = { |
947 | [MIGRATE_UNMOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_MOVABLE, MIGRATE_RESERVE }, | |
948 | [MIGRATE_RECLAIMABLE] = { MIGRATE_UNMOVABLE, MIGRATE_MOVABLE, MIGRATE_RESERVE }, | |
949 | #ifdef CONFIG_CMA | |
950 | [MIGRATE_MOVABLE] = { MIGRATE_CMA, MIGRATE_RECLAIMABLE, MIGRATE_UNMOVABLE, MIGRATE_RESERVE }, | |
951 | [MIGRATE_CMA] = { MIGRATE_RESERVE }, /* Never used */ | |
952 | #else | |
953 | [MIGRATE_MOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_UNMOVABLE, MIGRATE_RESERVE }, | |
954 | #endif | |
6d4a4916 | 955 | [MIGRATE_RESERVE] = { MIGRATE_RESERVE }, /* Never used */ |
194159fb | 956 | #ifdef CONFIG_MEMORY_ISOLATION |
6d4a4916 | 957 | [MIGRATE_ISOLATE] = { MIGRATE_RESERVE }, /* Never used */ |
194159fb | 958 | #endif |
b2a0ac88 MG |
959 | }; |
960 | ||
c361be55 MG |
961 | /* |
962 | * Move the free pages in a range to the free lists of the requested type. | |
d9c23400 | 963 | * Note that start_page and end_pages are not aligned on a pageblock |
c361be55 MG |
964 | * boundary. If alignment is required, use move_freepages_block() |
965 | */ | |
435b405c | 966 | int move_freepages(struct zone *zone, |
b69a7288 AB |
967 | struct page *start_page, struct page *end_page, |
968 | int migratetype) | |
c361be55 MG |
969 | { |
970 | struct page *page; | |
971 | unsigned long order; | |
d100313f | 972 | int pages_moved = 0; |
c361be55 MG |
973 | |
974 | #ifndef CONFIG_HOLES_IN_ZONE | |
975 | /* | |
976 | * page_zone is not safe to call in this context when | |
977 | * CONFIG_HOLES_IN_ZONE is set. This bug check is probably redundant | |
978 | * anyway as we check zone boundaries in move_freepages_block(). | |
979 | * Remove at a later date when no bug reports exist related to | |
ac0e5b7a | 980 | * grouping pages by mobility |
c361be55 MG |
981 | */ |
982 | BUG_ON(page_zone(start_page) != page_zone(end_page)); | |
983 | #endif | |
984 | ||
985 | for (page = start_page; page <= end_page;) { | |
344c790e | 986 | /* Make sure we are not inadvertently changing nodes */ |
309381fe | 987 | VM_BUG_ON_PAGE(page_to_nid(page) != zone_to_nid(zone), page); |
344c790e | 988 | |
c361be55 MG |
989 | if (!pfn_valid_within(page_to_pfn(page))) { |
990 | page++; | |
991 | continue; | |
992 | } | |
993 | ||
994 | if (!PageBuddy(page)) { | |
995 | page++; | |
996 | continue; | |
997 | } | |
998 | ||
999 | order = page_order(page); | |
84be48d8 KS |
1000 | list_move(&page->lru, |
1001 | &zone->free_area[order].free_list[migratetype]); | |
95e34412 | 1002 | set_freepage_migratetype(page, migratetype); |
c361be55 | 1003 | page += 1 << order; |
d100313f | 1004 | pages_moved += 1 << order; |
c361be55 MG |
1005 | } |
1006 | ||
d100313f | 1007 | return pages_moved; |
c361be55 MG |
1008 | } |
1009 | ||
ee6f509c | 1010 | int move_freepages_block(struct zone *zone, struct page *page, |
68e3e926 | 1011 | int migratetype) |
c361be55 MG |
1012 | { |
1013 | unsigned long start_pfn, end_pfn; | |
1014 | struct page *start_page, *end_page; | |
1015 | ||
1016 | start_pfn = page_to_pfn(page); | |
d9c23400 | 1017 | start_pfn = start_pfn & ~(pageblock_nr_pages-1); |
c361be55 | 1018 | start_page = pfn_to_page(start_pfn); |
d9c23400 MG |
1019 | end_page = start_page + pageblock_nr_pages - 1; |
1020 | end_pfn = start_pfn + pageblock_nr_pages - 1; | |
c361be55 MG |
1021 | |
1022 | /* Do not cross zone boundaries */ | |
108bcc96 | 1023 | if (!zone_spans_pfn(zone, start_pfn)) |
c361be55 | 1024 | start_page = page; |
108bcc96 | 1025 | if (!zone_spans_pfn(zone, end_pfn)) |
c361be55 MG |
1026 | return 0; |
1027 | ||
1028 | return move_freepages(zone, start_page, end_page, migratetype); | |
1029 | } | |
1030 | ||
2f66a68f MG |
1031 | static void change_pageblock_range(struct page *pageblock_page, |
1032 | int start_order, int migratetype) | |
1033 | { | |
1034 | int nr_pageblocks = 1 << (start_order - pageblock_order); | |
1035 | ||
1036 | while (nr_pageblocks--) { | |
1037 | set_pageblock_migratetype(pageblock_page, migratetype); | |
1038 | pageblock_page += pageblock_nr_pages; | |
1039 | } | |
1040 | } | |
1041 | ||
fef903ef SB |
1042 | /* |
1043 | * If breaking a large block of pages, move all free pages to the preferred | |
1044 | * allocation list. If falling back for a reclaimable kernel allocation, be | |
1045 | * more aggressive about taking ownership of free pages. | |
1046 | * | |
1047 | * On the other hand, never change migration type of MIGRATE_CMA pageblocks | |
1048 | * nor move CMA pages to different free lists. We don't want unmovable pages | |
1049 | * to be allocated from MIGRATE_CMA areas. | |
1050 | * | |
1051 | * Returns the new migratetype of the pageblock (or the same old migratetype | |
1052 | * if it was unchanged). | |
1053 | */ | |
1054 | static int try_to_steal_freepages(struct zone *zone, struct page *page, | |
1055 | int start_type, int fallback_type) | |
1056 | { | |
1057 | int current_order = page_order(page); | |
1058 | ||
0cbef29a KM |
1059 | /* |
1060 | * When borrowing from MIGRATE_CMA, we need to release the excess | |
5bcc9f86 VB |
1061 | * buddy pages to CMA itself. We also ensure the freepage_migratetype |
1062 | * is set to CMA so it is returned to the correct freelist in case | |
1063 | * the page ends up being not actually allocated from the pcp lists. | |
0cbef29a | 1064 | */ |
fef903ef SB |
1065 | if (is_migrate_cma(fallback_type)) |
1066 | return fallback_type; | |
1067 | ||
1068 | /* Take ownership for orders >= pageblock_order */ | |
1069 | if (current_order >= pageblock_order) { | |
1070 | change_pageblock_range(page, current_order, start_type); | |
1071 | return start_type; | |
1072 | } | |
1073 | ||
1074 | if (current_order >= pageblock_order / 2 || | |
1075 | start_type == MIGRATE_RECLAIMABLE || | |
1076 | page_group_by_mobility_disabled) { | |
1077 | int pages; | |
1078 | ||
1079 | pages = move_freepages_block(zone, page, start_type); | |
1080 | ||
1081 | /* Claim the whole block if over half of it is free */ | |
1082 | if (pages >= (1 << (pageblock_order-1)) || | |
1083 | page_group_by_mobility_disabled) { | |
1084 | ||
1085 | set_pageblock_migratetype(page, start_type); | |
1086 | return start_type; | |
1087 | } | |
1088 | ||
1089 | } | |
1090 | ||
1091 | return fallback_type; | |
1092 | } | |
1093 | ||
b2a0ac88 | 1094 | /* Remove an element from the buddy allocator from the fallback list */ |
0ac3a409 MG |
1095 | static inline struct page * |
1096 | __rmqueue_fallback(struct zone *zone, int order, int start_migratetype) | |
b2a0ac88 | 1097 | { |
b8af2941 | 1098 | struct free_area *area; |
b2a0ac88 MG |
1099 | int current_order; |
1100 | struct page *page; | |
fef903ef | 1101 | int migratetype, new_type, i; |
b2a0ac88 MG |
1102 | |
1103 | /* Find the largest possible block of pages in the other list */ | |
1104 | for (current_order = MAX_ORDER-1; current_order >= order; | |
1105 | --current_order) { | |
6d4a4916 | 1106 | for (i = 0;; i++) { |
b2a0ac88 MG |
1107 | migratetype = fallbacks[start_migratetype][i]; |
1108 | ||
56fd56b8 MG |
1109 | /* MIGRATE_RESERVE handled later if necessary */ |
1110 | if (migratetype == MIGRATE_RESERVE) | |
6d4a4916 | 1111 | break; |
e010487d | 1112 | |
b2a0ac88 MG |
1113 | area = &(zone->free_area[current_order]); |
1114 | if (list_empty(&area->free_list[migratetype])) | |
1115 | continue; | |
1116 | ||
1117 | page = list_entry(area->free_list[migratetype].next, | |
1118 | struct page, lru); | |
1119 | area->nr_free--; | |
1120 | ||
fef903ef SB |
1121 | new_type = try_to_steal_freepages(zone, page, |
1122 | start_migratetype, | |
1123 | migratetype); | |
b2a0ac88 MG |
1124 | |
1125 | /* Remove the page from the freelists */ | |
1126 | list_del(&page->lru); | |
1127 | rmv_page_order(page); | |
b2a0ac88 | 1128 | |
47118af0 | 1129 | expand(zone, page, order, current_order, area, |
0cbef29a | 1130 | new_type); |
5bcc9f86 VB |
1131 | /* The freepage_migratetype may differ from pageblock's |
1132 | * migratetype depending on the decisions in | |
1133 | * try_to_steal_freepages. This is OK as long as it does | |
1134 | * not differ for MIGRATE_CMA type. | |
1135 | */ | |
1136 | set_freepage_migratetype(page, new_type); | |
e0fff1bd | 1137 | |
52c8f6a5 KM |
1138 | trace_mm_page_alloc_extfrag(page, order, current_order, |
1139 | start_migratetype, migratetype, new_type); | |
e0fff1bd | 1140 | |
b2a0ac88 MG |
1141 | return page; |
1142 | } | |
1143 | } | |
1144 | ||
728ec980 | 1145 | return NULL; |
b2a0ac88 MG |
1146 | } |
1147 | ||
56fd56b8 | 1148 | /* |
1da177e4 LT |
1149 | * Do the hard work of removing an element from the buddy allocator. |
1150 | * Call me with the zone->lock already held. | |
1151 | */ | |
b2a0ac88 MG |
1152 | static struct page *__rmqueue(struct zone *zone, unsigned int order, |
1153 | int migratetype) | |
1da177e4 | 1154 | { |
1da177e4 LT |
1155 | struct page *page; |
1156 | ||
728ec980 | 1157 | retry_reserve: |
56fd56b8 | 1158 | page = __rmqueue_smallest(zone, order, migratetype); |
b2a0ac88 | 1159 | |
728ec980 | 1160 | if (unlikely(!page) && migratetype != MIGRATE_RESERVE) { |
56fd56b8 | 1161 | page = __rmqueue_fallback(zone, order, migratetype); |
b2a0ac88 | 1162 | |
728ec980 MG |
1163 | /* |
1164 | * Use MIGRATE_RESERVE rather than fail an allocation. goto | |
1165 | * is used because __rmqueue_smallest is an inline function | |
1166 | * and we want just one call site | |
1167 | */ | |
1168 | if (!page) { | |
1169 | migratetype = MIGRATE_RESERVE; | |
1170 | goto retry_reserve; | |
1171 | } | |
1172 | } | |
1173 | ||
0d3d062a | 1174 | trace_mm_page_alloc_zone_locked(page, order, migratetype); |
b2a0ac88 | 1175 | return page; |
1da177e4 LT |
1176 | } |
1177 | ||
5f63b720 | 1178 | /* |
1da177e4 LT |
1179 | * Obtain a specified number of elements from the buddy allocator, all under |
1180 | * a single hold of the lock, for efficiency. Add them to the supplied list. | |
1181 | * Returns the number of new pages which were placed at *list. | |
1182 | */ | |
5f63b720 | 1183 | static int rmqueue_bulk(struct zone *zone, unsigned int order, |
b2a0ac88 | 1184 | unsigned long count, struct list_head *list, |
e084b2d9 | 1185 | int migratetype, int cold) |
1da177e4 | 1186 | { |
5bcc9f86 | 1187 | int i; |
5f63b720 | 1188 | |
c54ad30c | 1189 | spin_lock(&zone->lock); |
1da177e4 | 1190 | for (i = 0; i < count; ++i) { |
b2a0ac88 | 1191 | struct page *page = __rmqueue(zone, order, migratetype); |
085cc7d5 | 1192 | if (unlikely(page == NULL)) |
1da177e4 | 1193 | break; |
81eabcbe MG |
1194 | |
1195 | /* | |
1196 | * Split buddy pages returned by expand() are received here | |
1197 | * in physical page order. The page is added to the callers and | |
1198 | * list and the list head then moves forward. From the callers | |
1199 | * perspective, the linked list is ordered by page number in | |
1200 | * some conditions. This is useful for IO devices that can | |
1201 | * merge IO requests if the physical pages are ordered | |
1202 | * properly. | |
1203 | */ | |
e084b2d9 MG |
1204 | if (likely(cold == 0)) |
1205 | list_add(&page->lru, list); | |
1206 | else | |
1207 | list_add_tail(&page->lru, list); | |
81eabcbe | 1208 | list = &page->lru; |
5bcc9f86 | 1209 | if (is_migrate_cma(get_freepage_migratetype(page))) |
d1ce749a BZ |
1210 | __mod_zone_page_state(zone, NR_FREE_CMA_PAGES, |
1211 | -(1 << order)); | |
1da177e4 | 1212 | } |
f2260e6b | 1213 | __mod_zone_page_state(zone, NR_FREE_PAGES, -(i << order)); |
c54ad30c | 1214 | spin_unlock(&zone->lock); |
085cc7d5 | 1215 | return i; |
1da177e4 LT |
1216 | } |
1217 | ||
4ae7c039 | 1218 | #ifdef CONFIG_NUMA |
8fce4d8e | 1219 | /* |
4037d452 CL |
1220 | * Called from the vmstat counter updater to drain pagesets of this |
1221 | * currently executing processor on remote nodes after they have | |
1222 | * expired. | |
1223 | * | |
879336c3 CL |
1224 | * Note that this function must be called with the thread pinned to |
1225 | * a single processor. | |
8fce4d8e | 1226 | */ |
4037d452 | 1227 | void drain_zone_pages(struct zone *zone, struct per_cpu_pages *pcp) |
4ae7c039 | 1228 | { |
4ae7c039 | 1229 | unsigned long flags; |
4037d452 | 1230 | int to_drain; |
998d39cb | 1231 | unsigned long batch; |
4ae7c039 | 1232 | |
4037d452 | 1233 | local_irq_save(flags); |
998d39cb CS |
1234 | batch = ACCESS_ONCE(pcp->batch); |
1235 | if (pcp->count >= batch) | |
1236 | to_drain = batch; | |
4037d452 CL |
1237 | else |
1238 | to_drain = pcp->count; | |
2a13515c KM |
1239 | if (to_drain > 0) { |
1240 | free_pcppages_bulk(zone, to_drain, pcp); | |
1241 | pcp->count -= to_drain; | |
1242 | } | |
4037d452 | 1243 | local_irq_restore(flags); |
4ae7c039 CL |
1244 | } |
1245 | #endif | |
1246 | ||
9f8f2172 CL |
1247 | /* |
1248 | * Drain pages of the indicated processor. | |
1249 | * | |
1250 | * The processor must either be the current processor and the | |
1251 | * thread pinned to the current processor or a processor that | |
1252 | * is not online. | |
1253 | */ | |
1254 | static void drain_pages(unsigned int cpu) | |
1da177e4 | 1255 | { |
c54ad30c | 1256 | unsigned long flags; |
1da177e4 | 1257 | struct zone *zone; |
1da177e4 | 1258 | |
ee99c71c | 1259 | for_each_populated_zone(zone) { |
1da177e4 | 1260 | struct per_cpu_pageset *pset; |
3dfa5721 | 1261 | struct per_cpu_pages *pcp; |
1da177e4 | 1262 | |
99dcc3e5 CL |
1263 | local_irq_save(flags); |
1264 | pset = per_cpu_ptr(zone->pageset, cpu); | |
3dfa5721 CL |
1265 | |
1266 | pcp = &pset->pcp; | |
2ff754fa DR |
1267 | if (pcp->count) { |
1268 | free_pcppages_bulk(zone, pcp->count, pcp); | |
1269 | pcp->count = 0; | |
1270 | } | |
3dfa5721 | 1271 | local_irq_restore(flags); |
1da177e4 LT |
1272 | } |
1273 | } | |
1da177e4 | 1274 | |
9f8f2172 CL |
1275 | /* |
1276 | * Spill all of this CPU's per-cpu pages back into the buddy allocator. | |
1277 | */ | |
1278 | void drain_local_pages(void *arg) | |
1279 | { | |
1280 | drain_pages(smp_processor_id()); | |
1281 | } | |
1282 | ||
1283 | /* | |
74046494 GBY |
1284 | * Spill all the per-cpu pages from all CPUs back into the buddy allocator. |
1285 | * | |
1286 | * Note that this code is protected against sending an IPI to an offline | |
1287 | * CPU but does not guarantee sending an IPI to newly hotplugged CPUs: | |
1288 | * on_each_cpu_mask() blocks hotplug and won't talk to offlined CPUs but | |
1289 | * nothing keeps CPUs from showing up after we populated the cpumask and | |
1290 | * before the call to on_each_cpu_mask(). | |
9f8f2172 CL |
1291 | */ |
1292 | void drain_all_pages(void) | |
1293 | { | |
74046494 GBY |
1294 | int cpu; |
1295 | struct per_cpu_pageset *pcp; | |
1296 | struct zone *zone; | |
1297 | ||
1298 | /* | |
1299 | * Allocate in the BSS so we wont require allocation in | |
1300 | * direct reclaim path for CONFIG_CPUMASK_OFFSTACK=y | |
1301 | */ | |
1302 | static cpumask_t cpus_with_pcps; | |
1303 | ||
1304 | /* | |
1305 | * We don't care about racing with CPU hotplug event | |
1306 | * as offline notification will cause the notified | |
1307 | * cpu to drain that CPU pcps and on_each_cpu_mask | |
1308 | * disables preemption as part of its processing | |
1309 | */ | |
1310 | for_each_online_cpu(cpu) { | |
1311 | bool has_pcps = false; | |
1312 | for_each_populated_zone(zone) { | |
1313 | pcp = per_cpu_ptr(zone->pageset, cpu); | |
1314 | if (pcp->pcp.count) { | |
1315 | has_pcps = true; | |
1316 | break; | |
1317 | } | |
1318 | } | |
1319 | if (has_pcps) | |
1320 | cpumask_set_cpu(cpu, &cpus_with_pcps); | |
1321 | else | |
1322 | cpumask_clear_cpu(cpu, &cpus_with_pcps); | |
1323 | } | |
1324 | on_each_cpu_mask(&cpus_with_pcps, drain_local_pages, NULL, 1); | |
9f8f2172 CL |
1325 | } |
1326 | ||
296699de | 1327 | #ifdef CONFIG_HIBERNATION |
1da177e4 LT |
1328 | |
1329 | void mark_free_pages(struct zone *zone) | |
1330 | { | |
f623f0db RW |
1331 | unsigned long pfn, max_zone_pfn; |
1332 | unsigned long flags; | |
b2a0ac88 | 1333 | int order, t; |
1da177e4 LT |
1334 | struct list_head *curr; |
1335 | ||
8080fc03 | 1336 | if (zone_is_empty(zone)) |
1da177e4 LT |
1337 | return; |
1338 | ||
1339 | spin_lock_irqsave(&zone->lock, flags); | |
f623f0db | 1340 | |
108bcc96 | 1341 | max_zone_pfn = zone_end_pfn(zone); |
f623f0db RW |
1342 | for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++) |
1343 | if (pfn_valid(pfn)) { | |
1344 | struct page *page = pfn_to_page(pfn); | |
1345 | ||
7be98234 RW |
1346 | if (!swsusp_page_is_forbidden(page)) |
1347 | swsusp_unset_page_free(page); | |
f623f0db | 1348 | } |
1da177e4 | 1349 | |
b2a0ac88 MG |
1350 | for_each_migratetype_order(order, t) { |
1351 | list_for_each(curr, &zone->free_area[order].free_list[t]) { | |
f623f0db | 1352 | unsigned long i; |
1da177e4 | 1353 | |
f623f0db RW |
1354 | pfn = page_to_pfn(list_entry(curr, struct page, lru)); |
1355 | for (i = 0; i < (1UL << order); i++) | |
7be98234 | 1356 | swsusp_set_page_free(pfn_to_page(pfn + i)); |
f623f0db | 1357 | } |
b2a0ac88 | 1358 | } |
1da177e4 LT |
1359 | spin_unlock_irqrestore(&zone->lock, flags); |
1360 | } | |
e2c55dc8 | 1361 | #endif /* CONFIG_PM */ |
1da177e4 | 1362 | |
1da177e4 LT |
1363 | /* |
1364 | * Free a 0-order page | |
fc91668e | 1365 | * cold == 1 ? free a cold page : free a hot page |
1da177e4 | 1366 | */ |
fc91668e | 1367 | void free_hot_cold_page(struct page *page, int cold) |
1da177e4 LT |
1368 | { |
1369 | struct zone *zone = page_zone(page); | |
1370 | struct per_cpu_pages *pcp; | |
1371 | unsigned long flags; | |
5f8dcc21 | 1372 | int migratetype; |
1da177e4 | 1373 | |
ec95f53a | 1374 | if (!free_pages_prepare(page, 0)) |
689bcebf HD |
1375 | return; |
1376 | ||
5f8dcc21 | 1377 | migratetype = get_pageblock_migratetype(page); |
b12c4ad1 | 1378 | set_freepage_migratetype(page, migratetype); |
1da177e4 | 1379 | local_irq_save(flags); |
f8891e5e | 1380 | __count_vm_event(PGFREE); |
da456f14 | 1381 | |
5f8dcc21 MG |
1382 | /* |
1383 | * We only track unmovable, reclaimable and movable on pcp lists. | |
1384 | * Free ISOLATE pages back to the allocator because they are being | |
1385 | * offlined but treat RESERVE as movable pages so we can get those | |
1386 | * areas back if necessary. Otherwise, we may have to free | |
1387 | * excessively into the page allocator | |
1388 | */ | |
1389 | if (migratetype >= MIGRATE_PCPTYPES) { | |
194159fb | 1390 | if (unlikely(is_migrate_isolate(migratetype))) { |
5f8dcc21 MG |
1391 | free_one_page(zone, page, 0, migratetype); |
1392 | goto out; | |
1393 | } | |
1394 | migratetype = MIGRATE_MOVABLE; | |
1395 | } | |
1396 | ||
99dcc3e5 | 1397 | pcp = &this_cpu_ptr(zone->pageset)->pcp; |
3dfa5721 | 1398 | if (cold) |
5f8dcc21 | 1399 | list_add_tail(&page->lru, &pcp->lists[migratetype]); |
3dfa5721 | 1400 | else |
5f8dcc21 | 1401 | list_add(&page->lru, &pcp->lists[migratetype]); |
1da177e4 | 1402 | pcp->count++; |
48db57f8 | 1403 | if (pcp->count >= pcp->high) { |
998d39cb CS |
1404 | unsigned long batch = ACCESS_ONCE(pcp->batch); |
1405 | free_pcppages_bulk(zone, batch, pcp); | |
1406 | pcp->count -= batch; | |
48db57f8 | 1407 | } |
5f8dcc21 MG |
1408 | |
1409 | out: | |
1da177e4 | 1410 | local_irq_restore(flags); |
1da177e4 LT |
1411 | } |
1412 | ||
cc59850e KK |
1413 | /* |
1414 | * Free a list of 0-order pages | |
1415 | */ | |
1416 | void free_hot_cold_page_list(struct list_head *list, int cold) | |
1417 | { | |
1418 | struct page *page, *next; | |
1419 | ||
1420 | list_for_each_entry_safe(page, next, list, lru) { | |
b413d48a | 1421 | trace_mm_page_free_batched(page, cold); |
cc59850e KK |
1422 | free_hot_cold_page(page, cold); |
1423 | } | |
1424 | } | |
1425 | ||
8dfcc9ba NP |
1426 | /* |
1427 | * split_page takes a non-compound higher-order page, and splits it into | |
1428 | * n (1<<order) sub-pages: page[0..n] | |
1429 | * Each sub-page must be freed individually. | |
1430 | * | |
1431 | * Note: this is probably too low level an operation for use in drivers. | |
1432 | * Please consult with lkml before using this in your driver. | |
1433 | */ | |
1434 | void split_page(struct page *page, unsigned int order) | |
1435 | { | |
1436 | int i; | |
1437 | ||
309381fe SL |
1438 | VM_BUG_ON_PAGE(PageCompound(page), page); |
1439 | VM_BUG_ON_PAGE(!page_count(page), page); | |
b1eeab67 VN |
1440 | |
1441 | #ifdef CONFIG_KMEMCHECK | |
1442 | /* | |
1443 | * Split shadow pages too, because free(page[0]) would | |
1444 | * otherwise free the whole shadow. | |
1445 | */ | |
1446 | if (kmemcheck_page_is_tracked(page)) | |
1447 | split_page(virt_to_page(page[0].shadow), order); | |
1448 | #endif | |
1449 | ||
7835e98b NP |
1450 | for (i = 1; i < (1 << order); i++) |
1451 | set_page_refcounted(page + i); | |
8dfcc9ba | 1452 | } |
5853ff23 | 1453 | EXPORT_SYMBOL_GPL(split_page); |
8dfcc9ba | 1454 | |
8fb74b9f | 1455 | static int __isolate_free_page(struct page *page, unsigned int order) |
748446bb | 1456 | { |
748446bb MG |
1457 | unsigned long watermark; |
1458 | struct zone *zone; | |
2139cbe6 | 1459 | int mt; |
748446bb MG |
1460 | |
1461 | BUG_ON(!PageBuddy(page)); | |
1462 | ||
1463 | zone = page_zone(page); | |
2e30abd1 | 1464 | mt = get_pageblock_migratetype(page); |
748446bb | 1465 | |
194159fb | 1466 | if (!is_migrate_isolate(mt)) { |
2e30abd1 MS |
1467 | /* Obey watermarks as if the page was being allocated */ |
1468 | watermark = low_wmark_pages(zone) + (1 << order); | |
1469 | if (!zone_watermark_ok(zone, 0, watermark, 0, 0)) | |
1470 | return 0; | |
1471 | ||
8fb74b9f | 1472 | __mod_zone_freepage_state(zone, -(1UL << order), mt); |
2e30abd1 | 1473 | } |
748446bb MG |
1474 | |
1475 | /* Remove page from free list */ | |
1476 | list_del(&page->lru); | |
1477 | zone->free_area[order].nr_free--; | |
1478 | rmv_page_order(page); | |
2139cbe6 | 1479 | |
8fb74b9f | 1480 | /* Set the pageblock if the isolated page is at least a pageblock */ |
748446bb MG |
1481 | if (order >= pageblock_order - 1) { |
1482 | struct page *endpage = page + (1 << order) - 1; | |
47118af0 MN |
1483 | for (; page < endpage; page += pageblock_nr_pages) { |
1484 | int mt = get_pageblock_migratetype(page); | |
194159fb | 1485 | if (!is_migrate_isolate(mt) && !is_migrate_cma(mt)) |
47118af0 MN |
1486 | set_pageblock_migratetype(page, |
1487 | MIGRATE_MOVABLE); | |
1488 | } | |
748446bb MG |
1489 | } |
1490 | ||
8fb74b9f | 1491 | return 1UL << order; |
1fb3f8ca MG |
1492 | } |
1493 | ||
1494 | /* | |
1495 | * Similar to split_page except the page is already free. As this is only | |
1496 | * being used for migration, the migratetype of the block also changes. | |
1497 | * As this is called with interrupts disabled, the caller is responsible | |
1498 | * for calling arch_alloc_page() and kernel_map_page() after interrupts | |
1499 | * are enabled. | |
1500 | * | |
1501 | * Note: this is probably too low level an operation for use in drivers. | |
1502 | * Please consult with lkml before using this in your driver. | |
1503 | */ | |
1504 | int split_free_page(struct page *page) | |
1505 | { | |
1506 | unsigned int order; | |
1507 | int nr_pages; | |
1508 | ||
1fb3f8ca MG |
1509 | order = page_order(page); |
1510 | ||
8fb74b9f | 1511 | nr_pages = __isolate_free_page(page, order); |
1fb3f8ca MG |
1512 | if (!nr_pages) |
1513 | return 0; | |
1514 | ||
1515 | /* Split into individual pages */ | |
1516 | set_page_refcounted(page); | |
1517 | split_page(page, order); | |
1518 | return nr_pages; | |
748446bb MG |
1519 | } |
1520 | ||
1da177e4 LT |
1521 | /* |
1522 | * Really, prep_compound_page() should be called from __rmqueue_bulk(). But | |
1523 | * we cheat by calling it from here, in the order > 0 path. Saves a branch | |
1524 | * or two. | |
1525 | */ | |
0a15c3e9 MG |
1526 | static inline |
1527 | struct page *buffered_rmqueue(struct zone *preferred_zone, | |
3dd28266 MG |
1528 | struct zone *zone, int order, gfp_t gfp_flags, |
1529 | int migratetype) | |
1da177e4 LT |
1530 | { |
1531 | unsigned long flags; | |
689bcebf | 1532 | struct page *page; |
1da177e4 LT |
1533 | int cold = !!(gfp_flags & __GFP_COLD); |
1534 | ||
689bcebf | 1535 | again: |
48db57f8 | 1536 | if (likely(order == 0)) { |
1da177e4 | 1537 | struct per_cpu_pages *pcp; |
5f8dcc21 | 1538 | struct list_head *list; |
1da177e4 | 1539 | |
1da177e4 | 1540 | local_irq_save(flags); |
99dcc3e5 CL |
1541 | pcp = &this_cpu_ptr(zone->pageset)->pcp; |
1542 | list = &pcp->lists[migratetype]; | |
5f8dcc21 | 1543 | if (list_empty(list)) { |
535131e6 | 1544 | pcp->count += rmqueue_bulk(zone, 0, |
5f8dcc21 | 1545 | pcp->batch, list, |
e084b2d9 | 1546 | migratetype, cold); |
5f8dcc21 | 1547 | if (unlikely(list_empty(list))) |
6fb332fa | 1548 | goto failed; |
535131e6 | 1549 | } |
b92a6edd | 1550 | |
5f8dcc21 MG |
1551 | if (cold) |
1552 | page = list_entry(list->prev, struct page, lru); | |
1553 | else | |
1554 | page = list_entry(list->next, struct page, lru); | |
1555 | ||
b92a6edd MG |
1556 | list_del(&page->lru); |
1557 | pcp->count--; | |
7fb1d9fc | 1558 | } else { |
dab48dab AM |
1559 | if (unlikely(gfp_flags & __GFP_NOFAIL)) { |
1560 | /* | |
1561 | * __GFP_NOFAIL is not to be used in new code. | |
1562 | * | |
1563 | * All __GFP_NOFAIL callers should be fixed so that they | |
1564 | * properly detect and handle allocation failures. | |
1565 | * | |
1566 | * We most definitely don't want callers attempting to | |
4923abf9 | 1567 | * allocate greater than order-1 page units with |
dab48dab AM |
1568 | * __GFP_NOFAIL. |
1569 | */ | |
4923abf9 | 1570 | WARN_ON_ONCE(order > 1); |
dab48dab | 1571 | } |
1da177e4 | 1572 | spin_lock_irqsave(&zone->lock, flags); |
b2a0ac88 | 1573 | page = __rmqueue(zone, order, migratetype); |
a74609fa NP |
1574 | spin_unlock(&zone->lock); |
1575 | if (!page) | |
1576 | goto failed; | |
d1ce749a | 1577 | __mod_zone_freepage_state(zone, -(1 << order), |
5bcc9f86 | 1578 | get_freepage_migratetype(page)); |
1da177e4 LT |
1579 | } |
1580 | ||
3a025760 | 1581 | __mod_zone_page_state(zone, NR_ALLOC_BATCH, -(1 << order)); |
27329369 | 1582 | |
f8891e5e | 1583 | __count_zone_vm_events(PGALLOC, zone, 1 << order); |
78afd561 | 1584 | zone_statistics(preferred_zone, zone, gfp_flags); |
a74609fa | 1585 | local_irq_restore(flags); |
1da177e4 | 1586 | |
309381fe | 1587 | VM_BUG_ON_PAGE(bad_range(zone, page), page); |
17cf4406 | 1588 | if (prep_new_page(page, order, gfp_flags)) |
a74609fa | 1589 | goto again; |
1da177e4 | 1590 | return page; |
a74609fa NP |
1591 | |
1592 | failed: | |
1593 | local_irq_restore(flags); | |
a74609fa | 1594 | return NULL; |
1da177e4 LT |
1595 | } |
1596 | ||
933e312e AM |
1597 | #ifdef CONFIG_FAIL_PAGE_ALLOC |
1598 | ||
b2588c4b | 1599 | static struct { |
933e312e AM |
1600 | struct fault_attr attr; |
1601 | ||
1602 | u32 ignore_gfp_highmem; | |
1603 | u32 ignore_gfp_wait; | |
54114994 | 1604 | u32 min_order; |
933e312e AM |
1605 | } fail_page_alloc = { |
1606 | .attr = FAULT_ATTR_INITIALIZER, | |
6b1b60f4 DM |
1607 | .ignore_gfp_wait = 1, |
1608 | .ignore_gfp_highmem = 1, | |
54114994 | 1609 | .min_order = 1, |
933e312e AM |
1610 | }; |
1611 | ||
1612 | static int __init setup_fail_page_alloc(char *str) | |
1613 | { | |
1614 | return setup_fault_attr(&fail_page_alloc.attr, str); | |
1615 | } | |
1616 | __setup("fail_page_alloc=", setup_fail_page_alloc); | |
1617 | ||
deaf386e | 1618 | static bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order) |
933e312e | 1619 | { |
54114994 | 1620 | if (order < fail_page_alloc.min_order) |
deaf386e | 1621 | return false; |
933e312e | 1622 | if (gfp_mask & __GFP_NOFAIL) |
deaf386e | 1623 | return false; |
933e312e | 1624 | if (fail_page_alloc.ignore_gfp_highmem && (gfp_mask & __GFP_HIGHMEM)) |
deaf386e | 1625 | return false; |
933e312e | 1626 | if (fail_page_alloc.ignore_gfp_wait && (gfp_mask & __GFP_WAIT)) |
deaf386e | 1627 | return false; |
933e312e AM |
1628 | |
1629 | return should_fail(&fail_page_alloc.attr, 1 << order); | |
1630 | } | |
1631 | ||
1632 | #ifdef CONFIG_FAULT_INJECTION_DEBUG_FS | |
1633 | ||
1634 | static int __init fail_page_alloc_debugfs(void) | |
1635 | { | |
f4ae40a6 | 1636 | umode_t mode = S_IFREG | S_IRUSR | S_IWUSR; |
933e312e | 1637 | struct dentry *dir; |
933e312e | 1638 | |
dd48c085 AM |
1639 | dir = fault_create_debugfs_attr("fail_page_alloc", NULL, |
1640 | &fail_page_alloc.attr); | |
1641 | if (IS_ERR(dir)) | |
1642 | return PTR_ERR(dir); | |
933e312e | 1643 | |
b2588c4b AM |
1644 | if (!debugfs_create_bool("ignore-gfp-wait", mode, dir, |
1645 | &fail_page_alloc.ignore_gfp_wait)) | |
1646 | goto fail; | |
1647 | if (!debugfs_create_bool("ignore-gfp-highmem", mode, dir, | |
1648 | &fail_page_alloc.ignore_gfp_highmem)) | |
1649 | goto fail; | |
1650 | if (!debugfs_create_u32("min-order", mode, dir, | |
1651 | &fail_page_alloc.min_order)) | |
1652 | goto fail; | |
1653 | ||
1654 | return 0; | |
1655 | fail: | |
dd48c085 | 1656 | debugfs_remove_recursive(dir); |
933e312e | 1657 | |
b2588c4b | 1658 | return -ENOMEM; |
933e312e AM |
1659 | } |
1660 | ||
1661 | late_initcall(fail_page_alloc_debugfs); | |
1662 | ||
1663 | #endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */ | |
1664 | ||
1665 | #else /* CONFIG_FAIL_PAGE_ALLOC */ | |
1666 | ||
deaf386e | 1667 | static inline bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order) |
933e312e | 1668 | { |
deaf386e | 1669 | return false; |
933e312e AM |
1670 | } |
1671 | ||
1672 | #endif /* CONFIG_FAIL_PAGE_ALLOC */ | |
1673 | ||
1da177e4 | 1674 | /* |
88f5acf8 | 1675 | * Return true if free pages are above 'mark'. This takes into account the order |
1da177e4 LT |
1676 | * of the allocation. |
1677 | */ | |
88f5acf8 MG |
1678 | static bool __zone_watermark_ok(struct zone *z, int order, unsigned long mark, |
1679 | int classzone_idx, int alloc_flags, long free_pages) | |
1da177e4 LT |
1680 | { |
1681 | /* free_pages my go negative - that's OK */ | |
d23ad423 | 1682 | long min = mark; |
2cfed075 | 1683 | long lowmem_reserve = z->lowmem_reserve[classzone_idx]; |
1da177e4 | 1684 | int o; |
026b0814 | 1685 | long free_cma = 0; |
1da177e4 | 1686 | |
df0a6daa | 1687 | free_pages -= (1 << order) - 1; |
7fb1d9fc | 1688 | if (alloc_flags & ALLOC_HIGH) |
1da177e4 | 1689 | min -= min / 2; |
7fb1d9fc | 1690 | if (alloc_flags & ALLOC_HARDER) |
1da177e4 | 1691 | min -= min / 4; |
d95ea5d1 BZ |
1692 | #ifdef CONFIG_CMA |
1693 | /* If allocation can't use CMA areas don't use free CMA pages */ | |
1694 | if (!(alloc_flags & ALLOC_CMA)) | |
026b0814 | 1695 | free_cma = zone_page_state(z, NR_FREE_CMA_PAGES); |
d95ea5d1 | 1696 | #endif |
026b0814 TS |
1697 | |
1698 | if (free_pages - free_cma <= min + lowmem_reserve) | |
88f5acf8 | 1699 | return false; |
1da177e4 LT |
1700 | for (o = 0; o < order; o++) { |
1701 | /* At the next order, this order's pages become unavailable */ | |
1702 | free_pages -= z->free_area[o].nr_free << o; | |
1703 | ||
1704 | /* Require fewer higher order pages to be free */ | |
1705 | min >>= 1; | |
1706 | ||
1707 | if (free_pages <= min) | |
88f5acf8 | 1708 | return false; |
1da177e4 | 1709 | } |
88f5acf8 MG |
1710 | return true; |
1711 | } | |
1712 | ||
1713 | bool zone_watermark_ok(struct zone *z, int order, unsigned long mark, | |
1714 | int classzone_idx, int alloc_flags) | |
1715 | { | |
1716 | return __zone_watermark_ok(z, order, mark, classzone_idx, alloc_flags, | |
1717 | zone_page_state(z, NR_FREE_PAGES)); | |
1718 | } | |
1719 | ||
1720 | bool zone_watermark_ok_safe(struct zone *z, int order, unsigned long mark, | |
1721 | int classzone_idx, int alloc_flags) | |
1722 | { | |
1723 | long free_pages = zone_page_state(z, NR_FREE_PAGES); | |
1724 | ||
1725 | if (z->percpu_drift_mark && free_pages < z->percpu_drift_mark) | |
1726 | free_pages = zone_page_state_snapshot(z, NR_FREE_PAGES); | |
1727 | ||
1728 | return __zone_watermark_ok(z, order, mark, classzone_idx, alloc_flags, | |
1729 | free_pages); | |
1da177e4 LT |
1730 | } |
1731 | ||
9276b1bc PJ |
1732 | #ifdef CONFIG_NUMA |
1733 | /* | |
1734 | * zlc_setup - Setup for "zonelist cache". Uses cached zone data to | |
1735 | * skip over zones that are not allowed by the cpuset, or that have | |
1736 | * been recently (in last second) found to be nearly full. See further | |
1737 | * comments in mmzone.h. Reduces cache footprint of zonelist scans | |
183ff22b | 1738 | * that have to skip over a lot of full or unallowed zones. |
9276b1bc | 1739 | * |
a1aeb65a | 1740 | * If the zonelist cache is present in the passed zonelist, then |
9276b1bc | 1741 | * returns a pointer to the allowed node mask (either the current |
4b0ef1fe | 1742 | * tasks mems_allowed, or node_states[N_MEMORY].) |
9276b1bc PJ |
1743 | * |
1744 | * If the zonelist cache is not available for this zonelist, does | |
1745 | * nothing and returns NULL. | |
1746 | * | |
1747 | * If the fullzones BITMAP in the zonelist cache is stale (more than | |
1748 | * a second since last zap'd) then we zap it out (clear its bits.) | |
1749 | * | |
1750 | * We hold off even calling zlc_setup, until after we've checked the | |
1751 | * first zone in the zonelist, on the theory that most allocations will | |
1752 | * be satisfied from that first zone, so best to examine that zone as | |
1753 | * quickly as we can. | |
1754 | */ | |
1755 | static nodemask_t *zlc_setup(struct zonelist *zonelist, int alloc_flags) | |
1756 | { | |
1757 | struct zonelist_cache *zlc; /* cached zonelist speedup info */ | |
1758 | nodemask_t *allowednodes; /* zonelist_cache approximation */ | |
1759 | ||
1760 | zlc = zonelist->zlcache_ptr; | |
1761 | if (!zlc) | |
1762 | return NULL; | |
1763 | ||
f05111f5 | 1764 | if (time_after(jiffies, zlc->last_full_zap + HZ)) { |
9276b1bc PJ |
1765 | bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST); |
1766 | zlc->last_full_zap = jiffies; | |
1767 | } | |
1768 | ||
1769 | allowednodes = !in_interrupt() && (alloc_flags & ALLOC_CPUSET) ? | |
1770 | &cpuset_current_mems_allowed : | |
4b0ef1fe | 1771 | &node_states[N_MEMORY]; |
9276b1bc PJ |
1772 | return allowednodes; |
1773 | } | |
1774 | ||
1775 | /* | |
1776 | * Given 'z' scanning a zonelist, run a couple of quick checks to see | |
1777 | * if it is worth looking at further for free memory: | |
1778 | * 1) Check that the zone isn't thought to be full (doesn't have its | |
1779 | * bit set in the zonelist_cache fullzones BITMAP). | |
1780 | * 2) Check that the zones node (obtained from the zonelist_cache | |
1781 | * z_to_n[] mapping) is allowed in the passed in allowednodes mask. | |
1782 | * Return true (non-zero) if zone is worth looking at further, or | |
1783 | * else return false (zero) if it is not. | |
1784 | * | |
1785 | * This check -ignores- the distinction between various watermarks, | |
1786 | * such as GFP_HIGH, GFP_ATOMIC, PF_MEMALLOC, ... If a zone is | |
1787 | * found to be full for any variation of these watermarks, it will | |
1788 | * be considered full for up to one second by all requests, unless | |
1789 | * we are so low on memory on all allowed nodes that we are forced | |
1790 | * into the second scan of the zonelist. | |
1791 | * | |
1792 | * In the second scan we ignore this zonelist cache and exactly | |
1793 | * apply the watermarks to all zones, even it is slower to do so. | |
1794 | * We are low on memory in the second scan, and should leave no stone | |
1795 | * unturned looking for a free page. | |
1796 | */ | |
dd1a239f | 1797 | static int zlc_zone_worth_trying(struct zonelist *zonelist, struct zoneref *z, |
9276b1bc PJ |
1798 | nodemask_t *allowednodes) |
1799 | { | |
1800 | struct zonelist_cache *zlc; /* cached zonelist speedup info */ | |
1801 | int i; /* index of *z in zonelist zones */ | |
1802 | int n; /* node that zone *z is on */ | |
1803 | ||
1804 | zlc = zonelist->zlcache_ptr; | |
1805 | if (!zlc) | |
1806 | return 1; | |
1807 | ||
dd1a239f | 1808 | i = z - zonelist->_zonerefs; |
9276b1bc PJ |
1809 | n = zlc->z_to_n[i]; |
1810 | ||
1811 | /* This zone is worth trying if it is allowed but not full */ | |
1812 | return node_isset(n, *allowednodes) && !test_bit(i, zlc->fullzones); | |
1813 | } | |
1814 | ||
1815 | /* | |
1816 | * Given 'z' scanning a zonelist, set the corresponding bit in | |
1817 | * zlc->fullzones, so that subsequent attempts to allocate a page | |
1818 | * from that zone don't waste time re-examining it. | |
1819 | */ | |
dd1a239f | 1820 | static void zlc_mark_zone_full(struct zonelist *zonelist, struct zoneref *z) |
9276b1bc PJ |
1821 | { |
1822 | struct zonelist_cache *zlc; /* cached zonelist speedup info */ | |
1823 | int i; /* index of *z in zonelist zones */ | |
1824 | ||
1825 | zlc = zonelist->zlcache_ptr; | |
1826 | if (!zlc) | |
1827 | return; | |
1828 | ||
dd1a239f | 1829 | i = z - zonelist->_zonerefs; |
9276b1bc PJ |
1830 | |
1831 | set_bit(i, zlc->fullzones); | |
1832 | } | |
1833 | ||
76d3fbf8 MG |
1834 | /* |
1835 | * clear all zones full, called after direct reclaim makes progress so that | |
1836 | * a zone that was recently full is not skipped over for up to a second | |
1837 | */ | |
1838 | static void zlc_clear_zones_full(struct zonelist *zonelist) | |
1839 | { | |
1840 | struct zonelist_cache *zlc; /* cached zonelist speedup info */ | |
1841 | ||
1842 | zlc = zonelist->zlcache_ptr; | |
1843 | if (!zlc) | |
1844 | return; | |
1845 | ||
1846 | bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST); | |
1847 | } | |
1848 | ||
81c0a2bb JW |
1849 | static bool zone_local(struct zone *local_zone, struct zone *zone) |
1850 | { | |
fff4068c | 1851 | return local_zone->node == zone->node; |
81c0a2bb JW |
1852 | } |
1853 | ||
957f822a DR |
1854 | static bool zone_allows_reclaim(struct zone *local_zone, struct zone *zone) |
1855 | { | |
5f7a75ac MG |
1856 | return node_distance(zone_to_nid(local_zone), zone_to_nid(zone)) < |
1857 | RECLAIM_DISTANCE; | |
957f822a DR |
1858 | } |
1859 | ||
9276b1bc PJ |
1860 | #else /* CONFIG_NUMA */ |
1861 | ||
1862 | static nodemask_t *zlc_setup(struct zonelist *zonelist, int alloc_flags) | |
1863 | { | |
1864 | return NULL; | |
1865 | } | |
1866 | ||
dd1a239f | 1867 | static int zlc_zone_worth_trying(struct zonelist *zonelist, struct zoneref *z, |
9276b1bc PJ |
1868 | nodemask_t *allowednodes) |
1869 | { | |
1870 | return 1; | |
1871 | } | |
1872 | ||
dd1a239f | 1873 | static void zlc_mark_zone_full(struct zonelist *zonelist, struct zoneref *z) |
9276b1bc PJ |
1874 | { |
1875 | } | |
76d3fbf8 MG |
1876 | |
1877 | static void zlc_clear_zones_full(struct zonelist *zonelist) | |
1878 | { | |
1879 | } | |
957f822a | 1880 | |
81c0a2bb JW |
1881 | static bool zone_local(struct zone *local_zone, struct zone *zone) |
1882 | { | |
1883 | return true; | |
1884 | } | |
1885 | ||
957f822a DR |
1886 | static bool zone_allows_reclaim(struct zone *local_zone, struct zone *zone) |
1887 | { | |
1888 | return true; | |
1889 | } | |
1890 | ||
9276b1bc PJ |
1891 | #endif /* CONFIG_NUMA */ |
1892 | ||
7fb1d9fc | 1893 | /* |
0798e519 | 1894 | * get_page_from_freelist goes through the zonelist trying to allocate |
7fb1d9fc RS |
1895 | * a page. |
1896 | */ | |
1897 | static struct page * | |
19770b32 | 1898 | get_page_from_freelist(gfp_t gfp_mask, nodemask_t *nodemask, unsigned int order, |
5117f45d | 1899 | struct zonelist *zonelist, int high_zoneidx, int alloc_flags, |
3dd28266 | 1900 | struct zone *preferred_zone, int migratetype) |
753ee728 | 1901 | { |
dd1a239f | 1902 | struct zoneref *z; |
7fb1d9fc | 1903 | struct page *page = NULL; |
54a6eb5c | 1904 | int classzone_idx; |
5117f45d | 1905 | struct zone *zone; |
9276b1bc PJ |
1906 | nodemask_t *allowednodes = NULL;/* zonelist_cache approximation */ |
1907 | int zlc_active = 0; /* set if using zonelist_cache */ | |
1908 | int did_zlc_setup = 0; /* just call zlc_setup() one time */ | |
54a6eb5c | 1909 | |
19770b32 | 1910 | classzone_idx = zone_idx(preferred_zone); |
9276b1bc | 1911 | zonelist_scan: |
7fb1d9fc | 1912 | /* |
9276b1bc | 1913 | * Scan zonelist, looking for a zone with enough free. |
3b11f0aa | 1914 | * See also __cpuset_node_allowed_softwall() comment in kernel/cpuset.c. |
7fb1d9fc | 1915 | */ |
19770b32 MG |
1916 | for_each_zone_zonelist_nodemask(zone, z, zonelist, |
1917 | high_zoneidx, nodemask) { | |
e085dbc5 JW |
1918 | unsigned long mark; |
1919 | ||
e5adfffc | 1920 | if (IS_ENABLED(CONFIG_NUMA) && zlc_active && |
9276b1bc PJ |
1921 | !zlc_zone_worth_trying(zonelist, z, allowednodes)) |
1922 | continue; | |
7fb1d9fc | 1923 | if ((alloc_flags & ALLOC_CPUSET) && |
02a0e53d | 1924 | !cpuset_zone_allowed_softwall(zone, gfp_mask)) |
cd38b115 | 1925 | continue; |
e085dbc5 | 1926 | BUILD_BUG_ON(ALLOC_NO_WATERMARKS < NR_WMARK); |
e66f0972 | 1927 | if (unlikely(alloc_flags & ALLOC_NO_WATERMARKS)) |
e085dbc5 | 1928 | goto try_this_zone; |
81c0a2bb JW |
1929 | /* |
1930 | * Distribute pages in proportion to the individual | |
1931 | * zone size to ensure fair page aging. The zone a | |
1932 | * page was allocated in should have no effect on the | |
1933 | * time the page has in memory before being reclaimed. | |
81c0a2bb | 1934 | */ |
3a025760 | 1935 | if (alloc_flags & ALLOC_FAIR) { |
fff4068c | 1936 | if (!zone_local(preferred_zone, zone)) |
81c0a2bb | 1937 | continue; |
3a025760 JW |
1938 | if (zone_page_state(zone, NR_ALLOC_BATCH) <= 0) |
1939 | continue; | |
81c0a2bb | 1940 | } |
a756cf59 JW |
1941 | /* |
1942 | * When allocating a page cache page for writing, we | |
1943 | * want to get it from a zone that is within its dirty | |
1944 | * limit, such that no single zone holds more than its | |
1945 | * proportional share of globally allowed dirty pages. | |
1946 | * The dirty limits take into account the zone's | |
1947 | * lowmem reserves and high watermark so that kswapd | |
1948 | * should be able to balance it without having to | |
1949 | * write pages from its LRU list. | |
1950 | * | |
1951 | * This may look like it could increase pressure on | |
1952 | * lower zones by failing allocations in higher zones | |
1953 | * before they are full. But the pages that do spill | |
1954 | * over are limited as the lower zones are protected | |
1955 | * by this very same mechanism. It should not become | |
1956 | * a practical burden to them. | |
1957 | * | |
1958 | * XXX: For now, allow allocations to potentially | |
1959 | * exceed the per-zone dirty limit in the slowpath | |
1960 | * (ALLOC_WMARK_LOW unset) before going into reclaim, | |
1961 | * which is important when on a NUMA setup the allowed | |
1962 | * zones are together not big enough to reach the | |
1963 | * global limit. The proper fix for these situations | |
1964 | * will require awareness of zones in the | |
1965 | * dirty-throttling and the flusher threads. | |
1966 | */ | |
1967 | if ((alloc_flags & ALLOC_WMARK_LOW) && | |
1968 | (gfp_mask & __GFP_WRITE) && !zone_dirty_ok(zone)) | |
1969 | goto this_zone_full; | |
7fb1d9fc | 1970 | |
e085dbc5 JW |
1971 | mark = zone->watermark[alloc_flags & ALLOC_WMARK_MASK]; |
1972 | if (!zone_watermark_ok(zone, order, mark, | |
1973 | classzone_idx, alloc_flags)) { | |
fa5e084e MG |
1974 | int ret; |
1975 | ||
e5adfffc KS |
1976 | if (IS_ENABLED(CONFIG_NUMA) && |
1977 | !did_zlc_setup && nr_online_nodes > 1) { | |
cd38b115 MG |
1978 | /* |
1979 | * we do zlc_setup if there are multiple nodes | |
1980 | * and before considering the first zone allowed | |
1981 | * by the cpuset. | |
1982 | */ | |
1983 | allowednodes = zlc_setup(zonelist, alloc_flags); | |
1984 | zlc_active = 1; | |
1985 | did_zlc_setup = 1; | |
1986 | } | |
1987 | ||
957f822a DR |
1988 | if (zone_reclaim_mode == 0 || |
1989 | !zone_allows_reclaim(preferred_zone, zone)) | |
fa5e084e MG |
1990 | goto this_zone_full; |
1991 | ||
cd38b115 MG |
1992 | /* |
1993 | * As we may have just activated ZLC, check if the first | |
1994 | * eligible zone has failed zone_reclaim recently. | |
1995 | */ | |
e5adfffc | 1996 | if (IS_ENABLED(CONFIG_NUMA) && zlc_active && |
cd38b115 MG |
1997 | !zlc_zone_worth_trying(zonelist, z, allowednodes)) |
1998 | continue; | |
1999 | ||
fa5e084e MG |
2000 | ret = zone_reclaim(zone, gfp_mask, order); |
2001 | switch (ret) { | |
2002 | case ZONE_RECLAIM_NOSCAN: | |
2003 | /* did not scan */ | |
cd38b115 | 2004 | continue; |
fa5e084e MG |
2005 | case ZONE_RECLAIM_FULL: |
2006 | /* scanned but unreclaimable */ | |
cd38b115 | 2007 | continue; |
fa5e084e MG |
2008 | default: |
2009 | /* did we reclaim enough */ | |
fed2719e | 2010 | if (zone_watermark_ok(zone, order, mark, |
fa5e084e | 2011 | classzone_idx, alloc_flags)) |
fed2719e MG |
2012 | goto try_this_zone; |
2013 | ||
2014 | /* | |
2015 | * Failed to reclaim enough to meet watermark. | |
2016 | * Only mark the zone full if checking the min | |
2017 | * watermark or if we failed to reclaim just | |
2018 | * 1<<order pages or else the page allocator | |
2019 | * fastpath will prematurely mark zones full | |
2020 | * when the watermark is between the low and | |
2021 | * min watermarks. | |
2022 | */ | |
2023 | if (((alloc_flags & ALLOC_WMARK_MASK) == ALLOC_WMARK_MIN) || | |
2024 | ret == ZONE_RECLAIM_SOME) | |
9276b1bc | 2025 | goto this_zone_full; |
fed2719e MG |
2026 | |
2027 | continue; | |
0798e519 | 2028 | } |
7fb1d9fc RS |
2029 | } |
2030 | ||
fa5e084e | 2031 | try_this_zone: |
3dd28266 MG |
2032 | page = buffered_rmqueue(preferred_zone, zone, order, |
2033 | gfp_mask, migratetype); | |
0798e519 | 2034 | if (page) |
7fb1d9fc | 2035 | break; |
9276b1bc | 2036 | this_zone_full: |
e5adfffc | 2037 | if (IS_ENABLED(CONFIG_NUMA)) |
9276b1bc | 2038 | zlc_mark_zone_full(zonelist, z); |
54a6eb5c | 2039 | } |
9276b1bc | 2040 | |
e5adfffc | 2041 | if (unlikely(IS_ENABLED(CONFIG_NUMA) && page == NULL && zlc_active)) { |
9276b1bc PJ |
2042 | /* Disable zlc cache for second zonelist scan */ |
2043 | zlc_active = 0; | |
2044 | goto zonelist_scan; | |
2045 | } | |
b121186a AS |
2046 | |
2047 | if (page) | |
2048 | /* | |
2049 | * page->pfmemalloc is set when ALLOC_NO_WATERMARKS was | |
2050 | * necessary to allocate the page. The expectation is | |
2051 | * that the caller is taking steps that will free more | |
2052 | * memory. The caller should avoid the page being used | |
2053 | * for !PFMEMALLOC purposes. | |
2054 | */ | |
2055 | page->pfmemalloc = !!(alloc_flags & ALLOC_NO_WATERMARKS); | |
2056 | ||
7fb1d9fc | 2057 | return page; |
753ee728 MH |
2058 | } |
2059 | ||
29423e77 DR |
2060 | /* |
2061 | * Large machines with many possible nodes should not always dump per-node | |
2062 | * meminfo in irq context. | |
2063 | */ | |
2064 | static inline bool should_suppress_show_mem(void) | |
2065 | { | |
2066 | bool ret = false; | |
2067 | ||
2068 | #if NODES_SHIFT > 8 | |
2069 | ret = in_interrupt(); | |
2070 | #endif | |
2071 | return ret; | |
2072 | } | |
2073 | ||
a238ab5b DH |
2074 | static DEFINE_RATELIMIT_STATE(nopage_rs, |
2075 | DEFAULT_RATELIMIT_INTERVAL, | |
2076 | DEFAULT_RATELIMIT_BURST); | |
2077 | ||
2078 | void warn_alloc_failed(gfp_t gfp_mask, int order, const char *fmt, ...) | |
2079 | { | |
a238ab5b DH |
2080 | unsigned int filter = SHOW_MEM_FILTER_NODES; |
2081 | ||
c0a32fc5 SG |
2082 | if ((gfp_mask & __GFP_NOWARN) || !__ratelimit(&nopage_rs) || |
2083 | debug_guardpage_minorder() > 0) | |
a238ab5b DH |
2084 | return; |
2085 | ||
2086 | /* | |
2087 | * This documents exceptions given to allocations in certain | |
2088 | * contexts that are allowed to allocate outside current's set | |
2089 | * of allowed nodes. | |
2090 | */ | |
2091 | if (!(gfp_mask & __GFP_NOMEMALLOC)) | |
2092 | if (test_thread_flag(TIF_MEMDIE) || | |
2093 | (current->flags & (PF_MEMALLOC | PF_EXITING))) | |
2094 | filter &= ~SHOW_MEM_FILTER_NODES; | |
2095 | if (in_interrupt() || !(gfp_mask & __GFP_WAIT)) | |
2096 | filter &= ~SHOW_MEM_FILTER_NODES; | |
2097 | ||
2098 | if (fmt) { | |
3ee9a4f0 JP |
2099 | struct va_format vaf; |
2100 | va_list args; | |
2101 | ||
a238ab5b | 2102 | va_start(args, fmt); |
3ee9a4f0 JP |
2103 | |
2104 | vaf.fmt = fmt; | |
2105 | vaf.va = &args; | |
2106 | ||
2107 | pr_warn("%pV", &vaf); | |
2108 | ||
a238ab5b DH |
2109 | va_end(args); |
2110 | } | |
2111 | ||
3ee9a4f0 JP |
2112 | pr_warn("%s: page allocation failure: order:%d, mode:0x%x\n", |
2113 | current->comm, order, gfp_mask); | |
a238ab5b DH |
2114 | |
2115 | dump_stack(); | |
2116 | if (!should_suppress_show_mem()) | |
2117 | show_mem(filter); | |
2118 | } | |
2119 | ||
11e33f6a MG |
2120 | static inline int |
2121 | should_alloc_retry(gfp_t gfp_mask, unsigned int order, | |
f90ac398 | 2122 | unsigned long did_some_progress, |
11e33f6a | 2123 | unsigned long pages_reclaimed) |
1da177e4 | 2124 | { |
11e33f6a MG |
2125 | /* Do not loop if specifically requested */ |
2126 | if (gfp_mask & __GFP_NORETRY) | |
2127 | return 0; | |
1da177e4 | 2128 | |
f90ac398 MG |
2129 | /* Always retry if specifically requested */ |
2130 | if (gfp_mask & __GFP_NOFAIL) | |
2131 | return 1; | |
2132 | ||
2133 | /* | |
2134 | * Suspend converts GFP_KERNEL to __GFP_WAIT which can prevent reclaim | |
2135 | * making forward progress without invoking OOM. Suspend also disables | |
2136 | * storage devices so kswapd will not help. Bail if we are suspending. | |
2137 | */ | |
2138 | if (!did_some_progress && pm_suspended_storage()) | |
2139 | return 0; | |
2140 | ||
11e33f6a MG |
2141 | /* |
2142 | * In this implementation, order <= PAGE_ALLOC_COSTLY_ORDER | |
2143 | * means __GFP_NOFAIL, but that may not be true in other | |
2144 | * implementations. | |
2145 | */ | |
2146 | if (order <= PAGE_ALLOC_COSTLY_ORDER) | |
2147 | return 1; | |
2148 | ||
2149 | /* | |
2150 | * For order > PAGE_ALLOC_COSTLY_ORDER, if __GFP_REPEAT is | |
2151 | * specified, then we retry until we no longer reclaim any pages | |
2152 | * (above), or we've reclaimed an order of pages at least as | |
2153 | * large as the allocation's order. In both cases, if the | |
2154 | * allocation still fails, we stop retrying. | |
2155 | */ | |
2156 | if (gfp_mask & __GFP_REPEAT && pages_reclaimed < (1 << order)) | |
2157 | return 1; | |
cf40bd16 | 2158 | |
11e33f6a MG |
2159 | return 0; |
2160 | } | |
933e312e | 2161 | |
11e33f6a MG |
2162 | static inline struct page * |
2163 | __alloc_pages_may_oom(gfp_t gfp_mask, unsigned int order, | |
2164 | struct zonelist *zonelist, enum zone_type high_zoneidx, | |
3dd28266 MG |
2165 | nodemask_t *nodemask, struct zone *preferred_zone, |
2166 | int migratetype) | |
11e33f6a MG |
2167 | { |
2168 | struct page *page; | |
2169 | ||
2170 | /* Acquire the OOM killer lock for the zones in zonelist */ | |
ff321fea | 2171 | if (!try_set_zonelist_oom(zonelist, gfp_mask)) { |
11e33f6a | 2172 | schedule_timeout_uninterruptible(1); |
1da177e4 LT |
2173 | return NULL; |
2174 | } | |
6b1de916 | 2175 | |
11e33f6a MG |
2176 | /* |
2177 | * Go through the zonelist yet one more time, keep very high watermark | |
2178 | * here, this is only to catch a parallel oom killing, we must fail if | |
2179 | * we're still under heavy pressure. | |
2180 | */ | |
2181 | page = get_page_from_freelist(gfp_mask|__GFP_HARDWALL, nodemask, | |
2182 | order, zonelist, high_zoneidx, | |
5117f45d | 2183 | ALLOC_WMARK_HIGH|ALLOC_CPUSET, |
3dd28266 | 2184 | preferred_zone, migratetype); |
7fb1d9fc | 2185 | if (page) |
11e33f6a MG |
2186 | goto out; |
2187 | ||
4365a567 KH |
2188 | if (!(gfp_mask & __GFP_NOFAIL)) { |
2189 | /* The OOM killer will not help higher order allocs */ | |
2190 | if (order > PAGE_ALLOC_COSTLY_ORDER) | |
2191 | goto out; | |
03668b3c DR |
2192 | /* The OOM killer does not needlessly kill tasks for lowmem */ |
2193 | if (high_zoneidx < ZONE_NORMAL) | |
2194 | goto out; | |
4365a567 KH |
2195 | /* |
2196 | * GFP_THISNODE contains __GFP_NORETRY and we never hit this. | |
2197 | * Sanity check for bare calls of __GFP_THISNODE, not real OOM. | |
2198 | * The caller should handle page allocation failure by itself if | |
2199 | * it specifies __GFP_THISNODE. | |
2200 | * Note: Hugepage uses it but will hit PAGE_ALLOC_COSTLY_ORDER. | |
2201 | */ | |
2202 | if (gfp_mask & __GFP_THISNODE) | |
2203 | goto out; | |
2204 | } | |
11e33f6a | 2205 | /* Exhausted what can be done so it's blamo time */ |
08ab9b10 | 2206 | out_of_memory(zonelist, gfp_mask, order, nodemask, false); |
11e33f6a MG |
2207 | |
2208 | out: | |
2209 | clear_zonelist_oom(zonelist, gfp_mask); | |
2210 | return page; | |
2211 | } | |
2212 | ||
56de7263 MG |
2213 | #ifdef CONFIG_COMPACTION |
2214 | /* Try memory compaction for high-order allocations before reclaim */ | |
2215 | static struct page * | |
2216 | __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order, | |
2217 | struct zonelist *zonelist, enum zone_type high_zoneidx, | |
2218 | nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone, | |
66199712 | 2219 | int migratetype, bool sync_migration, |
c67fe375 | 2220 | bool *contended_compaction, bool *deferred_compaction, |
66199712 | 2221 | unsigned long *did_some_progress) |
56de7263 | 2222 | { |
66199712 | 2223 | if (!order) |
56de7263 MG |
2224 | return NULL; |
2225 | ||
aff62249 | 2226 | if (compaction_deferred(preferred_zone, order)) { |
66199712 MG |
2227 | *deferred_compaction = true; |
2228 | return NULL; | |
2229 | } | |
2230 | ||
c06b1fca | 2231 | current->flags |= PF_MEMALLOC; |
56de7263 | 2232 | *did_some_progress = try_to_compact_pages(zonelist, order, gfp_mask, |
c67fe375 | 2233 | nodemask, sync_migration, |
8fb74b9f | 2234 | contended_compaction); |
c06b1fca | 2235 | current->flags &= ~PF_MEMALLOC; |
56de7263 | 2236 | |
1fb3f8ca | 2237 | if (*did_some_progress != COMPACT_SKIPPED) { |
8fb74b9f MG |
2238 | struct page *page; |
2239 | ||
56de7263 MG |
2240 | /* Page migration frees to the PCP lists but we want merging */ |
2241 | drain_pages(get_cpu()); | |
2242 | put_cpu(); | |
2243 | ||
2244 | page = get_page_from_freelist(gfp_mask, nodemask, | |
2245 | order, zonelist, high_zoneidx, | |
cfd19c5a MG |
2246 | alloc_flags & ~ALLOC_NO_WATERMARKS, |
2247 | preferred_zone, migratetype); | |
56de7263 | 2248 | if (page) { |
62997027 | 2249 | preferred_zone->compact_blockskip_flush = false; |
de6c60a6 | 2250 | compaction_defer_reset(preferred_zone, order, true); |
56de7263 MG |
2251 | count_vm_event(COMPACTSUCCESS); |
2252 | return page; | |
2253 | } | |
2254 | ||
2255 | /* | |
2256 | * It's bad if compaction run occurs and fails. | |
2257 | * The most likely reason is that pages exist, | |
2258 | * but not enough to satisfy watermarks. | |
2259 | */ | |
2260 | count_vm_event(COMPACTFAIL); | |
66199712 MG |
2261 | |
2262 | /* | |
2263 | * As async compaction considers a subset of pageblocks, only | |
2264 | * defer if the failure was a sync compaction failure. | |
2265 | */ | |
2266 | if (sync_migration) | |
aff62249 | 2267 | defer_compaction(preferred_zone, order); |
56de7263 MG |
2268 | |
2269 | cond_resched(); | |
2270 | } | |
2271 | ||
2272 | return NULL; | |
2273 | } | |
2274 | #else | |
2275 | static inline struct page * | |
2276 | __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order, | |
2277 | struct zonelist *zonelist, enum zone_type high_zoneidx, | |
2278 | nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone, | |
66199712 | 2279 | int migratetype, bool sync_migration, |
c67fe375 | 2280 | bool *contended_compaction, bool *deferred_compaction, |
66199712 | 2281 | unsigned long *did_some_progress) |
56de7263 MG |
2282 | { |
2283 | return NULL; | |
2284 | } | |
2285 | #endif /* CONFIG_COMPACTION */ | |
2286 | ||
bba90710 MS |
2287 | /* Perform direct synchronous page reclaim */ |
2288 | static int | |
2289 | __perform_reclaim(gfp_t gfp_mask, unsigned int order, struct zonelist *zonelist, | |
2290 | nodemask_t *nodemask) | |
11e33f6a | 2291 | { |
11e33f6a | 2292 | struct reclaim_state reclaim_state; |
bba90710 | 2293 | int progress; |
11e33f6a MG |
2294 | |
2295 | cond_resched(); | |
2296 | ||
2297 | /* We now go into synchronous reclaim */ | |
2298 | cpuset_memory_pressure_bump(); | |
c06b1fca | 2299 | current->flags |= PF_MEMALLOC; |
11e33f6a MG |
2300 | lockdep_set_current_reclaim_state(gfp_mask); |
2301 | reclaim_state.reclaimed_slab = 0; | |
c06b1fca | 2302 | current->reclaim_state = &reclaim_state; |
11e33f6a | 2303 | |
bba90710 | 2304 | progress = try_to_free_pages(zonelist, order, gfp_mask, nodemask); |
11e33f6a | 2305 | |
c06b1fca | 2306 | current->reclaim_state = NULL; |
11e33f6a | 2307 | lockdep_clear_current_reclaim_state(); |
c06b1fca | 2308 | current->flags &= ~PF_MEMALLOC; |
11e33f6a MG |
2309 | |
2310 | cond_resched(); | |
2311 | ||
bba90710 MS |
2312 | return progress; |
2313 | } | |
2314 | ||
2315 | /* The really slow allocator path where we enter direct reclaim */ | |
2316 | static inline struct page * | |
2317 | __alloc_pages_direct_reclaim(gfp_t gfp_mask, unsigned int order, | |
2318 | struct zonelist *zonelist, enum zone_type high_zoneidx, | |
2319 | nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone, | |
2320 | int migratetype, unsigned long *did_some_progress) | |
2321 | { | |
2322 | struct page *page = NULL; | |
2323 | bool drained = false; | |
2324 | ||
2325 | *did_some_progress = __perform_reclaim(gfp_mask, order, zonelist, | |
2326 | nodemask); | |
9ee493ce MG |
2327 | if (unlikely(!(*did_some_progress))) |
2328 | return NULL; | |
11e33f6a | 2329 | |
76d3fbf8 | 2330 | /* After successful reclaim, reconsider all zones for allocation */ |
e5adfffc | 2331 | if (IS_ENABLED(CONFIG_NUMA)) |
76d3fbf8 MG |
2332 | zlc_clear_zones_full(zonelist); |
2333 | ||
9ee493ce MG |
2334 | retry: |
2335 | page = get_page_from_freelist(gfp_mask, nodemask, order, | |
5117f45d | 2336 | zonelist, high_zoneidx, |
cfd19c5a MG |
2337 | alloc_flags & ~ALLOC_NO_WATERMARKS, |
2338 | preferred_zone, migratetype); | |
9ee493ce MG |
2339 | |
2340 | /* | |
2341 | * If an allocation failed after direct reclaim, it could be because | |
2342 | * pages are pinned on the per-cpu lists. Drain them and try again | |
2343 | */ | |
2344 | if (!page && !drained) { | |
2345 | drain_all_pages(); | |
2346 | drained = true; | |
2347 | goto retry; | |
2348 | } | |
2349 | ||
11e33f6a MG |
2350 | return page; |
2351 | } | |
2352 | ||
1da177e4 | 2353 | /* |
11e33f6a MG |
2354 | * This is called in the allocator slow-path if the allocation request is of |
2355 | * sufficient urgency to ignore watermarks and take other desperate measures | |
1da177e4 | 2356 | */ |
11e33f6a MG |
2357 | static inline struct page * |
2358 | __alloc_pages_high_priority(gfp_t gfp_mask, unsigned int order, | |
2359 | struct zonelist *zonelist, enum zone_type high_zoneidx, | |
3dd28266 MG |
2360 | nodemask_t *nodemask, struct zone *preferred_zone, |
2361 | int migratetype) | |
11e33f6a MG |
2362 | { |
2363 | struct page *page; | |
2364 | ||
2365 | do { | |
2366 | page = get_page_from_freelist(gfp_mask, nodemask, order, | |
5117f45d | 2367 | zonelist, high_zoneidx, ALLOC_NO_WATERMARKS, |
3dd28266 | 2368 | preferred_zone, migratetype); |
11e33f6a MG |
2369 | |
2370 | if (!page && gfp_mask & __GFP_NOFAIL) | |
0e093d99 | 2371 | wait_iff_congested(preferred_zone, BLK_RW_ASYNC, HZ/50); |
11e33f6a MG |
2372 | } while (!page && (gfp_mask & __GFP_NOFAIL)); |
2373 | ||
2374 | return page; | |
2375 | } | |
2376 | ||
3a025760 JW |
2377 | static void reset_alloc_batches(struct zonelist *zonelist, |
2378 | enum zone_type high_zoneidx, | |
2379 | struct zone *preferred_zone) | |
1da177e4 | 2380 | { |
dd1a239f MG |
2381 | struct zoneref *z; |
2382 | struct zone *zone; | |
1da177e4 | 2383 | |
81c0a2bb | 2384 | for_each_zone_zonelist(zone, z, zonelist, high_zoneidx) { |
81c0a2bb JW |
2385 | /* |
2386 | * Only reset the batches of zones that were actually | |
3a025760 JW |
2387 | * considered in the fairness pass, we don't want to |
2388 | * trash fairness information for zones that are not | |
81c0a2bb JW |
2389 | * actually part of this zonelist's round-robin cycle. |
2390 | */ | |
fff4068c | 2391 | if (!zone_local(preferred_zone, zone)) |
81c0a2bb JW |
2392 | continue; |
2393 | mod_zone_page_state(zone, NR_ALLOC_BATCH, | |
3a025760 JW |
2394 | high_wmark_pages(zone) - low_wmark_pages(zone) - |
2395 | atomic_long_read(&zone->vm_stat[NR_ALLOC_BATCH])); | |
81c0a2bb | 2396 | } |
11e33f6a | 2397 | } |
cf40bd16 | 2398 | |
3a025760 JW |
2399 | static void wake_all_kswapds(unsigned int order, |
2400 | struct zonelist *zonelist, | |
2401 | enum zone_type high_zoneidx, | |
2402 | struct zone *preferred_zone) | |
2403 | { | |
2404 | struct zoneref *z; | |
2405 | struct zone *zone; | |
2406 | ||
2407 | for_each_zone_zonelist(zone, z, zonelist, high_zoneidx) | |
2408 | wakeup_kswapd(zone, order, zone_idx(preferred_zone)); | |
2409 | } | |
2410 | ||
341ce06f PZ |
2411 | static inline int |
2412 | gfp_to_alloc_flags(gfp_t gfp_mask) | |
2413 | { | |
341ce06f PZ |
2414 | int alloc_flags = ALLOC_WMARK_MIN | ALLOC_CPUSET; |
2415 | const gfp_t wait = gfp_mask & __GFP_WAIT; | |
1da177e4 | 2416 | |
a56f57ff | 2417 | /* __GFP_HIGH is assumed to be the same as ALLOC_HIGH to save a branch. */ |
e6223a3b | 2418 | BUILD_BUG_ON(__GFP_HIGH != (__force gfp_t) ALLOC_HIGH); |
933e312e | 2419 | |
341ce06f PZ |
2420 | /* |
2421 | * The caller may dip into page reserves a bit more if the caller | |
2422 | * cannot run direct reclaim, or if the caller has realtime scheduling | |
2423 | * policy or is asking for __GFP_HIGH memory. GFP_ATOMIC requests will | |
2424 | * set both ALLOC_HARDER (!wait) and ALLOC_HIGH (__GFP_HIGH). | |
2425 | */ | |
e6223a3b | 2426 | alloc_flags |= (__force int) (gfp_mask & __GFP_HIGH); |
1da177e4 | 2427 | |
341ce06f | 2428 | if (!wait) { |
5c3240d9 AA |
2429 | /* |
2430 | * Not worth trying to allocate harder for | |
2431 | * __GFP_NOMEMALLOC even if it can't schedule. | |
2432 | */ | |
2433 | if (!(gfp_mask & __GFP_NOMEMALLOC)) | |
2434 | alloc_flags |= ALLOC_HARDER; | |
523b9458 | 2435 | /* |
341ce06f PZ |
2436 | * Ignore cpuset if GFP_ATOMIC (!wait) rather than fail alloc. |
2437 | * See also cpuset_zone_allowed() comment in kernel/cpuset.c. | |
523b9458 | 2438 | */ |
341ce06f | 2439 | alloc_flags &= ~ALLOC_CPUSET; |
c06b1fca | 2440 | } else if (unlikely(rt_task(current)) && !in_interrupt()) |
341ce06f PZ |
2441 | alloc_flags |= ALLOC_HARDER; |
2442 | ||
b37f1dd0 MG |
2443 | if (likely(!(gfp_mask & __GFP_NOMEMALLOC))) { |
2444 | if (gfp_mask & __GFP_MEMALLOC) | |
2445 | alloc_flags |= ALLOC_NO_WATERMARKS; | |
907aed48 MG |
2446 | else if (in_serving_softirq() && (current->flags & PF_MEMALLOC)) |
2447 | alloc_flags |= ALLOC_NO_WATERMARKS; | |
2448 | else if (!in_interrupt() && | |
2449 | ((current->flags & PF_MEMALLOC) || | |
2450 | unlikely(test_thread_flag(TIF_MEMDIE)))) | |
341ce06f | 2451 | alloc_flags |= ALLOC_NO_WATERMARKS; |
1da177e4 | 2452 | } |
d95ea5d1 BZ |
2453 | #ifdef CONFIG_CMA |
2454 | if (allocflags_to_migratetype(gfp_mask) == MIGRATE_MOVABLE) | |
2455 | alloc_flags |= ALLOC_CMA; | |
2456 | #endif | |
341ce06f PZ |
2457 | return alloc_flags; |
2458 | } | |
2459 | ||
072bb0aa MG |
2460 | bool gfp_pfmemalloc_allowed(gfp_t gfp_mask) |
2461 | { | |
b37f1dd0 | 2462 | return !!(gfp_to_alloc_flags(gfp_mask) & ALLOC_NO_WATERMARKS); |
072bb0aa MG |
2463 | } |
2464 | ||
11e33f6a MG |
2465 | static inline struct page * |
2466 | __alloc_pages_slowpath(gfp_t gfp_mask, unsigned int order, | |
2467 | struct zonelist *zonelist, enum zone_type high_zoneidx, | |
3dd28266 MG |
2468 | nodemask_t *nodemask, struct zone *preferred_zone, |
2469 | int migratetype) | |
11e33f6a MG |
2470 | { |
2471 | const gfp_t wait = gfp_mask & __GFP_WAIT; | |
2472 | struct page *page = NULL; | |
2473 | int alloc_flags; | |
2474 | unsigned long pages_reclaimed = 0; | |
2475 | unsigned long did_some_progress; | |
77f1fe6b | 2476 | bool sync_migration = false; |
66199712 | 2477 | bool deferred_compaction = false; |
c67fe375 | 2478 | bool contended_compaction = false; |
1da177e4 | 2479 | |
72807a74 MG |
2480 | /* |
2481 | * In the slowpath, we sanity check order to avoid ever trying to | |
2482 | * reclaim >= MAX_ORDER areas which will never succeed. Callers may | |
2483 | * be using allocators in order of preference for an area that is | |
2484 | * too large. | |
2485 | */ | |
1fc28b70 MG |
2486 | if (order >= MAX_ORDER) { |
2487 | WARN_ON_ONCE(!(gfp_mask & __GFP_NOWARN)); | |
72807a74 | 2488 | return NULL; |
1fc28b70 | 2489 | } |
1da177e4 | 2490 | |
952f3b51 CL |
2491 | /* |
2492 | * GFP_THISNODE (meaning __GFP_THISNODE, __GFP_NORETRY and | |
2493 | * __GFP_NOWARN set) should not cause reclaim since the subsystem | |
2494 | * (f.e. slab) using GFP_THISNODE may choose to trigger reclaim | |
2495 | * using a larger set of nodes after it has established that the | |
2496 | * allowed per node queues are empty and that nodes are | |
2497 | * over allocated. | |
2498 | */ | |
3a025760 JW |
2499 | if (IS_ENABLED(CONFIG_NUMA) && |
2500 | (gfp_mask & GFP_THISNODE) == GFP_THISNODE) | |
952f3b51 CL |
2501 | goto nopage; |
2502 | ||
cc4a6851 | 2503 | restart: |
3a025760 JW |
2504 | if (!(gfp_mask & __GFP_NO_KSWAPD)) |
2505 | wake_all_kswapds(order, zonelist, high_zoneidx, preferred_zone); | |
1da177e4 | 2506 | |
9bf2229f | 2507 | /* |
7fb1d9fc RS |
2508 | * OK, we're below the kswapd watermark and have kicked background |
2509 | * reclaim. Now things get more complex, so set up alloc_flags according | |
2510 | * to how we want to proceed. | |
9bf2229f | 2511 | */ |
341ce06f | 2512 | alloc_flags = gfp_to_alloc_flags(gfp_mask); |
1da177e4 | 2513 | |
f33261d7 DR |
2514 | /* |
2515 | * Find the true preferred zone if the allocation is unconstrained by | |
2516 | * cpusets. | |
2517 | */ | |
2518 | if (!(alloc_flags & ALLOC_CPUSET) && !nodemask) | |
2519 | first_zones_zonelist(zonelist, high_zoneidx, NULL, | |
2520 | &preferred_zone); | |
2521 | ||
cfa54a0f | 2522 | rebalance: |
341ce06f | 2523 | /* This is the last chance, in general, before the goto nopage. */ |
19770b32 | 2524 | page = get_page_from_freelist(gfp_mask, nodemask, order, zonelist, |
341ce06f PZ |
2525 | high_zoneidx, alloc_flags & ~ALLOC_NO_WATERMARKS, |
2526 | preferred_zone, migratetype); | |
7fb1d9fc RS |
2527 | if (page) |
2528 | goto got_pg; | |
1da177e4 | 2529 | |
11e33f6a | 2530 | /* Allocate without watermarks if the context allows */ |
341ce06f | 2531 | if (alloc_flags & ALLOC_NO_WATERMARKS) { |
183f6371 MG |
2532 | /* |
2533 | * Ignore mempolicies if ALLOC_NO_WATERMARKS on the grounds | |
2534 | * the allocation is high priority and these type of | |
2535 | * allocations are system rather than user orientated | |
2536 | */ | |
2537 | zonelist = node_zonelist(numa_node_id(), gfp_mask); | |
2538 | ||
341ce06f PZ |
2539 | page = __alloc_pages_high_priority(gfp_mask, order, |
2540 | zonelist, high_zoneidx, nodemask, | |
2541 | preferred_zone, migratetype); | |
cfd19c5a | 2542 | if (page) { |
341ce06f | 2543 | goto got_pg; |
cfd19c5a | 2544 | } |
1da177e4 LT |
2545 | } |
2546 | ||
2547 | /* Atomic allocations - we can't balance anything */ | |
aed0a0e3 DR |
2548 | if (!wait) { |
2549 | /* | |
2550 | * All existing users of the deprecated __GFP_NOFAIL are | |
2551 | * blockable, so warn of any new users that actually allow this | |
2552 | * type of allocation to fail. | |
2553 | */ | |
2554 | WARN_ON_ONCE(gfp_mask & __GFP_NOFAIL); | |
1da177e4 | 2555 | goto nopage; |
aed0a0e3 | 2556 | } |
1da177e4 | 2557 | |
341ce06f | 2558 | /* Avoid recursion of direct reclaim */ |
c06b1fca | 2559 | if (current->flags & PF_MEMALLOC) |
341ce06f PZ |
2560 | goto nopage; |
2561 | ||
6583bb64 DR |
2562 | /* Avoid allocations with no watermarks from looping endlessly */ |
2563 | if (test_thread_flag(TIF_MEMDIE) && !(gfp_mask & __GFP_NOFAIL)) | |
2564 | goto nopage; | |
2565 | ||
77f1fe6b MG |
2566 | /* |
2567 | * Try direct compaction. The first pass is asynchronous. Subsequent | |
2568 | * attempts after direct reclaim are synchronous | |
2569 | */ | |
56de7263 MG |
2570 | page = __alloc_pages_direct_compact(gfp_mask, order, |
2571 | zonelist, high_zoneidx, | |
2572 | nodemask, | |
2573 | alloc_flags, preferred_zone, | |
66199712 | 2574 | migratetype, sync_migration, |
c67fe375 | 2575 | &contended_compaction, |
66199712 MG |
2576 | &deferred_compaction, |
2577 | &did_some_progress); | |
56de7263 MG |
2578 | if (page) |
2579 | goto got_pg; | |
c6a140bf | 2580 | sync_migration = true; |
56de7263 | 2581 | |
31f8d42d LT |
2582 | /* |
2583 | * If compaction is deferred for high-order allocations, it is because | |
2584 | * sync compaction recently failed. In this is the case and the caller | |
2585 | * requested a movable allocation that does not heavily disrupt the | |
2586 | * system then fail the allocation instead of entering direct reclaim. | |
2587 | */ | |
2588 | if ((deferred_compaction || contended_compaction) && | |
caf49191 | 2589 | (gfp_mask & __GFP_NO_KSWAPD)) |
31f8d42d | 2590 | goto nopage; |
66199712 | 2591 | |
11e33f6a MG |
2592 | /* Try direct reclaim and then allocating */ |
2593 | page = __alloc_pages_direct_reclaim(gfp_mask, order, | |
2594 | zonelist, high_zoneidx, | |
2595 | nodemask, | |
5117f45d | 2596 | alloc_flags, preferred_zone, |
3dd28266 | 2597 | migratetype, &did_some_progress); |
11e33f6a MG |
2598 | if (page) |
2599 | goto got_pg; | |
1da177e4 | 2600 | |
e33c3b5e | 2601 | /* |
11e33f6a MG |
2602 | * If we failed to make any progress reclaiming, then we are |
2603 | * running out of options and have to consider going OOM | |
e33c3b5e | 2604 | */ |
11e33f6a | 2605 | if (!did_some_progress) { |
b9921ecd | 2606 | if (oom_gfp_allowed(gfp_mask)) { |
7f33d49a RW |
2607 | if (oom_killer_disabled) |
2608 | goto nopage; | |
29fd66d2 DR |
2609 | /* Coredumps can quickly deplete all memory reserves */ |
2610 | if ((current->flags & PF_DUMPCORE) && | |
2611 | !(gfp_mask & __GFP_NOFAIL)) | |
2612 | goto nopage; | |
11e33f6a MG |
2613 | page = __alloc_pages_may_oom(gfp_mask, order, |
2614 | zonelist, high_zoneidx, | |
3dd28266 MG |
2615 | nodemask, preferred_zone, |
2616 | migratetype); | |
11e33f6a MG |
2617 | if (page) |
2618 | goto got_pg; | |
1da177e4 | 2619 | |
03668b3c DR |
2620 | if (!(gfp_mask & __GFP_NOFAIL)) { |
2621 | /* | |
2622 | * The oom killer is not called for high-order | |
2623 | * allocations that may fail, so if no progress | |
2624 | * is being made, there are no other options and | |
2625 | * retrying is unlikely to help. | |
2626 | */ | |
2627 | if (order > PAGE_ALLOC_COSTLY_ORDER) | |
2628 | goto nopage; | |
2629 | /* | |
2630 | * The oom killer is not called for lowmem | |
2631 | * allocations to prevent needlessly killing | |
2632 | * innocent tasks. | |
2633 | */ | |
2634 | if (high_zoneidx < ZONE_NORMAL) | |
2635 | goto nopage; | |
2636 | } | |
e2c55dc8 | 2637 | |
ff0ceb9d DR |
2638 | goto restart; |
2639 | } | |
1da177e4 LT |
2640 | } |
2641 | ||
11e33f6a | 2642 | /* Check if we should retry the allocation */ |
a41f24ea | 2643 | pages_reclaimed += did_some_progress; |
f90ac398 MG |
2644 | if (should_alloc_retry(gfp_mask, order, did_some_progress, |
2645 | pages_reclaimed)) { | |
11e33f6a | 2646 | /* Wait for some write requests to complete then retry */ |
0e093d99 | 2647 | wait_iff_congested(preferred_zone, BLK_RW_ASYNC, HZ/50); |
1da177e4 | 2648 | goto rebalance; |
3e7d3449 MG |
2649 | } else { |
2650 | /* | |
2651 | * High-order allocations do not necessarily loop after | |
2652 | * direct reclaim and reclaim/compaction depends on compaction | |
2653 | * being called after reclaim so call directly if necessary | |
2654 | */ | |
2655 | page = __alloc_pages_direct_compact(gfp_mask, order, | |
2656 | zonelist, high_zoneidx, | |
2657 | nodemask, | |
2658 | alloc_flags, preferred_zone, | |
66199712 | 2659 | migratetype, sync_migration, |
c67fe375 | 2660 | &contended_compaction, |
66199712 MG |
2661 | &deferred_compaction, |
2662 | &did_some_progress); | |
3e7d3449 MG |
2663 | if (page) |
2664 | goto got_pg; | |
1da177e4 LT |
2665 | } |
2666 | ||
2667 | nopage: | |
a238ab5b | 2668 | warn_alloc_failed(gfp_mask, order, NULL); |
b1eeab67 | 2669 | return page; |
1da177e4 | 2670 | got_pg: |
b1eeab67 VN |
2671 | if (kmemcheck_enabled) |
2672 | kmemcheck_pagealloc_alloc(page, order, gfp_mask); | |
11e33f6a | 2673 | |
072bb0aa | 2674 | return page; |
1da177e4 | 2675 | } |
11e33f6a MG |
2676 | |
2677 | /* | |
2678 | * This is the 'heart' of the zoned buddy allocator. | |
2679 | */ | |
2680 | struct page * | |
2681 | __alloc_pages_nodemask(gfp_t gfp_mask, unsigned int order, | |
2682 | struct zonelist *zonelist, nodemask_t *nodemask) | |
2683 | { | |
2684 | enum zone_type high_zoneidx = gfp_zone(gfp_mask); | |
5117f45d | 2685 | struct zone *preferred_zone; |
cc9a6c87 | 2686 | struct page *page = NULL; |
3dd28266 | 2687 | int migratetype = allocflags_to_migratetype(gfp_mask); |
cc9a6c87 | 2688 | unsigned int cpuset_mems_cookie; |
3a025760 | 2689 | int alloc_flags = ALLOC_WMARK_LOW|ALLOC_CPUSET|ALLOC_FAIR; |
11e33f6a | 2690 | |
dcce284a BH |
2691 | gfp_mask &= gfp_allowed_mask; |
2692 | ||
11e33f6a MG |
2693 | lockdep_trace_alloc(gfp_mask); |
2694 | ||
2695 | might_sleep_if(gfp_mask & __GFP_WAIT); | |
2696 | ||
2697 | if (should_fail_alloc_page(gfp_mask, order)) | |
2698 | return NULL; | |
2699 | ||
2700 | /* | |
2701 | * Check the zones suitable for the gfp_mask contain at least one | |
2702 | * valid zone. It's possible to have an empty zonelist as a result | |
2703 | * of GFP_THISNODE and a memoryless node | |
2704 | */ | |
2705 | if (unlikely(!zonelist->_zonerefs->zone)) | |
2706 | return NULL; | |
2707 | ||
cc9a6c87 | 2708 | retry_cpuset: |
d26914d1 | 2709 | cpuset_mems_cookie = read_mems_allowed_begin(); |
cc9a6c87 | 2710 | |
5117f45d | 2711 | /* The preferred zone is used for statistics later */ |
f33261d7 DR |
2712 | first_zones_zonelist(zonelist, high_zoneidx, |
2713 | nodemask ? : &cpuset_current_mems_allowed, | |
2714 | &preferred_zone); | |
cc9a6c87 MG |
2715 | if (!preferred_zone) |
2716 | goto out; | |
5117f45d | 2717 | |
d95ea5d1 BZ |
2718 | #ifdef CONFIG_CMA |
2719 | if (allocflags_to_migratetype(gfp_mask) == MIGRATE_MOVABLE) | |
2720 | alloc_flags |= ALLOC_CMA; | |
2721 | #endif | |
3a025760 | 2722 | retry: |
5117f45d | 2723 | /* First allocation attempt */ |
11e33f6a | 2724 | page = get_page_from_freelist(gfp_mask|__GFP_HARDWALL, nodemask, order, |
d95ea5d1 | 2725 | zonelist, high_zoneidx, alloc_flags, |
3dd28266 | 2726 | preferred_zone, migratetype); |
21caf2fc | 2727 | if (unlikely(!page)) { |
3a025760 JW |
2728 | /* |
2729 | * The first pass makes sure allocations are spread | |
2730 | * fairly within the local node. However, the local | |
2731 | * node might have free pages left after the fairness | |
2732 | * batches are exhausted, and remote zones haven't | |
2733 | * even been considered yet. Try once more without | |
2734 | * fairness, and include remote zones now, before | |
2735 | * entering the slowpath and waking kswapd: prefer | |
2736 | * spilling to a remote zone over swapping locally. | |
2737 | */ | |
2738 | if (alloc_flags & ALLOC_FAIR) { | |
2739 | reset_alloc_batches(zonelist, high_zoneidx, | |
2740 | preferred_zone); | |
2741 | alloc_flags &= ~ALLOC_FAIR; | |
2742 | goto retry; | |
2743 | } | |
21caf2fc ML |
2744 | /* |
2745 | * Runtime PM, block IO and its error handling path | |
2746 | * can deadlock because I/O on the device might not | |
2747 | * complete. | |
2748 | */ | |
2749 | gfp_mask = memalloc_noio_flags(gfp_mask); | |
11e33f6a | 2750 | page = __alloc_pages_slowpath(gfp_mask, order, |
5117f45d | 2751 | zonelist, high_zoneidx, nodemask, |
3dd28266 | 2752 | preferred_zone, migratetype); |
21caf2fc | 2753 | } |
11e33f6a | 2754 | |
4b4f278c | 2755 | trace_mm_page_alloc(page, order, gfp_mask, migratetype); |
cc9a6c87 MG |
2756 | |
2757 | out: | |
2758 | /* | |
2759 | * When updating a task's mems_allowed, it is possible to race with | |
2760 | * parallel threads in such a way that an allocation can fail while | |
2761 | * the mask is being updated. If a page allocation is about to fail, | |
2762 | * check if the cpuset changed during allocation and if so, retry. | |
2763 | */ | |
d26914d1 | 2764 | if (unlikely(!page && read_mems_allowed_retry(cpuset_mems_cookie))) |
cc9a6c87 MG |
2765 | goto retry_cpuset; |
2766 | ||
11e33f6a | 2767 | return page; |
1da177e4 | 2768 | } |
d239171e | 2769 | EXPORT_SYMBOL(__alloc_pages_nodemask); |
1da177e4 LT |
2770 | |
2771 | /* | |
2772 | * Common helper functions. | |
2773 | */ | |
920c7a5d | 2774 | unsigned long __get_free_pages(gfp_t gfp_mask, unsigned int order) |
1da177e4 | 2775 | { |
945a1113 AM |
2776 | struct page *page; |
2777 | ||
2778 | /* | |
2779 | * __get_free_pages() returns a 32-bit address, which cannot represent | |
2780 | * a highmem page | |
2781 | */ | |
2782 | VM_BUG_ON((gfp_mask & __GFP_HIGHMEM) != 0); | |
2783 | ||
1da177e4 LT |
2784 | page = alloc_pages(gfp_mask, order); |
2785 | if (!page) | |
2786 | return 0; | |
2787 | return (unsigned long) page_address(page); | |
2788 | } | |
1da177e4 LT |
2789 | EXPORT_SYMBOL(__get_free_pages); |
2790 | ||
920c7a5d | 2791 | unsigned long get_zeroed_page(gfp_t gfp_mask) |
1da177e4 | 2792 | { |
945a1113 | 2793 | return __get_free_pages(gfp_mask | __GFP_ZERO, 0); |
1da177e4 | 2794 | } |
1da177e4 LT |
2795 | EXPORT_SYMBOL(get_zeroed_page); |
2796 | ||
920c7a5d | 2797 | void __free_pages(struct page *page, unsigned int order) |
1da177e4 | 2798 | { |
b5810039 | 2799 | if (put_page_testzero(page)) { |
1da177e4 | 2800 | if (order == 0) |
fc91668e | 2801 | free_hot_cold_page(page, 0); |
1da177e4 LT |
2802 | else |
2803 | __free_pages_ok(page, order); | |
2804 | } | |
2805 | } | |
2806 | ||
2807 | EXPORT_SYMBOL(__free_pages); | |
2808 | ||
920c7a5d | 2809 | void free_pages(unsigned long addr, unsigned int order) |
1da177e4 LT |
2810 | { |
2811 | if (addr != 0) { | |
725d704e | 2812 | VM_BUG_ON(!virt_addr_valid((void *)addr)); |
1da177e4 LT |
2813 | __free_pages(virt_to_page((void *)addr), order); |
2814 | } | |
2815 | } | |
2816 | ||
2817 | EXPORT_SYMBOL(free_pages); | |
2818 | ||
6a1a0d3b | 2819 | /* |
52383431 VD |
2820 | * alloc_kmem_pages charges newly allocated pages to the kmem resource counter |
2821 | * of the current memory cgroup. | |
6a1a0d3b | 2822 | * |
52383431 VD |
2823 | * It should be used when the caller would like to use kmalloc, but since the |
2824 | * allocation is large, it has to fall back to the page allocator. | |
2825 | */ | |
2826 | struct page *alloc_kmem_pages(gfp_t gfp_mask, unsigned int order) | |
2827 | { | |
2828 | struct page *page; | |
2829 | struct mem_cgroup *memcg = NULL; | |
2830 | ||
2831 | if (!memcg_kmem_newpage_charge(gfp_mask, &memcg, order)) | |
2832 | return NULL; | |
2833 | page = alloc_pages(gfp_mask, order); | |
2834 | memcg_kmem_commit_charge(page, memcg, order); | |
2835 | return page; | |
2836 | } | |
2837 | ||
2838 | struct page *alloc_kmem_pages_node(int nid, gfp_t gfp_mask, unsigned int order) | |
2839 | { | |
2840 | struct page *page; | |
2841 | struct mem_cgroup *memcg = NULL; | |
2842 | ||
2843 | if (!memcg_kmem_newpage_charge(gfp_mask, &memcg, order)) | |
2844 | return NULL; | |
2845 | page = alloc_pages_node(nid, gfp_mask, order); | |
2846 | memcg_kmem_commit_charge(page, memcg, order); | |
2847 | return page; | |
2848 | } | |
2849 | ||
2850 | /* | |
2851 | * __free_kmem_pages and free_kmem_pages will free pages allocated with | |
2852 | * alloc_kmem_pages. | |
6a1a0d3b | 2853 | */ |
52383431 | 2854 | void __free_kmem_pages(struct page *page, unsigned int order) |
6a1a0d3b GC |
2855 | { |
2856 | memcg_kmem_uncharge_pages(page, order); | |
2857 | __free_pages(page, order); | |
2858 | } | |
2859 | ||
52383431 | 2860 | void free_kmem_pages(unsigned long addr, unsigned int order) |
6a1a0d3b GC |
2861 | { |
2862 | if (addr != 0) { | |
2863 | VM_BUG_ON(!virt_addr_valid((void *)addr)); | |
52383431 | 2864 | __free_kmem_pages(virt_to_page((void *)addr), order); |
6a1a0d3b GC |
2865 | } |
2866 | } | |
2867 | ||
ee85c2e1 AK |
2868 | static void *make_alloc_exact(unsigned long addr, unsigned order, size_t size) |
2869 | { | |
2870 | if (addr) { | |
2871 | unsigned long alloc_end = addr + (PAGE_SIZE << order); | |
2872 | unsigned long used = addr + PAGE_ALIGN(size); | |
2873 | ||
2874 | split_page(virt_to_page((void *)addr), order); | |
2875 | while (used < alloc_end) { | |
2876 | free_page(used); | |
2877 | used += PAGE_SIZE; | |
2878 | } | |
2879 | } | |
2880 | return (void *)addr; | |
2881 | } | |
2882 | ||
2be0ffe2 TT |
2883 | /** |
2884 | * alloc_pages_exact - allocate an exact number physically-contiguous pages. | |
2885 | * @size: the number of bytes to allocate | |
2886 | * @gfp_mask: GFP flags for the allocation | |
2887 | * | |
2888 | * This function is similar to alloc_pages(), except that it allocates the | |
2889 | * minimum number of pages to satisfy the request. alloc_pages() can only | |
2890 | * allocate memory in power-of-two pages. | |
2891 | * | |
2892 | * This function is also limited by MAX_ORDER. | |
2893 | * | |
2894 | * Memory allocated by this function must be released by free_pages_exact(). | |
2895 | */ | |
2896 | void *alloc_pages_exact(size_t size, gfp_t gfp_mask) | |
2897 | { | |
2898 | unsigned int order = get_order(size); | |
2899 | unsigned long addr; | |
2900 | ||
2901 | addr = __get_free_pages(gfp_mask, order); | |
ee85c2e1 | 2902 | return make_alloc_exact(addr, order, size); |
2be0ffe2 TT |
2903 | } |
2904 | EXPORT_SYMBOL(alloc_pages_exact); | |
2905 | ||
ee85c2e1 AK |
2906 | /** |
2907 | * alloc_pages_exact_nid - allocate an exact number of physically-contiguous | |
2908 | * pages on a node. | |
b5e6ab58 | 2909 | * @nid: the preferred node ID where memory should be allocated |
ee85c2e1 AK |
2910 | * @size: the number of bytes to allocate |
2911 | * @gfp_mask: GFP flags for the allocation | |
2912 | * | |
2913 | * Like alloc_pages_exact(), but try to allocate on node nid first before falling | |
2914 | * back. | |
2915 | * Note this is not alloc_pages_exact_node() which allocates on a specific node, | |
2916 | * but is not exact. | |
2917 | */ | |
2918 | void *alloc_pages_exact_nid(int nid, size_t size, gfp_t gfp_mask) | |
2919 | { | |
2920 | unsigned order = get_order(size); | |
2921 | struct page *p = alloc_pages_node(nid, gfp_mask, order); | |
2922 | if (!p) | |
2923 | return NULL; | |
2924 | return make_alloc_exact((unsigned long)page_address(p), order, size); | |
2925 | } | |
2926 | EXPORT_SYMBOL(alloc_pages_exact_nid); | |
2927 | ||
2be0ffe2 TT |
2928 | /** |
2929 | * free_pages_exact - release memory allocated via alloc_pages_exact() | |
2930 | * @virt: the value returned by alloc_pages_exact. | |
2931 | * @size: size of allocation, same value as passed to alloc_pages_exact(). | |
2932 | * | |
2933 | * Release the memory allocated by a previous call to alloc_pages_exact. | |
2934 | */ | |
2935 | void free_pages_exact(void *virt, size_t size) | |
2936 | { | |
2937 | unsigned long addr = (unsigned long)virt; | |
2938 | unsigned long end = addr + PAGE_ALIGN(size); | |
2939 | ||
2940 | while (addr < end) { | |
2941 | free_page(addr); | |
2942 | addr += PAGE_SIZE; | |
2943 | } | |
2944 | } | |
2945 | EXPORT_SYMBOL(free_pages_exact); | |
2946 | ||
e0fb5815 ZY |
2947 | /** |
2948 | * nr_free_zone_pages - count number of pages beyond high watermark | |
2949 | * @offset: The zone index of the highest zone | |
2950 | * | |
2951 | * nr_free_zone_pages() counts the number of counts pages which are beyond the | |
2952 | * high watermark within all zones at or below a given zone index. For each | |
2953 | * zone, the number of pages is calculated as: | |
834405c3 | 2954 | * managed_pages - high_pages |
e0fb5815 | 2955 | */ |
ebec3862 | 2956 | static unsigned long nr_free_zone_pages(int offset) |
1da177e4 | 2957 | { |
dd1a239f | 2958 | struct zoneref *z; |
54a6eb5c MG |
2959 | struct zone *zone; |
2960 | ||
e310fd43 | 2961 | /* Just pick one node, since fallback list is circular */ |
ebec3862 | 2962 | unsigned long sum = 0; |
1da177e4 | 2963 | |
0e88460d | 2964 | struct zonelist *zonelist = node_zonelist(numa_node_id(), GFP_KERNEL); |
1da177e4 | 2965 | |
54a6eb5c | 2966 | for_each_zone_zonelist(zone, z, zonelist, offset) { |
b40da049 | 2967 | unsigned long size = zone->managed_pages; |
41858966 | 2968 | unsigned long high = high_wmark_pages(zone); |
e310fd43 MB |
2969 | if (size > high) |
2970 | sum += size - high; | |
1da177e4 LT |
2971 | } |
2972 | ||
2973 | return sum; | |
2974 | } | |
2975 | ||
e0fb5815 ZY |
2976 | /** |
2977 | * nr_free_buffer_pages - count number of pages beyond high watermark | |
2978 | * | |
2979 | * nr_free_buffer_pages() counts the number of pages which are beyond the high | |
2980 | * watermark within ZONE_DMA and ZONE_NORMAL. | |
1da177e4 | 2981 | */ |
ebec3862 | 2982 | unsigned long nr_free_buffer_pages(void) |
1da177e4 | 2983 | { |
af4ca457 | 2984 | return nr_free_zone_pages(gfp_zone(GFP_USER)); |
1da177e4 | 2985 | } |
c2f1a551 | 2986 | EXPORT_SYMBOL_GPL(nr_free_buffer_pages); |
1da177e4 | 2987 | |
e0fb5815 ZY |
2988 | /** |
2989 | * nr_free_pagecache_pages - count number of pages beyond high watermark | |
2990 | * | |
2991 | * nr_free_pagecache_pages() counts the number of pages which are beyond the | |
2992 | * high watermark within all zones. | |
1da177e4 | 2993 | */ |
ebec3862 | 2994 | unsigned long nr_free_pagecache_pages(void) |
1da177e4 | 2995 | { |
2a1e274a | 2996 | return nr_free_zone_pages(gfp_zone(GFP_HIGHUSER_MOVABLE)); |
1da177e4 | 2997 | } |
08e0f6a9 CL |
2998 | |
2999 | static inline void show_node(struct zone *zone) | |
1da177e4 | 3000 | { |
e5adfffc | 3001 | if (IS_ENABLED(CONFIG_NUMA)) |
25ba77c1 | 3002 | printk("Node %d ", zone_to_nid(zone)); |
1da177e4 | 3003 | } |
1da177e4 | 3004 | |
1da177e4 LT |
3005 | void si_meminfo(struct sysinfo *val) |
3006 | { | |
3007 | val->totalram = totalram_pages; | |
3008 | val->sharedram = 0; | |
d23ad423 | 3009 | val->freeram = global_page_state(NR_FREE_PAGES); |
1da177e4 | 3010 | val->bufferram = nr_blockdev_pages(); |
1da177e4 LT |
3011 | val->totalhigh = totalhigh_pages; |
3012 | val->freehigh = nr_free_highpages(); | |
1da177e4 LT |
3013 | val->mem_unit = PAGE_SIZE; |
3014 | } | |
3015 | ||
3016 | EXPORT_SYMBOL(si_meminfo); | |
3017 | ||
3018 | #ifdef CONFIG_NUMA | |
3019 | void si_meminfo_node(struct sysinfo *val, int nid) | |
3020 | { | |
cdd91a77 JL |
3021 | int zone_type; /* needs to be signed */ |
3022 | unsigned long managed_pages = 0; | |
1da177e4 LT |
3023 | pg_data_t *pgdat = NODE_DATA(nid); |
3024 | ||
cdd91a77 JL |
3025 | for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++) |
3026 | managed_pages += pgdat->node_zones[zone_type].managed_pages; | |
3027 | val->totalram = managed_pages; | |
d23ad423 | 3028 | val->freeram = node_page_state(nid, NR_FREE_PAGES); |
98d2b0eb | 3029 | #ifdef CONFIG_HIGHMEM |
b40da049 | 3030 | val->totalhigh = pgdat->node_zones[ZONE_HIGHMEM].managed_pages; |
d23ad423 CL |
3031 | val->freehigh = zone_page_state(&pgdat->node_zones[ZONE_HIGHMEM], |
3032 | NR_FREE_PAGES); | |
98d2b0eb CL |
3033 | #else |
3034 | val->totalhigh = 0; | |
3035 | val->freehigh = 0; | |
3036 | #endif | |
1da177e4 LT |
3037 | val->mem_unit = PAGE_SIZE; |
3038 | } | |
3039 | #endif | |
3040 | ||
ddd588b5 | 3041 | /* |
7bf02ea2 DR |
3042 | * Determine whether the node should be displayed or not, depending on whether |
3043 | * SHOW_MEM_FILTER_NODES was passed to show_free_areas(). | |
ddd588b5 | 3044 | */ |
7bf02ea2 | 3045 | bool skip_free_areas_node(unsigned int flags, int nid) |
ddd588b5 DR |
3046 | { |
3047 | bool ret = false; | |
cc9a6c87 | 3048 | unsigned int cpuset_mems_cookie; |
ddd588b5 DR |
3049 | |
3050 | if (!(flags & SHOW_MEM_FILTER_NODES)) | |
3051 | goto out; | |
3052 | ||
cc9a6c87 | 3053 | do { |
d26914d1 | 3054 | cpuset_mems_cookie = read_mems_allowed_begin(); |
cc9a6c87 | 3055 | ret = !node_isset(nid, cpuset_current_mems_allowed); |
d26914d1 | 3056 | } while (read_mems_allowed_retry(cpuset_mems_cookie)); |
ddd588b5 DR |
3057 | out: |
3058 | return ret; | |
3059 | } | |
3060 | ||
1da177e4 LT |
3061 | #define K(x) ((x) << (PAGE_SHIFT-10)) |
3062 | ||
377e4f16 RV |
3063 | static void show_migration_types(unsigned char type) |
3064 | { | |
3065 | static const char types[MIGRATE_TYPES] = { | |
3066 | [MIGRATE_UNMOVABLE] = 'U', | |
3067 | [MIGRATE_RECLAIMABLE] = 'E', | |
3068 | [MIGRATE_MOVABLE] = 'M', | |
3069 | [MIGRATE_RESERVE] = 'R', | |
3070 | #ifdef CONFIG_CMA | |
3071 | [MIGRATE_CMA] = 'C', | |
3072 | #endif | |
194159fb | 3073 | #ifdef CONFIG_MEMORY_ISOLATION |
377e4f16 | 3074 | [MIGRATE_ISOLATE] = 'I', |
194159fb | 3075 | #endif |
377e4f16 RV |
3076 | }; |
3077 | char tmp[MIGRATE_TYPES + 1]; | |
3078 | char *p = tmp; | |
3079 | int i; | |
3080 | ||
3081 | for (i = 0; i < MIGRATE_TYPES; i++) { | |
3082 | if (type & (1 << i)) | |
3083 | *p++ = types[i]; | |
3084 | } | |
3085 | ||
3086 | *p = '\0'; | |
3087 | printk("(%s) ", tmp); | |
3088 | } | |
3089 | ||
1da177e4 LT |
3090 | /* |
3091 | * Show free area list (used inside shift_scroll-lock stuff) | |
3092 | * We also calculate the percentage fragmentation. We do this by counting the | |
3093 | * memory on each free list with the exception of the first item on the list. | |
ddd588b5 DR |
3094 | * Suppresses nodes that are not allowed by current's cpuset if |
3095 | * SHOW_MEM_FILTER_NODES is passed. | |
1da177e4 | 3096 | */ |
7bf02ea2 | 3097 | void show_free_areas(unsigned int filter) |
1da177e4 | 3098 | { |
c7241913 | 3099 | int cpu; |
1da177e4 LT |
3100 | struct zone *zone; |
3101 | ||
ee99c71c | 3102 | for_each_populated_zone(zone) { |
7bf02ea2 | 3103 | if (skip_free_areas_node(filter, zone_to_nid(zone))) |
ddd588b5 | 3104 | continue; |
c7241913 JS |
3105 | show_node(zone); |
3106 | printk("%s per-cpu:\n", zone->name); | |
1da177e4 | 3107 | |
6b482c67 | 3108 | for_each_online_cpu(cpu) { |
1da177e4 LT |
3109 | struct per_cpu_pageset *pageset; |
3110 | ||
99dcc3e5 | 3111 | pageset = per_cpu_ptr(zone->pageset, cpu); |
1da177e4 | 3112 | |
3dfa5721 CL |
3113 | printk("CPU %4d: hi:%5d, btch:%4d usd:%4d\n", |
3114 | cpu, pageset->pcp.high, | |
3115 | pageset->pcp.batch, pageset->pcp.count); | |
1da177e4 LT |
3116 | } |
3117 | } | |
3118 | ||
a731286d KM |
3119 | printk("active_anon:%lu inactive_anon:%lu isolated_anon:%lu\n" |
3120 | " active_file:%lu inactive_file:%lu isolated_file:%lu\n" | |
7b854121 | 3121 | " unevictable:%lu" |
b76146ed | 3122 | " dirty:%lu writeback:%lu unstable:%lu\n" |
3701b033 | 3123 | " free:%lu slab_reclaimable:%lu slab_unreclaimable:%lu\n" |
d1ce749a BZ |
3124 | " mapped:%lu shmem:%lu pagetables:%lu bounce:%lu\n" |
3125 | " free_cma:%lu\n", | |
4f98a2fe | 3126 | global_page_state(NR_ACTIVE_ANON), |
4f98a2fe | 3127 | global_page_state(NR_INACTIVE_ANON), |
a731286d KM |
3128 | global_page_state(NR_ISOLATED_ANON), |
3129 | global_page_state(NR_ACTIVE_FILE), | |
4f98a2fe | 3130 | global_page_state(NR_INACTIVE_FILE), |
a731286d | 3131 | global_page_state(NR_ISOLATED_FILE), |
7b854121 | 3132 | global_page_state(NR_UNEVICTABLE), |
b1e7a8fd | 3133 | global_page_state(NR_FILE_DIRTY), |
ce866b34 | 3134 | global_page_state(NR_WRITEBACK), |
fd39fc85 | 3135 | global_page_state(NR_UNSTABLE_NFS), |
d23ad423 | 3136 | global_page_state(NR_FREE_PAGES), |
3701b033 KM |
3137 | global_page_state(NR_SLAB_RECLAIMABLE), |
3138 | global_page_state(NR_SLAB_UNRECLAIMABLE), | |
65ba55f5 | 3139 | global_page_state(NR_FILE_MAPPED), |
4b02108a | 3140 | global_page_state(NR_SHMEM), |
a25700a5 | 3141 | global_page_state(NR_PAGETABLE), |
d1ce749a BZ |
3142 | global_page_state(NR_BOUNCE), |
3143 | global_page_state(NR_FREE_CMA_PAGES)); | |
1da177e4 | 3144 | |
ee99c71c | 3145 | for_each_populated_zone(zone) { |
1da177e4 LT |
3146 | int i; |
3147 | ||
7bf02ea2 | 3148 | if (skip_free_areas_node(filter, zone_to_nid(zone))) |
ddd588b5 | 3149 | continue; |
1da177e4 LT |
3150 | show_node(zone); |
3151 | printk("%s" | |
3152 | " free:%lukB" | |
3153 | " min:%lukB" | |
3154 | " low:%lukB" | |
3155 | " high:%lukB" | |
4f98a2fe RR |
3156 | " active_anon:%lukB" |
3157 | " inactive_anon:%lukB" | |
3158 | " active_file:%lukB" | |
3159 | " inactive_file:%lukB" | |
7b854121 | 3160 | " unevictable:%lukB" |
a731286d KM |
3161 | " isolated(anon):%lukB" |
3162 | " isolated(file):%lukB" | |
1da177e4 | 3163 | " present:%lukB" |
9feedc9d | 3164 | " managed:%lukB" |
4a0aa73f KM |
3165 | " mlocked:%lukB" |
3166 | " dirty:%lukB" | |
3167 | " writeback:%lukB" | |
3168 | " mapped:%lukB" | |
4b02108a | 3169 | " shmem:%lukB" |
4a0aa73f KM |
3170 | " slab_reclaimable:%lukB" |
3171 | " slab_unreclaimable:%lukB" | |
c6a7f572 | 3172 | " kernel_stack:%lukB" |
4a0aa73f KM |
3173 | " pagetables:%lukB" |
3174 | " unstable:%lukB" | |
3175 | " bounce:%lukB" | |
d1ce749a | 3176 | " free_cma:%lukB" |
4a0aa73f | 3177 | " writeback_tmp:%lukB" |
1da177e4 LT |
3178 | " pages_scanned:%lu" |
3179 | " all_unreclaimable? %s" | |
3180 | "\n", | |
3181 | zone->name, | |
88f5acf8 | 3182 | K(zone_page_state(zone, NR_FREE_PAGES)), |
41858966 MG |
3183 | K(min_wmark_pages(zone)), |
3184 | K(low_wmark_pages(zone)), | |
3185 | K(high_wmark_pages(zone)), | |
4f98a2fe RR |
3186 | K(zone_page_state(zone, NR_ACTIVE_ANON)), |
3187 | K(zone_page_state(zone, NR_INACTIVE_ANON)), | |
3188 | K(zone_page_state(zone, NR_ACTIVE_FILE)), | |
3189 | K(zone_page_state(zone, NR_INACTIVE_FILE)), | |
7b854121 | 3190 | K(zone_page_state(zone, NR_UNEVICTABLE)), |
a731286d KM |
3191 | K(zone_page_state(zone, NR_ISOLATED_ANON)), |
3192 | K(zone_page_state(zone, NR_ISOLATED_FILE)), | |
1da177e4 | 3193 | K(zone->present_pages), |
9feedc9d | 3194 | K(zone->managed_pages), |
4a0aa73f KM |
3195 | K(zone_page_state(zone, NR_MLOCK)), |
3196 | K(zone_page_state(zone, NR_FILE_DIRTY)), | |
3197 | K(zone_page_state(zone, NR_WRITEBACK)), | |
3198 | K(zone_page_state(zone, NR_FILE_MAPPED)), | |
4b02108a | 3199 | K(zone_page_state(zone, NR_SHMEM)), |
4a0aa73f KM |
3200 | K(zone_page_state(zone, NR_SLAB_RECLAIMABLE)), |
3201 | K(zone_page_state(zone, NR_SLAB_UNRECLAIMABLE)), | |
c6a7f572 KM |
3202 | zone_page_state(zone, NR_KERNEL_STACK) * |
3203 | THREAD_SIZE / 1024, | |
4a0aa73f KM |
3204 | K(zone_page_state(zone, NR_PAGETABLE)), |
3205 | K(zone_page_state(zone, NR_UNSTABLE_NFS)), | |
3206 | K(zone_page_state(zone, NR_BOUNCE)), | |
d1ce749a | 3207 | K(zone_page_state(zone, NR_FREE_CMA_PAGES)), |
4a0aa73f | 3208 | K(zone_page_state(zone, NR_WRITEBACK_TEMP)), |
1da177e4 | 3209 | zone->pages_scanned, |
6e543d57 | 3210 | (!zone_reclaimable(zone) ? "yes" : "no") |
1da177e4 LT |
3211 | ); |
3212 | printk("lowmem_reserve[]:"); | |
3213 | for (i = 0; i < MAX_NR_ZONES; i++) | |
3214 | printk(" %lu", zone->lowmem_reserve[i]); | |
3215 | printk("\n"); | |
3216 | } | |
3217 | ||
ee99c71c | 3218 | for_each_populated_zone(zone) { |
b8af2941 | 3219 | unsigned long nr[MAX_ORDER], flags, order, total = 0; |
377e4f16 | 3220 | unsigned char types[MAX_ORDER]; |
1da177e4 | 3221 | |
7bf02ea2 | 3222 | if (skip_free_areas_node(filter, zone_to_nid(zone))) |
ddd588b5 | 3223 | continue; |
1da177e4 LT |
3224 | show_node(zone); |
3225 | printk("%s: ", zone->name); | |
1da177e4 LT |
3226 | |
3227 | spin_lock_irqsave(&zone->lock, flags); | |
3228 | for (order = 0; order < MAX_ORDER; order++) { | |
377e4f16 RV |
3229 | struct free_area *area = &zone->free_area[order]; |
3230 | int type; | |
3231 | ||
3232 | nr[order] = area->nr_free; | |
8f9de51a | 3233 | total += nr[order] << order; |
377e4f16 RV |
3234 | |
3235 | types[order] = 0; | |
3236 | for (type = 0; type < MIGRATE_TYPES; type++) { | |
3237 | if (!list_empty(&area->free_list[type])) | |
3238 | types[order] |= 1 << type; | |
3239 | } | |
1da177e4 LT |
3240 | } |
3241 | spin_unlock_irqrestore(&zone->lock, flags); | |
377e4f16 | 3242 | for (order = 0; order < MAX_ORDER; order++) { |
8f9de51a | 3243 | printk("%lu*%lukB ", nr[order], K(1UL) << order); |
377e4f16 RV |
3244 | if (nr[order]) |
3245 | show_migration_types(types[order]); | |
3246 | } | |
1da177e4 LT |
3247 | printk("= %lukB\n", K(total)); |
3248 | } | |
3249 | ||
949f7ec5 DR |
3250 | hugetlb_show_meminfo(); |
3251 | ||
e6f3602d LW |
3252 | printk("%ld total pagecache pages\n", global_page_state(NR_FILE_PAGES)); |
3253 | ||
1da177e4 LT |
3254 | show_swap_cache_info(); |
3255 | } | |
3256 | ||
19770b32 MG |
3257 | static void zoneref_set_zone(struct zone *zone, struct zoneref *zoneref) |
3258 | { | |
3259 | zoneref->zone = zone; | |
3260 | zoneref->zone_idx = zone_idx(zone); | |
3261 | } | |
3262 | ||
1da177e4 LT |
3263 | /* |
3264 | * Builds allocation fallback zone lists. | |
1a93205b CL |
3265 | * |
3266 | * Add all populated zones of a node to the zonelist. | |
1da177e4 | 3267 | */ |
f0c0b2b8 | 3268 | static int build_zonelists_node(pg_data_t *pgdat, struct zonelist *zonelist, |
bc732f1d | 3269 | int nr_zones) |
1da177e4 | 3270 | { |
1a93205b | 3271 | struct zone *zone; |
bc732f1d | 3272 | enum zone_type zone_type = MAX_NR_ZONES; |
02a68a5e CL |
3273 | |
3274 | do { | |
2f6726e5 | 3275 | zone_type--; |
070f8032 | 3276 | zone = pgdat->node_zones + zone_type; |
1a93205b | 3277 | if (populated_zone(zone)) { |
dd1a239f MG |
3278 | zoneref_set_zone(zone, |
3279 | &zonelist->_zonerefs[nr_zones++]); | |
070f8032 | 3280 | check_highest_zone(zone_type); |
1da177e4 | 3281 | } |
2f6726e5 | 3282 | } while (zone_type); |
bc732f1d | 3283 | |
070f8032 | 3284 | return nr_zones; |
1da177e4 LT |
3285 | } |
3286 | ||
f0c0b2b8 KH |
3287 | |
3288 | /* | |
3289 | * zonelist_order: | |
3290 | * 0 = automatic detection of better ordering. | |
3291 | * 1 = order by ([node] distance, -zonetype) | |
3292 | * 2 = order by (-zonetype, [node] distance) | |
3293 | * | |
3294 | * If not NUMA, ZONELIST_ORDER_ZONE and ZONELIST_ORDER_NODE will create | |
3295 | * the same zonelist. So only NUMA can configure this param. | |
3296 | */ | |
3297 | #define ZONELIST_ORDER_DEFAULT 0 | |
3298 | #define ZONELIST_ORDER_NODE 1 | |
3299 | #define ZONELIST_ORDER_ZONE 2 | |
3300 | ||
3301 | /* zonelist order in the kernel. | |
3302 | * set_zonelist_order() will set this to NODE or ZONE. | |
3303 | */ | |
3304 | static int current_zonelist_order = ZONELIST_ORDER_DEFAULT; | |
3305 | static char zonelist_order_name[3][8] = {"Default", "Node", "Zone"}; | |
3306 | ||
3307 | ||
1da177e4 | 3308 | #ifdef CONFIG_NUMA |
f0c0b2b8 KH |
3309 | /* The value user specified ....changed by config */ |
3310 | static int user_zonelist_order = ZONELIST_ORDER_DEFAULT; | |
3311 | /* string for sysctl */ | |
3312 | #define NUMA_ZONELIST_ORDER_LEN 16 | |
3313 | char numa_zonelist_order[16] = "default"; | |
3314 | ||
3315 | /* | |
3316 | * interface for configure zonelist ordering. | |
3317 | * command line option "numa_zonelist_order" | |
3318 | * = "[dD]efault - default, automatic configuration. | |
3319 | * = "[nN]ode - order by node locality, then by zone within node | |
3320 | * = "[zZ]one - order by zone, then by locality within zone | |
3321 | */ | |
3322 | ||
3323 | static int __parse_numa_zonelist_order(char *s) | |
3324 | { | |
3325 | if (*s == 'd' || *s == 'D') { | |
3326 | user_zonelist_order = ZONELIST_ORDER_DEFAULT; | |
3327 | } else if (*s == 'n' || *s == 'N') { | |
3328 | user_zonelist_order = ZONELIST_ORDER_NODE; | |
3329 | } else if (*s == 'z' || *s == 'Z') { | |
3330 | user_zonelist_order = ZONELIST_ORDER_ZONE; | |
3331 | } else { | |
3332 | printk(KERN_WARNING | |
3333 | "Ignoring invalid numa_zonelist_order value: " | |
3334 | "%s\n", s); | |
3335 | return -EINVAL; | |
3336 | } | |
3337 | return 0; | |
3338 | } | |
3339 | ||
3340 | static __init int setup_numa_zonelist_order(char *s) | |
3341 | { | |
ecb256f8 VL |
3342 | int ret; |
3343 | ||
3344 | if (!s) | |
3345 | return 0; | |
3346 | ||
3347 | ret = __parse_numa_zonelist_order(s); | |
3348 | if (ret == 0) | |
3349 | strlcpy(numa_zonelist_order, s, NUMA_ZONELIST_ORDER_LEN); | |
3350 | ||
3351 | return ret; | |
f0c0b2b8 KH |
3352 | } |
3353 | early_param("numa_zonelist_order", setup_numa_zonelist_order); | |
3354 | ||
3355 | /* | |
3356 | * sysctl handler for numa_zonelist_order | |
3357 | */ | |
3358 | int numa_zonelist_order_handler(ctl_table *table, int write, | |
8d65af78 | 3359 | void __user *buffer, size_t *length, |
f0c0b2b8 KH |
3360 | loff_t *ppos) |
3361 | { | |
3362 | char saved_string[NUMA_ZONELIST_ORDER_LEN]; | |
3363 | int ret; | |
443c6f14 | 3364 | static DEFINE_MUTEX(zl_order_mutex); |
f0c0b2b8 | 3365 | |
443c6f14 | 3366 | mutex_lock(&zl_order_mutex); |
dacbde09 CG |
3367 | if (write) { |
3368 | if (strlen((char *)table->data) >= NUMA_ZONELIST_ORDER_LEN) { | |
3369 | ret = -EINVAL; | |
3370 | goto out; | |
3371 | } | |
3372 | strcpy(saved_string, (char *)table->data); | |
3373 | } | |
8d65af78 | 3374 | ret = proc_dostring(table, write, buffer, length, ppos); |
f0c0b2b8 | 3375 | if (ret) |
443c6f14 | 3376 | goto out; |
f0c0b2b8 KH |
3377 | if (write) { |
3378 | int oldval = user_zonelist_order; | |
dacbde09 CG |
3379 | |
3380 | ret = __parse_numa_zonelist_order((char *)table->data); | |
3381 | if (ret) { | |
f0c0b2b8 KH |
3382 | /* |
3383 | * bogus value. restore saved string | |
3384 | */ | |
dacbde09 | 3385 | strncpy((char *)table->data, saved_string, |
f0c0b2b8 KH |
3386 | NUMA_ZONELIST_ORDER_LEN); |
3387 | user_zonelist_order = oldval; | |
4eaf3f64 HL |
3388 | } else if (oldval != user_zonelist_order) { |
3389 | mutex_lock(&zonelists_mutex); | |
9adb62a5 | 3390 | build_all_zonelists(NULL, NULL); |
4eaf3f64 HL |
3391 | mutex_unlock(&zonelists_mutex); |
3392 | } | |
f0c0b2b8 | 3393 | } |
443c6f14 AK |
3394 | out: |
3395 | mutex_unlock(&zl_order_mutex); | |
3396 | return ret; | |
f0c0b2b8 KH |
3397 | } |
3398 | ||
3399 | ||
62bc62a8 | 3400 | #define MAX_NODE_LOAD (nr_online_nodes) |
f0c0b2b8 KH |
3401 | static int node_load[MAX_NUMNODES]; |
3402 | ||
1da177e4 | 3403 | /** |
4dc3b16b | 3404 | * find_next_best_node - find the next node that should appear in a given node's fallback list |
1da177e4 LT |
3405 | * @node: node whose fallback list we're appending |
3406 | * @used_node_mask: nodemask_t of already used nodes | |
3407 | * | |
3408 | * We use a number of factors to determine which is the next node that should | |
3409 | * appear on a given node's fallback list. The node should not have appeared | |
3410 | * already in @node's fallback list, and it should be the next closest node | |
3411 | * according to the distance array (which contains arbitrary distance values | |
3412 | * from each node to each node in the system), and should also prefer nodes | |
3413 | * with no CPUs, since presumably they'll have very little allocation pressure | |
3414 | * on them otherwise. | |
3415 | * It returns -1 if no node is found. | |
3416 | */ | |
f0c0b2b8 | 3417 | static int find_next_best_node(int node, nodemask_t *used_node_mask) |
1da177e4 | 3418 | { |
4cf808eb | 3419 | int n, val; |
1da177e4 | 3420 | int min_val = INT_MAX; |
00ef2d2f | 3421 | int best_node = NUMA_NO_NODE; |
a70f7302 | 3422 | const struct cpumask *tmp = cpumask_of_node(0); |
1da177e4 | 3423 | |
4cf808eb LT |
3424 | /* Use the local node if we haven't already */ |
3425 | if (!node_isset(node, *used_node_mask)) { | |
3426 | node_set(node, *used_node_mask); | |
3427 | return node; | |
3428 | } | |
1da177e4 | 3429 | |
4b0ef1fe | 3430 | for_each_node_state(n, N_MEMORY) { |
1da177e4 LT |
3431 | |
3432 | /* Don't want a node to appear more than once */ | |
3433 | if (node_isset(n, *used_node_mask)) | |
3434 | continue; | |
3435 | ||
1da177e4 LT |
3436 | /* Use the distance array to find the distance */ |
3437 | val = node_distance(node, n); | |
3438 | ||
4cf808eb LT |
3439 | /* Penalize nodes under us ("prefer the next node") */ |
3440 | val += (n < node); | |
3441 | ||
1da177e4 | 3442 | /* Give preference to headless and unused nodes */ |
a70f7302 RR |
3443 | tmp = cpumask_of_node(n); |
3444 | if (!cpumask_empty(tmp)) | |
1da177e4 LT |
3445 | val += PENALTY_FOR_NODE_WITH_CPUS; |
3446 | ||
3447 | /* Slight preference for less loaded node */ | |
3448 | val *= (MAX_NODE_LOAD*MAX_NUMNODES); | |
3449 | val += node_load[n]; | |
3450 | ||
3451 | if (val < min_val) { | |
3452 | min_val = val; | |
3453 | best_node = n; | |
3454 | } | |
3455 | } | |
3456 | ||
3457 | if (best_node >= 0) | |
3458 | node_set(best_node, *used_node_mask); | |
3459 | ||
3460 | return best_node; | |
3461 | } | |
3462 | ||
f0c0b2b8 KH |
3463 | |
3464 | /* | |
3465 | * Build zonelists ordered by node and zones within node. | |
3466 | * This results in maximum locality--normal zone overflows into local | |
3467 | * DMA zone, if any--but risks exhausting DMA zone. | |
3468 | */ | |
3469 | static void build_zonelists_in_node_order(pg_data_t *pgdat, int node) | |
1da177e4 | 3470 | { |
f0c0b2b8 | 3471 | int j; |
1da177e4 | 3472 | struct zonelist *zonelist; |
f0c0b2b8 | 3473 | |
54a6eb5c | 3474 | zonelist = &pgdat->node_zonelists[0]; |
dd1a239f | 3475 | for (j = 0; zonelist->_zonerefs[j].zone != NULL; j++) |
54a6eb5c | 3476 | ; |
bc732f1d | 3477 | j = build_zonelists_node(NODE_DATA(node), zonelist, j); |
dd1a239f MG |
3478 | zonelist->_zonerefs[j].zone = NULL; |
3479 | zonelist->_zonerefs[j].zone_idx = 0; | |
f0c0b2b8 KH |
3480 | } |
3481 | ||
523b9458 CL |
3482 | /* |
3483 | * Build gfp_thisnode zonelists | |
3484 | */ | |
3485 | static void build_thisnode_zonelists(pg_data_t *pgdat) | |
3486 | { | |
523b9458 CL |
3487 | int j; |
3488 | struct zonelist *zonelist; | |
3489 | ||
54a6eb5c | 3490 | zonelist = &pgdat->node_zonelists[1]; |
bc732f1d | 3491 | j = build_zonelists_node(pgdat, zonelist, 0); |
dd1a239f MG |
3492 | zonelist->_zonerefs[j].zone = NULL; |
3493 | zonelist->_zonerefs[j].zone_idx = 0; | |
523b9458 CL |
3494 | } |
3495 | ||
f0c0b2b8 KH |
3496 | /* |
3497 | * Build zonelists ordered by zone and nodes within zones. | |
3498 | * This results in conserving DMA zone[s] until all Normal memory is | |
3499 | * exhausted, but results in overflowing to remote node while memory | |
3500 | * may still exist in local DMA zone. | |
3501 | */ | |
3502 | static int node_order[MAX_NUMNODES]; | |
3503 | ||
3504 | static void build_zonelists_in_zone_order(pg_data_t *pgdat, int nr_nodes) | |
3505 | { | |
f0c0b2b8 KH |
3506 | int pos, j, node; |
3507 | int zone_type; /* needs to be signed */ | |
3508 | struct zone *z; | |
3509 | struct zonelist *zonelist; | |
3510 | ||
54a6eb5c MG |
3511 | zonelist = &pgdat->node_zonelists[0]; |
3512 | pos = 0; | |
3513 | for (zone_type = MAX_NR_ZONES - 1; zone_type >= 0; zone_type--) { | |
3514 | for (j = 0; j < nr_nodes; j++) { | |
3515 | node = node_order[j]; | |
3516 | z = &NODE_DATA(node)->node_zones[zone_type]; | |
3517 | if (populated_zone(z)) { | |
dd1a239f MG |
3518 | zoneref_set_zone(z, |
3519 | &zonelist->_zonerefs[pos++]); | |
54a6eb5c | 3520 | check_highest_zone(zone_type); |
f0c0b2b8 KH |
3521 | } |
3522 | } | |
f0c0b2b8 | 3523 | } |
dd1a239f MG |
3524 | zonelist->_zonerefs[pos].zone = NULL; |
3525 | zonelist->_zonerefs[pos].zone_idx = 0; | |
f0c0b2b8 KH |
3526 | } |
3527 | ||
3528 | static int default_zonelist_order(void) | |
3529 | { | |
3530 | int nid, zone_type; | |
b8af2941 | 3531 | unsigned long low_kmem_size, total_size; |
f0c0b2b8 KH |
3532 | struct zone *z; |
3533 | int average_size; | |
3534 | /* | |
b8af2941 | 3535 | * ZONE_DMA and ZONE_DMA32 can be very small area in the system. |
f0c0b2b8 KH |
3536 | * If they are really small and used heavily, the system can fall |
3537 | * into OOM very easily. | |
e325c90f | 3538 | * This function detect ZONE_DMA/DMA32 size and configures zone order. |
f0c0b2b8 KH |
3539 | */ |
3540 | /* Is there ZONE_NORMAL ? (ex. ppc has only DMA zone..) */ | |
3541 | low_kmem_size = 0; | |
3542 | total_size = 0; | |
3543 | for_each_online_node(nid) { | |
3544 | for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++) { | |
3545 | z = &NODE_DATA(nid)->node_zones[zone_type]; | |
3546 | if (populated_zone(z)) { | |
3547 | if (zone_type < ZONE_NORMAL) | |
4f9f4774 JL |
3548 | low_kmem_size += z->managed_pages; |
3549 | total_size += z->managed_pages; | |
e325c90f DR |
3550 | } else if (zone_type == ZONE_NORMAL) { |
3551 | /* | |
3552 | * If any node has only lowmem, then node order | |
3553 | * is preferred to allow kernel allocations | |
3554 | * locally; otherwise, they can easily infringe | |
3555 | * on other nodes when there is an abundance of | |
3556 | * lowmem available to allocate from. | |
3557 | */ | |
3558 | return ZONELIST_ORDER_NODE; | |
f0c0b2b8 KH |
3559 | } |
3560 | } | |
3561 | } | |
3562 | if (!low_kmem_size || /* there are no DMA area. */ | |
3563 | low_kmem_size > total_size/2) /* DMA/DMA32 is big. */ | |
3564 | return ZONELIST_ORDER_NODE; | |
3565 | /* | |
3566 | * look into each node's config. | |
b8af2941 PK |
3567 | * If there is a node whose DMA/DMA32 memory is very big area on |
3568 | * local memory, NODE_ORDER may be suitable. | |
3569 | */ | |
37b07e41 | 3570 | average_size = total_size / |
4b0ef1fe | 3571 | (nodes_weight(node_states[N_MEMORY]) + 1); |
f0c0b2b8 KH |
3572 | for_each_online_node(nid) { |
3573 | low_kmem_size = 0; | |
3574 | total_size = 0; | |
3575 | for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++) { | |
3576 | z = &NODE_DATA(nid)->node_zones[zone_type]; | |
3577 | if (populated_zone(z)) { | |
3578 | if (zone_type < ZONE_NORMAL) | |
3579 | low_kmem_size += z->present_pages; | |
3580 | total_size += z->present_pages; | |
3581 | } | |
3582 | } | |
3583 | if (low_kmem_size && | |
3584 | total_size > average_size && /* ignore small node */ | |
3585 | low_kmem_size > total_size * 70/100) | |
3586 | return ZONELIST_ORDER_NODE; | |
3587 | } | |
3588 | return ZONELIST_ORDER_ZONE; | |
3589 | } | |
3590 | ||
3591 | static void set_zonelist_order(void) | |
3592 | { | |
3593 | if (user_zonelist_order == ZONELIST_ORDER_DEFAULT) | |
3594 | current_zonelist_order = default_zonelist_order(); | |
3595 | else | |
3596 | current_zonelist_order = user_zonelist_order; | |
3597 | } | |
3598 | ||
3599 | static void build_zonelists(pg_data_t *pgdat) | |
3600 | { | |
3601 | int j, node, load; | |
3602 | enum zone_type i; | |
1da177e4 | 3603 | nodemask_t used_mask; |
f0c0b2b8 KH |
3604 | int local_node, prev_node; |
3605 | struct zonelist *zonelist; | |
3606 | int order = current_zonelist_order; | |
1da177e4 LT |
3607 | |
3608 | /* initialize zonelists */ | |
523b9458 | 3609 | for (i = 0; i < MAX_ZONELISTS; i++) { |
1da177e4 | 3610 | zonelist = pgdat->node_zonelists + i; |
dd1a239f MG |
3611 | zonelist->_zonerefs[0].zone = NULL; |
3612 | zonelist->_zonerefs[0].zone_idx = 0; | |
1da177e4 LT |
3613 | } |
3614 | ||
3615 | /* NUMA-aware ordering of nodes */ | |
3616 | local_node = pgdat->node_id; | |
62bc62a8 | 3617 | load = nr_online_nodes; |
1da177e4 LT |
3618 | prev_node = local_node; |
3619 | nodes_clear(used_mask); | |
f0c0b2b8 | 3620 | |
f0c0b2b8 KH |
3621 | memset(node_order, 0, sizeof(node_order)); |
3622 | j = 0; | |
3623 | ||
1da177e4 LT |
3624 | while ((node = find_next_best_node(local_node, &used_mask)) >= 0) { |
3625 | /* | |
3626 | * We don't want to pressure a particular node. | |
3627 | * So adding penalty to the first node in same | |
3628 | * distance group to make it round-robin. | |
3629 | */ | |
957f822a DR |
3630 | if (node_distance(local_node, node) != |
3631 | node_distance(local_node, prev_node)) | |
f0c0b2b8 KH |
3632 | node_load[node] = load; |
3633 | ||
1da177e4 LT |
3634 | prev_node = node; |
3635 | load--; | |
f0c0b2b8 KH |
3636 | if (order == ZONELIST_ORDER_NODE) |
3637 | build_zonelists_in_node_order(pgdat, node); | |
3638 | else | |
3639 | node_order[j++] = node; /* remember order */ | |
3640 | } | |
1da177e4 | 3641 | |
f0c0b2b8 KH |
3642 | if (order == ZONELIST_ORDER_ZONE) { |
3643 | /* calculate node order -- i.e., DMA last! */ | |
3644 | build_zonelists_in_zone_order(pgdat, j); | |
1da177e4 | 3645 | } |
523b9458 CL |
3646 | |
3647 | build_thisnode_zonelists(pgdat); | |
1da177e4 LT |
3648 | } |
3649 | ||
9276b1bc | 3650 | /* Construct the zonelist performance cache - see further mmzone.h */ |
f0c0b2b8 | 3651 | static void build_zonelist_cache(pg_data_t *pgdat) |
9276b1bc | 3652 | { |
54a6eb5c MG |
3653 | struct zonelist *zonelist; |
3654 | struct zonelist_cache *zlc; | |
dd1a239f | 3655 | struct zoneref *z; |
9276b1bc | 3656 | |
54a6eb5c MG |
3657 | zonelist = &pgdat->node_zonelists[0]; |
3658 | zonelist->zlcache_ptr = zlc = &zonelist->zlcache; | |
3659 | bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST); | |
dd1a239f MG |
3660 | for (z = zonelist->_zonerefs; z->zone; z++) |
3661 | zlc->z_to_n[z - zonelist->_zonerefs] = zonelist_node_idx(z); | |
9276b1bc PJ |
3662 | } |
3663 | ||
7aac7898 LS |
3664 | #ifdef CONFIG_HAVE_MEMORYLESS_NODES |
3665 | /* | |
3666 | * Return node id of node used for "local" allocations. | |
3667 | * I.e., first node id of first zone in arg node's generic zonelist. | |
3668 | * Used for initializing percpu 'numa_mem', which is used primarily | |
3669 | * for kernel allocations, so use GFP_KERNEL flags to locate zonelist. | |
3670 | */ | |
3671 | int local_memory_node(int node) | |
3672 | { | |
3673 | struct zone *zone; | |
3674 | ||
3675 | (void)first_zones_zonelist(node_zonelist(node, GFP_KERNEL), | |
3676 | gfp_zone(GFP_KERNEL), | |
3677 | NULL, | |
3678 | &zone); | |
3679 | return zone->node; | |
3680 | } | |
3681 | #endif | |
f0c0b2b8 | 3682 | |
1da177e4 LT |
3683 | #else /* CONFIG_NUMA */ |
3684 | ||
f0c0b2b8 KH |
3685 | static void set_zonelist_order(void) |
3686 | { | |
3687 | current_zonelist_order = ZONELIST_ORDER_ZONE; | |
3688 | } | |
3689 | ||
3690 | static void build_zonelists(pg_data_t *pgdat) | |
1da177e4 | 3691 | { |
19655d34 | 3692 | int node, local_node; |
54a6eb5c MG |
3693 | enum zone_type j; |
3694 | struct zonelist *zonelist; | |
1da177e4 LT |
3695 | |
3696 | local_node = pgdat->node_id; | |
1da177e4 | 3697 | |
54a6eb5c | 3698 | zonelist = &pgdat->node_zonelists[0]; |
bc732f1d | 3699 | j = build_zonelists_node(pgdat, zonelist, 0); |
1da177e4 | 3700 | |
54a6eb5c MG |
3701 | /* |
3702 | * Now we build the zonelist so that it contains the zones | |
3703 | * of all the other nodes. | |
3704 | * We don't want to pressure a particular node, so when | |
3705 | * building the zones for node N, we make sure that the | |
3706 | * zones coming right after the local ones are those from | |
3707 | * node N+1 (modulo N) | |
3708 | */ | |
3709 | for (node = local_node + 1; node < MAX_NUMNODES; node++) { | |
3710 | if (!node_online(node)) | |
3711 | continue; | |
bc732f1d | 3712 | j = build_zonelists_node(NODE_DATA(node), zonelist, j); |
1da177e4 | 3713 | } |
54a6eb5c MG |
3714 | for (node = 0; node < local_node; node++) { |
3715 | if (!node_online(node)) | |
3716 | continue; | |
bc732f1d | 3717 | j = build_zonelists_node(NODE_DATA(node), zonelist, j); |
54a6eb5c MG |
3718 | } |
3719 | ||
dd1a239f MG |
3720 | zonelist->_zonerefs[j].zone = NULL; |
3721 | zonelist->_zonerefs[j].zone_idx = 0; | |
1da177e4 LT |
3722 | } |
3723 | ||
9276b1bc | 3724 | /* non-NUMA variant of zonelist performance cache - just NULL zlcache_ptr */ |
f0c0b2b8 | 3725 | static void build_zonelist_cache(pg_data_t *pgdat) |
9276b1bc | 3726 | { |
54a6eb5c | 3727 | pgdat->node_zonelists[0].zlcache_ptr = NULL; |
9276b1bc PJ |
3728 | } |
3729 | ||
1da177e4 LT |
3730 | #endif /* CONFIG_NUMA */ |
3731 | ||
99dcc3e5 CL |
3732 | /* |
3733 | * Boot pageset table. One per cpu which is going to be used for all | |
3734 | * zones and all nodes. The parameters will be set in such a way | |
3735 | * that an item put on a list will immediately be handed over to | |
3736 | * the buddy list. This is safe since pageset manipulation is done | |
3737 | * with interrupts disabled. | |
3738 | * | |
3739 | * The boot_pagesets must be kept even after bootup is complete for | |
3740 | * unused processors and/or zones. They do play a role for bootstrapping | |
3741 | * hotplugged processors. | |
3742 | * | |
3743 | * zoneinfo_show() and maybe other functions do | |
3744 | * not check if the processor is online before following the pageset pointer. | |
3745 | * Other parts of the kernel may not check if the zone is available. | |
3746 | */ | |
3747 | static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch); | |
3748 | static DEFINE_PER_CPU(struct per_cpu_pageset, boot_pageset); | |
1f522509 | 3749 | static void setup_zone_pageset(struct zone *zone); |
99dcc3e5 | 3750 | |
4eaf3f64 HL |
3751 | /* |
3752 | * Global mutex to protect against size modification of zonelists | |
3753 | * as well as to serialize pageset setup for the new populated zone. | |
3754 | */ | |
3755 | DEFINE_MUTEX(zonelists_mutex); | |
3756 | ||
9b1a4d38 | 3757 | /* return values int ....just for stop_machine() */ |
4ed7e022 | 3758 | static int __build_all_zonelists(void *data) |
1da177e4 | 3759 | { |
6811378e | 3760 | int nid; |
99dcc3e5 | 3761 | int cpu; |
9adb62a5 | 3762 | pg_data_t *self = data; |
9276b1bc | 3763 | |
7f9cfb31 BL |
3764 | #ifdef CONFIG_NUMA |
3765 | memset(node_load, 0, sizeof(node_load)); | |
3766 | #endif | |
9adb62a5 JL |
3767 | |
3768 | if (self && !node_online(self->node_id)) { | |
3769 | build_zonelists(self); | |
3770 | build_zonelist_cache(self); | |
3771 | } | |
3772 | ||
9276b1bc | 3773 | for_each_online_node(nid) { |
7ea1530a CL |
3774 | pg_data_t *pgdat = NODE_DATA(nid); |
3775 | ||
3776 | build_zonelists(pgdat); | |
3777 | build_zonelist_cache(pgdat); | |
9276b1bc | 3778 | } |
99dcc3e5 CL |
3779 | |
3780 | /* | |
3781 | * Initialize the boot_pagesets that are going to be used | |
3782 | * for bootstrapping processors. The real pagesets for | |
3783 | * each zone will be allocated later when the per cpu | |
3784 | * allocator is available. | |
3785 | * | |
3786 | * boot_pagesets are used also for bootstrapping offline | |
3787 | * cpus if the system is already booted because the pagesets | |
3788 | * are needed to initialize allocators on a specific cpu too. | |
3789 | * F.e. the percpu allocator needs the page allocator which | |
3790 | * needs the percpu allocator in order to allocate its pagesets | |
3791 | * (a chicken-egg dilemma). | |
3792 | */ | |
7aac7898 | 3793 | for_each_possible_cpu(cpu) { |
99dcc3e5 CL |
3794 | setup_pageset(&per_cpu(boot_pageset, cpu), 0); |
3795 | ||
7aac7898 LS |
3796 | #ifdef CONFIG_HAVE_MEMORYLESS_NODES |
3797 | /* | |
3798 | * We now know the "local memory node" for each node-- | |
3799 | * i.e., the node of the first zone in the generic zonelist. | |
3800 | * Set up numa_mem percpu variable for on-line cpus. During | |
3801 | * boot, only the boot cpu should be on-line; we'll init the | |
3802 | * secondary cpus' numa_mem as they come on-line. During | |
3803 | * node/memory hotplug, we'll fixup all on-line cpus. | |
3804 | */ | |
3805 | if (cpu_online(cpu)) | |
3806 | set_cpu_numa_mem(cpu, local_memory_node(cpu_to_node(cpu))); | |
3807 | #endif | |
3808 | } | |
3809 | ||
6811378e YG |
3810 | return 0; |
3811 | } | |
3812 | ||
4eaf3f64 HL |
3813 | /* |
3814 | * Called with zonelists_mutex held always | |
3815 | * unless system_state == SYSTEM_BOOTING. | |
3816 | */ | |
9adb62a5 | 3817 | void __ref build_all_zonelists(pg_data_t *pgdat, struct zone *zone) |
6811378e | 3818 | { |
f0c0b2b8 KH |
3819 | set_zonelist_order(); |
3820 | ||
6811378e | 3821 | if (system_state == SYSTEM_BOOTING) { |
423b41d7 | 3822 | __build_all_zonelists(NULL); |
68ad8df4 | 3823 | mminit_verify_zonelist(); |
6811378e YG |
3824 | cpuset_init_current_mems_allowed(); |
3825 | } else { | |
e9959f0f | 3826 | #ifdef CONFIG_MEMORY_HOTPLUG |
9adb62a5 JL |
3827 | if (zone) |
3828 | setup_zone_pageset(zone); | |
e9959f0f | 3829 | #endif |
dd1895e2 CS |
3830 | /* we have to stop all cpus to guarantee there is no user |
3831 | of zonelist */ | |
9adb62a5 | 3832 | stop_machine(__build_all_zonelists, pgdat, NULL); |
6811378e YG |
3833 | /* cpuset refresh routine should be here */ |
3834 | } | |
bd1e22b8 | 3835 | vm_total_pages = nr_free_pagecache_pages(); |
9ef9acb0 MG |
3836 | /* |
3837 | * Disable grouping by mobility if the number of pages in the | |
3838 | * system is too low to allow the mechanism to work. It would be | |
3839 | * more accurate, but expensive to check per-zone. This check is | |
3840 | * made on memory-hotadd so a system can start with mobility | |
3841 | * disabled and enable it later | |
3842 | */ | |
d9c23400 | 3843 | if (vm_total_pages < (pageblock_nr_pages * MIGRATE_TYPES)) |
9ef9acb0 MG |
3844 | page_group_by_mobility_disabled = 1; |
3845 | else | |
3846 | page_group_by_mobility_disabled = 0; | |
3847 | ||
3848 | printk("Built %i zonelists in %s order, mobility grouping %s. " | |
3849 | "Total pages: %ld\n", | |
62bc62a8 | 3850 | nr_online_nodes, |
f0c0b2b8 | 3851 | zonelist_order_name[current_zonelist_order], |
9ef9acb0 | 3852 | page_group_by_mobility_disabled ? "off" : "on", |
f0c0b2b8 KH |
3853 | vm_total_pages); |
3854 | #ifdef CONFIG_NUMA | |
3855 | printk("Policy zone: %s\n", zone_names[policy_zone]); | |
3856 | #endif | |
1da177e4 LT |
3857 | } |
3858 | ||
3859 | /* | |
3860 | * Helper functions to size the waitqueue hash table. | |
3861 | * Essentially these want to choose hash table sizes sufficiently | |
3862 | * large so that collisions trying to wait on pages are rare. | |
3863 | * But in fact, the number of active page waitqueues on typical | |
3864 | * systems is ridiculously low, less than 200. So this is even | |
3865 | * conservative, even though it seems large. | |
3866 | * | |
3867 | * The constant PAGES_PER_WAITQUEUE specifies the ratio of pages to | |
3868 | * waitqueues, i.e. the size of the waitq table given the number of pages. | |
3869 | */ | |
3870 | #define PAGES_PER_WAITQUEUE 256 | |
3871 | ||
cca448fe | 3872 | #ifndef CONFIG_MEMORY_HOTPLUG |
02b694de | 3873 | static inline unsigned long wait_table_hash_nr_entries(unsigned long pages) |
1da177e4 LT |
3874 | { |
3875 | unsigned long size = 1; | |
3876 | ||
3877 | pages /= PAGES_PER_WAITQUEUE; | |
3878 | ||
3879 | while (size < pages) | |
3880 | size <<= 1; | |
3881 | ||
3882 | /* | |
3883 | * Once we have dozens or even hundreds of threads sleeping | |
3884 | * on IO we've got bigger problems than wait queue collision. | |
3885 | * Limit the size of the wait table to a reasonable size. | |
3886 | */ | |
3887 | size = min(size, 4096UL); | |
3888 | ||
3889 | return max(size, 4UL); | |
3890 | } | |
cca448fe YG |
3891 | #else |
3892 | /* | |
3893 | * A zone's size might be changed by hot-add, so it is not possible to determine | |
3894 | * a suitable size for its wait_table. So we use the maximum size now. | |
3895 | * | |
3896 | * The max wait table size = 4096 x sizeof(wait_queue_head_t). ie: | |
3897 | * | |
3898 | * i386 (preemption config) : 4096 x 16 = 64Kbyte. | |
3899 | * ia64, x86-64 (no preemption): 4096 x 20 = 80Kbyte. | |
3900 | * ia64, x86-64 (preemption) : 4096 x 24 = 96Kbyte. | |
3901 | * | |
3902 | * The maximum entries are prepared when a zone's memory is (512K + 256) pages | |
3903 | * or more by the traditional way. (See above). It equals: | |
3904 | * | |
3905 | * i386, x86-64, powerpc(4K page size) : = ( 2G + 1M)byte. | |
3906 | * ia64(16K page size) : = ( 8G + 4M)byte. | |
3907 | * powerpc (64K page size) : = (32G +16M)byte. | |
3908 | */ | |
3909 | static inline unsigned long wait_table_hash_nr_entries(unsigned long pages) | |
3910 | { | |
3911 | return 4096UL; | |
3912 | } | |
3913 | #endif | |
1da177e4 LT |
3914 | |
3915 | /* | |
3916 | * This is an integer logarithm so that shifts can be used later | |
3917 | * to extract the more random high bits from the multiplicative | |
3918 | * hash function before the remainder is taken. | |
3919 | */ | |
3920 | static inline unsigned long wait_table_bits(unsigned long size) | |
3921 | { | |
3922 | return ffz(~size); | |
3923 | } | |
3924 | ||
6d3163ce AH |
3925 | /* |
3926 | * Check if a pageblock contains reserved pages | |
3927 | */ | |
3928 | static int pageblock_is_reserved(unsigned long start_pfn, unsigned long end_pfn) | |
3929 | { | |
3930 | unsigned long pfn; | |
3931 | ||
3932 | for (pfn = start_pfn; pfn < end_pfn; pfn++) { | |
3933 | if (!pfn_valid_within(pfn) || PageReserved(pfn_to_page(pfn))) | |
3934 | return 1; | |
3935 | } | |
3936 | return 0; | |
3937 | } | |
3938 | ||
56fd56b8 | 3939 | /* |
d9c23400 | 3940 | * Mark a number of pageblocks as MIGRATE_RESERVE. The number |
41858966 MG |
3941 | * of blocks reserved is based on min_wmark_pages(zone). The memory within |
3942 | * the reserve will tend to store contiguous free pages. Setting min_free_kbytes | |
56fd56b8 MG |
3943 | * higher will lead to a bigger reserve which will get freed as contiguous |
3944 | * blocks as reclaim kicks in | |
3945 | */ | |
3946 | static void setup_zone_migrate_reserve(struct zone *zone) | |
3947 | { | |
6d3163ce | 3948 | unsigned long start_pfn, pfn, end_pfn, block_end_pfn; |
56fd56b8 | 3949 | struct page *page; |
78986a67 MG |
3950 | unsigned long block_migratetype; |
3951 | int reserve; | |
943dca1a | 3952 | int old_reserve; |
56fd56b8 | 3953 | |
d0215638 MH |
3954 | /* |
3955 | * Get the start pfn, end pfn and the number of blocks to reserve | |
3956 | * We have to be careful to be aligned to pageblock_nr_pages to | |
3957 | * make sure that we always check pfn_valid for the first page in | |
3958 | * the block. | |
3959 | */ | |
56fd56b8 | 3960 | start_pfn = zone->zone_start_pfn; |
108bcc96 | 3961 | end_pfn = zone_end_pfn(zone); |
d0215638 | 3962 | start_pfn = roundup(start_pfn, pageblock_nr_pages); |
41858966 | 3963 | reserve = roundup(min_wmark_pages(zone), pageblock_nr_pages) >> |
d9c23400 | 3964 | pageblock_order; |
56fd56b8 | 3965 | |
78986a67 MG |
3966 | /* |
3967 | * Reserve blocks are generally in place to help high-order atomic | |
3968 | * allocations that are short-lived. A min_free_kbytes value that | |
3969 | * would result in more than 2 reserve blocks for atomic allocations | |
3970 | * is assumed to be in place to help anti-fragmentation for the | |
3971 | * future allocation of hugepages at runtime. | |
3972 | */ | |
3973 | reserve = min(2, reserve); | |
943dca1a YI |
3974 | old_reserve = zone->nr_migrate_reserve_block; |
3975 | ||
3976 | /* When memory hot-add, we almost always need to do nothing */ | |
3977 | if (reserve == old_reserve) | |
3978 | return; | |
3979 | zone->nr_migrate_reserve_block = reserve; | |
78986a67 | 3980 | |
d9c23400 | 3981 | for (pfn = start_pfn; pfn < end_pfn; pfn += pageblock_nr_pages) { |
56fd56b8 MG |
3982 | if (!pfn_valid(pfn)) |
3983 | continue; | |
3984 | page = pfn_to_page(pfn); | |
3985 | ||
344c790e AL |
3986 | /* Watch out for overlapping nodes */ |
3987 | if (page_to_nid(page) != zone_to_nid(zone)) | |
3988 | continue; | |
3989 | ||
56fd56b8 MG |
3990 | block_migratetype = get_pageblock_migratetype(page); |
3991 | ||
938929f1 MG |
3992 | /* Only test what is necessary when the reserves are not met */ |
3993 | if (reserve > 0) { | |
3994 | /* | |
3995 | * Blocks with reserved pages will never free, skip | |
3996 | * them. | |
3997 | */ | |
3998 | block_end_pfn = min(pfn + pageblock_nr_pages, end_pfn); | |
3999 | if (pageblock_is_reserved(pfn, block_end_pfn)) | |
4000 | continue; | |
56fd56b8 | 4001 | |
938929f1 MG |
4002 | /* If this block is reserved, account for it */ |
4003 | if (block_migratetype == MIGRATE_RESERVE) { | |
4004 | reserve--; | |
4005 | continue; | |
4006 | } | |
4007 | ||
4008 | /* Suitable for reserving if this block is movable */ | |
4009 | if (block_migratetype == MIGRATE_MOVABLE) { | |
4010 | set_pageblock_migratetype(page, | |
4011 | MIGRATE_RESERVE); | |
4012 | move_freepages_block(zone, page, | |
4013 | MIGRATE_RESERVE); | |
4014 | reserve--; | |
4015 | continue; | |
4016 | } | |
943dca1a YI |
4017 | } else if (!old_reserve) { |
4018 | /* | |
4019 | * At boot time we don't need to scan the whole zone | |
4020 | * for turning off MIGRATE_RESERVE. | |
4021 | */ | |
4022 | break; | |
56fd56b8 MG |
4023 | } |
4024 | ||
4025 | /* | |
4026 | * If the reserve is met and this is a previous reserved block, | |
4027 | * take it back | |
4028 | */ | |
4029 | if (block_migratetype == MIGRATE_RESERVE) { | |
4030 | set_pageblock_migratetype(page, MIGRATE_MOVABLE); | |
4031 | move_freepages_block(zone, page, MIGRATE_MOVABLE); | |
4032 | } | |
4033 | } | |
4034 | } | |
ac0e5b7a | 4035 | |
1da177e4 LT |
4036 | /* |
4037 | * Initially all pages are reserved - free ones are freed | |
4038 | * up by free_all_bootmem() once the early boot process is | |
4039 | * done. Non-atomic initialization, single-pass. | |
4040 | */ | |
c09b4240 | 4041 | void __meminit memmap_init_zone(unsigned long size, int nid, unsigned long zone, |
a2f3aa02 | 4042 | unsigned long start_pfn, enum memmap_context context) |
1da177e4 | 4043 | { |
1da177e4 | 4044 | struct page *page; |
29751f69 AW |
4045 | unsigned long end_pfn = start_pfn + size; |
4046 | unsigned long pfn; | |
86051ca5 | 4047 | struct zone *z; |
1da177e4 | 4048 | |
22b31eec HD |
4049 | if (highest_memmap_pfn < end_pfn - 1) |
4050 | highest_memmap_pfn = end_pfn - 1; | |
4051 | ||
86051ca5 | 4052 | z = &NODE_DATA(nid)->node_zones[zone]; |
cbe8dd4a | 4053 | for (pfn = start_pfn; pfn < end_pfn; pfn++) { |
a2f3aa02 DH |
4054 | /* |
4055 | * There can be holes in boot-time mem_map[]s | |
4056 | * handed to this function. They do not | |
4057 | * exist on hotplugged memory. | |
4058 | */ | |
4059 | if (context == MEMMAP_EARLY) { | |
4060 | if (!early_pfn_valid(pfn)) | |
4061 | continue; | |
4062 | if (!early_pfn_in_nid(pfn, nid)) | |
4063 | continue; | |
4064 | } | |
d41dee36 AW |
4065 | page = pfn_to_page(pfn); |
4066 | set_page_links(page, zone, nid, pfn); | |
708614e6 | 4067 | mminit_verify_page_links(page, zone, nid, pfn); |
7835e98b | 4068 | init_page_count(page); |
22b751c3 | 4069 | page_mapcount_reset(page); |
90572890 | 4070 | page_cpupid_reset_last(page); |
1da177e4 | 4071 | SetPageReserved(page); |
b2a0ac88 MG |
4072 | /* |
4073 | * Mark the block movable so that blocks are reserved for | |
4074 | * movable at startup. This will force kernel allocations | |
4075 | * to reserve their blocks rather than leaking throughout | |
4076 | * the address space during boot when many long-lived | |
56fd56b8 MG |
4077 | * kernel allocations are made. Later some blocks near |
4078 | * the start are marked MIGRATE_RESERVE by | |
4079 | * setup_zone_migrate_reserve() | |
86051ca5 KH |
4080 | * |
4081 | * bitmap is created for zone's valid pfn range. but memmap | |
4082 | * can be created for invalid pages (for alignment) | |
4083 | * check here not to call set_pageblock_migratetype() against | |
4084 | * pfn out of zone. | |
b2a0ac88 | 4085 | */ |
86051ca5 | 4086 | if ((z->zone_start_pfn <= pfn) |
108bcc96 | 4087 | && (pfn < zone_end_pfn(z)) |
86051ca5 | 4088 | && !(pfn & (pageblock_nr_pages - 1))) |
56fd56b8 | 4089 | set_pageblock_migratetype(page, MIGRATE_MOVABLE); |
b2a0ac88 | 4090 | |
1da177e4 LT |
4091 | INIT_LIST_HEAD(&page->lru); |
4092 | #ifdef WANT_PAGE_VIRTUAL | |
4093 | /* The shift won't overflow because ZONE_NORMAL is below 4G. */ | |
4094 | if (!is_highmem_idx(zone)) | |
3212c6be | 4095 | set_page_address(page, __va(pfn << PAGE_SHIFT)); |
1da177e4 | 4096 | #endif |
1da177e4 LT |
4097 | } |
4098 | } | |
4099 | ||
1e548deb | 4100 | static void __meminit zone_init_free_lists(struct zone *zone) |
1da177e4 | 4101 | { |
b2a0ac88 MG |
4102 | int order, t; |
4103 | for_each_migratetype_order(order, t) { | |
4104 | INIT_LIST_HEAD(&zone->free_area[order].free_list[t]); | |
1da177e4 LT |
4105 | zone->free_area[order].nr_free = 0; |
4106 | } | |
4107 | } | |
4108 | ||
4109 | #ifndef __HAVE_ARCH_MEMMAP_INIT | |
4110 | #define memmap_init(size, nid, zone, start_pfn) \ | |
a2f3aa02 | 4111 | memmap_init_zone((size), (nid), (zone), (start_pfn), MEMMAP_EARLY) |
1da177e4 LT |
4112 | #endif |
4113 | ||
4ed7e022 | 4114 | static int __meminit zone_batchsize(struct zone *zone) |
e7c8d5c9 | 4115 | { |
3a6be87f | 4116 | #ifdef CONFIG_MMU |
e7c8d5c9 CL |
4117 | int batch; |
4118 | ||
4119 | /* | |
4120 | * The per-cpu-pages pools are set to around 1000th of the | |
ba56e91c | 4121 | * size of the zone. But no more than 1/2 of a meg. |
e7c8d5c9 CL |
4122 | * |
4123 | * OK, so we don't know how big the cache is. So guess. | |
4124 | */ | |
b40da049 | 4125 | batch = zone->managed_pages / 1024; |
ba56e91c SR |
4126 | if (batch * PAGE_SIZE > 512 * 1024) |
4127 | batch = (512 * 1024) / PAGE_SIZE; | |
e7c8d5c9 CL |
4128 | batch /= 4; /* We effectively *= 4 below */ |
4129 | if (batch < 1) | |
4130 | batch = 1; | |
4131 | ||
4132 | /* | |
0ceaacc9 NP |
4133 | * Clamp the batch to a 2^n - 1 value. Having a power |
4134 | * of 2 value was found to be more likely to have | |
4135 | * suboptimal cache aliasing properties in some cases. | |
e7c8d5c9 | 4136 | * |
0ceaacc9 NP |
4137 | * For example if 2 tasks are alternately allocating |
4138 | * batches of pages, one task can end up with a lot | |
4139 | * of pages of one half of the possible page colors | |
4140 | * and the other with pages of the other colors. | |
e7c8d5c9 | 4141 | */ |
9155203a | 4142 | batch = rounddown_pow_of_two(batch + batch/2) - 1; |
ba56e91c | 4143 | |
e7c8d5c9 | 4144 | return batch; |
3a6be87f DH |
4145 | |
4146 | #else | |
4147 | /* The deferral and batching of frees should be suppressed under NOMMU | |
4148 | * conditions. | |
4149 | * | |
4150 | * The problem is that NOMMU needs to be able to allocate large chunks | |
4151 | * of contiguous memory as there's no hardware page translation to | |
4152 | * assemble apparent contiguous memory from discontiguous pages. | |
4153 | * | |
4154 | * Queueing large contiguous runs of pages for batching, however, | |
4155 | * causes the pages to actually be freed in smaller chunks. As there | |
4156 | * can be a significant delay between the individual batches being | |
4157 | * recycled, this leads to the once large chunks of space being | |
4158 | * fragmented and becoming unavailable for high-order allocations. | |
4159 | */ | |
4160 | return 0; | |
4161 | #endif | |
e7c8d5c9 CL |
4162 | } |
4163 | ||
8d7a8fa9 CS |
4164 | /* |
4165 | * pcp->high and pcp->batch values are related and dependent on one another: | |
4166 | * ->batch must never be higher then ->high. | |
4167 | * The following function updates them in a safe manner without read side | |
4168 | * locking. | |
4169 | * | |
4170 | * Any new users of pcp->batch and pcp->high should ensure they can cope with | |
4171 | * those fields changing asynchronously (acording the the above rule). | |
4172 | * | |
4173 | * mutex_is_locked(&pcp_batch_high_lock) required when calling this function | |
4174 | * outside of boot time (or some other assurance that no concurrent updaters | |
4175 | * exist). | |
4176 | */ | |
4177 | static void pageset_update(struct per_cpu_pages *pcp, unsigned long high, | |
4178 | unsigned long batch) | |
4179 | { | |
4180 | /* start with a fail safe value for batch */ | |
4181 | pcp->batch = 1; | |
4182 | smp_wmb(); | |
4183 | ||
4184 | /* Update high, then batch, in order */ | |
4185 | pcp->high = high; | |
4186 | smp_wmb(); | |
4187 | ||
4188 | pcp->batch = batch; | |
4189 | } | |
4190 | ||
3664033c | 4191 | /* a companion to pageset_set_high() */ |
4008bab7 CS |
4192 | static void pageset_set_batch(struct per_cpu_pageset *p, unsigned long batch) |
4193 | { | |
8d7a8fa9 | 4194 | pageset_update(&p->pcp, 6 * batch, max(1UL, 1 * batch)); |
4008bab7 CS |
4195 | } |
4196 | ||
88c90dbc | 4197 | static void pageset_init(struct per_cpu_pageset *p) |
2caaad41 CL |
4198 | { |
4199 | struct per_cpu_pages *pcp; | |
5f8dcc21 | 4200 | int migratetype; |
2caaad41 | 4201 | |
1c6fe946 MD |
4202 | memset(p, 0, sizeof(*p)); |
4203 | ||
3dfa5721 | 4204 | pcp = &p->pcp; |
2caaad41 | 4205 | pcp->count = 0; |
5f8dcc21 MG |
4206 | for (migratetype = 0; migratetype < MIGRATE_PCPTYPES; migratetype++) |
4207 | INIT_LIST_HEAD(&pcp->lists[migratetype]); | |
2caaad41 CL |
4208 | } |
4209 | ||
88c90dbc CS |
4210 | static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch) |
4211 | { | |
4212 | pageset_init(p); | |
4213 | pageset_set_batch(p, batch); | |
4214 | } | |
4215 | ||
8ad4b1fb | 4216 | /* |
3664033c | 4217 | * pageset_set_high() sets the high water mark for hot per_cpu_pagelist |
8ad4b1fb RS |
4218 | * to the value high for the pageset p. |
4219 | */ | |
3664033c | 4220 | static void pageset_set_high(struct per_cpu_pageset *p, |
8ad4b1fb RS |
4221 | unsigned long high) |
4222 | { | |
8d7a8fa9 CS |
4223 | unsigned long batch = max(1UL, high / 4); |
4224 | if ((high / 4) > (PAGE_SHIFT * 8)) | |
4225 | batch = PAGE_SHIFT * 8; | |
8ad4b1fb | 4226 | |
8d7a8fa9 | 4227 | pageset_update(&p->pcp, high, batch); |
8ad4b1fb RS |
4228 | } |
4229 | ||
169f6c19 CS |
4230 | static void __meminit pageset_set_high_and_batch(struct zone *zone, |
4231 | struct per_cpu_pageset *pcp) | |
56cef2b8 | 4232 | { |
56cef2b8 | 4233 | if (percpu_pagelist_fraction) |
3664033c | 4234 | pageset_set_high(pcp, |
56cef2b8 CS |
4235 | (zone->managed_pages / |
4236 | percpu_pagelist_fraction)); | |
4237 | else | |
4238 | pageset_set_batch(pcp, zone_batchsize(zone)); | |
4239 | } | |
4240 | ||
169f6c19 CS |
4241 | static void __meminit zone_pageset_init(struct zone *zone, int cpu) |
4242 | { | |
4243 | struct per_cpu_pageset *pcp = per_cpu_ptr(zone->pageset, cpu); | |
4244 | ||
4245 | pageset_init(pcp); | |
4246 | pageset_set_high_and_batch(zone, pcp); | |
4247 | } | |
4248 | ||
4ed7e022 | 4249 | static void __meminit setup_zone_pageset(struct zone *zone) |
319774e2 WF |
4250 | { |
4251 | int cpu; | |
319774e2 | 4252 | zone->pageset = alloc_percpu(struct per_cpu_pageset); |
56cef2b8 CS |
4253 | for_each_possible_cpu(cpu) |
4254 | zone_pageset_init(zone, cpu); | |
319774e2 WF |
4255 | } |
4256 | ||
2caaad41 | 4257 | /* |
99dcc3e5 CL |
4258 | * Allocate per cpu pagesets and initialize them. |
4259 | * Before this call only boot pagesets were available. | |
e7c8d5c9 | 4260 | */ |
99dcc3e5 | 4261 | void __init setup_per_cpu_pageset(void) |
e7c8d5c9 | 4262 | { |
99dcc3e5 | 4263 | struct zone *zone; |
e7c8d5c9 | 4264 | |
319774e2 WF |
4265 | for_each_populated_zone(zone) |
4266 | setup_zone_pageset(zone); | |
e7c8d5c9 CL |
4267 | } |
4268 | ||
577a32f6 | 4269 | static noinline __init_refok |
cca448fe | 4270 | int zone_wait_table_init(struct zone *zone, unsigned long zone_size_pages) |
ed8ece2e DH |
4271 | { |
4272 | int i; | |
cca448fe | 4273 | size_t alloc_size; |
ed8ece2e DH |
4274 | |
4275 | /* | |
4276 | * The per-page waitqueue mechanism uses hashed waitqueues | |
4277 | * per zone. | |
4278 | */ | |
02b694de YG |
4279 | zone->wait_table_hash_nr_entries = |
4280 | wait_table_hash_nr_entries(zone_size_pages); | |
4281 | zone->wait_table_bits = | |
4282 | wait_table_bits(zone->wait_table_hash_nr_entries); | |
cca448fe YG |
4283 | alloc_size = zone->wait_table_hash_nr_entries |
4284 | * sizeof(wait_queue_head_t); | |
4285 | ||
cd94b9db | 4286 | if (!slab_is_available()) { |
cca448fe | 4287 | zone->wait_table = (wait_queue_head_t *) |
6782832e SS |
4288 | memblock_virt_alloc_node_nopanic( |
4289 | alloc_size, zone->zone_pgdat->node_id); | |
cca448fe YG |
4290 | } else { |
4291 | /* | |
4292 | * This case means that a zone whose size was 0 gets new memory | |
4293 | * via memory hot-add. | |
4294 | * But it may be the case that a new node was hot-added. In | |
4295 | * this case vmalloc() will not be able to use this new node's | |
4296 | * memory - this wait_table must be initialized to use this new | |
4297 | * node itself as well. | |
4298 | * To use this new node's memory, further consideration will be | |
4299 | * necessary. | |
4300 | */ | |
8691f3a7 | 4301 | zone->wait_table = vmalloc(alloc_size); |
cca448fe YG |
4302 | } |
4303 | if (!zone->wait_table) | |
4304 | return -ENOMEM; | |
ed8ece2e | 4305 | |
b8af2941 | 4306 | for (i = 0; i < zone->wait_table_hash_nr_entries; ++i) |
ed8ece2e | 4307 | init_waitqueue_head(zone->wait_table + i); |
cca448fe YG |
4308 | |
4309 | return 0; | |
ed8ece2e DH |
4310 | } |
4311 | ||
c09b4240 | 4312 | static __meminit void zone_pcp_init(struct zone *zone) |
ed8ece2e | 4313 | { |
99dcc3e5 CL |
4314 | /* |
4315 | * per cpu subsystem is not up at this point. The following code | |
4316 | * relies on the ability of the linker to provide the | |
4317 | * offset of a (static) per cpu variable into the per cpu area. | |
4318 | */ | |
4319 | zone->pageset = &boot_pageset; | |
ed8ece2e | 4320 | |
b38a8725 | 4321 | if (populated_zone(zone)) |
99dcc3e5 CL |
4322 | printk(KERN_DEBUG " %s zone: %lu pages, LIFO batch:%u\n", |
4323 | zone->name, zone->present_pages, | |
4324 | zone_batchsize(zone)); | |
ed8ece2e DH |
4325 | } |
4326 | ||
4ed7e022 | 4327 | int __meminit init_currently_empty_zone(struct zone *zone, |
718127cc | 4328 | unsigned long zone_start_pfn, |
a2f3aa02 DH |
4329 | unsigned long size, |
4330 | enum memmap_context context) | |
ed8ece2e DH |
4331 | { |
4332 | struct pglist_data *pgdat = zone->zone_pgdat; | |
cca448fe YG |
4333 | int ret; |
4334 | ret = zone_wait_table_init(zone, size); | |
4335 | if (ret) | |
4336 | return ret; | |
ed8ece2e DH |
4337 | pgdat->nr_zones = zone_idx(zone) + 1; |
4338 | ||
ed8ece2e DH |
4339 | zone->zone_start_pfn = zone_start_pfn; |
4340 | ||
708614e6 MG |
4341 | mminit_dprintk(MMINIT_TRACE, "memmap_init", |
4342 | "Initialising map node %d zone %lu pfns %lu -> %lu\n", | |
4343 | pgdat->node_id, | |
4344 | (unsigned long)zone_idx(zone), | |
4345 | zone_start_pfn, (zone_start_pfn + size)); | |
4346 | ||
1e548deb | 4347 | zone_init_free_lists(zone); |
718127cc YG |
4348 | |
4349 | return 0; | |
ed8ece2e DH |
4350 | } |
4351 | ||
0ee332c1 | 4352 | #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP |
c713216d MG |
4353 | #ifndef CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID |
4354 | /* | |
4355 | * Required by SPARSEMEM. Given a PFN, return what node the PFN is on. | |
4356 | * Architectures may implement their own version but if add_active_range() | |
4357 | * was used and there are no special requirements, this is a convenient | |
4358 | * alternative | |
4359 | */ | |
f2dbcfa7 | 4360 | int __meminit __early_pfn_to_nid(unsigned long pfn) |
c713216d | 4361 | { |
c13291a5 | 4362 | unsigned long start_pfn, end_pfn; |
e76b63f8 | 4363 | int nid; |
7c243c71 RA |
4364 | /* |
4365 | * NOTE: The following SMP-unsafe globals are only used early in boot | |
4366 | * when the kernel is running single-threaded. | |
4367 | */ | |
4368 | static unsigned long __meminitdata last_start_pfn, last_end_pfn; | |
4369 | static int __meminitdata last_nid; | |
4370 | ||
4371 | if (last_start_pfn <= pfn && pfn < last_end_pfn) | |
4372 | return last_nid; | |
c713216d | 4373 | |
e76b63f8 YL |
4374 | nid = memblock_search_pfn_nid(pfn, &start_pfn, &end_pfn); |
4375 | if (nid != -1) { | |
4376 | last_start_pfn = start_pfn; | |
4377 | last_end_pfn = end_pfn; | |
4378 | last_nid = nid; | |
4379 | } | |
4380 | ||
4381 | return nid; | |
c713216d MG |
4382 | } |
4383 | #endif /* CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID */ | |
4384 | ||
f2dbcfa7 KH |
4385 | int __meminit early_pfn_to_nid(unsigned long pfn) |
4386 | { | |
cc2559bc KH |
4387 | int nid; |
4388 | ||
4389 | nid = __early_pfn_to_nid(pfn); | |
4390 | if (nid >= 0) | |
4391 | return nid; | |
4392 | /* just returns 0 */ | |
4393 | return 0; | |
f2dbcfa7 KH |
4394 | } |
4395 | ||
cc2559bc KH |
4396 | #ifdef CONFIG_NODES_SPAN_OTHER_NODES |
4397 | bool __meminit early_pfn_in_nid(unsigned long pfn, int node) | |
4398 | { | |
4399 | int nid; | |
4400 | ||
4401 | nid = __early_pfn_to_nid(pfn); | |
4402 | if (nid >= 0 && nid != node) | |
4403 | return false; | |
4404 | return true; | |
4405 | } | |
4406 | #endif | |
f2dbcfa7 | 4407 | |
c713216d | 4408 | /** |
6782832e | 4409 | * free_bootmem_with_active_regions - Call memblock_free_early_nid for each active range |
88ca3b94 | 4410 | * @nid: The node to free memory on. If MAX_NUMNODES, all nodes are freed. |
6782832e | 4411 | * @max_low_pfn: The highest PFN that will be passed to memblock_free_early_nid |
c713216d MG |
4412 | * |
4413 | * If an architecture guarantees that all ranges registered with | |
4414 | * add_active_ranges() contain no holes and may be freed, this | |
6782832e SS |
4415 | * this function may be used instead of calling memblock_free_early_nid() |
4416 | * manually. | |
c713216d | 4417 | */ |
c13291a5 | 4418 | void __init free_bootmem_with_active_regions(int nid, unsigned long max_low_pfn) |
cc289894 | 4419 | { |
c13291a5 TH |
4420 | unsigned long start_pfn, end_pfn; |
4421 | int i, this_nid; | |
edbe7d23 | 4422 | |
c13291a5 TH |
4423 | for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, &this_nid) { |
4424 | start_pfn = min(start_pfn, max_low_pfn); | |
4425 | end_pfn = min(end_pfn, max_low_pfn); | |
edbe7d23 | 4426 | |
c13291a5 | 4427 | if (start_pfn < end_pfn) |
6782832e SS |
4428 | memblock_free_early_nid(PFN_PHYS(start_pfn), |
4429 | (end_pfn - start_pfn) << PAGE_SHIFT, | |
4430 | this_nid); | |
edbe7d23 | 4431 | } |
edbe7d23 | 4432 | } |
edbe7d23 | 4433 | |
c713216d MG |
4434 | /** |
4435 | * sparse_memory_present_with_active_regions - Call memory_present for each active range | |
88ca3b94 | 4436 | * @nid: The node to call memory_present for. If MAX_NUMNODES, all nodes will be used. |
c713216d MG |
4437 | * |
4438 | * If an architecture guarantees that all ranges registered with | |
4439 | * add_active_ranges() contain no holes and may be freed, this | |
88ca3b94 | 4440 | * function may be used instead of calling memory_present() manually. |
c713216d MG |
4441 | */ |
4442 | void __init sparse_memory_present_with_active_regions(int nid) | |
4443 | { | |
c13291a5 TH |
4444 | unsigned long start_pfn, end_pfn; |
4445 | int i, this_nid; | |
c713216d | 4446 | |
c13291a5 TH |
4447 | for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, &this_nid) |
4448 | memory_present(this_nid, start_pfn, end_pfn); | |
c713216d MG |
4449 | } |
4450 | ||
4451 | /** | |
4452 | * get_pfn_range_for_nid - Return the start and end page frames for a node | |
88ca3b94 RD |
4453 | * @nid: The nid to return the range for. If MAX_NUMNODES, the min and max PFN are returned. |
4454 | * @start_pfn: Passed by reference. On return, it will have the node start_pfn. | |
4455 | * @end_pfn: Passed by reference. On return, it will have the node end_pfn. | |
c713216d MG |
4456 | * |
4457 | * It returns the start and end page frame of a node based on information | |
4458 | * provided by an arch calling add_active_range(). If called for a node | |
4459 | * with no available memory, a warning is printed and the start and end | |
88ca3b94 | 4460 | * PFNs will be 0. |
c713216d | 4461 | */ |
a3142c8e | 4462 | void __meminit get_pfn_range_for_nid(unsigned int nid, |
c713216d MG |
4463 | unsigned long *start_pfn, unsigned long *end_pfn) |
4464 | { | |
c13291a5 | 4465 | unsigned long this_start_pfn, this_end_pfn; |
c713216d | 4466 | int i; |
c13291a5 | 4467 | |
c713216d MG |
4468 | *start_pfn = -1UL; |
4469 | *end_pfn = 0; | |
4470 | ||
c13291a5 TH |
4471 | for_each_mem_pfn_range(i, nid, &this_start_pfn, &this_end_pfn, NULL) { |
4472 | *start_pfn = min(*start_pfn, this_start_pfn); | |
4473 | *end_pfn = max(*end_pfn, this_end_pfn); | |
c713216d MG |
4474 | } |
4475 | ||
633c0666 | 4476 | if (*start_pfn == -1UL) |
c713216d | 4477 | *start_pfn = 0; |
c713216d MG |
4478 | } |
4479 | ||
2a1e274a MG |
4480 | /* |
4481 | * This finds a zone that can be used for ZONE_MOVABLE pages. The | |
4482 | * assumption is made that zones within a node are ordered in monotonic | |
4483 | * increasing memory addresses so that the "highest" populated zone is used | |
4484 | */ | |
b69a7288 | 4485 | static void __init find_usable_zone_for_movable(void) |
2a1e274a MG |
4486 | { |
4487 | int zone_index; | |
4488 | for (zone_index = MAX_NR_ZONES - 1; zone_index >= 0; zone_index--) { | |
4489 | if (zone_index == ZONE_MOVABLE) | |
4490 | continue; | |
4491 | ||
4492 | if (arch_zone_highest_possible_pfn[zone_index] > | |
4493 | arch_zone_lowest_possible_pfn[zone_index]) | |
4494 | break; | |
4495 | } | |
4496 | ||
4497 | VM_BUG_ON(zone_index == -1); | |
4498 | movable_zone = zone_index; | |
4499 | } | |
4500 | ||
4501 | /* | |
4502 | * The zone ranges provided by the architecture do not include ZONE_MOVABLE | |
25985edc | 4503 | * because it is sized independent of architecture. Unlike the other zones, |
2a1e274a MG |
4504 | * the starting point for ZONE_MOVABLE is not fixed. It may be different |
4505 | * in each node depending on the size of each node and how evenly kernelcore | |
4506 | * is distributed. This helper function adjusts the zone ranges | |
4507 | * provided by the architecture for a given node by using the end of the | |
4508 | * highest usable zone for ZONE_MOVABLE. This preserves the assumption that | |
4509 | * zones within a node are in order of monotonic increases memory addresses | |
4510 | */ | |
b69a7288 | 4511 | static void __meminit adjust_zone_range_for_zone_movable(int nid, |
2a1e274a MG |
4512 | unsigned long zone_type, |
4513 | unsigned long node_start_pfn, | |
4514 | unsigned long node_end_pfn, | |
4515 | unsigned long *zone_start_pfn, | |
4516 | unsigned long *zone_end_pfn) | |
4517 | { | |
4518 | /* Only adjust if ZONE_MOVABLE is on this node */ | |
4519 | if (zone_movable_pfn[nid]) { | |
4520 | /* Size ZONE_MOVABLE */ | |
4521 | if (zone_type == ZONE_MOVABLE) { | |
4522 | *zone_start_pfn = zone_movable_pfn[nid]; | |
4523 | *zone_end_pfn = min(node_end_pfn, | |
4524 | arch_zone_highest_possible_pfn[movable_zone]); | |
4525 | ||
4526 | /* Adjust for ZONE_MOVABLE starting within this range */ | |
4527 | } else if (*zone_start_pfn < zone_movable_pfn[nid] && | |
4528 | *zone_end_pfn > zone_movable_pfn[nid]) { | |
4529 | *zone_end_pfn = zone_movable_pfn[nid]; | |
4530 | ||
4531 | /* Check if this whole range is within ZONE_MOVABLE */ | |
4532 | } else if (*zone_start_pfn >= zone_movable_pfn[nid]) | |
4533 | *zone_start_pfn = *zone_end_pfn; | |
4534 | } | |
4535 | } | |
4536 | ||
c713216d MG |
4537 | /* |
4538 | * Return the number of pages a zone spans in a node, including holes | |
4539 | * present_pages = zone_spanned_pages_in_node() - zone_absent_pages_in_node() | |
4540 | */ | |
6ea6e688 | 4541 | static unsigned long __meminit zone_spanned_pages_in_node(int nid, |
c713216d | 4542 | unsigned long zone_type, |
7960aedd ZY |
4543 | unsigned long node_start_pfn, |
4544 | unsigned long node_end_pfn, | |
c713216d MG |
4545 | unsigned long *ignored) |
4546 | { | |
c713216d MG |
4547 | unsigned long zone_start_pfn, zone_end_pfn; |
4548 | ||
7960aedd | 4549 | /* Get the start and end of the zone */ |
c713216d MG |
4550 | zone_start_pfn = arch_zone_lowest_possible_pfn[zone_type]; |
4551 | zone_end_pfn = arch_zone_highest_possible_pfn[zone_type]; | |
2a1e274a MG |
4552 | adjust_zone_range_for_zone_movable(nid, zone_type, |
4553 | node_start_pfn, node_end_pfn, | |
4554 | &zone_start_pfn, &zone_end_pfn); | |
c713216d MG |
4555 | |
4556 | /* Check that this node has pages within the zone's required range */ | |
4557 | if (zone_end_pfn < node_start_pfn || zone_start_pfn > node_end_pfn) | |
4558 | return 0; | |
4559 | ||
4560 | /* Move the zone boundaries inside the node if necessary */ | |
4561 | zone_end_pfn = min(zone_end_pfn, node_end_pfn); | |
4562 | zone_start_pfn = max(zone_start_pfn, node_start_pfn); | |
4563 | ||
4564 | /* Return the spanned pages */ | |
4565 | return zone_end_pfn - zone_start_pfn; | |
4566 | } | |
4567 | ||
4568 | /* | |
4569 | * Return the number of holes in a range on a node. If nid is MAX_NUMNODES, | |
88ca3b94 | 4570 | * then all holes in the requested range will be accounted for. |
c713216d | 4571 | */ |
32996250 | 4572 | unsigned long __meminit __absent_pages_in_range(int nid, |
c713216d MG |
4573 | unsigned long range_start_pfn, |
4574 | unsigned long range_end_pfn) | |
4575 | { | |
96e907d1 TH |
4576 | unsigned long nr_absent = range_end_pfn - range_start_pfn; |
4577 | unsigned long start_pfn, end_pfn; | |
4578 | int i; | |
c713216d | 4579 | |
96e907d1 TH |
4580 | for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) { |
4581 | start_pfn = clamp(start_pfn, range_start_pfn, range_end_pfn); | |
4582 | end_pfn = clamp(end_pfn, range_start_pfn, range_end_pfn); | |
4583 | nr_absent -= end_pfn - start_pfn; | |
c713216d | 4584 | } |
96e907d1 | 4585 | return nr_absent; |
c713216d MG |
4586 | } |
4587 | ||
4588 | /** | |
4589 | * absent_pages_in_range - Return number of page frames in holes within a range | |
4590 | * @start_pfn: The start PFN to start searching for holes | |
4591 | * @end_pfn: The end PFN to stop searching for holes | |
4592 | * | |
88ca3b94 | 4593 | * It returns the number of pages frames in memory holes within a range. |
c713216d MG |
4594 | */ |
4595 | unsigned long __init absent_pages_in_range(unsigned long start_pfn, | |
4596 | unsigned long end_pfn) | |
4597 | { | |
4598 | return __absent_pages_in_range(MAX_NUMNODES, start_pfn, end_pfn); | |
4599 | } | |
4600 | ||
4601 | /* Return the number of page frames in holes in a zone on a node */ | |
6ea6e688 | 4602 | static unsigned long __meminit zone_absent_pages_in_node(int nid, |
c713216d | 4603 | unsigned long zone_type, |
7960aedd ZY |
4604 | unsigned long node_start_pfn, |
4605 | unsigned long node_end_pfn, | |
c713216d MG |
4606 | unsigned long *ignored) |
4607 | { | |
96e907d1 TH |
4608 | unsigned long zone_low = arch_zone_lowest_possible_pfn[zone_type]; |
4609 | unsigned long zone_high = arch_zone_highest_possible_pfn[zone_type]; | |
9c7cd687 MG |
4610 | unsigned long zone_start_pfn, zone_end_pfn; |
4611 | ||
96e907d1 TH |
4612 | zone_start_pfn = clamp(node_start_pfn, zone_low, zone_high); |
4613 | zone_end_pfn = clamp(node_end_pfn, zone_low, zone_high); | |
9c7cd687 | 4614 | |
2a1e274a MG |
4615 | adjust_zone_range_for_zone_movable(nid, zone_type, |
4616 | node_start_pfn, node_end_pfn, | |
4617 | &zone_start_pfn, &zone_end_pfn); | |
9c7cd687 | 4618 | return __absent_pages_in_range(nid, zone_start_pfn, zone_end_pfn); |
c713216d | 4619 | } |
0e0b864e | 4620 | |
0ee332c1 | 4621 | #else /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */ |
6ea6e688 | 4622 | static inline unsigned long __meminit zone_spanned_pages_in_node(int nid, |
c713216d | 4623 | unsigned long zone_type, |
7960aedd ZY |
4624 | unsigned long node_start_pfn, |
4625 | unsigned long node_end_pfn, | |
c713216d MG |
4626 | unsigned long *zones_size) |
4627 | { | |
4628 | return zones_size[zone_type]; | |
4629 | } | |
4630 | ||
6ea6e688 | 4631 | static inline unsigned long __meminit zone_absent_pages_in_node(int nid, |
c713216d | 4632 | unsigned long zone_type, |
7960aedd ZY |
4633 | unsigned long node_start_pfn, |
4634 | unsigned long node_end_pfn, | |
c713216d MG |
4635 | unsigned long *zholes_size) |
4636 | { | |
4637 | if (!zholes_size) | |
4638 | return 0; | |
4639 | ||
4640 | return zholes_size[zone_type]; | |
4641 | } | |
20e6926d | 4642 | |
0ee332c1 | 4643 | #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */ |
c713216d | 4644 | |
a3142c8e | 4645 | static void __meminit calculate_node_totalpages(struct pglist_data *pgdat, |
7960aedd ZY |
4646 | unsigned long node_start_pfn, |
4647 | unsigned long node_end_pfn, | |
4648 | unsigned long *zones_size, | |
4649 | unsigned long *zholes_size) | |
c713216d MG |
4650 | { |
4651 | unsigned long realtotalpages, totalpages = 0; | |
4652 | enum zone_type i; | |
4653 | ||
4654 | for (i = 0; i < MAX_NR_ZONES; i++) | |
4655 | totalpages += zone_spanned_pages_in_node(pgdat->node_id, i, | |
7960aedd ZY |
4656 | node_start_pfn, |
4657 | node_end_pfn, | |
4658 | zones_size); | |
c713216d MG |
4659 | pgdat->node_spanned_pages = totalpages; |
4660 | ||
4661 | realtotalpages = totalpages; | |
4662 | for (i = 0; i < MAX_NR_ZONES; i++) | |
4663 | realtotalpages -= | |
4664 | zone_absent_pages_in_node(pgdat->node_id, i, | |
7960aedd ZY |
4665 | node_start_pfn, node_end_pfn, |
4666 | zholes_size); | |
c713216d MG |
4667 | pgdat->node_present_pages = realtotalpages; |
4668 | printk(KERN_DEBUG "On node %d totalpages: %lu\n", pgdat->node_id, | |
4669 | realtotalpages); | |
4670 | } | |
4671 | ||
835c134e MG |
4672 | #ifndef CONFIG_SPARSEMEM |
4673 | /* | |
4674 | * Calculate the size of the zone->blockflags rounded to an unsigned long | |
d9c23400 MG |
4675 | * Start by making sure zonesize is a multiple of pageblock_order by rounding |
4676 | * up. Then use 1 NR_PAGEBLOCK_BITS worth of bits per pageblock, finally | |
835c134e MG |
4677 | * round what is now in bits to nearest long in bits, then return it in |
4678 | * bytes. | |
4679 | */ | |
7c45512d | 4680 | static unsigned long __init usemap_size(unsigned long zone_start_pfn, unsigned long zonesize) |
835c134e MG |
4681 | { |
4682 | unsigned long usemapsize; | |
4683 | ||
7c45512d | 4684 | zonesize += zone_start_pfn & (pageblock_nr_pages-1); |
d9c23400 MG |
4685 | usemapsize = roundup(zonesize, pageblock_nr_pages); |
4686 | usemapsize = usemapsize >> pageblock_order; | |
835c134e MG |
4687 | usemapsize *= NR_PAGEBLOCK_BITS; |
4688 | usemapsize = roundup(usemapsize, 8 * sizeof(unsigned long)); | |
4689 | ||
4690 | return usemapsize / 8; | |
4691 | } | |
4692 | ||
4693 | static void __init setup_usemap(struct pglist_data *pgdat, | |
7c45512d LT |
4694 | struct zone *zone, |
4695 | unsigned long zone_start_pfn, | |
4696 | unsigned long zonesize) | |
835c134e | 4697 | { |
7c45512d | 4698 | unsigned long usemapsize = usemap_size(zone_start_pfn, zonesize); |
835c134e | 4699 | zone->pageblock_flags = NULL; |
58a01a45 | 4700 | if (usemapsize) |
6782832e SS |
4701 | zone->pageblock_flags = |
4702 | memblock_virt_alloc_node_nopanic(usemapsize, | |
4703 | pgdat->node_id); | |
835c134e MG |
4704 | } |
4705 | #else | |
7c45512d LT |
4706 | static inline void setup_usemap(struct pglist_data *pgdat, struct zone *zone, |
4707 | unsigned long zone_start_pfn, unsigned long zonesize) {} | |
835c134e MG |
4708 | #endif /* CONFIG_SPARSEMEM */ |
4709 | ||
d9c23400 | 4710 | #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE |
ba72cb8c | 4711 | |
d9c23400 | 4712 | /* Initialise the number of pages represented by NR_PAGEBLOCK_BITS */ |
15ca220e | 4713 | void __paginginit set_pageblock_order(void) |
d9c23400 | 4714 | { |
955c1cd7 AM |
4715 | unsigned int order; |
4716 | ||
d9c23400 MG |
4717 | /* Check that pageblock_nr_pages has not already been setup */ |
4718 | if (pageblock_order) | |
4719 | return; | |
4720 | ||
955c1cd7 AM |
4721 | if (HPAGE_SHIFT > PAGE_SHIFT) |
4722 | order = HUGETLB_PAGE_ORDER; | |
4723 | else | |
4724 | order = MAX_ORDER - 1; | |
4725 | ||
d9c23400 MG |
4726 | /* |
4727 | * Assume the largest contiguous order of interest is a huge page. | |
955c1cd7 AM |
4728 | * This value may be variable depending on boot parameters on IA64 and |
4729 | * powerpc. | |
d9c23400 MG |
4730 | */ |
4731 | pageblock_order = order; | |
4732 | } | |
4733 | #else /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */ | |
4734 | ||
ba72cb8c MG |
4735 | /* |
4736 | * When CONFIG_HUGETLB_PAGE_SIZE_VARIABLE is not set, set_pageblock_order() | |
955c1cd7 AM |
4737 | * is unused as pageblock_order is set at compile-time. See |
4738 | * include/linux/pageblock-flags.h for the values of pageblock_order based on | |
4739 | * the kernel config | |
ba72cb8c | 4740 | */ |
15ca220e | 4741 | void __paginginit set_pageblock_order(void) |
ba72cb8c | 4742 | { |
ba72cb8c | 4743 | } |
d9c23400 MG |
4744 | |
4745 | #endif /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */ | |
4746 | ||
01cefaef JL |
4747 | static unsigned long __paginginit calc_memmap_size(unsigned long spanned_pages, |
4748 | unsigned long present_pages) | |
4749 | { | |
4750 | unsigned long pages = spanned_pages; | |
4751 | ||
4752 | /* | |
4753 | * Provide a more accurate estimation if there are holes within | |
4754 | * the zone and SPARSEMEM is in use. If there are holes within the | |
4755 | * zone, each populated memory region may cost us one or two extra | |
4756 | * memmap pages due to alignment because memmap pages for each | |
4757 | * populated regions may not naturally algined on page boundary. | |
4758 | * So the (present_pages >> 4) heuristic is a tradeoff for that. | |
4759 | */ | |
4760 | if (spanned_pages > present_pages + (present_pages >> 4) && | |
4761 | IS_ENABLED(CONFIG_SPARSEMEM)) | |
4762 | pages = present_pages; | |
4763 | ||
4764 | return PAGE_ALIGN(pages * sizeof(struct page)) >> PAGE_SHIFT; | |
4765 | } | |
4766 | ||
1da177e4 LT |
4767 | /* |
4768 | * Set up the zone data structures: | |
4769 | * - mark all pages reserved | |
4770 | * - mark all memory queues empty | |
4771 | * - clear the memory bitmaps | |
6527af5d MK |
4772 | * |
4773 | * NOTE: pgdat should get zeroed by caller. | |
1da177e4 | 4774 | */ |
b5a0e011 | 4775 | static void __paginginit free_area_init_core(struct pglist_data *pgdat, |
7960aedd | 4776 | unsigned long node_start_pfn, unsigned long node_end_pfn, |
1da177e4 LT |
4777 | unsigned long *zones_size, unsigned long *zholes_size) |
4778 | { | |
2f1b6248 | 4779 | enum zone_type j; |
ed8ece2e | 4780 | int nid = pgdat->node_id; |
1da177e4 | 4781 | unsigned long zone_start_pfn = pgdat->node_start_pfn; |
718127cc | 4782 | int ret; |
1da177e4 | 4783 | |
208d54e5 | 4784 | pgdat_resize_init(pgdat); |
8177a420 AA |
4785 | #ifdef CONFIG_NUMA_BALANCING |
4786 | spin_lock_init(&pgdat->numabalancing_migrate_lock); | |
4787 | pgdat->numabalancing_migrate_nr_pages = 0; | |
4788 | pgdat->numabalancing_migrate_next_window = jiffies; | |
4789 | #endif | |
1da177e4 | 4790 | init_waitqueue_head(&pgdat->kswapd_wait); |
5515061d | 4791 | init_waitqueue_head(&pgdat->pfmemalloc_wait); |
52d4b9ac | 4792 | pgdat_page_cgroup_init(pgdat); |
5f63b720 | 4793 | |
1da177e4 LT |
4794 | for (j = 0; j < MAX_NR_ZONES; j++) { |
4795 | struct zone *zone = pgdat->node_zones + j; | |
9feedc9d | 4796 | unsigned long size, realsize, freesize, memmap_pages; |
1da177e4 | 4797 | |
7960aedd ZY |
4798 | size = zone_spanned_pages_in_node(nid, j, node_start_pfn, |
4799 | node_end_pfn, zones_size); | |
9feedc9d | 4800 | realsize = freesize = size - zone_absent_pages_in_node(nid, j, |
7960aedd ZY |
4801 | node_start_pfn, |
4802 | node_end_pfn, | |
c713216d | 4803 | zholes_size); |
1da177e4 | 4804 | |
0e0b864e | 4805 | /* |
9feedc9d | 4806 | * Adjust freesize so that it accounts for how much memory |
0e0b864e MG |
4807 | * is used by this zone for memmap. This affects the watermark |
4808 | * and per-cpu initialisations | |
4809 | */ | |
01cefaef | 4810 | memmap_pages = calc_memmap_size(size, realsize); |
9feedc9d JL |
4811 | if (freesize >= memmap_pages) { |
4812 | freesize -= memmap_pages; | |
5594c8c8 YL |
4813 | if (memmap_pages) |
4814 | printk(KERN_DEBUG | |
4815 | " %s zone: %lu pages used for memmap\n", | |
4816 | zone_names[j], memmap_pages); | |
0e0b864e MG |
4817 | } else |
4818 | printk(KERN_WARNING | |
9feedc9d JL |
4819 | " %s zone: %lu pages exceeds freesize %lu\n", |
4820 | zone_names[j], memmap_pages, freesize); | |
0e0b864e | 4821 | |
6267276f | 4822 | /* Account for reserved pages */ |
9feedc9d JL |
4823 | if (j == 0 && freesize > dma_reserve) { |
4824 | freesize -= dma_reserve; | |
d903ef9f | 4825 | printk(KERN_DEBUG " %s zone: %lu pages reserved\n", |
6267276f | 4826 | zone_names[0], dma_reserve); |
0e0b864e MG |
4827 | } |
4828 | ||
98d2b0eb | 4829 | if (!is_highmem_idx(j)) |
9feedc9d | 4830 | nr_kernel_pages += freesize; |
01cefaef JL |
4831 | /* Charge for highmem memmap if there are enough kernel pages */ |
4832 | else if (nr_kernel_pages > memmap_pages * 2) | |
4833 | nr_kernel_pages -= memmap_pages; | |
9feedc9d | 4834 | nr_all_pages += freesize; |
1da177e4 LT |
4835 | |
4836 | zone->spanned_pages = size; | |
306f2e9e | 4837 | zone->present_pages = realsize; |
9feedc9d JL |
4838 | /* |
4839 | * Set an approximate value for lowmem here, it will be adjusted | |
4840 | * when the bootmem allocator frees pages into the buddy system. | |
4841 | * And all highmem pages will be managed by the buddy system. | |
4842 | */ | |
4843 | zone->managed_pages = is_highmem_idx(j) ? realsize : freesize; | |
9614634f | 4844 | #ifdef CONFIG_NUMA |
d5f541ed | 4845 | zone->node = nid; |
9feedc9d | 4846 | zone->min_unmapped_pages = (freesize*sysctl_min_unmapped_ratio) |
9614634f | 4847 | / 100; |
9feedc9d | 4848 | zone->min_slab_pages = (freesize * sysctl_min_slab_ratio) / 100; |
9614634f | 4849 | #endif |
1da177e4 LT |
4850 | zone->name = zone_names[j]; |
4851 | spin_lock_init(&zone->lock); | |
4852 | spin_lock_init(&zone->lru_lock); | |
bdc8cb98 | 4853 | zone_seqlock_init(zone); |
1da177e4 | 4854 | zone->zone_pgdat = pgdat; |
ed8ece2e | 4855 | zone_pcp_init(zone); |
81c0a2bb JW |
4856 | |
4857 | /* For bootup, initialized properly in watermark setup */ | |
4858 | mod_zone_page_state(zone, NR_ALLOC_BATCH, zone->managed_pages); | |
4859 | ||
bea8c150 | 4860 | lruvec_init(&zone->lruvec); |
1da177e4 LT |
4861 | if (!size) |
4862 | continue; | |
4863 | ||
955c1cd7 | 4864 | set_pageblock_order(); |
7c45512d | 4865 | setup_usemap(pgdat, zone, zone_start_pfn, size); |
a2f3aa02 DH |
4866 | ret = init_currently_empty_zone(zone, zone_start_pfn, |
4867 | size, MEMMAP_EARLY); | |
718127cc | 4868 | BUG_ON(ret); |
76cdd58e | 4869 | memmap_init(size, nid, j, zone_start_pfn); |
1da177e4 | 4870 | zone_start_pfn += size; |
1da177e4 LT |
4871 | } |
4872 | } | |
4873 | ||
577a32f6 | 4874 | static void __init_refok alloc_node_mem_map(struct pglist_data *pgdat) |
1da177e4 | 4875 | { |
1da177e4 LT |
4876 | /* Skip empty nodes */ |
4877 | if (!pgdat->node_spanned_pages) | |
4878 | return; | |
4879 | ||
d41dee36 | 4880 | #ifdef CONFIG_FLAT_NODE_MEM_MAP |
1da177e4 LT |
4881 | /* ia64 gets its own node_mem_map, before this, without bootmem */ |
4882 | if (!pgdat->node_mem_map) { | |
e984bb43 | 4883 | unsigned long size, start, end; |
d41dee36 AW |
4884 | struct page *map; |
4885 | ||
e984bb43 BP |
4886 | /* |
4887 | * The zone's endpoints aren't required to be MAX_ORDER | |
4888 | * aligned but the node_mem_map endpoints must be in order | |
4889 | * for the buddy allocator to function correctly. | |
4890 | */ | |
4891 | start = pgdat->node_start_pfn & ~(MAX_ORDER_NR_PAGES - 1); | |
108bcc96 | 4892 | end = pgdat_end_pfn(pgdat); |
e984bb43 BP |
4893 | end = ALIGN(end, MAX_ORDER_NR_PAGES); |
4894 | size = (end - start) * sizeof(struct page); | |
6f167ec7 DH |
4895 | map = alloc_remap(pgdat->node_id, size); |
4896 | if (!map) | |
6782832e SS |
4897 | map = memblock_virt_alloc_node_nopanic(size, |
4898 | pgdat->node_id); | |
e984bb43 | 4899 | pgdat->node_mem_map = map + (pgdat->node_start_pfn - start); |
1da177e4 | 4900 | } |
12d810c1 | 4901 | #ifndef CONFIG_NEED_MULTIPLE_NODES |
1da177e4 LT |
4902 | /* |
4903 | * With no DISCONTIG, the global mem_map is just set as node 0's | |
4904 | */ | |
c713216d | 4905 | if (pgdat == NODE_DATA(0)) { |
1da177e4 | 4906 | mem_map = NODE_DATA(0)->node_mem_map; |
0ee332c1 | 4907 | #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP |
c713216d | 4908 | if (page_to_pfn(mem_map) != pgdat->node_start_pfn) |
467bc461 | 4909 | mem_map -= (pgdat->node_start_pfn - ARCH_PFN_OFFSET); |
0ee332c1 | 4910 | #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */ |
c713216d | 4911 | } |
1da177e4 | 4912 | #endif |
d41dee36 | 4913 | #endif /* CONFIG_FLAT_NODE_MEM_MAP */ |
1da177e4 LT |
4914 | } |
4915 | ||
9109fb7b JW |
4916 | void __paginginit free_area_init_node(int nid, unsigned long *zones_size, |
4917 | unsigned long node_start_pfn, unsigned long *zholes_size) | |
1da177e4 | 4918 | { |
9109fb7b | 4919 | pg_data_t *pgdat = NODE_DATA(nid); |
7960aedd ZY |
4920 | unsigned long start_pfn = 0; |
4921 | unsigned long end_pfn = 0; | |
9109fb7b | 4922 | |
88fdf75d | 4923 | /* pg_data_t should be reset to zero when it's allocated */ |
8783b6e2 | 4924 | WARN_ON(pgdat->nr_zones || pgdat->classzone_idx); |
88fdf75d | 4925 | |
1da177e4 LT |
4926 | pgdat->node_id = nid; |
4927 | pgdat->node_start_pfn = node_start_pfn; | |
7960aedd ZY |
4928 | #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP |
4929 | get_pfn_range_for_nid(nid, &start_pfn, &end_pfn); | |
4930 | #endif | |
4931 | calculate_node_totalpages(pgdat, start_pfn, end_pfn, | |
4932 | zones_size, zholes_size); | |
1da177e4 LT |
4933 | |
4934 | alloc_node_mem_map(pgdat); | |
e8c27ac9 YL |
4935 | #ifdef CONFIG_FLAT_NODE_MEM_MAP |
4936 | printk(KERN_DEBUG "free_area_init_node: node %d, pgdat %08lx, node_mem_map %08lx\n", | |
4937 | nid, (unsigned long)pgdat, | |
4938 | (unsigned long)pgdat->node_mem_map); | |
4939 | #endif | |
1da177e4 | 4940 | |
7960aedd ZY |
4941 | free_area_init_core(pgdat, start_pfn, end_pfn, |
4942 | zones_size, zholes_size); | |
1da177e4 LT |
4943 | } |
4944 | ||
0ee332c1 | 4945 | #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP |
418508c1 MS |
4946 | |
4947 | #if MAX_NUMNODES > 1 | |
4948 | /* | |
4949 | * Figure out the number of possible node ids. | |
4950 | */ | |
f9872caf | 4951 | void __init setup_nr_node_ids(void) |
418508c1 MS |
4952 | { |
4953 | unsigned int node; | |
4954 | unsigned int highest = 0; | |
4955 | ||
4956 | for_each_node_mask(node, node_possible_map) | |
4957 | highest = node; | |
4958 | nr_node_ids = highest + 1; | |
4959 | } | |
418508c1 MS |
4960 | #endif |
4961 | ||
1e01979c TH |
4962 | /** |
4963 | * node_map_pfn_alignment - determine the maximum internode alignment | |
4964 | * | |
4965 | * This function should be called after node map is populated and sorted. | |
4966 | * It calculates the maximum power of two alignment which can distinguish | |
4967 | * all the nodes. | |
4968 | * | |
4969 | * For example, if all nodes are 1GiB and aligned to 1GiB, the return value | |
4970 | * would indicate 1GiB alignment with (1 << (30 - PAGE_SHIFT)). If the | |
4971 | * nodes are shifted by 256MiB, 256MiB. Note that if only the last node is | |
4972 | * shifted, 1GiB is enough and this function will indicate so. | |
4973 | * | |
4974 | * This is used to test whether pfn -> nid mapping of the chosen memory | |
4975 | * model has fine enough granularity to avoid incorrect mapping for the | |
4976 | * populated node map. | |
4977 | * | |
4978 | * Returns the determined alignment in pfn's. 0 if there is no alignment | |
4979 | * requirement (single node). | |
4980 | */ | |
4981 | unsigned long __init node_map_pfn_alignment(void) | |
4982 | { | |
4983 | unsigned long accl_mask = 0, last_end = 0; | |
c13291a5 | 4984 | unsigned long start, end, mask; |
1e01979c | 4985 | int last_nid = -1; |
c13291a5 | 4986 | int i, nid; |
1e01979c | 4987 | |
c13291a5 | 4988 | for_each_mem_pfn_range(i, MAX_NUMNODES, &start, &end, &nid) { |
1e01979c TH |
4989 | if (!start || last_nid < 0 || last_nid == nid) { |
4990 | last_nid = nid; | |
4991 | last_end = end; | |
4992 | continue; | |
4993 | } | |
4994 | ||
4995 | /* | |
4996 | * Start with a mask granular enough to pin-point to the | |
4997 | * start pfn and tick off bits one-by-one until it becomes | |
4998 | * too coarse to separate the current node from the last. | |
4999 | */ | |
5000 | mask = ~((1 << __ffs(start)) - 1); | |
5001 | while (mask && last_end <= (start & (mask << 1))) | |
5002 | mask <<= 1; | |
5003 | ||
5004 | /* accumulate all internode masks */ | |
5005 | accl_mask |= mask; | |
5006 | } | |
5007 | ||
5008 | /* convert mask to number of pages */ | |
5009 | return ~accl_mask + 1; | |
5010 | } | |
5011 | ||
a6af2bc3 | 5012 | /* Find the lowest pfn for a node */ |
b69a7288 | 5013 | static unsigned long __init find_min_pfn_for_node(int nid) |
c713216d | 5014 | { |
a6af2bc3 | 5015 | unsigned long min_pfn = ULONG_MAX; |
c13291a5 TH |
5016 | unsigned long start_pfn; |
5017 | int i; | |
1abbfb41 | 5018 | |
c13291a5 TH |
5019 | for_each_mem_pfn_range(i, nid, &start_pfn, NULL, NULL) |
5020 | min_pfn = min(min_pfn, start_pfn); | |
c713216d | 5021 | |
a6af2bc3 MG |
5022 | if (min_pfn == ULONG_MAX) { |
5023 | printk(KERN_WARNING | |
2bc0d261 | 5024 | "Could not find start_pfn for node %d\n", nid); |
a6af2bc3 MG |
5025 | return 0; |
5026 | } | |
5027 | ||
5028 | return min_pfn; | |
c713216d MG |
5029 | } |
5030 | ||
5031 | /** | |
5032 | * find_min_pfn_with_active_regions - Find the minimum PFN registered | |
5033 | * | |
5034 | * It returns the minimum PFN based on information provided via | |
88ca3b94 | 5035 | * add_active_range(). |
c713216d MG |
5036 | */ |
5037 | unsigned long __init find_min_pfn_with_active_regions(void) | |
5038 | { | |
5039 | return find_min_pfn_for_node(MAX_NUMNODES); | |
5040 | } | |
5041 | ||
37b07e41 LS |
5042 | /* |
5043 | * early_calculate_totalpages() | |
5044 | * Sum pages in active regions for movable zone. | |
4b0ef1fe | 5045 | * Populate N_MEMORY for calculating usable_nodes. |
37b07e41 | 5046 | */ |
484f51f8 | 5047 | static unsigned long __init early_calculate_totalpages(void) |
7e63efef | 5048 | { |
7e63efef | 5049 | unsigned long totalpages = 0; |
c13291a5 TH |
5050 | unsigned long start_pfn, end_pfn; |
5051 | int i, nid; | |
5052 | ||
5053 | for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid) { | |
5054 | unsigned long pages = end_pfn - start_pfn; | |
7e63efef | 5055 | |
37b07e41 LS |
5056 | totalpages += pages; |
5057 | if (pages) | |
4b0ef1fe | 5058 | node_set_state(nid, N_MEMORY); |
37b07e41 | 5059 | } |
b8af2941 | 5060 | return totalpages; |
7e63efef MG |
5061 | } |
5062 | ||
2a1e274a MG |
5063 | /* |
5064 | * Find the PFN the Movable zone begins in each node. Kernel memory | |
5065 | * is spread evenly between nodes as long as the nodes have enough | |
5066 | * memory. When they don't, some nodes will have more kernelcore than | |
5067 | * others | |
5068 | */ | |
b224ef85 | 5069 | static void __init find_zone_movable_pfns_for_nodes(void) |
2a1e274a MG |
5070 | { |
5071 | int i, nid; | |
5072 | unsigned long usable_startpfn; | |
5073 | unsigned long kernelcore_node, kernelcore_remaining; | |
66918dcd | 5074 | /* save the state before borrow the nodemask */ |
4b0ef1fe | 5075 | nodemask_t saved_node_state = node_states[N_MEMORY]; |
37b07e41 | 5076 | unsigned long totalpages = early_calculate_totalpages(); |
4b0ef1fe | 5077 | int usable_nodes = nodes_weight(node_states[N_MEMORY]); |
136199f0 | 5078 | struct memblock_region *r; |
b2f3eebe TC |
5079 | |
5080 | /* Need to find movable_zone earlier when movable_node is specified. */ | |
5081 | find_usable_zone_for_movable(); | |
5082 | ||
5083 | /* | |
5084 | * If movable_node is specified, ignore kernelcore and movablecore | |
5085 | * options. | |
5086 | */ | |
5087 | if (movable_node_is_enabled()) { | |
136199f0 EM |
5088 | for_each_memblock(memory, r) { |
5089 | if (!memblock_is_hotpluggable(r)) | |
b2f3eebe TC |
5090 | continue; |
5091 | ||
136199f0 | 5092 | nid = r->nid; |
b2f3eebe | 5093 | |
136199f0 | 5094 | usable_startpfn = PFN_DOWN(r->base); |
b2f3eebe TC |
5095 | zone_movable_pfn[nid] = zone_movable_pfn[nid] ? |
5096 | min(usable_startpfn, zone_movable_pfn[nid]) : | |
5097 | usable_startpfn; | |
5098 | } | |
5099 | ||
5100 | goto out2; | |
5101 | } | |
2a1e274a | 5102 | |
7e63efef | 5103 | /* |
b2f3eebe | 5104 | * If movablecore=nn[KMG] was specified, calculate what size of |
7e63efef MG |
5105 | * kernelcore that corresponds so that memory usable for |
5106 | * any allocation type is evenly spread. If both kernelcore | |
5107 | * and movablecore are specified, then the value of kernelcore | |
5108 | * will be used for required_kernelcore if it's greater than | |
5109 | * what movablecore would have allowed. | |
5110 | */ | |
5111 | if (required_movablecore) { | |
7e63efef MG |
5112 | unsigned long corepages; |
5113 | ||
5114 | /* | |
5115 | * Round-up so that ZONE_MOVABLE is at least as large as what | |
5116 | * was requested by the user | |
5117 | */ | |
5118 | required_movablecore = | |
5119 | roundup(required_movablecore, MAX_ORDER_NR_PAGES); | |
5120 | corepages = totalpages - required_movablecore; | |
5121 | ||
5122 | required_kernelcore = max(required_kernelcore, corepages); | |
5123 | } | |
5124 | ||
20e6926d YL |
5125 | /* If kernelcore was not specified, there is no ZONE_MOVABLE */ |
5126 | if (!required_kernelcore) | |
66918dcd | 5127 | goto out; |
2a1e274a MG |
5128 | |
5129 | /* usable_startpfn is the lowest possible pfn ZONE_MOVABLE can be at */ | |
2a1e274a MG |
5130 | usable_startpfn = arch_zone_lowest_possible_pfn[movable_zone]; |
5131 | ||
5132 | restart: | |
5133 | /* Spread kernelcore memory as evenly as possible throughout nodes */ | |
5134 | kernelcore_node = required_kernelcore / usable_nodes; | |
4b0ef1fe | 5135 | for_each_node_state(nid, N_MEMORY) { |
c13291a5 TH |
5136 | unsigned long start_pfn, end_pfn; |
5137 | ||
2a1e274a MG |
5138 | /* |
5139 | * Recalculate kernelcore_node if the division per node | |
5140 | * now exceeds what is necessary to satisfy the requested | |
5141 | * amount of memory for the kernel | |
5142 | */ | |
5143 | if (required_kernelcore < kernelcore_node) | |
5144 | kernelcore_node = required_kernelcore / usable_nodes; | |
5145 | ||
5146 | /* | |
5147 | * As the map is walked, we track how much memory is usable | |
5148 | * by the kernel using kernelcore_remaining. When it is | |
5149 | * 0, the rest of the node is usable by ZONE_MOVABLE | |
5150 | */ | |
5151 | kernelcore_remaining = kernelcore_node; | |
5152 | ||
5153 | /* Go through each range of PFNs within this node */ | |
c13291a5 | 5154 | for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) { |
2a1e274a MG |
5155 | unsigned long size_pages; |
5156 | ||
c13291a5 | 5157 | start_pfn = max(start_pfn, zone_movable_pfn[nid]); |
2a1e274a MG |
5158 | if (start_pfn >= end_pfn) |
5159 | continue; | |
5160 | ||
5161 | /* Account for what is only usable for kernelcore */ | |
5162 | if (start_pfn < usable_startpfn) { | |
5163 | unsigned long kernel_pages; | |
5164 | kernel_pages = min(end_pfn, usable_startpfn) | |
5165 | - start_pfn; | |
5166 | ||
5167 | kernelcore_remaining -= min(kernel_pages, | |
5168 | kernelcore_remaining); | |
5169 | required_kernelcore -= min(kernel_pages, | |
5170 | required_kernelcore); | |
5171 | ||
5172 | /* Continue if range is now fully accounted */ | |
5173 | if (end_pfn <= usable_startpfn) { | |
5174 | ||
5175 | /* | |
5176 | * Push zone_movable_pfn to the end so | |
5177 | * that if we have to rebalance | |
5178 | * kernelcore across nodes, we will | |
5179 | * not double account here | |
5180 | */ | |
5181 | zone_movable_pfn[nid] = end_pfn; | |
5182 | continue; | |
5183 | } | |
5184 | start_pfn = usable_startpfn; | |
5185 | } | |
5186 | ||
5187 | /* | |
5188 | * The usable PFN range for ZONE_MOVABLE is from | |
5189 | * start_pfn->end_pfn. Calculate size_pages as the | |
5190 | * number of pages used as kernelcore | |
5191 | */ | |
5192 | size_pages = end_pfn - start_pfn; | |
5193 | if (size_pages > kernelcore_remaining) | |
5194 | size_pages = kernelcore_remaining; | |
5195 | zone_movable_pfn[nid] = start_pfn + size_pages; | |
5196 | ||
5197 | /* | |
5198 | * Some kernelcore has been met, update counts and | |
5199 | * break if the kernelcore for this node has been | |
b8af2941 | 5200 | * satisfied |
2a1e274a MG |
5201 | */ |
5202 | required_kernelcore -= min(required_kernelcore, | |
5203 | size_pages); | |
5204 | kernelcore_remaining -= size_pages; | |
5205 | if (!kernelcore_remaining) | |
5206 | break; | |
5207 | } | |
5208 | } | |
5209 | ||
5210 | /* | |
5211 | * If there is still required_kernelcore, we do another pass with one | |
5212 | * less node in the count. This will push zone_movable_pfn[nid] further | |
5213 | * along on the nodes that still have memory until kernelcore is | |
b8af2941 | 5214 | * satisfied |
2a1e274a MG |
5215 | */ |
5216 | usable_nodes--; | |
5217 | if (usable_nodes && required_kernelcore > usable_nodes) | |
5218 | goto restart; | |
5219 | ||
b2f3eebe | 5220 | out2: |
2a1e274a MG |
5221 | /* Align start of ZONE_MOVABLE on all nids to MAX_ORDER_NR_PAGES */ |
5222 | for (nid = 0; nid < MAX_NUMNODES; nid++) | |
5223 | zone_movable_pfn[nid] = | |
5224 | roundup(zone_movable_pfn[nid], MAX_ORDER_NR_PAGES); | |
66918dcd | 5225 | |
20e6926d | 5226 | out: |
66918dcd | 5227 | /* restore the node_state */ |
4b0ef1fe | 5228 | node_states[N_MEMORY] = saved_node_state; |
2a1e274a MG |
5229 | } |
5230 | ||
4b0ef1fe LJ |
5231 | /* Any regular or high memory on that node ? */ |
5232 | static void check_for_memory(pg_data_t *pgdat, int nid) | |
37b07e41 | 5233 | { |
37b07e41 LS |
5234 | enum zone_type zone_type; |
5235 | ||
4b0ef1fe LJ |
5236 | if (N_MEMORY == N_NORMAL_MEMORY) |
5237 | return; | |
5238 | ||
5239 | for (zone_type = 0; zone_type <= ZONE_MOVABLE - 1; zone_type++) { | |
37b07e41 | 5240 | struct zone *zone = &pgdat->node_zones[zone_type]; |
b38a8725 | 5241 | if (populated_zone(zone)) { |
4b0ef1fe LJ |
5242 | node_set_state(nid, N_HIGH_MEMORY); |
5243 | if (N_NORMAL_MEMORY != N_HIGH_MEMORY && | |
5244 | zone_type <= ZONE_NORMAL) | |
5245 | node_set_state(nid, N_NORMAL_MEMORY); | |
d0048b0e BL |
5246 | break; |
5247 | } | |
37b07e41 | 5248 | } |
37b07e41 LS |
5249 | } |
5250 | ||
c713216d MG |
5251 | /** |
5252 | * free_area_init_nodes - Initialise all pg_data_t and zone data | |
88ca3b94 | 5253 | * @max_zone_pfn: an array of max PFNs for each zone |
c713216d MG |
5254 | * |
5255 | * This will call free_area_init_node() for each active node in the system. | |
5256 | * Using the page ranges provided by add_active_range(), the size of each | |
5257 | * zone in each node and their holes is calculated. If the maximum PFN | |
5258 | * between two adjacent zones match, it is assumed that the zone is empty. | |
5259 | * For example, if arch_max_dma_pfn == arch_max_dma32_pfn, it is assumed | |
5260 | * that arch_max_dma32_pfn has no pages. It is also assumed that a zone | |
5261 | * starts where the previous one ended. For example, ZONE_DMA32 starts | |
5262 | * at arch_max_dma_pfn. | |
5263 | */ | |
5264 | void __init free_area_init_nodes(unsigned long *max_zone_pfn) | |
5265 | { | |
c13291a5 TH |
5266 | unsigned long start_pfn, end_pfn; |
5267 | int i, nid; | |
a6af2bc3 | 5268 | |
c713216d MG |
5269 | /* Record where the zone boundaries are */ |
5270 | memset(arch_zone_lowest_possible_pfn, 0, | |
5271 | sizeof(arch_zone_lowest_possible_pfn)); | |
5272 | memset(arch_zone_highest_possible_pfn, 0, | |
5273 | sizeof(arch_zone_highest_possible_pfn)); | |
5274 | arch_zone_lowest_possible_pfn[0] = find_min_pfn_with_active_regions(); | |
5275 | arch_zone_highest_possible_pfn[0] = max_zone_pfn[0]; | |
5276 | for (i = 1; i < MAX_NR_ZONES; i++) { | |
2a1e274a MG |
5277 | if (i == ZONE_MOVABLE) |
5278 | continue; | |
c713216d MG |
5279 | arch_zone_lowest_possible_pfn[i] = |
5280 | arch_zone_highest_possible_pfn[i-1]; | |
5281 | arch_zone_highest_possible_pfn[i] = | |
5282 | max(max_zone_pfn[i], arch_zone_lowest_possible_pfn[i]); | |
5283 | } | |
2a1e274a MG |
5284 | arch_zone_lowest_possible_pfn[ZONE_MOVABLE] = 0; |
5285 | arch_zone_highest_possible_pfn[ZONE_MOVABLE] = 0; | |
5286 | ||
5287 | /* Find the PFNs that ZONE_MOVABLE begins at in each node */ | |
5288 | memset(zone_movable_pfn, 0, sizeof(zone_movable_pfn)); | |
b224ef85 | 5289 | find_zone_movable_pfns_for_nodes(); |
c713216d | 5290 | |
c713216d | 5291 | /* Print out the zone ranges */ |
a62e2f4f | 5292 | printk("Zone ranges:\n"); |
2a1e274a MG |
5293 | for (i = 0; i < MAX_NR_ZONES; i++) { |
5294 | if (i == ZONE_MOVABLE) | |
5295 | continue; | |
155cbfc8 | 5296 | printk(KERN_CONT " %-8s ", zone_names[i]); |
72f0ba02 DR |
5297 | if (arch_zone_lowest_possible_pfn[i] == |
5298 | arch_zone_highest_possible_pfn[i]) | |
155cbfc8 | 5299 | printk(KERN_CONT "empty\n"); |
72f0ba02 | 5300 | else |
a62e2f4f BH |
5301 | printk(KERN_CONT "[mem %0#10lx-%0#10lx]\n", |
5302 | arch_zone_lowest_possible_pfn[i] << PAGE_SHIFT, | |
5303 | (arch_zone_highest_possible_pfn[i] | |
5304 | << PAGE_SHIFT) - 1); | |
2a1e274a MG |
5305 | } |
5306 | ||
5307 | /* Print out the PFNs ZONE_MOVABLE begins at in each node */ | |
a62e2f4f | 5308 | printk("Movable zone start for each node\n"); |
2a1e274a MG |
5309 | for (i = 0; i < MAX_NUMNODES; i++) { |
5310 | if (zone_movable_pfn[i]) | |
a62e2f4f BH |
5311 | printk(" Node %d: %#010lx\n", i, |
5312 | zone_movable_pfn[i] << PAGE_SHIFT); | |
2a1e274a | 5313 | } |
c713216d | 5314 | |
f2d52fe5 | 5315 | /* Print out the early node map */ |
a62e2f4f | 5316 | printk("Early memory node ranges\n"); |
c13291a5 | 5317 | for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid) |
a62e2f4f BH |
5318 | printk(" node %3d: [mem %#010lx-%#010lx]\n", nid, |
5319 | start_pfn << PAGE_SHIFT, (end_pfn << PAGE_SHIFT) - 1); | |
c713216d MG |
5320 | |
5321 | /* Initialise every node */ | |
708614e6 | 5322 | mminit_verify_pageflags_layout(); |
8ef82866 | 5323 | setup_nr_node_ids(); |
c713216d MG |
5324 | for_each_online_node(nid) { |
5325 | pg_data_t *pgdat = NODE_DATA(nid); | |
9109fb7b | 5326 | free_area_init_node(nid, NULL, |
c713216d | 5327 | find_min_pfn_for_node(nid), NULL); |
37b07e41 LS |
5328 | |
5329 | /* Any memory on that node */ | |
5330 | if (pgdat->node_present_pages) | |
4b0ef1fe LJ |
5331 | node_set_state(nid, N_MEMORY); |
5332 | check_for_memory(pgdat, nid); | |
c713216d MG |
5333 | } |
5334 | } | |
2a1e274a | 5335 | |
7e63efef | 5336 | static int __init cmdline_parse_core(char *p, unsigned long *core) |
2a1e274a MG |
5337 | { |
5338 | unsigned long long coremem; | |
5339 | if (!p) | |
5340 | return -EINVAL; | |
5341 | ||
5342 | coremem = memparse(p, &p); | |
7e63efef | 5343 | *core = coremem >> PAGE_SHIFT; |
2a1e274a | 5344 | |
7e63efef | 5345 | /* Paranoid check that UL is enough for the coremem value */ |
2a1e274a MG |
5346 | WARN_ON((coremem >> PAGE_SHIFT) > ULONG_MAX); |
5347 | ||
5348 | return 0; | |
5349 | } | |
ed7ed365 | 5350 | |
7e63efef MG |
5351 | /* |
5352 | * kernelcore=size sets the amount of memory for use for allocations that | |
5353 | * cannot be reclaimed or migrated. | |
5354 | */ | |
5355 | static int __init cmdline_parse_kernelcore(char *p) | |
5356 | { | |
5357 | return cmdline_parse_core(p, &required_kernelcore); | |
5358 | } | |
5359 | ||
5360 | /* | |
5361 | * movablecore=size sets the amount of memory for use for allocations that | |
5362 | * can be reclaimed or migrated. | |
5363 | */ | |
5364 | static int __init cmdline_parse_movablecore(char *p) | |
5365 | { | |
5366 | return cmdline_parse_core(p, &required_movablecore); | |
5367 | } | |
5368 | ||
ed7ed365 | 5369 | early_param("kernelcore", cmdline_parse_kernelcore); |
7e63efef | 5370 | early_param("movablecore", cmdline_parse_movablecore); |
ed7ed365 | 5371 | |
0ee332c1 | 5372 | #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */ |
c713216d | 5373 | |
c3d5f5f0 JL |
5374 | void adjust_managed_page_count(struct page *page, long count) |
5375 | { | |
5376 | spin_lock(&managed_page_count_lock); | |
5377 | page_zone(page)->managed_pages += count; | |
5378 | totalram_pages += count; | |
3dcc0571 JL |
5379 | #ifdef CONFIG_HIGHMEM |
5380 | if (PageHighMem(page)) | |
5381 | totalhigh_pages += count; | |
5382 | #endif | |
c3d5f5f0 JL |
5383 | spin_unlock(&managed_page_count_lock); |
5384 | } | |
3dcc0571 | 5385 | EXPORT_SYMBOL(adjust_managed_page_count); |
c3d5f5f0 | 5386 | |
11199692 | 5387 | unsigned long free_reserved_area(void *start, void *end, int poison, char *s) |
69afade7 | 5388 | { |
11199692 JL |
5389 | void *pos; |
5390 | unsigned long pages = 0; | |
69afade7 | 5391 | |
11199692 JL |
5392 | start = (void *)PAGE_ALIGN((unsigned long)start); |
5393 | end = (void *)((unsigned long)end & PAGE_MASK); | |
5394 | for (pos = start; pos < end; pos += PAGE_SIZE, pages++) { | |
dbe67df4 | 5395 | if ((unsigned int)poison <= 0xFF) |
11199692 JL |
5396 | memset(pos, poison, PAGE_SIZE); |
5397 | free_reserved_page(virt_to_page(pos)); | |
69afade7 JL |
5398 | } |
5399 | ||
5400 | if (pages && s) | |
11199692 | 5401 | pr_info("Freeing %s memory: %ldK (%p - %p)\n", |
69afade7 JL |
5402 | s, pages << (PAGE_SHIFT - 10), start, end); |
5403 | ||
5404 | return pages; | |
5405 | } | |
11199692 | 5406 | EXPORT_SYMBOL(free_reserved_area); |
69afade7 | 5407 | |
cfa11e08 JL |
5408 | #ifdef CONFIG_HIGHMEM |
5409 | void free_highmem_page(struct page *page) | |
5410 | { | |
5411 | __free_reserved_page(page); | |
5412 | totalram_pages++; | |
7b4b2a0d | 5413 | page_zone(page)->managed_pages++; |
cfa11e08 JL |
5414 | totalhigh_pages++; |
5415 | } | |
5416 | #endif | |
5417 | ||
7ee3d4e8 JL |
5418 | |
5419 | void __init mem_init_print_info(const char *str) | |
5420 | { | |
5421 | unsigned long physpages, codesize, datasize, rosize, bss_size; | |
5422 | unsigned long init_code_size, init_data_size; | |
5423 | ||
5424 | physpages = get_num_physpages(); | |
5425 | codesize = _etext - _stext; | |
5426 | datasize = _edata - _sdata; | |
5427 | rosize = __end_rodata - __start_rodata; | |
5428 | bss_size = __bss_stop - __bss_start; | |
5429 | init_data_size = __init_end - __init_begin; | |
5430 | init_code_size = _einittext - _sinittext; | |
5431 | ||
5432 | /* | |
5433 | * Detect special cases and adjust section sizes accordingly: | |
5434 | * 1) .init.* may be embedded into .data sections | |
5435 | * 2) .init.text.* may be out of [__init_begin, __init_end], | |
5436 | * please refer to arch/tile/kernel/vmlinux.lds.S. | |
5437 | * 3) .rodata.* may be embedded into .text or .data sections. | |
5438 | */ | |
5439 | #define adj_init_size(start, end, size, pos, adj) \ | |
b8af2941 PK |
5440 | do { \ |
5441 | if (start <= pos && pos < end && size > adj) \ | |
5442 | size -= adj; \ | |
5443 | } while (0) | |
7ee3d4e8 JL |
5444 | |
5445 | adj_init_size(__init_begin, __init_end, init_data_size, | |
5446 | _sinittext, init_code_size); | |
5447 | adj_init_size(_stext, _etext, codesize, _sinittext, init_code_size); | |
5448 | adj_init_size(_sdata, _edata, datasize, __init_begin, init_data_size); | |
5449 | adj_init_size(_stext, _etext, codesize, __start_rodata, rosize); | |
5450 | adj_init_size(_sdata, _edata, datasize, __start_rodata, rosize); | |
5451 | ||
5452 | #undef adj_init_size | |
5453 | ||
5454 | printk("Memory: %luK/%luK available " | |
5455 | "(%luK kernel code, %luK rwdata, %luK rodata, " | |
5456 | "%luK init, %luK bss, %luK reserved" | |
5457 | #ifdef CONFIG_HIGHMEM | |
5458 | ", %luK highmem" | |
5459 | #endif | |
5460 | "%s%s)\n", | |
5461 | nr_free_pages() << (PAGE_SHIFT-10), physpages << (PAGE_SHIFT-10), | |
5462 | codesize >> 10, datasize >> 10, rosize >> 10, | |
5463 | (init_data_size + init_code_size) >> 10, bss_size >> 10, | |
5464 | (physpages - totalram_pages) << (PAGE_SHIFT-10), | |
5465 | #ifdef CONFIG_HIGHMEM | |
5466 | totalhigh_pages << (PAGE_SHIFT-10), | |
5467 | #endif | |
5468 | str ? ", " : "", str ? str : ""); | |
5469 | } | |
5470 | ||
0e0b864e | 5471 | /** |
88ca3b94 RD |
5472 | * set_dma_reserve - set the specified number of pages reserved in the first zone |
5473 | * @new_dma_reserve: The number of pages to mark reserved | |
0e0b864e MG |
5474 | * |
5475 | * The per-cpu batchsize and zone watermarks are determined by present_pages. | |
5476 | * In the DMA zone, a significant percentage may be consumed by kernel image | |
5477 | * and other unfreeable allocations which can skew the watermarks badly. This | |
88ca3b94 RD |
5478 | * function may optionally be used to account for unfreeable pages in the |
5479 | * first zone (e.g., ZONE_DMA). The effect will be lower watermarks and | |
5480 | * smaller per-cpu batchsize. | |
0e0b864e MG |
5481 | */ |
5482 | void __init set_dma_reserve(unsigned long new_dma_reserve) | |
5483 | { | |
5484 | dma_reserve = new_dma_reserve; | |
5485 | } | |
5486 | ||
1da177e4 LT |
5487 | void __init free_area_init(unsigned long *zones_size) |
5488 | { | |
9109fb7b | 5489 | free_area_init_node(0, zones_size, |
1da177e4 LT |
5490 | __pa(PAGE_OFFSET) >> PAGE_SHIFT, NULL); |
5491 | } | |
1da177e4 | 5492 | |
1da177e4 LT |
5493 | static int page_alloc_cpu_notify(struct notifier_block *self, |
5494 | unsigned long action, void *hcpu) | |
5495 | { | |
5496 | int cpu = (unsigned long)hcpu; | |
1da177e4 | 5497 | |
8bb78442 | 5498 | if (action == CPU_DEAD || action == CPU_DEAD_FROZEN) { |
f0cb3c76 | 5499 | lru_add_drain_cpu(cpu); |
9f8f2172 CL |
5500 | drain_pages(cpu); |
5501 | ||
5502 | /* | |
5503 | * Spill the event counters of the dead processor | |
5504 | * into the current processors event counters. | |
5505 | * This artificially elevates the count of the current | |
5506 | * processor. | |
5507 | */ | |
f8891e5e | 5508 | vm_events_fold_cpu(cpu); |
9f8f2172 CL |
5509 | |
5510 | /* | |
5511 | * Zero the differential counters of the dead processor | |
5512 | * so that the vm statistics are consistent. | |
5513 | * | |
5514 | * This is only okay since the processor is dead and cannot | |
5515 | * race with what we are doing. | |
5516 | */ | |
2bb921e5 | 5517 | cpu_vm_stats_fold(cpu); |
1da177e4 LT |
5518 | } |
5519 | return NOTIFY_OK; | |
5520 | } | |
1da177e4 LT |
5521 | |
5522 | void __init page_alloc_init(void) | |
5523 | { | |
5524 | hotcpu_notifier(page_alloc_cpu_notify, 0); | |
5525 | } | |
5526 | ||
cb45b0e9 HA |
5527 | /* |
5528 | * calculate_totalreserve_pages - called when sysctl_lower_zone_reserve_ratio | |
5529 | * or min_free_kbytes changes. | |
5530 | */ | |
5531 | static void calculate_totalreserve_pages(void) | |
5532 | { | |
5533 | struct pglist_data *pgdat; | |
5534 | unsigned long reserve_pages = 0; | |
2f6726e5 | 5535 | enum zone_type i, j; |
cb45b0e9 HA |
5536 | |
5537 | for_each_online_pgdat(pgdat) { | |
5538 | for (i = 0; i < MAX_NR_ZONES; i++) { | |
5539 | struct zone *zone = pgdat->node_zones + i; | |
5540 | unsigned long max = 0; | |
5541 | ||
5542 | /* Find valid and maximum lowmem_reserve in the zone */ | |
5543 | for (j = i; j < MAX_NR_ZONES; j++) { | |
5544 | if (zone->lowmem_reserve[j] > max) | |
5545 | max = zone->lowmem_reserve[j]; | |
5546 | } | |
5547 | ||
41858966 MG |
5548 | /* we treat the high watermark as reserved pages. */ |
5549 | max += high_wmark_pages(zone); | |
cb45b0e9 | 5550 | |
b40da049 JL |
5551 | if (max > zone->managed_pages) |
5552 | max = zone->managed_pages; | |
cb45b0e9 | 5553 | reserve_pages += max; |
ab8fabd4 JW |
5554 | /* |
5555 | * Lowmem reserves are not available to | |
5556 | * GFP_HIGHUSER page cache allocations and | |
5557 | * kswapd tries to balance zones to their high | |
5558 | * watermark. As a result, neither should be | |
5559 | * regarded as dirtyable memory, to prevent a | |
5560 | * situation where reclaim has to clean pages | |
5561 | * in order to balance the zones. | |
5562 | */ | |
5563 | zone->dirty_balance_reserve = max; | |
cb45b0e9 HA |
5564 | } |
5565 | } | |
ab8fabd4 | 5566 | dirty_balance_reserve = reserve_pages; |
cb45b0e9 HA |
5567 | totalreserve_pages = reserve_pages; |
5568 | } | |
5569 | ||
1da177e4 LT |
5570 | /* |
5571 | * setup_per_zone_lowmem_reserve - called whenever | |
5572 | * sysctl_lower_zone_reserve_ratio changes. Ensures that each zone | |
5573 | * has a correct pages reserved value, so an adequate number of | |
5574 | * pages are left in the zone after a successful __alloc_pages(). | |
5575 | */ | |
5576 | static void setup_per_zone_lowmem_reserve(void) | |
5577 | { | |
5578 | struct pglist_data *pgdat; | |
2f6726e5 | 5579 | enum zone_type j, idx; |
1da177e4 | 5580 | |
ec936fc5 | 5581 | for_each_online_pgdat(pgdat) { |
1da177e4 LT |
5582 | for (j = 0; j < MAX_NR_ZONES; j++) { |
5583 | struct zone *zone = pgdat->node_zones + j; | |
b40da049 | 5584 | unsigned long managed_pages = zone->managed_pages; |
1da177e4 LT |
5585 | |
5586 | zone->lowmem_reserve[j] = 0; | |
5587 | ||
2f6726e5 CL |
5588 | idx = j; |
5589 | while (idx) { | |
1da177e4 LT |
5590 | struct zone *lower_zone; |
5591 | ||
2f6726e5 CL |
5592 | idx--; |
5593 | ||
1da177e4 LT |
5594 | if (sysctl_lowmem_reserve_ratio[idx] < 1) |
5595 | sysctl_lowmem_reserve_ratio[idx] = 1; | |
5596 | ||
5597 | lower_zone = pgdat->node_zones + idx; | |
b40da049 | 5598 | lower_zone->lowmem_reserve[j] = managed_pages / |
1da177e4 | 5599 | sysctl_lowmem_reserve_ratio[idx]; |
b40da049 | 5600 | managed_pages += lower_zone->managed_pages; |
1da177e4 LT |
5601 | } |
5602 | } | |
5603 | } | |
cb45b0e9 HA |
5604 | |
5605 | /* update totalreserve_pages */ | |
5606 | calculate_totalreserve_pages(); | |
1da177e4 LT |
5607 | } |
5608 | ||
cfd3da1e | 5609 | static void __setup_per_zone_wmarks(void) |
1da177e4 LT |
5610 | { |
5611 | unsigned long pages_min = min_free_kbytes >> (PAGE_SHIFT - 10); | |
5612 | unsigned long lowmem_pages = 0; | |
5613 | struct zone *zone; | |
5614 | unsigned long flags; | |
5615 | ||
5616 | /* Calculate total number of !ZONE_HIGHMEM pages */ | |
5617 | for_each_zone(zone) { | |
5618 | if (!is_highmem(zone)) | |
b40da049 | 5619 | lowmem_pages += zone->managed_pages; |
1da177e4 LT |
5620 | } |
5621 | ||
5622 | for_each_zone(zone) { | |
ac924c60 AM |
5623 | u64 tmp; |
5624 | ||
1125b4e3 | 5625 | spin_lock_irqsave(&zone->lock, flags); |
b40da049 | 5626 | tmp = (u64)pages_min * zone->managed_pages; |
ac924c60 | 5627 | do_div(tmp, lowmem_pages); |
1da177e4 LT |
5628 | if (is_highmem(zone)) { |
5629 | /* | |
669ed175 NP |
5630 | * __GFP_HIGH and PF_MEMALLOC allocations usually don't |
5631 | * need highmem pages, so cap pages_min to a small | |
5632 | * value here. | |
5633 | * | |
41858966 | 5634 | * The WMARK_HIGH-WMARK_LOW and (WMARK_LOW-WMARK_MIN) |
669ed175 NP |
5635 | * deltas controls asynch page reclaim, and so should |
5636 | * not be capped for highmem. | |
1da177e4 | 5637 | */ |
90ae8d67 | 5638 | unsigned long min_pages; |
1da177e4 | 5639 | |
b40da049 | 5640 | min_pages = zone->managed_pages / 1024; |
90ae8d67 | 5641 | min_pages = clamp(min_pages, SWAP_CLUSTER_MAX, 128UL); |
41858966 | 5642 | zone->watermark[WMARK_MIN] = min_pages; |
1da177e4 | 5643 | } else { |
669ed175 NP |
5644 | /* |
5645 | * If it's a lowmem zone, reserve a number of pages | |
1da177e4 LT |
5646 | * proportionate to the zone's size. |
5647 | */ | |
41858966 | 5648 | zone->watermark[WMARK_MIN] = tmp; |
1da177e4 LT |
5649 | } |
5650 | ||
41858966 MG |
5651 | zone->watermark[WMARK_LOW] = min_wmark_pages(zone) + (tmp >> 2); |
5652 | zone->watermark[WMARK_HIGH] = min_wmark_pages(zone) + (tmp >> 1); | |
49f223a9 | 5653 | |
81c0a2bb JW |
5654 | __mod_zone_page_state(zone, NR_ALLOC_BATCH, |
5655 | high_wmark_pages(zone) - | |
5656 | low_wmark_pages(zone) - | |
5657 | zone_page_state(zone, NR_ALLOC_BATCH)); | |
5658 | ||
56fd56b8 | 5659 | setup_zone_migrate_reserve(zone); |
1125b4e3 | 5660 | spin_unlock_irqrestore(&zone->lock, flags); |
1da177e4 | 5661 | } |
cb45b0e9 HA |
5662 | |
5663 | /* update totalreserve_pages */ | |
5664 | calculate_totalreserve_pages(); | |
1da177e4 LT |
5665 | } |
5666 | ||
cfd3da1e MG |
5667 | /** |
5668 | * setup_per_zone_wmarks - called when min_free_kbytes changes | |
5669 | * or when memory is hot-{added|removed} | |
5670 | * | |
5671 | * Ensures that the watermark[min,low,high] values for each zone are set | |
5672 | * correctly with respect to min_free_kbytes. | |
5673 | */ | |
5674 | void setup_per_zone_wmarks(void) | |
5675 | { | |
5676 | mutex_lock(&zonelists_mutex); | |
5677 | __setup_per_zone_wmarks(); | |
5678 | mutex_unlock(&zonelists_mutex); | |
5679 | } | |
5680 | ||
55a4462a | 5681 | /* |
556adecb RR |
5682 | * The inactive anon list should be small enough that the VM never has to |
5683 | * do too much work, but large enough that each inactive page has a chance | |
5684 | * to be referenced again before it is swapped out. | |
5685 | * | |
5686 | * The inactive_anon ratio is the target ratio of ACTIVE_ANON to | |
5687 | * INACTIVE_ANON pages on this zone's LRU, maintained by the | |
5688 | * pageout code. A zone->inactive_ratio of 3 means 3:1 or 25% of | |
5689 | * the anonymous pages are kept on the inactive list. | |
5690 | * | |
5691 | * total target max | |
5692 | * memory ratio inactive anon | |
5693 | * ------------------------------------- | |
5694 | * 10MB 1 5MB | |
5695 | * 100MB 1 50MB | |
5696 | * 1GB 3 250MB | |
5697 | * 10GB 10 0.9GB | |
5698 | * 100GB 31 3GB | |
5699 | * 1TB 101 10GB | |
5700 | * 10TB 320 32GB | |
5701 | */ | |
1b79acc9 | 5702 | static void __meminit calculate_zone_inactive_ratio(struct zone *zone) |
556adecb | 5703 | { |
96cb4df5 | 5704 | unsigned int gb, ratio; |
556adecb | 5705 | |
96cb4df5 | 5706 | /* Zone size in gigabytes */ |
b40da049 | 5707 | gb = zone->managed_pages >> (30 - PAGE_SHIFT); |
96cb4df5 | 5708 | if (gb) |
556adecb | 5709 | ratio = int_sqrt(10 * gb); |
96cb4df5 MK |
5710 | else |
5711 | ratio = 1; | |
556adecb | 5712 | |
96cb4df5 MK |
5713 | zone->inactive_ratio = ratio; |
5714 | } | |
556adecb | 5715 | |
839a4fcc | 5716 | static void __meminit setup_per_zone_inactive_ratio(void) |
96cb4df5 MK |
5717 | { |
5718 | struct zone *zone; | |
5719 | ||
5720 | for_each_zone(zone) | |
5721 | calculate_zone_inactive_ratio(zone); | |
556adecb RR |
5722 | } |
5723 | ||
1da177e4 LT |
5724 | /* |
5725 | * Initialise min_free_kbytes. | |
5726 | * | |
5727 | * For small machines we want it small (128k min). For large machines | |
5728 | * we want it large (64MB max). But it is not linear, because network | |
5729 | * bandwidth does not increase linearly with machine size. We use | |
5730 | * | |
b8af2941 | 5731 | * min_free_kbytes = 4 * sqrt(lowmem_kbytes), for better accuracy: |
1da177e4 LT |
5732 | * min_free_kbytes = sqrt(lowmem_kbytes * 16) |
5733 | * | |
5734 | * which yields | |
5735 | * | |
5736 | * 16MB: 512k | |
5737 | * 32MB: 724k | |
5738 | * 64MB: 1024k | |
5739 | * 128MB: 1448k | |
5740 | * 256MB: 2048k | |
5741 | * 512MB: 2896k | |
5742 | * 1024MB: 4096k | |
5743 | * 2048MB: 5792k | |
5744 | * 4096MB: 8192k | |
5745 | * 8192MB: 11584k | |
5746 | * 16384MB: 16384k | |
5747 | */ | |
1b79acc9 | 5748 | int __meminit init_per_zone_wmark_min(void) |
1da177e4 LT |
5749 | { |
5750 | unsigned long lowmem_kbytes; | |
5f12733e | 5751 | int new_min_free_kbytes; |
1da177e4 LT |
5752 | |
5753 | lowmem_kbytes = nr_free_buffer_pages() * (PAGE_SIZE >> 10); | |
5f12733e MH |
5754 | new_min_free_kbytes = int_sqrt(lowmem_kbytes * 16); |
5755 | ||
5756 | if (new_min_free_kbytes > user_min_free_kbytes) { | |
5757 | min_free_kbytes = new_min_free_kbytes; | |
5758 | if (min_free_kbytes < 128) | |
5759 | min_free_kbytes = 128; | |
5760 | if (min_free_kbytes > 65536) | |
5761 | min_free_kbytes = 65536; | |
5762 | } else { | |
5763 | pr_warn("min_free_kbytes is not updated to %d because user defined value %d is preferred\n", | |
5764 | new_min_free_kbytes, user_min_free_kbytes); | |
5765 | } | |
bc75d33f | 5766 | setup_per_zone_wmarks(); |
a6cccdc3 | 5767 | refresh_zone_stat_thresholds(); |
1da177e4 | 5768 | setup_per_zone_lowmem_reserve(); |
556adecb | 5769 | setup_per_zone_inactive_ratio(); |
1da177e4 LT |
5770 | return 0; |
5771 | } | |
bc75d33f | 5772 | module_init(init_per_zone_wmark_min) |
1da177e4 LT |
5773 | |
5774 | /* | |
b8af2941 | 5775 | * min_free_kbytes_sysctl_handler - just a wrapper around proc_dointvec() so |
1da177e4 LT |
5776 | * that we can call two helper functions whenever min_free_kbytes |
5777 | * changes. | |
5778 | */ | |
b8af2941 | 5779 | int min_free_kbytes_sysctl_handler(ctl_table *table, int write, |
8d65af78 | 5780 | void __user *buffer, size_t *length, loff_t *ppos) |
1da177e4 | 5781 | { |
da8c757b HP |
5782 | int rc; |
5783 | ||
5784 | rc = proc_dointvec_minmax(table, write, buffer, length, ppos); | |
5785 | if (rc) | |
5786 | return rc; | |
5787 | ||
5f12733e MH |
5788 | if (write) { |
5789 | user_min_free_kbytes = min_free_kbytes; | |
bc75d33f | 5790 | setup_per_zone_wmarks(); |
5f12733e | 5791 | } |
1da177e4 LT |
5792 | return 0; |
5793 | } | |
5794 | ||
9614634f CL |
5795 | #ifdef CONFIG_NUMA |
5796 | int sysctl_min_unmapped_ratio_sysctl_handler(ctl_table *table, int write, | |
8d65af78 | 5797 | void __user *buffer, size_t *length, loff_t *ppos) |
9614634f CL |
5798 | { |
5799 | struct zone *zone; | |
5800 | int rc; | |
5801 | ||
8d65af78 | 5802 | rc = proc_dointvec_minmax(table, write, buffer, length, ppos); |
9614634f CL |
5803 | if (rc) |
5804 | return rc; | |
5805 | ||
5806 | for_each_zone(zone) | |
b40da049 | 5807 | zone->min_unmapped_pages = (zone->managed_pages * |
9614634f CL |
5808 | sysctl_min_unmapped_ratio) / 100; |
5809 | return 0; | |
5810 | } | |
0ff38490 CL |
5811 | |
5812 | int sysctl_min_slab_ratio_sysctl_handler(ctl_table *table, int write, | |
8d65af78 | 5813 | void __user *buffer, size_t *length, loff_t *ppos) |
0ff38490 CL |
5814 | { |
5815 | struct zone *zone; | |
5816 | int rc; | |
5817 | ||
8d65af78 | 5818 | rc = proc_dointvec_minmax(table, write, buffer, length, ppos); |
0ff38490 CL |
5819 | if (rc) |
5820 | return rc; | |
5821 | ||
5822 | for_each_zone(zone) | |
b40da049 | 5823 | zone->min_slab_pages = (zone->managed_pages * |
0ff38490 CL |
5824 | sysctl_min_slab_ratio) / 100; |
5825 | return 0; | |
5826 | } | |
9614634f CL |
5827 | #endif |
5828 | ||
1da177e4 LT |
5829 | /* |
5830 | * lowmem_reserve_ratio_sysctl_handler - just a wrapper around | |
5831 | * proc_dointvec() so that we can call setup_per_zone_lowmem_reserve() | |
5832 | * whenever sysctl_lowmem_reserve_ratio changes. | |
5833 | * | |
5834 | * The reserve ratio obviously has absolutely no relation with the | |
41858966 | 5835 | * minimum watermarks. The lowmem reserve ratio can only make sense |
1da177e4 LT |
5836 | * if in function of the boot time zone sizes. |
5837 | */ | |
5838 | int lowmem_reserve_ratio_sysctl_handler(ctl_table *table, int write, | |
8d65af78 | 5839 | void __user *buffer, size_t *length, loff_t *ppos) |
1da177e4 | 5840 | { |
8d65af78 | 5841 | proc_dointvec_minmax(table, write, buffer, length, ppos); |
1da177e4 LT |
5842 | setup_per_zone_lowmem_reserve(); |
5843 | return 0; | |
5844 | } | |
5845 | ||
8ad4b1fb RS |
5846 | /* |
5847 | * percpu_pagelist_fraction - changes the pcp->high for each zone on each | |
b8af2941 PK |
5848 | * cpu. It is the fraction of total pages in each zone that a hot per cpu |
5849 | * pagelist can have before it gets flushed back to buddy allocator. | |
8ad4b1fb | 5850 | */ |
8ad4b1fb | 5851 | int percpu_pagelist_fraction_sysctl_handler(ctl_table *table, int write, |
8d65af78 | 5852 | void __user *buffer, size_t *length, loff_t *ppos) |
8ad4b1fb RS |
5853 | { |
5854 | struct zone *zone; | |
5855 | unsigned int cpu; | |
5856 | int ret; | |
5857 | ||
8d65af78 | 5858 | ret = proc_dointvec_minmax(table, write, buffer, length, ppos); |
93278814 | 5859 | if (!write || (ret < 0)) |
8ad4b1fb | 5860 | return ret; |
c8e251fa CS |
5861 | |
5862 | mutex_lock(&pcp_batch_high_lock); | |
364df0eb | 5863 | for_each_populated_zone(zone) { |
22a7f12b CS |
5864 | unsigned long high; |
5865 | high = zone->managed_pages / percpu_pagelist_fraction; | |
5866 | for_each_possible_cpu(cpu) | |
3664033c CS |
5867 | pageset_set_high(per_cpu_ptr(zone->pageset, cpu), |
5868 | high); | |
8ad4b1fb | 5869 | } |
c8e251fa | 5870 | mutex_unlock(&pcp_batch_high_lock); |
8ad4b1fb RS |
5871 | return 0; |
5872 | } | |
5873 | ||
f034b5d4 | 5874 | int hashdist = HASHDIST_DEFAULT; |
1da177e4 LT |
5875 | |
5876 | #ifdef CONFIG_NUMA | |
5877 | static int __init set_hashdist(char *str) | |
5878 | { | |
5879 | if (!str) | |
5880 | return 0; | |
5881 | hashdist = simple_strtoul(str, &str, 0); | |
5882 | return 1; | |
5883 | } | |
5884 | __setup("hashdist=", set_hashdist); | |
5885 | #endif | |
5886 | ||
5887 | /* | |
5888 | * allocate a large system hash table from bootmem | |
5889 | * - it is assumed that the hash table must contain an exact power-of-2 | |
5890 | * quantity of entries | |
5891 | * - limit is the number of hash buckets, not the total allocation size | |
5892 | */ | |
5893 | void *__init alloc_large_system_hash(const char *tablename, | |
5894 | unsigned long bucketsize, | |
5895 | unsigned long numentries, | |
5896 | int scale, | |
5897 | int flags, | |
5898 | unsigned int *_hash_shift, | |
5899 | unsigned int *_hash_mask, | |
31fe62b9 TB |
5900 | unsigned long low_limit, |
5901 | unsigned long high_limit) | |
1da177e4 | 5902 | { |
31fe62b9 | 5903 | unsigned long long max = high_limit; |
1da177e4 LT |
5904 | unsigned long log2qty, size; |
5905 | void *table = NULL; | |
5906 | ||
5907 | /* allow the kernel cmdline to have a say */ | |
5908 | if (!numentries) { | |
5909 | /* round applicable memory size up to nearest megabyte */ | |
04903664 | 5910 | numentries = nr_kernel_pages; |
a7e83318 JZ |
5911 | |
5912 | /* It isn't necessary when PAGE_SIZE >= 1MB */ | |
5913 | if (PAGE_SHIFT < 20) | |
5914 | numentries = round_up(numentries, (1<<20)/PAGE_SIZE); | |
1da177e4 LT |
5915 | |
5916 | /* limit to 1 bucket per 2^scale bytes of low memory */ | |
5917 | if (scale > PAGE_SHIFT) | |
5918 | numentries >>= (scale - PAGE_SHIFT); | |
5919 | else | |
5920 | numentries <<= (PAGE_SHIFT - scale); | |
9ab37b8f PM |
5921 | |
5922 | /* Make sure we've got at least a 0-order allocation.. */ | |
2c85f51d JB |
5923 | if (unlikely(flags & HASH_SMALL)) { |
5924 | /* Makes no sense without HASH_EARLY */ | |
5925 | WARN_ON(!(flags & HASH_EARLY)); | |
5926 | if (!(numentries >> *_hash_shift)) { | |
5927 | numentries = 1UL << *_hash_shift; | |
5928 | BUG_ON(!numentries); | |
5929 | } | |
5930 | } else if (unlikely((numentries * bucketsize) < PAGE_SIZE)) | |
9ab37b8f | 5931 | numentries = PAGE_SIZE / bucketsize; |
1da177e4 | 5932 | } |
6e692ed3 | 5933 | numentries = roundup_pow_of_two(numentries); |
1da177e4 LT |
5934 | |
5935 | /* limit allocation size to 1/16 total memory by default */ | |
5936 | if (max == 0) { | |
5937 | max = ((unsigned long long)nr_all_pages << PAGE_SHIFT) >> 4; | |
5938 | do_div(max, bucketsize); | |
5939 | } | |
074b8517 | 5940 | max = min(max, 0x80000000ULL); |
1da177e4 | 5941 | |
31fe62b9 TB |
5942 | if (numentries < low_limit) |
5943 | numentries = low_limit; | |
1da177e4 LT |
5944 | if (numentries > max) |
5945 | numentries = max; | |
5946 | ||
f0d1b0b3 | 5947 | log2qty = ilog2(numentries); |
1da177e4 LT |
5948 | |
5949 | do { | |
5950 | size = bucketsize << log2qty; | |
5951 | if (flags & HASH_EARLY) | |
6782832e | 5952 | table = memblock_virt_alloc_nopanic(size, 0); |
1da177e4 LT |
5953 | else if (hashdist) |
5954 | table = __vmalloc(size, GFP_ATOMIC, PAGE_KERNEL); | |
5955 | else { | |
1037b83b ED |
5956 | /* |
5957 | * If bucketsize is not a power-of-two, we may free | |
a1dd268c MG |
5958 | * some pages at the end of hash table which |
5959 | * alloc_pages_exact() automatically does | |
1037b83b | 5960 | */ |
264ef8a9 | 5961 | if (get_order(size) < MAX_ORDER) { |
a1dd268c | 5962 | table = alloc_pages_exact(size, GFP_ATOMIC); |
264ef8a9 CM |
5963 | kmemleak_alloc(table, size, 1, GFP_ATOMIC); |
5964 | } | |
1da177e4 LT |
5965 | } |
5966 | } while (!table && size > PAGE_SIZE && --log2qty); | |
5967 | ||
5968 | if (!table) | |
5969 | panic("Failed to allocate %s hash table\n", tablename); | |
5970 | ||
f241e660 | 5971 | printk(KERN_INFO "%s hash table entries: %ld (order: %d, %lu bytes)\n", |
1da177e4 | 5972 | tablename, |
f241e660 | 5973 | (1UL << log2qty), |
f0d1b0b3 | 5974 | ilog2(size) - PAGE_SHIFT, |
1da177e4 LT |
5975 | size); |
5976 | ||
5977 | if (_hash_shift) | |
5978 | *_hash_shift = log2qty; | |
5979 | if (_hash_mask) | |
5980 | *_hash_mask = (1 << log2qty) - 1; | |
5981 | ||
5982 | return table; | |
5983 | } | |
a117e66e | 5984 | |
835c134e MG |
5985 | /* Return a pointer to the bitmap storing bits affecting a block of pages */ |
5986 | static inline unsigned long *get_pageblock_bitmap(struct zone *zone, | |
5987 | unsigned long pfn) | |
5988 | { | |
5989 | #ifdef CONFIG_SPARSEMEM | |
5990 | return __pfn_to_section(pfn)->pageblock_flags; | |
5991 | #else | |
5992 | return zone->pageblock_flags; | |
5993 | #endif /* CONFIG_SPARSEMEM */ | |
5994 | } | |
5995 | ||
5996 | static inline int pfn_to_bitidx(struct zone *zone, unsigned long pfn) | |
5997 | { | |
5998 | #ifdef CONFIG_SPARSEMEM | |
5999 | pfn &= (PAGES_PER_SECTION-1); | |
d9c23400 | 6000 | return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS; |
835c134e | 6001 | #else |
c060f943 | 6002 | pfn = pfn - round_down(zone->zone_start_pfn, pageblock_nr_pages); |
d9c23400 | 6003 | return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS; |
835c134e MG |
6004 | #endif /* CONFIG_SPARSEMEM */ |
6005 | } | |
6006 | ||
6007 | /** | |
d9c23400 | 6008 | * get_pageblock_flags_group - Return the requested group of flags for the pageblock_nr_pages block of pages |
835c134e MG |
6009 | * @page: The page within the block of interest |
6010 | * @start_bitidx: The first bit of interest to retrieve | |
6011 | * @end_bitidx: The last bit of interest | |
6012 | * returns pageblock_bits flags | |
6013 | */ | |
6014 | unsigned long get_pageblock_flags_group(struct page *page, | |
6015 | int start_bitidx, int end_bitidx) | |
6016 | { | |
6017 | struct zone *zone; | |
6018 | unsigned long *bitmap; | |
6019 | unsigned long pfn, bitidx; | |
6020 | unsigned long flags = 0; | |
6021 | unsigned long value = 1; | |
6022 | ||
6023 | zone = page_zone(page); | |
6024 | pfn = page_to_pfn(page); | |
6025 | bitmap = get_pageblock_bitmap(zone, pfn); | |
6026 | bitidx = pfn_to_bitidx(zone, pfn); | |
6027 | ||
6028 | for (; start_bitidx <= end_bitidx; start_bitidx++, value <<= 1) | |
6029 | if (test_bit(bitidx + start_bitidx, bitmap)) | |
6030 | flags |= value; | |
6220ec78 | 6031 | |
835c134e MG |
6032 | return flags; |
6033 | } | |
6034 | ||
6035 | /** | |
d9c23400 | 6036 | * set_pageblock_flags_group - Set the requested group of flags for a pageblock_nr_pages block of pages |
835c134e MG |
6037 | * @page: The page within the block of interest |
6038 | * @start_bitidx: The first bit of interest | |
6039 | * @end_bitidx: The last bit of interest | |
6040 | * @flags: The flags to set | |
6041 | */ | |
6042 | void set_pageblock_flags_group(struct page *page, unsigned long flags, | |
6043 | int start_bitidx, int end_bitidx) | |
6044 | { | |
6045 | struct zone *zone; | |
6046 | unsigned long *bitmap; | |
6047 | unsigned long pfn, bitidx; | |
6048 | unsigned long value = 1; | |
6049 | ||
6050 | zone = page_zone(page); | |
6051 | pfn = page_to_pfn(page); | |
6052 | bitmap = get_pageblock_bitmap(zone, pfn); | |
6053 | bitidx = pfn_to_bitidx(zone, pfn); | |
309381fe | 6054 | VM_BUG_ON_PAGE(!zone_spans_pfn(zone, pfn), page); |
835c134e MG |
6055 | |
6056 | for (; start_bitidx <= end_bitidx; start_bitidx++, value <<= 1) | |
6057 | if (flags & value) | |
6058 | __set_bit(bitidx + start_bitidx, bitmap); | |
6059 | else | |
6060 | __clear_bit(bitidx + start_bitidx, bitmap); | |
6061 | } | |
a5d76b54 KH |
6062 | |
6063 | /* | |
80934513 MK |
6064 | * This function checks whether pageblock includes unmovable pages or not. |
6065 | * If @count is not zero, it is okay to include less @count unmovable pages | |
6066 | * | |
b8af2941 | 6067 | * PageLRU check without isolation or lru_lock could race so that |
80934513 MK |
6068 | * MIGRATE_MOVABLE block might include unmovable pages. It means you can't |
6069 | * expect this function should be exact. | |
a5d76b54 | 6070 | */ |
b023f468 WC |
6071 | bool has_unmovable_pages(struct zone *zone, struct page *page, int count, |
6072 | bool skip_hwpoisoned_pages) | |
49ac8255 KH |
6073 | { |
6074 | unsigned long pfn, iter, found; | |
47118af0 MN |
6075 | int mt; |
6076 | ||
49ac8255 KH |
6077 | /* |
6078 | * For avoiding noise data, lru_add_drain_all() should be called | |
80934513 | 6079 | * If ZONE_MOVABLE, the zone never contains unmovable pages |
49ac8255 KH |
6080 | */ |
6081 | if (zone_idx(zone) == ZONE_MOVABLE) | |
80934513 | 6082 | return false; |
47118af0 MN |
6083 | mt = get_pageblock_migratetype(page); |
6084 | if (mt == MIGRATE_MOVABLE || is_migrate_cma(mt)) | |
80934513 | 6085 | return false; |
49ac8255 KH |
6086 | |
6087 | pfn = page_to_pfn(page); | |
6088 | for (found = 0, iter = 0; iter < pageblock_nr_pages; iter++) { | |
6089 | unsigned long check = pfn + iter; | |
6090 | ||
29723fcc | 6091 | if (!pfn_valid_within(check)) |
49ac8255 | 6092 | continue; |
29723fcc | 6093 | |
49ac8255 | 6094 | page = pfn_to_page(check); |
c8721bbb NH |
6095 | |
6096 | /* | |
6097 | * Hugepages are not in LRU lists, but they're movable. | |
6098 | * We need not scan over tail pages bacause we don't | |
6099 | * handle each tail page individually in migration. | |
6100 | */ | |
6101 | if (PageHuge(page)) { | |
6102 | iter = round_up(iter + 1, 1<<compound_order(page)) - 1; | |
6103 | continue; | |
6104 | } | |
6105 | ||
97d255c8 MK |
6106 | /* |
6107 | * We can't use page_count without pin a page | |
6108 | * because another CPU can free compound page. | |
6109 | * This check already skips compound tails of THP | |
6110 | * because their page->_count is zero at all time. | |
6111 | */ | |
6112 | if (!atomic_read(&page->_count)) { | |
49ac8255 KH |
6113 | if (PageBuddy(page)) |
6114 | iter += (1 << page_order(page)) - 1; | |
6115 | continue; | |
6116 | } | |
97d255c8 | 6117 | |
b023f468 WC |
6118 | /* |
6119 | * The HWPoisoned page may be not in buddy system, and | |
6120 | * page_count() is not 0. | |
6121 | */ | |
6122 | if (skip_hwpoisoned_pages && PageHWPoison(page)) | |
6123 | continue; | |
6124 | ||
49ac8255 KH |
6125 | if (!PageLRU(page)) |
6126 | found++; | |
6127 | /* | |
6128 | * If there are RECLAIMABLE pages, we need to check it. | |
6129 | * But now, memory offline itself doesn't call shrink_slab() | |
6130 | * and it still to be fixed. | |
6131 | */ | |
6132 | /* | |
6133 | * If the page is not RAM, page_count()should be 0. | |
6134 | * we don't need more check. This is an _used_ not-movable page. | |
6135 | * | |
6136 | * The problematic thing here is PG_reserved pages. PG_reserved | |
6137 | * is set to both of a memory hole page and a _used_ kernel | |
6138 | * page at boot. | |
6139 | */ | |
6140 | if (found > count) | |
80934513 | 6141 | return true; |
49ac8255 | 6142 | } |
80934513 | 6143 | return false; |
49ac8255 KH |
6144 | } |
6145 | ||
6146 | bool is_pageblock_removable_nolock(struct page *page) | |
6147 | { | |
656a0706 MH |
6148 | struct zone *zone; |
6149 | unsigned long pfn; | |
687875fb MH |
6150 | |
6151 | /* | |
6152 | * We have to be careful here because we are iterating over memory | |
6153 | * sections which are not zone aware so we might end up outside of | |
6154 | * the zone but still within the section. | |
656a0706 MH |
6155 | * We have to take care about the node as well. If the node is offline |
6156 | * its NODE_DATA will be NULL - see page_zone. | |
687875fb | 6157 | */ |
656a0706 MH |
6158 | if (!node_online(page_to_nid(page))) |
6159 | return false; | |
6160 | ||
6161 | zone = page_zone(page); | |
6162 | pfn = page_to_pfn(page); | |
108bcc96 | 6163 | if (!zone_spans_pfn(zone, pfn)) |
687875fb MH |
6164 | return false; |
6165 | ||
b023f468 | 6166 | return !has_unmovable_pages(zone, page, 0, true); |
a5d76b54 | 6167 | } |
0c0e6195 | 6168 | |
041d3a8c MN |
6169 | #ifdef CONFIG_CMA |
6170 | ||
6171 | static unsigned long pfn_max_align_down(unsigned long pfn) | |
6172 | { | |
6173 | return pfn & ~(max_t(unsigned long, MAX_ORDER_NR_PAGES, | |
6174 | pageblock_nr_pages) - 1); | |
6175 | } | |
6176 | ||
6177 | static unsigned long pfn_max_align_up(unsigned long pfn) | |
6178 | { | |
6179 | return ALIGN(pfn, max_t(unsigned long, MAX_ORDER_NR_PAGES, | |
6180 | pageblock_nr_pages)); | |
6181 | } | |
6182 | ||
041d3a8c | 6183 | /* [start, end) must belong to a single zone. */ |
bb13ffeb MG |
6184 | static int __alloc_contig_migrate_range(struct compact_control *cc, |
6185 | unsigned long start, unsigned long end) | |
041d3a8c MN |
6186 | { |
6187 | /* This function is based on compact_zone() from compaction.c. */ | |
beb51eaa | 6188 | unsigned long nr_reclaimed; |
041d3a8c MN |
6189 | unsigned long pfn = start; |
6190 | unsigned int tries = 0; | |
6191 | int ret = 0; | |
6192 | ||
be49a6e1 | 6193 | migrate_prep(); |
041d3a8c | 6194 | |
bb13ffeb | 6195 | while (pfn < end || !list_empty(&cc->migratepages)) { |
041d3a8c MN |
6196 | if (fatal_signal_pending(current)) { |
6197 | ret = -EINTR; | |
6198 | break; | |
6199 | } | |
6200 | ||
bb13ffeb MG |
6201 | if (list_empty(&cc->migratepages)) { |
6202 | cc->nr_migratepages = 0; | |
6203 | pfn = isolate_migratepages_range(cc->zone, cc, | |
e46a2879 | 6204 | pfn, end, true); |
041d3a8c MN |
6205 | if (!pfn) { |
6206 | ret = -EINTR; | |
6207 | break; | |
6208 | } | |
6209 | tries = 0; | |
6210 | } else if (++tries == 5) { | |
6211 | ret = ret < 0 ? ret : -EBUSY; | |
6212 | break; | |
6213 | } | |
6214 | ||
beb51eaa MK |
6215 | nr_reclaimed = reclaim_clean_pages_from_list(cc->zone, |
6216 | &cc->migratepages); | |
6217 | cc->nr_migratepages -= nr_reclaimed; | |
02c6de8d | 6218 | |
9c620e2b HD |
6219 | ret = migrate_pages(&cc->migratepages, alloc_migrate_target, |
6220 | 0, MIGRATE_SYNC, MR_CMA); | |
041d3a8c | 6221 | } |
2a6f5124 SP |
6222 | if (ret < 0) { |
6223 | putback_movable_pages(&cc->migratepages); | |
6224 | return ret; | |
6225 | } | |
6226 | return 0; | |
041d3a8c MN |
6227 | } |
6228 | ||
6229 | /** | |
6230 | * alloc_contig_range() -- tries to allocate given range of pages | |
6231 | * @start: start PFN to allocate | |
6232 | * @end: one-past-the-last PFN to allocate | |
0815f3d8 MN |
6233 | * @migratetype: migratetype of the underlaying pageblocks (either |
6234 | * #MIGRATE_MOVABLE or #MIGRATE_CMA). All pageblocks | |
6235 | * in range must have the same migratetype and it must | |
6236 | * be either of the two. | |
041d3a8c MN |
6237 | * |
6238 | * The PFN range does not have to be pageblock or MAX_ORDER_NR_PAGES | |
6239 | * aligned, however it's the caller's responsibility to guarantee that | |
6240 | * we are the only thread that changes migrate type of pageblocks the | |
6241 | * pages fall in. | |
6242 | * | |
6243 | * The PFN range must belong to a single zone. | |
6244 | * | |
6245 | * Returns zero on success or negative error code. On success all | |
6246 | * pages which PFN is in [start, end) are allocated for the caller and | |
6247 | * need to be freed with free_contig_range(). | |
6248 | */ | |
0815f3d8 MN |
6249 | int alloc_contig_range(unsigned long start, unsigned long end, |
6250 | unsigned migratetype) | |
041d3a8c | 6251 | { |
041d3a8c MN |
6252 | unsigned long outer_start, outer_end; |
6253 | int ret = 0, order; | |
6254 | ||
bb13ffeb MG |
6255 | struct compact_control cc = { |
6256 | .nr_migratepages = 0, | |
6257 | .order = -1, | |
6258 | .zone = page_zone(pfn_to_page(start)), | |
6259 | .sync = true, | |
6260 | .ignore_skip_hint = true, | |
6261 | }; | |
6262 | INIT_LIST_HEAD(&cc.migratepages); | |
6263 | ||
041d3a8c MN |
6264 | /* |
6265 | * What we do here is we mark all pageblocks in range as | |
6266 | * MIGRATE_ISOLATE. Because pageblock and max order pages may | |
6267 | * have different sizes, and due to the way page allocator | |
6268 | * work, we align the range to biggest of the two pages so | |
6269 | * that page allocator won't try to merge buddies from | |
6270 | * different pageblocks and change MIGRATE_ISOLATE to some | |
6271 | * other migration type. | |
6272 | * | |
6273 | * Once the pageblocks are marked as MIGRATE_ISOLATE, we | |
6274 | * migrate the pages from an unaligned range (ie. pages that | |
6275 | * we are interested in). This will put all the pages in | |
6276 | * range back to page allocator as MIGRATE_ISOLATE. | |
6277 | * | |
6278 | * When this is done, we take the pages in range from page | |
6279 | * allocator removing them from the buddy system. This way | |
6280 | * page allocator will never consider using them. | |
6281 | * | |
6282 | * This lets us mark the pageblocks back as | |
6283 | * MIGRATE_CMA/MIGRATE_MOVABLE so that free pages in the | |
6284 | * aligned range but not in the unaligned, original range are | |
6285 | * put back to page allocator so that buddy can use them. | |
6286 | */ | |
6287 | ||
6288 | ret = start_isolate_page_range(pfn_max_align_down(start), | |
b023f468 WC |
6289 | pfn_max_align_up(end), migratetype, |
6290 | false); | |
041d3a8c | 6291 | if (ret) |
86a595f9 | 6292 | return ret; |
041d3a8c | 6293 | |
bb13ffeb | 6294 | ret = __alloc_contig_migrate_range(&cc, start, end); |
041d3a8c MN |
6295 | if (ret) |
6296 | goto done; | |
6297 | ||
6298 | /* | |
6299 | * Pages from [start, end) are within a MAX_ORDER_NR_PAGES | |
6300 | * aligned blocks that are marked as MIGRATE_ISOLATE. What's | |
6301 | * more, all pages in [start, end) are free in page allocator. | |
6302 | * What we are going to do is to allocate all pages from | |
6303 | * [start, end) (that is remove them from page allocator). | |
6304 | * | |
6305 | * The only problem is that pages at the beginning and at the | |
6306 | * end of interesting range may be not aligned with pages that | |
6307 | * page allocator holds, ie. they can be part of higher order | |
6308 | * pages. Because of this, we reserve the bigger range and | |
6309 | * once this is done free the pages we are not interested in. | |
6310 | * | |
6311 | * We don't have to hold zone->lock here because the pages are | |
6312 | * isolated thus they won't get removed from buddy. | |
6313 | */ | |
6314 | ||
6315 | lru_add_drain_all(); | |
6316 | drain_all_pages(); | |
6317 | ||
6318 | order = 0; | |
6319 | outer_start = start; | |
6320 | while (!PageBuddy(pfn_to_page(outer_start))) { | |
6321 | if (++order >= MAX_ORDER) { | |
6322 | ret = -EBUSY; | |
6323 | goto done; | |
6324 | } | |
6325 | outer_start &= ~0UL << order; | |
6326 | } | |
6327 | ||
6328 | /* Make sure the range is really isolated. */ | |
b023f468 | 6329 | if (test_pages_isolated(outer_start, end, false)) { |
041d3a8c MN |
6330 | pr_warn("alloc_contig_range test_pages_isolated(%lx, %lx) failed\n", |
6331 | outer_start, end); | |
6332 | ret = -EBUSY; | |
6333 | goto done; | |
6334 | } | |
6335 | ||
49f223a9 MS |
6336 | |
6337 | /* Grab isolated pages from freelists. */ | |
bb13ffeb | 6338 | outer_end = isolate_freepages_range(&cc, outer_start, end); |
041d3a8c MN |
6339 | if (!outer_end) { |
6340 | ret = -EBUSY; | |
6341 | goto done; | |
6342 | } | |
6343 | ||
6344 | /* Free head and tail (if any) */ | |
6345 | if (start != outer_start) | |
6346 | free_contig_range(outer_start, start - outer_start); | |
6347 | if (end != outer_end) | |
6348 | free_contig_range(end, outer_end - end); | |
6349 | ||
6350 | done: | |
6351 | undo_isolate_page_range(pfn_max_align_down(start), | |
0815f3d8 | 6352 | pfn_max_align_up(end), migratetype); |
041d3a8c MN |
6353 | return ret; |
6354 | } | |
6355 | ||
6356 | void free_contig_range(unsigned long pfn, unsigned nr_pages) | |
6357 | { | |
bcc2b02f MS |
6358 | unsigned int count = 0; |
6359 | ||
6360 | for (; nr_pages--; pfn++) { | |
6361 | struct page *page = pfn_to_page(pfn); | |
6362 | ||
6363 | count += page_count(page) != 1; | |
6364 | __free_page(page); | |
6365 | } | |
6366 | WARN(count != 0, "%d pages are still in use!\n", count); | |
041d3a8c MN |
6367 | } |
6368 | #endif | |
6369 | ||
4ed7e022 | 6370 | #ifdef CONFIG_MEMORY_HOTPLUG |
0a647f38 CS |
6371 | /* |
6372 | * The zone indicated has a new number of managed_pages; batch sizes and percpu | |
6373 | * page high values need to be recalulated. | |
6374 | */ | |
4ed7e022 JL |
6375 | void __meminit zone_pcp_update(struct zone *zone) |
6376 | { | |
0a647f38 | 6377 | unsigned cpu; |
c8e251fa | 6378 | mutex_lock(&pcp_batch_high_lock); |
0a647f38 | 6379 | for_each_possible_cpu(cpu) |
169f6c19 CS |
6380 | pageset_set_high_and_batch(zone, |
6381 | per_cpu_ptr(zone->pageset, cpu)); | |
c8e251fa | 6382 | mutex_unlock(&pcp_batch_high_lock); |
4ed7e022 JL |
6383 | } |
6384 | #endif | |
6385 | ||
340175b7 JL |
6386 | void zone_pcp_reset(struct zone *zone) |
6387 | { | |
6388 | unsigned long flags; | |
5a883813 MK |
6389 | int cpu; |
6390 | struct per_cpu_pageset *pset; | |
340175b7 JL |
6391 | |
6392 | /* avoid races with drain_pages() */ | |
6393 | local_irq_save(flags); | |
6394 | if (zone->pageset != &boot_pageset) { | |
5a883813 MK |
6395 | for_each_online_cpu(cpu) { |
6396 | pset = per_cpu_ptr(zone->pageset, cpu); | |
6397 | drain_zonestat(zone, pset); | |
6398 | } | |
340175b7 JL |
6399 | free_percpu(zone->pageset); |
6400 | zone->pageset = &boot_pageset; | |
6401 | } | |
6402 | local_irq_restore(flags); | |
6403 | } | |
6404 | ||
6dcd73d7 | 6405 | #ifdef CONFIG_MEMORY_HOTREMOVE |
0c0e6195 KH |
6406 | /* |
6407 | * All pages in the range must be isolated before calling this. | |
6408 | */ | |
6409 | void | |
6410 | __offline_isolated_pages(unsigned long start_pfn, unsigned long end_pfn) | |
6411 | { | |
6412 | struct page *page; | |
6413 | struct zone *zone; | |
6414 | int order, i; | |
6415 | unsigned long pfn; | |
6416 | unsigned long flags; | |
6417 | /* find the first valid pfn */ | |
6418 | for (pfn = start_pfn; pfn < end_pfn; pfn++) | |
6419 | if (pfn_valid(pfn)) | |
6420 | break; | |
6421 | if (pfn == end_pfn) | |
6422 | return; | |
6423 | zone = page_zone(pfn_to_page(pfn)); | |
6424 | spin_lock_irqsave(&zone->lock, flags); | |
6425 | pfn = start_pfn; | |
6426 | while (pfn < end_pfn) { | |
6427 | if (!pfn_valid(pfn)) { | |
6428 | pfn++; | |
6429 | continue; | |
6430 | } | |
6431 | page = pfn_to_page(pfn); | |
b023f468 WC |
6432 | /* |
6433 | * The HWPoisoned page may be not in buddy system, and | |
6434 | * page_count() is not 0. | |
6435 | */ | |
6436 | if (unlikely(!PageBuddy(page) && PageHWPoison(page))) { | |
6437 | pfn++; | |
6438 | SetPageReserved(page); | |
6439 | continue; | |
6440 | } | |
6441 | ||
0c0e6195 KH |
6442 | BUG_ON(page_count(page)); |
6443 | BUG_ON(!PageBuddy(page)); | |
6444 | order = page_order(page); | |
6445 | #ifdef CONFIG_DEBUG_VM | |
6446 | printk(KERN_INFO "remove from free list %lx %d %lx\n", | |
6447 | pfn, 1 << order, end_pfn); | |
6448 | #endif | |
6449 | list_del(&page->lru); | |
6450 | rmv_page_order(page); | |
6451 | zone->free_area[order].nr_free--; | |
0c0e6195 KH |
6452 | for (i = 0; i < (1 << order); i++) |
6453 | SetPageReserved((page+i)); | |
6454 | pfn += (1 << order); | |
6455 | } | |
6456 | spin_unlock_irqrestore(&zone->lock, flags); | |
6457 | } | |
6458 | #endif | |
8d22ba1b WF |
6459 | |
6460 | #ifdef CONFIG_MEMORY_FAILURE | |
6461 | bool is_free_buddy_page(struct page *page) | |
6462 | { | |
6463 | struct zone *zone = page_zone(page); | |
6464 | unsigned long pfn = page_to_pfn(page); | |
6465 | unsigned long flags; | |
6466 | int order; | |
6467 | ||
6468 | spin_lock_irqsave(&zone->lock, flags); | |
6469 | for (order = 0; order < MAX_ORDER; order++) { | |
6470 | struct page *page_head = page - (pfn & ((1 << order) - 1)); | |
6471 | ||
6472 | if (PageBuddy(page_head) && page_order(page_head) >= order) | |
6473 | break; | |
6474 | } | |
6475 | spin_unlock_irqrestore(&zone->lock, flags); | |
6476 | ||
6477 | return order < MAX_ORDER; | |
6478 | } | |
6479 | #endif | |
718a3821 | 6480 | |
51300cef | 6481 | static const struct trace_print_flags pageflag_names[] = { |
718a3821 WF |
6482 | {1UL << PG_locked, "locked" }, |
6483 | {1UL << PG_error, "error" }, | |
6484 | {1UL << PG_referenced, "referenced" }, | |
6485 | {1UL << PG_uptodate, "uptodate" }, | |
6486 | {1UL << PG_dirty, "dirty" }, | |
6487 | {1UL << PG_lru, "lru" }, | |
6488 | {1UL << PG_active, "active" }, | |
6489 | {1UL << PG_slab, "slab" }, | |
6490 | {1UL << PG_owner_priv_1, "owner_priv_1" }, | |
6491 | {1UL << PG_arch_1, "arch_1" }, | |
6492 | {1UL << PG_reserved, "reserved" }, | |
6493 | {1UL << PG_private, "private" }, | |
6494 | {1UL << PG_private_2, "private_2" }, | |
6495 | {1UL << PG_writeback, "writeback" }, | |
6496 | #ifdef CONFIG_PAGEFLAGS_EXTENDED | |
6497 | {1UL << PG_head, "head" }, | |
6498 | {1UL << PG_tail, "tail" }, | |
6499 | #else | |
6500 | {1UL << PG_compound, "compound" }, | |
6501 | #endif | |
6502 | {1UL << PG_swapcache, "swapcache" }, | |
6503 | {1UL << PG_mappedtodisk, "mappedtodisk" }, | |
6504 | {1UL << PG_reclaim, "reclaim" }, | |
718a3821 WF |
6505 | {1UL << PG_swapbacked, "swapbacked" }, |
6506 | {1UL << PG_unevictable, "unevictable" }, | |
6507 | #ifdef CONFIG_MMU | |
6508 | {1UL << PG_mlocked, "mlocked" }, | |
6509 | #endif | |
6510 | #ifdef CONFIG_ARCH_USES_PG_UNCACHED | |
6511 | {1UL << PG_uncached, "uncached" }, | |
6512 | #endif | |
6513 | #ifdef CONFIG_MEMORY_FAILURE | |
6514 | {1UL << PG_hwpoison, "hwpoison" }, | |
be9cd873 GS |
6515 | #endif |
6516 | #ifdef CONFIG_TRANSPARENT_HUGEPAGE | |
6517 | {1UL << PG_compound_lock, "compound_lock" }, | |
718a3821 | 6518 | #endif |
718a3821 WF |
6519 | }; |
6520 | ||
6521 | static void dump_page_flags(unsigned long flags) | |
6522 | { | |
6523 | const char *delim = ""; | |
6524 | unsigned long mask; | |
6525 | int i; | |
6526 | ||
51300cef | 6527 | BUILD_BUG_ON(ARRAY_SIZE(pageflag_names) != __NR_PAGEFLAGS); |
acc50c11 | 6528 | |
718a3821 WF |
6529 | printk(KERN_ALERT "page flags: %#lx(", flags); |
6530 | ||
6531 | /* remove zone id */ | |
6532 | flags &= (1UL << NR_PAGEFLAGS) - 1; | |
6533 | ||
51300cef | 6534 | for (i = 0; i < ARRAY_SIZE(pageflag_names) && flags; i++) { |
718a3821 WF |
6535 | |
6536 | mask = pageflag_names[i].mask; | |
6537 | if ((flags & mask) != mask) | |
6538 | continue; | |
6539 | ||
6540 | flags &= ~mask; | |
6541 | printk("%s%s", delim, pageflag_names[i].name); | |
6542 | delim = "|"; | |
6543 | } | |
6544 | ||
6545 | /* check for left over flags */ | |
6546 | if (flags) | |
6547 | printk("%s%#lx", delim, flags); | |
6548 | ||
6549 | printk(")\n"); | |
6550 | } | |
6551 | ||
d230dec1 KS |
6552 | void dump_page_badflags(struct page *page, const char *reason, |
6553 | unsigned long badflags) | |
718a3821 WF |
6554 | { |
6555 | printk(KERN_ALERT | |
6556 | "page:%p count:%d mapcount:%d mapping:%p index:%#lx\n", | |
4e9f64c4 | 6557 | page, atomic_read(&page->_count), page_mapcount(page), |
718a3821 WF |
6558 | page->mapping, page->index); |
6559 | dump_page_flags(page->flags); | |
f0b791a3 DH |
6560 | if (reason) |
6561 | pr_alert("page dumped because: %s\n", reason); | |
6562 | if (page->flags & badflags) { | |
6563 | pr_alert("bad because of flags:\n"); | |
6564 | dump_page_flags(page->flags & badflags); | |
6565 | } | |
f212ad7c | 6566 | mem_cgroup_print_bad_page(page); |
718a3821 | 6567 | } |
f0b791a3 | 6568 | |
d230dec1 | 6569 | void dump_page(struct page *page, const char *reason) |
f0b791a3 DH |
6570 | { |
6571 | dump_page_badflags(page, reason, 0); | |
6572 | } | |
ed12d845 | 6573 | EXPORT_SYMBOL(dump_page); |