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