2 * linux/mm/page_alloc.c
4 * Manages the free list, the system allocates free pages here.
5 * Note that kmalloc() lives in slab.c
7 * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds
8 * Swap reorganised 29.12.95, Stephen Tweedie
9 * Support of BIGMEM added by Gerhard Wichert, Siemens AG, July 1999
10 * Reshaped it to be a zoned allocator, Ingo Molnar, Red Hat, 1999
11 * Discontiguous memory support, Kanoj Sarcar, SGI, Nov 1999
12 * Zone balancing, Kanoj Sarcar, SGI, Jan 2000
13 * Per cpu hot/cold page lists, bulk allocation, Martin J. Bligh, Sept 2002
14 * (lots of bits borrowed from Ingo Molnar & Andrew Morton)
17 #include <linux/stddef.h>
19 #include <linux/highmem.h>
20 #include <linux/swap.h>
21 #include <linux/interrupt.h>
22 #include <linux/pagemap.h>
23 #include <linux/jiffies.h>
24 #include <linux/memblock.h>
25 #include <linux/compiler.h>
26 #include <linux/kernel.h>
27 #include <linux/kasan.h>
28 #include <linux/module.h>
29 #include <linux/suspend.h>
30 #include <linux/pagevec.h>
31 #include <linux/blkdev.h>
32 #include <linux/slab.h>
33 #include <linux/ratelimit.h>
34 #include <linux/oom.h>
35 #include <linux/topology.h>
36 #include <linux/sysctl.h>
37 #include <linux/cpu.h>
38 #include <linux/cpuset.h>
39 #include <linux/memory_hotplug.h>
40 #include <linux/nodemask.h>
41 #include <linux/vmalloc.h>
42 #include <linux/vmstat.h>
43 #include <linux/mempolicy.h>
44 #include <linux/memremap.h>
45 #include <linux/stop_machine.h>
46 #include <linux/sort.h>
47 #include <linux/pfn.h>
48 #include <linux/backing-dev.h>
49 #include <linux/fault-inject.h>
50 #include <linux/page-isolation.h>
51 #include <linux/page_ext.h>
52 #include <linux/debugobjects.h>
53 #include <linux/kmemleak.h>
54 #include <linux/compaction.h>
55 #include <trace/events/kmem.h>
56 #include <trace/events/oom.h>
57 #include <linux/prefetch.h>
58 #include <linux/mm_inline.h>
59 #include <linux/migrate.h>
60 #include <linux/hugetlb.h>
61 #include <linux/sched/rt.h>
62 #include <linux/sched/mm.h>
63 #include <linux/page_owner.h>
64 #include <linux/kthread.h>
65 #include <linux/memcontrol.h>
66 #include <linux/ftrace.h>
67 #include <linux/lockdep.h>
68 #include <linux/nmi.h>
69 #include <linux/psi.h>
71 #include <asm/sections.h>
72 #include <asm/tlbflush.h>
73 #include <asm/div64.h>
76 /* prevent >1 _updater_ of zone percpu pageset ->high and ->batch fields */
77 static DEFINE_MUTEX(pcp_batch_high_lock);
78 #define MIN_PERCPU_PAGELIST_FRACTION (8)
80 #ifdef CONFIG_USE_PERCPU_NUMA_NODE_ID
81 DEFINE_PER_CPU(int, numa_node);
82 EXPORT_PER_CPU_SYMBOL(numa_node);
85 DEFINE_STATIC_KEY_TRUE(vm_numa_stat_key);
87 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
89 * N.B., Do NOT reference the '_numa_mem_' per cpu variable directly.
90 * It will not be defined when CONFIG_HAVE_MEMORYLESS_NODES is not defined.
91 * Use the accessor functions set_numa_mem(), numa_mem_id() and cpu_to_mem()
92 * defined in <linux/topology.h>.
94 DEFINE_PER_CPU(int, _numa_mem_); /* Kernel "local memory" node */
95 EXPORT_PER_CPU_SYMBOL(_numa_mem_);
96 int _node_numa_mem_[MAX_NUMNODES];
99 /* work_structs for global per-cpu drains */
102 struct work_struct work;
104 DEFINE_MUTEX(pcpu_drain_mutex);
105 DEFINE_PER_CPU(struct pcpu_drain, pcpu_drain);
107 #ifdef CONFIG_GCC_PLUGIN_LATENT_ENTROPY
108 volatile unsigned long latent_entropy __latent_entropy;
109 EXPORT_SYMBOL(latent_entropy);
113 * Array of node states.
115 nodemask_t node_states[NR_NODE_STATES] __read_mostly = {
116 [N_POSSIBLE] = NODE_MASK_ALL,
117 [N_ONLINE] = { { [0] = 1UL } },
119 [N_NORMAL_MEMORY] = { { [0] = 1UL } },
120 #ifdef CONFIG_HIGHMEM
121 [N_HIGH_MEMORY] = { { [0] = 1UL } },
123 [N_MEMORY] = { { [0] = 1UL } },
124 [N_CPU] = { { [0] = 1UL } },
127 EXPORT_SYMBOL(node_states);
129 atomic_long_t _totalram_pages __read_mostly;
130 EXPORT_SYMBOL(_totalram_pages);
131 unsigned long totalreserve_pages __read_mostly;
132 unsigned long totalcma_pages __read_mostly;
134 int percpu_pagelist_fraction;
135 gfp_t gfp_allowed_mask __read_mostly = GFP_BOOT_MASK;
138 * A cached value of the page's pageblock's migratetype, used when the page is
139 * put on a pcplist. Used to avoid the pageblock migratetype lookup when
140 * freeing from pcplists in most cases, at the cost of possibly becoming stale.
141 * Also the migratetype set in the page does not necessarily match the pcplist
142 * index, e.g. page might have MIGRATE_CMA set but be on a pcplist with any
143 * other index - this ensures that it will be put on the correct CMA freelist.
145 static inline int get_pcppage_migratetype(struct page *page)
150 static inline void set_pcppage_migratetype(struct page *page, int migratetype)
152 page->index = migratetype;
155 #ifdef CONFIG_PM_SLEEP
157 * The following functions are used by the suspend/hibernate code to temporarily
158 * change gfp_allowed_mask in order to avoid using I/O during memory allocations
159 * while devices are suspended. To avoid races with the suspend/hibernate code,
160 * they should always be called with system_transition_mutex held
161 * (gfp_allowed_mask also should only be modified with system_transition_mutex
162 * held, unless the suspend/hibernate code is guaranteed not to run in parallel
163 * with that modification).
166 static gfp_t saved_gfp_mask;
168 void pm_restore_gfp_mask(void)
170 WARN_ON(!mutex_is_locked(&system_transition_mutex));
171 if (saved_gfp_mask) {
172 gfp_allowed_mask = saved_gfp_mask;
177 void pm_restrict_gfp_mask(void)
179 WARN_ON(!mutex_is_locked(&system_transition_mutex));
180 WARN_ON(saved_gfp_mask);
181 saved_gfp_mask = gfp_allowed_mask;
182 gfp_allowed_mask &= ~(__GFP_IO | __GFP_FS);
185 bool pm_suspended_storage(void)
187 if ((gfp_allowed_mask & (__GFP_IO | __GFP_FS)) == (__GFP_IO | __GFP_FS))
191 #endif /* CONFIG_PM_SLEEP */
193 #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
194 unsigned int pageblock_order __read_mostly;
197 static void __free_pages_ok(struct page *page, unsigned int order);
200 * results with 256, 32 in the lowmem_reserve sysctl:
201 * 1G machine -> (16M dma, 800M-16M normal, 1G-800M high)
202 * 1G machine -> (16M dma, 784M normal, 224M high)
203 * NORMAL allocation will leave 784M/256 of ram reserved in the ZONE_DMA
204 * HIGHMEM allocation will leave 224M/32 of ram reserved in ZONE_NORMAL
205 * HIGHMEM allocation will leave (224M+784M)/256 of ram reserved in ZONE_DMA
207 * TBD: should special case ZONE_DMA32 machines here - in those we normally
208 * don't need any ZONE_NORMAL reservation
210 int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES] = {
211 #ifdef CONFIG_ZONE_DMA
214 #ifdef CONFIG_ZONE_DMA32
218 #ifdef CONFIG_HIGHMEM
224 EXPORT_SYMBOL(totalram_pages);
226 static char * const zone_names[MAX_NR_ZONES] = {
227 #ifdef CONFIG_ZONE_DMA
230 #ifdef CONFIG_ZONE_DMA32
234 #ifdef CONFIG_HIGHMEM
238 #ifdef CONFIG_ZONE_DEVICE
243 const char * const migratetype_names[MIGRATE_TYPES] = {
251 #ifdef CONFIG_MEMORY_ISOLATION
256 compound_page_dtor * const compound_page_dtors[] = {
259 #ifdef CONFIG_HUGETLB_PAGE
262 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
267 int min_free_kbytes = 1024;
268 int user_min_free_kbytes = -1;
269 #ifdef CONFIG_DISCONTIGMEM
271 * DiscontigMem defines memory ranges as separate pg_data_t even if the ranges
272 * are not on separate NUMA nodes. Functionally this works but with
273 * watermark_boost_factor, it can reclaim prematurely as the ranges can be
274 * quite small. By default, do not boost watermarks on discontigmem as in
275 * many cases very high-order allocations like THP are likely to be
276 * unsupported and the premature reclaim offsets the advantage of long-term
277 * fragmentation avoidance.
279 int watermark_boost_factor __read_mostly;
281 int watermark_boost_factor __read_mostly = 15000;
283 int watermark_scale_factor = 10;
285 static unsigned long nr_kernel_pages __initdata;
286 static unsigned long nr_all_pages __initdata;
287 static unsigned long dma_reserve __initdata;
289 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
290 static unsigned long arch_zone_lowest_possible_pfn[MAX_NR_ZONES] __initdata;
291 static unsigned long arch_zone_highest_possible_pfn[MAX_NR_ZONES] __initdata;
292 static unsigned long required_kernelcore __initdata;
293 static unsigned long required_kernelcore_percent __initdata;
294 static unsigned long required_movablecore __initdata;
295 static unsigned long required_movablecore_percent __initdata;
296 static unsigned long zone_movable_pfn[MAX_NUMNODES] __initdata;
297 static bool mirrored_kernelcore __meminitdata;
299 /* movable_zone is the "real" zone pages in ZONE_MOVABLE are taken from */
301 EXPORT_SYMBOL(movable_zone);
302 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
305 unsigned int nr_node_ids __read_mostly = MAX_NUMNODES;
306 unsigned int nr_online_nodes __read_mostly = 1;
307 EXPORT_SYMBOL(nr_node_ids);
308 EXPORT_SYMBOL(nr_online_nodes);
311 int page_group_by_mobility_disabled __read_mostly;
313 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
315 * During boot we initialize deferred pages on-demand, as needed, but once
316 * page_alloc_init_late() has finished, the deferred pages are all initialized,
317 * and we can permanently disable that path.
319 static DEFINE_STATIC_KEY_TRUE(deferred_pages);
322 * Calling kasan_free_pages() only after deferred memory initialization
323 * has completed. Poisoning pages during deferred memory init will greatly
324 * lengthen the process and cause problem in large memory systems as the
325 * deferred pages initialization is done with interrupt disabled.
327 * Assuming that there will be no reference to those newly initialized
328 * pages before they are ever allocated, this should have no effect on
329 * KASAN memory tracking as the poison will be properly inserted at page
330 * allocation time. The only corner case is when pages are allocated by
331 * on-demand allocation and then freed again before the deferred pages
332 * initialization is done, but this is not likely to happen.
334 static inline void kasan_free_nondeferred_pages(struct page *page, int order)
336 if (!static_branch_unlikely(&deferred_pages))
337 kasan_free_pages(page, order);
340 /* Returns true if the struct page for the pfn is uninitialised */
341 static inline bool __meminit early_page_uninitialised(unsigned long pfn)
343 int nid = early_pfn_to_nid(pfn);
345 if (node_online(nid) && pfn >= NODE_DATA(nid)->first_deferred_pfn)
352 * Returns true when the remaining initialisation should be deferred until
353 * later in the boot cycle when it can be parallelised.
355 static bool __meminit
356 defer_init(int nid, unsigned long pfn, unsigned long end_pfn)
358 static unsigned long prev_end_pfn, nr_initialised;
361 * prev_end_pfn static that contains the end of previous zone
362 * No need to protect because called very early in boot before smp_init.
364 if (prev_end_pfn != end_pfn) {
365 prev_end_pfn = end_pfn;
369 /* Always populate low zones for address-constrained allocations */
370 if (end_pfn < pgdat_end_pfn(NODE_DATA(nid)))
374 * We start only with one section of pages, more pages are added as
375 * needed until the rest of deferred pages are initialized.
378 if ((nr_initialised > PAGES_PER_SECTION) &&
379 (pfn & (PAGES_PER_SECTION - 1)) == 0) {
380 NODE_DATA(nid)->first_deferred_pfn = pfn;
386 #define kasan_free_nondeferred_pages(p, o) kasan_free_pages(p, o)
388 static inline bool early_page_uninitialised(unsigned long pfn)
393 static inline bool defer_init(int nid, unsigned long pfn, unsigned long end_pfn)
399 /* Return a pointer to the bitmap storing bits affecting a block of pages */
400 static inline unsigned long *get_pageblock_bitmap(struct page *page,
403 #ifdef CONFIG_SPARSEMEM
404 return __pfn_to_section(pfn)->pageblock_flags;
406 return page_zone(page)->pageblock_flags;
407 #endif /* CONFIG_SPARSEMEM */
410 static inline int pfn_to_bitidx(struct page *page, unsigned long pfn)
412 #ifdef CONFIG_SPARSEMEM
413 pfn &= (PAGES_PER_SECTION-1);
414 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
416 pfn = pfn - round_down(page_zone(page)->zone_start_pfn, pageblock_nr_pages);
417 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
418 #endif /* CONFIG_SPARSEMEM */
422 * get_pfnblock_flags_mask - Return the requested group of flags for the pageblock_nr_pages block of pages
423 * @page: The page within the block of interest
424 * @pfn: The target page frame number
425 * @end_bitidx: The last bit of interest to retrieve
426 * @mask: mask of bits that the caller is interested in
428 * Return: pageblock_bits flags
430 static __always_inline unsigned long __get_pfnblock_flags_mask(struct page *page,
432 unsigned long end_bitidx,
435 unsigned long *bitmap;
436 unsigned long bitidx, word_bitidx;
439 bitmap = get_pageblock_bitmap(page, pfn);
440 bitidx = pfn_to_bitidx(page, pfn);
441 word_bitidx = bitidx / BITS_PER_LONG;
442 bitidx &= (BITS_PER_LONG-1);
444 word = bitmap[word_bitidx];
445 bitidx += end_bitidx;
446 return (word >> (BITS_PER_LONG - bitidx - 1)) & mask;
449 unsigned long get_pfnblock_flags_mask(struct page *page, unsigned long pfn,
450 unsigned long end_bitidx,
453 return __get_pfnblock_flags_mask(page, pfn, end_bitidx, mask);
456 static __always_inline int get_pfnblock_migratetype(struct page *page, unsigned long pfn)
458 return __get_pfnblock_flags_mask(page, pfn, PB_migrate_end, MIGRATETYPE_MASK);
462 * set_pfnblock_flags_mask - Set the requested group of flags for a pageblock_nr_pages block of pages
463 * @page: The page within the block of interest
464 * @flags: The flags to set
465 * @pfn: The target page frame number
466 * @end_bitidx: The last bit of interest
467 * @mask: mask of bits that the caller is interested in
469 void set_pfnblock_flags_mask(struct page *page, unsigned long flags,
471 unsigned long end_bitidx,
474 unsigned long *bitmap;
475 unsigned long bitidx, word_bitidx;
476 unsigned long old_word, word;
478 BUILD_BUG_ON(NR_PAGEBLOCK_BITS != 4);
479 BUILD_BUG_ON(MIGRATE_TYPES > (1 << PB_migratetype_bits));
481 bitmap = get_pageblock_bitmap(page, pfn);
482 bitidx = pfn_to_bitidx(page, pfn);
483 word_bitidx = bitidx / BITS_PER_LONG;
484 bitidx &= (BITS_PER_LONG-1);
486 VM_BUG_ON_PAGE(!zone_spans_pfn(page_zone(page), pfn), page);
488 bitidx += end_bitidx;
489 mask <<= (BITS_PER_LONG - bitidx - 1);
490 flags <<= (BITS_PER_LONG - bitidx - 1);
492 word = READ_ONCE(bitmap[word_bitidx]);
494 old_word = cmpxchg(&bitmap[word_bitidx], word, (word & ~mask) | flags);
495 if (word == old_word)
501 void set_pageblock_migratetype(struct page *page, int migratetype)
503 if (unlikely(page_group_by_mobility_disabled &&
504 migratetype < MIGRATE_PCPTYPES))
505 migratetype = MIGRATE_UNMOVABLE;
507 set_pageblock_flags_group(page, (unsigned long)migratetype,
508 PB_migrate, PB_migrate_end);
511 #ifdef CONFIG_DEBUG_VM
512 static int page_outside_zone_boundaries(struct zone *zone, struct page *page)
516 unsigned long pfn = page_to_pfn(page);
517 unsigned long sp, start_pfn;
520 seq = zone_span_seqbegin(zone);
521 start_pfn = zone->zone_start_pfn;
522 sp = zone->spanned_pages;
523 if (!zone_spans_pfn(zone, pfn))
525 } while (zone_span_seqretry(zone, seq));
528 pr_err("page 0x%lx outside node %d zone %s [ 0x%lx - 0x%lx ]\n",
529 pfn, zone_to_nid(zone), zone->name,
530 start_pfn, start_pfn + sp);
535 static int page_is_consistent(struct zone *zone, struct page *page)
537 if (!pfn_valid_within(page_to_pfn(page)))
539 if (zone != page_zone(page))
545 * Temporary debugging check for pages not lying within a given zone.
547 static int __maybe_unused bad_range(struct zone *zone, struct page *page)
549 if (page_outside_zone_boundaries(zone, page))
551 if (!page_is_consistent(zone, page))
557 static inline int __maybe_unused bad_range(struct zone *zone, struct page *page)
563 static void bad_page(struct page *page, const char *reason,
564 unsigned long bad_flags)
566 static unsigned long resume;
567 static unsigned long nr_shown;
568 static unsigned long nr_unshown;
571 * Allow a burst of 60 reports, then keep quiet for that minute;
572 * or allow a steady drip of one report per second.
574 if (nr_shown == 60) {
575 if (time_before(jiffies, resume)) {
581 "BUG: Bad page state: %lu messages suppressed\n",
588 resume = jiffies + 60 * HZ;
590 pr_alert("BUG: Bad page state in process %s pfn:%05lx\n",
591 current->comm, page_to_pfn(page));
592 __dump_page(page, reason);
593 bad_flags &= page->flags;
595 pr_alert("bad because of flags: %#lx(%pGp)\n",
596 bad_flags, &bad_flags);
597 dump_page_owner(page);
602 /* Leave bad fields for debug, except PageBuddy could make trouble */
603 page_mapcount_reset(page); /* remove PageBuddy */
604 add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE);
608 * Higher-order pages are called "compound pages". They are structured thusly:
610 * The first PAGE_SIZE page is called the "head page" and have PG_head set.
612 * The remaining PAGE_SIZE pages are called "tail pages". PageTail() is encoded
613 * in bit 0 of page->compound_head. The rest of bits is pointer to head page.
615 * The first tail page's ->compound_dtor holds the offset in array of compound
616 * page destructors. See compound_page_dtors.
618 * The first tail page's ->compound_order holds the order of allocation.
619 * This usage means that zero-order pages may not be compound.
622 void free_compound_page(struct page *page)
624 __free_pages_ok(page, compound_order(page));
627 void prep_compound_page(struct page *page, unsigned int order)
630 int nr_pages = 1 << order;
632 set_compound_page_dtor(page, COMPOUND_PAGE_DTOR);
633 set_compound_order(page, order);
635 for (i = 1; i < nr_pages; i++) {
636 struct page *p = page + i;
637 set_page_count(p, 0);
638 p->mapping = TAIL_MAPPING;
639 set_compound_head(p, page);
641 atomic_set(compound_mapcount_ptr(page), -1);
644 #ifdef CONFIG_DEBUG_PAGEALLOC
645 unsigned int _debug_guardpage_minorder;
646 bool _debug_pagealloc_enabled __read_mostly
647 = IS_ENABLED(CONFIG_DEBUG_PAGEALLOC_ENABLE_DEFAULT);
648 EXPORT_SYMBOL(_debug_pagealloc_enabled);
649 bool _debug_guardpage_enabled __read_mostly;
651 static int __init early_debug_pagealloc(char *buf)
655 return kstrtobool(buf, &_debug_pagealloc_enabled);
657 early_param("debug_pagealloc", early_debug_pagealloc);
659 static bool need_debug_guardpage(void)
661 /* If we don't use debug_pagealloc, we don't need guard page */
662 if (!debug_pagealloc_enabled())
665 if (!debug_guardpage_minorder())
671 static void init_debug_guardpage(void)
673 if (!debug_pagealloc_enabled())
676 if (!debug_guardpage_minorder())
679 _debug_guardpage_enabled = true;
682 struct page_ext_operations debug_guardpage_ops = {
683 .need = need_debug_guardpage,
684 .init = init_debug_guardpage,
687 static int __init debug_guardpage_minorder_setup(char *buf)
691 if (kstrtoul(buf, 10, &res) < 0 || res > MAX_ORDER / 2) {
692 pr_err("Bad debug_guardpage_minorder value\n");
695 _debug_guardpage_minorder = res;
696 pr_info("Setting debug_guardpage_minorder to %lu\n", res);
699 early_param("debug_guardpage_minorder", debug_guardpage_minorder_setup);
701 static inline bool set_page_guard(struct zone *zone, struct page *page,
702 unsigned int order, int migratetype)
704 struct page_ext *page_ext;
706 if (!debug_guardpage_enabled())
709 if (order >= debug_guardpage_minorder())
712 page_ext = lookup_page_ext(page);
713 if (unlikely(!page_ext))
716 __set_bit(PAGE_EXT_DEBUG_GUARD, &page_ext->flags);
718 INIT_LIST_HEAD(&page->lru);
719 set_page_private(page, order);
720 /* Guard pages are not available for any usage */
721 __mod_zone_freepage_state(zone, -(1 << order), migratetype);
726 static inline void clear_page_guard(struct zone *zone, struct page *page,
727 unsigned int order, int migratetype)
729 struct page_ext *page_ext;
731 if (!debug_guardpage_enabled())
734 page_ext = lookup_page_ext(page);
735 if (unlikely(!page_ext))
738 __clear_bit(PAGE_EXT_DEBUG_GUARD, &page_ext->flags);
740 set_page_private(page, 0);
741 if (!is_migrate_isolate(migratetype))
742 __mod_zone_freepage_state(zone, (1 << order), migratetype);
745 struct page_ext_operations debug_guardpage_ops;
746 static inline bool set_page_guard(struct zone *zone, struct page *page,
747 unsigned int order, int migratetype) { return false; }
748 static inline void clear_page_guard(struct zone *zone, struct page *page,
749 unsigned int order, int migratetype) {}
752 static inline void set_page_order(struct page *page, unsigned int order)
754 set_page_private(page, order);
755 __SetPageBuddy(page);
758 static inline void rmv_page_order(struct page *page)
760 __ClearPageBuddy(page);
761 set_page_private(page, 0);
765 * This function checks whether a page is free && is the buddy
766 * we can coalesce a page and its buddy if
767 * (a) the buddy is not in a hole (check before calling!) &&
768 * (b) the buddy is in the buddy system &&
769 * (c) a page and its buddy have the same order &&
770 * (d) a page and its buddy are in the same zone.
772 * For recording whether a page is in the buddy system, we set PageBuddy.
773 * Setting, clearing, and testing PageBuddy is serialized by zone->lock.
775 * For recording page's order, we use page_private(page).
777 static inline int page_is_buddy(struct page *page, struct page *buddy,
780 if (page_is_guard(buddy) && page_order(buddy) == order) {
781 if (page_zone_id(page) != page_zone_id(buddy))
784 VM_BUG_ON_PAGE(page_count(buddy) != 0, buddy);
789 if (PageBuddy(buddy) && page_order(buddy) == order) {
791 * zone check is done late to avoid uselessly
792 * calculating zone/node ids for pages that could
795 if (page_zone_id(page) != page_zone_id(buddy))
798 VM_BUG_ON_PAGE(page_count(buddy) != 0, buddy);
805 #ifdef CONFIG_COMPACTION
806 static inline struct capture_control *task_capc(struct zone *zone)
808 struct capture_control *capc = current->capture_control;
811 !(current->flags & PF_KTHREAD) &&
813 capc->cc->zone == zone &&
814 capc->cc->direct_compaction ? capc : NULL;
818 compaction_capture(struct capture_control *capc, struct page *page,
819 int order, int migratetype)
821 if (!capc || order != capc->cc->order)
824 /* Do not accidentally pollute CMA or isolated regions*/
825 if (is_migrate_cma(migratetype) ||
826 is_migrate_isolate(migratetype))
830 * Do not let lower order allocations polluate a movable pageblock.
831 * This might let an unmovable request use a reclaimable pageblock
832 * and vice-versa but no more than normal fallback logic which can
833 * have trouble finding a high-order free page.
835 if (order < pageblock_order && migratetype == MIGRATE_MOVABLE)
843 static inline struct capture_control *task_capc(struct zone *zone)
849 compaction_capture(struct capture_control *capc, struct page *page,
850 int order, int migratetype)
854 #endif /* CONFIG_COMPACTION */
857 * Freeing function for a buddy system allocator.
859 * The concept of a buddy system is to maintain direct-mapped table
860 * (containing bit values) for memory blocks of various "orders".
861 * The bottom level table contains the map for the smallest allocatable
862 * units of memory (here, pages), and each level above it describes
863 * pairs of units from the levels below, hence, "buddies".
864 * At a high level, all that happens here is marking the table entry
865 * at the bottom level available, and propagating the changes upward
866 * as necessary, plus some accounting needed to play nicely with other
867 * parts of the VM system.
868 * At each level, we keep a list of pages, which are heads of continuous
869 * free pages of length of (1 << order) and marked with PageBuddy.
870 * Page's order is recorded in page_private(page) field.
871 * So when we are allocating or freeing one, we can derive the state of the
872 * other. That is, if we allocate a small block, and both were
873 * free, the remainder of the region must be split into blocks.
874 * If a block is freed, and its buddy is also free, then this
875 * triggers coalescing into a block of larger size.
880 static inline void __free_one_page(struct page *page,
882 struct zone *zone, unsigned int order,
885 unsigned long combined_pfn;
886 unsigned long uninitialized_var(buddy_pfn);
888 unsigned int max_order;
889 struct capture_control *capc = task_capc(zone);
891 max_order = min_t(unsigned int, MAX_ORDER, pageblock_order + 1);
893 VM_BUG_ON(!zone_is_initialized(zone));
894 VM_BUG_ON_PAGE(page->flags & PAGE_FLAGS_CHECK_AT_PREP, page);
896 VM_BUG_ON(migratetype == -1);
897 if (likely(!is_migrate_isolate(migratetype)))
898 __mod_zone_freepage_state(zone, 1 << order, migratetype);
900 VM_BUG_ON_PAGE(pfn & ((1 << order) - 1), page);
901 VM_BUG_ON_PAGE(bad_range(zone, page), page);
904 while (order < max_order - 1) {
905 if (compaction_capture(capc, page, order, migratetype)) {
906 __mod_zone_freepage_state(zone, -(1 << order),
910 buddy_pfn = __find_buddy_pfn(pfn, order);
911 buddy = page + (buddy_pfn - pfn);
913 if (!pfn_valid_within(buddy_pfn))
915 if (!page_is_buddy(page, buddy, order))
918 * Our buddy is free or it is CONFIG_DEBUG_PAGEALLOC guard page,
919 * merge with it and move up one order.
921 if (page_is_guard(buddy)) {
922 clear_page_guard(zone, buddy, order, migratetype);
924 list_del(&buddy->lru);
925 zone->free_area[order].nr_free--;
926 rmv_page_order(buddy);
928 combined_pfn = buddy_pfn & pfn;
929 page = page + (combined_pfn - pfn);
933 if (max_order < MAX_ORDER) {
934 /* If we are here, it means order is >= pageblock_order.
935 * We want to prevent merge between freepages on isolate
936 * pageblock and normal pageblock. Without this, pageblock
937 * isolation could cause incorrect freepage or CMA accounting.
939 * We don't want to hit this code for the more frequent
942 if (unlikely(has_isolate_pageblock(zone))) {
945 buddy_pfn = __find_buddy_pfn(pfn, order);
946 buddy = page + (buddy_pfn - pfn);
947 buddy_mt = get_pageblock_migratetype(buddy);
949 if (migratetype != buddy_mt
950 && (is_migrate_isolate(migratetype) ||
951 is_migrate_isolate(buddy_mt)))
955 goto continue_merging;
959 set_page_order(page, order);
962 * If this is not the largest possible page, check if the buddy
963 * of the next-highest order is free. If it is, it's possible
964 * that pages are being freed that will coalesce soon. In case,
965 * that is happening, add the free page to the tail of the list
966 * so it's less likely to be used soon and more likely to be merged
967 * as a higher order page
969 if ((order < MAX_ORDER-2) && pfn_valid_within(buddy_pfn)) {
970 struct page *higher_page, *higher_buddy;
971 combined_pfn = buddy_pfn & pfn;
972 higher_page = page + (combined_pfn - pfn);
973 buddy_pfn = __find_buddy_pfn(combined_pfn, order + 1);
974 higher_buddy = higher_page + (buddy_pfn - combined_pfn);
975 if (pfn_valid_within(buddy_pfn) &&
976 page_is_buddy(higher_page, higher_buddy, order + 1)) {
977 list_add_tail(&page->lru,
978 &zone->free_area[order].free_list[migratetype]);
983 list_add(&page->lru, &zone->free_area[order].free_list[migratetype]);
985 zone->free_area[order].nr_free++;
989 * A bad page could be due to a number of fields. Instead of multiple branches,
990 * try and check multiple fields with one check. The caller must do a detailed
991 * check if necessary.
993 static inline bool page_expected_state(struct page *page,
994 unsigned long check_flags)
996 if (unlikely(atomic_read(&page->_mapcount) != -1))
999 if (unlikely((unsigned long)page->mapping |
1000 page_ref_count(page) |
1002 (unsigned long)page->mem_cgroup |
1004 (page->flags & check_flags)))
1010 static void free_pages_check_bad(struct page *page)
1012 const char *bad_reason;
1013 unsigned long bad_flags;
1018 if (unlikely(atomic_read(&page->_mapcount) != -1))
1019 bad_reason = "nonzero mapcount";
1020 if (unlikely(page->mapping != NULL))
1021 bad_reason = "non-NULL mapping";
1022 if (unlikely(page_ref_count(page) != 0))
1023 bad_reason = "nonzero _refcount";
1024 if (unlikely(page->flags & PAGE_FLAGS_CHECK_AT_FREE)) {
1025 bad_reason = "PAGE_FLAGS_CHECK_AT_FREE flag(s) set";
1026 bad_flags = PAGE_FLAGS_CHECK_AT_FREE;
1029 if (unlikely(page->mem_cgroup))
1030 bad_reason = "page still charged to cgroup";
1032 bad_page(page, bad_reason, bad_flags);
1035 static inline int free_pages_check(struct page *page)
1037 if (likely(page_expected_state(page, PAGE_FLAGS_CHECK_AT_FREE)))
1040 /* Something has gone sideways, find it */
1041 free_pages_check_bad(page);
1045 static int free_tail_pages_check(struct page *head_page, struct page *page)
1050 * We rely page->lru.next never has bit 0 set, unless the page
1051 * is PageTail(). Let's make sure that's true even for poisoned ->lru.
1053 BUILD_BUG_ON((unsigned long)LIST_POISON1 & 1);
1055 if (!IS_ENABLED(CONFIG_DEBUG_VM)) {
1059 switch (page - head_page) {
1061 /* the first tail page: ->mapping may be compound_mapcount() */
1062 if (unlikely(compound_mapcount(page))) {
1063 bad_page(page, "nonzero compound_mapcount", 0);
1069 * the second tail page: ->mapping is
1070 * deferred_list.next -- ignore value.
1074 if (page->mapping != TAIL_MAPPING) {
1075 bad_page(page, "corrupted mapping in tail page", 0);
1080 if (unlikely(!PageTail(page))) {
1081 bad_page(page, "PageTail not set", 0);
1084 if (unlikely(compound_head(page) != head_page)) {
1085 bad_page(page, "compound_head not consistent", 0);
1090 page->mapping = NULL;
1091 clear_compound_head(page);
1095 static __always_inline bool free_pages_prepare(struct page *page,
1096 unsigned int order, bool check_free)
1100 VM_BUG_ON_PAGE(PageTail(page), page);
1102 trace_mm_page_free(page, order);
1105 * Check tail pages before head page information is cleared to
1106 * avoid checking PageCompound for order-0 pages.
1108 if (unlikely(order)) {
1109 bool compound = PageCompound(page);
1112 VM_BUG_ON_PAGE(compound && compound_order(page) != order, page);
1115 ClearPageDoubleMap(page);
1116 for (i = 1; i < (1 << order); i++) {
1118 bad += free_tail_pages_check(page, page + i);
1119 if (unlikely(free_pages_check(page + i))) {
1123 (page + i)->flags &= ~PAGE_FLAGS_CHECK_AT_PREP;
1126 if (PageMappingFlags(page))
1127 page->mapping = NULL;
1128 if (memcg_kmem_enabled() && PageKmemcg(page))
1129 __memcg_kmem_uncharge(page, order);
1131 bad += free_pages_check(page);
1135 page_cpupid_reset_last(page);
1136 page->flags &= ~PAGE_FLAGS_CHECK_AT_PREP;
1137 reset_page_owner(page, order);
1139 if (!PageHighMem(page)) {
1140 debug_check_no_locks_freed(page_address(page),
1141 PAGE_SIZE << order);
1142 debug_check_no_obj_freed(page_address(page),
1143 PAGE_SIZE << order);
1145 arch_free_page(page, order);
1146 kernel_poison_pages(page, 1 << order, 0);
1147 if (debug_pagealloc_enabled())
1148 kernel_map_pages(page, 1 << order, 0);
1150 kasan_free_nondeferred_pages(page, order);
1155 #ifdef CONFIG_DEBUG_VM
1156 static inline bool free_pcp_prepare(struct page *page)
1158 return free_pages_prepare(page, 0, true);
1161 static inline bool bulkfree_pcp_prepare(struct page *page)
1166 static bool free_pcp_prepare(struct page *page)
1168 return free_pages_prepare(page, 0, false);
1171 static bool bulkfree_pcp_prepare(struct page *page)
1173 return free_pages_check(page);
1175 #endif /* CONFIG_DEBUG_VM */
1177 static inline void prefetch_buddy(struct page *page)
1179 unsigned long pfn = page_to_pfn(page);
1180 unsigned long buddy_pfn = __find_buddy_pfn(pfn, 0);
1181 struct page *buddy = page + (buddy_pfn - pfn);
1187 * Frees a number of pages from the PCP lists
1188 * Assumes all pages on list are in same zone, and of same order.
1189 * count is the number of pages to free.
1191 * If the zone was previously in an "all pages pinned" state then look to
1192 * see if this freeing clears that state.
1194 * And clear the zone's pages_scanned counter, to hold off the "all pages are
1195 * pinned" detection logic.
1197 static void free_pcppages_bulk(struct zone *zone, int count,
1198 struct per_cpu_pages *pcp)
1200 int migratetype = 0;
1202 int prefetch_nr = 0;
1203 bool isolated_pageblocks;
1204 struct page *page, *tmp;
1208 struct list_head *list;
1211 * Remove pages from lists in a round-robin fashion. A
1212 * batch_free count is maintained that is incremented when an
1213 * empty list is encountered. This is so more pages are freed
1214 * off fuller lists instead of spinning excessively around empty
1219 if (++migratetype == MIGRATE_PCPTYPES)
1221 list = &pcp->lists[migratetype];
1222 } while (list_empty(list));
1224 /* This is the only non-empty list. Free them all. */
1225 if (batch_free == MIGRATE_PCPTYPES)
1229 page = list_last_entry(list, struct page, lru);
1230 /* must delete to avoid corrupting pcp list */
1231 list_del(&page->lru);
1234 if (bulkfree_pcp_prepare(page))
1237 list_add_tail(&page->lru, &head);
1240 * We are going to put the page back to the global
1241 * pool, prefetch its buddy to speed up later access
1242 * under zone->lock. It is believed the overhead of
1243 * an additional test and calculating buddy_pfn here
1244 * can be offset by reduced memory latency later. To
1245 * avoid excessive prefetching due to large count, only
1246 * prefetch buddy for the first pcp->batch nr of pages.
1248 if (prefetch_nr++ < pcp->batch)
1249 prefetch_buddy(page);
1250 } while (--count && --batch_free && !list_empty(list));
1253 spin_lock(&zone->lock);
1254 isolated_pageblocks = has_isolate_pageblock(zone);
1257 * Use safe version since after __free_one_page(),
1258 * page->lru.next will not point to original list.
1260 list_for_each_entry_safe(page, tmp, &head, lru) {
1261 int mt = get_pcppage_migratetype(page);
1262 /* MIGRATE_ISOLATE page should not go to pcplists */
1263 VM_BUG_ON_PAGE(is_migrate_isolate(mt), page);
1264 /* Pageblock could have been isolated meanwhile */
1265 if (unlikely(isolated_pageblocks))
1266 mt = get_pageblock_migratetype(page);
1268 __free_one_page(page, page_to_pfn(page), zone, 0, mt);
1269 trace_mm_page_pcpu_drain(page, 0, mt);
1271 spin_unlock(&zone->lock);
1274 static void free_one_page(struct zone *zone,
1275 struct page *page, unsigned long pfn,
1279 spin_lock(&zone->lock);
1280 if (unlikely(has_isolate_pageblock(zone) ||
1281 is_migrate_isolate(migratetype))) {
1282 migratetype = get_pfnblock_migratetype(page, pfn);
1284 __free_one_page(page, pfn, zone, order, migratetype);
1285 spin_unlock(&zone->lock);
1288 static void __meminit __init_single_page(struct page *page, unsigned long pfn,
1289 unsigned long zone, int nid)
1291 mm_zero_struct_page(page);
1292 set_page_links(page, zone, nid, pfn);
1293 init_page_count(page);
1294 page_mapcount_reset(page);
1295 page_cpupid_reset_last(page);
1296 page_kasan_tag_reset(page);
1298 INIT_LIST_HEAD(&page->lru);
1299 #ifdef WANT_PAGE_VIRTUAL
1300 /* The shift won't overflow because ZONE_NORMAL is below 4G. */
1301 if (!is_highmem_idx(zone))
1302 set_page_address(page, __va(pfn << PAGE_SHIFT));
1306 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
1307 static void __meminit init_reserved_page(unsigned long pfn)
1312 if (!early_page_uninitialised(pfn))
1315 nid = early_pfn_to_nid(pfn);
1316 pgdat = NODE_DATA(nid);
1318 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
1319 struct zone *zone = &pgdat->node_zones[zid];
1321 if (pfn >= zone->zone_start_pfn && pfn < zone_end_pfn(zone))
1324 __init_single_page(pfn_to_page(pfn), pfn, zid, nid);
1327 static inline void init_reserved_page(unsigned long pfn)
1330 #endif /* CONFIG_DEFERRED_STRUCT_PAGE_INIT */
1333 * Initialised pages do not have PageReserved set. This function is
1334 * called for each range allocated by the bootmem allocator and
1335 * marks the pages PageReserved. The remaining valid pages are later
1336 * sent to the buddy page allocator.
1338 void __meminit reserve_bootmem_region(phys_addr_t start, phys_addr_t end)
1340 unsigned long start_pfn = PFN_DOWN(start);
1341 unsigned long end_pfn = PFN_UP(end);
1343 for (; start_pfn < end_pfn; start_pfn++) {
1344 if (pfn_valid(start_pfn)) {
1345 struct page *page = pfn_to_page(start_pfn);
1347 init_reserved_page(start_pfn);
1349 /* Avoid false-positive PageTail() */
1350 INIT_LIST_HEAD(&page->lru);
1353 * no need for atomic set_bit because the struct
1354 * page is not visible yet so nobody should
1357 __SetPageReserved(page);
1362 static void __free_pages_ok(struct page *page, unsigned int order)
1364 unsigned long flags;
1366 unsigned long pfn = page_to_pfn(page);
1368 if (!free_pages_prepare(page, order, true))
1371 migratetype = get_pfnblock_migratetype(page, pfn);
1372 local_irq_save(flags);
1373 __count_vm_events(PGFREE, 1 << order);
1374 free_one_page(page_zone(page), page, pfn, order, migratetype);
1375 local_irq_restore(flags);
1378 void __free_pages_core(struct page *page, unsigned int order)
1380 unsigned int nr_pages = 1 << order;
1381 struct page *p = page;
1385 for (loop = 0; loop < (nr_pages - 1); loop++, p++) {
1387 __ClearPageReserved(p);
1388 set_page_count(p, 0);
1390 __ClearPageReserved(p);
1391 set_page_count(p, 0);
1393 atomic_long_add(nr_pages, &page_zone(page)->managed_pages);
1394 set_page_refcounted(page);
1395 __free_pages(page, order);
1398 #if defined(CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID) || \
1399 defined(CONFIG_HAVE_MEMBLOCK_NODE_MAP)
1401 static struct mminit_pfnnid_cache early_pfnnid_cache __meminitdata;
1403 int __meminit early_pfn_to_nid(unsigned long pfn)
1405 static DEFINE_SPINLOCK(early_pfn_lock);
1408 spin_lock(&early_pfn_lock);
1409 nid = __early_pfn_to_nid(pfn, &early_pfnnid_cache);
1411 nid = first_online_node;
1412 spin_unlock(&early_pfn_lock);
1418 #ifdef CONFIG_NODES_SPAN_OTHER_NODES
1419 /* Only safe to use early in boot when initialisation is single-threaded */
1420 static inline bool __meminit early_pfn_in_nid(unsigned long pfn, int node)
1424 nid = __early_pfn_to_nid(pfn, &early_pfnnid_cache);
1425 if (nid >= 0 && nid != node)
1431 static inline bool __meminit early_pfn_in_nid(unsigned long pfn, int node)
1438 void __init memblock_free_pages(struct page *page, unsigned long pfn,
1441 if (early_page_uninitialised(pfn))
1443 __free_pages_core(page, order);
1447 * Check that the whole (or subset of) a pageblock given by the interval of
1448 * [start_pfn, end_pfn) is valid and within the same zone, before scanning it
1449 * with the migration of free compaction scanner. The scanners then need to
1450 * use only pfn_valid_within() check for arches that allow holes within
1453 * Return struct page pointer of start_pfn, or NULL if checks were not passed.
1455 * It's possible on some configurations to have a setup like node0 node1 node0
1456 * i.e. it's possible that all pages within a zones range of pages do not
1457 * belong to a single zone. We assume that a border between node0 and node1
1458 * can occur within a single pageblock, but not a node0 node1 node0
1459 * interleaving within a single pageblock. It is therefore sufficient to check
1460 * the first and last page of a pageblock and avoid checking each individual
1461 * page in a pageblock.
1463 struct page *__pageblock_pfn_to_page(unsigned long start_pfn,
1464 unsigned long end_pfn, struct zone *zone)
1466 struct page *start_page;
1467 struct page *end_page;
1469 /* end_pfn is one past the range we are checking */
1472 if (!pfn_valid(start_pfn) || !pfn_valid(end_pfn))
1475 start_page = pfn_to_online_page(start_pfn);
1479 if (page_zone(start_page) != zone)
1482 end_page = pfn_to_page(end_pfn);
1484 /* This gives a shorter code than deriving page_zone(end_page) */
1485 if (page_zone_id(start_page) != page_zone_id(end_page))
1491 void set_zone_contiguous(struct zone *zone)
1493 unsigned long block_start_pfn = zone->zone_start_pfn;
1494 unsigned long block_end_pfn;
1496 block_end_pfn = ALIGN(block_start_pfn + 1, pageblock_nr_pages);
1497 for (; block_start_pfn < zone_end_pfn(zone);
1498 block_start_pfn = block_end_pfn,
1499 block_end_pfn += pageblock_nr_pages) {
1501 block_end_pfn = min(block_end_pfn, zone_end_pfn(zone));
1503 if (!__pageblock_pfn_to_page(block_start_pfn,
1504 block_end_pfn, zone))
1508 /* We confirm that there is no hole */
1509 zone->contiguous = true;
1512 void clear_zone_contiguous(struct zone *zone)
1514 zone->contiguous = false;
1517 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
1518 static void __init deferred_free_range(unsigned long pfn,
1519 unsigned long nr_pages)
1527 page = pfn_to_page(pfn);
1529 /* Free a large naturally-aligned chunk if possible */
1530 if (nr_pages == pageblock_nr_pages &&
1531 (pfn & (pageblock_nr_pages - 1)) == 0) {
1532 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
1533 __free_pages_core(page, pageblock_order);
1537 for (i = 0; i < nr_pages; i++, page++, pfn++) {
1538 if ((pfn & (pageblock_nr_pages - 1)) == 0)
1539 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
1540 __free_pages_core(page, 0);
1544 /* Completion tracking for deferred_init_memmap() threads */
1545 static atomic_t pgdat_init_n_undone __initdata;
1546 static __initdata DECLARE_COMPLETION(pgdat_init_all_done_comp);
1548 static inline void __init pgdat_init_report_one_done(void)
1550 if (atomic_dec_and_test(&pgdat_init_n_undone))
1551 complete(&pgdat_init_all_done_comp);
1555 * Returns true if page needs to be initialized or freed to buddy allocator.
1557 * First we check if pfn is valid on architectures where it is possible to have
1558 * holes within pageblock_nr_pages. On systems where it is not possible, this
1559 * function is optimized out.
1561 * Then, we check if a current large page is valid by only checking the validity
1564 static inline bool __init deferred_pfn_valid(unsigned long pfn)
1566 if (!pfn_valid_within(pfn))
1568 if (!(pfn & (pageblock_nr_pages - 1)) && !pfn_valid(pfn))
1574 * Free pages to buddy allocator. Try to free aligned pages in
1575 * pageblock_nr_pages sizes.
1577 static void __init deferred_free_pages(unsigned long pfn,
1578 unsigned long end_pfn)
1580 unsigned long nr_pgmask = pageblock_nr_pages - 1;
1581 unsigned long nr_free = 0;
1583 for (; pfn < end_pfn; pfn++) {
1584 if (!deferred_pfn_valid(pfn)) {
1585 deferred_free_range(pfn - nr_free, nr_free);
1587 } else if (!(pfn & nr_pgmask)) {
1588 deferred_free_range(pfn - nr_free, nr_free);
1590 touch_nmi_watchdog();
1595 /* Free the last block of pages to allocator */
1596 deferred_free_range(pfn - nr_free, nr_free);
1600 * Initialize struct pages. We minimize pfn page lookups and scheduler checks
1601 * by performing it only once every pageblock_nr_pages.
1602 * Return number of pages initialized.
1604 static unsigned long __init deferred_init_pages(struct zone *zone,
1606 unsigned long end_pfn)
1608 unsigned long nr_pgmask = pageblock_nr_pages - 1;
1609 int nid = zone_to_nid(zone);
1610 unsigned long nr_pages = 0;
1611 int zid = zone_idx(zone);
1612 struct page *page = NULL;
1614 for (; pfn < end_pfn; pfn++) {
1615 if (!deferred_pfn_valid(pfn)) {
1618 } else if (!page || !(pfn & nr_pgmask)) {
1619 page = pfn_to_page(pfn);
1620 touch_nmi_watchdog();
1624 __init_single_page(page, pfn, zid, nid);
1630 /* Initialise remaining memory on a node */
1631 static int __init deferred_init_memmap(void *data)
1633 pg_data_t *pgdat = data;
1634 unsigned long start = jiffies;
1635 unsigned long nr_pages = 0;
1636 unsigned long spfn, epfn, first_init_pfn, flags;
1639 const struct cpumask *cpumask = cpumask_of_node(pgdat->node_id);
1642 /* Bind memory initialisation thread to a local node if possible */
1643 if (!cpumask_empty(cpumask))
1644 set_cpus_allowed_ptr(current, cpumask);
1646 pgdat_resize_lock(pgdat, &flags);
1647 first_init_pfn = pgdat->first_deferred_pfn;
1648 if (first_init_pfn == ULONG_MAX) {
1649 pgdat_resize_unlock(pgdat, &flags);
1650 pgdat_init_report_one_done();
1654 /* Sanity check boundaries */
1655 BUG_ON(pgdat->first_deferred_pfn < pgdat->node_start_pfn);
1656 BUG_ON(pgdat->first_deferred_pfn > pgdat_end_pfn(pgdat));
1657 pgdat->first_deferred_pfn = ULONG_MAX;
1659 /* Only the highest zone is deferred so find it */
1660 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
1661 zone = pgdat->node_zones + zid;
1662 if (first_init_pfn < zone_end_pfn(zone))
1665 first_init_pfn = max(zone->zone_start_pfn, first_init_pfn);
1668 * Initialize and free pages. We do it in two loops: first we initialize
1669 * struct page, than free to buddy allocator, because while we are
1670 * freeing pages we can access pages that are ahead (computing buddy
1671 * page in __free_one_page()).
1673 for_each_free_mem_pfn_range_in_zone(i, zone, &spfn, &epfn) {
1674 spfn = max_t(unsigned long, first_init_pfn, spfn);
1675 nr_pages += deferred_init_pages(zone, spfn, epfn);
1677 for_each_free_mem_pfn_range_in_zone(i, zone, &spfn, &epfn) {
1678 spfn = max_t(unsigned long, first_init_pfn, spfn);
1679 deferred_free_pages(spfn, epfn);
1681 pgdat_resize_unlock(pgdat, &flags);
1683 /* Sanity check that the next zone really is unpopulated */
1684 WARN_ON(++zid < MAX_NR_ZONES && populated_zone(++zone));
1686 pr_info("node %d initialised, %lu pages in %ums\n",
1687 pgdat->node_id, nr_pages, jiffies_to_msecs(jiffies - start));
1689 pgdat_init_report_one_done();
1694 * If this zone has deferred pages, try to grow it by initializing enough
1695 * deferred pages to satisfy the allocation specified by order, rounded up to
1696 * the nearest PAGES_PER_SECTION boundary. So we're adding memory in increments
1697 * of SECTION_SIZE bytes by initializing struct pages in increments of
1698 * PAGES_PER_SECTION * sizeof(struct page) bytes.
1700 * Return true when zone was grown, otherwise return false. We return true even
1701 * when we grow less than requested, to let the caller decide if there are
1702 * enough pages to satisfy the allocation.
1704 * Note: We use noinline because this function is needed only during boot, and
1705 * it is called from a __ref function _deferred_grow_zone. This way we are
1706 * making sure that it is not inlined into permanent text section.
1708 static noinline bool __init
1709 deferred_grow_zone(struct zone *zone, unsigned int order)
1711 unsigned long nr_pages_needed = ALIGN(1 << order, PAGES_PER_SECTION);
1712 pg_data_t *pgdat = zone->zone_pgdat;
1713 unsigned long nr_pages = 0;
1714 unsigned long first_init_pfn, spfn, epfn, t, flags;
1715 unsigned long first_deferred_pfn = pgdat->first_deferred_pfn;
1718 /* Only the last zone may have deferred pages */
1719 if (zone_end_pfn(zone) != pgdat_end_pfn(pgdat))
1722 pgdat_resize_lock(pgdat, &flags);
1725 * If deferred pages have been initialized while we were waiting for
1726 * the lock, return true, as the zone was grown. The caller will retry
1727 * this zone. We won't return to this function since the caller also
1728 * has this static branch.
1730 if (!static_branch_unlikely(&deferred_pages)) {
1731 pgdat_resize_unlock(pgdat, &flags);
1736 * If someone grew this zone while we were waiting for spinlock, return
1737 * true, as there might be enough pages already.
1739 if (first_deferred_pfn != pgdat->first_deferred_pfn) {
1740 pgdat_resize_unlock(pgdat, &flags);
1744 first_init_pfn = max(zone->zone_start_pfn, first_deferred_pfn);
1746 if (first_init_pfn >= pgdat_end_pfn(pgdat)) {
1747 pgdat_resize_unlock(pgdat, &flags);
1751 for_each_free_mem_pfn_range_in_zone(i, zone, &spfn, &epfn) {
1752 spfn = max_t(unsigned long, first_init_pfn, spfn);
1754 while (spfn < epfn && nr_pages < nr_pages_needed) {
1755 t = ALIGN(spfn + PAGES_PER_SECTION, PAGES_PER_SECTION);
1756 first_deferred_pfn = min(t, epfn);
1757 nr_pages += deferred_init_pages(zone, spfn,
1758 first_deferred_pfn);
1759 spfn = first_deferred_pfn;
1762 if (nr_pages >= nr_pages_needed)
1766 for_each_free_mem_pfn_range_in_zone(i, zone, &spfn, &epfn) {
1767 spfn = max_t(unsigned long, first_init_pfn, spfn);
1768 epfn = min_t(unsigned long, first_deferred_pfn, epfn);
1769 deferred_free_pages(spfn, epfn);
1771 if (first_deferred_pfn == epfn)
1774 pgdat->first_deferred_pfn = first_deferred_pfn;
1775 pgdat_resize_unlock(pgdat, &flags);
1777 return nr_pages > 0;
1781 * deferred_grow_zone() is __init, but it is called from
1782 * get_page_from_freelist() during early boot until deferred_pages permanently
1783 * disables this call. This is why we have refdata wrapper to avoid warning,
1784 * and to ensure that the function body gets unloaded.
1787 _deferred_grow_zone(struct zone *zone, unsigned int order)
1789 return deferred_grow_zone(zone, order);
1792 #endif /* CONFIG_DEFERRED_STRUCT_PAGE_INIT */
1794 void __init page_alloc_init_late(void)
1798 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
1801 /* There will be num_node_state(N_MEMORY) threads */
1802 atomic_set(&pgdat_init_n_undone, num_node_state(N_MEMORY));
1803 for_each_node_state(nid, N_MEMORY) {
1804 kthread_run(deferred_init_memmap, NODE_DATA(nid), "pgdatinit%d", nid);
1807 /* Block until all are initialised */
1808 wait_for_completion(&pgdat_init_all_done_comp);
1811 * We initialized the rest of the deferred pages. Permanently disable
1812 * on-demand struct page initialization.
1814 static_branch_disable(&deferred_pages);
1816 /* Reinit limits that are based on free pages after the kernel is up */
1817 files_maxfiles_init();
1819 #ifdef CONFIG_ARCH_DISCARD_MEMBLOCK
1820 /* Discard memblock private memory */
1824 for_each_populated_zone(zone)
1825 set_zone_contiguous(zone);
1829 /* Free whole pageblock and set its migration type to MIGRATE_CMA. */
1830 void __init init_cma_reserved_pageblock(struct page *page)
1832 unsigned i = pageblock_nr_pages;
1833 struct page *p = page;
1836 __ClearPageReserved(p);
1837 set_page_count(p, 0);
1840 set_pageblock_migratetype(page, MIGRATE_CMA);
1842 if (pageblock_order >= MAX_ORDER) {
1843 i = pageblock_nr_pages;
1846 set_page_refcounted(p);
1847 __free_pages(p, MAX_ORDER - 1);
1848 p += MAX_ORDER_NR_PAGES;
1849 } while (i -= MAX_ORDER_NR_PAGES);
1851 set_page_refcounted(page);
1852 __free_pages(page, pageblock_order);
1855 adjust_managed_page_count(page, pageblock_nr_pages);
1860 * The order of subdivision here is critical for the IO subsystem.
1861 * Please do not alter this order without good reasons and regression
1862 * testing. Specifically, as large blocks of memory are subdivided,
1863 * the order in which smaller blocks are delivered depends on the order
1864 * they're subdivided in this function. This is the primary factor
1865 * influencing the order in which pages are delivered to the IO
1866 * subsystem according to empirical testing, and this is also justified
1867 * by considering the behavior of a buddy system containing a single
1868 * large block of memory acted on by a series of small allocations.
1869 * This behavior is a critical factor in sglist merging's success.
1873 static inline void expand(struct zone *zone, struct page *page,
1874 int low, int high, struct free_area *area,
1877 unsigned long size = 1 << high;
1879 while (high > low) {
1883 VM_BUG_ON_PAGE(bad_range(zone, &page[size]), &page[size]);
1886 * Mark as guard pages (or page), that will allow to
1887 * merge back to allocator when buddy will be freed.
1888 * Corresponding page table entries will not be touched,
1889 * pages will stay not present in virtual address space
1891 if (set_page_guard(zone, &page[size], high, migratetype))
1894 list_add(&page[size].lru, &area->free_list[migratetype]);
1896 set_page_order(&page[size], high);
1900 static void check_new_page_bad(struct page *page)
1902 const char *bad_reason = NULL;
1903 unsigned long bad_flags = 0;
1905 if (unlikely(atomic_read(&page->_mapcount) != -1))
1906 bad_reason = "nonzero mapcount";
1907 if (unlikely(page->mapping != NULL))
1908 bad_reason = "non-NULL mapping";
1909 if (unlikely(page_ref_count(page) != 0))
1910 bad_reason = "nonzero _count";
1911 if (unlikely(page->flags & __PG_HWPOISON)) {
1912 bad_reason = "HWPoisoned (hardware-corrupted)";
1913 bad_flags = __PG_HWPOISON;
1914 /* Don't complain about hwpoisoned pages */
1915 page_mapcount_reset(page); /* remove PageBuddy */
1918 if (unlikely(page->flags & PAGE_FLAGS_CHECK_AT_PREP)) {
1919 bad_reason = "PAGE_FLAGS_CHECK_AT_PREP flag set";
1920 bad_flags = PAGE_FLAGS_CHECK_AT_PREP;
1923 if (unlikely(page->mem_cgroup))
1924 bad_reason = "page still charged to cgroup";
1926 bad_page(page, bad_reason, bad_flags);
1930 * This page is about to be returned from the page allocator
1932 static inline int check_new_page(struct page *page)
1934 if (likely(page_expected_state(page,
1935 PAGE_FLAGS_CHECK_AT_PREP|__PG_HWPOISON)))
1938 check_new_page_bad(page);
1942 static inline bool free_pages_prezeroed(void)
1944 return IS_ENABLED(CONFIG_PAGE_POISONING_ZERO) &&
1945 page_poisoning_enabled();
1948 #ifdef CONFIG_DEBUG_VM
1949 static bool check_pcp_refill(struct page *page)
1954 static bool check_new_pcp(struct page *page)
1956 return check_new_page(page);
1959 static bool check_pcp_refill(struct page *page)
1961 return check_new_page(page);
1963 static bool check_new_pcp(struct page *page)
1967 #endif /* CONFIG_DEBUG_VM */
1969 static bool check_new_pages(struct page *page, unsigned int order)
1972 for (i = 0; i < (1 << order); i++) {
1973 struct page *p = page + i;
1975 if (unlikely(check_new_page(p)))
1982 inline void post_alloc_hook(struct page *page, unsigned int order,
1985 set_page_private(page, 0);
1986 set_page_refcounted(page);
1988 arch_alloc_page(page, order);
1989 if (debug_pagealloc_enabled())
1990 kernel_map_pages(page, 1 << order, 1);
1991 kasan_alloc_pages(page, order);
1992 kernel_poison_pages(page, 1 << order, 1);
1993 set_page_owner(page, order, gfp_flags);
1996 static void prep_new_page(struct page *page, unsigned int order, gfp_t gfp_flags,
1997 unsigned int alloc_flags)
2001 post_alloc_hook(page, order, gfp_flags);
2003 if (!free_pages_prezeroed() && (gfp_flags & __GFP_ZERO))
2004 for (i = 0; i < (1 << order); i++)
2005 clear_highpage(page + i);
2007 if (order && (gfp_flags & __GFP_COMP))
2008 prep_compound_page(page, order);
2011 * page is set pfmemalloc when ALLOC_NO_WATERMARKS was necessary to
2012 * allocate the page. The expectation is that the caller is taking
2013 * steps that will free more memory. The caller should avoid the page
2014 * being used for !PFMEMALLOC purposes.
2016 if (alloc_flags & ALLOC_NO_WATERMARKS)
2017 set_page_pfmemalloc(page);
2019 clear_page_pfmemalloc(page);
2023 * Go through the free lists for the given migratetype and remove
2024 * the smallest available page from the freelists
2026 static __always_inline
2027 struct page *__rmqueue_smallest(struct zone *zone, unsigned int order,
2030 unsigned int current_order;
2031 struct free_area *area;
2034 /* Find a page of the appropriate size in the preferred list */
2035 for (current_order = order; current_order < MAX_ORDER; ++current_order) {
2036 area = &(zone->free_area[current_order]);
2037 page = list_first_entry_or_null(&area->free_list[migratetype],
2041 list_del(&page->lru);
2042 rmv_page_order(page);
2044 expand(zone, page, order, current_order, area, migratetype);
2045 set_pcppage_migratetype(page, migratetype);
2054 * This array describes the order lists are fallen back to when
2055 * the free lists for the desirable migrate type are depleted
2057 static int fallbacks[MIGRATE_TYPES][4] = {
2058 [MIGRATE_UNMOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_MOVABLE, MIGRATE_TYPES },
2059 [MIGRATE_MOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_UNMOVABLE, MIGRATE_TYPES },
2060 [MIGRATE_RECLAIMABLE] = { MIGRATE_UNMOVABLE, MIGRATE_MOVABLE, MIGRATE_TYPES },
2062 [MIGRATE_CMA] = { MIGRATE_TYPES }, /* Never used */
2064 #ifdef CONFIG_MEMORY_ISOLATION
2065 [MIGRATE_ISOLATE] = { MIGRATE_TYPES }, /* Never used */
2070 static __always_inline struct page *__rmqueue_cma_fallback(struct zone *zone,
2073 return __rmqueue_smallest(zone, order, MIGRATE_CMA);
2076 static inline struct page *__rmqueue_cma_fallback(struct zone *zone,
2077 unsigned int order) { return NULL; }
2081 * Move the free pages in a range to the free lists of the requested type.
2082 * Note that start_page and end_pages are not aligned on a pageblock
2083 * boundary. If alignment is required, use move_freepages_block()
2085 static int move_freepages(struct zone *zone,
2086 struct page *start_page, struct page *end_page,
2087 int migratetype, int *num_movable)
2091 int pages_moved = 0;
2093 #ifndef CONFIG_HOLES_IN_ZONE
2095 * page_zone is not safe to call in this context when
2096 * CONFIG_HOLES_IN_ZONE is set. This bug check is probably redundant
2097 * anyway as we check zone boundaries in move_freepages_block().
2098 * Remove at a later date when no bug reports exist related to
2099 * grouping pages by mobility
2101 VM_BUG_ON(pfn_valid(page_to_pfn(start_page)) &&
2102 pfn_valid(page_to_pfn(end_page)) &&
2103 page_zone(start_page) != page_zone(end_page));
2105 for (page = start_page; page <= end_page;) {
2106 if (!pfn_valid_within(page_to_pfn(page))) {
2111 /* Make sure we are not inadvertently changing nodes */
2112 VM_BUG_ON_PAGE(page_to_nid(page) != zone_to_nid(zone), page);
2114 if (!PageBuddy(page)) {
2116 * We assume that pages that could be isolated for
2117 * migration are movable. But we don't actually try
2118 * isolating, as that would be expensive.
2121 (PageLRU(page) || __PageMovable(page)))
2128 order = page_order(page);
2129 list_move(&page->lru,
2130 &zone->free_area[order].free_list[migratetype]);
2132 pages_moved += 1 << order;
2138 int move_freepages_block(struct zone *zone, struct page *page,
2139 int migratetype, int *num_movable)
2141 unsigned long start_pfn, end_pfn;
2142 struct page *start_page, *end_page;
2147 start_pfn = page_to_pfn(page);
2148 start_pfn = start_pfn & ~(pageblock_nr_pages-1);
2149 start_page = pfn_to_page(start_pfn);
2150 end_page = start_page + pageblock_nr_pages - 1;
2151 end_pfn = start_pfn + pageblock_nr_pages - 1;
2153 /* Do not cross zone boundaries */
2154 if (!zone_spans_pfn(zone, start_pfn))
2156 if (!zone_spans_pfn(zone, end_pfn))
2159 return move_freepages(zone, start_page, end_page, migratetype,
2163 static void change_pageblock_range(struct page *pageblock_page,
2164 int start_order, int migratetype)
2166 int nr_pageblocks = 1 << (start_order - pageblock_order);
2168 while (nr_pageblocks--) {
2169 set_pageblock_migratetype(pageblock_page, migratetype);
2170 pageblock_page += pageblock_nr_pages;
2175 * When we are falling back to another migratetype during allocation, try to
2176 * steal extra free pages from the same pageblocks to satisfy further
2177 * allocations, instead of polluting multiple pageblocks.
2179 * If we are stealing a relatively large buddy page, it is likely there will
2180 * be more free pages in the pageblock, so try to steal them all. For
2181 * reclaimable and unmovable allocations, we steal regardless of page size,
2182 * as fragmentation caused by those allocations polluting movable pageblocks
2183 * is worse than movable allocations stealing from unmovable and reclaimable
2186 static bool can_steal_fallback(unsigned int order, int start_mt)
2189 * Leaving this order check is intended, although there is
2190 * relaxed order check in next check. The reason is that
2191 * we can actually steal whole pageblock if this condition met,
2192 * but, below check doesn't guarantee it and that is just heuristic
2193 * so could be changed anytime.
2195 if (order >= pageblock_order)
2198 if (order >= pageblock_order / 2 ||
2199 start_mt == MIGRATE_RECLAIMABLE ||
2200 start_mt == MIGRATE_UNMOVABLE ||
2201 page_group_by_mobility_disabled)
2207 static inline void boost_watermark(struct zone *zone)
2209 unsigned long max_boost;
2211 if (!watermark_boost_factor)
2214 max_boost = mult_frac(zone->_watermark[WMARK_HIGH],
2215 watermark_boost_factor, 10000);
2218 * high watermark may be uninitialised if fragmentation occurs
2219 * very early in boot so do not boost. We do not fall
2220 * through and boost by pageblock_nr_pages as failing
2221 * allocations that early means that reclaim is not going
2222 * to help and it may even be impossible to reclaim the
2223 * boosted watermark resulting in a hang.
2228 max_boost = max(pageblock_nr_pages, max_boost);
2230 zone->watermark_boost = min(zone->watermark_boost + pageblock_nr_pages,
2235 * This function implements actual steal behaviour. If order is large enough,
2236 * we can steal whole pageblock. If not, we first move freepages in this
2237 * pageblock to our migratetype and determine how many already-allocated pages
2238 * are there in the pageblock with a compatible migratetype. If at least half
2239 * of pages are free or compatible, we can change migratetype of the pageblock
2240 * itself, so pages freed in the future will be put on the correct free list.
2242 static void steal_suitable_fallback(struct zone *zone, struct page *page,
2243 unsigned int alloc_flags, int start_type, bool whole_block)
2245 unsigned int current_order = page_order(page);
2246 struct free_area *area;
2247 int free_pages, movable_pages, alike_pages;
2250 old_block_type = get_pageblock_migratetype(page);
2253 * This can happen due to races and we want to prevent broken
2254 * highatomic accounting.
2256 if (is_migrate_highatomic(old_block_type))
2259 /* Take ownership for orders >= pageblock_order */
2260 if (current_order >= pageblock_order) {
2261 change_pageblock_range(page, current_order, start_type);
2266 * Boost watermarks to increase reclaim pressure to reduce the
2267 * likelihood of future fallbacks. Wake kswapd now as the node
2268 * may be balanced overall and kswapd will not wake naturally.
2270 boost_watermark(zone);
2271 if (alloc_flags & ALLOC_KSWAPD)
2272 set_bit(ZONE_BOOSTED_WATERMARK, &zone->flags);
2274 /* We are not allowed to try stealing from the whole block */
2278 free_pages = move_freepages_block(zone, page, start_type,
2281 * Determine how many pages are compatible with our allocation.
2282 * For movable allocation, it's the number of movable pages which
2283 * we just obtained. For other types it's a bit more tricky.
2285 if (start_type == MIGRATE_MOVABLE) {
2286 alike_pages = movable_pages;
2289 * If we are falling back a RECLAIMABLE or UNMOVABLE allocation
2290 * to MOVABLE pageblock, consider all non-movable pages as
2291 * compatible. If it's UNMOVABLE falling back to RECLAIMABLE or
2292 * vice versa, be conservative since we can't distinguish the
2293 * exact migratetype of non-movable pages.
2295 if (old_block_type == MIGRATE_MOVABLE)
2296 alike_pages = pageblock_nr_pages
2297 - (free_pages + movable_pages);
2302 /* moving whole block can fail due to zone boundary conditions */
2307 * If a sufficient number of pages in the block are either free or of
2308 * comparable migratability as our allocation, claim the whole block.
2310 if (free_pages + alike_pages >= (1 << (pageblock_order-1)) ||
2311 page_group_by_mobility_disabled)
2312 set_pageblock_migratetype(page, start_type);
2317 area = &zone->free_area[current_order];
2318 list_move(&page->lru, &area->free_list[start_type]);
2322 * Check whether there is a suitable fallback freepage with requested order.
2323 * If only_stealable is true, this function returns fallback_mt only if
2324 * we can steal other freepages all together. This would help to reduce
2325 * fragmentation due to mixed migratetype pages in one pageblock.
2327 int find_suitable_fallback(struct free_area *area, unsigned int order,
2328 int migratetype, bool only_stealable, bool *can_steal)
2333 if (area->nr_free == 0)
2338 fallback_mt = fallbacks[migratetype][i];
2339 if (fallback_mt == MIGRATE_TYPES)
2342 if (list_empty(&area->free_list[fallback_mt]))
2345 if (can_steal_fallback(order, migratetype))
2348 if (!only_stealable)
2359 * Reserve a pageblock for exclusive use of high-order atomic allocations if
2360 * there are no empty page blocks that contain a page with a suitable order
2362 static void reserve_highatomic_pageblock(struct page *page, struct zone *zone,
2363 unsigned int alloc_order)
2366 unsigned long max_managed, flags;
2369 * Limit the number reserved to 1 pageblock or roughly 1% of a zone.
2370 * Check is race-prone but harmless.
2372 max_managed = (zone_managed_pages(zone) / 100) + pageblock_nr_pages;
2373 if (zone->nr_reserved_highatomic >= max_managed)
2376 spin_lock_irqsave(&zone->lock, flags);
2378 /* Recheck the nr_reserved_highatomic limit under the lock */
2379 if (zone->nr_reserved_highatomic >= max_managed)
2383 mt = get_pageblock_migratetype(page);
2384 if (!is_migrate_highatomic(mt) && !is_migrate_isolate(mt)
2385 && !is_migrate_cma(mt)) {
2386 zone->nr_reserved_highatomic += pageblock_nr_pages;
2387 set_pageblock_migratetype(page, MIGRATE_HIGHATOMIC);
2388 move_freepages_block(zone, page, MIGRATE_HIGHATOMIC, NULL);
2392 spin_unlock_irqrestore(&zone->lock, flags);
2396 * Used when an allocation is about to fail under memory pressure. This
2397 * potentially hurts the reliability of high-order allocations when under
2398 * intense memory pressure but failed atomic allocations should be easier
2399 * to recover from than an OOM.
2401 * If @force is true, try to unreserve a pageblock even though highatomic
2402 * pageblock is exhausted.
2404 static bool unreserve_highatomic_pageblock(const struct alloc_context *ac,
2407 struct zonelist *zonelist = ac->zonelist;
2408 unsigned long flags;
2415 for_each_zone_zonelist_nodemask(zone, z, zonelist, ac->high_zoneidx,
2418 * Preserve at least one pageblock unless memory pressure
2421 if (!force && zone->nr_reserved_highatomic <=
2425 spin_lock_irqsave(&zone->lock, flags);
2426 for (order = 0; order < MAX_ORDER; order++) {
2427 struct free_area *area = &(zone->free_area[order]);
2429 page = list_first_entry_or_null(
2430 &area->free_list[MIGRATE_HIGHATOMIC],
2436 * In page freeing path, migratetype change is racy so
2437 * we can counter several free pages in a pageblock
2438 * in this loop althoug we changed the pageblock type
2439 * from highatomic to ac->migratetype. So we should
2440 * adjust the count once.
2442 if (is_migrate_highatomic_page(page)) {
2444 * It should never happen but changes to
2445 * locking could inadvertently allow a per-cpu
2446 * drain to add pages to MIGRATE_HIGHATOMIC
2447 * while unreserving so be safe and watch for
2450 zone->nr_reserved_highatomic -= min(
2452 zone->nr_reserved_highatomic);
2456 * Convert to ac->migratetype and avoid the normal
2457 * pageblock stealing heuristics. Minimally, the caller
2458 * is doing the work and needs the pages. More
2459 * importantly, if the block was always converted to
2460 * MIGRATE_UNMOVABLE or another type then the number
2461 * of pageblocks that cannot be completely freed
2464 set_pageblock_migratetype(page, ac->migratetype);
2465 ret = move_freepages_block(zone, page, ac->migratetype,
2468 spin_unlock_irqrestore(&zone->lock, flags);
2472 spin_unlock_irqrestore(&zone->lock, flags);
2479 * Try finding a free buddy page on the fallback list and put it on the free
2480 * list of requested migratetype, possibly along with other pages from the same
2481 * block, depending on fragmentation avoidance heuristics. Returns true if
2482 * fallback was found so that __rmqueue_smallest() can grab it.
2484 * The use of signed ints for order and current_order is a deliberate
2485 * deviation from the rest of this file, to make the for loop
2486 * condition simpler.
2488 static __always_inline bool
2489 __rmqueue_fallback(struct zone *zone, int order, int start_migratetype,
2490 unsigned int alloc_flags)
2492 struct free_area *area;
2494 int min_order = order;
2500 * Do not steal pages from freelists belonging to other pageblocks
2501 * i.e. orders < pageblock_order. If there are no local zones free,
2502 * the zonelists will be reiterated without ALLOC_NOFRAGMENT.
2504 if (alloc_flags & ALLOC_NOFRAGMENT)
2505 min_order = pageblock_order;
2508 * Find the largest available free page in the other list. This roughly
2509 * approximates finding the pageblock with the most free pages, which
2510 * would be too costly to do exactly.
2512 for (current_order = MAX_ORDER - 1; current_order >= min_order;
2514 area = &(zone->free_area[current_order]);
2515 fallback_mt = find_suitable_fallback(area, current_order,
2516 start_migratetype, false, &can_steal);
2517 if (fallback_mt == -1)
2521 * We cannot steal all free pages from the pageblock and the
2522 * requested migratetype is movable. In that case it's better to
2523 * steal and split the smallest available page instead of the
2524 * largest available page, because even if the next movable
2525 * allocation falls back into a different pageblock than this
2526 * one, it won't cause permanent fragmentation.
2528 if (!can_steal && start_migratetype == MIGRATE_MOVABLE
2529 && current_order > order)
2538 for (current_order = order; current_order < MAX_ORDER;
2540 area = &(zone->free_area[current_order]);
2541 fallback_mt = find_suitable_fallback(area, current_order,
2542 start_migratetype, false, &can_steal);
2543 if (fallback_mt != -1)
2548 * This should not happen - we already found a suitable fallback
2549 * when looking for the largest page.
2551 VM_BUG_ON(current_order == MAX_ORDER);
2554 page = list_first_entry(&area->free_list[fallback_mt],
2557 steal_suitable_fallback(zone, page, alloc_flags, start_migratetype,
2560 trace_mm_page_alloc_extfrag(page, order, current_order,
2561 start_migratetype, fallback_mt);
2568 * Do the hard work of removing an element from the buddy allocator.
2569 * Call me with the zone->lock already held.
2571 static __always_inline struct page *
2572 __rmqueue(struct zone *zone, unsigned int order, int migratetype,
2573 unsigned int alloc_flags)
2578 page = __rmqueue_smallest(zone, order, migratetype);
2579 if (unlikely(!page)) {
2580 if (migratetype == MIGRATE_MOVABLE)
2581 page = __rmqueue_cma_fallback(zone, order);
2583 if (!page && __rmqueue_fallback(zone, order, migratetype,
2588 trace_mm_page_alloc_zone_locked(page, order, migratetype);
2593 * Obtain a specified number of elements from the buddy allocator, all under
2594 * a single hold of the lock, for efficiency. Add them to the supplied list.
2595 * Returns the number of new pages which were placed at *list.
2597 static int rmqueue_bulk(struct zone *zone, unsigned int order,
2598 unsigned long count, struct list_head *list,
2599 int migratetype, unsigned int alloc_flags)
2603 spin_lock(&zone->lock);
2604 for (i = 0; i < count; ++i) {
2605 struct page *page = __rmqueue(zone, order, migratetype,
2607 if (unlikely(page == NULL))
2610 if (unlikely(check_pcp_refill(page)))
2614 * Split buddy pages returned by expand() are received here in
2615 * physical page order. The page is added to the tail of
2616 * caller's list. From the callers perspective, the linked list
2617 * is ordered by page number under some conditions. This is
2618 * useful for IO devices that can forward direction from the
2619 * head, thus also in the physical page order. This is useful
2620 * for IO devices that can merge IO requests if the physical
2621 * pages are ordered properly.
2623 list_add_tail(&page->lru, list);
2625 if (is_migrate_cma(get_pcppage_migratetype(page)))
2626 __mod_zone_page_state(zone, NR_FREE_CMA_PAGES,
2631 * i pages were removed from the buddy list even if some leak due
2632 * to check_pcp_refill failing so adjust NR_FREE_PAGES based
2633 * on i. Do not confuse with 'alloced' which is the number of
2634 * pages added to the pcp list.
2636 __mod_zone_page_state(zone, NR_FREE_PAGES, -(i << order));
2637 spin_unlock(&zone->lock);
2643 * Called from the vmstat counter updater to drain pagesets of this
2644 * currently executing processor on remote nodes after they have
2647 * Note that this function must be called with the thread pinned to
2648 * a single processor.
2650 void drain_zone_pages(struct zone *zone, struct per_cpu_pages *pcp)
2652 unsigned long flags;
2653 int to_drain, batch;
2655 local_irq_save(flags);
2656 batch = READ_ONCE(pcp->batch);
2657 to_drain = min(pcp->count, batch);
2659 free_pcppages_bulk(zone, to_drain, pcp);
2660 local_irq_restore(flags);
2665 * Drain pcplists of the indicated processor and zone.
2667 * The processor must either be the current processor and the
2668 * thread pinned to the current processor or a processor that
2671 static void drain_pages_zone(unsigned int cpu, struct zone *zone)
2673 unsigned long flags;
2674 struct per_cpu_pageset *pset;
2675 struct per_cpu_pages *pcp;
2677 local_irq_save(flags);
2678 pset = per_cpu_ptr(zone->pageset, cpu);
2682 free_pcppages_bulk(zone, pcp->count, pcp);
2683 local_irq_restore(flags);
2687 * Drain pcplists of all zones on the indicated processor.
2689 * The processor must either be the current processor and the
2690 * thread pinned to the current processor or a processor that
2693 static void drain_pages(unsigned int cpu)
2697 for_each_populated_zone(zone) {
2698 drain_pages_zone(cpu, zone);
2703 * Spill all of this CPU's per-cpu pages back into the buddy allocator.
2705 * The CPU has to be pinned. When zone parameter is non-NULL, spill just
2706 * the single zone's pages.
2708 void drain_local_pages(struct zone *zone)
2710 int cpu = smp_processor_id();
2713 drain_pages_zone(cpu, zone);
2718 static void drain_local_pages_wq(struct work_struct *work)
2720 struct pcpu_drain *drain;
2722 drain = container_of(work, struct pcpu_drain, work);
2725 * drain_all_pages doesn't use proper cpu hotplug protection so
2726 * we can race with cpu offline when the WQ can move this from
2727 * a cpu pinned worker to an unbound one. We can operate on a different
2728 * cpu which is allright but we also have to make sure to not move to
2732 drain_local_pages(drain->zone);
2737 * Spill all the per-cpu pages from all CPUs back into the buddy allocator.
2739 * When zone parameter is non-NULL, spill just the single zone's pages.
2741 * Note that this can be extremely slow as the draining happens in a workqueue.
2743 void drain_all_pages(struct zone *zone)
2748 * Allocate in the BSS so we wont require allocation in
2749 * direct reclaim path for CONFIG_CPUMASK_OFFSTACK=y
2751 static cpumask_t cpus_with_pcps;
2754 * Make sure nobody triggers this path before mm_percpu_wq is fully
2757 if (WARN_ON_ONCE(!mm_percpu_wq))
2761 * Do not drain if one is already in progress unless it's specific to
2762 * a zone. Such callers are primarily CMA and memory hotplug and need
2763 * the drain to be complete when the call returns.
2765 if (unlikely(!mutex_trylock(&pcpu_drain_mutex))) {
2768 mutex_lock(&pcpu_drain_mutex);
2772 * We don't care about racing with CPU hotplug event
2773 * as offline notification will cause the notified
2774 * cpu to drain that CPU pcps and on_each_cpu_mask
2775 * disables preemption as part of its processing
2777 for_each_online_cpu(cpu) {
2778 struct per_cpu_pageset *pcp;
2780 bool has_pcps = false;
2783 pcp = per_cpu_ptr(zone->pageset, cpu);
2787 for_each_populated_zone(z) {
2788 pcp = per_cpu_ptr(z->pageset, cpu);
2789 if (pcp->pcp.count) {
2797 cpumask_set_cpu(cpu, &cpus_with_pcps);
2799 cpumask_clear_cpu(cpu, &cpus_with_pcps);
2802 for_each_cpu(cpu, &cpus_with_pcps) {
2803 struct pcpu_drain *drain = per_cpu_ptr(&pcpu_drain, cpu);
2806 INIT_WORK(&drain->work, drain_local_pages_wq);
2807 queue_work_on(cpu, mm_percpu_wq, &drain->work);
2809 for_each_cpu(cpu, &cpus_with_pcps)
2810 flush_work(&per_cpu_ptr(&pcpu_drain, cpu)->work);
2812 mutex_unlock(&pcpu_drain_mutex);
2815 #ifdef CONFIG_HIBERNATION
2818 * Touch the watchdog for every WD_PAGE_COUNT pages.
2820 #define WD_PAGE_COUNT (128*1024)
2822 void mark_free_pages(struct zone *zone)
2824 unsigned long pfn, max_zone_pfn, page_count = WD_PAGE_COUNT;
2825 unsigned long flags;
2826 unsigned int order, t;
2829 if (zone_is_empty(zone))
2832 spin_lock_irqsave(&zone->lock, flags);
2834 max_zone_pfn = zone_end_pfn(zone);
2835 for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
2836 if (pfn_valid(pfn)) {
2837 page = pfn_to_page(pfn);
2839 if (!--page_count) {
2840 touch_nmi_watchdog();
2841 page_count = WD_PAGE_COUNT;
2844 if (page_zone(page) != zone)
2847 if (!swsusp_page_is_forbidden(page))
2848 swsusp_unset_page_free(page);
2851 for_each_migratetype_order(order, t) {
2852 list_for_each_entry(page,
2853 &zone->free_area[order].free_list[t], lru) {
2856 pfn = page_to_pfn(page);
2857 for (i = 0; i < (1UL << order); i++) {
2858 if (!--page_count) {
2859 touch_nmi_watchdog();
2860 page_count = WD_PAGE_COUNT;
2862 swsusp_set_page_free(pfn_to_page(pfn + i));
2866 spin_unlock_irqrestore(&zone->lock, flags);
2868 #endif /* CONFIG_PM */
2870 static bool free_unref_page_prepare(struct page *page, unsigned long pfn)
2874 if (!free_pcp_prepare(page))
2877 migratetype = get_pfnblock_migratetype(page, pfn);
2878 set_pcppage_migratetype(page, migratetype);
2882 static void free_unref_page_commit(struct page *page, unsigned long pfn)
2884 struct zone *zone = page_zone(page);
2885 struct per_cpu_pages *pcp;
2888 migratetype = get_pcppage_migratetype(page);
2889 __count_vm_event(PGFREE);
2892 * We only track unmovable, reclaimable and movable on pcp lists.
2893 * Free ISOLATE pages back to the allocator because they are being
2894 * offlined but treat HIGHATOMIC as movable pages so we can get those
2895 * areas back if necessary. Otherwise, we may have to free
2896 * excessively into the page allocator
2898 if (migratetype >= MIGRATE_PCPTYPES) {
2899 if (unlikely(is_migrate_isolate(migratetype))) {
2900 free_one_page(zone, page, pfn, 0, migratetype);
2903 migratetype = MIGRATE_MOVABLE;
2906 pcp = &this_cpu_ptr(zone->pageset)->pcp;
2907 list_add(&page->lru, &pcp->lists[migratetype]);
2909 if (pcp->count >= pcp->high) {
2910 unsigned long batch = READ_ONCE(pcp->batch);
2911 free_pcppages_bulk(zone, batch, pcp);
2916 * Free a 0-order page
2918 void free_unref_page(struct page *page)
2920 unsigned long flags;
2921 unsigned long pfn = page_to_pfn(page);
2923 if (!free_unref_page_prepare(page, pfn))
2926 local_irq_save(flags);
2927 free_unref_page_commit(page, pfn);
2928 local_irq_restore(flags);
2932 * Free a list of 0-order pages
2934 void free_unref_page_list(struct list_head *list)
2936 struct page *page, *next;
2937 unsigned long flags, pfn;
2938 int batch_count = 0;
2940 /* Prepare pages for freeing */
2941 list_for_each_entry_safe(page, next, list, lru) {
2942 pfn = page_to_pfn(page);
2943 if (!free_unref_page_prepare(page, pfn))
2944 list_del(&page->lru);
2945 set_page_private(page, pfn);
2948 local_irq_save(flags);
2949 list_for_each_entry_safe(page, next, list, lru) {
2950 unsigned long pfn = page_private(page);
2952 set_page_private(page, 0);
2953 trace_mm_page_free_batched(page);
2954 free_unref_page_commit(page, pfn);
2957 * Guard against excessive IRQ disabled times when we get
2958 * a large list of pages to free.
2960 if (++batch_count == SWAP_CLUSTER_MAX) {
2961 local_irq_restore(flags);
2963 local_irq_save(flags);
2966 local_irq_restore(flags);
2970 * split_page takes a non-compound higher-order page, and splits it into
2971 * n (1<<order) sub-pages: page[0..n]
2972 * Each sub-page must be freed individually.
2974 * Note: this is probably too low level an operation for use in drivers.
2975 * Please consult with lkml before using this in your driver.
2977 void split_page(struct page *page, unsigned int order)
2981 VM_BUG_ON_PAGE(PageCompound(page), page);
2982 VM_BUG_ON_PAGE(!page_count(page), page);
2984 for (i = 1; i < (1 << order); i++)
2985 set_page_refcounted(page + i);
2986 split_page_owner(page, order);
2988 EXPORT_SYMBOL_GPL(split_page);
2990 int __isolate_free_page(struct page *page, unsigned int order)
2992 unsigned long watermark;
2996 BUG_ON(!PageBuddy(page));
2998 zone = page_zone(page);
2999 mt = get_pageblock_migratetype(page);
3001 if (!is_migrate_isolate(mt)) {
3003 * Obey watermarks as if the page was being allocated. We can
3004 * emulate a high-order watermark check with a raised order-0
3005 * watermark, because we already know our high-order page
3008 watermark = zone->_watermark[WMARK_MIN] + (1UL << order);
3009 if (!zone_watermark_ok(zone, 0, watermark, 0, ALLOC_CMA))
3012 __mod_zone_freepage_state(zone, -(1UL << order), mt);
3015 /* Remove page from free list */
3016 list_del(&page->lru);
3017 zone->free_area[order].nr_free--;
3018 rmv_page_order(page);
3021 * Set the pageblock if the isolated page is at least half of a
3024 if (order >= pageblock_order - 1) {
3025 struct page *endpage = page + (1 << order) - 1;
3026 for (; page < endpage; page += pageblock_nr_pages) {
3027 int mt = get_pageblock_migratetype(page);
3028 if (!is_migrate_isolate(mt) && !is_migrate_cma(mt)
3029 && !is_migrate_highatomic(mt))
3030 set_pageblock_migratetype(page,
3036 return 1UL << order;
3040 * Update NUMA hit/miss statistics
3042 * Must be called with interrupts disabled.
3044 static inline void zone_statistics(struct zone *preferred_zone, struct zone *z)
3047 enum numa_stat_item local_stat = NUMA_LOCAL;
3049 /* skip numa counters update if numa stats is disabled */
3050 if (!static_branch_likely(&vm_numa_stat_key))
3053 if (zone_to_nid(z) != numa_node_id())
3054 local_stat = NUMA_OTHER;
3056 if (zone_to_nid(z) == zone_to_nid(preferred_zone))
3057 __inc_numa_state(z, NUMA_HIT);
3059 __inc_numa_state(z, NUMA_MISS);
3060 __inc_numa_state(preferred_zone, NUMA_FOREIGN);
3062 __inc_numa_state(z, local_stat);
3066 /* Remove page from the per-cpu list, caller must protect the list */
3067 static struct page *__rmqueue_pcplist(struct zone *zone, int migratetype,
3068 unsigned int alloc_flags,
3069 struct per_cpu_pages *pcp,
3070 struct list_head *list)
3075 if (list_empty(list)) {
3076 pcp->count += rmqueue_bulk(zone, 0,
3078 migratetype, alloc_flags);
3079 if (unlikely(list_empty(list)))
3083 page = list_first_entry(list, struct page, lru);
3084 list_del(&page->lru);
3086 } while (check_new_pcp(page));
3091 /* Lock and remove page from the per-cpu list */
3092 static struct page *rmqueue_pcplist(struct zone *preferred_zone,
3093 struct zone *zone, unsigned int order,
3094 gfp_t gfp_flags, int migratetype,
3095 unsigned int alloc_flags)
3097 struct per_cpu_pages *pcp;
3098 struct list_head *list;
3100 unsigned long flags;
3102 local_irq_save(flags);
3103 pcp = &this_cpu_ptr(zone->pageset)->pcp;
3104 list = &pcp->lists[migratetype];
3105 page = __rmqueue_pcplist(zone, migratetype, alloc_flags, pcp, list);
3107 __count_zid_vm_events(PGALLOC, page_zonenum(page), 1 << order);
3108 zone_statistics(preferred_zone, zone);
3110 local_irq_restore(flags);
3115 * Allocate a page from the given zone. Use pcplists for order-0 allocations.
3118 struct page *rmqueue(struct zone *preferred_zone,
3119 struct zone *zone, unsigned int order,
3120 gfp_t gfp_flags, unsigned int alloc_flags,
3123 unsigned long flags;
3126 if (likely(order == 0)) {
3127 page = rmqueue_pcplist(preferred_zone, zone, order,
3128 gfp_flags, migratetype, alloc_flags);
3133 * We most definitely don't want callers attempting to
3134 * allocate greater than order-1 page units with __GFP_NOFAIL.
3136 WARN_ON_ONCE((gfp_flags & __GFP_NOFAIL) && (order > 1));
3137 spin_lock_irqsave(&zone->lock, flags);
3141 if (alloc_flags & ALLOC_HARDER) {
3142 page = __rmqueue_smallest(zone, order, MIGRATE_HIGHATOMIC);
3144 trace_mm_page_alloc_zone_locked(page, order, migratetype);
3147 page = __rmqueue(zone, order, migratetype, alloc_flags);
3148 } while (page && check_new_pages(page, order));
3149 spin_unlock(&zone->lock);
3152 __mod_zone_freepage_state(zone, -(1 << order),
3153 get_pcppage_migratetype(page));
3155 __count_zid_vm_events(PGALLOC, page_zonenum(page), 1 << order);
3156 zone_statistics(preferred_zone, zone);
3157 local_irq_restore(flags);
3160 /* Separate test+clear to avoid unnecessary atomics */
3161 if (test_bit(ZONE_BOOSTED_WATERMARK, &zone->flags)) {
3162 clear_bit(ZONE_BOOSTED_WATERMARK, &zone->flags);
3163 wakeup_kswapd(zone, 0, 0, zone_idx(zone));
3166 VM_BUG_ON_PAGE(page && bad_range(zone, page), page);
3170 local_irq_restore(flags);
3174 #ifdef CONFIG_FAIL_PAGE_ALLOC
3177 struct fault_attr attr;
3179 bool ignore_gfp_highmem;
3180 bool ignore_gfp_reclaim;
3182 } fail_page_alloc = {
3183 .attr = FAULT_ATTR_INITIALIZER,
3184 .ignore_gfp_reclaim = true,
3185 .ignore_gfp_highmem = true,
3189 static int __init setup_fail_page_alloc(char *str)
3191 return setup_fault_attr(&fail_page_alloc.attr, str);
3193 __setup("fail_page_alloc=", setup_fail_page_alloc);
3195 static bool __should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
3197 if (order < fail_page_alloc.min_order)
3199 if (gfp_mask & __GFP_NOFAIL)
3201 if (fail_page_alloc.ignore_gfp_highmem && (gfp_mask & __GFP_HIGHMEM))
3203 if (fail_page_alloc.ignore_gfp_reclaim &&
3204 (gfp_mask & __GFP_DIRECT_RECLAIM))
3207 return should_fail(&fail_page_alloc.attr, 1 << order);
3210 #ifdef CONFIG_FAULT_INJECTION_DEBUG_FS
3212 static int __init fail_page_alloc_debugfs(void)
3214 umode_t mode = S_IFREG | 0600;
3217 dir = fault_create_debugfs_attr("fail_page_alloc", NULL,
3218 &fail_page_alloc.attr);
3220 debugfs_create_bool("ignore-gfp-wait", mode, dir,
3221 &fail_page_alloc.ignore_gfp_reclaim);
3222 debugfs_create_bool("ignore-gfp-highmem", mode, dir,
3223 &fail_page_alloc.ignore_gfp_highmem);
3224 debugfs_create_u32("min-order", mode, dir, &fail_page_alloc.min_order);
3229 late_initcall(fail_page_alloc_debugfs);
3231 #endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */
3233 #else /* CONFIG_FAIL_PAGE_ALLOC */
3235 static inline bool __should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
3240 #endif /* CONFIG_FAIL_PAGE_ALLOC */
3242 static noinline bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
3244 return __should_fail_alloc_page(gfp_mask, order);
3246 ALLOW_ERROR_INJECTION(should_fail_alloc_page, TRUE);
3249 * Return true if free base pages are above 'mark'. For high-order checks it
3250 * will return true of the order-0 watermark is reached and there is at least
3251 * one free page of a suitable size. Checking now avoids taking the zone lock
3252 * to check in the allocation paths if no pages are free.
3254 bool __zone_watermark_ok(struct zone *z, unsigned int order, unsigned long mark,
3255 int classzone_idx, unsigned int alloc_flags,
3260 const bool alloc_harder = (alloc_flags & (ALLOC_HARDER|ALLOC_OOM));
3262 /* free_pages may go negative - that's OK */
3263 free_pages -= (1 << order) - 1;
3265 if (alloc_flags & ALLOC_HIGH)
3269 * If the caller does not have rights to ALLOC_HARDER then subtract
3270 * the high-atomic reserves. This will over-estimate the size of the
3271 * atomic reserve but it avoids a search.
3273 if (likely(!alloc_harder)) {
3274 free_pages -= z->nr_reserved_highatomic;
3277 * OOM victims can try even harder than normal ALLOC_HARDER
3278 * users on the grounds that it's definitely going to be in
3279 * the exit path shortly and free memory. Any allocation it
3280 * makes during the free path will be small and short-lived.
3282 if (alloc_flags & ALLOC_OOM)
3290 /* If allocation can't use CMA areas don't use free CMA pages */
3291 if (!(alloc_flags & ALLOC_CMA))
3292 free_pages -= zone_page_state(z, NR_FREE_CMA_PAGES);
3296 * Check watermarks for an order-0 allocation request. If these
3297 * are not met, then a high-order request also cannot go ahead
3298 * even if a suitable page happened to be free.
3300 if (free_pages <= min + z->lowmem_reserve[classzone_idx])
3303 /* If this is an order-0 request then the watermark is fine */
3307 /* For a high-order request, check at least one suitable page is free */
3308 for (o = order; o < MAX_ORDER; o++) {
3309 struct free_area *area = &z->free_area[o];
3315 for (mt = 0; mt < MIGRATE_PCPTYPES; mt++) {
3316 if (!list_empty(&area->free_list[mt]))
3321 if ((alloc_flags & ALLOC_CMA) &&
3322 !list_empty(&area->free_list[MIGRATE_CMA])) {
3327 !list_empty(&area->free_list[MIGRATE_HIGHATOMIC]))
3333 bool zone_watermark_ok(struct zone *z, unsigned int order, unsigned long mark,
3334 int classzone_idx, unsigned int alloc_flags)
3336 return __zone_watermark_ok(z, order, mark, classzone_idx, alloc_flags,
3337 zone_page_state(z, NR_FREE_PAGES));
3340 static inline bool zone_watermark_fast(struct zone *z, unsigned int order,
3341 unsigned long mark, int classzone_idx, unsigned int alloc_flags)
3343 long free_pages = zone_page_state(z, NR_FREE_PAGES);
3347 /* If allocation can't use CMA areas don't use free CMA pages */
3348 if (!(alloc_flags & ALLOC_CMA))
3349 cma_pages = zone_page_state(z, NR_FREE_CMA_PAGES);
3353 * Fast check for order-0 only. If this fails then the reserves
3354 * need to be calculated. There is a corner case where the check
3355 * passes but only the high-order atomic reserve are free. If
3356 * the caller is !atomic then it'll uselessly search the free
3357 * list. That corner case is then slower but it is harmless.
3359 if (!order && (free_pages - cma_pages) > mark + z->lowmem_reserve[classzone_idx])
3362 return __zone_watermark_ok(z, order, mark, classzone_idx, alloc_flags,
3366 bool zone_watermark_ok_safe(struct zone *z, unsigned int order,
3367 unsigned long mark, int classzone_idx)
3369 long free_pages = zone_page_state(z, NR_FREE_PAGES);
3371 if (z->percpu_drift_mark && free_pages < z->percpu_drift_mark)
3372 free_pages = zone_page_state_snapshot(z, NR_FREE_PAGES);
3374 return __zone_watermark_ok(z, order, mark, classzone_idx, 0,
3379 static bool zone_allows_reclaim(struct zone *local_zone, struct zone *zone)
3381 return node_distance(zone_to_nid(local_zone), zone_to_nid(zone)) <=
3384 #else /* CONFIG_NUMA */
3385 static bool zone_allows_reclaim(struct zone *local_zone, struct zone *zone)
3389 #endif /* CONFIG_NUMA */
3392 * The restriction on ZONE_DMA32 as being a suitable zone to use to avoid
3393 * fragmentation is subtle. If the preferred zone was HIGHMEM then
3394 * premature use of a lower zone may cause lowmem pressure problems that
3395 * are worse than fragmentation. If the next zone is ZONE_DMA then it is
3396 * probably too small. It only makes sense to spread allocations to avoid
3397 * fragmentation between the Normal and DMA32 zones.
3399 static inline unsigned int
3400 alloc_flags_nofragment(struct zone *zone, gfp_t gfp_mask)
3402 unsigned int alloc_flags = 0;
3404 if (gfp_mask & __GFP_KSWAPD_RECLAIM)
3405 alloc_flags |= ALLOC_KSWAPD;
3407 #ifdef CONFIG_ZONE_DMA32
3411 if (zone_idx(zone) != ZONE_NORMAL)
3415 * If ZONE_DMA32 exists, assume it is the one after ZONE_NORMAL and
3416 * the pointer is within zone->zone_pgdat->node_zones[]. Also assume
3417 * on UMA that if Normal is populated then so is DMA32.
3419 BUILD_BUG_ON(ZONE_NORMAL - ZONE_DMA32 != 1);
3420 if (nr_online_nodes > 1 && !populated_zone(--zone))
3423 alloc_flags |= ALLOC_NOFRAGMENT;
3424 #endif /* CONFIG_ZONE_DMA32 */
3429 * get_page_from_freelist goes through the zonelist trying to allocate
3432 static struct page *
3433 get_page_from_freelist(gfp_t gfp_mask, unsigned int order, int alloc_flags,
3434 const struct alloc_context *ac)
3438 struct pglist_data *last_pgdat_dirty_limit = NULL;
3443 * Scan zonelist, looking for a zone with enough free.
3444 * See also __cpuset_node_allowed() comment in kernel/cpuset.c.
3446 no_fallback = alloc_flags & ALLOC_NOFRAGMENT;
3447 z = ac->preferred_zoneref;
3448 for_next_zone_zonelist_nodemask(zone, z, ac->zonelist, ac->high_zoneidx,
3453 if (cpusets_enabled() &&
3454 (alloc_flags & ALLOC_CPUSET) &&
3455 !__cpuset_zone_allowed(zone, gfp_mask))
3458 * When allocating a page cache page for writing, we
3459 * want to get it from a node that is within its dirty
3460 * limit, such that no single node holds more than its
3461 * proportional share of globally allowed dirty pages.
3462 * The dirty limits take into account the node's
3463 * lowmem reserves and high watermark so that kswapd
3464 * should be able to balance it without having to
3465 * write pages from its LRU list.
3467 * XXX: For now, allow allocations to potentially
3468 * exceed the per-node dirty limit in the slowpath
3469 * (spread_dirty_pages unset) before going into reclaim,
3470 * which is important when on a NUMA setup the allowed
3471 * nodes are together not big enough to reach the
3472 * global limit. The proper fix for these situations
3473 * will require awareness of nodes in the
3474 * dirty-throttling and the flusher threads.
3476 if (ac->spread_dirty_pages) {
3477 if (last_pgdat_dirty_limit == zone->zone_pgdat)
3480 if (!node_dirty_ok(zone->zone_pgdat)) {
3481 last_pgdat_dirty_limit = zone->zone_pgdat;
3486 if (no_fallback && nr_online_nodes > 1 &&
3487 zone != ac->preferred_zoneref->zone) {
3491 * If moving to a remote node, retry but allow
3492 * fragmenting fallbacks. Locality is more important
3493 * than fragmentation avoidance.
3495 local_nid = zone_to_nid(ac->preferred_zoneref->zone);
3496 if (zone_to_nid(zone) != local_nid) {
3497 alloc_flags &= ~ALLOC_NOFRAGMENT;
3502 mark = wmark_pages(zone, alloc_flags & ALLOC_WMARK_MASK);
3503 if (!zone_watermark_fast(zone, order, mark,
3504 ac_classzone_idx(ac), alloc_flags)) {
3507 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
3509 * Watermark failed for this zone, but see if we can
3510 * grow this zone if it contains deferred pages.
3512 if (static_branch_unlikely(&deferred_pages)) {
3513 if (_deferred_grow_zone(zone, order))
3517 /* Checked here to keep the fast path fast */
3518 BUILD_BUG_ON(ALLOC_NO_WATERMARKS < NR_WMARK);
3519 if (alloc_flags & ALLOC_NO_WATERMARKS)
3522 if (node_reclaim_mode == 0 ||
3523 !zone_allows_reclaim(ac->preferred_zoneref->zone, zone))
3526 ret = node_reclaim(zone->zone_pgdat, gfp_mask, order);
3528 case NODE_RECLAIM_NOSCAN:
3531 case NODE_RECLAIM_FULL:
3532 /* scanned but unreclaimable */
3535 /* did we reclaim enough */
3536 if (zone_watermark_ok(zone, order, mark,
3537 ac_classzone_idx(ac), alloc_flags))
3545 page = rmqueue(ac->preferred_zoneref->zone, zone, order,
3546 gfp_mask, alloc_flags, ac->migratetype);
3548 prep_new_page(page, order, gfp_mask, alloc_flags);
3551 * If this is a high-order atomic allocation then check
3552 * if the pageblock should be reserved for the future
3554 if (unlikely(order && (alloc_flags & ALLOC_HARDER)))
3555 reserve_highatomic_pageblock(page, zone, order);
3559 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
3560 /* Try again if zone has deferred pages */
3561 if (static_branch_unlikely(&deferred_pages)) {
3562 if (_deferred_grow_zone(zone, order))
3570 * It's possible on a UMA machine to get through all zones that are
3571 * fragmented. If avoiding fragmentation, reset and try again.
3574 alloc_flags &= ~ALLOC_NOFRAGMENT;
3581 static void warn_alloc_show_mem(gfp_t gfp_mask, nodemask_t *nodemask)
3583 unsigned int filter = SHOW_MEM_FILTER_NODES;
3584 static DEFINE_RATELIMIT_STATE(show_mem_rs, HZ, 1);
3586 if (!__ratelimit(&show_mem_rs))
3590 * This documents exceptions given to allocations in certain
3591 * contexts that are allowed to allocate outside current's set
3594 if (!(gfp_mask & __GFP_NOMEMALLOC))
3595 if (tsk_is_oom_victim(current) ||
3596 (current->flags & (PF_MEMALLOC | PF_EXITING)))
3597 filter &= ~SHOW_MEM_FILTER_NODES;
3598 if (in_interrupt() || !(gfp_mask & __GFP_DIRECT_RECLAIM))
3599 filter &= ~SHOW_MEM_FILTER_NODES;
3601 show_mem(filter, nodemask);
3604 void warn_alloc(gfp_t gfp_mask, nodemask_t *nodemask, const char *fmt, ...)
3606 struct va_format vaf;
3608 static DEFINE_RATELIMIT_STATE(nopage_rs, DEFAULT_RATELIMIT_INTERVAL,
3609 DEFAULT_RATELIMIT_BURST);
3611 if ((gfp_mask & __GFP_NOWARN) || !__ratelimit(&nopage_rs))
3614 va_start(args, fmt);
3617 pr_warn("%s: %pV, mode:%#x(%pGg), nodemask=%*pbl",
3618 current->comm, &vaf, gfp_mask, &gfp_mask,
3619 nodemask_pr_args(nodemask));
3622 cpuset_print_current_mems_allowed();
3625 warn_alloc_show_mem(gfp_mask, nodemask);
3628 static inline struct page *
3629 __alloc_pages_cpuset_fallback(gfp_t gfp_mask, unsigned int order,
3630 unsigned int alloc_flags,
3631 const struct alloc_context *ac)
3635 page = get_page_from_freelist(gfp_mask, order,
3636 alloc_flags|ALLOC_CPUSET, ac);
3638 * fallback to ignore cpuset restriction if our nodes
3642 page = get_page_from_freelist(gfp_mask, order,
3648 static inline struct page *
3649 __alloc_pages_may_oom(gfp_t gfp_mask, unsigned int order,
3650 const struct alloc_context *ac, unsigned long *did_some_progress)
3652 struct oom_control oc = {
3653 .zonelist = ac->zonelist,
3654 .nodemask = ac->nodemask,
3656 .gfp_mask = gfp_mask,
3661 *did_some_progress = 0;
3664 * Acquire the oom lock. If that fails, somebody else is
3665 * making progress for us.
3667 if (!mutex_trylock(&oom_lock)) {
3668 *did_some_progress = 1;
3669 schedule_timeout_uninterruptible(1);
3674 * Go through the zonelist yet one more time, keep very high watermark
3675 * here, this is only to catch a parallel oom killing, we must fail if
3676 * we're still under heavy pressure. But make sure that this reclaim
3677 * attempt shall not depend on __GFP_DIRECT_RECLAIM && !__GFP_NORETRY
3678 * allocation which will never fail due to oom_lock already held.
3680 page = get_page_from_freelist((gfp_mask | __GFP_HARDWALL) &
3681 ~__GFP_DIRECT_RECLAIM, order,
3682 ALLOC_WMARK_HIGH|ALLOC_CPUSET, ac);
3686 /* Coredumps can quickly deplete all memory reserves */
3687 if (current->flags & PF_DUMPCORE)
3689 /* The OOM killer will not help higher order allocs */
3690 if (order > PAGE_ALLOC_COSTLY_ORDER)
3693 * We have already exhausted all our reclaim opportunities without any
3694 * success so it is time to admit defeat. We will skip the OOM killer
3695 * because it is very likely that the caller has a more reasonable
3696 * fallback than shooting a random task.
3698 if (gfp_mask & __GFP_RETRY_MAYFAIL)
3700 /* The OOM killer does not needlessly kill tasks for lowmem */
3701 if (ac->high_zoneidx < ZONE_NORMAL)
3703 if (pm_suspended_storage())
3706 * XXX: GFP_NOFS allocations should rather fail than rely on
3707 * other request to make a forward progress.
3708 * We are in an unfortunate situation where out_of_memory cannot
3709 * do much for this context but let's try it to at least get
3710 * access to memory reserved if the current task is killed (see
3711 * out_of_memory). Once filesystems are ready to handle allocation
3712 * failures more gracefully we should just bail out here.
3715 /* The OOM killer may not free memory on a specific node */
3716 if (gfp_mask & __GFP_THISNODE)
3719 /* Exhausted what can be done so it's blame time */
3720 if (out_of_memory(&oc) || WARN_ON_ONCE(gfp_mask & __GFP_NOFAIL)) {
3721 *did_some_progress = 1;
3724 * Help non-failing allocations by giving them access to memory
3727 if (gfp_mask & __GFP_NOFAIL)
3728 page = __alloc_pages_cpuset_fallback(gfp_mask, order,
3729 ALLOC_NO_WATERMARKS, ac);
3732 mutex_unlock(&oom_lock);
3737 * Maximum number of compaction retries wit a progress before OOM
3738 * killer is consider as the only way to move forward.
3740 #define MAX_COMPACT_RETRIES 16
3742 #ifdef CONFIG_COMPACTION
3743 /* Try memory compaction for high-order allocations before reclaim */
3744 static struct page *
3745 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
3746 unsigned int alloc_flags, const struct alloc_context *ac,
3747 enum compact_priority prio, enum compact_result *compact_result)
3749 struct page *page = NULL;
3750 unsigned long pflags;
3751 unsigned int noreclaim_flag;
3756 psi_memstall_enter(&pflags);
3757 noreclaim_flag = memalloc_noreclaim_save();
3759 *compact_result = try_to_compact_pages(gfp_mask, order, alloc_flags, ac,
3762 memalloc_noreclaim_restore(noreclaim_flag);
3763 psi_memstall_leave(&pflags);
3766 * At least in one zone compaction wasn't deferred or skipped, so let's
3767 * count a compaction stall
3769 count_vm_event(COMPACTSTALL);
3771 /* Prep a captured page if available */
3773 prep_new_page(page, order, gfp_mask, alloc_flags);
3775 /* Try get a page from the freelist if available */
3777 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac);
3780 struct zone *zone = page_zone(page);
3782 zone->compact_blockskip_flush = false;
3783 compaction_defer_reset(zone, order, true);
3784 count_vm_event(COMPACTSUCCESS);
3789 * It's bad if compaction run occurs and fails. The most likely reason
3790 * is that pages exist, but not enough to satisfy watermarks.
3792 count_vm_event(COMPACTFAIL);
3800 should_compact_retry(struct alloc_context *ac, int order, int alloc_flags,
3801 enum compact_result compact_result,
3802 enum compact_priority *compact_priority,
3803 int *compaction_retries)
3805 int max_retries = MAX_COMPACT_RETRIES;
3808 int retries = *compaction_retries;
3809 enum compact_priority priority = *compact_priority;
3814 if (compaction_made_progress(compact_result))
3815 (*compaction_retries)++;
3818 * compaction considers all the zone as desperately out of memory
3819 * so it doesn't really make much sense to retry except when the
3820 * failure could be caused by insufficient priority
3822 if (compaction_failed(compact_result))
3823 goto check_priority;
3826 * make sure the compaction wasn't deferred or didn't bail out early
3827 * due to locks contention before we declare that we should give up.
3828 * But do not retry if the given zonelist is not suitable for
3831 if (compaction_withdrawn(compact_result)) {
3832 ret = compaction_zonelist_suitable(ac, order, alloc_flags);
3837 * !costly requests are much more important than __GFP_RETRY_MAYFAIL
3838 * costly ones because they are de facto nofail and invoke OOM
3839 * killer to move on while costly can fail and users are ready
3840 * to cope with that. 1/4 retries is rather arbitrary but we
3841 * would need much more detailed feedback from compaction to
3842 * make a better decision.
3844 if (order > PAGE_ALLOC_COSTLY_ORDER)
3846 if (*compaction_retries <= max_retries) {
3852 * Make sure there are attempts at the highest priority if we exhausted
3853 * all retries or failed at the lower priorities.
3856 min_priority = (order > PAGE_ALLOC_COSTLY_ORDER) ?
3857 MIN_COMPACT_COSTLY_PRIORITY : MIN_COMPACT_PRIORITY;
3859 if (*compact_priority > min_priority) {
3860 (*compact_priority)--;
3861 *compaction_retries = 0;
3865 trace_compact_retry(order, priority, compact_result, retries, max_retries, ret);
3869 static inline struct page *
3870 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
3871 unsigned int alloc_flags, const struct alloc_context *ac,
3872 enum compact_priority prio, enum compact_result *compact_result)
3874 *compact_result = COMPACT_SKIPPED;
3879 should_compact_retry(struct alloc_context *ac, unsigned int order, int alloc_flags,
3880 enum compact_result compact_result,
3881 enum compact_priority *compact_priority,
3882 int *compaction_retries)
3887 if (!order || order > PAGE_ALLOC_COSTLY_ORDER)
3891 * There are setups with compaction disabled which would prefer to loop
3892 * inside the allocator rather than hit the oom killer prematurely.
3893 * Let's give them a good hope and keep retrying while the order-0
3894 * watermarks are OK.
3896 for_each_zone_zonelist_nodemask(zone, z, ac->zonelist, ac->high_zoneidx,
3898 if (zone_watermark_ok(zone, 0, min_wmark_pages(zone),
3899 ac_classzone_idx(ac), alloc_flags))
3904 #endif /* CONFIG_COMPACTION */
3906 #ifdef CONFIG_LOCKDEP
3907 static struct lockdep_map __fs_reclaim_map =
3908 STATIC_LOCKDEP_MAP_INIT("fs_reclaim", &__fs_reclaim_map);
3910 static bool __need_fs_reclaim(gfp_t gfp_mask)
3912 gfp_mask = current_gfp_context(gfp_mask);
3914 /* no reclaim without waiting on it */
3915 if (!(gfp_mask & __GFP_DIRECT_RECLAIM))
3918 /* this guy won't enter reclaim */
3919 if (current->flags & PF_MEMALLOC)
3922 /* We're only interested __GFP_FS allocations for now */
3923 if (!(gfp_mask & __GFP_FS))
3926 if (gfp_mask & __GFP_NOLOCKDEP)
3932 void __fs_reclaim_acquire(void)
3934 lock_map_acquire(&__fs_reclaim_map);
3937 void __fs_reclaim_release(void)
3939 lock_map_release(&__fs_reclaim_map);
3942 void fs_reclaim_acquire(gfp_t gfp_mask)
3944 if (__need_fs_reclaim(gfp_mask))
3945 __fs_reclaim_acquire();
3947 EXPORT_SYMBOL_GPL(fs_reclaim_acquire);
3949 void fs_reclaim_release(gfp_t gfp_mask)
3951 if (__need_fs_reclaim(gfp_mask))
3952 __fs_reclaim_release();
3954 EXPORT_SYMBOL_GPL(fs_reclaim_release);
3957 /* Perform direct synchronous page reclaim */
3959 __perform_reclaim(gfp_t gfp_mask, unsigned int order,
3960 const struct alloc_context *ac)
3962 struct reclaim_state reclaim_state;
3964 unsigned int noreclaim_flag;
3965 unsigned long pflags;
3969 /* We now go into synchronous reclaim */
3970 cpuset_memory_pressure_bump();
3971 psi_memstall_enter(&pflags);
3972 fs_reclaim_acquire(gfp_mask);
3973 noreclaim_flag = memalloc_noreclaim_save();
3974 reclaim_state.reclaimed_slab = 0;
3975 current->reclaim_state = &reclaim_state;
3977 progress = try_to_free_pages(ac->zonelist, order, gfp_mask,
3980 current->reclaim_state = NULL;
3981 memalloc_noreclaim_restore(noreclaim_flag);
3982 fs_reclaim_release(gfp_mask);
3983 psi_memstall_leave(&pflags);
3990 /* The really slow allocator path where we enter direct reclaim */
3991 static inline struct page *
3992 __alloc_pages_direct_reclaim(gfp_t gfp_mask, unsigned int order,
3993 unsigned int alloc_flags, const struct alloc_context *ac,
3994 unsigned long *did_some_progress)
3996 struct page *page = NULL;
3997 bool drained = false;
3999 *did_some_progress = __perform_reclaim(gfp_mask, order, ac);
4000 if (unlikely(!(*did_some_progress)))
4004 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac);
4007 * If an allocation failed after direct reclaim, it could be because
4008 * pages are pinned on the per-cpu lists or in high alloc reserves.
4009 * Shrink them them and try again
4011 if (!page && !drained) {
4012 unreserve_highatomic_pageblock(ac, false);
4013 drain_all_pages(NULL);
4021 static void wake_all_kswapds(unsigned int order, gfp_t gfp_mask,
4022 const struct alloc_context *ac)
4026 pg_data_t *last_pgdat = NULL;
4027 enum zone_type high_zoneidx = ac->high_zoneidx;
4029 for_each_zone_zonelist_nodemask(zone, z, ac->zonelist, high_zoneidx,
4031 if (last_pgdat != zone->zone_pgdat)
4032 wakeup_kswapd(zone, gfp_mask, order, high_zoneidx);
4033 last_pgdat = zone->zone_pgdat;
4037 static inline unsigned int
4038 gfp_to_alloc_flags(gfp_t gfp_mask)
4040 unsigned int alloc_flags = ALLOC_WMARK_MIN | ALLOC_CPUSET;
4042 /* __GFP_HIGH is assumed to be the same as ALLOC_HIGH to save a branch. */
4043 BUILD_BUG_ON(__GFP_HIGH != (__force gfp_t) ALLOC_HIGH);
4046 * The caller may dip into page reserves a bit more if the caller
4047 * cannot run direct reclaim, or if the caller has realtime scheduling
4048 * policy or is asking for __GFP_HIGH memory. GFP_ATOMIC requests will
4049 * set both ALLOC_HARDER (__GFP_ATOMIC) and ALLOC_HIGH (__GFP_HIGH).
4051 alloc_flags |= (__force int) (gfp_mask & __GFP_HIGH);
4053 if (gfp_mask & __GFP_ATOMIC) {
4055 * Not worth trying to allocate harder for __GFP_NOMEMALLOC even
4056 * if it can't schedule.
4058 if (!(gfp_mask & __GFP_NOMEMALLOC))
4059 alloc_flags |= ALLOC_HARDER;
4061 * Ignore cpuset mems for GFP_ATOMIC rather than fail, see the
4062 * comment for __cpuset_node_allowed().
4064 alloc_flags &= ~ALLOC_CPUSET;
4065 } else if (unlikely(rt_task(current)) && !in_interrupt())
4066 alloc_flags |= ALLOC_HARDER;
4068 if (gfp_mask & __GFP_KSWAPD_RECLAIM)
4069 alloc_flags |= ALLOC_KSWAPD;
4072 if (gfpflags_to_migratetype(gfp_mask) == MIGRATE_MOVABLE)
4073 alloc_flags |= ALLOC_CMA;
4078 static bool oom_reserves_allowed(struct task_struct *tsk)
4080 if (!tsk_is_oom_victim(tsk))
4084 * !MMU doesn't have oom reaper so give access to memory reserves
4085 * only to the thread with TIF_MEMDIE set
4087 if (!IS_ENABLED(CONFIG_MMU) && !test_thread_flag(TIF_MEMDIE))
4094 * Distinguish requests which really need access to full memory
4095 * reserves from oom victims which can live with a portion of it
4097 static inline int __gfp_pfmemalloc_flags(gfp_t gfp_mask)
4099 if (unlikely(gfp_mask & __GFP_NOMEMALLOC))
4101 if (gfp_mask & __GFP_MEMALLOC)
4102 return ALLOC_NO_WATERMARKS;
4103 if (in_serving_softirq() && (current->flags & PF_MEMALLOC))
4104 return ALLOC_NO_WATERMARKS;
4105 if (!in_interrupt()) {
4106 if (current->flags & PF_MEMALLOC)
4107 return ALLOC_NO_WATERMARKS;
4108 else if (oom_reserves_allowed(current))
4115 bool gfp_pfmemalloc_allowed(gfp_t gfp_mask)
4117 return !!__gfp_pfmemalloc_flags(gfp_mask);
4121 * Checks whether it makes sense to retry the reclaim to make a forward progress
4122 * for the given allocation request.
4124 * We give up when we either have tried MAX_RECLAIM_RETRIES in a row
4125 * without success, or when we couldn't even meet the watermark if we
4126 * reclaimed all remaining pages on the LRU lists.
4128 * Returns true if a retry is viable or false to enter the oom path.
4131 should_reclaim_retry(gfp_t gfp_mask, unsigned order,
4132 struct alloc_context *ac, int alloc_flags,
4133 bool did_some_progress, int *no_progress_loops)
4140 * Costly allocations might have made a progress but this doesn't mean
4141 * their order will become available due to high fragmentation so
4142 * always increment the no progress counter for them
4144 if (did_some_progress && order <= PAGE_ALLOC_COSTLY_ORDER)
4145 *no_progress_loops = 0;
4147 (*no_progress_loops)++;
4150 * Make sure we converge to OOM if we cannot make any progress
4151 * several times in the row.
4153 if (*no_progress_loops > MAX_RECLAIM_RETRIES) {
4154 /* Before OOM, exhaust highatomic_reserve */
4155 return unreserve_highatomic_pageblock(ac, true);
4159 * Keep reclaiming pages while there is a chance this will lead
4160 * somewhere. If none of the target zones can satisfy our allocation
4161 * request even if all reclaimable pages are considered then we are
4162 * screwed and have to go OOM.
4164 for_each_zone_zonelist_nodemask(zone, z, ac->zonelist, ac->high_zoneidx,
4166 unsigned long available;
4167 unsigned long reclaimable;
4168 unsigned long min_wmark = min_wmark_pages(zone);
4171 available = reclaimable = zone_reclaimable_pages(zone);
4172 available += zone_page_state_snapshot(zone, NR_FREE_PAGES);
4175 * Would the allocation succeed if we reclaimed all
4176 * reclaimable pages?
4178 wmark = __zone_watermark_ok(zone, order, min_wmark,
4179 ac_classzone_idx(ac), alloc_flags, available);
4180 trace_reclaim_retry_zone(z, order, reclaimable,
4181 available, min_wmark, *no_progress_loops, wmark);
4184 * If we didn't make any progress and have a lot of
4185 * dirty + writeback pages then we should wait for
4186 * an IO to complete to slow down the reclaim and
4187 * prevent from pre mature OOM
4189 if (!did_some_progress) {
4190 unsigned long write_pending;
4192 write_pending = zone_page_state_snapshot(zone,
4193 NR_ZONE_WRITE_PENDING);
4195 if (2 * write_pending > reclaimable) {
4196 congestion_wait(BLK_RW_ASYNC, HZ/10);
4208 * Memory allocation/reclaim might be called from a WQ context and the
4209 * current implementation of the WQ concurrency control doesn't
4210 * recognize that a particular WQ is congested if the worker thread is
4211 * looping without ever sleeping. Therefore we have to do a short sleep
4212 * here rather than calling cond_resched().
4214 if (current->flags & PF_WQ_WORKER)
4215 schedule_timeout_uninterruptible(1);
4222 check_retry_cpuset(int cpuset_mems_cookie, struct alloc_context *ac)
4225 * It's possible that cpuset's mems_allowed and the nodemask from
4226 * mempolicy don't intersect. This should be normally dealt with by
4227 * policy_nodemask(), but it's possible to race with cpuset update in
4228 * such a way the check therein was true, and then it became false
4229 * before we got our cpuset_mems_cookie here.
4230 * This assumes that for all allocations, ac->nodemask can come only
4231 * from MPOL_BIND mempolicy (whose documented semantics is to be ignored
4232 * when it does not intersect with the cpuset restrictions) or the
4233 * caller can deal with a violated nodemask.
4235 if (cpusets_enabled() && ac->nodemask &&
4236 !cpuset_nodemask_valid_mems_allowed(ac->nodemask)) {
4237 ac->nodemask = NULL;
4242 * When updating a task's mems_allowed or mempolicy nodemask, it is
4243 * possible to race with parallel threads in such a way that our
4244 * allocation can fail while the mask is being updated. If we are about
4245 * to fail, check if the cpuset changed during allocation and if so,
4248 if (read_mems_allowed_retry(cpuset_mems_cookie))
4254 static inline struct page *
4255 __alloc_pages_slowpath(gfp_t gfp_mask, unsigned int order,
4256 struct alloc_context *ac)
4258 bool can_direct_reclaim = gfp_mask & __GFP_DIRECT_RECLAIM;
4259 const bool costly_order = order > PAGE_ALLOC_COSTLY_ORDER;
4260 struct page *page = NULL;
4261 unsigned int alloc_flags;
4262 unsigned long did_some_progress;
4263 enum compact_priority compact_priority;
4264 enum compact_result compact_result;
4265 int compaction_retries;
4266 int no_progress_loops;
4267 unsigned int cpuset_mems_cookie;
4271 * We also sanity check to catch abuse of atomic reserves being used by
4272 * callers that are not in atomic context.
4274 if (WARN_ON_ONCE((gfp_mask & (__GFP_ATOMIC|__GFP_DIRECT_RECLAIM)) ==
4275 (__GFP_ATOMIC|__GFP_DIRECT_RECLAIM)))
4276 gfp_mask &= ~__GFP_ATOMIC;
4279 compaction_retries = 0;
4280 no_progress_loops = 0;
4281 compact_priority = DEF_COMPACT_PRIORITY;
4282 cpuset_mems_cookie = read_mems_allowed_begin();
4285 * The fast path uses conservative alloc_flags to succeed only until
4286 * kswapd needs to be woken up, and to avoid the cost of setting up
4287 * alloc_flags precisely. So we do that now.
4289 alloc_flags = gfp_to_alloc_flags(gfp_mask);
4292 * We need to recalculate the starting point for the zonelist iterator
4293 * because we might have used different nodemask in the fast path, or
4294 * there was a cpuset modification and we are retrying - otherwise we
4295 * could end up iterating over non-eligible zones endlessly.
4297 ac->preferred_zoneref = first_zones_zonelist(ac->zonelist,
4298 ac->high_zoneidx, ac->nodemask);
4299 if (!ac->preferred_zoneref->zone)
4302 if (alloc_flags & ALLOC_KSWAPD)
4303 wake_all_kswapds(order, gfp_mask, ac);
4306 * The adjusted alloc_flags might result in immediate success, so try
4309 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac);
4314 * For costly allocations, try direct compaction first, as it's likely
4315 * that we have enough base pages and don't need to reclaim. For non-
4316 * movable high-order allocations, do that as well, as compaction will
4317 * try prevent permanent fragmentation by migrating from blocks of the
4319 * Don't try this for allocations that are allowed to ignore
4320 * watermarks, as the ALLOC_NO_WATERMARKS attempt didn't yet happen.
4322 if (can_direct_reclaim &&
4324 (order > 0 && ac->migratetype != MIGRATE_MOVABLE))
4325 && !gfp_pfmemalloc_allowed(gfp_mask)) {
4326 page = __alloc_pages_direct_compact(gfp_mask, order,
4328 INIT_COMPACT_PRIORITY,
4334 * Checks for costly allocations with __GFP_NORETRY, which
4335 * includes THP page fault allocations
4337 if (costly_order && (gfp_mask & __GFP_NORETRY)) {
4339 * If compaction is deferred for high-order allocations,
4340 * it is because sync compaction recently failed. If
4341 * this is the case and the caller requested a THP
4342 * allocation, we do not want to heavily disrupt the
4343 * system, so we fail the allocation instead of entering
4346 if (compact_result == COMPACT_DEFERRED)
4350 * Looks like reclaim/compaction is worth trying, but
4351 * sync compaction could be very expensive, so keep
4352 * using async compaction.
4354 compact_priority = INIT_COMPACT_PRIORITY;
4359 /* Ensure kswapd doesn't accidentally go to sleep as long as we loop */
4360 if (alloc_flags & ALLOC_KSWAPD)
4361 wake_all_kswapds(order, gfp_mask, ac);
4363 reserve_flags = __gfp_pfmemalloc_flags(gfp_mask);
4365 alloc_flags = reserve_flags;
4368 * Reset the nodemask and zonelist iterators if memory policies can be
4369 * ignored. These allocations are high priority and system rather than
4372 if (!(alloc_flags & ALLOC_CPUSET) || reserve_flags) {
4373 ac->nodemask = NULL;
4374 ac->preferred_zoneref = first_zones_zonelist(ac->zonelist,
4375 ac->high_zoneidx, ac->nodemask);
4378 /* Attempt with potentially adjusted zonelist and alloc_flags */
4379 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac);
4383 /* Caller is not willing to reclaim, we can't balance anything */
4384 if (!can_direct_reclaim)
4387 /* Avoid recursion of direct reclaim */
4388 if (current->flags & PF_MEMALLOC)
4391 /* Try direct reclaim and then allocating */
4392 page = __alloc_pages_direct_reclaim(gfp_mask, order, alloc_flags, ac,
4393 &did_some_progress);
4397 /* Try direct compaction and then allocating */
4398 page = __alloc_pages_direct_compact(gfp_mask, order, alloc_flags, ac,
4399 compact_priority, &compact_result);
4403 /* Do not loop if specifically requested */
4404 if (gfp_mask & __GFP_NORETRY)
4408 * Do not retry costly high order allocations unless they are
4409 * __GFP_RETRY_MAYFAIL
4411 if (costly_order && !(gfp_mask & __GFP_RETRY_MAYFAIL))
4414 if (should_reclaim_retry(gfp_mask, order, ac, alloc_flags,
4415 did_some_progress > 0, &no_progress_loops))
4419 * It doesn't make any sense to retry for the compaction if the order-0
4420 * reclaim is not able to make any progress because the current
4421 * implementation of the compaction depends on the sufficient amount
4422 * of free memory (see __compaction_suitable)
4424 if (did_some_progress > 0 &&
4425 should_compact_retry(ac, order, alloc_flags,
4426 compact_result, &compact_priority,
4427 &compaction_retries))
4431 /* Deal with possible cpuset update races before we start OOM killing */
4432 if (check_retry_cpuset(cpuset_mems_cookie, ac))
4435 /* Reclaim has failed us, start killing things */
4436 page = __alloc_pages_may_oom(gfp_mask, order, ac, &did_some_progress);
4440 /* Avoid allocations with no watermarks from looping endlessly */
4441 if (tsk_is_oom_victim(current) &&
4442 (alloc_flags == ALLOC_OOM ||
4443 (gfp_mask & __GFP_NOMEMALLOC)))
4446 /* Retry as long as the OOM killer is making progress */
4447 if (did_some_progress) {
4448 no_progress_loops = 0;
4453 /* Deal with possible cpuset update races before we fail */
4454 if (check_retry_cpuset(cpuset_mems_cookie, ac))
4458 * Make sure that __GFP_NOFAIL request doesn't leak out and make sure
4461 if (gfp_mask & __GFP_NOFAIL) {
4463 * All existing users of the __GFP_NOFAIL are blockable, so warn
4464 * of any new users that actually require GFP_NOWAIT
4466 if (WARN_ON_ONCE(!can_direct_reclaim))
4470 * PF_MEMALLOC request from this context is rather bizarre
4471 * because we cannot reclaim anything and only can loop waiting
4472 * for somebody to do a work for us
4474 WARN_ON_ONCE(current->flags & PF_MEMALLOC);
4477 * non failing costly orders are a hard requirement which we
4478 * are not prepared for much so let's warn about these users
4479 * so that we can identify them and convert them to something
4482 WARN_ON_ONCE(order > PAGE_ALLOC_COSTLY_ORDER);
4485 * Help non-failing allocations by giving them access to memory
4486 * reserves but do not use ALLOC_NO_WATERMARKS because this
4487 * could deplete whole memory reserves which would just make
4488 * the situation worse
4490 page = __alloc_pages_cpuset_fallback(gfp_mask, order, ALLOC_HARDER, ac);
4498 warn_alloc(gfp_mask, ac->nodemask,
4499 "page allocation failure: order:%u", order);
4504 static inline bool prepare_alloc_pages(gfp_t gfp_mask, unsigned int order,
4505 int preferred_nid, nodemask_t *nodemask,
4506 struct alloc_context *ac, gfp_t *alloc_mask,
4507 unsigned int *alloc_flags)
4509 ac->high_zoneidx = gfp_zone(gfp_mask);
4510 ac->zonelist = node_zonelist(preferred_nid, gfp_mask);
4511 ac->nodemask = nodemask;
4512 ac->migratetype = gfpflags_to_migratetype(gfp_mask);
4514 if (cpusets_enabled()) {
4515 *alloc_mask |= __GFP_HARDWALL;
4517 ac->nodemask = &cpuset_current_mems_allowed;
4519 *alloc_flags |= ALLOC_CPUSET;
4522 fs_reclaim_acquire(gfp_mask);
4523 fs_reclaim_release(gfp_mask);
4525 might_sleep_if(gfp_mask & __GFP_DIRECT_RECLAIM);
4527 if (should_fail_alloc_page(gfp_mask, order))
4530 if (IS_ENABLED(CONFIG_CMA) && ac->migratetype == MIGRATE_MOVABLE)
4531 *alloc_flags |= ALLOC_CMA;
4536 /* Determine whether to spread dirty pages and what the first usable zone */
4537 static inline void finalise_ac(gfp_t gfp_mask, struct alloc_context *ac)
4539 /* Dirty zone balancing only done in the fast path */
4540 ac->spread_dirty_pages = (gfp_mask & __GFP_WRITE);
4543 * The preferred zone is used for statistics but crucially it is
4544 * also used as the starting point for the zonelist iterator. It
4545 * may get reset for allocations that ignore memory policies.
4547 ac->preferred_zoneref = first_zones_zonelist(ac->zonelist,
4548 ac->high_zoneidx, ac->nodemask);
4552 * This is the 'heart' of the zoned buddy allocator.
4555 __alloc_pages_nodemask(gfp_t gfp_mask, unsigned int order, int preferred_nid,
4556 nodemask_t *nodemask)
4559 unsigned int alloc_flags = ALLOC_WMARK_LOW;
4560 gfp_t alloc_mask; /* The gfp_t that was actually used for allocation */
4561 struct alloc_context ac = { };
4564 * There are several places where we assume that the order value is sane
4565 * so bail out early if the request is out of bound.
4567 if (unlikely(order >= MAX_ORDER)) {
4568 WARN_ON_ONCE(!(gfp_mask & __GFP_NOWARN));
4572 gfp_mask &= gfp_allowed_mask;
4573 alloc_mask = gfp_mask;
4574 if (!prepare_alloc_pages(gfp_mask, order, preferred_nid, nodemask, &ac, &alloc_mask, &alloc_flags))
4577 finalise_ac(gfp_mask, &ac);
4580 * Forbid the first pass from falling back to types that fragment
4581 * memory until all local zones are considered.
4583 alloc_flags |= alloc_flags_nofragment(ac.preferred_zoneref->zone, gfp_mask);
4585 /* First allocation attempt */
4586 page = get_page_from_freelist(alloc_mask, order, alloc_flags, &ac);
4591 * Apply scoped allocation constraints. This is mainly about GFP_NOFS
4592 * resp. GFP_NOIO which has to be inherited for all allocation requests
4593 * from a particular context which has been marked by
4594 * memalloc_no{fs,io}_{save,restore}.
4596 alloc_mask = current_gfp_context(gfp_mask);
4597 ac.spread_dirty_pages = false;
4600 * Restore the original nodemask if it was potentially replaced with
4601 * &cpuset_current_mems_allowed to optimize the fast-path attempt.
4603 if (unlikely(ac.nodemask != nodemask))
4604 ac.nodemask = nodemask;
4606 page = __alloc_pages_slowpath(alloc_mask, order, &ac);
4609 if (memcg_kmem_enabled() && (gfp_mask & __GFP_ACCOUNT) && page &&
4610 unlikely(__memcg_kmem_charge(page, gfp_mask, order) != 0)) {
4611 __free_pages(page, order);
4615 trace_mm_page_alloc(page, order, alloc_mask, ac.migratetype);
4619 EXPORT_SYMBOL(__alloc_pages_nodemask);
4622 * Common helper functions. Never use with __GFP_HIGHMEM because the returned
4623 * address cannot represent highmem pages. Use alloc_pages and then kmap if
4624 * you need to access high mem.
4626 unsigned long __get_free_pages(gfp_t gfp_mask, unsigned int order)
4630 page = alloc_pages(gfp_mask & ~__GFP_HIGHMEM, order);
4633 return (unsigned long) page_address(page);
4635 EXPORT_SYMBOL(__get_free_pages);
4637 unsigned long get_zeroed_page(gfp_t gfp_mask)
4639 return __get_free_pages(gfp_mask | __GFP_ZERO, 0);
4641 EXPORT_SYMBOL(get_zeroed_page);
4643 static inline void free_the_page(struct page *page, unsigned int order)
4645 if (order == 0) /* Via pcp? */
4646 free_unref_page(page);
4648 __free_pages_ok(page, order);
4651 void __free_pages(struct page *page, unsigned int order)
4653 if (put_page_testzero(page))
4654 free_the_page(page, order);
4656 EXPORT_SYMBOL(__free_pages);
4658 void free_pages(unsigned long addr, unsigned int order)
4661 VM_BUG_ON(!virt_addr_valid((void *)addr));
4662 __free_pages(virt_to_page((void *)addr), order);
4666 EXPORT_SYMBOL(free_pages);
4670 * An arbitrary-length arbitrary-offset area of memory which resides
4671 * within a 0 or higher order page. Multiple fragments within that page
4672 * are individually refcounted, in the page's reference counter.
4674 * The page_frag functions below provide a simple allocation framework for
4675 * page fragments. This is used by the network stack and network device
4676 * drivers to provide a backing region of memory for use as either an
4677 * sk_buff->head, or to be used in the "frags" portion of skb_shared_info.
4679 static struct page *__page_frag_cache_refill(struct page_frag_cache *nc,
4682 struct page *page = NULL;
4683 gfp_t gfp = gfp_mask;
4685 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
4686 gfp_mask |= __GFP_COMP | __GFP_NOWARN | __GFP_NORETRY |
4688 page = alloc_pages_node(NUMA_NO_NODE, gfp_mask,
4689 PAGE_FRAG_CACHE_MAX_ORDER);
4690 nc->size = page ? PAGE_FRAG_CACHE_MAX_SIZE : PAGE_SIZE;
4692 if (unlikely(!page))
4693 page = alloc_pages_node(NUMA_NO_NODE, gfp, 0);
4695 nc->va = page ? page_address(page) : NULL;
4700 void __page_frag_cache_drain(struct page *page, unsigned int count)
4702 VM_BUG_ON_PAGE(page_ref_count(page) == 0, page);
4704 if (page_ref_sub_and_test(page, count))
4705 free_the_page(page, compound_order(page));
4707 EXPORT_SYMBOL(__page_frag_cache_drain);
4709 void *page_frag_alloc(struct page_frag_cache *nc,
4710 unsigned int fragsz, gfp_t gfp_mask)
4712 unsigned int size = PAGE_SIZE;
4716 if (unlikely(!nc->va)) {
4718 page = __page_frag_cache_refill(nc, gfp_mask);
4722 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
4723 /* if size can vary use size else just use PAGE_SIZE */
4726 /* Even if we own the page, we do not use atomic_set().
4727 * This would break get_page_unless_zero() users.
4729 page_ref_add(page, PAGE_FRAG_CACHE_MAX_SIZE);
4731 /* reset page count bias and offset to start of new frag */
4732 nc->pfmemalloc = page_is_pfmemalloc(page);
4733 nc->pagecnt_bias = PAGE_FRAG_CACHE_MAX_SIZE + 1;
4737 offset = nc->offset - fragsz;
4738 if (unlikely(offset < 0)) {
4739 page = virt_to_page(nc->va);
4741 if (!page_ref_sub_and_test(page, nc->pagecnt_bias))
4744 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
4745 /* if size can vary use size else just use PAGE_SIZE */
4748 /* OK, page count is 0, we can safely set it */
4749 set_page_count(page, PAGE_FRAG_CACHE_MAX_SIZE + 1);
4751 /* reset page count bias and offset to start of new frag */
4752 nc->pagecnt_bias = PAGE_FRAG_CACHE_MAX_SIZE + 1;
4753 offset = size - fragsz;
4757 nc->offset = offset;
4759 return nc->va + offset;
4761 EXPORT_SYMBOL(page_frag_alloc);
4764 * Frees a page fragment allocated out of either a compound or order 0 page.
4766 void page_frag_free(void *addr)
4768 struct page *page = virt_to_head_page(addr);
4770 if (unlikely(put_page_testzero(page)))
4771 free_the_page(page, compound_order(page));
4773 EXPORT_SYMBOL(page_frag_free);
4775 static void *make_alloc_exact(unsigned long addr, unsigned int order,
4779 unsigned long alloc_end = addr + (PAGE_SIZE << order);
4780 unsigned long used = addr + PAGE_ALIGN(size);
4782 split_page(virt_to_page((void *)addr), order);
4783 while (used < alloc_end) {
4788 return (void *)addr;
4792 * alloc_pages_exact - allocate an exact number physically-contiguous pages.
4793 * @size: the number of bytes to allocate
4794 * @gfp_mask: GFP flags for the allocation, must not contain __GFP_COMP
4796 * This function is similar to alloc_pages(), except that it allocates the
4797 * minimum number of pages to satisfy the request. alloc_pages() can only
4798 * allocate memory in power-of-two pages.
4800 * This function is also limited by MAX_ORDER.
4802 * Memory allocated by this function must be released by free_pages_exact().
4804 * Return: pointer to the allocated area or %NULL in case of error.
4806 void *alloc_pages_exact(size_t size, gfp_t gfp_mask)
4808 unsigned int order = get_order(size);
4811 if (WARN_ON_ONCE(gfp_mask & __GFP_COMP))
4812 gfp_mask &= ~__GFP_COMP;
4814 addr = __get_free_pages(gfp_mask, order);
4815 return make_alloc_exact(addr, order, size);
4817 EXPORT_SYMBOL(alloc_pages_exact);
4820 * alloc_pages_exact_nid - allocate an exact number of physically-contiguous
4822 * @nid: the preferred node ID where memory should be allocated
4823 * @size: the number of bytes to allocate
4824 * @gfp_mask: GFP flags for the allocation, must not contain __GFP_COMP
4826 * Like alloc_pages_exact(), but try to allocate on node nid first before falling
4829 * Return: pointer to the allocated area or %NULL in case of error.
4831 void * __meminit alloc_pages_exact_nid(int nid, size_t size, gfp_t gfp_mask)
4833 unsigned int order = get_order(size);
4836 if (WARN_ON_ONCE(gfp_mask & __GFP_COMP))
4837 gfp_mask &= ~__GFP_COMP;
4839 p = alloc_pages_node(nid, gfp_mask, order);
4842 return make_alloc_exact((unsigned long)page_address(p), order, size);
4846 * free_pages_exact - release memory allocated via alloc_pages_exact()
4847 * @virt: the value returned by alloc_pages_exact.
4848 * @size: size of allocation, same value as passed to alloc_pages_exact().
4850 * Release the memory allocated by a previous call to alloc_pages_exact.
4852 void free_pages_exact(void *virt, size_t size)
4854 unsigned long addr = (unsigned long)virt;
4855 unsigned long end = addr + PAGE_ALIGN(size);
4857 while (addr < end) {
4862 EXPORT_SYMBOL(free_pages_exact);
4865 * nr_free_zone_pages - count number of pages beyond high watermark
4866 * @offset: The zone index of the highest zone
4868 * nr_free_zone_pages() counts the number of pages which are beyond the
4869 * high watermark within all zones at or below a given zone index. For each
4870 * zone, the number of pages is calculated as:
4872 * nr_free_zone_pages = managed_pages - high_pages
4874 * Return: number of pages beyond high watermark.
4876 static unsigned long nr_free_zone_pages(int offset)
4881 /* Just pick one node, since fallback list is circular */
4882 unsigned long sum = 0;
4884 struct zonelist *zonelist = node_zonelist(numa_node_id(), GFP_KERNEL);
4886 for_each_zone_zonelist(zone, z, zonelist, offset) {
4887 unsigned long size = zone_managed_pages(zone);
4888 unsigned long high = high_wmark_pages(zone);
4897 * nr_free_buffer_pages - count number of pages beyond high watermark
4899 * nr_free_buffer_pages() counts the number of pages which are beyond the high
4900 * watermark within ZONE_DMA and ZONE_NORMAL.
4902 * Return: number of pages beyond high watermark within ZONE_DMA and
4905 unsigned long nr_free_buffer_pages(void)
4907 return nr_free_zone_pages(gfp_zone(GFP_USER));
4909 EXPORT_SYMBOL_GPL(nr_free_buffer_pages);
4912 * nr_free_pagecache_pages - count number of pages beyond high watermark
4914 * nr_free_pagecache_pages() counts the number of pages which are beyond the
4915 * high watermark within all zones.
4917 * Return: number of pages beyond high watermark within all zones.
4919 unsigned long nr_free_pagecache_pages(void)
4921 return nr_free_zone_pages(gfp_zone(GFP_HIGHUSER_MOVABLE));
4924 static inline void show_node(struct zone *zone)
4926 if (IS_ENABLED(CONFIG_NUMA))
4927 printk("Node %d ", zone_to_nid(zone));
4930 long si_mem_available(void)
4933 unsigned long pagecache;
4934 unsigned long wmark_low = 0;
4935 unsigned long pages[NR_LRU_LISTS];
4936 unsigned long reclaimable;
4940 for (lru = LRU_BASE; lru < NR_LRU_LISTS; lru++)
4941 pages[lru] = global_node_page_state(NR_LRU_BASE + lru);
4944 wmark_low += low_wmark_pages(zone);
4947 * Estimate the amount of memory available for userspace allocations,
4948 * without causing swapping.
4950 available = global_zone_page_state(NR_FREE_PAGES) - totalreserve_pages;
4953 * Not all the page cache can be freed, otherwise the system will
4954 * start swapping. Assume at least half of the page cache, or the
4955 * low watermark worth of cache, needs to stay.
4957 pagecache = pages[LRU_ACTIVE_FILE] + pages[LRU_INACTIVE_FILE];
4958 pagecache -= min(pagecache / 2, wmark_low);
4959 available += pagecache;
4962 * Part of the reclaimable slab and other kernel memory consists of
4963 * items that are in use, and cannot be freed. Cap this estimate at the
4966 reclaimable = global_node_page_state(NR_SLAB_RECLAIMABLE) +
4967 global_node_page_state(NR_KERNEL_MISC_RECLAIMABLE);
4968 available += reclaimable - min(reclaimable / 2, wmark_low);
4974 EXPORT_SYMBOL_GPL(si_mem_available);
4976 void si_meminfo(struct sysinfo *val)
4978 val->totalram = totalram_pages();
4979 val->sharedram = global_node_page_state(NR_SHMEM);
4980 val->freeram = global_zone_page_state(NR_FREE_PAGES);
4981 val->bufferram = nr_blockdev_pages();
4982 val->totalhigh = totalhigh_pages();
4983 val->freehigh = nr_free_highpages();
4984 val->mem_unit = PAGE_SIZE;
4987 EXPORT_SYMBOL(si_meminfo);
4990 void si_meminfo_node(struct sysinfo *val, int nid)
4992 int zone_type; /* needs to be signed */
4993 unsigned long managed_pages = 0;
4994 unsigned long managed_highpages = 0;
4995 unsigned long free_highpages = 0;
4996 pg_data_t *pgdat = NODE_DATA(nid);
4998 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++)
4999 managed_pages += zone_managed_pages(&pgdat->node_zones[zone_type]);
5000 val->totalram = managed_pages;
5001 val->sharedram = node_page_state(pgdat, NR_SHMEM);
5002 val->freeram = sum_zone_node_page_state(nid, NR_FREE_PAGES);
5003 #ifdef CONFIG_HIGHMEM
5004 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++) {
5005 struct zone *zone = &pgdat->node_zones[zone_type];
5007 if (is_highmem(zone)) {
5008 managed_highpages += zone_managed_pages(zone);
5009 free_highpages += zone_page_state(zone, NR_FREE_PAGES);
5012 val->totalhigh = managed_highpages;
5013 val->freehigh = free_highpages;
5015 val->totalhigh = managed_highpages;
5016 val->freehigh = free_highpages;
5018 val->mem_unit = PAGE_SIZE;
5023 * Determine whether the node should be displayed or not, depending on whether
5024 * SHOW_MEM_FILTER_NODES was passed to show_free_areas().
5026 static bool show_mem_node_skip(unsigned int flags, int nid, nodemask_t *nodemask)
5028 if (!(flags & SHOW_MEM_FILTER_NODES))
5032 * no node mask - aka implicit memory numa policy. Do not bother with
5033 * the synchronization - read_mems_allowed_begin - because we do not
5034 * have to be precise here.
5037 nodemask = &cpuset_current_mems_allowed;
5039 return !node_isset(nid, *nodemask);
5042 #define K(x) ((x) << (PAGE_SHIFT-10))
5044 static void show_migration_types(unsigned char type)
5046 static const char types[MIGRATE_TYPES] = {
5047 [MIGRATE_UNMOVABLE] = 'U',
5048 [MIGRATE_MOVABLE] = 'M',
5049 [MIGRATE_RECLAIMABLE] = 'E',
5050 [MIGRATE_HIGHATOMIC] = 'H',
5052 [MIGRATE_CMA] = 'C',
5054 #ifdef CONFIG_MEMORY_ISOLATION
5055 [MIGRATE_ISOLATE] = 'I',
5058 char tmp[MIGRATE_TYPES + 1];
5062 for (i = 0; i < MIGRATE_TYPES; i++) {
5063 if (type & (1 << i))
5068 printk(KERN_CONT "(%s) ", tmp);
5072 * Show free area list (used inside shift_scroll-lock stuff)
5073 * We also calculate the percentage fragmentation. We do this by counting the
5074 * memory on each free list with the exception of the first item on the list.
5077 * SHOW_MEM_FILTER_NODES: suppress nodes that are not allowed by current's
5080 void show_free_areas(unsigned int filter, nodemask_t *nodemask)
5082 unsigned long free_pcp = 0;
5087 for_each_populated_zone(zone) {
5088 if (show_mem_node_skip(filter, zone_to_nid(zone), nodemask))
5091 for_each_online_cpu(cpu)
5092 free_pcp += per_cpu_ptr(zone->pageset, cpu)->pcp.count;
5095 printk("active_anon:%lu inactive_anon:%lu isolated_anon:%lu\n"
5096 " active_file:%lu inactive_file:%lu isolated_file:%lu\n"
5097 " unevictable:%lu dirty:%lu writeback:%lu unstable:%lu\n"
5098 " slab_reclaimable:%lu slab_unreclaimable:%lu\n"
5099 " mapped:%lu shmem:%lu pagetables:%lu bounce:%lu\n"
5100 " free:%lu free_pcp:%lu free_cma:%lu\n",
5101 global_node_page_state(NR_ACTIVE_ANON),
5102 global_node_page_state(NR_INACTIVE_ANON),
5103 global_node_page_state(NR_ISOLATED_ANON),
5104 global_node_page_state(NR_ACTIVE_FILE),
5105 global_node_page_state(NR_INACTIVE_FILE),
5106 global_node_page_state(NR_ISOLATED_FILE),
5107 global_node_page_state(NR_UNEVICTABLE),
5108 global_node_page_state(NR_FILE_DIRTY),
5109 global_node_page_state(NR_WRITEBACK),
5110 global_node_page_state(NR_UNSTABLE_NFS),
5111 global_node_page_state(NR_SLAB_RECLAIMABLE),
5112 global_node_page_state(NR_SLAB_UNRECLAIMABLE),
5113 global_node_page_state(NR_FILE_MAPPED),
5114 global_node_page_state(NR_SHMEM),
5115 global_zone_page_state(NR_PAGETABLE),
5116 global_zone_page_state(NR_BOUNCE),
5117 global_zone_page_state(NR_FREE_PAGES),
5119 global_zone_page_state(NR_FREE_CMA_PAGES));
5121 for_each_online_pgdat(pgdat) {
5122 if (show_mem_node_skip(filter, pgdat->node_id, nodemask))
5126 " active_anon:%lukB"
5127 " inactive_anon:%lukB"
5128 " active_file:%lukB"
5129 " inactive_file:%lukB"
5130 " unevictable:%lukB"
5131 " isolated(anon):%lukB"
5132 " isolated(file):%lukB"
5137 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
5139 " shmem_pmdmapped: %lukB"
5142 " writeback_tmp:%lukB"
5144 " all_unreclaimable? %s"
5147 K(node_page_state(pgdat, NR_ACTIVE_ANON)),
5148 K(node_page_state(pgdat, NR_INACTIVE_ANON)),
5149 K(node_page_state(pgdat, NR_ACTIVE_FILE)),
5150 K(node_page_state(pgdat, NR_INACTIVE_FILE)),
5151 K(node_page_state(pgdat, NR_UNEVICTABLE)),
5152 K(node_page_state(pgdat, NR_ISOLATED_ANON)),
5153 K(node_page_state(pgdat, NR_ISOLATED_FILE)),
5154 K(node_page_state(pgdat, NR_FILE_MAPPED)),
5155 K(node_page_state(pgdat, NR_FILE_DIRTY)),
5156 K(node_page_state(pgdat, NR_WRITEBACK)),
5157 K(node_page_state(pgdat, NR_SHMEM)),
5158 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
5159 K(node_page_state(pgdat, NR_SHMEM_THPS) * HPAGE_PMD_NR),
5160 K(node_page_state(pgdat, NR_SHMEM_PMDMAPPED)
5162 K(node_page_state(pgdat, NR_ANON_THPS) * HPAGE_PMD_NR),
5164 K(node_page_state(pgdat, NR_WRITEBACK_TEMP)),
5165 K(node_page_state(pgdat, NR_UNSTABLE_NFS)),
5166 pgdat->kswapd_failures >= MAX_RECLAIM_RETRIES ?
5170 for_each_populated_zone(zone) {
5173 if (show_mem_node_skip(filter, zone_to_nid(zone), nodemask))
5177 for_each_online_cpu(cpu)
5178 free_pcp += per_cpu_ptr(zone->pageset, cpu)->pcp.count;
5187 " active_anon:%lukB"
5188 " inactive_anon:%lukB"
5189 " active_file:%lukB"
5190 " inactive_file:%lukB"
5191 " unevictable:%lukB"
5192 " writepending:%lukB"
5196 " kernel_stack:%lukB"
5204 K(zone_page_state(zone, NR_FREE_PAGES)),
5205 K(min_wmark_pages(zone)),
5206 K(low_wmark_pages(zone)),
5207 K(high_wmark_pages(zone)),
5208 K(zone_page_state(zone, NR_ZONE_ACTIVE_ANON)),
5209 K(zone_page_state(zone, NR_ZONE_INACTIVE_ANON)),
5210 K(zone_page_state(zone, NR_ZONE_ACTIVE_FILE)),
5211 K(zone_page_state(zone, NR_ZONE_INACTIVE_FILE)),
5212 K(zone_page_state(zone, NR_ZONE_UNEVICTABLE)),
5213 K(zone_page_state(zone, NR_ZONE_WRITE_PENDING)),
5214 K(zone->present_pages),
5215 K(zone_managed_pages(zone)),
5216 K(zone_page_state(zone, NR_MLOCK)),
5217 zone_page_state(zone, NR_KERNEL_STACK_KB),
5218 K(zone_page_state(zone, NR_PAGETABLE)),
5219 K(zone_page_state(zone, NR_BOUNCE)),
5221 K(this_cpu_read(zone->pageset->pcp.count)),
5222 K(zone_page_state(zone, NR_FREE_CMA_PAGES)));
5223 printk("lowmem_reserve[]:");
5224 for (i = 0; i < MAX_NR_ZONES; i++)
5225 printk(KERN_CONT " %ld", zone->lowmem_reserve[i]);
5226 printk(KERN_CONT "\n");
5229 for_each_populated_zone(zone) {
5231 unsigned long nr[MAX_ORDER], flags, total = 0;
5232 unsigned char types[MAX_ORDER];
5234 if (show_mem_node_skip(filter, zone_to_nid(zone), nodemask))
5237 printk(KERN_CONT "%s: ", zone->name);
5239 spin_lock_irqsave(&zone->lock, flags);
5240 for (order = 0; order < MAX_ORDER; order++) {
5241 struct free_area *area = &zone->free_area[order];
5244 nr[order] = area->nr_free;
5245 total += nr[order] << order;
5248 for (type = 0; type < MIGRATE_TYPES; type++) {
5249 if (!list_empty(&area->free_list[type]))
5250 types[order] |= 1 << type;
5253 spin_unlock_irqrestore(&zone->lock, flags);
5254 for (order = 0; order < MAX_ORDER; order++) {
5255 printk(KERN_CONT "%lu*%lukB ",
5256 nr[order], K(1UL) << order);
5258 show_migration_types(types[order]);
5260 printk(KERN_CONT "= %lukB\n", K(total));
5263 hugetlb_show_meminfo();
5265 printk("%ld total pagecache pages\n", global_node_page_state(NR_FILE_PAGES));
5267 show_swap_cache_info();
5270 static void zoneref_set_zone(struct zone *zone, struct zoneref *zoneref)
5272 zoneref->zone = zone;
5273 zoneref->zone_idx = zone_idx(zone);
5277 * Builds allocation fallback zone lists.
5279 * Add all populated zones of a node to the zonelist.
5281 static int build_zonerefs_node(pg_data_t *pgdat, struct zoneref *zonerefs)
5284 enum zone_type zone_type = MAX_NR_ZONES;
5289 zone = pgdat->node_zones + zone_type;
5290 if (managed_zone(zone)) {
5291 zoneref_set_zone(zone, &zonerefs[nr_zones++]);
5292 check_highest_zone(zone_type);
5294 } while (zone_type);
5301 static int __parse_numa_zonelist_order(char *s)
5304 * We used to support different zonlists modes but they turned
5305 * out to be just not useful. Let's keep the warning in place
5306 * if somebody still use the cmd line parameter so that we do
5307 * not fail it silently
5309 if (!(*s == 'd' || *s == 'D' || *s == 'n' || *s == 'N')) {
5310 pr_warn("Ignoring unsupported numa_zonelist_order value: %s\n", s);
5316 static __init int setup_numa_zonelist_order(char *s)
5321 return __parse_numa_zonelist_order(s);
5323 early_param("numa_zonelist_order", setup_numa_zonelist_order);
5325 char numa_zonelist_order[] = "Node";
5328 * sysctl handler for numa_zonelist_order
5330 int numa_zonelist_order_handler(struct ctl_table *table, int write,
5331 void __user *buffer, size_t *length,
5338 return proc_dostring(table, write, buffer, length, ppos);
5339 str = memdup_user_nul(buffer, 16);
5341 return PTR_ERR(str);
5343 ret = __parse_numa_zonelist_order(str);
5349 #define MAX_NODE_LOAD (nr_online_nodes)
5350 static int node_load[MAX_NUMNODES];
5353 * find_next_best_node - find the next node that should appear in a given node's fallback list
5354 * @node: node whose fallback list we're appending
5355 * @used_node_mask: nodemask_t of already used nodes
5357 * We use a number of factors to determine which is the next node that should
5358 * appear on a given node's fallback list. The node should not have appeared
5359 * already in @node's fallback list, and it should be the next closest node
5360 * according to the distance array (which contains arbitrary distance values
5361 * from each node to each node in the system), and should also prefer nodes
5362 * with no CPUs, since presumably they'll have very little allocation pressure
5363 * on them otherwise.
5365 * Return: node id of the found node or %NUMA_NO_NODE if no node is found.
5367 static int find_next_best_node(int node, nodemask_t *used_node_mask)
5370 int min_val = INT_MAX;
5371 int best_node = NUMA_NO_NODE;
5372 const struct cpumask *tmp = cpumask_of_node(0);
5374 /* Use the local node if we haven't already */
5375 if (!node_isset(node, *used_node_mask)) {
5376 node_set(node, *used_node_mask);
5380 for_each_node_state(n, N_MEMORY) {
5382 /* Don't want a node to appear more than once */
5383 if (node_isset(n, *used_node_mask))
5386 /* Use the distance array to find the distance */
5387 val = node_distance(node, n);
5389 /* Penalize nodes under us ("prefer the next node") */
5392 /* Give preference to headless and unused nodes */
5393 tmp = cpumask_of_node(n);
5394 if (!cpumask_empty(tmp))
5395 val += PENALTY_FOR_NODE_WITH_CPUS;
5397 /* Slight preference for less loaded node */
5398 val *= (MAX_NODE_LOAD*MAX_NUMNODES);
5399 val += node_load[n];
5401 if (val < min_val) {
5408 node_set(best_node, *used_node_mask);
5415 * Build zonelists ordered by node and zones within node.
5416 * This results in maximum locality--normal zone overflows into local
5417 * DMA zone, if any--but risks exhausting DMA zone.
5419 static void build_zonelists_in_node_order(pg_data_t *pgdat, int *node_order,
5422 struct zoneref *zonerefs;
5425 zonerefs = pgdat->node_zonelists[ZONELIST_FALLBACK]._zonerefs;
5427 for (i = 0; i < nr_nodes; i++) {
5430 pg_data_t *node = NODE_DATA(node_order[i]);
5432 nr_zones = build_zonerefs_node(node, zonerefs);
5433 zonerefs += nr_zones;
5435 zonerefs->zone = NULL;
5436 zonerefs->zone_idx = 0;
5440 * Build gfp_thisnode zonelists
5442 static void build_thisnode_zonelists(pg_data_t *pgdat)
5444 struct zoneref *zonerefs;
5447 zonerefs = pgdat->node_zonelists[ZONELIST_NOFALLBACK]._zonerefs;
5448 nr_zones = build_zonerefs_node(pgdat, zonerefs);
5449 zonerefs += nr_zones;
5450 zonerefs->zone = NULL;
5451 zonerefs->zone_idx = 0;
5455 * Build zonelists ordered by zone and nodes within zones.
5456 * This results in conserving DMA zone[s] until all Normal memory is
5457 * exhausted, but results in overflowing to remote node while memory
5458 * may still exist in local DMA zone.
5461 static void build_zonelists(pg_data_t *pgdat)
5463 static int node_order[MAX_NUMNODES];
5464 int node, load, nr_nodes = 0;
5465 nodemask_t used_mask;
5466 int local_node, prev_node;
5468 /* NUMA-aware ordering of nodes */
5469 local_node = pgdat->node_id;
5470 load = nr_online_nodes;
5471 prev_node = local_node;
5472 nodes_clear(used_mask);
5474 memset(node_order, 0, sizeof(node_order));
5475 while ((node = find_next_best_node(local_node, &used_mask)) >= 0) {
5477 * We don't want to pressure a particular node.
5478 * So adding penalty to the first node in same
5479 * distance group to make it round-robin.
5481 if (node_distance(local_node, node) !=
5482 node_distance(local_node, prev_node))
5483 node_load[node] = load;
5485 node_order[nr_nodes++] = node;
5490 build_zonelists_in_node_order(pgdat, node_order, nr_nodes);
5491 build_thisnode_zonelists(pgdat);
5494 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
5496 * Return node id of node used for "local" allocations.
5497 * I.e., first node id of first zone in arg node's generic zonelist.
5498 * Used for initializing percpu 'numa_mem', which is used primarily
5499 * for kernel allocations, so use GFP_KERNEL flags to locate zonelist.
5501 int local_memory_node(int node)
5505 z = first_zones_zonelist(node_zonelist(node, GFP_KERNEL),
5506 gfp_zone(GFP_KERNEL),
5508 return zone_to_nid(z->zone);
5512 static void setup_min_unmapped_ratio(void);
5513 static void setup_min_slab_ratio(void);
5514 #else /* CONFIG_NUMA */
5516 static void build_zonelists(pg_data_t *pgdat)
5518 int node, local_node;
5519 struct zoneref *zonerefs;
5522 local_node = pgdat->node_id;
5524 zonerefs = pgdat->node_zonelists[ZONELIST_FALLBACK]._zonerefs;
5525 nr_zones = build_zonerefs_node(pgdat, zonerefs);
5526 zonerefs += nr_zones;
5529 * Now we build the zonelist so that it contains the zones
5530 * of all the other nodes.
5531 * We don't want to pressure a particular node, so when
5532 * building the zones for node N, we make sure that the
5533 * zones coming right after the local ones are those from
5534 * node N+1 (modulo N)
5536 for (node = local_node + 1; node < MAX_NUMNODES; node++) {
5537 if (!node_online(node))
5539 nr_zones = build_zonerefs_node(NODE_DATA(node), zonerefs);
5540 zonerefs += nr_zones;
5542 for (node = 0; node < local_node; node++) {
5543 if (!node_online(node))
5545 nr_zones = build_zonerefs_node(NODE_DATA(node), zonerefs);
5546 zonerefs += nr_zones;
5549 zonerefs->zone = NULL;
5550 zonerefs->zone_idx = 0;
5553 #endif /* CONFIG_NUMA */
5556 * Boot pageset table. One per cpu which is going to be used for all
5557 * zones and all nodes. The parameters will be set in such a way
5558 * that an item put on a list will immediately be handed over to
5559 * the buddy list. This is safe since pageset manipulation is done
5560 * with interrupts disabled.
5562 * The boot_pagesets must be kept even after bootup is complete for
5563 * unused processors and/or zones. They do play a role for bootstrapping
5564 * hotplugged processors.
5566 * zoneinfo_show() and maybe other functions do
5567 * not check if the processor is online before following the pageset pointer.
5568 * Other parts of the kernel may not check if the zone is available.
5570 static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch);
5571 static DEFINE_PER_CPU(struct per_cpu_pageset, boot_pageset);
5572 static DEFINE_PER_CPU(struct per_cpu_nodestat, boot_nodestats);
5574 static void __build_all_zonelists(void *data)
5577 int __maybe_unused cpu;
5578 pg_data_t *self = data;
5579 static DEFINE_SPINLOCK(lock);
5584 memset(node_load, 0, sizeof(node_load));
5588 * This node is hotadded and no memory is yet present. So just
5589 * building zonelists is fine - no need to touch other nodes.
5591 if (self && !node_online(self->node_id)) {
5592 build_zonelists(self);
5594 for_each_online_node(nid) {
5595 pg_data_t *pgdat = NODE_DATA(nid);
5597 build_zonelists(pgdat);
5600 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
5602 * We now know the "local memory node" for each node--
5603 * i.e., the node of the first zone in the generic zonelist.
5604 * Set up numa_mem percpu variable for on-line cpus. During
5605 * boot, only the boot cpu should be on-line; we'll init the
5606 * secondary cpus' numa_mem as they come on-line. During
5607 * node/memory hotplug, we'll fixup all on-line cpus.
5609 for_each_online_cpu(cpu)
5610 set_cpu_numa_mem(cpu, local_memory_node(cpu_to_node(cpu)));
5617 static noinline void __init
5618 build_all_zonelists_init(void)
5622 __build_all_zonelists(NULL);
5625 * Initialize the boot_pagesets that are going to be used
5626 * for bootstrapping processors. The real pagesets for
5627 * each zone will be allocated later when the per cpu
5628 * allocator is available.
5630 * boot_pagesets are used also for bootstrapping offline
5631 * cpus if the system is already booted because the pagesets
5632 * are needed to initialize allocators on a specific cpu too.
5633 * F.e. the percpu allocator needs the page allocator which
5634 * needs the percpu allocator in order to allocate its pagesets
5635 * (a chicken-egg dilemma).
5637 for_each_possible_cpu(cpu)
5638 setup_pageset(&per_cpu(boot_pageset, cpu), 0);
5640 mminit_verify_zonelist();
5641 cpuset_init_current_mems_allowed();
5645 * unless system_state == SYSTEM_BOOTING.
5647 * __ref due to call of __init annotated helper build_all_zonelists_init
5648 * [protected by SYSTEM_BOOTING].
5650 void __ref build_all_zonelists(pg_data_t *pgdat)
5652 if (system_state == SYSTEM_BOOTING) {
5653 build_all_zonelists_init();
5655 __build_all_zonelists(pgdat);
5656 /* cpuset refresh routine should be here */
5658 vm_total_pages = nr_free_pagecache_pages();
5660 * Disable grouping by mobility if the number of pages in the
5661 * system is too low to allow the mechanism to work. It would be
5662 * more accurate, but expensive to check per-zone. This check is
5663 * made on memory-hotadd so a system can start with mobility
5664 * disabled and enable it later
5666 if (vm_total_pages < (pageblock_nr_pages * MIGRATE_TYPES))
5667 page_group_by_mobility_disabled = 1;
5669 page_group_by_mobility_disabled = 0;
5671 pr_info("Built %u zonelists, mobility grouping %s. Total pages: %ld\n",
5673 page_group_by_mobility_disabled ? "off" : "on",
5676 pr_info("Policy zone: %s\n", zone_names[policy_zone]);
5680 /* If zone is ZONE_MOVABLE but memory is mirrored, it is an overlapped init */
5681 static bool __meminit
5682 overlap_memmap_init(unsigned long zone, unsigned long *pfn)
5684 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
5685 static struct memblock_region *r;
5687 if (mirrored_kernelcore && zone == ZONE_MOVABLE) {
5688 if (!r || *pfn >= memblock_region_memory_end_pfn(r)) {
5689 for_each_memblock(memory, r) {
5690 if (*pfn < memblock_region_memory_end_pfn(r))
5694 if (*pfn >= memblock_region_memory_base_pfn(r) &&
5695 memblock_is_mirror(r)) {
5696 *pfn = memblock_region_memory_end_pfn(r);
5705 * Initially all pages are reserved - free ones are freed
5706 * up by memblock_free_all() once the early boot process is
5707 * done. Non-atomic initialization, single-pass.
5709 void __meminit memmap_init_zone(unsigned long size, int nid, unsigned long zone,
5710 unsigned long start_pfn, enum memmap_context context,
5711 struct vmem_altmap *altmap)
5713 unsigned long pfn, end_pfn = start_pfn + size;
5716 if (highest_memmap_pfn < end_pfn - 1)
5717 highest_memmap_pfn = end_pfn - 1;
5719 #ifdef CONFIG_ZONE_DEVICE
5721 * Honor reservation requested by the driver for this ZONE_DEVICE
5722 * memory. We limit the total number of pages to initialize to just
5723 * those that might contain the memory mapping. We will defer the
5724 * ZONE_DEVICE page initialization until after we have released
5727 if (zone == ZONE_DEVICE) {
5731 if (start_pfn == altmap->base_pfn)
5732 start_pfn += altmap->reserve;
5733 end_pfn = altmap->base_pfn + vmem_altmap_offset(altmap);
5737 for (pfn = start_pfn; pfn < end_pfn; pfn++) {
5739 * There can be holes in boot-time mem_map[]s handed to this
5740 * function. They do not exist on hotplugged memory.
5742 if (context == MEMMAP_EARLY) {
5743 if (!early_pfn_valid(pfn))
5745 if (!early_pfn_in_nid(pfn, nid))
5747 if (overlap_memmap_init(zone, &pfn))
5749 if (defer_init(nid, pfn, end_pfn))
5753 page = pfn_to_page(pfn);
5754 __init_single_page(page, pfn, zone, nid);
5755 if (context == MEMMAP_HOTPLUG)
5756 __SetPageReserved(page);
5759 * Mark the block movable so that blocks are reserved for
5760 * movable at startup. This will force kernel allocations
5761 * to reserve their blocks rather than leaking throughout
5762 * the address space during boot when many long-lived
5763 * kernel allocations are made.
5765 * bitmap is created for zone's valid pfn range. but memmap
5766 * can be created for invalid pages (for alignment)
5767 * check here not to call set_pageblock_migratetype() against
5770 if (!(pfn & (pageblock_nr_pages - 1))) {
5771 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
5777 #ifdef CONFIG_ZONE_DEVICE
5778 void __ref memmap_init_zone_device(struct zone *zone,
5779 unsigned long start_pfn,
5781 struct dev_pagemap *pgmap)
5783 unsigned long pfn, end_pfn = start_pfn + size;
5784 struct pglist_data *pgdat = zone->zone_pgdat;
5785 unsigned long zone_idx = zone_idx(zone);
5786 unsigned long start = jiffies;
5787 int nid = pgdat->node_id;
5789 if (WARN_ON_ONCE(!pgmap || !is_dev_zone(zone)))
5793 * The call to memmap_init_zone should have already taken care
5794 * of the pages reserved for the memmap, so we can just jump to
5795 * the end of that region and start processing the device pages.
5797 if (pgmap->altmap_valid) {
5798 struct vmem_altmap *altmap = &pgmap->altmap;
5800 start_pfn = altmap->base_pfn + vmem_altmap_offset(altmap);
5801 size = end_pfn - start_pfn;
5804 for (pfn = start_pfn; pfn < end_pfn; pfn++) {
5805 struct page *page = pfn_to_page(pfn);
5807 __init_single_page(page, pfn, zone_idx, nid);
5810 * Mark page reserved as it will need to wait for onlining
5811 * phase for it to be fully associated with a zone.
5813 * We can use the non-atomic __set_bit operation for setting
5814 * the flag as we are still initializing the pages.
5816 __SetPageReserved(page);
5819 * ZONE_DEVICE pages union ->lru with a ->pgmap back
5820 * pointer and hmm_data. It is a bug if a ZONE_DEVICE
5821 * page is ever freed or placed on a driver-private list.
5823 page->pgmap = pgmap;
5827 * Mark the block movable so that blocks are reserved for
5828 * movable at startup. This will force kernel allocations
5829 * to reserve their blocks rather than leaking throughout
5830 * the address space during boot when many long-lived
5831 * kernel allocations are made.
5833 * bitmap is created for zone's valid pfn range. but memmap
5834 * can be created for invalid pages (for alignment)
5835 * check here not to call set_pageblock_migratetype() against
5838 * Please note that MEMMAP_HOTPLUG path doesn't clear memmap
5839 * because this is done early in sparse_add_one_section
5841 if (!(pfn & (pageblock_nr_pages - 1))) {
5842 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
5847 pr_info("%s initialised, %lu pages in %ums\n", dev_name(pgmap->dev),
5848 size, jiffies_to_msecs(jiffies - start));
5852 static void __meminit zone_init_free_lists(struct zone *zone)
5854 unsigned int order, t;
5855 for_each_migratetype_order(order, t) {
5856 INIT_LIST_HEAD(&zone->free_area[order].free_list[t]);
5857 zone->free_area[order].nr_free = 0;
5861 void __meminit __weak memmap_init(unsigned long size, int nid,
5862 unsigned long zone, unsigned long start_pfn)
5864 memmap_init_zone(size, nid, zone, start_pfn, MEMMAP_EARLY, NULL);
5867 static int zone_batchsize(struct zone *zone)
5873 * The per-cpu-pages pools are set to around 1000th of the
5876 batch = zone_managed_pages(zone) / 1024;
5877 /* But no more than a meg. */
5878 if (batch * PAGE_SIZE > 1024 * 1024)
5879 batch = (1024 * 1024) / PAGE_SIZE;
5880 batch /= 4; /* We effectively *= 4 below */
5885 * Clamp the batch to a 2^n - 1 value. Having a power
5886 * of 2 value was found to be more likely to have
5887 * suboptimal cache aliasing properties in some cases.
5889 * For example if 2 tasks are alternately allocating
5890 * batches of pages, one task can end up with a lot
5891 * of pages of one half of the possible page colors
5892 * and the other with pages of the other colors.
5894 batch = rounddown_pow_of_two(batch + batch/2) - 1;
5899 /* The deferral and batching of frees should be suppressed under NOMMU
5902 * The problem is that NOMMU needs to be able to allocate large chunks
5903 * of contiguous memory as there's no hardware page translation to
5904 * assemble apparent contiguous memory from discontiguous pages.
5906 * Queueing large contiguous runs of pages for batching, however,
5907 * causes the pages to actually be freed in smaller chunks. As there
5908 * can be a significant delay between the individual batches being
5909 * recycled, this leads to the once large chunks of space being
5910 * fragmented and becoming unavailable for high-order allocations.
5917 * pcp->high and pcp->batch values are related and dependent on one another:
5918 * ->batch must never be higher then ->high.
5919 * The following function updates them in a safe manner without read side
5922 * Any new users of pcp->batch and pcp->high should ensure they can cope with
5923 * those fields changing asynchronously (acording the the above rule).
5925 * mutex_is_locked(&pcp_batch_high_lock) required when calling this function
5926 * outside of boot time (or some other assurance that no concurrent updaters
5929 static void pageset_update(struct per_cpu_pages *pcp, unsigned long high,
5930 unsigned long batch)
5932 /* start with a fail safe value for batch */
5936 /* Update high, then batch, in order */
5943 /* a companion to pageset_set_high() */
5944 static void pageset_set_batch(struct per_cpu_pageset *p, unsigned long batch)
5946 pageset_update(&p->pcp, 6 * batch, max(1UL, 1 * batch));
5949 static void pageset_init(struct per_cpu_pageset *p)
5951 struct per_cpu_pages *pcp;
5954 memset(p, 0, sizeof(*p));
5957 for (migratetype = 0; migratetype < MIGRATE_PCPTYPES; migratetype++)
5958 INIT_LIST_HEAD(&pcp->lists[migratetype]);
5961 static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch)
5964 pageset_set_batch(p, batch);
5968 * pageset_set_high() sets the high water mark for hot per_cpu_pagelist
5969 * to the value high for the pageset p.
5971 static void pageset_set_high(struct per_cpu_pageset *p,
5974 unsigned long batch = max(1UL, high / 4);
5975 if ((high / 4) > (PAGE_SHIFT * 8))
5976 batch = PAGE_SHIFT * 8;
5978 pageset_update(&p->pcp, high, batch);
5981 static void pageset_set_high_and_batch(struct zone *zone,
5982 struct per_cpu_pageset *pcp)
5984 if (percpu_pagelist_fraction)
5985 pageset_set_high(pcp,
5986 (zone_managed_pages(zone) /
5987 percpu_pagelist_fraction));
5989 pageset_set_batch(pcp, zone_batchsize(zone));
5992 static void __meminit zone_pageset_init(struct zone *zone, int cpu)
5994 struct per_cpu_pageset *pcp = per_cpu_ptr(zone->pageset, cpu);
5997 pageset_set_high_and_batch(zone, pcp);
6000 void __meminit setup_zone_pageset(struct zone *zone)
6003 zone->pageset = alloc_percpu(struct per_cpu_pageset);
6004 for_each_possible_cpu(cpu)
6005 zone_pageset_init(zone, cpu);
6009 * Allocate per cpu pagesets and initialize them.
6010 * Before this call only boot pagesets were available.
6012 void __init setup_per_cpu_pageset(void)
6014 struct pglist_data *pgdat;
6017 for_each_populated_zone(zone)
6018 setup_zone_pageset(zone);
6020 for_each_online_pgdat(pgdat)
6021 pgdat->per_cpu_nodestats =
6022 alloc_percpu(struct per_cpu_nodestat);
6025 static __meminit void zone_pcp_init(struct zone *zone)
6028 * per cpu subsystem is not up at this point. The following code
6029 * relies on the ability of the linker to provide the
6030 * offset of a (static) per cpu variable into the per cpu area.
6032 zone->pageset = &boot_pageset;
6034 if (populated_zone(zone))
6035 printk(KERN_DEBUG " %s zone: %lu pages, LIFO batch:%u\n",
6036 zone->name, zone->present_pages,
6037 zone_batchsize(zone));
6040 void __meminit init_currently_empty_zone(struct zone *zone,
6041 unsigned long zone_start_pfn,
6044 struct pglist_data *pgdat = zone->zone_pgdat;
6045 int zone_idx = zone_idx(zone) + 1;
6047 if (zone_idx > pgdat->nr_zones)
6048 pgdat->nr_zones = zone_idx;
6050 zone->zone_start_pfn = zone_start_pfn;
6052 mminit_dprintk(MMINIT_TRACE, "memmap_init",
6053 "Initialising map node %d zone %lu pfns %lu -> %lu\n",
6055 (unsigned long)zone_idx(zone),
6056 zone_start_pfn, (zone_start_pfn + size));
6058 zone_init_free_lists(zone);
6059 zone->initialized = 1;
6062 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
6063 #ifndef CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID
6066 * Required by SPARSEMEM. Given a PFN, return what node the PFN is on.
6068 int __meminit __early_pfn_to_nid(unsigned long pfn,
6069 struct mminit_pfnnid_cache *state)
6071 unsigned long start_pfn, end_pfn;
6074 if (state->last_start <= pfn && pfn < state->last_end)
6075 return state->last_nid;
6077 nid = memblock_search_pfn_nid(pfn, &start_pfn, &end_pfn);
6078 if (nid != NUMA_NO_NODE) {
6079 state->last_start = start_pfn;
6080 state->last_end = end_pfn;
6081 state->last_nid = nid;
6086 #endif /* CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID */
6089 * free_bootmem_with_active_regions - Call memblock_free_early_nid for each active range
6090 * @nid: The node to free memory on. If MAX_NUMNODES, all nodes are freed.
6091 * @max_low_pfn: The highest PFN that will be passed to memblock_free_early_nid
6093 * If an architecture guarantees that all ranges registered contain no holes
6094 * and may be freed, this this function may be used instead of calling
6095 * memblock_free_early_nid() manually.
6097 void __init free_bootmem_with_active_regions(int nid, unsigned long max_low_pfn)
6099 unsigned long start_pfn, end_pfn;
6102 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, &this_nid) {
6103 start_pfn = min(start_pfn, max_low_pfn);
6104 end_pfn = min(end_pfn, max_low_pfn);
6106 if (start_pfn < end_pfn)
6107 memblock_free_early_nid(PFN_PHYS(start_pfn),
6108 (end_pfn - start_pfn) << PAGE_SHIFT,
6114 * sparse_memory_present_with_active_regions - Call memory_present for each active range
6115 * @nid: The node to call memory_present for. If MAX_NUMNODES, all nodes will be used.
6117 * If an architecture guarantees that all ranges registered contain no holes and may
6118 * be freed, this function may be used instead of calling memory_present() manually.
6120 void __init sparse_memory_present_with_active_regions(int nid)
6122 unsigned long start_pfn, end_pfn;
6125 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, &this_nid)
6126 memory_present(this_nid, start_pfn, end_pfn);
6130 * get_pfn_range_for_nid - Return the start and end page frames for a node
6131 * @nid: The nid to return the range for. If MAX_NUMNODES, the min and max PFN are returned.
6132 * @start_pfn: Passed by reference. On return, it will have the node start_pfn.
6133 * @end_pfn: Passed by reference. On return, it will have the node end_pfn.
6135 * It returns the start and end page frame of a node based on information
6136 * provided by memblock_set_node(). If called for a node
6137 * with no available memory, a warning is printed and the start and end
6140 void __init get_pfn_range_for_nid(unsigned int nid,
6141 unsigned long *start_pfn, unsigned long *end_pfn)
6143 unsigned long this_start_pfn, this_end_pfn;
6149 for_each_mem_pfn_range(i, nid, &this_start_pfn, &this_end_pfn, NULL) {
6150 *start_pfn = min(*start_pfn, this_start_pfn);
6151 *end_pfn = max(*end_pfn, this_end_pfn);
6154 if (*start_pfn == -1UL)
6159 * This finds a zone that can be used for ZONE_MOVABLE pages. The
6160 * assumption is made that zones within a node are ordered in monotonic
6161 * increasing memory addresses so that the "highest" populated zone is used
6163 static void __init find_usable_zone_for_movable(void)
6166 for (zone_index = MAX_NR_ZONES - 1; zone_index >= 0; zone_index--) {
6167 if (zone_index == ZONE_MOVABLE)
6170 if (arch_zone_highest_possible_pfn[zone_index] >
6171 arch_zone_lowest_possible_pfn[zone_index])
6175 VM_BUG_ON(zone_index == -1);
6176 movable_zone = zone_index;
6180 * The zone ranges provided by the architecture do not include ZONE_MOVABLE
6181 * because it is sized independent of architecture. Unlike the other zones,
6182 * the starting point for ZONE_MOVABLE is not fixed. It may be different
6183 * in each node depending on the size of each node and how evenly kernelcore
6184 * is distributed. This helper function adjusts the zone ranges
6185 * provided by the architecture for a given node by using the end of the
6186 * highest usable zone for ZONE_MOVABLE. This preserves the assumption that
6187 * zones within a node are in order of monotonic increases memory addresses
6189 static void __init adjust_zone_range_for_zone_movable(int nid,
6190 unsigned long zone_type,
6191 unsigned long node_start_pfn,
6192 unsigned long node_end_pfn,
6193 unsigned long *zone_start_pfn,
6194 unsigned long *zone_end_pfn)
6196 /* Only adjust if ZONE_MOVABLE is on this node */
6197 if (zone_movable_pfn[nid]) {
6198 /* Size ZONE_MOVABLE */
6199 if (zone_type == ZONE_MOVABLE) {
6200 *zone_start_pfn = zone_movable_pfn[nid];
6201 *zone_end_pfn = min(node_end_pfn,
6202 arch_zone_highest_possible_pfn[movable_zone]);
6204 /* Adjust for ZONE_MOVABLE starting within this range */
6205 } else if (!mirrored_kernelcore &&
6206 *zone_start_pfn < zone_movable_pfn[nid] &&
6207 *zone_end_pfn > zone_movable_pfn[nid]) {
6208 *zone_end_pfn = zone_movable_pfn[nid];
6210 /* Check if this whole range is within ZONE_MOVABLE */
6211 } else if (*zone_start_pfn >= zone_movable_pfn[nid])
6212 *zone_start_pfn = *zone_end_pfn;
6217 * Return the number of pages a zone spans in a node, including holes
6218 * present_pages = zone_spanned_pages_in_node() - zone_absent_pages_in_node()
6220 static unsigned long __init zone_spanned_pages_in_node(int nid,
6221 unsigned long zone_type,
6222 unsigned long node_start_pfn,
6223 unsigned long node_end_pfn,
6224 unsigned long *zone_start_pfn,
6225 unsigned long *zone_end_pfn,
6226 unsigned long *ignored)
6228 unsigned long zone_low = arch_zone_lowest_possible_pfn[zone_type];
6229 unsigned long zone_high = arch_zone_highest_possible_pfn[zone_type];
6230 /* When hotadd a new node from cpu_up(), the node should be empty */
6231 if (!node_start_pfn && !node_end_pfn)
6234 /* Get the start and end of the zone */
6235 *zone_start_pfn = clamp(node_start_pfn, zone_low, zone_high);
6236 *zone_end_pfn = clamp(node_end_pfn, zone_low, zone_high);
6237 adjust_zone_range_for_zone_movable(nid, zone_type,
6238 node_start_pfn, node_end_pfn,
6239 zone_start_pfn, zone_end_pfn);
6241 /* Check that this node has pages within the zone's required range */
6242 if (*zone_end_pfn < node_start_pfn || *zone_start_pfn > node_end_pfn)
6245 /* Move the zone boundaries inside the node if necessary */
6246 *zone_end_pfn = min(*zone_end_pfn, node_end_pfn);
6247 *zone_start_pfn = max(*zone_start_pfn, node_start_pfn);
6249 /* Return the spanned pages */
6250 return *zone_end_pfn - *zone_start_pfn;
6254 * Return the number of holes in a range on a node. If nid is MAX_NUMNODES,
6255 * then all holes in the requested range will be accounted for.
6257 unsigned long __init __absent_pages_in_range(int nid,
6258 unsigned long range_start_pfn,
6259 unsigned long range_end_pfn)
6261 unsigned long nr_absent = range_end_pfn - range_start_pfn;
6262 unsigned long start_pfn, end_pfn;
6265 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
6266 start_pfn = clamp(start_pfn, range_start_pfn, range_end_pfn);
6267 end_pfn = clamp(end_pfn, range_start_pfn, range_end_pfn);
6268 nr_absent -= end_pfn - start_pfn;
6274 * absent_pages_in_range - Return number of page frames in holes within a range
6275 * @start_pfn: The start PFN to start searching for holes
6276 * @end_pfn: The end PFN to stop searching for holes
6278 * Return: the number of pages frames in memory holes within a range.
6280 unsigned long __init absent_pages_in_range(unsigned long start_pfn,
6281 unsigned long end_pfn)
6283 return __absent_pages_in_range(MAX_NUMNODES, start_pfn, end_pfn);
6286 /* Return the number of page frames in holes in a zone on a node */
6287 static unsigned long __init zone_absent_pages_in_node(int nid,
6288 unsigned long zone_type,
6289 unsigned long node_start_pfn,
6290 unsigned long node_end_pfn,
6291 unsigned long *ignored)
6293 unsigned long zone_low = arch_zone_lowest_possible_pfn[zone_type];
6294 unsigned long zone_high = arch_zone_highest_possible_pfn[zone_type];
6295 unsigned long zone_start_pfn, zone_end_pfn;
6296 unsigned long nr_absent;
6298 /* When hotadd a new node from cpu_up(), the node should be empty */
6299 if (!node_start_pfn && !node_end_pfn)
6302 zone_start_pfn = clamp(node_start_pfn, zone_low, zone_high);
6303 zone_end_pfn = clamp(node_end_pfn, zone_low, zone_high);
6305 adjust_zone_range_for_zone_movable(nid, zone_type,
6306 node_start_pfn, node_end_pfn,
6307 &zone_start_pfn, &zone_end_pfn);
6308 nr_absent = __absent_pages_in_range(nid, zone_start_pfn, zone_end_pfn);
6311 * ZONE_MOVABLE handling.
6312 * Treat pages to be ZONE_MOVABLE in ZONE_NORMAL as absent pages
6315 if (mirrored_kernelcore && zone_movable_pfn[nid]) {
6316 unsigned long start_pfn, end_pfn;
6317 struct memblock_region *r;
6319 for_each_memblock(memory, r) {
6320 start_pfn = clamp(memblock_region_memory_base_pfn(r),
6321 zone_start_pfn, zone_end_pfn);
6322 end_pfn = clamp(memblock_region_memory_end_pfn(r),
6323 zone_start_pfn, zone_end_pfn);
6325 if (zone_type == ZONE_MOVABLE &&
6326 memblock_is_mirror(r))
6327 nr_absent += end_pfn - start_pfn;
6329 if (zone_type == ZONE_NORMAL &&
6330 !memblock_is_mirror(r))
6331 nr_absent += end_pfn - start_pfn;
6338 #else /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
6339 static inline unsigned long __init zone_spanned_pages_in_node(int nid,
6340 unsigned long zone_type,
6341 unsigned long node_start_pfn,
6342 unsigned long node_end_pfn,
6343 unsigned long *zone_start_pfn,
6344 unsigned long *zone_end_pfn,
6345 unsigned long *zones_size)
6349 *zone_start_pfn = node_start_pfn;
6350 for (zone = 0; zone < zone_type; zone++)
6351 *zone_start_pfn += zones_size[zone];
6353 *zone_end_pfn = *zone_start_pfn + zones_size[zone_type];
6355 return zones_size[zone_type];
6358 static inline unsigned long __init zone_absent_pages_in_node(int nid,
6359 unsigned long zone_type,
6360 unsigned long node_start_pfn,
6361 unsigned long node_end_pfn,
6362 unsigned long *zholes_size)
6367 return zholes_size[zone_type];
6370 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
6372 static void __init calculate_node_totalpages(struct pglist_data *pgdat,
6373 unsigned long node_start_pfn,
6374 unsigned long node_end_pfn,
6375 unsigned long *zones_size,
6376 unsigned long *zholes_size)
6378 unsigned long realtotalpages = 0, totalpages = 0;
6381 for (i = 0; i < MAX_NR_ZONES; i++) {
6382 struct zone *zone = pgdat->node_zones + i;
6383 unsigned long zone_start_pfn, zone_end_pfn;
6384 unsigned long size, real_size;
6386 size = zone_spanned_pages_in_node(pgdat->node_id, i,
6392 real_size = size - zone_absent_pages_in_node(pgdat->node_id, i,
6393 node_start_pfn, node_end_pfn,
6396 zone->zone_start_pfn = zone_start_pfn;
6398 zone->zone_start_pfn = 0;
6399 zone->spanned_pages = size;
6400 zone->present_pages = real_size;
6403 realtotalpages += real_size;
6406 pgdat->node_spanned_pages = totalpages;
6407 pgdat->node_present_pages = realtotalpages;
6408 printk(KERN_DEBUG "On node %d totalpages: %lu\n", pgdat->node_id,
6412 #ifndef CONFIG_SPARSEMEM
6414 * Calculate the size of the zone->blockflags rounded to an unsigned long
6415 * Start by making sure zonesize is a multiple of pageblock_order by rounding
6416 * up. Then use 1 NR_PAGEBLOCK_BITS worth of bits per pageblock, finally
6417 * round what is now in bits to nearest long in bits, then return it in
6420 static unsigned long __init usemap_size(unsigned long zone_start_pfn, unsigned long zonesize)
6422 unsigned long usemapsize;
6424 zonesize += zone_start_pfn & (pageblock_nr_pages-1);
6425 usemapsize = roundup(zonesize, pageblock_nr_pages);
6426 usemapsize = usemapsize >> pageblock_order;
6427 usemapsize *= NR_PAGEBLOCK_BITS;
6428 usemapsize = roundup(usemapsize, 8 * sizeof(unsigned long));
6430 return usemapsize / 8;
6433 static void __ref setup_usemap(struct pglist_data *pgdat,
6435 unsigned long zone_start_pfn,
6436 unsigned long zonesize)
6438 unsigned long usemapsize = usemap_size(zone_start_pfn, zonesize);
6439 zone->pageblock_flags = NULL;
6441 zone->pageblock_flags =
6442 memblock_alloc_node(usemapsize, SMP_CACHE_BYTES,
6444 if (!zone->pageblock_flags)
6445 panic("Failed to allocate %ld bytes for zone %s pageblock flags on node %d\n",
6446 usemapsize, zone->name, pgdat->node_id);
6450 static inline void setup_usemap(struct pglist_data *pgdat, struct zone *zone,
6451 unsigned long zone_start_pfn, unsigned long zonesize) {}
6452 #endif /* CONFIG_SPARSEMEM */
6454 #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
6456 /* Initialise the number of pages represented by NR_PAGEBLOCK_BITS */
6457 void __init set_pageblock_order(void)
6461 /* Check that pageblock_nr_pages has not already been setup */
6462 if (pageblock_order)
6465 if (HPAGE_SHIFT > PAGE_SHIFT)
6466 order = HUGETLB_PAGE_ORDER;
6468 order = MAX_ORDER - 1;
6471 * Assume the largest contiguous order of interest is a huge page.
6472 * This value may be variable depending on boot parameters on IA64 and
6475 pageblock_order = order;
6477 #else /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
6480 * When CONFIG_HUGETLB_PAGE_SIZE_VARIABLE is not set, set_pageblock_order()
6481 * is unused as pageblock_order is set at compile-time. See
6482 * include/linux/pageblock-flags.h for the values of pageblock_order based on
6485 void __init set_pageblock_order(void)
6489 #endif /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
6491 static unsigned long __init calc_memmap_size(unsigned long spanned_pages,
6492 unsigned long present_pages)
6494 unsigned long pages = spanned_pages;
6497 * Provide a more accurate estimation if there are holes within
6498 * the zone and SPARSEMEM is in use. If there are holes within the
6499 * zone, each populated memory region may cost us one or two extra
6500 * memmap pages due to alignment because memmap pages for each
6501 * populated regions may not be naturally aligned on page boundary.
6502 * So the (present_pages >> 4) heuristic is a tradeoff for that.
6504 if (spanned_pages > present_pages + (present_pages >> 4) &&
6505 IS_ENABLED(CONFIG_SPARSEMEM))
6506 pages = present_pages;
6508 return PAGE_ALIGN(pages * sizeof(struct page)) >> PAGE_SHIFT;
6511 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
6512 static void pgdat_init_split_queue(struct pglist_data *pgdat)
6514 spin_lock_init(&pgdat->split_queue_lock);
6515 INIT_LIST_HEAD(&pgdat->split_queue);
6516 pgdat->split_queue_len = 0;
6519 static void pgdat_init_split_queue(struct pglist_data *pgdat) {}
6522 #ifdef CONFIG_COMPACTION
6523 static void pgdat_init_kcompactd(struct pglist_data *pgdat)
6525 init_waitqueue_head(&pgdat->kcompactd_wait);
6528 static void pgdat_init_kcompactd(struct pglist_data *pgdat) {}
6531 static void __meminit pgdat_init_internals(struct pglist_data *pgdat)
6533 pgdat_resize_init(pgdat);
6535 pgdat_init_split_queue(pgdat);
6536 pgdat_init_kcompactd(pgdat);
6538 init_waitqueue_head(&pgdat->kswapd_wait);
6539 init_waitqueue_head(&pgdat->pfmemalloc_wait);
6541 pgdat_page_ext_init(pgdat);
6542 spin_lock_init(&pgdat->lru_lock);
6543 lruvec_init(node_lruvec(pgdat));
6546 static void __meminit zone_init_internals(struct zone *zone, enum zone_type idx, int nid,
6547 unsigned long remaining_pages)
6549 atomic_long_set(&zone->managed_pages, remaining_pages);
6550 zone_set_nid(zone, nid);
6551 zone->name = zone_names[idx];
6552 zone->zone_pgdat = NODE_DATA(nid);
6553 spin_lock_init(&zone->lock);
6554 zone_seqlock_init(zone);
6555 zone_pcp_init(zone);
6559 * Set up the zone data structures
6560 * - init pgdat internals
6561 * - init all zones belonging to this node
6563 * NOTE: this function is only called during memory hotplug
6565 #ifdef CONFIG_MEMORY_HOTPLUG
6566 void __ref free_area_init_core_hotplug(int nid)
6569 pg_data_t *pgdat = NODE_DATA(nid);
6571 pgdat_init_internals(pgdat);
6572 for (z = 0; z < MAX_NR_ZONES; z++)
6573 zone_init_internals(&pgdat->node_zones[z], z, nid, 0);
6578 * Set up the zone data structures:
6579 * - mark all pages reserved
6580 * - mark all memory queues empty
6581 * - clear the memory bitmaps
6583 * NOTE: pgdat should get zeroed by caller.
6584 * NOTE: this function is only called during early init.
6586 static void __init free_area_init_core(struct pglist_data *pgdat)
6589 int nid = pgdat->node_id;
6591 pgdat_init_internals(pgdat);
6592 pgdat->per_cpu_nodestats = &boot_nodestats;
6594 for (j = 0; j < MAX_NR_ZONES; j++) {
6595 struct zone *zone = pgdat->node_zones + j;
6596 unsigned long size, freesize, memmap_pages;
6597 unsigned long zone_start_pfn = zone->zone_start_pfn;
6599 size = zone->spanned_pages;
6600 freesize = zone->present_pages;
6603 * Adjust freesize so that it accounts for how much memory
6604 * is used by this zone for memmap. This affects the watermark
6605 * and per-cpu initialisations
6607 memmap_pages = calc_memmap_size(size, freesize);
6608 if (!is_highmem_idx(j)) {
6609 if (freesize >= memmap_pages) {
6610 freesize -= memmap_pages;
6613 " %s zone: %lu pages used for memmap\n",
6614 zone_names[j], memmap_pages);
6616 pr_warn(" %s zone: %lu pages exceeds freesize %lu\n",
6617 zone_names[j], memmap_pages, freesize);
6620 /* Account for reserved pages */
6621 if (j == 0 && freesize > dma_reserve) {
6622 freesize -= dma_reserve;
6623 printk(KERN_DEBUG " %s zone: %lu pages reserved\n",
6624 zone_names[0], dma_reserve);
6627 if (!is_highmem_idx(j))
6628 nr_kernel_pages += freesize;
6629 /* Charge for highmem memmap if there are enough kernel pages */
6630 else if (nr_kernel_pages > memmap_pages * 2)
6631 nr_kernel_pages -= memmap_pages;
6632 nr_all_pages += freesize;
6635 * Set an approximate value for lowmem here, it will be adjusted
6636 * when the bootmem allocator frees pages into the buddy system.
6637 * And all highmem pages will be managed by the buddy system.
6639 zone_init_internals(zone, j, nid, freesize);
6644 set_pageblock_order();
6645 setup_usemap(pgdat, zone, zone_start_pfn, size);
6646 init_currently_empty_zone(zone, zone_start_pfn, size);
6647 memmap_init(size, nid, j, zone_start_pfn);
6651 #ifdef CONFIG_FLAT_NODE_MEM_MAP
6652 static void __ref alloc_node_mem_map(struct pglist_data *pgdat)
6654 unsigned long __maybe_unused start = 0;
6655 unsigned long __maybe_unused offset = 0;
6657 /* Skip empty nodes */
6658 if (!pgdat->node_spanned_pages)
6661 start = pgdat->node_start_pfn & ~(MAX_ORDER_NR_PAGES - 1);
6662 offset = pgdat->node_start_pfn - start;
6663 /* ia64 gets its own node_mem_map, before this, without bootmem */
6664 if (!pgdat->node_mem_map) {
6665 unsigned long size, end;
6669 * The zone's endpoints aren't required to be MAX_ORDER
6670 * aligned but the node_mem_map endpoints must be in order
6671 * for the buddy allocator to function correctly.
6673 end = pgdat_end_pfn(pgdat);
6674 end = ALIGN(end, MAX_ORDER_NR_PAGES);
6675 size = (end - start) * sizeof(struct page);
6676 map = memblock_alloc_node(size, SMP_CACHE_BYTES,
6679 panic("Failed to allocate %ld bytes for node %d memory map\n",
6680 size, pgdat->node_id);
6681 pgdat->node_mem_map = map + offset;
6683 pr_debug("%s: node %d, pgdat %08lx, node_mem_map %08lx\n",
6684 __func__, pgdat->node_id, (unsigned long)pgdat,
6685 (unsigned long)pgdat->node_mem_map);
6686 #ifndef CONFIG_NEED_MULTIPLE_NODES
6688 * With no DISCONTIG, the global mem_map is just set as node 0's
6690 if (pgdat == NODE_DATA(0)) {
6691 mem_map = NODE_DATA(0)->node_mem_map;
6692 #if defined(CONFIG_HAVE_MEMBLOCK_NODE_MAP) || defined(CONFIG_FLATMEM)
6693 if (page_to_pfn(mem_map) != pgdat->node_start_pfn)
6695 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
6700 static void __ref alloc_node_mem_map(struct pglist_data *pgdat) { }
6701 #endif /* CONFIG_FLAT_NODE_MEM_MAP */
6703 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
6704 static inline void pgdat_set_deferred_range(pg_data_t *pgdat)
6706 pgdat->first_deferred_pfn = ULONG_MAX;
6709 static inline void pgdat_set_deferred_range(pg_data_t *pgdat) {}
6712 void __init free_area_init_node(int nid, unsigned long *zones_size,
6713 unsigned long node_start_pfn,
6714 unsigned long *zholes_size)
6716 pg_data_t *pgdat = NODE_DATA(nid);
6717 unsigned long start_pfn = 0;
6718 unsigned long end_pfn = 0;
6720 /* pg_data_t should be reset to zero when it's allocated */
6721 WARN_ON(pgdat->nr_zones || pgdat->kswapd_classzone_idx);
6723 pgdat->node_id = nid;
6724 pgdat->node_start_pfn = node_start_pfn;
6725 pgdat->per_cpu_nodestats = NULL;
6726 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
6727 get_pfn_range_for_nid(nid, &start_pfn, &end_pfn);
6728 pr_info("Initmem setup node %d [mem %#018Lx-%#018Lx]\n", nid,
6729 (u64)start_pfn << PAGE_SHIFT,
6730 end_pfn ? ((u64)end_pfn << PAGE_SHIFT) - 1 : 0);
6732 start_pfn = node_start_pfn;
6734 calculate_node_totalpages(pgdat, start_pfn, end_pfn,
6735 zones_size, zholes_size);
6737 alloc_node_mem_map(pgdat);
6738 pgdat_set_deferred_range(pgdat);
6740 free_area_init_core(pgdat);
6743 #if !defined(CONFIG_FLAT_NODE_MEM_MAP)
6745 * Zero all valid struct pages in range [spfn, epfn), return number of struct
6748 static u64 zero_pfn_range(unsigned long spfn, unsigned long epfn)
6753 for (pfn = spfn; pfn < epfn; pfn++) {
6754 if (!pfn_valid(ALIGN_DOWN(pfn, pageblock_nr_pages))) {
6755 pfn = ALIGN_DOWN(pfn, pageblock_nr_pages)
6756 + pageblock_nr_pages - 1;
6759 mm_zero_struct_page(pfn_to_page(pfn));
6767 * Only struct pages that are backed by physical memory are zeroed and
6768 * initialized by going through __init_single_page(). But, there are some
6769 * struct pages which are reserved in memblock allocator and their fields
6770 * may be accessed (for example page_to_pfn() on some configuration accesses
6771 * flags). We must explicitly zero those struct pages.
6773 * This function also addresses a similar issue where struct pages are left
6774 * uninitialized because the physical address range is not covered by
6775 * memblock.memory or memblock.reserved. That could happen when memblock
6776 * layout is manually configured via memmap=.
6778 void __init zero_resv_unavail(void)
6780 phys_addr_t start, end;
6782 phys_addr_t next = 0;
6785 * Loop through unavailable ranges not covered by memblock.memory.
6788 for_each_mem_range(i, &memblock.memory, NULL,
6789 NUMA_NO_NODE, MEMBLOCK_NONE, &start, &end, NULL) {
6791 pgcnt += zero_pfn_range(PFN_DOWN(next), PFN_UP(start));
6794 pgcnt += zero_pfn_range(PFN_DOWN(next), max_pfn);
6797 * Struct pages that do not have backing memory. This could be because
6798 * firmware is using some of this memory, or for some other reasons.
6801 pr_info("Zeroed struct page in unavailable ranges: %lld pages", pgcnt);
6803 #endif /* !CONFIG_FLAT_NODE_MEM_MAP */
6805 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
6807 #if MAX_NUMNODES > 1
6809 * Figure out the number of possible node ids.
6811 void __init setup_nr_node_ids(void)
6813 unsigned int highest;
6815 highest = find_last_bit(node_possible_map.bits, MAX_NUMNODES);
6816 nr_node_ids = highest + 1;
6821 * node_map_pfn_alignment - determine the maximum internode alignment
6823 * This function should be called after node map is populated and sorted.
6824 * It calculates the maximum power of two alignment which can distinguish
6827 * For example, if all nodes are 1GiB and aligned to 1GiB, the return value
6828 * would indicate 1GiB alignment with (1 << (30 - PAGE_SHIFT)). If the
6829 * nodes are shifted by 256MiB, 256MiB. Note that if only the last node is
6830 * shifted, 1GiB is enough and this function will indicate so.
6832 * This is used to test whether pfn -> nid mapping of the chosen memory
6833 * model has fine enough granularity to avoid incorrect mapping for the
6834 * populated node map.
6836 * Return: the determined alignment in pfn's. 0 if there is no alignment
6837 * requirement (single node).
6839 unsigned long __init node_map_pfn_alignment(void)
6841 unsigned long accl_mask = 0, last_end = 0;
6842 unsigned long start, end, mask;
6843 int last_nid = NUMA_NO_NODE;
6846 for_each_mem_pfn_range(i, MAX_NUMNODES, &start, &end, &nid) {
6847 if (!start || last_nid < 0 || last_nid == nid) {
6854 * Start with a mask granular enough to pin-point to the
6855 * start pfn and tick off bits one-by-one until it becomes
6856 * too coarse to separate the current node from the last.
6858 mask = ~((1 << __ffs(start)) - 1);
6859 while (mask && last_end <= (start & (mask << 1)))
6862 /* accumulate all internode masks */
6866 /* convert mask to number of pages */
6867 return ~accl_mask + 1;
6870 /* Find the lowest pfn for a node */
6871 static unsigned long __init find_min_pfn_for_node(int nid)
6873 unsigned long min_pfn = ULONG_MAX;
6874 unsigned long start_pfn;
6877 for_each_mem_pfn_range(i, nid, &start_pfn, NULL, NULL)
6878 min_pfn = min(min_pfn, start_pfn);
6880 if (min_pfn == ULONG_MAX) {
6881 pr_warn("Could not find start_pfn for node %d\n", nid);
6889 * find_min_pfn_with_active_regions - Find the minimum PFN registered
6891 * Return: the minimum PFN based on information provided via
6892 * memblock_set_node().
6894 unsigned long __init find_min_pfn_with_active_regions(void)
6896 return find_min_pfn_for_node(MAX_NUMNODES);
6900 * early_calculate_totalpages()
6901 * Sum pages in active regions for movable zone.
6902 * Populate N_MEMORY for calculating usable_nodes.
6904 static unsigned long __init early_calculate_totalpages(void)
6906 unsigned long totalpages = 0;
6907 unsigned long start_pfn, end_pfn;
6910 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid) {
6911 unsigned long pages = end_pfn - start_pfn;
6913 totalpages += pages;
6915 node_set_state(nid, N_MEMORY);
6921 * Find the PFN the Movable zone begins in each node. Kernel memory
6922 * is spread evenly between nodes as long as the nodes have enough
6923 * memory. When they don't, some nodes will have more kernelcore than
6926 static void __init find_zone_movable_pfns_for_nodes(void)
6929 unsigned long usable_startpfn;
6930 unsigned long kernelcore_node, kernelcore_remaining;
6931 /* save the state before borrow the nodemask */
6932 nodemask_t saved_node_state = node_states[N_MEMORY];
6933 unsigned long totalpages = early_calculate_totalpages();
6934 int usable_nodes = nodes_weight(node_states[N_MEMORY]);
6935 struct memblock_region *r;
6937 /* Need to find movable_zone earlier when movable_node is specified. */
6938 find_usable_zone_for_movable();
6941 * If movable_node is specified, ignore kernelcore and movablecore
6944 if (movable_node_is_enabled()) {
6945 for_each_memblock(memory, r) {
6946 if (!memblock_is_hotpluggable(r))
6951 usable_startpfn = PFN_DOWN(r->base);
6952 zone_movable_pfn[nid] = zone_movable_pfn[nid] ?
6953 min(usable_startpfn, zone_movable_pfn[nid]) :
6961 * If kernelcore=mirror is specified, ignore movablecore option
6963 if (mirrored_kernelcore) {
6964 bool mem_below_4gb_not_mirrored = false;
6966 for_each_memblock(memory, r) {
6967 if (memblock_is_mirror(r))
6972 usable_startpfn = memblock_region_memory_base_pfn(r);
6974 if (usable_startpfn < 0x100000) {
6975 mem_below_4gb_not_mirrored = true;
6979 zone_movable_pfn[nid] = zone_movable_pfn[nid] ?
6980 min(usable_startpfn, zone_movable_pfn[nid]) :
6984 if (mem_below_4gb_not_mirrored)
6985 pr_warn("This configuration results in unmirrored kernel memory.");
6991 * If kernelcore=nn% or movablecore=nn% was specified, calculate the
6992 * amount of necessary memory.
6994 if (required_kernelcore_percent)
6995 required_kernelcore = (totalpages * 100 * required_kernelcore_percent) /
6997 if (required_movablecore_percent)
6998 required_movablecore = (totalpages * 100 * required_movablecore_percent) /
7002 * If movablecore= was specified, calculate what size of
7003 * kernelcore that corresponds so that memory usable for
7004 * any allocation type is evenly spread. If both kernelcore
7005 * and movablecore are specified, then the value of kernelcore
7006 * will be used for required_kernelcore if it's greater than
7007 * what movablecore would have allowed.
7009 if (required_movablecore) {
7010 unsigned long corepages;
7013 * Round-up so that ZONE_MOVABLE is at least as large as what
7014 * was requested by the user
7016 required_movablecore =
7017 roundup(required_movablecore, MAX_ORDER_NR_PAGES);
7018 required_movablecore = min(totalpages, required_movablecore);
7019 corepages = totalpages - required_movablecore;
7021 required_kernelcore = max(required_kernelcore, corepages);
7025 * If kernelcore was not specified or kernelcore size is larger
7026 * than totalpages, there is no ZONE_MOVABLE.
7028 if (!required_kernelcore || required_kernelcore >= totalpages)
7031 /* usable_startpfn is the lowest possible pfn ZONE_MOVABLE can be at */
7032 usable_startpfn = arch_zone_lowest_possible_pfn[movable_zone];
7035 /* Spread kernelcore memory as evenly as possible throughout nodes */
7036 kernelcore_node = required_kernelcore / usable_nodes;
7037 for_each_node_state(nid, N_MEMORY) {
7038 unsigned long start_pfn, end_pfn;
7041 * Recalculate kernelcore_node if the division per node
7042 * now exceeds what is necessary to satisfy the requested
7043 * amount of memory for the kernel
7045 if (required_kernelcore < kernelcore_node)
7046 kernelcore_node = required_kernelcore / usable_nodes;
7049 * As the map is walked, we track how much memory is usable
7050 * by the kernel using kernelcore_remaining. When it is
7051 * 0, the rest of the node is usable by ZONE_MOVABLE
7053 kernelcore_remaining = kernelcore_node;
7055 /* Go through each range of PFNs within this node */
7056 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
7057 unsigned long size_pages;
7059 start_pfn = max(start_pfn, zone_movable_pfn[nid]);
7060 if (start_pfn >= end_pfn)
7063 /* Account for what is only usable for kernelcore */
7064 if (start_pfn < usable_startpfn) {
7065 unsigned long kernel_pages;
7066 kernel_pages = min(end_pfn, usable_startpfn)
7069 kernelcore_remaining -= min(kernel_pages,
7070 kernelcore_remaining);
7071 required_kernelcore -= min(kernel_pages,
7072 required_kernelcore);
7074 /* Continue if range is now fully accounted */
7075 if (end_pfn <= usable_startpfn) {
7078 * Push zone_movable_pfn to the end so
7079 * that if we have to rebalance
7080 * kernelcore across nodes, we will
7081 * not double account here
7083 zone_movable_pfn[nid] = end_pfn;
7086 start_pfn = usable_startpfn;
7090 * The usable PFN range for ZONE_MOVABLE is from
7091 * start_pfn->end_pfn. Calculate size_pages as the
7092 * number of pages used as kernelcore
7094 size_pages = end_pfn - start_pfn;
7095 if (size_pages > kernelcore_remaining)
7096 size_pages = kernelcore_remaining;
7097 zone_movable_pfn[nid] = start_pfn + size_pages;
7100 * Some kernelcore has been met, update counts and
7101 * break if the kernelcore for this node has been
7104 required_kernelcore -= min(required_kernelcore,
7106 kernelcore_remaining -= size_pages;
7107 if (!kernelcore_remaining)
7113 * If there is still required_kernelcore, we do another pass with one
7114 * less node in the count. This will push zone_movable_pfn[nid] further
7115 * along on the nodes that still have memory until kernelcore is
7119 if (usable_nodes && required_kernelcore > usable_nodes)
7123 /* Align start of ZONE_MOVABLE on all nids to MAX_ORDER_NR_PAGES */
7124 for (nid = 0; nid < MAX_NUMNODES; nid++)
7125 zone_movable_pfn[nid] =
7126 roundup(zone_movable_pfn[nid], MAX_ORDER_NR_PAGES);
7129 /* restore the node_state */
7130 node_states[N_MEMORY] = saved_node_state;
7133 /* Any regular or high memory on that node ? */
7134 static void check_for_memory(pg_data_t *pgdat, int nid)
7136 enum zone_type zone_type;
7138 for (zone_type = 0; zone_type <= ZONE_MOVABLE - 1; zone_type++) {
7139 struct zone *zone = &pgdat->node_zones[zone_type];
7140 if (populated_zone(zone)) {
7141 if (IS_ENABLED(CONFIG_HIGHMEM))
7142 node_set_state(nid, N_HIGH_MEMORY);
7143 if (zone_type <= ZONE_NORMAL)
7144 node_set_state(nid, N_NORMAL_MEMORY);
7151 * free_area_init_nodes - Initialise all pg_data_t and zone data
7152 * @max_zone_pfn: an array of max PFNs for each zone
7154 * This will call free_area_init_node() for each active node in the system.
7155 * Using the page ranges provided by memblock_set_node(), the size of each
7156 * zone in each node and their holes is calculated. If the maximum PFN
7157 * between two adjacent zones match, it is assumed that the zone is empty.
7158 * For example, if arch_max_dma_pfn == arch_max_dma32_pfn, it is assumed
7159 * that arch_max_dma32_pfn has no pages. It is also assumed that a zone
7160 * starts where the previous one ended. For example, ZONE_DMA32 starts
7161 * at arch_max_dma_pfn.
7163 void __init free_area_init_nodes(unsigned long *max_zone_pfn)
7165 unsigned long start_pfn, end_pfn;
7168 /* Record where the zone boundaries are */
7169 memset(arch_zone_lowest_possible_pfn, 0,
7170 sizeof(arch_zone_lowest_possible_pfn));
7171 memset(arch_zone_highest_possible_pfn, 0,
7172 sizeof(arch_zone_highest_possible_pfn));
7174 start_pfn = find_min_pfn_with_active_regions();
7176 for (i = 0; i < MAX_NR_ZONES; i++) {
7177 if (i == ZONE_MOVABLE)
7180 end_pfn = max(max_zone_pfn[i], start_pfn);
7181 arch_zone_lowest_possible_pfn[i] = start_pfn;
7182 arch_zone_highest_possible_pfn[i] = end_pfn;
7184 start_pfn = end_pfn;
7187 /* Find the PFNs that ZONE_MOVABLE begins at in each node */
7188 memset(zone_movable_pfn, 0, sizeof(zone_movable_pfn));
7189 find_zone_movable_pfns_for_nodes();
7191 /* Print out the zone ranges */
7192 pr_info("Zone ranges:\n");
7193 for (i = 0; i < MAX_NR_ZONES; i++) {
7194 if (i == ZONE_MOVABLE)
7196 pr_info(" %-8s ", zone_names[i]);
7197 if (arch_zone_lowest_possible_pfn[i] ==
7198 arch_zone_highest_possible_pfn[i])
7201 pr_cont("[mem %#018Lx-%#018Lx]\n",
7202 (u64)arch_zone_lowest_possible_pfn[i]
7204 ((u64)arch_zone_highest_possible_pfn[i]
7205 << PAGE_SHIFT) - 1);
7208 /* Print out the PFNs ZONE_MOVABLE begins at in each node */
7209 pr_info("Movable zone start for each node\n");
7210 for (i = 0; i < MAX_NUMNODES; i++) {
7211 if (zone_movable_pfn[i])
7212 pr_info(" Node %d: %#018Lx\n", i,
7213 (u64)zone_movable_pfn[i] << PAGE_SHIFT);
7216 /* Print out the early node map */
7217 pr_info("Early memory node ranges\n");
7218 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid)
7219 pr_info(" node %3d: [mem %#018Lx-%#018Lx]\n", nid,
7220 (u64)start_pfn << PAGE_SHIFT,
7221 ((u64)end_pfn << PAGE_SHIFT) - 1);
7223 /* Initialise every node */
7224 mminit_verify_pageflags_layout();
7225 setup_nr_node_ids();
7226 zero_resv_unavail();
7227 for_each_online_node(nid) {
7228 pg_data_t *pgdat = NODE_DATA(nid);
7229 free_area_init_node(nid, NULL,
7230 find_min_pfn_for_node(nid), NULL);
7232 /* Any memory on that node */
7233 if (pgdat->node_present_pages)
7234 node_set_state(nid, N_MEMORY);
7235 check_for_memory(pgdat, nid);
7239 static int __init cmdline_parse_core(char *p, unsigned long *core,
7240 unsigned long *percent)
7242 unsigned long long coremem;
7248 /* Value may be a percentage of total memory, otherwise bytes */
7249 coremem = simple_strtoull(p, &endptr, 0);
7250 if (*endptr == '%') {
7251 /* Paranoid check for percent values greater than 100 */
7252 WARN_ON(coremem > 100);
7256 coremem = memparse(p, &p);
7257 /* Paranoid check that UL is enough for the coremem value */
7258 WARN_ON((coremem >> PAGE_SHIFT) > ULONG_MAX);
7260 *core = coremem >> PAGE_SHIFT;
7267 * kernelcore=size sets the amount of memory for use for allocations that
7268 * cannot be reclaimed or migrated.
7270 static int __init cmdline_parse_kernelcore(char *p)
7272 /* parse kernelcore=mirror */
7273 if (parse_option_str(p, "mirror")) {
7274 mirrored_kernelcore = true;
7278 return cmdline_parse_core(p, &required_kernelcore,
7279 &required_kernelcore_percent);
7283 * movablecore=size sets the amount of memory for use for allocations that
7284 * can be reclaimed or migrated.
7286 static int __init cmdline_parse_movablecore(char *p)
7288 return cmdline_parse_core(p, &required_movablecore,
7289 &required_movablecore_percent);
7292 early_param("kernelcore", cmdline_parse_kernelcore);
7293 early_param("movablecore", cmdline_parse_movablecore);
7295 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
7297 void adjust_managed_page_count(struct page *page, long count)
7299 atomic_long_add(count, &page_zone(page)->managed_pages);
7300 totalram_pages_add(count);
7301 #ifdef CONFIG_HIGHMEM
7302 if (PageHighMem(page))
7303 totalhigh_pages_add(count);
7306 EXPORT_SYMBOL(adjust_managed_page_count);
7308 unsigned long free_reserved_area(void *start, void *end, int poison, const char *s)
7311 unsigned long pages = 0;
7313 start = (void *)PAGE_ALIGN((unsigned long)start);
7314 end = (void *)((unsigned long)end & PAGE_MASK);
7315 for (pos = start; pos < end; pos += PAGE_SIZE, pages++) {
7316 struct page *page = virt_to_page(pos);
7317 void *direct_map_addr;
7320 * 'direct_map_addr' might be different from 'pos'
7321 * because some architectures' virt_to_page()
7322 * work with aliases. Getting the direct map
7323 * address ensures that we get a _writeable_
7324 * alias for the memset().
7326 direct_map_addr = page_address(page);
7327 if ((unsigned int)poison <= 0xFF)
7328 memset(direct_map_addr, poison, PAGE_SIZE);
7330 free_reserved_page(page);
7334 pr_info("Freeing %s memory: %ldK\n",
7335 s, pages << (PAGE_SHIFT - 10));
7340 #ifdef CONFIG_HIGHMEM
7341 void free_highmem_page(struct page *page)
7343 __free_reserved_page(page);
7344 totalram_pages_inc();
7345 atomic_long_inc(&page_zone(page)->managed_pages);
7346 totalhigh_pages_inc();
7351 void __init mem_init_print_info(const char *str)
7353 unsigned long physpages, codesize, datasize, rosize, bss_size;
7354 unsigned long init_code_size, init_data_size;
7356 physpages = get_num_physpages();
7357 codesize = _etext - _stext;
7358 datasize = _edata - _sdata;
7359 rosize = __end_rodata - __start_rodata;
7360 bss_size = __bss_stop - __bss_start;
7361 init_data_size = __init_end - __init_begin;
7362 init_code_size = _einittext - _sinittext;
7365 * Detect special cases and adjust section sizes accordingly:
7366 * 1) .init.* may be embedded into .data sections
7367 * 2) .init.text.* may be out of [__init_begin, __init_end],
7368 * please refer to arch/tile/kernel/vmlinux.lds.S.
7369 * 3) .rodata.* may be embedded into .text or .data sections.
7371 #define adj_init_size(start, end, size, pos, adj) \
7373 if (start <= pos && pos < end && size > adj) \
7377 adj_init_size(__init_begin, __init_end, init_data_size,
7378 _sinittext, init_code_size);
7379 adj_init_size(_stext, _etext, codesize, _sinittext, init_code_size);
7380 adj_init_size(_sdata, _edata, datasize, __init_begin, init_data_size);
7381 adj_init_size(_stext, _etext, codesize, __start_rodata, rosize);
7382 adj_init_size(_sdata, _edata, datasize, __start_rodata, rosize);
7384 #undef adj_init_size
7386 pr_info("Memory: %luK/%luK available (%luK kernel code, %luK rwdata, %luK rodata, %luK init, %luK bss, %luK reserved, %luK cma-reserved"
7387 #ifdef CONFIG_HIGHMEM
7391 nr_free_pages() << (PAGE_SHIFT - 10),
7392 physpages << (PAGE_SHIFT - 10),
7393 codesize >> 10, datasize >> 10, rosize >> 10,
7394 (init_data_size + init_code_size) >> 10, bss_size >> 10,
7395 (physpages - totalram_pages() - totalcma_pages) << (PAGE_SHIFT - 10),
7396 totalcma_pages << (PAGE_SHIFT - 10),
7397 #ifdef CONFIG_HIGHMEM
7398 totalhigh_pages() << (PAGE_SHIFT - 10),
7400 str ? ", " : "", str ? str : "");
7404 * set_dma_reserve - set the specified number of pages reserved in the first zone
7405 * @new_dma_reserve: The number of pages to mark reserved
7407 * The per-cpu batchsize and zone watermarks are determined by managed_pages.
7408 * In the DMA zone, a significant percentage may be consumed by kernel image
7409 * and other unfreeable allocations which can skew the watermarks badly. This
7410 * function may optionally be used to account for unfreeable pages in the
7411 * first zone (e.g., ZONE_DMA). The effect will be lower watermarks and
7412 * smaller per-cpu batchsize.
7414 void __init set_dma_reserve(unsigned long new_dma_reserve)
7416 dma_reserve = new_dma_reserve;
7419 void __init free_area_init(unsigned long *zones_size)
7421 zero_resv_unavail();
7422 free_area_init_node(0, zones_size,
7423 __pa(PAGE_OFFSET) >> PAGE_SHIFT, NULL);
7426 static int page_alloc_cpu_dead(unsigned int cpu)
7429 lru_add_drain_cpu(cpu);
7433 * Spill the event counters of the dead processor
7434 * into the current processors event counters.
7435 * This artificially elevates the count of the current
7438 vm_events_fold_cpu(cpu);
7441 * Zero the differential counters of the dead processor
7442 * so that the vm statistics are consistent.
7444 * This is only okay since the processor is dead and cannot
7445 * race with what we are doing.
7447 cpu_vm_stats_fold(cpu);
7451 void __init page_alloc_init(void)
7455 ret = cpuhp_setup_state_nocalls(CPUHP_PAGE_ALLOC_DEAD,
7456 "mm/page_alloc:dead", NULL,
7457 page_alloc_cpu_dead);
7462 * calculate_totalreserve_pages - called when sysctl_lowmem_reserve_ratio
7463 * or min_free_kbytes changes.
7465 static void calculate_totalreserve_pages(void)
7467 struct pglist_data *pgdat;
7468 unsigned long reserve_pages = 0;
7469 enum zone_type i, j;
7471 for_each_online_pgdat(pgdat) {
7473 pgdat->totalreserve_pages = 0;
7475 for (i = 0; i < MAX_NR_ZONES; i++) {
7476 struct zone *zone = pgdat->node_zones + i;
7478 unsigned long managed_pages = zone_managed_pages(zone);
7480 /* Find valid and maximum lowmem_reserve in the zone */
7481 for (j = i; j < MAX_NR_ZONES; j++) {
7482 if (zone->lowmem_reserve[j] > max)
7483 max = zone->lowmem_reserve[j];
7486 /* we treat the high watermark as reserved pages. */
7487 max += high_wmark_pages(zone);
7489 if (max > managed_pages)
7490 max = managed_pages;
7492 pgdat->totalreserve_pages += max;
7494 reserve_pages += max;
7497 totalreserve_pages = reserve_pages;
7501 * setup_per_zone_lowmem_reserve - called whenever
7502 * sysctl_lowmem_reserve_ratio changes. Ensures that each zone
7503 * has a correct pages reserved value, so an adequate number of
7504 * pages are left in the zone after a successful __alloc_pages().
7506 static void setup_per_zone_lowmem_reserve(void)
7508 struct pglist_data *pgdat;
7509 enum zone_type j, idx;
7511 for_each_online_pgdat(pgdat) {
7512 for (j = 0; j < MAX_NR_ZONES; j++) {
7513 struct zone *zone = pgdat->node_zones + j;
7514 unsigned long managed_pages = zone_managed_pages(zone);
7516 zone->lowmem_reserve[j] = 0;
7520 struct zone *lower_zone;
7523 lower_zone = pgdat->node_zones + idx;
7525 if (sysctl_lowmem_reserve_ratio[idx] < 1) {
7526 sysctl_lowmem_reserve_ratio[idx] = 0;
7527 lower_zone->lowmem_reserve[j] = 0;
7529 lower_zone->lowmem_reserve[j] =
7530 managed_pages / sysctl_lowmem_reserve_ratio[idx];
7532 managed_pages += zone_managed_pages(lower_zone);
7537 /* update totalreserve_pages */
7538 calculate_totalreserve_pages();
7541 static void __setup_per_zone_wmarks(void)
7543 unsigned long pages_min = min_free_kbytes >> (PAGE_SHIFT - 10);
7544 unsigned long lowmem_pages = 0;
7546 unsigned long flags;
7548 /* Calculate total number of !ZONE_HIGHMEM pages */
7549 for_each_zone(zone) {
7550 if (!is_highmem(zone))
7551 lowmem_pages += zone_managed_pages(zone);
7554 for_each_zone(zone) {
7557 spin_lock_irqsave(&zone->lock, flags);
7558 tmp = (u64)pages_min * zone_managed_pages(zone);
7559 do_div(tmp, lowmem_pages);
7560 if (is_highmem(zone)) {
7562 * __GFP_HIGH and PF_MEMALLOC allocations usually don't
7563 * need highmem pages, so cap pages_min to a small
7566 * The WMARK_HIGH-WMARK_LOW and (WMARK_LOW-WMARK_MIN)
7567 * deltas control async page reclaim, and so should
7568 * not be capped for highmem.
7570 unsigned long min_pages;
7572 min_pages = zone_managed_pages(zone) / 1024;
7573 min_pages = clamp(min_pages, SWAP_CLUSTER_MAX, 128UL);
7574 zone->_watermark[WMARK_MIN] = min_pages;
7577 * If it's a lowmem zone, reserve a number of pages
7578 * proportionate to the zone's size.
7580 zone->_watermark[WMARK_MIN] = tmp;
7584 * Set the kswapd watermarks distance according to the
7585 * scale factor in proportion to available memory, but
7586 * ensure a minimum size on small systems.
7588 tmp = max_t(u64, tmp >> 2,
7589 mult_frac(zone_managed_pages(zone),
7590 watermark_scale_factor, 10000));
7592 zone->_watermark[WMARK_LOW] = min_wmark_pages(zone) + tmp;
7593 zone->_watermark[WMARK_HIGH] = min_wmark_pages(zone) + tmp * 2;
7594 zone->watermark_boost = 0;
7596 spin_unlock_irqrestore(&zone->lock, flags);
7599 /* update totalreserve_pages */
7600 calculate_totalreserve_pages();
7604 * setup_per_zone_wmarks - called when min_free_kbytes changes
7605 * or when memory is hot-{added|removed}
7607 * Ensures that the watermark[min,low,high] values for each zone are set
7608 * correctly with respect to min_free_kbytes.
7610 void setup_per_zone_wmarks(void)
7612 static DEFINE_SPINLOCK(lock);
7615 __setup_per_zone_wmarks();
7620 * Initialise min_free_kbytes.
7622 * For small machines we want it small (128k min). For large machines
7623 * we want it large (64MB max). But it is not linear, because network
7624 * bandwidth does not increase linearly with machine size. We use
7626 * min_free_kbytes = 4 * sqrt(lowmem_kbytes), for better accuracy:
7627 * min_free_kbytes = sqrt(lowmem_kbytes * 16)
7643 int __meminit init_per_zone_wmark_min(void)
7645 unsigned long lowmem_kbytes;
7646 int new_min_free_kbytes;
7648 lowmem_kbytes = nr_free_buffer_pages() * (PAGE_SIZE >> 10);
7649 new_min_free_kbytes = int_sqrt(lowmem_kbytes * 16);
7651 if (new_min_free_kbytes > user_min_free_kbytes) {
7652 min_free_kbytes = new_min_free_kbytes;
7653 if (min_free_kbytes < 128)
7654 min_free_kbytes = 128;
7655 if (min_free_kbytes > 65536)
7656 min_free_kbytes = 65536;
7658 pr_warn("min_free_kbytes is not updated to %d because user defined value %d is preferred\n",
7659 new_min_free_kbytes, user_min_free_kbytes);
7661 setup_per_zone_wmarks();
7662 refresh_zone_stat_thresholds();
7663 setup_per_zone_lowmem_reserve();
7666 setup_min_unmapped_ratio();
7667 setup_min_slab_ratio();
7672 core_initcall(init_per_zone_wmark_min)
7675 * min_free_kbytes_sysctl_handler - just a wrapper around proc_dointvec() so
7676 * that we can call two helper functions whenever min_free_kbytes
7679 int min_free_kbytes_sysctl_handler(struct ctl_table *table, int write,
7680 void __user *buffer, size_t *length, loff_t *ppos)
7684 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
7689 user_min_free_kbytes = min_free_kbytes;
7690 setup_per_zone_wmarks();
7695 int watermark_boost_factor_sysctl_handler(struct ctl_table *table, int write,
7696 void __user *buffer, size_t *length, loff_t *ppos)
7700 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
7707 int watermark_scale_factor_sysctl_handler(struct ctl_table *table, int write,
7708 void __user *buffer, size_t *length, loff_t *ppos)
7712 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
7717 setup_per_zone_wmarks();
7723 static void setup_min_unmapped_ratio(void)
7728 for_each_online_pgdat(pgdat)
7729 pgdat->min_unmapped_pages = 0;
7732 zone->zone_pgdat->min_unmapped_pages += (zone_managed_pages(zone) *
7733 sysctl_min_unmapped_ratio) / 100;
7737 int sysctl_min_unmapped_ratio_sysctl_handler(struct ctl_table *table, int write,
7738 void __user *buffer, size_t *length, loff_t *ppos)
7742 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
7746 setup_min_unmapped_ratio();
7751 static void setup_min_slab_ratio(void)
7756 for_each_online_pgdat(pgdat)
7757 pgdat->min_slab_pages = 0;
7760 zone->zone_pgdat->min_slab_pages += (zone_managed_pages(zone) *
7761 sysctl_min_slab_ratio) / 100;
7764 int sysctl_min_slab_ratio_sysctl_handler(struct ctl_table *table, int write,
7765 void __user *buffer, size_t *length, loff_t *ppos)
7769 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
7773 setup_min_slab_ratio();
7780 * lowmem_reserve_ratio_sysctl_handler - just a wrapper around
7781 * proc_dointvec() so that we can call setup_per_zone_lowmem_reserve()
7782 * whenever sysctl_lowmem_reserve_ratio changes.
7784 * The reserve ratio obviously has absolutely no relation with the
7785 * minimum watermarks. The lowmem reserve ratio can only make sense
7786 * if in function of the boot time zone sizes.
7788 int lowmem_reserve_ratio_sysctl_handler(struct ctl_table *table, int write,
7789 void __user *buffer, size_t *length, loff_t *ppos)
7791 proc_dointvec_minmax(table, write, buffer, length, ppos);
7792 setup_per_zone_lowmem_reserve();
7797 * percpu_pagelist_fraction - changes the pcp->high for each zone on each
7798 * cpu. It is the fraction of total pages in each zone that a hot per cpu
7799 * pagelist can have before it gets flushed back to buddy allocator.
7801 int percpu_pagelist_fraction_sysctl_handler(struct ctl_table *table, int write,
7802 void __user *buffer, size_t *length, loff_t *ppos)
7805 int old_percpu_pagelist_fraction;
7808 mutex_lock(&pcp_batch_high_lock);
7809 old_percpu_pagelist_fraction = percpu_pagelist_fraction;
7811 ret = proc_dointvec_minmax(table, write, buffer, length, ppos);
7812 if (!write || ret < 0)
7815 /* Sanity checking to avoid pcp imbalance */
7816 if (percpu_pagelist_fraction &&
7817 percpu_pagelist_fraction < MIN_PERCPU_PAGELIST_FRACTION) {
7818 percpu_pagelist_fraction = old_percpu_pagelist_fraction;
7824 if (percpu_pagelist_fraction == old_percpu_pagelist_fraction)
7827 for_each_populated_zone(zone) {
7830 for_each_possible_cpu(cpu)
7831 pageset_set_high_and_batch(zone,
7832 per_cpu_ptr(zone->pageset, cpu));
7835 mutex_unlock(&pcp_batch_high_lock);
7840 int hashdist = HASHDIST_DEFAULT;
7842 static int __init set_hashdist(char *str)
7846 hashdist = simple_strtoul(str, &str, 0);
7849 __setup("hashdist=", set_hashdist);
7852 #ifndef __HAVE_ARCH_RESERVED_KERNEL_PAGES
7854 * Returns the number of pages that arch has reserved but
7855 * is not known to alloc_large_system_hash().
7857 static unsigned long __init arch_reserved_kernel_pages(void)
7864 * Adaptive scale is meant to reduce sizes of hash tables on large memory
7865 * machines. As memory size is increased the scale is also increased but at
7866 * slower pace. Starting from ADAPT_SCALE_BASE (64G), every time memory
7867 * quadruples the scale is increased by one, which means the size of hash table
7868 * only doubles, instead of quadrupling as well.
7869 * Because 32-bit systems cannot have large physical memory, where this scaling
7870 * makes sense, it is disabled on such platforms.
7872 #if __BITS_PER_LONG > 32
7873 #define ADAPT_SCALE_BASE (64ul << 30)
7874 #define ADAPT_SCALE_SHIFT 2
7875 #define ADAPT_SCALE_NPAGES (ADAPT_SCALE_BASE >> PAGE_SHIFT)
7879 * allocate a large system hash table from bootmem
7880 * - it is assumed that the hash table must contain an exact power-of-2
7881 * quantity of entries
7882 * - limit is the number of hash buckets, not the total allocation size
7884 void *__init alloc_large_system_hash(const char *tablename,
7885 unsigned long bucketsize,
7886 unsigned long numentries,
7889 unsigned int *_hash_shift,
7890 unsigned int *_hash_mask,
7891 unsigned long low_limit,
7892 unsigned long high_limit)
7894 unsigned long long max = high_limit;
7895 unsigned long log2qty, size;
7899 /* allow the kernel cmdline to have a say */
7901 /* round applicable memory size up to nearest megabyte */
7902 numentries = nr_kernel_pages;
7903 numentries -= arch_reserved_kernel_pages();
7905 /* It isn't necessary when PAGE_SIZE >= 1MB */
7906 if (PAGE_SHIFT < 20)
7907 numentries = round_up(numentries, (1<<20)/PAGE_SIZE);
7909 #if __BITS_PER_LONG > 32
7911 unsigned long adapt;
7913 for (adapt = ADAPT_SCALE_NPAGES; adapt < numentries;
7914 adapt <<= ADAPT_SCALE_SHIFT)
7919 /* limit to 1 bucket per 2^scale bytes of low memory */
7920 if (scale > PAGE_SHIFT)
7921 numentries >>= (scale - PAGE_SHIFT);
7923 numentries <<= (PAGE_SHIFT - scale);
7925 /* Make sure we've got at least a 0-order allocation.. */
7926 if (unlikely(flags & HASH_SMALL)) {
7927 /* Makes no sense without HASH_EARLY */
7928 WARN_ON(!(flags & HASH_EARLY));
7929 if (!(numentries >> *_hash_shift)) {
7930 numentries = 1UL << *_hash_shift;
7931 BUG_ON(!numentries);
7933 } else if (unlikely((numentries * bucketsize) < PAGE_SIZE))
7934 numentries = PAGE_SIZE / bucketsize;
7936 numentries = roundup_pow_of_two(numentries);
7938 /* limit allocation size to 1/16 total memory by default */
7940 max = ((unsigned long long)nr_all_pages << PAGE_SHIFT) >> 4;
7941 do_div(max, bucketsize);
7943 max = min(max, 0x80000000ULL);
7945 if (numentries < low_limit)
7946 numentries = low_limit;
7947 if (numentries > max)
7950 log2qty = ilog2(numentries);
7952 gfp_flags = (flags & HASH_ZERO) ? GFP_ATOMIC | __GFP_ZERO : GFP_ATOMIC;
7954 size = bucketsize << log2qty;
7955 if (flags & HASH_EARLY) {
7956 if (flags & HASH_ZERO)
7957 table = memblock_alloc(size, SMP_CACHE_BYTES);
7959 table = memblock_alloc_raw(size,
7961 } else if (hashdist) {
7962 table = __vmalloc(size, gfp_flags, PAGE_KERNEL);
7965 * If bucketsize is not a power-of-two, we may free
7966 * some pages at the end of hash table which
7967 * alloc_pages_exact() automatically does
7969 if (get_order(size) < MAX_ORDER) {
7970 table = alloc_pages_exact(size, gfp_flags);
7971 kmemleak_alloc(table, size, 1, gfp_flags);
7974 } while (!table && size > PAGE_SIZE && --log2qty);
7977 panic("Failed to allocate %s hash table\n", tablename);
7979 pr_info("%s hash table entries: %ld (order: %d, %lu bytes)\n",
7980 tablename, 1UL << log2qty, ilog2(size) - PAGE_SHIFT, size);
7983 *_hash_shift = log2qty;
7985 *_hash_mask = (1 << log2qty) - 1;
7991 * This function checks whether pageblock includes unmovable pages or not.
7992 * If @count is not zero, it is okay to include less @count unmovable pages
7994 * PageLRU check without isolation or lru_lock could race so that
7995 * MIGRATE_MOVABLE block might include unmovable pages. And __PageMovable
7996 * check without lock_page also may miss some movable non-lru pages at
7997 * race condition. So you can't expect this function should be exact.
7999 bool has_unmovable_pages(struct zone *zone, struct page *page, int count,
8000 int migratetype, int flags)
8002 unsigned long found;
8003 unsigned long iter = 0;
8004 unsigned long pfn = page_to_pfn(page);
8005 const char *reason = "unmovable page";
8008 * TODO we could make this much more efficient by not checking every
8009 * page in the range if we know all of them are in MOVABLE_ZONE and
8010 * that the movable zone guarantees that pages are migratable but
8011 * the later is not the case right now unfortunatelly. E.g. movablecore
8012 * can still lead to having bootmem allocations in zone_movable.
8015 if (is_migrate_cma_page(page)) {
8017 * CMA allocations (alloc_contig_range) really need to mark
8018 * isolate CMA pageblocks even when they are not movable in fact
8019 * so consider them movable here.
8021 if (is_migrate_cma(migratetype))
8024 reason = "CMA page";
8028 for (found = 0; iter < pageblock_nr_pages; iter++) {
8029 unsigned long check = pfn + iter;
8031 if (!pfn_valid_within(check))
8034 page = pfn_to_page(check);
8036 if (PageReserved(page))
8040 * If the zone is movable and we have ruled out all reserved
8041 * pages then it should be reasonably safe to assume the rest
8044 if (zone_idx(zone) == ZONE_MOVABLE)
8048 * Hugepages are not in LRU lists, but they're movable.
8049 * We need not scan over tail pages because we don't
8050 * handle each tail page individually in migration.
8052 if (PageHuge(page)) {
8053 struct page *head = compound_head(page);
8054 unsigned int skip_pages;
8056 if (!hugepage_migration_supported(page_hstate(head)))
8059 skip_pages = (1 << compound_order(head)) - (page - head);
8060 iter += skip_pages - 1;
8065 * We can't use page_count without pin a page
8066 * because another CPU can free compound page.
8067 * This check already skips compound tails of THP
8068 * because their page->_refcount is zero at all time.
8070 if (!page_ref_count(page)) {
8071 if (PageBuddy(page))
8072 iter += (1 << page_order(page)) - 1;
8077 * The HWPoisoned page may be not in buddy system, and
8078 * page_count() is not 0.
8080 if ((flags & SKIP_HWPOISON) && PageHWPoison(page))
8083 if (__PageMovable(page))
8089 * If there are RECLAIMABLE pages, we need to check
8090 * it. But now, memory offline itself doesn't call
8091 * shrink_node_slabs() and it still to be fixed.
8094 * If the page is not RAM, page_count()should be 0.
8095 * we don't need more check. This is an _used_ not-movable page.
8097 * The problematic thing here is PG_reserved pages. PG_reserved
8098 * is set to both of a memory hole page and a _used_ kernel
8106 WARN_ON_ONCE(zone_idx(zone) == ZONE_MOVABLE);
8107 if (flags & REPORT_FAILURE)
8108 dump_page(pfn_to_page(pfn + iter), reason);
8112 #ifdef CONFIG_CONTIG_ALLOC
8113 static unsigned long pfn_max_align_down(unsigned long pfn)
8115 return pfn & ~(max_t(unsigned long, MAX_ORDER_NR_PAGES,
8116 pageblock_nr_pages) - 1);
8119 static unsigned long pfn_max_align_up(unsigned long pfn)
8121 return ALIGN(pfn, max_t(unsigned long, MAX_ORDER_NR_PAGES,
8122 pageblock_nr_pages));
8125 /* [start, end) must belong to a single zone. */
8126 static int __alloc_contig_migrate_range(struct compact_control *cc,
8127 unsigned long start, unsigned long end)
8129 /* This function is based on compact_zone() from compaction.c. */
8130 unsigned long nr_reclaimed;
8131 unsigned long pfn = start;
8132 unsigned int tries = 0;
8137 while (pfn < end || !list_empty(&cc->migratepages)) {
8138 if (fatal_signal_pending(current)) {
8143 if (list_empty(&cc->migratepages)) {
8144 cc->nr_migratepages = 0;
8145 pfn = isolate_migratepages_range(cc, pfn, end);
8151 } else if (++tries == 5) {
8152 ret = ret < 0 ? ret : -EBUSY;
8156 nr_reclaimed = reclaim_clean_pages_from_list(cc->zone,
8158 cc->nr_migratepages -= nr_reclaimed;
8160 ret = migrate_pages(&cc->migratepages, alloc_migrate_target,
8161 NULL, 0, cc->mode, MR_CONTIG_RANGE);
8164 putback_movable_pages(&cc->migratepages);
8171 * alloc_contig_range() -- tries to allocate given range of pages
8172 * @start: start PFN to allocate
8173 * @end: one-past-the-last PFN to allocate
8174 * @migratetype: migratetype of the underlaying pageblocks (either
8175 * #MIGRATE_MOVABLE or #MIGRATE_CMA). All pageblocks
8176 * in range must have the same migratetype and it must
8177 * be either of the two.
8178 * @gfp_mask: GFP mask to use during compaction
8180 * The PFN range does not have to be pageblock or MAX_ORDER_NR_PAGES
8181 * aligned. The PFN range must belong to a single zone.
8183 * The first thing this routine does is attempt to MIGRATE_ISOLATE all
8184 * pageblocks in the range. Once isolated, the pageblocks should not
8185 * be modified by others.
8187 * Return: zero on success or negative error code. On success all
8188 * pages which PFN is in [start, end) are allocated for the caller and
8189 * need to be freed with free_contig_range().
8191 int alloc_contig_range(unsigned long start, unsigned long end,
8192 unsigned migratetype, gfp_t gfp_mask)
8194 unsigned long outer_start, outer_end;
8198 struct compact_control cc = {
8199 .nr_migratepages = 0,
8201 .zone = page_zone(pfn_to_page(start)),
8202 .mode = MIGRATE_SYNC,
8203 .ignore_skip_hint = true,
8204 .no_set_skip_hint = true,
8205 .gfp_mask = current_gfp_context(gfp_mask),
8207 INIT_LIST_HEAD(&cc.migratepages);
8210 * What we do here is we mark all pageblocks in range as
8211 * MIGRATE_ISOLATE. Because pageblock and max order pages may
8212 * have different sizes, and due to the way page allocator
8213 * work, we align the range to biggest of the two pages so
8214 * that page allocator won't try to merge buddies from
8215 * different pageblocks and change MIGRATE_ISOLATE to some
8216 * other migration type.
8218 * Once the pageblocks are marked as MIGRATE_ISOLATE, we
8219 * migrate the pages from an unaligned range (ie. pages that
8220 * we are interested in). This will put all the pages in
8221 * range back to page allocator as MIGRATE_ISOLATE.
8223 * When this is done, we take the pages in range from page
8224 * allocator removing them from the buddy system. This way
8225 * page allocator will never consider using them.
8227 * This lets us mark the pageblocks back as
8228 * MIGRATE_CMA/MIGRATE_MOVABLE so that free pages in the
8229 * aligned range but not in the unaligned, original range are
8230 * put back to page allocator so that buddy can use them.
8233 ret = start_isolate_page_range(pfn_max_align_down(start),
8234 pfn_max_align_up(end), migratetype, 0);
8239 * In case of -EBUSY, we'd like to know which page causes problem.
8240 * So, just fall through. test_pages_isolated() has a tracepoint
8241 * which will report the busy page.
8243 * It is possible that busy pages could become available before
8244 * the call to test_pages_isolated, and the range will actually be
8245 * allocated. So, if we fall through be sure to clear ret so that
8246 * -EBUSY is not accidentally used or returned to caller.
8248 ret = __alloc_contig_migrate_range(&cc, start, end);
8249 if (ret && ret != -EBUSY)
8254 * Pages from [start, end) are within a MAX_ORDER_NR_PAGES
8255 * aligned blocks that are marked as MIGRATE_ISOLATE. What's
8256 * more, all pages in [start, end) are free in page allocator.
8257 * What we are going to do is to allocate all pages from
8258 * [start, end) (that is remove them from page allocator).
8260 * The only problem is that pages at the beginning and at the
8261 * end of interesting range may be not aligned with pages that
8262 * page allocator holds, ie. they can be part of higher order
8263 * pages. Because of this, we reserve the bigger range and
8264 * once this is done free the pages we are not interested in.
8266 * We don't have to hold zone->lock here because the pages are
8267 * isolated thus they won't get removed from buddy.
8270 lru_add_drain_all();
8273 outer_start = start;
8274 while (!PageBuddy(pfn_to_page(outer_start))) {
8275 if (++order >= MAX_ORDER) {
8276 outer_start = start;
8279 outer_start &= ~0UL << order;
8282 if (outer_start != start) {
8283 order = page_order(pfn_to_page(outer_start));
8286 * outer_start page could be small order buddy page and
8287 * it doesn't include start page. Adjust outer_start
8288 * in this case to report failed page properly
8289 * on tracepoint in test_pages_isolated()
8291 if (outer_start + (1UL << order) <= start)
8292 outer_start = start;
8295 /* Make sure the range is really isolated. */
8296 if (test_pages_isolated(outer_start, end, false)) {
8297 pr_info_ratelimited("%s: [%lx, %lx) PFNs busy\n",
8298 __func__, outer_start, end);
8303 /* Grab isolated pages from freelists. */
8304 outer_end = isolate_freepages_range(&cc, outer_start, end);
8310 /* Free head and tail (if any) */
8311 if (start != outer_start)
8312 free_contig_range(outer_start, start - outer_start);
8313 if (end != outer_end)
8314 free_contig_range(end, outer_end - end);
8317 undo_isolate_page_range(pfn_max_align_down(start),
8318 pfn_max_align_up(end), migratetype);
8321 #endif /* CONFIG_CONTIG_ALLOC */
8323 void free_contig_range(unsigned long pfn, unsigned int nr_pages)
8325 unsigned int count = 0;
8327 for (; nr_pages--; pfn++) {
8328 struct page *page = pfn_to_page(pfn);
8330 count += page_count(page) != 1;
8333 WARN(count != 0, "%d pages are still in use!\n", count);
8336 #ifdef CONFIG_MEMORY_HOTPLUG
8338 * The zone indicated has a new number of managed_pages; batch sizes and percpu
8339 * page high values need to be recalulated.
8341 void __meminit zone_pcp_update(struct zone *zone)
8344 mutex_lock(&pcp_batch_high_lock);
8345 for_each_possible_cpu(cpu)
8346 pageset_set_high_and_batch(zone,
8347 per_cpu_ptr(zone->pageset, cpu));
8348 mutex_unlock(&pcp_batch_high_lock);
8352 void zone_pcp_reset(struct zone *zone)
8354 unsigned long flags;
8356 struct per_cpu_pageset *pset;
8358 /* avoid races with drain_pages() */
8359 local_irq_save(flags);
8360 if (zone->pageset != &boot_pageset) {
8361 for_each_online_cpu(cpu) {
8362 pset = per_cpu_ptr(zone->pageset, cpu);
8363 drain_zonestat(zone, pset);
8365 free_percpu(zone->pageset);
8366 zone->pageset = &boot_pageset;
8368 local_irq_restore(flags);
8371 #ifdef CONFIG_MEMORY_HOTREMOVE
8373 * All pages in the range must be in a single zone and isolated
8374 * before calling this.
8377 __offline_isolated_pages(unsigned long start_pfn, unsigned long end_pfn)
8381 unsigned int order, i;
8383 unsigned long flags;
8384 /* find the first valid pfn */
8385 for (pfn = start_pfn; pfn < end_pfn; pfn++)
8390 offline_mem_sections(pfn, end_pfn);
8391 zone = page_zone(pfn_to_page(pfn));
8392 spin_lock_irqsave(&zone->lock, flags);
8394 while (pfn < end_pfn) {
8395 if (!pfn_valid(pfn)) {
8399 page = pfn_to_page(pfn);
8401 * The HWPoisoned page may be not in buddy system, and
8402 * page_count() is not 0.
8404 if (unlikely(!PageBuddy(page) && PageHWPoison(page))) {
8406 SetPageReserved(page);
8410 BUG_ON(page_count(page));
8411 BUG_ON(!PageBuddy(page));
8412 order = page_order(page);
8413 #ifdef CONFIG_DEBUG_VM
8414 pr_info("remove from free list %lx %d %lx\n",
8415 pfn, 1 << order, end_pfn);
8417 list_del(&page->lru);
8418 rmv_page_order(page);
8419 zone->free_area[order].nr_free--;
8420 for (i = 0; i < (1 << order); i++)
8421 SetPageReserved((page+i));
8422 pfn += (1 << order);
8424 spin_unlock_irqrestore(&zone->lock, flags);
8428 bool is_free_buddy_page(struct page *page)
8430 struct zone *zone = page_zone(page);
8431 unsigned long pfn = page_to_pfn(page);
8432 unsigned long flags;
8435 spin_lock_irqsave(&zone->lock, flags);
8436 for (order = 0; order < MAX_ORDER; order++) {
8437 struct page *page_head = page - (pfn & ((1 << order) - 1));
8439 if (PageBuddy(page_head) && page_order(page_head) >= order)
8442 spin_unlock_irqrestore(&zone->lock, flags);
8444 return order < MAX_ORDER;
8447 #ifdef CONFIG_MEMORY_FAILURE
8449 * Set PG_hwpoison flag if a given page is confirmed to be a free page. This
8450 * test is performed under the zone lock to prevent a race against page
8453 bool set_hwpoison_free_buddy_page(struct page *page)
8455 struct zone *zone = page_zone(page);
8456 unsigned long pfn = page_to_pfn(page);
8457 unsigned long flags;
8459 bool hwpoisoned = false;
8461 spin_lock_irqsave(&zone->lock, flags);
8462 for (order = 0; order < MAX_ORDER; order++) {
8463 struct page *page_head = page - (pfn & ((1 << order) - 1));
8465 if (PageBuddy(page_head) && page_order(page_head) >= order) {
8466 if (!TestSetPageHWPoison(page))
8471 spin_unlock_irqrestore(&zone->lock, flags);