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/swap.h>
20 #include <linux/interrupt.h>
21 #include <linux/pagemap.h>
22 #include <linux/jiffies.h>
23 #include <linux/bootmem.h>
24 #include <linux/memblock.h>
25 #include <linux/compiler.h>
26 #include <linux/kernel.h>
27 #include <linux/kmemcheck.h>
28 #include <linux/kasan.h>
29 #include <linux/module.h>
30 #include <linux/suspend.h>
31 #include <linux/pagevec.h>
32 #include <linux/blkdev.h>
33 #include <linux/slab.h>
34 #include <linux/ratelimit.h>
35 #include <linux/oom.h>
36 #include <linux/notifier.h>
37 #include <linux/topology.h>
38 #include <linux/sysctl.h>
39 #include <linux/cpu.h>
40 #include <linux/cpuset.h>
41 #include <linux/memory_hotplug.h>
42 #include <linux/nodemask.h>
43 #include <linux/vmalloc.h>
44 #include <linux/vmstat.h>
45 #include <linux/mempolicy.h>
46 #include <linux/memremap.h>
47 #include <linux/stop_machine.h>
48 #include <linux/sort.h>
49 #include <linux/pfn.h>
50 #include <linux/backing-dev.h>
51 #include <linux/fault-inject.h>
52 #include <linux/page-isolation.h>
53 #include <linux/page_ext.h>
54 #include <linux/debugobjects.h>
55 #include <linux/kmemleak.h>
56 #include <linux/compaction.h>
57 #include <trace/events/kmem.h>
58 #include <trace/events/oom.h>
59 #include <linux/prefetch.h>
60 #include <linux/mm_inline.h>
61 #include <linux/migrate.h>
62 #include <linux/page_ext.h>
63 #include <linux/hugetlb.h>
64 #include <linux/sched/rt.h>
65 #include <linux/page_owner.h>
66 #include <linux/kthread.h>
67 #include <linux/memcontrol.h>
69 #include <asm/sections.h>
70 #include <asm/tlbflush.h>
71 #include <asm/div64.h>
74 /* prevent >1 _updater_ of zone percpu pageset ->high and ->batch fields */
75 static DEFINE_MUTEX(pcp_batch_high_lock);
76 #define MIN_PERCPU_PAGELIST_FRACTION (8)
78 #ifdef CONFIG_USE_PERCPU_NUMA_NODE_ID
79 DEFINE_PER_CPU(int, numa_node);
80 EXPORT_PER_CPU_SYMBOL(numa_node);
83 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
85 * N.B., Do NOT reference the '_numa_mem_' per cpu variable directly.
86 * It will not be defined when CONFIG_HAVE_MEMORYLESS_NODES is not defined.
87 * Use the accessor functions set_numa_mem(), numa_mem_id() and cpu_to_mem()
88 * defined in <linux/topology.h>.
90 DEFINE_PER_CPU(int, _numa_mem_); /* Kernel "local memory" node */
91 EXPORT_PER_CPU_SYMBOL(_numa_mem_);
92 int _node_numa_mem_[MAX_NUMNODES];
95 #ifdef CONFIG_GCC_PLUGIN_LATENT_ENTROPY
96 volatile unsigned long latent_entropy __latent_entropy;
97 EXPORT_SYMBOL(latent_entropy);
101 * Array of node states.
103 nodemask_t node_states[NR_NODE_STATES] __read_mostly = {
104 [N_POSSIBLE] = NODE_MASK_ALL,
105 [N_ONLINE] = { { [0] = 1UL } },
107 [N_NORMAL_MEMORY] = { { [0] = 1UL } },
108 #ifdef CONFIG_HIGHMEM
109 [N_HIGH_MEMORY] = { { [0] = 1UL } },
111 #ifdef CONFIG_MOVABLE_NODE
112 [N_MEMORY] = { { [0] = 1UL } },
114 [N_CPU] = { { [0] = 1UL } },
117 EXPORT_SYMBOL(node_states);
119 /* Protect totalram_pages and zone->managed_pages */
120 static DEFINE_SPINLOCK(managed_page_count_lock);
122 unsigned long totalram_pages __read_mostly;
123 unsigned long totalreserve_pages __read_mostly;
124 unsigned long totalcma_pages __read_mostly;
126 int percpu_pagelist_fraction;
127 gfp_t gfp_allowed_mask __read_mostly = GFP_BOOT_MASK;
130 * A cached value of the page's pageblock's migratetype, used when the page is
131 * put on a pcplist. Used to avoid the pageblock migratetype lookup when
132 * freeing from pcplists in most cases, at the cost of possibly becoming stale.
133 * Also the migratetype set in the page does not necessarily match the pcplist
134 * index, e.g. page might have MIGRATE_CMA set but be on a pcplist with any
135 * other index - this ensures that it will be put on the correct CMA freelist.
137 static inline int get_pcppage_migratetype(struct page *page)
142 static inline void set_pcppage_migratetype(struct page *page, int migratetype)
144 page->index = migratetype;
147 #ifdef CONFIG_PM_SLEEP
149 * The following functions are used by the suspend/hibernate code to temporarily
150 * change gfp_allowed_mask in order to avoid using I/O during memory allocations
151 * while devices are suspended. To avoid races with the suspend/hibernate code,
152 * they should always be called with pm_mutex held (gfp_allowed_mask also should
153 * only be modified with pm_mutex held, unless the suspend/hibernate code is
154 * guaranteed not to run in parallel with that modification).
157 static gfp_t saved_gfp_mask;
159 void pm_restore_gfp_mask(void)
161 WARN_ON(!mutex_is_locked(&pm_mutex));
162 if (saved_gfp_mask) {
163 gfp_allowed_mask = saved_gfp_mask;
168 void pm_restrict_gfp_mask(void)
170 WARN_ON(!mutex_is_locked(&pm_mutex));
171 WARN_ON(saved_gfp_mask);
172 saved_gfp_mask = gfp_allowed_mask;
173 gfp_allowed_mask &= ~(__GFP_IO | __GFP_FS);
176 bool pm_suspended_storage(void)
178 if ((gfp_allowed_mask & (__GFP_IO | __GFP_FS)) == (__GFP_IO | __GFP_FS))
182 #endif /* CONFIG_PM_SLEEP */
184 #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
185 unsigned int pageblock_order __read_mostly;
188 static void __free_pages_ok(struct page *page, unsigned int order);
191 * results with 256, 32 in the lowmem_reserve sysctl:
192 * 1G machine -> (16M dma, 800M-16M normal, 1G-800M high)
193 * 1G machine -> (16M dma, 784M normal, 224M high)
194 * NORMAL allocation will leave 784M/256 of ram reserved in the ZONE_DMA
195 * HIGHMEM allocation will leave 224M/32 of ram reserved in ZONE_NORMAL
196 * HIGHMEM allocation will leave (224M+784M)/256 of ram reserved in ZONE_DMA
198 * TBD: should special case ZONE_DMA32 machines here - in those we normally
199 * don't need any ZONE_NORMAL reservation
201 int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES-1] = {
202 #ifdef CONFIG_ZONE_DMA
205 #ifdef CONFIG_ZONE_DMA32
208 #ifdef CONFIG_HIGHMEM
214 EXPORT_SYMBOL(totalram_pages);
216 static char * const zone_names[MAX_NR_ZONES] = {
217 #ifdef CONFIG_ZONE_DMA
220 #ifdef CONFIG_ZONE_DMA32
224 #ifdef CONFIG_HIGHMEM
228 #ifdef CONFIG_ZONE_DEVICE
233 char * const migratetype_names[MIGRATE_TYPES] = {
241 #ifdef CONFIG_MEMORY_ISOLATION
246 compound_page_dtor * const compound_page_dtors[] = {
249 #ifdef CONFIG_HUGETLB_PAGE
252 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
257 int min_free_kbytes = 1024;
258 int user_min_free_kbytes = -1;
259 int watermark_scale_factor = 10;
261 static unsigned long __meminitdata nr_kernel_pages;
262 static unsigned long __meminitdata nr_all_pages;
263 static unsigned long __meminitdata dma_reserve;
265 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
266 static unsigned long __meminitdata arch_zone_lowest_possible_pfn[MAX_NR_ZONES];
267 static unsigned long __meminitdata arch_zone_highest_possible_pfn[MAX_NR_ZONES];
268 static unsigned long __initdata required_kernelcore;
269 static unsigned long __initdata required_movablecore;
270 static unsigned long __meminitdata zone_movable_pfn[MAX_NUMNODES];
271 static bool mirrored_kernelcore;
273 /* movable_zone is the "real" zone pages in ZONE_MOVABLE are taken from */
275 EXPORT_SYMBOL(movable_zone);
276 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
279 int nr_node_ids __read_mostly = MAX_NUMNODES;
280 int nr_online_nodes __read_mostly = 1;
281 EXPORT_SYMBOL(nr_node_ids);
282 EXPORT_SYMBOL(nr_online_nodes);
285 int page_group_by_mobility_disabled __read_mostly;
287 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
288 static inline void reset_deferred_meminit(pg_data_t *pgdat)
290 pgdat->first_deferred_pfn = ULONG_MAX;
293 /* Returns true if the struct page for the pfn is uninitialised */
294 static inline bool __meminit early_page_uninitialised(unsigned long pfn)
296 int nid = early_pfn_to_nid(pfn);
298 if (node_online(nid) && pfn >= NODE_DATA(nid)->first_deferred_pfn)
305 * Returns false when the remaining initialisation should be deferred until
306 * later in the boot cycle when it can be parallelised.
308 static inline bool update_defer_init(pg_data_t *pgdat,
309 unsigned long pfn, unsigned long zone_end,
310 unsigned long *nr_initialised)
312 unsigned long max_initialise;
314 /* Always populate low zones for address-contrained allocations */
315 if (zone_end < pgdat_end_pfn(pgdat))
318 * Initialise at least 2G of a node but also take into account that
319 * two large system hashes that can take up 1GB for 0.25TB/node.
321 max_initialise = max(2UL << (30 - PAGE_SHIFT),
322 (pgdat->node_spanned_pages >> 8));
325 if ((*nr_initialised > max_initialise) &&
326 (pfn & (PAGES_PER_SECTION - 1)) == 0) {
327 pgdat->first_deferred_pfn = pfn;
334 static inline void reset_deferred_meminit(pg_data_t *pgdat)
338 static inline bool early_page_uninitialised(unsigned long pfn)
343 static inline bool update_defer_init(pg_data_t *pgdat,
344 unsigned long pfn, unsigned long zone_end,
345 unsigned long *nr_initialised)
351 /* Return a pointer to the bitmap storing bits affecting a block of pages */
352 static inline unsigned long *get_pageblock_bitmap(struct page *page,
355 #ifdef CONFIG_SPARSEMEM
356 return __pfn_to_section(pfn)->pageblock_flags;
358 return page_zone(page)->pageblock_flags;
359 #endif /* CONFIG_SPARSEMEM */
362 static inline int pfn_to_bitidx(struct page *page, unsigned long pfn)
364 #ifdef CONFIG_SPARSEMEM
365 pfn &= (PAGES_PER_SECTION-1);
366 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
368 pfn = pfn - round_down(page_zone(page)->zone_start_pfn, pageblock_nr_pages);
369 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
370 #endif /* CONFIG_SPARSEMEM */
374 * get_pfnblock_flags_mask - Return the requested group of flags for the pageblock_nr_pages block of pages
375 * @page: The page within the block of interest
376 * @pfn: The target page frame number
377 * @end_bitidx: The last bit of interest to retrieve
378 * @mask: mask of bits that the caller is interested in
380 * Return: pageblock_bits flags
382 static __always_inline unsigned long __get_pfnblock_flags_mask(struct page *page,
384 unsigned long end_bitidx,
387 unsigned long *bitmap;
388 unsigned long bitidx, word_bitidx;
391 bitmap = get_pageblock_bitmap(page, pfn);
392 bitidx = pfn_to_bitidx(page, pfn);
393 word_bitidx = bitidx / BITS_PER_LONG;
394 bitidx &= (BITS_PER_LONG-1);
396 word = bitmap[word_bitidx];
397 bitidx += end_bitidx;
398 return (word >> (BITS_PER_LONG - bitidx - 1)) & mask;
401 unsigned long get_pfnblock_flags_mask(struct page *page, unsigned long pfn,
402 unsigned long end_bitidx,
405 return __get_pfnblock_flags_mask(page, pfn, end_bitidx, mask);
408 static __always_inline int get_pfnblock_migratetype(struct page *page, unsigned long pfn)
410 return __get_pfnblock_flags_mask(page, pfn, PB_migrate_end, MIGRATETYPE_MASK);
414 * set_pfnblock_flags_mask - Set the requested group of flags for a pageblock_nr_pages block of pages
415 * @page: The page within the block of interest
416 * @flags: The flags to set
417 * @pfn: The target page frame number
418 * @end_bitidx: The last bit of interest
419 * @mask: mask of bits that the caller is interested in
421 void set_pfnblock_flags_mask(struct page *page, unsigned long flags,
423 unsigned long end_bitidx,
426 unsigned long *bitmap;
427 unsigned long bitidx, word_bitidx;
428 unsigned long old_word, word;
430 BUILD_BUG_ON(NR_PAGEBLOCK_BITS != 4);
432 bitmap = get_pageblock_bitmap(page, pfn);
433 bitidx = pfn_to_bitidx(page, pfn);
434 word_bitidx = bitidx / BITS_PER_LONG;
435 bitidx &= (BITS_PER_LONG-1);
437 VM_BUG_ON_PAGE(!zone_spans_pfn(page_zone(page), pfn), page);
439 bitidx += end_bitidx;
440 mask <<= (BITS_PER_LONG - bitidx - 1);
441 flags <<= (BITS_PER_LONG - bitidx - 1);
443 word = READ_ONCE(bitmap[word_bitidx]);
445 old_word = cmpxchg(&bitmap[word_bitidx], word, (word & ~mask) | flags);
446 if (word == old_word)
452 void set_pageblock_migratetype(struct page *page, int migratetype)
454 if (unlikely(page_group_by_mobility_disabled &&
455 migratetype < MIGRATE_PCPTYPES))
456 migratetype = MIGRATE_UNMOVABLE;
458 set_pageblock_flags_group(page, (unsigned long)migratetype,
459 PB_migrate, PB_migrate_end);
462 #ifdef CONFIG_DEBUG_VM
463 static int page_outside_zone_boundaries(struct zone *zone, struct page *page)
467 unsigned long pfn = page_to_pfn(page);
468 unsigned long sp, start_pfn;
471 seq = zone_span_seqbegin(zone);
472 start_pfn = zone->zone_start_pfn;
473 sp = zone->spanned_pages;
474 if (!zone_spans_pfn(zone, pfn))
476 } while (zone_span_seqretry(zone, seq));
479 pr_err("page 0x%lx outside node %d zone %s [ 0x%lx - 0x%lx ]\n",
480 pfn, zone_to_nid(zone), zone->name,
481 start_pfn, start_pfn + sp);
486 static int page_is_consistent(struct zone *zone, struct page *page)
488 if (!pfn_valid_within(page_to_pfn(page)))
490 if (zone != page_zone(page))
496 * Temporary debugging check for pages not lying within a given zone.
498 static int bad_range(struct zone *zone, struct page *page)
500 if (page_outside_zone_boundaries(zone, page))
502 if (!page_is_consistent(zone, page))
508 static inline int bad_range(struct zone *zone, struct page *page)
514 static void bad_page(struct page *page, const char *reason,
515 unsigned long bad_flags)
517 static unsigned long resume;
518 static unsigned long nr_shown;
519 static unsigned long nr_unshown;
522 * Allow a burst of 60 reports, then keep quiet for that minute;
523 * or allow a steady drip of one report per second.
525 if (nr_shown == 60) {
526 if (time_before(jiffies, resume)) {
532 "BUG: Bad page state: %lu messages suppressed\n",
539 resume = jiffies + 60 * HZ;
541 pr_alert("BUG: Bad page state in process %s pfn:%05lx\n",
542 current->comm, page_to_pfn(page));
543 __dump_page(page, reason);
544 bad_flags &= page->flags;
546 pr_alert("bad because of flags: %#lx(%pGp)\n",
547 bad_flags, &bad_flags);
548 dump_page_owner(page);
553 /* Leave bad fields for debug, except PageBuddy could make trouble */
554 page_mapcount_reset(page); /* remove PageBuddy */
555 add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE);
559 * Higher-order pages are called "compound pages". They are structured thusly:
561 * The first PAGE_SIZE page is called the "head page" and have PG_head set.
563 * The remaining PAGE_SIZE pages are called "tail pages". PageTail() is encoded
564 * in bit 0 of page->compound_head. The rest of bits is pointer to head page.
566 * The first tail page's ->compound_dtor holds the offset in array of compound
567 * page destructors. See compound_page_dtors.
569 * The first tail page's ->compound_order holds the order of allocation.
570 * This usage means that zero-order pages may not be compound.
573 void free_compound_page(struct page *page)
575 __free_pages_ok(page, compound_order(page));
578 void prep_compound_page(struct page *page, unsigned int order)
581 int nr_pages = 1 << order;
583 set_compound_page_dtor(page, COMPOUND_PAGE_DTOR);
584 set_compound_order(page, order);
586 for (i = 1; i < nr_pages; i++) {
587 struct page *p = page + i;
588 set_page_count(p, 0);
589 p->mapping = TAIL_MAPPING;
590 set_compound_head(p, page);
592 atomic_set(compound_mapcount_ptr(page), -1);
595 #ifdef CONFIG_DEBUG_PAGEALLOC
596 unsigned int _debug_guardpage_minorder;
597 bool _debug_pagealloc_enabled __read_mostly
598 = IS_ENABLED(CONFIG_DEBUG_PAGEALLOC_ENABLE_DEFAULT);
599 EXPORT_SYMBOL(_debug_pagealloc_enabled);
600 bool _debug_guardpage_enabled __read_mostly;
602 static int __init early_debug_pagealloc(char *buf)
606 return kstrtobool(buf, &_debug_pagealloc_enabled);
608 early_param("debug_pagealloc", early_debug_pagealloc);
610 static bool need_debug_guardpage(void)
612 /* If we don't use debug_pagealloc, we don't need guard page */
613 if (!debug_pagealloc_enabled())
616 if (!debug_guardpage_minorder())
622 static void init_debug_guardpage(void)
624 if (!debug_pagealloc_enabled())
627 if (!debug_guardpage_minorder())
630 _debug_guardpage_enabled = true;
633 struct page_ext_operations debug_guardpage_ops = {
634 .need = need_debug_guardpage,
635 .init = init_debug_guardpage,
638 static int __init debug_guardpage_minorder_setup(char *buf)
642 if (kstrtoul(buf, 10, &res) < 0 || res > MAX_ORDER / 2) {
643 pr_err("Bad debug_guardpage_minorder value\n");
646 _debug_guardpage_minorder = res;
647 pr_info("Setting debug_guardpage_minorder to %lu\n", res);
650 early_param("debug_guardpage_minorder", debug_guardpage_minorder_setup);
652 static inline bool set_page_guard(struct zone *zone, struct page *page,
653 unsigned int order, int migratetype)
655 struct page_ext *page_ext;
657 if (!debug_guardpage_enabled())
660 if (order >= debug_guardpage_minorder())
663 page_ext = lookup_page_ext(page);
664 if (unlikely(!page_ext))
667 __set_bit(PAGE_EXT_DEBUG_GUARD, &page_ext->flags);
669 INIT_LIST_HEAD(&page->lru);
670 set_page_private(page, order);
671 /* Guard pages are not available for any usage */
672 __mod_zone_freepage_state(zone, -(1 << order), migratetype);
677 static inline void clear_page_guard(struct zone *zone, struct page *page,
678 unsigned int order, int migratetype)
680 struct page_ext *page_ext;
682 if (!debug_guardpage_enabled())
685 page_ext = lookup_page_ext(page);
686 if (unlikely(!page_ext))
689 __clear_bit(PAGE_EXT_DEBUG_GUARD, &page_ext->flags);
691 set_page_private(page, 0);
692 if (!is_migrate_isolate(migratetype))
693 __mod_zone_freepage_state(zone, (1 << order), migratetype);
696 struct page_ext_operations debug_guardpage_ops;
697 static inline bool set_page_guard(struct zone *zone, struct page *page,
698 unsigned int order, int migratetype) { return false; }
699 static inline void clear_page_guard(struct zone *zone, struct page *page,
700 unsigned int order, int migratetype) {}
703 static inline void set_page_order(struct page *page, unsigned int order)
705 set_page_private(page, order);
706 __SetPageBuddy(page);
709 static inline void rmv_page_order(struct page *page)
711 __ClearPageBuddy(page);
712 set_page_private(page, 0);
716 * This function checks whether a page is free && is the buddy
717 * we can do coalesce a page and its buddy if
718 * (a) the buddy is not in a hole (check before calling!) &&
719 * (b) the buddy is in the buddy system &&
720 * (c) a page and its buddy have the same order &&
721 * (d) a page and its buddy are in the same zone.
723 * For recording whether a page is in the buddy system, we set ->_mapcount
724 * PAGE_BUDDY_MAPCOUNT_VALUE.
725 * Setting, clearing, and testing _mapcount PAGE_BUDDY_MAPCOUNT_VALUE is
726 * serialized by zone->lock.
728 * For recording page's order, we use page_private(page).
730 static inline int page_is_buddy(struct page *page, struct page *buddy,
733 if (page_is_guard(buddy) && page_order(buddy) == order) {
734 if (page_zone_id(page) != page_zone_id(buddy))
737 VM_BUG_ON_PAGE(page_count(buddy) != 0, buddy);
742 if (PageBuddy(buddy) && page_order(buddy) == order) {
744 * zone check is done late to avoid uselessly
745 * calculating zone/node ids for pages that could
748 if (page_zone_id(page) != page_zone_id(buddy))
751 VM_BUG_ON_PAGE(page_count(buddy) != 0, buddy);
759 * Freeing function for a buddy system allocator.
761 * The concept of a buddy system is to maintain direct-mapped table
762 * (containing bit values) for memory blocks of various "orders".
763 * The bottom level table contains the map for the smallest allocatable
764 * units of memory (here, pages), and each level above it describes
765 * pairs of units from the levels below, hence, "buddies".
766 * At a high level, all that happens here is marking the table entry
767 * at the bottom level available, and propagating the changes upward
768 * as necessary, plus some accounting needed to play nicely with other
769 * parts of the VM system.
770 * At each level, we keep a list of pages, which are heads of continuous
771 * free pages of length of (1 << order) and marked with _mapcount
772 * PAGE_BUDDY_MAPCOUNT_VALUE. Page's order is recorded in page_private(page)
774 * So when we are allocating or freeing one, we can derive the state of the
775 * other. That is, if we allocate a small block, and both were
776 * free, the remainder of the region must be split into blocks.
777 * If a block is freed, and its buddy is also free, then this
778 * triggers coalescing into a block of larger size.
783 static inline void __free_one_page(struct page *page,
785 struct zone *zone, unsigned int order,
788 unsigned long combined_pfn;
789 unsigned long uninitialized_var(buddy_pfn);
791 unsigned int max_order;
793 max_order = min_t(unsigned int, MAX_ORDER, pageblock_order + 1);
795 VM_BUG_ON(!zone_is_initialized(zone));
796 VM_BUG_ON_PAGE(page->flags & PAGE_FLAGS_CHECK_AT_PREP, page);
798 VM_BUG_ON(migratetype == -1);
799 if (likely(!is_migrate_isolate(migratetype)))
800 __mod_zone_freepage_state(zone, 1 << order, migratetype);
802 VM_BUG_ON_PAGE(pfn & ((1 << order) - 1), page);
803 VM_BUG_ON_PAGE(bad_range(zone, page), page);
806 while (order < max_order - 1) {
807 buddy_pfn = __find_buddy_pfn(pfn, order);
808 buddy = page + (buddy_pfn - pfn);
810 if (!pfn_valid_within(buddy_pfn))
812 if (!page_is_buddy(page, buddy, order))
815 * Our buddy is free or it is CONFIG_DEBUG_PAGEALLOC guard page,
816 * merge with it and move up one order.
818 if (page_is_guard(buddy)) {
819 clear_page_guard(zone, buddy, order, migratetype);
821 list_del(&buddy->lru);
822 zone->free_area[order].nr_free--;
823 rmv_page_order(buddy);
825 combined_pfn = buddy_pfn & pfn;
826 page = page + (combined_pfn - pfn);
830 if (max_order < MAX_ORDER) {
831 /* If we are here, it means order is >= pageblock_order.
832 * We want to prevent merge between freepages on isolate
833 * pageblock and normal pageblock. Without this, pageblock
834 * isolation could cause incorrect freepage or CMA accounting.
836 * We don't want to hit this code for the more frequent
839 if (unlikely(has_isolate_pageblock(zone))) {
842 buddy_pfn = __find_buddy_pfn(pfn, order);
843 buddy = page + (buddy_pfn - pfn);
844 buddy_mt = get_pageblock_migratetype(buddy);
846 if (migratetype != buddy_mt
847 && (is_migrate_isolate(migratetype) ||
848 is_migrate_isolate(buddy_mt)))
852 goto continue_merging;
856 set_page_order(page, order);
859 * If this is not the largest possible page, check if the buddy
860 * of the next-highest order is free. If it is, it's possible
861 * that pages are being freed that will coalesce soon. In case,
862 * that is happening, add the free page to the tail of the list
863 * so it's less likely to be used soon and more likely to be merged
864 * as a higher order page
866 if ((order < MAX_ORDER-2) && pfn_valid_within(buddy_pfn)) {
867 struct page *higher_page, *higher_buddy;
868 combined_pfn = buddy_pfn & pfn;
869 higher_page = page + (combined_pfn - pfn);
870 buddy_pfn = __find_buddy_pfn(combined_pfn, order + 1);
871 higher_buddy = higher_page + (buddy_pfn - combined_pfn);
872 if (page_is_buddy(higher_page, higher_buddy, order + 1)) {
873 list_add_tail(&page->lru,
874 &zone->free_area[order].free_list[migratetype]);
879 list_add(&page->lru, &zone->free_area[order].free_list[migratetype]);
881 zone->free_area[order].nr_free++;
885 * A bad page could be due to a number of fields. Instead of multiple branches,
886 * try and check multiple fields with one check. The caller must do a detailed
887 * check if necessary.
889 static inline bool page_expected_state(struct page *page,
890 unsigned long check_flags)
892 if (unlikely(atomic_read(&page->_mapcount) != -1))
895 if (unlikely((unsigned long)page->mapping |
896 page_ref_count(page) |
898 (unsigned long)page->mem_cgroup |
900 (page->flags & check_flags)))
906 static void free_pages_check_bad(struct page *page)
908 const char *bad_reason;
909 unsigned long bad_flags;
914 if (unlikely(atomic_read(&page->_mapcount) != -1))
915 bad_reason = "nonzero mapcount";
916 if (unlikely(page->mapping != NULL))
917 bad_reason = "non-NULL mapping";
918 if (unlikely(page_ref_count(page) != 0))
919 bad_reason = "nonzero _refcount";
920 if (unlikely(page->flags & PAGE_FLAGS_CHECK_AT_FREE)) {
921 bad_reason = "PAGE_FLAGS_CHECK_AT_FREE flag(s) set";
922 bad_flags = PAGE_FLAGS_CHECK_AT_FREE;
925 if (unlikely(page->mem_cgroup))
926 bad_reason = "page still charged to cgroup";
928 bad_page(page, bad_reason, bad_flags);
931 static inline int free_pages_check(struct page *page)
933 if (likely(page_expected_state(page, PAGE_FLAGS_CHECK_AT_FREE)))
936 /* Something has gone sideways, find it */
937 free_pages_check_bad(page);
941 static int free_tail_pages_check(struct page *head_page, struct page *page)
946 * We rely page->lru.next never has bit 0 set, unless the page
947 * is PageTail(). Let's make sure that's true even for poisoned ->lru.
949 BUILD_BUG_ON((unsigned long)LIST_POISON1 & 1);
951 if (!IS_ENABLED(CONFIG_DEBUG_VM)) {
955 switch (page - head_page) {
957 /* the first tail page: ->mapping is compound_mapcount() */
958 if (unlikely(compound_mapcount(page))) {
959 bad_page(page, "nonzero compound_mapcount", 0);
965 * the second tail page: ->mapping is
966 * page_deferred_list().next -- ignore value.
970 if (page->mapping != TAIL_MAPPING) {
971 bad_page(page, "corrupted mapping in tail page", 0);
976 if (unlikely(!PageTail(page))) {
977 bad_page(page, "PageTail not set", 0);
980 if (unlikely(compound_head(page) != head_page)) {
981 bad_page(page, "compound_head not consistent", 0);
986 page->mapping = NULL;
987 clear_compound_head(page);
991 static __always_inline bool free_pages_prepare(struct page *page,
992 unsigned int order, bool check_free)
996 VM_BUG_ON_PAGE(PageTail(page), page);
998 trace_mm_page_free(page, order);
999 kmemcheck_free_shadow(page, order);
1002 * Check tail pages before head page information is cleared to
1003 * avoid checking PageCompound for order-0 pages.
1005 if (unlikely(order)) {
1006 bool compound = PageCompound(page);
1009 VM_BUG_ON_PAGE(compound && compound_order(page) != order, page);
1012 ClearPageDoubleMap(page);
1013 for (i = 1; i < (1 << order); i++) {
1015 bad += free_tail_pages_check(page, page + i);
1016 if (unlikely(free_pages_check(page + i))) {
1020 (page + i)->flags &= ~PAGE_FLAGS_CHECK_AT_PREP;
1023 if (PageMappingFlags(page))
1024 page->mapping = NULL;
1025 if (memcg_kmem_enabled() && PageKmemcg(page))
1026 memcg_kmem_uncharge(page, order);
1028 bad += free_pages_check(page);
1032 page_cpupid_reset_last(page);
1033 page->flags &= ~PAGE_FLAGS_CHECK_AT_PREP;
1034 reset_page_owner(page, order);
1036 if (!PageHighMem(page)) {
1037 debug_check_no_locks_freed(page_address(page),
1038 PAGE_SIZE << order);
1039 debug_check_no_obj_freed(page_address(page),
1040 PAGE_SIZE << order);
1042 arch_free_page(page, order);
1043 kernel_poison_pages(page, 1 << order, 0);
1044 kernel_map_pages(page, 1 << order, 0);
1045 kasan_free_pages(page, order);
1050 #ifdef CONFIG_DEBUG_VM
1051 static inline bool free_pcp_prepare(struct page *page)
1053 return free_pages_prepare(page, 0, true);
1056 static inline bool bulkfree_pcp_prepare(struct page *page)
1061 static bool free_pcp_prepare(struct page *page)
1063 return free_pages_prepare(page, 0, false);
1066 static bool bulkfree_pcp_prepare(struct page *page)
1068 return free_pages_check(page);
1070 #endif /* CONFIG_DEBUG_VM */
1073 * Frees a number of pages from the PCP lists
1074 * Assumes all pages on list are in same zone, and of same order.
1075 * count is the number of pages to free.
1077 * If the zone was previously in an "all pages pinned" state then look to
1078 * see if this freeing clears that state.
1080 * And clear the zone's pages_scanned counter, to hold off the "all pages are
1081 * pinned" detection logic.
1083 static void free_pcppages_bulk(struct zone *zone, int count,
1084 struct per_cpu_pages *pcp)
1086 int migratetype = 0;
1088 unsigned long nr_scanned;
1089 bool isolated_pageblocks;
1091 spin_lock(&zone->lock);
1092 isolated_pageblocks = has_isolate_pageblock(zone);
1093 nr_scanned = node_page_state(zone->zone_pgdat, NR_PAGES_SCANNED);
1095 __mod_node_page_state(zone->zone_pgdat, NR_PAGES_SCANNED, -nr_scanned);
1099 struct list_head *list;
1102 * Remove pages from lists in a round-robin fashion. A
1103 * batch_free count is maintained that is incremented when an
1104 * empty list is encountered. This is so more pages are freed
1105 * off fuller lists instead of spinning excessively around empty
1110 if (++migratetype == MIGRATE_PCPTYPES)
1112 list = &pcp->lists[migratetype];
1113 } while (list_empty(list));
1115 /* This is the only non-empty list. Free them all. */
1116 if (batch_free == MIGRATE_PCPTYPES)
1120 int mt; /* migratetype of the to-be-freed page */
1122 page = list_last_entry(list, struct page, lru);
1123 /* must delete as __free_one_page list manipulates */
1124 list_del(&page->lru);
1126 mt = get_pcppage_migratetype(page);
1127 /* MIGRATE_ISOLATE page should not go to pcplists */
1128 VM_BUG_ON_PAGE(is_migrate_isolate(mt), page);
1129 /* Pageblock could have been isolated meanwhile */
1130 if (unlikely(isolated_pageblocks))
1131 mt = get_pageblock_migratetype(page);
1133 if (bulkfree_pcp_prepare(page))
1136 __free_one_page(page, page_to_pfn(page), zone, 0, mt);
1137 trace_mm_page_pcpu_drain(page, 0, mt);
1138 } while (--count && --batch_free && !list_empty(list));
1140 spin_unlock(&zone->lock);
1143 static void free_one_page(struct zone *zone,
1144 struct page *page, unsigned long pfn,
1148 unsigned long nr_scanned;
1149 spin_lock(&zone->lock);
1150 nr_scanned = node_page_state(zone->zone_pgdat, NR_PAGES_SCANNED);
1152 __mod_node_page_state(zone->zone_pgdat, NR_PAGES_SCANNED, -nr_scanned);
1154 if (unlikely(has_isolate_pageblock(zone) ||
1155 is_migrate_isolate(migratetype))) {
1156 migratetype = get_pfnblock_migratetype(page, pfn);
1158 __free_one_page(page, pfn, zone, order, migratetype);
1159 spin_unlock(&zone->lock);
1162 static void __meminit __init_single_page(struct page *page, unsigned long pfn,
1163 unsigned long zone, int nid)
1165 set_page_links(page, zone, nid, pfn);
1166 init_page_count(page);
1167 page_mapcount_reset(page);
1168 page_cpupid_reset_last(page);
1170 INIT_LIST_HEAD(&page->lru);
1171 #ifdef WANT_PAGE_VIRTUAL
1172 /* The shift won't overflow because ZONE_NORMAL is below 4G. */
1173 if (!is_highmem_idx(zone))
1174 set_page_address(page, __va(pfn << PAGE_SHIFT));
1178 static void __meminit __init_single_pfn(unsigned long pfn, unsigned long zone,
1181 return __init_single_page(pfn_to_page(pfn), pfn, zone, nid);
1184 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
1185 static void init_reserved_page(unsigned long pfn)
1190 if (!early_page_uninitialised(pfn))
1193 nid = early_pfn_to_nid(pfn);
1194 pgdat = NODE_DATA(nid);
1196 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
1197 struct zone *zone = &pgdat->node_zones[zid];
1199 if (pfn >= zone->zone_start_pfn && pfn < zone_end_pfn(zone))
1202 __init_single_pfn(pfn, zid, nid);
1205 static inline void init_reserved_page(unsigned long pfn)
1208 #endif /* CONFIG_DEFERRED_STRUCT_PAGE_INIT */
1211 * Initialised pages do not have PageReserved set. This function is
1212 * called for each range allocated by the bootmem allocator and
1213 * marks the pages PageReserved. The remaining valid pages are later
1214 * sent to the buddy page allocator.
1216 void __meminit reserve_bootmem_region(phys_addr_t start, phys_addr_t end)
1218 unsigned long start_pfn = PFN_DOWN(start);
1219 unsigned long end_pfn = PFN_UP(end);
1221 for (; start_pfn < end_pfn; start_pfn++) {
1222 if (pfn_valid(start_pfn)) {
1223 struct page *page = pfn_to_page(start_pfn);
1225 init_reserved_page(start_pfn);
1227 /* Avoid false-positive PageTail() */
1228 INIT_LIST_HEAD(&page->lru);
1230 SetPageReserved(page);
1235 static void __free_pages_ok(struct page *page, unsigned int order)
1237 unsigned long flags;
1239 unsigned long pfn = page_to_pfn(page);
1241 if (!free_pages_prepare(page, order, true))
1244 migratetype = get_pfnblock_migratetype(page, pfn);
1245 local_irq_save(flags);
1246 __count_vm_events(PGFREE, 1 << order);
1247 free_one_page(page_zone(page), page, pfn, order, migratetype);
1248 local_irq_restore(flags);
1251 static void __init __free_pages_boot_core(struct page *page, unsigned int order)
1253 unsigned int nr_pages = 1 << order;
1254 struct page *p = page;
1258 for (loop = 0; loop < (nr_pages - 1); loop++, p++) {
1260 __ClearPageReserved(p);
1261 set_page_count(p, 0);
1263 __ClearPageReserved(p);
1264 set_page_count(p, 0);
1266 page_zone(page)->managed_pages += nr_pages;
1267 set_page_refcounted(page);
1268 __free_pages(page, order);
1271 #if defined(CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID) || \
1272 defined(CONFIG_HAVE_MEMBLOCK_NODE_MAP)
1274 static struct mminit_pfnnid_cache early_pfnnid_cache __meminitdata;
1276 int __meminit early_pfn_to_nid(unsigned long pfn)
1278 static DEFINE_SPINLOCK(early_pfn_lock);
1281 spin_lock(&early_pfn_lock);
1282 nid = __early_pfn_to_nid(pfn, &early_pfnnid_cache);
1284 nid = first_online_node;
1285 spin_unlock(&early_pfn_lock);
1291 #ifdef CONFIG_NODES_SPAN_OTHER_NODES
1292 static inline bool __meminit meminit_pfn_in_nid(unsigned long pfn, int node,
1293 struct mminit_pfnnid_cache *state)
1297 nid = __early_pfn_to_nid(pfn, state);
1298 if (nid >= 0 && nid != node)
1303 /* Only safe to use early in boot when initialisation is single-threaded */
1304 static inline bool __meminit early_pfn_in_nid(unsigned long pfn, int node)
1306 return meminit_pfn_in_nid(pfn, node, &early_pfnnid_cache);
1311 static inline bool __meminit early_pfn_in_nid(unsigned long pfn, int node)
1315 static inline bool __meminit meminit_pfn_in_nid(unsigned long pfn, int node,
1316 struct mminit_pfnnid_cache *state)
1323 void __init __free_pages_bootmem(struct page *page, unsigned long pfn,
1326 if (early_page_uninitialised(pfn))
1328 return __free_pages_boot_core(page, order);
1332 * Check that the whole (or subset of) a pageblock given by the interval of
1333 * [start_pfn, end_pfn) is valid and within the same zone, before scanning it
1334 * with the migration of free compaction scanner. The scanners then need to
1335 * use only pfn_valid_within() check for arches that allow holes within
1338 * Return struct page pointer of start_pfn, or NULL if checks were not passed.
1340 * It's possible on some configurations to have a setup like node0 node1 node0
1341 * i.e. it's possible that all pages within a zones range of pages do not
1342 * belong to a single zone. We assume that a border between node0 and node1
1343 * can occur within a single pageblock, but not a node0 node1 node0
1344 * interleaving within a single pageblock. It is therefore sufficient to check
1345 * the first and last page of a pageblock and avoid checking each individual
1346 * page in a pageblock.
1348 struct page *__pageblock_pfn_to_page(unsigned long start_pfn,
1349 unsigned long end_pfn, struct zone *zone)
1351 struct page *start_page;
1352 struct page *end_page;
1354 /* end_pfn is one past the range we are checking */
1357 if (!pfn_valid(start_pfn) || !pfn_valid(end_pfn))
1360 start_page = pfn_to_page(start_pfn);
1362 if (page_zone(start_page) != zone)
1365 end_page = pfn_to_page(end_pfn);
1367 /* This gives a shorter code than deriving page_zone(end_page) */
1368 if (page_zone_id(start_page) != page_zone_id(end_page))
1374 void set_zone_contiguous(struct zone *zone)
1376 unsigned long block_start_pfn = zone->zone_start_pfn;
1377 unsigned long block_end_pfn;
1379 block_end_pfn = ALIGN(block_start_pfn + 1, pageblock_nr_pages);
1380 for (; block_start_pfn < zone_end_pfn(zone);
1381 block_start_pfn = block_end_pfn,
1382 block_end_pfn += pageblock_nr_pages) {
1384 block_end_pfn = min(block_end_pfn, zone_end_pfn(zone));
1386 if (!__pageblock_pfn_to_page(block_start_pfn,
1387 block_end_pfn, zone))
1391 /* We confirm that there is no hole */
1392 zone->contiguous = true;
1395 void clear_zone_contiguous(struct zone *zone)
1397 zone->contiguous = false;
1400 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
1401 static void __init deferred_free_range(struct page *page,
1402 unsigned long pfn, int nr_pages)
1409 /* Free a large naturally-aligned chunk if possible */
1410 if (nr_pages == pageblock_nr_pages &&
1411 (pfn & (pageblock_nr_pages - 1)) == 0) {
1412 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
1413 __free_pages_boot_core(page, pageblock_order);
1417 for (i = 0; i < nr_pages; i++, page++, pfn++) {
1418 if ((pfn & (pageblock_nr_pages - 1)) == 0)
1419 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
1420 __free_pages_boot_core(page, 0);
1424 /* Completion tracking for deferred_init_memmap() threads */
1425 static atomic_t pgdat_init_n_undone __initdata;
1426 static __initdata DECLARE_COMPLETION(pgdat_init_all_done_comp);
1428 static inline void __init pgdat_init_report_one_done(void)
1430 if (atomic_dec_and_test(&pgdat_init_n_undone))
1431 complete(&pgdat_init_all_done_comp);
1434 /* Initialise remaining memory on a node */
1435 static int __init deferred_init_memmap(void *data)
1437 pg_data_t *pgdat = data;
1438 int nid = pgdat->node_id;
1439 struct mminit_pfnnid_cache nid_init_state = { };
1440 unsigned long start = jiffies;
1441 unsigned long nr_pages = 0;
1442 unsigned long walk_start, walk_end;
1445 unsigned long first_init_pfn = pgdat->first_deferred_pfn;
1446 const struct cpumask *cpumask = cpumask_of_node(pgdat->node_id);
1448 if (first_init_pfn == ULONG_MAX) {
1449 pgdat_init_report_one_done();
1453 /* Bind memory initialisation thread to a local node if possible */
1454 if (!cpumask_empty(cpumask))
1455 set_cpus_allowed_ptr(current, cpumask);
1457 /* Sanity check boundaries */
1458 BUG_ON(pgdat->first_deferred_pfn < pgdat->node_start_pfn);
1459 BUG_ON(pgdat->first_deferred_pfn > pgdat_end_pfn(pgdat));
1460 pgdat->first_deferred_pfn = ULONG_MAX;
1462 /* Only the highest zone is deferred so find it */
1463 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
1464 zone = pgdat->node_zones + zid;
1465 if (first_init_pfn < zone_end_pfn(zone))
1469 for_each_mem_pfn_range(i, nid, &walk_start, &walk_end, NULL) {
1470 unsigned long pfn, end_pfn;
1471 struct page *page = NULL;
1472 struct page *free_base_page = NULL;
1473 unsigned long free_base_pfn = 0;
1476 end_pfn = min(walk_end, zone_end_pfn(zone));
1477 pfn = first_init_pfn;
1478 if (pfn < walk_start)
1480 if (pfn < zone->zone_start_pfn)
1481 pfn = zone->zone_start_pfn;
1483 for (; pfn < end_pfn; pfn++) {
1484 if (!pfn_valid_within(pfn))
1488 * Ensure pfn_valid is checked every
1489 * pageblock_nr_pages for memory holes
1491 if ((pfn & (pageblock_nr_pages - 1)) == 0) {
1492 if (!pfn_valid(pfn)) {
1498 if (!meminit_pfn_in_nid(pfn, nid, &nid_init_state)) {
1503 /* Minimise pfn page lookups and scheduler checks */
1504 if (page && (pfn & (pageblock_nr_pages - 1)) != 0) {
1507 nr_pages += nr_to_free;
1508 deferred_free_range(free_base_page,
1509 free_base_pfn, nr_to_free);
1510 free_base_page = NULL;
1511 free_base_pfn = nr_to_free = 0;
1513 page = pfn_to_page(pfn);
1518 VM_BUG_ON(page_zone(page) != zone);
1522 __init_single_page(page, pfn, zid, nid);
1523 if (!free_base_page) {
1524 free_base_page = page;
1525 free_base_pfn = pfn;
1530 /* Where possible, batch up pages for a single free */
1533 /* Free the current block of pages to allocator */
1534 nr_pages += nr_to_free;
1535 deferred_free_range(free_base_page, free_base_pfn,
1537 free_base_page = NULL;
1538 free_base_pfn = nr_to_free = 0;
1540 /* Free the last block of pages to allocator */
1541 nr_pages += nr_to_free;
1542 deferred_free_range(free_base_page, free_base_pfn, nr_to_free);
1544 first_init_pfn = max(end_pfn, first_init_pfn);
1547 /* Sanity check that the next zone really is unpopulated */
1548 WARN_ON(++zid < MAX_NR_ZONES && populated_zone(++zone));
1550 pr_info("node %d initialised, %lu pages in %ums\n", nid, nr_pages,
1551 jiffies_to_msecs(jiffies - start));
1553 pgdat_init_report_one_done();
1556 #endif /* CONFIG_DEFERRED_STRUCT_PAGE_INIT */
1558 void __init page_alloc_init_late(void)
1562 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
1565 /* There will be num_node_state(N_MEMORY) threads */
1566 atomic_set(&pgdat_init_n_undone, num_node_state(N_MEMORY));
1567 for_each_node_state(nid, N_MEMORY) {
1568 kthread_run(deferred_init_memmap, NODE_DATA(nid), "pgdatinit%d", nid);
1571 /* Block until all are initialised */
1572 wait_for_completion(&pgdat_init_all_done_comp);
1574 /* Reinit limits that are based on free pages after the kernel is up */
1575 files_maxfiles_init();
1578 for_each_populated_zone(zone)
1579 set_zone_contiguous(zone);
1583 /* Free whole pageblock and set its migration type to MIGRATE_CMA. */
1584 void __init init_cma_reserved_pageblock(struct page *page)
1586 unsigned i = pageblock_nr_pages;
1587 struct page *p = page;
1590 __ClearPageReserved(p);
1591 set_page_count(p, 0);
1594 set_pageblock_migratetype(page, MIGRATE_CMA);
1596 if (pageblock_order >= MAX_ORDER) {
1597 i = pageblock_nr_pages;
1600 set_page_refcounted(p);
1601 __free_pages(p, MAX_ORDER - 1);
1602 p += MAX_ORDER_NR_PAGES;
1603 } while (i -= MAX_ORDER_NR_PAGES);
1605 set_page_refcounted(page);
1606 __free_pages(page, pageblock_order);
1609 adjust_managed_page_count(page, pageblock_nr_pages);
1614 * The order of subdivision here is critical for the IO subsystem.
1615 * Please do not alter this order without good reasons and regression
1616 * testing. Specifically, as large blocks of memory are subdivided,
1617 * the order in which smaller blocks are delivered depends on the order
1618 * they're subdivided in this function. This is the primary factor
1619 * influencing the order in which pages are delivered to the IO
1620 * subsystem according to empirical testing, and this is also justified
1621 * by considering the behavior of a buddy system containing a single
1622 * large block of memory acted on by a series of small allocations.
1623 * This behavior is a critical factor in sglist merging's success.
1627 static inline void expand(struct zone *zone, struct page *page,
1628 int low, int high, struct free_area *area,
1631 unsigned long size = 1 << high;
1633 while (high > low) {
1637 VM_BUG_ON_PAGE(bad_range(zone, &page[size]), &page[size]);
1640 * Mark as guard pages (or page), that will allow to
1641 * merge back to allocator when buddy will be freed.
1642 * Corresponding page table entries will not be touched,
1643 * pages will stay not present in virtual address space
1645 if (set_page_guard(zone, &page[size], high, migratetype))
1648 list_add(&page[size].lru, &area->free_list[migratetype]);
1650 set_page_order(&page[size], high);
1654 static void check_new_page_bad(struct page *page)
1656 const char *bad_reason = NULL;
1657 unsigned long bad_flags = 0;
1659 if (unlikely(atomic_read(&page->_mapcount) != -1))
1660 bad_reason = "nonzero mapcount";
1661 if (unlikely(page->mapping != NULL))
1662 bad_reason = "non-NULL mapping";
1663 if (unlikely(page_ref_count(page) != 0))
1664 bad_reason = "nonzero _count";
1665 if (unlikely(page->flags & __PG_HWPOISON)) {
1666 bad_reason = "HWPoisoned (hardware-corrupted)";
1667 bad_flags = __PG_HWPOISON;
1668 /* Don't complain about hwpoisoned pages */
1669 page_mapcount_reset(page); /* remove PageBuddy */
1672 if (unlikely(page->flags & PAGE_FLAGS_CHECK_AT_PREP)) {
1673 bad_reason = "PAGE_FLAGS_CHECK_AT_PREP flag set";
1674 bad_flags = PAGE_FLAGS_CHECK_AT_PREP;
1677 if (unlikely(page->mem_cgroup))
1678 bad_reason = "page still charged to cgroup";
1680 bad_page(page, bad_reason, bad_flags);
1684 * This page is about to be returned from the page allocator
1686 static inline int check_new_page(struct page *page)
1688 if (likely(page_expected_state(page,
1689 PAGE_FLAGS_CHECK_AT_PREP|__PG_HWPOISON)))
1692 check_new_page_bad(page);
1696 static inline bool free_pages_prezeroed(bool poisoned)
1698 return IS_ENABLED(CONFIG_PAGE_POISONING_ZERO) &&
1699 page_poisoning_enabled() && poisoned;
1702 #ifdef CONFIG_DEBUG_VM
1703 static bool check_pcp_refill(struct page *page)
1708 static bool check_new_pcp(struct page *page)
1710 return check_new_page(page);
1713 static bool check_pcp_refill(struct page *page)
1715 return check_new_page(page);
1717 static bool check_new_pcp(struct page *page)
1721 #endif /* CONFIG_DEBUG_VM */
1723 static bool check_new_pages(struct page *page, unsigned int order)
1726 for (i = 0; i < (1 << order); i++) {
1727 struct page *p = page + i;
1729 if (unlikely(check_new_page(p)))
1736 inline void post_alloc_hook(struct page *page, unsigned int order,
1739 set_page_private(page, 0);
1740 set_page_refcounted(page);
1742 arch_alloc_page(page, order);
1743 kernel_map_pages(page, 1 << order, 1);
1744 kernel_poison_pages(page, 1 << order, 1);
1745 kasan_alloc_pages(page, order);
1746 set_page_owner(page, order, gfp_flags);
1749 static void prep_new_page(struct page *page, unsigned int order, gfp_t gfp_flags,
1750 unsigned int alloc_flags)
1753 bool poisoned = true;
1755 for (i = 0; i < (1 << order); i++) {
1756 struct page *p = page + i;
1758 poisoned &= page_is_poisoned(p);
1761 post_alloc_hook(page, order, gfp_flags);
1763 if (!free_pages_prezeroed(poisoned) && (gfp_flags & __GFP_ZERO))
1764 for (i = 0; i < (1 << order); i++)
1765 clear_highpage(page + i);
1767 if (order && (gfp_flags & __GFP_COMP))
1768 prep_compound_page(page, order);
1771 * page is set pfmemalloc when ALLOC_NO_WATERMARKS was necessary to
1772 * allocate the page. The expectation is that the caller is taking
1773 * steps that will free more memory. The caller should avoid the page
1774 * being used for !PFMEMALLOC purposes.
1776 if (alloc_flags & ALLOC_NO_WATERMARKS)
1777 set_page_pfmemalloc(page);
1779 clear_page_pfmemalloc(page);
1783 * Go through the free lists for the given migratetype and remove
1784 * the smallest available page from the freelists
1787 struct page *__rmqueue_smallest(struct zone *zone, unsigned int order,
1790 unsigned int current_order;
1791 struct free_area *area;
1794 /* Find a page of the appropriate size in the preferred list */
1795 for (current_order = order; current_order < MAX_ORDER; ++current_order) {
1796 area = &(zone->free_area[current_order]);
1797 page = list_first_entry_or_null(&area->free_list[migratetype],
1801 list_del(&page->lru);
1802 rmv_page_order(page);
1804 expand(zone, page, order, current_order, area, migratetype);
1805 set_pcppage_migratetype(page, migratetype);
1814 * This array describes the order lists are fallen back to when
1815 * the free lists for the desirable migrate type are depleted
1817 static int fallbacks[MIGRATE_TYPES][4] = {
1818 [MIGRATE_UNMOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_MOVABLE, MIGRATE_TYPES },
1819 [MIGRATE_RECLAIMABLE] = { MIGRATE_UNMOVABLE, MIGRATE_MOVABLE, MIGRATE_TYPES },
1820 [MIGRATE_MOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_UNMOVABLE, MIGRATE_TYPES },
1822 [MIGRATE_CMA] = { MIGRATE_TYPES }, /* Never used */
1824 #ifdef CONFIG_MEMORY_ISOLATION
1825 [MIGRATE_ISOLATE] = { MIGRATE_TYPES }, /* Never used */
1830 static struct page *__rmqueue_cma_fallback(struct zone *zone,
1833 return __rmqueue_smallest(zone, order, MIGRATE_CMA);
1836 static inline struct page *__rmqueue_cma_fallback(struct zone *zone,
1837 unsigned int order) { return NULL; }
1841 * Move the free pages in a range to the free lists of the requested type.
1842 * Note that start_page and end_pages are not aligned on a pageblock
1843 * boundary. If alignment is required, use move_freepages_block()
1845 int move_freepages(struct zone *zone,
1846 struct page *start_page, struct page *end_page,
1851 int pages_moved = 0;
1853 #ifndef CONFIG_HOLES_IN_ZONE
1855 * page_zone is not safe to call in this context when
1856 * CONFIG_HOLES_IN_ZONE is set. This bug check is probably redundant
1857 * anyway as we check zone boundaries in move_freepages_block().
1858 * Remove at a later date when no bug reports exist related to
1859 * grouping pages by mobility
1861 VM_BUG_ON(page_zone(start_page) != page_zone(end_page));
1864 for (page = start_page; page <= end_page;) {
1865 if (!pfn_valid_within(page_to_pfn(page))) {
1870 /* Make sure we are not inadvertently changing nodes */
1871 VM_BUG_ON_PAGE(page_to_nid(page) != zone_to_nid(zone), page);
1873 if (!PageBuddy(page)) {
1878 order = page_order(page);
1879 list_move(&page->lru,
1880 &zone->free_area[order].free_list[migratetype]);
1882 pages_moved += 1 << order;
1888 int move_freepages_block(struct zone *zone, struct page *page,
1891 unsigned long start_pfn, end_pfn;
1892 struct page *start_page, *end_page;
1894 start_pfn = page_to_pfn(page);
1895 start_pfn = start_pfn & ~(pageblock_nr_pages-1);
1896 start_page = pfn_to_page(start_pfn);
1897 end_page = start_page + pageblock_nr_pages - 1;
1898 end_pfn = start_pfn + pageblock_nr_pages - 1;
1900 /* Do not cross zone boundaries */
1901 if (!zone_spans_pfn(zone, start_pfn))
1903 if (!zone_spans_pfn(zone, end_pfn))
1906 return move_freepages(zone, start_page, end_page, migratetype);
1909 static void change_pageblock_range(struct page *pageblock_page,
1910 int start_order, int migratetype)
1912 int nr_pageblocks = 1 << (start_order - pageblock_order);
1914 while (nr_pageblocks--) {
1915 set_pageblock_migratetype(pageblock_page, migratetype);
1916 pageblock_page += pageblock_nr_pages;
1921 * When we are falling back to another migratetype during allocation, try to
1922 * steal extra free pages from the same pageblocks to satisfy further
1923 * allocations, instead of polluting multiple pageblocks.
1925 * If we are stealing a relatively large buddy page, it is likely there will
1926 * be more free pages in the pageblock, so try to steal them all. For
1927 * reclaimable and unmovable allocations, we steal regardless of page size,
1928 * as fragmentation caused by those allocations polluting movable pageblocks
1929 * is worse than movable allocations stealing from unmovable and reclaimable
1932 static bool can_steal_fallback(unsigned int order, int start_mt)
1935 * Leaving this order check is intended, although there is
1936 * relaxed order check in next check. The reason is that
1937 * we can actually steal whole pageblock if this condition met,
1938 * but, below check doesn't guarantee it and that is just heuristic
1939 * so could be changed anytime.
1941 if (order >= pageblock_order)
1944 if (order >= pageblock_order / 2 ||
1945 start_mt == MIGRATE_RECLAIMABLE ||
1946 start_mt == MIGRATE_UNMOVABLE ||
1947 page_group_by_mobility_disabled)
1954 * This function implements actual steal behaviour. If order is large enough,
1955 * we can steal whole pageblock. If not, we first move freepages in this
1956 * pageblock and check whether half of pages are moved or not. If half of
1957 * pages are moved, we can change migratetype of pageblock and permanently
1958 * use it's pages as requested migratetype in the future.
1960 static void steal_suitable_fallback(struct zone *zone, struct page *page,
1963 unsigned int current_order = page_order(page);
1966 /* Take ownership for orders >= pageblock_order */
1967 if (current_order >= pageblock_order) {
1968 change_pageblock_range(page, current_order, start_type);
1972 pages = move_freepages_block(zone, page, start_type);
1974 /* Claim the whole block if over half of it is free */
1975 if (pages >= (1 << (pageblock_order-1)) ||
1976 page_group_by_mobility_disabled)
1977 set_pageblock_migratetype(page, start_type);
1981 * Check whether there is a suitable fallback freepage with requested order.
1982 * If only_stealable is true, this function returns fallback_mt only if
1983 * we can steal other freepages all together. This would help to reduce
1984 * fragmentation due to mixed migratetype pages in one pageblock.
1986 int find_suitable_fallback(struct free_area *area, unsigned int order,
1987 int migratetype, bool only_stealable, bool *can_steal)
1992 if (area->nr_free == 0)
1997 fallback_mt = fallbacks[migratetype][i];
1998 if (fallback_mt == MIGRATE_TYPES)
2001 if (list_empty(&area->free_list[fallback_mt]))
2004 if (can_steal_fallback(order, migratetype))
2007 if (!only_stealable)
2018 * Reserve a pageblock for exclusive use of high-order atomic allocations if
2019 * there are no empty page blocks that contain a page with a suitable order
2021 static void reserve_highatomic_pageblock(struct page *page, struct zone *zone,
2022 unsigned int alloc_order)
2025 unsigned long max_managed, flags;
2028 * Limit the number reserved to 1 pageblock or roughly 1% of a zone.
2029 * Check is race-prone but harmless.
2031 max_managed = (zone->managed_pages / 100) + pageblock_nr_pages;
2032 if (zone->nr_reserved_highatomic >= max_managed)
2035 spin_lock_irqsave(&zone->lock, flags);
2037 /* Recheck the nr_reserved_highatomic limit under the lock */
2038 if (zone->nr_reserved_highatomic >= max_managed)
2042 mt = get_pageblock_migratetype(page);
2043 if (mt != MIGRATE_HIGHATOMIC &&
2044 !is_migrate_isolate(mt) && !is_migrate_cma(mt)) {
2045 zone->nr_reserved_highatomic += pageblock_nr_pages;
2046 set_pageblock_migratetype(page, MIGRATE_HIGHATOMIC);
2047 move_freepages_block(zone, page, MIGRATE_HIGHATOMIC);
2051 spin_unlock_irqrestore(&zone->lock, flags);
2055 * Used when an allocation is about to fail under memory pressure. This
2056 * potentially hurts the reliability of high-order allocations when under
2057 * intense memory pressure but failed atomic allocations should be easier
2058 * to recover from than an OOM.
2060 * If @force is true, try to unreserve a pageblock even though highatomic
2061 * pageblock is exhausted.
2063 static bool unreserve_highatomic_pageblock(const struct alloc_context *ac,
2066 struct zonelist *zonelist = ac->zonelist;
2067 unsigned long flags;
2074 for_each_zone_zonelist_nodemask(zone, z, zonelist, ac->high_zoneidx,
2077 * Preserve at least one pageblock unless memory pressure
2080 if (!force && zone->nr_reserved_highatomic <=
2084 spin_lock_irqsave(&zone->lock, flags);
2085 for (order = 0; order < MAX_ORDER; order++) {
2086 struct free_area *area = &(zone->free_area[order]);
2088 page = list_first_entry_or_null(
2089 &area->free_list[MIGRATE_HIGHATOMIC],
2095 * In page freeing path, migratetype change is racy so
2096 * we can counter several free pages in a pageblock
2097 * in this loop althoug we changed the pageblock type
2098 * from highatomic to ac->migratetype. So we should
2099 * adjust the count once.
2101 if (get_pageblock_migratetype(page) ==
2102 MIGRATE_HIGHATOMIC) {
2104 * It should never happen but changes to
2105 * locking could inadvertently allow a per-cpu
2106 * drain to add pages to MIGRATE_HIGHATOMIC
2107 * while unreserving so be safe and watch for
2110 zone->nr_reserved_highatomic -= min(
2112 zone->nr_reserved_highatomic);
2116 * Convert to ac->migratetype and avoid the normal
2117 * pageblock stealing heuristics. Minimally, the caller
2118 * is doing the work and needs the pages. More
2119 * importantly, if the block was always converted to
2120 * MIGRATE_UNMOVABLE or another type then the number
2121 * of pageblocks that cannot be completely freed
2124 set_pageblock_migratetype(page, ac->migratetype);
2125 ret = move_freepages_block(zone, page, ac->migratetype);
2127 spin_unlock_irqrestore(&zone->lock, flags);
2131 spin_unlock_irqrestore(&zone->lock, flags);
2137 /* Remove an element from the buddy allocator from the fallback list */
2138 static inline struct page *
2139 __rmqueue_fallback(struct zone *zone, unsigned int order, int start_migratetype)
2141 struct free_area *area;
2142 unsigned int current_order;
2147 /* Find the largest possible block of pages in the other list */
2148 for (current_order = MAX_ORDER-1;
2149 current_order >= order && current_order <= MAX_ORDER-1;
2151 area = &(zone->free_area[current_order]);
2152 fallback_mt = find_suitable_fallback(area, current_order,
2153 start_migratetype, false, &can_steal);
2154 if (fallback_mt == -1)
2157 page = list_first_entry(&area->free_list[fallback_mt],
2160 get_pageblock_migratetype(page) != MIGRATE_HIGHATOMIC)
2161 steal_suitable_fallback(zone, page, start_migratetype);
2163 /* Remove the page from the freelists */
2165 list_del(&page->lru);
2166 rmv_page_order(page);
2168 expand(zone, page, order, current_order, area,
2171 * The pcppage_migratetype may differ from pageblock's
2172 * migratetype depending on the decisions in
2173 * find_suitable_fallback(). This is OK as long as it does not
2174 * differ for MIGRATE_CMA pageblocks. Those can be used as
2175 * fallback only via special __rmqueue_cma_fallback() function
2177 set_pcppage_migratetype(page, start_migratetype);
2179 trace_mm_page_alloc_extfrag(page, order, current_order,
2180 start_migratetype, fallback_mt);
2189 * Do the hard work of removing an element from the buddy allocator.
2190 * Call me with the zone->lock already held.
2192 static struct page *__rmqueue(struct zone *zone, unsigned int order,
2197 page = __rmqueue_smallest(zone, order, migratetype);
2198 if (unlikely(!page)) {
2199 if (migratetype == MIGRATE_MOVABLE)
2200 page = __rmqueue_cma_fallback(zone, order);
2203 page = __rmqueue_fallback(zone, order, migratetype);
2206 trace_mm_page_alloc_zone_locked(page, order, migratetype);
2211 * Obtain a specified number of elements from the buddy allocator, all under
2212 * a single hold of the lock, for efficiency. Add them to the supplied list.
2213 * Returns the number of new pages which were placed at *list.
2215 static int rmqueue_bulk(struct zone *zone, unsigned int order,
2216 unsigned long count, struct list_head *list,
2217 int migratetype, bool cold)
2221 spin_lock(&zone->lock);
2222 for (i = 0; i < count; ++i) {
2223 struct page *page = __rmqueue(zone, order, migratetype);
2224 if (unlikely(page == NULL))
2227 if (unlikely(check_pcp_refill(page)))
2231 * Split buddy pages returned by expand() are received here
2232 * in physical page order. The page is added to the callers and
2233 * list and the list head then moves forward. From the callers
2234 * perspective, the linked list is ordered by page number in
2235 * some conditions. This is useful for IO devices that can
2236 * merge IO requests if the physical pages are ordered
2240 list_add(&page->lru, list);
2242 list_add_tail(&page->lru, list);
2245 if (is_migrate_cma(get_pcppage_migratetype(page)))
2246 __mod_zone_page_state(zone, NR_FREE_CMA_PAGES,
2251 * i pages were removed from the buddy list even if some leak due
2252 * to check_pcp_refill failing so adjust NR_FREE_PAGES based
2253 * on i. Do not confuse with 'alloced' which is the number of
2254 * pages added to the pcp list.
2256 __mod_zone_page_state(zone, NR_FREE_PAGES, -(i << order));
2257 spin_unlock(&zone->lock);
2263 * Called from the vmstat counter updater to drain pagesets of this
2264 * currently executing processor on remote nodes after they have
2267 * Note that this function must be called with the thread pinned to
2268 * a single processor.
2270 void drain_zone_pages(struct zone *zone, struct per_cpu_pages *pcp)
2272 unsigned long flags;
2273 int to_drain, batch;
2275 local_irq_save(flags);
2276 batch = READ_ONCE(pcp->batch);
2277 to_drain = min(pcp->count, batch);
2279 free_pcppages_bulk(zone, to_drain, pcp);
2280 pcp->count -= to_drain;
2282 local_irq_restore(flags);
2287 * Drain pcplists of the indicated processor and zone.
2289 * The processor must either be the current processor and the
2290 * thread pinned to the current processor or a processor that
2293 static void drain_pages_zone(unsigned int cpu, struct zone *zone)
2295 unsigned long flags;
2296 struct per_cpu_pageset *pset;
2297 struct per_cpu_pages *pcp;
2299 local_irq_save(flags);
2300 pset = per_cpu_ptr(zone->pageset, cpu);
2304 free_pcppages_bulk(zone, pcp->count, pcp);
2307 local_irq_restore(flags);
2311 * Drain pcplists of all zones on the indicated processor.
2313 * The processor must either be the current processor and the
2314 * thread pinned to the current processor or a processor that
2317 static void drain_pages(unsigned int cpu)
2321 for_each_populated_zone(zone) {
2322 drain_pages_zone(cpu, zone);
2327 * Spill all of this CPU's per-cpu pages back into the buddy allocator.
2329 * The CPU has to be pinned. When zone parameter is non-NULL, spill just
2330 * the single zone's pages.
2332 void drain_local_pages(struct zone *zone)
2334 int cpu = smp_processor_id();
2337 drain_pages_zone(cpu, zone);
2343 * Spill all the per-cpu pages from all CPUs back into the buddy allocator.
2345 * When zone parameter is non-NULL, spill just the single zone's pages.
2347 * Note that this code is protected against sending an IPI to an offline
2348 * CPU but does not guarantee sending an IPI to newly hotplugged CPUs:
2349 * on_each_cpu_mask() blocks hotplug and won't talk to offlined CPUs but
2350 * nothing keeps CPUs from showing up after we populated the cpumask and
2351 * before the call to on_each_cpu_mask().
2353 void drain_all_pages(struct zone *zone)
2358 * Allocate in the BSS so we wont require allocation in
2359 * direct reclaim path for CONFIG_CPUMASK_OFFSTACK=y
2361 static cpumask_t cpus_with_pcps;
2364 * We don't care about racing with CPU hotplug event
2365 * as offline notification will cause the notified
2366 * cpu to drain that CPU pcps and on_each_cpu_mask
2367 * disables preemption as part of its processing
2369 for_each_online_cpu(cpu) {
2370 struct per_cpu_pageset *pcp;
2372 bool has_pcps = false;
2375 pcp = per_cpu_ptr(zone->pageset, cpu);
2379 for_each_populated_zone(z) {
2380 pcp = per_cpu_ptr(z->pageset, cpu);
2381 if (pcp->pcp.count) {
2389 cpumask_set_cpu(cpu, &cpus_with_pcps);
2391 cpumask_clear_cpu(cpu, &cpus_with_pcps);
2393 on_each_cpu_mask(&cpus_with_pcps, (smp_call_func_t) drain_local_pages,
2397 #ifdef CONFIG_HIBERNATION
2399 void mark_free_pages(struct zone *zone)
2401 unsigned long pfn, max_zone_pfn;
2402 unsigned long flags;
2403 unsigned int order, t;
2406 if (zone_is_empty(zone))
2409 spin_lock_irqsave(&zone->lock, flags);
2411 max_zone_pfn = zone_end_pfn(zone);
2412 for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
2413 if (pfn_valid(pfn)) {
2414 page = pfn_to_page(pfn);
2416 if (page_zone(page) != zone)
2419 if (!swsusp_page_is_forbidden(page))
2420 swsusp_unset_page_free(page);
2423 for_each_migratetype_order(order, t) {
2424 list_for_each_entry(page,
2425 &zone->free_area[order].free_list[t], lru) {
2428 pfn = page_to_pfn(page);
2429 for (i = 0; i < (1UL << order); i++)
2430 swsusp_set_page_free(pfn_to_page(pfn + i));
2433 spin_unlock_irqrestore(&zone->lock, flags);
2435 #endif /* CONFIG_PM */
2438 * Free a 0-order page
2439 * cold == true ? free a cold page : free a hot page
2441 void free_hot_cold_page(struct page *page, bool cold)
2443 struct zone *zone = page_zone(page);
2444 struct per_cpu_pages *pcp;
2445 unsigned long flags;
2446 unsigned long pfn = page_to_pfn(page);
2449 if (!free_pcp_prepare(page))
2452 migratetype = get_pfnblock_migratetype(page, pfn);
2453 set_pcppage_migratetype(page, migratetype);
2454 local_irq_save(flags);
2455 __count_vm_event(PGFREE);
2458 * We only track unmovable, reclaimable and movable on pcp lists.
2459 * Free ISOLATE pages back to the allocator because they are being
2460 * offlined but treat RESERVE as movable pages so we can get those
2461 * areas back if necessary. Otherwise, we may have to free
2462 * excessively into the page allocator
2464 if (migratetype >= MIGRATE_PCPTYPES) {
2465 if (unlikely(is_migrate_isolate(migratetype))) {
2466 free_one_page(zone, page, pfn, 0, migratetype);
2469 migratetype = MIGRATE_MOVABLE;
2472 pcp = &this_cpu_ptr(zone->pageset)->pcp;
2474 list_add(&page->lru, &pcp->lists[migratetype]);
2476 list_add_tail(&page->lru, &pcp->lists[migratetype]);
2478 if (pcp->count >= pcp->high) {
2479 unsigned long batch = READ_ONCE(pcp->batch);
2480 free_pcppages_bulk(zone, batch, pcp);
2481 pcp->count -= batch;
2485 local_irq_restore(flags);
2489 * Free a list of 0-order pages
2491 void free_hot_cold_page_list(struct list_head *list, bool cold)
2493 struct page *page, *next;
2495 list_for_each_entry_safe(page, next, list, lru) {
2496 trace_mm_page_free_batched(page, cold);
2497 free_hot_cold_page(page, cold);
2502 * split_page takes a non-compound higher-order page, and splits it into
2503 * n (1<<order) sub-pages: page[0..n]
2504 * Each sub-page must be freed individually.
2506 * Note: this is probably too low level an operation for use in drivers.
2507 * Please consult with lkml before using this in your driver.
2509 void split_page(struct page *page, unsigned int order)
2513 VM_BUG_ON_PAGE(PageCompound(page), page);
2514 VM_BUG_ON_PAGE(!page_count(page), page);
2516 #ifdef CONFIG_KMEMCHECK
2518 * Split shadow pages too, because free(page[0]) would
2519 * otherwise free the whole shadow.
2521 if (kmemcheck_page_is_tracked(page))
2522 split_page(virt_to_page(page[0].shadow), order);
2525 for (i = 1; i < (1 << order); i++)
2526 set_page_refcounted(page + i);
2527 split_page_owner(page, order);
2529 EXPORT_SYMBOL_GPL(split_page);
2531 int __isolate_free_page(struct page *page, unsigned int order)
2533 unsigned long watermark;
2537 BUG_ON(!PageBuddy(page));
2539 zone = page_zone(page);
2540 mt = get_pageblock_migratetype(page);
2542 if (!is_migrate_isolate(mt)) {
2544 * Obey watermarks as if the page was being allocated. We can
2545 * emulate a high-order watermark check with a raised order-0
2546 * watermark, because we already know our high-order page
2549 watermark = min_wmark_pages(zone) + (1UL << order);
2550 if (!zone_watermark_ok(zone, 0, watermark, 0, ALLOC_CMA))
2553 __mod_zone_freepage_state(zone, -(1UL << order), mt);
2556 /* Remove page from free list */
2557 list_del(&page->lru);
2558 zone->free_area[order].nr_free--;
2559 rmv_page_order(page);
2562 * Set the pageblock if the isolated page is at least half of a
2565 if (order >= pageblock_order - 1) {
2566 struct page *endpage = page + (1 << order) - 1;
2567 for (; page < endpage; page += pageblock_nr_pages) {
2568 int mt = get_pageblock_migratetype(page);
2569 if (!is_migrate_isolate(mt) && !is_migrate_cma(mt)
2570 && mt != MIGRATE_HIGHATOMIC)
2571 set_pageblock_migratetype(page,
2577 return 1UL << order;
2581 * Update NUMA hit/miss statistics
2583 * Must be called with interrupts disabled.
2585 static inline void zone_statistics(struct zone *preferred_zone, struct zone *z)
2588 enum zone_stat_item local_stat = NUMA_LOCAL;
2590 if (z->node != numa_node_id())
2591 local_stat = NUMA_OTHER;
2593 if (z->node == preferred_zone->node)
2594 __inc_zone_state(z, NUMA_HIT);
2596 __inc_zone_state(z, NUMA_MISS);
2597 __inc_zone_state(preferred_zone, NUMA_FOREIGN);
2599 __inc_zone_state(z, local_stat);
2604 * Allocate a page from the given zone. Use pcplists for order-0 allocations.
2607 struct page *buffered_rmqueue(struct zone *preferred_zone,
2608 struct zone *zone, unsigned int order,
2609 gfp_t gfp_flags, unsigned int alloc_flags,
2612 unsigned long flags;
2614 bool cold = ((gfp_flags & __GFP_COLD) != 0);
2616 if (likely(order == 0)) {
2617 struct per_cpu_pages *pcp;
2618 struct list_head *list;
2620 local_irq_save(flags);
2622 pcp = &this_cpu_ptr(zone->pageset)->pcp;
2623 list = &pcp->lists[migratetype];
2624 if (list_empty(list)) {
2625 pcp->count += rmqueue_bulk(zone, 0,
2628 if (unlikely(list_empty(list)))
2633 page = list_last_entry(list, struct page, lru);
2635 page = list_first_entry(list, struct page, lru);
2637 list_del(&page->lru);
2640 } while (check_new_pcp(page));
2643 * We most definitely don't want callers attempting to
2644 * allocate greater than order-1 page units with __GFP_NOFAIL.
2646 WARN_ON_ONCE((gfp_flags & __GFP_NOFAIL) && (order > 1));
2647 spin_lock_irqsave(&zone->lock, flags);
2651 if (alloc_flags & ALLOC_HARDER) {
2652 page = __rmqueue_smallest(zone, order, MIGRATE_HIGHATOMIC);
2654 trace_mm_page_alloc_zone_locked(page, order, migratetype);
2657 page = __rmqueue(zone, order, migratetype);
2658 } while (page && check_new_pages(page, order));
2659 spin_unlock(&zone->lock);
2662 __mod_zone_freepage_state(zone, -(1 << order),
2663 get_pcppage_migratetype(page));
2666 __count_zid_vm_events(PGALLOC, page_zonenum(page), 1 << order);
2667 zone_statistics(preferred_zone, zone);
2668 local_irq_restore(flags);
2670 VM_BUG_ON_PAGE(bad_range(zone, page), page);
2674 local_irq_restore(flags);
2678 #ifdef CONFIG_FAIL_PAGE_ALLOC
2681 struct fault_attr attr;
2683 bool ignore_gfp_highmem;
2684 bool ignore_gfp_reclaim;
2686 } fail_page_alloc = {
2687 .attr = FAULT_ATTR_INITIALIZER,
2688 .ignore_gfp_reclaim = true,
2689 .ignore_gfp_highmem = true,
2693 static int __init setup_fail_page_alloc(char *str)
2695 return setup_fault_attr(&fail_page_alloc.attr, str);
2697 __setup("fail_page_alloc=", setup_fail_page_alloc);
2699 static bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
2701 if (order < fail_page_alloc.min_order)
2703 if (gfp_mask & __GFP_NOFAIL)
2705 if (fail_page_alloc.ignore_gfp_highmem && (gfp_mask & __GFP_HIGHMEM))
2707 if (fail_page_alloc.ignore_gfp_reclaim &&
2708 (gfp_mask & __GFP_DIRECT_RECLAIM))
2711 return should_fail(&fail_page_alloc.attr, 1 << order);
2714 #ifdef CONFIG_FAULT_INJECTION_DEBUG_FS
2716 static int __init fail_page_alloc_debugfs(void)
2718 umode_t mode = S_IFREG | S_IRUSR | S_IWUSR;
2721 dir = fault_create_debugfs_attr("fail_page_alloc", NULL,
2722 &fail_page_alloc.attr);
2724 return PTR_ERR(dir);
2726 if (!debugfs_create_bool("ignore-gfp-wait", mode, dir,
2727 &fail_page_alloc.ignore_gfp_reclaim))
2729 if (!debugfs_create_bool("ignore-gfp-highmem", mode, dir,
2730 &fail_page_alloc.ignore_gfp_highmem))
2732 if (!debugfs_create_u32("min-order", mode, dir,
2733 &fail_page_alloc.min_order))
2738 debugfs_remove_recursive(dir);
2743 late_initcall(fail_page_alloc_debugfs);
2745 #endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */
2747 #else /* CONFIG_FAIL_PAGE_ALLOC */
2749 static inline bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
2754 #endif /* CONFIG_FAIL_PAGE_ALLOC */
2757 * Return true if free base pages are above 'mark'. For high-order checks it
2758 * will return true of the order-0 watermark is reached and there is at least
2759 * one free page of a suitable size. Checking now avoids taking the zone lock
2760 * to check in the allocation paths if no pages are free.
2762 bool __zone_watermark_ok(struct zone *z, unsigned int order, unsigned long mark,
2763 int classzone_idx, unsigned int alloc_flags,
2768 const bool alloc_harder = (alloc_flags & ALLOC_HARDER);
2770 /* free_pages may go negative - that's OK */
2771 free_pages -= (1 << order) - 1;
2773 if (alloc_flags & ALLOC_HIGH)
2777 * If the caller does not have rights to ALLOC_HARDER then subtract
2778 * the high-atomic reserves. This will over-estimate the size of the
2779 * atomic reserve but it avoids a search.
2781 if (likely(!alloc_harder))
2782 free_pages -= z->nr_reserved_highatomic;
2787 /* If allocation can't use CMA areas don't use free CMA pages */
2788 if (!(alloc_flags & ALLOC_CMA))
2789 free_pages -= zone_page_state(z, NR_FREE_CMA_PAGES);
2793 * Check watermarks for an order-0 allocation request. If these
2794 * are not met, then a high-order request also cannot go ahead
2795 * even if a suitable page happened to be free.
2797 if (free_pages <= min + z->lowmem_reserve[classzone_idx])
2800 /* If this is an order-0 request then the watermark is fine */
2804 /* For a high-order request, check at least one suitable page is free */
2805 for (o = order; o < MAX_ORDER; o++) {
2806 struct free_area *area = &z->free_area[o];
2815 for (mt = 0; mt < MIGRATE_PCPTYPES; mt++) {
2816 if (!list_empty(&area->free_list[mt]))
2821 if ((alloc_flags & ALLOC_CMA) &&
2822 !list_empty(&area->free_list[MIGRATE_CMA])) {
2830 bool zone_watermark_ok(struct zone *z, unsigned int order, unsigned long mark,
2831 int classzone_idx, unsigned int alloc_flags)
2833 return __zone_watermark_ok(z, order, mark, classzone_idx, alloc_flags,
2834 zone_page_state(z, NR_FREE_PAGES));
2837 static inline bool zone_watermark_fast(struct zone *z, unsigned int order,
2838 unsigned long mark, int classzone_idx, unsigned int alloc_flags)
2840 long free_pages = zone_page_state(z, NR_FREE_PAGES);
2844 /* If allocation can't use CMA areas don't use free CMA pages */
2845 if (!(alloc_flags & ALLOC_CMA))
2846 cma_pages = zone_page_state(z, NR_FREE_CMA_PAGES);
2850 * Fast check for order-0 only. If this fails then the reserves
2851 * need to be calculated. There is a corner case where the check
2852 * passes but only the high-order atomic reserve are free. If
2853 * the caller is !atomic then it'll uselessly search the free
2854 * list. That corner case is then slower but it is harmless.
2856 if (!order && (free_pages - cma_pages) > mark + z->lowmem_reserve[classzone_idx])
2859 return __zone_watermark_ok(z, order, mark, classzone_idx, alloc_flags,
2863 bool zone_watermark_ok_safe(struct zone *z, unsigned int order,
2864 unsigned long mark, int classzone_idx)
2866 long free_pages = zone_page_state(z, NR_FREE_PAGES);
2868 if (z->percpu_drift_mark && free_pages < z->percpu_drift_mark)
2869 free_pages = zone_page_state_snapshot(z, NR_FREE_PAGES);
2871 return __zone_watermark_ok(z, order, mark, classzone_idx, 0,
2876 static bool zone_allows_reclaim(struct zone *local_zone, struct zone *zone)
2878 return node_distance(zone_to_nid(local_zone), zone_to_nid(zone)) <
2881 #else /* CONFIG_NUMA */
2882 static bool zone_allows_reclaim(struct zone *local_zone, struct zone *zone)
2886 #endif /* CONFIG_NUMA */
2889 * get_page_from_freelist goes through the zonelist trying to allocate
2892 static struct page *
2893 get_page_from_freelist(gfp_t gfp_mask, unsigned int order, int alloc_flags,
2894 const struct alloc_context *ac)
2896 struct zoneref *z = ac->preferred_zoneref;
2898 struct pglist_data *last_pgdat_dirty_limit = NULL;
2901 * Scan zonelist, looking for a zone with enough free.
2902 * See also __cpuset_node_allowed() comment in kernel/cpuset.c.
2904 for_next_zone_zonelist_nodemask(zone, z, ac->zonelist, ac->high_zoneidx,
2909 if (cpusets_enabled() &&
2910 (alloc_flags & ALLOC_CPUSET) &&
2911 !__cpuset_zone_allowed(zone, gfp_mask))
2914 * When allocating a page cache page for writing, we
2915 * want to get it from a node that is within its dirty
2916 * limit, such that no single node holds more than its
2917 * proportional share of globally allowed dirty pages.
2918 * The dirty limits take into account the node's
2919 * lowmem reserves and high watermark so that kswapd
2920 * should be able to balance it without having to
2921 * write pages from its LRU list.
2923 * XXX: For now, allow allocations to potentially
2924 * exceed the per-node dirty limit in the slowpath
2925 * (spread_dirty_pages unset) before going into reclaim,
2926 * which is important when on a NUMA setup the allowed
2927 * nodes are together not big enough to reach the
2928 * global limit. The proper fix for these situations
2929 * will require awareness of nodes in the
2930 * dirty-throttling and the flusher threads.
2932 if (ac->spread_dirty_pages) {
2933 if (last_pgdat_dirty_limit == zone->zone_pgdat)
2936 if (!node_dirty_ok(zone->zone_pgdat)) {
2937 last_pgdat_dirty_limit = zone->zone_pgdat;
2942 mark = zone->watermark[alloc_flags & ALLOC_WMARK_MASK];
2943 if (!zone_watermark_fast(zone, order, mark,
2944 ac_classzone_idx(ac), alloc_flags)) {
2947 /* Checked here to keep the fast path fast */
2948 BUILD_BUG_ON(ALLOC_NO_WATERMARKS < NR_WMARK);
2949 if (alloc_flags & ALLOC_NO_WATERMARKS)
2952 if (node_reclaim_mode == 0 ||
2953 !zone_allows_reclaim(ac->preferred_zoneref->zone, zone))
2956 ret = node_reclaim(zone->zone_pgdat, gfp_mask, order);
2958 case NODE_RECLAIM_NOSCAN:
2961 case NODE_RECLAIM_FULL:
2962 /* scanned but unreclaimable */
2965 /* did we reclaim enough */
2966 if (zone_watermark_ok(zone, order, mark,
2967 ac_classzone_idx(ac), alloc_flags))
2975 page = buffered_rmqueue(ac->preferred_zoneref->zone, zone, order,
2976 gfp_mask, alloc_flags, ac->migratetype);
2978 prep_new_page(page, order, gfp_mask, alloc_flags);
2981 * If this is a high-order atomic allocation then check
2982 * if the pageblock should be reserved for the future
2984 if (unlikely(order && (alloc_flags & ALLOC_HARDER)))
2985 reserve_highatomic_pageblock(page, zone, order);
2995 * Large machines with many possible nodes should not always dump per-node
2996 * meminfo in irq context.
2998 static inline bool should_suppress_show_mem(void)
3003 ret = in_interrupt();
3008 static void warn_alloc_show_mem(gfp_t gfp_mask, nodemask_t *nodemask)
3010 unsigned int filter = SHOW_MEM_FILTER_NODES;
3011 static DEFINE_RATELIMIT_STATE(show_mem_rs, HZ, 1);
3013 if (should_suppress_show_mem() || !__ratelimit(&show_mem_rs))
3017 * This documents exceptions given to allocations in certain
3018 * contexts that are allowed to allocate outside current's set
3021 if (!(gfp_mask & __GFP_NOMEMALLOC))
3022 if (test_thread_flag(TIF_MEMDIE) ||
3023 (current->flags & (PF_MEMALLOC | PF_EXITING)))
3024 filter &= ~SHOW_MEM_FILTER_NODES;
3025 if (in_interrupt() || !(gfp_mask & __GFP_DIRECT_RECLAIM))
3026 filter &= ~SHOW_MEM_FILTER_NODES;
3028 show_mem(filter, nodemask);
3031 void warn_alloc(gfp_t gfp_mask, nodemask_t *nodemask, const char *fmt, ...)
3033 struct va_format vaf;
3035 static DEFINE_RATELIMIT_STATE(nopage_rs, DEFAULT_RATELIMIT_INTERVAL,
3036 DEFAULT_RATELIMIT_BURST);
3037 nodemask_t *nm = (nodemask) ? nodemask : &cpuset_current_mems_allowed;
3039 if ((gfp_mask & __GFP_NOWARN) || !__ratelimit(&nopage_rs) ||
3040 debug_guardpage_minorder() > 0)
3043 pr_warn("%s: ", current->comm);
3045 va_start(args, fmt);
3048 pr_cont("%pV", &vaf);
3051 pr_cont(", mode:%#x(%pGg), nodemask=%*pbl\n", gfp_mask, &gfp_mask, nodemask_pr_args(nm));
3052 cpuset_print_current_mems_allowed();
3055 warn_alloc_show_mem(gfp_mask, nm);
3058 static inline struct page *
3059 __alloc_pages_may_oom(gfp_t gfp_mask, unsigned int order,
3060 const struct alloc_context *ac, unsigned long *did_some_progress)
3062 struct oom_control oc = {
3063 .zonelist = ac->zonelist,
3064 .nodemask = ac->nodemask,
3066 .gfp_mask = gfp_mask,
3071 *did_some_progress = 0;
3074 * Acquire the oom lock. If that fails, somebody else is
3075 * making progress for us.
3077 if (!mutex_trylock(&oom_lock)) {
3078 *did_some_progress = 1;
3079 schedule_timeout_uninterruptible(1);
3084 * Go through the zonelist yet one more time, keep very high watermark
3085 * here, this is only to catch a parallel oom killing, we must fail if
3086 * we're still under heavy pressure.
3088 page = get_page_from_freelist(gfp_mask | __GFP_HARDWALL, order,
3089 ALLOC_WMARK_HIGH|ALLOC_CPUSET, ac);
3093 if (!(gfp_mask & __GFP_NOFAIL)) {
3094 /* Coredumps can quickly deplete all memory reserves */
3095 if (current->flags & PF_DUMPCORE)
3097 /* The OOM killer will not help higher order allocs */
3098 if (order > PAGE_ALLOC_COSTLY_ORDER)
3100 /* The OOM killer does not needlessly kill tasks for lowmem */
3101 if (ac->high_zoneidx < ZONE_NORMAL)
3103 if (pm_suspended_storage())
3106 * XXX: GFP_NOFS allocations should rather fail than rely on
3107 * other request to make a forward progress.
3108 * We are in an unfortunate situation where out_of_memory cannot
3109 * do much for this context but let's try it to at least get
3110 * access to memory reserved if the current task is killed (see
3111 * out_of_memory). Once filesystems are ready to handle allocation
3112 * failures more gracefully we should just bail out here.
3115 /* The OOM killer may not free memory on a specific node */
3116 if (gfp_mask & __GFP_THISNODE)
3119 /* Exhausted what can be done so it's blamo time */
3120 if (out_of_memory(&oc) || WARN_ON_ONCE(gfp_mask & __GFP_NOFAIL)) {
3121 *did_some_progress = 1;
3123 if (gfp_mask & __GFP_NOFAIL) {
3124 page = get_page_from_freelist(gfp_mask, order,
3125 ALLOC_NO_WATERMARKS|ALLOC_CPUSET, ac);
3127 * fallback to ignore cpuset restriction if our nodes
3131 page = get_page_from_freelist(gfp_mask, order,
3132 ALLOC_NO_WATERMARKS, ac);
3136 mutex_unlock(&oom_lock);
3141 * Maximum number of compaction retries wit a progress before OOM
3142 * killer is consider as the only way to move forward.
3144 #define MAX_COMPACT_RETRIES 16
3146 #ifdef CONFIG_COMPACTION
3147 /* Try memory compaction for high-order allocations before reclaim */
3148 static struct page *
3149 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
3150 unsigned int alloc_flags, const struct alloc_context *ac,
3151 enum compact_priority prio, enum compact_result *compact_result)
3158 current->flags |= PF_MEMALLOC;
3159 *compact_result = try_to_compact_pages(gfp_mask, order, alloc_flags, ac,
3161 current->flags &= ~PF_MEMALLOC;
3163 if (*compact_result <= COMPACT_INACTIVE)
3167 * At least in one zone compaction wasn't deferred or skipped, so let's
3168 * count a compaction stall
3170 count_vm_event(COMPACTSTALL);
3172 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac);
3175 struct zone *zone = page_zone(page);
3177 zone->compact_blockskip_flush = false;
3178 compaction_defer_reset(zone, order, true);
3179 count_vm_event(COMPACTSUCCESS);
3184 * It's bad if compaction run occurs and fails. The most likely reason
3185 * is that pages exist, but not enough to satisfy watermarks.
3187 count_vm_event(COMPACTFAIL);
3195 should_compact_retry(struct alloc_context *ac, int order, int alloc_flags,
3196 enum compact_result compact_result,
3197 enum compact_priority *compact_priority,
3198 int *compaction_retries)
3200 int max_retries = MAX_COMPACT_RETRIES;
3203 int retries = *compaction_retries;
3204 enum compact_priority priority = *compact_priority;
3209 if (compaction_made_progress(compact_result))
3210 (*compaction_retries)++;
3213 * compaction considers all the zone as desperately out of memory
3214 * so it doesn't really make much sense to retry except when the
3215 * failure could be caused by insufficient priority
3217 if (compaction_failed(compact_result))
3218 goto check_priority;
3221 * make sure the compaction wasn't deferred or didn't bail out early
3222 * due to locks contention before we declare that we should give up.
3223 * But do not retry if the given zonelist is not suitable for
3226 if (compaction_withdrawn(compact_result)) {
3227 ret = compaction_zonelist_suitable(ac, order, alloc_flags);
3232 * !costly requests are much more important than __GFP_REPEAT
3233 * costly ones because they are de facto nofail and invoke OOM
3234 * killer to move on while costly can fail and users are ready
3235 * to cope with that. 1/4 retries is rather arbitrary but we
3236 * would need much more detailed feedback from compaction to
3237 * make a better decision.
3239 if (order > PAGE_ALLOC_COSTLY_ORDER)
3241 if (*compaction_retries <= max_retries) {
3247 * Make sure there are attempts at the highest priority if we exhausted
3248 * all retries or failed at the lower priorities.
3251 min_priority = (order > PAGE_ALLOC_COSTLY_ORDER) ?
3252 MIN_COMPACT_COSTLY_PRIORITY : MIN_COMPACT_PRIORITY;
3254 if (*compact_priority > min_priority) {
3255 (*compact_priority)--;
3256 *compaction_retries = 0;
3260 trace_compact_retry(order, priority, compact_result, retries, max_retries, ret);
3264 static inline struct page *
3265 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
3266 unsigned int alloc_flags, const struct alloc_context *ac,
3267 enum compact_priority prio, enum compact_result *compact_result)
3269 *compact_result = COMPACT_SKIPPED;
3274 should_compact_retry(struct alloc_context *ac, unsigned int order, int alloc_flags,
3275 enum compact_result compact_result,
3276 enum compact_priority *compact_priority,
3277 int *compaction_retries)
3282 if (!order || order > PAGE_ALLOC_COSTLY_ORDER)
3286 * There are setups with compaction disabled which would prefer to loop
3287 * inside the allocator rather than hit the oom killer prematurely.
3288 * Let's give them a good hope and keep retrying while the order-0
3289 * watermarks are OK.
3291 for_each_zone_zonelist_nodemask(zone, z, ac->zonelist, ac->high_zoneidx,
3293 if (zone_watermark_ok(zone, 0, min_wmark_pages(zone),
3294 ac_classzone_idx(ac), alloc_flags))
3299 #endif /* CONFIG_COMPACTION */
3301 /* Perform direct synchronous page reclaim */
3303 __perform_reclaim(gfp_t gfp_mask, unsigned int order,
3304 const struct alloc_context *ac)
3306 struct reclaim_state reclaim_state;
3311 /* We now go into synchronous reclaim */
3312 cpuset_memory_pressure_bump();
3313 current->flags |= PF_MEMALLOC;
3314 lockdep_set_current_reclaim_state(gfp_mask);
3315 reclaim_state.reclaimed_slab = 0;
3316 current->reclaim_state = &reclaim_state;
3318 progress = try_to_free_pages(ac->zonelist, order, gfp_mask,
3321 current->reclaim_state = NULL;
3322 lockdep_clear_current_reclaim_state();
3323 current->flags &= ~PF_MEMALLOC;
3330 /* The really slow allocator path where we enter direct reclaim */
3331 static inline struct page *
3332 __alloc_pages_direct_reclaim(gfp_t gfp_mask, unsigned int order,
3333 unsigned int alloc_flags, const struct alloc_context *ac,
3334 unsigned long *did_some_progress)
3336 struct page *page = NULL;
3337 bool drained = false;
3339 *did_some_progress = __perform_reclaim(gfp_mask, order, ac);
3340 if (unlikely(!(*did_some_progress)))
3344 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac);
3347 * If an allocation failed after direct reclaim, it could be because
3348 * pages are pinned on the per-cpu lists or in high alloc reserves.
3349 * Shrink them them and try again
3351 if (!page && !drained) {
3352 unreserve_highatomic_pageblock(ac, false);
3353 drain_all_pages(NULL);
3361 static void wake_all_kswapds(unsigned int order, const struct alloc_context *ac)
3365 pg_data_t *last_pgdat = NULL;
3367 for_each_zone_zonelist_nodemask(zone, z, ac->zonelist,
3368 ac->high_zoneidx, ac->nodemask) {
3369 if (last_pgdat != zone->zone_pgdat)
3370 wakeup_kswapd(zone, order, ac->high_zoneidx);
3371 last_pgdat = zone->zone_pgdat;
3375 static inline unsigned int
3376 gfp_to_alloc_flags(gfp_t gfp_mask)
3378 unsigned int alloc_flags = ALLOC_WMARK_MIN | ALLOC_CPUSET;
3380 /* __GFP_HIGH is assumed to be the same as ALLOC_HIGH to save a branch. */
3381 BUILD_BUG_ON(__GFP_HIGH != (__force gfp_t) ALLOC_HIGH);
3384 * The caller may dip into page reserves a bit more if the caller
3385 * cannot run direct reclaim, or if the caller has realtime scheduling
3386 * policy or is asking for __GFP_HIGH memory. GFP_ATOMIC requests will
3387 * set both ALLOC_HARDER (__GFP_ATOMIC) and ALLOC_HIGH (__GFP_HIGH).
3389 alloc_flags |= (__force int) (gfp_mask & __GFP_HIGH);
3391 if (gfp_mask & __GFP_ATOMIC) {
3393 * Not worth trying to allocate harder for __GFP_NOMEMALLOC even
3394 * if it can't schedule.
3396 if (!(gfp_mask & __GFP_NOMEMALLOC))
3397 alloc_flags |= ALLOC_HARDER;
3399 * Ignore cpuset mems for GFP_ATOMIC rather than fail, see the
3400 * comment for __cpuset_node_allowed().
3402 alloc_flags &= ~ALLOC_CPUSET;
3403 } else if (unlikely(rt_task(current)) && !in_interrupt())
3404 alloc_flags |= ALLOC_HARDER;
3407 if (gfpflags_to_migratetype(gfp_mask) == MIGRATE_MOVABLE)
3408 alloc_flags |= ALLOC_CMA;
3413 bool gfp_pfmemalloc_allowed(gfp_t gfp_mask)
3415 if (unlikely(gfp_mask & __GFP_NOMEMALLOC))
3418 if (gfp_mask & __GFP_MEMALLOC)
3420 if (in_serving_softirq() && (current->flags & PF_MEMALLOC))
3422 if (!in_interrupt() &&
3423 ((current->flags & PF_MEMALLOC) ||
3424 unlikely(test_thread_flag(TIF_MEMDIE))))
3431 * Maximum number of reclaim retries without any progress before OOM killer
3432 * is consider as the only way to move forward.
3434 #define MAX_RECLAIM_RETRIES 16
3437 * Checks whether it makes sense to retry the reclaim to make a forward progress
3438 * for the given allocation request.
3439 * The reclaim feedback represented by did_some_progress (any progress during
3440 * the last reclaim round) and no_progress_loops (number of reclaim rounds without
3441 * any progress in a row) is considered as well as the reclaimable pages on the
3442 * applicable zone list (with a backoff mechanism which is a function of
3443 * no_progress_loops).
3445 * Returns true if a retry is viable or false to enter the oom path.
3448 should_reclaim_retry(gfp_t gfp_mask, unsigned order,
3449 struct alloc_context *ac, int alloc_flags,
3450 bool did_some_progress, int *no_progress_loops)
3456 * Costly allocations might have made a progress but this doesn't mean
3457 * their order will become available due to high fragmentation so
3458 * always increment the no progress counter for them
3460 if (did_some_progress && order <= PAGE_ALLOC_COSTLY_ORDER)
3461 *no_progress_loops = 0;
3463 (*no_progress_loops)++;
3466 * Make sure we converge to OOM if we cannot make any progress
3467 * several times in the row.
3469 if (*no_progress_loops > MAX_RECLAIM_RETRIES) {
3470 /* Before OOM, exhaust highatomic_reserve */
3471 return unreserve_highatomic_pageblock(ac, true);
3475 * Keep reclaiming pages while there is a chance this will lead
3476 * somewhere. If none of the target zones can satisfy our allocation
3477 * request even if all reclaimable pages are considered then we are
3478 * screwed and have to go OOM.
3480 for_each_zone_zonelist_nodemask(zone, z, ac->zonelist, ac->high_zoneidx,
3482 unsigned long available;
3483 unsigned long reclaimable;
3484 unsigned long min_wmark = min_wmark_pages(zone);
3487 available = reclaimable = zone_reclaimable_pages(zone);
3488 available -= DIV_ROUND_UP((*no_progress_loops) * available,
3489 MAX_RECLAIM_RETRIES);
3490 available += zone_page_state_snapshot(zone, NR_FREE_PAGES);
3493 * Would the allocation succeed if we reclaimed the whole
3496 wmark = __zone_watermark_ok(zone, order, min_wmark,
3497 ac_classzone_idx(ac), alloc_flags, available);
3498 trace_reclaim_retry_zone(z, order, reclaimable,
3499 available, min_wmark, *no_progress_loops, wmark);
3502 * If we didn't make any progress and have a lot of
3503 * dirty + writeback pages then we should wait for
3504 * an IO to complete to slow down the reclaim and
3505 * prevent from pre mature OOM
3507 if (!did_some_progress) {
3508 unsigned long write_pending;
3510 write_pending = zone_page_state_snapshot(zone,
3511 NR_ZONE_WRITE_PENDING);
3513 if (2 * write_pending > reclaimable) {
3514 congestion_wait(BLK_RW_ASYNC, HZ/10);
3520 * Memory allocation/reclaim might be called from a WQ
3521 * context and the current implementation of the WQ
3522 * concurrency control doesn't recognize that
3523 * a particular WQ is congested if the worker thread is
3524 * looping without ever sleeping. Therefore we have to
3525 * do a short sleep here rather than calling
3528 if (current->flags & PF_WQ_WORKER)
3529 schedule_timeout_uninterruptible(1);
3540 static inline struct page *
3541 __alloc_pages_slowpath(gfp_t gfp_mask, unsigned int order,
3542 struct alloc_context *ac)
3544 bool can_direct_reclaim = gfp_mask & __GFP_DIRECT_RECLAIM;
3545 struct page *page = NULL;
3546 unsigned int alloc_flags;
3547 unsigned long did_some_progress;
3548 enum compact_priority compact_priority;
3549 enum compact_result compact_result;
3550 int compaction_retries;
3551 int no_progress_loops;
3552 unsigned long alloc_start = jiffies;
3553 unsigned int stall_timeout = 10 * HZ;
3554 unsigned int cpuset_mems_cookie;
3557 * In the slowpath, we sanity check order to avoid ever trying to
3558 * reclaim >= MAX_ORDER areas which will never succeed. Callers may
3559 * be using allocators in order of preference for an area that is
3562 if (order >= MAX_ORDER) {
3563 WARN_ON_ONCE(!(gfp_mask & __GFP_NOWARN));
3568 * We also sanity check to catch abuse of atomic reserves being used by
3569 * callers that are not in atomic context.
3571 if (WARN_ON_ONCE((gfp_mask & (__GFP_ATOMIC|__GFP_DIRECT_RECLAIM)) ==
3572 (__GFP_ATOMIC|__GFP_DIRECT_RECLAIM)))
3573 gfp_mask &= ~__GFP_ATOMIC;
3576 compaction_retries = 0;
3577 no_progress_loops = 0;
3578 compact_priority = DEF_COMPACT_PRIORITY;
3579 cpuset_mems_cookie = read_mems_allowed_begin();
3581 * We need to recalculate the starting point for the zonelist iterator
3582 * because we might have used different nodemask in the fast path, or
3583 * there was a cpuset modification and we are retrying - otherwise we
3584 * could end up iterating over non-eligible zones endlessly.
3586 ac->preferred_zoneref = first_zones_zonelist(ac->zonelist,
3587 ac->high_zoneidx, ac->nodemask);
3588 if (!ac->preferred_zoneref->zone)
3593 * The fast path uses conservative alloc_flags to succeed only until
3594 * kswapd needs to be woken up, and to avoid the cost of setting up
3595 * alloc_flags precisely. So we do that now.
3597 alloc_flags = gfp_to_alloc_flags(gfp_mask);
3599 if (gfp_mask & __GFP_KSWAPD_RECLAIM)
3600 wake_all_kswapds(order, ac);
3603 * The adjusted alloc_flags might result in immediate success, so try
3606 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac);
3611 * For costly allocations, try direct compaction first, as it's likely
3612 * that we have enough base pages and don't need to reclaim. Don't try
3613 * that for allocations that are allowed to ignore watermarks, as the
3614 * ALLOC_NO_WATERMARKS attempt didn't yet happen.
3616 if (can_direct_reclaim && order > PAGE_ALLOC_COSTLY_ORDER &&
3617 !gfp_pfmemalloc_allowed(gfp_mask)) {
3618 page = __alloc_pages_direct_compact(gfp_mask, order,
3620 INIT_COMPACT_PRIORITY,
3626 * Checks for costly allocations with __GFP_NORETRY, which
3627 * includes THP page fault allocations
3629 if (gfp_mask & __GFP_NORETRY) {
3631 * If compaction is deferred for high-order allocations,
3632 * it is because sync compaction recently failed. If
3633 * this is the case and the caller requested a THP
3634 * allocation, we do not want to heavily disrupt the
3635 * system, so we fail the allocation instead of entering
3638 if (compact_result == COMPACT_DEFERRED)
3642 * Looks like reclaim/compaction is worth trying, but
3643 * sync compaction could be very expensive, so keep
3644 * using async compaction.
3646 compact_priority = INIT_COMPACT_PRIORITY;
3651 /* Ensure kswapd doesn't accidentally go to sleep as long as we loop */
3652 if (gfp_mask & __GFP_KSWAPD_RECLAIM)
3653 wake_all_kswapds(order, ac);
3655 if (gfp_pfmemalloc_allowed(gfp_mask))
3656 alloc_flags = ALLOC_NO_WATERMARKS;
3659 * Reset the zonelist iterators if memory policies can be ignored.
3660 * These allocations are high priority and system rather than user
3663 if (!(alloc_flags & ALLOC_CPUSET) || (alloc_flags & ALLOC_NO_WATERMARKS)) {
3664 ac->zonelist = node_zonelist(numa_node_id(), gfp_mask);
3665 ac->preferred_zoneref = first_zones_zonelist(ac->zonelist,
3666 ac->high_zoneidx, ac->nodemask);
3669 /* Attempt with potentially adjusted zonelist and alloc_flags */
3670 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac);
3674 /* Caller is not willing to reclaim, we can't balance anything */
3675 if (!can_direct_reclaim) {
3677 * All existing users of the __GFP_NOFAIL are blockable, so warn
3678 * of any new users that actually allow this type of allocation
3681 WARN_ON_ONCE(gfp_mask & __GFP_NOFAIL);
3685 /* Avoid recursion of direct reclaim */
3686 if (current->flags & PF_MEMALLOC) {
3688 * __GFP_NOFAIL request from this context is rather bizarre
3689 * because we cannot reclaim anything and only can loop waiting
3690 * for somebody to do a work for us.
3692 if (WARN_ON_ONCE(gfp_mask & __GFP_NOFAIL)) {
3699 /* Avoid allocations with no watermarks from looping endlessly */
3700 if (test_thread_flag(TIF_MEMDIE) && !(gfp_mask & __GFP_NOFAIL))
3704 /* Try direct reclaim and then allocating */
3705 page = __alloc_pages_direct_reclaim(gfp_mask, order, alloc_flags, ac,
3706 &did_some_progress);
3710 /* Try direct compaction and then allocating */
3711 page = __alloc_pages_direct_compact(gfp_mask, order, alloc_flags, ac,
3712 compact_priority, &compact_result);
3716 /* Do not loop if specifically requested */
3717 if (gfp_mask & __GFP_NORETRY)
3721 * Do not retry costly high order allocations unless they are
3724 if (order > PAGE_ALLOC_COSTLY_ORDER && !(gfp_mask & __GFP_REPEAT))
3727 /* Make sure we know about allocations which stall for too long */
3728 if (time_after(jiffies, alloc_start + stall_timeout)) {
3729 warn_alloc(gfp_mask, ac->nodemask,
3730 "page allocation stalls for %ums, order:%u",
3731 jiffies_to_msecs(jiffies-alloc_start), order);
3732 stall_timeout += 10 * HZ;
3735 if (should_reclaim_retry(gfp_mask, order, ac, alloc_flags,
3736 did_some_progress > 0, &no_progress_loops))
3740 * It doesn't make any sense to retry for the compaction if the order-0
3741 * reclaim is not able to make any progress because the current
3742 * implementation of the compaction depends on the sufficient amount
3743 * of free memory (see __compaction_suitable)
3745 if (did_some_progress > 0 &&
3746 should_compact_retry(ac, order, alloc_flags,
3747 compact_result, &compact_priority,
3748 &compaction_retries))
3752 * It's possible we raced with cpuset update so the OOM would be
3753 * premature (see below the nopage: label for full explanation).
3755 if (read_mems_allowed_retry(cpuset_mems_cookie))
3758 /* Reclaim has failed us, start killing things */
3759 page = __alloc_pages_may_oom(gfp_mask, order, ac, &did_some_progress);
3763 /* Retry as long as the OOM killer is making progress */
3764 if (did_some_progress) {
3765 no_progress_loops = 0;
3771 * When updating a task's mems_allowed or mempolicy nodemask, it is
3772 * possible to race with parallel threads in such a way that our
3773 * allocation can fail while the mask is being updated. If we are about
3774 * to fail, check if the cpuset changed during allocation and if so,
3777 if (read_mems_allowed_retry(cpuset_mems_cookie))
3780 warn_alloc(gfp_mask, ac->nodemask,
3781 "page allocation failure: order:%u", order);
3787 * This is the 'heart' of the zoned buddy allocator.
3790 __alloc_pages_nodemask(gfp_t gfp_mask, unsigned int order,
3791 struct zonelist *zonelist, nodemask_t *nodemask)
3794 unsigned int alloc_flags = ALLOC_WMARK_LOW;
3795 gfp_t alloc_mask = gfp_mask; /* The gfp_t that was actually used for allocation */
3796 struct alloc_context ac = {
3797 .high_zoneidx = gfp_zone(gfp_mask),
3798 .zonelist = zonelist,
3799 .nodemask = nodemask,
3800 .migratetype = gfpflags_to_migratetype(gfp_mask),
3803 if (cpusets_enabled()) {
3804 alloc_mask |= __GFP_HARDWALL;
3805 alloc_flags |= ALLOC_CPUSET;
3807 ac.nodemask = &cpuset_current_mems_allowed;
3810 gfp_mask &= gfp_allowed_mask;
3812 lockdep_trace_alloc(gfp_mask);
3814 might_sleep_if(gfp_mask & __GFP_DIRECT_RECLAIM);
3816 if (should_fail_alloc_page(gfp_mask, order))
3820 * Check the zones suitable for the gfp_mask contain at least one
3821 * valid zone. It's possible to have an empty zonelist as a result
3822 * of __GFP_THISNODE and a memoryless node
3824 if (unlikely(!zonelist->_zonerefs->zone))
3827 if (IS_ENABLED(CONFIG_CMA) && ac.migratetype == MIGRATE_MOVABLE)
3828 alloc_flags |= ALLOC_CMA;
3830 /* Dirty zone balancing only done in the fast path */
3831 ac.spread_dirty_pages = (gfp_mask & __GFP_WRITE);
3834 * The preferred zone is used for statistics but crucially it is
3835 * also used as the starting point for the zonelist iterator. It
3836 * may get reset for allocations that ignore memory policies.
3838 ac.preferred_zoneref = first_zones_zonelist(ac.zonelist,
3839 ac.high_zoneidx, ac.nodemask);
3840 if (!ac.preferred_zoneref->zone) {
3843 * This might be due to race with cpuset_current_mems_allowed
3844 * update, so make sure we retry with original nodemask in the
3850 /* First allocation attempt */
3851 page = get_page_from_freelist(alloc_mask, order, alloc_flags, &ac);
3857 * Runtime PM, block IO and its error handling path can deadlock
3858 * because I/O on the device might not complete.
3860 alloc_mask = memalloc_noio_flags(gfp_mask);
3861 ac.spread_dirty_pages = false;
3864 * Restore the original nodemask if it was potentially replaced with
3865 * &cpuset_current_mems_allowed to optimize the fast-path attempt.
3867 if (unlikely(ac.nodemask != nodemask))
3868 ac.nodemask = nodemask;
3870 page = __alloc_pages_slowpath(alloc_mask, order, &ac);
3873 if (memcg_kmem_enabled() && (gfp_mask & __GFP_ACCOUNT) && page &&
3874 unlikely(memcg_kmem_charge(page, gfp_mask, order) != 0)) {
3875 __free_pages(page, order);
3879 if (kmemcheck_enabled && page)
3880 kmemcheck_pagealloc_alloc(page, order, gfp_mask);
3882 trace_mm_page_alloc(page, order, alloc_mask, ac.migratetype);
3886 EXPORT_SYMBOL(__alloc_pages_nodemask);
3889 * Common helper functions.
3891 unsigned long __get_free_pages(gfp_t gfp_mask, unsigned int order)
3896 * __get_free_pages() returns a 32-bit address, which cannot represent
3899 VM_BUG_ON((gfp_mask & __GFP_HIGHMEM) != 0);
3901 page = alloc_pages(gfp_mask, order);
3904 return (unsigned long) page_address(page);
3906 EXPORT_SYMBOL(__get_free_pages);
3908 unsigned long get_zeroed_page(gfp_t gfp_mask)
3910 return __get_free_pages(gfp_mask | __GFP_ZERO, 0);
3912 EXPORT_SYMBOL(get_zeroed_page);
3914 void __free_pages(struct page *page, unsigned int order)
3916 if (put_page_testzero(page)) {
3918 free_hot_cold_page(page, false);
3920 __free_pages_ok(page, order);
3924 EXPORT_SYMBOL(__free_pages);
3926 void free_pages(unsigned long addr, unsigned int order)
3929 VM_BUG_ON(!virt_addr_valid((void *)addr));
3930 __free_pages(virt_to_page((void *)addr), order);
3934 EXPORT_SYMBOL(free_pages);
3938 * An arbitrary-length arbitrary-offset area of memory which resides
3939 * within a 0 or higher order page. Multiple fragments within that page
3940 * are individually refcounted, in the page's reference counter.
3942 * The page_frag functions below provide a simple allocation framework for
3943 * page fragments. This is used by the network stack and network device
3944 * drivers to provide a backing region of memory for use as either an
3945 * sk_buff->head, or to be used in the "frags" portion of skb_shared_info.
3947 static struct page *__page_frag_cache_refill(struct page_frag_cache *nc,
3950 struct page *page = NULL;
3951 gfp_t gfp = gfp_mask;
3953 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
3954 gfp_mask |= __GFP_COMP | __GFP_NOWARN | __GFP_NORETRY |
3956 page = alloc_pages_node(NUMA_NO_NODE, gfp_mask,
3957 PAGE_FRAG_CACHE_MAX_ORDER);
3958 nc->size = page ? PAGE_FRAG_CACHE_MAX_SIZE : PAGE_SIZE;
3960 if (unlikely(!page))
3961 page = alloc_pages_node(NUMA_NO_NODE, gfp, 0);
3963 nc->va = page ? page_address(page) : NULL;
3968 void __page_frag_cache_drain(struct page *page, unsigned int count)
3970 VM_BUG_ON_PAGE(page_ref_count(page) == 0, page);
3972 if (page_ref_sub_and_test(page, count)) {
3973 unsigned int order = compound_order(page);
3976 free_hot_cold_page(page, false);
3978 __free_pages_ok(page, order);
3981 EXPORT_SYMBOL(__page_frag_cache_drain);
3983 void *page_frag_alloc(struct page_frag_cache *nc,
3984 unsigned int fragsz, gfp_t gfp_mask)
3986 unsigned int size = PAGE_SIZE;
3990 if (unlikely(!nc->va)) {
3992 page = __page_frag_cache_refill(nc, gfp_mask);
3996 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
3997 /* if size can vary use size else just use PAGE_SIZE */
4000 /* Even if we own the page, we do not use atomic_set().
4001 * This would break get_page_unless_zero() users.
4003 page_ref_add(page, size - 1);
4005 /* reset page count bias and offset to start of new frag */
4006 nc->pfmemalloc = page_is_pfmemalloc(page);
4007 nc->pagecnt_bias = size;
4011 offset = nc->offset - fragsz;
4012 if (unlikely(offset < 0)) {
4013 page = virt_to_page(nc->va);
4015 if (!page_ref_sub_and_test(page, nc->pagecnt_bias))
4018 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
4019 /* if size can vary use size else just use PAGE_SIZE */
4022 /* OK, page count is 0, we can safely set it */
4023 set_page_count(page, size);
4025 /* reset page count bias and offset to start of new frag */
4026 nc->pagecnt_bias = size;
4027 offset = size - fragsz;
4031 nc->offset = offset;
4033 return nc->va + offset;
4035 EXPORT_SYMBOL(page_frag_alloc);
4038 * Frees a page fragment allocated out of either a compound or order 0 page.
4040 void page_frag_free(void *addr)
4042 struct page *page = virt_to_head_page(addr);
4044 if (unlikely(put_page_testzero(page)))
4045 __free_pages_ok(page, compound_order(page));
4047 EXPORT_SYMBOL(page_frag_free);
4049 static void *make_alloc_exact(unsigned long addr, unsigned int order,
4053 unsigned long alloc_end = addr + (PAGE_SIZE << order);
4054 unsigned long used = addr + PAGE_ALIGN(size);
4056 split_page(virt_to_page((void *)addr), order);
4057 while (used < alloc_end) {
4062 return (void *)addr;
4066 * alloc_pages_exact - allocate an exact number physically-contiguous pages.
4067 * @size: the number of bytes to allocate
4068 * @gfp_mask: GFP flags for the allocation
4070 * This function is similar to alloc_pages(), except that it allocates the
4071 * minimum number of pages to satisfy the request. alloc_pages() can only
4072 * allocate memory in power-of-two pages.
4074 * This function is also limited by MAX_ORDER.
4076 * Memory allocated by this function must be released by free_pages_exact().
4078 void *alloc_pages_exact(size_t size, gfp_t gfp_mask)
4080 unsigned int order = get_order(size);
4083 addr = __get_free_pages(gfp_mask, order);
4084 return make_alloc_exact(addr, order, size);
4086 EXPORT_SYMBOL(alloc_pages_exact);
4089 * alloc_pages_exact_nid - allocate an exact number of physically-contiguous
4091 * @nid: the preferred node ID where memory should be allocated
4092 * @size: the number of bytes to allocate
4093 * @gfp_mask: GFP flags for the allocation
4095 * Like alloc_pages_exact(), but try to allocate on node nid first before falling
4098 void * __meminit alloc_pages_exact_nid(int nid, size_t size, gfp_t gfp_mask)
4100 unsigned int order = get_order(size);
4101 struct page *p = alloc_pages_node(nid, gfp_mask, order);
4104 return make_alloc_exact((unsigned long)page_address(p), order, size);
4108 * free_pages_exact - release memory allocated via alloc_pages_exact()
4109 * @virt: the value returned by alloc_pages_exact.
4110 * @size: size of allocation, same value as passed to alloc_pages_exact().
4112 * Release the memory allocated by a previous call to alloc_pages_exact.
4114 void free_pages_exact(void *virt, size_t size)
4116 unsigned long addr = (unsigned long)virt;
4117 unsigned long end = addr + PAGE_ALIGN(size);
4119 while (addr < end) {
4124 EXPORT_SYMBOL(free_pages_exact);
4127 * nr_free_zone_pages - count number of pages beyond high watermark
4128 * @offset: The zone index of the highest zone
4130 * nr_free_zone_pages() counts the number of counts pages which are beyond the
4131 * high watermark within all zones at or below a given zone index. For each
4132 * zone, the number of pages is calculated as:
4133 * managed_pages - high_pages
4135 static unsigned long nr_free_zone_pages(int offset)
4140 /* Just pick one node, since fallback list is circular */
4141 unsigned long sum = 0;
4143 struct zonelist *zonelist = node_zonelist(numa_node_id(), GFP_KERNEL);
4145 for_each_zone_zonelist(zone, z, zonelist, offset) {
4146 unsigned long size = zone->managed_pages;
4147 unsigned long high = high_wmark_pages(zone);
4156 * nr_free_buffer_pages - count number of pages beyond high watermark
4158 * nr_free_buffer_pages() counts the number of pages which are beyond the high
4159 * watermark within ZONE_DMA and ZONE_NORMAL.
4161 unsigned long nr_free_buffer_pages(void)
4163 return nr_free_zone_pages(gfp_zone(GFP_USER));
4165 EXPORT_SYMBOL_GPL(nr_free_buffer_pages);
4168 * nr_free_pagecache_pages - count number of pages beyond high watermark
4170 * nr_free_pagecache_pages() counts the number of pages which are beyond the
4171 * high watermark within all zones.
4173 unsigned long nr_free_pagecache_pages(void)
4175 return nr_free_zone_pages(gfp_zone(GFP_HIGHUSER_MOVABLE));
4178 static inline void show_node(struct zone *zone)
4180 if (IS_ENABLED(CONFIG_NUMA))
4181 printk("Node %d ", zone_to_nid(zone));
4184 long si_mem_available(void)
4187 unsigned long pagecache;
4188 unsigned long wmark_low = 0;
4189 unsigned long pages[NR_LRU_LISTS];
4193 for (lru = LRU_BASE; lru < NR_LRU_LISTS; lru++)
4194 pages[lru] = global_node_page_state(NR_LRU_BASE + lru);
4197 wmark_low += zone->watermark[WMARK_LOW];
4200 * Estimate the amount of memory available for userspace allocations,
4201 * without causing swapping.
4203 available = global_page_state(NR_FREE_PAGES) - totalreserve_pages;
4206 * Not all the page cache can be freed, otherwise the system will
4207 * start swapping. Assume at least half of the page cache, or the
4208 * low watermark worth of cache, needs to stay.
4210 pagecache = pages[LRU_ACTIVE_FILE] + pages[LRU_INACTIVE_FILE];
4211 pagecache -= min(pagecache / 2, wmark_low);
4212 available += pagecache;
4215 * Part of the reclaimable slab consists of items that are in use,
4216 * and cannot be freed. Cap this estimate at the low watermark.
4218 available += global_page_state(NR_SLAB_RECLAIMABLE) -
4219 min(global_page_state(NR_SLAB_RECLAIMABLE) / 2, wmark_low);
4225 EXPORT_SYMBOL_GPL(si_mem_available);
4227 void si_meminfo(struct sysinfo *val)
4229 val->totalram = totalram_pages;
4230 val->sharedram = global_node_page_state(NR_SHMEM);
4231 val->freeram = global_page_state(NR_FREE_PAGES);
4232 val->bufferram = nr_blockdev_pages();
4233 val->totalhigh = totalhigh_pages;
4234 val->freehigh = nr_free_highpages();
4235 val->mem_unit = PAGE_SIZE;
4238 EXPORT_SYMBOL(si_meminfo);
4241 void si_meminfo_node(struct sysinfo *val, int nid)
4243 int zone_type; /* needs to be signed */
4244 unsigned long managed_pages = 0;
4245 unsigned long managed_highpages = 0;
4246 unsigned long free_highpages = 0;
4247 pg_data_t *pgdat = NODE_DATA(nid);
4249 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++)
4250 managed_pages += pgdat->node_zones[zone_type].managed_pages;
4251 val->totalram = managed_pages;
4252 val->sharedram = node_page_state(pgdat, NR_SHMEM);
4253 val->freeram = sum_zone_node_page_state(nid, NR_FREE_PAGES);
4254 #ifdef CONFIG_HIGHMEM
4255 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++) {
4256 struct zone *zone = &pgdat->node_zones[zone_type];
4258 if (is_highmem(zone)) {
4259 managed_highpages += zone->managed_pages;
4260 free_highpages += zone_page_state(zone, NR_FREE_PAGES);
4263 val->totalhigh = managed_highpages;
4264 val->freehigh = free_highpages;
4266 val->totalhigh = managed_highpages;
4267 val->freehigh = free_highpages;
4269 val->mem_unit = PAGE_SIZE;
4274 * Determine whether the node should be displayed or not, depending on whether
4275 * SHOW_MEM_FILTER_NODES was passed to show_free_areas().
4277 static bool show_mem_node_skip(unsigned int flags, int nid, nodemask_t *nodemask)
4279 if (!(flags & SHOW_MEM_FILTER_NODES))
4283 * no node mask - aka implicit memory numa policy. Do not bother with
4284 * the synchronization - read_mems_allowed_begin - because we do not
4285 * have to be precise here.
4288 nodemask = &cpuset_current_mems_allowed;
4290 return !node_isset(nid, *nodemask);
4293 #define K(x) ((x) << (PAGE_SHIFT-10))
4295 static void show_migration_types(unsigned char type)
4297 static const char types[MIGRATE_TYPES] = {
4298 [MIGRATE_UNMOVABLE] = 'U',
4299 [MIGRATE_MOVABLE] = 'M',
4300 [MIGRATE_RECLAIMABLE] = 'E',
4301 [MIGRATE_HIGHATOMIC] = 'H',
4303 [MIGRATE_CMA] = 'C',
4305 #ifdef CONFIG_MEMORY_ISOLATION
4306 [MIGRATE_ISOLATE] = 'I',
4309 char tmp[MIGRATE_TYPES + 1];
4313 for (i = 0; i < MIGRATE_TYPES; i++) {
4314 if (type & (1 << i))
4319 printk(KERN_CONT "(%s) ", tmp);
4323 * Show free area list (used inside shift_scroll-lock stuff)
4324 * We also calculate the percentage fragmentation. We do this by counting the
4325 * memory on each free list with the exception of the first item on the list.
4328 * SHOW_MEM_FILTER_NODES: suppress nodes that are not allowed by current's
4331 void show_free_areas(unsigned int filter, nodemask_t *nodemask)
4333 unsigned long free_pcp = 0;
4338 for_each_populated_zone(zone) {
4339 if (show_mem_node_skip(filter, zone_to_nid(zone), nodemask))
4342 for_each_online_cpu(cpu)
4343 free_pcp += per_cpu_ptr(zone->pageset, cpu)->pcp.count;
4346 printk("active_anon:%lu inactive_anon:%lu isolated_anon:%lu\n"
4347 " active_file:%lu inactive_file:%lu isolated_file:%lu\n"
4348 " unevictable:%lu dirty:%lu writeback:%lu unstable:%lu\n"
4349 " slab_reclaimable:%lu slab_unreclaimable:%lu\n"
4350 " mapped:%lu shmem:%lu pagetables:%lu bounce:%lu\n"
4351 " free:%lu free_pcp:%lu free_cma:%lu\n",
4352 global_node_page_state(NR_ACTIVE_ANON),
4353 global_node_page_state(NR_INACTIVE_ANON),
4354 global_node_page_state(NR_ISOLATED_ANON),
4355 global_node_page_state(NR_ACTIVE_FILE),
4356 global_node_page_state(NR_INACTIVE_FILE),
4357 global_node_page_state(NR_ISOLATED_FILE),
4358 global_node_page_state(NR_UNEVICTABLE),
4359 global_node_page_state(NR_FILE_DIRTY),
4360 global_node_page_state(NR_WRITEBACK),
4361 global_node_page_state(NR_UNSTABLE_NFS),
4362 global_page_state(NR_SLAB_RECLAIMABLE),
4363 global_page_state(NR_SLAB_UNRECLAIMABLE),
4364 global_node_page_state(NR_FILE_MAPPED),
4365 global_node_page_state(NR_SHMEM),
4366 global_page_state(NR_PAGETABLE),
4367 global_page_state(NR_BOUNCE),
4368 global_page_state(NR_FREE_PAGES),
4370 global_page_state(NR_FREE_CMA_PAGES));
4372 for_each_online_pgdat(pgdat) {
4373 if (show_mem_node_skip(filter, pgdat->node_id, nodemask))
4377 " active_anon:%lukB"
4378 " inactive_anon:%lukB"
4379 " active_file:%lukB"
4380 " inactive_file:%lukB"
4381 " unevictable:%lukB"
4382 " isolated(anon):%lukB"
4383 " isolated(file):%lukB"
4388 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
4390 " shmem_pmdmapped: %lukB"
4393 " writeback_tmp:%lukB"
4395 " pages_scanned:%lu"
4396 " all_unreclaimable? %s"
4399 K(node_page_state(pgdat, NR_ACTIVE_ANON)),
4400 K(node_page_state(pgdat, NR_INACTIVE_ANON)),
4401 K(node_page_state(pgdat, NR_ACTIVE_FILE)),
4402 K(node_page_state(pgdat, NR_INACTIVE_FILE)),
4403 K(node_page_state(pgdat, NR_UNEVICTABLE)),
4404 K(node_page_state(pgdat, NR_ISOLATED_ANON)),
4405 K(node_page_state(pgdat, NR_ISOLATED_FILE)),
4406 K(node_page_state(pgdat, NR_FILE_MAPPED)),
4407 K(node_page_state(pgdat, NR_FILE_DIRTY)),
4408 K(node_page_state(pgdat, NR_WRITEBACK)),
4409 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
4410 K(node_page_state(pgdat, NR_SHMEM_THPS) * HPAGE_PMD_NR),
4411 K(node_page_state(pgdat, NR_SHMEM_PMDMAPPED)
4413 K(node_page_state(pgdat, NR_ANON_THPS) * HPAGE_PMD_NR),
4415 K(node_page_state(pgdat, NR_SHMEM)),
4416 K(node_page_state(pgdat, NR_WRITEBACK_TEMP)),
4417 K(node_page_state(pgdat, NR_UNSTABLE_NFS)),
4418 node_page_state(pgdat, NR_PAGES_SCANNED),
4419 !pgdat_reclaimable(pgdat) ? "yes" : "no");
4422 for_each_populated_zone(zone) {
4425 if (show_mem_node_skip(filter, zone_to_nid(zone), nodemask))
4429 for_each_online_cpu(cpu)
4430 free_pcp += per_cpu_ptr(zone->pageset, cpu)->pcp.count;
4439 " active_anon:%lukB"
4440 " inactive_anon:%lukB"
4441 " active_file:%lukB"
4442 " inactive_file:%lukB"
4443 " unevictable:%lukB"
4444 " writepending:%lukB"
4448 " slab_reclaimable:%lukB"
4449 " slab_unreclaimable:%lukB"
4450 " kernel_stack:%lukB"
4458 K(zone_page_state(zone, NR_FREE_PAGES)),
4459 K(min_wmark_pages(zone)),
4460 K(low_wmark_pages(zone)),
4461 K(high_wmark_pages(zone)),
4462 K(zone_page_state(zone, NR_ZONE_ACTIVE_ANON)),
4463 K(zone_page_state(zone, NR_ZONE_INACTIVE_ANON)),
4464 K(zone_page_state(zone, NR_ZONE_ACTIVE_FILE)),
4465 K(zone_page_state(zone, NR_ZONE_INACTIVE_FILE)),
4466 K(zone_page_state(zone, NR_ZONE_UNEVICTABLE)),
4467 K(zone_page_state(zone, NR_ZONE_WRITE_PENDING)),
4468 K(zone->present_pages),
4469 K(zone->managed_pages),
4470 K(zone_page_state(zone, NR_MLOCK)),
4471 K(zone_page_state(zone, NR_SLAB_RECLAIMABLE)),
4472 K(zone_page_state(zone, NR_SLAB_UNRECLAIMABLE)),
4473 zone_page_state(zone, NR_KERNEL_STACK_KB),
4474 K(zone_page_state(zone, NR_PAGETABLE)),
4475 K(zone_page_state(zone, NR_BOUNCE)),
4477 K(this_cpu_read(zone->pageset->pcp.count)),
4478 K(zone_page_state(zone, NR_FREE_CMA_PAGES)));
4479 printk("lowmem_reserve[]:");
4480 for (i = 0; i < MAX_NR_ZONES; i++)
4481 printk(KERN_CONT " %ld", zone->lowmem_reserve[i]);
4482 printk(KERN_CONT "\n");
4485 for_each_populated_zone(zone) {
4487 unsigned long nr[MAX_ORDER], flags, total = 0;
4488 unsigned char types[MAX_ORDER];
4490 if (show_mem_node_skip(filter, zone_to_nid(zone), nodemask))
4493 printk(KERN_CONT "%s: ", zone->name);
4495 spin_lock_irqsave(&zone->lock, flags);
4496 for (order = 0; order < MAX_ORDER; order++) {
4497 struct free_area *area = &zone->free_area[order];
4500 nr[order] = area->nr_free;
4501 total += nr[order] << order;
4504 for (type = 0; type < MIGRATE_TYPES; type++) {
4505 if (!list_empty(&area->free_list[type]))
4506 types[order] |= 1 << type;
4509 spin_unlock_irqrestore(&zone->lock, flags);
4510 for (order = 0; order < MAX_ORDER; order++) {
4511 printk(KERN_CONT "%lu*%lukB ",
4512 nr[order], K(1UL) << order);
4514 show_migration_types(types[order]);
4516 printk(KERN_CONT "= %lukB\n", K(total));
4519 hugetlb_show_meminfo();
4521 printk("%ld total pagecache pages\n", global_node_page_state(NR_FILE_PAGES));
4523 show_swap_cache_info();
4526 static void zoneref_set_zone(struct zone *zone, struct zoneref *zoneref)
4528 zoneref->zone = zone;
4529 zoneref->zone_idx = zone_idx(zone);
4533 * Builds allocation fallback zone lists.
4535 * Add all populated zones of a node to the zonelist.
4537 static int build_zonelists_node(pg_data_t *pgdat, struct zonelist *zonelist,
4541 enum zone_type zone_type = MAX_NR_ZONES;
4545 zone = pgdat->node_zones + zone_type;
4546 if (managed_zone(zone)) {
4547 zoneref_set_zone(zone,
4548 &zonelist->_zonerefs[nr_zones++]);
4549 check_highest_zone(zone_type);
4551 } while (zone_type);
4559 * 0 = automatic detection of better ordering.
4560 * 1 = order by ([node] distance, -zonetype)
4561 * 2 = order by (-zonetype, [node] distance)
4563 * If not NUMA, ZONELIST_ORDER_ZONE and ZONELIST_ORDER_NODE will create
4564 * the same zonelist. So only NUMA can configure this param.
4566 #define ZONELIST_ORDER_DEFAULT 0
4567 #define ZONELIST_ORDER_NODE 1
4568 #define ZONELIST_ORDER_ZONE 2
4570 /* zonelist order in the kernel.
4571 * set_zonelist_order() will set this to NODE or ZONE.
4573 static int current_zonelist_order = ZONELIST_ORDER_DEFAULT;
4574 static char zonelist_order_name[3][8] = {"Default", "Node", "Zone"};
4578 /* The value user specified ....changed by config */
4579 static int user_zonelist_order = ZONELIST_ORDER_DEFAULT;
4580 /* string for sysctl */
4581 #define NUMA_ZONELIST_ORDER_LEN 16
4582 char numa_zonelist_order[16] = "default";
4585 * interface for configure zonelist ordering.
4586 * command line option "numa_zonelist_order"
4587 * = "[dD]efault - default, automatic configuration.
4588 * = "[nN]ode - order by node locality, then by zone within node
4589 * = "[zZ]one - order by zone, then by locality within zone
4592 static int __parse_numa_zonelist_order(char *s)
4594 if (*s == 'd' || *s == 'D') {
4595 user_zonelist_order = ZONELIST_ORDER_DEFAULT;
4596 } else if (*s == 'n' || *s == 'N') {
4597 user_zonelist_order = ZONELIST_ORDER_NODE;
4598 } else if (*s == 'z' || *s == 'Z') {
4599 user_zonelist_order = ZONELIST_ORDER_ZONE;
4601 pr_warn("Ignoring invalid numa_zonelist_order value: %s\n", s);
4607 static __init int setup_numa_zonelist_order(char *s)
4614 ret = __parse_numa_zonelist_order(s);
4616 strlcpy(numa_zonelist_order, s, NUMA_ZONELIST_ORDER_LEN);
4620 early_param("numa_zonelist_order", setup_numa_zonelist_order);
4623 * sysctl handler for numa_zonelist_order
4625 int numa_zonelist_order_handler(struct ctl_table *table, int write,
4626 void __user *buffer, size_t *length,
4629 char saved_string[NUMA_ZONELIST_ORDER_LEN];
4631 static DEFINE_MUTEX(zl_order_mutex);
4633 mutex_lock(&zl_order_mutex);
4635 if (strlen((char *)table->data) >= NUMA_ZONELIST_ORDER_LEN) {
4639 strcpy(saved_string, (char *)table->data);
4641 ret = proc_dostring(table, write, buffer, length, ppos);
4645 int oldval = user_zonelist_order;
4647 ret = __parse_numa_zonelist_order((char *)table->data);
4650 * bogus value. restore saved string
4652 strncpy((char *)table->data, saved_string,
4653 NUMA_ZONELIST_ORDER_LEN);
4654 user_zonelist_order = oldval;
4655 } else if (oldval != user_zonelist_order) {
4656 mutex_lock(&zonelists_mutex);
4657 build_all_zonelists(NULL, NULL);
4658 mutex_unlock(&zonelists_mutex);
4662 mutex_unlock(&zl_order_mutex);
4667 #define MAX_NODE_LOAD (nr_online_nodes)
4668 static int node_load[MAX_NUMNODES];
4671 * find_next_best_node - find the next node that should appear in a given node's fallback list
4672 * @node: node whose fallback list we're appending
4673 * @used_node_mask: nodemask_t of already used nodes
4675 * We use a number of factors to determine which is the next node that should
4676 * appear on a given node's fallback list. The node should not have appeared
4677 * already in @node's fallback list, and it should be the next closest node
4678 * according to the distance array (which contains arbitrary distance values
4679 * from each node to each node in the system), and should also prefer nodes
4680 * with no CPUs, since presumably they'll have very little allocation pressure
4681 * on them otherwise.
4682 * It returns -1 if no node is found.
4684 static int find_next_best_node(int node, nodemask_t *used_node_mask)
4687 int min_val = INT_MAX;
4688 int best_node = NUMA_NO_NODE;
4689 const struct cpumask *tmp = cpumask_of_node(0);
4691 /* Use the local node if we haven't already */
4692 if (!node_isset(node, *used_node_mask)) {
4693 node_set(node, *used_node_mask);
4697 for_each_node_state(n, N_MEMORY) {
4699 /* Don't want a node to appear more than once */
4700 if (node_isset(n, *used_node_mask))
4703 /* Use the distance array to find the distance */
4704 val = node_distance(node, n);
4706 /* Penalize nodes under us ("prefer the next node") */
4709 /* Give preference to headless and unused nodes */
4710 tmp = cpumask_of_node(n);
4711 if (!cpumask_empty(tmp))
4712 val += PENALTY_FOR_NODE_WITH_CPUS;
4714 /* Slight preference for less loaded node */
4715 val *= (MAX_NODE_LOAD*MAX_NUMNODES);
4716 val += node_load[n];
4718 if (val < min_val) {
4725 node_set(best_node, *used_node_mask);
4732 * Build zonelists ordered by node and zones within node.
4733 * This results in maximum locality--normal zone overflows into local
4734 * DMA zone, if any--but risks exhausting DMA zone.
4736 static void build_zonelists_in_node_order(pg_data_t *pgdat, int node)
4739 struct zonelist *zonelist;
4741 zonelist = &pgdat->node_zonelists[ZONELIST_FALLBACK];
4742 for (j = 0; zonelist->_zonerefs[j].zone != NULL; j++)
4744 j = build_zonelists_node(NODE_DATA(node), zonelist, j);
4745 zonelist->_zonerefs[j].zone = NULL;
4746 zonelist->_zonerefs[j].zone_idx = 0;
4750 * Build gfp_thisnode zonelists
4752 static void build_thisnode_zonelists(pg_data_t *pgdat)
4755 struct zonelist *zonelist;
4757 zonelist = &pgdat->node_zonelists[ZONELIST_NOFALLBACK];
4758 j = build_zonelists_node(pgdat, zonelist, 0);
4759 zonelist->_zonerefs[j].zone = NULL;
4760 zonelist->_zonerefs[j].zone_idx = 0;
4764 * Build zonelists ordered by zone and nodes within zones.
4765 * This results in conserving DMA zone[s] until all Normal memory is
4766 * exhausted, but results in overflowing to remote node while memory
4767 * may still exist in local DMA zone.
4769 static int node_order[MAX_NUMNODES];
4771 static void build_zonelists_in_zone_order(pg_data_t *pgdat, int nr_nodes)
4774 int zone_type; /* needs to be signed */
4776 struct zonelist *zonelist;
4778 zonelist = &pgdat->node_zonelists[ZONELIST_FALLBACK];
4780 for (zone_type = MAX_NR_ZONES - 1; zone_type >= 0; zone_type--) {
4781 for (j = 0; j < nr_nodes; j++) {
4782 node = node_order[j];
4783 z = &NODE_DATA(node)->node_zones[zone_type];
4784 if (managed_zone(z)) {
4786 &zonelist->_zonerefs[pos++]);
4787 check_highest_zone(zone_type);
4791 zonelist->_zonerefs[pos].zone = NULL;
4792 zonelist->_zonerefs[pos].zone_idx = 0;
4795 #if defined(CONFIG_64BIT)
4797 * Devices that require DMA32/DMA are relatively rare and do not justify a
4798 * penalty to every machine in case the specialised case applies. Default
4799 * to Node-ordering on 64-bit NUMA machines
4801 static int default_zonelist_order(void)
4803 return ZONELIST_ORDER_NODE;
4807 * On 32-bit, the Normal zone needs to be preserved for allocations accessible
4808 * by the kernel. If processes running on node 0 deplete the low memory zone
4809 * then reclaim will occur more frequency increasing stalls and potentially
4810 * be easier to OOM if a large percentage of the zone is under writeback or
4811 * dirty. The problem is significantly worse if CONFIG_HIGHPTE is not set.
4812 * Hence, default to zone ordering on 32-bit.
4814 static int default_zonelist_order(void)
4816 return ZONELIST_ORDER_ZONE;
4818 #endif /* CONFIG_64BIT */
4820 static void set_zonelist_order(void)
4822 if (user_zonelist_order == ZONELIST_ORDER_DEFAULT)
4823 current_zonelist_order = default_zonelist_order();
4825 current_zonelist_order = user_zonelist_order;
4828 static void build_zonelists(pg_data_t *pgdat)
4831 nodemask_t used_mask;
4832 int local_node, prev_node;
4833 struct zonelist *zonelist;
4834 unsigned int order = current_zonelist_order;
4836 /* initialize zonelists */
4837 for (i = 0; i < MAX_ZONELISTS; i++) {
4838 zonelist = pgdat->node_zonelists + i;
4839 zonelist->_zonerefs[0].zone = NULL;
4840 zonelist->_zonerefs[0].zone_idx = 0;
4843 /* NUMA-aware ordering of nodes */
4844 local_node = pgdat->node_id;
4845 load = nr_online_nodes;
4846 prev_node = local_node;
4847 nodes_clear(used_mask);
4849 memset(node_order, 0, sizeof(node_order));
4852 while ((node = find_next_best_node(local_node, &used_mask)) >= 0) {
4854 * We don't want to pressure a particular node.
4855 * So adding penalty to the first node in same
4856 * distance group to make it round-robin.
4858 if (node_distance(local_node, node) !=
4859 node_distance(local_node, prev_node))
4860 node_load[node] = load;
4864 if (order == ZONELIST_ORDER_NODE)
4865 build_zonelists_in_node_order(pgdat, node);
4867 node_order[i++] = node; /* remember order */
4870 if (order == ZONELIST_ORDER_ZONE) {
4871 /* calculate node order -- i.e., DMA last! */
4872 build_zonelists_in_zone_order(pgdat, i);
4875 build_thisnode_zonelists(pgdat);
4878 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
4880 * Return node id of node used for "local" allocations.
4881 * I.e., first node id of first zone in arg node's generic zonelist.
4882 * Used for initializing percpu 'numa_mem', which is used primarily
4883 * for kernel allocations, so use GFP_KERNEL flags to locate zonelist.
4885 int local_memory_node(int node)
4889 z = first_zones_zonelist(node_zonelist(node, GFP_KERNEL),
4890 gfp_zone(GFP_KERNEL),
4892 return z->zone->node;
4896 static void setup_min_unmapped_ratio(void);
4897 static void setup_min_slab_ratio(void);
4898 #else /* CONFIG_NUMA */
4900 static void set_zonelist_order(void)
4902 current_zonelist_order = ZONELIST_ORDER_ZONE;
4905 static void build_zonelists(pg_data_t *pgdat)
4907 int node, local_node;
4909 struct zonelist *zonelist;
4911 local_node = pgdat->node_id;
4913 zonelist = &pgdat->node_zonelists[ZONELIST_FALLBACK];
4914 j = build_zonelists_node(pgdat, zonelist, 0);
4917 * Now we build the zonelist so that it contains the zones
4918 * of all the other nodes.
4919 * We don't want to pressure a particular node, so when
4920 * building the zones for node N, we make sure that the
4921 * zones coming right after the local ones are those from
4922 * node N+1 (modulo N)
4924 for (node = local_node + 1; node < MAX_NUMNODES; node++) {
4925 if (!node_online(node))
4927 j = build_zonelists_node(NODE_DATA(node), zonelist, j);
4929 for (node = 0; node < local_node; node++) {
4930 if (!node_online(node))
4932 j = build_zonelists_node(NODE_DATA(node), zonelist, j);
4935 zonelist->_zonerefs[j].zone = NULL;
4936 zonelist->_zonerefs[j].zone_idx = 0;
4939 #endif /* CONFIG_NUMA */
4942 * Boot pageset table. One per cpu which is going to be used for all
4943 * zones and all nodes. The parameters will be set in such a way
4944 * that an item put on a list will immediately be handed over to
4945 * the buddy list. This is safe since pageset manipulation is done
4946 * with interrupts disabled.
4948 * The boot_pagesets must be kept even after bootup is complete for
4949 * unused processors and/or zones. They do play a role for bootstrapping
4950 * hotplugged processors.
4952 * zoneinfo_show() and maybe other functions do
4953 * not check if the processor is online before following the pageset pointer.
4954 * Other parts of the kernel may not check if the zone is available.
4956 static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch);
4957 static DEFINE_PER_CPU(struct per_cpu_pageset, boot_pageset);
4958 static void setup_zone_pageset(struct zone *zone);
4961 * Global mutex to protect against size modification of zonelists
4962 * as well as to serialize pageset setup for the new populated zone.
4964 DEFINE_MUTEX(zonelists_mutex);
4966 /* return values int ....just for stop_machine() */
4967 static int __build_all_zonelists(void *data)
4971 pg_data_t *self = data;
4974 memset(node_load, 0, sizeof(node_load));
4977 if (self && !node_online(self->node_id)) {
4978 build_zonelists(self);
4981 for_each_online_node(nid) {
4982 pg_data_t *pgdat = NODE_DATA(nid);
4984 build_zonelists(pgdat);
4988 * Initialize the boot_pagesets that are going to be used
4989 * for bootstrapping processors. The real pagesets for
4990 * each zone will be allocated later when the per cpu
4991 * allocator is available.
4993 * boot_pagesets are used also for bootstrapping offline
4994 * cpus if the system is already booted because the pagesets
4995 * are needed to initialize allocators on a specific cpu too.
4996 * F.e. the percpu allocator needs the page allocator which
4997 * needs the percpu allocator in order to allocate its pagesets
4998 * (a chicken-egg dilemma).
5000 for_each_possible_cpu(cpu) {
5001 setup_pageset(&per_cpu(boot_pageset, cpu), 0);
5003 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
5005 * We now know the "local memory node" for each node--
5006 * i.e., the node of the first zone in the generic zonelist.
5007 * Set up numa_mem percpu variable for on-line cpus. During
5008 * boot, only the boot cpu should be on-line; we'll init the
5009 * secondary cpus' numa_mem as they come on-line. During
5010 * node/memory hotplug, we'll fixup all on-line cpus.
5012 if (cpu_online(cpu))
5013 set_cpu_numa_mem(cpu, local_memory_node(cpu_to_node(cpu)));
5020 static noinline void __init
5021 build_all_zonelists_init(void)
5023 __build_all_zonelists(NULL);
5024 mminit_verify_zonelist();
5025 cpuset_init_current_mems_allowed();
5029 * Called with zonelists_mutex held always
5030 * unless system_state == SYSTEM_BOOTING.
5032 * __ref due to (1) call of __meminit annotated setup_zone_pageset
5033 * [we're only called with non-NULL zone through __meminit paths] and
5034 * (2) call of __init annotated helper build_all_zonelists_init
5035 * [protected by SYSTEM_BOOTING].
5037 void __ref build_all_zonelists(pg_data_t *pgdat, struct zone *zone)
5039 set_zonelist_order();
5041 if (system_state == SYSTEM_BOOTING) {
5042 build_all_zonelists_init();
5044 #ifdef CONFIG_MEMORY_HOTPLUG
5046 setup_zone_pageset(zone);
5048 /* we have to stop all cpus to guarantee there is no user
5050 stop_machine(__build_all_zonelists, pgdat, NULL);
5051 /* cpuset refresh routine should be here */
5053 vm_total_pages = nr_free_pagecache_pages();
5055 * Disable grouping by mobility if the number of pages in the
5056 * system is too low to allow the mechanism to work. It would be
5057 * more accurate, but expensive to check per-zone. This check is
5058 * made on memory-hotadd so a system can start with mobility
5059 * disabled and enable it later
5061 if (vm_total_pages < (pageblock_nr_pages * MIGRATE_TYPES))
5062 page_group_by_mobility_disabled = 1;
5064 page_group_by_mobility_disabled = 0;
5066 pr_info("Built %i zonelists in %s order, mobility grouping %s. Total pages: %ld\n",
5068 zonelist_order_name[current_zonelist_order],
5069 page_group_by_mobility_disabled ? "off" : "on",
5072 pr_info("Policy zone: %s\n", zone_names[policy_zone]);
5077 * Initially all pages are reserved - free ones are freed
5078 * up by free_all_bootmem() once the early boot process is
5079 * done. Non-atomic initialization, single-pass.
5081 void __meminit memmap_init_zone(unsigned long size, int nid, unsigned long zone,
5082 unsigned long start_pfn, enum memmap_context context)
5084 struct vmem_altmap *altmap = to_vmem_altmap(__pfn_to_phys(start_pfn));
5085 unsigned long end_pfn = start_pfn + size;
5086 pg_data_t *pgdat = NODE_DATA(nid);
5088 unsigned long nr_initialised = 0;
5089 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
5090 struct memblock_region *r = NULL, *tmp;
5093 if (highest_memmap_pfn < end_pfn - 1)
5094 highest_memmap_pfn = end_pfn - 1;
5097 * Honor reservation requested by the driver for this ZONE_DEVICE
5100 if (altmap && start_pfn == altmap->base_pfn)
5101 start_pfn += altmap->reserve;
5103 for (pfn = start_pfn; pfn < end_pfn; pfn++) {
5105 * There can be holes in boot-time mem_map[]s handed to this
5106 * function. They do not exist on hotplugged memory.
5108 if (context != MEMMAP_EARLY)
5111 if (!early_pfn_valid(pfn)) {
5112 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
5114 * Skip to the pfn preceding the next valid one (or
5115 * end_pfn), such that we hit a valid pfn (or end_pfn)
5116 * on our next iteration of the loop.
5118 pfn = memblock_next_valid_pfn(pfn, end_pfn) - 1;
5122 if (!early_pfn_in_nid(pfn, nid))
5124 if (!update_defer_init(pgdat, pfn, end_pfn, &nr_initialised))
5127 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
5129 * Check given memblock attribute by firmware which can affect
5130 * kernel memory layout. If zone==ZONE_MOVABLE but memory is
5131 * mirrored, it's an overlapped memmap init. skip it.
5133 if (mirrored_kernelcore && zone == ZONE_MOVABLE) {
5134 if (!r || pfn >= memblock_region_memory_end_pfn(r)) {
5135 for_each_memblock(memory, tmp)
5136 if (pfn < memblock_region_memory_end_pfn(tmp))
5140 if (pfn >= memblock_region_memory_base_pfn(r) &&
5141 memblock_is_mirror(r)) {
5142 /* already initialized as NORMAL */
5143 pfn = memblock_region_memory_end_pfn(r);
5151 * Mark the block movable so that blocks are reserved for
5152 * movable at startup. This will force kernel allocations
5153 * to reserve their blocks rather than leaking throughout
5154 * the address space during boot when many long-lived
5155 * kernel allocations are made.
5157 * bitmap is created for zone's valid pfn range. but memmap
5158 * can be created for invalid pages (for alignment)
5159 * check here not to call set_pageblock_migratetype() against
5162 if (!(pfn & (pageblock_nr_pages - 1))) {
5163 struct page *page = pfn_to_page(pfn);
5165 __init_single_page(page, pfn, zone, nid);
5166 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
5168 __init_single_pfn(pfn, zone, nid);
5173 static void __meminit zone_init_free_lists(struct zone *zone)
5175 unsigned int order, t;
5176 for_each_migratetype_order(order, t) {
5177 INIT_LIST_HEAD(&zone->free_area[order].free_list[t]);
5178 zone->free_area[order].nr_free = 0;
5182 #ifndef __HAVE_ARCH_MEMMAP_INIT
5183 #define memmap_init(size, nid, zone, start_pfn) \
5184 memmap_init_zone((size), (nid), (zone), (start_pfn), MEMMAP_EARLY)
5187 static int zone_batchsize(struct zone *zone)
5193 * The per-cpu-pages pools are set to around 1000th of the
5194 * size of the zone. But no more than 1/2 of a meg.
5196 * OK, so we don't know how big the cache is. So guess.
5198 batch = zone->managed_pages / 1024;
5199 if (batch * PAGE_SIZE > 512 * 1024)
5200 batch = (512 * 1024) / PAGE_SIZE;
5201 batch /= 4; /* We effectively *= 4 below */
5206 * Clamp the batch to a 2^n - 1 value. Having a power
5207 * of 2 value was found to be more likely to have
5208 * suboptimal cache aliasing properties in some cases.
5210 * For example if 2 tasks are alternately allocating
5211 * batches of pages, one task can end up with a lot
5212 * of pages of one half of the possible page colors
5213 * and the other with pages of the other colors.
5215 batch = rounddown_pow_of_two(batch + batch/2) - 1;
5220 /* The deferral and batching of frees should be suppressed under NOMMU
5223 * The problem is that NOMMU needs to be able to allocate large chunks
5224 * of contiguous memory as there's no hardware page translation to
5225 * assemble apparent contiguous memory from discontiguous pages.
5227 * Queueing large contiguous runs of pages for batching, however,
5228 * causes the pages to actually be freed in smaller chunks. As there
5229 * can be a significant delay between the individual batches being
5230 * recycled, this leads to the once large chunks of space being
5231 * fragmented and becoming unavailable for high-order allocations.
5238 * pcp->high and pcp->batch values are related and dependent on one another:
5239 * ->batch must never be higher then ->high.
5240 * The following function updates them in a safe manner without read side
5243 * Any new users of pcp->batch and pcp->high should ensure they can cope with
5244 * those fields changing asynchronously (acording the the above rule).
5246 * mutex_is_locked(&pcp_batch_high_lock) required when calling this function
5247 * outside of boot time (or some other assurance that no concurrent updaters
5250 static void pageset_update(struct per_cpu_pages *pcp, unsigned long high,
5251 unsigned long batch)
5253 /* start with a fail safe value for batch */
5257 /* Update high, then batch, in order */
5264 /* a companion to pageset_set_high() */
5265 static void pageset_set_batch(struct per_cpu_pageset *p, unsigned long batch)
5267 pageset_update(&p->pcp, 6 * batch, max(1UL, 1 * batch));
5270 static void pageset_init(struct per_cpu_pageset *p)
5272 struct per_cpu_pages *pcp;
5275 memset(p, 0, sizeof(*p));
5279 for (migratetype = 0; migratetype < MIGRATE_PCPTYPES; migratetype++)
5280 INIT_LIST_HEAD(&pcp->lists[migratetype]);
5283 static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch)
5286 pageset_set_batch(p, batch);
5290 * pageset_set_high() sets the high water mark for hot per_cpu_pagelist
5291 * to the value high for the pageset p.
5293 static void pageset_set_high(struct per_cpu_pageset *p,
5296 unsigned long batch = max(1UL, high / 4);
5297 if ((high / 4) > (PAGE_SHIFT * 8))
5298 batch = PAGE_SHIFT * 8;
5300 pageset_update(&p->pcp, high, batch);
5303 static void pageset_set_high_and_batch(struct zone *zone,
5304 struct per_cpu_pageset *pcp)
5306 if (percpu_pagelist_fraction)
5307 pageset_set_high(pcp,
5308 (zone->managed_pages /
5309 percpu_pagelist_fraction));
5311 pageset_set_batch(pcp, zone_batchsize(zone));
5314 static void __meminit zone_pageset_init(struct zone *zone, int cpu)
5316 struct per_cpu_pageset *pcp = per_cpu_ptr(zone->pageset, cpu);
5319 pageset_set_high_and_batch(zone, pcp);
5322 static void __meminit setup_zone_pageset(struct zone *zone)
5325 zone->pageset = alloc_percpu(struct per_cpu_pageset);
5326 for_each_possible_cpu(cpu)
5327 zone_pageset_init(zone, cpu);
5331 * Allocate per cpu pagesets and initialize them.
5332 * Before this call only boot pagesets were available.
5334 void __init setup_per_cpu_pageset(void)
5336 struct pglist_data *pgdat;
5339 for_each_populated_zone(zone)
5340 setup_zone_pageset(zone);
5342 for_each_online_pgdat(pgdat)
5343 pgdat->per_cpu_nodestats =
5344 alloc_percpu(struct per_cpu_nodestat);
5347 static __meminit void zone_pcp_init(struct zone *zone)
5350 * per cpu subsystem is not up at this point. The following code
5351 * relies on the ability of the linker to provide the
5352 * offset of a (static) per cpu variable into the per cpu area.
5354 zone->pageset = &boot_pageset;
5356 if (populated_zone(zone))
5357 printk(KERN_DEBUG " %s zone: %lu pages, LIFO batch:%u\n",
5358 zone->name, zone->present_pages,
5359 zone_batchsize(zone));
5362 int __meminit init_currently_empty_zone(struct zone *zone,
5363 unsigned long zone_start_pfn,
5366 struct pglist_data *pgdat = zone->zone_pgdat;
5368 pgdat->nr_zones = zone_idx(zone) + 1;
5370 zone->zone_start_pfn = zone_start_pfn;
5372 mminit_dprintk(MMINIT_TRACE, "memmap_init",
5373 "Initialising map node %d zone %lu pfns %lu -> %lu\n",
5375 (unsigned long)zone_idx(zone),
5376 zone_start_pfn, (zone_start_pfn + size));
5378 zone_init_free_lists(zone);
5379 zone->initialized = 1;
5384 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
5385 #ifndef CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID
5388 * Required by SPARSEMEM. Given a PFN, return what node the PFN is on.
5390 int __meminit __early_pfn_to_nid(unsigned long pfn,
5391 struct mminit_pfnnid_cache *state)
5393 unsigned long start_pfn, end_pfn;
5396 if (state->last_start <= pfn && pfn < state->last_end)
5397 return state->last_nid;
5399 nid = memblock_search_pfn_nid(pfn, &start_pfn, &end_pfn);
5401 state->last_start = start_pfn;
5402 state->last_end = end_pfn;
5403 state->last_nid = nid;
5408 #endif /* CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID */
5411 * free_bootmem_with_active_regions - Call memblock_free_early_nid for each active range
5412 * @nid: The node to free memory on. If MAX_NUMNODES, all nodes are freed.
5413 * @max_low_pfn: The highest PFN that will be passed to memblock_free_early_nid
5415 * If an architecture guarantees that all ranges registered contain no holes
5416 * and may be freed, this this function may be used instead of calling
5417 * memblock_free_early_nid() manually.
5419 void __init free_bootmem_with_active_regions(int nid, unsigned long max_low_pfn)
5421 unsigned long start_pfn, end_pfn;
5424 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, &this_nid) {
5425 start_pfn = min(start_pfn, max_low_pfn);
5426 end_pfn = min(end_pfn, max_low_pfn);
5428 if (start_pfn < end_pfn)
5429 memblock_free_early_nid(PFN_PHYS(start_pfn),
5430 (end_pfn - start_pfn) << PAGE_SHIFT,
5436 * sparse_memory_present_with_active_regions - Call memory_present for each active range
5437 * @nid: The node to call memory_present for. If MAX_NUMNODES, all nodes will be used.
5439 * If an architecture guarantees that all ranges registered contain no holes and may
5440 * be freed, this function may be used instead of calling memory_present() manually.
5442 void __init sparse_memory_present_with_active_regions(int nid)
5444 unsigned long start_pfn, end_pfn;
5447 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, &this_nid)
5448 memory_present(this_nid, start_pfn, end_pfn);
5452 * get_pfn_range_for_nid - Return the start and end page frames for a node
5453 * @nid: The nid to return the range for. If MAX_NUMNODES, the min and max PFN are returned.
5454 * @start_pfn: Passed by reference. On return, it will have the node start_pfn.
5455 * @end_pfn: Passed by reference. On return, it will have the node end_pfn.
5457 * It returns the start and end page frame of a node based on information
5458 * provided by memblock_set_node(). If called for a node
5459 * with no available memory, a warning is printed and the start and end
5462 void __meminit get_pfn_range_for_nid(unsigned int nid,
5463 unsigned long *start_pfn, unsigned long *end_pfn)
5465 unsigned long this_start_pfn, this_end_pfn;
5471 for_each_mem_pfn_range(i, nid, &this_start_pfn, &this_end_pfn, NULL) {
5472 *start_pfn = min(*start_pfn, this_start_pfn);
5473 *end_pfn = max(*end_pfn, this_end_pfn);
5476 if (*start_pfn == -1UL)
5481 * This finds a zone that can be used for ZONE_MOVABLE pages. The
5482 * assumption is made that zones within a node are ordered in monotonic
5483 * increasing memory addresses so that the "highest" populated zone is used
5485 static void __init find_usable_zone_for_movable(void)
5488 for (zone_index = MAX_NR_ZONES - 1; zone_index >= 0; zone_index--) {
5489 if (zone_index == ZONE_MOVABLE)
5492 if (arch_zone_highest_possible_pfn[zone_index] >
5493 arch_zone_lowest_possible_pfn[zone_index])
5497 VM_BUG_ON(zone_index == -1);
5498 movable_zone = zone_index;
5502 * The zone ranges provided by the architecture do not include ZONE_MOVABLE
5503 * because it is sized independent of architecture. Unlike the other zones,
5504 * the starting point for ZONE_MOVABLE is not fixed. It may be different
5505 * in each node depending on the size of each node and how evenly kernelcore
5506 * is distributed. This helper function adjusts the zone ranges
5507 * provided by the architecture for a given node by using the end of the
5508 * highest usable zone for ZONE_MOVABLE. This preserves the assumption that
5509 * zones within a node are in order of monotonic increases memory addresses
5511 static void __meminit adjust_zone_range_for_zone_movable(int nid,
5512 unsigned long zone_type,
5513 unsigned long node_start_pfn,
5514 unsigned long node_end_pfn,
5515 unsigned long *zone_start_pfn,
5516 unsigned long *zone_end_pfn)
5518 /* Only adjust if ZONE_MOVABLE is on this node */
5519 if (zone_movable_pfn[nid]) {
5520 /* Size ZONE_MOVABLE */
5521 if (zone_type == ZONE_MOVABLE) {
5522 *zone_start_pfn = zone_movable_pfn[nid];
5523 *zone_end_pfn = min(node_end_pfn,
5524 arch_zone_highest_possible_pfn[movable_zone]);
5526 /* Adjust for ZONE_MOVABLE starting within this range */
5527 } else if (!mirrored_kernelcore &&
5528 *zone_start_pfn < zone_movable_pfn[nid] &&
5529 *zone_end_pfn > zone_movable_pfn[nid]) {
5530 *zone_end_pfn = zone_movable_pfn[nid];
5532 /* Check if this whole range is within ZONE_MOVABLE */
5533 } else if (*zone_start_pfn >= zone_movable_pfn[nid])
5534 *zone_start_pfn = *zone_end_pfn;
5539 * Return the number of pages a zone spans in a node, including holes
5540 * present_pages = zone_spanned_pages_in_node() - zone_absent_pages_in_node()
5542 static unsigned long __meminit zone_spanned_pages_in_node(int nid,
5543 unsigned long zone_type,
5544 unsigned long node_start_pfn,
5545 unsigned long node_end_pfn,
5546 unsigned long *zone_start_pfn,
5547 unsigned long *zone_end_pfn,
5548 unsigned long *ignored)
5550 /* When hotadd a new node from cpu_up(), the node should be empty */
5551 if (!node_start_pfn && !node_end_pfn)
5554 /* Get the start and end of the zone */
5555 *zone_start_pfn = arch_zone_lowest_possible_pfn[zone_type];
5556 *zone_end_pfn = arch_zone_highest_possible_pfn[zone_type];
5557 adjust_zone_range_for_zone_movable(nid, zone_type,
5558 node_start_pfn, node_end_pfn,
5559 zone_start_pfn, zone_end_pfn);
5561 /* Check that this node has pages within the zone's required range */
5562 if (*zone_end_pfn < node_start_pfn || *zone_start_pfn > node_end_pfn)
5565 /* Move the zone boundaries inside the node if necessary */
5566 *zone_end_pfn = min(*zone_end_pfn, node_end_pfn);
5567 *zone_start_pfn = max(*zone_start_pfn, node_start_pfn);
5569 /* Return the spanned pages */
5570 return *zone_end_pfn - *zone_start_pfn;
5574 * Return the number of holes in a range on a node. If nid is MAX_NUMNODES,
5575 * then all holes in the requested range will be accounted for.
5577 unsigned long __meminit __absent_pages_in_range(int nid,
5578 unsigned long range_start_pfn,
5579 unsigned long range_end_pfn)
5581 unsigned long nr_absent = range_end_pfn - range_start_pfn;
5582 unsigned long start_pfn, end_pfn;
5585 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
5586 start_pfn = clamp(start_pfn, range_start_pfn, range_end_pfn);
5587 end_pfn = clamp(end_pfn, range_start_pfn, range_end_pfn);
5588 nr_absent -= end_pfn - start_pfn;
5594 * absent_pages_in_range - Return number of page frames in holes within a range
5595 * @start_pfn: The start PFN to start searching for holes
5596 * @end_pfn: The end PFN to stop searching for holes
5598 * It returns the number of pages frames in memory holes within a range.
5600 unsigned long __init absent_pages_in_range(unsigned long start_pfn,
5601 unsigned long end_pfn)
5603 return __absent_pages_in_range(MAX_NUMNODES, start_pfn, end_pfn);
5606 /* Return the number of page frames in holes in a zone on a node */
5607 static unsigned long __meminit zone_absent_pages_in_node(int nid,
5608 unsigned long zone_type,
5609 unsigned long node_start_pfn,
5610 unsigned long node_end_pfn,
5611 unsigned long *ignored)
5613 unsigned long zone_low = arch_zone_lowest_possible_pfn[zone_type];
5614 unsigned long zone_high = arch_zone_highest_possible_pfn[zone_type];
5615 unsigned long zone_start_pfn, zone_end_pfn;
5616 unsigned long nr_absent;
5618 /* When hotadd a new node from cpu_up(), the node should be empty */
5619 if (!node_start_pfn && !node_end_pfn)
5622 zone_start_pfn = clamp(node_start_pfn, zone_low, zone_high);
5623 zone_end_pfn = clamp(node_end_pfn, zone_low, zone_high);
5625 adjust_zone_range_for_zone_movable(nid, zone_type,
5626 node_start_pfn, node_end_pfn,
5627 &zone_start_pfn, &zone_end_pfn);
5628 nr_absent = __absent_pages_in_range(nid, zone_start_pfn, zone_end_pfn);
5631 * ZONE_MOVABLE handling.
5632 * Treat pages to be ZONE_MOVABLE in ZONE_NORMAL as absent pages
5635 if (mirrored_kernelcore && zone_movable_pfn[nid]) {
5636 unsigned long start_pfn, end_pfn;
5637 struct memblock_region *r;
5639 for_each_memblock(memory, r) {
5640 start_pfn = clamp(memblock_region_memory_base_pfn(r),
5641 zone_start_pfn, zone_end_pfn);
5642 end_pfn = clamp(memblock_region_memory_end_pfn(r),
5643 zone_start_pfn, zone_end_pfn);
5645 if (zone_type == ZONE_MOVABLE &&
5646 memblock_is_mirror(r))
5647 nr_absent += end_pfn - start_pfn;
5649 if (zone_type == ZONE_NORMAL &&
5650 !memblock_is_mirror(r))
5651 nr_absent += end_pfn - start_pfn;
5658 #else /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
5659 static inline unsigned long __meminit zone_spanned_pages_in_node(int nid,
5660 unsigned long zone_type,
5661 unsigned long node_start_pfn,
5662 unsigned long node_end_pfn,
5663 unsigned long *zone_start_pfn,
5664 unsigned long *zone_end_pfn,
5665 unsigned long *zones_size)
5669 *zone_start_pfn = node_start_pfn;
5670 for (zone = 0; zone < zone_type; zone++)
5671 *zone_start_pfn += zones_size[zone];
5673 *zone_end_pfn = *zone_start_pfn + zones_size[zone_type];
5675 return zones_size[zone_type];
5678 static inline unsigned long __meminit zone_absent_pages_in_node(int nid,
5679 unsigned long zone_type,
5680 unsigned long node_start_pfn,
5681 unsigned long node_end_pfn,
5682 unsigned long *zholes_size)
5687 return zholes_size[zone_type];
5690 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
5692 static void __meminit calculate_node_totalpages(struct pglist_data *pgdat,
5693 unsigned long node_start_pfn,
5694 unsigned long node_end_pfn,
5695 unsigned long *zones_size,
5696 unsigned long *zholes_size)
5698 unsigned long realtotalpages = 0, totalpages = 0;
5701 for (i = 0; i < MAX_NR_ZONES; i++) {
5702 struct zone *zone = pgdat->node_zones + i;
5703 unsigned long zone_start_pfn, zone_end_pfn;
5704 unsigned long size, real_size;
5706 size = zone_spanned_pages_in_node(pgdat->node_id, i,
5712 real_size = size - zone_absent_pages_in_node(pgdat->node_id, i,
5713 node_start_pfn, node_end_pfn,
5716 zone->zone_start_pfn = zone_start_pfn;
5718 zone->zone_start_pfn = 0;
5719 zone->spanned_pages = size;
5720 zone->present_pages = real_size;
5723 realtotalpages += real_size;
5726 pgdat->node_spanned_pages = totalpages;
5727 pgdat->node_present_pages = realtotalpages;
5728 printk(KERN_DEBUG "On node %d totalpages: %lu\n", pgdat->node_id,
5732 #ifndef CONFIG_SPARSEMEM
5734 * Calculate the size of the zone->blockflags rounded to an unsigned long
5735 * Start by making sure zonesize is a multiple of pageblock_order by rounding
5736 * up. Then use 1 NR_PAGEBLOCK_BITS worth of bits per pageblock, finally
5737 * round what is now in bits to nearest long in bits, then return it in
5740 static unsigned long __init usemap_size(unsigned long zone_start_pfn, unsigned long zonesize)
5742 unsigned long usemapsize;
5744 zonesize += zone_start_pfn & (pageblock_nr_pages-1);
5745 usemapsize = roundup(zonesize, pageblock_nr_pages);
5746 usemapsize = usemapsize >> pageblock_order;
5747 usemapsize *= NR_PAGEBLOCK_BITS;
5748 usemapsize = roundup(usemapsize, 8 * sizeof(unsigned long));
5750 return usemapsize / 8;
5753 static void __init setup_usemap(struct pglist_data *pgdat,
5755 unsigned long zone_start_pfn,
5756 unsigned long zonesize)
5758 unsigned long usemapsize = usemap_size(zone_start_pfn, zonesize);
5759 zone->pageblock_flags = NULL;
5761 zone->pageblock_flags =
5762 memblock_virt_alloc_node_nopanic(usemapsize,
5766 static inline void setup_usemap(struct pglist_data *pgdat, struct zone *zone,
5767 unsigned long zone_start_pfn, unsigned long zonesize) {}
5768 #endif /* CONFIG_SPARSEMEM */
5770 #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
5772 /* Initialise the number of pages represented by NR_PAGEBLOCK_BITS */
5773 void __paginginit set_pageblock_order(void)
5777 /* Check that pageblock_nr_pages has not already been setup */
5778 if (pageblock_order)
5781 if (HPAGE_SHIFT > PAGE_SHIFT)
5782 order = HUGETLB_PAGE_ORDER;
5784 order = MAX_ORDER - 1;
5787 * Assume the largest contiguous order of interest is a huge page.
5788 * This value may be variable depending on boot parameters on IA64 and
5791 pageblock_order = order;
5793 #else /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
5796 * When CONFIG_HUGETLB_PAGE_SIZE_VARIABLE is not set, set_pageblock_order()
5797 * is unused as pageblock_order is set at compile-time. See
5798 * include/linux/pageblock-flags.h for the values of pageblock_order based on
5801 void __paginginit set_pageblock_order(void)
5805 #endif /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
5807 static unsigned long __paginginit calc_memmap_size(unsigned long spanned_pages,
5808 unsigned long present_pages)
5810 unsigned long pages = spanned_pages;
5813 * Provide a more accurate estimation if there are holes within
5814 * the zone and SPARSEMEM is in use. If there are holes within the
5815 * zone, each populated memory region may cost us one or two extra
5816 * memmap pages due to alignment because memmap pages for each
5817 * populated regions may not naturally algined on page boundary.
5818 * So the (present_pages >> 4) heuristic is a tradeoff for that.
5820 if (spanned_pages > present_pages + (present_pages >> 4) &&
5821 IS_ENABLED(CONFIG_SPARSEMEM))
5822 pages = present_pages;
5824 return PAGE_ALIGN(pages * sizeof(struct page)) >> PAGE_SHIFT;
5828 * Set up the zone data structures:
5829 * - mark all pages reserved
5830 * - mark all memory queues empty
5831 * - clear the memory bitmaps
5833 * NOTE: pgdat should get zeroed by caller.
5835 static void __paginginit free_area_init_core(struct pglist_data *pgdat)
5838 int nid = pgdat->node_id;
5841 pgdat_resize_init(pgdat);
5842 #ifdef CONFIG_NUMA_BALANCING
5843 spin_lock_init(&pgdat->numabalancing_migrate_lock);
5844 pgdat->numabalancing_migrate_nr_pages = 0;
5845 pgdat->numabalancing_migrate_next_window = jiffies;
5847 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
5848 spin_lock_init(&pgdat->split_queue_lock);
5849 INIT_LIST_HEAD(&pgdat->split_queue);
5850 pgdat->split_queue_len = 0;
5852 init_waitqueue_head(&pgdat->kswapd_wait);
5853 init_waitqueue_head(&pgdat->pfmemalloc_wait);
5854 #ifdef CONFIG_COMPACTION
5855 init_waitqueue_head(&pgdat->kcompactd_wait);
5857 pgdat_page_ext_init(pgdat);
5858 spin_lock_init(&pgdat->lru_lock);
5859 lruvec_init(node_lruvec(pgdat));
5861 for (j = 0; j < MAX_NR_ZONES; j++) {
5862 struct zone *zone = pgdat->node_zones + j;
5863 unsigned long size, realsize, freesize, memmap_pages;
5864 unsigned long zone_start_pfn = zone->zone_start_pfn;
5866 size = zone->spanned_pages;
5867 realsize = freesize = zone->present_pages;
5870 * Adjust freesize so that it accounts for how much memory
5871 * is used by this zone for memmap. This affects the watermark
5872 * and per-cpu initialisations
5874 memmap_pages = calc_memmap_size(size, realsize);
5875 if (!is_highmem_idx(j)) {
5876 if (freesize >= memmap_pages) {
5877 freesize -= memmap_pages;
5880 " %s zone: %lu pages used for memmap\n",
5881 zone_names[j], memmap_pages);
5883 pr_warn(" %s zone: %lu pages exceeds freesize %lu\n",
5884 zone_names[j], memmap_pages, freesize);
5887 /* Account for reserved pages */
5888 if (j == 0 && freesize > dma_reserve) {
5889 freesize -= dma_reserve;
5890 printk(KERN_DEBUG " %s zone: %lu pages reserved\n",
5891 zone_names[0], dma_reserve);
5894 if (!is_highmem_idx(j))
5895 nr_kernel_pages += freesize;
5896 /* Charge for highmem memmap if there are enough kernel pages */
5897 else if (nr_kernel_pages > memmap_pages * 2)
5898 nr_kernel_pages -= memmap_pages;
5899 nr_all_pages += freesize;
5902 * Set an approximate value for lowmem here, it will be adjusted
5903 * when the bootmem allocator frees pages into the buddy system.
5904 * And all highmem pages will be managed by the buddy system.
5906 zone->managed_pages = is_highmem_idx(j) ? realsize : freesize;
5910 zone->name = zone_names[j];
5911 zone->zone_pgdat = pgdat;
5912 spin_lock_init(&zone->lock);
5913 zone_seqlock_init(zone);
5914 zone_pcp_init(zone);
5919 set_pageblock_order();
5920 setup_usemap(pgdat, zone, zone_start_pfn, size);
5921 ret = init_currently_empty_zone(zone, zone_start_pfn, size);
5923 memmap_init(size, nid, j, zone_start_pfn);
5927 static void __ref alloc_node_mem_map(struct pglist_data *pgdat)
5929 unsigned long __maybe_unused start = 0;
5930 unsigned long __maybe_unused offset = 0;
5932 /* Skip empty nodes */
5933 if (!pgdat->node_spanned_pages)
5936 #ifdef CONFIG_FLAT_NODE_MEM_MAP
5937 start = pgdat->node_start_pfn & ~(MAX_ORDER_NR_PAGES - 1);
5938 offset = pgdat->node_start_pfn - start;
5939 /* ia64 gets its own node_mem_map, before this, without bootmem */
5940 if (!pgdat->node_mem_map) {
5941 unsigned long size, end;
5945 * The zone's endpoints aren't required to be MAX_ORDER
5946 * aligned but the node_mem_map endpoints must be in order
5947 * for the buddy allocator to function correctly.
5949 end = pgdat_end_pfn(pgdat);
5950 end = ALIGN(end, MAX_ORDER_NR_PAGES);
5951 size = (end - start) * sizeof(struct page);
5952 map = alloc_remap(pgdat->node_id, size);
5954 map = memblock_virt_alloc_node_nopanic(size,
5956 pgdat->node_mem_map = map + offset;
5958 #ifndef CONFIG_NEED_MULTIPLE_NODES
5960 * With no DISCONTIG, the global mem_map is just set as node 0's
5962 if (pgdat == NODE_DATA(0)) {
5963 mem_map = NODE_DATA(0)->node_mem_map;
5964 #if defined(CONFIG_HAVE_MEMBLOCK_NODE_MAP) || defined(CONFIG_FLATMEM)
5965 if (page_to_pfn(mem_map) != pgdat->node_start_pfn)
5967 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
5970 #endif /* CONFIG_FLAT_NODE_MEM_MAP */
5973 void __paginginit free_area_init_node(int nid, unsigned long *zones_size,
5974 unsigned long node_start_pfn, unsigned long *zholes_size)
5976 pg_data_t *pgdat = NODE_DATA(nid);
5977 unsigned long start_pfn = 0;
5978 unsigned long end_pfn = 0;
5980 /* pg_data_t should be reset to zero when it's allocated */
5981 WARN_ON(pgdat->nr_zones || pgdat->kswapd_classzone_idx);
5983 reset_deferred_meminit(pgdat);
5984 pgdat->node_id = nid;
5985 pgdat->node_start_pfn = node_start_pfn;
5986 pgdat->per_cpu_nodestats = NULL;
5987 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
5988 get_pfn_range_for_nid(nid, &start_pfn, &end_pfn);
5989 pr_info("Initmem setup node %d [mem %#018Lx-%#018Lx]\n", nid,
5990 (u64)start_pfn << PAGE_SHIFT,
5991 end_pfn ? ((u64)end_pfn << PAGE_SHIFT) - 1 : 0);
5993 start_pfn = node_start_pfn;
5995 calculate_node_totalpages(pgdat, start_pfn, end_pfn,
5996 zones_size, zholes_size);
5998 alloc_node_mem_map(pgdat);
5999 #ifdef CONFIG_FLAT_NODE_MEM_MAP
6000 printk(KERN_DEBUG "free_area_init_node: node %d, pgdat %08lx, node_mem_map %08lx\n",
6001 nid, (unsigned long)pgdat,
6002 (unsigned long)pgdat->node_mem_map);
6005 free_area_init_core(pgdat);
6008 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
6010 #if MAX_NUMNODES > 1
6012 * Figure out the number of possible node ids.
6014 void __init setup_nr_node_ids(void)
6016 unsigned int highest;
6018 highest = find_last_bit(node_possible_map.bits, MAX_NUMNODES);
6019 nr_node_ids = highest + 1;
6024 * node_map_pfn_alignment - determine the maximum internode alignment
6026 * This function should be called after node map is populated and sorted.
6027 * It calculates the maximum power of two alignment which can distinguish
6030 * For example, if all nodes are 1GiB and aligned to 1GiB, the return value
6031 * would indicate 1GiB alignment with (1 << (30 - PAGE_SHIFT)). If the
6032 * nodes are shifted by 256MiB, 256MiB. Note that if only the last node is
6033 * shifted, 1GiB is enough and this function will indicate so.
6035 * This is used to test whether pfn -> nid mapping of the chosen memory
6036 * model has fine enough granularity to avoid incorrect mapping for the
6037 * populated node map.
6039 * Returns the determined alignment in pfn's. 0 if there is no alignment
6040 * requirement (single node).
6042 unsigned long __init node_map_pfn_alignment(void)
6044 unsigned long accl_mask = 0, last_end = 0;
6045 unsigned long start, end, mask;
6049 for_each_mem_pfn_range(i, MAX_NUMNODES, &start, &end, &nid) {
6050 if (!start || last_nid < 0 || last_nid == nid) {
6057 * Start with a mask granular enough to pin-point to the
6058 * start pfn and tick off bits one-by-one until it becomes
6059 * too coarse to separate the current node from the last.
6061 mask = ~((1 << __ffs(start)) - 1);
6062 while (mask && last_end <= (start & (mask << 1)))
6065 /* accumulate all internode masks */
6069 /* convert mask to number of pages */
6070 return ~accl_mask + 1;
6073 /* Find the lowest pfn for a node */
6074 static unsigned long __init find_min_pfn_for_node(int nid)
6076 unsigned long min_pfn = ULONG_MAX;
6077 unsigned long start_pfn;
6080 for_each_mem_pfn_range(i, nid, &start_pfn, NULL, NULL)
6081 min_pfn = min(min_pfn, start_pfn);
6083 if (min_pfn == ULONG_MAX) {
6084 pr_warn("Could not find start_pfn for node %d\n", nid);
6092 * find_min_pfn_with_active_regions - Find the minimum PFN registered
6094 * It returns the minimum PFN based on information provided via
6095 * memblock_set_node().
6097 unsigned long __init find_min_pfn_with_active_regions(void)
6099 return find_min_pfn_for_node(MAX_NUMNODES);
6103 * early_calculate_totalpages()
6104 * Sum pages in active regions for movable zone.
6105 * Populate N_MEMORY for calculating usable_nodes.
6107 static unsigned long __init early_calculate_totalpages(void)
6109 unsigned long totalpages = 0;
6110 unsigned long start_pfn, end_pfn;
6113 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid) {
6114 unsigned long pages = end_pfn - start_pfn;
6116 totalpages += pages;
6118 node_set_state(nid, N_MEMORY);
6124 * Find the PFN the Movable zone begins in each node. Kernel memory
6125 * is spread evenly between nodes as long as the nodes have enough
6126 * memory. When they don't, some nodes will have more kernelcore than
6129 static void __init find_zone_movable_pfns_for_nodes(void)
6132 unsigned long usable_startpfn;
6133 unsigned long kernelcore_node, kernelcore_remaining;
6134 /* save the state before borrow the nodemask */
6135 nodemask_t saved_node_state = node_states[N_MEMORY];
6136 unsigned long totalpages = early_calculate_totalpages();
6137 int usable_nodes = nodes_weight(node_states[N_MEMORY]);
6138 struct memblock_region *r;
6140 /* Need to find movable_zone earlier when movable_node is specified. */
6141 find_usable_zone_for_movable();
6144 * If movable_node is specified, ignore kernelcore and movablecore
6147 if (movable_node_is_enabled()) {
6148 for_each_memblock(memory, r) {
6149 if (!memblock_is_hotpluggable(r))
6154 usable_startpfn = PFN_DOWN(r->base);
6155 zone_movable_pfn[nid] = zone_movable_pfn[nid] ?
6156 min(usable_startpfn, zone_movable_pfn[nid]) :
6164 * If kernelcore=mirror is specified, ignore movablecore option
6166 if (mirrored_kernelcore) {
6167 bool mem_below_4gb_not_mirrored = false;
6169 for_each_memblock(memory, r) {
6170 if (memblock_is_mirror(r))
6175 usable_startpfn = memblock_region_memory_base_pfn(r);
6177 if (usable_startpfn < 0x100000) {
6178 mem_below_4gb_not_mirrored = true;
6182 zone_movable_pfn[nid] = zone_movable_pfn[nid] ?
6183 min(usable_startpfn, zone_movable_pfn[nid]) :
6187 if (mem_below_4gb_not_mirrored)
6188 pr_warn("This configuration results in unmirrored kernel memory.");
6194 * If movablecore=nn[KMG] was specified, calculate what size of
6195 * kernelcore that corresponds so that memory usable for
6196 * any allocation type is evenly spread. If both kernelcore
6197 * and movablecore are specified, then the value of kernelcore
6198 * will be used for required_kernelcore if it's greater than
6199 * what movablecore would have allowed.
6201 if (required_movablecore) {
6202 unsigned long corepages;
6205 * Round-up so that ZONE_MOVABLE is at least as large as what
6206 * was requested by the user
6208 required_movablecore =
6209 roundup(required_movablecore, MAX_ORDER_NR_PAGES);
6210 required_movablecore = min(totalpages, required_movablecore);
6211 corepages = totalpages - required_movablecore;
6213 required_kernelcore = max(required_kernelcore, corepages);
6217 * If kernelcore was not specified or kernelcore size is larger
6218 * than totalpages, there is no ZONE_MOVABLE.
6220 if (!required_kernelcore || required_kernelcore >= totalpages)
6223 /* usable_startpfn is the lowest possible pfn ZONE_MOVABLE can be at */
6224 usable_startpfn = arch_zone_lowest_possible_pfn[movable_zone];
6227 /* Spread kernelcore memory as evenly as possible throughout nodes */
6228 kernelcore_node = required_kernelcore / usable_nodes;
6229 for_each_node_state(nid, N_MEMORY) {
6230 unsigned long start_pfn, end_pfn;
6233 * Recalculate kernelcore_node if the division per node
6234 * now exceeds what is necessary to satisfy the requested
6235 * amount of memory for the kernel
6237 if (required_kernelcore < kernelcore_node)
6238 kernelcore_node = required_kernelcore / usable_nodes;
6241 * As the map is walked, we track how much memory is usable
6242 * by the kernel using kernelcore_remaining. When it is
6243 * 0, the rest of the node is usable by ZONE_MOVABLE
6245 kernelcore_remaining = kernelcore_node;
6247 /* Go through each range of PFNs within this node */
6248 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
6249 unsigned long size_pages;
6251 start_pfn = max(start_pfn, zone_movable_pfn[nid]);
6252 if (start_pfn >= end_pfn)
6255 /* Account for what is only usable for kernelcore */
6256 if (start_pfn < usable_startpfn) {
6257 unsigned long kernel_pages;
6258 kernel_pages = min(end_pfn, usable_startpfn)
6261 kernelcore_remaining -= min(kernel_pages,
6262 kernelcore_remaining);
6263 required_kernelcore -= min(kernel_pages,
6264 required_kernelcore);
6266 /* Continue if range is now fully accounted */
6267 if (end_pfn <= usable_startpfn) {
6270 * Push zone_movable_pfn to the end so
6271 * that if we have to rebalance
6272 * kernelcore across nodes, we will
6273 * not double account here
6275 zone_movable_pfn[nid] = end_pfn;
6278 start_pfn = usable_startpfn;
6282 * The usable PFN range for ZONE_MOVABLE is from
6283 * start_pfn->end_pfn. Calculate size_pages as the
6284 * number of pages used as kernelcore
6286 size_pages = end_pfn - start_pfn;
6287 if (size_pages > kernelcore_remaining)
6288 size_pages = kernelcore_remaining;
6289 zone_movable_pfn[nid] = start_pfn + size_pages;
6292 * Some kernelcore has been met, update counts and
6293 * break if the kernelcore for this node has been
6296 required_kernelcore -= min(required_kernelcore,
6298 kernelcore_remaining -= size_pages;
6299 if (!kernelcore_remaining)
6305 * If there is still required_kernelcore, we do another pass with one
6306 * less node in the count. This will push zone_movable_pfn[nid] further
6307 * along on the nodes that still have memory until kernelcore is
6311 if (usable_nodes && required_kernelcore > usable_nodes)
6315 /* Align start of ZONE_MOVABLE on all nids to MAX_ORDER_NR_PAGES */
6316 for (nid = 0; nid < MAX_NUMNODES; nid++)
6317 zone_movable_pfn[nid] =
6318 roundup(zone_movable_pfn[nid], MAX_ORDER_NR_PAGES);
6321 /* restore the node_state */
6322 node_states[N_MEMORY] = saved_node_state;
6325 /* Any regular or high memory on that node ? */
6326 static void check_for_memory(pg_data_t *pgdat, int nid)
6328 enum zone_type zone_type;
6330 if (N_MEMORY == N_NORMAL_MEMORY)
6333 for (zone_type = 0; zone_type <= ZONE_MOVABLE - 1; zone_type++) {
6334 struct zone *zone = &pgdat->node_zones[zone_type];
6335 if (populated_zone(zone)) {
6336 node_set_state(nid, N_HIGH_MEMORY);
6337 if (N_NORMAL_MEMORY != N_HIGH_MEMORY &&
6338 zone_type <= ZONE_NORMAL)
6339 node_set_state(nid, N_NORMAL_MEMORY);
6346 * free_area_init_nodes - Initialise all pg_data_t and zone data
6347 * @max_zone_pfn: an array of max PFNs for each zone
6349 * This will call free_area_init_node() for each active node in the system.
6350 * Using the page ranges provided by memblock_set_node(), the size of each
6351 * zone in each node and their holes is calculated. If the maximum PFN
6352 * between two adjacent zones match, it is assumed that the zone is empty.
6353 * For example, if arch_max_dma_pfn == arch_max_dma32_pfn, it is assumed
6354 * that arch_max_dma32_pfn has no pages. It is also assumed that a zone
6355 * starts where the previous one ended. For example, ZONE_DMA32 starts
6356 * at arch_max_dma_pfn.
6358 void __init free_area_init_nodes(unsigned long *max_zone_pfn)
6360 unsigned long start_pfn, end_pfn;
6363 /* Record where the zone boundaries are */
6364 memset(arch_zone_lowest_possible_pfn, 0,
6365 sizeof(arch_zone_lowest_possible_pfn));
6366 memset(arch_zone_highest_possible_pfn, 0,
6367 sizeof(arch_zone_highest_possible_pfn));
6369 start_pfn = find_min_pfn_with_active_regions();
6371 for (i = 0; i < MAX_NR_ZONES; i++) {
6372 if (i == ZONE_MOVABLE)
6375 end_pfn = max(max_zone_pfn[i], start_pfn);
6376 arch_zone_lowest_possible_pfn[i] = start_pfn;
6377 arch_zone_highest_possible_pfn[i] = end_pfn;
6379 start_pfn = end_pfn;
6381 arch_zone_lowest_possible_pfn[ZONE_MOVABLE] = 0;
6382 arch_zone_highest_possible_pfn[ZONE_MOVABLE] = 0;
6384 /* Find the PFNs that ZONE_MOVABLE begins at in each node */
6385 memset(zone_movable_pfn, 0, sizeof(zone_movable_pfn));
6386 find_zone_movable_pfns_for_nodes();
6388 /* Print out the zone ranges */
6389 pr_info("Zone ranges:\n");
6390 for (i = 0; i < MAX_NR_ZONES; i++) {
6391 if (i == ZONE_MOVABLE)
6393 pr_info(" %-8s ", zone_names[i]);
6394 if (arch_zone_lowest_possible_pfn[i] ==
6395 arch_zone_highest_possible_pfn[i])
6398 pr_cont("[mem %#018Lx-%#018Lx]\n",
6399 (u64)arch_zone_lowest_possible_pfn[i]
6401 ((u64)arch_zone_highest_possible_pfn[i]
6402 << PAGE_SHIFT) - 1);
6405 /* Print out the PFNs ZONE_MOVABLE begins at in each node */
6406 pr_info("Movable zone start for each node\n");
6407 for (i = 0; i < MAX_NUMNODES; i++) {
6408 if (zone_movable_pfn[i])
6409 pr_info(" Node %d: %#018Lx\n", i,
6410 (u64)zone_movable_pfn[i] << PAGE_SHIFT);
6413 /* Print out the early node map */
6414 pr_info("Early memory node ranges\n");
6415 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid)
6416 pr_info(" node %3d: [mem %#018Lx-%#018Lx]\n", nid,
6417 (u64)start_pfn << PAGE_SHIFT,
6418 ((u64)end_pfn << PAGE_SHIFT) - 1);
6420 /* Initialise every node */
6421 mminit_verify_pageflags_layout();
6422 setup_nr_node_ids();
6423 for_each_online_node(nid) {
6424 pg_data_t *pgdat = NODE_DATA(nid);
6425 free_area_init_node(nid, NULL,
6426 find_min_pfn_for_node(nid), NULL);
6428 /* Any memory on that node */
6429 if (pgdat->node_present_pages)
6430 node_set_state(nid, N_MEMORY);
6431 check_for_memory(pgdat, nid);
6435 static int __init cmdline_parse_core(char *p, unsigned long *core)
6437 unsigned long long coremem;
6441 coremem = memparse(p, &p);
6442 *core = coremem >> PAGE_SHIFT;
6444 /* Paranoid check that UL is enough for the coremem value */
6445 WARN_ON((coremem >> PAGE_SHIFT) > ULONG_MAX);
6451 * kernelcore=size sets the amount of memory for use for allocations that
6452 * cannot be reclaimed or migrated.
6454 static int __init cmdline_parse_kernelcore(char *p)
6456 /* parse kernelcore=mirror */
6457 if (parse_option_str(p, "mirror")) {
6458 mirrored_kernelcore = true;
6462 return cmdline_parse_core(p, &required_kernelcore);
6466 * movablecore=size sets the amount of memory for use for allocations that
6467 * can be reclaimed or migrated.
6469 static int __init cmdline_parse_movablecore(char *p)
6471 return cmdline_parse_core(p, &required_movablecore);
6474 early_param("kernelcore", cmdline_parse_kernelcore);
6475 early_param("movablecore", cmdline_parse_movablecore);
6477 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
6479 void adjust_managed_page_count(struct page *page, long count)
6481 spin_lock(&managed_page_count_lock);
6482 page_zone(page)->managed_pages += count;
6483 totalram_pages += count;
6484 #ifdef CONFIG_HIGHMEM
6485 if (PageHighMem(page))
6486 totalhigh_pages += count;
6488 spin_unlock(&managed_page_count_lock);
6490 EXPORT_SYMBOL(adjust_managed_page_count);
6492 unsigned long free_reserved_area(void *start, void *end, int poison, char *s)
6495 unsigned long pages = 0;
6497 start = (void *)PAGE_ALIGN((unsigned long)start);
6498 end = (void *)((unsigned long)end & PAGE_MASK);
6499 for (pos = start; pos < end; pos += PAGE_SIZE, pages++) {
6500 if ((unsigned int)poison <= 0xFF)
6501 memset(pos, poison, PAGE_SIZE);
6502 free_reserved_page(virt_to_page(pos));
6506 pr_info("Freeing %s memory: %ldK\n",
6507 s, pages << (PAGE_SHIFT - 10));
6511 EXPORT_SYMBOL(free_reserved_area);
6513 #ifdef CONFIG_HIGHMEM
6514 void free_highmem_page(struct page *page)
6516 __free_reserved_page(page);
6518 page_zone(page)->managed_pages++;
6524 void __init mem_init_print_info(const char *str)
6526 unsigned long physpages, codesize, datasize, rosize, bss_size;
6527 unsigned long init_code_size, init_data_size;
6529 physpages = get_num_physpages();
6530 codesize = _etext - _stext;
6531 datasize = _edata - _sdata;
6532 rosize = __end_rodata - __start_rodata;
6533 bss_size = __bss_stop - __bss_start;
6534 init_data_size = __init_end - __init_begin;
6535 init_code_size = _einittext - _sinittext;
6538 * Detect special cases and adjust section sizes accordingly:
6539 * 1) .init.* may be embedded into .data sections
6540 * 2) .init.text.* may be out of [__init_begin, __init_end],
6541 * please refer to arch/tile/kernel/vmlinux.lds.S.
6542 * 3) .rodata.* may be embedded into .text or .data sections.
6544 #define adj_init_size(start, end, size, pos, adj) \
6546 if (start <= pos && pos < end && size > adj) \
6550 adj_init_size(__init_begin, __init_end, init_data_size,
6551 _sinittext, init_code_size);
6552 adj_init_size(_stext, _etext, codesize, _sinittext, init_code_size);
6553 adj_init_size(_sdata, _edata, datasize, __init_begin, init_data_size);
6554 adj_init_size(_stext, _etext, codesize, __start_rodata, rosize);
6555 adj_init_size(_sdata, _edata, datasize, __start_rodata, rosize);
6557 #undef adj_init_size
6559 pr_info("Memory: %luK/%luK available (%luK kernel code, %luK rwdata, %luK rodata, %luK init, %luK bss, %luK reserved, %luK cma-reserved"
6560 #ifdef CONFIG_HIGHMEM
6564 nr_free_pages() << (PAGE_SHIFT - 10),
6565 physpages << (PAGE_SHIFT - 10),
6566 codesize >> 10, datasize >> 10, rosize >> 10,
6567 (init_data_size + init_code_size) >> 10, bss_size >> 10,
6568 (physpages - totalram_pages - totalcma_pages) << (PAGE_SHIFT - 10),
6569 totalcma_pages << (PAGE_SHIFT - 10),
6570 #ifdef CONFIG_HIGHMEM
6571 totalhigh_pages << (PAGE_SHIFT - 10),
6573 str ? ", " : "", str ? str : "");
6577 * set_dma_reserve - set the specified number of pages reserved in the first zone
6578 * @new_dma_reserve: The number of pages to mark reserved
6580 * The per-cpu batchsize and zone watermarks are determined by managed_pages.
6581 * In the DMA zone, a significant percentage may be consumed by kernel image
6582 * and other unfreeable allocations which can skew the watermarks badly. This
6583 * function may optionally be used to account for unfreeable pages in the
6584 * first zone (e.g., ZONE_DMA). The effect will be lower watermarks and
6585 * smaller per-cpu batchsize.
6587 void __init set_dma_reserve(unsigned long new_dma_reserve)
6589 dma_reserve = new_dma_reserve;
6592 void __init free_area_init(unsigned long *zones_size)
6594 free_area_init_node(0, zones_size,
6595 __pa(PAGE_OFFSET) >> PAGE_SHIFT, NULL);
6598 static int page_alloc_cpu_dead(unsigned int cpu)
6601 lru_add_drain_cpu(cpu);
6605 * Spill the event counters of the dead processor
6606 * into the current processors event counters.
6607 * This artificially elevates the count of the current
6610 vm_events_fold_cpu(cpu);
6613 * Zero the differential counters of the dead processor
6614 * so that the vm statistics are consistent.
6616 * This is only okay since the processor is dead and cannot
6617 * race with what we are doing.
6619 cpu_vm_stats_fold(cpu);
6623 void __init page_alloc_init(void)
6627 ret = cpuhp_setup_state_nocalls(CPUHP_PAGE_ALLOC_DEAD,
6628 "mm/page_alloc:dead", NULL,
6629 page_alloc_cpu_dead);
6634 * calculate_totalreserve_pages - called when sysctl_lowmem_reserve_ratio
6635 * or min_free_kbytes changes.
6637 static void calculate_totalreserve_pages(void)
6639 struct pglist_data *pgdat;
6640 unsigned long reserve_pages = 0;
6641 enum zone_type i, j;
6643 for_each_online_pgdat(pgdat) {
6645 pgdat->totalreserve_pages = 0;
6647 for (i = 0; i < MAX_NR_ZONES; i++) {
6648 struct zone *zone = pgdat->node_zones + i;
6651 /* Find valid and maximum lowmem_reserve in the zone */
6652 for (j = i; j < MAX_NR_ZONES; j++) {
6653 if (zone->lowmem_reserve[j] > max)
6654 max = zone->lowmem_reserve[j];
6657 /* we treat the high watermark as reserved pages. */
6658 max += high_wmark_pages(zone);
6660 if (max > zone->managed_pages)
6661 max = zone->managed_pages;
6663 pgdat->totalreserve_pages += max;
6665 reserve_pages += max;
6668 totalreserve_pages = reserve_pages;
6672 * setup_per_zone_lowmem_reserve - called whenever
6673 * sysctl_lowmem_reserve_ratio changes. Ensures that each zone
6674 * has a correct pages reserved value, so an adequate number of
6675 * pages are left in the zone after a successful __alloc_pages().
6677 static void setup_per_zone_lowmem_reserve(void)
6679 struct pglist_data *pgdat;
6680 enum zone_type j, idx;
6682 for_each_online_pgdat(pgdat) {
6683 for (j = 0; j < MAX_NR_ZONES; j++) {
6684 struct zone *zone = pgdat->node_zones + j;
6685 unsigned long managed_pages = zone->managed_pages;
6687 zone->lowmem_reserve[j] = 0;
6691 struct zone *lower_zone;
6695 if (sysctl_lowmem_reserve_ratio[idx] < 1)
6696 sysctl_lowmem_reserve_ratio[idx] = 1;
6698 lower_zone = pgdat->node_zones + idx;
6699 lower_zone->lowmem_reserve[j] = managed_pages /
6700 sysctl_lowmem_reserve_ratio[idx];
6701 managed_pages += lower_zone->managed_pages;
6706 /* update totalreserve_pages */
6707 calculate_totalreserve_pages();
6710 static void __setup_per_zone_wmarks(void)
6712 unsigned long pages_min = min_free_kbytes >> (PAGE_SHIFT - 10);
6713 unsigned long lowmem_pages = 0;
6715 unsigned long flags;
6717 /* Calculate total number of !ZONE_HIGHMEM pages */
6718 for_each_zone(zone) {
6719 if (!is_highmem(zone))
6720 lowmem_pages += zone->managed_pages;
6723 for_each_zone(zone) {
6726 spin_lock_irqsave(&zone->lock, flags);
6727 tmp = (u64)pages_min * zone->managed_pages;
6728 do_div(tmp, lowmem_pages);
6729 if (is_highmem(zone)) {
6731 * __GFP_HIGH and PF_MEMALLOC allocations usually don't
6732 * need highmem pages, so cap pages_min to a small
6735 * The WMARK_HIGH-WMARK_LOW and (WMARK_LOW-WMARK_MIN)
6736 * deltas control asynch page reclaim, and so should
6737 * not be capped for highmem.
6739 unsigned long min_pages;
6741 min_pages = zone->managed_pages / 1024;
6742 min_pages = clamp(min_pages, SWAP_CLUSTER_MAX, 128UL);
6743 zone->watermark[WMARK_MIN] = min_pages;
6746 * If it's a lowmem zone, reserve a number of pages
6747 * proportionate to the zone's size.
6749 zone->watermark[WMARK_MIN] = tmp;
6753 * Set the kswapd watermarks distance according to the
6754 * scale factor in proportion to available memory, but
6755 * ensure a minimum size on small systems.
6757 tmp = max_t(u64, tmp >> 2,
6758 mult_frac(zone->managed_pages,
6759 watermark_scale_factor, 10000));
6761 zone->watermark[WMARK_LOW] = min_wmark_pages(zone) + tmp;
6762 zone->watermark[WMARK_HIGH] = min_wmark_pages(zone) + tmp * 2;
6764 spin_unlock_irqrestore(&zone->lock, flags);
6767 /* update totalreserve_pages */
6768 calculate_totalreserve_pages();
6772 * setup_per_zone_wmarks - called when min_free_kbytes changes
6773 * or when memory is hot-{added|removed}
6775 * Ensures that the watermark[min,low,high] values for each zone are set
6776 * correctly with respect to min_free_kbytes.
6778 void setup_per_zone_wmarks(void)
6780 mutex_lock(&zonelists_mutex);
6781 __setup_per_zone_wmarks();
6782 mutex_unlock(&zonelists_mutex);
6786 * Initialise min_free_kbytes.
6788 * For small machines we want it small (128k min). For large machines
6789 * we want it large (64MB max). But it is not linear, because network
6790 * bandwidth does not increase linearly with machine size. We use
6792 * min_free_kbytes = 4 * sqrt(lowmem_kbytes), for better accuracy:
6793 * min_free_kbytes = sqrt(lowmem_kbytes * 16)
6809 int __meminit init_per_zone_wmark_min(void)
6811 unsigned long lowmem_kbytes;
6812 int new_min_free_kbytes;
6814 lowmem_kbytes = nr_free_buffer_pages() * (PAGE_SIZE >> 10);
6815 new_min_free_kbytes = int_sqrt(lowmem_kbytes * 16);
6817 if (new_min_free_kbytes > user_min_free_kbytes) {
6818 min_free_kbytes = new_min_free_kbytes;
6819 if (min_free_kbytes < 128)
6820 min_free_kbytes = 128;
6821 if (min_free_kbytes > 65536)
6822 min_free_kbytes = 65536;
6824 pr_warn("min_free_kbytes is not updated to %d because user defined value %d is preferred\n",
6825 new_min_free_kbytes, user_min_free_kbytes);
6827 setup_per_zone_wmarks();
6828 refresh_zone_stat_thresholds();
6829 setup_per_zone_lowmem_reserve();
6832 setup_min_unmapped_ratio();
6833 setup_min_slab_ratio();
6838 core_initcall(init_per_zone_wmark_min)
6841 * min_free_kbytes_sysctl_handler - just a wrapper around proc_dointvec() so
6842 * that we can call two helper functions whenever min_free_kbytes
6845 int min_free_kbytes_sysctl_handler(struct ctl_table *table, int write,
6846 void __user *buffer, size_t *length, loff_t *ppos)
6850 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
6855 user_min_free_kbytes = min_free_kbytes;
6856 setup_per_zone_wmarks();
6861 int watermark_scale_factor_sysctl_handler(struct ctl_table *table, int write,
6862 void __user *buffer, size_t *length, loff_t *ppos)
6866 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
6871 setup_per_zone_wmarks();
6877 static void setup_min_unmapped_ratio(void)
6882 for_each_online_pgdat(pgdat)
6883 pgdat->min_unmapped_pages = 0;
6886 zone->zone_pgdat->min_unmapped_pages += (zone->managed_pages *
6887 sysctl_min_unmapped_ratio) / 100;
6891 int sysctl_min_unmapped_ratio_sysctl_handler(struct ctl_table *table, int write,
6892 void __user *buffer, size_t *length, loff_t *ppos)
6896 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
6900 setup_min_unmapped_ratio();
6905 static void setup_min_slab_ratio(void)
6910 for_each_online_pgdat(pgdat)
6911 pgdat->min_slab_pages = 0;
6914 zone->zone_pgdat->min_slab_pages += (zone->managed_pages *
6915 sysctl_min_slab_ratio) / 100;
6918 int sysctl_min_slab_ratio_sysctl_handler(struct ctl_table *table, int write,
6919 void __user *buffer, size_t *length, loff_t *ppos)
6923 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
6927 setup_min_slab_ratio();
6934 * lowmem_reserve_ratio_sysctl_handler - just a wrapper around
6935 * proc_dointvec() so that we can call setup_per_zone_lowmem_reserve()
6936 * whenever sysctl_lowmem_reserve_ratio changes.
6938 * The reserve ratio obviously has absolutely no relation with the
6939 * minimum watermarks. The lowmem reserve ratio can only make sense
6940 * if in function of the boot time zone sizes.
6942 int lowmem_reserve_ratio_sysctl_handler(struct ctl_table *table, int write,
6943 void __user *buffer, size_t *length, loff_t *ppos)
6945 proc_dointvec_minmax(table, write, buffer, length, ppos);
6946 setup_per_zone_lowmem_reserve();
6951 * percpu_pagelist_fraction - changes the pcp->high for each zone on each
6952 * cpu. It is the fraction of total pages in each zone that a hot per cpu
6953 * pagelist can have before it gets flushed back to buddy allocator.
6955 int percpu_pagelist_fraction_sysctl_handler(struct ctl_table *table, int write,
6956 void __user *buffer, size_t *length, loff_t *ppos)
6959 int old_percpu_pagelist_fraction;
6962 mutex_lock(&pcp_batch_high_lock);
6963 old_percpu_pagelist_fraction = percpu_pagelist_fraction;
6965 ret = proc_dointvec_minmax(table, write, buffer, length, ppos);
6966 if (!write || ret < 0)
6969 /* Sanity checking to avoid pcp imbalance */
6970 if (percpu_pagelist_fraction &&
6971 percpu_pagelist_fraction < MIN_PERCPU_PAGELIST_FRACTION) {
6972 percpu_pagelist_fraction = old_percpu_pagelist_fraction;
6978 if (percpu_pagelist_fraction == old_percpu_pagelist_fraction)
6981 for_each_populated_zone(zone) {
6984 for_each_possible_cpu(cpu)
6985 pageset_set_high_and_batch(zone,
6986 per_cpu_ptr(zone->pageset, cpu));
6989 mutex_unlock(&pcp_batch_high_lock);
6994 int hashdist = HASHDIST_DEFAULT;
6996 static int __init set_hashdist(char *str)
7000 hashdist = simple_strtoul(str, &str, 0);
7003 __setup("hashdist=", set_hashdist);
7006 #ifndef __HAVE_ARCH_RESERVED_KERNEL_PAGES
7008 * Returns the number of pages that arch has reserved but
7009 * is not known to alloc_large_system_hash().
7011 static unsigned long __init arch_reserved_kernel_pages(void)
7018 * allocate a large system hash table from bootmem
7019 * - it is assumed that the hash table must contain an exact power-of-2
7020 * quantity of entries
7021 * - limit is the number of hash buckets, not the total allocation size
7023 void *__init alloc_large_system_hash(const char *tablename,
7024 unsigned long bucketsize,
7025 unsigned long numentries,
7028 unsigned int *_hash_shift,
7029 unsigned int *_hash_mask,
7030 unsigned long low_limit,
7031 unsigned long high_limit)
7033 unsigned long long max = high_limit;
7034 unsigned long log2qty, size;
7037 /* allow the kernel cmdline to have a say */
7039 /* round applicable memory size up to nearest megabyte */
7040 numentries = nr_kernel_pages;
7041 numentries -= arch_reserved_kernel_pages();
7043 /* It isn't necessary when PAGE_SIZE >= 1MB */
7044 if (PAGE_SHIFT < 20)
7045 numentries = round_up(numentries, (1<<20)/PAGE_SIZE);
7047 /* limit to 1 bucket per 2^scale bytes of low memory */
7048 if (scale > PAGE_SHIFT)
7049 numentries >>= (scale - PAGE_SHIFT);
7051 numentries <<= (PAGE_SHIFT - scale);
7053 /* Make sure we've got at least a 0-order allocation.. */
7054 if (unlikely(flags & HASH_SMALL)) {
7055 /* Makes no sense without HASH_EARLY */
7056 WARN_ON(!(flags & HASH_EARLY));
7057 if (!(numentries >> *_hash_shift)) {
7058 numentries = 1UL << *_hash_shift;
7059 BUG_ON(!numentries);
7061 } else if (unlikely((numentries * bucketsize) < PAGE_SIZE))
7062 numentries = PAGE_SIZE / bucketsize;
7064 numentries = roundup_pow_of_two(numentries);
7066 /* limit allocation size to 1/16 total memory by default */
7068 max = ((unsigned long long)nr_all_pages << PAGE_SHIFT) >> 4;
7069 do_div(max, bucketsize);
7071 max = min(max, 0x80000000ULL);
7073 if (numentries < low_limit)
7074 numentries = low_limit;
7075 if (numentries > max)
7078 log2qty = ilog2(numentries);
7081 size = bucketsize << log2qty;
7082 if (flags & HASH_EARLY)
7083 table = memblock_virt_alloc_nopanic(size, 0);
7085 table = __vmalloc(size, GFP_ATOMIC, PAGE_KERNEL);
7088 * If bucketsize is not a power-of-two, we may free
7089 * some pages at the end of hash table which
7090 * alloc_pages_exact() automatically does
7092 if (get_order(size) < MAX_ORDER) {
7093 table = alloc_pages_exact(size, GFP_ATOMIC);
7094 kmemleak_alloc(table, size, 1, GFP_ATOMIC);
7097 } while (!table && size > PAGE_SIZE && --log2qty);
7100 panic("Failed to allocate %s hash table\n", tablename);
7102 pr_info("%s hash table entries: %ld (order: %d, %lu bytes)\n",
7103 tablename, 1UL << log2qty, ilog2(size) - PAGE_SHIFT, size);
7106 *_hash_shift = log2qty;
7108 *_hash_mask = (1 << log2qty) - 1;
7114 * This function checks whether pageblock includes unmovable pages or not.
7115 * If @count is not zero, it is okay to include less @count unmovable pages
7117 * PageLRU check without isolation or lru_lock could race so that
7118 * MIGRATE_MOVABLE block might include unmovable pages. It means you can't
7119 * expect this function should be exact.
7121 bool has_unmovable_pages(struct zone *zone, struct page *page, int count,
7122 bool skip_hwpoisoned_pages)
7124 unsigned long pfn, iter, found;
7128 * For avoiding noise data, lru_add_drain_all() should be called
7129 * If ZONE_MOVABLE, the zone never contains unmovable pages
7131 if (zone_idx(zone) == ZONE_MOVABLE)
7133 mt = get_pageblock_migratetype(page);
7134 if (mt == MIGRATE_MOVABLE || is_migrate_cma(mt))
7137 pfn = page_to_pfn(page);
7138 for (found = 0, iter = 0; iter < pageblock_nr_pages; iter++) {
7139 unsigned long check = pfn + iter;
7141 if (!pfn_valid_within(check))
7144 page = pfn_to_page(check);
7147 * Hugepages are not in LRU lists, but they're movable.
7148 * We need not scan over tail pages bacause we don't
7149 * handle each tail page individually in migration.
7151 if (PageHuge(page)) {
7152 iter = round_up(iter + 1, 1<<compound_order(page)) - 1;
7157 * We can't use page_count without pin a page
7158 * because another CPU can free compound page.
7159 * This check already skips compound tails of THP
7160 * because their page->_refcount is zero at all time.
7162 if (!page_ref_count(page)) {
7163 if (PageBuddy(page))
7164 iter += (1 << page_order(page)) - 1;
7169 * The HWPoisoned page may be not in buddy system, and
7170 * page_count() is not 0.
7172 if (skip_hwpoisoned_pages && PageHWPoison(page))
7178 * If there are RECLAIMABLE pages, we need to check
7179 * it. But now, memory offline itself doesn't call
7180 * shrink_node_slabs() and it still to be fixed.
7183 * If the page is not RAM, page_count()should be 0.
7184 * we don't need more check. This is an _used_ not-movable page.
7186 * The problematic thing here is PG_reserved pages. PG_reserved
7187 * is set to both of a memory hole page and a _used_ kernel
7196 bool is_pageblock_removable_nolock(struct page *page)
7202 * We have to be careful here because we are iterating over memory
7203 * sections which are not zone aware so we might end up outside of
7204 * the zone but still within the section.
7205 * We have to take care about the node as well. If the node is offline
7206 * its NODE_DATA will be NULL - see page_zone.
7208 if (!node_online(page_to_nid(page)))
7211 zone = page_zone(page);
7212 pfn = page_to_pfn(page);
7213 if (!zone_spans_pfn(zone, pfn))
7216 return !has_unmovable_pages(zone, page, 0, true);
7219 #if (defined(CONFIG_MEMORY_ISOLATION) && defined(CONFIG_COMPACTION)) || defined(CONFIG_CMA)
7221 static unsigned long pfn_max_align_down(unsigned long pfn)
7223 return pfn & ~(max_t(unsigned long, MAX_ORDER_NR_PAGES,
7224 pageblock_nr_pages) - 1);
7227 static unsigned long pfn_max_align_up(unsigned long pfn)
7229 return ALIGN(pfn, max_t(unsigned long, MAX_ORDER_NR_PAGES,
7230 pageblock_nr_pages));
7233 /* [start, end) must belong to a single zone. */
7234 static int __alloc_contig_migrate_range(struct compact_control *cc,
7235 unsigned long start, unsigned long end)
7237 /* This function is based on compact_zone() from compaction.c. */
7238 unsigned long nr_reclaimed;
7239 unsigned long pfn = start;
7240 unsigned int tries = 0;
7245 while (pfn < end || !list_empty(&cc->migratepages)) {
7246 if (fatal_signal_pending(current)) {
7251 if (list_empty(&cc->migratepages)) {
7252 cc->nr_migratepages = 0;
7253 pfn = isolate_migratepages_range(cc, pfn, end);
7259 } else if (++tries == 5) {
7260 ret = ret < 0 ? ret : -EBUSY;
7264 nr_reclaimed = reclaim_clean_pages_from_list(cc->zone,
7266 cc->nr_migratepages -= nr_reclaimed;
7268 ret = migrate_pages(&cc->migratepages, alloc_migrate_target,
7269 NULL, 0, cc->mode, MR_CMA);
7272 putback_movable_pages(&cc->migratepages);
7279 * alloc_contig_range() -- tries to allocate given range of pages
7280 * @start: start PFN to allocate
7281 * @end: one-past-the-last PFN to allocate
7282 * @migratetype: migratetype of the underlaying pageblocks (either
7283 * #MIGRATE_MOVABLE or #MIGRATE_CMA). All pageblocks
7284 * in range must have the same migratetype and it must
7285 * be either of the two.
7287 * The PFN range does not have to be pageblock or MAX_ORDER_NR_PAGES
7288 * aligned, however it's the caller's responsibility to guarantee that
7289 * we are the only thread that changes migrate type of pageblocks the
7292 * The PFN range must belong to a single zone.
7294 * Returns zero on success or negative error code. On success all
7295 * pages which PFN is in [start, end) are allocated for the caller and
7296 * need to be freed with free_contig_range().
7298 int alloc_contig_range(unsigned long start, unsigned long end,
7299 unsigned migratetype)
7301 unsigned long outer_start, outer_end;
7305 struct compact_control cc = {
7306 .nr_migratepages = 0,
7308 .zone = page_zone(pfn_to_page(start)),
7309 .mode = MIGRATE_SYNC,
7310 .ignore_skip_hint = true,
7311 .gfp_mask = GFP_KERNEL,
7313 INIT_LIST_HEAD(&cc.migratepages);
7316 * What we do here is we mark all pageblocks in range as
7317 * MIGRATE_ISOLATE. Because pageblock and max order pages may
7318 * have different sizes, and due to the way page allocator
7319 * work, we align the range to biggest of the two pages so
7320 * that page allocator won't try to merge buddies from
7321 * different pageblocks and change MIGRATE_ISOLATE to some
7322 * other migration type.
7324 * Once the pageblocks are marked as MIGRATE_ISOLATE, we
7325 * migrate the pages from an unaligned range (ie. pages that
7326 * we are interested in). This will put all the pages in
7327 * range back to page allocator as MIGRATE_ISOLATE.
7329 * When this is done, we take the pages in range from page
7330 * allocator removing them from the buddy system. This way
7331 * page allocator will never consider using them.
7333 * This lets us mark the pageblocks back as
7334 * MIGRATE_CMA/MIGRATE_MOVABLE so that free pages in the
7335 * aligned range but not in the unaligned, original range are
7336 * put back to page allocator so that buddy can use them.
7339 ret = start_isolate_page_range(pfn_max_align_down(start),
7340 pfn_max_align_up(end), migratetype,
7346 * In case of -EBUSY, we'd like to know which page causes problem.
7347 * So, just fall through. We will check it in test_pages_isolated().
7349 ret = __alloc_contig_migrate_range(&cc, start, end);
7350 if (ret && ret != -EBUSY)
7354 * Pages from [start, end) are within a MAX_ORDER_NR_PAGES
7355 * aligned blocks that are marked as MIGRATE_ISOLATE. What's
7356 * more, all pages in [start, end) are free in page allocator.
7357 * What we are going to do is to allocate all pages from
7358 * [start, end) (that is remove them from page allocator).
7360 * The only problem is that pages at the beginning and at the
7361 * end of interesting range may be not aligned with pages that
7362 * page allocator holds, ie. they can be part of higher order
7363 * pages. Because of this, we reserve the bigger range and
7364 * once this is done free the pages we are not interested in.
7366 * We don't have to hold zone->lock here because the pages are
7367 * isolated thus they won't get removed from buddy.
7370 lru_add_drain_all();
7371 drain_all_pages(cc.zone);
7374 outer_start = start;
7375 while (!PageBuddy(pfn_to_page(outer_start))) {
7376 if (++order >= MAX_ORDER) {
7377 outer_start = start;
7380 outer_start &= ~0UL << order;
7383 if (outer_start != start) {
7384 order = page_order(pfn_to_page(outer_start));
7387 * outer_start page could be small order buddy page and
7388 * it doesn't include start page. Adjust outer_start
7389 * in this case to report failed page properly
7390 * on tracepoint in test_pages_isolated()
7392 if (outer_start + (1UL << order) <= start)
7393 outer_start = start;
7396 /* Make sure the range is really isolated. */
7397 if (test_pages_isolated(outer_start, end, false)) {
7398 pr_info("%s: [%lx, %lx) PFNs busy\n",
7399 __func__, outer_start, end);
7404 /* Grab isolated pages from freelists. */
7405 outer_end = isolate_freepages_range(&cc, outer_start, end);
7411 /* Free head and tail (if any) */
7412 if (start != outer_start)
7413 free_contig_range(outer_start, start - outer_start);
7414 if (end != outer_end)
7415 free_contig_range(end, outer_end - end);
7418 undo_isolate_page_range(pfn_max_align_down(start),
7419 pfn_max_align_up(end), migratetype);
7423 void free_contig_range(unsigned long pfn, unsigned nr_pages)
7425 unsigned int count = 0;
7427 for (; nr_pages--; pfn++) {
7428 struct page *page = pfn_to_page(pfn);
7430 count += page_count(page) != 1;
7433 WARN(count != 0, "%d pages are still in use!\n", count);
7437 #ifdef CONFIG_MEMORY_HOTPLUG
7439 * The zone indicated has a new number of managed_pages; batch sizes and percpu
7440 * page high values need to be recalulated.
7442 void __meminit zone_pcp_update(struct zone *zone)
7445 mutex_lock(&pcp_batch_high_lock);
7446 for_each_possible_cpu(cpu)
7447 pageset_set_high_and_batch(zone,
7448 per_cpu_ptr(zone->pageset, cpu));
7449 mutex_unlock(&pcp_batch_high_lock);
7453 void zone_pcp_reset(struct zone *zone)
7455 unsigned long flags;
7457 struct per_cpu_pageset *pset;
7459 /* avoid races with drain_pages() */
7460 local_irq_save(flags);
7461 if (zone->pageset != &boot_pageset) {
7462 for_each_online_cpu(cpu) {
7463 pset = per_cpu_ptr(zone->pageset, cpu);
7464 drain_zonestat(zone, pset);
7466 free_percpu(zone->pageset);
7467 zone->pageset = &boot_pageset;
7469 local_irq_restore(flags);
7472 #ifdef CONFIG_MEMORY_HOTREMOVE
7474 * All pages in the range must be in a single zone and isolated
7475 * before calling this.
7478 __offline_isolated_pages(unsigned long start_pfn, unsigned long end_pfn)
7482 unsigned int order, i;
7484 unsigned long flags;
7485 /* find the first valid pfn */
7486 for (pfn = start_pfn; pfn < end_pfn; pfn++)
7491 zone = page_zone(pfn_to_page(pfn));
7492 spin_lock_irqsave(&zone->lock, flags);
7494 while (pfn < end_pfn) {
7495 if (!pfn_valid(pfn)) {
7499 page = pfn_to_page(pfn);
7501 * The HWPoisoned page may be not in buddy system, and
7502 * page_count() is not 0.
7504 if (unlikely(!PageBuddy(page) && PageHWPoison(page))) {
7506 SetPageReserved(page);
7510 BUG_ON(page_count(page));
7511 BUG_ON(!PageBuddy(page));
7512 order = page_order(page);
7513 #ifdef CONFIG_DEBUG_VM
7514 pr_info("remove from free list %lx %d %lx\n",
7515 pfn, 1 << order, end_pfn);
7517 list_del(&page->lru);
7518 rmv_page_order(page);
7519 zone->free_area[order].nr_free--;
7520 for (i = 0; i < (1 << order); i++)
7521 SetPageReserved((page+i));
7522 pfn += (1 << order);
7524 spin_unlock_irqrestore(&zone->lock, flags);
7528 bool is_free_buddy_page(struct page *page)
7530 struct zone *zone = page_zone(page);
7531 unsigned long pfn = page_to_pfn(page);
7532 unsigned long flags;
7535 spin_lock_irqsave(&zone->lock, flags);
7536 for (order = 0; order < MAX_ORDER; order++) {
7537 struct page *page_head = page - (pfn & ((1 << order) - 1));
7539 if (PageBuddy(page_head) && page_order(page_head) >= order)
7542 spin_unlock_irqrestore(&zone->lock, flags);
7544 return order < MAX_ORDER;