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/swapops.h>
23 #include <linux/interrupt.h>
24 #include <linux/pagemap.h>
25 #include <linux/jiffies.h>
26 #include <linux/memblock.h>
27 #include <linux/compiler.h>
28 #include <linux/kernel.h>
29 #include <linux/kasan.h>
30 #include <linux/module.h>
31 #include <linux/suspend.h>
32 #include <linux/pagevec.h>
33 #include <linux/blkdev.h>
34 #include <linux/slab.h>
35 #include <linux/ratelimit.h>
36 #include <linux/oom.h>
37 #include <linux/topology.h>
38 #include <linux/sysctl.h>
39 #include <linux/cpu.h>
40 #include <linux/cpuset.h>
41 #include <linux/memory_hotplug.h>
42 #include <linux/nodemask.h>
43 #include <linux/vmalloc.h>
44 #include <linux/vmstat.h>
45 #include <linux/mempolicy.h>
46 #include <linux/memremap.h>
47 #include <linux/stop_machine.h>
48 #include <linux/random.h>
49 #include <linux/sort.h>
50 #include <linux/pfn.h>
51 #include <linux/backing-dev.h>
52 #include <linux/fault-inject.h>
53 #include <linux/page-isolation.h>
54 #include <linux/debugobjects.h>
55 #include <linux/kmemleak.h>
56 #include <linux/compaction.h>
57 #include <trace/events/kmem.h>
58 #include <trace/events/oom.h>
59 #include <linux/prefetch.h>
60 #include <linux/mm_inline.h>
61 #include <linux/mmu_notifier.h>
62 #include <linux/migrate.h>
63 #include <linux/hugetlb.h>
64 #include <linux/sched/rt.h>
65 #include <linux/sched/mm.h>
66 #include <linux/page_owner.h>
67 #include <linux/page_table_check.h>
68 #include <linux/kthread.h>
69 #include <linux/memcontrol.h>
70 #include <linux/ftrace.h>
71 #include <linux/lockdep.h>
72 #include <linux/nmi.h>
73 #include <linux/psi.h>
74 #include <linux/padata.h>
75 #include <linux/khugepaged.h>
76 #include <linux/buffer_head.h>
77 #include <linux/delayacct.h>
78 #include <asm/sections.h>
79 #include <asm/tlbflush.h>
80 #include <asm/div64.h>
83 #include "page_reporting.h"
85 /* Free Page Internal flags: for internal, non-pcp variants of free_pages(). */
86 typedef int __bitwise fpi_t;
88 /* No special request */
89 #define FPI_NONE ((__force fpi_t)0)
92 * Skip free page reporting notification for the (possibly merged) page.
93 * This does not hinder free page reporting from grabbing the page,
94 * reporting it and marking it "reported" - it only skips notifying
95 * the free page reporting infrastructure about a newly freed page. For
96 * example, used when temporarily pulling a page from a freelist and
97 * putting it back unmodified.
99 #define FPI_SKIP_REPORT_NOTIFY ((__force fpi_t)BIT(0))
102 * Place the (possibly merged) page to the tail of the freelist. Will ignore
103 * page shuffling (relevant code - e.g., memory onlining - is expected to
104 * shuffle the whole zone).
106 * Note: No code should rely on this flag for correctness - it's purely
107 * to allow for optimizations when handing back either fresh pages
108 * (memory onlining) or untouched pages (page isolation, free page
111 #define FPI_TO_TAIL ((__force fpi_t)BIT(1))
114 * Don't poison memory with KASAN (only for the tag-based modes).
115 * During boot, all non-reserved memblock memory is exposed to page_alloc.
116 * Poisoning all that memory lengthens boot time, especially on systems with
117 * large amount of RAM. This flag is used to skip that poisoning.
118 * This is only done for the tag-based KASAN modes, as those are able to
119 * detect memory corruptions with the memory tags assigned by default.
120 * All memory allocated normally after boot gets poisoned as usual.
122 #define FPI_SKIP_KASAN_POISON ((__force fpi_t)BIT(2))
124 /* prevent >1 _updater_ of zone percpu pageset ->high and ->batch fields */
125 static DEFINE_MUTEX(pcp_batch_high_lock);
126 #define MIN_PERCPU_PAGELIST_HIGH_FRACTION (8)
131 static DEFINE_PER_CPU(struct pagesets, pagesets) __maybe_unused = {
132 .lock = INIT_LOCAL_LOCK(lock),
135 #ifdef CONFIG_USE_PERCPU_NUMA_NODE_ID
136 DEFINE_PER_CPU(int, numa_node);
137 EXPORT_PER_CPU_SYMBOL(numa_node);
140 DEFINE_STATIC_KEY_TRUE(vm_numa_stat_key);
142 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
144 * N.B., Do NOT reference the '_numa_mem_' per cpu variable directly.
145 * It will not be defined when CONFIG_HAVE_MEMORYLESS_NODES is not defined.
146 * Use the accessor functions set_numa_mem(), numa_mem_id() and cpu_to_mem()
147 * defined in <linux/topology.h>.
149 DEFINE_PER_CPU(int, _numa_mem_); /* Kernel "local memory" node */
150 EXPORT_PER_CPU_SYMBOL(_numa_mem_);
153 /* work_structs for global per-cpu drains */
156 struct work_struct work;
158 static DEFINE_MUTEX(pcpu_drain_mutex);
159 static DEFINE_PER_CPU(struct pcpu_drain, pcpu_drain);
161 #ifdef CONFIG_GCC_PLUGIN_LATENT_ENTROPY
162 volatile unsigned long latent_entropy __latent_entropy;
163 EXPORT_SYMBOL(latent_entropy);
167 * Array of node states.
169 nodemask_t node_states[NR_NODE_STATES] __read_mostly = {
170 [N_POSSIBLE] = NODE_MASK_ALL,
171 [N_ONLINE] = { { [0] = 1UL } },
173 [N_NORMAL_MEMORY] = { { [0] = 1UL } },
174 #ifdef CONFIG_HIGHMEM
175 [N_HIGH_MEMORY] = { { [0] = 1UL } },
177 [N_MEMORY] = { { [0] = 1UL } },
178 [N_CPU] = { { [0] = 1UL } },
181 EXPORT_SYMBOL(node_states);
183 atomic_long_t _totalram_pages __read_mostly;
184 EXPORT_SYMBOL(_totalram_pages);
185 unsigned long totalreserve_pages __read_mostly;
186 unsigned long totalcma_pages __read_mostly;
188 int percpu_pagelist_high_fraction;
189 gfp_t gfp_allowed_mask __read_mostly = GFP_BOOT_MASK;
190 DEFINE_STATIC_KEY_MAYBE(CONFIG_INIT_ON_ALLOC_DEFAULT_ON, init_on_alloc);
191 EXPORT_SYMBOL(init_on_alloc);
193 DEFINE_STATIC_KEY_MAYBE(CONFIG_INIT_ON_FREE_DEFAULT_ON, init_on_free);
194 EXPORT_SYMBOL(init_on_free);
196 static bool _init_on_alloc_enabled_early __read_mostly
197 = IS_ENABLED(CONFIG_INIT_ON_ALLOC_DEFAULT_ON);
198 static int __init early_init_on_alloc(char *buf)
201 return kstrtobool(buf, &_init_on_alloc_enabled_early);
203 early_param("init_on_alloc", early_init_on_alloc);
205 static bool _init_on_free_enabled_early __read_mostly
206 = IS_ENABLED(CONFIG_INIT_ON_FREE_DEFAULT_ON);
207 static int __init early_init_on_free(char *buf)
209 return kstrtobool(buf, &_init_on_free_enabled_early);
211 early_param("init_on_free", early_init_on_free);
214 * A cached value of the page's pageblock's migratetype, used when the page is
215 * put on a pcplist. Used to avoid the pageblock migratetype lookup when
216 * freeing from pcplists in most cases, at the cost of possibly becoming stale.
217 * Also the migratetype set in the page does not necessarily match the pcplist
218 * index, e.g. page might have MIGRATE_CMA set but be on a pcplist with any
219 * other index - this ensures that it will be put on the correct CMA freelist.
221 static inline int get_pcppage_migratetype(struct page *page)
226 static inline void set_pcppage_migratetype(struct page *page, int migratetype)
228 page->index = migratetype;
231 #ifdef CONFIG_PM_SLEEP
233 * The following functions are used by the suspend/hibernate code to temporarily
234 * change gfp_allowed_mask in order to avoid using I/O during memory allocations
235 * while devices are suspended. To avoid races with the suspend/hibernate code,
236 * they should always be called with system_transition_mutex held
237 * (gfp_allowed_mask also should only be modified with system_transition_mutex
238 * held, unless the suspend/hibernate code is guaranteed not to run in parallel
239 * with that modification).
242 static gfp_t saved_gfp_mask;
244 void pm_restore_gfp_mask(void)
246 WARN_ON(!mutex_is_locked(&system_transition_mutex));
247 if (saved_gfp_mask) {
248 gfp_allowed_mask = saved_gfp_mask;
253 void pm_restrict_gfp_mask(void)
255 WARN_ON(!mutex_is_locked(&system_transition_mutex));
256 WARN_ON(saved_gfp_mask);
257 saved_gfp_mask = gfp_allowed_mask;
258 gfp_allowed_mask &= ~(__GFP_IO | __GFP_FS);
261 bool pm_suspended_storage(void)
263 if ((gfp_allowed_mask & (__GFP_IO | __GFP_FS)) == (__GFP_IO | __GFP_FS))
267 #endif /* CONFIG_PM_SLEEP */
269 #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
270 unsigned int pageblock_order __read_mostly;
273 static void __free_pages_ok(struct page *page, unsigned int order,
277 * results with 256, 32 in the lowmem_reserve sysctl:
278 * 1G machine -> (16M dma, 800M-16M normal, 1G-800M high)
279 * 1G machine -> (16M dma, 784M normal, 224M high)
280 * NORMAL allocation will leave 784M/256 of ram reserved in the ZONE_DMA
281 * HIGHMEM allocation will leave 224M/32 of ram reserved in ZONE_NORMAL
282 * HIGHMEM allocation will leave (224M+784M)/256 of ram reserved in ZONE_DMA
284 * TBD: should special case ZONE_DMA32 machines here - in those we normally
285 * don't need any ZONE_NORMAL reservation
287 int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES] = {
288 #ifdef CONFIG_ZONE_DMA
291 #ifdef CONFIG_ZONE_DMA32
295 #ifdef CONFIG_HIGHMEM
301 static char * const zone_names[MAX_NR_ZONES] = {
302 #ifdef CONFIG_ZONE_DMA
305 #ifdef CONFIG_ZONE_DMA32
309 #ifdef CONFIG_HIGHMEM
313 #ifdef CONFIG_ZONE_DEVICE
318 const char * const migratetype_names[MIGRATE_TYPES] = {
326 #ifdef CONFIG_MEMORY_ISOLATION
331 compound_page_dtor * const compound_page_dtors[NR_COMPOUND_DTORS] = {
332 [NULL_COMPOUND_DTOR] = NULL,
333 [COMPOUND_PAGE_DTOR] = free_compound_page,
334 #ifdef CONFIG_HUGETLB_PAGE
335 [HUGETLB_PAGE_DTOR] = free_huge_page,
337 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
338 [TRANSHUGE_PAGE_DTOR] = free_transhuge_page,
342 int min_free_kbytes = 1024;
343 int user_min_free_kbytes = -1;
344 int watermark_boost_factor __read_mostly = 15000;
345 int watermark_scale_factor = 10;
347 static unsigned long nr_kernel_pages __initdata;
348 static unsigned long nr_all_pages __initdata;
349 static unsigned long dma_reserve __initdata;
351 static unsigned long arch_zone_lowest_possible_pfn[MAX_NR_ZONES] __initdata;
352 static unsigned long arch_zone_highest_possible_pfn[MAX_NR_ZONES] __initdata;
353 static unsigned long required_kernelcore __initdata;
354 static unsigned long required_kernelcore_percent __initdata;
355 static unsigned long required_movablecore __initdata;
356 static unsigned long required_movablecore_percent __initdata;
357 static unsigned long zone_movable_pfn[MAX_NUMNODES] __initdata;
358 static bool mirrored_kernelcore __meminitdata;
360 /* movable_zone is the "real" zone pages in ZONE_MOVABLE are taken from */
362 EXPORT_SYMBOL(movable_zone);
365 unsigned int nr_node_ids __read_mostly = MAX_NUMNODES;
366 unsigned int nr_online_nodes __read_mostly = 1;
367 EXPORT_SYMBOL(nr_node_ids);
368 EXPORT_SYMBOL(nr_online_nodes);
371 int page_group_by_mobility_disabled __read_mostly;
373 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
375 * During boot we initialize deferred pages on-demand, as needed, but once
376 * page_alloc_init_late() has finished, the deferred pages are all initialized,
377 * and we can permanently disable that path.
379 static DEFINE_STATIC_KEY_TRUE(deferred_pages);
381 static inline bool deferred_pages_enabled(void)
383 return static_branch_unlikely(&deferred_pages);
386 /* Returns true if the struct page for the pfn is uninitialised */
387 static inline bool __meminit early_page_uninitialised(unsigned long pfn)
389 int nid = early_pfn_to_nid(pfn);
391 if (node_online(nid) && pfn >= NODE_DATA(nid)->first_deferred_pfn)
398 * Returns true when the remaining initialisation should be deferred until
399 * later in the boot cycle when it can be parallelised.
401 static bool __meminit
402 defer_init(int nid, unsigned long pfn, unsigned long end_pfn)
404 static unsigned long prev_end_pfn, nr_initialised;
407 * prev_end_pfn static that contains the end of previous zone
408 * No need to protect because called very early in boot before smp_init.
410 if (prev_end_pfn != end_pfn) {
411 prev_end_pfn = end_pfn;
415 /* Always populate low zones for address-constrained allocations */
416 if (end_pfn < pgdat_end_pfn(NODE_DATA(nid)))
419 if (NODE_DATA(nid)->first_deferred_pfn != ULONG_MAX)
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 static inline bool deferred_pages_enabled(void)
439 static inline bool early_page_uninitialised(unsigned long pfn)
444 static inline bool defer_init(int nid, unsigned long pfn, unsigned long end_pfn)
450 /* Return a pointer to the bitmap storing bits affecting a block of pages */
451 static inline unsigned long *get_pageblock_bitmap(const struct page *page,
454 #ifdef CONFIG_SPARSEMEM
455 return section_to_usemap(__pfn_to_section(pfn));
457 return page_zone(page)->pageblock_flags;
458 #endif /* CONFIG_SPARSEMEM */
461 static inline int pfn_to_bitidx(const struct page *page, unsigned long pfn)
463 #ifdef CONFIG_SPARSEMEM
464 pfn &= (PAGES_PER_SECTION-1);
466 pfn = pfn - round_down(page_zone(page)->zone_start_pfn, pageblock_nr_pages);
467 #endif /* CONFIG_SPARSEMEM */
468 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
471 static __always_inline
472 unsigned long __get_pfnblock_flags_mask(const struct page *page,
476 unsigned long *bitmap;
477 unsigned long bitidx, word_bitidx;
480 bitmap = get_pageblock_bitmap(page, pfn);
481 bitidx = pfn_to_bitidx(page, pfn);
482 word_bitidx = bitidx / BITS_PER_LONG;
483 bitidx &= (BITS_PER_LONG-1);
485 word = bitmap[word_bitidx];
486 return (word >> bitidx) & mask;
490 * get_pfnblock_flags_mask - Return the requested group of flags for the pageblock_nr_pages block of pages
491 * @page: The page within the block of interest
492 * @pfn: The target page frame number
493 * @mask: mask of bits that the caller is interested in
495 * Return: pageblock_bits flags
497 unsigned long get_pfnblock_flags_mask(const struct page *page,
498 unsigned long pfn, unsigned long mask)
500 return __get_pfnblock_flags_mask(page, pfn, mask);
503 static __always_inline int get_pfnblock_migratetype(const struct page *page,
506 return __get_pfnblock_flags_mask(page, pfn, 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 * @mask: mask of bits that the caller is interested in
516 void set_pfnblock_flags_mask(struct page *page, unsigned long flags,
520 unsigned long *bitmap;
521 unsigned long bitidx, word_bitidx;
522 unsigned long old_word, word;
524 BUILD_BUG_ON(NR_PAGEBLOCK_BITS != 4);
525 BUILD_BUG_ON(MIGRATE_TYPES > (1 << PB_migratetype_bits));
527 bitmap = get_pageblock_bitmap(page, pfn);
528 bitidx = pfn_to_bitidx(page, pfn);
529 word_bitidx = bitidx / BITS_PER_LONG;
530 bitidx &= (BITS_PER_LONG-1);
532 VM_BUG_ON_PAGE(!zone_spans_pfn(page_zone(page), pfn), page);
537 word = READ_ONCE(bitmap[word_bitidx]);
539 old_word = cmpxchg(&bitmap[word_bitidx], word, (word & ~mask) | flags);
540 if (word == old_word)
546 void set_pageblock_migratetype(struct page *page, int migratetype)
548 if (unlikely(page_group_by_mobility_disabled &&
549 migratetype < MIGRATE_PCPTYPES))
550 migratetype = MIGRATE_UNMOVABLE;
552 set_pfnblock_flags_mask(page, (unsigned long)migratetype,
553 page_to_pfn(page), MIGRATETYPE_MASK);
556 #ifdef CONFIG_DEBUG_VM
557 static int page_outside_zone_boundaries(struct zone *zone, struct page *page)
561 unsigned long pfn = page_to_pfn(page);
562 unsigned long sp, start_pfn;
565 seq = zone_span_seqbegin(zone);
566 start_pfn = zone->zone_start_pfn;
567 sp = zone->spanned_pages;
568 if (!zone_spans_pfn(zone, pfn))
570 } while (zone_span_seqretry(zone, seq));
573 pr_err("page 0x%lx outside node %d zone %s [ 0x%lx - 0x%lx ]\n",
574 pfn, zone_to_nid(zone), zone->name,
575 start_pfn, start_pfn + sp);
580 static int page_is_consistent(struct zone *zone, struct page *page)
582 if (zone != page_zone(page))
588 * Temporary debugging check for pages not lying within a given zone.
590 static int __maybe_unused bad_range(struct zone *zone, struct page *page)
592 if (page_outside_zone_boundaries(zone, page))
594 if (!page_is_consistent(zone, page))
600 static inline int __maybe_unused bad_range(struct zone *zone, struct page *page)
606 static void bad_page(struct page *page, const char *reason)
608 static unsigned long resume;
609 static unsigned long nr_shown;
610 static unsigned long nr_unshown;
613 * Allow a burst of 60 reports, then keep quiet for that minute;
614 * or allow a steady drip of one report per second.
616 if (nr_shown == 60) {
617 if (time_before(jiffies, resume)) {
623 "BUG: Bad page state: %lu messages suppressed\n",
630 resume = jiffies + 60 * HZ;
632 pr_alert("BUG: Bad page state in process %s pfn:%05lx\n",
633 current->comm, page_to_pfn(page));
634 dump_page(page, reason);
639 /* Leave bad fields for debug, except PageBuddy could make trouble */
640 page_mapcount_reset(page); /* remove PageBuddy */
641 add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE);
644 static inline unsigned int order_to_pindex(int migratetype, int order)
648 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
649 if (order > PAGE_ALLOC_COSTLY_ORDER) {
650 VM_BUG_ON(order != pageblock_order);
651 base = PAGE_ALLOC_COSTLY_ORDER + 1;
654 VM_BUG_ON(order > PAGE_ALLOC_COSTLY_ORDER);
657 return (MIGRATE_PCPTYPES * base) + migratetype;
660 static inline int pindex_to_order(unsigned int pindex)
662 int order = pindex / MIGRATE_PCPTYPES;
664 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
665 if (order > PAGE_ALLOC_COSTLY_ORDER)
666 order = pageblock_order;
668 VM_BUG_ON(order > PAGE_ALLOC_COSTLY_ORDER);
674 static inline bool pcp_allowed_order(unsigned int order)
676 if (order <= PAGE_ALLOC_COSTLY_ORDER)
678 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
679 if (order == pageblock_order)
685 static inline void free_the_page(struct page *page, unsigned int order)
687 if (pcp_allowed_order(order)) /* Via pcp? */
688 free_unref_page(page, order);
690 __free_pages_ok(page, order, FPI_NONE);
694 * Higher-order pages are called "compound pages". They are structured thusly:
696 * The first PAGE_SIZE page is called the "head page" and have PG_head set.
698 * The remaining PAGE_SIZE pages are called "tail pages". PageTail() is encoded
699 * in bit 0 of page->compound_head. The rest of bits is pointer to head page.
701 * The first tail page's ->compound_dtor holds the offset in array of compound
702 * page destructors. See compound_page_dtors.
704 * The first tail page's ->compound_order holds the order of allocation.
705 * This usage means that zero-order pages may not be compound.
708 void free_compound_page(struct page *page)
710 mem_cgroup_uncharge(page_folio(page));
711 free_the_page(page, compound_order(page));
714 static void prep_compound_head(struct page *page, unsigned int order)
716 set_compound_page_dtor(page, COMPOUND_PAGE_DTOR);
717 set_compound_order(page, order);
718 atomic_set(compound_mapcount_ptr(page), -1);
719 atomic_set(compound_pincount_ptr(page), 0);
722 static void prep_compound_tail(struct page *head, int tail_idx)
724 struct page *p = head + tail_idx;
726 p->mapping = TAIL_MAPPING;
727 set_compound_head(p, head);
730 void prep_compound_page(struct page *page, unsigned int order)
733 int nr_pages = 1 << order;
736 for (i = 1; i < nr_pages; i++)
737 prep_compound_tail(page, i);
739 prep_compound_head(page, order);
742 #ifdef CONFIG_DEBUG_PAGEALLOC
743 unsigned int _debug_guardpage_minorder;
745 bool _debug_pagealloc_enabled_early __read_mostly
746 = IS_ENABLED(CONFIG_DEBUG_PAGEALLOC_ENABLE_DEFAULT);
747 EXPORT_SYMBOL(_debug_pagealloc_enabled_early);
748 DEFINE_STATIC_KEY_FALSE(_debug_pagealloc_enabled);
749 EXPORT_SYMBOL(_debug_pagealloc_enabled);
751 DEFINE_STATIC_KEY_FALSE(_debug_guardpage_enabled);
753 static int __init early_debug_pagealloc(char *buf)
755 return kstrtobool(buf, &_debug_pagealloc_enabled_early);
757 early_param("debug_pagealloc", early_debug_pagealloc);
759 static int __init debug_guardpage_minorder_setup(char *buf)
763 if (kstrtoul(buf, 10, &res) < 0 || res > MAX_ORDER / 2) {
764 pr_err("Bad debug_guardpage_minorder value\n");
767 _debug_guardpage_minorder = res;
768 pr_info("Setting debug_guardpage_minorder to %lu\n", res);
771 early_param("debug_guardpage_minorder", debug_guardpage_minorder_setup);
773 static inline bool set_page_guard(struct zone *zone, struct page *page,
774 unsigned int order, int migratetype)
776 if (!debug_guardpage_enabled())
779 if (order >= debug_guardpage_minorder())
782 __SetPageGuard(page);
783 INIT_LIST_HEAD(&page->lru);
784 set_page_private(page, order);
785 /* Guard pages are not available for any usage */
786 __mod_zone_freepage_state(zone, -(1 << order), migratetype);
791 static inline void clear_page_guard(struct zone *zone, struct page *page,
792 unsigned int order, int migratetype)
794 if (!debug_guardpage_enabled())
797 __ClearPageGuard(page);
799 set_page_private(page, 0);
800 if (!is_migrate_isolate(migratetype))
801 __mod_zone_freepage_state(zone, (1 << order), migratetype);
804 static inline bool set_page_guard(struct zone *zone, struct page *page,
805 unsigned int order, int migratetype) { return false; }
806 static inline void clear_page_guard(struct zone *zone, struct page *page,
807 unsigned int order, int migratetype) {}
811 * Enable static keys related to various memory debugging and hardening options.
812 * Some override others, and depend on early params that are evaluated in the
813 * order of appearance. So we need to first gather the full picture of what was
814 * enabled, and then make decisions.
816 void init_mem_debugging_and_hardening(void)
818 bool page_poisoning_requested = false;
820 #ifdef CONFIG_PAGE_POISONING
822 * Page poisoning is debug page alloc for some arches. If
823 * either of those options are enabled, enable poisoning.
825 if (page_poisoning_enabled() ||
826 (!IS_ENABLED(CONFIG_ARCH_SUPPORTS_DEBUG_PAGEALLOC) &&
827 debug_pagealloc_enabled())) {
828 static_branch_enable(&_page_poisoning_enabled);
829 page_poisoning_requested = true;
833 if ((_init_on_alloc_enabled_early || _init_on_free_enabled_early) &&
834 page_poisoning_requested) {
835 pr_info("mem auto-init: CONFIG_PAGE_POISONING is on, "
836 "will take precedence over init_on_alloc and init_on_free\n");
837 _init_on_alloc_enabled_early = false;
838 _init_on_free_enabled_early = false;
841 if (_init_on_alloc_enabled_early)
842 static_branch_enable(&init_on_alloc);
844 static_branch_disable(&init_on_alloc);
846 if (_init_on_free_enabled_early)
847 static_branch_enable(&init_on_free);
849 static_branch_disable(&init_on_free);
851 #ifdef CONFIG_DEBUG_PAGEALLOC
852 if (!debug_pagealloc_enabled())
855 static_branch_enable(&_debug_pagealloc_enabled);
857 if (!debug_guardpage_minorder())
860 static_branch_enable(&_debug_guardpage_enabled);
864 static inline void set_buddy_order(struct page *page, unsigned int order)
866 set_page_private(page, order);
867 __SetPageBuddy(page);
871 * This function checks whether a page is free && is the buddy
872 * we can coalesce a page and its buddy if
873 * (a) the buddy is not in a hole (check before calling!) &&
874 * (b) the buddy is in the buddy system &&
875 * (c) a page and its buddy have the same order &&
876 * (d) a page and its buddy are in the same zone.
878 * For recording whether a page is in the buddy system, we set PageBuddy.
879 * Setting, clearing, and testing PageBuddy is serialized by zone->lock.
881 * For recording page's order, we use page_private(page).
883 static inline bool page_is_buddy(struct page *page, struct page *buddy,
886 if (!page_is_guard(buddy) && !PageBuddy(buddy))
889 if (buddy_order(buddy) != order)
893 * zone check is done late to avoid uselessly calculating
894 * zone/node ids for pages that could never merge.
896 if (page_zone_id(page) != page_zone_id(buddy))
899 VM_BUG_ON_PAGE(page_count(buddy) != 0, buddy);
904 #ifdef CONFIG_COMPACTION
905 static inline struct capture_control *task_capc(struct zone *zone)
907 struct capture_control *capc = current->capture_control;
909 return unlikely(capc) &&
910 !(current->flags & PF_KTHREAD) &&
912 capc->cc->zone == zone ? capc : NULL;
916 compaction_capture(struct capture_control *capc, struct page *page,
917 int order, int migratetype)
919 if (!capc || order != capc->cc->order)
922 /* Do not accidentally pollute CMA or isolated regions*/
923 if (is_migrate_cma(migratetype) ||
924 is_migrate_isolate(migratetype))
928 * Do not let lower order allocations pollute a movable pageblock.
929 * This might let an unmovable request use a reclaimable pageblock
930 * and vice-versa but no more than normal fallback logic which can
931 * have trouble finding a high-order free page.
933 if (order < pageblock_order && migratetype == MIGRATE_MOVABLE)
941 static inline struct capture_control *task_capc(struct zone *zone)
947 compaction_capture(struct capture_control *capc, struct page *page,
948 int order, int migratetype)
952 #endif /* CONFIG_COMPACTION */
954 /* Used for pages not on another list */
955 static inline void add_to_free_list(struct page *page, struct zone *zone,
956 unsigned int order, int migratetype)
958 struct free_area *area = &zone->free_area[order];
960 list_add(&page->lru, &area->free_list[migratetype]);
964 /* Used for pages not on another list */
965 static inline void add_to_free_list_tail(struct page *page, struct zone *zone,
966 unsigned int order, int migratetype)
968 struct free_area *area = &zone->free_area[order];
970 list_add_tail(&page->lru, &area->free_list[migratetype]);
975 * Used for pages which are on another list. Move the pages to the tail
976 * of the list - so the moved pages won't immediately be considered for
977 * allocation again (e.g., optimization for memory onlining).
979 static inline void move_to_free_list(struct page *page, struct zone *zone,
980 unsigned int order, int migratetype)
982 struct free_area *area = &zone->free_area[order];
984 list_move_tail(&page->lru, &area->free_list[migratetype]);
987 static inline void del_page_from_free_list(struct page *page, struct zone *zone,
990 /* clear reported state and update reported page count */
991 if (page_reported(page))
992 __ClearPageReported(page);
994 list_del(&page->lru);
995 __ClearPageBuddy(page);
996 set_page_private(page, 0);
997 zone->free_area[order].nr_free--;
1001 * If this is not the largest possible page, check if the buddy
1002 * of the next-highest order is free. If it is, it's possible
1003 * that pages are being freed that will coalesce soon. In case,
1004 * that is happening, add the free page to the tail of the list
1005 * so it's less likely to be used soon and more likely to be merged
1006 * as a higher order page
1009 buddy_merge_likely(unsigned long pfn, unsigned long buddy_pfn,
1010 struct page *page, unsigned int order)
1012 struct page *higher_page, *higher_buddy;
1013 unsigned long combined_pfn;
1015 if (order >= MAX_ORDER - 2)
1018 combined_pfn = buddy_pfn & pfn;
1019 higher_page = page + (combined_pfn - pfn);
1020 buddy_pfn = __find_buddy_pfn(combined_pfn, order + 1);
1021 higher_buddy = higher_page + (buddy_pfn - combined_pfn);
1023 return page_is_buddy(higher_page, higher_buddy, order + 1);
1027 * Freeing function for a buddy system allocator.
1029 * The concept of a buddy system is to maintain direct-mapped table
1030 * (containing bit values) for memory blocks of various "orders".
1031 * The bottom level table contains the map for the smallest allocatable
1032 * units of memory (here, pages), and each level above it describes
1033 * pairs of units from the levels below, hence, "buddies".
1034 * At a high level, all that happens here is marking the table entry
1035 * at the bottom level available, and propagating the changes upward
1036 * as necessary, plus some accounting needed to play nicely with other
1037 * parts of the VM system.
1038 * At each level, we keep a list of pages, which are heads of continuous
1039 * free pages of length of (1 << order) and marked with PageBuddy.
1040 * Page's order is recorded in page_private(page) field.
1041 * So when we are allocating or freeing one, we can derive the state of the
1042 * other. That is, if we allocate a small block, and both were
1043 * free, the remainder of the region must be split into blocks.
1044 * If a block is freed, and its buddy is also free, then this
1045 * triggers coalescing into a block of larger size.
1050 static inline void __free_one_page(struct page *page,
1052 struct zone *zone, unsigned int order,
1053 int migratetype, fpi_t fpi_flags)
1055 struct capture_control *capc = task_capc(zone);
1056 unsigned int max_order = pageblock_order;
1057 unsigned long buddy_pfn;
1058 unsigned long combined_pfn;
1062 VM_BUG_ON(!zone_is_initialized(zone));
1063 VM_BUG_ON_PAGE(page->flags & PAGE_FLAGS_CHECK_AT_PREP, page);
1065 VM_BUG_ON(migratetype == -1);
1066 if (likely(!is_migrate_isolate(migratetype)))
1067 __mod_zone_freepage_state(zone, 1 << order, migratetype);
1069 VM_BUG_ON_PAGE(pfn & ((1 << order) - 1), page);
1070 VM_BUG_ON_PAGE(bad_range(zone, page), page);
1073 while (order < max_order) {
1074 if (compaction_capture(capc, page, order, migratetype)) {
1075 __mod_zone_freepage_state(zone, -(1 << order),
1079 buddy_pfn = __find_buddy_pfn(pfn, order);
1080 buddy = page + (buddy_pfn - pfn);
1082 if (!page_is_buddy(page, buddy, order))
1085 * Our buddy is free or it is CONFIG_DEBUG_PAGEALLOC guard page,
1086 * merge with it and move up one order.
1088 if (page_is_guard(buddy))
1089 clear_page_guard(zone, buddy, order, migratetype);
1091 del_page_from_free_list(buddy, zone, order);
1092 combined_pfn = buddy_pfn & pfn;
1093 page = page + (combined_pfn - pfn);
1097 if (order < MAX_ORDER - 1) {
1098 /* If we are here, it means order is >= pageblock_order.
1099 * We want to prevent merge between freepages on pageblock
1100 * without fallbacks and normal pageblock. Without this,
1101 * pageblock isolation could cause incorrect freepage or CMA
1102 * accounting or HIGHATOMIC accounting.
1104 * We don't want to hit this code for the more frequent
1105 * low-order merging.
1109 buddy_pfn = __find_buddy_pfn(pfn, order);
1110 buddy = page + (buddy_pfn - pfn);
1111 buddy_mt = get_pageblock_migratetype(buddy);
1113 if (migratetype != buddy_mt
1114 && (!migratetype_is_mergeable(migratetype) ||
1115 !migratetype_is_mergeable(buddy_mt)))
1117 max_order = order + 1;
1118 goto continue_merging;
1122 set_buddy_order(page, order);
1124 if (fpi_flags & FPI_TO_TAIL)
1126 else if (is_shuffle_order(order))
1127 to_tail = shuffle_pick_tail();
1129 to_tail = buddy_merge_likely(pfn, buddy_pfn, page, order);
1132 add_to_free_list_tail(page, zone, order, migratetype);
1134 add_to_free_list(page, zone, order, migratetype);
1136 /* Notify page reporting subsystem of freed page */
1137 if (!(fpi_flags & FPI_SKIP_REPORT_NOTIFY))
1138 page_reporting_notify_free(order);
1142 * A bad page could be due to a number of fields. Instead of multiple branches,
1143 * try and check multiple fields with one check. The caller must do a detailed
1144 * check if necessary.
1146 static inline bool page_expected_state(struct page *page,
1147 unsigned long check_flags)
1149 if (unlikely(atomic_read(&page->_mapcount) != -1))
1152 if (unlikely((unsigned long)page->mapping |
1153 page_ref_count(page) |
1157 (page->flags & check_flags)))
1163 static const char *page_bad_reason(struct page *page, unsigned long flags)
1165 const char *bad_reason = NULL;
1167 if (unlikely(atomic_read(&page->_mapcount) != -1))
1168 bad_reason = "nonzero mapcount";
1169 if (unlikely(page->mapping != NULL))
1170 bad_reason = "non-NULL mapping";
1171 if (unlikely(page_ref_count(page) != 0))
1172 bad_reason = "nonzero _refcount";
1173 if (unlikely(page->flags & flags)) {
1174 if (flags == PAGE_FLAGS_CHECK_AT_PREP)
1175 bad_reason = "PAGE_FLAGS_CHECK_AT_PREP flag(s) set";
1177 bad_reason = "PAGE_FLAGS_CHECK_AT_FREE flag(s) set";
1180 if (unlikely(page->memcg_data))
1181 bad_reason = "page still charged to cgroup";
1186 static void check_free_page_bad(struct page *page)
1189 page_bad_reason(page, PAGE_FLAGS_CHECK_AT_FREE));
1192 static inline int check_free_page(struct page *page)
1194 if (likely(page_expected_state(page, PAGE_FLAGS_CHECK_AT_FREE)))
1197 /* Something has gone sideways, find it */
1198 check_free_page_bad(page);
1202 static int free_tail_pages_check(struct page *head_page, struct page *page)
1207 * We rely page->lru.next never has bit 0 set, unless the page
1208 * is PageTail(). Let's make sure that's true even for poisoned ->lru.
1210 BUILD_BUG_ON((unsigned long)LIST_POISON1 & 1);
1212 if (!IS_ENABLED(CONFIG_DEBUG_VM)) {
1216 switch (page - head_page) {
1218 /* the first tail page: ->mapping may be compound_mapcount() */
1219 if (unlikely(compound_mapcount(page))) {
1220 bad_page(page, "nonzero compound_mapcount");
1226 * the second tail page: ->mapping is
1227 * deferred_list.next -- ignore value.
1231 if (page->mapping != TAIL_MAPPING) {
1232 bad_page(page, "corrupted mapping in tail page");
1237 if (unlikely(!PageTail(page))) {
1238 bad_page(page, "PageTail not set");
1241 if (unlikely(compound_head(page) != head_page)) {
1242 bad_page(page, "compound_head not consistent");
1247 page->mapping = NULL;
1248 clear_compound_head(page);
1253 * Skip KASAN memory poisoning when either:
1255 * 1. Deferred memory initialization has not yet completed,
1256 * see the explanation below.
1257 * 2. Skipping poisoning is requested via FPI_SKIP_KASAN_POISON,
1258 * see the comment next to it.
1259 * 3. Skipping poisoning is requested via __GFP_SKIP_KASAN_POISON,
1260 * see the comment next to it.
1262 * Poisoning pages during deferred memory init will greatly lengthen the
1263 * process and cause problem in large memory systems as the deferred pages
1264 * initialization is done with interrupt disabled.
1266 * Assuming that there will be no reference to those newly initialized
1267 * pages before they are ever allocated, this should have no effect on
1268 * KASAN memory tracking as the poison will be properly inserted at page
1269 * allocation time. The only corner case is when pages are allocated by
1270 * on-demand allocation and then freed again before the deferred pages
1271 * initialization is done, but this is not likely to happen.
1273 static inline bool should_skip_kasan_poison(struct page *page, fpi_t fpi_flags)
1275 return deferred_pages_enabled() ||
1276 (!IS_ENABLED(CONFIG_KASAN_GENERIC) &&
1277 (fpi_flags & FPI_SKIP_KASAN_POISON)) ||
1278 PageSkipKASanPoison(page);
1281 static void kernel_init_free_pages(struct page *page, int numpages)
1285 /* s390's use of memset() could override KASAN redzones. */
1286 kasan_disable_current();
1287 for (i = 0; i < numpages; i++) {
1288 u8 tag = page_kasan_tag(page + i);
1289 page_kasan_tag_reset(page + i);
1290 clear_highpage(page + i);
1291 page_kasan_tag_set(page + i, tag);
1293 kasan_enable_current();
1296 static __always_inline bool free_pages_prepare(struct page *page,
1297 unsigned int order, bool check_free, fpi_t fpi_flags)
1300 bool init = want_init_on_free();
1302 VM_BUG_ON_PAGE(PageTail(page), page);
1304 trace_mm_page_free(page, order);
1306 if (unlikely(PageHWPoison(page)) && !order) {
1308 * Do not let hwpoison pages hit pcplists/buddy
1309 * Untie memcg state and reset page's owner
1311 if (memcg_kmem_enabled() && PageMemcgKmem(page))
1312 __memcg_kmem_uncharge_page(page, order);
1313 reset_page_owner(page, order);
1314 page_table_check_free(page, order);
1319 * Check tail pages before head page information is cleared to
1320 * avoid checking PageCompound for order-0 pages.
1322 if (unlikely(order)) {
1323 bool compound = PageCompound(page);
1326 VM_BUG_ON_PAGE(compound && compound_order(page) != order, page);
1329 ClearPageDoubleMap(page);
1330 ClearPageHasHWPoisoned(page);
1332 for (i = 1; i < (1 << order); i++) {
1334 bad += free_tail_pages_check(page, page + i);
1335 if (unlikely(check_free_page(page + i))) {
1339 (page + i)->flags &= ~PAGE_FLAGS_CHECK_AT_PREP;
1342 if (PageMappingFlags(page))
1343 page->mapping = NULL;
1344 if (memcg_kmem_enabled() && PageMemcgKmem(page))
1345 __memcg_kmem_uncharge_page(page, order);
1347 bad += check_free_page(page);
1351 page_cpupid_reset_last(page);
1352 page->flags &= ~PAGE_FLAGS_CHECK_AT_PREP;
1353 reset_page_owner(page, order);
1354 page_table_check_free(page, order);
1356 if (!PageHighMem(page)) {
1357 debug_check_no_locks_freed(page_address(page),
1358 PAGE_SIZE << order);
1359 debug_check_no_obj_freed(page_address(page),
1360 PAGE_SIZE << order);
1363 kernel_poison_pages(page, 1 << order);
1366 * As memory initialization might be integrated into KASAN,
1367 * KASAN poisoning and memory initialization code must be
1368 * kept together to avoid discrepancies in behavior.
1370 * With hardware tag-based KASAN, memory tags must be set before the
1371 * page becomes unavailable via debug_pagealloc or arch_free_page.
1373 if (!should_skip_kasan_poison(page, fpi_flags)) {
1374 kasan_poison_pages(page, order, init);
1376 /* Memory is already initialized if KASAN did it internally. */
1377 if (kasan_has_integrated_init())
1381 kernel_init_free_pages(page, 1 << order);
1384 * arch_free_page() can make the page's contents inaccessible. s390
1385 * does this. So nothing which can access the page's contents should
1386 * happen after this.
1388 arch_free_page(page, order);
1390 debug_pagealloc_unmap_pages(page, 1 << order);
1395 #ifdef CONFIG_DEBUG_VM
1397 * With DEBUG_VM enabled, order-0 pages are checked immediately when being freed
1398 * to pcp lists. With debug_pagealloc also enabled, they are also rechecked when
1399 * moved from pcp lists to free lists.
1401 static bool free_pcp_prepare(struct page *page, unsigned int order)
1403 return free_pages_prepare(page, order, true, FPI_NONE);
1406 static bool bulkfree_pcp_prepare(struct page *page)
1408 if (debug_pagealloc_enabled_static())
1409 return check_free_page(page);
1415 * With DEBUG_VM disabled, order-0 pages being freed are checked only when
1416 * moving from pcp lists to free list in order to reduce overhead. With
1417 * debug_pagealloc enabled, they are checked also immediately when being freed
1420 static bool free_pcp_prepare(struct page *page, unsigned int order)
1422 if (debug_pagealloc_enabled_static())
1423 return free_pages_prepare(page, order, true, FPI_NONE);
1425 return free_pages_prepare(page, order, false, FPI_NONE);
1428 static bool bulkfree_pcp_prepare(struct page *page)
1430 return check_free_page(page);
1432 #endif /* CONFIG_DEBUG_VM */
1435 * Frees a number of pages from the PCP lists
1436 * Assumes all pages on list are in same zone.
1437 * count is the number of pages to free.
1439 static void free_pcppages_bulk(struct zone *zone, int count,
1440 struct per_cpu_pages *pcp,
1444 int max_pindex = NR_PCP_LISTS - 1;
1446 bool isolated_pageblocks;
1450 * Ensure proper count is passed which otherwise would stuck in the
1451 * below while (list_empty(list)) loop.
1453 count = min(pcp->count, count);
1455 /* Ensure requested pindex is drained first. */
1456 pindex = pindex - 1;
1459 * local_lock_irq held so equivalent to spin_lock_irqsave for
1460 * both PREEMPT_RT and non-PREEMPT_RT configurations.
1462 spin_lock(&zone->lock);
1463 isolated_pageblocks = has_isolate_pageblock(zone);
1466 struct list_head *list;
1469 /* Remove pages from lists in a round-robin fashion. */
1471 if (++pindex > max_pindex)
1472 pindex = min_pindex;
1473 list = &pcp->lists[pindex];
1474 if (!list_empty(list))
1477 if (pindex == max_pindex)
1479 if (pindex == min_pindex)
1483 order = pindex_to_order(pindex);
1484 nr_pages = 1 << order;
1485 BUILD_BUG_ON(MAX_ORDER >= (1<<NR_PCP_ORDER_WIDTH));
1489 page = list_last_entry(list, struct page, lru);
1490 mt = get_pcppage_migratetype(page);
1492 /* must delete to avoid corrupting pcp list */
1493 list_del(&page->lru);
1495 pcp->count -= nr_pages;
1497 if (bulkfree_pcp_prepare(page))
1500 /* MIGRATE_ISOLATE page should not go to pcplists */
1501 VM_BUG_ON_PAGE(is_migrate_isolate(mt), page);
1502 /* Pageblock could have been isolated meanwhile */
1503 if (unlikely(isolated_pageblocks))
1504 mt = get_pageblock_migratetype(page);
1506 __free_one_page(page, page_to_pfn(page), zone, order, mt, FPI_NONE);
1507 trace_mm_page_pcpu_drain(page, order, mt);
1508 } while (count > 0 && !list_empty(list));
1511 spin_unlock(&zone->lock);
1514 static void free_one_page(struct zone *zone,
1515 struct page *page, unsigned long pfn,
1517 int migratetype, fpi_t fpi_flags)
1519 unsigned long flags;
1521 spin_lock_irqsave(&zone->lock, flags);
1522 if (unlikely(has_isolate_pageblock(zone) ||
1523 is_migrate_isolate(migratetype))) {
1524 migratetype = get_pfnblock_migratetype(page, pfn);
1526 __free_one_page(page, pfn, zone, order, migratetype, fpi_flags);
1527 spin_unlock_irqrestore(&zone->lock, flags);
1530 static void __meminit __init_single_page(struct page *page, unsigned long pfn,
1531 unsigned long zone, int nid)
1533 mm_zero_struct_page(page);
1534 set_page_links(page, zone, nid, pfn);
1535 init_page_count(page);
1536 page_mapcount_reset(page);
1537 page_cpupid_reset_last(page);
1538 page_kasan_tag_reset(page);
1540 INIT_LIST_HEAD(&page->lru);
1541 #ifdef WANT_PAGE_VIRTUAL
1542 /* The shift won't overflow because ZONE_NORMAL is below 4G. */
1543 if (!is_highmem_idx(zone))
1544 set_page_address(page, __va(pfn << PAGE_SHIFT));
1548 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
1549 static void __meminit init_reserved_page(unsigned long pfn)
1554 if (!early_page_uninitialised(pfn))
1557 nid = early_pfn_to_nid(pfn);
1558 pgdat = NODE_DATA(nid);
1560 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
1561 struct zone *zone = &pgdat->node_zones[zid];
1563 if (zone_spans_pfn(zone, pfn))
1566 __init_single_page(pfn_to_page(pfn), pfn, zid, nid);
1569 static inline void init_reserved_page(unsigned long pfn)
1572 #endif /* CONFIG_DEFERRED_STRUCT_PAGE_INIT */
1575 * Initialised pages do not have PageReserved set. This function is
1576 * called for each range allocated by the bootmem allocator and
1577 * marks the pages PageReserved. The remaining valid pages are later
1578 * sent to the buddy page allocator.
1580 void __meminit reserve_bootmem_region(phys_addr_t start, phys_addr_t end)
1582 unsigned long start_pfn = PFN_DOWN(start);
1583 unsigned long end_pfn = PFN_UP(end);
1585 for (; start_pfn < end_pfn; start_pfn++) {
1586 if (pfn_valid(start_pfn)) {
1587 struct page *page = pfn_to_page(start_pfn);
1589 init_reserved_page(start_pfn);
1591 /* Avoid false-positive PageTail() */
1592 INIT_LIST_HEAD(&page->lru);
1595 * no need for atomic set_bit because the struct
1596 * page is not visible yet so nobody should
1599 __SetPageReserved(page);
1604 static void __free_pages_ok(struct page *page, unsigned int order,
1607 unsigned long flags;
1609 unsigned long pfn = page_to_pfn(page);
1610 struct zone *zone = page_zone(page);
1612 if (!free_pages_prepare(page, order, true, fpi_flags))
1615 migratetype = get_pfnblock_migratetype(page, pfn);
1617 spin_lock_irqsave(&zone->lock, flags);
1618 if (unlikely(has_isolate_pageblock(zone) ||
1619 is_migrate_isolate(migratetype))) {
1620 migratetype = get_pfnblock_migratetype(page, pfn);
1622 __free_one_page(page, pfn, zone, order, migratetype, fpi_flags);
1623 spin_unlock_irqrestore(&zone->lock, flags);
1625 __count_vm_events(PGFREE, 1 << order);
1628 void __free_pages_core(struct page *page, unsigned int order)
1630 unsigned int nr_pages = 1 << order;
1631 struct page *p = page;
1635 * When initializing the memmap, __init_single_page() sets the refcount
1636 * of all pages to 1 ("allocated"/"not free"). We have to set the
1637 * refcount of all involved pages to 0.
1640 for (loop = 0; loop < (nr_pages - 1); loop++, p++) {
1642 __ClearPageReserved(p);
1643 set_page_count(p, 0);
1645 __ClearPageReserved(p);
1646 set_page_count(p, 0);
1648 atomic_long_add(nr_pages, &page_zone(page)->managed_pages);
1651 * Bypass PCP and place fresh pages right to the tail, primarily
1652 * relevant for memory onlining.
1654 __free_pages_ok(page, order, FPI_TO_TAIL | FPI_SKIP_KASAN_POISON);
1660 * During memory init memblocks map pfns to nids. The search is expensive and
1661 * this caches recent lookups. The implementation of __early_pfn_to_nid
1662 * treats start/end as pfns.
1664 struct mminit_pfnnid_cache {
1665 unsigned long last_start;
1666 unsigned long last_end;
1670 static struct mminit_pfnnid_cache early_pfnnid_cache __meminitdata;
1673 * Required by SPARSEMEM. Given a PFN, return what node the PFN is on.
1675 static int __meminit __early_pfn_to_nid(unsigned long pfn,
1676 struct mminit_pfnnid_cache *state)
1678 unsigned long start_pfn, end_pfn;
1681 if (state->last_start <= pfn && pfn < state->last_end)
1682 return state->last_nid;
1684 nid = memblock_search_pfn_nid(pfn, &start_pfn, &end_pfn);
1685 if (nid != NUMA_NO_NODE) {
1686 state->last_start = start_pfn;
1687 state->last_end = end_pfn;
1688 state->last_nid = nid;
1694 int __meminit early_pfn_to_nid(unsigned long pfn)
1696 static DEFINE_SPINLOCK(early_pfn_lock);
1699 spin_lock(&early_pfn_lock);
1700 nid = __early_pfn_to_nid(pfn, &early_pfnnid_cache);
1702 nid = first_online_node;
1703 spin_unlock(&early_pfn_lock);
1707 #endif /* CONFIG_NUMA */
1709 void __init memblock_free_pages(struct page *page, unsigned long pfn,
1712 if (early_page_uninitialised(pfn))
1714 __free_pages_core(page, order);
1718 * Check that the whole (or subset of) a pageblock given by the interval of
1719 * [start_pfn, end_pfn) is valid and within the same zone, before scanning it
1720 * with the migration of free compaction scanner.
1722 * Return struct page pointer of start_pfn, or NULL if checks were not passed.
1724 * It's possible on some configurations to have a setup like node0 node1 node0
1725 * i.e. it's possible that all pages within a zones range of pages do not
1726 * belong to a single zone. We assume that a border between node0 and node1
1727 * can occur within a single pageblock, but not a node0 node1 node0
1728 * interleaving within a single pageblock. It is therefore sufficient to check
1729 * the first and last page of a pageblock and avoid checking each individual
1730 * page in a pageblock.
1732 struct page *__pageblock_pfn_to_page(unsigned long start_pfn,
1733 unsigned long end_pfn, struct zone *zone)
1735 struct page *start_page;
1736 struct page *end_page;
1738 /* end_pfn is one past the range we are checking */
1741 if (!pfn_valid(start_pfn) || !pfn_valid(end_pfn))
1744 start_page = pfn_to_online_page(start_pfn);
1748 if (page_zone(start_page) != zone)
1751 end_page = pfn_to_page(end_pfn);
1753 /* This gives a shorter code than deriving page_zone(end_page) */
1754 if (page_zone_id(start_page) != page_zone_id(end_page))
1760 void set_zone_contiguous(struct zone *zone)
1762 unsigned long block_start_pfn = zone->zone_start_pfn;
1763 unsigned long block_end_pfn;
1765 block_end_pfn = ALIGN(block_start_pfn + 1, pageblock_nr_pages);
1766 for (; block_start_pfn < zone_end_pfn(zone);
1767 block_start_pfn = block_end_pfn,
1768 block_end_pfn += pageblock_nr_pages) {
1770 block_end_pfn = min(block_end_pfn, zone_end_pfn(zone));
1772 if (!__pageblock_pfn_to_page(block_start_pfn,
1773 block_end_pfn, zone))
1778 /* We confirm that there is no hole */
1779 zone->contiguous = true;
1782 void clear_zone_contiguous(struct zone *zone)
1784 zone->contiguous = false;
1787 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
1788 static void __init deferred_free_range(unsigned long pfn,
1789 unsigned long nr_pages)
1797 page = pfn_to_page(pfn);
1799 /* Free a large naturally-aligned chunk if possible */
1800 if (nr_pages == pageblock_nr_pages &&
1801 (pfn & (pageblock_nr_pages - 1)) == 0) {
1802 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
1803 __free_pages_core(page, pageblock_order);
1807 for (i = 0; i < nr_pages; i++, page++, pfn++) {
1808 if ((pfn & (pageblock_nr_pages - 1)) == 0)
1809 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
1810 __free_pages_core(page, 0);
1814 /* Completion tracking for deferred_init_memmap() threads */
1815 static atomic_t pgdat_init_n_undone __initdata;
1816 static __initdata DECLARE_COMPLETION(pgdat_init_all_done_comp);
1818 static inline void __init pgdat_init_report_one_done(void)
1820 if (atomic_dec_and_test(&pgdat_init_n_undone))
1821 complete(&pgdat_init_all_done_comp);
1825 * Returns true if page needs to be initialized or freed to buddy allocator.
1827 * First we check if pfn is valid on architectures where it is possible to have
1828 * holes within pageblock_nr_pages. On systems where it is not possible, this
1829 * function is optimized out.
1831 * Then, we check if a current large page is valid by only checking the validity
1834 static inline bool __init deferred_pfn_valid(unsigned long pfn)
1836 if (!(pfn & (pageblock_nr_pages - 1)) && !pfn_valid(pfn))
1842 * Free pages to buddy allocator. Try to free aligned pages in
1843 * pageblock_nr_pages sizes.
1845 static void __init deferred_free_pages(unsigned long pfn,
1846 unsigned long end_pfn)
1848 unsigned long nr_pgmask = pageblock_nr_pages - 1;
1849 unsigned long nr_free = 0;
1851 for (; pfn < end_pfn; pfn++) {
1852 if (!deferred_pfn_valid(pfn)) {
1853 deferred_free_range(pfn - nr_free, nr_free);
1855 } else if (!(pfn & nr_pgmask)) {
1856 deferred_free_range(pfn - nr_free, nr_free);
1862 /* Free the last block of pages to allocator */
1863 deferred_free_range(pfn - nr_free, nr_free);
1867 * Initialize struct pages. We minimize pfn page lookups and scheduler checks
1868 * by performing it only once every pageblock_nr_pages.
1869 * Return number of pages initialized.
1871 static unsigned long __init deferred_init_pages(struct zone *zone,
1873 unsigned long end_pfn)
1875 unsigned long nr_pgmask = pageblock_nr_pages - 1;
1876 int nid = zone_to_nid(zone);
1877 unsigned long nr_pages = 0;
1878 int zid = zone_idx(zone);
1879 struct page *page = NULL;
1881 for (; pfn < end_pfn; pfn++) {
1882 if (!deferred_pfn_valid(pfn)) {
1885 } else if (!page || !(pfn & nr_pgmask)) {
1886 page = pfn_to_page(pfn);
1890 __init_single_page(page, pfn, zid, nid);
1897 * This function is meant to pre-load the iterator for the zone init.
1898 * Specifically it walks through the ranges until we are caught up to the
1899 * first_init_pfn value and exits there. If we never encounter the value we
1900 * return false indicating there are no valid ranges left.
1903 deferred_init_mem_pfn_range_in_zone(u64 *i, struct zone *zone,
1904 unsigned long *spfn, unsigned long *epfn,
1905 unsigned long first_init_pfn)
1910 * Start out by walking through the ranges in this zone that have
1911 * already been initialized. We don't need to do anything with them
1912 * so we just need to flush them out of the system.
1914 for_each_free_mem_pfn_range_in_zone(j, zone, spfn, epfn) {
1915 if (*epfn <= first_init_pfn)
1917 if (*spfn < first_init_pfn)
1918 *spfn = first_init_pfn;
1927 * Initialize and free pages. We do it in two loops: first we initialize
1928 * struct page, then free to buddy allocator, because while we are
1929 * freeing pages we can access pages that are ahead (computing buddy
1930 * page in __free_one_page()).
1932 * In order to try and keep some memory in the cache we have the loop
1933 * broken along max page order boundaries. This way we will not cause
1934 * any issues with the buddy page computation.
1936 static unsigned long __init
1937 deferred_init_maxorder(u64 *i, struct zone *zone, unsigned long *start_pfn,
1938 unsigned long *end_pfn)
1940 unsigned long mo_pfn = ALIGN(*start_pfn + 1, MAX_ORDER_NR_PAGES);
1941 unsigned long spfn = *start_pfn, epfn = *end_pfn;
1942 unsigned long nr_pages = 0;
1945 /* First we loop through and initialize the page values */
1946 for_each_free_mem_pfn_range_in_zone_from(j, zone, start_pfn, end_pfn) {
1949 if (mo_pfn <= *start_pfn)
1952 t = min(mo_pfn, *end_pfn);
1953 nr_pages += deferred_init_pages(zone, *start_pfn, t);
1955 if (mo_pfn < *end_pfn) {
1956 *start_pfn = mo_pfn;
1961 /* Reset values and now loop through freeing pages as needed */
1964 for_each_free_mem_pfn_range_in_zone_from(j, zone, &spfn, &epfn) {
1970 t = min(mo_pfn, epfn);
1971 deferred_free_pages(spfn, t);
1981 deferred_init_memmap_chunk(unsigned long start_pfn, unsigned long end_pfn,
1984 unsigned long spfn, epfn;
1985 struct zone *zone = arg;
1988 deferred_init_mem_pfn_range_in_zone(&i, zone, &spfn, &epfn, start_pfn);
1991 * Initialize and free pages in MAX_ORDER sized increments so that we
1992 * can avoid introducing any issues with the buddy allocator.
1994 while (spfn < end_pfn) {
1995 deferred_init_maxorder(&i, zone, &spfn, &epfn);
2000 /* An arch may override for more concurrency. */
2002 deferred_page_init_max_threads(const struct cpumask *node_cpumask)
2007 /* Initialise remaining memory on a node */
2008 static int __init deferred_init_memmap(void *data)
2010 pg_data_t *pgdat = data;
2011 const struct cpumask *cpumask = cpumask_of_node(pgdat->node_id);
2012 unsigned long spfn = 0, epfn = 0;
2013 unsigned long first_init_pfn, flags;
2014 unsigned long start = jiffies;
2016 int zid, max_threads;
2019 /* Bind memory initialisation thread to a local node if possible */
2020 if (!cpumask_empty(cpumask))
2021 set_cpus_allowed_ptr(current, cpumask);
2023 pgdat_resize_lock(pgdat, &flags);
2024 first_init_pfn = pgdat->first_deferred_pfn;
2025 if (first_init_pfn == ULONG_MAX) {
2026 pgdat_resize_unlock(pgdat, &flags);
2027 pgdat_init_report_one_done();
2031 /* Sanity check boundaries */
2032 BUG_ON(pgdat->first_deferred_pfn < pgdat->node_start_pfn);
2033 BUG_ON(pgdat->first_deferred_pfn > pgdat_end_pfn(pgdat));
2034 pgdat->first_deferred_pfn = ULONG_MAX;
2037 * Once we unlock here, the zone cannot be grown anymore, thus if an
2038 * interrupt thread must allocate this early in boot, zone must be
2039 * pre-grown prior to start of deferred page initialization.
2041 pgdat_resize_unlock(pgdat, &flags);
2043 /* Only the highest zone is deferred so find it */
2044 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
2045 zone = pgdat->node_zones + zid;
2046 if (first_init_pfn < zone_end_pfn(zone))
2050 /* If the zone is empty somebody else may have cleared out the zone */
2051 if (!deferred_init_mem_pfn_range_in_zone(&i, zone, &spfn, &epfn,
2055 max_threads = deferred_page_init_max_threads(cpumask);
2057 while (spfn < epfn) {
2058 unsigned long epfn_align = ALIGN(epfn, PAGES_PER_SECTION);
2059 struct padata_mt_job job = {
2060 .thread_fn = deferred_init_memmap_chunk,
2063 .size = epfn_align - spfn,
2064 .align = PAGES_PER_SECTION,
2065 .min_chunk = PAGES_PER_SECTION,
2066 .max_threads = max_threads,
2069 padata_do_multithreaded(&job);
2070 deferred_init_mem_pfn_range_in_zone(&i, zone, &spfn, &epfn,
2074 /* Sanity check that the next zone really is unpopulated */
2075 WARN_ON(++zid < MAX_NR_ZONES && populated_zone(++zone));
2077 pr_info("node %d deferred pages initialised in %ums\n",
2078 pgdat->node_id, jiffies_to_msecs(jiffies - start));
2080 pgdat_init_report_one_done();
2085 * If this zone has deferred pages, try to grow it by initializing enough
2086 * deferred pages to satisfy the allocation specified by order, rounded up to
2087 * the nearest PAGES_PER_SECTION boundary. So we're adding memory in increments
2088 * of SECTION_SIZE bytes by initializing struct pages in increments of
2089 * PAGES_PER_SECTION * sizeof(struct page) bytes.
2091 * Return true when zone was grown, otherwise return false. We return true even
2092 * when we grow less than requested, to let the caller decide if there are
2093 * enough pages to satisfy the allocation.
2095 * Note: We use noinline because this function is needed only during boot, and
2096 * it is called from a __ref function _deferred_grow_zone. This way we are
2097 * making sure that it is not inlined into permanent text section.
2099 static noinline bool __init
2100 deferred_grow_zone(struct zone *zone, unsigned int order)
2102 unsigned long nr_pages_needed = ALIGN(1 << order, PAGES_PER_SECTION);
2103 pg_data_t *pgdat = zone->zone_pgdat;
2104 unsigned long first_deferred_pfn = pgdat->first_deferred_pfn;
2105 unsigned long spfn, epfn, flags;
2106 unsigned long nr_pages = 0;
2109 /* Only the last zone may have deferred pages */
2110 if (zone_end_pfn(zone) != pgdat_end_pfn(pgdat))
2113 pgdat_resize_lock(pgdat, &flags);
2116 * If someone grew this zone while we were waiting for spinlock, return
2117 * true, as there might be enough pages already.
2119 if (first_deferred_pfn != pgdat->first_deferred_pfn) {
2120 pgdat_resize_unlock(pgdat, &flags);
2124 /* If the zone is empty somebody else may have cleared out the zone */
2125 if (!deferred_init_mem_pfn_range_in_zone(&i, zone, &spfn, &epfn,
2126 first_deferred_pfn)) {
2127 pgdat->first_deferred_pfn = ULONG_MAX;
2128 pgdat_resize_unlock(pgdat, &flags);
2129 /* Retry only once. */
2130 return first_deferred_pfn != ULONG_MAX;
2134 * Initialize and free pages in MAX_ORDER sized increments so
2135 * that we can avoid introducing any issues with the buddy
2138 while (spfn < epfn) {
2139 /* update our first deferred PFN for this section */
2140 first_deferred_pfn = spfn;
2142 nr_pages += deferred_init_maxorder(&i, zone, &spfn, &epfn);
2143 touch_nmi_watchdog();
2145 /* We should only stop along section boundaries */
2146 if ((first_deferred_pfn ^ spfn) < PAGES_PER_SECTION)
2149 /* If our quota has been met we can stop here */
2150 if (nr_pages >= nr_pages_needed)
2154 pgdat->first_deferred_pfn = spfn;
2155 pgdat_resize_unlock(pgdat, &flags);
2157 return nr_pages > 0;
2161 * deferred_grow_zone() is __init, but it is called from
2162 * get_page_from_freelist() during early boot until deferred_pages permanently
2163 * disables this call. This is why we have refdata wrapper to avoid warning,
2164 * and to ensure that the function body gets unloaded.
2167 _deferred_grow_zone(struct zone *zone, unsigned int order)
2169 return deferred_grow_zone(zone, order);
2172 #endif /* CONFIG_DEFERRED_STRUCT_PAGE_INIT */
2174 void __init page_alloc_init_late(void)
2179 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
2181 /* There will be num_node_state(N_MEMORY) threads */
2182 atomic_set(&pgdat_init_n_undone, num_node_state(N_MEMORY));
2183 for_each_node_state(nid, N_MEMORY) {
2184 kthread_run(deferred_init_memmap, NODE_DATA(nid), "pgdatinit%d", nid);
2187 /* Block until all are initialised */
2188 wait_for_completion(&pgdat_init_all_done_comp);
2191 * We initialized the rest of the deferred pages. Permanently disable
2192 * on-demand struct page initialization.
2194 static_branch_disable(&deferred_pages);
2196 /* Reinit limits that are based on free pages after the kernel is up */
2197 files_maxfiles_init();
2202 /* Discard memblock private memory */
2205 for_each_node_state(nid, N_MEMORY)
2206 shuffle_free_memory(NODE_DATA(nid));
2208 for_each_populated_zone(zone)
2209 set_zone_contiguous(zone);
2213 /* Free whole pageblock and set its migration type to MIGRATE_CMA. */
2214 void __init init_cma_reserved_pageblock(struct page *page)
2216 unsigned i = pageblock_nr_pages;
2217 struct page *p = page;
2220 __ClearPageReserved(p);
2221 set_page_count(p, 0);
2224 set_pageblock_migratetype(page, MIGRATE_CMA);
2225 set_page_refcounted(page);
2226 __free_pages(page, pageblock_order);
2228 adjust_managed_page_count(page, pageblock_nr_pages);
2229 page_zone(page)->cma_pages += pageblock_nr_pages;
2234 * The order of subdivision here is critical for the IO subsystem.
2235 * Please do not alter this order without good reasons and regression
2236 * testing. Specifically, as large blocks of memory are subdivided,
2237 * the order in which smaller blocks are delivered depends on the order
2238 * they're subdivided in this function. This is the primary factor
2239 * influencing the order in which pages are delivered to the IO
2240 * subsystem according to empirical testing, and this is also justified
2241 * by considering the behavior of a buddy system containing a single
2242 * large block of memory acted on by a series of small allocations.
2243 * This behavior is a critical factor in sglist merging's success.
2247 static inline void expand(struct zone *zone, struct page *page,
2248 int low, int high, int migratetype)
2250 unsigned long size = 1 << high;
2252 while (high > low) {
2255 VM_BUG_ON_PAGE(bad_range(zone, &page[size]), &page[size]);
2258 * Mark as guard pages (or page), that will allow to
2259 * merge back to allocator when buddy will be freed.
2260 * Corresponding page table entries will not be touched,
2261 * pages will stay not present in virtual address space
2263 if (set_page_guard(zone, &page[size], high, migratetype))
2266 add_to_free_list(&page[size], zone, high, migratetype);
2267 set_buddy_order(&page[size], high);
2271 static void check_new_page_bad(struct page *page)
2273 if (unlikely(page->flags & __PG_HWPOISON)) {
2274 /* Don't complain about hwpoisoned pages */
2275 page_mapcount_reset(page); /* remove PageBuddy */
2280 page_bad_reason(page, PAGE_FLAGS_CHECK_AT_PREP));
2284 * This page is about to be returned from the page allocator
2286 static inline int check_new_page(struct page *page)
2288 if (likely(page_expected_state(page,
2289 PAGE_FLAGS_CHECK_AT_PREP|__PG_HWPOISON)))
2292 check_new_page_bad(page);
2296 static bool check_new_pages(struct page *page, unsigned int order)
2299 for (i = 0; i < (1 << order); i++) {
2300 struct page *p = page + i;
2302 if (unlikely(check_new_page(p)))
2309 #ifdef CONFIG_DEBUG_VM
2311 * With DEBUG_VM enabled, order-0 pages are checked for expected state when
2312 * being allocated from pcp lists. With debug_pagealloc also enabled, they are
2313 * also checked when pcp lists are refilled from the free lists.
2315 static inline bool check_pcp_refill(struct page *page, unsigned int order)
2317 if (debug_pagealloc_enabled_static())
2318 return check_new_pages(page, order);
2323 static inline bool check_new_pcp(struct page *page, unsigned int order)
2325 return check_new_pages(page, order);
2329 * With DEBUG_VM disabled, free order-0 pages are checked for expected state
2330 * when pcp lists are being refilled from the free lists. With debug_pagealloc
2331 * enabled, they are also checked when being allocated from the pcp lists.
2333 static inline bool check_pcp_refill(struct page *page, unsigned int order)
2335 return check_new_pages(page, order);
2337 static inline bool check_new_pcp(struct page *page, unsigned int order)
2339 if (debug_pagealloc_enabled_static())
2340 return check_new_pages(page, order);
2344 #endif /* CONFIG_DEBUG_VM */
2346 static inline bool should_skip_kasan_unpoison(gfp_t flags, bool init_tags)
2348 /* Don't skip if a software KASAN mode is enabled. */
2349 if (IS_ENABLED(CONFIG_KASAN_GENERIC) ||
2350 IS_ENABLED(CONFIG_KASAN_SW_TAGS))
2353 /* Skip, if hardware tag-based KASAN is not enabled. */
2354 if (!kasan_hw_tags_enabled())
2358 * With hardware tag-based KASAN enabled, skip if either:
2360 * 1. Memory tags have already been cleared via tag_clear_highpage().
2361 * 2. Skipping has been requested via __GFP_SKIP_KASAN_UNPOISON.
2363 return init_tags || (flags & __GFP_SKIP_KASAN_UNPOISON);
2366 static inline bool should_skip_init(gfp_t flags)
2368 /* Don't skip, if hardware tag-based KASAN is not enabled. */
2369 if (!kasan_hw_tags_enabled())
2372 /* For hardware tag-based KASAN, skip if requested. */
2373 return (flags & __GFP_SKIP_ZERO);
2376 inline void post_alloc_hook(struct page *page, unsigned int order,
2379 bool init = !want_init_on_free() && want_init_on_alloc(gfp_flags) &&
2380 !should_skip_init(gfp_flags);
2381 bool init_tags = init && (gfp_flags & __GFP_ZEROTAGS);
2383 set_page_private(page, 0);
2384 set_page_refcounted(page);
2386 arch_alloc_page(page, order);
2387 debug_pagealloc_map_pages(page, 1 << order);
2390 * Page unpoisoning must happen before memory initialization.
2391 * Otherwise, the poison pattern will be overwritten for __GFP_ZERO
2392 * allocations and the page unpoisoning code will complain.
2394 kernel_unpoison_pages(page, 1 << order);
2397 * As memory initialization might be integrated into KASAN,
2398 * KASAN unpoisoning and memory initializion code must be
2399 * kept together to avoid discrepancies in behavior.
2403 * If memory tags should be zeroed (which happens only when memory
2404 * should be initialized as well).
2409 /* Initialize both memory and tags. */
2410 for (i = 0; i != 1 << order; ++i)
2411 tag_clear_highpage(page + i);
2413 /* Note that memory is already initialized by the loop above. */
2416 if (!should_skip_kasan_unpoison(gfp_flags, init_tags)) {
2417 /* Unpoison shadow memory or set memory tags. */
2418 kasan_unpoison_pages(page, order, init);
2420 /* Note that memory is already initialized by KASAN. */
2421 if (kasan_has_integrated_init())
2424 /* If memory is still not initialized, do it now. */
2426 kernel_init_free_pages(page, 1 << order);
2427 /* Propagate __GFP_SKIP_KASAN_POISON to page flags. */
2428 if (kasan_hw_tags_enabled() && (gfp_flags & __GFP_SKIP_KASAN_POISON))
2429 SetPageSkipKASanPoison(page);
2431 set_page_owner(page, order, gfp_flags);
2432 page_table_check_alloc(page, order);
2435 static void prep_new_page(struct page *page, unsigned int order, gfp_t gfp_flags,
2436 unsigned int alloc_flags)
2438 post_alloc_hook(page, order, gfp_flags);
2440 if (order && (gfp_flags & __GFP_COMP))
2441 prep_compound_page(page, order);
2444 * page is set pfmemalloc when ALLOC_NO_WATERMARKS was necessary to
2445 * allocate the page. The expectation is that the caller is taking
2446 * steps that will free more memory. The caller should avoid the page
2447 * being used for !PFMEMALLOC purposes.
2449 if (alloc_flags & ALLOC_NO_WATERMARKS)
2450 set_page_pfmemalloc(page);
2452 clear_page_pfmemalloc(page);
2456 * Go through the free lists for the given migratetype and remove
2457 * the smallest available page from the freelists
2459 static __always_inline
2460 struct page *__rmqueue_smallest(struct zone *zone, unsigned int order,
2463 unsigned int current_order;
2464 struct free_area *area;
2467 /* Find a page of the appropriate size in the preferred list */
2468 for (current_order = order; current_order < MAX_ORDER; ++current_order) {
2469 area = &(zone->free_area[current_order]);
2470 page = get_page_from_free_area(area, migratetype);
2473 del_page_from_free_list(page, zone, current_order);
2474 expand(zone, page, order, current_order, migratetype);
2475 set_pcppage_migratetype(page, migratetype);
2484 * This array describes the order lists are fallen back to when
2485 * the free lists for the desirable migrate type are depleted
2487 * The other migratetypes do not have fallbacks.
2489 static int fallbacks[MIGRATE_TYPES][3] = {
2490 [MIGRATE_UNMOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_MOVABLE, MIGRATE_TYPES },
2491 [MIGRATE_MOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_UNMOVABLE, MIGRATE_TYPES },
2492 [MIGRATE_RECLAIMABLE] = { MIGRATE_UNMOVABLE, MIGRATE_MOVABLE, MIGRATE_TYPES },
2496 static __always_inline struct page *__rmqueue_cma_fallback(struct zone *zone,
2499 return __rmqueue_smallest(zone, order, MIGRATE_CMA);
2502 static inline struct page *__rmqueue_cma_fallback(struct zone *zone,
2503 unsigned int order) { return NULL; }
2507 * Move the free pages in a range to the freelist tail of the requested type.
2508 * Note that start_page and end_pages are not aligned on a pageblock
2509 * boundary. If alignment is required, use move_freepages_block()
2511 static int move_freepages(struct zone *zone,
2512 unsigned long start_pfn, unsigned long end_pfn,
2513 int migratetype, int *num_movable)
2518 int pages_moved = 0;
2520 for (pfn = start_pfn; pfn <= end_pfn;) {
2521 page = pfn_to_page(pfn);
2522 if (!PageBuddy(page)) {
2524 * We assume that pages that could be isolated for
2525 * migration are movable. But we don't actually try
2526 * isolating, as that would be expensive.
2529 (PageLRU(page) || __PageMovable(page)))
2535 /* Make sure we are not inadvertently changing nodes */
2536 VM_BUG_ON_PAGE(page_to_nid(page) != zone_to_nid(zone), page);
2537 VM_BUG_ON_PAGE(page_zone(page) != zone, page);
2539 order = buddy_order(page);
2540 move_to_free_list(page, zone, order, migratetype);
2542 pages_moved += 1 << order;
2548 int move_freepages_block(struct zone *zone, struct page *page,
2549 int migratetype, int *num_movable)
2551 unsigned long start_pfn, end_pfn, pfn;
2556 pfn = page_to_pfn(page);
2557 start_pfn = pfn & ~(pageblock_nr_pages - 1);
2558 end_pfn = start_pfn + pageblock_nr_pages - 1;
2560 /* Do not cross zone boundaries */
2561 if (!zone_spans_pfn(zone, start_pfn))
2563 if (!zone_spans_pfn(zone, end_pfn))
2566 return move_freepages(zone, start_pfn, end_pfn, migratetype,
2570 static void change_pageblock_range(struct page *pageblock_page,
2571 int start_order, int migratetype)
2573 int nr_pageblocks = 1 << (start_order - pageblock_order);
2575 while (nr_pageblocks--) {
2576 set_pageblock_migratetype(pageblock_page, migratetype);
2577 pageblock_page += pageblock_nr_pages;
2582 * When we are falling back to another migratetype during allocation, try to
2583 * steal extra free pages from the same pageblocks to satisfy further
2584 * allocations, instead of polluting multiple pageblocks.
2586 * If we are stealing a relatively large buddy page, it is likely there will
2587 * be more free pages in the pageblock, so try to steal them all. For
2588 * reclaimable and unmovable allocations, we steal regardless of page size,
2589 * as fragmentation caused by those allocations polluting movable pageblocks
2590 * is worse than movable allocations stealing from unmovable and reclaimable
2593 static bool can_steal_fallback(unsigned int order, int start_mt)
2596 * Leaving this order check is intended, although there is
2597 * relaxed order check in next check. The reason is that
2598 * we can actually steal whole pageblock if this condition met,
2599 * but, below check doesn't guarantee it and that is just heuristic
2600 * so could be changed anytime.
2602 if (order >= pageblock_order)
2605 if (order >= pageblock_order / 2 ||
2606 start_mt == MIGRATE_RECLAIMABLE ||
2607 start_mt == MIGRATE_UNMOVABLE ||
2608 page_group_by_mobility_disabled)
2614 static inline bool boost_watermark(struct zone *zone)
2616 unsigned long max_boost;
2618 if (!watermark_boost_factor)
2621 * Don't bother in zones that are unlikely to produce results.
2622 * On small machines, including kdump capture kernels running
2623 * in a small area, boosting the watermark can cause an out of
2624 * memory situation immediately.
2626 if ((pageblock_nr_pages * 4) > zone_managed_pages(zone))
2629 max_boost = mult_frac(zone->_watermark[WMARK_HIGH],
2630 watermark_boost_factor, 10000);
2633 * high watermark may be uninitialised if fragmentation occurs
2634 * very early in boot so do not boost. We do not fall
2635 * through and boost by pageblock_nr_pages as failing
2636 * allocations that early means that reclaim is not going
2637 * to help and it may even be impossible to reclaim the
2638 * boosted watermark resulting in a hang.
2643 max_boost = max(pageblock_nr_pages, max_boost);
2645 zone->watermark_boost = min(zone->watermark_boost + pageblock_nr_pages,
2652 * This function implements actual steal behaviour. If order is large enough,
2653 * we can steal whole pageblock. If not, we first move freepages in this
2654 * pageblock to our migratetype and determine how many already-allocated pages
2655 * are there in the pageblock with a compatible migratetype. If at least half
2656 * of pages are free or compatible, we can change migratetype of the pageblock
2657 * itself, so pages freed in the future will be put on the correct free list.
2659 static void steal_suitable_fallback(struct zone *zone, struct page *page,
2660 unsigned int alloc_flags, int start_type, bool whole_block)
2662 unsigned int current_order = buddy_order(page);
2663 int free_pages, movable_pages, alike_pages;
2666 old_block_type = get_pageblock_migratetype(page);
2669 * This can happen due to races and we want to prevent broken
2670 * highatomic accounting.
2672 if (is_migrate_highatomic(old_block_type))
2675 /* Take ownership for orders >= pageblock_order */
2676 if (current_order >= pageblock_order) {
2677 change_pageblock_range(page, current_order, start_type);
2682 * Boost watermarks to increase reclaim pressure to reduce the
2683 * likelihood of future fallbacks. Wake kswapd now as the node
2684 * may be balanced overall and kswapd will not wake naturally.
2686 if (boost_watermark(zone) && (alloc_flags & ALLOC_KSWAPD))
2687 set_bit(ZONE_BOOSTED_WATERMARK, &zone->flags);
2689 /* We are not allowed to try stealing from the whole block */
2693 free_pages = move_freepages_block(zone, page, start_type,
2696 * Determine how many pages are compatible with our allocation.
2697 * For movable allocation, it's the number of movable pages which
2698 * we just obtained. For other types it's a bit more tricky.
2700 if (start_type == MIGRATE_MOVABLE) {
2701 alike_pages = movable_pages;
2704 * If we are falling back a RECLAIMABLE or UNMOVABLE allocation
2705 * to MOVABLE pageblock, consider all non-movable pages as
2706 * compatible. If it's UNMOVABLE falling back to RECLAIMABLE or
2707 * vice versa, be conservative since we can't distinguish the
2708 * exact migratetype of non-movable pages.
2710 if (old_block_type == MIGRATE_MOVABLE)
2711 alike_pages = pageblock_nr_pages
2712 - (free_pages + movable_pages);
2717 /* moving whole block can fail due to zone boundary conditions */
2722 * If a sufficient number of pages in the block are either free or of
2723 * comparable migratability as our allocation, claim the whole block.
2725 if (free_pages + alike_pages >= (1 << (pageblock_order-1)) ||
2726 page_group_by_mobility_disabled)
2727 set_pageblock_migratetype(page, start_type);
2732 move_to_free_list(page, zone, current_order, start_type);
2736 * Check whether there is a suitable fallback freepage with requested order.
2737 * If only_stealable is true, this function returns fallback_mt only if
2738 * we can steal other freepages all together. This would help to reduce
2739 * fragmentation due to mixed migratetype pages in one pageblock.
2741 int find_suitable_fallback(struct free_area *area, unsigned int order,
2742 int migratetype, bool only_stealable, bool *can_steal)
2747 if (area->nr_free == 0)
2752 fallback_mt = fallbacks[migratetype][i];
2753 if (fallback_mt == MIGRATE_TYPES)
2756 if (free_area_empty(area, fallback_mt))
2759 if (can_steal_fallback(order, migratetype))
2762 if (!only_stealable)
2773 * Reserve a pageblock for exclusive use of high-order atomic allocations if
2774 * there are no empty page blocks that contain a page with a suitable order
2776 static void reserve_highatomic_pageblock(struct page *page, struct zone *zone,
2777 unsigned int alloc_order)
2780 unsigned long max_managed, flags;
2783 * Limit the number reserved to 1 pageblock or roughly 1% of a zone.
2784 * Check is race-prone but harmless.
2786 max_managed = (zone_managed_pages(zone) / 100) + pageblock_nr_pages;
2787 if (zone->nr_reserved_highatomic >= max_managed)
2790 spin_lock_irqsave(&zone->lock, flags);
2792 /* Recheck the nr_reserved_highatomic limit under the lock */
2793 if (zone->nr_reserved_highatomic >= max_managed)
2797 mt = get_pageblock_migratetype(page);
2798 /* Only reserve normal pageblocks (i.e., they can merge with others) */
2799 if (migratetype_is_mergeable(mt)) {
2800 zone->nr_reserved_highatomic += pageblock_nr_pages;
2801 set_pageblock_migratetype(page, MIGRATE_HIGHATOMIC);
2802 move_freepages_block(zone, page, MIGRATE_HIGHATOMIC, NULL);
2806 spin_unlock_irqrestore(&zone->lock, flags);
2810 * Used when an allocation is about to fail under memory pressure. This
2811 * potentially hurts the reliability of high-order allocations when under
2812 * intense memory pressure but failed atomic allocations should be easier
2813 * to recover from than an OOM.
2815 * If @force is true, try to unreserve a pageblock even though highatomic
2816 * pageblock is exhausted.
2818 static bool unreserve_highatomic_pageblock(const struct alloc_context *ac,
2821 struct zonelist *zonelist = ac->zonelist;
2822 unsigned long flags;
2829 for_each_zone_zonelist_nodemask(zone, z, zonelist, ac->highest_zoneidx,
2832 * Preserve at least one pageblock unless memory pressure
2835 if (!force && zone->nr_reserved_highatomic <=
2839 spin_lock_irqsave(&zone->lock, flags);
2840 for (order = 0; order < MAX_ORDER; order++) {
2841 struct free_area *area = &(zone->free_area[order]);
2843 page = get_page_from_free_area(area, MIGRATE_HIGHATOMIC);
2848 * In page freeing path, migratetype change is racy so
2849 * we can counter several free pages in a pageblock
2850 * in this loop although we changed the pageblock type
2851 * from highatomic to ac->migratetype. So we should
2852 * adjust the count once.
2854 if (is_migrate_highatomic_page(page)) {
2856 * It should never happen but changes to
2857 * locking could inadvertently allow a per-cpu
2858 * drain to add pages to MIGRATE_HIGHATOMIC
2859 * while unreserving so be safe and watch for
2862 zone->nr_reserved_highatomic -= min(
2864 zone->nr_reserved_highatomic);
2868 * Convert to ac->migratetype and avoid the normal
2869 * pageblock stealing heuristics. Minimally, the caller
2870 * is doing the work and needs the pages. More
2871 * importantly, if the block was always converted to
2872 * MIGRATE_UNMOVABLE or another type then the number
2873 * of pageblocks that cannot be completely freed
2876 set_pageblock_migratetype(page, ac->migratetype);
2877 ret = move_freepages_block(zone, page, ac->migratetype,
2880 spin_unlock_irqrestore(&zone->lock, flags);
2884 spin_unlock_irqrestore(&zone->lock, flags);
2891 * Try finding a free buddy page on the fallback list and put it on the free
2892 * list of requested migratetype, possibly along with other pages from the same
2893 * block, depending on fragmentation avoidance heuristics. Returns true if
2894 * fallback was found so that __rmqueue_smallest() can grab it.
2896 * The use of signed ints for order and current_order is a deliberate
2897 * deviation from the rest of this file, to make the for loop
2898 * condition simpler.
2900 static __always_inline bool
2901 __rmqueue_fallback(struct zone *zone, int order, int start_migratetype,
2902 unsigned int alloc_flags)
2904 struct free_area *area;
2906 int min_order = order;
2912 * Do not steal pages from freelists belonging to other pageblocks
2913 * i.e. orders < pageblock_order. If there are no local zones free,
2914 * the zonelists will be reiterated without ALLOC_NOFRAGMENT.
2916 if (alloc_flags & ALLOC_NOFRAGMENT)
2917 min_order = pageblock_order;
2920 * Find the largest available free page in the other list. This roughly
2921 * approximates finding the pageblock with the most free pages, which
2922 * would be too costly to do exactly.
2924 for (current_order = MAX_ORDER - 1; current_order >= min_order;
2926 area = &(zone->free_area[current_order]);
2927 fallback_mt = find_suitable_fallback(area, current_order,
2928 start_migratetype, false, &can_steal);
2929 if (fallback_mt == -1)
2933 * We cannot steal all free pages from the pageblock and the
2934 * requested migratetype is movable. In that case it's better to
2935 * steal and split the smallest available page instead of the
2936 * largest available page, because even if the next movable
2937 * allocation falls back into a different pageblock than this
2938 * one, it won't cause permanent fragmentation.
2940 if (!can_steal && start_migratetype == MIGRATE_MOVABLE
2941 && current_order > order)
2950 for (current_order = order; current_order < MAX_ORDER;
2952 area = &(zone->free_area[current_order]);
2953 fallback_mt = find_suitable_fallback(area, current_order,
2954 start_migratetype, false, &can_steal);
2955 if (fallback_mt != -1)
2960 * This should not happen - we already found a suitable fallback
2961 * when looking for the largest page.
2963 VM_BUG_ON(current_order == MAX_ORDER);
2966 page = get_page_from_free_area(area, fallback_mt);
2968 steal_suitable_fallback(zone, page, alloc_flags, start_migratetype,
2971 trace_mm_page_alloc_extfrag(page, order, current_order,
2972 start_migratetype, fallback_mt);
2979 * Do the hard work of removing an element from the buddy allocator.
2980 * Call me with the zone->lock already held.
2982 static __always_inline struct page *
2983 __rmqueue(struct zone *zone, unsigned int order, int migratetype,
2984 unsigned int alloc_flags)
2988 if (IS_ENABLED(CONFIG_CMA)) {
2990 * Balance movable allocations between regular and CMA areas by
2991 * allocating from CMA when over half of the zone's free memory
2992 * is in the CMA area.
2994 if (alloc_flags & ALLOC_CMA &&
2995 zone_page_state(zone, NR_FREE_CMA_PAGES) >
2996 zone_page_state(zone, NR_FREE_PAGES) / 2) {
2997 page = __rmqueue_cma_fallback(zone, order);
3003 page = __rmqueue_smallest(zone, order, migratetype);
3004 if (unlikely(!page)) {
3005 if (alloc_flags & ALLOC_CMA)
3006 page = __rmqueue_cma_fallback(zone, order);
3008 if (!page && __rmqueue_fallback(zone, order, migratetype,
3014 trace_mm_page_alloc_zone_locked(page, order, migratetype);
3019 * Obtain a specified number of elements from the buddy allocator, all under
3020 * a single hold of the lock, for efficiency. Add them to the supplied list.
3021 * Returns the number of new pages which were placed at *list.
3023 static int rmqueue_bulk(struct zone *zone, unsigned int order,
3024 unsigned long count, struct list_head *list,
3025 int migratetype, unsigned int alloc_flags)
3027 int i, allocated = 0;
3030 * local_lock_irq held so equivalent to spin_lock_irqsave for
3031 * both PREEMPT_RT and non-PREEMPT_RT configurations.
3033 spin_lock(&zone->lock);
3034 for (i = 0; i < count; ++i) {
3035 struct page *page = __rmqueue(zone, order, migratetype,
3037 if (unlikely(page == NULL))
3040 if (unlikely(check_pcp_refill(page, order)))
3044 * Split buddy pages returned by expand() are received here in
3045 * physical page order. The page is added to the tail of
3046 * caller's list. From the callers perspective, the linked list
3047 * is ordered by page number under some conditions. This is
3048 * useful for IO devices that can forward direction from the
3049 * head, thus also in the physical page order. This is useful
3050 * for IO devices that can merge IO requests if the physical
3051 * pages are ordered properly.
3053 list_add_tail(&page->lru, list);
3055 if (is_migrate_cma(get_pcppage_migratetype(page)))
3056 __mod_zone_page_state(zone, NR_FREE_CMA_PAGES,
3061 * i pages were removed from the buddy list even if some leak due
3062 * to check_pcp_refill failing so adjust NR_FREE_PAGES based
3063 * on i. Do not confuse with 'allocated' which is the number of
3064 * pages added to the pcp list.
3066 __mod_zone_page_state(zone, NR_FREE_PAGES, -(i << order));
3067 spin_unlock(&zone->lock);
3073 * Called from the vmstat counter updater to drain pagesets of this
3074 * currently executing processor on remote nodes after they have
3077 * Note that this function must be called with the thread pinned to
3078 * a single processor.
3080 void drain_zone_pages(struct zone *zone, struct per_cpu_pages *pcp)
3082 unsigned long flags;
3083 int to_drain, batch;
3085 local_lock_irqsave(&pagesets.lock, flags);
3086 batch = READ_ONCE(pcp->batch);
3087 to_drain = min(pcp->count, batch);
3089 free_pcppages_bulk(zone, to_drain, pcp, 0);
3090 local_unlock_irqrestore(&pagesets.lock, flags);
3095 * Drain pcplists of the indicated processor and zone.
3097 * The processor must either be the current processor and the
3098 * thread pinned to the current processor or a processor that
3101 static void drain_pages_zone(unsigned int cpu, struct zone *zone)
3103 unsigned long flags;
3104 struct per_cpu_pages *pcp;
3106 local_lock_irqsave(&pagesets.lock, flags);
3108 pcp = per_cpu_ptr(zone->per_cpu_pageset, cpu);
3110 free_pcppages_bulk(zone, pcp->count, pcp, 0);
3112 local_unlock_irqrestore(&pagesets.lock, flags);
3116 * Drain pcplists of all zones on the indicated processor.
3118 * The processor must either be the current processor and the
3119 * thread pinned to the current processor or a processor that
3122 static void drain_pages(unsigned int cpu)
3126 for_each_populated_zone(zone) {
3127 drain_pages_zone(cpu, zone);
3132 * Spill all of this CPU's per-cpu pages back into the buddy allocator.
3134 * The CPU has to be pinned. When zone parameter is non-NULL, spill just
3135 * the single zone's pages.
3137 void drain_local_pages(struct zone *zone)
3139 int cpu = smp_processor_id();
3142 drain_pages_zone(cpu, zone);
3147 static void drain_local_pages_wq(struct work_struct *work)
3149 struct pcpu_drain *drain;
3151 drain = container_of(work, struct pcpu_drain, work);
3154 * drain_all_pages doesn't use proper cpu hotplug protection so
3155 * we can race with cpu offline when the WQ can move this from
3156 * a cpu pinned worker to an unbound one. We can operate on a different
3157 * cpu which is alright but we also have to make sure to not move to
3161 drain_local_pages(drain->zone);
3166 * The implementation of drain_all_pages(), exposing an extra parameter to
3167 * drain on all cpus.
3169 * drain_all_pages() is optimized to only execute on cpus where pcplists are
3170 * not empty. The check for non-emptiness can however race with a free to
3171 * pcplist that has not yet increased the pcp->count from 0 to 1. Callers
3172 * that need the guarantee that every CPU has drained can disable the
3173 * optimizing racy check.
3175 static void __drain_all_pages(struct zone *zone, bool force_all_cpus)
3180 * Allocate in the BSS so we won't require allocation in
3181 * direct reclaim path for CONFIG_CPUMASK_OFFSTACK=y
3183 static cpumask_t cpus_with_pcps;
3186 * Make sure nobody triggers this path before mm_percpu_wq is fully
3189 if (WARN_ON_ONCE(!mm_percpu_wq))
3193 * Do not drain if one is already in progress unless it's specific to
3194 * a zone. Such callers are primarily CMA and memory hotplug and need
3195 * the drain to be complete when the call returns.
3197 if (unlikely(!mutex_trylock(&pcpu_drain_mutex))) {
3200 mutex_lock(&pcpu_drain_mutex);
3204 * We don't care about racing with CPU hotplug event
3205 * as offline notification will cause the notified
3206 * cpu to drain that CPU pcps and on_each_cpu_mask
3207 * disables preemption as part of its processing
3209 for_each_online_cpu(cpu) {
3210 struct per_cpu_pages *pcp;
3212 bool has_pcps = false;
3214 if (force_all_cpus) {
3216 * The pcp.count check is racy, some callers need a
3217 * guarantee that no cpu is missed.
3221 pcp = per_cpu_ptr(zone->per_cpu_pageset, cpu);
3225 for_each_populated_zone(z) {
3226 pcp = per_cpu_ptr(z->per_cpu_pageset, cpu);
3235 cpumask_set_cpu(cpu, &cpus_with_pcps);
3237 cpumask_clear_cpu(cpu, &cpus_with_pcps);
3240 for_each_cpu(cpu, &cpus_with_pcps) {
3241 struct pcpu_drain *drain = per_cpu_ptr(&pcpu_drain, cpu);
3244 INIT_WORK(&drain->work, drain_local_pages_wq);
3245 queue_work_on(cpu, mm_percpu_wq, &drain->work);
3247 for_each_cpu(cpu, &cpus_with_pcps)
3248 flush_work(&per_cpu_ptr(&pcpu_drain, cpu)->work);
3250 mutex_unlock(&pcpu_drain_mutex);
3254 * Spill all the per-cpu pages from all CPUs back into the buddy allocator.
3256 * When zone parameter is non-NULL, spill just the single zone's pages.
3258 * Note that this can be extremely slow as the draining happens in a workqueue.
3260 void drain_all_pages(struct zone *zone)
3262 __drain_all_pages(zone, false);
3265 #ifdef CONFIG_HIBERNATION
3268 * Touch the watchdog for every WD_PAGE_COUNT pages.
3270 #define WD_PAGE_COUNT (128*1024)
3272 void mark_free_pages(struct zone *zone)
3274 unsigned long pfn, max_zone_pfn, page_count = WD_PAGE_COUNT;
3275 unsigned long flags;
3276 unsigned int order, t;
3279 if (zone_is_empty(zone))
3282 spin_lock_irqsave(&zone->lock, flags);
3284 max_zone_pfn = zone_end_pfn(zone);
3285 for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
3286 if (pfn_valid(pfn)) {
3287 page = pfn_to_page(pfn);
3289 if (!--page_count) {
3290 touch_nmi_watchdog();
3291 page_count = WD_PAGE_COUNT;
3294 if (page_zone(page) != zone)
3297 if (!swsusp_page_is_forbidden(page))
3298 swsusp_unset_page_free(page);
3301 for_each_migratetype_order(order, t) {
3302 list_for_each_entry(page,
3303 &zone->free_area[order].free_list[t], lru) {
3306 pfn = page_to_pfn(page);
3307 for (i = 0; i < (1UL << order); i++) {
3308 if (!--page_count) {
3309 touch_nmi_watchdog();
3310 page_count = WD_PAGE_COUNT;
3312 swsusp_set_page_free(pfn_to_page(pfn + i));
3316 spin_unlock_irqrestore(&zone->lock, flags);
3318 #endif /* CONFIG_PM */
3320 static bool free_unref_page_prepare(struct page *page, unsigned long pfn,
3325 if (!free_pcp_prepare(page, order))
3328 migratetype = get_pfnblock_migratetype(page, pfn);
3329 set_pcppage_migratetype(page, migratetype);
3333 static int nr_pcp_free(struct per_cpu_pages *pcp, int high, int batch,
3336 int min_nr_free, max_nr_free;
3338 /* Free everything if batch freeing high-order pages. */
3339 if (unlikely(free_high))
3342 /* Check for PCP disabled or boot pageset */
3343 if (unlikely(high < batch))
3346 /* Leave at least pcp->batch pages on the list */
3347 min_nr_free = batch;
3348 max_nr_free = high - batch;
3351 * Double the number of pages freed each time there is subsequent
3352 * freeing of pages without any allocation.
3354 batch <<= pcp->free_factor;
3355 if (batch < max_nr_free)
3357 batch = clamp(batch, min_nr_free, max_nr_free);
3362 static int nr_pcp_high(struct per_cpu_pages *pcp, struct zone *zone,
3365 int high = READ_ONCE(pcp->high);
3367 if (unlikely(!high || free_high))
3370 if (!test_bit(ZONE_RECLAIM_ACTIVE, &zone->flags))
3374 * If reclaim is active, limit the number of pages that can be
3375 * stored on pcp lists
3377 return min(READ_ONCE(pcp->batch) << 2, high);
3380 static void free_unref_page_commit(struct page *page, int migratetype,
3383 struct zone *zone = page_zone(page);
3384 struct per_cpu_pages *pcp;
3389 __count_vm_event(PGFREE);
3390 pcp = this_cpu_ptr(zone->per_cpu_pageset);
3391 pindex = order_to_pindex(migratetype, order);
3392 list_add(&page->lru, &pcp->lists[pindex]);
3393 pcp->count += 1 << order;
3396 * As high-order pages other than THP's stored on PCP can contribute
3397 * to fragmentation, limit the number stored when PCP is heavily
3398 * freeing without allocation. The remainder after bulk freeing
3399 * stops will be drained from vmstat refresh context.
3401 free_high = (pcp->free_factor && order && order <= PAGE_ALLOC_COSTLY_ORDER);
3403 high = nr_pcp_high(pcp, zone, free_high);
3404 if (pcp->count >= high) {
3405 int batch = READ_ONCE(pcp->batch);
3407 free_pcppages_bulk(zone, nr_pcp_free(pcp, high, batch, free_high), pcp, pindex);
3414 void free_unref_page(struct page *page, unsigned int order)
3416 unsigned long flags;
3417 unsigned long pfn = page_to_pfn(page);
3420 if (!free_unref_page_prepare(page, pfn, order))
3424 * We only track unmovable, reclaimable and movable on pcp lists.
3425 * Place ISOLATE pages on the isolated list because they are being
3426 * offlined but treat HIGHATOMIC as movable pages so we can get those
3427 * areas back if necessary. Otherwise, we may have to free
3428 * excessively into the page allocator
3430 migratetype = get_pcppage_migratetype(page);
3431 if (unlikely(migratetype >= MIGRATE_PCPTYPES)) {
3432 if (unlikely(is_migrate_isolate(migratetype))) {
3433 free_one_page(page_zone(page), page, pfn, order, migratetype, FPI_NONE);
3436 migratetype = MIGRATE_MOVABLE;
3439 local_lock_irqsave(&pagesets.lock, flags);
3440 free_unref_page_commit(page, migratetype, order);
3441 local_unlock_irqrestore(&pagesets.lock, flags);
3445 * Free a list of 0-order pages
3447 void free_unref_page_list(struct list_head *list)
3449 struct page *page, *next;
3450 unsigned long flags;
3451 int batch_count = 0;
3454 /* Prepare pages for freeing */
3455 list_for_each_entry_safe(page, next, list, lru) {
3456 unsigned long pfn = page_to_pfn(page);
3457 if (!free_unref_page_prepare(page, pfn, 0)) {
3458 list_del(&page->lru);
3463 * Free isolated pages directly to the allocator, see
3464 * comment in free_unref_page.
3466 migratetype = get_pcppage_migratetype(page);
3467 if (unlikely(is_migrate_isolate(migratetype))) {
3468 list_del(&page->lru);
3469 free_one_page(page_zone(page), page, pfn, 0, migratetype, FPI_NONE);
3474 local_lock_irqsave(&pagesets.lock, flags);
3475 list_for_each_entry_safe(page, next, list, lru) {
3477 * Non-isolated types over MIGRATE_PCPTYPES get added
3478 * to the MIGRATE_MOVABLE pcp list.
3480 migratetype = get_pcppage_migratetype(page);
3481 if (unlikely(migratetype >= MIGRATE_PCPTYPES))
3482 migratetype = MIGRATE_MOVABLE;
3484 trace_mm_page_free_batched(page);
3485 free_unref_page_commit(page, migratetype, 0);
3488 * Guard against excessive IRQ disabled times when we get
3489 * a large list of pages to free.
3491 if (++batch_count == SWAP_CLUSTER_MAX) {
3492 local_unlock_irqrestore(&pagesets.lock, flags);
3494 local_lock_irqsave(&pagesets.lock, flags);
3497 local_unlock_irqrestore(&pagesets.lock, flags);
3501 * split_page takes a non-compound higher-order page, and splits it into
3502 * n (1<<order) sub-pages: page[0..n]
3503 * Each sub-page must be freed individually.
3505 * Note: this is probably too low level an operation for use in drivers.
3506 * Please consult with lkml before using this in your driver.
3508 void split_page(struct page *page, unsigned int order)
3512 VM_BUG_ON_PAGE(PageCompound(page), page);
3513 VM_BUG_ON_PAGE(!page_count(page), page);
3515 for (i = 1; i < (1 << order); i++)
3516 set_page_refcounted(page + i);
3517 split_page_owner(page, 1 << order);
3518 split_page_memcg(page, 1 << order);
3520 EXPORT_SYMBOL_GPL(split_page);
3522 int __isolate_free_page(struct page *page, unsigned int order)
3524 unsigned long watermark;
3528 BUG_ON(!PageBuddy(page));
3530 zone = page_zone(page);
3531 mt = get_pageblock_migratetype(page);
3533 if (!is_migrate_isolate(mt)) {
3535 * Obey watermarks as if the page was being allocated. We can
3536 * emulate a high-order watermark check with a raised order-0
3537 * watermark, because we already know our high-order page
3540 watermark = zone->_watermark[WMARK_MIN] + (1UL << order);
3541 if (!zone_watermark_ok(zone, 0, watermark, 0, ALLOC_CMA))
3544 __mod_zone_freepage_state(zone, -(1UL << order), mt);
3547 /* Remove page from free list */
3549 del_page_from_free_list(page, zone, order);
3552 * Set the pageblock if the isolated page is at least half of a
3555 if (order >= pageblock_order - 1) {
3556 struct page *endpage = page + (1 << order) - 1;
3557 for (; page < endpage; page += pageblock_nr_pages) {
3558 int mt = get_pageblock_migratetype(page);
3560 * Only change normal pageblocks (i.e., they can merge
3563 if (migratetype_is_mergeable(mt))
3564 set_pageblock_migratetype(page,
3570 return 1UL << order;
3574 * __putback_isolated_page - Return a now-isolated page back where we got it
3575 * @page: Page that was isolated
3576 * @order: Order of the isolated page
3577 * @mt: The page's pageblock's migratetype
3579 * This function is meant to return a page pulled from the free lists via
3580 * __isolate_free_page back to the free lists they were pulled from.
3582 void __putback_isolated_page(struct page *page, unsigned int order, int mt)
3584 struct zone *zone = page_zone(page);
3586 /* zone lock should be held when this function is called */
3587 lockdep_assert_held(&zone->lock);
3589 /* Return isolated page to tail of freelist. */
3590 __free_one_page(page, page_to_pfn(page), zone, order, mt,
3591 FPI_SKIP_REPORT_NOTIFY | FPI_TO_TAIL);
3595 * Update NUMA hit/miss statistics
3597 * Must be called with interrupts disabled.
3599 static inline void zone_statistics(struct zone *preferred_zone, struct zone *z,
3603 enum numa_stat_item local_stat = NUMA_LOCAL;
3605 /* skip numa counters update if numa stats is disabled */
3606 if (!static_branch_likely(&vm_numa_stat_key))
3609 if (zone_to_nid(z) != numa_node_id())
3610 local_stat = NUMA_OTHER;
3612 if (zone_to_nid(z) == zone_to_nid(preferred_zone))
3613 __count_numa_events(z, NUMA_HIT, nr_account);
3615 __count_numa_events(z, NUMA_MISS, nr_account);
3616 __count_numa_events(preferred_zone, NUMA_FOREIGN, nr_account);
3618 __count_numa_events(z, local_stat, nr_account);
3622 /* Remove page from the per-cpu list, caller must protect the list */
3624 struct page *__rmqueue_pcplist(struct zone *zone, unsigned int order,
3626 unsigned int alloc_flags,
3627 struct per_cpu_pages *pcp,
3628 struct list_head *list)
3633 if (list_empty(list)) {
3634 int batch = READ_ONCE(pcp->batch);
3638 * Scale batch relative to order if batch implies
3639 * free pages can be stored on the PCP. Batch can
3640 * be 1 for small zones or for boot pagesets which
3641 * should never store free pages as the pages may
3642 * belong to arbitrary zones.
3645 batch = max(batch >> order, 2);
3646 alloced = rmqueue_bulk(zone, order,
3648 migratetype, alloc_flags);
3650 pcp->count += alloced << order;
3651 if (unlikely(list_empty(list)))
3655 page = list_first_entry(list, struct page, lru);
3656 list_del(&page->lru);
3657 pcp->count -= 1 << order;
3658 } while (check_new_pcp(page, order));
3663 /* Lock and remove page from the per-cpu list */
3664 static struct page *rmqueue_pcplist(struct zone *preferred_zone,
3665 struct zone *zone, unsigned int order,
3666 gfp_t gfp_flags, int migratetype,
3667 unsigned int alloc_flags)
3669 struct per_cpu_pages *pcp;
3670 struct list_head *list;
3672 unsigned long flags;
3674 local_lock_irqsave(&pagesets.lock, flags);
3677 * On allocation, reduce the number of pages that are batch freed.
3678 * See nr_pcp_free() where free_factor is increased for subsequent
3681 pcp = this_cpu_ptr(zone->per_cpu_pageset);
3682 pcp->free_factor >>= 1;
3683 list = &pcp->lists[order_to_pindex(migratetype, order)];
3684 page = __rmqueue_pcplist(zone, order, migratetype, alloc_flags, pcp, list);
3685 local_unlock_irqrestore(&pagesets.lock, flags);
3687 __count_zid_vm_events(PGALLOC, page_zonenum(page), 1);
3688 zone_statistics(preferred_zone, zone, 1);
3694 * Allocate a page from the given zone. Use pcplists for order-0 allocations.
3697 struct page *rmqueue(struct zone *preferred_zone,
3698 struct zone *zone, unsigned int order,
3699 gfp_t gfp_flags, unsigned int alloc_flags,
3702 unsigned long flags;
3705 if (likely(pcp_allowed_order(order))) {
3707 * MIGRATE_MOVABLE pcplist could have the pages on CMA area and
3708 * we need to skip it when CMA area isn't allowed.
3710 if (!IS_ENABLED(CONFIG_CMA) || alloc_flags & ALLOC_CMA ||
3711 migratetype != MIGRATE_MOVABLE) {
3712 page = rmqueue_pcplist(preferred_zone, zone, order,
3713 gfp_flags, migratetype, alloc_flags);
3719 * We most definitely don't want callers attempting to
3720 * allocate greater than order-1 page units with __GFP_NOFAIL.
3722 WARN_ON_ONCE((gfp_flags & __GFP_NOFAIL) && (order > 1));
3726 spin_lock_irqsave(&zone->lock, flags);
3728 * order-0 request can reach here when the pcplist is skipped
3729 * due to non-CMA allocation context. HIGHATOMIC area is
3730 * reserved for high-order atomic allocation, so order-0
3731 * request should skip it.
3733 if (order > 0 && alloc_flags & ALLOC_HARDER) {
3734 page = __rmqueue_smallest(zone, order, MIGRATE_HIGHATOMIC);
3736 trace_mm_page_alloc_zone_locked(page, order, migratetype);
3739 page = __rmqueue(zone, order, migratetype, alloc_flags);
3743 __mod_zone_freepage_state(zone, -(1 << order),
3744 get_pcppage_migratetype(page));
3745 spin_unlock_irqrestore(&zone->lock, flags);
3746 } while (check_new_pages(page, order));
3748 __count_zid_vm_events(PGALLOC, page_zonenum(page), 1 << order);
3749 zone_statistics(preferred_zone, zone, 1);
3752 /* Separate test+clear to avoid unnecessary atomics */
3753 if (test_bit(ZONE_BOOSTED_WATERMARK, &zone->flags)) {
3754 clear_bit(ZONE_BOOSTED_WATERMARK, &zone->flags);
3755 wakeup_kswapd(zone, 0, 0, zone_idx(zone));
3758 VM_BUG_ON_PAGE(page && bad_range(zone, page), page);
3762 spin_unlock_irqrestore(&zone->lock, flags);
3766 #ifdef CONFIG_FAIL_PAGE_ALLOC
3769 struct fault_attr attr;
3771 bool ignore_gfp_highmem;
3772 bool ignore_gfp_reclaim;
3774 } fail_page_alloc = {
3775 .attr = FAULT_ATTR_INITIALIZER,
3776 .ignore_gfp_reclaim = true,
3777 .ignore_gfp_highmem = true,
3781 static int __init setup_fail_page_alloc(char *str)
3783 return setup_fault_attr(&fail_page_alloc.attr, str);
3785 __setup("fail_page_alloc=", setup_fail_page_alloc);
3787 static bool __should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
3789 if (order < fail_page_alloc.min_order)
3791 if (gfp_mask & __GFP_NOFAIL)
3793 if (fail_page_alloc.ignore_gfp_highmem && (gfp_mask & __GFP_HIGHMEM))
3795 if (fail_page_alloc.ignore_gfp_reclaim &&
3796 (gfp_mask & __GFP_DIRECT_RECLAIM))
3799 return should_fail(&fail_page_alloc.attr, 1 << order);
3802 #ifdef CONFIG_FAULT_INJECTION_DEBUG_FS
3804 static int __init fail_page_alloc_debugfs(void)
3806 umode_t mode = S_IFREG | 0600;
3809 dir = fault_create_debugfs_attr("fail_page_alloc", NULL,
3810 &fail_page_alloc.attr);
3812 debugfs_create_bool("ignore-gfp-wait", mode, dir,
3813 &fail_page_alloc.ignore_gfp_reclaim);
3814 debugfs_create_bool("ignore-gfp-highmem", mode, dir,
3815 &fail_page_alloc.ignore_gfp_highmem);
3816 debugfs_create_u32("min-order", mode, dir, &fail_page_alloc.min_order);
3821 late_initcall(fail_page_alloc_debugfs);
3823 #endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */
3825 #else /* CONFIG_FAIL_PAGE_ALLOC */
3827 static inline bool __should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
3832 #endif /* CONFIG_FAIL_PAGE_ALLOC */
3834 noinline bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
3836 return __should_fail_alloc_page(gfp_mask, order);
3838 ALLOW_ERROR_INJECTION(should_fail_alloc_page, TRUE);
3840 static inline long __zone_watermark_unusable_free(struct zone *z,
3841 unsigned int order, unsigned int alloc_flags)
3843 const bool alloc_harder = (alloc_flags & (ALLOC_HARDER|ALLOC_OOM));
3844 long unusable_free = (1 << order) - 1;
3847 * If the caller does not have rights to ALLOC_HARDER then subtract
3848 * the high-atomic reserves. This will over-estimate the size of the
3849 * atomic reserve but it avoids a search.
3851 if (likely(!alloc_harder))
3852 unusable_free += z->nr_reserved_highatomic;
3855 /* If allocation can't use CMA areas don't use free CMA pages */
3856 if (!(alloc_flags & ALLOC_CMA))
3857 unusable_free += zone_page_state(z, NR_FREE_CMA_PAGES);
3860 return unusable_free;
3864 * Return true if free base pages are above 'mark'. For high-order checks it
3865 * will return true of the order-0 watermark is reached and there is at least
3866 * one free page of a suitable size. Checking now avoids taking the zone lock
3867 * to check in the allocation paths if no pages are free.
3869 bool __zone_watermark_ok(struct zone *z, unsigned int order, unsigned long mark,
3870 int highest_zoneidx, unsigned int alloc_flags,
3875 const bool alloc_harder = (alloc_flags & (ALLOC_HARDER|ALLOC_OOM));
3877 /* free_pages may go negative - that's OK */
3878 free_pages -= __zone_watermark_unusable_free(z, order, alloc_flags);
3880 if (alloc_flags & ALLOC_HIGH)
3883 if (unlikely(alloc_harder)) {
3885 * OOM victims can try even harder than normal ALLOC_HARDER
3886 * users on the grounds that it's definitely going to be in
3887 * the exit path shortly and free memory. Any allocation it
3888 * makes during the free path will be small and short-lived.
3890 if (alloc_flags & ALLOC_OOM)
3897 * Check watermarks for an order-0 allocation request. If these
3898 * are not met, then a high-order request also cannot go ahead
3899 * even if a suitable page happened to be free.
3901 if (free_pages <= min + z->lowmem_reserve[highest_zoneidx])
3904 /* If this is an order-0 request then the watermark is fine */
3908 /* For a high-order request, check at least one suitable page is free */
3909 for (o = order; o < MAX_ORDER; o++) {
3910 struct free_area *area = &z->free_area[o];
3916 for (mt = 0; mt < MIGRATE_PCPTYPES; mt++) {
3917 if (!free_area_empty(area, mt))
3922 if ((alloc_flags & ALLOC_CMA) &&
3923 !free_area_empty(area, MIGRATE_CMA)) {
3927 if (alloc_harder && !free_area_empty(area, MIGRATE_HIGHATOMIC))
3933 bool zone_watermark_ok(struct zone *z, unsigned int order, unsigned long mark,
3934 int highest_zoneidx, unsigned int alloc_flags)
3936 return __zone_watermark_ok(z, order, mark, highest_zoneidx, alloc_flags,
3937 zone_page_state(z, NR_FREE_PAGES));
3940 static inline bool zone_watermark_fast(struct zone *z, unsigned int order,
3941 unsigned long mark, int highest_zoneidx,
3942 unsigned int alloc_flags, gfp_t gfp_mask)
3946 free_pages = zone_page_state(z, NR_FREE_PAGES);
3949 * Fast check for order-0 only. If this fails then the reserves
3950 * need to be calculated.
3955 fast_free = free_pages;
3956 fast_free -= __zone_watermark_unusable_free(z, 0, alloc_flags);
3957 if (fast_free > mark + z->lowmem_reserve[highest_zoneidx])
3961 if (__zone_watermark_ok(z, order, mark, highest_zoneidx, alloc_flags,
3965 * Ignore watermark boosting for GFP_ATOMIC order-0 allocations
3966 * when checking the min watermark. The min watermark is the
3967 * point where boosting is ignored so that kswapd is woken up
3968 * when below the low watermark.
3970 if (unlikely(!order && (gfp_mask & __GFP_ATOMIC) && z->watermark_boost
3971 && ((alloc_flags & ALLOC_WMARK_MASK) == WMARK_MIN))) {
3972 mark = z->_watermark[WMARK_MIN];
3973 return __zone_watermark_ok(z, order, mark, highest_zoneidx,
3974 alloc_flags, free_pages);
3980 bool zone_watermark_ok_safe(struct zone *z, unsigned int order,
3981 unsigned long mark, int highest_zoneidx)
3983 long free_pages = zone_page_state(z, NR_FREE_PAGES);
3985 if (z->percpu_drift_mark && free_pages < z->percpu_drift_mark)
3986 free_pages = zone_page_state_snapshot(z, NR_FREE_PAGES);
3988 return __zone_watermark_ok(z, order, mark, highest_zoneidx, 0,
3993 int __read_mostly node_reclaim_distance = RECLAIM_DISTANCE;
3995 static bool zone_allows_reclaim(struct zone *local_zone, struct zone *zone)
3997 return node_distance(zone_to_nid(local_zone), zone_to_nid(zone)) <=
3998 node_reclaim_distance;
4000 #else /* CONFIG_NUMA */
4001 static bool zone_allows_reclaim(struct zone *local_zone, struct zone *zone)
4005 #endif /* CONFIG_NUMA */
4008 * The restriction on ZONE_DMA32 as being a suitable zone to use to avoid
4009 * fragmentation is subtle. If the preferred zone was HIGHMEM then
4010 * premature use of a lower zone may cause lowmem pressure problems that
4011 * are worse than fragmentation. If the next zone is ZONE_DMA then it is
4012 * probably too small. It only makes sense to spread allocations to avoid
4013 * fragmentation between the Normal and DMA32 zones.
4015 static inline unsigned int
4016 alloc_flags_nofragment(struct zone *zone, gfp_t gfp_mask)
4018 unsigned int alloc_flags;
4021 * __GFP_KSWAPD_RECLAIM is assumed to be the same as ALLOC_KSWAPD
4024 alloc_flags = (__force int) (gfp_mask & __GFP_KSWAPD_RECLAIM);
4026 #ifdef CONFIG_ZONE_DMA32
4030 if (zone_idx(zone) != ZONE_NORMAL)
4034 * If ZONE_DMA32 exists, assume it is the one after ZONE_NORMAL and
4035 * the pointer is within zone->zone_pgdat->node_zones[]. Also assume
4036 * on UMA that if Normal is populated then so is DMA32.
4038 BUILD_BUG_ON(ZONE_NORMAL - ZONE_DMA32 != 1);
4039 if (nr_online_nodes > 1 && !populated_zone(--zone))
4042 alloc_flags |= ALLOC_NOFRAGMENT;
4043 #endif /* CONFIG_ZONE_DMA32 */
4047 /* Must be called after current_gfp_context() which can change gfp_mask */
4048 static inline unsigned int gfp_to_alloc_flags_cma(gfp_t gfp_mask,
4049 unsigned int alloc_flags)
4052 if (gfp_migratetype(gfp_mask) == MIGRATE_MOVABLE)
4053 alloc_flags |= ALLOC_CMA;
4059 * get_page_from_freelist goes through the zonelist trying to allocate
4062 static struct page *
4063 get_page_from_freelist(gfp_t gfp_mask, unsigned int order, int alloc_flags,
4064 const struct alloc_context *ac)
4068 struct pglist_data *last_pgdat_dirty_limit = NULL;
4073 * Scan zonelist, looking for a zone with enough free.
4074 * See also __cpuset_node_allowed() comment in kernel/cpuset.c.
4076 no_fallback = alloc_flags & ALLOC_NOFRAGMENT;
4077 z = ac->preferred_zoneref;
4078 for_next_zone_zonelist_nodemask(zone, z, ac->highest_zoneidx,
4083 if (cpusets_enabled() &&
4084 (alloc_flags & ALLOC_CPUSET) &&
4085 !__cpuset_zone_allowed(zone, gfp_mask))
4088 * When allocating a page cache page for writing, we
4089 * want to get it from a node that is within its dirty
4090 * limit, such that no single node holds more than its
4091 * proportional share of globally allowed dirty pages.
4092 * The dirty limits take into account the node's
4093 * lowmem reserves and high watermark so that kswapd
4094 * should be able to balance it without having to
4095 * write pages from its LRU list.
4097 * XXX: For now, allow allocations to potentially
4098 * exceed the per-node dirty limit in the slowpath
4099 * (spread_dirty_pages unset) before going into reclaim,
4100 * which is important when on a NUMA setup the allowed
4101 * nodes are together not big enough to reach the
4102 * global limit. The proper fix for these situations
4103 * will require awareness of nodes in the
4104 * dirty-throttling and the flusher threads.
4106 if (ac->spread_dirty_pages) {
4107 if (last_pgdat_dirty_limit == zone->zone_pgdat)
4110 if (!node_dirty_ok(zone->zone_pgdat)) {
4111 last_pgdat_dirty_limit = zone->zone_pgdat;
4116 if (no_fallback && nr_online_nodes > 1 &&
4117 zone != ac->preferred_zoneref->zone) {
4121 * If moving to a remote node, retry but allow
4122 * fragmenting fallbacks. Locality is more important
4123 * than fragmentation avoidance.
4125 local_nid = zone_to_nid(ac->preferred_zoneref->zone);
4126 if (zone_to_nid(zone) != local_nid) {
4127 alloc_flags &= ~ALLOC_NOFRAGMENT;
4132 mark = wmark_pages(zone, alloc_flags & ALLOC_WMARK_MASK);
4133 if (!zone_watermark_fast(zone, order, mark,
4134 ac->highest_zoneidx, alloc_flags,
4138 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
4140 * Watermark failed for this zone, but see if we can
4141 * grow this zone if it contains deferred pages.
4143 if (static_branch_unlikely(&deferred_pages)) {
4144 if (_deferred_grow_zone(zone, order))
4148 /* Checked here to keep the fast path fast */
4149 BUILD_BUG_ON(ALLOC_NO_WATERMARKS < NR_WMARK);
4150 if (alloc_flags & ALLOC_NO_WATERMARKS)
4153 if (!node_reclaim_enabled() ||
4154 !zone_allows_reclaim(ac->preferred_zoneref->zone, zone))
4157 ret = node_reclaim(zone->zone_pgdat, gfp_mask, order);
4159 case NODE_RECLAIM_NOSCAN:
4162 case NODE_RECLAIM_FULL:
4163 /* scanned but unreclaimable */
4166 /* did we reclaim enough */
4167 if (zone_watermark_ok(zone, order, mark,
4168 ac->highest_zoneidx, alloc_flags))
4176 page = rmqueue(ac->preferred_zoneref->zone, zone, order,
4177 gfp_mask, alloc_flags, ac->migratetype);
4179 prep_new_page(page, order, gfp_mask, alloc_flags);
4182 * If this is a high-order atomic allocation then check
4183 * if the pageblock should be reserved for the future
4185 if (unlikely(order && (alloc_flags & ALLOC_HARDER)))
4186 reserve_highatomic_pageblock(page, zone, order);
4190 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
4191 /* Try again if zone has deferred pages */
4192 if (static_branch_unlikely(&deferred_pages)) {
4193 if (_deferred_grow_zone(zone, order))
4201 * It's possible on a UMA machine to get through all zones that are
4202 * fragmented. If avoiding fragmentation, reset and try again.
4205 alloc_flags &= ~ALLOC_NOFRAGMENT;
4212 static void warn_alloc_show_mem(gfp_t gfp_mask, nodemask_t *nodemask)
4214 unsigned int filter = SHOW_MEM_FILTER_NODES;
4217 * This documents exceptions given to allocations in certain
4218 * contexts that are allowed to allocate outside current's set
4221 if (!(gfp_mask & __GFP_NOMEMALLOC))
4222 if (tsk_is_oom_victim(current) ||
4223 (current->flags & (PF_MEMALLOC | PF_EXITING)))
4224 filter &= ~SHOW_MEM_FILTER_NODES;
4225 if (!in_task() || !(gfp_mask & __GFP_DIRECT_RECLAIM))
4226 filter &= ~SHOW_MEM_FILTER_NODES;
4228 show_mem(filter, nodemask);
4231 void warn_alloc(gfp_t gfp_mask, nodemask_t *nodemask, const char *fmt, ...)
4233 struct va_format vaf;
4235 static DEFINE_RATELIMIT_STATE(nopage_rs, 10*HZ, 1);
4237 if ((gfp_mask & __GFP_NOWARN) ||
4238 !__ratelimit(&nopage_rs) ||
4239 ((gfp_mask & __GFP_DMA) && !has_managed_dma()))
4242 va_start(args, fmt);
4245 pr_warn("%s: %pV, mode:%#x(%pGg), nodemask=%*pbl",
4246 current->comm, &vaf, gfp_mask, &gfp_mask,
4247 nodemask_pr_args(nodemask));
4250 cpuset_print_current_mems_allowed();
4253 warn_alloc_show_mem(gfp_mask, nodemask);
4256 static inline struct page *
4257 __alloc_pages_cpuset_fallback(gfp_t gfp_mask, unsigned int order,
4258 unsigned int alloc_flags,
4259 const struct alloc_context *ac)
4263 page = get_page_from_freelist(gfp_mask, order,
4264 alloc_flags|ALLOC_CPUSET, ac);
4266 * fallback to ignore cpuset restriction if our nodes
4270 page = get_page_from_freelist(gfp_mask, order,
4276 static inline struct page *
4277 __alloc_pages_may_oom(gfp_t gfp_mask, unsigned int order,
4278 const struct alloc_context *ac, unsigned long *did_some_progress)
4280 struct oom_control oc = {
4281 .zonelist = ac->zonelist,
4282 .nodemask = ac->nodemask,
4284 .gfp_mask = gfp_mask,
4289 *did_some_progress = 0;
4292 * Acquire the oom lock. If that fails, somebody else is
4293 * making progress for us.
4295 if (!mutex_trylock(&oom_lock)) {
4296 *did_some_progress = 1;
4297 schedule_timeout_uninterruptible(1);
4302 * Go through the zonelist yet one more time, keep very high watermark
4303 * here, this is only to catch a parallel oom killing, we must fail if
4304 * we're still under heavy pressure. But make sure that this reclaim
4305 * attempt shall not depend on __GFP_DIRECT_RECLAIM && !__GFP_NORETRY
4306 * allocation which will never fail due to oom_lock already held.
4308 page = get_page_from_freelist((gfp_mask | __GFP_HARDWALL) &
4309 ~__GFP_DIRECT_RECLAIM, order,
4310 ALLOC_WMARK_HIGH|ALLOC_CPUSET, ac);
4314 /* Coredumps can quickly deplete all memory reserves */
4315 if (current->flags & PF_DUMPCORE)
4317 /* The OOM killer will not help higher order allocs */
4318 if (order > PAGE_ALLOC_COSTLY_ORDER)
4321 * We have already exhausted all our reclaim opportunities without any
4322 * success so it is time to admit defeat. We will skip the OOM killer
4323 * because it is very likely that the caller has a more reasonable
4324 * fallback than shooting a random task.
4326 * The OOM killer may not free memory on a specific node.
4328 if (gfp_mask & (__GFP_RETRY_MAYFAIL | __GFP_THISNODE))
4330 /* The OOM killer does not needlessly kill tasks for lowmem */
4331 if (ac->highest_zoneidx < ZONE_NORMAL)
4333 if (pm_suspended_storage())
4336 * XXX: GFP_NOFS allocations should rather fail than rely on
4337 * other request to make a forward progress.
4338 * We are in an unfortunate situation where out_of_memory cannot
4339 * do much for this context but let's try it to at least get
4340 * access to memory reserved if the current task is killed (see
4341 * out_of_memory). Once filesystems are ready to handle allocation
4342 * failures more gracefully we should just bail out here.
4345 /* Exhausted what can be done so it's blame time */
4346 if (out_of_memory(&oc) || WARN_ON_ONCE(gfp_mask & __GFP_NOFAIL)) {
4347 *did_some_progress = 1;
4350 * Help non-failing allocations by giving them access to memory
4353 if (gfp_mask & __GFP_NOFAIL)
4354 page = __alloc_pages_cpuset_fallback(gfp_mask, order,
4355 ALLOC_NO_WATERMARKS, ac);
4358 mutex_unlock(&oom_lock);
4363 * Maximum number of compaction retries with a progress before OOM
4364 * killer is consider as the only way to move forward.
4366 #define MAX_COMPACT_RETRIES 16
4368 #ifdef CONFIG_COMPACTION
4369 /* Try memory compaction for high-order allocations before reclaim */
4370 static struct page *
4371 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
4372 unsigned int alloc_flags, const struct alloc_context *ac,
4373 enum compact_priority prio, enum compact_result *compact_result)
4375 struct page *page = NULL;
4376 unsigned long pflags;
4377 unsigned int noreclaim_flag;
4382 psi_memstall_enter(&pflags);
4383 delayacct_compact_start();
4384 noreclaim_flag = memalloc_noreclaim_save();
4386 *compact_result = try_to_compact_pages(gfp_mask, order, alloc_flags, ac,
4389 memalloc_noreclaim_restore(noreclaim_flag);
4390 psi_memstall_leave(&pflags);
4391 delayacct_compact_end();
4393 if (*compact_result == COMPACT_SKIPPED)
4396 * At least in one zone compaction wasn't deferred or skipped, so let's
4397 * count a compaction stall
4399 count_vm_event(COMPACTSTALL);
4401 /* Prep a captured page if available */
4403 prep_new_page(page, order, gfp_mask, alloc_flags);
4405 /* Try get a page from the freelist if available */
4407 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac);
4410 struct zone *zone = page_zone(page);
4412 zone->compact_blockskip_flush = false;
4413 compaction_defer_reset(zone, order, true);
4414 count_vm_event(COMPACTSUCCESS);
4419 * It's bad if compaction run occurs and fails. The most likely reason
4420 * is that pages exist, but not enough to satisfy watermarks.
4422 count_vm_event(COMPACTFAIL);
4430 should_compact_retry(struct alloc_context *ac, int order, int alloc_flags,
4431 enum compact_result compact_result,
4432 enum compact_priority *compact_priority,
4433 int *compaction_retries)
4435 int max_retries = MAX_COMPACT_RETRIES;
4438 int retries = *compaction_retries;
4439 enum compact_priority priority = *compact_priority;
4444 if (fatal_signal_pending(current))
4447 if (compaction_made_progress(compact_result))
4448 (*compaction_retries)++;
4451 * compaction considers all the zone as desperately out of memory
4452 * so it doesn't really make much sense to retry except when the
4453 * failure could be caused by insufficient priority
4455 if (compaction_failed(compact_result))
4456 goto check_priority;
4459 * compaction was skipped because there are not enough order-0 pages
4460 * to work with, so we retry only if it looks like reclaim can help.
4462 if (compaction_needs_reclaim(compact_result)) {
4463 ret = compaction_zonelist_suitable(ac, order, alloc_flags);
4468 * make sure the compaction wasn't deferred or didn't bail out early
4469 * due to locks contention before we declare that we should give up.
4470 * But the next retry should use a higher priority if allowed, so
4471 * we don't just keep bailing out endlessly.
4473 if (compaction_withdrawn(compact_result)) {
4474 goto check_priority;
4478 * !costly requests are much more important than __GFP_RETRY_MAYFAIL
4479 * costly ones because they are de facto nofail and invoke OOM
4480 * killer to move on while costly can fail and users are ready
4481 * to cope with that. 1/4 retries is rather arbitrary but we
4482 * would need much more detailed feedback from compaction to
4483 * make a better decision.
4485 if (order > PAGE_ALLOC_COSTLY_ORDER)
4487 if (*compaction_retries <= max_retries) {
4493 * Make sure there are attempts at the highest priority if we exhausted
4494 * all retries or failed at the lower priorities.
4497 min_priority = (order > PAGE_ALLOC_COSTLY_ORDER) ?
4498 MIN_COMPACT_COSTLY_PRIORITY : MIN_COMPACT_PRIORITY;
4500 if (*compact_priority > min_priority) {
4501 (*compact_priority)--;
4502 *compaction_retries = 0;
4506 trace_compact_retry(order, priority, compact_result, retries, max_retries, ret);
4510 static inline struct page *
4511 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
4512 unsigned int alloc_flags, const struct alloc_context *ac,
4513 enum compact_priority prio, enum compact_result *compact_result)
4515 *compact_result = COMPACT_SKIPPED;
4520 should_compact_retry(struct alloc_context *ac, unsigned int order, int alloc_flags,
4521 enum compact_result compact_result,
4522 enum compact_priority *compact_priority,
4523 int *compaction_retries)
4528 if (!order || order > PAGE_ALLOC_COSTLY_ORDER)
4532 * There are setups with compaction disabled which would prefer to loop
4533 * inside the allocator rather than hit the oom killer prematurely.
4534 * Let's give them a good hope and keep retrying while the order-0
4535 * watermarks are OK.
4537 for_each_zone_zonelist_nodemask(zone, z, ac->zonelist,
4538 ac->highest_zoneidx, ac->nodemask) {
4539 if (zone_watermark_ok(zone, 0, min_wmark_pages(zone),
4540 ac->highest_zoneidx, alloc_flags))
4545 #endif /* CONFIG_COMPACTION */
4547 #ifdef CONFIG_LOCKDEP
4548 static struct lockdep_map __fs_reclaim_map =
4549 STATIC_LOCKDEP_MAP_INIT("fs_reclaim", &__fs_reclaim_map);
4551 static bool __need_reclaim(gfp_t gfp_mask)
4553 /* no reclaim without waiting on it */
4554 if (!(gfp_mask & __GFP_DIRECT_RECLAIM))
4557 /* this guy won't enter reclaim */
4558 if (current->flags & PF_MEMALLOC)
4561 if (gfp_mask & __GFP_NOLOCKDEP)
4567 void __fs_reclaim_acquire(unsigned long ip)
4569 lock_acquire_exclusive(&__fs_reclaim_map, 0, 0, NULL, ip);
4572 void __fs_reclaim_release(unsigned long ip)
4574 lock_release(&__fs_reclaim_map, ip);
4577 void fs_reclaim_acquire(gfp_t gfp_mask)
4579 gfp_mask = current_gfp_context(gfp_mask);
4581 if (__need_reclaim(gfp_mask)) {
4582 if (gfp_mask & __GFP_FS)
4583 __fs_reclaim_acquire(_RET_IP_);
4585 #ifdef CONFIG_MMU_NOTIFIER
4586 lock_map_acquire(&__mmu_notifier_invalidate_range_start_map);
4587 lock_map_release(&__mmu_notifier_invalidate_range_start_map);
4592 EXPORT_SYMBOL_GPL(fs_reclaim_acquire);
4594 void fs_reclaim_release(gfp_t gfp_mask)
4596 gfp_mask = current_gfp_context(gfp_mask);
4598 if (__need_reclaim(gfp_mask)) {
4599 if (gfp_mask & __GFP_FS)
4600 __fs_reclaim_release(_RET_IP_);
4603 EXPORT_SYMBOL_GPL(fs_reclaim_release);
4606 /* Perform direct synchronous page reclaim */
4607 static unsigned long
4608 __perform_reclaim(gfp_t gfp_mask, unsigned int order,
4609 const struct alloc_context *ac)
4611 unsigned int noreclaim_flag;
4612 unsigned long progress;
4616 /* We now go into synchronous reclaim */
4617 cpuset_memory_pressure_bump();
4618 fs_reclaim_acquire(gfp_mask);
4619 noreclaim_flag = memalloc_noreclaim_save();
4621 progress = try_to_free_pages(ac->zonelist, order, gfp_mask,
4624 memalloc_noreclaim_restore(noreclaim_flag);
4625 fs_reclaim_release(gfp_mask);
4632 /* The really slow allocator path where we enter direct reclaim */
4633 static inline struct page *
4634 __alloc_pages_direct_reclaim(gfp_t gfp_mask, unsigned int order,
4635 unsigned int alloc_flags, const struct alloc_context *ac,
4636 unsigned long *did_some_progress)
4638 struct page *page = NULL;
4639 unsigned long pflags;
4640 bool drained = false;
4642 psi_memstall_enter(&pflags);
4643 *did_some_progress = __perform_reclaim(gfp_mask, order, ac);
4644 if (unlikely(!(*did_some_progress)))
4648 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac);
4651 * If an allocation failed after direct reclaim, it could be because
4652 * pages are pinned on the per-cpu lists or in high alloc reserves.
4653 * Shrink them and try again
4655 if (!page && !drained) {
4656 unreserve_highatomic_pageblock(ac, false);
4657 drain_all_pages(NULL);
4662 psi_memstall_leave(&pflags);
4667 static void wake_all_kswapds(unsigned int order, gfp_t gfp_mask,
4668 const struct alloc_context *ac)
4672 pg_data_t *last_pgdat = NULL;
4673 enum zone_type highest_zoneidx = ac->highest_zoneidx;
4675 for_each_zone_zonelist_nodemask(zone, z, ac->zonelist, highest_zoneidx,
4677 if (last_pgdat != zone->zone_pgdat)
4678 wakeup_kswapd(zone, gfp_mask, order, highest_zoneidx);
4679 last_pgdat = zone->zone_pgdat;
4683 static inline unsigned int
4684 gfp_to_alloc_flags(gfp_t gfp_mask)
4686 unsigned int alloc_flags = ALLOC_WMARK_MIN | ALLOC_CPUSET;
4689 * __GFP_HIGH is assumed to be the same as ALLOC_HIGH
4690 * and __GFP_KSWAPD_RECLAIM is assumed to be the same as ALLOC_KSWAPD
4691 * to save two branches.
4693 BUILD_BUG_ON(__GFP_HIGH != (__force gfp_t) ALLOC_HIGH);
4694 BUILD_BUG_ON(__GFP_KSWAPD_RECLAIM != (__force gfp_t) ALLOC_KSWAPD);
4697 * The caller may dip into page reserves a bit more if the caller
4698 * cannot run direct reclaim, or if the caller has realtime scheduling
4699 * policy or is asking for __GFP_HIGH memory. GFP_ATOMIC requests will
4700 * set both ALLOC_HARDER (__GFP_ATOMIC) and ALLOC_HIGH (__GFP_HIGH).
4702 alloc_flags |= (__force int)
4703 (gfp_mask & (__GFP_HIGH | __GFP_KSWAPD_RECLAIM));
4705 if (gfp_mask & __GFP_ATOMIC) {
4707 * Not worth trying to allocate harder for __GFP_NOMEMALLOC even
4708 * if it can't schedule.
4710 if (!(gfp_mask & __GFP_NOMEMALLOC))
4711 alloc_flags |= ALLOC_HARDER;
4713 * Ignore cpuset mems for GFP_ATOMIC rather than fail, see the
4714 * comment for __cpuset_node_allowed().
4716 alloc_flags &= ~ALLOC_CPUSET;
4717 } else if (unlikely(rt_task(current)) && in_task())
4718 alloc_flags |= ALLOC_HARDER;
4720 alloc_flags = gfp_to_alloc_flags_cma(gfp_mask, alloc_flags);
4725 static bool oom_reserves_allowed(struct task_struct *tsk)
4727 if (!tsk_is_oom_victim(tsk))
4731 * !MMU doesn't have oom reaper so give access to memory reserves
4732 * only to the thread with TIF_MEMDIE set
4734 if (!IS_ENABLED(CONFIG_MMU) && !test_thread_flag(TIF_MEMDIE))
4741 * Distinguish requests which really need access to full memory
4742 * reserves from oom victims which can live with a portion of it
4744 static inline int __gfp_pfmemalloc_flags(gfp_t gfp_mask)
4746 if (unlikely(gfp_mask & __GFP_NOMEMALLOC))
4748 if (gfp_mask & __GFP_MEMALLOC)
4749 return ALLOC_NO_WATERMARKS;
4750 if (in_serving_softirq() && (current->flags & PF_MEMALLOC))
4751 return ALLOC_NO_WATERMARKS;
4752 if (!in_interrupt()) {
4753 if (current->flags & PF_MEMALLOC)
4754 return ALLOC_NO_WATERMARKS;
4755 else if (oom_reserves_allowed(current))
4762 bool gfp_pfmemalloc_allowed(gfp_t gfp_mask)
4764 return !!__gfp_pfmemalloc_flags(gfp_mask);
4768 * Checks whether it makes sense to retry the reclaim to make a forward progress
4769 * for the given allocation request.
4771 * We give up when we either have tried MAX_RECLAIM_RETRIES in a row
4772 * without success, or when we couldn't even meet the watermark if we
4773 * reclaimed all remaining pages on the LRU lists.
4775 * Returns true if a retry is viable or false to enter the oom path.
4778 should_reclaim_retry(gfp_t gfp_mask, unsigned order,
4779 struct alloc_context *ac, int alloc_flags,
4780 bool did_some_progress, int *no_progress_loops)
4787 * Costly allocations might have made a progress but this doesn't mean
4788 * their order will become available due to high fragmentation so
4789 * always increment the no progress counter for them
4791 if (did_some_progress && order <= PAGE_ALLOC_COSTLY_ORDER)
4792 *no_progress_loops = 0;
4794 (*no_progress_loops)++;
4797 * Make sure we converge to OOM if we cannot make any progress
4798 * several times in the row.
4800 if (*no_progress_loops > MAX_RECLAIM_RETRIES) {
4801 /* Before OOM, exhaust highatomic_reserve */
4802 return unreserve_highatomic_pageblock(ac, true);
4806 * Keep reclaiming pages while there is a chance this will lead
4807 * somewhere. If none of the target zones can satisfy our allocation
4808 * request even if all reclaimable pages are considered then we are
4809 * screwed and have to go OOM.
4811 for_each_zone_zonelist_nodemask(zone, z, ac->zonelist,
4812 ac->highest_zoneidx, ac->nodemask) {
4813 unsigned long available;
4814 unsigned long reclaimable;
4815 unsigned long min_wmark = min_wmark_pages(zone);
4818 available = reclaimable = zone_reclaimable_pages(zone);
4819 available += zone_page_state_snapshot(zone, NR_FREE_PAGES);
4822 * Would the allocation succeed if we reclaimed all
4823 * reclaimable pages?
4825 wmark = __zone_watermark_ok(zone, order, min_wmark,
4826 ac->highest_zoneidx, alloc_flags, available);
4827 trace_reclaim_retry_zone(z, order, reclaimable,
4828 available, min_wmark, *no_progress_loops, wmark);
4836 * Memory allocation/reclaim might be called from a WQ context and the
4837 * current implementation of the WQ concurrency control doesn't
4838 * recognize that a particular WQ is congested if the worker thread is
4839 * looping without ever sleeping. Therefore we have to do a short sleep
4840 * here rather than calling cond_resched().
4842 if (current->flags & PF_WQ_WORKER)
4843 schedule_timeout_uninterruptible(1);
4850 check_retry_cpuset(int cpuset_mems_cookie, struct alloc_context *ac)
4853 * It's possible that cpuset's mems_allowed and the nodemask from
4854 * mempolicy don't intersect. This should be normally dealt with by
4855 * policy_nodemask(), but it's possible to race with cpuset update in
4856 * such a way the check therein was true, and then it became false
4857 * before we got our cpuset_mems_cookie here.
4858 * This assumes that for all allocations, ac->nodemask can come only
4859 * from MPOL_BIND mempolicy (whose documented semantics is to be ignored
4860 * when it does not intersect with the cpuset restrictions) or the
4861 * caller can deal with a violated nodemask.
4863 if (cpusets_enabled() && ac->nodemask &&
4864 !cpuset_nodemask_valid_mems_allowed(ac->nodemask)) {
4865 ac->nodemask = NULL;
4870 * When updating a task's mems_allowed or mempolicy nodemask, it is
4871 * possible to race with parallel threads in such a way that our
4872 * allocation can fail while the mask is being updated. If we are about
4873 * to fail, check if the cpuset changed during allocation and if so,
4876 if (read_mems_allowed_retry(cpuset_mems_cookie))
4882 static inline struct page *
4883 __alloc_pages_slowpath(gfp_t gfp_mask, unsigned int order,
4884 struct alloc_context *ac)
4886 bool can_direct_reclaim = gfp_mask & __GFP_DIRECT_RECLAIM;
4887 const bool costly_order = order > PAGE_ALLOC_COSTLY_ORDER;
4888 struct page *page = NULL;
4889 unsigned int alloc_flags;
4890 unsigned long did_some_progress;
4891 enum compact_priority compact_priority;
4892 enum compact_result compact_result;
4893 int compaction_retries;
4894 int no_progress_loops;
4895 unsigned int cpuset_mems_cookie;
4899 * We also sanity check to catch abuse of atomic reserves being used by
4900 * callers that are not in atomic context.
4902 if (WARN_ON_ONCE((gfp_mask & (__GFP_ATOMIC|__GFP_DIRECT_RECLAIM)) ==
4903 (__GFP_ATOMIC|__GFP_DIRECT_RECLAIM)))
4904 gfp_mask &= ~__GFP_ATOMIC;
4907 compaction_retries = 0;
4908 no_progress_loops = 0;
4909 compact_priority = DEF_COMPACT_PRIORITY;
4910 cpuset_mems_cookie = read_mems_allowed_begin();
4913 * The fast path uses conservative alloc_flags to succeed only until
4914 * kswapd needs to be woken up, and to avoid the cost of setting up
4915 * alloc_flags precisely. So we do that now.
4917 alloc_flags = gfp_to_alloc_flags(gfp_mask);
4920 * We need to recalculate the starting point for the zonelist iterator
4921 * because we might have used different nodemask in the fast path, or
4922 * there was a cpuset modification and we are retrying - otherwise we
4923 * could end up iterating over non-eligible zones endlessly.
4925 ac->preferred_zoneref = first_zones_zonelist(ac->zonelist,
4926 ac->highest_zoneidx, ac->nodemask);
4927 if (!ac->preferred_zoneref->zone)
4931 * Check for insane configurations where the cpuset doesn't contain
4932 * any suitable zone to satisfy the request - e.g. non-movable
4933 * GFP_HIGHUSER allocations from MOVABLE nodes only.
4935 if (cpusets_insane_config() && (gfp_mask & __GFP_HARDWALL)) {
4936 struct zoneref *z = first_zones_zonelist(ac->zonelist,
4937 ac->highest_zoneidx,
4938 &cpuset_current_mems_allowed);
4943 if (alloc_flags & ALLOC_KSWAPD)
4944 wake_all_kswapds(order, gfp_mask, ac);
4947 * The adjusted alloc_flags might result in immediate success, so try
4950 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac);
4955 * For costly allocations, try direct compaction first, as it's likely
4956 * that we have enough base pages and don't need to reclaim. For non-
4957 * movable high-order allocations, do that as well, as compaction will
4958 * try prevent permanent fragmentation by migrating from blocks of the
4960 * Don't try this for allocations that are allowed to ignore
4961 * watermarks, as the ALLOC_NO_WATERMARKS attempt didn't yet happen.
4963 if (can_direct_reclaim &&
4965 (order > 0 && ac->migratetype != MIGRATE_MOVABLE))
4966 && !gfp_pfmemalloc_allowed(gfp_mask)) {
4967 page = __alloc_pages_direct_compact(gfp_mask, order,
4969 INIT_COMPACT_PRIORITY,
4975 * Checks for costly allocations with __GFP_NORETRY, which
4976 * includes some THP page fault allocations
4978 if (costly_order && (gfp_mask & __GFP_NORETRY)) {
4980 * If allocating entire pageblock(s) and compaction
4981 * failed because all zones are below low watermarks
4982 * or is prohibited because it recently failed at this
4983 * order, fail immediately unless the allocator has
4984 * requested compaction and reclaim retry.
4987 * - potentially very expensive because zones are far
4988 * below their low watermarks or this is part of very
4989 * bursty high order allocations,
4990 * - not guaranteed to help because isolate_freepages()
4991 * may not iterate over freed pages as part of its
4993 * - unlikely to make entire pageblocks free on its
4996 if (compact_result == COMPACT_SKIPPED ||
4997 compact_result == COMPACT_DEFERRED)
5001 * Looks like reclaim/compaction is worth trying, but
5002 * sync compaction could be very expensive, so keep
5003 * using async compaction.
5005 compact_priority = INIT_COMPACT_PRIORITY;
5010 /* Ensure kswapd doesn't accidentally go to sleep as long as we loop */
5011 if (alloc_flags & ALLOC_KSWAPD)
5012 wake_all_kswapds(order, gfp_mask, ac);
5014 reserve_flags = __gfp_pfmemalloc_flags(gfp_mask);
5016 alloc_flags = gfp_to_alloc_flags_cma(gfp_mask, reserve_flags);
5019 * Reset the nodemask and zonelist iterators if memory policies can be
5020 * ignored. These allocations are high priority and system rather than
5023 if (!(alloc_flags & ALLOC_CPUSET) || reserve_flags) {
5024 ac->nodemask = NULL;
5025 ac->preferred_zoneref = first_zones_zonelist(ac->zonelist,
5026 ac->highest_zoneidx, ac->nodemask);
5029 /* Attempt with potentially adjusted zonelist and alloc_flags */
5030 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac);
5034 /* Caller is not willing to reclaim, we can't balance anything */
5035 if (!can_direct_reclaim)
5038 /* Avoid recursion of direct reclaim */
5039 if (current->flags & PF_MEMALLOC)
5042 /* Try direct reclaim and then allocating */
5043 page = __alloc_pages_direct_reclaim(gfp_mask, order, alloc_flags, ac,
5044 &did_some_progress);
5048 /* Try direct compaction and then allocating */
5049 page = __alloc_pages_direct_compact(gfp_mask, order, alloc_flags, ac,
5050 compact_priority, &compact_result);
5054 /* Do not loop if specifically requested */
5055 if (gfp_mask & __GFP_NORETRY)
5059 * Do not retry costly high order allocations unless they are
5060 * __GFP_RETRY_MAYFAIL
5062 if (costly_order && !(gfp_mask & __GFP_RETRY_MAYFAIL))
5065 if (should_reclaim_retry(gfp_mask, order, ac, alloc_flags,
5066 did_some_progress > 0, &no_progress_loops))
5070 * It doesn't make any sense to retry for the compaction if the order-0
5071 * reclaim is not able to make any progress because the current
5072 * implementation of the compaction depends on the sufficient amount
5073 * of free memory (see __compaction_suitable)
5075 if (did_some_progress > 0 &&
5076 should_compact_retry(ac, order, alloc_flags,
5077 compact_result, &compact_priority,
5078 &compaction_retries))
5082 /* Deal with possible cpuset update races before we start OOM killing */
5083 if (check_retry_cpuset(cpuset_mems_cookie, ac))
5086 /* Reclaim has failed us, start killing things */
5087 page = __alloc_pages_may_oom(gfp_mask, order, ac, &did_some_progress);
5091 /* Avoid allocations with no watermarks from looping endlessly */
5092 if (tsk_is_oom_victim(current) &&
5093 (alloc_flags & ALLOC_OOM ||
5094 (gfp_mask & __GFP_NOMEMALLOC)))
5097 /* Retry as long as the OOM killer is making progress */
5098 if (did_some_progress) {
5099 no_progress_loops = 0;
5104 /* Deal with possible cpuset update races before we fail */
5105 if (check_retry_cpuset(cpuset_mems_cookie, ac))
5109 * Make sure that __GFP_NOFAIL request doesn't leak out and make sure
5112 if (gfp_mask & __GFP_NOFAIL) {
5114 * All existing users of the __GFP_NOFAIL are blockable, so warn
5115 * of any new users that actually require GFP_NOWAIT
5117 if (WARN_ON_ONCE(!can_direct_reclaim))
5121 * PF_MEMALLOC request from this context is rather bizarre
5122 * because we cannot reclaim anything and only can loop waiting
5123 * for somebody to do a work for us
5125 WARN_ON_ONCE(current->flags & PF_MEMALLOC);
5128 * non failing costly orders are a hard requirement which we
5129 * are not prepared for much so let's warn about these users
5130 * so that we can identify them and convert them to something
5133 WARN_ON_ONCE(order > PAGE_ALLOC_COSTLY_ORDER);
5136 * Help non-failing allocations by giving them access to memory
5137 * reserves but do not use ALLOC_NO_WATERMARKS because this
5138 * could deplete whole memory reserves which would just make
5139 * the situation worse
5141 page = __alloc_pages_cpuset_fallback(gfp_mask, order, ALLOC_HARDER, ac);
5149 warn_alloc(gfp_mask, ac->nodemask,
5150 "page allocation failure: order:%u", order);
5155 static inline bool prepare_alloc_pages(gfp_t gfp_mask, unsigned int order,
5156 int preferred_nid, nodemask_t *nodemask,
5157 struct alloc_context *ac, gfp_t *alloc_gfp,
5158 unsigned int *alloc_flags)
5160 ac->highest_zoneidx = gfp_zone(gfp_mask);
5161 ac->zonelist = node_zonelist(preferred_nid, gfp_mask);
5162 ac->nodemask = nodemask;
5163 ac->migratetype = gfp_migratetype(gfp_mask);
5165 if (cpusets_enabled()) {
5166 *alloc_gfp |= __GFP_HARDWALL;
5168 * When we are in the interrupt context, it is irrelevant
5169 * to the current task context. It means that any node ok.
5171 if (in_task() && !ac->nodemask)
5172 ac->nodemask = &cpuset_current_mems_allowed;
5174 *alloc_flags |= ALLOC_CPUSET;
5177 fs_reclaim_acquire(gfp_mask);
5178 fs_reclaim_release(gfp_mask);
5180 might_sleep_if(gfp_mask & __GFP_DIRECT_RECLAIM);
5182 if (should_fail_alloc_page(gfp_mask, order))
5185 *alloc_flags = gfp_to_alloc_flags_cma(gfp_mask, *alloc_flags);
5187 /* Dirty zone balancing only done in the fast path */
5188 ac->spread_dirty_pages = (gfp_mask & __GFP_WRITE);
5191 * The preferred zone is used for statistics but crucially it is
5192 * also used as the starting point for the zonelist iterator. It
5193 * may get reset for allocations that ignore memory policies.
5195 ac->preferred_zoneref = first_zones_zonelist(ac->zonelist,
5196 ac->highest_zoneidx, ac->nodemask);
5202 * __alloc_pages_bulk - Allocate a number of order-0 pages to a list or array
5203 * @gfp: GFP flags for the allocation
5204 * @preferred_nid: The preferred NUMA node ID to allocate from
5205 * @nodemask: Set of nodes to allocate from, may be NULL
5206 * @nr_pages: The number of pages desired on the list or array
5207 * @page_list: Optional list to store the allocated pages
5208 * @page_array: Optional array to store the pages
5210 * This is a batched version of the page allocator that attempts to
5211 * allocate nr_pages quickly. Pages are added to page_list if page_list
5212 * is not NULL, otherwise it is assumed that the page_array is valid.
5214 * For lists, nr_pages is the number of pages that should be allocated.
5216 * For arrays, only NULL elements are populated with pages and nr_pages
5217 * is the maximum number of pages that will be stored in the array.
5219 * Returns the number of pages on the list or array.
5221 unsigned long __alloc_pages_bulk(gfp_t gfp, int preferred_nid,
5222 nodemask_t *nodemask, int nr_pages,
5223 struct list_head *page_list,
5224 struct page **page_array)
5227 unsigned long flags;
5230 struct per_cpu_pages *pcp;
5231 struct list_head *pcp_list;
5232 struct alloc_context ac;
5234 unsigned int alloc_flags = ALLOC_WMARK_LOW;
5235 int nr_populated = 0, nr_account = 0;
5238 * Skip populated array elements to determine if any pages need
5239 * to be allocated before disabling IRQs.
5241 while (page_array && nr_populated < nr_pages && page_array[nr_populated])
5244 /* No pages requested? */
5245 if (unlikely(nr_pages <= 0))
5248 /* Already populated array? */
5249 if (unlikely(page_array && nr_pages - nr_populated == 0))
5252 /* Bulk allocator does not support memcg accounting. */
5253 if (memcg_kmem_enabled() && (gfp & __GFP_ACCOUNT))
5256 /* Use the single page allocator for one page. */
5257 if (nr_pages - nr_populated == 1)
5260 #ifdef CONFIG_PAGE_OWNER
5262 * PAGE_OWNER may recurse into the allocator to allocate space to
5263 * save the stack with pagesets.lock held. Releasing/reacquiring
5264 * removes much of the performance benefit of bulk allocation so
5265 * force the caller to allocate one page at a time as it'll have
5266 * similar performance to added complexity to the bulk allocator.
5268 if (static_branch_unlikely(&page_owner_inited))
5272 /* May set ALLOC_NOFRAGMENT, fragmentation will return 1 page. */
5273 gfp &= gfp_allowed_mask;
5275 if (!prepare_alloc_pages(gfp, 0, preferred_nid, nodemask, &ac, &alloc_gfp, &alloc_flags))
5279 /* Find an allowed local zone that meets the low watermark. */
5280 for_each_zone_zonelist_nodemask(zone, z, ac.zonelist, ac.highest_zoneidx, ac.nodemask) {
5283 if (cpusets_enabled() && (alloc_flags & ALLOC_CPUSET) &&
5284 !__cpuset_zone_allowed(zone, gfp)) {
5288 if (nr_online_nodes > 1 && zone != ac.preferred_zoneref->zone &&
5289 zone_to_nid(zone) != zone_to_nid(ac.preferred_zoneref->zone)) {
5293 mark = wmark_pages(zone, alloc_flags & ALLOC_WMARK_MASK) + nr_pages;
5294 if (zone_watermark_fast(zone, 0, mark,
5295 zonelist_zone_idx(ac.preferred_zoneref),
5296 alloc_flags, gfp)) {
5302 * If there are no allowed local zones that meets the watermarks then
5303 * try to allocate a single page and reclaim if necessary.
5305 if (unlikely(!zone))
5308 /* Attempt the batch allocation */
5309 local_lock_irqsave(&pagesets.lock, flags);
5310 pcp = this_cpu_ptr(zone->per_cpu_pageset);
5311 pcp_list = &pcp->lists[order_to_pindex(ac.migratetype, 0)];
5313 while (nr_populated < nr_pages) {
5315 /* Skip existing pages */
5316 if (page_array && page_array[nr_populated]) {
5321 page = __rmqueue_pcplist(zone, 0, ac.migratetype, alloc_flags,
5323 if (unlikely(!page)) {
5324 /* Try and get at least one page */
5331 prep_new_page(page, 0, gfp, 0);
5333 list_add(&page->lru, page_list);
5335 page_array[nr_populated] = page;
5339 local_unlock_irqrestore(&pagesets.lock, flags);
5341 __count_zid_vm_events(PGALLOC, zone_idx(zone), nr_account);
5342 zone_statistics(ac.preferred_zoneref->zone, zone, nr_account);
5345 return nr_populated;
5348 local_unlock_irqrestore(&pagesets.lock, flags);
5351 page = __alloc_pages(gfp, 0, preferred_nid, nodemask);
5354 list_add(&page->lru, page_list);
5356 page_array[nr_populated] = page;
5362 EXPORT_SYMBOL_GPL(__alloc_pages_bulk);
5365 * This is the 'heart' of the zoned buddy allocator.
5367 struct page *__alloc_pages(gfp_t gfp, unsigned int order, int preferred_nid,
5368 nodemask_t *nodemask)
5371 unsigned int alloc_flags = ALLOC_WMARK_LOW;
5372 gfp_t alloc_gfp; /* The gfp_t that was actually used for allocation */
5373 struct alloc_context ac = { };
5376 * There are several places where we assume that the order value is sane
5377 * so bail out early if the request is out of bound.
5379 if (unlikely(order >= MAX_ORDER)) {
5380 WARN_ON_ONCE(!(gfp & __GFP_NOWARN));
5384 gfp &= gfp_allowed_mask;
5386 * Apply scoped allocation constraints. This is mainly about GFP_NOFS
5387 * resp. GFP_NOIO which has to be inherited for all allocation requests
5388 * from a particular context which has been marked by
5389 * memalloc_no{fs,io}_{save,restore}. And PF_MEMALLOC_PIN which ensures
5390 * movable zones are not used during allocation.
5392 gfp = current_gfp_context(gfp);
5394 if (!prepare_alloc_pages(gfp, order, preferred_nid, nodemask, &ac,
5395 &alloc_gfp, &alloc_flags))
5399 * Forbid the first pass from falling back to types that fragment
5400 * memory until all local zones are considered.
5402 alloc_flags |= alloc_flags_nofragment(ac.preferred_zoneref->zone, gfp);
5404 /* First allocation attempt */
5405 page = get_page_from_freelist(alloc_gfp, order, alloc_flags, &ac);
5410 ac.spread_dirty_pages = false;
5413 * Restore the original nodemask if it was potentially replaced with
5414 * &cpuset_current_mems_allowed to optimize the fast-path attempt.
5416 ac.nodemask = nodemask;
5418 page = __alloc_pages_slowpath(alloc_gfp, order, &ac);
5421 if (memcg_kmem_enabled() && (gfp & __GFP_ACCOUNT) && page &&
5422 unlikely(__memcg_kmem_charge_page(page, gfp, order) != 0)) {
5423 __free_pages(page, order);
5427 trace_mm_page_alloc(page, order, alloc_gfp, ac.migratetype);
5431 EXPORT_SYMBOL(__alloc_pages);
5433 struct folio *__folio_alloc(gfp_t gfp, unsigned int order, int preferred_nid,
5434 nodemask_t *nodemask)
5436 struct page *page = __alloc_pages(gfp | __GFP_COMP, order,
5437 preferred_nid, nodemask);
5439 if (page && order > 1)
5440 prep_transhuge_page(page);
5441 return (struct folio *)page;
5443 EXPORT_SYMBOL(__folio_alloc);
5446 * Common helper functions. Never use with __GFP_HIGHMEM because the returned
5447 * address cannot represent highmem pages. Use alloc_pages and then kmap if
5448 * you need to access high mem.
5450 unsigned long __get_free_pages(gfp_t gfp_mask, unsigned int order)
5454 page = alloc_pages(gfp_mask & ~__GFP_HIGHMEM, order);
5457 return (unsigned long) page_address(page);
5459 EXPORT_SYMBOL(__get_free_pages);
5461 unsigned long get_zeroed_page(gfp_t gfp_mask)
5463 return __get_free_pages(gfp_mask | __GFP_ZERO, 0);
5465 EXPORT_SYMBOL(get_zeroed_page);
5468 * __free_pages - Free pages allocated with alloc_pages().
5469 * @page: The page pointer returned from alloc_pages().
5470 * @order: The order of the allocation.
5472 * This function can free multi-page allocations that are not compound
5473 * pages. It does not check that the @order passed in matches that of
5474 * the allocation, so it is easy to leak memory. Freeing more memory
5475 * than was allocated will probably emit a warning.
5477 * If the last reference to this page is speculative, it will be released
5478 * by put_page() which only frees the first page of a non-compound
5479 * allocation. To prevent the remaining pages from being leaked, we free
5480 * the subsequent pages here. If you want to use the page's reference
5481 * count to decide when to free the allocation, you should allocate a
5482 * compound page, and use put_page() instead of __free_pages().
5484 * Context: May be called in interrupt context or while holding a normal
5485 * spinlock, but not in NMI context or while holding a raw spinlock.
5487 void __free_pages(struct page *page, unsigned int order)
5489 if (put_page_testzero(page))
5490 free_the_page(page, order);
5491 else if (!PageHead(page))
5493 free_the_page(page + (1 << order), order);
5495 EXPORT_SYMBOL(__free_pages);
5497 void free_pages(unsigned long addr, unsigned int order)
5500 VM_BUG_ON(!virt_addr_valid((void *)addr));
5501 __free_pages(virt_to_page((void *)addr), order);
5505 EXPORT_SYMBOL(free_pages);
5509 * An arbitrary-length arbitrary-offset area of memory which resides
5510 * within a 0 or higher order page. Multiple fragments within that page
5511 * are individually refcounted, in the page's reference counter.
5513 * The page_frag functions below provide a simple allocation framework for
5514 * page fragments. This is used by the network stack and network device
5515 * drivers to provide a backing region of memory for use as either an
5516 * sk_buff->head, or to be used in the "frags" portion of skb_shared_info.
5518 static struct page *__page_frag_cache_refill(struct page_frag_cache *nc,
5521 struct page *page = NULL;
5522 gfp_t gfp = gfp_mask;
5524 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
5525 gfp_mask |= __GFP_COMP | __GFP_NOWARN | __GFP_NORETRY |
5527 page = alloc_pages_node(NUMA_NO_NODE, gfp_mask,
5528 PAGE_FRAG_CACHE_MAX_ORDER);
5529 nc->size = page ? PAGE_FRAG_CACHE_MAX_SIZE : PAGE_SIZE;
5531 if (unlikely(!page))
5532 page = alloc_pages_node(NUMA_NO_NODE, gfp, 0);
5534 nc->va = page ? page_address(page) : NULL;
5539 void __page_frag_cache_drain(struct page *page, unsigned int count)
5541 VM_BUG_ON_PAGE(page_ref_count(page) == 0, page);
5543 if (page_ref_sub_and_test(page, count))
5544 free_the_page(page, compound_order(page));
5546 EXPORT_SYMBOL(__page_frag_cache_drain);
5548 void *page_frag_alloc_align(struct page_frag_cache *nc,
5549 unsigned int fragsz, gfp_t gfp_mask,
5550 unsigned int align_mask)
5552 unsigned int size = PAGE_SIZE;
5556 if (unlikely(!nc->va)) {
5558 page = __page_frag_cache_refill(nc, gfp_mask);
5562 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
5563 /* if size can vary use size else just use PAGE_SIZE */
5566 /* Even if we own the page, we do not use atomic_set().
5567 * This would break get_page_unless_zero() users.
5569 page_ref_add(page, PAGE_FRAG_CACHE_MAX_SIZE);
5571 /* reset page count bias and offset to start of new frag */
5572 nc->pfmemalloc = page_is_pfmemalloc(page);
5573 nc->pagecnt_bias = PAGE_FRAG_CACHE_MAX_SIZE + 1;
5577 offset = nc->offset - fragsz;
5578 if (unlikely(offset < 0)) {
5579 page = virt_to_page(nc->va);
5581 if (!page_ref_sub_and_test(page, nc->pagecnt_bias))
5584 if (unlikely(nc->pfmemalloc)) {
5585 free_the_page(page, compound_order(page));
5589 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
5590 /* if size can vary use size else just use PAGE_SIZE */
5593 /* OK, page count is 0, we can safely set it */
5594 set_page_count(page, PAGE_FRAG_CACHE_MAX_SIZE + 1);
5596 /* reset page count bias and offset to start of new frag */
5597 nc->pagecnt_bias = PAGE_FRAG_CACHE_MAX_SIZE + 1;
5598 offset = size - fragsz;
5602 offset &= align_mask;
5603 nc->offset = offset;
5605 return nc->va + offset;
5607 EXPORT_SYMBOL(page_frag_alloc_align);
5610 * Frees a page fragment allocated out of either a compound or order 0 page.
5612 void page_frag_free(void *addr)
5614 struct page *page = virt_to_head_page(addr);
5616 if (unlikely(put_page_testzero(page)))
5617 free_the_page(page, compound_order(page));
5619 EXPORT_SYMBOL(page_frag_free);
5621 static void *make_alloc_exact(unsigned long addr, unsigned int order,
5625 unsigned long alloc_end = addr + (PAGE_SIZE << order);
5626 unsigned long used = addr + PAGE_ALIGN(size);
5628 split_page(virt_to_page((void *)addr), order);
5629 while (used < alloc_end) {
5634 return (void *)addr;
5638 * alloc_pages_exact - allocate an exact number physically-contiguous pages.
5639 * @size: the number of bytes to allocate
5640 * @gfp_mask: GFP flags for the allocation, must not contain __GFP_COMP
5642 * This function is similar to alloc_pages(), except that it allocates the
5643 * minimum number of pages to satisfy the request. alloc_pages() can only
5644 * allocate memory in power-of-two pages.
5646 * This function is also limited by MAX_ORDER.
5648 * Memory allocated by this function must be released by free_pages_exact().
5650 * Return: pointer to the allocated area or %NULL in case of error.
5652 void *alloc_pages_exact(size_t size, gfp_t gfp_mask)
5654 unsigned int order = get_order(size);
5657 if (WARN_ON_ONCE(gfp_mask & (__GFP_COMP | __GFP_HIGHMEM)))
5658 gfp_mask &= ~(__GFP_COMP | __GFP_HIGHMEM);
5660 addr = __get_free_pages(gfp_mask, order);
5661 return make_alloc_exact(addr, order, size);
5663 EXPORT_SYMBOL(alloc_pages_exact);
5666 * alloc_pages_exact_nid - allocate an exact number of physically-contiguous
5668 * @nid: the preferred node ID where memory should be allocated
5669 * @size: the number of bytes to allocate
5670 * @gfp_mask: GFP flags for the allocation, must not contain __GFP_COMP
5672 * Like alloc_pages_exact(), but try to allocate on node nid first before falling
5675 * Return: pointer to the allocated area or %NULL in case of error.
5677 void * __meminit alloc_pages_exact_nid(int nid, size_t size, gfp_t gfp_mask)
5679 unsigned int order = get_order(size);
5682 if (WARN_ON_ONCE(gfp_mask & (__GFP_COMP | __GFP_HIGHMEM)))
5683 gfp_mask &= ~(__GFP_COMP | __GFP_HIGHMEM);
5685 p = alloc_pages_node(nid, gfp_mask, order);
5688 return make_alloc_exact((unsigned long)page_address(p), order, size);
5692 * free_pages_exact - release memory allocated via alloc_pages_exact()
5693 * @virt: the value returned by alloc_pages_exact.
5694 * @size: size of allocation, same value as passed to alloc_pages_exact().
5696 * Release the memory allocated by a previous call to alloc_pages_exact.
5698 void free_pages_exact(void *virt, size_t size)
5700 unsigned long addr = (unsigned long)virt;
5701 unsigned long end = addr + PAGE_ALIGN(size);
5703 while (addr < end) {
5708 EXPORT_SYMBOL(free_pages_exact);
5711 * nr_free_zone_pages - count number of pages beyond high watermark
5712 * @offset: The zone index of the highest zone
5714 * nr_free_zone_pages() counts the number of pages which are beyond the
5715 * high watermark within all zones at or below a given zone index. For each
5716 * zone, the number of pages is calculated as:
5718 * nr_free_zone_pages = managed_pages - high_pages
5720 * Return: number of pages beyond high watermark.
5722 static unsigned long nr_free_zone_pages(int offset)
5727 /* Just pick one node, since fallback list is circular */
5728 unsigned long sum = 0;
5730 struct zonelist *zonelist = node_zonelist(numa_node_id(), GFP_KERNEL);
5732 for_each_zone_zonelist(zone, z, zonelist, offset) {
5733 unsigned long size = zone_managed_pages(zone);
5734 unsigned long high = high_wmark_pages(zone);
5743 * nr_free_buffer_pages - count number of pages beyond high watermark
5745 * nr_free_buffer_pages() counts the number of pages which are beyond the high
5746 * watermark within ZONE_DMA and ZONE_NORMAL.
5748 * Return: number of pages beyond high watermark within ZONE_DMA and
5751 unsigned long nr_free_buffer_pages(void)
5753 return nr_free_zone_pages(gfp_zone(GFP_USER));
5755 EXPORT_SYMBOL_GPL(nr_free_buffer_pages);
5757 static inline void show_node(struct zone *zone)
5759 if (IS_ENABLED(CONFIG_NUMA))
5760 printk("Node %d ", zone_to_nid(zone));
5763 long si_mem_available(void)
5766 unsigned long pagecache;
5767 unsigned long wmark_low = 0;
5768 unsigned long pages[NR_LRU_LISTS];
5769 unsigned long reclaimable;
5773 for (lru = LRU_BASE; lru < NR_LRU_LISTS; lru++)
5774 pages[lru] = global_node_page_state(NR_LRU_BASE + lru);
5777 wmark_low += low_wmark_pages(zone);
5780 * Estimate the amount of memory available for userspace allocations,
5781 * without causing swapping.
5783 available = global_zone_page_state(NR_FREE_PAGES) - totalreserve_pages;
5786 * Not all the page cache can be freed, otherwise the system will
5787 * start swapping. Assume at least half of the page cache, or the
5788 * low watermark worth of cache, needs to stay.
5790 pagecache = pages[LRU_ACTIVE_FILE] + pages[LRU_INACTIVE_FILE];
5791 pagecache -= min(pagecache / 2, wmark_low);
5792 available += pagecache;
5795 * Part of the reclaimable slab and other kernel memory consists of
5796 * items that are in use, and cannot be freed. Cap this estimate at the
5799 reclaimable = global_node_page_state_pages(NR_SLAB_RECLAIMABLE_B) +
5800 global_node_page_state(NR_KERNEL_MISC_RECLAIMABLE);
5801 available += reclaimable - min(reclaimable / 2, wmark_low);
5807 EXPORT_SYMBOL_GPL(si_mem_available);
5809 void si_meminfo(struct sysinfo *val)
5811 val->totalram = totalram_pages();
5812 val->sharedram = global_node_page_state(NR_SHMEM);
5813 val->freeram = global_zone_page_state(NR_FREE_PAGES);
5814 val->bufferram = nr_blockdev_pages();
5815 val->totalhigh = totalhigh_pages();
5816 val->freehigh = nr_free_highpages();
5817 val->mem_unit = PAGE_SIZE;
5820 EXPORT_SYMBOL(si_meminfo);
5823 void si_meminfo_node(struct sysinfo *val, int nid)
5825 int zone_type; /* needs to be signed */
5826 unsigned long managed_pages = 0;
5827 unsigned long managed_highpages = 0;
5828 unsigned long free_highpages = 0;
5829 pg_data_t *pgdat = NODE_DATA(nid);
5831 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++)
5832 managed_pages += zone_managed_pages(&pgdat->node_zones[zone_type]);
5833 val->totalram = managed_pages;
5834 val->sharedram = node_page_state(pgdat, NR_SHMEM);
5835 val->freeram = sum_zone_node_page_state(nid, NR_FREE_PAGES);
5836 #ifdef CONFIG_HIGHMEM
5837 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++) {
5838 struct zone *zone = &pgdat->node_zones[zone_type];
5840 if (is_highmem(zone)) {
5841 managed_highpages += zone_managed_pages(zone);
5842 free_highpages += zone_page_state(zone, NR_FREE_PAGES);
5845 val->totalhigh = managed_highpages;
5846 val->freehigh = free_highpages;
5848 val->totalhigh = managed_highpages;
5849 val->freehigh = free_highpages;
5851 val->mem_unit = PAGE_SIZE;
5856 * Determine whether the node should be displayed or not, depending on whether
5857 * SHOW_MEM_FILTER_NODES was passed to show_free_areas().
5859 static bool show_mem_node_skip(unsigned int flags, int nid, nodemask_t *nodemask)
5861 if (!(flags & SHOW_MEM_FILTER_NODES))
5865 * no node mask - aka implicit memory numa policy. Do not bother with
5866 * the synchronization - read_mems_allowed_begin - because we do not
5867 * have to be precise here.
5870 nodemask = &cpuset_current_mems_allowed;
5872 return !node_isset(nid, *nodemask);
5875 #define K(x) ((x) << (PAGE_SHIFT-10))
5877 static void show_migration_types(unsigned char type)
5879 static const char types[MIGRATE_TYPES] = {
5880 [MIGRATE_UNMOVABLE] = 'U',
5881 [MIGRATE_MOVABLE] = 'M',
5882 [MIGRATE_RECLAIMABLE] = 'E',
5883 [MIGRATE_HIGHATOMIC] = 'H',
5885 [MIGRATE_CMA] = 'C',
5887 #ifdef CONFIG_MEMORY_ISOLATION
5888 [MIGRATE_ISOLATE] = 'I',
5891 char tmp[MIGRATE_TYPES + 1];
5895 for (i = 0; i < MIGRATE_TYPES; i++) {
5896 if (type & (1 << i))
5901 printk(KERN_CONT "(%s) ", tmp);
5905 * Show free area list (used inside shift_scroll-lock stuff)
5906 * We also calculate the percentage fragmentation. We do this by counting the
5907 * memory on each free list with the exception of the first item on the list.
5910 * SHOW_MEM_FILTER_NODES: suppress nodes that are not allowed by current's
5913 void show_free_areas(unsigned int filter, nodemask_t *nodemask)
5915 unsigned long free_pcp = 0;
5920 for_each_populated_zone(zone) {
5921 if (show_mem_node_skip(filter, zone_to_nid(zone), nodemask))
5924 for_each_online_cpu(cpu)
5925 free_pcp += per_cpu_ptr(zone->per_cpu_pageset, cpu)->count;
5928 printk("active_anon:%lu inactive_anon:%lu isolated_anon:%lu\n"
5929 " active_file:%lu inactive_file:%lu isolated_file:%lu\n"
5930 " unevictable:%lu dirty:%lu writeback:%lu\n"
5931 " slab_reclaimable:%lu slab_unreclaimable:%lu\n"
5932 " mapped:%lu shmem:%lu pagetables:%lu bounce:%lu\n"
5933 " kernel_misc_reclaimable:%lu\n"
5934 " free:%lu free_pcp:%lu free_cma:%lu\n",
5935 global_node_page_state(NR_ACTIVE_ANON),
5936 global_node_page_state(NR_INACTIVE_ANON),
5937 global_node_page_state(NR_ISOLATED_ANON),
5938 global_node_page_state(NR_ACTIVE_FILE),
5939 global_node_page_state(NR_INACTIVE_FILE),
5940 global_node_page_state(NR_ISOLATED_FILE),
5941 global_node_page_state(NR_UNEVICTABLE),
5942 global_node_page_state(NR_FILE_DIRTY),
5943 global_node_page_state(NR_WRITEBACK),
5944 global_node_page_state_pages(NR_SLAB_RECLAIMABLE_B),
5945 global_node_page_state_pages(NR_SLAB_UNRECLAIMABLE_B),
5946 global_node_page_state(NR_FILE_MAPPED),
5947 global_node_page_state(NR_SHMEM),
5948 global_node_page_state(NR_PAGETABLE),
5949 global_zone_page_state(NR_BOUNCE),
5950 global_node_page_state(NR_KERNEL_MISC_RECLAIMABLE),
5951 global_zone_page_state(NR_FREE_PAGES),
5953 global_zone_page_state(NR_FREE_CMA_PAGES));
5955 for_each_online_pgdat(pgdat) {
5956 if (show_mem_node_skip(filter, pgdat->node_id, nodemask))
5960 " active_anon:%lukB"
5961 " inactive_anon:%lukB"
5962 " active_file:%lukB"
5963 " inactive_file:%lukB"
5964 " unevictable:%lukB"
5965 " isolated(anon):%lukB"
5966 " isolated(file):%lukB"
5971 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
5973 " shmem_pmdmapped: %lukB"
5976 " writeback_tmp:%lukB"
5977 " kernel_stack:%lukB"
5978 #ifdef CONFIG_SHADOW_CALL_STACK
5979 " shadow_call_stack:%lukB"
5982 " all_unreclaimable? %s"
5985 K(node_page_state(pgdat, NR_ACTIVE_ANON)),
5986 K(node_page_state(pgdat, NR_INACTIVE_ANON)),
5987 K(node_page_state(pgdat, NR_ACTIVE_FILE)),
5988 K(node_page_state(pgdat, NR_INACTIVE_FILE)),
5989 K(node_page_state(pgdat, NR_UNEVICTABLE)),
5990 K(node_page_state(pgdat, NR_ISOLATED_ANON)),
5991 K(node_page_state(pgdat, NR_ISOLATED_FILE)),
5992 K(node_page_state(pgdat, NR_FILE_MAPPED)),
5993 K(node_page_state(pgdat, NR_FILE_DIRTY)),
5994 K(node_page_state(pgdat, NR_WRITEBACK)),
5995 K(node_page_state(pgdat, NR_SHMEM)),
5996 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
5997 K(node_page_state(pgdat, NR_SHMEM_THPS)),
5998 K(node_page_state(pgdat, NR_SHMEM_PMDMAPPED)),
5999 K(node_page_state(pgdat, NR_ANON_THPS)),
6001 K(node_page_state(pgdat, NR_WRITEBACK_TEMP)),
6002 node_page_state(pgdat, NR_KERNEL_STACK_KB),
6003 #ifdef CONFIG_SHADOW_CALL_STACK
6004 node_page_state(pgdat, NR_KERNEL_SCS_KB),
6006 K(node_page_state(pgdat, NR_PAGETABLE)),
6007 pgdat->kswapd_failures >= MAX_RECLAIM_RETRIES ?
6011 for_each_populated_zone(zone) {
6014 if (show_mem_node_skip(filter, zone_to_nid(zone), nodemask))
6018 for_each_online_cpu(cpu)
6019 free_pcp += per_cpu_ptr(zone->per_cpu_pageset, cpu)->count;
6029 " reserved_highatomic:%luKB"
6030 " active_anon:%lukB"
6031 " inactive_anon:%lukB"
6032 " active_file:%lukB"
6033 " inactive_file:%lukB"
6034 " unevictable:%lukB"
6035 " writepending:%lukB"
6045 K(zone_page_state(zone, NR_FREE_PAGES)),
6046 K(zone->watermark_boost),
6047 K(min_wmark_pages(zone)),
6048 K(low_wmark_pages(zone)),
6049 K(high_wmark_pages(zone)),
6050 K(zone->nr_reserved_highatomic),
6051 K(zone_page_state(zone, NR_ZONE_ACTIVE_ANON)),
6052 K(zone_page_state(zone, NR_ZONE_INACTIVE_ANON)),
6053 K(zone_page_state(zone, NR_ZONE_ACTIVE_FILE)),
6054 K(zone_page_state(zone, NR_ZONE_INACTIVE_FILE)),
6055 K(zone_page_state(zone, NR_ZONE_UNEVICTABLE)),
6056 K(zone_page_state(zone, NR_ZONE_WRITE_PENDING)),
6057 K(zone->present_pages),
6058 K(zone_managed_pages(zone)),
6059 K(zone_page_state(zone, NR_MLOCK)),
6060 K(zone_page_state(zone, NR_BOUNCE)),
6062 K(this_cpu_read(zone->per_cpu_pageset->count)),
6063 K(zone_page_state(zone, NR_FREE_CMA_PAGES)));
6064 printk("lowmem_reserve[]:");
6065 for (i = 0; i < MAX_NR_ZONES; i++)
6066 printk(KERN_CONT " %ld", zone->lowmem_reserve[i]);
6067 printk(KERN_CONT "\n");
6070 for_each_populated_zone(zone) {
6072 unsigned long nr[MAX_ORDER], flags, total = 0;
6073 unsigned char types[MAX_ORDER];
6075 if (show_mem_node_skip(filter, zone_to_nid(zone), nodemask))
6078 printk(KERN_CONT "%s: ", zone->name);
6080 spin_lock_irqsave(&zone->lock, flags);
6081 for (order = 0; order < MAX_ORDER; order++) {
6082 struct free_area *area = &zone->free_area[order];
6085 nr[order] = area->nr_free;
6086 total += nr[order] << order;
6089 for (type = 0; type < MIGRATE_TYPES; type++) {
6090 if (!free_area_empty(area, type))
6091 types[order] |= 1 << type;
6094 spin_unlock_irqrestore(&zone->lock, flags);
6095 for (order = 0; order < MAX_ORDER; order++) {
6096 printk(KERN_CONT "%lu*%lukB ",
6097 nr[order], K(1UL) << order);
6099 show_migration_types(types[order]);
6101 printk(KERN_CONT "= %lukB\n", K(total));
6104 hugetlb_show_meminfo();
6106 printk("%ld total pagecache pages\n", global_node_page_state(NR_FILE_PAGES));
6108 show_swap_cache_info();
6111 static void zoneref_set_zone(struct zone *zone, struct zoneref *zoneref)
6113 zoneref->zone = zone;
6114 zoneref->zone_idx = zone_idx(zone);
6118 * Builds allocation fallback zone lists.
6120 * Add all populated zones of a node to the zonelist.
6122 static int build_zonerefs_node(pg_data_t *pgdat, struct zoneref *zonerefs)
6125 enum zone_type zone_type = MAX_NR_ZONES;
6130 zone = pgdat->node_zones + zone_type;
6131 if (managed_zone(zone)) {
6132 zoneref_set_zone(zone, &zonerefs[nr_zones++]);
6133 check_highest_zone(zone_type);
6135 } while (zone_type);
6142 static int __parse_numa_zonelist_order(char *s)
6145 * We used to support different zonelists modes but they turned
6146 * out to be just not useful. Let's keep the warning in place
6147 * if somebody still use the cmd line parameter so that we do
6148 * not fail it silently
6150 if (!(*s == 'd' || *s == 'D' || *s == 'n' || *s == 'N')) {
6151 pr_warn("Ignoring unsupported numa_zonelist_order value: %s\n", s);
6157 char numa_zonelist_order[] = "Node";
6160 * sysctl handler for numa_zonelist_order
6162 int numa_zonelist_order_handler(struct ctl_table *table, int write,
6163 void *buffer, size_t *length, loff_t *ppos)
6166 return __parse_numa_zonelist_order(buffer);
6167 return proc_dostring(table, write, buffer, length, ppos);
6171 #define MAX_NODE_LOAD (nr_online_nodes)
6172 static int node_load[MAX_NUMNODES];
6175 * find_next_best_node - find the next node that should appear in a given node's fallback list
6176 * @node: node whose fallback list we're appending
6177 * @used_node_mask: nodemask_t of already used nodes
6179 * We use a number of factors to determine which is the next node that should
6180 * appear on a given node's fallback list. The node should not have appeared
6181 * already in @node's fallback list, and it should be the next closest node
6182 * according to the distance array (which contains arbitrary distance values
6183 * from each node to each node in the system), and should also prefer nodes
6184 * with no CPUs, since presumably they'll have very little allocation pressure
6185 * on them otherwise.
6187 * Return: node id of the found node or %NUMA_NO_NODE if no node is found.
6189 int find_next_best_node(int node, nodemask_t *used_node_mask)
6192 int min_val = INT_MAX;
6193 int best_node = NUMA_NO_NODE;
6195 /* Use the local node if we haven't already */
6196 if (!node_isset(node, *used_node_mask)) {
6197 node_set(node, *used_node_mask);
6201 for_each_node_state(n, N_MEMORY) {
6203 /* Don't want a node to appear more than once */
6204 if (node_isset(n, *used_node_mask))
6207 /* Use the distance array to find the distance */
6208 val = node_distance(node, n);
6210 /* Penalize nodes under us ("prefer the next node") */
6213 /* Give preference to headless and unused nodes */
6214 if (!cpumask_empty(cpumask_of_node(n)))
6215 val += PENALTY_FOR_NODE_WITH_CPUS;
6217 /* Slight preference for less loaded node */
6218 val *= (MAX_NODE_LOAD*MAX_NUMNODES);
6219 val += node_load[n];
6221 if (val < min_val) {
6228 node_set(best_node, *used_node_mask);
6235 * Build zonelists ordered by node and zones within node.
6236 * This results in maximum locality--normal zone overflows into local
6237 * DMA zone, if any--but risks exhausting DMA zone.
6239 static void build_zonelists_in_node_order(pg_data_t *pgdat, int *node_order,
6242 struct zoneref *zonerefs;
6245 zonerefs = pgdat->node_zonelists[ZONELIST_FALLBACK]._zonerefs;
6247 for (i = 0; i < nr_nodes; i++) {
6250 pg_data_t *node = NODE_DATA(node_order[i]);
6252 nr_zones = build_zonerefs_node(node, zonerefs);
6253 zonerefs += nr_zones;
6255 zonerefs->zone = NULL;
6256 zonerefs->zone_idx = 0;
6260 * Build gfp_thisnode zonelists
6262 static void build_thisnode_zonelists(pg_data_t *pgdat)
6264 struct zoneref *zonerefs;
6267 zonerefs = pgdat->node_zonelists[ZONELIST_NOFALLBACK]._zonerefs;
6268 nr_zones = build_zonerefs_node(pgdat, zonerefs);
6269 zonerefs += nr_zones;
6270 zonerefs->zone = NULL;
6271 zonerefs->zone_idx = 0;
6275 * Build zonelists ordered by zone and nodes within zones.
6276 * This results in conserving DMA zone[s] until all Normal memory is
6277 * exhausted, but results in overflowing to remote node while memory
6278 * may still exist in local DMA zone.
6281 static void build_zonelists(pg_data_t *pgdat)
6283 static int node_order[MAX_NUMNODES];
6284 int node, load, nr_nodes = 0;
6285 nodemask_t used_mask = NODE_MASK_NONE;
6286 int local_node, prev_node;
6288 /* NUMA-aware ordering of nodes */
6289 local_node = pgdat->node_id;
6290 load = nr_online_nodes;
6291 prev_node = local_node;
6293 memset(node_order, 0, sizeof(node_order));
6294 while ((node = find_next_best_node(local_node, &used_mask)) >= 0) {
6296 * We don't want to pressure a particular node.
6297 * So adding penalty to the first node in same
6298 * distance group to make it round-robin.
6300 if (node_distance(local_node, node) !=
6301 node_distance(local_node, prev_node))
6302 node_load[node] += load;
6304 node_order[nr_nodes++] = node;
6309 build_zonelists_in_node_order(pgdat, node_order, nr_nodes);
6310 build_thisnode_zonelists(pgdat);
6311 pr_info("Fallback order for Node %d: ", local_node);
6312 for (node = 0; node < nr_nodes; node++)
6313 pr_cont("%d ", node_order[node]);
6317 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
6319 * Return node id of node used for "local" allocations.
6320 * I.e., first node id of first zone in arg node's generic zonelist.
6321 * Used for initializing percpu 'numa_mem', which is used primarily
6322 * for kernel allocations, so use GFP_KERNEL flags to locate zonelist.
6324 int local_memory_node(int node)
6328 z = first_zones_zonelist(node_zonelist(node, GFP_KERNEL),
6329 gfp_zone(GFP_KERNEL),
6331 return zone_to_nid(z->zone);
6335 static void setup_min_unmapped_ratio(void);
6336 static void setup_min_slab_ratio(void);
6337 #else /* CONFIG_NUMA */
6339 static void build_zonelists(pg_data_t *pgdat)
6341 int node, local_node;
6342 struct zoneref *zonerefs;
6345 local_node = pgdat->node_id;
6347 zonerefs = pgdat->node_zonelists[ZONELIST_FALLBACK]._zonerefs;
6348 nr_zones = build_zonerefs_node(pgdat, zonerefs);
6349 zonerefs += nr_zones;
6352 * Now we build the zonelist so that it contains the zones
6353 * of all the other nodes.
6354 * We don't want to pressure a particular node, so when
6355 * building the zones for node N, we make sure that the
6356 * zones coming right after the local ones are those from
6357 * node N+1 (modulo N)
6359 for (node = local_node + 1; node < MAX_NUMNODES; node++) {
6360 if (!node_online(node))
6362 nr_zones = build_zonerefs_node(NODE_DATA(node), zonerefs);
6363 zonerefs += nr_zones;
6365 for (node = 0; node < local_node; node++) {
6366 if (!node_online(node))
6368 nr_zones = build_zonerefs_node(NODE_DATA(node), zonerefs);
6369 zonerefs += nr_zones;
6372 zonerefs->zone = NULL;
6373 zonerefs->zone_idx = 0;
6376 #endif /* CONFIG_NUMA */
6379 * Boot pageset table. One per cpu which is going to be used for all
6380 * zones and all nodes. The parameters will be set in such a way
6381 * that an item put on a list will immediately be handed over to
6382 * the buddy list. This is safe since pageset manipulation is done
6383 * with interrupts disabled.
6385 * The boot_pagesets must be kept even after bootup is complete for
6386 * unused processors and/or zones. They do play a role for bootstrapping
6387 * hotplugged processors.
6389 * zoneinfo_show() and maybe other functions do
6390 * not check if the processor is online before following the pageset pointer.
6391 * Other parts of the kernel may not check if the zone is available.
6393 static void per_cpu_pages_init(struct per_cpu_pages *pcp, struct per_cpu_zonestat *pzstats);
6394 /* These effectively disable the pcplists in the boot pageset completely */
6395 #define BOOT_PAGESET_HIGH 0
6396 #define BOOT_PAGESET_BATCH 1
6397 static DEFINE_PER_CPU(struct per_cpu_pages, boot_pageset);
6398 static DEFINE_PER_CPU(struct per_cpu_zonestat, boot_zonestats);
6399 DEFINE_PER_CPU(struct per_cpu_nodestat, boot_nodestats);
6401 static void __build_all_zonelists(void *data)
6404 int __maybe_unused cpu;
6405 pg_data_t *self = data;
6406 static DEFINE_SPINLOCK(lock);
6411 memset(node_load, 0, sizeof(node_load));
6415 * This node is hotadded and no memory is yet present. So just
6416 * building zonelists is fine - no need to touch other nodes.
6418 if (self && !node_online(self->node_id)) {
6419 build_zonelists(self);
6422 * All possible nodes have pgdat preallocated
6425 for_each_node(nid) {
6426 pg_data_t *pgdat = NODE_DATA(nid);
6428 build_zonelists(pgdat);
6431 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
6433 * We now know the "local memory node" for each node--
6434 * i.e., the node of the first zone in the generic zonelist.
6435 * Set up numa_mem percpu variable for on-line cpus. During
6436 * boot, only the boot cpu should be on-line; we'll init the
6437 * secondary cpus' numa_mem as they come on-line. During
6438 * node/memory hotplug, we'll fixup all on-line cpus.
6440 for_each_online_cpu(cpu)
6441 set_cpu_numa_mem(cpu, local_memory_node(cpu_to_node(cpu)));
6448 static noinline void __init
6449 build_all_zonelists_init(void)
6453 __build_all_zonelists(NULL);
6456 * Initialize the boot_pagesets that are going to be used
6457 * for bootstrapping processors. The real pagesets for
6458 * each zone will be allocated later when the per cpu
6459 * allocator is available.
6461 * boot_pagesets are used also for bootstrapping offline
6462 * cpus if the system is already booted because the pagesets
6463 * are needed to initialize allocators on a specific cpu too.
6464 * F.e. the percpu allocator needs the page allocator which
6465 * needs the percpu allocator in order to allocate its pagesets
6466 * (a chicken-egg dilemma).
6468 for_each_possible_cpu(cpu)
6469 per_cpu_pages_init(&per_cpu(boot_pageset, cpu), &per_cpu(boot_zonestats, cpu));
6471 mminit_verify_zonelist();
6472 cpuset_init_current_mems_allowed();
6476 * unless system_state == SYSTEM_BOOTING.
6478 * __ref due to call of __init annotated helper build_all_zonelists_init
6479 * [protected by SYSTEM_BOOTING].
6481 void __ref build_all_zonelists(pg_data_t *pgdat)
6483 unsigned long vm_total_pages;
6485 if (system_state == SYSTEM_BOOTING) {
6486 build_all_zonelists_init();
6488 __build_all_zonelists(pgdat);
6489 /* cpuset refresh routine should be here */
6491 /* Get the number of free pages beyond high watermark in all zones. */
6492 vm_total_pages = nr_free_zone_pages(gfp_zone(GFP_HIGHUSER_MOVABLE));
6494 * Disable grouping by mobility if the number of pages in the
6495 * system is too low to allow the mechanism to work. It would be
6496 * more accurate, but expensive to check per-zone. This check is
6497 * made on memory-hotadd so a system can start with mobility
6498 * disabled and enable it later
6500 if (vm_total_pages < (pageblock_nr_pages * MIGRATE_TYPES))
6501 page_group_by_mobility_disabled = 1;
6503 page_group_by_mobility_disabled = 0;
6505 pr_info("Built %u zonelists, mobility grouping %s. Total pages: %ld\n",
6507 page_group_by_mobility_disabled ? "off" : "on",
6510 pr_info("Policy zone: %s\n", zone_names[policy_zone]);
6514 /* If zone is ZONE_MOVABLE but memory is mirrored, it is an overlapped init */
6515 static bool __meminit
6516 overlap_memmap_init(unsigned long zone, unsigned long *pfn)
6518 static struct memblock_region *r;
6520 if (mirrored_kernelcore && zone == ZONE_MOVABLE) {
6521 if (!r || *pfn >= memblock_region_memory_end_pfn(r)) {
6522 for_each_mem_region(r) {
6523 if (*pfn < memblock_region_memory_end_pfn(r))
6527 if (*pfn >= memblock_region_memory_base_pfn(r) &&
6528 memblock_is_mirror(r)) {
6529 *pfn = memblock_region_memory_end_pfn(r);
6537 * Initially all pages are reserved - free ones are freed
6538 * up by memblock_free_all() once the early boot process is
6539 * done. Non-atomic initialization, single-pass.
6541 * All aligned pageblocks are initialized to the specified migratetype
6542 * (usually MIGRATE_MOVABLE). Besides setting the migratetype, no related
6543 * zone stats (e.g., nr_isolate_pageblock) are touched.
6545 void __meminit memmap_init_range(unsigned long size, int nid, unsigned long zone,
6546 unsigned long start_pfn, unsigned long zone_end_pfn,
6547 enum meminit_context context,
6548 struct vmem_altmap *altmap, int migratetype)
6550 unsigned long pfn, end_pfn = start_pfn + size;
6553 if (highest_memmap_pfn < end_pfn - 1)
6554 highest_memmap_pfn = end_pfn - 1;
6556 #ifdef CONFIG_ZONE_DEVICE
6558 * Honor reservation requested by the driver for this ZONE_DEVICE
6559 * memory. We limit the total number of pages to initialize to just
6560 * those that might contain the memory mapping. We will defer the
6561 * ZONE_DEVICE page initialization until after we have released
6564 if (zone == ZONE_DEVICE) {
6568 if (start_pfn == altmap->base_pfn)
6569 start_pfn += altmap->reserve;
6570 end_pfn = altmap->base_pfn + vmem_altmap_offset(altmap);
6574 for (pfn = start_pfn; pfn < end_pfn; ) {
6576 * There can be holes in boot-time mem_map[]s handed to this
6577 * function. They do not exist on hotplugged memory.
6579 if (context == MEMINIT_EARLY) {
6580 if (overlap_memmap_init(zone, &pfn))
6582 if (defer_init(nid, pfn, zone_end_pfn))
6586 page = pfn_to_page(pfn);
6587 __init_single_page(page, pfn, zone, nid);
6588 if (context == MEMINIT_HOTPLUG)
6589 __SetPageReserved(page);
6592 * Usually, we want to mark the pageblock MIGRATE_MOVABLE,
6593 * such that unmovable allocations won't be scattered all
6594 * over the place during system boot.
6596 if (IS_ALIGNED(pfn, pageblock_nr_pages)) {
6597 set_pageblock_migratetype(page, migratetype);
6604 #ifdef CONFIG_ZONE_DEVICE
6605 static void __ref __init_zone_device_page(struct page *page, unsigned long pfn,
6606 unsigned long zone_idx, int nid,
6607 struct dev_pagemap *pgmap)
6610 __init_single_page(page, pfn, zone_idx, nid);
6613 * Mark page reserved as it will need to wait for onlining
6614 * phase for it to be fully associated with a zone.
6616 * We can use the non-atomic __set_bit operation for setting
6617 * the flag as we are still initializing the pages.
6619 __SetPageReserved(page);
6622 * ZONE_DEVICE pages union ->lru with a ->pgmap back pointer
6623 * and zone_device_data. It is a bug if a ZONE_DEVICE page is
6624 * ever freed or placed on a driver-private list.
6626 page->pgmap = pgmap;
6627 page->zone_device_data = NULL;
6630 * Mark the block movable so that blocks are reserved for
6631 * movable at startup. This will force kernel allocations
6632 * to reserve their blocks rather than leaking throughout
6633 * the address space during boot when many long-lived
6634 * kernel allocations are made.
6636 * Please note that MEMINIT_HOTPLUG path doesn't clear memmap
6637 * because this is done early in section_activate()
6639 if (IS_ALIGNED(pfn, pageblock_nr_pages)) {
6640 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
6645 static void __ref memmap_init_compound(struct page *head,
6646 unsigned long head_pfn,
6647 unsigned long zone_idx, int nid,
6648 struct dev_pagemap *pgmap,
6649 unsigned long nr_pages)
6651 unsigned long pfn, end_pfn = head_pfn + nr_pages;
6652 unsigned int order = pgmap->vmemmap_shift;
6654 __SetPageHead(head);
6655 for (pfn = head_pfn + 1; pfn < end_pfn; pfn++) {
6656 struct page *page = pfn_to_page(pfn);
6658 __init_zone_device_page(page, pfn, zone_idx, nid, pgmap);
6659 prep_compound_tail(head, pfn - head_pfn);
6660 set_page_count(page, 0);
6663 * The first tail page stores compound_mapcount_ptr() and
6664 * compound_order() and the second tail page stores
6665 * compound_pincount_ptr(). Call prep_compound_head() after
6666 * the first and second tail pages have been initialized to
6667 * not have the data overwritten.
6669 if (pfn == head_pfn + 2)
6670 prep_compound_head(head, order);
6674 void __ref memmap_init_zone_device(struct zone *zone,
6675 unsigned long start_pfn,
6676 unsigned long nr_pages,
6677 struct dev_pagemap *pgmap)
6679 unsigned long pfn, end_pfn = start_pfn + nr_pages;
6680 struct pglist_data *pgdat = zone->zone_pgdat;
6681 struct vmem_altmap *altmap = pgmap_altmap(pgmap);
6682 unsigned int pfns_per_compound = pgmap_vmemmap_nr(pgmap);
6683 unsigned long zone_idx = zone_idx(zone);
6684 unsigned long start = jiffies;
6685 int nid = pgdat->node_id;
6687 if (WARN_ON_ONCE(!pgmap || zone_idx(zone) != ZONE_DEVICE))
6691 * The call to memmap_init should have already taken care
6692 * of the pages reserved for the memmap, so we can just jump to
6693 * the end of that region and start processing the device pages.
6696 start_pfn = altmap->base_pfn + vmem_altmap_offset(altmap);
6697 nr_pages = end_pfn - start_pfn;
6700 for (pfn = start_pfn; pfn < end_pfn; pfn += pfns_per_compound) {
6701 struct page *page = pfn_to_page(pfn);
6703 __init_zone_device_page(page, pfn, zone_idx, nid, pgmap);
6705 if (pfns_per_compound == 1)
6708 memmap_init_compound(page, pfn, zone_idx, nid, pgmap,
6712 pr_info("%s initialised %lu pages in %ums\n", __func__,
6713 nr_pages, jiffies_to_msecs(jiffies - start));
6717 static void __meminit zone_init_free_lists(struct zone *zone)
6719 unsigned int order, t;
6720 for_each_migratetype_order(order, t) {
6721 INIT_LIST_HEAD(&zone->free_area[order].free_list[t]);
6722 zone->free_area[order].nr_free = 0;
6727 * Only struct pages that correspond to ranges defined by memblock.memory
6728 * are zeroed and initialized by going through __init_single_page() during
6729 * memmap_init_zone_range().
6731 * But, there could be struct pages that correspond to holes in
6732 * memblock.memory. This can happen because of the following reasons:
6733 * - physical memory bank size is not necessarily the exact multiple of the
6734 * arbitrary section size
6735 * - early reserved memory may not be listed in memblock.memory
6736 * - memory layouts defined with memmap= kernel parameter may not align
6737 * nicely with memmap sections
6739 * Explicitly initialize those struct pages so that:
6740 * - PG_Reserved is set
6741 * - zone and node links point to zone and node that span the page if the
6742 * hole is in the middle of a zone
6743 * - zone and node links point to adjacent zone/node if the hole falls on
6744 * the zone boundary; the pages in such holes will be prepended to the
6745 * zone/node above the hole except for the trailing pages in the last
6746 * section that will be appended to the zone/node below.
6748 static void __init init_unavailable_range(unsigned long spfn,
6755 for (pfn = spfn; pfn < epfn; pfn++) {
6756 if (!pfn_valid(ALIGN_DOWN(pfn, pageblock_nr_pages))) {
6757 pfn = ALIGN_DOWN(pfn, pageblock_nr_pages)
6758 + pageblock_nr_pages - 1;
6761 __init_single_page(pfn_to_page(pfn), pfn, zone, node);
6762 __SetPageReserved(pfn_to_page(pfn));
6767 pr_info("On node %d, zone %s: %lld pages in unavailable ranges",
6768 node, zone_names[zone], pgcnt);
6771 static void __init memmap_init_zone_range(struct zone *zone,
6772 unsigned long start_pfn,
6773 unsigned long end_pfn,
6774 unsigned long *hole_pfn)
6776 unsigned long zone_start_pfn = zone->zone_start_pfn;
6777 unsigned long zone_end_pfn = zone_start_pfn + zone->spanned_pages;
6778 int nid = zone_to_nid(zone), zone_id = zone_idx(zone);
6780 start_pfn = clamp(start_pfn, zone_start_pfn, zone_end_pfn);
6781 end_pfn = clamp(end_pfn, zone_start_pfn, zone_end_pfn);
6783 if (start_pfn >= end_pfn)
6786 memmap_init_range(end_pfn - start_pfn, nid, zone_id, start_pfn,
6787 zone_end_pfn, MEMINIT_EARLY, NULL, MIGRATE_MOVABLE);
6789 if (*hole_pfn < start_pfn)
6790 init_unavailable_range(*hole_pfn, start_pfn, zone_id, nid);
6792 *hole_pfn = end_pfn;
6795 static void __init memmap_init(void)
6797 unsigned long start_pfn, end_pfn;
6798 unsigned long hole_pfn = 0;
6799 int i, j, zone_id = 0, nid;
6801 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid) {
6802 struct pglist_data *node = NODE_DATA(nid);
6804 for (j = 0; j < MAX_NR_ZONES; j++) {
6805 struct zone *zone = node->node_zones + j;
6807 if (!populated_zone(zone))
6810 memmap_init_zone_range(zone, start_pfn, end_pfn,
6816 #ifdef CONFIG_SPARSEMEM
6818 * Initialize the memory map for hole in the range [memory_end,
6820 * Append the pages in this hole to the highest zone in the last
6822 * The call to init_unavailable_range() is outside the ifdef to
6823 * silence the compiler warining about zone_id set but not used;
6824 * for FLATMEM it is a nop anyway
6826 end_pfn = round_up(end_pfn, PAGES_PER_SECTION);
6827 if (hole_pfn < end_pfn)
6829 init_unavailable_range(hole_pfn, end_pfn, zone_id, nid);
6832 void __init *memmap_alloc(phys_addr_t size, phys_addr_t align,
6833 phys_addr_t min_addr, int nid, bool exact_nid)
6838 ptr = memblock_alloc_exact_nid_raw(size, align, min_addr,
6839 MEMBLOCK_ALLOC_ACCESSIBLE,
6842 ptr = memblock_alloc_try_nid_raw(size, align, min_addr,
6843 MEMBLOCK_ALLOC_ACCESSIBLE,
6846 if (ptr && size > 0)
6847 page_init_poison(ptr, size);
6852 static int zone_batchsize(struct zone *zone)
6858 * The number of pages to batch allocate is either ~0.1%
6859 * of the zone or 1MB, whichever is smaller. The batch
6860 * size is striking a balance between allocation latency
6861 * and zone lock contention.
6863 batch = min(zone_managed_pages(zone) >> 10, (1024 * 1024) / PAGE_SIZE);
6864 batch /= 4; /* We effectively *= 4 below */
6869 * Clamp the batch to a 2^n - 1 value. Having a power
6870 * of 2 value was found to be more likely to have
6871 * suboptimal cache aliasing properties in some cases.
6873 * For example if 2 tasks are alternately allocating
6874 * batches of pages, one task can end up with a lot
6875 * of pages of one half of the possible page colors
6876 * and the other with pages of the other colors.
6878 batch = rounddown_pow_of_two(batch + batch/2) - 1;
6883 /* The deferral and batching of frees should be suppressed under NOMMU
6886 * The problem is that NOMMU needs to be able to allocate large chunks
6887 * of contiguous memory as there's no hardware page translation to
6888 * assemble apparent contiguous memory from discontiguous pages.
6890 * Queueing large contiguous runs of pages for batching, however,
6891 * causes the pages to actually be freed in smaller chunks. As there
6892 * can be a significant delay between the individual batches being
6893 * recycled, this leads to the once large chunks of space being
6894 * fragmented and becoming unavailable for high-order allocations.
6900 static int zone_highsize(struct zone *zone, int batch, int cpu_online)
6905 unsigned long total_pages;
6907 if (!percpu_pagelist_high_fraction) {
6909 * By default, the high value of the pcp is based on the zone
6910 * low watermark so that if they are full then background
6911 * reclaim will not be started prematurely.
6913 total_pages = low_wmark_pages(zone);
6916 * If percpu_pagelist_high_fraction is configured, the high
6917 * value is based on a fraction of the managed pages in the
6920 total_pages = zone_managed_pages(zone) / percpu_pagelist_high_fraction;
6924 * Split the high value across all online CPUs local to the zone. Note
6925 * that early in boot that CPUs may not be online yet and that during
6926 * CPU hotplug that the cpumask is not yet updated when a CPU is being
6927 * onlined. For memory nodes that have no CPUs, split pcp->high across
6928 * all online CPUs to mitigate the risk that reclaim is triggered
6929 * prematurely due to pages stored on pcp lists.
6931 nr_split_cpus = cpumask_weight(cpumask_of_node(zone_to_nid(zone))) + cpu_online;
6933 nr_split_cpus = num_online_cpus();
6934 high = total_pages / nr_split_cpus;
6937 * Ensure high is at least batch*4. The multiple is based on the
6938 * historical relationship between high and batch.
6940 high = max(high, batch << 2);
6949 * pcp->high and pcp->batch values are related and generally batch is lower
6950 * than high. They are also related to pcp->count such that count is lower
6951 * than high, and as soon as it reaches high, the pcplist is flushed.
6953 * However, guaranteeing these relations at all times would require e.g. write
6954 * barriers here but also careful usage of read barriers at the read side, and
6955 * thus be prone to error and bad for performance. Thus the update only prevents
6956 * store tearing. Any new users of pcp->batch and pcp->high should ensure they
6957 * can cope with those fields changing asynchronously, and fully trust only the
6958 * pcp->count field on the local CPU with interrupts disabled.
6960 * mutex_is_locked(&pcp_batch_high_lock) required when calling this function
6961 * outside of boot time (or some other assurance that no concurrent updaters
6964 static void pageset_update(struct per_cpu_pages *pcp, unsigned long high,
6965 unsigned long batch)
6967 WRITE_ONCE(pcp->batch, batch);
6968 WRITE_ONCE(pcp->high, high);
6971 static void per_cpu_pages_init(struct per_cpu_pages *pcp, struct per_cpu_zonestat *pzstats)
6975 memset(pcp, 0, sizeof(*pcp));
6976 memset(pzstats, 0, sizeof(*pzstats));
6978 for (pindex = 0; pindex < NR_PCP_LISTS; pindex++)
6979 INIT_LIST_HEAD(&pcp->lists[pindex]);
6982 * Set batch and high values safe for a boot pageset. A true percpu
6983 * pageset's initialization will update them subsequently. Here we don't
6984 * need to be as careful as pageset_update() as nobody can access the
6987 pcp->high = BOOT_PAGESET_HIGH;
6988 pcp->batch = BOOT_PAGESET_BATCH;
6989 pcp->free_factor = 0;
6992 static void __zone_set_pageset_high_and_batch(struct zone *zone, unsigned long high,
6993 unsigned long batch)
6995 struct per_cpu_pages *pcp;
6998 for_each_possible_cpu(cpu) {
6999 pcp = per_cpu_ptr(zone->per_cpu_pageset, cpu);
7000 pageset_update(pcp, high, batch);
7005 * Calculate and set new high and batch values for all per-cpu pagesets of a
7006 * zone based on the zone's size.
7008 static void zone_set_pageset_high_and_batch(struct zone *zone, int cpu_online)
7010 int new_high, new_batch;
7012 new_batch = max(1, zone_batchsize(zone));
7013 new_high = zone_highsize(zone, new_batch, cpu_online);
7015 if (zone->pageset_high == new_high &&
7016 zone->pageset_batch == new_batch)
7019 zone->pageset_high = new_high;
7020 zone->pageset_batch = new_batch;
7022 __zone_set_pageset_high_and_batch(zone, new_high, new_batch);
7025 void __meminit setup_zone_pageset(struct zone *zone)
7029 /* Size may be 0 on !SMP && !NUMA */
7030 if (sizeof(struct per_cpu_zonestat) > 0)
7031 zone->per_cpu_zonestats = alloc_percpu(struct per_cpu_zonestat);
7033 zone->per_cpu_pageset = alloc_percpu(struct per_cpu_pages);
7034 for_each_possible_cpu(cpu) {
7035 struct per_cpu_pages *pcp;
7036 struct per_cpu_zonestat *pzstats;
7038 pcp = per_cpu_ptr(zone->per_cpu_pageset, cpu);
7039 pzstats = per_cpu_ptr(zone->per_cpu_zonestats, cpu);
7040 per_cpu_pages_init(pcp, pzstats);
7043 zone_set_pageset_high_and_batch(zone, 0);
7047 * Allocate per cpu pagesets and initialize them.
7048 * Before this call only boot pagesets were available.
7050 void __init setup_per_cpu_pageset(void)
7052 struct pglist_data *pgdat;
7054 int __maybe_unused cpu;
7056 for_each_populated_zone(zone)
7057 setup_zone_pageset(zone);
7061 * Unpopulated zones continue using the boot pagesets.
7062 * The numa stats for these pagesets need to be reset.
7063 * Otherwise, they will end up skewing the stats of
7064 * the nodes these zones are associated with.
7066 for_each_possible_cpu(cpu) {
7067 struct per_cpu_zonestat *pzstats = &per_cpu(boot_zonestats, cpu);
7068 memset(pzstats->vm_numa_event, 0,
7069 sizeof(pzstats->vm_numa_event));
7073 for_each_online_pgdat(pgdat)
7074 pgdat->per_cpu_nodestats =
7075 alloc_percpu(struct per_cpu_nodestat);
7078 static __meminit void zone_pcp_init(struct zone *zone)
7081 * per cpu subsystem is not up at this point. The following code
7082 * relies on the ability of the linker to provide the
7083 * offset of a (static) per cpu variable into the per cpu area.
7085 zone->per_cpu_pageset = &boot_pageset;
7086 zone->per_cpu_zonestats = &boot_zonestats;
7087 zone->pageset_high = BOOT_PAGESET_HIGH;
7088 zone->pageset_batch = BOOT_PAGESET_BATCH;
7090 if (populated_zone(zone))
7091 pr_debug(" %s zone: %lu pages, LIFO batch:%u\n", zone->name,
7092 zone->present_pages, zone_batchsize(zone));
7095 void __meminit init_currently_empty_zone(struct zone *zone,
7096 unsigned long zone_start_pfn,
7099 struct pglist_data *pgdat = zone->zone_pgdat;
7100 int zone_idx = zone_idx(zone) + 1;
7102 if (zone_idx > pgdat->nr_zones)
7103 pgdat->nr_zones = zone_idx;
7105 zone->zone_start_pfn = zone_start_pfn;
7107 mminit_dprintk(MMINIT_TRACE, "memmap_init",
7108 "Initialising map node %d zone %lu pfns %lu -> %lu\n",
7110 (unsigned long)zone_idx(zone),
7111 zone_start_pfn, (zone_start_pfn + size));
7113 zone_init_free_lists(zone);
7114 zone->initialized = 1;
7118 * get_pfn_range_for_nid - Return the start and end page frames for a node
7119 * @nid: The nid to return the range for. If MAX_NUMNODES, the min and max PFN are returned.
7120 * @start_pfn: Passed by reference. On return, it will have the node start_pfn.
7121 * @end_pfn: Passed by reference. On return, it will have the node end_pfn.
7123 * It returns the start and end page frame of a node based on information
7124 * provided by memblock_set_node(). If called for a node
7125 * with no available memory, a warning is printed and the start and end
7128 void __init get_pfn_range_for_nid(unsigned int nid,
7129 unsigned long *start_pfn, unsigned long *end_pfn)
7131 unsigned long this_start_pfn, this_end_pfn;
7137 for_each_mem_pfn_range(i, nid, &this_start_pfn, &this_end_pfn, NULL) {
7138 *start_pfn = min(*start_pfn, this_start_pfn);
7139 *end_pfn = max(*end_pfn, this_end_pfn);
7142 if (*start_pfn == -1UL)
7147 * This finds a zone that can be used for ZONE_MOVABLE pages. The
7148 * assumption is made that zones within a node are ordered in monotonic
7149 * increasing memory addresses so that the "highest" populated zone is used
7151 static void __init find_usable_zone_for_movable(void)
7154 for (zone_index = MAX_NR_ZONES - 1; zone_index >= 0; zone_index--) {
7155 if (zone_index == ZONE_MOVABLE)
7158 if (arch_zone_highest_possible_pfn[zone_index] >
7159 arch_zone_lowest_possible_pfn[zone_index])
7163 VM_BUG_ON(zone_index == -1);
7164 movable_zone = zone_index;
7168 * The zone ranges provided by the architecture do not include ZONE_MOVABLE
7169 * because it is sized independent of architecture. Unlike the other zones,
7170 * the starting point for ZONE_MOVABLE is not fixed. It may be different
7171 * in each node depending on the size of each node and how evenly kernelcore
7172 * is distributed. This helper function adjusts the zone ranges
7173 * provided by the architecture for a given node by using the end of the
7174 * highest usable zone for ZONE_MOVABLE. This preserves the assumption that
7175 * zones within a node are in order of monotonic increases memory addresses
7177 static void __init adjust_zone_range_for_zone_movable(int nid,
7178 unsigned long zone_type,
7179 unsigned long node_start_pfn,
7180 unsigned long node_end_pfn,
7181 unsigned long *zone_start_pfn,
7182 unsigned long *zone_end_pfn)
7184 /* Only adjust if ZONE_MOVABLE is on this node */
7185 if (zone_movable_pfn[nid]) {
7186 /* Size ZONE_MOVABLE */
7187 if (zone_type == ZONE_MOVABLE) {
7188 *zone_start_pfn = zone_movable_pfn[nid];
7189 *zone_end_pfn = min(node_end_pfn,
7190 arch_zone_highest_possible_pfn[movable_zone]);
7192 /* Adjust for ZONE_MOVABLE starting within this range */
7193 } else if (!mirrored_kernelcore &&
7194 *zone_start_pfn < zone_movable_pfn[nid] &&
7195 *zone_end_pfn > zone_movable_pfn[nid]) {
7196 *zone_end_pfn = zone_movable_pfn[nid];
7198 /* Check if this whole range is within ZONE_MOVABLE */
7199 } else if (*zone_start_pfn >= zone_movable_pfn[nid])
7200 *zone_start_pfn = *zone_end_pfn;
7205 * Return the number of pages a zone spans in a node, including holes
7206 * present_pages = zone_spanned_pages_in_node() - zone_absent_pages_in_node()
7208 static unsigned long __init zone_spanned_pages_in_node(int nid,
7209 unsigned long zone_type,
7210 unsigned long node_start_pfn,
7211 unsigned long node_end_pfn,
7212 unsigned long *zone_start_pfn,
7213 unsigned long *zone_end_pfn)
7215 unsigned long zone_low = arch_zone_lowest_possible_pfn[zone_type];
7216 unsigned long zone_high = arch_zone_highest_possible_pfn[zone_type];
7217 /* When hotadd a new node from cpu_up(), the node should be empty */
7218 if (!node_start_pfn && !node_end_pfn)
7221 /* Get the start and end of the zone */
7222 *zone_start_pfn = clamp(node_start_pfn, zone_low, zone_high);
7223 *zone_end_pfn = clamp(node_end_pfn, zone_low, zone_high);
7224 adjust_zone_range_for_zone_movable(nid, zone_type,
7225 node_start_pfn, node_end_pfn,
7226 zone_start_pfn, zone_end_pfn);
7228 /* Check that this node has pages within the zone's required range */
7229 if (*zone_end_pfn < node_start_pfn || *zone_start_pfn > node_end_pfn)
7232 /* Move the zone boundaries inside the node if necessary */
7233 *zone_end_pfn = min(*zone_end_pfn, node_end_pfn);
7234 *zone_start_pfn = max(*zone_start_pfn, node_start_pfn);
7236 /* Return the spanned pages */
7237 return *zone_end_pfn - *zone_start_pfn;
7241 * Return the number of holes in a range on a node. If nid is MAX_NUMNODES,
7242 * then all holes in the requested range will be accounted for.
7244 unsigned long __init __absent_pages_in_range(int nid,
7245 unsigned long range_start_pfn,
7246 unsigned long range_end_pfn)
7248 unsigned long nr_absent = range_end_pfn - range_start_pfn;
7249 unsigned long start_pfn, end_pfn;
7252 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
7253 start_pfn = clamp(start_pfn, range_start_pfn, range_end_pfn);
7254 end_pfn = clamp(end_pfn, range_start_pfn, range_end_pfn);
7255 nr_absent -= end_pfn - start_pfn;
7261 * absent_pages_in_range - Return number of page frames in holes within a range
7262 * @start_pfn: The start PFN to start searching for holes
7263 * @end_pfn: The end PFN to stop searching for holes
7265 * Return: the number of pages frames in memory holes within a range.
7267 unsigned long __init absent_pages_in_range(unsigned long start_pfn,
7268 unsigned long end_pfn)
7270 return __absent_pages_in_range(MAX_NUMNODES, start_pfn, end_pfn);
7273 /* Return the number of page frames in holes in a zone on a node */
7274 static unsigned long __init zone_absent_pages_in_node(int nid,
7275 unsigned long zone_type,
7276 unsigned long node_start_pfn,
7277 unsigned long node_end_pfn)
7279 unsigned long zone_low = arch_zone_lowest_possible_pfn[zone_type];
7280 unsigned long zone_high = arch_zone_highest_possible_pfn[zone_type];
7281 unsigned long zone_start_pfn, zone_end_pfn;
7282 unsigned long nr_absent;
7284 /* When hotadd a new node from cpu_up(), the node should be empty */
7285 if (!node_start_pfn && !node_end_pfn)
7288 zone_start_pfn = clamp(node_start_pfn, zone_low, zone_high);
7289 zone_end_pfn = clamp(node_end_pfn, zone_low, zone_high);
7291 adjust_zone_range_for_zone_movable(nid, zone_type,
7292 node_start_pfn, node_end_pfn,
7293 &zone_start_pfn, &zone_end_pfn);
7294 nr_absent = __absent_pages_in_range(nid, zone_start_pfn, zone_end_pfn);
7297 * ZONE_MOVABLE handling.
7298 * Treat pages to be ZONE_MOVABLE in ZONE_NORMAL as absent pages
7301 if (mirrored_kernelcore && zone_movable_pfn[nid]) {
7302 unsigned long start_pfn, end_pfn;
7303 struct memblock_region *r;
7305 for_each_mem_region(r) {
7306 start_pfn = clamp(memblock_region_memory_base_pfn(r),
7307 zone_start_pfn, zone_end_pfn);
7308 end_pfn = clamp(memblock_region_memory_end_pfn(r),
7309 zone_start_pfn, zone_end_pfn);
7311 if (zone_type == ZONE_MOVABLE &&
7312 memblock_is_mirror(r))
7313 nr_absent += end_pfn - start_pfn;
7315 if (zone_type == ZONE_NORMAL &&
7316 !memblock_is_mirror(r))
7317 nr_absent += end_pfn - start_pfn;
7324 static void __init calculate_node_totalpages(struct pglist_data *pgdat,
7325 unsigned long node_start_pfn,
7326 unsigned long node_end_pfn)
7328 unsigned long realtotalpages = 0, totalpages = 0;
7331 for (i = 0; i < MAX_NR_ZONES; i++) {
7332 struct zone *zone = pgdat->node_zones + i;
7333 unsigned long zone_start_pfn, zone_end_pfn;
7334 unsigned long spanned, absent;
7335 unsigned long size, real_size;
7337 spanned = zone_spanned_pages_in_node(pgdat->node_id, i,
7342 absent = zone_absent_pages_in_node(pgdat->node_id, i,
7347 real_size = size - absent;
7350 zone->zone_start_pfn = zone_start_pfn;
7352 zone->zone_start_pfn = 0;
7353 zone->spanned_pages = size;
7354 zone->present_pages = real_size;
7355 #if defined(CONFIG_MEMORY_HOTPLUG)
7356 zone->present_early_pages = real_size;
7360 realtotalpages += real_size;
7363 pgdat->node_spanned_pages = totalpages;
7364 pgdat->node_present_pages = realtotalpages;
7365 pr_debug("On node %d totalpages: %lu\n", pgdat->node_id, realtotalpages);
7368 #ifndef CONFIG_SPARSEMEM
7370 * Calculate the size of the zone->blockflags rounded to an unsigned long
7371 * Start by making sure zonesize is a multiple of pageblock_order by rounding
7372 * up. Then use 1 NR_PAGEBLOCK_BITS worth of bits per pageblock, finally
7373 * round what is now in bits to nearest long in bits, then return it in
7376 static unsigned long __init usemap_size(unsigned long zone_start_pfn, unsigned long zonesize)
7378 unsigned long usemapsize;
7380 zonesize += zone_start_pfn & (pageblock_nr_pages-1);
7381 usemapsize = roundup(zonesize, pageblock_nr_pages);
7382 usemapsize = usemapsize >> pageblock_order;
7383 usemapsize *= NR_PAGEBLOCK_BITS;
7384 usemapsize = roundup(usemapsize, 8 * sizeof(unsigned long));
7386 return usemapsize / 8;
7389 static void __ref setup_usemap(struct zone *zone)
7391 unsigned long usemapsize = usemap_size(zone->zone_start_pfn,
7392 zone->spanned_pages);
7393 zone->pageblock_flags = NULL;
7395 zone->pageblock_flags =
7396 memblock_alloc_node(usemapsize, SMP_CACHE_BYTES,
7398 if (!zone->pageblock_flags)
7399 panic("Failed to allocate %ld bytes for zone %s pageblock flags on node %d\n",
7400 usemapsize, zone->name, zone_to_nid(zone));
7404 static inline void setup_usemap(struct zone *zone) {}
7405 #endif /* CONFIG_SPARSEMEM */
7407 #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
7409 /* Initialise the number of pages represented by NR_PAGEBLOCK_BITS */
7410 void __init set_pageblock_order(void)
7412 unsigned int order = MAX_ORDER - 1;
7414 /* Check that pageblock_nr_pages has not already been setup */
7415 if (pageblock_order)
7418 /* Don't let pageblocks exceed the maximum allocation granularity. */
7419 if (HPAGE_SHIFT > PAGE_SHIFT && HUGETLB_PAGE_ORDER < order)
7420 order = HUGETLB_PAGE_ORDER;
7423 * Assume the largest contiguous order of interest is a huge page.
7424 * This value may be variable depending on boot parameters on IA64 and
7427 pageblock_order = order;
7429 #else /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
7432 * When CONFIG_HUGETLB_PAGE_SIZE_VARIABLE is not set, set_pageblock_order()
7433 * is unused as pageblock_order is set at compile-time. See
7434 * include/linux/pageblock-flags.h for the values of pageblock_order based on
7437 void __init set_pageblock_order(void)
7441 #endif /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
7443 static unsigned long __init calc_memmap_size(unsigned long spanned_pages,
7444 unsigned long present_pages)
7446 unsigned long pages = spanned_pages;
7449 * Provide a more accurate estimation if there are holes within
7450 * the zone and SPARSEMEM is in use. If there are holes within the
7451 * zone, each populated memory region may cost us one or two extra
7452 * memmap pages due to alignment because memmap pages for each
7453 * populated regions may not be naturally aligned on page boundary.
7454 * So the (present_pages >> 4) heuristic is a tradeoff for that.
7456 if (spanned_pages > present_pages + (present_pages >> 4) &&
7457 IS_ENABLED(CONFIG_SPARSEMEM))
7458 pages = present_pages;
7460 return PAGE_ALIGN(pages * sizeof(struct page)) >> PAGE_SHIFT;
7463 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
7464 static void pgdat_init_split_queue(struct pglist_data *pgdat)
7466 struct deferred_split *ds_queue = &pgdat->deferred_split_queue;
7468 spin_lock_init(&ds_queue->split_queue_lock);
7469 INIT_LIST_HEAD(&ds_queue->split_queue);
7470 ds_queue->split_queue_len = 0;
7473 static void pgdat_init_split_queue(struct pglist_data *pgdat) {}
7476 #ifdef CONFIG_COMPACTION
7477 static void pgdat_init_kcompactd(struct pglist_data *pgdat)
7479 init_waitqueue_head(&pgdat->kcompactd_wait);
7482 static void pgdat_init_kcompactd(struct pglist_data *pgdat) {}
7485 static void __meminit pgdat_init_internals(struct pglist_data *pgdat)
7489 pgdat_resize_init(pgdat);
7491 pgdat_init_split_queue(pgdat);
7492 pgdat_init_kcompactd(pgdat);
7494 init_waitqueue_head(&pgdat->kswapd_wait);
7495 init_waitqueue_head(&pgdat->pfmemalloc_wait);
7497 for (i = 0; i < NR_VMSCAN_THROTTLE; i++)
7498 init_waitqueue_head(&pgdat->reclaim_wait[i]);
7500 pgdat_page_ext_init(pgdat);
7501 lruvec_init(&pgdat->__lruvec);
7504 static void __meminit zone_init_internals(struct zone *zone, enum zone_type idx, int nid,
7505 unsigned long remaining_pages)
7507 atomic_long_set(&zone->managed_pages, remaining_pages);
7508 zone_set_nid(zone, nid);
7509 zone->name = zone_names[idx];
7510 zone->zone_pgdat = NODE_DATA(nid);
7511 spin_lock_init(&zone->lock);
7512 zone_seqlock_init(zone);
7513 zone_pcp_init(zone);
7517 * Set up the zone data structures
7518 * - init pgdat internals
7519 * - init all zones belonging to this node
7521 * NOTE: this function is only called during memory hotplug
7523 #ifdef CONFIG_MEMORY_HOTPLUG
7524 void __ref free_area_init_core_hotplug(struct pglist_data *pgdat)
7526 int nid = pgdat->node_id;
7530 pgdat_init_internals(pgdat);
7532 if (pgdat->per_cpu_nodestats == &boot_nodestats)
7533 pgdat->per_cpu_nodestats = alloc_percpu(struct per_cpu_nodestat);
7536 * Reset the nr_zones, order and highest_zoneidx before reuse.
7537 * Note that kswapd will init kswapd_highest_zoneidx properly
7538 * when it starts in the near future.
7540 pgdat->nr_zones = 0;
7541 pgdat->kswapd_order = 0;
7542 pgdat->kswapd_highest_zoneidx = 0;
7543 pgdat->node_start_pfn = 0;
7544 for_each_online_cpu(cpu) {
7545 struct per_cpu_nodestat *p;
7547 p = per_cpu_ptr(pgdat->per_cpu_nodestats, cpu);
7548 memset(p, 0, sizeof(*p));
7551 for (z = 0; z < MAX_NR_ZONES; z++)
7552 zone_init_internals(&pgdat->node_zones[z], z, nid, 0);
7557 * Set up the zone data structures:
7558 * - mark all pages reserved
7559 * - mark all memory queues empty
7560 * - clear the memory bitmaps
7562 * NOTE: pgdat should get zeroed by caller.
7563 * NOTE: this function is only called during early init.
7565 static void __init free_area_init_core(struct pglist_data *pgdat)
7568 int nid = pgdat->node_id;
7570 pgdat_init_internals(pgdat);
7571 pgdat->per_cpu_nodestats = &boot_nodestats;
7573 for (j = 0; j < MAX_NR_ZONES; j++) {
7574 struct zone *zone = pgdat->node_zones + j;
7575 unsigned long size, freesize, memmap_pages;
7577 size = zone->spanned_pages;
7578 freesize = zone->present_pages;
7581 * Adjust freesize so that it accounts for how much memory
7582 * is used by this zone for memmap. This affects the watermark
7583 * and per-cpu initialisations
7585 memmap_pages = calc_memmap_size(size, freesize);
7586 if (!is_highmem_idx(j)) {
7587 if (freesize >= memmap_pages) {
7588 freesize -= memmap_pages;
7590 pr_debug(" %s zone: %lu pages used for memmap\n",
7591 zone_names[j], memmap_pages);
7593 pr_warn(" %s zone: %lu memmap pages exceeds freesize %lu\n",
7594 zone_names[j], memmap_pages, freesize);
7597 /* Account for reserved pages */
7598 if (j == 0 && freesize > dma_reserve) {
7599 freesize -= dma_reserve;
7600 pr_debug(" %s zone: %lu pages reserved\n", zone_names[0], dma_reserve);
7603 if (!is_highmem_idx(j))
7604 nr_kernel_pages += freesize;
7605 /* Charge for highmem memmap if there are enough kernel pages */
7606 else if (nr_kernel_pages > memmap_pages * 2)
7607 nr_kernel_pages -= memmap_pages;
7608 nr_all_pages += freesize;
7611 * Set an approximate value for lowmem here, it will be adjusted
7612 * when the bootmem allocator frees pages into the buddy system.
7613 * And all highmem pages will be managed by the buddy system.
7615 zone_init_internals(zone, j, nid, freesize);
7620 set_pageblock_order();
7622 init_currently_empty_zone(zone, zone->zone_start_pfn, size);
7626 #ifdef CONFIG_FLATMEM
7627 static void __init alloc_node_mem_map(struct pglist_data *pgdat)
7629 unsigned long __maybe_unused start = 0;
7630 unsigned long __maybe_unused offset = 0;
7632 /* Skip empty nodes */
7633 if (!pgdat->node_spanned_pages)
7636 start = pgdat->node_start_pfn & ~(MAX_ORDER_NR_PAGES - 1);
7637 offset = pgdat->node_start_pfn - start;
7638 /* ia64 gets its own node_mem_map, before this, without bootmem */
7639 if (!pgdat->node_mem_map) {
7640 unsigned long size, end;
7644 * The zone's endpoints aren't required to be MAX_ORDER
7645 * aligned but the node_mem_map endpoints must be in order
7646 * for the buddy allocator to function correctly.
7648 end = pgdat_end_pfn(pgdat);
7649 end = ALIGN(end, MAX_ORDER_NR_PAGES);
7650 size = (end - start) * sizeof(struct page);
7651 map = memmap_alloc(size, SMP_CACHE_BYTES, MEMBLOCK_LOW_LIMIT,
7652 pgdat->node_id, false);
7654 panic("Failed to allocate %ld bytes for node %d memory map\n",
7655 size, pgdat->node_id);
7656 pgdat->node_mem_map = map + offset;
7658 pr_debug("%s: node %d, pgdat %08lx, node_mem_map %08lx\n",
7659 __func__, pgdat->node_id, (unsigned long)pgdat,
7660 (unsigned long)pgdat->node_mem_map);
7663 * With no DISCONTIG, the global mem_map is just set as node 0's
7665 if (pgdat == NODE_DATA(0)) {
7666 mem_map = NODE_DATA(0)->node_mem_map;
7667 if (page_to_pfn(mem_map) != pgdat->node_start_pfn)
7673 static inline void alloc_node_mem_map(struct pglist_data *pgdat) { }
7674 #endif /* CONFIG_FLATMEM */
7676 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
7677 static inline void pgdat_set_deferred_range(pg_data_t *pgdat)
7679 pgdat->first_deferred_pfn = ULONG_MAX;
7682 static inline void pgdat_set_deferred_range(pg_data_t *pgdat) {}
7685 static void __init free_area_init_node(int nid)
7687 pg_data_t *pgdat = NODE_DATA(nid);
7688 unsigned long start_pfn = 0;
7689 unsigned long end_pfn = 0;
7691 /* pg_data_t should be reset to zero when it's allocated */
7692 WARN_ON(pgdat->nr_zones || pgdat->kswapd_highest_zoneidx);
7694 get_pfn_range_for_nid(nid, &start_pfn, &end_pfn);
7696 pgdat->node_id = nid;
7697 pgdat->node_start_pfn = start_pfn;
7698 pgdat->per_cpu_nodestats = NULL;
7700 if (start_pfn != end_pfn) {
7701 pr_info("Initmem setup node %d [mem %#018Lx-%#018Lx]\n", nid,
7702 (u64)start_pfn << PAGE_SHIFT,
7703 end_pfn ? ((u64)end_pfn << PAGE_SHIFT) - 1 : 0);
7705 pr_info("Initmem setup node %d as memoryless\n", nid);
7708 calculate_node_totalpages(pgdat, start_pfn, end_pfn);
7710 alloc_node_mem_map(pgdat);
7711 pgdat_set_deferred_range(pgdat);
7713 free_area_init_core(pgdat);
7716 static void __init free_area_init_memoryless_node(int nid)
7718 free_area_init_node(nid);
7721 #if MAX_NUMNODES > 1
7723 * Figure out the number of possible node ids.
7725 void __init setup_nr_node_ids(void)
7727 unsigned int highest;
7729 highest = find_last_bit(node_possible_map.bits, MAX_NUMNODES);
7730 nr_node_ids = highest + 1;
7735 * node_map_pfn_alignment - determine the maximum internode alignment
7737 * This function should be called after node map is populated and sorted.
7738 * It calculates the maximum power of two alignment which can distinguish
7741 * For example, if all nodes are 1GiB and aligned to 1GiB, the return value
7742 * would indicate 1GiB alignment with (1 << (30 - PAGE_SHIFT)). If the
7743 * nodes are shifted by 256MiB, 256MiB. Note that if only the last node is
7744 * shifted, 1GiB is enough and this function will indicate so.
7746 * This is used to test whether pfn -> nid mapping of the chosen memory
7747 * model has fine enough granularity to avoid incorrect mapping for the
7748 * populated node map.
7750 * Return: the determined alignment in pfn's. 0 if there is no alignment
7751 * requirement (single node).
7753 unsigned long __init node_map_pfn_alignment(void)
7755 unsigned long accl_mask = 0, last_end = 0;
7756 unsigned long start, end, mask;
7757 int last_nid = NUMA_NO_NODE;
7760 for_each_mem_pfn_range(i, MAX_NUMNODES, &start, &end, &nid) {
7761 if (!start || last_nid < 0 || last_nid == nid) {
7768 * Start with a mask granular enough to pin-point to the
7769 * start pfn and tick off bits one-by-one until it becomes
7770 * too coarse to separate the current node from the last.
7772 mask = ~((1 << __ffs(start)) - 1);
7773 while (mask && last_end <= (start & (mask << 1)))
7776 /* accumulate all internode masks */
7780 /* convert mask to number of pages */
7781 return ~accl_mask + 1;
7785 * find_min_pfn_with_active_regions - Find the minimum PFN registered
7787 * Return: the minimum PFN based on information provided via
7788 * memblock_set_node().
7790 unsigned long __init find_min_pfn_with_active_regions(void)
7792 return PHYS_PFN(memblock_start_of_DRAM());
7796 * early_calculate_totalpages()
7797 * Sum pages in active regions for movable zone.
7798 * Populate N_MEMORY for calculating usable_nodes.
7800 static unsigned long __init early_calculate_totalpages(void)
7802 unsigned long totalpages = 0;
7803 unsigned long start_pfn, end_pfn;
7806 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid) {
7807 unsigned long pages = end_pfn - start_pfn;
7809 totalpages += pages;
7811 node_set_state(nid, N_MEMORY);
7817 * Find the PFN the Movable zone begins in each node. Kernel memory
7818 * is spread evenly between nodes as long as the nodes have enough
7819 * memory. When they don't, some nodes will have more kernelcore than
7822 static void __init find_zone_movable_pfns_for_nodes(void)
7825 unsigned long usable_startpfn;
7826 unsigned long kernelcore_node, kernelcore_remaining;
7827 /* save the state before borrow the nodemask */
7828 nodemask_t saved_node_state = node_states[N_MEMORY];
7829 unsigned long totalpages = early_calculate_totalpages();
7830 int usable_nodes = nodes_weight(node_states[N_MEMORY]);
7831 struct memblock_region *r;
7833 /* Need to find movable_zone earlier when movable_node is specified. */
7834 find_usable_zone_for_movable();
7837 * If movable_node is specified, ignore kernelcore and movablecore
7840 if (movable_node_is_enabled()) {
7841 for_each_mem_region(r) {
7842 if (!memblock_is_hotpluggable(r))
7845 nid = memblock_get_region_node(r);
7847 usable_startpfn = PFN_DOWN(r->base);
7848 zone_movable_pfn[nid] = zone_movable_pfn[nid] ?
7849 min(usable_startpfn, zone_movable_pfn[nid]) :
7857 * If kernelcore=mirror is specified, ignore movablecore option
7859 if (mirrored_kernelcore) {
7860 bool mem_below_4gb_not_mirrored = false;
7862 for_each_mem_region(r) {
7863 if (memblock_is_mirror(r))
7866 nid = memblock_get_region_node(r);
7868 usable_startpfn = memblock_region_memory_base_pfn(r);
7870 if (usable_startpfn < 0x100000) {
7871 mem_below_4gb_not_mirrored = true;
7875 zone_movable_pfn[nid] = zone_movable_pfn[nid] ?
7876 min(usable_startpfn, zone_movable_pfn[nid]) :
7880 if (mem_below_4gb_not_mirrored)
7881 pr_warn("This configuration results in unmirrored kernel memory.\n");
7887 * If kernelcore=nn% or movablecore=nn% was specified, calculate the
7888 * amount of necessary memory.
7890 if (required_kernelcore_percent)
7891 required_kernelcore = (totalpages * 100 * required_kernelcore_percent) /
7893 if (required_movablecore_percent)
7894 required_movablecore = (totalpages * 100 * required_movablecore_percent) /
7898 * If movablecore= was specified, calculate what size of
7899 * kernelcore that corresponds so that memory usable for
7900 * any allocation type is evenly spread. If both kernelcore
7901 * and movablecore are specified, then the value of kernelcore
7902 * will be used for required_kernelcore if it's greater than
7903 * what movablecore would have allowed.
7905 if (required_movablecore) {
7906 unsigned long corepages;
7909 * Round-up so that ZONE_MOVABLE is at least as large as what
7910 * was requested by the user
7912 required_movablecore =
7913 roundup(required_movablecore, MAX_ORDER_NR_PAGES);
7914 required_movablecore = min(totalpages, required_movablecore);
7915 corepages = totalpages - required_movablecore;
7917 required_kernelcore = max(required_kernelcore, corepages);
7921 * If kernelcore was not specified or kernelcore size is larger
7922 * than totalpages, there is no ZONE_MOVABLE.
7924 if (!required_kernelcore || required_kernelcore >= totalpages)
7927 /* usable_startpfn is the lowest possible pfn ZONE_MOVABLE can be at */
7928 usable_startpfn = arch_zone_lowest_possible_pfn[movable_zone];
7931 /* Spread kernelcore memory as evenly as possible throughout nodes */
7932 kernelcore_node = required_kernelcore / usable_nodes;
7933 for_each_node_state(nid, N_MEMORY) {
7934 unsigned long start_pfn, end_pfn;
7937 * Recalculate kernelcore_node if the division per node
7938 * now exceeds what is necessary to satisfy the requested
7939 * amount of memory for the kernel
7941 if (required_kernelcore < kernelcore_node)
7942 kernelcore_node = required_kernelcore / usable_nodes;
7945 * As the map is walked, we track how much memory is usable
7946 * by the kernel using kernelcore_remaining. When it is
7947 * 0, the rest of the node is usable by ZONE_MOVABLE
7949 kernelcore_remaining = kernelcore_node;
7951 /* Go through each range of PFNs within this node */
7952 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
7953 unsigned long size_pages;
7955 start_pfn = max(start_pfn, zone_movable_pfn[nid]);
7956 if (start_pfn >= end_pfn)
7959 /* Account for what is only usable for kernelcore */
7960 if (start_pfn < usable_startpfn) {
7961 unsigned long kernel_pages;
7962 kernel_pages = min(end_pfn, usable_startpfn)
7965 kernelcore_remaining -= min(kernel_pages,
7966 kernelcore_remaining);
7967 required_kernelcore -= min(kernel_pages,
7968 required_kernelcore);
7970 /* Continue if range is now fully accounted */
7971 if (end_pfn <= usable_startpfn) {
7974 * Push zone_movable_pfn to the end so
7975 * that if we have to rebalance
7976 * kernelcore across nodes, we will
7977 * not double account here
7979 zone_movable_pfn[nid] = end_pfn;
7982 start_pfn = usable_startpfn;
7986 * The usable PFN range for ZONE_MOVABLE is from
7987 * start_pfn->end_pfn. Calculate size_pages as the
7988 * number of pages used as kernelcore
7990 size_pages = end_pfn - start_pfn;
7991 if (size_pages > kernelcore_remaining)
7992 size_pages = kernelcore_remaining;
7993 zone_movable_pfn[nid] = start_pfn + size_pages;
7996 * Some kernelcore has been met, update counts and
7997 * break if the kernelcore for this node has been
8000 required_kernelcore -= min(required_kernelcore,
8002 kernelcore_remaining -= size_pages;
8003 if (!kernelcore_remaining)
8009 * If there is still required_kernelcore, we do another pass with one
8010 * less node in the count. This will push zone_movable_pfn[nid] further
8011 * along on the nodes that still have memory until kernelcore is
8015 if (usable_nodes && required_kernelcore > usable_nodes)
8019 /* Align start of ZONE_MOVABLE on all nids to MAX_ORDER_NR_PAGES */
8020 for (nid = 0; nid < MAX_NUMNODES; nid++) {
8021 unsigned long start_pfn, end_pfn;
8023 zone_movable_pfn[nid] =
8024 roundup(zone_movable_pfn[nid], MAX_ORDER_NR_PAGES);
8026 get_pfn_range_for_nid(nid, &start_pfn, &end_pfn);
8027 if (zone_movable_pfn[nid] >= end_pfn)
8028 zone_movable_pfn[nid] = 0;
8032 /* restore the node_state */
8033 node_states[N_MEMORY] = saved_node_state;
8036 /* Any regular or high memory on that node ? */
8037 static void check_for_memory(pg_data_t *pgdat, int nid)
8039 enum zone_type zone_type;
8041 for (zone_type = 0; zone_type <= ZONE_MOVABLE - 1; zone_type++) {
8042 struct zone *zone = &pgdat->node_zones[zone_type];
8043 if (populated_zone(zone)) {
8044 if (IS_ENABLED(CONFIG_HIGHMEM))
8045 node_set_state(nid, N_HIGH_MEMORY);
8046 if (zone_type <= ZONE_NORMAL)
8047 node_set_state(nid, N_NORMAL_MEMORY);
8054 * Some architectures, e.g. ARC may have ZONE_HIGHMEM below ZONE_NORMAL. For
8055 * such cases we allow max_zone_pfn sorted in the descending order
8057 bool __weak arch_has_descending_max_zone_pfns(void)
8063 * free_area_init - Initialise all pg_data_t and zone data
8064 * @max_zone_pfn: an array of max PFNs for each zone
8066 * This will call free_area_init_node() for each active node in the system.
8067 * Using the page ranges provided by memblock_set_node(), the size of each
8068 * zone in each node and their holes is calculated. If the maximum PFN
8069 * between two adjacent zones match, it is assumed that the zone is empty.
8070 * For example, if arch_max_dma_pfn == arch_max_dma32_pfn, it is assumed
8071 * that arch_max_dma32_pfn has no pages. It is also assumed that a zone
8072 * starts where the previous one ended. For example, ZONE_DMA32 starts
8073 * at arch_max_dma_pfn.
8075 void __init free_area_init(unsigned long *max_zone_pfn)
8077 unsigned long start_pfn, end_pfn;
8081 /* Record where the zone boundaries are */
8082 memset(arch_zone_lowest_possible_pfn, 0,
8083 sizeof(arch_zone_lowest_possible_pfn));
8084 memset(arch_zone_highest_possible_pfn, 0,
8085 sizeof(arch_zone_highest_possible_pfn));
8087 start_pfn = find_min_pfn_with_active_regions();
8088 descending = arch_has_descending_max_zone_pfns();
8090 for (i = 0; i < MAX_NR_ZONES; i++) {
8092 zone = MAX_NR_ZONES - i - 1;
8096 if (zone == ZONE_MOVABLE)
8099 end_pfn = max(max_zone_pfn[zone], start_pfn);
8100 arch_zone_lowest_possible_pfn[zone] = start_pfn;
8101 arch_zone_highest_possible_pfn[zone] = end_pfn;
8103 start_pfn = end_pfn;
8106 /* Find the PFNs that ZONE_MOVABLE begins at in each node */
8107 memset(zone_movable_pfn, 0, sizeof(zone_movable_pfn));
8108 find_zone_movable_pfns_for_nodes();
8110 /* Print out the zone ranges */
8111 pr_info("Zone ranges:\n");
8112 for (i = 0; i < MAX_NR_ZONES; i++) {
8113 if (i == ZONE_MOVABLE)
8115 pr_info(" %-8s ", zone_names[i]);
8116 if (arch_zone_lowest_possible_pfn[i] ==
8117 arch_zone_highest_possible_pfn[i])
8120 pr_cont("[mem %#018Lx-%#018Lx]\n",
8121 (u64)arch_zone_lowest_possible_pfn[i]
8123 ((u64)arch_zone_highest_possible_pfn[i]
8124 << PAGE_SHIFT) - 1);
8127 /* Print out the PFNs ZONE_MOVABLE begins at in each node */
8128 pr_info("Movable zone start for each node\n");
8129 for (i = 0; i < MAX_NUMNODES; i++) {
8130 if (zone_movable_pfn[i])
8131 pr_info(" Node %d: %#018Lx\n", i,
8132 (u64)zone_movable_pfn[i] << PAGE_SHIFT);
8136 * Print out the early node map, and initialize the
8137 * subsection-map relative to active online memory ranges to
8138 * enable future "sub-section" extensions of the memory map.
8140 pr_info("Early memory node ranges\n");
8141 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid) {
8142 pr_info(" node %3d: [mem %#018Lx-%#018Lx]\n", nid,
8143 (u64)start_pfn << PAGE_SHIFT,
8144 ((u64)end_pfn << PAGE_SHIFT) - 1);
8145 subsection_map_init(start_pfn, end_pfn - start_pfn);
8148 /* Initialise every node */
8149 mminit_verify_pageflags_layout();
8150 setup_nr_node_ids();
8151 for_each_node(nid) {
8154 if (!node_online(nid)) {
8155 pr_info("Initializing node %d as memoryless\n", nid);
8157 /* Allocator not initialized yet */
8158 pgdat = arch_alloc_nodedata(nid);
8160 pr_err("Cannot allocate %zuB for node %d.\n",
8161 sizeof(*pgdat), nid);
8164 arch_refresh_nodedata(nid, pgdat);
8165 free_area_init_memoryless_node(nid);
8168 * We do not want to confuse userspace by sysfs
8169 * files/directories for node without any memory
8170 * attached to it, so this node is not marked as
8171 * N_MEMORY and not marked online so that no sysfs
8172 * hierarchy will be created via register_one_node for
8173 * it. The pgdat will get fully initialized by
8174 * hotadd_init_pgdat() when memory is hotplugged into
8180 pgdat = NODE_DATA(nid);
8181 free_area_init_node(nid);
8183 /* Any memory on that node */
8184 if (pgdat->node_present_pages)
8185 node_set_state(nid, N_MEMORY);
8186 check_for_memory(pgdat, nid);
8192 static int __init cmdline_parse_core(char *p, unsigned long *core,
8193 unsigned long *percent)
8195 unsigned long long coremem;
8201 /* Value may be a percentage of total memory, otherwise bytes */
8202 coremem = simple_strtoull(p, &endptr, 0);
8203 if (*endptr == '%') {
8204 /* Paranoid check for percent values greater than 100 */
8205 WARN_ON(coremem > 100);
8209 coremem = memparse(p, &p);
8210 /* Paranoid check that UL is enough for the coremem value */
8211 WARN_ON((coremem >> PAGE_SHIFT) > ULONG_MAX);
8213 *core = coremem >> PAGE_SHIFT;
8220 * kernelcore=size sets the amount of memory for use for allocations that
8221 * cannot be reclaimed or migrated.
8223 static int __init cmdline_parse_kernelcore(char *p)
8225 /* parse kernelcore=mirror */
8226 if (parse_option_str(p, "mirror")) {
8227 mirrored_kernelcore = true;
8231 return cmdline_parse_core(p, &required_kernelcore,
8232 &required_kernelcore_percent);
8236 * movablecore=size sets the amount of memory for use for allocations that
8237 * can be reclaimed or migrated.
8239 static int __init cmdline_parse_movablecore(char *p)
8241 return cmdline_parse_core(p, &required_movablecore,
8242 &required_movablecore_percent);
8245 early_param("kernelcore", cmdline_parse_kernelcore);
8246 early_param("movablecore", cmdline_parse_movablecore);
8248 void adjust_managed_page_count(struct page *page, long count)
8250 atomic_long_add(count, &page_zone(page)->managed_pages);
8251 totalram_pages_add(count);
8252 #ifdef CONFIG_HIGHMEM
8253 if (PageHighMem(page))
8254 totalhigh_pages_add(count);
8257 EXPORT_SYMBOL(adjust_managed_page_count);
8259 unsigned long free_reserved_area(void *start, void *end, int poison, const char *s)
8262 unsigned long pages = 0;
8264 start = (void *)PAGE_ALIGN((unsigned long)start);
8265 end = (void *)((unsigned long)end & PAGE_MASK);
8266 for (pos = start; pos < end; pos += PAGE_SIZE, pages++) {
8267 struct page *page = virt_to_page(pos);
8268 void *direct_map_addr;
8271 * 'direct_map_addr' might be different from 'pos'
8272 * because some architectures' virt_to_page()
8273 * work with aliases. Getting the direct map
8274 * address ensures that we get a _writeable_
8275 * alias for the memset().
8277 direct_map_addr = page_address(page);
8279 * Perform a kasan-unchecked memset() since this memory
8280 * has not been initialized.
8282 direct_map_addr = kasan_reset_tag(direct_map_addr);
8283 if ((unsigned int)poison <= 0xFF)
8284 memset(direct_map_addr, poison, PAGE_SIZE);
8286 free_reserved_page(page);
8290 pr_info("Freeing %s memory: %ldK\n", s, K(pages));
8295 void __init mem_init_print_info(void)
8297 unsigned long physpages, codesize, datasize, rosize, bss_size;
8298 unsigned long init_code_size, init_data_size;
8300 physpages = get_num_physpages();
8301 codesize = _etext - _stext;
8302 datasize = _edata - _sdata;
8303 rosize = __end_rodata - __start_rodata;
8304 bss_size = __bss_stop - __bss_start;
8305 init_data_size = __init_end - __init_begin;
8306 init_code_size = _einittext - _sinittext;
8309 * Detect special cases and adjust section sizes accordingly:
8310 * 1) .init.* may be embedded into .data sections
8311 * 2) .init.text.* may be out of [__init_begin, __init_end],
8312 * please refer to arch/tile/kernel/vmlinux.lds.S.
8313 * 3) .rodata.* may be embedded into .text or .data sections.
8315 #define adj_init_size(start, end, size, pos, adj) \
8317 if (&start[0] <= &pos[0] && &pos[0] < &end[0] && size > adj) \
8321 adj_init_size(__init_begin, __init_end, init_data_size,
8322 _sinittext, init_code_size);
8323 adj_init_size(_stext, _etext, codesize, _sinittext, init_code_size);
8324 adj_init_size(_sdata, _edata, datasize, __init_begin, init_data_size);
8325 adj_init_size(_stext, _etext, codesize, __start_rodata, rosize);
8326 adj_init_size(_sdata, _edata, datasize, __start_rodata, rosize);
8328 #undef adj_init_size
8330 pr_info("Memory: %luK/%luK available (%luK kernel code, %luK rwdata, %luK rodata, %luK init, %luK bss, %luK reserved, %luK cma-reserved"
8331 #ifdef CONFIG_HIGHMEM
8335 K(nr_free_pages()), K(physpages),
8336 codesize >> 10, datasize >> 10, rosize >> 10,
8337 (init_data_size + init_code_size) >> 10, bss_size >> 10,
8338 K(physpages - totalram_pages() - totalcma_pages),
8340 #ifdef CONFIG_HIGHMEM
8341 , K(totalhigh_pages())
8347 * set_dma_reserve - set the specified number of pages reserved in the first zone
8348 * @new_dma_reserve: The number of pages to mark reserved
8350 * The per-cpu batchsize and zone watermarks are determined by managed_pages.
8351 * In the DMA zone, a significant percentage may be consumed by kernel image
8352 * and other unfreeable allocations which can skew the watermarks badly. This
8353 * function may optionally be used to account for unfreeable pages in the
8354 * first zone (e.g., ZONE_DMA). The effect will be lower watermarks and
8355 * smaller per-cpu batchsize.
8357 void __init set_dma_reserve(unsigned long new_dma_reserve)
8359 dma_reserve = new_dma_reserve;
8362 static int page_alloc_cpu_dead(unsigned int cpu)
8366 lru_add_drain_cpu(cpu);
8370 * Spill the event counters of the dead processor
8371 * into the current processors event counters.
8372 * This artificially elevates the count of the current
8375 vm_events_fold_cpu(cpu);
8378 * Zero the differential counters of the dead processor
8379 * so that the vm statistics are consistent.
8381 * This is only okay since the processor is dead and cannot
8382 * race with what we are doing.
8384 cpu_vm_stats_fold(cpu);
8386 for_each_populated_zone(zone)
8387 zone_pcp_update(zone, 0);
8392 static int page_alloc_cpu_online(unsigned int cpu)
8396 for_each_populated_zone(zone)
8397 zone_pcp_update(zone, 1);
8402 int hashdist = HASHDIST_DEFAULT;
8404 static int __init set_hashdist(char *str)
8408 hashdist = simple_strtoul(str, &str, 0);
8411 __setup("hashdist=", set_hashdist);
8414 void __init page_alloc_init(void)
8419 if (num_node_state(N_MEMORY) == 1)
8423 ret = cpuhp_setup_state_nocalls(CPUHP_PAGE_ALLOC,
8424 "mm/page_alloc:pcp",
8425 page_alloc_cpu_online,
8426 page_alloc_cpu_dead);
8431 * calculate_totalreserve_pages - called when sysctl_lowmem_reserve_ratio
8432 * or min_free_kbytes changes.
8434 static void calculate_totalreserve_pages(void)
8436 struct pglist_data *pgdat;
8437 unsigned long reserve_pages = 0;
8438 enum zone_type i, j;
8440 for_each_online_pgdat(pgdat) {
8442 pgdat->totalreserve_pages = 0;
8444 for (i = 0; i < MAX_NR_ZONES; i++) {
8445 struct zone *zone = pgdat->node_zones + i;
8447 unsigned long managed_pages = zone_managed_pages(zone);
8449 /* Find valid and maximum lowmem_reserve in the zone */
8450 for (j = i; j < MAX_NR_ZONES; j++) {
8451 if (zone->lowmem_reserve[j] > max)
8452 max = zone->lowmem_reserve[j];
8455 /* we treat the high watermark as reserved pages. */
8456 max += high_wmark_pages(zone);
8458 if (max > managed_pages)
8459 max = managed_pages;
8461 pgdat->totalreserve_pages += max;
8463 reserve_pages += max;
8466 totalreserve_pages = reserve_pages;
8470 * setup_per_zone_lowmem_reserve - called whenever
8471 * sysctl_lowmem_reserve_ratio changes. Ensures that each zone
8472 * has a correct pages reserved value, so an adequate number of
8473 * pages are left in the zone after a successful __alloc_pages().
8475 static void setup_per_zone_lowmem_reserve(void)
8477 struct pglist_data *pgdat;
8478 enum zone_type i, j;
8480 for_each_online_pgdat(pgdat) {
8481 for (i = 0; i < MAX_NR_ZONES - 1; i++) {
8482 struct zone *zone = &pgdat->node_zones[i];
8483 int ratio = sysctl_lowmem_reserve_ratio[i];
8484 bool clear = !ratio || !zone_managed_pages(zone);
8485 unsigned long managed_pages = 0;
8487 for (j = i + 1; j < MAX_NR_ZONES; j++) {
8488 struct zone *upper_zone = &pgdat->node_zones[j];
8490 managed_pages += zone_managed_pages(upper_zone);
8493 zone->lowmem_reserve[j] = 0;
8495 zone->lowmem_reserve[j] = managed_pages / ratio;
8500 /* update totalreserve_pages */
8501 calculate_totalreserve_pages();
8504 static void __setup_per_zone_wmarks(void)
8506 unsigned long pages_min = min_free_kbytes >> (PAGE_SHIFT - 10);
8507 unsigned long lowmem_pages = 0;
8509 unsigned long flags;
8511 /* Calculate total number of !ZONE_HIGHMEM pages */
8512 for_each_zone(zone) {
8513 if (!is_highmem(zone))
8514 lowmem_pages += zone_managed_pages(zone);
8517 for_each_zone(zone) {
8520 spin_lock_irqsave(&zone->lock, flags);
8521 tmp = (u64)pages_min * zone_managed_pages(zone);
8522 do_div(tmp, lowmem_pages);
8523 if (is_highmem(zone)) {
8525 * __GFP_HIGH and PF_MEMALLOC allocations usually don't
8526 * need highmem pages, so cap pages_min to a small
8529 * The WMARK_HIGH-WMARK_LOW and (WMARK_LOW-WMARK_MIN)
8530 * deltas control async page reclaim, and so should
8531 * not be capped for highmem.
8533 unsigned long min_pages;
8535 min_pages = zone_managed_pages(zone) / 1024;
8536 min_pages = clamp(min_pages, SWAP_CLUSTER_MAX, 128UL);
8537 zone->_watermark[WMARK_MIN] = min_pages;
8540 * If it's a lowmem zone, reserve a number of pages
8541 * proportionate to the zone's size.
8543 zone->_watermark[WMARK_MIN] = tmp;
8547 * Set the kswapd watermarks distance according to the
8548 * scale factor in proportion to available memory, but
8549 * ensure a minimum size on small systems.
8551 tmp = max_t(u64, tmp >> 2,
8552 mult_frac(zone_managed_pages(zone),
8553 watermark_scale_factor, 10000));
8555 zone->watermark_boost = 0;
8556 zone->_watermark[WMARK_LOW] = min_wmark_pages(zone) + tmp;
8557 zone->_watermark[WMARK_HIGH] = low_wmark_pages(zone) + tmp;
8558 zone->_watermark[WMARK_PROMO] = high_wmark_pages(zone) + tmp;
8560 spin_unlock_irqrestore(&zone->lock, flags);
8563 /* update totalreserve_pages */
8564 calculate_totalreserve_pages();
8568 * setup_per_zone_wmarks - called when min_free_kbytes changes
8569 * or when memory is hot-{added|removed}
8571 * Ensures that the watermark[min,low,high] values for each zone are set
8572 * correctly with respect to min_free_kbytes.
8574 void setup_per_zone_wmarks(void)
8577 static DEFINE_SPINLOCK(lock);
8580 __setup_per_zone_wmarks();
8584 * The watermark size have changed so update the pcpu batch
8585 * and high limits or the limits may be inappropriate.
8588 zone_pcp_update(zone, 0);
8592 * Initialise min_free_kbytes.
8594 * For small machines we want it small (128k min). For large machines
8595 * we want it large (256MB max). But it is not linear, because network
8596 * bandwidth does not increase linearly with machine size. We use
8598 * min_free_kbytes = 4 * sqrt(lowmem_kbytes), for better accuracy:
8599 * min_free_kbytes = sqrt(lowmem_kbytes * 16)
8615 void calculate_min_free_kbytes(void)
8617 unsigned long lowmem_kbytes;
8618 int new_min_free_kbytes;
8620 lowmem_kbytes = nr_free_buffer_pages() * (PAGE_SIZE >> 10);
8621 new_min_free_kbytes = int_sqrt(lowmem_kbytes * 16);
8623 if (new_min_free_kbytes > user_min_free_kbytes)
8624 min_free_kbytes = clamp(new_min_free_kbytes, 128, 262144);
8626 pr_warn("min_free_kbytes is not updated to %d because user defined value %d is preferred\n",
8627 new_min_free_kbytes, user_min_free_kbytes);
8631 int __meminit init_per_zone_wmark_min(void)
8633 calculate_min_free_kbytes();
8634 setup_per_zone_wmarks();
8635 refresh_zone_stat_thresholds();
8636 setup_per_zone_lowmem_reserve();
8639 setup_min_unmapped_ratio();
8640 setup_min_slab_ratio();
8643 khugepaged_min_free_kbytes_update();
8647 postcore_initcall(init_per_zone_wmark_min)
8650 * min_free_kbytes_sysctl_handler - just a wrapper around proc_dointvec() so
8651 * that we can call two helper functions whenever min_free_kbytes
8654 int min_free_kbytes_sysctl_handler(struct ctl_table *table, int write,
8655 void *buffer, size_t *length, loff_t *ppos)
8659 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
8664 user_min_free_kbytes = min_free_kbytes;
8665 setup_per_zone_wmarks();
8670 int watermark_scale_factor_sysctl_handler(struct ctl_table *table, int write,
8671 void *buffer, size_t *length, loff_t *ppos)
8675 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
8680 setup_per_zone_wmarks();
8686 static void setup_min_unmapped_ratio(void)
8691 for_each_online_pgdat(pgdat)
8692 pgdat->min_unmapped_pages = 0;
8695 zone->zone_pgdat->min_unmapped_pages += (zone_managed_pages(zone) *
8696 sysctl_min_unmapped_ratio) / 100;
8700 int sysctl_min_unmapped_ratio_sysctl_handler(struct ctl_table *table, int write,
8701 void *buffer, size_t *length, loff_t *ppos)
8705 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
8709 setup_min_unmapped_ratio();
8714 static void setup_min_slab_ratio(void)
8719 for_each_online_pgdat(pgdat)
8720 pgdat->min_slab_pages = 0;
8723 zone->zone_pgdat->min_slab_pages += (zone_managed_pages(zone) *
8724 sysctl_min_slab_ratio) / 100;
8727 int sysctl_min_slab_ratio_sysctl_handler(struct ctl_table *table, int write,
8728 void *buffer, size_t *length, loff_t *ppos)
8732 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
8736 setup_min_slab_ratio();
8743 * lowmem_reserve_ratio_sysctl_handler - just a wrapper around
8744 * proc_dointvec() so that we can call setup_per_zone_lowmem_reserve()
8745 * whenever sysctl_lowmem_reserve_ratio changes.
8747 * The reserve ratio obviously has absolutely no relation with the
8748 * minimum watermarks. The lowmem reserve ratio can only make sense
8749 * if in function of the boot time zone sizes.
8751 int lowmem_reserve_ratio_sysctl_handler(struct ctl_table *table, int write,
8752 void *buffer, size_t *length, loff_t *ppos)
8756 proc_dointvec_minmax(table, write, buffer, length, ppos);
8758 for (i = 0; i < MAX_NR_ZONES; i++) {
8759 if (sysctl_lowmem_reserve_ratio[i] < 1)
8760 sysctl_lowmem_reserve_ratio[i] = 0;
8763 setup_per_zone_lowmem_reserve();
8768 * percpu_pagelist_high_fraction - changes the pcp->high for each zone on each
8769 * cpu. It is the fraction of total pages in each zone that a hot per cpu
8770 * pagelist can have before it gets flushed back to buddy allocator.
8772 int percpu_pagelist_high_fraction_sysctl_handler(struct ctl_table *table,
8773 int write, void *buffer, size_t *length, loff_t *ppos)
8776 int old_percpu_pagelist_high_fraction;
8779 mutex_lock(&pcp_batch_high_lock);
8780 old_percpu_pagelist_high_fraction = percpu_pagelist_high_fraction;
8782 ret = proc_dointvec_minmax(table, write, buffer, length, ppos);
8783 if (!write || ret < 0)
8786 /* Sanity checking to avoid pcp imbalance */
8787 if (percpu_pagelist_high_fraction &&
8788 percpu_pagelist_high_fraction < MIN_PERCPU_PAGELIST_HIGH_FRACTION) {
8789 percpu_pagelist_high_fraction = old_percpu_pagelist_high_fraction;
8795 if (percpu_pagelist_high_fraction == old_percpu_pagelist_high_fraction)
8798 for_each_populated_zone(zone)
8799 zone_set_pageset_high_and_batch(zone, 0);
8801 mutex_unlock(&pcp_batch_high_lock);
8805 #ifndef __HAVE_ARCH_RESERVED_KERNEL_PAGES
8807 * Returns the number of pages that arch has reserved but
8808 * is not known to alloc_large_system_hash().
8810 static unsigned long __init arch_reserved_kernel_pages(void)
8817 * Adaptive scale is meant to reduce sizes of hash tables on large memory
8818 * machines. As memory size is increased the scale is also increased but at
8819 * slower pace. Starting from ADAPT_SCALE_BASE (64G), every time memory
8820 * quadruples the scale is increased by one, which means the size of hash table
8821 * only doubles, instead of quadrupling as well.
8822 * Because 32-bit systems cannot have large physical memory, where this scaling
8823 * makes sense, it is disabled on such platforms.
8825 #if __BITS_PER_LONG > 32
8826 #define ADAPT_SCALE_BASE (64ul << 30)
8827 #define ADAPT_SCALE_SHIFT 2
8828 #define ADAPT_SCALE_NPAGES (ADAPT_SCALE_BASE >> PAGE_SHIFT)
8832 * allocate a large system hash table from bootmem
8833 * - it is assumed that the hash table must contain an exact power-of-2
8834 * quantity of entries
8835 * - limit is the number of hash buckets, not the total allocation size
8837 void *__init alloc_large_system_hash(const char *tablename,
8838 unsigned long bucketsize,
8839 unsigned long numentries,
8842 unsigned int *_hash_shift,
8843 unsigned int *_hash_mask,
8844 unsigned long low_limit,
8845 unsigned long high_limit)
8847 unsigned long long max = high_limit;
8848 unsigned long log2qty, size;
8854 /* allow the kernel cmdline to have a say */
8856 /* round applicable memory size up to nearest megabyte */
8857 numentries = nr_kernel_pages;
8858 numentries -= arch_reserved_kernel_pages();
8860 /* It isn't necessary when PAGE_SIZE >= 1MB */
8861 if (PAGE_SHIFT < 20)
8862 numentries = round_up(numentries, (1<<20)/PAGE_SIZE);
8864 #if __BITS_PER_LONG > 32
8866 unsigned long adapt;
8868 for (adapt = ADAPT_SCALE_NPAGES; adapt < numentries;
8869 adapt <<= ADAPT_SCALE_SHIFT)
8874 /* limit to 1 bucket per 2^scale bytes of low memory */
8875 if (scale > PAGE_SHIFT)
8876 numentries >>= (scale - PAGE_SHIFT);
8878 numentries <<= (PAGE_SHIFT - scale);
8880 /* Make sure we've got at least a 0-order allocation.. */
8881 if (unlikely(flags & HASH_SMALL)) {
8882 /* Makes no sense without HASH_EARLY */
8883 WARN_ON(!(flags & HASH_EARLY));
8884 if (!(numentries >> *_hash_shift)) {
8885 numentries = 1UL << *_hash_shift;
8886 BUG_ON(!numentries);
8888 } else if (unlikely((numentries * bucketsize) < PAGE_SIZE))
8889 numentries = PAGE_SIZE / bucketsize;
8891 numentries = roundup_pow_of_two(numentries);
8893 /* limit allocation size to 1/16 total memory by default */
8895 max = ((unsigned long long)nr_all_pages << PAGE_SHIFT) >> 4;
8896 do_div(max, bucketsize);
8898 max = min(max, 0x80000000ULL);
8900 if (numentries < low_limit)
8901 numentries = low_limit;
8902 if (numentries > max)
8905 log2qty = ilog2(numentries);
8907 gfp_flags = (flags & HASH_ZERO) ? GFP_ATOMIC | __GFP_ZERO : GFP_ATOMIC;
8910 size = bucketsize << log2qty;
8911 if (flags & HASH_EARLY) {
8912 if (flags & HASH_ZERO)
8913 table = memblock_alloc(size, SMP_CACHE_BYTES);
8915 table = memblock_alloc_raw(size,
8917 } else if (get_order(size) >= MAX_ORDER || hashdist) {
8918 table = __vmalloc(size, gfp_flags);
8921 huge = is_vm_area_hugepages(table);
8924 * If bucketsize is not a power-of-two, we may free
8925 * some pages at the end of hash table which
8926 * alloc_pages_exact() automatically does
8928 table = alloc_pages_exact(size, gfp_flags);
8929 kmemleak_alloc(table, size, 1, gfp_flags);
8931 } while (!table && size > PAGE_SIZE && --log2qty);
8934 panic("Failed to allocate %s hash table\n", tablename);
8936 pr_info("%s hash table entries: %ld (order: %d, %lu bytes, %s)\n",
8937 tablename, 1UL << log2qty, ilog2(size) - PAGE_SHIFT, size,
8938 virt ? (huge ? "vmalloc hugepage" : "vmalloc") : "linear");
8941 *_hash_shift = log2qty;
8943 *_hash_mask = (1 << log2qty) - 1;
8949 * This function checks whether pageblock includes unmovable pages or not.
8951 * PageLRU check without isolation or lru_lock could race so that
8952 * MIGRATE_MOVABLE block might include unmovable pages. And __PageMovable
8953 * check without lock_page also may miss some movable non-lru pages at
8954 * race condition. So you can't expect this function should be exact.
8956 * Returns a page without holding a reference. If the caller wants to
8957 * dereference that page (e.g., dumping), it has to make sure that it
8958 * cannot get removed (e.g., via memory unplug) concurrently.
8961 struct page *has_unmovable_pages(struct zone *zone, struct page *page,
8962 int migratetype, int flags)
8964 unsigned long iter = 0;
8965 unsigned long pfn = page_to_pfn(page);
8966 unsigned long offset = pfn % pageblock_nr_pages;
8968 if (is_migrate_cma_page(page)) {
8970 * CMA allocations (alloc_contig_range) really need to mark
8971 * isolate CMA pageblocks even when they are not movable in fact
8972 * so consider them movable here.
8974 if (is_migrate_cma(migratetype))
8980 for (; iter < pageblock_nr_pages - offset; iter++) {
8981 page = pfn_to_page(pfn + iter);
8984 * Both, bootmem allocations and memory holes are marked
8985 * PG_reserved and are unmovable. We can even have unmovable
8986 * allocations inside ZONE_MOVABLE, for example when
8987 * specifying "movablecore".
8989 if (PageReserved(page))
8993 * If the zone is movable and we have ruled out all reserved
8994 * pages then it should be reasonably safe to assume the rest
8997 if (zone_idx(zone) == ZONE_MOVABLE)
9001 * Hugepages are not in LRU lists, but they're movable.
9002 * THPs are on the LRU, but need to be counted as #small pages.
9003 * We need not scan over tail pages because we don't
9004 * handle each tail page individually in migration.
9006 if (PageHuge(page) || PageTransCompound(page)) {
9007 struct page *head = compound_head(page);
9008 unsigned int skip_pages;
9010 if (PageHuge(page)) {
9011 if (!hugepage_migration_supported(page_hstate(head)))
9013 } else if (!PageLRU(head) && !__PageMovable(head)) {
9017 skip_pages = compound_nr(head) - (page - head);
9018 iter += skip_pages - 1;
9023 * We can't use page_count without pin a page
9024 * because another CPU can free compound page.
9025 * This check already skips compound tails of THP
9026 * because their page->_refcount is zero at all time.
9028 if (!page_ref_count(page)) {
9029 if (PageBuddy(page))
9030 iter += (1 << buddy_order(page)) - 1;
9035 * The HWPoisoned page may be not in buddy system, and
9036 * page_count() is not 0.
9038 if ((flags & MEMORY_OFFLINE) && PageHWPoison(page))
9042 * We treat all PageOffline() pages as movable when offlining
9043 * to give drivers a chance to decrement their reference count
9044 * in MEM_GOING_OFFLINE in order to indicate that these pages
9045 * can be offlined as there are no direct references anymore.
9046 * For actually unmovable PageOffline() where the driver does
9047 * not support this, we will fail later when trying to actually
9048 * move these pages that still have a reference count > 0.
9049 * (false negatives in this function only)
9051 if ((flags & MEMORY_OFFLINE) && PageOffline(page))
9054 if (__PageMovable(page) || PageLRU(page))
9058 * If there are RECLAIMABLE pages, we need to check
9059 * it. But now, memory offline itself doesn't call
9060 * shrink_node_slabs() and it still to be fixed.
9067 #ifdef CONFIG_CONTIG_ALLOC
9068 static unsigned long pfn_max_align_down(unsigned long pfn)
9070 return ALIGN_DOWN(pfn, MAX_ORDER_NR_PAGES);
9073 static unsigned long pfn_max_align_up(unsigned long pfn)
9075 return ALIGN(pfn, MAX_ORDER_NR_PAGES);
9078 #if defined(CONFIG_DYNAMIC_DEBUG) || \
9079 (defined(CONFIG_DYNAMIC_DEBUG_CORE) && defined(DYNAMIC_DEBUG_MODULE))
9080 /* Usage: See admin-guide/dynamic-debug-howto.rst */
9081 static void alloc_contig_dump_pages(struct list_head *page_list)
9083 DEFINE_DYNAMIC_DEBUG_METADATA(descriptor, "migrate failure");
9085 if (DYNAMIC_DEBUG_BRANCH(descriptor)) {
9089 list_for_each_entry(page, page_list, lru)
9090 dump_page(page, "migration failure");
9094 static inline void alloc_contig_dump_pages(struct list_head *page_list)
9099 /* [start, end) must belong to a single zone. */
9100 static int __alloc_contig_migrate_range(struct compact_control *cc,
9101 unsigned long start, unsigned long end)
9103 /* This function is based on compact_zone() from compaction.c. */
9104 unsigned int nr_reclaimed;
9105 unsigned long pfn = start;
9106 unsigned int tries = 0;
9108 struct migration_target_control mtc = {
9109 .nid = zone_to_nid(cc->zone),
9110 .gfp_mask = GFP_USER | __GFP_MOVABLE | __GFP_RETRY_MAYFAIL,
9113 lru_cache_disable();
9115 while (pfn < end || !list_empty(&cc->migratepages)) {
9116 if (fatal_signal_pending(current)) {
9121 if (list_empty(&cc->migratepages)) {
9122 cc->nr_migratepages = 0;
9123 ret = isolate_migratepages_range(cc, pfn, end);
9124 if (ret && ret != -EAGAIN)
9126 pfn = cc->migrate_pfn;
9128 } else if (++tries == 5) {
9133 nr_reclaimed = reclaim_clean_pages_from_list(cc->zone,
9135 cc->nr_migratepages -= nr_reclaimed;
9137 ret = migrate_pages(&cc->migratepages, alloc_migration_target,
9138 NULL, (unsigned long)&mtc, cc->mode, MR_CONTIG_RANGE, NULL);
9141 * On -ENOMEM, migrate_pages() bails out right away. It is pointless
9142 * to retry again over this error, so do the same here.
9151 alloc_contig_dump_pages(&cc->migratepages);
9152 putback_movable_pages(&cc->migratepages);
9159 * alloc_contig_range() -- tries to allocate given range of pages
9160 * @start: start PFN to allocate
9161 * @end: one-past-the-last PFN to allocate
9162 * @migratetype: migratetype of the underlying pageblocks (either
9163 * #MIGRATE_MOVABLE or #MIGRATE_CMA). All pageblocks
9164 * in range must have the same migratetype and it must
9165 * be either of the two.
9166 * @gfp_mask: GFP mask to use during compaction
9168 * The PFN range does not have to be pageblock or MAX_ORDER_NR_PAGES
9169 * aligned. The PFN range must belong to a single zone.
9171 * The first thing this routine does is attempt to MIGRATE_ISOLATE all
9172 * pageblocks in the range. Once isolated, the pageblocks should not
9173 * be modified by others.
9175 * Return: zero on success or negative error code. On success all
9176 * pages which PFN is in [start, end) are allocated for the caller and
9177 * need to be freed with free_contig_range().
9179 int alloc_contig_range(unsigned long start, unsigned long end,
9180 unsigned migratetype, gfp_t gfp_mask)
9182 unsigned long outer_start, outer_end;
9186 struct compact_control cc = {
9187 .nr_migratepages = 0,
9189 .zone = page_zone(pfn_to_page(start)),
9190 .mode = MIGRATE_SYNC,
9191 .ignore_skip_hint = true,
9192 .no_set_skip_hint = true,
9193 .gfp_mask = current_gfp_context(gfp_mask),
9194 .alloc_contig = true,
9196 INIT_LIST_HEAD(&cc.migratepages);
9199 * What we do here is we mark all pageblocks in range as
9200 * MIGRATE_ISOLATE. Because pageblock and max order pages may
9201 * have different sizes, and due to the way page allocator
9202 * work, we align the range to biggest of the two pages so
9203 * that page allocator won't try to merge buddies from
9204 * different pageblocks and change MIGRATE_ISOLATE to some
9205 * other migration type.
9207 * Once the pageblocks are marked as MIGRATE_ISOLATE, we
9208 * migrate the pages from an unaligned range (ie. pages that
9209 * we are interested in). This will put all the pages in
9210 * range back to page allocator as MIGRATE_ISOLATE.
9212 * When this is done, we take the pages in range from page
9213 * allocator removing them from the buddy system. This way
9214 * page allocator will never consider using them.
9216 * This lets us mark the pageblocks back as
9217 * MIGRATE_CMA/MIGRATE_MOVABLE so that free pages in the
9218 * aligned range but not in the unaligned, original range are
9219 * put back to page allocator so that buddy can use them.
9222 ret = start_isolate_page_range(pfn_max_align_down(start),
9223 pfn_max_align_up(end), migratetype, 0);
9227 drain_all_pages(cc.zone);
9230 * In case of -EBUSY, we'd like to know which page causes problem.
9231 * So, just fall through. test_pages_isolated() has a tracepoint
9232 * which will report the busy page.
9234 * It is possible that busy pages could become available before
9235 * the call to test_pages_isolated, and the range will actually be
9236 * allocated. So, if we fall through be sure to clear ret so that
9237 * -EBUSY is not accidentally used or returned to caller.
9239 ret = __alloc_contig_migrate_range(&cc, start, end);
9240 if (ret && ret != -EBUSY)
9245 * Pages from [start, end) are within a MAX_ORDER_NR_PAGES
9246 * aligned blocks that are marked as MIGRATE_ISOLATE. What's
9247 * more, all pages in [start, end) are free in page allocator.
9248 * What we are going to do is to allocate all pages from
9249 * [start, end) (that is remove them from page allocator).
9251 * The only problem is that pages at the beginning and at the
9252 * end of interesting range may be not aligned with pages that
9253 * page allocator holds, ie. they can be part of higher order
9254 * pages. Because of this, we reserve the bigger range and
9255 * once this is done free the pages we are not interested in.
9257 * We don't have to hold zone->lock here because the pages are
9258 * isolated thus they won't get removed from buddy.
9262 outer_start = start;
9263 while (!PageBuddy(pfn_to_page(outer_start))) {
9264 if (++order >= MAX_ORDER) {
9265 outer_start = start;
9268 outer_start &= ~0UL << order;
9271 if (outer_start != start) {
9272 order = buddy_order(pfn_to_page(outer_start));
9275 * outer_start page could be small order buddy page and
9276 * it doesn't include start page. Adjust outer_start
9277 * in this case to report failed page properly
9278 * on tracepoint in test_pages_isolated()
9280 if (outer_start + (1UL << order) <= start)
9281 outer_start = start;
9284 /* Make sure the range is really isolated. */
9285 if (test_pages_isolated(outer_start, end, 0)) {
9290 /* Grab isolated pages from freelists. */
9291 outer_end = isolate_freepages_range(&cc, outer_start, end);
9297 /* Free head and tail (if any) */
9298 if (start != outer_start)
9299 free_contig_range(outer_start, start - outer_start);
9300 if (end != outer_end)
9301 free_contig_range(end, outer_end - end);
9304 undo_isolate_page_range(pfn_max_align_down(start),
9305 pfn_max_align_up(end), migratetype);
9308 EXPORT_SYMBOL(alloc_contig_range);
9310 static int __alloc_contig_pages(unsigned long start_pfn,
9311 unsigned long nr_pages, gfp_t gfp_mask)
9313 unsigned long end_pfn = start_pfn + nr_pages;
9315 return alloc_contig_range(start_pfn, end_pfn, MIGRATE_MOVABLE,
9319 static bool pfn_range_valid_contig(struct zone *z, unsigned long start_pfn,
9320 unsigned long nr_pages)
9322 unsigned long i, end_pfn = start_pfn + nr_pages;
9325 for (i = start_pfn; i < end_pfn; i++) {
9326 page = pfn_to_online_page(i);
9330 if (page_zone(page) != z)
9333 if (PageReserved(page))
9339 static bool zone_spans_last_pfn(const struct zone *zone,
9340 unsigned long start_pfn, unsigned long nr_pages)
9342 unsigned long last_pfn = start_pfn + nr_pages - 1;
9344 return zone_spans_pfn(zone, last_pfn);
9348 * alloc_contig_pages() -- tries to find and allocate contiguous range of pages
9349 * @nr_pages: Number of contiguous pages to allocate
9350 * @gfp_mask: GFP mask to limit search and used during compaction
9352 * @nodemask: Mask for other possible nodes
9354 * This routine is a wrapper around alloc_contig_range(). It scans over zones
9355 * on an applicable zonelist to find a contiguous pfn range which can then be
9356 * tried for allocation with alloc_contig_range(). This routine is intended
9357 * for allocation requests which can not be fulfilled with the buddy allocator.
9359 * The allocated memory is always aligned to a page boundary. If nr_pages is a
9360 * power of two, then allocated range is also guaranteed to be aligned to same
9361 * nr_pages (e.g. 1GB request would be aligned to 1GB).
9363 * Allocated pages can be freed with free_contig_range() or by manually calling
9364 * __free_page() on each allocated page.
9366 * Return: pointer to contiguous pages on success, or NULL if not successful.
9368 struct page *alloc_contig_pages(unsigned long nr_pages, gfp_t gfp_mask,
9369 int nid, nodemask_t *nodemask)
9371 unsigned long ret, pfn, flags;
9372 struct zonelist *zonelist;
9376 zonelist = node_zonelist(nid, gfp_mask);
9377 for_each_zone_zonelist_nodemask(zone, z, zonelist,
9378 gfp_zone(gfp_mask), nodemask) {
9379 spin_lock_irqsave(&zone->lock, flags);
9381 pfn = ALIGN(zone->zone_start_pfn, nr_pages);
9382 while (zone_spans_last_pfn(zone, pfn, nr_pages)) {
9383 if (pfn_range_valid_contig(zone, pfn, nr_pages)) {
9385 * We release the zone lock here because
9386 * alloc_contig_range() will also lock the zone
9387 * at some point. If there's an allocation
9388 * spinning on this lock, it may win the race
9389 * and cause alloc_contig_range() to fail...
9391 spin_unlock_irqrestore(&zone->lock, flags);
9392 ret = __alloc_contig_pages(pfn, nr_pages,
9395 return pfn_to_page(pfn);
9396 spin_lock_irqsave(&zone->lock, flags);
9400 spin_unlock_irqrestore(&zone->lock, flags);
9404 #endif /* CONFIG_CONTIG_ALLOC */
9406 void free_contig_range(unsigned long pfn, unsigned long nr_pages)
9408 unsigned long count = 0;
9410 for (; nr_pages--; pfn++) {
9411 struct page *page = pfn_to_page(pfn);
9413 count += page_count(page) != 1;
9416 WARN(count != 0, "%lu pages are still in use!\n", count);
9418 EXPORT_SYMBOL(free_contig_range);
9421 * The zone indicated has a new number of managed_pages; batch sizes and percpu
9422 * page high values need to be recalculated.
9424 void zone_pcp_update(struct zone *zone, int cpu_online)
9426 mutex_lock(&pcp_batch_high_lock);
9427 zone_set_pageset_high_and_batch(zone, cpu_online);
9428 mutex_unlock(&pcp_batch_high_lock);
9432 * Effectively disable pcplists for the zone by setting the high limit to 0
9433 * and draining all cpus. A concurrent page freeing on another CPU that's about
9434 * to put the page on pcplist will either finish before the drain and the page
9435 * will be drained, or observe the new high limit and skip the pcplist.
9437 * Must be paired with a call to zone_pcp_enable().
9439 void zone_pcp_disable(struct zone *zone)
9441 mutex_lock(&pcp_batch_high_lock);
9442 __zone_set_pageset_high_and_batch(zone, 0, 1);
9443 __drain_all_pages(zone, true);
9446 void zone_pcp_enable(struct zone *zone)
9448 __zone_set_pageset_high_and_batch(zone, zone->pageset_high, zone->pageset_batch);
9449 mutex_unlock(&pcp_batch_high_lock);
9452 void zone_pcp_reset(struct zone *zone)
9455 struct per_cpu_zonestat *pzstats;
9457 if (zone->per_cpu_pageset != &boot_pageset) {
9458 for_each_online_cpu(cpu) {
9459 pzstats = per_cpu_ptr(zone->per_cpu_zonestats, cpu);
9460 drain_zonestat(zone, pzstats);
9462 free_percpu(zone->per_cpu_pageset);
9463 free_percpu(zone->per_cpu_zonestats);
9464 zone->per_cpu_pageset = &boot_pageset;
9465 zone->per_cpu_zonestats = &boot_zonestats;
9469 #ifdef CONFIG_MEMORY_HOTREMOVE
9471 * All pages in the range must be in a single zone, must not contain holes,
9472 * must span full sections, and must be isolated before calling this function.
9474 void __offline_isolated_pages(unsigned long start_pfn, unsigned long end_pfn)
9476 unsigned long pfn = start_pfn;
9480 unsigned long flags;
9482 offline_mem_sections(pfn, end_pfn);
9483 zone = page_zone(pfn_to_page(pfn));
9484 spin_lock_irqsave(&zone->lock, flags);
9485 while (pfn < end_pfn) {
9486 page = pfn_to_page(pfn);
9488 * The HWPoisoned page may be not in buddy system, and
9489 * page_count() is not 0.
9491 if (unlikely(!PageBuddy(page) && PageHWPoison(page))) {
9496 * At this point all remaining PageOffline() pages have a
9497 * reference count of 0 and can simply be skipped.
9499 if (PageOffline(page)) {
9500 BUG_ON(page_count(page));
9501 BUG_ON(PageBuddy(page));
9506 BUG_ON(page_count(page));
9507 BUG_ON(!PageBuddy(page));
9508 order = buddy_order(page);
9509 del_page_from_free_list(page, zone, order);
9510 pfn += (1 << order);
9512 spin_unlock_irqrestore(&zone->lock, flags);
9517 * This function returns a stable result only if called under zone lock.
9519 bool is_free_buddy_page(struct page *page)
9521 unsigned long pfn = page_to_pfn(page);
9524 for (order = 0; order < MAX_ORDER; order++) {
9525 struct page *page_head = page - (pfn & ((1 << order) - 1));
9527 if (PageBuddy(page_head) &&
9528 buddy_order_unsafe(page_head) >= order)
9532 return order < MAX_ORDER;
9534 EXPORT_SYMBOL(is_free_buddy_page);
9536 #ifdef CONFIG_MEMORY_FAILURE
9538 * Break down a higher-order page in sub-pages, and keep our target out of
9541 static void break_down_buddy_pages(struct zone *zone, struct page *page,
9542 struct page *target, int low, int high,
9545 unsigned long size = 1 << high;
9546 struct page *current_buddy, *next_page;
9548 while (high > low) {
9552 if (target >= &page[size]) {
9553 next_page = page + size;
9554 current_buddy = page;
9557 current_buddy = page + size;
9560 if (set_page_guard(zone, current_buddy, high, migratetype))
9563 if (current_buddy != target) {
9564 add_to_free_list(current_buddy, zone, high, migratetype);
9565 set_buddy_order(current_buddy, high);
9572 * Take a page that will be marked as poisoned off the buddy allocator.
9574 bool take_page_off_buddy(struct page *page)
9576 struct zone *zone = page_zone(page);
9577 unsigned long pfn = page_to_pfn(page);
9578 unsigned long flags;
9582 spin_lock_irqsave(&zone->lock, flags);
9583 for (order = 0; order < MAX_ORDER; order++) {
9584 struct page *page_head = page - (pfn & ((1 << order) - 1));
9585 int page_order = buddy_order(page_head);
9587 if (PageBuddy(page_head) && page_order >= order) {
9588 unsigned long pfn_head = page_to_pfn(page_head);
9589 int migratetype = get_pfnblock_migratetype(page_head,
9592 del_page_from_free_list(page_head, zone, page_order);
9593 break_down_buddy_pages(zone, page_head, page, 0,
9594 page_order, migratetype);
9595 SetPageHWPoisonTakenOff(page);
9596 if (!is_migrate_isolate(migratetype))
9597 __mod_zone_freepage_state(zone, -1, migratetype);
9601 if (page_count(page_head) > 0)
9604 spin_unlock_irqrestore(&zone->lock, flags);
9609 * Cancel takeoff done by take_page_off_buddy().
9611 bool put_page_back_buddy(struct page *page)
9613 struct zone *zone = page_zone(page);
9614 unsigned long pfn = page_to_pfn(page);
9615 unsigned long flags;
9616 int migratetype = get_pfnblock_migratetype(page, pfn);
9619 spin_lock_irqsave(&zone->lock, flags);
9620 if (put_page_testzero(page)) {
9621 ClearPageHWPoisonTakenOff(page);
9622 __free_one_page(page, pfn, zone, 0, migratetype, FPI_NONE);
9623 if (TestClearPageHWPoison(page)) {
9624 num_poisoned_pages_dec();
9628 spin_unlock_irqrestore(&zone->lock, flags);
9634 #ifdef CONFIG_ZONE_DMA
9635 bool has_managed_dma(void)
9637 struct pglist_data *pgdat;
9639 for_each_online_pgdat(pgdat) {
9640 struct zone *zone = &pgdat->node_zones[ZONE_DMA];
9642 if (managed_zone(zone))
9647 #endif /* CONFIG_ZONE_DMA */