1 // SPDX-License-Identifier: GPL-2.0-only
3 * linux/mm/page_alloc.c
5 * Manages the free list, the system allocates free pages here.
6 * Note that kmalloc() lives in slab.c
8 * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds
9 * Swap reorganised 29.12.95, Stephen Tweedie
10 * Support of BIGMEM added by Gerhard Wichert, Siemens AG, July 1999
11 * Reshaped it to be a zoned allocator, Ingo Molnar, Red Hat, 1999
12 * Discontiguous memory support, Kanoj Sarcar, SGI, Nov 1999
13 * Zone balancing, Kanoj Sarcar, SGI, Jan 2000
14 * Per cpu hot/cold page lists, bulk allocation, Martin J. Bligh, Sept 2002
15 * (lots of bits borrowed from Ingo Molnar & Andrew Morton)
18 #include <linux/stddef.h>
20 #include <linux/highmem.h>
21 #include <linux/swap.h>
22 #include <linux/interrupt.h>
23 #include <linux/pagemap.h>
24 #include <linux/jiffies.h>
25 #include <linux/memblock.h>
26 #include <linux/compiler.h>
27 #include <linux/kernel.h>
28 #include <linux/kasan.h>
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>
34 #include <linux/ratelimit.h>
35 #include <linux/oom.h>
36 #include <linux/topology.h>
37 #include <linux/sysctl.h>
38 #include <linux/cpu.h>
39 #include <linux/cpuset.h>
40 #include <linux/memory_hotplug.h>
41 #include <linux/nodemask.h>
42 #include <linux/vmalloc.h>
43 #include <linux/vmstat.h>
44 #include <linux/mempolicy.h>
45 #include <linux/memremap.h>
46 #include <linux/stop_machine.h>
47 #include <linux/random.h>
48 #include <linux/sort.h>
49 #include <linux/pfn.h>
50 #include <linux/backing-dev.h>
51 #include <linux/fault-inject.h>
52 #include <linux/page-isolation.h>
53 #include <linux/debugobjects.h>
54 #include <linux/kmemleak.h>
55 #include <linux/compaction.h>
56 #include <trace/events/kmem.h>
57 #include <trace/events/oom.h>
58 #include <linux/prefetch.h>
59 #include <linux/mm_inline.h>
60 #include <linux/migrate.h>
61 #include <linux/hugetlb.h>
62 #include <linux/sched/rt.h>
63 #include <linux/sched/mm.h>
64 #include <linux/page_owner.h>
65 #include <linux/kthread.h>
66 #include <linux/memcontrol.h>
67 #include <linux/ftrace.h>
68 #include <linux/lockdep.h>
69 #include <linux/nmi.h>
70 #include <linux/psi.h>
71 #include <linux/padata.h>
73 #include <asm/sections.h>
74 #include <asm/tlbflush.h>
75 #include <asm/div64.h>
78 #include "page_reporting.h"
80 /* prevent >1 _updater_ of zone percpu pageset ->high and ->batch fields */
81 static DEFINE_MUTEX(pcp_batch_high_lock);
82 #define MIN_PERCPU_PAGELIST_FRACTION (8)
84 #ifdef CONFIG_USE_PERCPU_NUMA_NODE_ID
85 DEFINE_PER_CPU(int, numa_node);
86 EXPORT_PER_CPU_SYMBOL(numa_node);
89 DEFINE_STATIC_KEY_TRUE(vm_numa_stat_key);
91 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
93 * N.B., Do NOT reference the '_numa_mem_' per cpu variable directly.
94 * It will not be defined when CONFIG_HAVE_MEMORYLESS_NODES is not defined.
95 * Use the accessor functions set_numa_mem(), numa_mem_id() and cpu_to_mem()
96 * defined in <linux/topology.h>.
98 DEFINE_PER_CPU(int, _numa_mem_); /* Kernel "local memory" node */
99 EXPORT_PER_CPU_SYMBOL(_numa_mem_);
102 /* work_structs for global per-cpu drains */
105 struct work_struct work;
107 static DEFINE_MUTEX(pcpu_drain_mutex);
108 static DEFINE_PER_CPU(struct pcpu_drain, pcpu_drain);
110 #ifdef CONFIG_GCC_PLUGIN_LATENT_ENTROPY
111 volatile unsigned long latent_entropy __latent_entropy;
112 EXPORT_SYMBOL(latent_entropy);
116 * Array of node states.
118 nodemask_t node_states[NR_NODE_STATES] __read_mostly = {
119 [N_POSSIBLE] = NODE_MASK_ALL,
120 [N_ONLINE] = { { [0] = 1UL } },
122 [N_NORMAL_MEMORY] = { { [0] = 1UL } },
123 #ifdef CONFIG_HIGHMEM
124 [N_HIGH_MEMORY] = { { [0] = 1UL } },
126 [N_MEMORY] = { { [0] = 1UL } },
127 [N_CPU] = { { [0] = 1UL } },
130 EXPORT_SYMBOL(node_states);
132 atomic_long_t _totalram_pages __read_mostly;
133 EXPORT_SYMBOL(_totalram_pages);
134 unsigned long totalreserve_pages __read_mostly;
135 unsigned long totalcma_pages __read_mostly;
137 int percpu_pagelist_fraction;
138 gfp_t gfp_allowed_mask __read_mostly = GFP_BOOT_MASK;
139 #ifdef CONFIG_INIT_ON_ALLOC_DEFAULT_ON
140 DEFINE_STATIC_KEY_TRUE(init_on_alloc);
142 DEFINE_STATIC_KEY_FALSE(init_on_alloc);
144 EXPORT_SYMBOL(init_on_alloc);
146 #ifdef CONFIG_INIT_ON_FREE_DEFAULT_ON
147 DEFINE_STATIC_KEY_TRUE(init_on_free);
149 DEFINE_STATIC_KEY_FALSE(init_on_free);
151 EXPORT_SYMBOL(init_on_free);
153 static int __init early_init_on_alloc(char *buf)
160 ret = kstrtobool(buf, &bool_result);
161 if (bool_result && page_poisoning_enabled())
162 pr_info("mem auto-init: CONFIG_PAGE_POISONING is on, will take precedence over init_on_alloc\n");
164 static_branch_enable(&init_on_alloc);
166 static_branch_disable(&init_on_alloc);
169 early_param("init_on_alloc", early_init_on_alloc);
171 static int __init early_init_on_free(char *buf)
178 ret = kstrtobool(buf, &bool_result);
179 if (bool_result && page_poisoning_enabled())
180 pr_info("mem auto-init: CONFIG_PAGE_POISONING is on, will take precedence over init_on_free\n");
182 static_branch_enable(&init_on_free);
184 static_branch_disable(&init_on_free);
187 early_param("init_on_free", early_init_on_free);
190 * A cached value of the page's pageblock's migratetype, used when the page is
191 * put on a pcplist. Used to avoid the pageblock migratetype lookup when
192 * freeing from pcplists in most cases, at the cost of possibly becoming stale.
193 * Also the migratetype set in the page does not necessarily match the pcplist
194 * index, e.g. page might have MIGRATE_CMA set but be on a pcplist with any
195 * other index - this ensures that it will be put on the correct CMA freelist.
197 static inline int get_pcppage_migratetype(struct page *page)
202 static inline void set_pcppage_migratetype(struct page *page, int migratetype)
204 page->index = migratetype;
207 #ifdef CONFIG_PM_SLEEP
209 * The following functions are used by the suspend/hibernate code to temporarily
210 * change gfp_allowed_mask in order to avoid using I/O during memory allocations
211 * while devices are suspended. To avoid races with the suspend/hibernate code,
212 * they should always be called with system_transition_mutex held
213 * (gfp_allowed_mask also should only be modified with system_transition_mutex
214 * held, unless the suspend/hibernate code is guaranteed not to run in parallel
215 * with that modification).
218 static gfp_t saved_gfp_mask;
220 void pm_restore_gfp_mask(void)
222 WARN_ON(!mutex_is_locked(&system_transition_mutex));
223 if (saved_gfp_mask) {
224 gfp_allowed_mask = saved_gfp_mask;
229 void pm_restrict_gfp_mask(void)
231 WARN_ON(!mutex_is_locked(&system_transition_mutex));
232 WARN_ON(saved_gfp_mask);
233 saved_gfp_mask = gfp_allowed_mask;
234 gfp_allowed_mask &= ~(__GFP_IO | __GFP_FS);
237 bool pm_suspended_storage(void)
239 if ((gfp_allowed_mask & (__GFP_IO | __GFP_FS)) == (__GFP_IO | __GFP_FS))
243 #endif /* CONFIG_PM_SLEEP */
245 #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
246 unsigned int pageblock_order __read_mostly;
249 static void __free_pages_ok(struct page *page, unsigned int order);
252 * results with 256, 32 in the lowmem_reserve sysctl:
253 * 1G machine -> (16M dma, 800M-16M normal, 1G-800M high)
254 * 1G machine -> (16M dma, 784M normal, 224M high)
255 * NORMAL allocation will leave 784M/256 of ram reserved in the ZONE_DMA
256 * HIGHMEM allocation will leave 224M/32 of ram reserved in ZONE_NORMAL
257 * HIGHMEM allocation will leave (224M+784M)/256 of ram reserved in ZONE_DMA
259 * TBD: should special case ZONE_DMA32 machines here - in those we normally
260 * don't need any ZONE_NORMAL reservation
262 int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES] = {
263 #ifdef CONFIG_ZONE_DMA
266 #ifdef CONFIG_ZONE_DMA32
270 #ifdef CONFIG_HIGHMEM
276 static char * const zone_names[MAX_NR_ZONES] = {
277 #ifdef CONFIG_ZONE_DMA
280 #ifdef CONFIG_ZONE_DMA32
284 #ifdef CONFIG_HIGHMEM
288 #ifdef CONFIG_ZONE_DEVICE
293 const char * const migratetype_names[MIGRATE_TYPES] = {
301 #ifdef CONFIG_MEMORY_ISOLATION
306 compound_page_dtor * const compound_page_dtors[NR_COMPOUND_DTORS] = {
307 [NULL_COMPOUND_DTOR] = NULL,
308 [COMPOUND_PAGE_DTOR] = free_compound_page,
309 #ifdef CONFIG_HUGETLB_PAGE
310 [HUGETLB_PAGE_DTOR] = free_huge_page,
312 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
313 [TRANSHUGE_PAGE_DTOR] = free_transhuge_page,
317 int min_free_kbytes = 1024;
318 int user_min_free_kbytes = -1;
319 #ifdef CONFIG_DISCONTIGMEM
321 * DiscontigMem defines memory ranges as separate pg_data_t even if the ranges
322 * are not on separate NUMA nodes. Functionally this works but with
323 * watermark_boost_factor, it can reclaim prematurely as the ranges can be
324 * quite small. By default, do not boost watermarks on discontigmem as in
325 * many cases very high-order allocations like THP are likely to be
326 * unsupported and the premature reclaim offsets the advantage of long-term
327 * fragmentation avoidance.
329 int watermark_boost_factor __read_mostly;
331 int watermark_boost_factor __read_mostly = 15000;
333 int watermark_scale_factor = 10;
335 static unsigned long nr_kernel_pages __initdata;
336 static unsigned long nr_all_pages __initdata;
337 static unsigned long dma_reserve __initdata;
339 static unsigned long arch_zone_lowest_possible_pfn[MAX_NR_ZONES] __initdata;
340 static unsigned long arch_zone_highest_possible_pfn[MAX_NR_ZONES] __initdata;
341 static unsigned long required_kernelcore __initdata;
342 static unsigned long required_kernelcore_percent __initdata;
343 static unsigned long required_movablecore __initdata;
344 static unsigned long required_movablecore_percent __initdata;
345 static unsigned long zone_movable_pfn[MAX_NUMNODES] __initdata;
346 static bool mirrored_kernelcore __meminitdata;
348 /* movable_zone is the "real" zone pages in ZONE_MOVABLE are taken from */
350 EXPORT_SYMBOL(movable_zone);
353 unsigned int nr_node_ids __read_mostly = MAX_NUMNODES;
354 unsigned int nr_online_nodes __read_mostly = 1;
355 EXPORT_SYMBOL(nr_node_ids);
356 EXPORT_SYMBOL(nr_online_nodes);
359 int page_group_by_mobility_disabled __read_mostly;
361 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
363 * During boot we initialize deferred pages on-demand, as needed, but once
364 * page_alloc_init_late() has finished, the deferred pages are all initialized,
365 * and we can permanently disable that path.
367 static DEFINE_STATIC_KEY_TRUE(deferred_pages);
370 * Calling kasan_free_pages() only after deferred memory initialization
371 * has completed. Poisoning pages during deferred memory init will greatly
372 * lengthen the process and cause problem in large memory systems as the
373 * deferred pages initialization is done with interrupt disabled.
375 * Assuming that there will be no reference to those newly initialized
376 * pages before they are ever allocated, this should have no effect on
377 * KASAN memory tracking as the poison will be properly inserted at page
378 * allocation time. The only corner case is when pages are allocated by
379 * on-demand allocation and then freed again before the deferred pages
380 * initialization is done, but this is not likely to happen.
382 static inline void kasan_free_nondeferred_pages(struct page *page, int order)
384 if (!static_branch_unlikely(&deferred_pages))
385 kasan_free_pages(page, order);
388 /* Returns true if the struct page for the pfn is uninitialised */
389 static inline bool __meminit early_page_uninitialised(unsigned long pfn)
391 int nid = early_pfn_to_nid(pfn);
393 if (node_online(nid) && pfn >= NODE_DATA(nid)->first_deferred_pfn)
400 * Returns true when the remaining initialisation should be deferred until
401 * later in the boot cycle when it can be parallelised.
403 static bool __meminit
404 defer_init(int nid, unsigned long pfn, unsigned long end_pfn)
406 static unsigned long prev_end_pfn, nr_initialised;
409 * prev_end_pfn static that contains the end of previous zone
410 * No need to protect because called very early in boot before smp_init.
412 if (prev_end_pfn != end_pfn) {
413 prev_end_pfn = end_pfn;
417 /* Always populate low zones for address-constrained allocations */
418 if (end_pfn < pgdat_end_pfn(NODE_DATA(nid)))
422 * We start only with one section of pages, more pages are added as
423 * needed until the rest of deferred pages are initialized.
426 if ((nr_initialised > PAGES_PER_SECTION) &&
427 (pfn & (PAGES_PER_SECTION - 1)) == 0) {
428 NODE_DATA(nid)->first_deferred_pfn = pfn;
434 #define kasan_free_nondeferred_pages(p, o) kasan_free_pages(p, o)
436 static inline bool early_page_uninitialised(unsigned long pfn)
441 static inline bool defer_init(int nid, unsigned long pfn, unsigned long end_pfn)
447 /* Return a pointer to the bitmap storing bits affecting a block of pages */
448 static inline unsigned long *get_pageblock_bitmap(struct page *page,
451 #ifdef CONFIG_SPARSEMEM
452 return section_to_usemap(__pfn_to_section(pfn));
454 return page_zone(page)->pageblock_flags;
455 #endif /* CONFIG_SPARSEMEM */
458 static inline int pfn_to_bitidx(struct page *page, unsigned long pfn)
460 #ifdef CONFIG_SPARSEMEM
461 pfn &= (PAGES_PER_SECTION-1);
462 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
464 pfn = pfn - round_down(page_zone(page)->zone_start_pfn, pageblock_nr_pages);
465 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
466 #endif /* CONFIG_SPARSEMEM */
470 * get_pfnblock_flags_mask - Return the requested group of flags for the pageblock_nr_pages block of pages
471 * @page: The page within the block of interest
472 * @pfn: The target page frame number
473 * @end_bitidx: The last bit of interest to retrieve
474 * @mask: mask of bits that the caller is interested in
476 * Return: pageblock_bits flags
478 static __always_inline unsigned long __get_pfnblock_flags_mask(struct page *page,
480 unsigned long end_bitidx,
483 unsigned long *bitmap;
484 unsigned long bitidx, word_bitidx;
487 bitmap = get_pageblock_bitmap(page, pfn);
488 bitidx = pfn_to_bitidx(page, pfn);
489 word_bitidx = bitidx / BITS_PER_LONG;
490 bitidx &= (BITS_PER_LONG-1);
492 word = bitmap[word_bitidx];
493 bitidx += end_bitidx;
494 return (word >> (BITS_PER_LONG - bitidx - 1)) & mask;
497 unsigned long get_pfnblock_flags_mask(struct page *page, unsigned long pfn,
498 unsigned long end_bitidx,
501 return __get_pfnblock_flags_mask(page, pfn, end_bitidx, mask);
504 static __always_inline int get_pfnblock_migratetype(struct page *page, unsigned long pfn)
506 return __get_pfnblock_flags_mask(page, pfn, PB_migrate_end, MIGRATETYPE_MASK);
510 * set_pfnblock_flags_mask - Set the requested group of flags for a pageblock_nr_pages block of pages
511 * @page: The page within the block of interest
512 * @flags: The flags to set
513 * @pfn: The target page frame number
514 * @end_bitidx: The last bit of interest
515 * @mask: mask of bits that the caller is interested in
517 void set_pfnblock_flags_mask(struct page *page, unsigned long flags,
519 unsigned long end_bitidx,
522 unsigned long *bitmap;
523 unsigned long bitidx, word_bitidx;
524 unsigned long old_word, word;
526 BUILD_BUG_ON(NR_PAGEBLOCK_BITS != 4);
527 BUILD_BUG_ON(MIGRATE_TYPES > (1 << PB_migratetype_bits));
529 bitmap = get_pageblock_bitmap(page, pfn);
530 bitidx = pfn_to_bitidx(page, pfn);
531 word_bitidx = bitidx / BITS_PER_LONG;
532 bitidx &= (BITS_PER_LONG-1);
534 VM_BUG_ON_PAGE(!zone_spans_pfn(page_zone(page), pfn), page);
536 bitidx += end_bitidx;
537 mask <<= (BITS_PER_LONG - bitidx - 1);
538 flags <<= (BITS_PER_LONG - bitidx - 1);
540 word = READ_ONCE(bitmap[word_bitidx]);
542 old_word = cmpxchg(&bitmap[word_bitidx], word, (word & ~mask) | flags);
543 if (word == old_word)
549 void set_pageblock_migratetype(struct page *page, int migratetype)
551 if (unlikely(page_group_by_mobility_disabled &&
552 migratetype < MIGRATE_PCPTYPES))
553 migratetype = MIGRATE_UNMOVABLE;
555 set_pageblock_flags_group(page, (unsigned long)migratetype,
556 PB_migrate, PB_migrate_end);
559 #ifdef CONFIG_DEBUG_VM
560 static int page_outside_zone_boundaries(struct zone *zone, struct page *page)
564 unsigned long pfn = page_to_pfn(page);
565 unsigned long sp, start_pfn;
568 seq = zone_span_seqbegin(zone);
569 start_pfn = zone->zone_start_pfn;
570 sp = zone->spanned_pages;
571 if (!zone_spans_pfn(zone, pfn))
573 } while (zone_span_seqretry(zone, seq));
576 pr_err("page 0x%lx outside node %d zone %s [ 0x%lx - 0x%lx ]\n",
577 pfn, zone_to_nid(zone), zone->name,
578 start_pfn, start_pfn + sp);
583 static int page_is_consistent(struct zone *zone, struct page *page)
585 if (!pfn_valid_within(page_to_pfn(page)))
587 if (zone != page_zone(page))
593 * Temporary debugging check for pages not lying within a given zone.
595 static int __maybe_unused bad_range(struct zone *zone, struct page *page)
597 if (page_outside_zone_boundaries(zone, page))
599 if (!page_is_consistent(zone, page))
605 static inline int __maybe_unused bad_range(struct zone *zone, struct page *page)
611 static void bad_page(struct page *page, const char *reason)
613 static unsigned long resume;
614 static unsigned long nr_shown;
615 static unsigned long nr_unshown;
618 * Allow a burst of 60 reports, then keep quiet for that minute;
619 * or allow a steady drip of one report per second.
621 if (nr_shown == 60) {
622 if (time_before(jiffies, resume)) {
628 "BUG: Bad page state: %lu messages suppressed\n",
635 resume = jiffies + 60 * HZ;
637 pr_alert("BUG: Bad page state in process %s pfn:%05lx\n",
638 current->comm, page_to_pfn(page));
639 __dump_page(page, reason);
640 dump_page_owner(page);
645 /* Leave bad fields for debug, except PageBuddy could make trouble */
646 page_mapcount_reset(page); /* remove PageBuddy */
647 add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE);
651 * Higher-order pages are called "compound pages". They are structured thusly:
653 * The first PAGE_SIZE page is called the "head page" and have PG_head set.
655 * The remaining PAGE_SIZE pages are called "tail pages". PageTail() is encoded
656 * in bit 0 of page->compound_head. The rest of bits is pointer to head page.
658 * The first tail page's ->compound_dtor holds the offset in array of compound
659 * page destructors. See compound_page_dtors.
661 * The first tail page's ->compound_order holds the order of allocation.
662 * This usage means that zero-order pages may not be compound.
665 void free_compound_page(struct page *page)
667 mem_cgroup_uncharge(page);
668 __free_pages_ok(page, compound_order(page));
671 void prep_compound_page(struct page *page, unsigned int order)
674 int nr_pages = 1 << order;
676 set_compound_page_dtor(page, COMPOUND_PAGE_DTOR);
677 set_compound_order(page, order);
679 for (i = 1; i < nr_pages; i++) {
680 struct page *p = page + i;
681 set_page_count(p, 0);
682 p->mapping = TAIL_MAPPING;
683 set_compound_head(p, page);
685 atomic_set(compound_mapcount_ptr(page), -1);
686 if (hpage_pincount_available(page))
687 atomic_set(compound_pincount_ptr(page), 0);
690 #ifdef CONFIG_DEBUG_PAGEALLOC
691 unsigned int _debug_guardpage_minorder;
693 bool _debug_pagealloc_enabled_early __read_mostly
694 = IS_ENABLED(CONFIG_DEBUG_PAGEALLOC_ENABLE_DEFAULT);
695 EXPORT_SYMBOL(_debug_pagealloc_enabled_early);
696 DEFINE_STATIC_KEY_FALSE(_debug_pagealloc_enabled);
697 EXPORT_SYMBOL(_debug_pagealloc_enabled);
699 DEFINE_STATIC_KEY_FALSE(_debug_guardpage_enabled);
701 static int __init early_debug_pagealloc(char *buf)
703 return kstrtobool(buf, &_debug_pagealloc_enabled_early);
705 early_param("debug_pagealloc", early_debug_pagealloc);
707 void init_debug_pagealloc(void)
709 if (!debug_pagealloc_enabled())
712 static_branch_enable(&_debug_pagealloc_enabled);
714 if (!debug_guardpage_minorder())
717 static_branch_enable(&_debug_guardpage_enabled);
720 static int __init debug_guardpage_minorder_setup(char *buf)
724 if (kstrtoul(buf, 10, &res) < 0 || res > MAX_ORDER / 2) {
725 pr_err("Bad debug_guardpage_minorder value\n");
728 _debug_guardpage_minorder = res;
729 pr_info("Setting debug_guardpage_minorder to %lu\n", res);
732 early_param("debug_guardpage_minorder", debug_guardpage_minorder_setup);
734 static inline bool set_page_guard(struct zone *zone, struct page *page,
735 unsigned int order, int migratetype)
737 if (!debug_guardpage_enabled())
740 if (order >= debug_guardpage_minorder())
743 __SetPageGuard(page);
744 INIT_LIST_HEAD(&page->lru);
745 set_page_private(page, order);
746 /* Guard pages are not available for any usage */
747 __mod_zone_freepage_state(zone, -(1 << order), migratetype);
752 static inline void clear_page_guard(struct zone *zone, struct page *page,
753 unsigned int order, int migratetype)
755 if (!debug_guardpage_enabled())
758 __ClearPageGuard(page);
760 set_page_private(page, 0);
761 if (!is_migrate_isolate(migratetype))
762 __mod_zone_freepage_state(zone, (1 << order), migratetype);
765 static inline bool set_page_guard(struct zone *zone, struct page *page,
766 unsigned int order, int migratetype) { return false; }
767 static inline void clear_page_guard(struct zone *zone, struct page *page,
768 unsigned int order, int migratetype) {}
771 static inline void set_page_order(struct page *page, unsigned int order)
773 set_page_private(page, order);
774 __SetPageBuddy(page);
778 * This function checks whether a page is free && is the buddy
779 * we can coalesce a page and its buddy if
780 * (a) the buddy is not in a hole (check before calling!) &&
781 * (b) the buddy is in the buddy system &&
782 * (c) a page and its buddy have the same order &&
783 * (d) a page and its buddy are in the same zone.
785 * For recording whether a page is in the buddy system, we set PageBuddy.
786 * Setting, clearing, and testing PageBuddy is serialized by zone->lock.
788 * For recording page's order, we use page_private(page).
790 static inline bool page_is_buddy(struct page *page, struct page *buddy,
793 if (!page_is_guard(buddy) && !PageBuddy(buddy))
796 if (page_order(buddy) != order)
800 * zone check is done late to avoid uselessly calculating
801 * zone/node ids for pages that could never merge.
803 if (page_zone_id(page) != page_zone_id(buddy))
806 VM_BUG_ON_PAGE(page_count(buddy) != 0, buddy);
811 #ifdef CONFIG_COMPACTION
812 static inline struct capture_control *task_capc(struct zone *zone)
814 struct capture_control *capc = current->capture_control;
816 return unlikely(capc) &&
817 !(current->flags & PF_KTHREAD) &&
819 capc->cc->zone == zone ? capc : NULL;
823 compaction_capture(struct capture_control *capc, struct page *page,
824 int order, int migratetype)
826 if (!capc || order != capc->cc->order)
829 /* Do not accidentally pollute CMA or isolated regions*/
830 if (is_migrate_cma(migratetype) ||
831 is_migrate_isolate(migratetype))
835 * Do not let lower order allocations polluate a movable pageblock.
836 * This might let an unmovable request use a reclaimable pageblock
837 * and vice-versa but no more than normal fallback logic which can
838 * have trouble finding a high-order free page.
840 if (order < pageblock_order && migratetype == MIGRATE_MOVABLE)
848 static inline struct capture_control *task_capc(struct zone *zone)
854 compaction_capture(struct capture_control *capc, struct page *page,
855 int order, int migratetype)
859 #endif /* CONFIG_COMPACTION */
861 /* Used for pages not on another list */
862 static inline void add_to_free_list(struct page *page, struct zone *zone,
863 unsigned int order, int migratetype)
865 struct free_area *area = &zone->free_area[order];
867 list_add(&page->lru, &area->free_list[migratetype]);
871 /* Used for pages not on another list */
872 static inline void add_to_free_list_tail(struct page *page, struct zone *zone,
873 unsigned int order, int migratetype)
875 struct free_area *area = &zone->free_area[order];
877 list_add_tail(&page->lru, &area->free_list[migratetype]);
881 /* Used for pages which are on another list */
882 static inline void move_to_free_list(struct page *page, struct zone *zone,
883 unsigned int order, int migratetype)
885 struct free_area *area = &zone->free_area[order];
887 list_move(&page->lru, &area->free_list[migratetype]);
890 static inline void del_page_from_free_list(struct page *page, struct zone *zone,
893 /* clear reported state and update reported page count */
894 if (page_reported(page))
895 __ClearPageReported(page);
897 list_del(&page->lru);
898 __ClearPageBuddy(page);
899 set_page_private(page, 0);
900 zone->free_area[order].nr_free--;
904 * If this is not the largest possible page, check if the buddy
905 * of the next-highest order is free. If it is, it's possible
906 * that pages are being freed that will coalesce soon. In case,
907 * that is happening, add the free page to the tail of the list
908 * so it's less likely to be used soon and more likely to be merged
909 * as a higher order page
912 buddy_merge_likely(unsigned long pfn, unsigned long buddy_pfn,
913 struct page *page, unsigned int order)
915 struct page *higher_page, *higher_buddy;
916 unsigned long combined_pfn;
918 if (order >= MAX_ORDER - 2)
921 if (!pfn_valid_within(buddy_pfn))
924 combined_pfn = buddy_pfn & pfn;
925 higher_page = page + (combined_pfn - pfn);
926 buddy_pfn = __find_buddy_pfn(combined_pfn, order + 1);
927 higher_buddy = higher_page + (buddy_pfn - combined_pfn);
929 return pfn_valid_within(buddy_pfn) &&
930 page_is_buddy(higher_page, higher_buddy, order + 1);
934 * Freeing function for a buddy system allocator.
936 * The concept of a buddy system is to maintain direct-mapped table
937 * (containing bit values) for memory blocks of various "orders".
938 * The bottom level table contains the map for the smallest allocatable
939 * units of memory (here, pages), and each level above it describes
940 * pairs of units from the levels below, hence, "buddies".
941 * At a high level, all that happens here is marking the table entry
942 * at the bottom level available, and propagating the changes upward
943 * as necessary, plus some accounting needed to play nicely with other
944 * parts of the VM system.
945 * At each level, we keep a list of pages, which are heads of continuous
946 * free pages of length of (1 << order) and marked with PageBuddy.
947 * Page's order is recorded in page_private(page) field.
948 * So when we are allocating or freeing one, we can derive the state of the
949 * other. That is, if we allocate a small block, and both were
950 * free, the remainder of the region must be split into blocks.
951 * If a block is freed, and its buddy is also free, then this
952 * triggers coalescing into a block of larger size.
957 static inline void __free_one_page(struct page *page,
959 struct zone *zone, unsigned int order,
960 int migratetype, bool report)
962 struct capture_control *capc = task_capc(zone);
963 unsigned long buddy_pfn;
964 unsigned long combined_pfn;
965 unsigned int max_order;
969 max_order = min_t(unsigned int, MAX_ORDER, pageblock_order + 1);
971 VM_BUG_ON(!zone_is_initialized(zone));
972 VM_BUG_ON_PAGE(page->flags & PAGE_FLAGS_CHECK_AT_PREP, page);
974 VM_BUG_ON(migratetype == -1);
975 if (likely(!is_migrate_isolate(migratetype)))
976 __mod_zone_freepage_state(zone, 1 << order, migratetype);
978 VM_BUG_ON_PAGE(pfn & ((1 << order) - 1), page);
979 VM_BUG_ON_PAGE(bad_range(zone, page), page);
982 while (order < max_order - 1) {
983 if (compaction_capture(capc, page, order, migratetype)) {
984 __mod_zone_freepage_state(zone, -(1 << order),
988 buddy_pfn = __find_buddy_pfn(pfn, order);
989 buddy = page + (buddy_pfn - pfn);
991 if (!pfn_valid_within(buddy_pfn))
993 if (!page_is_buddy(page, buddy, order))
996 * Our buddy is free or it is CONFIG_DEBUG_PAGEALLOC guard page,
997 * merge with it and move up one order.
999 if (page_is_guard(buddy))
1000 clear_page_guard(zone, buddy, order, migratetype);
1002 del_page_from_free_list(buddy, zone, order);
1003 combined_pfn = buddy_pfn & pfn;
1004 page = page + (combined_pfn - pfn);
1008 if (max_order < MAX_ORDER) {
1009 /* If we are here, it means order is >= pageblock_order.
1010 * We want to prevent merge between freepages on isolate
1011 * pageblock and normal pageblock. Without this, pageblock
1012 * isolation could cause incorrect freepage or CMA accounting.
1014 * We don't want to hit this code for the more frequent
1015 * low-order merging.
1017 if (unlikely(has_isolate_pageblock(zone))) {
1020 buddy_pfn = __find_buddy_pfn(pfn, order);
1021 buddy = page + (buddy_pfn - pfn);
1022 buddy_mt = get_pageblock_migratetype(buddy);
1024 if (migratetype != buddy_mt
1025 && (is_migrate_isolate(migratetype) ||
1026 is_migrate_isolate(buddy_mt)))
1030 goto continue_merging;
1034 set_page_order(page, order);
1036 if (is_shuffle_order(order))
1037 to_tail = shuffle_pick_tail();
1039 to_tail = buddy_merge_likely(pfn, buddy_pfn, page, order);
1042 add_to_free_list_tail(page, zone, order, migratetype);
1044 add_to_free_list(page, zone, order, migratetype);
1046 /* Notify page reporting subsystem of freed page */
1048 page_reporting_notify_free(order);
1052 * A bad page could be due to a number of fields. Instead of multiple branches,
1053 * try and check multiple fields with one check. The caller must do a detailed
1054 * check if necessary.
1056 static inline bool page_expected_state(struct page *page,
1057 unsigned long check_flags)
1059 if (unlikely(atomic_read(&page->_mapcount) != -1))
1062 if (unlikely((unsigned long)page->mapping |
1063 page_ref_count(page) |
1065 (unsigned long)page->mem_cgroup |
1067 (page->flags & check_flags)))
1073 static const char *page_bad_reason(struct page *page, unsigned long flags)
1075 const char *bad_reason = NULL;
1077 if (unlikely(atomic_read(&page->_mapcount) != -1))
1078 bad_reason = "nonzero mapcount";
1079 if (unlikely(page->mapping != NULL))
1080 bad_reason = "non-NULL mapping";
1081 if (unlikely(page_ref_count(page) != 0))
1082 bad_reason = "nonzero _refcount";
1083 if (unlikely(page->flags & flags)) {
1084 if (flags == PAGE_FLAGS_CHECK_AT_PREP)
1085 bad_reason = "PAGE_FLAGS_CHECK_AT_PREP flag(s) set";
1087 bad_reason = "PAGE_FLAGS_CHECK_AT_FREE flag(s) set";
1090 if (unlikely(page->mem_cgroup))
1091 bad_reason = "page still charged to cgroup";
1096 static void check_free_page_bad(struct page *page)
1099 page_bad_reason(page, PAGE_FLAGS_CHECK_AT_FREE));
1102 static inline int check_free_page(struct page *page)
1104 if (likely(page_expected_state(page, PAGE_FLAGS_CHECK_AT_FREE)))
1107 /* Something has gone sideways, find it */
1108 check_free_page_bad(page);
1112 static int free_tail_pages_check(struct page *head_page, struct page *page)
1117 * We rely page->lru.next never has bit 0 set, unless the page
1118 * is PageTail(). Let's make sure that's true even for poisoned ->lru.
1120 BUILD_BUG_ON((unsigned long)LIST_POISON1 & 1);
1122 if (!IS_ENABLED(CONFIG_DEBUG_VM)) {
1126 switch (page - head_page) {
1128 /* the first tail page: ->mapping may be compound_mapcount() */
1129 if (unlikely(compound_mapcount(page))) {
1130 bad_page(page, "nonzero compound_mapcount");
1136 * the second tail page: ->mapping is
1137 * deferred_list.next -- ignore value.
1141 if (page->mapping != TAIL_MAPPING) {
1142 bad_page(page, "corrupted mapping in tail page");
1147 if (unlikely(!PageTail(page))) {
1148 bad_page(page, "PageTail not set");
1151 if (unlikely(compound_head(page) != head_page)) {
1152 bad_page(page, "compound_head not consistent");
1157 page->mapping = NULL;
1158 clear_compound_head(page);
1162 static void kernel_init_free_pages(struct page *page, int numpages)
1166 for (i = 0; i < numpages; i++)
1167 clear_highpage(page + i);
1170 static __always_inline bool free_pages_prepare(struct page *page,
1171 unsigned int order, bool check_free)
1175 VM_BUG_ON_PAGE(PageTail(page), page);
1177 trace_mm_page_free(page, order);
1180 * Check tail pages before head page information is cleared to
1181 * avoid checking PageCompound for order-0 pages.
1183 if (unlikely(order)) {
1184 bool compound = PageCompound(page);
1187 VM_BUG_ON_PAGE(compound && compound_order(page) != order, page);
1190 ClearPageDoubleMap(page);
1191 for (i = 1; i < (1 << order); i++) {
1193 bad += free_tail_pages_check(page, page + i);
1194 if (unlikely(check_free_page(page + i))) {
1198 (page + i)->flags &= ~PAGE_FLAGS_CHECK_AT_PREP;
1201 if (PageMappingFlags(page))
1202 page->mapping = NULL;
1203 if (memcg_kmem_enabled() && PageKmemcg(page))
1204 __memcg_kmem_uncharge_page(page, order);
1206 bad += check_free_page(page);
1210 page_cpupid_reset_last(page);
1211 page->flags &= ~PAGE_FLAGS_CHECK_AT_PREP;
1212 reset_page_owner(page, order);
1214 if (!PageHighMem(page)) {
1215 debug_check_no_locks_freed(page_address(page),
1216 PAGE_SIZE << order);
1217 debug_check_no_obj_freed(page_address(page),
1218 PAGE_SIZE << order);
1220 if (want_init_on_free())
1221 kernel_init_free_pages(page, 1 << order);
1223 kernel_poison_pages(page, 1 << order, 0);
1225 * arch_free_page() can make the page's contents inaccessible. s390
1226 * does this. So nothing which can access the page's contents should
1227 * happen after this.
1229 arch_free_page(page, order);
1231 if (debug_pagealloc_enabled_static())
1232 kernel_map_pages(page, 1 << order, 0);
1234 kasan_free_nondeferred_pages(page, order);
1239 #ifdef CONFIG_DEBUG_VM
1241 * With DEBUG_VM enabled, order-0 pages are checked immediately when being freed
1242 * to pcp lists. With debug_pagealloc also enabled, they are also rechecked when
1243 * moved from pcp lists to free lists.
1245 static bool free_pcp_prepare(struct page *page)
1247 return free_pages_prepare(page, 0, true);
1250 static bool bulkfree_pcp_prepare(struct page *page)
1252 if (debug_pagealloc_enabled_static())
1253 return check_free_page(page);
1259 * With DEBUG_VM disabled, order-0 pages being freed are checked only when
1260 * moving from pcp lists to free list in order to reduce overhead. With
1261 * debug_pagealloc enabled, they are checked also immediately when being freed
1264 static bool free_pcp_prepare(struct page *page)
1266 if (debug_pagealloc_enabled_static())
1267 return free_pages_prepare(page, 0, true);
1269 return free_pages_prepare(page, 0, false);
1272 static bool bulkfree_pcp_prepare(struct page *page)
1274 return check_free_page(page);
1276 #endif /* CONFIG_DEBUG_VM */
1278 static inline void prefetch_buddy(struct page *page)
1280 unsigned long pfn = page_to_pfn(page);
1281 unsigned long buddy_pfn = __find_buddy_pfn(pfn, 0);
1282 struct page *buddy = page + (buddy_pfn - pfn);
1288 * Frees a number of pages from the PCP lists
1289 * Assumes all pages on list are in same zone, and of same order.
1290 * count is the number of pages to free.
1292 * If the zone was previously in an "all pages pinned" state then look to
1293 * see if this freeing clears that state.
1295 * And clear the zone's pages_scanned counter, to hold off the "all pages are
1296 * pinned" detection logic.
1298 static void free_pcppages_bulk(struct zone *zone, int count,
1299 struct per_cpu_pages *pcp)
1301 int migratetype = 0;
1303 int prefetch_nr = 0;
1304 bool isolated_pageblocks;
1305 struct page *page, *tmp;
1309 struct list_head *list;
1312 * Remove pages from lists in a round-robin fashion. A
1313 * batch_free count is maintained that is incremented when an
1314 * empty list is encountered. This is so more pages are freed
1315 * off fuller lists instead of spinning excessively around empty
1320 if (++migratetype == MIGRATE_PCPTYPES)
1322 list = &pcp->lists[migratetype];
1323 } while (list_empty(list));
1325 /* This is the only non-empty list. Free them all. */
1326 if (batch_free == MIGRATE_PCPTYPES)
1330 page = list_last_entry(list, struct page, lru);
1331 /* must delete to avoid corrupting pcp list */
1332 list_del(&page->lru);
1335 if (bulkfree_pcp_prepare(page))
1338 list_add_tail(&page->lru, &head);
1341 * We are going to put the page back to the global
1342 * pool, prefetch its buddy to speed up later access
1343 * under zone->lock. It is believed the overhead of
1344 * an additional test and calculating buddy_pfn here
1345 * can be offset by reduced memory latency later. To
1346 * avoid excessive prefetching due to large count, only
1347 * prefetch buddy for the first pcp->batch nr of pages.
1349 if (prefetch_nr++ < pcp->batch)
1350 prefetch_buddy(page);
1351 } while (--count && --batch_free && !list_empty(list));
1354 spin_lock(&zone->lock);
1355 isolated_pageblocks = has_isolate_pageblock(zone);
1358 * Use safe version since after __free_one_page(),
1359 * page->lru.next will not point to original list.
1361 list_for_each_entry_safe(page, tmp, &head, lru) {
1362 int mt = get_pcppage_migratetype(page);
1363 /* MIGRATE_ISOLATE page should not go to pcplists */
1364 VM_BUG_ON_PAGE(is_migrate_isolate(mt), page);
1365 /* Pageblock could have been isolated meanwhile */
1366 if (unlikely(isolated_pageblocks))
1367 mt = get_pageblock_migratetype(page);
1369 __free_one_page(page, page_to_pfn(page), zone, 0, mt, true);
1370 trace_mm_page_pcpu_drain(page, 0, mt);
1372 spin_unlock(&zone->lock);
1375 static void free_one_page(struct zone *zone,
1376 struct page *page, unsigned long pfn,
1380 spin_lock(&zone->lock);
1381 if (unlikely(has_isolate_pageblock(zone) ||
1382 is_migrate_isolate(migratetype))) {
1383 migratetype = get_pfnblock_migratetype(page, pfn);
1385 __free_one_page(page, pfn, zone, order, migratetype, true);
1386 spin_unlock(&zone->lock);
1389 static void __meminit __init_single_page(struct page *page, unsigned long pfn,
1390 unsigned long zone, int nid)
1392 mm_zero_struct_page(page);
1393 set_page_links(page, zone, nid, pfn);
1394 init_page_count(page);
1395 page_mapcount_reset(page);
1396 page_cpupid_reset_last(page);
1397 page_kasan_tag_reset(page);
1399 INIT_LIST_HEAD(&page->lru);
1400 #ifdef WANT_PAGE_VIRTUAL
1401 /* The shift won't overflow because ZONE_NORMAL is below 4G. */
1402 if (!is_highmem_idx(zone))
1403 set_page_address(page, __va(pfn << PAGE_SHIFT));
1407 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
1408 static void __meminit init_reserved_page(unsigned long pfn)
1413 if (!early_page_uninitialised(pfn))
1416 nid = early_pfn_to_nid(pfn);
1417 pgdat = NODE_DATA(nid);
1419 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
1420 struct zone *zone = &pgdat->node_zones[zid];
1422 if (pfn >= zone->zone_start_pfn && pfn < zone_end_pfn(zone))
1425 __init_single_page(pfn_to_page(pfn), pfn, zid, nid);
1428 static inline void init_reserved_page(unsigned long pfn)
1431 #endif /* CONFIG_DEFERRED_STRUCT_PAGE_INIT */
1434 * Initialised pages do not have PageReserved set. This function is
1435 * called for each range allocated by the bootmem allocator and
1436 * marks the pages PageReserved. The remaining valid pages are later
1437 * sent to the buddy page allocator.
1439 void __meminit reserve_bootmem_region(phys_addr_t start, phys_addr_t end)
1441 unsigned long start_pfn = PFN_DOWN(start);
1442 unsigned long end_pfn = PFN_UP(end);
1444 for (; start_pfn < end_pfn; start_pfn++) {
1445 if (pfn_valid(start_pfn)) {
1446 struct page *page = pfn_to_page(start_pfn);
1448 init_reserved_page(start_pfn);
1450 /* Avoid false-positive PageTail() */
1451 INIT_LIST_HEAD(&page->lru);
1454 * no need for atomic set_bit because the struct
1455 * page is not visible yet so nobody should
1458 __SetPageReserved(page);
1463 static void __free_pages_ok(struct page *page, unsigned int order)
1465 unsigned long flags;
1467 unsigned long pfn = page_to_pfn(page);
1469 if (!free_pages_prepare(page, order, true))
1472 migratetype = get_pfnblock_migratetype(page, pfn);
1473 local_irq_save(flags);
1474 __count_vm_events(PGFREE, 1 << order);
1475 free_one_page(page_zone(page), page, pfn, order, migratetype);
1476 local_irq_restore(flags);
1479 void __free_pages_core(struct page *page, unsigned int order)
1481 unsigned int nr_pages = 1 << order;
1482 struct page *p = page;
1486 for (loop = 0; loop < (nr_pages - 1); loop++, p++) {
1488 __ClearPageReserved(p);
1489 set_page_count(p, 0);
1491 __ClearPageReserved(p);
1492 set_page_count(p, 0);
1494 atomic_long_add(nr_pages, &page_zone(page)->managed_pages);
1495 set_page_refcounted(page);
1496 __free_pages(page, order);
1499 #ifdef CONFIG_NEED_MULTIPLE_NODES
1501 static struct mminit_pfnnid_cache early_pfnnid_cache __meminitdata;
1503 #ifndef CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID
1506 * Required by SPARSEMEM. Given a PFN, return what node the PFN is on.
1508 int __meminit __early_pfn_to_nid(unsigned long pfn,
1509 struct mminit_pfnnid_cache *state)
1511 unsigned long start_pfn, end_pfn;
1514 if (state->last_start <= pfn && pfn < state->last_end)
1515 return state->last_nid;
1517 nid = memblock_search_pfn_nid(pfn, &start_pfn, &end_pfn);
1518 if (nid != NUMA_NO_NODE) {
1519 state->last_start = start_pfn;
1520 state->last_end = end_pfn;
1521 state->last_nid = nid;
1526 #endif /* CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID */
1528 int __meminit early_pfn_to_nid(unsigned long pfn)
1530 static DEFINE_SPINLOCK(early_pfn_lock);
1533 spin_lock(&early_pfn_lock);
1534 nid = __early_pfn_to_nid(pfn, &early_pfnnid_cache);
1536 nid = first_online_node;
1537 spin_unlock(&early_pfn_lock);
1541 #endif /* CONFIG_NEED_MULTIPLE_NODES */
1543 void __init memblock_free_pages(struct page *page, unsigned long pfn,
1546 if (early_page_uninitialised(pfn))
1548 __free_pages_core(page, order);
1552 * Check that the whole (or subset of) a pageblock given by the interval of
1553 * [start_pfn, end_pfn) is valid and within the same zone, before scanning it
1554 * with the migration of free compaction scanner. The scanners then need to
1555 * use only pfn_valid_within() check for arches that allow holes within
1558 * Return struct page pointer of start_pfn, or NULL if checks were not passed.
1560 * It's possible on some configurations to have a setup like node0 node1 node0
1561 * i.e. it's possible that all pages within a zones range of pages do not
1562 * belong to a single zone. We assume that a border between node0 and node1
1563 * can occur within a single pageblock, but not a node0 node1 node0
1564 * interleaving within a single pageblock. It is therefore sufficient to check
1565 * the first and last page of a pageblock and avoid checking each individual
1566 * page in a pageblock.
1568 struct page *__pageblock_pfn_to_page(unsigned long start_pfn,
1569 unsigned long end_pfn, struct zone *zone)
1571 struct page *start_page;
1572 struct page *end_page;
1574 /* end_pfn is one past the range we are checking */
1577 if (!pfn_valid(start_pfn) || !pfn_valid(end_pfn))
1580 start_page = pfn_to_online_page(start_pfn);
1584 if (page_zone(start_page) != zone)
1587 end_page = pfn_to_page(end_pfn);
1589 /* This gives a shorter code than deriving page_zone(end_page) */
1590 if (page_zone_id(start_page) != page_zone_id(end_page))
1596 void set_zone_contiguous(struct zone *zone)
1598 unsigned long block_start_pfn = zone->zone_start_pfn;
1599 unsigned long block_end_pfn;
1601 block_end_pfn = ALIGN(block_start_pfn + 1, pageblock_nr_pages);
1602 for (; block_start_pfn < zone_end_pfn(zone);
1603 block_start_pfn = block_end_pfn,
1604 block_end_pfn += pageblock_nr_pages) {
1606 block_end_pfn = min(block_end_pfn, zone_end_pfn(zone));
1608 if (!__pageblock_pfn_to_page(block_start_pfn,
1609 block_end_pfn, zone))
1614 /* We confirm that there is no hole */
1615 zone->contiguous = true;
1618 void clear_zone_contiguous(struct zone *zone)
1620 zone->contiguous = false;
1623 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
1624 static void __init deferred_free_range(unsigned long pfn,
1625 unsigned long nr_pages)
1633 page = pfn_to_page(pfn);
1635 /* Free a large naturally-aligned chunk if possible */
1636 if (nr_pages == pageblock_nr_pages &&
1637 (pfn & (pageblock_nr_pages - 1)) == 0) {
1638 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
1639 __free_pages_core(page, pageblock_order);
1643 for (i = 0; i < nr_pages; i++, page++, pfn++) {
1644 if ((pfn & (pageblock_nr_pages - 1)) == 0)
1645 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
1646 __free_pages_core(page, 0);
1650 /* Completion tracking for deferred_init_memmap() threads */
1651 static atomic_t pgdat_init_n_undone __initdata;
1652 static __initdata DECLARE_COMPLETION(pgdat_init_all_done_comp);
1654 static inline void __init pgdat_init_report_one_done(void)
1656 if (atomic_dec_and_test(&pgdat_init_n_undone))
1657 complete(&pgdat_init_all_done_comp);
1661 * Returns true if page needs to be initialized or freed to buddy allocator.
1663 * First we check if pfn is valid on architectures where it is possible to have
1664 * holes within pageblock_nr_pages. On systems where it is not possible, this
1665 * function is optimized out.
1667 * Then, we check if a current large page is valid by only checking the validity
1670 static inline bool __init deferred_pfn_valid(unsigned long pfn)
1672 if (!pfn_valid_within(pfn))
1674 if (!(pfn & (pageblock_nr_pages - 1)) && !pfn_valid(pfn))
1680 * Free pages to buddy allocator. Try to free aligned pages in
1681 * pageblock_nr_pages sizes.
1683 static void __init deferred_free_pages(unsigned long pfn,
1684 unsigned long end_pfn)
1686 unsigned long nr_pgmask = pageblock_nr_pages - 1;
1687 unsigned long nr_free = 0;
1689 for (; pfn < end_pfn; pfn++) {
1690 if (!deferred_pfn_valid(pfn)) {
1691 deferred_free_range(pfn - nr_free, nr_free);
1693 } else if (!(pfn & nr_pgmask)) {
1694 deferred_free_range(pfn - nr_free, nr_free);
1700 /* Free the last block of pages to allocator */
1701 deferred_free_range(pfn - nr_free, nr_free);
1705 * Initialize struct pages. We minimize pfn page lookups and scheduler checks
1706 * by performing it only once every pageblock_nr_pages.
1707 * Return number of pages initialized.
1709 static unsigned long __init deferred_init_pages(struct zone *zone,
1711 unsigned long end_pfn)
1713 unsigned long nr_pgmask = pageblock_nr_pages - 1;
1714 int nid = zone_to_nid(zone);
1715 unsigned long nr_pages = 0;
1716 int zid = zone_idx(zone);
1717 struct page *page = NULL;
1719 for (; pfn < end_pfn; pfn++) {
1720 if (!deferred_pfn_valid(pfn)) {
1723 } else if (!page || !(pfn & nr_pgmask)) {
1724 page = pfn_to_page(pfn);
1728 __init_single_page(page, pfn, zid, nid);
1735 * This function is meant to pre-load the iterator for the zone init.
1736 * Specifically it walks through the ranges until we are caught up to the
1737 * first_init_pfn value and exits there. If we never encounter the value we
1738 * return false indicating there are no valid ranges left.
1741 deferred_init_mem_pfn_range_in_zone(u64 *i, struct zone *zone,
1742 unsigned long *spfn, unsigned long *epfn,
1743 unsigned long first_init_pfn)
1748 * Start out by walking through the ranges in this zone that have
1749 * already been initialized. We don't need to do anything with them
1750 * so we just need to flush them out of the system.
1752 for_each_free_mem_pfn_range_in_zone(j, zone, spfn, epfn) {
1753 if (*epfn <= first_init_pfn)
1755 if (*spfn < first_init_pfn)
1756 *spfn = first_init_pfn;
1765 * Initialize and free pages. We do it in two loops: first we initialize
1766 * struct page, then free to buddy allocator, because while we are
1767 * freeing pages we can access pages that are ahead (computing buddy
1768 * page in __free_one_page()).
1770 * In order to try and keep some memory in the cache we have the loop
1771 * broken along max page order boundaries. This way we will not cause
1772 * any issues with the buddy page computation.
1774 static unsigned long __init
1775 deferred_init_maxorder(u64 *i, struct zone *zone, unsigned long *start_pfn,
1776 unsigned long *end_pfn)
1778 unsigned long mo_pfn = ALIGN(*start_pfn + 1, MAX_ORDER_NR_PAGES);
1779 unsigned long spfn = *start_pfn, epfn = *end_pfn;
1780 unsigned long nr_pages = 0;
1783 /* First we loop through and initialize the page values */
1784 for_each_free_mem_pfn_range_in_zone_from(j, zone, start_pfn, end_pfn) {
1787 if (mo_pfn <= *start_pfn)
1790 t = min(mo_pfn, *end_pfn);
1791 nr_pages += deferred_init_pages(zone, *start_pfn, t);
1793 if (mo_pfn < *end_pfn) {
1794 *start_pfn = mo_pfn;
1799 /* Reset values and now loop through freeing pages as needed */
1802 for_each_free_mem_pfn_range_in_zone_from(j, zone, &spfn, &epfn) {
1808 t = min(mo_pfn, epfn);
1809 deferred_free_pages(spfn, t);
1819 deferred_init_memmap_chunk(unsigned long start_pfn, unsigned long end_pfn,
1822 unsigned long spfn, epfn;
1823 struct zone *zone = arg;
1826 deferred_init_mem_pfn_range_in_zone(&i, zone, &spfn, &epfn, start_pfn);
1829 * Initialize and free pages in MAX_ORDER sized increments so that we
1830 * can avoid introducing any issues with the buddy allocator.
1832 while (spfn < end_pfn) {
1833 deferred_init_maxorder(&i, zone, &spfn, &epfn);
1838 /* An arch may override for more concurrency. */
1840 deferred_page_init_max_threads(const struct cpumask *node_cpumask)
1845 /* Initialise remaining memory on a node */
1846 static int __init deferred_init_memmap(void *data)
1848 pg_data_t *pgdat = data;
1849 const struct cpumask *cpumask = cpumask_of_node(pgdat->node_id);
1850 unsigned long spfn = 0, epfn = 0;
1851 unsigned long first_init_pfn, flags;
1852 unsigned long start = jiffies;
1854 int zid, max_threads;
1857 /* Bind memory initialisation thread to a local node if possible */
1858 if (!cpumask_empty(cpumask))
1859 set_cpus_allowed_ptr(current, cpumask);
1861 pgdat_resize_lock(pgdat, &flags);
1862 first_init_pfn = pgdat->first_deferred_pfn;
1863 if (first_init_pfn == ULONG_MAX) {
1864 pgdat_resize_unlock(pgdat, &flags);
1865 pgdat_init_report_one_done();
1869 /* Sanity check boundaries */
1870 BUG_ON(pgdat->first_deferred_pfn < pgdat->node_start_pfn);
1871 BUG_ON(pgdat->first_deferred_pfn > pgdat_end_pfn(pgdat));
1872 pgdat->first_deferred_pfn = ULONG_MAX;
1875 * Once we unlock here, the zone cannot be grown anymore, thus if an
1876 * interrupt thread must allocate this early in boot, zone must be
1877 * pre-grown prior to start of deferred page initialization.
1879 pgdat_resize_unlock(pgdat, &flags);
1881 /* Only the highest zone is deferred so find it */
1882 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
1883 zone = pgdat->node_zones + zid;
1884 if (first_init_pfn < zone_end_pfn(zone))
1888 /* If the zone is empty somebody else may have cleared out the zone */
1889 if (!deferred_init_mem_pfn_range_in_zone(&i, zone, &spfn, &epfn,
1893 max_threads = deferred_page_init_max_threads(cpumask);
1895 while (spfn < epfn) {
1896 unsigned long epfn_align = ALIGN(epfn, PAGES_PER_SECTION);
1897 struct padata_mt_job job = {
1898 .thread_fn = deferred_init_memmap_chunk,
1901 .size = epfn_align - spfn,
1902 .align = PAGES_PER_SECTION,
1903 .min_chunk = PAGES_PER_SECTION,
1904 .max_threads = max_threads,
1907 padata_do_multithreaded(&job);
1908 deferred_init_mem_pfn_range_in_zone(&i, zone, &spfn, &epfn,
1912 /* Sanity check that the next zone really is unpopulated */
1913 WARN_ON(++zid < MAX_NR_ZONES && populated_zone(++zone));
1915 pr_info("node %d deferred pages initialised in %ums\n",
1916 pgdat->node_id, jiffies_to_msecs(jiffies - start));
1918 pgdat_init_report_one_done();
1923 * If this zone has deferred pages, try to grow it by initializing enough
1924 * deferred pages to satisfy the allocation specified by order, rounded up to
1925 * the nearest PAGES_PER_SECTION boundary. So we're adding memory in increments
1926 * of SECTION_SIZE bytes by initializing struct pages in increments of
1927 * PAGES_PER_SECTION * sizeof(struct page) bytes.
1929 * Return true when zone was grown, otherwise return false. We return true even
1930 * when we grow less than requested, to let the caller decide if there are
1931 * enough pages to satisfy the allocation.
1933 * Note: We use noinline because this function is needed only during boot, and
1934 * it is called from a __ref function _deferred_grow_zone. This way we are
1935 * making sure that it is not inlined into permanent text section.
1937 static noinline bool __init
1938 deferred_grow_zone(struct zone *zone, unsigned int order)
1940 unsigned long nr_pages_needed = ALIGN(1 << order, PAGES_PER_SECTION);
1941 pg_data_t *pgdat = zone->zone_pgdat;
1942 unsigned long first_deferred_pfn = pgdat->first_deferred_pfn;
1943 unsigned long spfn, epfn, flags;
1944 unsigned long nr_pages = 0;
1947 /* Only the last zone may have deferred pages */
1948 if (zone_end_pfn(zone) != pgdat_end_pfn(pgdat))
1951 pgdat_resize_lock(pgdat, &flags);
1954 * If someone grew this zone while we were waiting for spinlock, return
1955 * true, as there might be enough pages already.
1957 if (first_deferred_pfn != pgdat->first_deferred_pfn) {
1958 pgdat_resize_unlock(pgdat, &flags);
1962 /* If the zone is empty somebody else may have cleared out the zone */
1963 if (!deferred_init_mem_pfn_range_in_zone(&i, zone, &spfn, &epfn,
1964 first_deferred_pfn)) {
1965 pgdat->first_deferred_pfn = ULONG_MAX;
1966 pgdat_resize_unlock(pgdat, &flags);
1967 /* Retry only once. */
1968 return first_deferred_pfn != ULONG_MAX;
1972 * Initialize and free pages in MAX_ORDER sized increments so
1973 * that we can avoid introducing any issues with the buddy
1976 while (spfn < epfn) {
1977 /* update our first deferred PFN for this section */
1978 first_deferred_pfn = spfn;
1980 nr_pages += deferred_init_maxorder(&i, zone, &spfn, &epfn);
1981 touch_nmi_watchdog();
1983 /* We should only stop along section boundaries */
1984 if ((first_deferred_pfn ^ spfn) < PAGES_PER_SECTION)
1987 /* If our quota has been met we can stop here */
1988 if (nr_pages >= nr_pages_needed)
1992 pgdat->first_deferred_pfn = spfn;
1993 pgdat_resize_unlock(pgdat, &flags);
1995 return nr_pages > 0;
1999 * deferred_grow_zone() is __init, but it is called from
2000 * get_page_from_freelist() during early boot until deferred_pages permanently
2001 * disables this call. This is why we have refdata wrapper to avoid warning,
2002 * and to ensure that the function body gets unloaded.
2005 _deferred_grow_zone(struct zone *zone, unsigned int order)
2007 return deferred_grow_zone(zone, order);
2010 #endif /* CONFIG_DEFERRED_STRUCT_PAGE_INIT */
2012 void __init page_alloc_init_late(void)
2017 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
2019 /* There will be num_node_state(N_MEMORY) threads */
2020 atomic_set(&pgdat_init_n_undone, num_node_state(N_MEMORY));
2021 for_each_node_state(nid, N_MEMORY) {
2022 kthread_run(deferred_init_memmap, NODE_DATA(nid), "pgdatinit%d", nid);
2025 /* Block until all are initialised */
2026 wait_for_completion(&pgdat_init_all_done_comp);
2029 * The number of managed pages has changed due to the initialisation
2030 * so the pcpu batch and high limits needs to be updated or the limits
2031 * will be artificially small.
2033 for_each_populated_zone(zone)
2034 zone_pcp_update(zone);
2037 * We initialized the rest of the deferred pages. Permanently disable
2038 * on-demand struct page initialization.
2040 static_branch_disable(&deferred_pages);
2042 /* Reinit limits that are based on free pages after the kernel is up */
2043 files_maxfiles_init();
2046 /* Discard memblock private memory */
2049 for_each_node_state(nid, N_MEMORY)
2050 shuffle_free_memory(NODE_DATA(nid));
2052 for_each_populated_zone(zone)
2053 set_zone_contiguous(zone);
2057 /* Free whole pageblock and set its migration type to MIGRATE_CMA. */
2058 void __init init_cma_reserved_pageblock(struct page *page)
2060 unsigned i = pageblock_nr_pages;
2061 struct page *p = page;
2064 __ClearPageReserved(p);
2065 set_page_count(p, 0);
2068 set_pageblock_migratetype(page, MIGRATE_CMA);
2070 if (pageblock_order >= MAX_ORDER) {
2071 i = pageblock_nr_pages;
2074 set_page_refcounted(p);
2075 __free_pages(p, MAX_ORDER - 1);
2076 p += MAX_ORDER_NR_PAGES;
2077 } while (i -= MAX_ORDER_NR_PAGES);
2079 set_page_refcounted(page);
2080 __free_pages(page, pageblock_order);
2083 adjust_managed_page_count(page, pageblock_nr_pages);
2088 * The order of subdivision here is critical for the IO subsystem.
2089 * Please do not alter this order without good reasons and regression
2090 * testing. Specifically, as large blocks of memory are subdivided,
2091 * the order in which smaller blocks are delivered depends on the order
2092 * they're subdivided in this function. This is the primary factor
2093 * influencing the order in which pages are delivered to the IO
2094 * subsystem according to empirical testing, and this is also justified
2095 * by considering the behavior of a buddy system containing a single
2096 * large block of memory acted on by a series of small allocations.
2097 * This behavior is a critical factor in sglist merging's success.
2101 static inline void expand(struct zone *zone, struct page *page,
2102 int low, int high, int migratetype)
2104 unsigned long size = 1 << high;
2106 while (high > low) {
2109 VM_BUG_ON_PAGE(bad_range(zone, &page[size]), &page[size]);
2112 * Mark as guard pages (or page), that will allow to
2113 * merge back to allocator when buddy will be freed.
2114 * Corresponding page table entries will not be touched,
2115 * pages will stay not present in virtual address space
2117 if (set_page_guard(zone, &page[size], high, migratetype))
2120 add_to_free_list(&page[size], zone, high, migratetype);
2121 set_page_order(&page[size], high);
2125 static void check_new_page_bad(struct page *page)
2127 if (unlikely(page->flags & __PG_HWPOISON)) {
2128 /* Don't complain about hwpoisoned pages */
2129 page_mapcount_reset(page); /* remove PageBuddy */
2134 page_bad_reason(page, PAGE_FLAGS_CHECK_AT_PREP));
2138 * This page is about to be returned from the page allocator
2140 static inline int check_new_page(struct page *page)
2142 if (likely(page_expected_state(page,
2143 PAGE_FLAGS_CHECK_AT_PREP|__PG_HWPOISON)))
2146 check_new_page_bad(page);
2150 static inline bool free_pages_prezeroed(void)
2152 return (IS_ENABLED(CONFIG_PAGE_POISONING_ZERO) &&
2153 page_poisoning_enabled()) || want_init_on_free();
2156 #ifdef CONFIG_DEBUG_VM
2158 * With DEBUG_VM enabled, order-0 pages are checked for expected state when
2159 * being allocated from pcp lists. With debug_pagealloc also enabled, they are
2160 * also checked when pcp lists are refilled from the free lists.
2162 static inline bool check_pcp_refill(struct page *page)
2164 if (debug_pagealloc_enabled_static())
2165 return check_new_page(page);
2170 static inline bool check_new_pcp(struct page *page)
2172 return check_new_page(page);
2176 * With DEBUG_VM disabled, free order-0 pages are checked for expected state
2177 * when pcp lists are being refilled from the free lists. With debug_pagealloc
2178 * enabled, they are also checked when being allocated from the pcp lists.
2180 static inline bool check_pcp_refill(struct page *page)
2182 return check_new_page(page);
2184 static inline bool check_new_pcp(struct page *page)
2186 if (debug_pagealloc_enabled_static())
2187 return check_new_page(page);
2191 #endif /* CONFIG_DEBUG_VM */
2193 static bool check_new_pages(struct page *page, unsigned int order)
2196 for (i = 0; i < (1 << order); i++) {
2197 struct page *p = page + i;
2199 if (unlikely(check_new_page(p)))
2206 inline void post_alloc_hook(struct page *page, unsigned int order,
2209 set_page_private(page, 0);
2210 set_page_refcounted(page);
2212 arch_alloc_page(page, order);
2213 if (debug_pagealloc_enabled_static())
2214 kernel_map_pages(page, 1 << order, 1);
2215 kasan_alloc_pages(page, order);
2216 kernel_poison_pages(page, 1 << order, 1);
2217 set_page_owner(page, order, gfp_flags);
2220 static void prep_new_page(struct page *page, unsigned int order, gfp_t gfp_flags,
2221 unsigned int alloc_flags)
2223 post_alloc_hook(page, order, gfp_flags);
2225 if (!free_pages_prezeroed() && want_init_on_alloc(gfp_flags))
2226 kernel_init_free_pages(page, 1 << order);
2228 if (order && (gfp_flags & __GFP_COMP))
2229 prep_compound_page(page, order);
2232 * page is set pfmemalloc when ALLOC_NO_WATERMARKS was necessary to
2233 * allocate the page. The expectation is that the caller is taking
2234 * steps that will free more memory. The caller should avoid the page
2235 * being used for !PFMEMALLOC purposes.
2237 if (alloc_flags & ALLOC_NO_WATERMARKS)
2238 set_page_pfmemalloc(page);
2240 clear_page_pfmemalloc(page);
2244 * Go through the free lists for the given migratetype and remove
2245 * the smallest available page from the freelists
2247 static __always_inline
2248 struct page *__rmqueue_smallest(struct zone *zone, unsigned int order,
2251 unsigned int current_order;
2252 struct free_area *area;
2255 /* Find a page of the appropriate size in the preferred list */
2256 for (current_order = order; current_order < MAX_ORDER; ++current_order) {
2257 area = &(zone->free_area[current_order]);
2258 page = get_page_from_free_area(area, migratetype);
2261 del_page_from_free_list(page, zone, current_order);
2262 expand(zone, page, order, current_order, migratetype);
2263 set_pcppage_migratetype(page, migratetype);
2272 * This array describes the order lists are fallen back to when
2273 * the free lists for the desirable migrate type are depleted
2275 static int fallbacks[MIGRATE_TYPES][4] = {
2276 [MIGRATE_UNMOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_MOVABLE, MIGRATE_TYPES },
2277 [MIGRATE_MOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_UNMOVABLE, MIGRATE_TYPES },
2278 [MIGRATE_RECLAIMABLE] = { MIGRATE_UNMOVABLE, MIGRATE_MOVABLE, MIGRATE_TYPES },
2280 [MIGRATE_CMA] = { MIGRATE_TYPES }, /* Never used */
2282 #ifdef CONFIG_MEMORY_ISOLATION
2283 [MIGRATE_ISOLATE] = { MIGRATE_TYPES }, /* Never used */
2288 static __always_inline struct page *__rmqueue_cma_fallback(struct zone *zone,
2291 return __rmqueue_smallest(zone, order, MIGRATE_CMA);
2294 static inline struct page *__rmqueue_cma_fallback(struct zone *zone,
2295 unsigned int order) { return NULL; }
2299 * Move the free pages in a range to the free lists of the requested type.
2300 * Note that start_page and end_pages are not aligned on a pageblock
2301 * boundary. If alignment is required, use move_freepages_block()
2303 static int move_freepages(struct zone *zone,
2304 struct page *start_page, struct page *end_page,
2305 int migratetype, int *num_movable)
2309 int pages_moved = 0;
2311 for (page = start_page; page <= end_page;) {
2312 if (!pfn_valid_within(page_to_pfn(page))) {
2317 if (!PageBuddy(page)) {
2319 * We assume that pages that could be isolated for
2320 * migration are movable. But we don't actually try
2321 * isolating, as that would be expensive.
2324 (PageLRU(page) || __PageMovable(page)))
2331 /* Make sure we are not inadvertently changing nodes */
2332 VM_BUG_ON_PAGE(page_to_nid(page) != zone_to_nid(zone), page);
2333 VM_BUG_ON_PAGE(page_zone(page) != zone, page);
2335 order = page_order(page);
2336 move_to_free_list(page, zone, order, migratetype);
2338 pages_moved += 1 << order;
2344 int move_freepages_block(struct zone *zone, struct page *page,
2345 int migratetype, int *num_movable)
2347 unsigned long start_pfn, end_pfn;
2348 struct page *start_page, *end_page;
2353 start_pfn = page_to_pfn(page);
2354 start_pfn = start_pfn & ~(pageblock_nr_pages-1);
2355 start_page = pfn_to_page(start_pfn);
2356 end_page = start_page + pageblock_nr_pages - 1;
2357 end_pfn = start_pfn + pageblock_nr_pages - 1;
2359 /* Do not cross zone boundaries */
2360 if (!zone_spans_pfn(zone, start_pfn))
2362 if (!zone_spans_pfn(zone, end_pfn))
2365 return move_freepages(zone, start_page, end_page, migratetype,
2369 static void change_pageblock_range(struct page *pageblock_page,
2370 int start_order, int migratetype)
2372 int nr_pageblocks = 1 << (start_order - pageblock_order);
2374 while (nr_pageblocks--) {
2375 set_pageblock_migratetype(pageblock_page, migratetype);
2376 pageblock_page += pageblock_nr_pages;
2381 * When we are falling back to another migratetype during allocation, try to
2382 * steal extra free pages from the same pageblocks to satisfy further
2383 * allocations, instead of polluting multiple pageblocks.
2385 * If we are stealing a relatively large buddy page, it is likely there will
2386 * be more free pages in the pageblock, so try to steal them all. For
2387 * reclaimable and unmovable allocations, we steal regardless of page size,
2388 * as fragmentation caused by those allocations polluting movable pageblocks
2389 * is worse than movable allocations stealing from unmovable and reclaimable
2392 static bool can_steal_fallback(unsigned int order, int start_mt)
2395 * Leaving this order check is intended, although there is
2396 * relaxed order check in next check. The reason is that
2397 * we can actually steal whole pageblock if this condition met,
2398 * but, below check doesn't guarantee it and that is just heuristic
2399 * so could be changed anytime.
2401 if (order >= pageblock_order)
2404 if (order >= pageblock_order / 2 ||
2405 start_mt == MIGRATE_RECLAIMABLE ||
2406 start_mt == MIGRATE_UNMOVABLE ||
2407 page_group_by_mobility_disabled)
2413 static inline void boost_watermark(struct zone *zone)
2415 unsigned long max_boost;
2417 if (!watermark_boost_factor)
2420 * Don't bother in zones that are unlikely to produce results.
2421 * On small machines, including kdump capture kernels running
2422 * in a small area, boosting the watermark can cause an out of
2423 * memory situation immediately.
2425 if ((pageblock_nr_pages * 4) > zone_managed_pages(zone))
2428 max_boost = mult_frac(zone->_watermark[WMARK_HIGH],
2429 watermark_boost_factor, 10000);
2432 * high watermark may be uninitialised if fragmentation occurs
2433 * very early in boot so do not boost. We do not fall
2434 * through and boost by pageblock_nr_pages as failing
2435 * allocations that early means that reclaim is not going
2436 * to help and it may even be impossible to reclaim the
2437 * boosted watermark resulting in a hang.
2442 max_boost = max(pageblock_nr_pages, max_boost);
2444 zone->watermark_boost = min(zone->watermark_boost + pageblock_nr_pages,
2449 * This function implements actual steal behaviour. If order is large enough,
2450 * we can steal whole pageblock. If not, we first move freepages in this
2451 * pageblock to our migratetype and determine how many already-allocated pages
2452 * are there in the pageblock with a compatible migratetype. If at least half
2453 * of pages are free or compatible, we can change migratetype of the pageblock
2454 * itself, so pages freed in the future will be put on the correct free list.
2456 static void steal_suitable_fallback(struct zone *zone, struct page *page,
2457 unsigned int alloc_flags, int start_type, bool whole_block)
2459 unsigned int current_order = page_order(page);
2460 int free_pages, movable_pages, alike_pages;
2463 old_block_type = get_pageblock_migratetype(page);
2466 * This can happen due to races and we want to prevent broken
2467 * highatomic accounting.
2469 if (is_migrate_highatomic(old_block_type))
2472 /* Take ownership for orders >= pageblock_order */
2473 if (current_order >= pageblock_order) {
2474 change_pageblock_range(page, current_order, start_type);
2479 * Boost watermarks to increase reclaim pressure to reduce the
2480 * likelihood of future fallbacks. Wake kswapd now as the node
2481 * may be balanced overall and kswapd will not wake naturally.
2483 boost_watermark(zone);
2484 if (alloc_flags & ALLOC_KSWAPD)
2485 set_bit(ZONE_BOOSTED_WATERMARK, &zone->flags);
2487 /* We are not allowed to try stealing from the whole block */
2491 free_pages = move_freepages_block(zone, page, start_type,
2494 * Determine how many pages are compatible with our allocation.
2495 * For movable allocation, it's the number of movable pages which
2496 * we just obtained. For other types it's a bit more tricky.
2498 if (start_type == MIGRATE_MOVABLE) {
2499 alike_pages = movable_pages;
2502 * If we are falling back a RECLAIMABLE or UNMOVABLE allocation
2503 * to MOVABLE pageblock, consider all non-movable pages as
2504 * compatible. If it's UNMOVABLE falling back to RECLAIMABLE or
2505 * vice versa, be conservative since we can't distinguish the
2506 * exact migratetype of non-movable pages.
2508 if (old_block_type == MIGRATE_MOVABLE)
2509 alike_pages = pageblock_nr_pages
2510 - (free_pages + movable_pages);
2515 /* moving whole block can fail due to zone boundary conditions */
2520 * If a sufficient number of pages in the block are either free or of
2521 * comparable migratability as our allocation, claim the whole block.
2523 if (free_pages + alike_pages >= (1 << (pageblock_order-1)) ||
2524 page_group_by_mobility_disabled)
2525 set_pageblock_migratetype(page, start_type);
2530 move_to_free_list(page, zone, current_order, start_type);
2534 * Check whether there is a suitable fallback freepage with requested order.
2535 * If only_stealable is true, this function returns fallback_mt only if
2536 * we can steal other freepages all together. This would help to reduce
2537 * fragmentation due to mixed migratetype pages in one pageblock.
2539 int find_suitable_fallback(struct free_area *area, unsigned int order,
2540 int migratetype, bool only_stealable, bool *can_steal)
2545 if (area->nr_free == 0)
2550 fallback_mt = fallbacks[migratetype][i];
2551 if (fallback_mt == MIGRATE_TYPES)
2554 if (free_area_empty(area, fallback_mt))
2557 if (can_steal_fallback(order, migratetype))
2560 if (!only_stealable)
2571 * Reserve a pageblock for exclusive use of high-order atomic allocations if
2572 * there are no empty page blocks that contain a page with a suitable order
2574 static void reserve_highatomic_pageblock(struct page *page, struct zone *zone,
2575 unsigned int alloc_order)
2578 unsigned long max_managed, flags;
2581 * Limit the number reserved to 1 pageblock or roughly 1% of a zone.
2582 * Check is race-prone but harmless.
2584 max_managed = (zone_managed_pages(zone) / 100) + pageblock_nr_pages;
2585 if (zone->nr_reserved_highatomic >= max_managed)
2588 spin_lock_irqsave(&zone->lock, flags);
2590 /* Recheck the nr_reserved_highatomic limit under the lock */
2591 if (zone->nr_reserved_highatomic >= max_managed)
2595 mt = get_pageblock_migratetype(page);
2596 if (!is_migrate_highatomic(mt) && !is_migrate_isolate(mt)
2597 && !is_migrate_cma(mt)) {
2598 zone->nr_reserved_highatomic += pageblock_nr_pages;
2599 set_pageblock_migratetype(page, MIGRATE_HIGHATOMIC);
2600 move_freepages_block(zone, page, MIGRATE_HIGHATOMIC, NULL);
2604 spin_unlock_irqrestore(&zone->lock, flags);
2608 * Used when an allocation is about to fail under memory pressure. This
2609 * potentially hurts the reliability of high-order allocations when under
2610 * intense memory pressure but failed atomic allocations should be easier
2611 * to recover from than an OOM.
2613 * If @force is true, try to unreserve a pageblock even though highatomic
2614 * pageblock is exhausted.
2616 static bool unreserve_highatomic_pageblock(const struct alloc_context *ac,
2619 struct zonelist *zonelist = ac->zonelist;
2620 unsigned long flags;
2627 for_each_zone_zonelist_nodemask(zone, z, zonelist, ac->highest_zoneidx,
2630 * Preserve at least one pageblock unless memory pressure
2633 if (!force && zone->nr_reserved_highatomic <=
2637 spin_lock_irqsave(&zone->lock, flags);
2638 for (order = 0; order < MAX_ORDER; order++) {
2639 struct free_area *area = &(zone->free_area[order]);
2641 page = get_page_from_free_area(area, MIGRATE_HIGHATOMIC);
2646 * In page freeing path, migratetype change is racy so
2647 * we can counter several free pages in a pageblock
2648 * in this loop althoug we changed the pageblock type
2649 * from highatomic to ac->migratetype. So we should
2650 * adjust the count once.
2652 if (is_migrate_highatomic_page(page)) {
2654 * It should never happen but changes to
2655 * locking could inadvertently allow a per-cpu
2656 * drain to add pages to MIGRATE_HIGHATOMIC
2657 * while unreserving so be safe and watch for
2660 zone->nr_reserved_highatomic -= min(
2662 zone->nr_reserved_highatomic);
2666 * Convert to ac->migratetype and avoid the normal
2667 * pageblock stealing heuristics. Minimally, the caller
2668 * is doing the work and needs the pages. More
2669 * importantly, if the block was always converted to
2670 * MIGRATE_UNMOVABLE or another type then the number
2671 * of pageblocks that cannot be completely freed
2674 set_pageblock_migratetype(page, ac->migratetype);
2675 ret = move_freepages_block(zone, page, ac->migratetype,
2678 spin_unlock_irqrestore(&zone->lock, flags);
2682 spin_unlock_irqrestore(&zone->lock, flags);
2689 * Try finding a free buddy page on the fallback list and put it on the free
2690 * list of requested migratetype, possibly along with other pages from the same
2691 * block, depending on fragmentation avoidance heuristics. Returns true if
2692 * fallback was found so that __rmqueue_smallest() can grab it.
2694 * The use of signed ints for order and current_order is a deliberate
2695 * deviation from the rest of this file, to make the for loop
2696 * condition simpler.
2698 static __always_inline bool
2699 __rmqueue_fallback(struct zone *zone, int order, int start_migratetype,
2700 unsigned int alloc_flags)
2702 struct free_area *area;
2704 int min_order = order;
2710 * Do not steal pages from freelists belonging to other pageblocks
2711 * i.e. orders < pageblock_order. If there are no local zones free,
2712 * the zonelists will be reiterated without ALLOC_NOFRAGMENT.
2714 if (alloc_flags & ALLOC_NOFRAGMENT)
2715 min_order = pageblock_order;
2718 * Find the largest available free page in the other list. This roughly
2719 * approximates finding the pageblock with the most free pages, which
2720 * would be too costly to do exactly.
2722 for (current_order = MAX_ORDER - 1; current_order >= min_order;
2724 area = &(zone->free_area[current_order]);
2725 fallback_mt = find_suitable_fallback(area, current_order,
2726 start_migratetype, false, &can_steal);
2727 if (fallback_mt == -1)
2731 * We cannot steal all free pages from the pageblock and the
2732 * requested migratetype is movable. In that case it's better to
2733 * steal and split the smallest available page instead of the
2734 * largest available page, because even if the next movable
2735 * allocation falls back into a different pageblock than this
2736 * one, it won't cause permanent fragmentation.
2738 if (!can_steal && start_migratetype == MIGRATE_MOVABLE
2739 && current_order > order)
2748 for (current_order = order; current_order < MAX_ORDER;
2750 area = &(zone->free_area[current_order]);
2751 fallback_mt = find_suitable_fallback(area, current_order,
2752 start_migratetype, false, &can_steal);
2753 if (fallback_mt != -1)
2758 * This should not happen - we already found a suitable fallback
2759 * when looking for the largest page.
2761 VM_BUG_ON(current_order == MAX_ORDER);
2764 page = get_page_from_free_area(area, fallback_mt);
2766 steal_suitable_fallback(zone, page, alloc_flags, start_migratetype,
2769 trace_mm_page_alloc_extfrag(page, order, current_order,
2770 start_migratetype, fallback_mt);
2777 * Do the hard work of removing an element from the buddy allocator.
2778 * Call me with the zone->lock already held.
2780 static __always_inline struct page *
2781 __rmqueue(struct zone *zone, unsigned int order, int migratetype,
2782 unsigned int alloc_flags)
2788 * Balance movable allocations between regular and CMA areas by
2789 * allocating from CMA when over half of the zone's free memory
2790 * is in the CMA area.
2792 if (migratetype == MIGRATE_MOVABLE &&
2793 zone_page_state(zone, NR_FREE_CMA_PAGES) >
2794 zone_page_state(zone, NR_FREE_PAGES) / 2) {
2795 page = __rmqueue_cma_fallback(zone, order);
2801 page = __rmqueue_smallest(zone, order, migratetype);
2802 if (unlikely(!page)) {
2803 if (migratetype == MIGRATE_MOVABLE)
2804 page = __rmqueue_cma_fallback(zone, order);
2806 if (!page && __rmqueue_fallback(zone, order, migratetype,
2811 trace_mm_page_alloc_zone_locked(page, order, migratetype);
2816 * Obtain a specified number of elements from the buddy allocator, all under
2817 * a single hold of the lock, for efficiency. Add them to the supplied list.
2818 * Returns the number of new pages which were placed at *list.
2820 static int rmqueue_bulk(struct zone *zone, unsigned int order,
2821 unsigned long count, struct list_head *list,
2822 int migratetype, unsigned int alloc_flags)
2826 spin_lock(&zone->lock);
2827 for (i = 0; i < count; ++i) {
2828 struct page *page = __rmqueue(zone, order, migratetype,
2830 if (unlikely(page == NULL))
2833 if (unlikely(check_pcp_refill(page)))
2837 * Split buddy pages returned by expand() are received here in
2838 * physical page order. The page is added to the tail of
2839 * caller's list. From the callers perspective, the linked list
2840 * is ordered by page number under some conditions. This is
2841 * useful for IO devices that can forward direction from the
2842 * head, thus also in the physical page order. This is useful
2843 * for IO devices that can merge IO requests if the physical
2844 * pages are ordered properly.
2846 list_add_tail(&page->lru, list);
2848 if (is_migrate_cma(get_pcppage_migratetype(page)))
2849 __mod_zone_page_state(zone, NR_FREE_CMA_PAGES,
2854 * i pages were removed from the buddy list even if some leak due
2855 * to check_pcp_refill failing so adjust NR_FREE_PAGES based
2856 * on i. Do not confuse with 'alloced' which is the number of
2857 * pages added to the pcp list.
2859 __mod_zone_page_state(zone, NR_FREE_PAGES, -(i << order));
2860 spin_unlock(&zone->lock);
2866 * Called from the vmstat counter updater to drain pagesets of this
2867 * currently executing processor on remote nodes after they have
2870 * Note that this function must be called with the thread pinned to
2871 * a single processor.
2873 void drain_zone_pages(struct zone *zone, struct per_cpu_pages *pcp)
2875 unsigned long flags;
2876 int to_drain, batch;
2878 local_irq_save(flags);
2879 batch = READ_ONCE(pcp->batch);
2880 to_drain = min(pcp->count, batch);
2882 free_pcppages_bulk(zone, to_drain, pcp);
2883 local_irq_restore(flags);
2888 * Drain pcplists of the indicated processor and zone.
2890 * The processor must either be the current processor and the
2891 * thread pinned to the current processor or a processor that
2894 static void drain_pages_zone(unsigned int cpu, struct zone *zone)
2896 unsigned long flags;
2897 struct per_cpu_pageset *pset;
2898 struct per_cpu_pages *pcp;
2900 local_irq_save(flags);
2901 pset = per_cpu_ptr(zone->pageset, cpu);
2905 free_pcppages_bulk(zone, pcp->count, pcp);
2906 local_irq_restore(flags);
2910 * Drain pcplists of all zones on the indicated processor.
2912 * The processor must either be the current processor and the
2913 * thread pinned to the current processor or a processor that
2916 static void drain_pages(unsigned int cpu)
2920 for_each_populated_zone(zone) {
2921 drain_pages_zone(cpu, zone);
2926 * Spill all of this CPU's per-cpu pages back into the buddy allocator.
2928 * The CPU has to be pinned. When zone parameter is non-NULL, spill just
2929 * the single zone's pages.
2931 void drain_local_pages(struct zone *zone)
2933 int cpu = smp_processor_id();
2936 drain_pages_zone(cpu, zone);
2941 static void drain_local_pages_wq(struct work_struct *work)
2943 struct pcpu_drain *drain;
2945 drain = container_of(work, struct pcpu_drain, work);
2948 * drain_all_pages doesn't use proper cpu hotplug protection so
2949 * we can race with cpu offline when the WQ can move this from
2950 * a cpu pinned worker to an unbound one. We can operate on a different
2951 * cpu which is allright but we also have to make sure to not move to
2955 drain_local_pages(drain->zone);
2960 * Spill all the per-cpu pages from all CPUs back into the buddy allocator.
2962 * When zone parameter is non-NULL, spill just the single zone's pages.
2964 * Note that this can be extremely slow as the draining happens in a workqueue.
2966 void drain_all_pages(struct zone *zone)
2971 * Allocate in the BSS so we wont require allocation in
2972 * direct reclaim path for CONFIG_CPUMASK_OFFSTACK=y
2974 static cpumask_t cpus_with_pcps;
2977 * Make sure nobody triggers this path before mm_percpu_wq is fully
2980 if (WARN_ON_ONCE(!mm_percpu_wq))
2984 * Do not drain if one is already in progress unless it's specific to
2985 * a zone. Such callers are primarily CMA and memory hotplug and need
2986 * the drain to be complete when the call returns.
2988 if (unlikely(!mutex_trylock(&pcpu_drain_mutex))) {
2991 mutex_lock(&pcpu_drain_mutex);
2995 * We don't care about racing with CPU hotplug event
2996 * as offline notification will cause the notified
2997 * cpu to drain that CPU pcps and on_each_cpu_mask
2998 * disables preemption as part of its processing
3000 for_each_online_cpu(cpu) {
3001 struct per_cpu_pageset *pcp;
3003 bool has_pcps = false;
3006 pcp = per_cpu_ptr(zone->pageset, cpu);
3010 for_each_populated_zone(z) {
3011 pcp = per_cpu_ptr(z->pageset, cpu);
3012 if (pcp->pcp.count) {
3020 cpumask_set_cpu(cpu, &cpus_with_pcps);
3022 cpumask_clear_cpu(cpu, &cpus_with_pcps);
3025 for_each_cpu(cpu, &cpus_with_pcps) {
3026 struct pcpu_drain *drain = per_cpu_ptr(&pcpu_drain, cpu);
3029 INIT_WORK(&drain->work, drain_local_pages_wq);
3030 queue_work_on(cpu, mm_percpu_wq, &drain->work);
3032 for_each_cpu(cpu, &cpus_with_pcps)
3033 flush_work(&per_cpu_ptr(&pcpu_drain, cpu)->work);
3035 mutex_unlock(&pcpu_drain_mutex);
3038 #ifdef CONFIG_HIBERNATION
3041 * Touch the watchdog for every WD_PAGE_COUNT pages.
3043 #define WD_PAGE_COUNT (128*1024)
3045 void mark_free_pages(struct zone *zone)
3047 unsigned long pfn, max_zone_pfn, page_count = WD_PAGE_COUNT;
3048 unsigned long flags;
3049 unsigned int order, t;
3052 if (zone_is_empty(zone))
3055 spin_lock_irqsave(&zone->lock, flags);
3057 max_zone_pfn = zone_end_pfn(zone);
3058 for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
3059 if (pfn_valid(pfn)) {
3060 page = pfn_to_page(pfn);
3062 if (!--page_count) {
3063 touch_nmi_watchdog();
3064 page_count = WD_PAGE_COUNT;
3067 if (page_zone(page) != zone)
3070 if (!swsusp_page_is_forbidden(page))
3071 swsusp_unset_page_free(page);
3074 for_each_migratetype_order(order, t) {
3075 list_for_each_entry(page,
3076 &zone->free_area[order].free_list[t], lru) {
3079 pfn = page_to_pfn(page);
3080 for (i = 0; i < (1UL << order); i++) {
3081 if (!--page_count) {
3082 touch_nmi_watchdog();
3083 page_count = WD_PAGE_COUNT;
3085 swsusp_set_page_free(pfn_to_page(pfn + i));
3089 spin_unlock_irqrestore(&zone->lock, flags);
3091 #endif /* CONFIG_PM */
3093 static bool free_unref_page_prepare(struct page *page, unsigned long pfn)
3097 if (!free_pcp_prepare(page))
3100 migratetype = get_pfnblock_migratetype(page, pfn);
3101 set_pcppage_migratetype(page, migratetype);
3105 static void free_unref_page_commit(struct page *page, unsigned long pfn)
3107 struct zone *zone = page_zone(page);
3108 struct per_cpu_pages *pcp;
3111 migratetype = get_pcppage_migratetype(page);
3112 __count_vm_event(PGFREE);
3115 * We only track unmovable, reclaimable and movable on pcp lists.
3116 * Free ISOLATE pages back to the allocator because they are being
3117 * offlined but treat HIGHATOMIC as movable pages so we can get those
3118 * areas back if necessary. Otherwise, we may have to free
3119 * excessively into the page allocator
3121 if (migratetype >= MIGRATE_PCPTYPES) {
3122 if (unlikely(is_migrate_isolate(migratetype))) {
3123 free_one_page(zone, page, pfn, 0, migratetype);
3126 migratetype = MIGRATE_MOVABLE;
3129 pcp = &this_cpu_ptr(zone->pageset)->pcp;
3130 list_add(&page->lru, &pcp->lists[migratetype]);
3132 if (pcp->count >= pcp->high) {
3133 unsigned long batch = READ_ONCE(pcp->batch);
3134 free_pcppages_bulk(zone, batch, pcp);
3139 * Free a 0-order page
3141 void free_unref_page(struct page *page)
3143 unsigned long flags;
3144 unsigned long pfn = page_to_pfn(page);
3146 if (!free_unref_page_prepare(page, pfn))
3149 local_irq_save(flags);
3150 free_unref_page_commit(page, pfn);
3151 local_irq_restore(flags);
3155 * Free a list of 0-order pages
3157 void free_unref_page_list(struct list_head *list)
3159 struct page *page, *next;
3160 unsigned long flags, pfn;
3161 int batch_count = 0;
3163 /* Prepare pages for freeing */
3164 list_for_each_entry_safe(page, next, list, lru) {
3165 pfn = page_to_pfn(page);
3166 if (!free_unref_page_prepare(page, pfn))
3167 list_del(&page->lru);
3168 set_page_private(page, pfn);
3171 local_irq_save(flags);
3172 list_for_each_entry_safe(page, next, list, lru) {
3173 unsigned long pfn = page_private(page);
3175 set_page_private(page, 0);
3176 trace_mm_page_free_batched(page);
3177 free_unref_page_commit(page, pfn);
3180 * Guard against excessive IRQ disabled times when we get
3181 * a large list of pages to free.
3183 if (++batch_count == SWAP_CLUSTER_MAX) {
3184 local_irq_restore(flags);
3186 local_irq_save(flags);
3189 local_irq_restore(flags);
3193 * split_page takes a non-compound higher-order page, and splits it into
3194 * n (1<<order) sub-pages: page[0..n]
3195 * Each sub-page must be freed individually.
3197 * Note: this is probably too low level an operation for use in drivers.
3198 * Please consult with lkml before using this in your driver.
3200 void split_page(struct page *page, unsigned int order)
3204 VM_BUG_ON_PAGE(PageCompound(page), page);
3205 VM_BUG_ON_PAGE(!page_count(page), page);
3207 for (i = 1; i < (1 << order); i++)
3208 set_page_refcounted(page + i);
3209 split_page_owner(page, order);
3211 EXPORT_SYMBOL_GPL(split_page);
3213 int __isolate_free_page(struct page *page, unsigned int order)
3215 unsigned long watermark;
3219 BUG_ON(!PageBuddy(page));
3221 zone = page_zone(page);
3222 mt = get_pageblock_migratetype(page);
3224 if (!is_migrate_isolate(mt)) {
3226 * Obey watermarks as if the page was being allocated. We can
3227 * emulate a high-order watermark check with a raised order-0
3228 * watermark, because we already know our high-order page
3231 watermark = zone->_watermark[WMARK_MIN] + (1UL << order);
3232 if (!zone_watermark_ok(zone, 0, watermark, 0, ALLOC_CMA))
3235 __mod_zone_freepage_state(zone, -(1UL << order), mt);
3238 /* Remove page from free list */
3240 del_page_from_free_list(page, zone, order);
3243 * Set the pageblock if the isolated page is at least half of a
3246 if (order >= pageblock_order - 1) {
3247 struct page *endpage = page + (1 << order) - 1;
3248 for (; page < endpage; page += pageblock_nr_pages) {
3249 int mt = get_pageblock_migratetype(page);
3250 if (!is_migrate_isolate(mt) && !is_migrate_cma(mt)
3251 && !is_migrate_highatomic(mt))
3252 set_pageblock_migratetype(page,
3258 return 1UL << order;
3262 * __putback_isolated_page - Return a now-isolated page back where we got it
3263 * @page: Page that was isolated
3264 * @order: Order of the isolated page
3265 * @mt: The page's pageblock's migratetype
3267 * This function is meant to return a page pulled from the free lists via
3268 * __isolate_free_page back to the free lists they were pulled from.
3270 void __putback_isolated_page(struct page *page, unsigned int order, int mt)
3272 struct zone *zone = page_zone(page);
3274 /* zone lock should be held when this function is called */
3275 lockdep_assert_held(&zone->lock);
3277 /* Return isolated page to tail of freelist. */
3278 __free_one_page(page, page_to_pfn(page), zone, order, mt, false);
3282 * Update NUMA hit/miss statistics
3284 * Must be called with interrupts disabled.
3286 static inline void zone_statistics(struct zone *preferred_zone, struct zone *z)
3289 enum numa_stat_item local_stat = NUMA_LOCAL;
3291 /* skip numa counters update if numa stats is disabled */
3292 if (!static_branch_likely(&vm_numa_stat_key))
3295 if (zone_to_nid(z) != numa_node_id())
3296 local_stat = NUMA_OTHER;
3298 if (zone_to_nid(z) == zone_to_nid(preferred_zone))
3299 __inc_numa_state(z, NUMA_HIT);
3301 __inc_numa_state(z, NUMA_MISS);
3302 __inc_numa_state(preferred_zone, NUMA_FOREIGN);
3304 __inc_numa_state(z, local_stat);
3308 /* Remove page from the per-cpu list, caller must protect the list */
3309 static struct page *__rmqueue_pcplist(struct zone *zone, int migratetype,
3310 unsigned int alloc_flags,
3311 struct per_cpu_pages *pcp,
3312 struct list_head *list)
3317 if (list_empty(list)) {
3318 pcp->count += rmqueue_bulk(zone, 0,
3320 migratetype, alloc_flags);
3321 if (unlikely(list_empty(list)))
3325 page = list_first_entry(list, struct page, lru);
3326 list_del(&page->lru);
3328 } while (check_new_pcp(page));
3333 /* Lock and remove page from the per-cpu list */
3334 static struct page *rmqueue_pcplist(struct zone *preferred_zone,
3335 struct zone *zone, gfp_t gfp_flags,
3336 int migratetype, unsigned int alloc_flags)
3338 struct per_cpu_pages *pcp;
3339 struct list_head *list;
3341 unsigned long flags;
3343 local_irq_save(flags);
3344 pcp = &this_cpu_ptr(zone->pageset)->pcp;
3345 list = &pcp->lists[migratetype];
3346 page = __rmqueue_pcplist(zone, migratetype, alloc_flags, pcp, list);
3348 __count_zid_vm_events(PGALLOC, page_zonenum(page), 1);
3349 zone_statistics(preferred_zone, zone);
3351 local_irq_restore(flags);
3356 * Allocate a page from the given zone. Use pcplists for order-0 allocations.
3359 struct page *rmqueue(struct zone *preferred_zone,
3360 struct zone *zone, unsigned int order,
3361 gfp_t gfp_flags, unsigned int alloc_flags,
3364 unsigned long flags;
3367 if (likely(order == 0)) {
3368 page = rmqueue_pcplist(preferred_zone, zone, gfp_flags,
3369 migratetype, alloc_flags);
3374 * We most definitely don't want callers attempting to
3375 * allocate greater than order-1 page units with __GFP_NOFAIL.
3377 WARN_ON_ONCE((gfp_flags & __GFP_NOFAIL) && (order > 1));
3378 spin_lock_irqsave(&zone->lock, flags);
3382 if (alloc_flags & ALLOC_HARDER) {
3383 page = __rmqueue_smallest(zone, order, MIGRATE_HIGHATOMIC);
3385 trace_mm_page_alloc_zone_locked(page, order, migratetype);
3388 page = __rmqueue(zone, order, migratetype, alloc_flags);
3389 } while (page && check_new_pages(page, order));
3390 spin_unlock(&zone->lock);
3393 __mod_zone_freepage_state(zone, -(1 << order),
3394 get_pcppage_migratetype(page));
3396 __count_zid_vm_events(PGALLOC, page_zonenum(page), 1 << order);
3397 zone_statistics(preferred_zone, zone);
3398 local_irq_restore(flags);
3401 /* Separate test+clear to avoid unnecessary atomics */
3402 if (test_bit(ZONE_BOOSTED_WATERMARK, &zone->flags)) {
3403 clear_bit(ZONE_BOOSTED_WATERMARK, &zone->flags);
3404 wakeup_kswapd(zone, 0, 0, zone_idx(zone));
3407 VM_BUG_ON_PAGE(page && bad_range(zone, page), page);
3411 local_irq_restore(flags);
3415 #ifdef CONFIG_FAIL_PAGE_ALLOC
3418 struct fault_attr attr;
3420 bool ignore_gfp_highmem;
3421 bool ignore_gfp_reclaim;
3423 } fail_page_alloc = {
3424 .attr = FAULT_ATTR_INITIALIZER,
3425 .ignore_gfp_reclaim = true,
3426 .ignore_gfp_highmem = true,
3430 static int __init setup_fail_page_alloc(char *str)
3432 return setup_fault_attr(&fail_page_alloc.attr, str);
3434 __setup("fail_page_alloc=", setup_fail_page_alloc);
3436 static bool __should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
3438 if (order < fail_page_alloc.min_order)
3440 if (gfp_mask & __GFP_NOFAIL)
3442 if (fail_page_alloc.ignore_gfp_highmem && (gfp_mask & __GFP_HIGHMEM))
3444 if (fail_page_alloc.ignore_gfp_reclaim &&
3445 (gfp_mask & __GFP_DIRECT_RECLAIM))
3448 return should_fail(&fail_page_alloc.attr, 1 << order);
3451 #ifdef CONFIG_FAULT_INJECTION_DEBUG_FS
3453 static int __init fail_page_alloc_debugfs(void)
3455 umode_t mode = S_IFREG | 0600;
3458 dir = fault_create_debugfs_attr("fail_page_alloc", NULL,
3459 &fail_page_alloc.attr);
3461 debugfs_create_bool("ignore-gfp-wait", mode, dir,
3462 &fail_page_alloc.ignore_gfp_reclaim);
3463 debugfs_create_bool("ignore-gfp-highmem", mode, dir,
3464 &fail_page_alloc.ignore_gfp_highmem);
3465 debugfs_create_u32("min-order", mode, dir, &fail_page_alloc.min_order);
3470 late_initcall(fail_page_alloc_debugfs);
3472 #endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */
3474 #else /* CONFIG_FAIL_PAGE_ALLOC */
3476 static inline bool __should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
3481 #endif /* CONFIG_FAIL_PAGE_ALLOC */
3483 static noinline bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
3485 return __should_fail_alloc_page(gfp_mask, order);
3487 ALLOW_ERROR_INJECTION(should_fail_alloc_page, TRUE);
3489 static inline long __zone_watermark_unusable_free(struct zone *z,
3490 unsigned int order, unsigned int alloc_flags)
3492 const bool alloc_harder = (alloc_flags & (ALLOC_HARDER|ALLOC_OOM));
3493 long unusable_free = (1 << order) - 1;
3496 * If the caller does not have rights to ALLOC_HARDER then subtract
3497 * the high-atomic reserves. This will over-estimate the size of the
3498 * atomic reserve but it avoids a search.
3500 if (likely(!alloc_harder))
3501 unusable_free += z->nr_reserved_highatomic;
3504 /* If allocation can't use CMA areas don't use free CMA pages */
3505 if (!(alloc_flags & ALLOC_CMA))
3506 unusable_free += zone_page_state(z, NR_FREE_CMA_PAGES);
3509 return unusable_free;
3513 * Return true if free base pages are above 'mark'. For high-order checks it
3514 * will return true of the order-0 watermark is reached and there is at least
3515 * one free page of a suitable size. Checking now avoids taking the zone lock
3516 * to check in the allocation paths if no pages are free.
3518 bool __zone_watermark_ok(struct zone *z, unsigned int order, unsigned long mark,
3519 int highest_zoneidx, unsigned int alloc_flags,
3524 const bool alloc_harder = (alloc_flags & (ALLOC_HARDER|ALLOC_OOM));
3526 /* free_pages may go negative - that's OK */
3527 free_pages -= __zone_watermark_unusable_free(z, order, alloc_flags);
3529 if (alloc_flags & ALLOC_HIGH)
3532 if (unlikely(alloc_harder)) {
3534 * OOM victims can try even harder than normal ALLOC_HARDER
3535 * users on the grounds that it's definitely going to be in
3536 * the exit path shortly and free memory. Any allocation it
3537 * makes during the free path will be small and short-lived.
3539 if (alloc_flags & ALLOC_OOM)
3546 * Check watermarks for an order-0 allocation request. If these
3547 * are not met, then a high-order request also cannot go ahead
3548 * even if a suitable page happened to be free.
3550 if (free_pages <= min + z->lowmem_reserve[highest_zoneidx])
3553 /* If this is an order-0 request then the watermark is fine */
3557 /* For a high-order request, check at least one suitable page is free */
3558 for (o = order; o < MAX_ORDER; o++) {
3559 struct free_area *area = &z->free_area[o];
3565 for (mt = 0; mt < MIGRATE_PCPTYPES; mt++) {
3566 if (!free_area_empty(area, mt))
3571 if ((alloc_flags & ALLOC_CMA) &&
3572 !free_area_empty(area, MIGRATE_CMA)) {
3576 if (alloc_harder && !free_area_empty(area, MIGRATE_HIGHATOMIC))
3582 bool zone_watermark_ok(struct zone *z, unsigned int order, unsigned long mark,
3583 int highest_zoneidx, unsigned int alloc_flags)
3585 return __zone_watermark_ok(z, order, mark, highest_zoneidx, alloc_flags,
3586 zone_page_state(z, NR_FREE_PAGES));
3589 static inline bool zone_watermark_fast(struct zone *z, unsigned int order,
3590 unsigned long mark, int highest_zoneidx,
3591 unsigned int alloc_flags, gfp_t gfp_mask)
3595 free_pages = zone_page_state(z, NR_FREE_PAGES);
3598 * Fast check for order-0 only. If this fails then the reserves
3599 * need to be calculated.
3604 fast_free = free_pages;
3605 fast_free -= __zone_watermark_unusable_free(z, 0, alloc_flags);
3606 if (fast_free > mark + z->lowmem_reserve[highest_zoneidx])
3610 if (__zone_watermark_ok(z, order, mark, highest_zoneidx, alloc_flags,
3614 * Ignore watermark boosting for GFP_ATOMIC order-0 allocations
3615 * when checking the min watermark. The min watermark is the
3616 * point where boosting is ignored so that kswapd is woken up
3617 * when below the low watermark.
3619 if (unlikely(!order && (gfp_mask & __GFP_ATOMIC) && z->watermark_boost
3620 && ((alloc_flags & ALLOC_WMARK_MASK) == WMARK_MIN))) {
3621 mark = z->_watermark[WMARK_MIN];
3622 return __zone_watermark_ok(z, order, mark, highest_zoneidx,
3623 alloc_flags, free_pages);
3629 bool zone_watermark_ok_safe(struct zone *z, unsigned int order,
3630 unsigned long mark, int highest_zoneidx)
3632 long free_pages = zone_page_state(z, NR_FREE_PAGES);
3634 if (z->percpu_drift_mark && free_pages < z->percpu_drift_mark)
3635 free_pages = zone_page_state_snapshot(z, NR_FREE_PAGES);
3637 return __zone_watermark_ok(z, order, mark, highest_zoneidx, 0,
3642 static bool zone_allows_reclaim(struct zone *local_zone, struct zone *zone)
3644 return node_distance(zone_to_nid(local_zone), zone_to_nid(zone)) <=
3645 node_reclaim_distance;
3647 #else /* CONFIG_NUMA */
3648 static bool zone_allows_reclaim(struct zone *local_zone, struct zone *zone)
3652 #endif /* CONFIG_NUMA */
3655 * The restriction on ZONE_DMA32 as being a suitable zone to use to avoid
3656 * fragmentation is subtle. If the preferred zone was HIGHMEM then
3657 * premature use of a lower zone may cause lowmem pressure problems that
3658 * are worse than fragmentation. If the next zone is ZONE_DMA then it is
3659 * probably too small. It only makes sense to spread allocations to avoid
3660 * fragmentation between the Normal and DMA32 zones.
3662 static inline unsigned int
3663 alloc_flags_nofragment(struct zone *zone, gfp_t gfp_mask)
3665 unsigned int alloc_flags;
3668 * __GFP_KSWAPD_RECLAIM is assumed to be the same as ALLOC_KSWAPD
3671 alloc_flags = (__force int) (gfp_mask & __GFP_KSWAPD_RECLAIM);
3673 #ifdef CONFIG_ZONE_DMA32
3677 if (zone_idx(zone) != ZONE_NORMAL)
3681 * If ZONE_DMA32 exists, assume it is the one after ZONE_NORMAL and
3682 * the pointer is within zone->zone_pgdat->node_zones[]. Also assume
3683 * on UMA that if Normal is populated then so is DMA32.
3685 BUILD_BUG_ON(ZONE_NORMAL - ZONE_DMA32 != 1);
3686 if (nr_online_nodes > 1 && !populated_zone(--zone))
3689 alloc_flags |= ALLOC_NOFRAGMENT;
3690 #endif /* CONFIG_ZONE_DMA32 */
3695 * get_page_from_freelist goes through the zonelist trying to allocate
3698 static struct page *
3699 get_page_from_freelist(gfp_t gfp_mask, unsigned int order, int alloc_flags,
3700 const struct alloc_context *ac)
3704 struct pglist_data *last_pgdat_dirty_limit = NULL;
3709 * Scan zonelist, looking for a zone with enough free.
3710 * See also __cpuset_node_allowed() comment in kernel/cpuset.c.
3712 no_fallback = alloc_flags & ALLOC_NOFRAGMENT;
3713 z = ac->preferred_zoneref;
3714 for_next_zone_zonelist_nodemask(zone, z, ac->zonelist,
3715 ac->highest_zoneidx, ac->nodemask) {
3719 if (cpusets_enabled() &&
3720 (alloc_flags & ALLOC_CPUSET) &&
3721 !__cpuset_zone_allowed(zone, gfp_mask))
3724 * When allocating a page cache page for writing, we
3725 * want to get it from a node that is within its dirty
3726 * limit, such that no single node holds more than its
3727 * proportional share of globally allowed dirty pages.
3728 * The dirty limits take into account the node's
3729 * lowmem reserves and high watermark so that kswapd
3730 * should be able to balance it without having to
3731 * write pages from its LRU list.
3733 * XXX: For now, allow allocations to potentially
3734 * exceed the per-node dirty limit in the slowpath
3735 * (spread_dirty_pages unset) before going into reclaim,
3736 * which is important when on a NUMA setup the allowed
3737 * nodes are together not big enough to reach the
3738 * global limit. The proper fix for these situations
3739 * will require awareness of nodes in the
3740 * dirty-throttling and the flusher threads.
3742 if (ac->spread_dirty_pages) {
3743 if (last_pgdat_dirty_limit == zone->zone_pgdat)
3746 if (!node_dirty_ok(zone->zone_pgdat)) {
3747 last_pgdat_dirty_limit = zone->zone_pgdat;
3752 if (no_fallback && nr_online_nodes > 1 &&
3753 zone != ac->preferred_zoneref->zone) {
3757 * If moving to a remote node, retry but allow
3758 * fragmenting fallbacks. Locality is more important
3759 * than fragmentation avoidance.
3761 local_nid = zone_to_nid(ac->preferred_zoneref->zone);
3762 if (zone_to_nid(zone) != local_nid) {
3763 alloc_flags &= ~ALLOC_NOFRAGMENT;
3768 mark = wmark_pages(zone, alloc_flags & ALLOC_WMARK_MASK);
3769 if (!zone_watermark_fast(zone, order, mark,
3770 ac->highest_zoneidx, alloc_flags,
3774 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
3776 * Watermark failed for this zone, but see if we can
3777 * grow this zone if it contains deferred pages.
3779 if (static_branch_unlikely(&deferred_pages)) {
3780 if (_deferred_grow_zone(zone, order))
3784 /* Checked here to keep the fast path fast */
3785 BUILD_BUG_ON(ALLOC_NO_WATERMARKS < NR_WMARK);
3786 if (alloc_flags & ALLOC_NO_WATERMARKS)
3789 if (node_reclaim_mode == 0 ||
3790 !zone_allows_reclaim(ac->preferred_zoneref->zone, zone))
3793 ret = node_reclaim(zone->zone_pgdat, gfp_mask, order);
3795 case NODE_RECLAIM_NOSCAN:
3798 case NODE_RECLAIM_FULL:
3799 /* scanned but unreclaimable */
3802 /* did we reclaim enough */
3803 if (zone_watermark_ok(zone, order, mark,
3804 ac->highest_zoneidx, alloc_flags))
3812 page = rmqueue(ac->preferred_zoneref->zone, zone, order,
3813 gfp_mask, alloc_flags, ac->migratetype);
3815 prep_new_page(page, order, gfp_mask, alloc_flags);
3818 * If this is a high-order atomic allocation then check
3819 * if the pageblock should be reserved for the future
3821 if (unlikely(order && (alloc_flags & ALLOC_HARDER)))
3822 reserve_highatomic_pageblock(page, zone, order);
3826 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
3827 /* Try again if zone has deferred pages */
3828 if (static_branch_unlikely(&deferred_pages)) {
3829 if (_deferred_grow_zone(zone, order))
3837 * It's possible on a UMA machine to get through all zones that are
3838 * fragmented. If avoiding fragmentation, reset and try again.
3841 alloc_flags &= ~ALLOC_NOFRAGMENT;
3848 static void warn_alloc_show_mem(gfp_t gfp_mask, nodemask_t *nodemask)
3850 unsigned int filter = SHOW_MEM_FILTER_NODES;
3853 * This documents exceptions given to allocations in certain
3854 * contexts that are allowed to allocate outside current's set
3857 if (!(gfp_mask & __GFP_NOMEMALLOC))
3858 if (tsk_is_oom_victim(current) ||
3859 (current->flags & (PF_MEMALLOC | PF_EXITING)))
3860 filter &= ~SHOW_MEM_FILTER_NODES;
3861 if (in_interrupt() || !(gfp_mask & __GFP_DIRECT_RECLAIM))
3862 filter &= ~SHOW_MEM_FILTER_NODES;
3864 show_mem(filter, nodemask);
3867 void warn_alloc(gfp_t gfp_mask, nodemask_t *nodemask, const char *fmt, ...)
3869 struct va_format vaf;
3871 static DEFINE_RATELIMIT_STATE(nopage_rs, 10*HZ, 1);
3873 if ((gfp_mask & __GFP_NOWARN) || !__ratelimit(&nopage_rs))
3876 va_start(args, fmt);
3879 pr_warn("%s: %pV, mode:%#x(%pGg), nodemask=%*pbl",
3880 current->comm, &vaf, gfp_mask, &gfp_mask,
3881 nodemask_pr_args(nodemask));
3884 cpuset_print_current_mems_allowed();
3887 warn_alloc_show_mem(gfp_mask, nodemask);
3890 static inline struct page *
3891 __alloc_pages_cpuset_fallback(gfp_t gfp_mask, unsigned int order,
3892 unsigned int alloc_flags,
3893 const struct alloc_context *ac)
3897 page = get_page_from_freelist(gfp_mask, order,
3898 alloc_flags|ALLOC_CPUSET, ac);
3900 * fallback to ignore cpuset restriction if our nodes
3904 page = get_page_from_freelist(gfp_mask, order,
3910 static inline struct page *
3911 __alloc_pages_may_oom(gfp_t gfp_mask, unsigned int order,
3912 const struct alloc_context *ac, unsigned long *did_some_progress)
3914 struct oom_control oc = {
3915 .zonelist = ac->zonelist,
3916 .nodemask = ac->nodemask,
3918 .gfp_mask = gfp_mask,
3923 *did_some_progress = 0;
3926 * Acquire the oom lock. If that fails, somebody else is
3927 * making progress for us.
3929 if (!mutex_trylock(&oom_lock)) {
3930 *did_some_progress = 1;
3931 schedule_timeout_uninterruptible(1);
3936 * Go through the zonelist yet one more time, keep very high watermark
3937 * here, this is only to catch a parallel oom killing, we must fail if
3938 * we're still under heavy pressure. But make sure that this reclaim
3939 * attempt shall not depend on __GFP_DIRECT_RECLAIM && !__GFP_NORETRY
3940 * allocation which will never fail due to oom_lock already held.
3942 page = get_page_from_freelist((gfp_mask | __GFP_HARDWALL) &
3943 ~__GFP_DIRECT_RECLAIM, order,
3944 ALLOC_WMARK_HIGH|ALLOC_CPUSET, ac);
3948 /* Coredumps can quickly deplete all memory reserves */
3949 if (current->flags & PF_DUMPCORE)
3951 /* The OOM killer will not help higher order allocs */
3952 if (order > PAGE_ALLOC_COSTLY_ORDER)
3955 * We have already exhausted all our reclaim opportunities without any
3956 * success so it is time to admit defeat. We will skip the OOM killer
3957 * because it is very likely that the caller has a more reasonable
3958 * fallback than shooting a random task.
3960 if (gfp_mask & __GFP_RETRY_MAYFAIL)
3962 /* The OOM killer does not needlessly kill tasks for lowmem */
3963 if (ac->highest_zoneidx < ZONE_NORMAL)
3965 if (pm_suspended_storage())
3968 * XXX: GFP_NOFS allocations should rather fail than rely on
3969 * other request to make a forward progress.
3970 * We are in an unfortunate situation where out_of_memory cannot
3971 * do much for this context but let's try it to at least get
3972 * access to memory reserved if the current task is killed (see
3973 * out_of_memory). Once filesystems are ready to handle allocation
3974 * failures more gracefully we should just bail out here.
3977 /* The OOM killer may not free memory on a specific node */
3978 if (gfp_mask & __GFP_THISNODE)
3981 /* Exhausted what can be done so it's blame time */
3982 if (out_of_memory(&oc) || WARN_ON_ONCE(gfp_mask & __GFP_NOFAIL)) {
3983 *did_some_progress = 1;
3986 * Help non-failing allocations by giving them access to memory
3989 if (gfp_mask & __GFP_NOFAIL)
3990 page = __alloc_pages_cpuset_fallback(gfp_mask, order,
3991 ALLOC_NO_WATERMARKS, ac);
3994 mutex_unlock(&oom_lock);
3999 * Maximum number of compaction retries wit a progress before OOM
4000 * killer is consider as the only way to move forward.
4002 #define MAX_COMPACT_RETRIES 16
4004 #ifdef CONFIG_COMPACTION
4005 /* Try memory compaction for high-order allocations before reclaim */
4006 static struct page *
4007 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
4008 unsigned int alloc_flags, const struct alloc_context *ac,
4009 enum compact_priority prio, enum compact_result *compact_result)
4011 struct page *page = NULL;
4012 unsigned long pflags;
4013 unsigned int noreclaim_flag;
4018 psi_memstall_enter(&pflags);
4019 noreclaim_flag = memalloc_noreclaim_save();
4021 *compact_result = try_to_compact_pages(gfp_mask, order, alloc_flags, ac,
4024 memalloc_noreclaim_restore(noreclaim_flag);
4025 psi_memstall_leave(&pflags);
4028 * At least in one zone compaction wasn't deferred or skipped, so let's
4029 * count a compaction stall
4031 count_vm_event(COMPACTSTALL);
4033 /* Prep a captured page if available */
4035 prep_new_page(page, order, gfp_mask, alloc_flags);
4037 /* Try get a page from the freelist if available */
4039 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac);
4042 struct zone *zone = page_zone(page);
4044 zone->compact_blockskip_flush = false;
4045 compaction_defer_reset(zone, order, true);
4046 count_vm_event(COMPACTSUCCESS);
4051 * It's bad if compaction run occurs and fails. The most likely reason
4052 * is that pages exist, but not enough to satisfy watermarks.
4054 count_vm_event(COMPACTFAIL);
4062 should_compact_retry(struct alloc_context *ac, int order, int alloc_flags,
4063 enum compact_result compact_result,
4064 enum compact_priority *compact_priority,
4065 int *compaction_retries)
4067 int max_retries = MAX_COMPACT_RETRIES;
4070 int retries = *compaction_retries;
4071 enum compact_priority priority = *compact_priority;
4076 if (compaction_made_progress(compact_result))
4077 (*compaction_retries)++;
4080 * compaction considers all the zone as desperately out of memory
4081 * so it doesn't really make much sense to retry except when the
4082 * failure could be caused by insufficient priority
4084 if (compaction_failed(compact_result))
4085 goto check_priority;
4088 * compaction was skipped because there are not enough order-0 pages
4089 * to work with, so we retry only if it looks like reclaim can help.
4091 if (compaction_needs_reclaim(compact_result)) {
4092 ret = compaction_zonelist_suitable(ac, order, alloc_flags);
4097 * make sure the compaction wasn't deferred or didn't bail out early
4098 * due to locks contention before we declare that we should give up.
4099 * But the next retry should use a higher priority if allowed, so
4100 * we don't just keep bailing out endlessly.
4102 if (compaction_withdrawn(compact_result)) {
4103 goto check_priority;
4107 * !costly requests are much more important than __GFP_RETRY_MAYFAIL
4108 * costly ones because they are de facto nofail and invoke OOM
4109 * killer to move on while costly can fail and users are ready
4110 * to cope with that. 1/4 retries is rather arbitrary but we
4111 * would need much more detailed feedback from compaction to
4112 * make a better decision.
4114 if (order > PAGE_ALLOC_COSTLY_ORDER)
4116 if (*compaction_retries <= max_retries) {
4122 * Make sure there are attempts at the highest priority if we exhausted
4123 * all retries or failed at the lower priorities.
4126 min_priority = (order > PAGE_ALLOC_COSTLY_ORDER) ?
4127 MIN_COMPACT_COSTLY_PRIORITY : MIN_COMPACT_PRIORITY;
4129 if (*compact_priority > min_priority) {
4130 (*compact_priority)--;
4131 *compaction_retries = 0;
4135 trace_compact_retry(order, priority, compact_result, retries, max_retries, ret);
4139 static inline struct page *
4140 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
4141 unsigned int alloc_flags, const struct alloc_context *ac,
4142 enum compact_priority prio, enum compact_result *compact_result)
4144 *compact_result = COMPACT_SKIPPED;
4149 should_compact_retry(struct alloc_context *ac, unsigned int order, int alloc_flags,
4150 enum compact_result compact_result,
4151 enum compact_priority *compact_priority,
4152 int *compaction_retries)
4157 if (!order || order > PAGE_ALLOC_COSTLY_ORDER)
4161 * There are setups with compaction disabled which would prefer to loop
4162 * inside the allocator rather than hit the oom killer prematurely.
4163 * Let's give them a good hope and keep retrying while the order-0
4164 * watermarks are OK.
4166 for_each_zone_zonelist_nodemask(zone, z, ac->zonelist,
4167 ac->highest_zoneidx, ac->nodemask) {
4168 if (zone_watermark_ok(zone, 0, min_wmark_pages(zone),
4169 ac->highest_zoneidx, alloc_flags))
4174 #endif /* CONFIG_COMPACTION */
4176 #ifdef CONFIG_LOCKDEP
4177 static struct lockdep_map __fs_reclaim_map =
4178 STATIC_LOCKDEP_MAP_INIT("fs_reclaim", &__fs_reclaim_map);
4180 static bool __need_fs_reclaim(gfp_t gfp_mask)
4182 gfp_mask = current_gfp_context(gfp_mask);
4184 /* no reclaim without waiting on it */
4185 if (!(gfp_mask & __GFP_DIRECT_RECLAIM))
4188 /* this guy won't enter reclaim */
4189 if (current->flags & PF_MEMALLOC)
4192 /* We're only interested __GFP_FS allocations for now */
4193 if (!(gfp_mask & __GFP_FS))
4196 if (gfp_mask & __GFP_NOLOCKDEP)
4202 void __fs_reclaim_acquire(void)
4204 lock_map_acquire(&__fs_reclaim_map);
4207 void __fs_reclaim_release(void)
4209 lock_map_release(&__fs_reclaim_map);
4212 void fs_reclaim_acquire(gfp_t gfp_mask)
4214 if (__need_fs_reclaim(gfp_mask))
4215 __fs_reclaim_acquire();
4217 EXPORT_SYMBOL_GPL(fs_reclaim_acquire);
4219 void fs_reclaim_release(gfp_t gfp_mask)
4221 if (__need_fs_reclaim(gfp_mask))
4222 __fs_reclaim_release();
4224 EXPORT_SYMBOL_GPL(fs_reclaim_release);
4227 /* Perform direct synchronous page reclaim */
4229 __perform_reclaim(gfp_t gfp_mask, unsigned int order,
4230 const struct alloc_context *ac)
4233 unsigned int noreclaim_flag;
4234 unsigned long pflags;
4238 /* We now go into synchronous reclaim */
4239 cpuset_memory_pressure_bump();
4240 psi_memstall_enter(&pflags);
4241 fs_reclaim_acquire(gfp_mask);
4242 noreclaim_flag = memalloc_noreclaim_save();
4244 progress = try_to_free_pages(ac->zonelist, order, gfp_mask,
4247 memalloc_noreclaim_restore(noreclaim_flag);
4248 fs_reclaim_release(gfp_mask);
4249 psi_memstall_leave(&pflags);
4256 /* The really slow allocator path where we enter direct reclaim */
4257 static inline struct page *
4258 __alloc_pages_direct_reclaim(gfp_t gfp_mask, unsigned int order,
4259 unsigned int alloc_flags, const struct alloc_context *ac,
4260 unsigned long *did_some_progress)
4262 struct page *page = NULL;
4263 bool drained = false;
4265 *did_some_progress = __perform_reclaim(gfp_mask, order, ac);
4266 if (unlikely(!(*did_some_progress)))
4270 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac);
4273 * If an allocation failed after direct reclaim, it could be because
4274 * pages are pinned on the per-cpu lists or in high alloc reserves.
4275 * Shrink them them and try again
4277 if (!page && !drained) {
4278 unreserve_highatomic_pageblock(ac, false);
4279 drain_all_pages(NULL);
4287 static void wake_all_kswapds(unsigned int order, gfp_t gfp_mask,
4288 const struct alloc_context *ac)
4292 pg_data_t *last_pgdat = NULL;
4293 enum zone_type highest_zoneidx = ac->highest_zoneidx;
4295 for_each_zone_zonelist_nodemask(zone, z, ac->zonelist, highest_zoneidx,
4297 if (last_pgdat != zone->zone_pgdat)
4298 wakeup_kswapd(zone, gfp_mask, order, highest_zoneidx);
4299 last_pgdat = zone->zone_pgdat;
4303 static inline unsigned int
4304 gfp_to_alloc_flags(gfp_t gfp_mask)
4306 unsigned int alloc_flags = ALLOC_WMARK_MIN | ALLOC_CPUSET;
4309 * __GFP_HIGH is assumed to be the same as ALLOC_HIGH
4310 * and __GFP_KSWAPD_RECLAIM is assumed to be the same as ALLOC_KSWAPD
4311 * to save two branches.
4313 BUILD_BUG_ON(__GFP_HIGH != (__force gfp_t) ALLOC_HIGH);
4314 BUILD_BUG_ON(__GFP_KSWAPD_RECLAIM != (__force gfp_t) ALLOC_KSWAPD);
4317 * The caller may dip into page reserves a bit more if the caller
4318 * cannot run direct reclaim, or if the caller has realtime scheduling
4319 * policy or is asking for __GFP_HIGH memory. GFP_ATOMIC requests will
4320 * set both ALLOC_HARDER (__GFP_ATOMIC) and ALLOC_HIGH (__GFP_HIGH).
4322 alloc_flags |= (__force int)
4323 (gfp_mask & (__GFP_HIGH | __GFP_KSWAPD_RECLAIM));
4325 if (gfp_mask & __GFP_ATOMIC) {
4327 * Not worth trying to allocate harder for __GFP_NOMEMALLOC even
4328 * if it can't schedule.
4330 if (!(gfp_mask & __GFP_NOMEMALLOC))
4331 alloc_flags |= ALLOC_HARDER;
4333 * Ignore cpuset mems for GFP_ATOMIC rather than fail, see the
4334 * comment for __cpuset_node_allowed().
4336 alloc_flags &= ~ALLOC_CPUSET;
4337 } else if (unlikely(rt_task(current)) && !in_interrupt())
4338 alloc_flags |= ALLOC_HARDER;
4341 if (gfp_migratetype(gfp_mask) == MIGRATE_MOVABLE)
4342 alloc_flags |= ALLOC_CMA;
4347 static bool oom_reserves_allowed(struct task_struct *tsk)
4349 if (!tsk_is_oom_victim(tsk))
4353 * !MMU doesn't have oom reaper so give access to memory reserves
4354 * only to the thread with TIF_MEMDIE set
4356 if (!IS_ENABLED(CONFIG_MMU) && !test_thread_flag(TIF_MEMDIE))
4363 * Distinguish requests which really need access to full memory
4364 * reserves from oom victims which can live with a portion of it
4366 static inline int __gfp_pfmemalloc_flags(gfp_t gfp_mask)
4368 if (unlikely(gfp_mask & __GFP_NOMEMALLOC))
4370 if (gfp_mask & __GFP_MEMALLOC)
4371 return ALLOC_NO_WATERMARKS;
4372 if (in_serving_softirq() && (current->flags & PF_MEMALLOC))
4373 return ALLOC_NO_WATERMARKS;
4374 if (!in_interrupt()) {
4375 if (current->flags & PF_MEMALLOC)
4376 return ALLOC_NO_WATERMARKS;
4377 else if (oom_reserves_allowed(current))
4384 bool gfp_pfmemalloc_allowed(gfp_t gfp_mask)
4386 return !!__gfp_pfmemalloc_flags(gfp_mask);
4390 * Checks whether it makes sense to retry the reclaim to make a forward progress
4391 * for the given allocation request.
4393 * We give up when we either have tried MAX_RECLAIM_RETRIES in a row
4394 * without success, or when we couldn't even meet the watermark if we
4395 * reclaimed all remaining pages on the LRU lists.
4397 * Returns true if a retry is viable or false to enter the oom path.
4400 should_reclaim_retry(gfp_t gfp_mask, unsigned order,
4401 struct alloc_context *ac, int alloc_flags,
4402 bool did_some_progress, int *no_progress_loops)
4409 * Costly allocations might have made a progress but this doesn't mean
4410 * their order will become available due to high fragmentation so
4411 * always increment the no progress counter for them
4413 if (did_some_progress && order <= PAGE_ALLOC_COSTLY_ORDER)
4414 *no_progress_loops = 0;
4416 (*no_progress_loops)++;
4419 * Make sure we converge to OOM if we cannot make any progress
4420 * several times in the row.
4422 if (*no_progress_loops > MAX_RECLAIM_RETRIES) {
4423 /* Before OOM, exhaust highatomic_reserve */
4424 return unreserve_highatomic_pageblock(ac, true);
4428 * Keep reclaiming pages while there is a chance this will lead
4429 * somewhere. If none of the target zones can satisfy our allocation
4430 * request even if all reclaimable pages are considered then we are
4431 * screwed and have to go OOM.
4433 for_each_zone_zonelist_nodemask(zone, z, ac->zonelist,
4434 ac->highest_zoneidx, ac->nodemask) {
4435 unsigned long available;
4436 unsigned long reclaimable;
4437 unsigned long min_wmark = min_wmark_pages(zone);
4440 available = reclaimable = zone_reclaimable_pages(zone);
4441 available += zone_page_state_snapshot(zone, NR_FREE_PAGES);
4444 * Would the allocation succeed if we reclaimed all
4445 * reclaimable pages?
4447 wmark = __zone_watermark_ok(zone, order, min_wmark,
4448 ac->highest_zoneidx, alloc_flags, available);
4449 trace_reclaim_retry_zone(z, order, reclaimable,
4450 available, min_wmark, *no_progress_loops, wmark);
4453 * If we didn't make any progress and have a lot of
4454 * dirty + writeback pages then we should wait for
4455 * an IO to complete to slow down the reclaim and
4456 * prevent from pre mature OOM
4458 if (!did_some_progress) {
4459 unsigned long write_pending;
4461 write_pending = zone_page_state_snapshot(zone,
4462 NR_ZONE_WRITE_PENDING);
4464 if (2 * write_pending > reclaimable) {
4465 congestion_wait(BLK_RW_ASYNC, HZ/10);
4477 * Memory allocation/reclaim might be called from a WQ context and the
4478 * current implementation of the WQ concurrency control doesn't
4479 * recognize that a particular WQ is congested if the worker thread is
4480 * looping without ever sleeping. Therefore we have to do a short sleep
4481 * here rather than calling cond_resched().
4483 if (current->flags & PF_WQ_WORKER)
4484 schedule_timeout_uninterruptible(1);
4491 check_retry_cpuset(int cpuset_mems_cookie, struct alloc_context *ac)
4494 * It's possible that cpuset's mems_allowed and the nodemask from
4495 * mempolicy don't intersect. This should be normally dealt with by
4496 * policy_nodemask(), but it's possible to race with cpuset update in
4497 * such a way the check therein was true, and then it became false
4498 * before we got our cpuset_mems_cookie here.
4499 * This assumes that for all allocations, ac->nodemask can come only
4500 * from MPOL_BIND mempolicy (whose documented semantics is to be ignored
4501 * when it does not intersect with the cpuset restrictions) or the
4502 * caller can deal with a violated nodemask.
4504 if (cpusets_enabled() && ac->nodemask &&
4505 !cpuset_nodemask_valid_mems_allowed(ac->nodemask)) {
4506 ac->nodemask = NULL;
4511 * When updating a task's mems_allowed or mempolicy nodemask, it is
4512 * possible to race with parallel threads in such a way that our
4513 * allocation can fail while the mask is being updated. If we are about
4514 * to fail, check if the cpuset changed during allocation and if so,
4517 if (read_mems_allowed_retry(cpuset_mems_cookie))
4523 static inline struct page *
4524 __alloc_pages_slowpath(gfp_t gfp_mask, unsigned int order,
4525 struct alloc_context *ac)
4527 bool can_direct_reclaim = gfp_mask & __GFP_DIRECT_RECLAIM;
4528 const bool costly_order = order > PAGE_ALLOC_COSTLY_ORDER;
4529 struct page *page = NULL;
4530 unsigned int alloc_flags;
4531 unsigned long did_some_progress;
4532 enum compact_priority compact_priority;
4533 enum compact_result compact_result;
4534 int compaction_retries;
4535 int no_progress_loops;
4536 unsigned int cpuset_mems_cookie;
4540 * We also sanity check to catch abuse of atomic reserves being used by
4541 * callers that are not in atomic context.
4543 if (WARN_ON_ONCE((gfp_mask & (__GFP_ATOMIC|__GFP_DIRECT_RECLAIM)) ==
4544 (__GFP_ATOMIC|__GFP_DIRECT_RECLAIM)))
4545 gfp_mask &= ~__GFP_ATOMIC;
4548 compaction_retries = 0;
4549 no_progress_loops = 0;
4550 compact_priority = DEF_COMPACT_PRIORITY;
4551 cpuset_mems_cookie = read_mems_allowed_begin();
4554 * The fast path uses conservative alloc_flags to succeed only until
4555 * kswapd needs to be woken up, and to avoid the cost of setting up
4556 * alloc_flags precisely. So we do that now.
4558 alloc_flags = gfp_to_alloc_flags(gfp_mask);
4561 * We need to recalculate the starting point for the zonelist iterator
4562 * because we might have used different nodemask in the fast path, or
4563 * there was a cpuset modification and we are retrying - otherwise we
4564 * could end up iterating over non-eligible zones endlessly.
4566 ac->preferred_zoneref = first_zones_zonelist(ac->zonelist,
4567 ac->highest_zoneidx, ac->nodemask);
4568 if (!ac->preferred_zoneref->zone)
4571 if (alloc_flags & ALLOC_KSWAPD)
4572 wake_all_kswapds(order, gfp_mask, ac);
4575 * The adjusted alloc_flags might result in immediate success, so try
4578 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac);
4583 * For costly allocations, try direct compaction first, as it's likely
4584 * that we have enough base pages and don't need to reclaim. For non-
4585 * movable high-order allocations, do that as well, as compaction will
4586 * try prevent permanent fragmentation by migrating from blocks of the
4588 * Don't try this for allocations that are allowed to ignore
4589 * watermarks, as the ALLOC_NO_WATERMARKS attempt didn't yet happen.
4591 if (can_direct_reclaim &&
4593 (order > 0 && ac->migratetype != MIGRATE_MOVABLE))
4594 && !gfp_pfmemalloc_allowed(gfp_mask)) {
4595 page = __alloc_pages_direct_compact(gfp_mask, order,
4597 INIT_COMPACT_PRIORITY,
4603 * Checks for costly allocations with __GFP_NORETRY, which
4604 * includes some THP page fault allocations
4606 if (costly_order && (gfp_mask & __GFP_NORETRY)) {
4608 * If allocating entire pageblock(s) and compaction
4609 * failed because all zones are below low watermarks
4610 * or is prohibited because it recently failed at this
4611 * order, fail immediately unless the allocator has
4612 * requested compaction and reclaim retry.
4615 * - potentially very expensive because zones are far
4616 * below their low watermarks or this is part of very
4617 * bursty high order allocations,
4618 * - not guaranteed to help because isolate_freepages()
4619 * may not iterate over freed pages as part of its
4621 * - unlikely to make entire pageblocks free on its
4624 if (compact_result == COMPACT_SKIPPED ||
4625 compact_result == COMPACT_DEFERRED)
4629 * Looks like reclaim/compaction is worth trying, but
4630 * sync compaction could be very expensive, so keep
4631 * using async compaction.
4633 compact_priority = INIT_COMPACT_PRIORITY;
4638 /* Ensure kswapd doesn't accidentally go to sleep as long as we loop */
4639 if (alloc_flags & ALLOC_KSWAPD)
4640 wake_all_kswapds(order, gfp_mask, ac);
4642 reserve_flags = __gfp_pfmemalloc_flags(gfp_mask);
4644 alloc_flags = reserve_flags;
4647 * Reset the nodemask and zonelist iterators if memory policies can be
4648 * ignored. These allocations are high priority and system rather than
4651 if (!(alloc_flags & ALLOC_CPUSET) || reserve_flags) {
4652 ac->nodemask = NULL;
4653 ac->preferred_zoneref = first_zones_zonelist(ac->zonelist,
4654 ac->highest_zoneidx, ac->nodemask);
4657 /* Attempt with potentially adjusted zonelist and alloc_flags */
4658 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac);
4662 /* Caller is not willing to reclaim, we can't balance anything */
4663 if (!can_direct_reclaim)
4666 /* Avoid recursion of direct reclaim */
4667 if (current->flags & PF_MEMALLOC)
4670 /* Try direct reclaim and then allocating */
4671 page = __alloc_pages_direct_reclaim(gfp_mask, order, alloc_flags, ac,
4672 &did_some_progress);
4676 /* Try direct compaction and then allocating */
4677 page = __alloc_pages_direct_compact(gfp_mask, order, alloc_flags, ac,
4678 compact_priority, &compact_result);
4682 /* Do not loop if specifically requested */
4683 if (gfp_mask & __GFP_NORETRY)
4687 * Do not retry costly high order allocations unless they are
4688 * __GFP_RETRY_MAYFAIL
4690 if (costly_order && !(gfp_mask & __GFP_RETRY_MAYFAIL))
4693 if (should_reclaim_retry(gfp_mask, order, ac, alloc_flags,
4694 did_some_progress > 0, &no_progress_loops))
4698 * It doesn't make any sense to retry for the compaction if the order-0
4699 * reclaim is not able to make any progress because the current
4700 * implementation of the compaction depends on the sufficient amount
4701 * of free memory (see __compaction_suitable)
4703 if (did_some_progress > 0 &&
4704 should_compact_retry(ac, order, alloc_flags,
4705 compact_result, &compact_priority,
4706 &compaction_retries))
4710 /* Deal with possible cpuset update races before we start OOM killing */
4711 if (check_retry_cpuset(cpuset_mems_cookie, ac))
4714 /* Reclaim has failed us, start killing things */
4715 page = __alloc_pages_may_oom(gfp_mask, order, ac, &did_some_progress);
4719 /* Avoid allocations with no watermarks from looping endlessly */
4720 if (tsk_is_oom_victim(current) &&
4721 (alloc_flags == ALLOC_OOM ||
4722 (gfp_mask & __GFP_NOMEMALLOC)))
4725 /* Retry as long as the OOM killer is making progress */
4726 if (did_some_progress) {
4727 no_progress_loops = 0;
4732 /* Deal with possible cpuset update races before we fail */
4733 if (check_retry_cpuset(cpuset_mems_cookie, ac))
4737 * Make sure that __GFP_NOFAIL request doesn't leak out and make sure
4740 if (gfp_mask & __GFP_NOFAIL) {
4742 * All existing users of the __GFP_NOFAIL are blockable, so warn
4743 * of any new users that actually require GFP_NOWAIT
4745 if (WARN_ON_ONCE(!can_direct_reclaim))
4749 * PF_MEMALLOC request from this context is rather bizarre
4750 * because we cannot reclaim anything and only can loop waiting
4751 * for somebody to do a work for us
4753 WARN_ON_ONCE(current->flags & PF_MEMALLOC);
4756 * non failing costly orders are a hard requirement which we
4757 * are not prepared for much so let's warn about these users
4758 * so that we can identify them and convert them to something
4761 WARN_ON_ONCE(order > PAGE_ALLOC_COSTLY_ORDER);
4764 * Help non-failing allocations by giving them access to memory
4765 * reserves but do not use ALLOC_NO_WATERMARKS because this
4766 * could deplete whole memory reserves which would just make
4767 * the situation worse
4769 page = __alloc_pages_cpuset_fallback(gfp_mask, order, ALLOC_HARDER, ac);
4777 warn_alloc(gfp_mask, ac->nodemask,
4778 "page allocation failure: order:%u", order);
4783 static inline bool prepare_alloc_pages(gfp_t gfp_mask, unsigned int order,
4784 int preferred_nid, nodemask_t *nodemask,
4785 struct alloc_context *ac, gfp_t *alloc_mask,
4786 unsigned int *alloc_flags)
4788 ac->highest_zoneidx = gfp_zone(gfp_mask);
4789 ac->zonelist = node_zonelist(preferred_nid, gfp_mask);
4790 ac->nodemask = nodemask;
4791 ac->migratetype = gfp_migratetype(gfp_mask);
4793 if (cpusets_enabled()) {
4794 *alloc_mask |= __GFP_HARDWALL;
4796 ac->nodemask = &cpuset_current_mems_allowed;
4798 *alloc_flags |= ALLOC_CPUSET;
4801 fs_reclaim_acquire(gfp_mask);
4802 fs_reclaim_release(gfp_mask);
4804 might_sleep_if(gfp_mask & __GFP_DIRECT_RECLAIM);
4806 if (should_fail_alloc_page(gfp_mask, order))
4809 if (IS_ENABLED(CONFIG_CMA) && ac->migratetype == MIGRATE_MOVABLE)
4810 *alloc_flags |= ALLOC_CMA;
4815 /* Determine whether to spread dirty pages and what the first usable zone */
4816 static inline void finalise_ac(gfp_t gfp_mask, struct alloc_context *ac)
4818 /* Dirty zone balancing only done in the fast path */
4819 ac->spread_dirty_pages = (gfp_mask & __GFP_WRITE);
4822 * The preferred zone is used for statistics but crucially it is
4823 * also used as the starting point for the zonelist iterator. It
4824 * may get reset for allocations that ignore memory policies.
4826 ac->preferred_zoneref = first_zones_zonelist(ac->zonelist,
4827 ac->highest_zoneidx, ac->nodemask);
4831 * This is the 'heart' of the zoned buddy allocator.
4834 __alloc_pages_nodemask(gfp_t gfp_mask, unsigned int order, int preferred_nid,
4835 nodemask_t *nodemask)
4838 unsigned int alloc_flags = ALLOC_WMARK_LOW;
4839 gfp_t alloc_mask; /* The gfp_t that was actually used for allocation */
4840 struct alloc_context ac = { };
4843 * There are several places where we assume that the order value is sane
4844 * so bail out early if the request is out of bound.
4846 if (unlikely(order >= MAX_ORDER)) {
4847 WARN_ON_ONCE(!(gfp_mask & __GFP_NOWARN));
4851 gfp_mask &= gfp_allowed_mask;
4852 alloc_mask = gfp_mask;
4853 if (!prepare_alloc_pages(gfp_mask, order, preferred_nid, nodemask, &ac, &alloc_mask, &alloc_flags))
4856 finalise_ac(gfp_mask, &ac);
4859 * Forbid the first pass from falling back to types that fragment
4860 * memory until all local zones are considered.
4862 alloc_flags |= alloc_flags_nofragment(ac.preferred_zoneref->zone, gfp_mask);
4864 /* First allocation attempt */
4865 page = get_page_from_freelist(alloc_mask, order, alloc_flags, &ac);
4870 * Apply scoped allocation constraints. This is mainly about GFP_NOFS
4871 * resp. GFP_NOIO which has to be inherited for all allocation requests
4872 * from a particular context which has been marked by
4873 * memalloc_no{fs,io}_{save,restore}.
4875 alloc_mask = current_gfp_context(gfp_mask);
4876 ac.spread_dirty_pages = false;
4879 * Restore the original nodemask if it was potentially replaced with
4880 * &cpuset_current_mems_allowed to optimize the fast-path attempt.
4882 ac.nodemask = nodemask;
4884 page = __alloc_pages_slowpath(alloc_mask, order, &ac);
4887 if (memcg_kmem_enabled() && (gfp_mask & __GFP_ACCOUNT) && page &&
4888 unlikely(__memcg_kmem_charge_page(page, gfp_mask, order) != 0)) {
4889 __free_pages(page, order);
4893 trace_mm_page_alloc(page, order, alloc_mask, ac.migratetype);
4897 EXPORT_SYMBOL(__alloc_pages_nodemask);
4900 * Common helper functions. Never use with __GFP_HIGHMEM because the returned
4901 * address cannot represent highmem pages. Use alloc_pages and then kmap if
4902 * you need to access high mem.
4904 unsigned long __get_free_pages(gfp_t gfp_mask, unsigned int order)
4908 page = alloc_pages(gfp_mask & ~__GFP_HIGHMEM, order);
4911 return (unsigned long) page_address(page);
4913 EXPORT_SYMBOL(__get_free_pages);
4915 unsigned long get_zeroed_page(gfp_t gfp_mask)
4917 return __get_free_pages(gfp_mask | __GFP_ZERO, 0);
4919 EXPORT_SYMBOL(get_zeroed_page);
4921 static inline void free_the_page(struct page *page, unsigned int order)
4923 if (order == 0) /* Via pcp? */
4924 free_unref_page(page);
4926 __free_pages_ok(page, order);
4929 void __free_pages(struct page *page, unsigned int order)
4931 if (put_page_testzero(page))
4932 free_the_page(page, order);
4934 EXPORT_SYMBOL(__free_pages);
4936 void free_pages(unsigned long addr, unsigned int order)
4939 VM_BUG_ON(!virt_addr_valid((void *)addr));
4940 __free_pages(virt_to_page((void *)addr), order);
4944 EXPORT_SYMBOL(free_pages);
4948 * An arbitrary-length arbitrary-offset area of memory which resides
4949 * within a 0 or higher order page. Multiple fragments within that page
4950 * are individually refcounted, in the page's reference counter.
4952 * The page_frag functions below provide a simple allocation framework for
4953 * page fragments. This is used by the network stack and network device
4954 * drivers to provide a backing region of memory for use as either an
4955 * sk_buff->head, or to be used in the "frags" portion of skb_shared_info.
4957 static struct page *__page_frag_cache_refill(struct page_frag_cache *nc,
4960 struct page *page = NULL;
4961 gfp_t gfp = gfp_mask;
4963 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
4964 gfp_mask |= __GFP_COMP | __GFP_NOWARN | __GFP_NORETRY |
4966 page = alloc_pages_node(NUMA_NO_NODE, gfp_mask,
4967 PAGE_FRAG_CACHE_MAX_ORDER);
4968 nc->size = page ? PAGE_FRAG_CACHE_MAX_SIZE : PAGE_SIZE;
4970 if (unlikely(!page))
4971 page = alloc_pages_node(NUMA_NO_NODE, gfp, 0);
4973 nc->va = page ? page_address(page) : NULL;
4978 void __page_frag_cache_drain(struct page *page, unsigned int count)
4980 VM_BUG_ON_PAGE(page_ref_count(page) == 0, page);
4982 if (page_ref_sub_and_test(page, count))
4983 free_the_page(page, compound_order(page));
4985 EXPORT_SYMBOL(__page_frag_cache_drain);
4987 void *page_frag_alloc(struct page_frag_cache *nc,
4988 unsigned int fragsz, gfp_t gfp_mask)
4990 unsigned int size = PAGE_SIZE;
4994 if (unlikely(!nc->va)) {
4996 page = __page_frag_cache_refill(nc, gfp_mask);
5000 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
5001 /* if size can vary use size else just use PAGE_SIZE */
5004 /* Even if we own the page, we do not use atomic_set().
5005 * This would break get_page_unless_zero() users.
5007 page_ref_add(page, PAGE_FRAG_CACHE_MAX_SIZE);
5009 /* reset page count bias and offset to start of new frag */
5010 nc->pfmemalloc = page_is_pfmemalloc(page);
5011 nc->pagecnt_bias = PAGE_FRAG_CACHE_MAX_SIZE + 1;
5015 offset = nc->offset - fragsz;
5016 if (unlikely(offset < 0)) {
5017 page = virt_to_page(nc->va);
5019 if (!page_ref_sub_and_test(page, nc->pagecnt_bias))
5022 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
5023 /* if size can vary use size else just use PAGE_SIZE */
5026 /* OK, page count is 0, we can safely set it */
5027 set_page_count(page, PAGE_FRAG_CACHE_MAX_SIZE + 1);
5029 /* reset page count bias and offset to start of new frag */
5030 nc->pagecnt_bias = PAGE_FRAG_CACHE_MAX_SIZE + 1;
5031 offset = size - fragsz;
5035 nc->offset = offset;
5037 return nc->va + offset;
5039 EXPORT_SYMBOL(page_frag_alloc);
5042 * Frees a page fragment allocated out of either a compound or order 0 page.
5044 void page_frag_free(void *addr)
5046 struct page *page = virt_to_head_page(addr);
5048 if (unlikely(put_page_testzero(page)))
5049 free_the_page(page, compound_order(page));
5051 EXPORT_SYMBOL(page_frag_free);
5053 static void *make_alloc_exact(unsigned long addr, unsigned int order,
5057 unsigned long alloc_end = addr + (PAGE_SIZE << order);
5058 unsigned long used = addr + PAGE_ALIGN(size);
5060 split_page(virt_to_page((void *)addr), order);
5061 while (used < alloc_end) {
5066 return (void *)addr;
5070 * alloc_pages_exact - allocate an exact number physically-contiguous pages.
5071 * @size: the number of bytes to allocate
5072 * @gfp_mask: GFP flags for the allocation, must not contain __GFP_COMP
5074 * This function is similar to alloc_pages(), except that it allocates the
5075 * minimum number of pages to satisfy the request. alloc_pages() can only
5076 * allocate memory in power-of-two pages.
5078 * This function is also limited by MAX_ORDER.
5080 * Memory allocated by this function must be released by free_pages_exact().
5082 * Return: pointer to the allocated area or %NULL in case of error.
5084 void *alloc_pages_exact(size_t size, gfp_t gfp_mask)
5086 unsigned int order = get_order(size);
5089 if (WARN_ON_ONCE(gfp_mask & __GFP_COMP))
5090 gfp_mask &= ~__GFP_COMP;
5092 addr = __get_free_pages(gfp_mask, order);
5093 return make_alloc_exact(addr, order, size);
5095 EXPORT_SYMBOL(alloc_pages_exact);
5098 * alloc_pages_exact_nid - allocate an exact number of physically-contiguous
5100 * @nid: the preferred node ID where memory should be allocated
5101 * @size: the number of bytes to allocate
5102 * @gfp_mask: GFP flags for the allocation, must not contain __GFP_COMP
5104 * Like alloc_pages_exact(), but try to allocate on node nid first before falling
5107 * Return: pointer to the allocated area or %NULL in case of error.
5109 void * __meminit alloc_pages_exact_nid(int nid, size_t size, gfp_t gfp_mask)
5111 unsigned int order = get_order(size);
5114 if (WARN_ON_ONCE(gfp_mask & __GFP_COMP))
5115 gfp_mask &= ~__GFP_COMP;
5117 p = alloc_pages_node(nid, gfp_mask, order);
5120 return make_alloc_exact((unsigned long)page_address(p), order, size);
5124 * free_pages_exact - release memory allocated via alloc_pages_exact()
5125 * @virt: the value returned by alloc_pages_exact.
5126 * @size: size of allocation, same value as passed to alloc_pages_exact().
5128 * Release the memory allocated by a previous call to alloc_pages_exact.
5130 void free_pages_exact(void *virt, size_t size)
5132 unsigned long addr = (unsigned long)virt;
5133 unsigned long end = addr + PAGE_ALIGN(size);
5135 while (addr < end) {
5140 EXPORT_SYMBOL(free_pages_exact);
5143 * nr_free_zone_pages - count number of pages beyond high watermark
5144 * @offset: The zone index of the highest zone
5146 * nr_free_zone_pages() counts the number of pages which are beyond the
5147 * high watermark within all zones at or below a given zone index. For each
5148 * zone, the number of pages is calculated as:
5150 * nr_free_zone_pages = managed_pages - high_pages
5152 * Return: number of pages beyond high watermark.
5154 static unsigned long nr_free_zone_pages(int offset)
5159 /* Just pick one node, since fallback list is circular */
5160 unsigned long sum = 0;
5162 struct zonelist *zonelist = node_zonelist(numa_node_id(), GFP_KERNEL);
5164 for_each_zone_zonelist(zone, z, zonelist, offset) {
5165 unsigned long size = zone_managed_pages(zone);
5166 unsigned long high = high_wmark_pages(zone);
5175 * nr_free_buffer_pages - count number of pages beyond high watermark
5177 * nr_free_buffer_pages() counts the number of pages which are beyond the high
5178 * watermark within ZONE_DMA and ZONE_NORMAL.
5180 * Return: number of pages beyond high watermark within ZONE_DMA and
5183 unsigned long nr_free_buffer_pages(void)
5185 return nr_free_zone_pages(gfp_zone(GFP_USER));
5187 EXPORT_SYMBOL_GPL(nr_free_buffer_pages);
5190 * nr_free_pagecache_pages - count number of pages beyond high watermark
5192 * nr_free_pagecache_pages() counts the number of pages which are beyond the
5193 * high watermark within all zones.
5195 * Return: number of pages beyond high watermark within all zones.
5197 unsigned long nr_free_pagecache_pages(void)
5199 return nr_free_zone_pages(gfp_zone(GFP_HIGHUSER_MOVABLE));
5202 static inline void show_node(struct zone *zone)
5204 if (IS_ENABLED(CONFIG_NUMA))
5205 printk("Node %d ", zone_to_nid(zone));
5208 long si_mem_available(void)
5211 unsigned long pagecache;
5212 unsigned long wmark_low = 0;
5213 unsigned long pages[NR_LRU_LISTS];
5214 unsigned long reclaimable;
5218 for (lru = LRU_BASE; lru < NR_LRU_LISTS; lru++)
5219 pages[lru] = global_node_page_state(NR_LRU_BASE + lru);
5222 wmark_low += low_wmark_pages(zone);
5225 * Estimate the amount of memory available for userspace allocations,
5226 * without causing swapping.
5228 available = global_zone_page_state(NR_FREE_PAGES) - totalreserve_pages;
5231 * Not all the page cache can be freed, otherwise the system will
5232 * start swapping. Assume at least half of the page cache, or the
5233 * low watermark worth of cache, needs to stay.
5235 pagecache = pages[LRU_ACTIVE_FILE] + pages[LRU_INACTIVE_FILE];
5236 pagecache -= min(pagecache / 2, wmark_low);
5237 available += pagecache;
5240 * Part of the reclaimable slab and other kernel memory consists of
5241 * items that are in use, and cannot be freed. Cap this estimate at the
5244 reclaimable = global_node_page_state_pages(NR_SLAB_RECLAIMABLE_B) +
5245 global_node_page_state(NR_KERNEL_MISC_RECLAIMABLE);
5246 available += reclaimable - min(reclaimable / 2, wmark_low);
5252 EXPORT_SYMBOL_GPL(si_mem_available);
5254 void si_meminfo(struct sysinfo *val)
5256 val->totalram = totalram_pages();
5257 val->sharedram = global_node_page_state(NR_SHMEM);
5258 val->freeram = global_zone_page_state(NR_FREE_PAGES);
5259 val->bufferram = nr_blockdev_pages();
5260 val->totalhigh = totalhigh_pages();
5261 val->freehigh = nr_free_highpages();
5262 val->mem_unit = PAGE_SIZE;
5265 EXPORT_SYMBOL(si_meminfo);
5268 void si_meminfo_node(struct sysinfo *val, int nid)
5270 int zone_type; /* needs to be signed */
5271 unsigned long managed_pages = 0;
5272 unsigned long managed_highpages = 0;
5273 unsigned long free_highpages = 0;
5274 pg_data_t *pgdat = NODE_DATA(nid);
5276 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++)
5277 managed_pages += zone_managed_pages(&pgdat->node_zones[zone_type]);
5278 val->totalram = managed_pages;
5279 val->sharedram = node_page_state(pgdat, NR_SHMEM);
5280 val->freeram = sum_zone_node_page_state(nid, NR_FREE_PAGES);
5281 #ifdef CONFIG_HIGHMEM
5282 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++) {
5283 struct zone *zone = &pgdat->node_zones[zone_type];
5285 if (is_highmem(zone)) {
5286 managed_highpages += zone_managed_pages(zone);
5287 free_highpages += zone_page_state(zone, NR_FREE_PAGES);
5290 val->totalhigh = managed_highpages;
5291 val->freehigh = free_highpages;
5293 val->totalhigh = managed_highpages;
5294 val->freehigh = free_highpages;
5296 val->mem_unit = PAGE_SIZE;
5301 * Determine whether the node should be displayed or not, depending on whether
5302 * SHOW_MEM_FILTER_NODES was passed to show_free_areas().
5304 static bool show_mem_node_skip(unsigned int flags, int nid, nodemask_t *nodemask)
5306 if (!(flags & SHOW_MEM_FILTER_NODES))
5310 * no node mask - aka implicit memory numa policy. Do not bother with
5311 * the synchronization - read_mems_allowed_begin - because we do not
5312 * have to be precise here.
5315 nodemask = &cpuset_current_mems_allowed;
5317 return !node_isset(nid, *nodemask);
5320 #define K(x) ((x) << (PAGE_SHIFT-10))
5322 static void show_migration_types(unsigned char type)
5324 static const char types[MIGRATE_TYPES] = {
5325 [MIGRATE_UNMOVABLE] = 'U',
5326 [MIGRATE_MOVABLE] = 'M',
5327 [MIGRATE_RECLAIMABLE] = 'E',
5328 [MIGRATE_HIGHATOMIC] = 'H',
5330 [MIGRATE_CMA] = 'C',
5332 #ifdef CONFIG_MEMORY_ISOLATION
5333 [MIGRATE_ISOLATE] = 'I',
5336 char tmp[MIGRATE_TYPES + 1];
5340 for (i = 0; i < MIGRATE_TYPES; i++) {
5341 if (type & (1 << i))
5346 printk(KERN_CONT "(%s) ", tmp);
5350 * Show free area list (used inside shift_scroll-lock stuff)
5351 * We also calculate the percentage fragmentation. We do this by counting the
5352 * memory on each free list with the exception of the first item on the list.
5355 * SHOW_MEM_FILTER_NODES: suppress nodes that are not allowed by current's
5358 void show_free_areas(unsigned int filter, nodemask_t *nodemask)
5360 unsigned long free_pcp = 0;
5365 for_each_populated_zone(zone) {
5366 if (show_mem_node_skip(filter, zone_to_nid(zone), nodemask))
5369 for_each_online_cpu(cpu)
5370 free_pcp += per_cpu_ptr(zone->pageset, cpu)->pcp.count;
5373 printk("active_anon:%lu inactive_anon:%lu isolated_anon:%lu\n"
5374 " active_file:%lu inactive_file:%lu isolated_file:%lu\n"
5375 " unevictable:%lu dirty:%lu writeback:%lu\n"
5376 " slab_reclaimable:%lu slab_unreclaimable:%lu\n"
5377 " mapped:%lu shmem:%lu pagetables:%lu bounce:%lu\n"
5378 " free:%lu free_pcp:%lu free_cma:%lu\n",
5379 global_node_page_state(NR_ACTIVE_ANON),
5380 global_node_page_state(NR_INACTIVE_ANON),
5381 global_node_page_state(NR_ISOLATED_ANON),
5382 global_node_page_state(NR_ACTIVE_FILE),
5383 global_node_page_state(NR_INACTIVE_FILE),
5384 global_node_page_state(NR_ISOLATED_FILE),
5385 global_node_page_state(NR_UNEVICTABLE),
5386 global_node_page_state(NR_FILE_DIRTY),
5387 global_node_page_state(NR_WRITEBACK),
5388 global_node_page_state_pages(NR_SLAB_RECLAIMABLE_B),
5389 global_node_page_state_pages(NR_SLAB_UNRECLAIMABLE_B),
5390 global_node_page_state(NR_FILE_MAPPED),
5391 global_node_page_state(NR_SHMEM),
5392 global_zone_page_state(NR_PAGETABLE),
5393 global_zone_page_state(NR_BOUNCE),
5394 global_zone_page_state(NR_FREE_PAGES),
5396 global_zone_page_state(NR_FREE_CMA_PAGES));
5398 for_each_online_pgdat(pgdat) {
5399 if (show_mem_node_skip(filter, pgdat->node_id, nodemask))
5403 " active_anon:%lukB"
5404 " inactive_anon:%lukB"
5405 " active_file:%lukB"
5406 " inactive_file:%lukB"
5407 " unevictable:%lukB"
5408 " isolated(anon):%lukB"
5409 " isolated(file):%lukB"
5414 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
5416 " shmem_pmdmapped: %lukB"
5419 " writeback_tmp:%lukB"
5420 " kernel_stack:%lukB"
5421 #ifdef CONFIG_SHADOW_CALL_STACK
5422 " shadow_call_stack:%lukB"
5424 " all_unreclaimable? %s"
5427 K(node_page_state(pgdat, NR_ACTIVE_ANON)),
5428 K(node_page_state(pgdat, NR_INACTIVE_ANON)),
5429 K(node_page_state(pgdat, NR_ACTIVE_FILE)),
5430 K(node_page_state(pgdat, NR_INACTIVE_FILE)),
5431 K(node_page_state(pgdat, NR_UNEVICTABLE)),
5432 K(node_page_state(pgdat, NR_ISOLATED_ANON)),
5433 K(node_page_state(pgdat, NR_ISOLATED_FILE)),
5434 K(node_page_state(pgdat, NR_FILE_MAPPED)),
5435 K(node_page_state(pgdat, NR_FILE_DIRTY)),
5436 K(node_page_state(pgdat, NR_WRITEBACK)),
5437 K(node_page_state(pgdat, NR_SHMEM)),
5438 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
5439 K(node_page_state(pgdat, NR_SHMEM_THPS) * HPAGE_PMD_NR),
5440 K(node_page_state(pgdat, NR_SHMEM_PMDMAPPED)
5442 K(node_page_state(pgdat, NR_ANON_THPS) * HPAGE_PMD_NR),
5444 K(node_page_state(pgdat, NR_WRITEBACK_TEMP)),
5445 node_page_state(pgdat, NR_KERNEL_STACK_KB),
5446 #ifdef CONFIG_SHADOW_CALL_STACK
5447 node_page_state(pgdat, NR_KERNEL_SCS_KB),
5449 pgdat->kswapd_failures >= MAX_RECLAIM_RETRIES ?
5453 for_each_populated_zone(zone) {
5456 if (show_mem_node_skip(filter, zone_to_nid(zone), nodemask))
5460 for_each_online_cpu(cpu)
5461 free_pcp += per_cpu_ptr(zone->pageset, cpu)->pcp.count;
5470 " reserved_highatomic:%luKB"
5471 " active_anon:%lukB"
5472 " inactive_anon:%lukB"
5473 " active_file:%lukB"
5474 " inactive_file:%lukB"
5475 " unevictable:%lukB"
5476 " writepending:%lukB"
5487 K(zone_page_state(zone, NR_FREE_PAGES)),
5488 K(min_wmark_pages(zone)),
5489 K(low_wmark_pages(zone)),
5490 K(high_wmark_pages(zone)),
5491 K(zone->nr_reserved_highatomic),
5492 K(zone_page_state(zone, NR_ZONE_ACTIVE_ANON)),
5493 K(zone_page_state(zone, NR_ZONE_INACTIVE_ANON)),
5494 K(zone_page_state(zone, NR_ZONE_ACTIVE_FILE)),
5495 K(zone_page_state(zone, NR_ZONE_INACTIVE_FILE)),
5496 K(zone_page_state(zone, NR_ZONE_UNEVICTABLE)),
5497 K(zone_page_state(zone, NR_ZONE_WRITE_PENDING)),
5498 K(zone->present_pages),
5499 K(zone_managed_pages(zone)),
5500 K(zone_page_state(zone, NR_MLOCK)),
5501 K(zone_page_state(zone, NR_PAGETABLE)),
5502 K(zone_page_state(zone, NR_BOUNCE)),
5504 K(this_cpu_read(zone->pageset->pcp.count)),
5505 K(zone_page_state(zone, NR_FREE_CMA_PAGES)));
5506 printk("lowmem_reserve[]:");
5507 for (i = 0; i < MAX_NR_ZONES; i++)
5508 printk(KERN_CONT " %ld", zone->lowmem_reserve[i]);
5509 printk(KERN_CONT "\n");
5512 for_each_populated_zone(zone) {
5514 unsigned long nr[MAX_ORDER], flags, total = 0;
5515 unsigned char types[MAX_ORDER];
5517 if (show_mem_node_skip(filter, zone_to_nid(zone), nodemask))
5520 printk(KERN_CONT "%s: ", zone->name);
5522 spin_lock_irqsave(&zone->lock, flags);
5523 for (order = 0; order < MAX_ORDER; order++) {
5524 struct free_area *area = &zone->free_area[order];
5527 nr[order] = area->nr_free;
5528 total += nr[order] << order;
5531 for (type = 0; type < MIGRATE_TYPES; type++) {
5532 if (!free_area_empty(area, type))
5533 types[order] |= 1 << type;
5536 spin_unlock_irqrestore(&zone->lock, flags);
5537 for (order = 0; order < MAX_ORDER; order++) {
5538 printk(KERN_CONT "%lu*%lukB ",
5539 nr[order], K(1UL) << order);
5541 show_migration_types(types[order]);
5543 printk(KERN_CONT "= %lukB\n", K(total));
5546 hugetlb_show_meminfo();
5548 printk("%ld total pagecache pages\n", global_node_page_state(NR_FILE_PAGES));
5550 show_swap_cache_info();
5553 static void zoneref_set_zone(struct zone *zone, struct zoneref *zoneref)
5555 zoneref->zone = zone;
5556 zoneref->zone_idx = zone_idx(zone);
5560 * Builds allocation fallback zone lists.
5562 * Add all populated zones of a node to the zonelist.
5564 static int build_zonerefs_node(pg_data_t *pgdat, struct zoneref *zonerefs)
5567 enum zone_type zone_type = MAX_NR_ZONES;
5572 zone = pgdat->node_zones + zone_type;
5573 if (managed_zone(zone)) {
5574 zoneref_set_zone(zone, &zonerefs[nr_zones++]);
5575 check_highest_zone(zone_type);
5577 } while (zone_type);
5584 static int __parse_numa_zonelist_order(char *s)
5587 * We used to support different zonlists modes but they turned
5588 * out to be just not useful. Let's keep the warning in place
5589 * if somebody still use the cmd line parameter so that we do
5590 * not fail it silently
5592 if (!(*s == 'd' || *s == 'D' || *s == 'n' || *s == 'N')) {
5593 pr_warn("Ignoring unsupported numa_zonelist_order value: %s\n", s);
5599 char numa_zonelist_order[] = "Node";
5602 * sysctl handler for numa_zonelist_order
5604 int numa_zonelist_order_handler(struct ctl_table *table, int write,
5605 void *buffer, size_t *length, loff_t *ppos)
5608 return __parse_numa_zonelist_order(buffer);
5609 return proc_dostring(table, write, buffer, length, ppos);
5613 #define MAX_NODE_LOAD (nr_online_nodes)
5614 static int node_load[MAX_NUMNODES];
5617 * find_next_best_node - find the next node that should appear in a given node's fallback list
5618 * @node: node whose fallback list we're appending
5619 * @used_node_mask: nodemask_t of already used nodes
5621 * We use a number of factors to determine which is the next node that should
5622 * appear on a given node's fallback list. The node should not have appeared
5623 * already in @node's fallback list, and it should be the next closest node
5624 * according to the distance array (which contains arbitrary distance values
5625 * from each node to each node in the system), and should also prefer nodes
5626 * with no CPUs, since presumably they'll have very little allocation pressure
5627 * on them otherwise.
5629 * Return: node id of the found node or %NUMA_NO_NODE if no node is found.
5631 static int find_next_best_node(int node, nodemask_t *used_node_mask)
5634 int min_val = INT_MAX;
5635 int best_node = NUMA_NO_NODE;
5636 const struct cpumask *tmp = cpumask_of_node(0);
5638 /* Use the local node if we haven't already */
5639 if (!node_isset(node, *used_node_mask)) {
5640 node_set(node, *used_node_mask);
5644 for_each_node_state(n, N_MEMORY) {
5646 /* Don't want a node to appear more than once */
5647 if (node_isset(n, *used_node_mask))
5650 /* Use the distance array to find the distance */
5651 val = node_distance(node, n);
5653 /* Penalize nodes under us ("prefer the next node") */
5656 /* Give preference to headless and unused nodes */
5657 tmp = cpumask_of_node(n);
5658 if (!cpumask_empty(tmp))
5659 val += PENALTY_FOR_NODE_WITH_CPUS;
5661 /* Slight preference for less loaded node */
5662 val *= (MAX_NODE_LOAD*MAX_NUMNODES);
5663 val += node_load[n];
5665 if (val < min_val) {
5672 node_set(best_node, *used_node_mask);
5679 * Build zonelists ordered by node and zones within node.
5680 * This results in maximum locality--normal zone overflows into local
5681 * DMA zone, if any--but risks exhausting DMA zone.
5683 static void build_zonelists_in_node_order(pg_data_t *pgdat, int *node_order,
5686 struct zoneref *zonerefs;
5689 zonerefs = pgdat->node_zonelists[ZONELIST_FALLBACK]._zonerefs;
5691 for (i = 0; i < nr_nodes; i++) {
5694 pg_data_t *node = NODE_DATA(node_order[i]);
5696 nr_zones = build_zonerefs_node(node, zonerefs);
5697 zonerefs += nr_zones;
5699 zonerefs->zone = NULL;
5700 zonerefs->zone_idx = 0;
5704 * Build gfp_thisnode zonelists
5706 static void build_thisnode_zonelists(pg_data_t *pgdat)
5708 struct zoneref *zonerefs;
5711 zonerefs = pgdat->node_zonelists[ZONELIST_NOFALLBACK]._zonerefs;
5712 nr_zones = build_zonerefs_node(pgdat, zonerefs);
5713 zonerefs += nr_zones;
5714 zonerefs->zone = NULL;
5715 zonerefs->zone_idx = 0;
5719 * Build zonelists ordered by zone and nodes within zones.
5720 * This results in conserving DMA zone[s] until all Normal memory is
5721 * exhausted, but results in overflowing to remote node while memory
5722 * may still exist in local DMA zone.
5725 static void build_zonelists(pg_data_t *pgdat)
5727 static int node_order[MAX_NUMNODES];
5728 int node, load, nr_nodes = 0;
5729 nodemask_t used_mask = NODE_MASK_NONE;
5730 int local_node, prev_node;
5732 /* NUMA-aware ordering of nodes */
5733 local_node = pgdat->node_id;
5734 load = nr_online_nodes;
5735 prev_node = local_node;
5737 memset(node_order, 0, sizeof(node_order));
5738 while ((node = find_next_best_node(local_node, &used_mask)) >= 0) {
5740 * We don't want to pressure a particular node.
5741 * So adding penalty to the first node in same
5742 * distance group to make it round-robin.
5744 if (node_distance(local_node, node) !=
5745 node_distance(local_node, prev_node))
5746 node_load[node] = load;
5748 node_order[nr_nodes++] = node;
5753 build_zonelists_in_node_order(pgdat, node_order, nr_nodes);
5754 build_thisnode_zonelists(pgdat);
5757 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
5759 * Return node id of node used for "local" allocations.
5760 * I.e., first node id of first zone in arg node's generic zonelist.
5761 * Used for initializing percpu 'numa_mem', which is used primarily
5762 * for kernel allocations, so use GFP_KERNEL flags to locate zonelist.
5764 int local_memory_node(int node)
5768 z = first_zones_zonelist(node_zonelist(node, GFP_KERNEL),
5769 gfp_zone(GFP_KERNEL),
5771 return zone_to_nid(z->zone);
5775 static void setup_min_unmapped_ratio(void);
5776 static void setup_min_slab_ratio(void);
5777 #else /* CONFIG_NUMA */
5779 static void build_zonelists(pg_data_t *pgdat)
5781 int node, local_node;
5782 struct zoneref *zonerefs;
5785 local_node = pgdat->node_id;
5787 zonerefs = pgdat->node_zonelists[ZONELIST_FALLBACK]._zonerefs;
5788 nr_zones = build_zonerefs_node(pgdat, zonerefs);
5789 zonerefs += nr_zones;
5792 * Now we build the zonelist so that it contains the zones
5793 * of all the other nodes.
5794 * We don't want to pressure a particular node, so when
5795 * building the zones for node N, we make sure that the
5796 * zones coming right after the local ones are those from
5797 * node N+1 (modulo N)
5799 for (node = local_node + 1; node < MAX_NUMNODES; node++) {
5800 if (!node_online(node))
5802 nr_zones = build_zonerefs_node(NODE_DATA(node), zonerefs);
5803 zonerefs += nr_zones;
5805 for (node = 0; node < local_node; node++) {
5806 if (!node_online(node))
5808 nr_zones = build_zonerefs_node(NODE_DATA(node), zonerefs);
5809 zonerefs += nr_zones;
5812 zonerefs->zone = NULL;
5813 zonerefs->zone_idx = 0;
5816 #endif /* CONFIG_NUMA */
5819 * Boot pageset table. One per cpu which is going to be used for all
5820 * zones and all nodes. The parameters will be set in such a way
5821 * that an item put on a list will immediately be handed over to
5822 * the buddy list. This is safe since pageset manipulation is done
5823 * with interrupts disabled.
5825 * The boot_pagesets must be kept even after bootup is complete for
5826 * unused processors and/or zones. They do play a role for bootstrapping
5827 * hotplugged processors.
5829 * zoneinfo_show() and maybe other functions do
5830 * not check if the processor is online before following the pageset pointer.
5831 * Other parts of the kernel may not check if the zone is available.
5833 static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch);
5834 static DEFINE_PER_CPU(struct per_cpu_pageset, boot_pageset);
5835 static DEFINE_PER_CPU(struct per_cpu_nodestat, boot_nodestats);
5837 static void __build_all_zonelists(void *data)
5840 int __maybe_unused cpu;
5841 pg_data_t *self = data;
5842 static DEFINE_SPINLOCK(lock);
5847 memset(node_load, 0, sizeof(node_load));
5851 * This node is hotadded and no memory is yet present. So just
5852 * building zonelists is fine - no need to touch other nodes.
5854 if (self && !node_online(self->node_id)) {
5855 build_zonelists(self);
5857 for_each_online_node(nid) {
5858 pg_data_t *pgdat = NODE_DATA(nid);
5860 build_zonelists(pgdat);
5863 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
5865 * We now know the "local memory node" for each node--
5866 * i.e., the node of the first zone in the generic zonelist.
5867 * Set up numa_mem percpu variable for on-line cpus. During
5868 * boot, only the boot cpu should be on-line; we'll init the
5869 * secondary cpus' numa_mem as they come on-line. During
5870 * node/memory hotplug, we'll fixup all on-line cpus.
5872 for_each_online_cpu(cpu)
5873 set_cpu_numa_mem(cpu, local_memory_node(cpu_to_node(cpu)));
5880 static noinline void __init
5881 build_all_zonelists_init(void)
5885 __build_all_zonelists(NULL);
5888 * Initialize the boot_pagesets that are going to be used
5889 * for bootstrapping processors. The real pagesets for
5890 * each zone will be allocated later when the per cpu
5891 * allocator is available.
5893 * boot_pagesets are used also for bootstrapping offline
5894 * cpus if the system is already booted because the pagesets
5895 * are needed to initialize allocators on a specific cpu too.
5896 * F.e. the percpu allocator needs the page allocator which
5897 * needs the percpu allocator in order to allocate its pagesets
5898 * (a chicken-egg dilemma).
5900 for_each_possible_cpu(cpu)
5901 setup_pageset(&per_cpu(boot_pageset, cpu), 0);
5903 mminit_verify_zonelist();
5904 cpuset_init_current_mems_allowed();
5908 * unless system_state == SYSTEM_BOOTING.
5910 * __ref due to call of __init annotated helper build_all_zonelists_init
5911 * [protected by SYSTEM_BOOTING].
5913 void __ref build_all_zonelists(pg_data_t *pgdat)
5915 unsigned long vm_total_pages;
5917 if (system_state == SYSTEM_BOOTING) {
5918 build_all_zonelists_init();
5920 __build_all_zonelists(pgdat);
5921 /* cpuset refresh routine should be here */
5923 vm_total_pages = nr_free_pagecache_pages();
5925 * Disable grouping by mobility if the number of pages in the
5926 * system is too low to allow the mechanism to work. It would be
5927 * more accurate, but expensive to check per-zone. This check is
5928 * made on memory-hotadd so a system can start with mobility
5929 * disabled and enable it later
5931 if (vm_total_pages < (pageblock_nr_pages * MIGRATE_TYPES))
5932 page_group_by_mobility_disabled = 1;
5934 page_group_by_mobility_disabled = 0;
5936 pr_info("Built %u zonelists, mobility grouping %s. Total pages: %ld\n",
5938 page_group_by_mobility_disabled ? "off" : "on",
5941 pr_info("Policy zone: %s\n", zone_names[policy_zone]);
5945 /* If zone is ZONE_MOVABLE but memory is mirrored, it is an overlapped init */
5946 static bool __meminit
5947 overlap_memmap_init(unsigned long zone, unsigned long *pfn)
5949 static struct memblock_region *r;
5951 if (mirrored_kernelcore && zone == ZONE_MOVABLE) {
5952 if (!r || *pfn >= memblock_region_memory_end_pfn(r)) {
5953 for_each_memblock(memory, r) {
5954 if (*pfn < memblock_region_memory_end_pfn(r))
5958 if (*pfn >= memblock_region_memory_base_pfn(r) &&
5959 memblock_is_mirror(r)) {
5960 *pfn = memblock_region_memory_end_pfn(r);
5968 * Initially all pages are reserved - free ones are freed
5969 * up by memblock_free_all() once the early boot process is
5970 * done. Non-atomic initialization, single-pass.
5972 void __meminit memmap_init_zone(unsigned long size, int nid, unsigned long zone,
5973 unsigned long start_pfn, enum memmap_context context,
5974 struct vmem_altmap *altmap)
5976 unsigned long pfn, end_pfn = start_pfn + size;
5979 if (highest_memmap_pfn < end_pfn - 1)
5980 highest_memmap_pfn = end_pfn - 1;
5982 #ifdef CONFIG_ZONE_DEVICE
5984 * Honor reservation requested by the driver for this ZONE_DEVICE
5985 * memory. We limit the total number of pages to initialize to just
5986 * those that might contain the memory mapping. We will defer the
5987 * ZONE_DEVICE page initialization until after we have released
5990 if (zone == ZONE_DEVICE) {
5994 if (start_pfn == altmap->base_pfn)
5995 start_pfn += altmap->reserve;
5996 end_pfn = altmap->base_pfn + vmem_altmap_offset(altmap);
6000 for (pfn = start_pfn; pfn < end_pfn; ) {
6002 * There can be holes in boot-time mem_map[]s handed to this
6003 * function. They do not exist on hotplugged memory.
6005 if (context == MEMMAP_EARLY) {
6006 if (overlap_memmap_init(zone, &pfn))
6008 if (defer_init(nid, pfn, end_pfn))
6012 page = pfn_to_page(pfn);
6013 __init_single_page(page, pfn, zone, nid);
6014 if (context == MEMMAP_HOTPLUG)
6015 __SetPageReserved(page);
6018 * Mark the block movable so that blocks are reserved for
6019 * movable at startup. This will force kernel allocations
6020 * to reserve their blocks rather than leaking throughout
6021 * the address space during boot when many long-lived
6022 * kernel allocations are made.
6024 * bitmap is created for zone's valid pfn range. but memmap
6025 * can be created for invalid pages (for alignment)
6026 * check here not to call set_pageblock_migratetype() against
6029 if (!(pfn & (pageblock_nr_pages - 1))) {
6030 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
6037 #ifdef CONFIG_ZONE_DEVICE
6038 void __ref memmap_init_zone_device(struct zone *zone,
6039 unsigned long start_pfn,
6040 unsigned long nr_pages,
6041 struct dev_pagemap *pgmap)
6043 unsigned long pfn, end_pfn = start_pfn + nr_pages;
6044 struct pglist_data *pgdat = zone->zone_pgdat;
6045 struct vmem_altmap *altmap = pgmap_altmap(pgmap);
6046 unsigned long zone_idx = zone_idx(zone);
6047 unsigned long start = jiffies;
6048 int nid = pgdat->node_id;
6050 if (WARN_ON_ONCE(!pgmap || zone_idx(zone) != ZONE_DEVICE))
6054 * The call to memmap_init_zone should have already taken care
6055 * of the pages reserved for the memmap, so we can just jump to
6056 * the end of that region and start processing the device pages.
6059 start_pfn = altmap->base_pfn + vmem_altmap_offset(altmap);
6060 nr_pages = end_pfn - start_pfn;
6063 for (pfn = start_pfn; pfn < end_pfn; pfn++) {
6064 struct page *page = pfn_to_page(pfn);
6066 __init_single_page(page, pfn, zone_idx, nid);
6069 * Mark page reserved as it will need to wait for onlining
6070 * phase for it to be fully associated with a zone.
6072 * We can use the non-atomic __set_bit operation for setting
6073 * the flag as we are still initializing the pages.
6075 __SetPageReserved(page);
6078 * ZONE_DEVICE pages union ->lru with a ->pgmap back pointer
6079 * and zone_device_data. It is a bug if a ZONE_DEVICE page is
6080 * ever freed or placed on a driver-private list.
6082 page->pgmap = pgmap;
6083 page->zone_device_data = NULL;
6086 * Mark the block movable so that blocks are reserved for
6087 * movable at startup. This will force kernel allocations
6088 * to reserve their blocks rather than leaking throughout
6089 * the address space during boot when many long-lived
6090 * kernel allocations are made.
6092 * bitmap is created for zone's valid pfn range. but memmap
6093 * can be created for invalid pages (for alignment)
6094 * check here not to call set_pageblock_migratetype() against
6097 * Please note that MEMMAP_HOTPLUG path doesn't clear memmap
6098 * because this is done early in section_activate()
6100 if (!(pfn & (pageblock_nr_pages - 1))) {
6101 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
6106 pr_info("%s initialised %lu pages in %ums\n", __func__,
6107 nr_pages, jiffies_to_msecs(jiffies - start));
6111 static void __meminit zone_init_free_lists(struct zone *zone)
6113 unsigned int order, t;
6114 for_each_migratetype_order(order, t) {
6115 INIT_LIST_HEAD(&zone->free_area[order].free_list[t]);
6116 zone->free_area[order].nr_free = 0;
6120 void __meminit __weak memmap_init(unsigned long size, int nid,
6122 unsigned long range_start_pfn)
6124 unsigned long start_pfn, end_pfn;
6125 unsigned long range_end_pfn = range_start_pfn + size;
6128 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
6129 start_pfn = clamp(start_pfn, range_start_pfn, range_end_pfn);
6130 end_pfn = clamp(end_pfn, range_start_pfn, range_end_pfn);
6132 if (end_pfn > start_pfn) {
6133 size = end_pfn - start_pfn;
6134 memmap_init_zone(size, nid, zone, start_pfn,
6135 MEMMAP_EARLY, NULL);
6140 static int zone_batchsize(struct zone *zone)
6146 * The per-cpu-pages pools are set to around 1000th of the
6149 batch = zone_managed_pages(zone) / 1024;
6150 /* But no more than a meg. */
6151 if (batch * PAGE_SIZE > 1024 * 1024)
6152 batch = (1024 * 1024) / PAGE_SIZE;
6153 batch /= 4; /* We effectively *= 4 below */
6158 * Clamp the batch to a 2^n - 1 value. Having a power
6159 * of 2 value was found to be more likely to have
6160 * suboptimal cache aliasing properties in some cases.
6162 * For example if 2 tasks are alternately allocating
6163 * batches of pages, one task can end up with a lot
6164 * of pages of one half of the possible page colors
6165 * and the other with pages of the other colors.
6167 batch = rounddown_pow_of_two(batch + batch/2) - 1;
6172 /* The deferral and batching of frees should be suppressed under NOMMU
6175 * The problem is that NOMMU needs to be able to allocate large chunks
6176 * of contiguous memory as there's no hardware page translation to
6177 * assemble apparent contiguous memory from discontiguous pages.
6179 * Queueing large contiguous runs of pages for batching, however,
6180 * causes the pages to actually be freed in smaller chunks. As there
6181 * can be a significant delay between the individual batches being
6182 * recycled, this leads to the once large chunks of space being
6183 * fragmented and becoming unavailable for high-order allocations.
6190 * pcp->high and pcp->batch values are related and dependent on one another:
6191 * ->batch must never be higher then ->high.
6192 * The following function updates them in a safe manner without read side
6195 * Any new users of pcp->batch and pcp->high should ensure they can cope with
6196 * those fields changing asynchronously (acording the the above rule).
6198 * mutex_is_locked(&pcp_batch_high_lock) required when calling this function
6199 * outside of boot time (or some other assurance that no concurrent updaters
6202 static void pageset_update(struct per_cpu_pages *pcp, unsigned long high,
6203 unsigned long batch)
6205 /* start with a fail safe value for batch */
6209 /* Update high, then batch, in order */
6216 /* a companion to pageset_set_high() */
6217 static void pageset_set_batch(struct per_cpu_pageset *p, unsigned long batch)
6219 pageset_update(&p->pcp, 6 * batch, max(1UL, 1 * batch));
6222 static void pageset_init(struct per_cpu_pageset *p)
6224 struct per_cpu_pages *pcp;
6227 memset(p, 0, sizeof(*p));
6230 for (migratetype = 0; migratetype < MIGRATE_PCPTYPES; migratetype++)
6231 INIT_LIST_HEAD(&pcp->lists[migratetype]);
6234 static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch)
6237 pageset_set_batch(p, batch);
6241 * pageset_set_high() sets the high water mark for hot per_cpu_pagelist
6242 * to the value high for the pageset p.
6244 static void pageset_set_high(struct per_cpu_pageset *p,
6247 unsigned long batch = max(1UL, high / 4);
6248 if ((high / 4) > (PAGE_SHIFT * 8))
6249 batch = PAGE_SHIFT * 8;
6251 pageset_update(&p->pcp, high, batch);
6254 static void pageset_set_high_and_batch(struct zone *zone,
6255 struct per_cpu_pageset *pcp)
6257 if (percpu_pagelist_fraction)
6258 pageset_set_high(pcp,
6259 (zone_managed_pages(zone) /
6260 percpu_pagelist_fraction));
6262 pageset_set_batch(pcp, zone_batchsize(zone));
6265 static void __meminit zone_pageset_init(struct zone *zone, int cpu)
6267 struct per_cpu_pageset *pcp = per_cpu_ptr(zone->pageset, cpu);
6270 pageset_set_high_and_batch(zone, pcp);
6273 void __meminit setup_zone_pageset(struct zone *zone)
6276 zone->pageset = alloc_percpu(struct per_cpu_pageset);
6277 for_each_possible_cpu(cpu)
6278 zone_pageset_init(zone, cpu);
6282 * Allocate per cpu pagesets and initialize them.
6283 * Before this call only boot pagesets were available.
6285 void __init setup_per_cpu_pageset(void)
6287 struct pglist_data *pgdat;
6289 int __maybe_unused cpu;
6291 for_each_populated_zone(zone)
6292 setup_zone_pageset(zone);
6296 * Unpopulated zones continue using the boot pagesets.
6297 * The numa stats for these pagesets need to be reset.
6298 * Otherwise, they will end up skewing the stats of
6299 * the nodes these zones are associated with.
6301 for_each_possible_cpu(cpu) {
6302 struct per_cpu_pageset *pcp = &per_cpu(boot_pageset, cpu);
6303 memset(pcp->vm_numa_stat_diff, 0,
6304 sizeof(pcp->vm_numa_stat_diff));
6308 for_each_online_pgdat(pgdat)
6309 pgdat->per_cpu_nodestats =
6310 alloc_percpu(struct per_cpu_nodestat);
6313 static __meminit void zone_pcp_init(struct zone *zone)
6316 * per cpu subsystem is not up at this point. The following code
6317 * relies on the ability of the linker to provide the
6318 * offset of a (static) per cpu variable into the per cpu area.
6320 zone->pageset = &boot_pageset;
6322 if (populated_zone(zone))
6323 printk(KERN_DEBUG " %s zone: %lu pages, LIFO batch:%u\n",
6324 zone->name, zone->present_pages,
6325 zone_batchsize(zone));
6328 void __meminit init_currently_empty_zone(struct zone *zone,
6329 unsigned long zone_start_pfn,
6332 struct pglist_data *pgdat = zone->zone_pgdat;
6333 int zone_idx = zone_idx(zone) + 1;
6335 if (zone_idx > pgdat->nr_zones)
6336 pgdat->nr_zones = zone_idx;
6338 zone->zone_start_pfn = zone_start_pfn;
6340 mminit_dprintk(MMINIT_TRACE, "memmap_init",
6341 "Initialising map node %d zone %lu pfns %lu -> %lu\n",
6343 (unsigned long)zone_idx(zone),
6344 zone_start_pfn, (zone_start_pfn + size));
6346 zone_init_free_lists(zone);
6347 zone->initialized = 1;
6351 * get_pfn_range_for_nid - Return the start and end page frames for a node
6352 * @nid: The nid to return the range for. If MAX_NUMNODES, the min and max PFN are returned.
6353 * @start_pfn: Passed by reference. On return, it will have the node start_pfn.
6354 * @end_pfn: Passed by reference. On return, it will have the node end_pfn.
6356 * It returns the start and end page frame of a node based on information
6357 * provided by memblock_set_node(). If called for a node
6358 * with no available memory, a warning is printed and the start and end
6361 void __init get_pfn_range_for_nid(unsigned int nid,
6362 unsigned long *start_pfn, unsigned long *end_pfn)
6364 unsigned long this_start_pfn, this_end_pfn;
6370 for_each_mem_pfn_range(i, nid, &this_start_pfn, &this_end_pfn, NULL) {
6371 *start_pfn = min(*start_pfn, this_start_pfn);
6372 *end_pfn = max(*end_pfn, this_end_pfn);
6375 if (*start_pfn == -1UL)
6380 * This finds a zone that can be used for ZONE_MOVABLE pages. The
6381 * assumption is made that zones within a node are ordered in monotonic
6382 * increasing memory addresses so that the "highest" populated zone is used
6384 static void __init find_usable_zone_for_movable(void)
6387 for (zone_index = MAX_NR_ZONES - 1; zone_index >= 0; zone_index--) {
6388 if (zone_index == ZONE_MOVABLE)
6391 if (arch_zone_highest_possible_pfn[zone_index] >
6392 arch_zone_lowest_possible_pfn[zone_index])
6396 VM_BUG_ON(zone_index == -1);
6397 movable_zone = zone_index;
6401 * The zone ranges provided by the architecture do not include ZONE_MOVABLE
6402 * because it is sized independent of architecture. Unlike the other zones,
6403 * the starting point for ZONE_MOVABLE is not fixed. It may be different
6404 * in each node depending on the size of each node and how evenly kernelcore
6405 * is distributed. This helper function adjusts the zone ranges
6406 * provided by the architecture for a given node by using the end of the
6407 * highest usable zone for ZONE_MOVABLE. This preserves the assumption that
6408 * zones within a node are in order of monotonic increases memory addresses
6410 static void __init adjust_zone_range_for_zone_movable(int nid,
6411 unsigned long zone_type,
6412 unsigned long node_start_pfn,
6413 unsigned long node_end_pfn,
6414 unsigned long *zone_start_pfn,
6415 unsigned long *zone_end_pfn)
6417 /* Only adjust if ZONE_MOVABLE is on this node */
6418 if (zone_movable_pfn[nid]) {
6419 /* Size ZONE_MOVABLE */
6420 if (zone_type == ZONE_MOVABLE) {
6421 *zone_start_pfn = zone_movable_pfn[nid];
6422 *zone_end_pfn = min(node_end_pfn,
6423 arch_zone_highest_possible_pfn[movable_zone]);
6425 /* Adjust for ZONE_MOVABLE starting within this range */
6426 } else if (!mirrored_kernelcore &&
6427 *zone_start_pfn < zone_movable_pfn[nid] &&
6428 *zone_end_pfn > zone_movable_pfn[nid]) {
6429 *zone_end_pfn = zone_movable_pfn[nid];
6431 /* Check if this whole range is within ZONE_MOVABLE */
6432 } else if (*zone_start_pfn >= zone_movable_pfn[nid])
6433 *zone_start_pfn = *zone_end_pfn;
6438 * Return the number of pages a zone spans in a node, including holes
6439 * present_pages = zone_spanned_pages_in_node() - zone_absent_pages_in_node()
6441 static unsigned long __init zone_spanned_pages_in_node(int nid,
6442 unsigned long zone_type,
6443 unsigned long node_start_pfn,
6444 unsigned long node_end_pfn,
6445 unsigned long *zone_start_pfn,
6446 unsigned long *zone_end_pfn)
6448 unsigned long zone_low = arch_zone_lowest_possible_pfn[zone_type];
6449 unsigned long zone_high = arch_zone_highest_possible_pfn[zone_type];
6450 /* When hotadd a new node from cpu_up(), the node should be empty */
6451 if (!node_start_pfn && !node_end_pfn)
6454 /* Get the start and end of the zone */
6455 *zone_start_pfn = clamp(node_start_pfn, zone_low, zone_high);
6456 *zone_end_pfn = clamp(node_end_pfn, zone_low, zone_high);
6457 adjust_zone_range_for_zone_movable(nid, zone_type,
6458 node_start_pfn, node_end_pfn,
6459 zone_start_pfn, zone_end_pfn);
6461 /* Check that this node has pages within the zone's required range */
6462 if (*zone_end_pfn < node_start_pfn || *zone_start_pfn > node_end_pfn)
6465 /* Move the zone boundaries inside the node if necessary */
6466 *zone_end_pfn = min(*zone_end_pfn, node_end_pfn);
6467 *zone_start_pfn = max(*zone_start_pfn, node_start_pfn);
6469 /* Return the spanned pages */
6470 return *zone_end_pfn - *zone_start_pfn;
6474 * Return the number of holes in a range on a node. If nid is MAX_NUMNODES,
6475 * then all holes in the requested range will be accounted for.
6477 unsigned long __init __absent_pages_in_range(int nid,
6478 unsigned long range_start_pfn,
6479 unsigned long range_end_pfn)
6481 unsigned long nr_absent = range_end_pfn - range_start_pfn;
6482 unsigned long start_pfn, end_pfn;
6485 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
6486 start_pfn = clamp(start_pfn, range_start_pfn, range_end_pfn);
6487 end_pfn = clamp(end_pfn, range_start_pfn, range_end_pfn);
6488 nr_absent -= end_pfn - start_pfn;
6494 * absent_pages_in_range - Return number of page frames in holes within a range
6495 * @start_pfn: The start PFN to start searching for holes
6496 * @end_pfn: The end PFN to stop searching for holes
6498 * Return: the number of pages frames in memory holes within a range.
6500 unsigned long __init absent_pages_in_range(unsigned long start_pfn,
6501 unsigned long end_pfn)
6503 return __absent_pages_in_range(MAX_NUMNODES, start_pfn, end_pfn);
6506 /* Return the number of page frames in holes in a zone on a node */
6507 static unsigned long __init zone_absent_pages_in_node(int nid,
6508 unsigned long zone_type,
6509 unsigned long node_start_pfn,
6510 unsigned long node_end_pfn)
6512 unsigned long zone_low = arch_zone_lowest_possible_pfn[zone_type];
6513 unsigned long zone_high = arch_zone_highest_possible_pfn[zone_type];
6514 unsigned long zone_start_pfn, zone_end_pfn;
6515 unsigned long nr_absent;
6517 /* When hotadd a new node from cpu_up(), the node should be empty */
6518 if (!node_start_pfn && !node_end_pfn)
6521 zone_start_pfn = clamp(node_start_pfn, zone_low, zone_high);
6522 zone_end_pfn = clamp(node_end_pfn, zone_low, zone_high);
6524 adjust_zone_range_for_zone_movable(nid, zone_type,
6525 node_start_pfn, node_end_pfn,
6526 &zone_start_pfn, &zone_end_pfn);
6527 nr_absent = __absent_pages_in_range(nid, zone_start_pfn, zone_end_pfn);
6530 * ZONE_MOVABLE handling.
6531 * Treat pages to be ZONE_MOVABLE in ZONE_NORMAL as absent pages
6534 if (mirrored_kernelcore && zone_movable_pfn[nid]) {
6535 unsigned long start_pfn, end_pfn;
6536 struct memblock_region *r;
6538 for_each_memblock(memory, r) {
6539 start_pfn = clamp(memblock_region_memory_base_pfn(r),
6540 zone_start_pfn, zone_end_pfn);
6541 end_pfn = clamp(memblock_region_memory_end_pfn(r),
6542 zone_start_pfn, zone_end_pfn);
6544 if (zone_type == ZONE_MOVABLE &&
6545 memblock_is_mirror(r))
6546 nr_absent += end_pfn - start_pfn;
6548 if (zone_type == ZONE_NORMAL &&
6549 !memblock_is_mirror(r))
6550 nr_absent += end_pfn - start_pfn;
6557 static void __init calculate_node_totalpages(struct pglist_data *pgdat,
6558 unsigned long node_start_pfn,
6559 unsigned long node_end_pfn)
6561 unsigned long realtotalpages = 0, totalpages = 0;
6564 for (i = 0; i < MAX_NR_ZONES; i++) {
6565 struct zone *zone = pgdat->node_zones + i;
6566 unsigned long zone_start_pfn, zone_end_pfn;
6567 unsigned long spanned, absent;
6568 unsigned long size, real_size;
6570 spanned = zone_spanned_pages_in_node(pgdat->node_id, i,
6575 absent = zone_absent_pages_in_node(pgdat->node_id, i,
6580 real_size = size - absent;
6583 zone->zone_start_pfn = zone_start_pfn;
6585 zone->zone_start_pfn = 0;
6586 zone->spanned_pages = size;
6587 zone->present_pages = real_size;
6590 realtotalpages += real_size;
6593 pgdat->node_spanned_pages = totalpages;
6594 pgdat->node_present_pages = realtotalpages;
6595 printk(KERN_DEBUG "On node %d totalpages: %lu\n", pgdat->node_id,
6599 #ifndef CONFIG_SPARSEMEM
6601 * Calculate the size of the zone->blockflags rounded to an unsigned long
6602 * Start by making sure zonesize is a multiple of pageblock_order by rounding
6603 * up. Then use 1 NR_PAGEBLOCK_BITS worth of bits per pageblock, finally
6604 * round what is now in bits to nearest long in bits, then return it in
6607 static unsigned long __init usemap_size(unsigned long zone_start_pfn, unsigned long zonesize)
6609 unsigned long usemapsize;
6611 zonesize += zone_start_pfn & (pageblock_nr_pages-1);
6612 usemapsize = roundup(zonesize, pageblock_nr_pages);
6613 usemapsize = usemapsize >> pageblock_order;
6614 usemapsize *= NR_PAGEBLOCK_BITS;
6615 usemapsize = roundup(usemapsize, 8 * sizeof(unsigned long));
6617 return usemapsize / 8;
6620 static void __ref setup_usemap(struct pglist_data *pgdat,
6622 unsigned long zone_start_pfn,
6623 unsigned long zonesize)
6625 unsigned long usemapsize = usemap_size(zone_start_pfn, zonesize);
6626 zone->pageblock_flags = NULL;
6628 zone->pageblock_flags =
6629 memblock_alloc_node(usemapsize, SMP_CACHE_BYTES,
6631 if (!zone->pageblock_flags)
6632 panic("Failed to allocate %ld bytes for zone %s pageblock flags on node %d\n",
6633 usemapsize, zone->name, pgdat->node_id);
6637 static inline void setup_usemap(struct pglist_data *pgdat, struct zone *zone,
6638 unsigned long zone_start_pfn, unsigned long zonesize) {}
6639 #endif /* CONFIG_SPARSEMEM */
6641 #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
6643 /* Initialise the number of pages represented by NR_PAGEBLOCK_BITS */
6644 void __init set_pageblock_order(void)
6648 /* Check that pageblock_nr_pages has not already been setup */
6649 if (pageblock_order)
6652 if (HPAGE_SHIFT > PAGE_SHIFT)
6653 order = HUGETLB_PAGE_ORDER;
6655 order = MAX_ORDER - 1;
6658 * Assume the largest contiguous order of interest is a huge page.
6659 * This value may be variable depending on boot parameters on IA64 and
6662 pageblock_order = order;
6664 #else /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
6667 * When CONFIG_HUGETLB_PAGE_SIZE_VARIABLE is not set, set_pageblock_order()
6668 * is unused as pageblock_order is set at compile-time. See
6669 * include/linux/pageblock-flags.h for the values of pageblock_order based on
6672 void __init set_pageblock_order(void)
6676 #endif /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
6678 static unsigned long __init calc_memmap_size(unsigned long spanned_pages,
6679 unsigned long present_pages)
6681 unsigned long pages = spanned_pages;
6684 * Provide a more accurate estimation if there are holes within
6685 * the zone and SPARSEMEM is in use. If there are holes within the
6686 * zone, each populated memory region may cost us one or two extra
6687 * memmap pages due to alignment because memmap pages for each
6688 * populated regions may not be naturally aligned on page boundary.
6689 * So the (present_pages >> 4) heuristic is a tradeoff for that.
6691 if (spanned_pages > present_pages + (present_pages >> 4) &&
6692 IS_ENABLED(CONFIG_SPARSEMEM))
6693 pages = present_pages;
6695 return PAGE_ALIGN(pages * sizeof(struct page)) >> PAGE_SHIFT;
6698 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
6699 static void pgdat_init_split_queue(struct pglist_data *pgdat)
6701 struct deferred_split *ds_queue = &pgdat->deferred_split_queue;
6703 spin_lock_init(&ds_queue->split_queue_lock);
6704 INIT_LIST_HEAD(&ds_queue->split_queue);
6705 ds_queue->split_queue_len = 0;
6708 static void pgdat_init_split_queue(struct pglist_data *pgdat) {}
6711 #ifdef CONFIG_COMPACTION
6712 static void pgdat_init_kcompactd(struct pglist_data *pgdat)
6714 init_waitqueue_head(&pgdat->kcompactd_wait);
6717 static void pgdat_init_kcompactd(struct pglist_data *pgdat) {}
6720 static void __meminit pgdat_init_internals(struct pglist_data *pgdat)
6722 pgdat_resize_init(pgdat);
6724 pgdat_init_split_queue(pgdat);
6725 pgdat_init_kcompactd(pgdat);
6727 init_waitqueue_head(&pgdat->kswapd_wait);
6728 init_waitqueue_head(&pgdat->pfmemalloc_wait);
6730 pgdat_page_ext_init(pgdat);
6731 spin_lock_init(&pgdat->lru_lock);
6732 lruvec_init(&pgdat->__lruvec);
6735 static void __meminit zone_init_internals(struct zone *zone, enum zone_type idx, int nid,
6736 unsigned long remaining_pages)
6738 atomic_long_set(&zone->managed_pages, remaining_pages);
6739 zone_set_nid(zone, nid);
6740 zone->name = zone_names[idx];
6741 zone->zone_pgdat = NODE_DATA(nid);
6742 spin_lock_init(&zone->lock);
6743 zone_seqlock_init(zone);
6744 zone_pcp_init(zone);
6748 * Set up the zone data structures
6749 * - init pgdat internals
6750 * - init all zones belonging to this node
6752 * NOTE: this function is only called during memory hotplug
6754 #ifdef CONFIG_MEMORY_HOTPLUG
6755 void __ref free_area_init_core_hotplug(int nid)
6758 pg_data_t *pgdat = NODE_DATA(nid);
6760 pgdat_init_internals(pgdat);
6761 for (z = 0; z < MAX_NR_ZONES; z++)
6762 zone_init_internals(&pgdat->node_zones[z], z, nid, 0);
6767 * Set up the zone data structures:
6768 * - mark all pages reserved
6769 * - mark all memory queues empty
6770 * - clear the memory bitmaps
6772 * NOTE: pgdat should get zeroed by caller.
6773 * NOTE: this function is only called during early init.
6775 static void __init free_area_init_core(struct pglist_data *pgdat)
6778 int nid = pgdat->node_id;
6780 pgdat_init_internals(pgdat);
6781 pgdat->per_cpu_nodestats = &boot_nodestats;
6783 for (j = 0; j < MAX_NR_ZONES; j++) {
6784 struct zone *zone = pgdat->node_zones + j;
6785 unsigned long size, freesize, memmap_pages;
6786 unsigned long zone_start_pfn = zone->zone_start_pfn;
6788 size = zone->spanned_pages;
6789 freesize = zone->present_pages;
6792 * Adjust freesize so that it accounts for how much memory
6793 * is used by this zone for memmap. This affects the watermark
6794 * and per-cpu initialisations
6796 memmap_pages = calc_memmap_size(size, freesize);
6797 if (!is_highmem_idx(j)) {
6798 if (freesize >= memmap_pages) {
6799 freesize -= memmap_pages;
6802 " %s zone: %lu pages used for memmap\n",
6803 zone_names[j], memmap_pages);
6805 pr_warn(" %s zone: %lu pages exceeds freesize %lu\n",
6806 zone_names[j], memmap_pages, freesize);
6809 /* Account for reserved pages */
6810 if (j == 0 && freesize > dma_reserve) {
6811 freesize -= dma_reserve;
6812 printk(KERN_DEBUG " %s zone: %lu pages reserved\n",
6813 zone_names[0], dma_reserve);
6816 if (!is_highmem_idx(j))
6817 nr_kernel_pages += freesize;
6818 /* Charge for highmem memmap if there are enough kernel pages */
6819 else if (nr_kernel_pages > memmap_pages * 2)
6820 nr_kernel_pages -= memmap_pages;
6821 nr_all_pages += freesize;
6824 * Set an approximate value for lowmem here, it will be adjusted
6825 * when the bootmem allocator frees pages into the buddy system.
6826 * And all highmem pages will be managed by the buddy system.
6828 zone_init_internals(zone, j, nid, freesize);
6833 set_pageblock_order();
6834 setup_usemap(pgdat, zone, zone_start_pfn, size);
6835 init_currently_empty_zone(zone, zone_start_pfn, size);
6836 memmap_init(size, nid, j, zone_start_pfn);
6840 #ifdef CONFIG_FLAT_NODE_MEM_MAP
6841 static void __ref alloc_node_mem_map(struct pglist_data *pgdat)
6843 unsigned long __maybe_unused start = 0;
6844 unsigned long __maybe_unused offset = 0;
6846 /* Skip empty nodes */
6847 if (!pgdat->node_spanned_pages)
6850 start = pgdat->node_start_pfn & ~(MAX_ORDER_NR_PAGES - 1);
6851 offset = pgdat->node_start_pfn - start;
6852 /* ia64 gets its own node_mem_map, before this, without bootmem */
6853 if (!pgdat->node_mem_map) {
6854 unsigned long size, end;
6858 * The zone's endpoints aren't required to be MAX_ORDER
6859 * aligned but the node_mem_map endpoints must be in order
6860 * for the buddy allocator to function correctly.
6862 end = pgdat_end_pfn(pgdat);
6863 end = ALIGN(end, MAX_ORDER_NR_PAGES);
6864 size = (end - start) * sizeof(struct page);
6865 map = memblock_alloc_node(size, SMP_CACHE_BYTES,
6868 panic("Failed to allocate %ld bytes for node %d memory map\n",
6869 size, pgdat->node_id);
6870 pgdat->node_mem_map = map + offset;
6872 pr_debug("%s: node %d, pgdat %08lx, node_mem_map %08lx\n",
6873 __func__, pgdat->node_id, (unsigned long)pgdat,
6874 (unsigned long)pgdat->node_mem_map);
6875 #ifndef CONFIG_NEED_MULTIPLE_NODES
6877 * With no DISCONTIG, the global mem_map is just set as node 0's
6879 if (pgdat == NODE_DATA(0)) {
6880 mem_map = NODE_DATA(0)->node_mem_map;
6881 if (page_to_pfn(mem_map) != pgdat->node_start_pfn)
6887 static void __ref alloc_node_mem_map(struct pglist_data *pgdat) { }
6888 #endif /* CONFIG_FLAT_NODE_MEM_MAP */
6890 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
6891 static inline void pgdat_set_deferred_range(pg_data_t *pgdat)
6893 pgdat->first_deferred_pfn = ULONG_MAX;
6896 static inline void pgdat_set_deferred_range(pg_data_t *pgdat) {}
6899 static void __init free_area_init_node(int nid)
6901 pg_data_t *pgdat = NODE_DATA(nid);
6902 unsigned long start_pfn = 0;
6903 unsigned long end_pfn = 0;
6905 /* pg_data_t should be reset to zero when it's allocated */
6906 WARN_ON(pgdat->nr_zones || pgdat->kswapd_highest_zoneidx);
6908 get_pfn_range_for_nid(nid, &start_pfn, &end_pfn);
6910 pgdat->node_id = nid;
6911 pgdat->node_start_pfn = start_pfn;
6912 pgdat->per_cpu_nodestats = NULL;
6914 pr_info("Initmem setup node %d [mem %#018Lx-%#018Lx]\n", nid,
6915 (u64)start_pfn << PAGE_SHIFT,
6916 end_pfn ? ((u64)end_pfn << PAGE_SHIFT) - 1 : 0);
6917 calculate_node_totalpages(pgdat, start_pfn, end_pfn);
6919 alloc_node_mem_map(pgdat);
6920 pgdat_set_deferred_range(pgdat);
6922 free_area_init_core(pgdat);
6925 void __init free_area_init_memoryless_node(int nid)
6927 free_area_init_node(nid);
6930 #if !defined(CONFIG_FLAT_NODE_MEM_MAP)
6932 * Initialize all valid struct pages in the range [spfn, epfn) and mark them
6933 * PageReserved(). Return the number of struct pages that were initialized.
6935 static u64 __init init_unavailable_range(unsigned long spfn, unsigned long epfn)
6940 for (pfn = spfn; pfn < epfn; pfn++) {
6941 if (!pfn_valid(ALIGN_DOWN(pfn, pageblock_nr_pages))) {
6942 pfn = ALIGN_DOWN(pfn, pageblock_nr_pages)
6943 + pageblock_nr_pages - 1;
6947 * Use a fake node/zone (0) for now. Some of these pages
6948 * (in memblock.reserved but not in memblock.memory) will
6949 * get re-initialized via reserve_bootmem_region() later.
6951 __init_single_page(pfn_to_page(pfn), pfn, 0, 0);
6952 __SetPageReserved(pfn_to_page(pfn));
6960 * Only struct pages that are backed by physical memory are zeroed and
6961 * initialized by going through __init_single_page(). But, there are some
6962 * struct pages which are reserved in memblock allocator and their fields
6963 * may be accessed (for example page_to_pfn() on some configuration accesses
6964 * flags). We must explicitly initialize those struct pages.
6966 * This function also addresses a similar issue where struct pages are left
6967 * uninitialized because the physical address range is not covered by
6968 * memblock.memory or memblock.reserved. That could happen when memblock
6969 * layout is manually configured via memmap=, or when the highest physical
6970 * address (max_pfn) does not end on a section boundary.
6972 static void __init init_unavailable_mem(void)
6974 phys_addr_t start, end;
6976 phys_addr_t next = 0;
6979 * Loop through unavailable ranges not covered by memblock.memory.
6982 for_each_mem_range(i, &memblock.memory, NULL,
6983 NUMA_NO_NODE, MEMBLOCK_NONE, &start, &end, NULL) {
6985 pgcnt += init_unavailable_range(PFN_DOWN(next),
6991 * Early sections always have a fully populated memmap for the whole
6992 * section - see pfn_valid(). If the last section has holes at the
6993 * end and that section is marked "online", the memmap will be
6994 * considered initialized. Make sure that memmap has a well defined
6997 pgcnt += init_unavailable_range(PFN_DOWN(next),
6998 round_up(max_pfn, PAGES_PER_SECTION));
7001 * Struct pages that do not have backing memory. This could be because
7002 * firmware is using some of this memory, or for some other reasons.
7005 pr_info("Zeroed struct page in unavailable ranges: %lld pages", pgcnt);
7008 static inline void __init init_unavailable_mem(void)
7011 #endif /* !CONFIG_FLAT_NODE_MEM_MAP */
7013 #if MAX_NUMNODES > 1
7015 * Figure out the number of possible node ids.
7017 void __init setup_nr_node_ids(void)
7019 unsigned int highest;
7021 highest = find_last_bit(node_possible_map.bits, MAX_NUMNODES);
7022 nr_node_ids = highest + 1;
7027 * node_map_pfn_alignment - determine the maximum internode alignment
7029 * This function should be called after node map is populated and sorted.
7030 * It calculates the maximum power of two alignment which can distinguish
7033 * For example, if all nodes are 1GiB and aligned to 1GiB, the return value
7034 * would indicate 1GiB alignment with (1 << (30 - PAGE_SHIFT)). If the
7035 * nodes are shifted by 256MiB, 256MiB. Note that if only the last node is
7036 * shifted, 1GiB is enough and this function will indicate so.
7038 * This is used to test whether pfn -> nid mapping of the chosen memory
7039 * model has fine enough granularity to avoid incorrect mapping for the
7040 * populated node map.
7042 * Return: the determined alignment in pfn's. 0 if there is no alignment
7043 * requirement (single node).
7045 unsigned long __init node_map_pfn_alignment(void)
7047 unsigned long accl_mask = 0, last_end = 0;
7048 unsigned long start, end, mask;
7049 int last_nid = NUMA_NO_NODE;
7052 for_each_mem_pfn_range(i, MAX_NUMNODES, &start, &end, &nid) {
7053 if (!start || last_nid < 0 || last_nid == nid) {
7060 * Start with a mask granular enough to pin-point to the
7061 * start pfn and tick off bits one-by-one until it becomes
7062 * too coarse to separate the current node from the last.
7064 mask = ~((1 << __ffs(start)) - 1);
7065 while (mask && last_end <= (start & (mask << 1)))
7068 /* accumulate all internode masks */
7072 /* convert mask to number of pages */
7073 return ~accl_mask + 1;
7077 * find_min_pfn_with_active_regions - Find the minimum PFN registered
7079 * Return: the minimum PFN based on information provided via
7080 * memblock_set_node().
7082 unsigned long __init find_min_pfn_with_active_regions(void)
7084 return PHYS_PFN(memblock_start_of_DRAM());
7088 * early_calculate_totalpages()
7089 * Sum pages in active regions for movable zone.
7090 * Populate N_MEMORY for calculating usable_nodes.
7092 static unsigned long __init early_calculate_totalpages(void)
7094 unsigned long totalpages = 0;
7095 unsigned long start_pfn, end_pfn;
7098 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid) {
7099 unsigned long pages = end_pfn - start_pfn;
7101 totalpages += pages;
7103 node_set_state(nid, N_MEMORY);
7109 * Find the PFN the Movable zone begins in each node. Kernel memory
7110 * is spread evenly between nodes as long as the nodes have enough
7111 * memory. When they don't, some nodes will have more kernelcore than
7114 static void __init find_zone_movable_pfns_for_nodes(void)
7117 unsigned long usable_startpfn;
7118 unsigned long kernelcore_node, kernelcore_remaining;
7119 /* save the state before borrow the nodemask */
7120 nodemask_t saved_node_state = node_states[N_MEMORY];
7121 unsigned long totalpages = early_calculate_totalpages();
7122 int usable_nodes = nodes_weight(node_states[N_MEMORY]);
7123 struct memblock_region *r;
7125 /* Need to find movable_zone earlier when movable_node is specified. */
7126 find_usable_zone_for_movable();
7129 * If movable_node is specified, ignore kernelcore and movablecore
7132 if (movable_node_is_enabled()) {
7133 for_each_memblock(memory, r) {
7134 if (!memblock_is_hotpluggable(r))
7137 nid = memblock_get_region_node(r);
7139 usable_startpfn = PFN_DOWN(r->base);
7140 zone_movable_pfn[nid] = zone_movable_pfn[nid] ?
7141 min(usable_startpfn, zone_movable_pfn[nid]) :
7149 * If kernelcore=mirror is specified, ignore movablecore option
7151 if (mirrored_kernelcore) {
7152 bool mem_below_4gb_not_mirrored = false;
7154 for_each_memblock(memory, r) {
7155 if (memblock_is_mirror(r))
7158 nid = memblock_get_region_node(r);
7160 usable_startpfn = memblock_region_memory_base_pfn(r);
7162 if (usable_startpfn < 0x100000) {
7163 mem_below_4gb_not_mirrored = true;
7167 zone_movable_pfn[nid] = zone_movable_pfn[nid] ?
7168 min(usable_startpfn, zone_movable_pfn[nid]) :
7172 if (mem_below_4gb_not_mirrored)
7173 pr_warn("This configuration results in unmirrored kernel memory.\n");
7179 * If kernelcore=nn% or movablecore=nn% was specified, calculate the
7180 * amount of necessary memory.
7182 if (required_kernelcore_percent)
7183 required_kernelcore = (totalpages * 100 * required_kernelcore_percent) /
7185 if (required_movablecore_percent)
7186 required_movablecore = (totalpages * 100 * required_movablecore_percent) /
7190 * If movablecore= was specified, calculate what size of
7191 * kernelcore that corresponds so that memory usable for
7192 * any allocation type is evenly spread. If both kernelcore
7193 * and movablecore are specified, then the value of kernelcore
7194 * will be used for required_kernelcore if it's greater than
7195 * what movablecore would have allowed.
7197 if (required_movablecore) {
7198 unsigned long corepages;
7201 * Round-up so that ZONE_MOVABLE is at least as large as what
7202 * was requested by the user
7204 required_movablecore =
7205 roundup(required_movablecore, MAX_ORDER_NR_PAGES);
7206 required_movablecore = min(totalpages, required_movablecore);
7207 corepages = totalpages - required_movablecore;
7209 required_kernelcore = max(required_kernelcore, corepages);
7213 * If kernelcore was not specified or kernelcore size is larger
7214 * than totalpages, there is no ZONE_MOVABLE.
7216 if (!required_kernelcore || required_kernelcore >= totalpages)
7219 /* usable_startpfn is the lowest possible pfn ZONE_MOVABLE can be at */
7220 usable_startpfn = arch_zone_lowest_possible_pfn[movable_zone];
7223 /* Spread kernelcore memory as evenly as possible throughout nodes */
7224 kernelcore_node = required_kernelcore / usable_nodes;
7225 for_each_node_state(nid, N_MEMORY) {
7226 unsigned long start_pfn, end_pfn;
7229 * Recalculate kernelcore_node if the division per node
7230 * now exceeds what is necessary to satisfy the requested
7231 * amount of memory for the kernel
7233 if (required_kernelcore < kernelcore_node)
7234 kernelcore_node = required_kernelcore / usable_nodes;
7237 * As the map is walked, we track how much memory is usable
7238 * by the kernel using kernelcore_remaining. When it is
7239 * 0, the rest of the node is usable by ZONE_MOVABLE
7241 kernelcore_remaining = kernelcore_node;
7243 /* Go through each range of PFNs within this node */
7244 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
7245 unsigned long size_pages;
7247 start_pfn = max(start_pfn, zone_movable_pfn[nid]);
7248 if (start_pfn >= end_pfn)
7251 /* Account for what is only usable for kernelcore */
7252 if (start_pfn < usable_startpfn) {
7253 unsigned long kernel_pages;
7254 kernel_pages = min(end_pfn, usable_startpfn)
7257 kernelcore_remaining -= min(kernel_pages,
7258 kernelcore_remaining);
7259 required_kernelcore -= min(kernel_pages,
7260 required_kernelcore);
7262 /* Continue if range is now fully accounted */
7263 if (end_pfn <= usable_startpfn) {
7266 * Push zone_movable_pfn to the end so
7267 * that if we have to rebalance
7268 * kernelcore across nodes, we will
7269 * not double account here
7271 zone_movable_pfn[nid] = end_pfn;
7274 start_pfn = usable_startpfn;
7278 * The usable PFN range for ZONE_MOVABLE is from
7279 * start_pfn->end_pfn. Calculate size_pages as the
7280 * number of pages used as kernelcore
7282 size_pages = end_pfn - start_pfn;
7283 if (size_pages > kernelcore_remaining)
7284 size_pages = kernelcore_remaining;
7285 zone_movable_pfn[nid] = start_pfn + size_pages;
7288 * Some kernelcore has been met, update counts and
7289 * break if the kernelcore for this node has been
7292 required_kernelcore -= min(required_kernelcore,
7294 kernelcore_remaining -= size_pages;
7295 if (!kernelcore_remaining)
7301 * If there is still required_kernelcore, we do another pass with one
7302 * less node in the count. This will push zone_movable_pfn[nid] further
7303 * along on the nodes that still have memory until kernelcore is
7307 if (usable_nodes && required_kernelcore > usable_nodes)
7311 /* Align start of ZONE_MOVABLE on all nids to MAX_ORDER_NR_PAGES */
7312 for (nid = 0; nid < MAX_NUMNODES; nid++)
7313 zone_movable_pfn[nid] =
7314 roundup(zone_movable_pfn[nid], MAX_ORDER_NR_PAGES);
7317 /* restore the node_state */
7318 node_states[N_MEMORY] = saved_node_state;
7321 /* Any regular or high memory on that node ? */
7322 static void check_for_memory(pg_data_t *pgdat, int nid)
7324 enum zone_type zone_type;
7326 for (zone_type = 0; zone_type <= ZONE_MOVABLE - 1; zone_type++) {
7327 struct zone *zone = &pgdat->node_zones[zone_type];
7328 if (populated_zone(zone)) {
7329 if (IS_ENABLED(CONFIG_HIGHMEM))
7330 node_set_state(nid, N_HIGH_MEMORY);
7331 if (zone_type <= ZONE_NORMAL)
7332 node_set_state(nid, N_NORMAL_MEMORY);
7339 * Some architecturs, e.g. ARC may have ZONE_HIGHMEM below ZONE_NORMAL. For
7340 * such cases we allow max_zone_pfn sorted in the descending order
7342 bool __weak arch_has_descending_max_zone_pfns(void)
7348 * free_area_init - Initialise all pg_data_t and zone data
7349 * @max_zone_pfn: an array of max PFNs for each zone
7351 * This will call free_area_init_node() for each active node in the system.
7352 * Using the page ranges provided by memblock_set_node(), the size of each
7353 * zone in each node and their holes is calculated. If the maximum PFN
7354 * between two adjacent zones match, it is assumed that the zone is empty.
7355 * For example, if arch_max_dma_pfn == arch_max_dma32_pfn, it is assumed
7356 * that arch_max_dma32_pfn has no pages. It is also assumed that a zone
7357 * starts where the previous one ended. For example, ZONE_DMA32 starts
7358 * at arch_max_dma_pfn.
7360 void __init free_area_init(unsigned long *max_zone_pfn)
7362 unsigned long start_pfn, end_pfn;
7366 /* Record where the zone boundaries are */
7367 memset(arch_zone_lowest_possible_pfn, 0,
7368 sizeof(arch_zone_lowest_possible_pfn));
7369 memset(arch_zone_highest_possible_pfn, 0,
7370 sizeof(arch_zone_highest_possible_pfn));
7372 start_pfn = find_min_pfn_with_active_regions();
7373 descending = arch_has_descending_max_zone_pfns();
7375 for (i = 0; i < MAX_NR_ZONES; i++) {
7377 zone = MAX_NR_ZONES - i - 1;
7381 if (zone == ZONE_MOVABLE)
7384 end_pfn = max(max_zone_pfn[zone], start_pfn);
7385 arch_zone_lowest_possible_pfn[zone] = start_pfn;
7386 arch_zone_highest_possible_pfn[zone] = end_pfn;
7388 start_pfn = end_pfn;
7391 /* Find the PFNs that ZONE_MOVABLE begins at in each node */
7392 memset(zone_movable_pfn, 0, sizeof(zone_movable_pfn));
7393 find_zone_movable_pfns_for_nodes();
7395 /* Print out the zone ranges */
7396 pr_info("Zone ranges:\n");
7397 for (i = 0; i < MAX_NR_ZONES; i++) {
7398 if (i == ZONE_MOVABLE)
7400 pr_info(" %-8s ", zone_names[i]);
7401 if (arch_zone_lowest_possible_pfn[i] ==
7402 arch_zone_highest_possible_pfn[i])
7405 pr_cont("[mem %#018Lx-%#018Lx]\n",
7406 (u64)arch_zone_lowest_possible_pfn[i]
7408 ((u64)arch_zone_highest_possible_pfn[i]
7409 << PAGE_SHIFT) - 1);
7412 /* Print out the PFNs ZONE_MOVABLE begins at in each node */
7413 pr_info("Movable zone start for each node\n");
7414 for (i = 0; i < MAX_NUMNODES; i++) {
7415 if (zone_movable_pfn[i])
7416 pr_info(" Node %d: %#018Lx\n", i,
7417 (u64)zone_movable_pfn[i] << PAGE_SHIFT);
7421 * Print out the early node map, and initialize the
7422 * subsection-map relative to active online memory ranges to
7423 * enable future "sub-section" extensions of the memory map.
7425 pr_info("Early memory node ranges\n");
7426 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid) {
7427 pr_info(" node %3d: [mem %#018Lx-%#018Lx]\n", nid,
7428 (u64)start_pfn << PAGE_SHIFT,
7429 ((u64)end_pfn << PAGE_SHIFT) - 1);
7430 subsection_map_init(start_pfn, end_pfn - start_pfn);
7433 /* Initialise every node */
7434 mminit_verify_pageflags_layout();
7435 setup_nr_node_ids();
7436 init_unavailable_mem();
7437 for_each_online_node(nid) {
7438 pg_data_t *pgdat = NODE_DATA(nid);
7439 free_area_init_node(nid);
7441 /* Any memory on that node */
7442 if (pgdat->node_present_pages)
7443 node_set_state(nid, N_MEMORY);
7444 check_for_memory(pgdat, nid);
7448 static int __init cmdline_parse_core(char *p, unsigned long *core,
7449 unsigned long *percent)
7451 unsigned long long coremem;
7457 /* Value may be a percentage of total memory, otherwise bytes */
7458 coremem = simple_strtoull(p, &endptr, 0);
7459 if (*endptr == '%') {
7460 /* Paranoid check for percent values greater than 100 */
7461 WARN_ON(coremem > 100);
7465 coremem = memparse(p, &p);
7466 /* Paranoid check that UL is enough for the coremem value */
7467 WARN_ON((coremem >> PAGE_SHIFT) > ULONG_MAX);
7469 *core = coremem >> PAGE_SHIFT;
7476 * kernelcore=size sets the amount of memory for use for allocations that
7477 * cannot be reclaimed or migrated.
7479 static int __init cmdline_parse_kernelcore(char *p)
7481 /* parse kernelcore=mirror */
7482 if (parse_option_str(p, "mirror")) {
7483 mirrored_kernelcore = true;
7487 return cmdline_parse_core(p, &required_kernelcore,
7488 &required_kernelcore_percent);
7492 * movablecore=size sets the amount of memory for use for allocations that
7493 * can be reclaimed or migrated.
7495 static int __init cmdline_parse_movablecore(char *p)
7497 return cmdline_parse_core(p, &required_movablecore,
7498 &required_movablecore_percent);
7501 early_param("kernelcore", cmdline_parse_kernelcore);
7502 early_param("movablecore", cmdline_parse_movablecore);
7504 void adjust_managed_page_count(struct page *page, long count)
7506 atomic_long_add(count, &page_zone(page)->managed_pages);
7507 totalram_pages_add(count);
7508 #ifdef CONFIG_HIGHMEM
7509 if (PageHighMem(page))
7510 totalhigh_pages_add(count);
7513 EXPORT_SYMBOL(adjust_managed_page_count);
7515 unsigned long free_reserved_area(void *start, void *end, int poison, const char *s)
7518 unsigned long pages = 0;
7520 start = (void *)PAGE_ALIGN((unsigned long)start);
7521 end = (void *)((unsigned long)end & PAGE_MASK);
7522 for (pos = start; pos < end; pos += PAGE_SIZE, pages++) {
7523 struct page *page = virt_to_page(pos);
7524 void *direct_map_addr;
7527 * 'direct_map_addr' might be different from 'pos'
7528 * because some architectures' virt_to_page()
7529 * work with aliases. Getting the direct map
7530 * address ensures that we get a _writeable_
7531 * alias for the memset().
7533 direct_map_addr = page_address(page);
7534 if ((unsigned int)poison <= 0xFF)
7535 memset(direct_map_addr, poison, PAGE_SIZE);
7537 free_reserved_page(page);
7541 pr_info("Freeing %s memory: %ldK\n",
7542 s, pages << (PAGE_SHIFT - 10));
7547 #ifdef CONFIG_HIGHMEM
7548 void free_highmem_page(struct page *page)
7550 __free_reserved_page(page);
7551 totalram_pages_inc();
7552 atomic_long_inc(&page_zone(page)->managed_pages);
7553 totalhigh_pages_inc();
7558 void __init mem_init_print_info(const char *str)
7560 unsigned long physpages, codesize, datasize, rosize, bss_size;
7561 unsigned long init_code_size, init_data_size;
7563 physpages = get_num_physpages();
7564 codesize = _etext - _stext;
7565 datasize = _edata - _sdata;
7566 rosize = __end_rodata - __start_rodata;
7567 bss_size = __bss_stop - __bss_start;
7568 init_data_size = __init_end - __init_begin;
7569 init_code_size = _einittext - _sinittext;
7572 * Detect special cases and adjust section sizes accordingly:
7573 * 1) .init.* may be embedded into .data sections
7574 * 2) .init.text.* may be out of [__init_begin, __init_end],
7575 * please refer to arch/tile/kernel/vmlinux.lds.S.
7576 * 3) .rodata.* may be embedded into .text or .data sections.
7578 #define adj_init_size(start, end, size, pos, adj) \
7580 if (start <= pos && pos < end && size > adj) \
7584 adj_init_size(__init_begin, __init_end, init_data_size,
7585 _sinittext, init_code_size);
7586 adj_init_size(_stext, _etext, codesize, _sinittext, init_code_size);
7587 adj_init_size(_sdata, _edata, datasize, __init_begin, init_data_size);
7588 adj_init_size(_stext, _etext, codesize, __start_rodata, rosize);
7589 adj_init_size(_sdata, _edata, datasize, __start_rodata, rosize);
7591 #undef adj_init_size
7593 pr_info("Memory: %luK/%luK available (%luK kernel code, %luK rwdata, %luK rodata, %luK init, %luK bss, %luK reserved, %luK cma-reserved"
7594 #ifdef CONFIG_HIGHMEM
7598 nr_free_pages() << (PAGE_SHIFT - 10),
7599 physpages << (PAGE_SHIFT - 10),
7600 codesize >> 10, datasize >> 10, rosize >> 10,
7601 (init_data_size + init_code_size) >> 10, bss_size >> 10,
7602 (physpages - totalram_pages() - totalcma_pages) << (PAGE_SHIFT - 10),
7603 totalcma_pages << (PAGE_SHIFT - 10),
7604 #ifdef CONFIG_HIGHMEM
7605 totalhigh_pages() << (PAGE_SHIFT - 10),
7607 str ? ", " : "", str ? str : "");
7611 * set_dma_reserve - set the specified number of pages reserved in the first zone
7612 * @new_dma_reserve: The number of pages to mark reserved
7614 * The per-cpu batchsize and zone watermarks are determined by managed_pages.
7615 * In the DMA zone, a significant percentage may be consumed by kernel image
7616 * and other unfreeable allocations which can skew the watermarks badly. This
7617 * function may optionally be used to account for unfreeable pages in the
7618 * first zone (e.g., ZONE_DMA). The effect will be lower watermarks and
7619 * smaller per-cpu batchsize.
7621 void __init set_dma_reserve(unsigned long new_dma_reserve)
7623 dma_reserve = new_dma_reserve;
7626 static int page_alloc_cpu_dead(unsigned int cpu)
7629 lru_add_drain_cpu(cpu);
7633 * Spill the event counters of the dead processor
7634 * into the current processors event counters.
7635 * This artificially elevates the count of the current
7638 vm_events_fold_cpu(cpu);
7641 * Zero the differential counters of the dead processor
7642 * so that the vm statistics are consistent.
7644 * This is only okay since the processor is dead and cannot
7645 * race with what we are doing.
7647 cpu_vm_stats_fold(cpu);
7652 int hashdist = HASHDIST_DEFAULT;
7654 static int __init set_hashdist(char *str)
7658 hashdist = simple_strtoul(str, &str, 0);
7661 __setup("hashdist=", set_hashdist);
7664 void __init page_alloc_init(void)
7669 if (num_node_state(N_MEMORY) == 1)
7673 ret = cpuhp_setup_state_nocalls(CPUHP_PAGE_ALLOC_DEAD,
7674 "mm/page_alloc:dead", NULL,
7675 page_alloc_cpu_dead);
7680 * calculate_totalreserve_pages - called when sysctl_lowmem_reserve_ratio
7681 * or min_free_kbytes changes.
7683 static void calculate_totalreserve_pages(void)
7685 struct pglist_data *pgdat;
7686 unsigned long reserve_pages = 0;
7687 enum zone_type i, j;
7689 for_each_online_pgdat(pgdat) {
7691 pgdat->totalreserve_pages = 0;
7693 for (i = 0; i < MAX_NR_ZONES; i++) {
7694 struct zone *zone = pgdat->node_zones + i;
7696 unsigned long managed_pages = zone_managed_pages(zone);
7698 /* Find valid and maximum lowmem_reserve in the zone */
7699 for (j = i; j < MAX_NR_ZONES; j++) {
7700 if (zone->lowmem_reserve[j] > max)
7701 max = zone->lowmem_reserve[j];
7704 /* we treat the high watermark as reserved pages. */
7705 max += high_wmark_pages(zone);
7707 if (max > managed_pages)
7708 max = managed_pages;
7710 pgdat->totalreserve_pages += max;
7712 reserve_pages += max;
7715 totalreserve_pages = reserve_pages;
7719 * setup_per_zone_lowmem_reserve - called whenever
7720 * sysctl_lowmem_reserve_ratio changes. Ensures that each zone
7721 * has a correct pages reserved value, so an adequate number of
7722 * pages are left in the zone after a successful __alloc_pages().
7724 static void setup_per_zone_lowmem_reserve(void)
7726 struct pglist_data *pgdat;
7727 enum zone_type j, idx;
7729 for_each_online_pgdat(pgdat) {
7730 for (j = 0; j < MAX_NR_ZONES; j++) {
7731 struct zone *zone = pgdat->node_zones + j;
7732 unsigned long managed_pages = zone_managed_pages(zone);
7734 zone->lowmem_reserve[j] = 0;
7738 struct zone *lower_zone;
7741 lower_zone = pgdat->node_zones + idx;
7743 if (!sysctl_lowmem_reserve_ratio[idx] ||
7744 !zone_managed_pages(lower_zone)) {
7745 lower_zone->lowmem_reserve[j] = 0;
7748 lower_zone->lowmem_reserve[j] =
7749 managed_pages / sysctl_lowmem_reserve_ratio[idx];
7751 managed_pages += zone_managed_pages(lower_zone);
7756 /* update totalreserve_pages */
7757 calculate_totalreserve_pages();
7760 static void __setup_per_zone_wmarks(void)
7762 unsigned long pages_min = min_free_kbytes >> (PAGE_SHIFT - 10);
7763 unsigned long lowmem_pages = 0;
7765 unsigned long flags;
7767 /* Calculate total number of !ZONE_HIGHMEM pages */
7768 for_each_zone(zone) {
7769 if (!is_highmem(zone))
7770 lowmem_pages += zone_managed_pages(zone);
7773 for_each_zone(zone) {
7776 spin_lock_irqsave(&zone->lock, flags);
7777 tmp = (u64)pages_min * zone_managed_pages(zone);
7778 do_div(tmp, lowmem_pages);
7779 if (is_highmem(zone)) {
7781 * __GFP_HIGH and PF_MEMALLOC allocations usually don't
7782 * need highmem pages, so cap pages_min to a small
7785 * The WMARK_HIGH-WMARK_LOW and (WMARK_LOW-WMARK_MIN)
7786 * deltas control async page reclaim, and so should
7787 * not be capped for highmem.
7789 unsigned long min_pages;
7791 min_pages = zone_managed_pages(zone) / 1024;
7792 min_pages = clamp(min_pages, SWAP_CLUSTER_MAX, 128UL);
7793 zone->_watermark[WMARK_MIN] = min_pages;
7796 * If it's a lowmem zone, reserve a number of pages
7797 * proportionate to the zone's size.
7799 zone->_watermark[WMARK_MIN] = tmp;
7803 * Set the kswapd watermarks distance according to the
7804 * scale factor in proportion to available memory, but
7805 * ensure a minimum size on small systems.
7807 tmp = max_t(u64, tmp >> 2,
7808 mult_frac(zone_managed_pages(zone),
7809 watermark_scale_factor, 10000));
7811 zone->watermark_boost = 0;
7812 zone->_watermark[WMARK_LOW] = min_wmark_pages(zone) + tmp;
7813 zone->_watermark[WMARK_HIGH] = min_wmark_pages(zone) + tmp * 2;
7815 spin_unlock_irqrestore(&zone->lock, flags);
7818 /* update totalreserve_pages */
7819 calculate_totalreserve_pages();
7823 * setup_per_zone_wmarks - called when min_free_kbytes changes
7824 * or when memory is hot-{added|removed}
7826 * Ensures that the watermark[min,low,high] values for each zone are set
7827 * correctly with respect to min_free_kbytes.
7829 void setup_per_zone_wmarks(void)
7831 static DEFINE_SPINLOCK(lock);
7834 __setup_per_zone_wmarks();
7839 * Initialise min_free_kbytes.
7841 * For small machines we want it small (128k min). For large machines
7842 * we want it large (256MB max). But it is not linear, because network
7843 * bandwidth does not increase linearly with machine size. We use
7845 * min_free_kbytes = 4 * sqrt(lowmem_kbytes), for better accuracy:
7846 * min_free_kbytes = sqrt(lowmem_kbytes * 16)
7862 int __meminit init_per_zone_wmark_min(void)
7864 unsigned long lowmem_kbytes;
7865 int new_min_free_kbytes;
7867 lowmem_kbytes = nr_free_buffer_pages() * (PAGE_SIZE >> 10);
7868 new_min_free_kbytes = int_sqrt(lowmem_kbytes * 16);
7870 if (new_min_free_kbytes > user_min_free_kbytes) {
7871 min_free_kbytes = new_min_free_kbytes;
7872 if (min_free_kbytes < 128)
7873 min_free_kbytes = 128;
7874 if (min_free_kbytes > 262144)
7875 min_free_kbytes = 262144;
7877 pr_warn("min_free_kbytes is not updated to %d because user defined value %d is preferred\n",
7878 new_min_free_kbytes, user_min_free_kbytes);
7880 setup_per_zone_wmarks();
7881 refresh_zone_stat_thresholds();
7882 setup_per_zone_lowmem_reserve();
7885 setup_min_unmapped_ratio();
7886 setup_min_slab_ratio();
7891 core_initcall(init_per_zone_wmark_min)
7894 * min_free_kbytes_sysctl_handler - just a wrapper around proc_dointvec() so
7895 * that we can call two helper functions whenever min_free_kbytes
7898 int min_free_kbytes_sysctl_handler(struct ctl_table *table, int write,
7899 void *buffer, size_t *length, loff_t *ppos)
7903 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
7908 user_min_free_kbytes = min_free_kbytes;
7909 setup_per_zone_wmarks();
7914 int watermark_scale_factor_sysctl_handler(struct ctl_table *table, int write,
7915 void *buffer, size_t *length, loff_t *ppos)
7919 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
7924 setup_per_zone_wmarks();
7930 static void setup_min_unmapped_ratio(void)
7935 for_each_online_pgdat(pgdat)
7936 pgdat->min_unmapped_pages = 0;
7939 zone->zone_pgdat->min_unmapped_pages += (zone_managed_pages(zone) *
7940 sysctl_min_unmapped_ratio) / 100;
7944 int sysctl_min_unmapped_ratio_sysctl_handler(struct ctl_table *table, int write,
7945 void *buffer, size_t *length, loff_t *ppos)
7949 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
7953 setup_min_unmapped_ratio();
7958 static void setup_min_slab_ratio(void)
7963 for_each_online_pgdat(pgdat)
7964 pgdat->min_slab_pages = 0;
7967 zone->zone_pgdat->min_slab_pages += (zone_managed_pages(zone) *
7968 sysctl_min_slab_ratio) / 100;
7971 int sysctl_min_slab_ratio_sysctl_handler(struct ctl_table *table, int write,
7972 void *buffer, size_t *length, loff_t *ppos)
7976 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
7980 setup_min_slab_ratio();
7987 * lowmem_reserve_ratio_sysctl_handler - just a wrapper around
7988 * proc_dointvec() so that we can call setup_per_zone_lowmem_reserve()
7989 * whenever sysctl_lowmem_reserve_ratio changes.
7991 * The reserve ratio obviously has absolutely no relation with the
7992 * minimum watermarks. The lowmem reserve ratio can only make sense
7993 * if in function of the boot time zone sizes.
7995 int lowmem_reserve_ratio_sysctl_handler(struct ctl_table *table, int write,
7996 void *buffer, size_t *length, loff_t *ppos)
8000 proc_dointvec_minmax(table, write, buffer, length, ppos);
8002 for (i = 0; i < MAX_NR_ZONES; i++) {
8003 if (sysctl_lowmem_reserve_ratio[i] < 1)
8004 sysctl_lowmem_reserve_ratio[i] = 0;
8007 setup_per_zone_lowmem_reserve();
8011 static void __zone_pcp_update(struct zone *zone)
8015 for_each_possible_cpu(cpu)
8016 pageset_set_high_and_batch(zone,
8017 per_cpu_ptr(zone->pageset, cpu));
8021 * percpu_pagelist_fraction - changes the pcp->high for each zone on each
8022 * cpu. It is the fraction of total pages in each zone that a hot per cpu
8023 * pagelist can have before it gets flushed back to buddy allocator.
8025 int percpu_pagelist_fraction_sysctl_handler(struct ctl_table *table, int write,
8026 void *buffer, size_t *length, loff_t *ppos)
8029 int old_percpu_pagelist_fraction;
8032 mutex_lock(&pcp_batch_high_lock);
8033 old_percpu_pagelist_fraction = percpu_pagelist_fraction;
8035 ret = proc_dointvec_minmax(table, write, buffer, length, ppos);
8036 if (!write || ret < 0)
8039 /* Sanity checking to avoid pcp imbalance */
8040 if (percpu_pagelist_fraction &&
8041 percpu_pagelist_fraction < MIN_PERCPU_PAGELIST_FRACTION) {
8042 percpu_pagelist_fraction = old_percpu_pagelist_fraction;
8048 if (percpu_pagelist_fraction == old_percpu_pagelist_fraction)
8051 for_each_populated_zone(zone)
8052 __zone_pcp_update(zone);
8054 mutex_unlock(&pcp_batch_high_lock);
8058 #ifndef __HAVE_ARCH_RESERVED_KERNEL_PAGES
8060 * Returns the number of pages that arch has reserved but
8061 * is not known to alloc_large_system_hash().
8063 static unsigned long __init arch_reserved_kernel_pages(void)
8070 * Adaptive scale is meant to reduce sizes of hash tables on large memory
8071 * machines. As memory size is increased the scale is also increased but at
8072 * slower pace. Starting from ADAPT_SCALE_BASE (64G), every time memory
8073 * quadruples the scale is increased by one, which means the size of hash table
8074 * only doubles, instead of quadrupling as well.
8075 * Because 32-bit systems cannot have large physical memory, where this scaling
8076 * makes sense, it is disabled on such platforms.
8078 #if __BITS_PER_LONG > 32
8079 #define ADAPT_SCALE_BASE (64ul << 30)
8080 #define ADAPT_SCALE_SHIFT 2
8081 #define ADAPT_SCALE_NPAGES (ADAPT_SCALE_BASE >> PAGE_SHIFT)
8085 * allocate a large system hash table from bootmem
8086 * - it is assumed that the hash table must contain an exact power-of-2
8087 * quantity of entries
8088 * - limit is the number of hash buckets, not the total allocation size
8090 void *__init alloc_large_system_hash(const char *tablename,
8091 unsigned long bucketsize,
8092 unsigned long numentries,
8095 unsigned int *_hash_shift,
8096 unsigned int *_hash_mask,
8097 unsigned long low_limit,
8098 unsigned long high_limit)
8100 unsigned long long max = high_limit;
8101 unsigned long log2qty, size;
8106 /* allow the kernel cmdline to have a say */
8108 /* round applicable memory size up to nearest megabyte */
8109 numentries = nr_kernel_pages;
8110 numentries -= arch_reserved_kernel_pages();
8112 /* It isn't necessary when PAGE_SIZE >= 1MB */
8113 if (PAGE_SHIFT < 20)
8114 numentries = round_up(numentries, (1<<20)/PAGE_SIZE);
8116 #if __BITS_PER_LONG > 32
8118 unsigned long adapt;
8120 for (adapt = ADAPT_SCALE_NPAGES; adapt < numentries;
8121 adapt <<= ADAPT_SCALE_SHIFT)
8126 /* limit to 1 bucket per 2^scale bytes of low memory */
8127 if (scale > PAGE_SHIFT)
8128 numentries >>= (scale - PAGE_SHIFT);
8130 numentries <<= (PAGE_SHIFT - scale);
8132 /* Make sure we've got at least a 0-order allocation.. */
8133 if (unlikely(flags & HASH_SMALL)) {
8134 /* Makes no sense without HASH_EARLY */
8135 WARN_ON(!(flags & HASH_EARLY));
8136 if (!(numentries >> *_hash_shift)) {
8137 numentries = 1UL << *_hash_shift;
8138 BUG_ON(!numentries);
8140 } else if (unlikely((numentries * bucketsize) < PAGE_SIZE))
8141 numentries = PAGE_SIZE / bucketsize;
8143 numentries = roundup_pow_of_two(numentries);
8145 /* limit allocation size to 1/16 total memory by default */
8147 max = ((unsigned long long)nr_all_pages << PAGE_SHIFT) >> 4;
8148 do_div(max, bucketsize);
8150 max = min(max, 0x80000000ULL);
8152 if (numentries < low_limit)
8153 numentries = low_limit;
8154 if (numentries > max)
8157 log2qty = ilog2(numentries);
8159 gfp_flags = (flags & HASH_ZERO) ? GFP_ATOMIC | __GFP_ZERO : GFP_ATOMIC;
8162 size = bucketsize << log2qty;
8163 if (flags & HASH_EARLY) {
8164 if (flags & HASH_ZERO)
8165 table = memblock_alloc(size, SMP_CACHE_BYTES);
8167 table = memblock_alloc_raw(size,
8169 } else if (get_order(size) >= MAX_ORDER || hashdist) {
8170 table = __vmalloc(size, gfp_flags);
8174 * If bucketsize is not a power-of-two, we may free
8175 * some pages at the end of hash table which
8176 * alloc_pages_exact() automatically does
8178 table = alloc_pages_exact(size, gfp_flags);
8179 kmemleak_alloc(table, size, 1, gfp_flags);
8181 } while (!table && size > PAGE_SIZE && --log2qty);
8184 panic("Failed to allocate %s hash table\n", tablename);
8186 pr_info("%s hash table entries: %ld (order: %d, %lu bytes, %s)\n",
8187 tablename, 1UL << log2qty, ilog2(size) - PAGE_SHIFT, size,
8188 virt ? "vmalloc" : "linear");
8191 *_hash_shift = log2qty;
8193 *_hash_mask = (1 << log2qty) - 1;
8199 * This function checks whether pageblock includes unmovable pages or not.
8201 * PageLRU check without isolation or lru_lock could race so that
8202 * MIGRATE_MOVABLE block might include unmovable pages. And __PageMovable
8203 * check without lock_page also may miss some movable non-lru pages at
8204 * race condition. So you can't expect this function should be exact.
8206 * Returns a page without holding a reference. If the caller wants to
8207 * dereference that page (e.g., dumping), it has to make sure that that it
8208 * cannot get removed (e.g., via memory unplug) concurrently.
8211 struct page *has_unmovable_pages(struct zone *zone, struct page *page,
8212 int migratetype, int flags)
8214 unsigned long iter = 0;
8215 unsigned long pfn = page_to_pfn(page);
8218 * TODO we could make this much more efficient by not checking every
8219 * page in the range if we know all of them are in MOVABLE_ZONE and
8220 * that the movable zone guarantees that pages are migratable but
8221 * the later is not the case right now unfortunatelly. E.g. movablecore
8222 * can still lead to having bootmem allocations in zone_movable.
8225 if (is_migrate_cma_page(page)) {
8227 * CMA allocations (alloc_contig_range) really need to mark
8228 * isolate CMA pageblocks even when they are not movable in fact
8229 * so consider them movable here.
8231 if (is_migrate_cma(migratetype))
8237 for (; iter < pageblock_nr_pages; iter++) {
8238 if (!pfn_valid_within(pfn + iter))
8241 page = pfn_to_page(pfn + iter);
8243 if (PageReserved(page))
8247 * If the zone is movable and we have ruled out all reserved
8248 * pages then it should be reasonably safe to assume the rest
8251 if (zone_idx(zone) == ZONE_MOVABLE)
8255 * Hugepages are not in LRU lists, but they're movable.
8256 * THPs are on the LRU, but need to be counted as #small pages.
8257 * We need not scan over tail pages because we don't
8258 * handle each tail page individually in migration.
8260 if (PageHuge(page) || PageTransCompound(page)) {
8261 struct page *head = compound_head(page);
8262 unsigned int skip_pages;
8264 if (PageHuge(page)) {
8265 if (!hugepage_migration_supported(page_hstate(head)))
8267 } else if (!PageLRU(head) && !__PageMovable(head)) {
8271 skip_pages = compound_nr(head) - (page - head);
8272 iter += skip_pages - 1;
8277 * We can't use page_count without pin a page
8278 * because another CPU can free compound page.
8279 * This check already skips compound tails of THP
8280 * because their page->_refcount is zero at all time.
8282 if (!page_ref_count(page)) {
8283 if (PageBuddy(page))
8284 iter += (1 << page_order(page)) - 1;
8289 * The HWPoisoned page may be not in buddy system, and
8290 * page_count() is not 0.
8292 if ((flags & MEMORY_OFFLINE) && PageHWPoison(page))
8296 * We treat all PageOffline() pages as movable when offlining
8297 * to give drivers a chance to decrement their reference count
8298 * in MEM_GOING_OFFLINE in order to indicate that these pages
8299 * can be offlined as there are no direct references anymore.
8300 * For actually unmovable PageOffline() where the driver does
8301 * not support this, we will fail later when trying to actually
8302 * move these pages that still have a reference count > 0.
8303 * (false negatives in this function only)
8305 if ((flags & MEMORY_OFFLINE) && PageOffline(page))
8308 if (__PageMovable(page) || PageLRU(page))
8312 * If there are RECLAIMABLE pages, we need to check
8313 * it. But now, memory offline itself doesn't call
8314 * shrink_node_slabs() and it still to be fixed.
8317 * If the page is not RAM, page_count()should be 0.
8318 * we don't need more check. This is an _used_ not-movable page.
8320 * The problematic thing here is PG_reserved pages. PG_reserved
8321 * is set to both of a memory hole page and a _used_ kernel
8329 #ifdef CONFIG_CONTIG_ALLOC
8330 static unsigned long pfn_max_align_down(unsigned long pfn)
8332 return pfn & ~(max_t(unsigned long, MAX_ORDER_NR_PAGES,
8333 pageblock_nr_pages) - 1);
8336 static unsigned long pfn_max_align_up(unsigned long pfn)
8338 return ALIGN(pfn, max_t(unsigned long, MAX_ORDER_NR_PAGES,
8339 pageblock_nr_pages));
8342 /* [start, end) must belong to a single zone. */
8343 static int __alloc_contig_migrate_range(struct compact_control *cc,
8344 unsigned long start, unsigned long end)
8346 /* This function is based on compact_zone() from compaction.c. */
8347 unsigned int nr_reclaimed;
8348 unsigned long pfn = start;
8349 unsigned int tries = 0;
8354 while (pfn < end || !list_empty(&cc->migratepages)) {
8355 if (fatal_signal_pending(current)) {
8360 if (list_empty(&cc->migratepages)) {
8361 cc->nr_migratepages = 0;
8362 pfn = isolate_migratepages_range(cc, pfn, end);
8368 } else if (++tries == 5) {
8369 ret = ret < 0 ? ret : -EBUSY;
8373 nr_reclaimed = reclaim_clean_pages_from_list(cc->zone,
8375 cc->nr_migratepages -= nr_reclaimed;
8377 ret = migrate_pages(&cc->migratepages, alloc_migrate_target,
8378 NULL, 0, cc->mode, MR_CONTIG_RANGE);
8381 putback_movable_pages(&cc->migratepages);
8388 * alloc_contig_range() -- tries to allocate given range of pages
8389 * @start: start PFN to allocate
8390 * @end: one-past-the-last PFN to allocate
8391 * @migratetype: migratetype of the underlaying pageblocks (either
8392 * #MIGRATE_MOVABLE or #MIGRATE_CMA). All pageblocks
8393 * in range must have the same migratetype and it must
8394 * be either of the two.
8395 * @gfp_mask: GFP mask to use during compaction
8397 * The PFN range does not have to be pageblock or MAX_ORDER_NR_PAGES
8398 * aligned. The PFN range must belong to a single zone.
8400 * The first thing this routine does is attempt to MIGRATE_ISOLATE all
8401 * pageblocks in the range. Once isolated, the pageblocks should not
8402 * be modified by others.
8404 * Return: zero on success or negative error code. On success all
8405 * pages which PFN is in [start, end) are allocated for the caller and
8406 * need to be freed with free_contig_range().
8408 int alloc_contig_range(unsigned long start, unsigned long end,
8409 unsigned migratetype, gfp_t gfp_mask)
8411 unsigned long outer_start, outer_end;
8415 struct compact_control cc = {
8416 .nr_migratepages = 0,
8418 .zone = page_zone(pfn_to_page(start)),
8419 .mode = MIGRATE_SYNC,
8420 .ignore_skip_hint = true,
8421 .no_set_skip_hint = true,
8422 .gfp_mask = current_gfp_context(gfp_mask),
8423 .alloc_contig = true,
8425 INIT_LIST_HEAD(&cc.migratepages);
8428 * What we do here is we mark all pageblocks in range as
8429 * MIGRATE_ISOLATE. Because pageblock and max order pages may
8430 * have different sizes, and due to the way page allocator
8431 * work, we align the range to biggest of the two pages so
8432 * that page allocator won't try to merge buddies from
8433 * different pageblocks and change MIGRATE_ISOLATE to some
8434 * other migration type.
8436 * Once the pageblocks are marked as MIGRATE_ISOLATE, we
8437 * migrate the pages from an unaligned range (ie. pages that
8438 * we are interested in). This will put all the pages in
8439 * range back to page allocator as MIGRATE_ISOLATE.
8441 * When this is done, we take the pages in range from page
8442 * allocator removing them from the buddy system. This way
8443 * page allocator will never consider using them.
8445 * This lets us mark the pageblocks back as
8446 * MIGRATE_CMA/MIGRATE_MOVABLE so that free pages in the
8447 * aligned range but not in the unaligned, original range are
8448 * put back to page allocator so that buddy can use them.
8451 ret = start_isolate_page_range(pfn_max_align_down(start),
8452 pfn_max_align_up(end), migratetype, 0);
8457 * In case of -EBUSY, we'd like to know which page causes problem.
8458 * So, just fall through. test_pages_isolated() has a tracepoint
8459 * which will report the busy page.
8461 * It is possible that busy pages could become available before
8462 * the call to test_pages_isolated, and the range will actually be
8463 * allocated. So, if we fall through be sure to clear ret so that
8464 * -EBUSY is not accidentally used or returned to caller.
8466 ret = __alloc_contig_migrate_range(&cc, start, end);
8467 if (ret && ret != -EBUSY)
8472 * Pages from [start, end) are within a MAX_ORDER_NR_PAGES
8473 * aligned blocks that are marked as MIGRATE_ISOLATE. What's
8474 * more, all pages in [start, end) are free in page allocator.
8475 * What we are going to do is to allocate all pages from
8476 * [start, end) (that is remove them from page allocator).
8478 * The only problem is that pages at the beginning and at the
8479 * end of interesting range may be not aligned with pages that
8480 * page allocator holds, ie. they can be part of higher order
8481 * pages. Because of this, we reserve the bigger range and
8482 * once this is done free the pages we are not interested in.
8484 * We don't have to hold zone->lock here because the pages are
8485 * isolated thus they won't get removed from buddy.
8488 lru_add_drain_all();
8491 outer_start = start;
8492 while (!PageBuddy(pfn_to_page(outer_start))) {
8493 if (++order >= MAX_ORDER) {
8494 outer_start = start;
8497 outer_start &= ~0UL << order;
8500 if (outer_start != start) {
8501 order = page_order(pfn_to_page(outer_start));
8504 * outer_start page could be small order buddy page and
8505 * it doesn't include start page. Adjust outer_start
8506 * in this case to report failed page properly
8507 * on tracepoint in test_pages_isolated()
8509 if (outer_start + (1UL << order) <= start)
8510 outer_start = start;
8513 /* Make sure the range is really isolated. */
8514 if (test_pages_isolated(outer_start, end, 0)) {
8515 pr_info_ratelimited("%s: [%lx, %lx) PFNs busy\n",
8516 __func__, outer_start, end);
8521 /* Grab isolated pages from freelists. */
8522 outer_end = isolate_freepages_range(&cc, outer_start, end);
8528 /* Free head and tail (if any) */
8529 if (start != outer_start)
8530 free_contig_range(outer_start, start - outer_start);
8531 if (end != outer_end)
8532 free_contig_range(end, outer_end - end);
8535 undo_isolate_page_range(pfn_max_align_down(start),
8536 pfn_max_align_up(end), migratetype);
8539 EXPORT_SYMBOL(alloc_contig_range);
8541 static int __alloc_contig_pages(unsigned long start_pfn,
8542 unsigned long nr_pages, gfp_t gfp_mask)
8544 unsigned long end_pfn = start_pfn + nr_pages;
8546 return alloc_contig_range(start_pfn, end_pfn, MIGRATE_MOVABLE,
8550 static bool pfn_range_valid_contig(struct zone *z, unsigned long start_pfn,
8551 unsigned long nr_pages)
8553 unsigned long i, end_pfn = start_pfn + nr_pages;
8556 for (i = start_pfn; i < end_pfn; i++) {
8557 page = pfn_to_online_page(i);
8561 if (page_zone(page) != z)
8564 if (PageReserved(page))
8567 if (page_count(page) > 0)
8576 static bool zone_spans_last_pfn(const struct zone *zone,
8577 unsigned long start_pfn, unsigned long nr_pages)
8579 unsigned long last_pfn = start_pfn + nr_pages - 1;
8581 return zone_spans_pfn(zone, last_pfn);
8585 * alloc_contig_pages() -- tries to find and allocate contiguous range of pages
8586 * @nr_pages: Number of contiguous pages to allocate
8587 * @gfp_mask: GFP mask to limit search and used during compaction
8589 * @nodemask: Mask for other possible nodes
8591 * This routine is a wrapper around alloc_contig_range(). It scans over zones
8592 * on an applicable zonelist to find a contiguous pfn range which can then be
8593 * tried for allocation with alloc_contig_range(). This routine is intended
8594 * for allocation requests which can not be fulfilled with the buddy allocator.
8596 * The allocated memory is always aligned to a page boundary. If nr_pages is a
8597 * power of two then the alignment is guaranteed to be to the given nr_pages
8598 * (e.g. 1GB request would be aligned to 1GB).
8600 * Allocated pages can be freed with free_contig_range() or by manually calling
8601 * __free_page() on each allocated page.
8603 * Return: pointer to contiguous pages on success, or NULL if not successful.
8605 struct page *alloc_contig_pages(unsigned long nr_pages, gfp_t gfp_mask,
8606 int nid, nodemask_t *nodemask)
8608 unsigned long ret, pfn, flags;
8609 struct zonelist *zonelist;
8613 zonelist = node_zonelist(nid, gfp_mask);
8614 for_each_zone_zonelist_nodemask(zone, z, zonelist,
8615 gfp_zone(gfp_mask), nodemask) {
8616 spin_lock_irqsave(&zone->lock, flags);
8618 pfn = ALIGN(zone->zone_start_pfn, nr_pages);
8619 while (zone_spans_last_pfn(zone, pfn, nr_pages)) {
8620 if (pfn_range_valid_contig(zone, pfn, nr_pages)) {
8622 * We release the zone lock here because
8623 * alloc_contig_range() will also lock the zone
8624 * at some point. If there's an allocation
8625 * spinning on this lock, it may win the race
8626 * and cause alloc_contig_range() to fail...
8628 spin_unlock_irqrestore(&zone->lock, flags);
8629 ret = __alloc_contig_pages(pfn, nr_pages,
8632 return pfn_to_page(pfn);
8633 spin_lock_irqsave(&zone->lock, flags);
8637 spin_unlock_irqrestore(&zone->lock, flags);
8641 #endif /* CONFIG_CONTIG_ALLOC */
8643 void free_contig_range(unsigned long pfn, unsigned int nr_pages)
8645 unsigned int count = 0;
8647 for (; nr_pages--; pfn++) {
8648 struct page *page = pfn_to_page(pfn);
8650 count += page_count(page) != 1;
8653 WARN(count != 0, "%d pages are still in use!\n", count);
8655 EXPORT_SYMBOL(free_contig_range);
8658 * The zone indicated has a new number of managed_pages; batch sizes and percpu
8659 * page high values need to be recalulated.
8661 void __meminit zone_pcp_update(struct zone *zone)
8663 mutex_lock(&pcp_batch_high_lock);
8664 __zone_pcp_update(zone);
8665 mutex_unlock(&pcp_batch_high_lock);
8668 void zone_pcp_reset(struct zone *zone)
8670 unsigned long flags;
8672 struct per_cpu_pageset *pset;
8674 /* avoid races with drain_pages() */
8675 local_irq_save(flags);
8676 if (zone->pageset != &boot_pageset) {
8677 for_each_online_cpu(cpu) {
8678 pset = per_cpu_ptr(zone->pageset, cpu);
8679 drain_zonestat(zone, pset);
8681 free_percpu(zone->pageset);
8682 zone->pageset = &boot_pageset;
8684 local_irq_restore(flags);
8687 #ifdef CONFIG_MEMORY_HOTREMOVE
8689 * All pages in the range must be in a single zone and isolated
8690 * before calling this.
8693 __offline_isolated_pages(unsigned long start_pfn, unsigned long end_pfn)
8699 unsigned long flags;
8700 unsigned long offlined_pages = 0;
8702 /* find the first valid pfn */
8703 for (pfn = start_pfn; pfn < end_pfn; pfn++)
8707 return offlined_pages;
8709 offline_mem_sections(pfn, end_pfn);
8710 zone = page_zone(pfn_to_page(pfn));
8711 spin_lock_irqsave(&zone->lock, flags);
8713 while (pfn < end_pfn) {
8714 if (!pfn_valid(pfn)) {
8718 page = pfn_to_page(pfn);
8720 * The HWPoisoned page may be not in buddy system, and
8721 * page_count() is not 0.
8723 if (unlikely(!PageBuddy(page) && PageHWPoison(page))) {
8729 * At this point all remaining PageOffline() pages have a
8730 * reference count of 0 and can simply be skipped.
8732 if (PageOffline(page)) {
8733 BUG_ON(page_count(page));
8734 BUG_ON(PageBuddy(page));
8740 BUG_ON(page_count(page));
8741 BUG_ON(!PageBuddy(page));
8742 order = page_order(page);
8743 offlined_pages += 1 << order;
8744 del_page_from_free_list(page, zone, order);
8745 pfn += (1 << order);
8747 spin_unlock_irqrestore(&zone->lock, flags);
8749 return offlined_pages;
8753 bool is_free_buddy_page(struct page *page)
8755 struct zone *zone = page_zone(page);
8756 unsigned long pfn = page_to_pfn(page);
8757 unsigned long flags;
8760 spin_lock_irqsave(&zone->lock, flags);
8761 for (order = 0; order < MAX_ORDER; order++) {
8762 struct page *page_head = page - (pfn & ((1 << order) - 1));
8764 if (PageBuddy(page_head) && page_order(page_head) >= order)
8767 spin_unlock_irqrestore(&zone->lock, flags);
8769 return order < MAX_ORDER;
8772 #ifdef CONFIG_MEMORY_FAILURE
8774 * Set PG_hwpoison flag if a given page is confirmed to be a free page. This
8775 * test is performed under the zone lock to prevent a race against page
8778 bool set_hwpoison_free_buddy_page(struct page *page)
8780 struct zone *zone = page_zone(page);
8781 unsigned long pfn = page_to_pfn(page);
8782 unsigned long flags;
8784 bool hwpoisoned = false;
8786 spin_lock_irqsave(&zone->lock, flags);
8787 for (order = 0; order < MAX_ORDER; order++) {
8788 struct page *page_head = page - (pfn & ((1 << order) - 1));
8790 if (PageBuddy(page_head) && page_order(page_head) >= order) {
8791 if (!TestSetPageHWPoison(page))
8796 spin_unlock_irqrestore(&zone->lock, flags);