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 <linux/prefetch.h>
59 #include <linux/mm_inline.h>
60 #include <linux/migrate.h>
61 #include <linux/page_ext.h>
62 #include <linux/hugetlb.h>
63 #include <linux/sched/rt.h>
64 #include <linux/page_owner.h>
65 #include <linux/kthread.h>
67 #include <asm/sections.h>
68 #include <asm/tlbflush.h>
69 #include <asm/div64.h>
72 /* prevent >1 _updater_ of zone percpu pageset ->high and ->batch fields */
73 static DEFINE_MUTEX(pcp_batch_high_lock);
74 #define MIN_PERCPU_PAGELIST_FRACTION (8)
76 #ifdef CONFIG_USE_PERCPU_NUMA_NODE_ID
77 DEFINE_PER_CPU(int, numa_node);
78 EXPORT_PER_CPU_SYMBOL(numa_node);
81 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
83 * N.B., Do NOT reference the '_numa_mem_' per cpu variable directly.
84 * It will not be defined when CONFIG_HAVE_MEMORYLESS_NODES is not defined.
85 * Use the accessor functions set_numa_mem(), numa_mem_id() and cpu_to_mem()
86 * defined in <linux/topology.h>.
88 DEFINE_PER_CPU(int, _numa_mem_); /* Kernel "local memory" node */
89 EXPORT_PER_CPU_SYMBOL(_numa_mem_);
90 int _node_numa_mem_[MAX_NUMNODES];
94 * Array of node states.
96 nodemask_t node_states[NR_NODE_STATES] __read_mostly = {
97 [N_POSSIBLE] = NODE_MASK_ALL,
98 [N_ONLINE] = { { [0] = 1UL } },
100 [N_NORMAL_MEMORY] = { { [0] = 1UL } },
101 #ifdef CONFIG_HIGHMEM
102 [N_HIGH_MEMORY] = { { [0] = 1UL } },
104 #ifdef CONFIG_MOVABLE_NODE
105 [N_MEMORY] = { { [0] = 1UL } },
107 [N_CPU] = { { [0] = 1UL } },
110 EXPORT_SYMBOL(node_states);
112 /* Protect totalram_pages and zone->managed_pages */
113 static DEFINE_SPINLOCK(managed_page_count_lock);
115 unsigned long totalram_pages __read_mostly;
116 unsigned long totalreserve_pages __read_mostly;
117 unsigned long totalcma_pages __read_mostly;
119 int percpu_pagelist_fraction;
120 gfp_t gfp_allowed_mask __read_mostly = GFP_BOOT_MASK;
123 * A cached value of the page's pageblock's migratetype, used when the page is
124 * put on a pcplist. Used to avoid the pageblock migratetype lookup when
125 * freeing from pcplists in most cases, at the cost of possibly becoming stale.
126 * Also the migratetype set in the page does not necessarily match the pcplist
127 * index, e.g. page might have MIGRATE_CMA set but be on a pcplist with any
128 * other index - this ensures that it will be put on the correct CMA freelist.
130 static inline int get_pcppage_migratetype(struct page *page)
135 static inline void set_pcppage_migratetype(struct page *page, int migratetype)
137 page->index = migratetype;
140 #ifdef CONFIG_PM_SLEEP
142 * The following functions are used by the suspend/hibernate code to temporarily
143 * change gfp_allowed_mask in order to avoid using I/O during memory allocations
144 * while devices are suspended. To avoid races with the suspend/hibernate code,
145 * they should always be called with pm_mutex held (gfp_allowed_mask also should
146 * only be modified with pm_mutex held, unless the suspend/hibernate code is
147 * guaranteed not to run in parallel with that modification).
150 static gfp_t saved_gfp_mask;
152 void pm_restore_gfp_mask(void)
154 WARN_ON(!mutex_is_locked(&pm_mutex));
155 if (saved_gfp_mask) {
156 gfp_allowed_mask = saved_gfp_mask;
161 void pm_restrict_gfp_mask(void)
163 WARN_ON(!mutex_is_locked(&pm_mutex));
164 WARN_ON(saved_gfp_mask);
165 saved_gfp_mask = gfp_allowed_mask;
166 gfp_allowed_mask &= ~(__GFP_IO | __GFP_FS);
169 bool pm_suspended_storage(void)
171 if ((gfp_allowed_mask & (__GFP_IO | __GFP_FS)) == (__GFP_IO | __GFP_FS))
175 #endif /* CONFIG_PM_SLEEP */
177 #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
178 unsigned int pageblock_order __read_mostly;
181 static void __free_pages_ok(struct page *page, unsigned int order);
184 * results with 256, 32 in the lowmem_reserve sysctl:
185 * 1G machine -> (16M dma, 800M-16M normal, 1G-800M high)
186 * 1G machine -> (16M dma, 784M normal, 224M high)
187 * NORMAL allocation will leave 784M/256 of ram reserved in the ZONE_DMA
188 * HIGHMEM allocation will leave 224M/32 of ram reserved in ZONE_NORMAL
189 * HIGHMEM allocation will leave (224M+784M)/256 of ram reserved in ZONE_DMA
191 * TBD: should special case ZONE_DMA32 machines here - in those we normally
192 * don't need any ZONE_NORMAL reservation
194 int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES-1] = {
195 #ifdef CONFIG_ZONE_DMA
198 #ifdef CONFIG_ZONE_DMA32
201 #ifdef CONFIG_HIGHMEM
207 EXPORT_SYMBOL(totalram_pages);
209 static char * const zone_names[MAX_NR_ZONES] = {
210 #ifdef CONFIG_ZONE_DMA
213 #ifdef CONFIG_ZONE_DMA32
217 #ifdef CONFIG_HIGHMEM
221 #ifdef CONFIG_ZONE_DEVICE
226 compound_page_dtor * const compound_page_dtors[] = {
229 #ifdef CONFIG_HUGETLB_PAGE
232 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
237 int min_free_kbytes = 1024;
238 int user_min_free_kbytes = -1;
240 static unsigned long __meminitdata nr_kernel_pages;
241 static unsigned long __meminitdata nr_all_pages;
242 static unsigned long __meminitdata dma_reserve;
244 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
245 static unsigned long __meminitdata arch_zone_lowest_possible_pfn[MAX_NR_ZONES];
246 static unsigned long __meminitdata arch_zone_highest_possible_pfn[MAX_NR_ZONES];
247 static unsigned long __initdata required_kernelcore;
248 static unsigned long __initdata required_movablecore;
249 static unsigned long __meminitdata zone_movable_pfn[MAX_NUMNODES];
250 static bool mirrored_kernelcore;
252 /* movable_zone is the "real" zone pages in ZONE_MOVABLE are taken from */
254 EXPORT_SYMBOL(movable_zone);
255 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
258 int nr_node_ids __read_mostly = MAX_NUMNODES;
259 int nr_online_nodes __read_mostly = 1;
260 EXPORT_SYMBOL(nr_node_ids);
261 EXPORT_SYMBOL(nr_online_nodes);
264 int page_group_by_mobility_disabled __read_mostly;
266 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
267 static inline void reset_deferred_meminit(pg_data_t *pgdat)
269 pgdat->first_deferred_pfn = ULONG_MAX;
272 /* Returns true if the struct page for the pfn is uninitialised */
273 static inline bool __meminit early_page_uninitialised(unsigned long pfn)
275 if (pfn >= NODE_DATA(early_pfn_to_nid(pfn))->first_deferred_pfn)
281 static inline bool early_page_nid_uninitialised(unsigned long pfn, int nid)
283 if (pfn >= NODE_DATA(nid)->first_deferred_pfn)
290 * Returns false when the remaining initialisation should be deferred until
291 * later in the boot cycle when it can be parallelised.
293 static inline bool update_defer_init(pg_data_t *pgdat,
294 unsigned long pfn, unsigned long zone_end,
295 unsigned long *nr_initialised)
297 /* Always populate low zones for address-contrained allocations */
298 if (zone_end < pgdat_end_pfn(pgdat))
301 /* Initialise at least 2G of the highest zone */
303 if (*nr_initialised > (2UL << (30 - PAGE_SHIFT)) &&
304 (pfn & (PAGES_PER_SECTION - 1)) == 0) {
305 pgdat->first_deferred_pfn = pfn;
312 static inline void reset_deferred_meminit(pg_data_t *pgdat)
316 static inline bool early_page_uninitialised(unsigned long pfn)
321 static inline bool early_page_nid_uninitialised(unsigned long pfn, int nid)
326 static inline bool update_defer_init(pg_data_t *pgdat,
327 unsigned long pfn, unsigned long zone_end,
328 unsigned long *nr_initialised)
335 void set_pageblock_migratetype(struct page *page, int migratetype)
337 if (unlikely(page_group_by_mobility_disabled &&
338 migratetype < MIGRATE_PCPTYPES))
339 migratetype = MIGRATE_UNMOVABLE;
341 set_pageblock_flags_group(page, (unsigned long)migratetype,
342 PB_migrate, PB_migrate_end);
345 #ifdef CONFIG_DEBUG_VM
346 static int page_outside_zone_boundaries(struct zone *zone, struct page *page)
350 unsigned long pfn = page_to_pfn(page);
351 unsigned long sp, start_pfn;
354 seq = zone_span_seqbegin(zone);
355 start_pfn = zone->zone_start_pfn;
356 sp = zone->spanned_pages;
357 if (!zone_spans_pfn(zone, pfn))
359 } while (zone_span_seqretry(zone, seq));
362 pr_err("page 0x%lx outside node %d zone %s [ 0x%lx - 0x%lx ]\n",
363 pfn, zone_to_nid(zone), zone->name,
364 start_pfn, start_pfn + sp);
369 static int page_is_consistent(struct zone *zone, struct page *page)
371 if (!pfn_valid_within(page_to_pfn(page)))
373 if (zone != page_zone(page))
379 * Temporary debugging check for pages not lying within a given zone.
381 static int bad_range(struct zone *zone, struct page *page)
383 if (page_outside_zone_boundaries(zone, page))
385 if (!page_is_consistent(zone, page))
391 static inline int bad_range(struct zone *zone, struct page *page)
397 static void bad_page(struct page *page, const char *reason,
398 unsigned long bad_flags)
400 static unsigned long resume;
401 static unsigned long nr_shown;
402 static unsigned long nr_unshown;
404 /* Don't complain about poisoned pages */
405 if (PageHWPoison(page)) {
406 page_mapcount_reset(page); /* remove PageBuddy */
411 * Allow a burst of 60 reports, then keep quiet for that minute;
412 * or allow a steady drip of one report per second.
414 if (nr_shown == 60) {
415 if (time_before(jiffies, resume)) {
421 "BUG: Bad page state: %lu messages suppressed\n",
428 resume = jiffies + 60 * HZ;
430 printk(KERN_ALERT "BUG: Bad page state in process %s pfn:%05lx\n",
431 current->comm, page_to_pfn(page));
432 dump_page_badflags(page, reason, bad_flags);
437 /* Leave bad fields for debug, except PageBuddy could make trouble */
438 page_mapcount_reset(page); /* remove PageBuddy */
439 add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE);
443 * Higher-order pages are called "compound pages". They are structured thusly:
445 * The first PAGE_SIZE page is called the "head page" and have PG_head set.
447 * The remaining PAGE_SIZE pages are called "tail pages". PageTail() is encoded
448 * in bit 0 of page->compound_head. The rest of bits is pointer to head page.
450 * The first tail page's ->compound_dtor holds the offset in array of compound
451 * page destructors. See compound_page_dtors.
453 * The first tail page's ->compound_order holds the order of allocation.
454 * This usage means that zero-order pages may not be compound.
457 void free_compound_page(struct page *page)
459 __free_pages_ok(page, compound_order(page));
462 void prep_compound_page(struct page *page, unsigned int order)
465 int nr_pages = 1 << order;
467 set_compound_page_dtor(page, COMPOUND_PAGE_DTOR);
468 set_compound_order(page, order);
470 for (i = 1; i < nr_pages; i++) {
471 struct page *p = page + i;
472 set_page_count(p, 0);
473 p->mapping = TAIL_MAPPING;
474 set_compound_head(p, page);
476 atomic_set(compound_mapcount_ptr(page), -1);
479 #ifdef CONFIG_DEBUG_PAGEALLOC
480 unsigned int _debug_guardpage_minorder;
481 bool _debug_pagealloc_enabled __read_mostly
482 = IS_ENABLED(CONFIG_DEBUG_PAGEALLOC_ENABLE_DEFAULT);
483 bool _debug_guardpage_enabled __read_mostly;
485 static int __init early_debug_pagealloc(char *buf)
490 if (strcmp(buf, "on") == 0)
491 _debug_pagealloc_enabled = true;
493 if (strcmp(buf, "off") == 0)
494 _debug_pagealloc_enabled = false;
498 early_param("debug_pagealloc", early_debug_pagealloc);
500 static bool need_debug_guardpage(void)
502 /* If we don't use debug_pagealloc, we don't need guard page */
503 if (!debug_pagealloc_enabled())
509 static void init_debug_guardpage(void)
511 if (!debug_pagealloc_enabled())
514 _debug_guardpage_enabled = true;
517 struct page_ext_operations debug_guardpage_ops = {
518 .need = need_debug_guardpage,
519 .init = init_debug_guardpage,
522 static int __init debug_guardpage_minorder_setup(char *buf)
526 if (kstrtoul(buf, 10, &res) < 0 || res > MAX_ORDER / 2) {
527 printk(KERN_ERR "Bad debug_guardpage_minorder value\n");
530 _debug_guardpage_minorder = res;
531 printk(KERN_INFO "Setting debug_guardpage_minorder to %lu\n", res);
534 __setup("debug_guardpage_minorder=", debug_guardpage_minorder_setup);
536 static inline void set_page_guard(struct zone *zone, struct page *page,
537 unsigned int order, int migratetype)
539 struct page_ext *page_ext;
541 if (!debug_guardpage_enabled())
544 page_ext = lookup_page_ext(page);
545 __set_bit(PAGE_EXT_DEBUG_GUARD, &page_ext->flags);
547 INIT_LIST_HEAD(&page->lru);
548 set_page_private(page, order);
549 /* Guard pages are not available for any usage */
550 __mod_zone_freepage_state(zone, -(1 << order), migratetype);
553 static inline void clear_page_guard(struct zone *zone, struct page *page,
554 unsigned int order, int migratetype)
556 struct page_ext *page_ext;
558 if (!debug_guardpage_enabled())
561 page_ext = lookup_page_ext(page);
562 __clear_bit(PAGE_EXT_DEBUG_GUARD, &page_ext->flags);
564 set_page_private(page, 0);
565 if (!is_migrate_isolate(migratetype))
566 __mod_zone_freepage_state(zone, (1 << order), migratetype);
569 struct page_ext_operations debug_guardpage_ops = { NULL, };
570 static inline void set_page_guard(struct zone *zone, struct page *page,
571 unsigned int order, int migratetype) {}
572 static inline void clear_page_guard(struct zone *zone, struct page *page,
573 unsigned int order, int migratetype) {}
576 static inline void set_page_order(struct page *page, unsigned int order)
578 set_page_private(page, order);
579 __SetPageBuddy(page);
582 static inline void rmv_page_order(struct page *page)
584 __ClearPageBuddy(page);
585 set_page_private(page, 0);
589 * This function checks whether a page is free && is the buddy
590 * we can do coalesce a page and its buddy if
591 * (a) the buddy is not in a hole &&
592 * (b) the buddy is in the buddy system &&
593 * (c) a page and its buddy have the same order &&
594 * (d) a page and its buddy are in the same zone.
596 * For recording whether a page is in the buddy system, we set ->_mapcount
597 * PAGE_BUDDY_MAPCOUNT_VALUE.
598 * Setting, clearing, and testing _mapcount PAGE_BUDDY_MAPCOUNT_VALUE is
599 * serialized by zone->lock.
601 * For recording page's order, we use page_private(page).
603 static inline int page_is_buddy(struct page *page, struct page *buddy,
606 if (!pfn_valid_within(page_to_pfn(buddy)))
609 if (page_is_guard(buddy) && page_order(buddy) == order) {
610 if (page_zone_id(page) != page_zone_id(buddy))
613 VM_BUG_ON_PAGE(page_count(buddy) != 0, buddy);
618 if (PageBuddy(buddy) && page_order(buddy) == order) {
620 * zone check is done late to avoid uselessly
621 * calculating zone/node ids for pages that could
624 if (page_zone_id(page) != page_zone_id(buddy))
627 VM_BUG_ON_PAGE(page_count(buddy) != 0, buddy);
635 * Freeing function for a buddy system allocator.
637 * The concept of a buddy system is to maintain direct-mapped table
638 * (containing bit values) for memory blocks of various "orders".
639 * The bottom level table contains the map for the smallest allocatable
640 * units of memory (here, pages), and each level above it describes
641 * pairs of units from the levels below, hence, "buddies".
642 * At a high level, all that happens here is marking the table entry
643 * at the bottom level available, and propagating the changes upward
644 * as necessary, plus some accounting needed to play nicely with other
645 * parts of the VM system.
646 * At each level, we keep a list of pages, which are heads of continuous
647 * free pages of length of (1 << order) and marked with _mapcount
648 * PAGE_BUDDY_MAPCOUNT_VALUE. Page's order is recorded in page_private(page)
650 * So when we are allocating or freeing one, we can derive the state of the
651 * other. That is, if we allocate a small block, and both were
652 * free, the remainder of the region must be split into blocks.
653 * If a block is freed, and its buddy is also free, then this
654 * triggers coalescing into a block of larger size.
659 static inline void __free_one_page(struct page *page,
661 struct zone *zone, unsigned int order,
664 unsigned long page_idx;
665 unsigned long combined_idx;
666 unsigned long uninitialized_var(buddy_idx);
668 unsigned int max_order = MAX_ORDER;
670 VM_BUG_ON(!zone_is_initialized(zone));
671 VM_BUG_ON_PAGE(page->flags & PAGE_FLAGS_CHECK_AT_PREP, page);
673 VM_BUG_ON(migratetype == -1);
674 if (is_migrate_isolate(migratetype)) {
676 * We restrict max order of merging to prevent merge
677 * between freepages on isolate pageblock and normal
678 * pageblock. Without this, pageblock isolation
679 * could cause incorrect freepage accounting.
681 max_order = min_t(unsigned int, MAX_ORDER, pageblock_order + 1);
683 __mod_zone_freepage_state(zone, 1 << order, migratetype);
686 page_idx = pfn & ((1 << max_order) - 1);
688 VM_BUG_ON_PAGE(page_idx & ((1 << order) - 1), page);
689 VM_BUG_ON_PAGE(bad_range(zone, page), page);
691 while (order < max_order - 1) {
692 buddy_idx = __find_buddy_index(page_idx, order);
693 buddy = page + (buddy_idx - page_idx);
694 if (!page_is_buddy(page, buddy, order))
697 * Our buddy is free or it is CONFIG_DEBUG_PAGEALLOC guard page,
698 * merge with it and move up one order.
700 if (page_is_guard(buddy)) {
701 clear_page_guard(zone, buddy, order, migratetype);
703 list_del(&buddy->lru);
704 zone->free_area[order].nr_free--;
705 rmv_page_order(buddy);
707 combined_idx = buddy_idx & page_idx;
708 page = page + (combined_idx - page_idx);
709 page_idx = combined_idx;
712 set_page_order(page, order);
715 * If this is not the largest possible page, check if the buddy
716 * of the next-highest order is free. If it is, it's possible
717 * that pages are being freed that will coalesce soon. In case,
718 * that is happening, add the free page to the tail of the list
719 * so it's less likely to be used soon and more likely to be merged
720 * as a higher order page
722 if ((order < MAX_ORDER-2) && pfn_valid_within(page_to_pfn(buddy))) {
723 struct page *higher_page, *higher_buddy;
724 combined_idx = buddy_idx & page_idx;
725 higher_page = page + (combined_idx - page_idx);
726 buddy_idx = __find_buddy_index(combined_idx, order + 1);
727 higher_buddy = higher_page + (buddy_idx - combined_idx);
728 if (page_is_buddy(higher_page, higher_buddy, order + 1)) {
729 list_add_tail(&page->lru,
730 &zone->free_area[order].free_list[migratetype]);
735 list_add(&page->lru, &zone->free_area[order].free_list[migratetype]);
737 zone->free_area[order].nr_free++;
740 static inline int free_pages_check(struct page *page)
742 const char *bad_reason = NULL;
743 unsigned long bad_flags = 0;
745 if (unlikely(atomic_read(&page->_mapcount) != -1))
746 bad_reason = "nonzero mapcount";
747 if (unlikely(page->mapping != NULL))
748 bad_reason = "non-NULL mapping";
749 if (unlikely(atomic_read(&page->_count) != 0))
750 bad_reason = "nonzero _count";
751 if (unlikely(page->flags & PAGE_FLAGS_CHECK_AT_FREE)) {
752 bad_reason = "PAGE_FLAGS_CHECK_AT_FREE flag(s) set";
753 bad_flags = PAGE_FLAGS_CHECK_AT_FREE;
756 if (unlikely(page->mem_cgroup))
757 bad_reason = "page still charged to cgroup";
759 if (unlikely(bad_reason)) {
760 bad_page(page, bad_reason, bad_flags);
763 page_cpupid_reset_last(page);
764 if (page->flags & PAGE_FLAGS_CHECK_AT_PREP)
765 page->flags &= ~PAGE_FLAGS_CHECK_AT_PREP;
770 * Frees a number of pages from the PCP lists
771 * Assumes all pages on list are in same zone, and of same order.
772 * count is the number of pages to free.
774 * If the zone was previously in an "all pages pinned" state then look to
775 * see if this freeing clears that state.
777 * And clear the zone's pages_scanned counter, to hold off the "all pages are
778 * pinned" detection logic.
780 static void free_pcppages_bulk(struct zone *zone, int count,
781 struct per_cpu_pages *pcp)
786 unsigned long nr_scanned;
788 spin_lock(&zone->lock);
789 nr_scanned = zone_page_state(zone, NR_PAGES_SCANNED);
791 __mod_zone_page_state(zone, NR_PAGES_SCANNED, -nr_scanned);
795 struct list_head *list;
798 * Remove pages from lists in a round-robin fashion. A
799 * batch_free count is maintained that is incremented when an
800 * empty list is encountered. This is so more pages are freed
801 * off fuller lists instead of spinning excessively around empty
806 if (++migratetype == MIGRATE_PCPTYPES)
808 list = &pcp->lists[migratetype];
809 } while (list_empty(list));
811 /* This is the only non-empty list. Free them all. */
812 if (batch_free == MIGRATE_PCPTYPES)
813 batch_free = to_free;
816 int mt; /* migratetype of the to-be-freed page */
818 page = list_last_entry(list, struct page, lru);
819 /* must delete as __free_one_page list manipulates */
820 list_del(&page->lru);
822 mt = get_pcppage_migratetype(page);
823 /* MIGRATE_ISOLATE page should not go to pcplists */
824 VM_BUG_ON_PAGE(is_migrate_isolate(mt), page);
825 /* Pageblock could have been isolated meanwhile */
826 if (unlikely(has_isolate_pageblock(zone)))
827 mt = get_pageblock_migratetype(page);
829 __free_one_page(page, page_to_pfn(page), zone, 0, mt);
830 trace_mm_page_pcpu_drain(page, 0, mt);
831 } while (--to_free && --batch_free && !list_empty(list));
833 spin_unlock(&zone->lock);
836 static void free_one_page(struct zone *zone,
837 struct page *page, unsigned long pfn,
841 unsigned long nr_scanned;
842 spin_lock(&zone->lock);
843 nr_scanned = zone_page_state(zone, NR_PAGES_SCANNED);
845 __mod_zone_page_state(zone, NR_PAGES_SCANNED, -nr_scanned);
847 if (unlikely(has_isolate_pageblock(zone) ||
848 is_migrate_isolate(migratetype))) {
849 migratetype = get_pfnblock_migratetype(page, pfn);
851 __free_one_page(page, pfn, zone, order, migratetype);
852 spin_unlock(&zone->lock);
855 static int free_tail_pages_check(struct page *head_page, struct page *page)
860 * We rely page->lru.next never has bit 0 set, unless the page
861 * is PageTail(). Let's make sure that's true even for poisoned ->lru.
863 BUILD_BUG_ON((unsigned long)LIST_POISON1 & 1);
865 if (!IS_ENABLED(CONFIG_DEBUG_VM)) {
869 switch (page - head_page) {
871 /* the first tail page: ->mapping is compound_mapcount() */
872 if (unlikely(compound_mapcount(page))) {
873 bad_page(page, "nonzero compound_mapcount", 0);
879 * the second tail page: ->mapping is
880 * page_deferred_list().next -- ignore value.
884 if (page->mapping != TAIL_MAPPING) {
885 bad_page(page, "corrupted mapping in tail page", 0);
890 if (unlikely(!PageTail(page))) {
891 bad_page(page, "PageTail not set", 0);
894 if (unlikely(compound_head(page) != head_page)) {
895 bad_page(page, "compound_head not consistent", 0);
900 page->mapping = NULL;
901 clear_compound_head(page);
905 static void __meminit __init_single_page(struct page *page, unsigned long pfn,
906 unsigned long zone, int nid)
908 set_page_links(page, zone, nid, pfn);
909 init_page_count(page);
910 page_mapcount_reset(page);
911 page_cpupid_reset_last(page);
913 INIT_LIST_HEAD(&page->lru);
914 #ifdef WANT_PAGE_VIRTUAL
915 /* The shift won't overflow because ZONE_NORMAL is below 4G. */
916 if (!is_highmem_idx(zone))
917 set_page_address(page, __va(pfn << PAGE_SHIFT));
921 static void __meminit __init_single_pfn(unsigned long pfn, unsigned long zone,
924 return __init_single_page(pfn_to_page(pfn), pfn, zone, nid);
927 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
928 static void init_reserved_page(unsigned long pfn)
933 if (!early_page_uninitialised(pfn))
936 nid = early_pfn_to_nid(pfn);
937 pgdat = NODE_DATA(nid);
939 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
940 struct zone *zone = &pgdat->node_zones[zid];
942 if (pfn >= zone->zone_start_pfn && pfn < zone_end_pfn(zone))
945 __init_single_pfn(pfn, zid, nid);
948 static inline void init_reserved_page(unsigned long pfn)
951 #endif /* CONFIG_DEFERRED_STRUCT_PAGE_INIT */
954 * Initialised pages do not have PageReserved set. This function is
955 * called for each range allocated by the bootmem allocator and
956 * marks the pages PageReserved. The remaining valid pages are later
957 * sent to the buddy page allocator.
959 void __meminit reserve_bootmem_region(unsigned long start, unsigned long end)
961 unsigned long start_pfn = PFN_DOWN(start);
962 unsigned long end_pfn = PFN_UP(end);
964 for (; start_pfn < end_pfn; start_pfn++) {
965 if (pfn_valid(start_pfn)) {
966 struct page *page = pfn_to_page(start_pfn);
968 init_reserved_page(start_pfn);
970 /* Avoid false-positive PageTail() */
971 INIT_LIST_HEAD(&page->lru);
973 SetPageReserved(page);
978 static bool free_pages_prepare(struct page *page, unsigned int order)
980 bool compound = PageCompound(page);
983 VM_BUG_ON_PAGE(PageTail(page), page);
984 VM_BUG_ON_PAGE(compound && compound_order(page) != order, page);
986 trace_mm_page_free(page, order);
987 kmemcheck_free_shadow(page, order);
988 kasan_free_pages(page, order);
991 page->mapping = NULL;
992 bad += free_pages_check(page);
993 for (i = 1; i < (1 << order); i++) {
995 bad += free_tail_pages_check(page, page + i);
996 bad += free_pages_check(page + i);
1001 reset_page_owner(page, order);
1003 if (!PageHighMem(page)) {
1004 debug_check_no_locks_freed(page_address(page),
1005 PAGE_SIZE << order);
1006 debug_check_no_obj_freed(page_address(page),
1007 PAGE_SIZE << order);
1009 arch_free_page(page, order);
1010 kernel_map_pages(page, 1 << order, 0);
1015 static void __free_pages_ok(struct page *page, unsigned int order)
1017 unsigned long flags;
1019 unsigned long pfn = page_to_pfn(page);
1021 if (!free_pages_prepare(page, order))
1024 migratetype = get_pfnblock_migratetype(page, pfn);
1025 local_irq_save(flags);
1026 __count_vm_events(PGFREE, 1 << order);
1027 free_one_page(page_zone(page), page, pfn, order, migratetype);
1028 local_irq_restore(flags);
1031 static void __init __free_pages_boot_core(struct page *page,
1032 unsigned long pfn, unsigned int order)
1034 unsigned int nr_pages = 1 << order;
1035 struct page *p = page;
1039 for (loop = 0; loop < (nr_pages - 1); loop++, p++) {
1041 __ClearPageReserved(p);
1042 set_page_count(p, 0);
1044 __ClearPageReserved(p);
1045 set_page_count(p, 0);
1047 page_zone(page)->managed_pages += nr_pages;
1048 set_page_refcounted(page);
1049 __free_pages(page, order);
1052 #if defined(CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID) || \
1053 defined(CONFIG_HAVE_MEMBLOCK_NODE_MAP)
1055 static struct mminit_pfnnid_cache early_pfnnid_cache __meminitdata;
1057 int __meminit early_pfn_to_nid(unsigned long pfn)
1059 static DEFINE_SPINLOCK(early_pfn_lock);
1062 spin_lock(&early_pfn_lock);
1063 nid = __early_pfn_to_nid(pfn, &early_pfnnid_cache);
1066 spin_unlock(&early_pfn_lock);
1072 #ifdef CONFIG_NODES_SPAN_OTHER_NODES
1073 static inline bool __meminit meminit_pfn_in_nid(unsigned long pfn, int node,
1074 struct mminit_pfnnid_cache *state)
1078 nid = __early_pfn_to_nid(pfn, state);
1079 if (nid >= 0 && nid != node)
1084 /* Only safe to use early in boot when initialisation is single-threaded */
1085 static inline bool __meminit early_pfn_in_nid(unsigned long pfn, int node)
1087 return meminit_pfn_in_nid(pfn, node, &early_pfnnid_cache);
1092 static inline bool __meminit early_pfn_in_nid(unsigned long pfn, int node)
1096 static inline bool __meminit meminit_pfn_in_nid(unsigned long pfn, int node,
1097 struct mminit_pfnnid_cache *state)
1104 void __init __free_pages_bootmem(struct page *page, unsigned long pfn,
1107 if (early_page_uninitialised(pfn))
1109 return __free_pages_boot_core(page, pfn, order);
1112 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
1113 static void __init deferred_free_range(struct page *page,
1114 unsigned long pfn, int nr_pages)
1121 /* Free a large naturally-aligned chunk if possible */
1122 if (nr_pages == MAX_ORDER_NR_PAGES &&
1123 (pfn & (MAX_ORDER_NR_PAGES-1)) == 0) {
1124 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
1125 __free_pages_boot_core(page, pfn, MAX_ORDER-1);
1129 for (i = 0; i < nr_pages; i++, page++, pfn++)
1130 __free_pages_boot_core(page, pfn, 0);
1133 /* Completion tracking for deferred_init_memmap() threads */
1134 static atomic_t pgdat_init_n_undone __initdata;
1135 static __initdata DECLARE_COMPLETION(pgdat_init_all_done_comp);
1137 static inline void __init pgdat_init_report_one_done(void)
1139 if (atomic_dec_and_test(&pgdat_init_n_undone))
1140 complete(&pgdat_init_all_done_comp);
1143 /* Initialise remaining memory on a node */
1144 static int __init deferred_init_memmap(void *data)
1146 pg_data_t *pgdat = data;
1147 int nid = pgdat->node_id;
1148 struct mminit_pfnnid_cache nid_init_state = { };
1149 unsigned long start = jiffies;
1150 unsigned long nr_pages = 0;
1151 unsigned long walk_start, walk_end;
1154 unsigned long first_init_pfn = pgdat->first_deferred_pfn;
1155 const struct cpumask *cpumask = cpumask_of_node(pgdat->node_id);
1157 if (first_init_pfn == ULONG_MAX) {
1158 pgdat_init_report_one_done();
1162 /* Bind memory initialisation thread to a local node if possible */
1163 if (!cpumask_empty(cpumask))
1164 set_cpus_allowed_ptr(current, cpumask);
1166 /* Sanity check boundaries */
1167 BUG_ON(pgdat->first_deferred_pfn < pgdat->node_start_pfn);
1168 BUG_ON(pgdat->first_deferred_pfn > pgdat_end_pfn(pgdat));
1169 pgdat->first_deferred_pfn = ULONG_MAX;
1171 /* Only the highest zone is deferred so find it */
1172 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
1173 zone = pgdat->node_zones + zid;
1174 if (first_init_pfn < zone_end_pfn(zone))
1178 for_each_mem_pfn_range(i, nid, &walk_start, &walk_end, NULL) {
1179 unsigned long pfn, end_pfn;
1180 struct page *page = NULL;
1181 struct page *free_base_page = NULL;
1182 unsigned long free_base_pfn = 0;
1185 end_pfn = min(walk_end, zone_end_pfn(zone));
1186 pfn = first_init_pfn;
1187 if (pfn < walk_start)
1189 if (pfn < zone->zone_start_pfn)
1190 pfn = zone->zone_start_pfn;
1192 for (; pfn < end_pfn; pfn++) {
1193 if (!pfn_valid_within(pfn))
1197 * Ensure pfn_valid is checked every
1198 * MAX_ORDER_NR_PAGES for memory holes
1200 if ((pfn & (MAX_ORDER_NR_PAGES - 1)) == 0) {
1201 if (!pfn_valid(pfn)) {
1207 if (!meminit_pfn_in_nid(pfn, nid, &nid_init_state)) {
1212 /* Minimise pfn page lookups and scheduler checks */
1213 if (page && (pfn & (MAX_ORDER_NR_PAGES - 1)) != 0) {
1216 nr_pages += nr_to_free;
1217 deferred_free_range(free_base_page,
1218 free_base_pfn, nr_to_free);
1219 free_base_page = NULL;
1220 free_base_pfn = nr_to_free = 0;
1222 page = pfn_to_page(pfn);
1227 VM_BUG_ON(page_zone(page) != zone);
1231 __init_single_page(page, pfn, zid, nid);
1232 if (!free_base_page) {
1233 free_base_page = page;
1234 free_base_pfn = pfn;
1239 /* Where possible, batch up pages for a single free */
1242 /* Free the current block of pages to allocator */
1243 nr_pages += nr_to_free;
1244 deferred_free_range(free_base_page, free_base_pfn,
1246 free_base_page = NULL;
1247 free_base_pfn = nr_to_free = 0;
1250 first_init_pfn = max(end_pfn, first_init_pfn);
1253 /* Sanity check that the next zone really is unpopulated */
1254 WARN_ON(++zid < MAX_NR_ZONES && populated_zone(++zone));
1256 pr_info("node %d initialised, %lu pages in %ums\n", nid, nr_pages,
1257 jiffies_to_msecs(jiffies - start));
1259 pgdat_init_report_one_done();
1263 void __init page_alloc_init_late(void)
1267 /* There will be num_node_state(N_MEMORY) threads */
1268 atomic_set(&pgdat_init_n_undone, num_node_state(N_MEMORY));
1269 for_each_node_state(nid, N_MEMORY) {
1270 kthread_run(deferred_init_memmap, NODE_DATA(nid), "pgdatinit%d", nid);
1273 /* Block until all are initialised */
1274 wait_for_completion(&pgdat_init_all_done_comp);
1276 /* Reinit limits that are based on free pages after the kernel is up */
1277 files_maxfiles_init();
1279 #endif /* CONFIG_DEFERRED_STRUCT_PAGE_INIT */
1282 /* Free whole pageblock and set its migration type to MIGRATE_CMA. */
1283 void __init init_cma_reserved_pageblock(struct page *page)
1285 unsigned i = pageblock_nr_pages;
1286 struct page *p = page;
1289 __ClearPageReserved(p);
1290 set_page_count(p, 0);
1293 set_pageblock_migratetype(page, MIGRATE_CMA);
1295 if (pageblock_order >= MAX_ORDER) {
1296 i = pageblock_nr_pages;
1299 set_page_refcounted(p);
1300 __free_pages(p, MAX_ORDER - 1);
1301 p += MAX_ORDER_NR_PAGES;
1302 } while (i -= MAX_ORDER_NR_PAGES);
1304 set_page_refcounted(page);
1305 __free_pages(page, pageblock_order);
1308 adjust_managed_page_count(page, pageblock_nr_pages);
1313 * The order of subdivision here is critical for the IO subsystem.
1314 * Please do not alter this order without good reasons and regression
1315 * testing. Specifically, as large blocks of memory are subdivided,
1316 * the order in which smaller blocks are delivered depends on the order
1317 * they're subdivided in this function. This is the primary factor
1318 * influencing the order in which pages are delivered to the IO
1319 * subsystem according to empirical testing, and this is also justified
1320 * by considering the behavior of a buddy system containing a single
1321 * large block of memory acted on by a series of small allocations.
1322 * This behavior is a critical factor in sglist merging's success.
1326 static inline void expand(struct zone *zone, struct page *page,
1327 int low, int high, struct free_area *area,
1330 unsigned long size = 1 << high;
1332 while (high > low) {
1336 VM_BUG_ON_PAGE(bad_range(zone, &page[size]), &page[size]);
1338 if (IS_ENABLED(CONFIG_DEBUG_PAGEALLOC) &&
1339 debug_guardpage_enabled() &&
1340 high < debug_guardpage_minorder()) {
1342 * Mark as guard pages (or page), that will allow to
1343 * merge back to allocator when buddy will be freed.
1344 * Corresponding page table entries will not be touched,
1345 * pages will stay not present in virtual address space
1347 set_page_guard(zone, &page[size], high, migratetype);
1350 list_add(&page[size].lru, &area->free_list[migratetype]);
1352 set_page_order(&page[size], high);
1357 * This page is about to be returned from the page allocator
1359 static inline int check_new_page(struct page *page)
1361 const char *bad_reason = NULL;
1362 unsigned long bad_flags = 0;
1364 if (unlikely(atomic_read(&page->_mapcount) != -1))
1365 bad_reason = "nonzero mapcount";
1366 if (unlikely(page->mapping != NULL))
1367 bad_reason = "non-NULL mapping";
1368 if (unlikely(atomic_read(&page->_count) != 0))
1369 bad_reason = "nonzero _count";
1370 if (unlikely(page->flags & __PG_HWPOISON)) {
1371 bad_reason = "HWPoisoned (hardware-corrupted)";
1372 bad_flags = __PG_HWPOISON;
1374 if (unlikely(page->flags & PAGE_FLAGS_CHECK_AT_PREP)) {
1375 bad_reason = "PAGE_FLAGS_CHECK_AT_PREP flag set";
1376 bad_flags = PAGE_FLAGS_CHECK_AT_PREP;
1379 if (unlikely(page->mem_cgroup))
1380 bad_reason = "page still charged to cgroup";
1382 if (unlikely(bad_reason)) {
1383 bad_page(page, bad_reason, bad_flags);
1389 static int prep_new_page(struct page *page, unsigned int order, gfp_t gfp_flags,
1394 for (i = 0; i < (1 << order); i++) {
1395 struct page *p = page + i;
1396 if (unlikely(check_new_page(p)))
1400 set_page_private(page, 0);
1401 set_page_refcounted(page);
1403 arch_alloc_page(page, order);
1404 kernel_map_pages(page, 1 << order, 1);
1405 kasan_alloc_pages(page, order);
1407 if (gfp_flags & __GFP_ZERO)
1408 for (i = 0; i < (1 << order); i++)
1409 clear_highpage(page + i);
1411 if (order && (gfp_flags & __GFP_COMP))
1412 prep_compound_page(page, order);
1414 set_page_owner(page, order, gfp_flags);
1417 * page is set pfmemalloc when ALLOC_NO_WATERMARKS was necessary to
1418 * allocate the page. The expectation is that the caller is taking
1419 * steps that will free more memory. The caller should avoid the page
1420 * being used for !PFMEMALLOC purposes.
1422 if (alloc_flags & ALLOC_NO_WATERMARKS)
1423 set_page_pfmemalloc(page);
1425 clear_page_pfmemalloc(page);
1431 * Go through the free lists for the given migratetype and remove
1432 * the smallest available page from the freelists
1435 struct page *__rmqueue_smallest(struct zone *zone, unsigned int order,
1438 unsigned int current_order;
1439 struct free_area *area;
1442 /* Find a page of the appropriate size in the preferred list */
1443 for (current_order = order; current_order < MAX_ORDER; ++current_order) {
1444 area = &(zone->free_area[current_order]);
1445 page = list_first_entry_or_null(&area->free_list[migratetype],
1449 list_del(&page->lru);
1450 rmv_page_order(page);
1452 expand(zone, page, order, current_order, area, migratetype);
1453 set_pcppage_migratetype(page, migratetype);
1462 * This array describes the order lists are fallen back to when
1463 * the free lists for the desirable migrate type are depleted
1465 static int fallbacks[MIGRATE_TYPES][4] = {
1466 [MIGRATE_UNMOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_MOVABLE, MIGRATE_TYPES },
1467 [MIGRATE_RECLAIMABLE] = { MIGRATE_UNMOVABLE, MIGRATE_MOVABLE, MIGRATE_TYPES },
1468 [MIGRATE_MOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_UNMOVABLE, MIGRATE_TYPES },
1470 [MIGRATE_CMA] = { MIGRATE_TYPES }, /* Never used */
1472 #ifdef CONFIG_MEMORY_ISOLATION
1473 [MIGRATE_ISOLATE] = { MIGRATE_TYPES }, /* Never used */
1478 static struct page *__rmqueue_cma_fallback(struct zone *zone,
1481 return __rmqueue_smallest(zone, order, MIGRATE_CMA);
1484 static inline struct page *__rmqueue_cma_fallback(struct zone *zone,
1485 unsigned int order) { return NULL; }
1489 * Move the free pages in a range to the free lists of the requested type.
1490 * Note that start_page and end_pages are not aligned on a pageblock
1491 * boundary. If alignment is required, use move_freepages_block()
1493 int move_freepages(struct zone *zone,
1494 struct page *start_page, struct page *end_page,
1499 int pages_moved = 0;
1501 #ifndef CONFIG_HOLES_IN_ZONE
1503 * page_zone is not safe to call in this context when
1504 * CONFIG_HOLES_IN_ZONE is set. This bug check is probably redundant
1505 * anyway as we check zone boundaries in move_freepages_block().
1506 * Remove at a later date when no bug reports exist related to
1507 * grouping pages by mobility
1509 VM_BUG_ON(page_zone(start_page) != page_zone(end_page));
1512 for (page = start_page; page <= end_page;) {
1513 /* Make sure we are not inadvertently changing nodes */
1514 VM_BUG_ON_PAGE(page_to_nid(page) != zone_to_nid(zone), page);
1516 if (!pfn_valid_within(page_to_pfn(page))) {
1521 if (!PageBuddy(page)) {
1526 order = page_order(page);
1527 list_move(&page->lru,
1528 &zone->free_area[order].free_list[migratetype]);
1530 pages_moved += 1 << order;
1536 int move_freepages_block(struct zone *zone, struct page *page,
1539 unsigned long start_pfn, end_pfn;
1540 struct page *start_page, *end_page;
1542 start_pfn = page_to_pfn(page);
1543 start_pfn = start_pfn & ~(pageblock_nr_pages-1);
1544 start_page = pfn_to_page(start_pfn);
1545 end_page = start_page + pageblock_nr_pages - 1;
1546 end_pfn = start_pfn + pageblock_nr_pages - 1;
1548 /* Do not cross zone boundaries */
1549 if (!zone_spans_pfn(zone, start_pfn))
1551 if (!zone_spans_pfn(zone, end_pfn))
1554 return move_freepages(zone, start_page, end_page, migratetype);
1557 static void change_pageblock_range(struct page *pageblock_page,
1558 int start_order, int migratetype)
1560 int nr_pageblocks = 1 << (start_order - pageblock_order);
1562 while (nr_pageblocks--) {
1563 set_pageblock_migratetype(pageblock_page, migratetype);
1564 pageblock_page += pageblock_nr_pages;
1569 * When we are falling back to another migratetype during allocation, try to
1570 * steal extra free pages from the same pageblocks to satisfy further
1571 * allocations, instead of polluting multiple pageblocks.
1573 * If we are stealing a relatively large buddy page, it is likely there will
1574 * be more free pages in the pageblock, so try to steal them all. For
1575 * reclaimable and unmovable allocations, we steal regardless of page size,
1576 * as fragmentation caused by those allocations polluting movable pageblocks
1577 * is worse than movable allocations stealing from unmovable and reclaimable
1580 static bool can_steal_fallback(unsigned int order, int start_mt)
1583 * Leaving this order check is intended, although there is
1584 * relaxed order check in next check. The reason is that
1585 * we can actually steal whole pageblock if this condition met,
1586 * but, below check doesn't guarantee it and that is just heuristic
1587 * so could be changed anytime.
1589 if (order >= pageblock_order)
1592 if (order >= pageblock_order / 2 ||
1593 start_mt == MIGRATE_RECLAIMABLE ||
1594 start_mt == MIGRATE_UNMOVABLE ||
1595 page_group_by_mobility_disabled)
1602 * This function implements actual steal behaviour. If order is large enough,
1603 * we can steal whole pageblock. If not, we first move freepages in this
1604 * pageblock and check whether half of pages are moved or not. If half of
1605 * pages are moved, we can change migratetype of pageblock and permanently
1606 * use it's pages as requested migratetype in the future.
1608 static void steal_suitable_fallback(struct zone *zone, struct page *page,
1611 unsigned int current_order = page_order(page);
1614 /* Take ownership for orders >= pageblock_order */
1615 if (current_order >= pageblock_order) {
1616 change_pageblock_range(page, current_order, start_type);
1620 pages = move_freepages_block(zone, page, start_type);
1622 /* Claim the whole block if over half of it is free */
1623 if (pages >= (1 << (pageblock_order-1)) ||
1624 page_group_by_mobility_disabled)
1625 set_pageblock_migratetype(page, start_type);
1629 * Check whether there is a suitable fallback freepage with requested order.
1630 * If only_stealable is true, this function returns fallback_mt only if
1631 * we can steal other freepages all together. This would help to reduce
1632 * fragmentation due to mixed migratetype pages in one pageblock.
1634 int find_suitable_fallback(struct free_area *area, unsigned int order,
1635 int migratetype, bool only_stealable, bool *can_steal)
1640 if (area->nr_free == 0)
1645 fallback_mt = fallbacks[migratetype][i];
1646 if (fallback_mt == MIGRATE_TYPES)
1649 if (list_empty(&area->free_list[fallback_mt]))
1652 if (can_steal_fallback(order, migratetype))
1655 if (!only_stealable)
1666 * Reserve a pageblock for exclusive use of high-order atomic allocations if
1667 * there are no empty page blocks that contain a page with a suitable order
1669 static void reserve_highatomic_pageblock(struct page *page, struct zone *zone,
1670 unsigned int alloc_order)
1673 unsigned long max_managed, flags;
1676 * Limit the number reserved to 1 pageblock or roughly 1% of a zone.
1677 * Check is race-prone but harmless.
1679 max_managed = (zone->managed_pages / 100) + pageblock_nr_pages;
1680 if (zone->nr_reserved_highatomic >= max_managed)
1683 spin_lock_irqsave(&zone->lock, flags);
1685 /* Recheck the nr_reserved_highatomic limit under the lock */
1686 if (zone->nr_reserved_highatomic >= max_managed)
1690 mt = get_pageblock_migratetype(page);
1691 if (mt != MIGRATE_HIGHATOMIC &&
1692 !is_migrate_isolate(mt) && !is_migrate_cma(mt)) {
1693 zone->nr_reserved_highatomic += pageblock_nr_pages;
1694 set_pageblock_migratetype(page, MIGRATE_HIGHATOMIC);
1695 move_freepages_block(zone, page, MIGRATE_HIGHATOMIC);
1699 spin_unlock_irqrestore(&zone->lock, flags);
1703 * Used when an allocation is about to fail under memory pressure. This
1704 * potentially hurts the reliability of high-order allocations when under
1705 * intense memory pressure but failed atomic allocations should be easier
1706 * to recover from than an OOM.
1708 static void unreserve_highatomic_pageblock(const struct alloc_context *ac)
1710 struct zonelist *zonelist = ac->zonelist;
1711 unsigned long flags;
1717 for_each_zone_zonelist_nodemask(zone, z, zonelist, ac->high_zoneidx,
1719 /* Preserve at least one pageblock */
1720 if (zone->nr_reserved_highatomic <= pageblock_nr_pages)
1723 spin_lock_irqsave(&zone->lock, flags);
1724 for (order = 0; order < MAX_ORDER; order++) {
1725 struct free_area *area = &(zone->free_area[order]);
1727 page = list_first_entry_or_null(
1728 &area->free_list[MIGRATE_HIGHATOMIC],
1734 * It should never happen but changes to locking could
1735 * inadvertently allow a per-cpu drain to add pages
1736 * to MIGRATE_HIGHATOMIC while unreserving so be safe
1737 * and watch for underflows.
1739 zone->nr_reserved_highatomic -= min(pageblock_nr_pages,
1740 zone->nr_reserved_highatomic);
1743 * Convert to ac->migratetype and avoid the normal
1744 * pageblock stealing heuristics. Minimally, the caller
1745 * is doing the work and needs the pages. More
1746 * importantly, if the block was always converted to
1747 * MIGRATE_UNMOVABLE or another type then the number
1748 * of pageblocks that cannot be completely freed
1751 set_pageblock_migratetype(page, ac->migratetype);
1752 move_freepages_block(zone, page, ac->migratetype);
1753 spin_unlock_irqrestore(&zone->lock, flags);
1756 spin_unlock_irqrestore(&zone->lock, flags);
1760 /* Remove an element from the buddy allocator from the fallback list */
1761 static inline struct page *
1762 __rmqueue_fallback(struct zone *zone, unsigned int order, int start_migratetype)
1764 struct free_area *area;
1765 unsigned int current_order;
1770 /* Find the largest possible block of pages in the other list */
1771 for (current_order = MAX_ORDER-1;
1772 current_order >= order && current_order <= MAX_ORDER-1;
1774 area = &(zone->free_area[current_order]);
1775 fallback_mt = find_suitable_fallback(area, current_order,
1776 start_migratetype, false, &can_steal);
1777 if (fallback_mt == -1)
1780 page = list_first_entry(&area->free_list[fallback_mt],
1783 steal_suitable_fallback(zone, page, start_migratetype);
1785 /* Remove the page from the freelists */
1787 list_del(&page->lru);
1788 rmv_page_order(page);
1790 expand(zone, page, order, current_order, area,
1793 * The pcppage_migratetype may differ from pageblock's
1794 * migratetype depending on the decisions in
1795 * find_suitable_fallback(). This is OK as long as it does not
1796 * differ for MIGRATE_CMA pageblocks. Those can be used as
1797 * fallback only via special __rmqueue_cma_fallback() function
1799 set_pcppage_migratetype(page, start_migratetype);
1801 trace_mm_page_alloc_extfrag(page, order, current_order,
1802 start_migratetype, fallback_mt);
1811 * Do the hard work of removing an element from the buddy allocator.
1812 * Call me with the zone->lock already held.
1814 static struct page *__rmqueue(struct zone *zone, unsigned int order,
1819 page = __rmqueue_smallest(zone, order, migratetype);
1820 if (unlikely(!page)) {
1821 if (migratetype == MIGRATE_MOVABLE)
1822 page = __rmqueue_cma_fallback(zone, order);
1825 page = __rmqueue_fallback(zone, order, migratetype);
1828 trace_mm_page_alloc_zone_locked(page, order, migratetype);
1833 * Obtain a specified number of elements from the buddy allocator, all under
1834 * a single hold of the lock, for efficiency. Add them to the supplied list.
1835 * Returns the number of new pages which were placed at *list.
1837 static int rmqueue_bulk(struct zone *zone, unsigned int order,
1838 unsigned long count, struct list_head *list,
1839 int migratetype, bool cold)
1843 spin_lock(&zone->lock);
1844 for (i = 0; i < count; ++i) {
1845 struct page *page = __rmqueue(zone, order, migratetype);
1846 if (unlikely(page == NULL))
1850 * Split buddy pages returned by expand() are received here
1851 * in physical page order. The page is added to the callers and
1852 * list and the list head then moves forward. From the callers
1853 * perspective, the linked list is ordered by page number in
1854 * some conditions. This is useful for IO devices that can
1855 * merge IO requests if the physical pages are ordered
1859 list_add(&page->lru, list);
1861 list_add_tail(&page->lru, list);
1863 if (is_migrate_cma(get_pcppage_migratetype(page)))
1864 __mod_zone_page_state(zone, NR_FREE_CMA_PAGES,
1867 __mod_zone_page_state(zone, NR_FREE_PAGES, -(i << order));
1868 spin_unlock(&zone->lock);
1874 * Called from the vmstat counter updater to drain pagesets of this
1875 * currently executing processor on remote nodes after they have
1878 * Note that this function must be called with the thread pinned to
1879 * a single processor.
1881 void drain_zone_pages(struct zone *zone, struct per_cpu_pages *pcp)
1883 unsigned long flags;
1884 int to_drain, batch;
1886 local_irq_save(flags);
1887 batch = READ_ONCE(pcp->batch);
1888 to_drain = min(pcp->count, batch);
1890 free_pcppages_bulk(zone, to_drain, pcp);
1891 pcp->count -= to_drain;
1893 local_irq_restore(flags);
1898 * Drain pcplists of the indicated processor and zone.
1900 * The processor must either be the current processor and the
1901 * thread pinned to the current processor or a processor that
1904 static void drain_pages_zone(unsigned int cpu, struct zone *zone)
1906 unsigned long flags;
1907 struct per_cpu_pageset *pset;
1908 struct per_cpu_pages *pcp;
1910 local_irq_save(flags);
1911 pset = per_cpu_ptr(zone->pageset, cpu);
1915 free_pcppages_bulk(zone, pcp->count, pcp);
1918 local_irq_restore(flags);
1922 * Drain pcplists of all zones on the indicated processor.
1924 * The processor must either be the current processor and the
1925 * thread pinned to the current processor or a processor that
1928 static void drain_pages(unsigned int cpu)
1932 for_each_populated_zone(zone) {
1933 drain_pages_zone(cpu, zone);
1938 * Spill all of this CPU's per-cpu pages back into the buddy allocator.
1940 * The CPU has to be pinned. When zone parameter is non-NULL, spill just
1941 * the single zone's pages.
1943 void drain_local_pages(struct zone *zone)
1945 int cpu = smp_processor_id();
1948 drain_pages_zone(cpu, zone);
1954 * Spill all the per-cpu pages from all CPUs back into the buddy allocator.
1956 * When zone parameter is non-NULL, spill just the single zone's pages.
1958 * Note that this code is protected against sending an IPI to an offline
1959 * CPU but does not guarantee sending an IPI to newly hotplugged CPUs:
1960 * on_each_cpu_mask() blocks hotplug and won't talk to offlined CPUs but
1961 * nothing keeps CPUs from showing up after we populated the cpumask and
1962 * before the call to on_each_cpu_mask().
1964 void drain_all_pages(struct zone *zone)
1969 * Allocate in the BSS so we wont require allocation in
1970 * direct reclaim path for CONFIG_CPUMASK_OFFSTACK=y
1972 static cpumask_t cpus_with_pcps;
1975 * We don't care about racing with CPU hotplug event
1976 * as offline notification will cause the notified
1977 * cpu to drain that CPU pcps and on_each_cpu_mask
1978 * disables preemption as part of its processing
1980 for_each_online_cpu(cpu) {
1981 struct per_cpu_pageset *pcp;
1983 bool has_pcps = false;
1986 pcp = per_cpu_ptr(zone->pageset, cpu);
1990 for_each_populated_zone(z) {
1991 pcp = per_cpu_ptr(z->pageset, cpu);
1992 if (pcp->pcp.count) {
2000 cpumask_set_cpu(cpu, &cpus_with_pcps);
2002 cpumask_clear_cpu(cpu, &cpus_with_pcps);
2004 on_each_cpu_mask(&cpus_with_pcps, (smp_call_func_t) drain_local_pages,
2008 #ifdef CONFIG_HIBERNATION
2010 void mark_free_pages(struct zone *zone)
2012 unsigned long pfn, max_zone_pfn;
2013 unsigned long flags;
2014 unsigned int order, t;
2017 if (zone_is_empty(zone))
2020 spin_lock_irqsave(&zone->lock, flags);
2022 max_zone_pfn = zone_end_pfn(zone);
2023 for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
2024 if (pfn_valid(pfn)) {
2025 page = pfn_to_page(pfn);
2026 if (!swsusp_page_is_forbidden(page))
2027 swsusp_unset_page_free(page);
2030 for_each_migratetype_order(order, t) {
2031 list_for_each_entry(page,
2032 &zone->free_area[order].free_list[t], lru) {
2035 pfn = page_to_pfn(page);
2036 for (i = 0; i < (1UL << order); i++)
2037 swsusp_set_page_free(pfn_to_page(pfn + i));
2040 spin_unlock_irqrestore(&zone->lock, flags);
2042 #endif /* CONFIG_PM */
2045 * Free a 0-order page
2046 * cold == true ? free a cold page : free a hot page
2048 void free_hot_cold_page(struct page *page, bool cold)
2050 struct zone *zone = page_zone(page);
2051 struct per_cpu_pages *pcp;
2052 unsigned long flags;
2053 unsigned long pfn = page_to_pfn(page);
2056 if (!free_pages_prepare(page, 0))
2059 migratetype = get_pfnblock_migratetype(page, pfn);
2060 set_pcppage_migratetype(page, migratetype);
2061 local_irq_save(flags);
2062 __count_vm_event(PGFREE);
2065 * We only track unmovable, reclaimable and movable on pcp lists.
2066 * Free ISOLATE pages back to the allocator because they are being
2067 * offlined but treat RESERVE as movable pages so we can get those
2068 * areas back if necessary. Otherwise, we may have to free
2069 * excessively into the page allocator
2071 if (migratetype >= MIGRATE_PCPTYPES) {
2072 if (unlikely(is_migrate_isolate(migratetype))) {
2073 free_one_page(zone, page, pfn, 0, migratetype);
2076 migratetype = MIGRATE_MOVABLE;
2079 pcp = &this_cpu_ptr(zone->pageset)->pcp;
2081 list_add(&page->lru, &pcp->lists[migratetype]);
2083 list_add_tail(&page->lru, &pcp->lists[migratetype]);
2085 if (pcp->count >= pcp->high) {
2086 unsigned long batch = READ_ONCE(pcp->batch);
2087 free_pcppages_bulk(zone, batch, pcp);
2088 pcp->count -= batch;
2092 local_irq_restore(flags);
2096 * Free a list of 0-order pages
2098 void free_hot_cold_page_list(struct list_head *list, bool cold)
2100 struct page *page, *next;
2102 list_for_each_entry_safe(page, next, list, lru) {
2103 trace_mm_page_free_batched(page, cold);
2104 free_hot_cold_page(page, cold);
2109 * split_page takes a non-compound higher-order page, and splits it into
2110 * n (1<<order) sub-pages: page[0..n]
2111 * Each sub-page must be freed individually.
2113 * Note: this is probably too low level an operation for use in drivers.
2114 * Please consult with lkml before using this in your driver.
2116 void split_page(struct page *page, unsigned int order)
2121 VM_BUG_ON_PAGE(PageCompound(page), page);
2122 VM_BUG_ON_PAGE(!page_count(page), page);
2124 #ifdef CONFIG_KMEMCHECK
2126 * Split shadow pages too, because free(page[0]) would
2127 * otherwise free the whole shadow.
2129 if (kmemcheck_page_is_tracked(page))
2130 split_page(virt_to_page(page[0].shadow), order);
2133 gfp_mask = get_page_owner_gfp(page);
2134 set_page_owner(page, 0, gfp_mask);
2135 for (i = 1; i < (1 << order); i++) {
2136 set_page_refcounted(page + i);
2137 set_page_owner(page + i, 0, gfp_mask);
2140 EXPORT_SYMBOL_GPL(split_page);
2142 int __isolate_free_page(struct page *page, unsigned int order)
2144 unsigned long watermark;
2148 BUG_ON(!PageBuddy(page));
2150 zone = page_zone(page);
2151 mt = get_pageblock_migratetype(page);
2153 if (!is_migrate_isolate(mt)) {
2154 /* Obey watermarks as if the page was being allocated */
2155 watermark = low_wmark_pages(zone) + (1 << order);
2156 if (!zone_watermark_ok(zone, 0, watermark, 0, 0))
2159 __mod_zone_freepage_state(zone, -(1UL << order), mt);
2162 /* Remove page from free list */
2163 list_del(&page->lru);
2164 zone->free_area[order].nr_free--;
2165 rmv_page_order(page);
2167 set_page_owner(page, order, __GFP_MOVABLE);
2169 /* Set the pageblock if the isolated page is at least a pageblock */
2170 if (order >= pageblock_order - 1) {
2171 struct page *endpage = page + (1 << order) - 1;
2172 for (; page < endpage; page += pageblock_nr_pages) {
2173 int mt = get_pageblock_migratetype(page);
2174 if (!is_migrate_isolate(mt) && !is_migrate_cma(mt))
2175 set_pageblock_migratetype(page,
2181 return 1UL << order;
2185 * Similar to split_page except the page is already free. As this is only
2186 * being used for migration, the migratetype of the block also changes.
2187 * As this is called with interrupts disabled, the caller is responsible
2188 * for calling arch_alloc_page() and kernel_map_page() after interrupts
2191 * Note: this is probably too low level an operation for use in drivers.
2192 * Please consult with lkml before using this in your driver.
2194 int split_free_page(struct page *page)
2199 order = page_order(page);
2201 nr_pages = __isolate_free_page(page, order);
2205 /* Split into individual pages */
2206 set_page_refcounted(page);
2207 split_page(page, order);
2212 * Allocate a page from the given zone. Use pcplists for order-0 allocations.
2215 struct page *buffered_rmqueue(struct zone *preferred_zone,
2216 struct zone *zone, unsigned int order,
2217 gfp_t gfp_flags, int alloc_flags, int migratetype)
2219 unsigned long flags;
2221 bool cold = ((gfp_flags & __GFP_COLD) != 0);
2223 if (likely(order == 0)) {
2224 struct per_cpu_pages *pcp;
2225 struct list_head *list;
2227 local_irq_save(flags);
2228 pcp = &this_cpu_ptr(zone->pageset)->pcp;
2229 list = &pcp->lists[migratetype];
2230 if (list_empty(list)) {
2231 pcp->count += rmqueue_bulk(zone, 0,
2234 if (unlikely(list_empty(list)))
2239 page = list_last_entry(list, struct page, lru);
2241 page = list_first_entry(list, struct page, lru);
2243 list_del(&page->lru);
2246 if (unlikely(gfp_flags & __GFP_NOFAIL)) {
2248 * __GFP_NOFAIL is not to be used in new code.
2250 * All __GFP_NOFAIL callers should be fixed so that they
2251 * properly detect and handle allocation failures.
2253 * We most definitely don't want callers attempting to
2254 * allocate greater than order-1 page units with
2257 WARN_ON_ONCE(order > 1);
2259 spin_lock_irqsave(&zone->lock, flags);
2262 if (alloc_flags & ALLOC_HARDER) {
2263 page = __rmqueue_smallest(zone, order, MIGRATE_HIGHATOMIC);
2265 trace_mm_page_alloc_zone_locked(page, order, migratetype);
2268 page = __rmqueue(zone, order, migratetype);
2269 spin_unlock(&zone->lock);
2272 __mod_zone_freepage_state(zone, -(1 << order),
2273 get_pcppage_migratetype(page));
2276 __mod_zone_page_state(zone, NR_ALLOC_BATCH, -(1 << order));
2277 if (atomic_long_read(&zone->vm_stat[NR_ALLOC_BATCH]) <= 0 &&
2278 !test_bit(ZONE_FAIR_DEPLETED, &zone->flags))
2279 set_bit(ZONE_FAIR_DEPLETED, &zone->flags);
2281 __count_zone_vm_events(PGALLOC, zone, 1 << order);
2282 zone_statistics(preferred_zone, zone, gfp_flags);
2283 local_irq_restore(flags);
2285 VM_BUG_ON_PAGE(bad_range(zone, page), page);
2289 local_irq_restore(flags);
2293 #ifdef CONFIG_FAIL_PAGE_ALLOC
2296 struct fault_attr attr;
2298 bool ignore_gfp_highmem;
2299 bool ignore_gfp_reclaim;
2301 } fail_page_alloc = {
2302 .attr = FAULT_ATTR_INITIALIZER,
2303 .ignore_gfp_reclaim = true,
2304 .ignore_gfp_highmem = true,
2308 static int __init setup_fail_page_alloc(char *str)
2310 return setup_fault_attr(&fail_page_alloc.attr, str);
2312 __setup("fail_page_alloc=", setup_fail_page_alloc);
2314 static bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
2316 if (order < fail_page_alloc.min_order)
2318 if (gfp_mask & __GFP_NOFAIL)
2320 if (fail_page_alloc.ignore_gfp_highmem && (gfp_mask & __GFP_HIGHMEM))
2322 if (fail_page_alloc.ignore_gfp_reclaim &&
2323 (gfp_mask & __GFP_DIRECT_RECLAIM))
2326 return should_fail(&fail_page_alloc.attr, 1 << order);
2329 #ifdef CONFIG_FAULT_INJECTION_DEBUG_FS
2331 static int __init fail_page_alloc_debugfs(void)
2333 umode_t mode = S_IFREG | S_IRUSR | S_IWUSR;
2336 dir = fault_create_debugfs_attr("fail_page_alloc", NULL,
2337 &fail_page_alloc.attr);
2339 return PTR_ERR(dir);
2341 if (!debugfs_create_bool("ignore-gfp-wait", mode, dir,
2342 &fail_page_alloc.ignore_gfp_reclaim))
2344 if (!debugfs_create_bool("ignore-gfp-highmem", mode, dir,
2345 &fail_page_alloc.ignore_gfp_highmem))
2347 if (!debugfs_create_u32("min-order", mode, dir,
2348 &fail_page_alloc.min_order))
2353 debugfs_remove_recursive(dir);
2358 late_initcall(fail_page_alloc_debugfs);
2360 #endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */
2362 #else /* CONFIG_FAIL_PAGE_ALLOC */
2364 static inline bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
2369 #endif /* CONFIG_FAIL_PAGE_ALLOC */
2372 * Return true if free base pages are above 'mark'. For high-order checks it
2373 * will return true of the order-0 watermark is reached and there is at least
2374 * one free page of a suitable size. Checking now avoids taking the zone lock
2375 * to check in the allocation paths if no pages are free.
2377 static bool __zone_watermark_ok(struct zone *z, unsigned int order,
2378 unsigned long mark, int classzone_idx, int alloc_flags,
2383 const int alloc_harder = (alloc_flags & ALLOC_HARDER);
2385 /* free_pages may go negative - that's OK */
2386 free_pages -= (1 << order) - 1;
2388 if (alloc_flags & ALLOC_HIGH)
2392 * If the caller does not have rights to ALLOC_HARDER then subtract
2393 * the high-atomic reserves. This will over-estimate the size of the
2394 * atomic reserve but it avoids a search.
2396 if (likely(!alloc_harder))
2397 free_pages -= z->nr_reserved_highatomic;
2402 /* If allocation can't use CMA areas don't use free CMA pages */
2403 if (!(alloc_flags & ALLOC_CMA))
2404 free_pages -= zone_page_state(z, NR_FREE_CMA_PAGES);
2408 * Check watermarks for an order-0 allocation request. If these
2409 * are not met, then a high-order request also cannot go ahead
2410 * even if a suitable page happened to be free.
2412 if (free_pages <= min + z->lowmem_reserve[classzone_idx])
2415 /* If this is an order-0 request then the watermark is fine */
2419 /* For a high-order request, check at least one suitable page is free */
2420 for (o = order; o < MAX_ORDER; o++) {
2421 struct free_area *area = &z->free_area[o];
2430 for (mt = 0; mt < MIGRATE_PCPTYPES; mt++) {
2431 if (!list_empty(&area->free_list[mt]))
2436 if ((alloc_flags & ALLOC_CMA) &&
2437 !list_empty(&area->free_list[MIGRATE_CMA])) {
2445 bool zone_watermark_ok(struct zone *z, unsigned int order, unsigned long mark,
2446 int classzone_idx, int alloc_flags)
2448 return __zone_watermark_ok(z, order, mark, classzone_idx, alloc_flags,
2449 zone_page_state(z, NR_FREE_PAGES));
2452 bool zone_watermark_ok_safe(struct zone *z, unsigned int order,
2453 unsigned long mark, int classzone_idx)
2455 long free_pages = zone_page_state(z, NR_FREE_PAGES);
2457 if (z->percpu_drift_mark && free_pages < z->percpu_drift_mark)
2458 free_pages = zone_page_state_snapshot(z, NR_FREE_PAGES);
2460 return __zone_watermark_ok(z, order, mark, classzone_idx, 0,
2465 static bool zone_local(struct zone *local_zone, struct zone *zone)
2467 return local_zone->node == zone->node;
2470 static bool zone_allows_reclaim(struct zone *local_zone, struct zone *zone)
2472 return node_distance(zone_to_nid(local_zone), zone_to_nid(zone)) <
2475 #else /* CONFIG_NUMA */
2476 static bool zone_local(struct zone *local_zone, struct zone *zone)
2481 static bool zone_allows_reclaim(struct zone *local_zone, struct zone *zone)
2485 #endif /* CONFIG_NUMA */
2487 static void reset_alloc_batches(struct zone *preferred_zone)
2489 struct zone *zone = preferred_zone->zone_pgdat->node_zones;
2492 mod_zone_page_state(zone, NR_ALLOC_BATCH,
2493 high_wmark_pages(zone) - low_wmark_pages(zone) -
2494 atomic_long_read(&zone->vm_stat[NR_ALLOC_BATCH]));
2495 clear_bit(ZONE_FAIR_DEPLETED, &zone->flags);
2496 } while (zone++ != preferred_zone);
2500 * get_page_from_freelist goes through the zonelist trying to allocate
2503 static struct page *
2504 get_page_from_freelist(gfp_t gfp_mask, unsigned int order, int alloc_flags,
2505 const struct alloc_context *ac)
2507 struct zonelist *zonelist = ac->zonelist;
2509 struct page *page = NULL;
2511 int nr_fair_skipped = 0;
2512 bool zonelist_rescan;
2515 zonelist_rescan = false;
2518 * Scan zonelist, looking for a zone with enough free.
2519 * See also __cpuset_node_allowed() comment in kernel/cpuset.c.
2521 for_each_zone_zonelist_nodemask(zone, z, zonelist, ac->high_zoneidx,
2525 if (cpusets_enabled() &&
2526 (alloc_flags & ALLOC_CPUSET) &&
2527 !cpuset_zone_allowed(zone, gfp_mask))
2530 * Distribute pages in proportion to the individual
2531 * zone size to ensure fair page aging. The zone a
2532 * page was allocated in should have no effect on the
2533 * time the page has in memory before being reclaimed.
2535 if (alloc_flags & ALLOC_FAIR) {
2536 if (!zone_local(ac->preferred_zone, zone))
2538 if (test_bit(ZONE_FAIR_DEPLETED, &zone->flags)) {
2544 * When allocating a page cache page for writing, we
2545 * want to get it from a zone that is within its dirty
2546 * limit, such that no single zone holds more than its
2547 * proportional share of globally allowed dirty pages.
2548 * The dirty limits take into account the zone's
2549 * lowmem reserves and high watermark so that kswapd
2550 * should be able to balance it without having to
2551 * write pages from its LRU list.
2553 * This may look like it could increase pressure on
2554 * lower zones by failing allocations in higher zones
2555 * before they are full. But the pages that do spill
2556 * over are limited as the lower zones are protected
2557 * by this very same mechanism. It should not become
2558 * a practical burden to them.
2560 * XXX: For now, allow allocations to potentially
2561 * exceed the per-zone dirty limit in the slowpath
2562 * (spread_dirty_pages unset) before going into reclaim,
2563 * which is important when on a NUMA setup the allowed
2564 * zones are together not big enough to reach the
2565 * global limit. The proper fix for these situations
2566 * will require awareness of zones in the
2567 * dirty-throttling and the flusher threads.
2569 if (ac->spread_dirty_pages && !zone_dirty_ok(zone))
2572 mark = zone->watermark[alloc_flags & ALLOC_WMARK_MASK];
2573 if (!zone_watermark_ok(zone, order, mark,
2574 ac->classzone_idx, alloc_flags)) {
2577 /* Checked here to keep the fast path fast */
2578 BUILD_BUG_ON(ALLOC_NO_WATERMARKS < NR_WMARK);
2579 if (alloc_flags & ALLOC_NO_WATERMARKS)
2582 if (zone_reclaim_mode == 0 ||
2583 !zone_allows_reclaim(ac->preferred_zone, zone))
2586 ret = zone_reclaim(zone, gfp_mask, order);
2588 case ZONE_RECLAIM_NOSCAN:
2591 case ZONE_RECLAIM_FULL:
2592 /* scanned but unreclaimable */
2595 /* did we reclaim enough */
2596 if (zone_watermark_ok(zone, order, mark,
2597 ac->classzone_idx, alloc_flags))
2605 page = buffered_rmqueue(ac->preferred_zone, zone, order,
2606 gfp_mask, alloc_flags, ac->migratetype);
2608 if (prep_new_page(page, order, gfp_mask, alloc_flags))
2612 * If this is a high-order atomic allocation then check
2613 * if the pageblock should be reserved for the future
2615 if (unlikely(order && (alloc_flags & ALLOC_HARDER)))
2616 reserve_highatomic_pageblock(page, zone, order);
2623 * The first pass makes sure allocations are spread fairly within the
2624 * local node. However, the local node might have free pages left
2625 * after the fairness batches are exhausted, and remote zones haven't
2626 * even been considered yet. Try once more without fairness, and
2627 * include remote zones now, before entering the slowpath and waking
2628 * kswapd: prefer spilling to a remote zone over swapping locally.
2630 if (alloc_flags & ALLOC_FAIR) {
2631 alloc_flags &= ~ALLOC_FAIR;
2632 if (nr_fair_skipped) {
2633 zonelist_rescan = true;
2634 reset_alloc_batches(ac->preferred_zone);
2636 if (nr_online_nodes > 1)
2637 zonelist_rescan = true;
2640 if (zonelist_rescan)
2647 * Large machines with many possible nodes should not always dump per-node
2648 * meminfo in irq context.
2650 static inline bool should_suppress_show_mem(void)
2655 ret = in_interrupt();
2660 static DEFINE_RATELIMIT_STATE(nopage_rs,
2661 DEFAULT_RATELIMIT_INTERVAL,
2662 DEFAULT_RATELIMIT_BURST);
2664 void warn_alloc_failed(gfp_t gfp_mask, unsigned int order, const char *fmt, ...)
2666 unsigned int filter = SHOW_MEM_FILTER_NODES;
2668 if ((gfp_mask & __GFP_NOWARN) || !__ratelimit(&nopage_rs) ||
2669 debug_guardpage_minorder() > 0)
2673 * This documents exceptions given to allocations in certain
2674 * contexts that are allowed to allocate outside current's set
2677 if (!(gfp_mask & __GFP_NOMEMALLOC))
2678 if (test_thread_flag(TIF_MEMDIE) ||
2679 (current->flags & (PF_MEMALLOC | PF_EXITING)))
2680 filter &= ~SHOW_MEM_FILTER_NODES;
2681 if (in_interrupt() || !(gfp_mask & __GFP_DIRECT_RECLAIM))
2682 filter &= ~SHOW_MEM_FILTER_NODES;
2685 struct va_format vaf;
2688 va_start(args, fmt);
2693 pr_warn("%pV", &vaf);
2698 pr_warn("%s: page allocation failure: order:%u, mode:0x%x\n",
2699 current->comm, order, gfp_mask);
2702 if (!should_suppress_show_mem())
2706 static inline struct page *
2707 __alloc_pages_may_oom(gfp_t gfp_mask, unsigned int order,
2708 const struct alloc_context *ac, unsigned long *did_some_progress)
2710 struct oom_control oc = {
2711 .zonelist = ac->zonelist,
2712 .nodemask = ac->nodemask,
2713 .gfp_mask = gfp_mask,
2718 *did_some_progress = 0;
2721 * Acquire the oom lock. If that fails, somebody else is
2722 * making progress for us.
2724 if (!mutex_trylock(&oom_lock)) {
2725 *did_some_progress = 1;
2726 schedule_timeout_uninterruptible(1);
2731 * Go through the zonelist yet one more time, keep very high watermark
2732 * here, this is only to catch a parallel oom killing, we must fail if
2733 * we're still under heavy pressure.
2735 page = get_page_from_freelist(gfp_mask | __GFP_HARDWALL, order,
2736 ALLOC_WMARK_HIGH|ALLOC_CPUSET, ac);
2740 if (!(gfp_mask & __GFP_NOFAIL)) {
2741 /* Coredumps can quickly deplete all memory reserves */
2742 if (current->flags & PF_DUMPCORE)
2744 /* The OOM killer will not help higher order allocs */
2745 if (order > PAGE_ALLOC_COSTLY_ORDER)
2747 /* The OOM killer does not needlessly kill tasks for lowmem */
2748 if (ac->high_zoneidx < ZONE_NORMAL)
2750 /* The OOM killer does not compensate for IO-less reclaim */
2751 if (!(gfp_mask & __GFP_FS)) {
2753 * XXX: Page reclaim didn't yield anything,
2754 * and the OOM killer can't be invoked, but
2755 * keep looping as per tradition.
2757 *did_some_progress = 1;
2760 if (pm_suspended_storage())
2762 /* The OOM killer may not free memory on a specific node */
2763 if (gfp_mask & __GFP_THISNODE)
2766 /* Exhausted what can be done so it's blamo time */
2767 if (out_of_memory(&oc) || WARN_ON_ONCE(gfp_mask & __GFP_NOFAIL)) {
2768 *did_some_progress = 1;
2770 if (gfp_mask & __GFP_NOFAIL) {
2771 page = get_page_from_freelist(gfp_mask, order,
2772 ALLOC_NO_WATERMARKS|ALLOC_CPUSET, ac);
2774 * fallback to ignore cpuset restriction if our nodes
2778 page = get_page_from_freelist(gfp_mask, order,
2779 ALLOC_NO_WATERMARKS, ac);
2783 mutex_unlock(&oom_lock);
2787 #ifdef CONFIG_COMPACTION
2788 /* Try memory compaction for high-order allocations before reclaim */
2789 static struct page *
2790 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
2791 int alloc_flags, const struct alloc_context *ac,
2792 enum migrate_mode mode, int *contended_compaction,
2793 bool *deferred_compaction)
2795 unsigned long compact_result;
2801 current->flags |= PF_MEMALLOC;
2802 compact_result = try_to_compact_pages(gfp_mask, order, alloc_flags, ac,
2803 mode, contended_compaction);
2804 current->flags &= ~PF_MEMALLOC;
2806 switch (compact_result) {
2807 case COMPACT_DEFERRED:
2808 *deferred_compaction = true;
2810 case COMPACT_SKIPPED:
2817 * At least in one zone compaction wasn't deferred or skipped, so let's
2818 * count a compaction stall
2820 count_vm_event(COMPACTSTALL);
2822 page = get_page_from_freelist(gfp_mask, order,
2823 alloc_flags & ~ALLOC_NO_WATERMARKS, ac);
2826 struct zone *zone = page_zone(page);
2828 zone->compact_blockskip_flush = false;
2829 compaction_defer_reset(zone, order, true);
2830 count_vm_event(COMPACTSUCCESS);
2835 * It's bad if compaction run occurs and fails. The most likely reason
2836 * is that pages exist, but not enough to satisfy watermarks.
2838 count_vm_event(COMPACTFAIL);
2845 static inline struct page *
2846 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
2847 int alloc_flags, const struct alloc_context *ac,
2848 enum migrate_mode mode, int *contended_compaction,
2849 bool *deferred_compaction)
2853 #endif /* CONFIG_COMPACTION */
2855 /* Perform direct synchronous page reclaim */
2857 __perform_reclaim(gfp_t gfp_mask, unsigned int order,
2858 const struct alloc_context *ac)
2860 struct reclaim_state reclaim_state;
2865 /* We now go into synchronous reclaim */
2866 cpuset_memory_pressure_bump();
2867 current->flags |= PF_MEMALLOC;
2868 lockdep_set_current_reclaim_state(gfp_mask);
2869 reclaim_state.reclaimed_slab = 0;
2870 current->reclaim_state = &reclaim_state;
2872 progress = try_to_free_pages(ac->zonelist, order, gfp_mask,
2875 current->reclaim_state = NULL;
2876 lockdep_clear_current_reclaim_state();
2877 current->flags &= ~PF_MEMALLOC;
2884 /* The really slow allocator path where we enter direct reclaim */
2885 static inline struct page *
2886 __alloc_pages_direct_reclaim(gfp_t gfp_mask, unsigned int order,
2887 int alloc_flags, const struct alloc_context *ac,
2888 unsigned long *did_some_progress)
2890 struct page *page = NULL;
2891 bool drained = false;
2893 *did_some_progress = __perform_reclaim(gfp_mask, order, ac);
2894 if (unlikely(!(*did_some_progress)))
2898 page = get_page_from_freelist(gfp_mask, order,
2899 alloc_flags & ~ALLOC_NO_WATERMARKS, ac);
2902 * If an allocation failed after direct reclaim, it could be because
2903 * pages are pinned on the per-cpu lists or in high alloc reserves.
2904 * Shrink them them and try again
2906 if (!page && !drained) {
2907 unreserve_highatomic_pageblock(ac);
2908 drain_all_pages(NULL);
2916 static void wake_all_kswapds(unsigned int order, const struct alloc_context *ac)
2921 for_each_zone_zonelist_nodemask(zone, z, ac->zonelist,
2922 ac->high_zoneidx, ac->nodemask)
2923 wakeup_kswapd(zone, order, zone_idx(ac->preferred_zone));
2927 gfp_to_alloc_flags(gfp_t gfp_mask)
2929 int alloc_flags = ALLOC_WMARK_MIN | ALLOC_CPUSET;
2931 /* __GFP_HIGH is assumed to be the same as ALLOC_HIGH to save a branch. */
2932 BUILD_BUG_ON(__GFP_HIGH != (__force gfp_t) ALLOC_HIGH);
2935 * The caller may dip into page reserves a bit more if the caller
2936 * cannot run direct reclaim, or if the caller has realtime scheduling
2937 * policy or is asking for __GFP_HIGH memory. GFP_ATOMIC requests will
2938 * set both ALLOC_HARDER (__GFP_ATOMIC) and ALLOC_HIGH (__GFP_HIGH).
2940 alloc_flags |= (__force int) (gfp_mask & __GFP_HIGH);
2942 if (gfp_mask & __GFP_ATOMIC) {
2944 * Not worth trying to allocate harder for __GFP_NOMEMALLOC even
2945 * if it can't schedule.
2947 if (!(gfp_mask & __GFP_NOMEMALLOC))
2948 alloc_flags |= ALLOC_HARDER;
2950 * Ignore cpuset mems for GFP_ATOMIC rather than fail, see the
2951 * comment for __cpuset_node_allowed().
2953 alloc_flags &= ~ALLOC_CPUSET;
2954 } else if (unlikely(rt_task(current)) && !in_interrupt())
2955 alloc_flags |= ALLOC_HARDER;
2957 if (likely(!(gfp_mask & __GFP_NOMEMALLOC))) {
2958 if (gfp_mask & __GFP_MEMALLOC)
2959 alloc_flags |= ALLOC_NO_WATERMARKS;
2960 else if (in_serving_softirq() && (current->flags & PF_MEMALLOC))
2961 alloc_flags |= ALLOC_NO_WATERMARKS;
2962 else if (!in_interrupt() &&
2963 ((current->flags & PF_MEMALLOC) ||
2964 unlikely(test_thread_flag(TIF_MEMDIE))))
2965 alloc_flags |= ALLOC_NO_WATERMARKS;
2968 if (gfpflags_to_migratetype(gfp_mask) == MIGRATE_MOVABLE)
2969 alloc_flags |= ALLOC_CMA;
2974 bool gfp_pfmemalloc_allowed(gfp_t gfp_mask)
2976 return !!(gfp_to_alloc_flags(gfp_mask) & ALLOC_NO_WATERMARKS);
2979 static inline bool is_thp_gfp_mask(gfp_t gfp_mask)
2981 return (gfp_mask & (GFP_TRANSHUGE | __GFP_KSWAPD_RECLAIM)) == GFP_TRANSHUGE;
2984 static inline struct page *
2985 __alloc_pages_slowpath(gfp_t gfp_mask, unsigned int order,
2986 struct alloc_context *ac)
2988 bool can_direct_reclaim = gfp_mask & __GFP_DIRECT_RECLAIM;
2989 struct page *page = NULL;
2991 unsigned long pages_reclaimed = 0;
2992 unsigned long did_some_progress;
2993 enum migrate_mode migration_mode = MIGRATE_ASYNC;
2994 bool deferred_compaction = false;
2995 int contended_compaction = COMPACT_CONTENDED_NONE;
2998 * In the slowpath, we sanity check order to avoid ever trying to
2999 * reclaim >= MAX_ORDER areas which will never succeed. Callers may
3000 * be using allocators in order of preference for an area that is
3003 if (order >= MAX_ORDER) {
3004 WARN_ON_ONCE(!(gfp_mask & __GFP_NOWARN));
3009 * We also sanity check to catch abuse of atomic reserves being used by
3010 * callers that are not in atomic context.
3012 if (WARN_ON_ONCE((gfp_mask & (__GFP_ATOMIC|__GFP_DIRECT_RECLAIM)) ==
3013 (__GFP_ATOMIC|__GFP_DIRECT_RECLAIM)))
3014 gfp_mask &= ~__GFP_ATOMIC;
3017 * If this allocation cannot block and it is for a specific node, then
3018 * fail early. There's no need to wakeup kswapd or retry for a
3019 * speculative node-specific allocation.
3021 if (IS_ENABLED(CONFIG_NUMA) && (gfp_mask & __GFP_THISNODE) && !can_direct_reclaim)
3025 if (gfp_mask & __GFP_KSWAPD_RECLAIM)
3026 wake_all_kswapds(order, ac);
3029 * OK, we're below the kswapd watermark and have kicked background
3030 * reclaim. Now things get more complex, so set up alloc_flags according
3031 * to how we want to proceed.
3033 alloc_flags = gfp_to_alloc_flags(gfp_mask);
3036 * Find the true preferred zone if the allocation is unconstrained by
3039 if (!(alloc_flags & ALLOC_CPUSET) && !ac->nodemask) {
3040 struct zoneref *preferred_zoneref;
3041 preferred_zoneref = first_zones_zonelist(ac->zonelist,
3042 ac->high_zoneidx, NULL, &ac->preferred_zone);
3043 ac->classzone_idx = zonelist_zone_idx(preferred_zoneref);
3046 /* This is the last chance, in general, before the goto nopage. */
3047 page = get_page_from_freelist(gfp_mask, order,
3048 alloc_flags & ~ALLOC_NO_WATERMARKS, ac);
3052 /* Allocate without watermarks if the context allows */
3053 if (alloc_flags & ALLOC_NO_WATERMARKS) {
3055 * Ignore mempolicies if ALLOC_NO_WATERMARKS on the grounds
3056 * the allocation is high priority and these type of
3057 * allocations are system rather than user orientated
3059 ac->zonelist = node_zonelist(numa_node_id(), gfp_mask);
3060 page = get_page_from_freelist(gfp_mask, order,
3061 ALLOC_NO_WATERMARKS, ac);
3066 /* Caller is not willing to reclaim, we can't balance anything */
3067 if (!can_direct_reclaim) {
3069 * All existing users of the __GFP_NOFAIL are blockable, so warn
3070 * of any new users that actually allow this type of allocation
3073 WARN_ON_ONCE(gfp_mask & __GFP_NOFAIL);
3077 /* Avoid recursion of direct reclaim */
3078 if (current->flags & PF_MEMALLOC) {
3080 * __GFP_NOFAIL request from this context is rather bizarre
3081 * because we cannot reclaim anything and only can loop waiting
3082 * for somebody to do a work for us.
3084 if (WARN_ON_ONCE(gfp_mask & __GFP_NOFAIL)) {
3091 /* Avoid allocations with no watermarks from looping endlessly */
3092 if (test_thread_flag(TIF_MEMDIE) && !(gfp_mask & __GFP_NOFAIL))
3096 * Try direct compaction. The first pass is asynchronous. Subsequent
3097 * attempts after direct reclaim are synchronous
3099 page = __alloc_pages_direct_compact(gfp_mask, order, alloc_flags, ac,
3101 &contended_compaction,
3102 &deferred_compaction);
3106 /* Checks for THP-specific high-order allocations */
3107 if (is_thp_gfp_mask(gfp_mask)) {
3109 * If compaction is deferred for high-order allocations, it is
3110 * because sync compaction recently failed. If this is the case
3111 * and the caller requested a THP allocation, we do not want
3112 * to heavily disrupt the system, so we fail the allocation
3113 * instead of entering direct reclaim.
3115 if (deferred_compaction)
3119 * In all zones where compaction was attempted (and not
3120 * deferred or skipped), lock contention has been detected.
3121 * For THP allocation we do not want to disrupt the others
3122 * so we fallback to base pages instead.
3124 if (contended_compaction == COMPACT_CONTENDED_LOCK)
3128 * If compaction was aborted due to need_resched(), we do not
3129 * want to further increase allocation latency, unless it is
3130 * khugepaged trying to collapse.
3132 if (contended_compaction == COMPACT_CONTENDED_SCHED
3133 && !(current->flags & PF_KTHREAD))
3138 * It can become very expensive to allocate transparent hugepages at
3139 * fault, so use asynchronous memory compaction for THP unless it is
3140 * khugepaged trying to collapse.
3142 if (!is_thp_gfp_mask(gfp_mask) || (current->flags & PF_KTHREAD))
3143 migration_mode = MIGRATE_SYNC_LIGHT;
3145 /* Try direct reclaim and then allocating */
3146 page = __alloc_pages_direct_reclaim(gfp_mask, order, alloc_flags, ac,
3147 &did_some_progress);
3151 /* Do not loop if specifically requested */
3152 if (gfp_mask & __GFP_NORETRY)
3155 /* Keep reclaiming pages as long as there is reasonable progress */
3156 pages_reclaimed += did_some_progress;
3157 if ((did_some_progress && order <= PAGE_ALLOC_COSTLY_ORDER) ||
3158 ((gfp_mask & __GFP_REPEAT) && pages_reclaimed < (1 << order))) {
3159 /* Wait for some write requests to complete then retry */
3160 wait_iff_congested(ac->preferred_zone, BLK_RW_ASYNC, HZ/50);
3164 /* Reclaim has failed us, start killing things */
3165 page = __alloc_pages_may_oom(gfp_mask, order, ac, &did_some_progress);
3169 /* Retry as long as the OOM killer is making progress */
3170 if (did_some_progress)
3175 * High-order allocations do not necessarily loop after
3176 * direct reclaim and reclaim/compaction depends on compaction
3177 * being called after reclaim so call directly if necessary
3179 page = __alloc_pages_direct_compact(gfp_mask, order, alloc_flags,
3181 &contended_compaction,
3182 &deferred_compaction);
3186 warn_alloc_failed(gfp_mask, order, NULL);
3192 * This is the 'heart' of the zoned buddy allocator.
3195 __alloc_pages_nodemask(gfp_t gfp_mask, unsigned int order,
3196 struct zonelist *zonelist, nodemask_t *nodemask)
3198 struct zoneref *preferred_zoneref;
3199 struct page *page = NULL;
3200 unsigned int cpuset_mems_cookie;
3201 int alloc_flags = ALLOC_WMARK_LOW|ALLOC_CPUSET|ALLOC_FAIR;
3202 gfp_t alloc_mask; /* The gfp_t that was actually used for allocation */
3203 struct alloc_context ac = {
3204 .high_zoneidx = gfp_zone(gfp_mask),
3205 .nodemask = nodemask,
3206 .migratetype = gfpflags_to_migratetype(gfp_mask),
3209 gfp_mask &= gfp_allowed_mask;
3211 lockdep_trace_alloc(gfp_mask);
3213 might_sleep_if(gfp_mask & __GFP_DIRECT_RECLAIM);
3215 if (should_fail_alloc_page(gfp_mask, order))
3219 * Check the zones suitable for the gfp_mask contain at least one
3220 * valid zone. It's possible to have an empty zonelist as a result
3221 * of __GFP_THISNODE and a memoryless node
3223 if (unlikely(!zonelist->_zonerefs->zone))
3226 if (IS_ENABLED(CONFIG_CMA) && ac.migratetype == MIGRATE_MOVABLE)
3227 alloc_flags |= ALLOC_CMA;
3230 cpuset_mems_cookie = read_mems_allowed_begin();
3232 /* We set it here, as __alloc_pages_slowpath might have changed it */
3233 ac.zonelist = zonelist;
3235 /* Dirty zone balancing only done in the fast path */
3236 ac.spread_dirty_pages = (gfp_mask & __GFP_WRITE);
3238 /* The preferred zone is used for statistics later */
3239 preferred_zoneref = first_zones_zonelist(ac.zonelist, ac.high_zoneidx,
3240 ac.nodemask ? : &cpuset_current_mems_allowed,
3241 &ac.preferred_zone);
3242 if (!ac.preferred_zone)
3244 ac.classzone_idx = zonelist_zone_idx(preferred_zoneref);
3246 /* First allocation attempt */
3247 alloc_mask = gfp_mask|__GFP_HARDWALL;
3248 page = get_page_from_freelist(alloc_mask, order, alloc_flags, &ac);
3249 if (unlikely(!page)) {
3251 * Runtime PM, block IO and its error handling path
3252 * can deadlock because I/O on the device might not
3255 alloc_mask = memalloc_noio_flags(gfp_mask);
3256 ac.spread_dirty_pages = false;
3258 page = __alloc_pages_slowpath(alloc_mask, order, &ac);
3261 if (kmemcheck_enabled && page)
3262 kmemcheck_pagealloc_alloc(page, order, gfp_mask);
3264 trace_mm_page_alloc(page, order, alloc_mask, ac.migratetype);
3268 * When updating a task's mems_allowed, it is possible to race with
3269 * parallel threads in such a way that an allocation can fail while
3270 * the mask is being updated. If a page allocation is about to fail,
3271 * check if the cpuset changed during allocation and if so, retry.
3273 if (unlikely(!page && read_mems_allowed_retry(cpuset_mems_cookie)))
3278 EXPORT_SYMBOL(__alloc_pages_nodemask);
3281 * Common helper functions.
3283 unsigned long __get_free_pages(gfp_t gfp_mask, unsigned int order)
3288 * __get_free_pages() returns a 32-bit address, which cannot represent
3291 VM_BUG_ON((gfp_mask & __GFP_HIGHMEM) != 0);
3293 page = alloc_pages(gfp_mask, order);
3296 return (unsigned long) page_address(page);
3298 EXPORT_SYMBOL(__get_free_pages);
3300 unsigned long get_zeroed_page(gfp_t gfp_mask)
3302 return __get_free_pages(gfp_mask | __GFP_ZERO, 0);
3304 EXPORT_SYMBOL(get_zeroed_page);
3306 void __free_pages(struct page *page, unsigned int order)
3308 if (put_page_testzero(page)) {
3310 free_hot_cold_page(page, false);
3312 __free_pages_ok(page, order);
3316 EXPORT_SYMBOL(__free_pages);
3318 void free_pages(unsigned long addr, unsigned int order)
3321 VM_BUG_ON(!virt_addr_valid((void *)addr));
3322 __free_pages(virt_to_page((void *)addr), order);
3326 EXPORT_SYMBOL(free_pages);
3330 * An arbitrary-length arbitrary-offset area of memory which resides
3331 * within a 0 or higher order page. Multiple fragments within that page
3332 * are individually refcounted, in the page's reference counter.
3334 * The page_frag functions below provide a simple allocation framework for
3335 * page fragments. This is used by the network stack and network device
3336 * drivers to provide a backing region of memory for use as either an
3337 * sk_buff->head, or to be used in the "frags" portion of skb_shared_info.
3339 static struct page *__page_frag_refill(struct page_frag_cache *nc,
3342 struct page *page = NULL;
3343 gfp_t gfp = gfp_mask;
3345 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
3346 gfp_mask |= __GFP_COMP | __GFP_NOWARN | __GFP_NORETRY |
3348 page = alloc_pages_node(NUMA_NO_NODE, gfp_mask,
3349 PAGE_FRAG_CACHE_MAX_ORDER);
3350 nc->size = page ? PAGE_FRAG_CACHE_MAX_SIZE : PAGE_SIZE;
3352 if (unlikely(!page))
3353 page = alloc_pages_node(NUMA_NO_NODE, gfp, 0);
3355 nc->va = page ? page_address(page) : NULL;
3360 void *__alloc_page_frag(struct page_frag_cache *nc,
3361 unsigned int fragsz, gfp_t gfp_mask)
3363 unsigned int size = PAGE_SIZE;
3367 if (unlikely(!nc->va)) {
3369 page = __page_frag_refill(nc, gfp_mask);
3373 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
3374 /* if size can vary use size else just use PAGE_SIZE */
3377 /* Even if we own the page, we do not use atomic_set().
3378 * This would break get_page_unless_zero() users.
3380 atomic_add(size - 1, &page->_count);
3382 /* reset page count bias and offset to start of new frag */
3383 nc->pfmemalloc = page_is_pfmemalloc(page);
3384 nc->pagecnt_bias = size;
3388 offset = nc->offset - fragsz;
3389 if (unlikely(offset < 0)) {
3390 page = virt_to_page(nc->va);
3392 if (!atomic_sub_and_test(nc->pagecnt_bias, &page->_count))
3395 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
3396 /* if size can vary use size else just use PAGE_SIZE */
3399 /* OK, page count is 0, we can safely set it */
3400 atomic_set(&page->_count, size);
3402 /* reset page count bias and offset to start of new frag */
3403 nc->pagecnt_bias = size;
3404 offset = size - fragsz;
3408 nc->offset = offset;
3410 return nc->va + offset;
3412 EXPORT_SYMBOL(__alloc_page_frag);
3415 * Frees a page fragment allocated out of either a compound or order 0 page.
3417 void __free_page_frag(void *addr)
3419 struct page *page = virt_to_head_page(addr);
3421 if (unlikely(put_page_testzero(page)))
3422 __free_pages_ok(page, compound_order(page));
3424 EXPORT_SYMBOL(__free_page_frag);
3427 * alloc_kmem_pages charges newly allocated pages to the kmem resource counter
3428 * of the current memory cgroup if __GFP_ACCOUNT is set, other than that it is
3429 * equivalent to alloc_pages.
3431 * It should be used when the caller would like to use kmalloc, but since the
3432 * allocation is large, it has to fall back to the page allocator.
3434 struct page *alloc_kmem_pages(gfp_t gfp_mask, unsigned int order)
3438 page = alloc_pages(gfp_mask, order);
3439 if (page && memcg_kmem_charge(page, gfp_mask, order) != 0) {
3440 __free_pages(page, order);
3446 struct page *alloc_kmem_pages_node(int nid, gfp_t gfp_mask, unsigned int order)
3450 page = alloc_pages_node(nid, gfp_mask, order);
3451 if (page && memcg_kmem_charge(page, gfp_mask, order) != 0) {
3452 __free_pages(page, order);
3459 * __free_kmem_pages and free_kmem_pages will free pages allocated with
3462 void __free_kmem_pages(struct page *page, unsigned int order)
3464 memcg_kmem_uncharge(page, order);
3465 __free_pages(page, order);
3468 void free_kmem_pages(unsigned long addr, unsigned int order)
3471 VM_BUG_ON(!virt_addr_valid((void *)addr));
3472 __free_kmem_pages(virt_to_page((void *)addr), order);
3476 static void *make_alloc_exact(unsigned long addr, unsigned int order,
3480 unsigned long alloc_end = addr + (PAGE_SIZE << order);
3481 unsigned long used = addr + PAGE_ALIGN(size);
3483 split_page(virt_to_page((void *)addr), order);
3484 while (used < alloc_end) {
3489 return (void *)addr;
3493 * alloc_pages_exact - allocate an exact number physically-contiguous pages.
3494 * @size: the number of bytes to allocate
3495 * @gfp_mask: GFP flags for the allocation
3497 * This function is similar to alloc_pages(), except that it allocates the
3498 * minimum number of pages to satisfy the request. alloc_pages() can only
3499 * allocate memory in power-of-two pages.
3501 * This function is also limited by MAX_ORDER.
3503 * Memory allocated by this function must be released by free_pages_exact().
3505 void *alloc_pages_exact(size_t size, gfp_t gfp_mask)
3507 unsigned int order = get_order(size);
3510 addr = __get_free_pages(gfp_mask, order);
3511 return make_alloc_exact(addr, order, size);
3513 EXPORT_SYMBOL(alloc_pages_exact);
3516 * alloc_pages_exact_nid - allocate an exact number of physically-contiguous
3518 * @nid: the preferred node ID where memory should be allocated
3519 * @size: the number of bytes to allocate
3520 * @gfp_mask: GFP flags for the allocation
3522 * Like alloc_pages_exact(), but try to allocate on node nid first before falling
3525 void * __meminit alloc_pages_exact_nid(int nid, size_t size, gfp_t gfp_mask)
3527 unsigned int order = get_order(size);
3528 struct page *p = alloc_pages_node(nid, gfp_mask, order);
3531 return make_alloc_exact((unsigned long)page_address(p), order, size);
3535 * free_pages_exact - release memory allocated via alloc_pages_exact()
3536 * @virt: the value returned by alloc_pages_exact.
3537 * @size: size of allocation, same value as passed to alloc_pages_exact().
3539 * Release the memory allocated by a previous call to alloc_pages_exact.
3541 void free_pages_exact(void *virt, size_t size)
3543 unsigned long addr = (unsigned long)virt;
3544 unsigned long end = addr + PAGE_ALIGN(size);
3546 while (addr < end) {
3551 EXPORT_SYMBOL(free_pages_exact);
3554 * nr_free_zone_pages - count number of pages beyond high watermark
3555 * @offset: The zone index of the highest zone
3557 * nr_free_zone_pages() counts the number of counts pages which are beyond the
3558 * high watermark within all zones at or below a given zone index. For each
3559 * zone, the number of pages is calculated as:
3560 * managed_pages - high_pages
3562 static unsigned long nr_free_zone_pages(int offset)
3567 /* Just pick one node, since fallback list is circular */
3568 unsigned long sum = 0;
3570 struct zonelist *zonelist = node_zonelist(numa_node_id(), GFP_KERNEL);
3572 for_each_zone_zonelist(zone, z, zonelist, offset) {
3573 unsigned long size = zone->managed_pages;
3574 unsigned long high = high_wmark_pages(zone);
3583 * nr_free_buffer_pages - count number of pages beyond high watermark
3585 * nr_free_buffer_pages() counts the number of pages which are beyond the high
3586 * watermark within ZONE_DMA and ZONE_NORMAL.
3588 unsigned long nr_free_buffer_pages(void)
3590 return nr_free_zone_pages(gfp_zone(GFP_USER));
3592 EXPORT_SYMBOL_GPL(nr_free_buffer_pages);
3595 * nr_free_pagecache_pages - count number of pages beyond high watermark
3597 * nr_free_pagecache_pages() counts the number of pages which are beyond the
3598 * high watermark within all zones.
3600 unsigned long nr_free_pagecache_pages(void)
3602 return nr_free_zone_pages(gfp_zone(GFP_HIGHUSER_MOVABLE));
3605 static inline void show_node(struct zone *zone)
3607 if (IS_ENABLED(CONFIG_NUMA))
3608 printk("Node %d ", zone_to_nid(zone));
3611 void si_meminfo(struct sysinfo *val)
3613 val->totalram = totalram_pages;
3614 val->sharedram = global_page_state(NR_SHMEM);
3615 val->freeram = global_page_state(NR_FREE_PAGES);
3616 val->bufferram = nr_blockdev_pages();
3617 val->totalhigh = totalhigh_pages;
3618 val->freehigh = nr_free_highpages();
3619 val->mem_unit = PAGE_SIZE;
3622 EXPORT_SYMBOL(si_meminfo);
3625 void si_meminfo_node(struct sysinfo *val, int nid)
3627 int zone_type; /* needs to be signed */
3628 unsigned long managed_pages = 0;
3629 pg_data_t *pgdat = NODE_DATA(nid);
3631 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++)
3632 managed_pages += pgdat->node_zones[zone_type].managed_pages;
3633 val->totalram = managed_pages;
3634 val->sharedram = node_page_state(nid, NR_SHMEM);
3635 val->freeram = node_page_state(nid, NR_FREE_PAGES);
3636 #ifdef CONFIG_HIGHMEM
3637 val->totalhigh = pgdat->node_zones[ZONE_HIGHMEM].managed_pages;
3638 val->freehigh = zone_page_state(&pgdat->node_zones[ZONE_HIGHMEM],
3644 val->mem_unit = PAGE_SIZE;
3649 * Determine whether the node should be displayed or not, depending on whether
3650 * SHOW_MEM_FILTER_NODES was passed to show_free_areas().
3652 bool skip_free_areas_node(unsigned int flags, int nid)
3655 unsigned int cpuset_mems_cookie;
3657 if (!(flags & SHOW_MEM_FILTER_NODES))
3661 cpuset_mems_cookie = read_mems_allowed_begin();
3662 ret = !node_isset(nid, cpuset_current_mems_allowed);
3663 } while (read_mems_allowed_retry(cpuset_mems_cookie));
3668 #define K(x) ((x) << (PAGE_SHIFT-10))
3670 static void show_migration_types(unsigned char type)
3672 static const char types[MIGRATE_TYPES] = {
3673 [MIGRATE_UNMOVABLE] = 'U',
3674 [MIGRATE_MOVABLE] = 'M',
3675 [MIGRATE_RECLAIMABLE] = 'E',
3676 [MIGRATE_HIGHATOMIC] = 'H',
3678 [MIGRATE_CMA] = 'C',
3680 #ifdef CONFIG_MEMORY_ISOLATION
3681 [MIGRATE_ISOLATE] = 'I',
3684 char tmp[MIGRATE_TYPES + 1];
3688 for (i = 0; i < MIGRATE_TYPES; i++) {
3689 if (type & (1 << i))
3694 printk("(%s) ", tmp);
3698 * Show free area list (used inside shift_scroll-lock stuff)
3699 * We also calculate the percentage fragmentation. We do this by counting the
3700 * memory on each free list with the exception of the first item on the list.
3703 * SHOW_MEM_FILTER_NODES: suppress nodes that are not allowed by current's
3706 void show_free_areas(unsigned int filter)
3708 unsigned long free_pcp = 0;
3712 for_each_populated_zone(zone) {
3713 if (skip_free_areas_node(filter, zone_to_nid(zone)))
3716 for_each_online_cpu(cpu)
3717 free_pcp += per_cpu_ptr(zone->pageset, cpu)->pcp.count;
3720 printk("active_anon:%lu inactive_anon:%lu isolated_anon:%lu\n"
3721 " active_file:%lu inactive_file:%lu isolated_file:%lu\n"
3722 " unevictable:%lu dirty:%lu writeback:%lu unstable:%lu\n"
3723 " slab_reclaimable:%lu slab_unreclaimable:%lu\n"
3724 " mapped:%lu shmem:%lu pagetables:%lu bounce:%lu\n"
3725 " free:%lu free_pcp:%lu free_cma:%lu\n",
3726 global_page_state(NR_ACTIVE_ANON),
3727 global_page_state(NR_INACTIVE_ANON),
3728 global_page_state(NR_ISOLATED_ANON),
3729 global_page_state(NR_ACTIVE_FILE),
3730 global_page_state(NR_INACTIVE_FILE),
3731 global_page_state(NR_ISOLATED_FILE),
3732 global_page_state(NR_UNEVICTABLE),
3733 global_page_state(NR_FILE_DIRTY),
3734 global_page_state(NR_WRITEBACK),
3735 global_page_state(NR_UNSTABLE_NFS),
3736 global_page_state(NR_SLAB_RECLAIMABLE),
3737 global_page_state(NR_SLAB_UNRECLAIMABLE),
3738 global_page_state(NR_FILE_MAPPED),
3739 global_page_state(NR_SHMEM),
3740 global_page_state(NR_PAGETABLE),
3741 global_page_state(NR_BOUNCE),
3742 global_page_state(NR_FREE_PAGES),
3744 global_page_state(NR_FREE_CMA_PAGES));
3746 for_each_populated_zone(zone) {
3749 if (skip_free_areas_node(filter, zone_to_nid(zone)))
3753 for_each_online_cpu(cpu)
3754 free_pcp += per_cpu_ptr(zone->pageset, cpu)->pcp.count;
3762 " active_anon:%lukB"
3763 " inactive_anon:%lukB"
3764 " active_file:%lukB"
3765 " inactive_file:%lukB"
3766 " unevictable:%lukB"
3767 " isolated(anon):%lukB"
3768 " isolated(file):%lukB"
3776 " slab_reclaimable:%lukB"
3777 " slab_unreclaimable:%lukB"
3778 " kernel_stack:%lukB"
3785 " writeback_tmp:%lukB"
3786 " pages_scanned:%lu"
3787 " all_unreclaimable? %s"
3790 K(zone_page_state(zone, NR_FREE_PAGES)),
3791 K(min_wmark_pages(zone)),
3792 K(low_wmark_pages(zone)),
3793 K(high_wmark_pages(zone)),
3794 K(zone_page_state(zone, NR_ACTIVE_ANON)),
3795 K(zone_page_state(zone, NR_INACTIVE_ANON)),
3796 K(zone_page_state(zone, NR_ACTIVE_FILE)),
3797 K(zone_page_state(zone, NR_INACTIVE_FILE)),
3798 K(zone_page_state(zone, NR_UNEVICTABLE)),
3799 K(zone_page_state(zone, NR_ISOLATED_ANON)),
3800 K(zone_page_state(zone, NR_ISOLATED_FILE)),
3801 K(zone->present_pages),
3802 K(zone->managed_pages),
3803 K(zone_page_state(zone, NR_MLOCK)),
3804 K(zone_page_state(zone, NR_FILE_DIRTY)),
3805 K(zone_page_state(zone, NR_WRITEBACK)),
3806 K(zone_page_state(zone, NR_FILE_MAPPED)),
3807 K(zone_page_state(zone, NR_SHMEM)),
3808 K(zone_page_state(zone, NR_SLAB_RECLAIMABLE)),
3809 K(zone_page_state(zone, NR_SLAB_UNRECLAIMABLE)),
3810 zone_page_state(zone, NR_KERNEL_STACK) *
3812 K(zone_page_state(zone, NR_PAGETABLE)),
3813 K(zone_page_state(zone, NR_UNSTABLE_NFS)),
3814 K(zone_page_state(zone, NR_BOUNCE)),
3816 K(this_cpu_read(zone->pageset->pcp.count)),
3817 K(zone_page_state(zone, NR_FREE_CMA_PAGES)),
3818 K(zone_page_state(zone, NR_WRITEBACK_TEMP)),
3819 K(zone_page_state(zone, NR_PAGES_SCANNED)),
3820 (!zone_reclaimable(zone) ? "yes" : "no")
3822 printk("lowmem_reserve[]:");
3823 for (i = 0; i < MAX_NR_ZONES; i++)
3824 printk(" %ld", zone->lowmem_reserve[i]);
3828 for_each_populated_zone(zone) {
3830 unsigned long nr[MAX_ORDER], flags, total = 0;
3831 unsigned char types[MAX_ORDER];
3833 if (skip_free_areas_node(filter, zone_to_nid(zone)))
3836 printk("%s: ", zone->name);
3838 spin_lock_irqsave(&zone->lock, flags);
3839 for (order = 0; order < MAX_ORDER; order++) {
3840 struct free_area *area = &zone->free_area[order];
3843 nr[order] = area->nr_free;
3844 total += nr[order] << order;
3847 for (type = 0; type < MIGRATE_TYPES; type++) {
3848 if (!list_empty(&area->free_list[type]))
3849 types[order] |= 1 << type;
3852 spin_unlock_irqrestore(&zone->lock, flags);
3853 for (order = 0; order < MAX_ORDER; order++) {
3854 printk("%lu*%lukB ", nr[order], K(1UL) << order);
3856 show_migration_types(types[order]);
3858 printk("= %lukB\n", K(total));
3861 hugetlb_show_meminfo();
3863 printk("%ld total pagecache pages\n", global_page_state(NR_FILE_PAGES));
3865 show_swap_cache_info();
3868 static void zoneref_set_zone(struct zone *zone, struct zoneref *zoneref)
3870 zoneref->zone = zone;
3871 zoneref->zone_idx = zone_idx(zone);
3875 * Builds allocation fallback zone lists.
3877 * Add all populated zones of a node to the zonelist.
3879 static int build_zonelists_node(pg_data_t *pgdat, struct zonelist *zonelist,
3883 enum zone_type zone_type = MAX_NR_ZONES;
3887 zone = pgdat->node_zones + zone_type;
3888 if (populated_zone(zone)) {
3889 zoneref_set_zone(zone,
3890 &zonelist->_zonerefs[nr_zones++]);
3891 check_highest_zone(zone_type);
3893 } while (zone_type);
3901 * 0 = automatic detection of better ordering.
3902 * 1 = order by ([node] distance, -zonetype)
3903 * 2 = order by (-zonetype, [node] distance)
3905 * If not NUMA, ZONELIST_ORDER_ZONE and ZONELIST_ORDER_NODE will create
3906 * the same zonelist. So only NUMA can configure this param.
3908 #define ZONELIST_ORDER_DEFAULT 0
3909 #define ZONELIST_ORDER_NODE 1
3910 #define ZONELIST_ORDER_ZONE 2
3912 /* zonelist order in the kernel.
3913 * set_zonelist_order() will set this to NODE or ZONE.
3915 static int current_zonelist_order = ZONELIST_ORDER_DEFAULT;
3916 static char zonelist_order_name[3][8] = {"Default", "Node", "Zone"};
3920 /* The value user specified ....changed by config */
3921 static int user_zonelist_order = ZONELIST_ORDER_DEFAULT;
3922 /* string for sysctl */
3923 #define NUMA_ZONELIST_ORDER_LEN 16
3924 char numa_zonelist_order[16] = "default";
3927 * interface for configure zonelist ordering.
3928 * command line option "numa_zonelist_order"
3929 * = "[dD]efault - default, automatic configuration.
3930 * = "[nN]ode - order by node locality, then by zone within node
3931 * = "[zZ]one - order by zone, then by locality within zone
3934 static int __parse_numa_zonelist_order(char *s)
3936 if (*s == 'd' || *s == 'D') {
3937 user_zonelist_order = ZONELIST_ORDER_DEFAULT;
3938 } else if (*s == 'n' || *s == 'N') {
3939 user_zonelist_order = ZONELIST_ORDER_NODE;
3940 } else if (*s == 'z' || *s == 'Z') {
3941 user_zonelist_order = ZONELIST_ORDER_ZONE;
3944 "Ignoring invalid numa_zonelist_order value: "
3951 static __init int setup_numa_zonelist_order(char *s)
3958 ret = __parse_numa_zonelist_order(s);
3960 strlcpy(numa_zonelist_order, s, NUMA_ZONELIST_ORDER_LEN);
3964 early_param("numa_zonelist_order", setup_numa_zonelist_order);
3967 * sysctl handler for numa_zonelist_order
3969 int numa_zonelist_order_handler(struct ctl_table *table, int write,
3970 void __user *buffer, size_t *length,
3973 char saved_string[NUMA_ZONELIST_ORDER_LEN];
3975 static DEFINE_MUTEX(zl_order_mutex);
3977 mutex_lock(&zl_order_mutex);
3979 if (strlen((char *)table->data) >= NUMA_ZONELIST_ORDER_LEN) {
3983 strcpy(saved_string, (char *)table->data);
3985 ret = proc_dostring(table, write, buffer, length, ppos);
3989 int oldval = user_zonelist_order;
3991 ret = __parse_numa_zonelist_order((char *)table->data);
3994 * bogus value. restore saved string
3996 strncpy((char *)table->data, saved_string,
3997 NUMA_ZONELIST_ORDER_LEN);
3998 user_zonelist_order = oldval;
3999 } else if (oldval != user_zonelist_order) {
4000 mutex_lock(&zonelists_mutex);
4001 build_all_zonelists(NULL, NULL);
4002 mutex_unlock(&zonelists_mutex);
4006 mutex_unlock(&zl_order_mutex);
4011 #define MAX_NODE_LOAD (nr_online_nodes)
4012 static int node_load[MAX_NUMNODES];
4015 * find_next_best_node - find the next node that should appear in a given node's fallback list
4016 * @node: node whose fallback list we're appending
4017 * @used_node_mask: nodemask_t of already used nodes
4019 * We use a number of factors to determine which is the next node that should
4020 * appear on a given node's fallback list. The node should not have appeared
4021 * already in @node's fallback list, and it should be the next closest node
4022 * according to the distance array (which contains arbitrary distance values
4023 * from each node to each node in the system), and should also prefer nodes
4024 * with no CPUs, since presumably they'll have very little allocation pressure
4025 * on them otherwise.
4026 * It returns -1 if no node is found.
4028 static int find_next_best_node(int node, nodemask_t *used_node_mask)
4031 int min_val = INT_MAX;
4032 int best_node = NUMA_NO_NODE;
4033 const struct cpumask *tmp = cpumask_of_node(0);
4035 /* Use the local node if we haven't already */
4036 if (!node_isset(node, *used_node_mask)) {
4037 node_set(node, *used_node_mask);
4041 for_each_node_state(n, N_MEMORY) {
4043 /* Don't want a node to appear more than once */
4044 if (node_isset(n, *used_node_mask))
4047 /* Use the distance array to find the distance */
4048 val = node_distance(node, n);
4050 /* Penalize nodes under us ("prefer the next node") */
4053 /* Give preference to headless and unused nodes */
4054 tmp = cpumask_of_node(n);
4055 if (!cpumask_empty(tmp))
4056 val += PENALTY_FOR_NODE_WITH_CPUS;
4058 /* Slight preference for less loaded node */
4059 val *= (MAX_NODE_LOAD*MAX_NUMNODES);
4060 val += node_load[n];
4062 if (val < min_val) {
4069 node_set(best_node, *used_node_mask);
4076 * Build zonelists ordered by node and zones within node.
4077 * This results in maximum locality--normal zone overflows into local
4078 * DMA zone, if any--but risks exhausting DMA zone.
4080 static void build_zonelists_in_node_order(pg_data_t *pgdat, int node)
4083 struct zonelist *zonelist;
4085 zonelist = &pgdat->node_zonelists[0];
4086 for (j = 0; zonelist->_zonerefs[j].zone != NULL; j++)
4088 j = build_zonelists_node(NODE_DATA(node), zonelist, j);
4089 zonelist->_zonerefs[j].zone = NULL;
4090 zonelist->_zonerefs[j].zone_idx = 0;
4094 * Build gfp_thisnode zonelists
4096 static void build_thisnode_zonelists(pg_data_t *pgdat)
4099 struct zonelist *zonelist;
4101 zonelist = &pgdat->node_zonelists[1];
4102 j = build_zonelists_node(pgdat, zonelist, 0);
4103 zonelist->_zonerefs[j].zone = NULL;
4104 zonelist->_zonerefs[j].zone_idx = 0;
4108 * Build zonelists ordered by zone and nodes within zones.
4109 * This results in conserving DMA zone[s] until all Normal memory is
4110 * exhausted, but results in overflowing to remote node while memory
4111 * may still exist in local DMA zone.
4113 static int node_order[MAX_NUMNODES];
4115 static void build_zonelists_in_zone_order(pg_data_t *pgdat, int nr_nodes)
4118 int zone_type; /* needs to be signed */
4120 struct zonelist *zonelist;
4122 zonelist = &pgdat->node_zonelists[0];
4124 for (zone_type = MAX_NR_ZONES - 1; zone_type >= 0; zone_type--) {
4125 for (j = 0; j < nr_nodes; j++) {
4126 node = node_order[j];
4127 z = &NODE_DATA(node)->node_zones[zone_type];
4128 if (populated_zone(z)) {
4130 &zonelist->_zonerefs[pos++]);
4131 check_highest_zone(zone_type);
4135 zonelist->_zonerefs[pos].zone = NULL;
4136 zonelist->_zonerefs[pos].zone_idx = 0;
4139 #if defined(CONFIG_64BIT)
4141 * Devices that require DMA32/DMA are relatively rare and do not justify a
4142 * penalty to every machine in case the specialised case applies. Default
4143 * to Node-ordering on 64-bit NUMA machines
4145 static int default_zonelist_order(void)
4147 return ZONELIST_ORDER_NODE;
4151 * On 32-bit, the Normal zone needs to be preserved for allocations accessible
4152 * by the kernel. If processes running on node 0 deplete the low memory zone
4153 * then reclaim will occur more frequency increasing stalls and potentially
4154 * be easier to OOM if a large percentage of the zone is under writeback or
4155 * dirty. The problem is significantly worse if CONFIG_HIGHPTE is not set.
4156 * Hence, default to zone ordering on 32-bit.
4158 static int default_zonelist_order(void)
4160 return ZONELIST_ORDER_ZONE;
4162 #endif /* CONFIG_64BIT */
4164 static void set_zonelist_order(void)
4166 if (user_zonelist_order == ZONELIST_ORDER_DEFAULT)
4167 current_zonelist_order = default_zonelist_order();
4169 current_zonelist_order = user_zonelist_order;
4172 static void build_zonelists(pg_data_t *pgdat)
4175 nodemask_t used_mask;
4176 int local_node, prev_node;
4177 struct zonelist *zonelist;
4178 unsigned int order = current_zonelist_order;
4180 /* initialize zonelists */
4181 for (i = 0; i < MAX_ZONELISTS; i++) {
4182 zonelist = pgdat->node_zonelists + i;
4183 zonelist->_zonerefs[0].zone = NULL;
4184 zonelist->_zonerefs[0].zone_idx = 0;
4187 /* NUMA-aware ordering of nodes */
4188 local_node = pgdat->node_id;
4189 load = nr_online_nodes;
4190 prev_node = local_node;
4191 nodes_clear(used_mask);
4193 memset(node_order, 0, sizeof(node_order));
4196 while ((node = find_next_best_node(local_node, &used_mask)) >= 0) {
4198 * We don't want to pressure a particular node.
4199 * So adding penalty to the first node in same
4200 * distance group to make it round-robin.
4202 if (node_distance(local_node, node) !=
4203 node_distance(local_node, prev_node))
4204 node_load[node] = load;
4208 if (order == ZONELIST_ORDER_NODE)
4209 build_zonelists_in_node_order(pgdat, node);
4211 node_order[i++] = node; /* remember order */
4214 if (order == ZONELIST_ORDER_ZONE) {
4215 /* calculate node order -- i.e., DMA last! */
4216 build_zonelists_in_zone_order(pgdat, i);
4219 build_thisnode_zonelists(pgdat);
4222 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
4224 * Return node id of node used for "local" allocations.
4225 * I.e., first node id of first zone in arg node's generic zonelist.
4226 * Used for initializing percpu 'numa_mem', which is used primarily
4227 * for kernel allocations, so use GFP_KERNEL flags to locate zonelist.
4229 int local_memory_node(int node)
4233 (void)first_zones_zonelist(node_zonelist(node, GFP_KERNEL),
4234 gfp_zone(GFP_KERNEL),
4241 #else /* CONFIG_NUMA */
4243 static void set_zonelist_order(void)
4245 current_zonelist_order = ZONELIST_ORDER_ZONE;
4248 static void build_zonelists(pg_data_t *pgdat)
4250 int node, local_node;
4252 struct zonelist *zonelist;
4254 local_node = pgdat->node_id;
4256 zonelist = &pgdat->node_zonelists[0];
4257 j = build_zonelists_node(pgdat, zonelist, 0);
4260 * Now we build the zonelist so that it contains the zones
4261 * of all the other nodes.
4262 * We don't want to pressure a particular node, so when
4263 * building the zones for node N, we make sure that the
4264 * zones coming right after the local ones are those from
4265 * node N+1 (modulo N)
4267 for (node = local_node + 1; node < MAX_NUMNODES; node++) {
4268 if (!node_online(node))
4270 j = build_zonelists_node(NODE_DATA(node), zonelist, j);
4272 for (node = 0; node < local_node; node++) {
4273 if (!node_online(node))
4275 j = build_zonelists_node(NODE_DATA(node), zonelist, j);
4278 zonelist->_zonerefs[j].zone = NULL;
4279 zonelist->_zonerefs[j].zone_idx = 0;
4282 #endif /* CONFIG_NUMA */
4285 * Boot pageset table. One per cpu which is going to be used for all
4286 * zones and all nodes. The parameters will be set in such a way
4287 * that an item put on a list will immediately be handed over to
4288 * the buddy list. This is safe since pageset manipulation is done
4289 * with interrupts disabled.
4291 * The boot_pagesets must be kept even after bootup is complete for
4292 * unused processors and/or zones. They do play a role for bootstrapping
4293 * hotplugged processors.
4295 * zoneinfo_show() and maybe other functions do
4296 * not check if the processor is online before following the pageset pointer.
4297 * Other parts of the kernel may not check if the zone is available.
4299 static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch);
4300 static DEFINE_PER_CPU(struct per_cpu_pageset, boot_pageset);
4301 static void setup_zone_pageset(struct zone *zone);
4304 * Global mutex to protect against size modification of zonelists
4305 * as well as to serialize pageset setup for the new populated zone.
4307 DEFINE_MUTEX(zonelists_mutex);
4309 /* return values int ....just for stop_machine() */
4310 static int __build_all_zonelists(void *data)
4314 pg_data_t *self = data;
4317 memset(node_load, 0, sizeof(node_load));
4320 if (self && !node_online(self->node_id)) {
4321 build_zonelists(self);
4324 for_each_online_node(nid) {
4325 pg_data_t *pgdat = NODE_DATA(nid);
4327 build_zonelists(pgdat);
4331 * Initialize the boot_pagesets that are going to be used
4332 * for bootstrapping processors. The real pagesets for
4333 * each zone will be allocated later when the per cpu
4334 * allocator is available.
4336 * boot_pagesets are used also for bootstrapping offline
4337 * cpus if the system is already booted because the pagesets
4338 * are needed to initialize allocators on a specific cpu too.
4339 * F.e. the percpu allocator needs the page allocator which
4340 * needs the percpu allocator in order to allocate its pagesets
4341 * (a chicken-egg dilemma).
4343 for_each_possible_cpu(cpu) {
4344 setup_pageset(&per_cpu(boot_pageset, cpu), 0);
4346 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
4348 * We now know the "local memory node" for each node--
4349 * i.e., the node of the first zone in the generic zonelist.
4350 * Set up numa_mem percpu variable for on-line cpus. During
4351 * boot, only the boot cpu should be on-line; we'll init the
4352 * secondary cpus' numa_mem as they come on-line. During
4353 * node/memory hotplug, we'll fixup all on-line cpus.
4355 if (cpu_online(cpu))
4356 set_cpu_numa_mem(cpu, local_memory_node(cpu_to_node(cpu)));
4363 static noinline void __init
4364 build_all_zonelists_init(void)
4366 __build_all_zonelists(NULL);
4367 mminit_verify_zonelist();
4368 cpuset_init_current_mems_allowed();
4372 * Called with zonelists_mutex held always
4373 * unless system_state == SYSTEM_BOOTING.
4375 * __ref due to (1) call of __meminit annotated setup_zone_pageset
4376 * [we're only called with non-NULL zone through __meminit paths] and
4377 * (2) call of __init annotated helper build_all_zonelists_init
4378 * [protected by SYSTEM_BOOTING].
4380 void __ref build_all_zonelists(pg_data_t *pgdat, struct zone *zone)
4382 set_zonelist_order();
4384 if (system_state == SYSTEM_BOOTING) {
4385 build_all_zonelists_init();
4387 #ifdef CONFIG_MEMORY_HOTPLUG
4389 setup_zone_pageset(zone);
4391 /* we have to stop all cpus to guarantee there is no user
4393 stop_machine(__build_all_zonelists, pgdat, NULL);
4394 /* cpuset refresh routine should be here */
4396 vm_total_pages = nr_free_pagecache_pages();
4398 * Disable grouping by mobility if the number of pages in the
4399 * system is too low to allow the mechanism to work. It would be
4400 * more accurate, but expensive to check per-zone. This check is
4401 * made on memory-hotadd so a system can start with mobility
4402 * disabled and enable it later
4404 if (vm_total_pages < (pageblock_nr_pages * MIGRATE_TYPES))
4405 page_group_by_mobility_disabled = 1;
4407 page_group_by_mobility_disabled = 0;
4409 pr_info("Built %i zonelists in %s order, mobility grouping %s. "
4410 "Total pages: %ld\n",
4412 zonelist_order_name[current_zonelist_order],
4413 page_group_by_mobility_disabled ? "off" : "on",
4416 pr_info("Policy zone: %s\n", zone_names[policy_zone]);
4421 * Helper functions to size the waitqueue hash table.
4422 * Essentially these want to choose hash table sizes sufficiently
4423 * large so that collisions trying to wait on pages are rare.
4424 * But in fact, the number of active page waitqueues on typical
4425 * systems is ridiculously low, less than 200. So this is even
4426 * conservative, even though it seems large.
4428 * The constant PAGES_PER_WAITQUEUE specifies the ratio of pages to
4429 * waitqueues, i.e. the size of the waitq table given the number of pages.
4431 #define PAGES_PER_WAITQUEUE 256
4433 #ifndef CONFIG_MEMORY_HOTPLUG
4434 static inline unsigned long wait_table_hash_nr_entries(unsigned long pages)
4436 unsigned long size = 1;
4438 pages /= PAGES_PER_WAITQUEUE;
4440 while (size < pages)
4444 * Once we have dozens or even hundreds of threads sleeping
4445 * on IO we've got bigger problems than wait queue collision.
4446 * Limit the size of the wait table to a reasonable size.
4448 size = min(size, 4096UL);
4450 return max(size, 4UL);
4454 * A zone's size might be changed by hot-add, so it is not possible to determine
4455 * a suitable size for its wait_table. So we use the maximum size now.
4457 * The max wait table size = 4096 x sizeof(wait_queue_head_t). ie:
4459 * i386 (preemption config) : 4096 x 16 = 64Kbyte.
4460 * ia64, x86-64 (no preemption): 4096 x 20 = 80Kbyte.
4461 * ia64, x86-64 (preemption) : 4096 x 24 = 96Kbyte.
4463 * The maximum entries are prepared when a zone's memory is (512K + 256) pages
4464 * or more by the traditional way. (See above). It equals:
4466 * i386, x86-64, powerpc(4K page size) : = ( 2G + 1M)byte.
4467 * ia64(16K page size) : = ( 8G + 4M)byte.
4468 * powerpc (64K page size) : = (32G +16M)byte.
4470 static inline unsigned long wait_table_hash_nr_entries(unsigned long pages)
4477 * This is an integer logarithm so that shifts can be used later
4478 * to extract the more random high bits from the multiplicative
4479 * hash function before the remainder is taken.
4481 static inline unsigned long wait_table_bits(unsigned long size)
4487 * Initially all pages are reserved - free ones are freed
4488 * up by free_all_bootmem() once the early boot process is
4489 * done. Non-atomic initialization, single-pass.
4491 void __meminit memmap_init_zone(unsigned long size, int nid, unsigned long zone,
4492 unsigned long start_pfn, enum memmap_context context)
4494 struct vmem_altmap *altmap = to_vmem_altmap(__pfn_to_phys(start_pfn));
4495 unsigned long end_pfn = start_pfn + size;
4496 pg_data_t *pgdat = NODE_DATA(nid);
4498 unsigned long nr_initialised = 0;
4499 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
4500 struct memblock_region *r = NULL, *tmp;
4503 if (highest_memmap_pfn < end_pfn - 1)
4504 highest_memmap_pfn = end_pfn - 1;
4507 * Honor reservation requested by the driver for this ZONE_DEVICE
4510 if (altmap && start_pfn == altmap->base_pfn)
4511 start_pfn += altmap->reserve;
4513 for (pfn = start_pfn; pfn < end_pfn; pfn++) {
4515 * There can be holes in boot-time mem_map[]s handed to this
4516 * function. They do not exist on hotplugged memory.
4518 if (context != MEMMAP_EARLY)
4521 if (!early_pfn_valid(pfn))
4523 if (!early_pfn_in_nid(pfn, nid))
4525 if (!update_defer_init(pgdat, pfn, end_pfn, &nr_initialised))
4528 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
4530 * If not mirrored_kernelcore and ZONE_MOVABLE exists, range
4531 * from zone_movable_pfn[nid] to end of each node should be
4532 * ZONE_MOVABLE not ZONE_NORMAL. skip it.
4534 if (!mirrored_kernelcore && zone_movable_pfn[nid])
4535 if (zone == ZONE_NORMAL && pfn >= zone_movable_pfn[nid])
4539 * Check given memblock attribute by firmware which can affect
4540 * kernel memory layout. If zone==ZONE_MOVABLE but memory is
4541 * mirrored, it's an overlapped memmap init. skip it.
4543 if (mirrored_kernelcore && zone == ZONE_MOVABLE) {
4544 if (!r || pfn >= memblock_region_memory_end_pfn(r)) {
4545 for_each_memblock(memory, tmp)
4546 if (pfn < memblock_region_memory_end_pfn(tmp))
4550 if (pfn >= memblock_region_memory_base_pfn(r) &&
4551 memblock_is_mirror(r)) {
4552 /* already initialized as NORMAL */
4553 pfn = memblock_region_memory_end_pfn(r);
4561 * Mark the block movable so that blocks are reserved for
4562 * movable at startup. This will force kernel allocations
4563 * to reserve their blocks rather than leaking throughout
4564 * the address space during boot when many long-lived
4565 * kernel allocations are made.
4567 * bitmap is created for zone's valid pfn range. but memmap
4568 * can be created for invalid pages (for alignment)
4569 * check here not to call set_pageblock_migratetype() against
4572 if (!(pfn & (pageblock_nr_pages - 1))) {
4573 struct page *page = pfn_to_page(pfn);
4575 __init_single_page(page, pfn, zone, nid);
4576 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
4578 __init_single_pfn(pfn, zone, nid);
4583 static void __meminit zone_init_free_lists(struct zone *zone)
4585 unsigned int order, t;
4586 for_each_migratetype_order(order, t) {
4587 INIT_LIST_HEAD(&zone->free_area[order].free_list[t]);
4588 zone->free_area[order].nr_free = 0;
4592 #ifndef __HAVE_ARCH_MEMMAP_INIT
4593 #define memmap_init(size, nid, zone, start_pfn) \
4594 memmap_init_zone((size), (nid), (zone), (start_pfn), MEMMAP_EARLY)
4597 static int zone_batchsize(struct zone *zone)
4603 * The per-cpu-pages pools are set to around 1000th of the
4604 * size of the zone. But no more than 1/2 of a meg.
4606 * OK, so we don't know how big the cache is. So guess.
4608 batch = zone->managed_pages / 1024;
4609 if (batch * PAGE_SIZE > 512 * 1024)
4610 batch = (512 * 1024) / PAGE_SIZE;
4611 batch /= 4; /* We effectively *= 4 below */
4616 * Clamp the batch to a 2^n - 1 value. Having a power
4617 * of 2 value was found to be more likely to have
4618 * suboptimal cache aliasing properties in some cases.
4620 * For example if 2 tasks are alternately allocating
4621 * batches of pages, one task can end up with a lot
4622 * of pages of one half of the possible page colors
4623 * and the other with pages of the other colors.
4625 batch = rounddown_pow_of_two(batch + batch/2) - 1;
4630 /* The deferral and batching of frees should be suppressed under NOMMU
4633 * The problem is that NOMMU needs to be able to allocate large chunks
4634 * of contiguous memory as there's no hardware page translation to
4635 * assemble apparent contiguous memory from discontiguous pages.
4637 * Queueing large contiguous runs of pages for batching, however,
4638 * causes the pages to actually be freed in smaller chunks. As there
4639 * can be a significant delay between the individual batches being
4640 * recycled, this leads to the once large chunks of space being
4641 * fragmented and becoming unavailable for high-order allocations.
4648 * pcp->high and pcp->batch values are related and dependent on one another:
4649 * ->batch must never be higher then ->high.
4650 * The following function updates them in a safe manner without read side
4653 * Any new users of pcp->batch and pcp->high should ensure they can cope with
4654 * those fields changing asynchronously (acording the the above rule).
4656 * mutex_is_locked(&pcp_batch_high_lock) required when calling this function
4657 * outside of boot time (or some other assurance that no concurrent updaters
4660 static void pageset_update(struct per_cpu_pages *pcp, unsigned long high,
4661 unsigned long batch)
4663 /* start with a fail safe value for batch */
4667 /* Update high, then batch, in order */
4674 /* a companion to pageset_set_high() */
4675 static void pageset_set_batch(struct per_cpu_pageset *p, unsigned long batch)
4677 pageset_update(&p->pcp, 6 * batch, max(1UL, 1 * batch));
4680 static void pageset_init(struct per_cpu_pageset *p)
4682 struct per_cpu_pages *pcp;
4685 memset(p, 0, sizeof(*p));
4689 for (migratetype = 0; migratetype < MIGRATE_PCPTYPES; migratetype++)
4690 INIT_LIST_HEAD(&pcp->lists[migratetype]);
4693 static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch)
4696 pageset_set_batch(p, batch);
4700 * pageset_set_high() sets the high water mark for hot per_cpu_pagelist
4701 * to the value high for the pageset p.
4703 static void pageset_set_high(struct per_cpu_pageset *p,
4706 unsigned long batch = max(1UL, high / 4);
4707 if ((high / 4) > (PAGE_SHIFT * 8))
4708 batch = PAGE_SHIFT * 8;
4710 pageset_update(&p->pcp, high, batch);
4713 static void pageset_set_high_and_batch(struct zone *zone,
4714 struct per_cpu_pageset *pcp)
4716 if (percpu_pagelist_fraction)
4717 pageset_set_high(pcp,
4718 (zone->managed_pages /
4719 percpu_pagelist_fraction));
4721 pageset_set_batch(pcp, zone_batchsize(zone));
4724 static void __meminit zone_pageset_init(struct zone *zone, int cpu)
4726 struct per_cpu_pageset *pcp = per_cpu_ptr(zone->pageset, cpu);
4729 pageset_set_high_and_batch(zone, pcp);
4732 static void __meminit setup_zone_pageset(struct zone *zone)
4735 zone->pageset = alloc_percpu(struct per_cpu_pageset);
4736 for_each_possible_cpu(cpu)
4737 zone_pageset_init(zone, cpu);
4741 * Allocate per cpu pagesets and initialize them.
4742 * Before this call only boot pagesets were available.
4744 void __init setup_per_cpu_pageset(void)
4748 for_each_populated_zone(zone)
4749 setup_zone_pageset(zone);
4752 static noinline __init_refok
4753 int zone_wait_table_init(struct zone *zone, unsigned long zone_size_pages)
4759 * The per-page waitqueue mechanism uses hashed waitqueues
4762 zone->wait_table_hash_nr_entries =
4763 wait_table_hash_nr_entries(zone_size_pages);
4764 zone->wait_table_bits =
4765 wait_table_bits(zone->wait_table_hash_nr_entries);
4766 alloc_size = zone->wait_table_hash_nr_entries
4767 * sizeof(wait_queue_head_t);
4769 if (!slab_is_available()) {
4770 zone->wait_table = (wait_queue_head_t *)
4771 memblock_virt_alloc_node_nopanic(
4772 alloc_size, zone->zone_pgdat->node_id);
4775 * This case means that a zone whose size was 0 gets new memory
4776 * via memory hot-add.
4777 * But it may be the case that a new node was hot-added. In
4778 * this case vmalloc() will not be able to use this new node's
4779 * memory - this wait_table must be initialized to use this new
4780 * node itself as well.
4781 * To use this new node's memory, further consideration will be
4784 zone->wait_table = vmalloc(alloc_size);
4786 if (!zone->wait_table)
4789 for (i = 0; i < zone->wait_table_hash_nr_entries; ++i)
4790 init_waitqueue_head(zone->wait_table + i);
4795 static __meminit void zone_pcp_init(struct zone *zone)
4798 * per cpu subsystem is not up at this point. The following code
4799 * relies on the ability of the linker to provide the
4800 * offset of a (static) per cpu variable into the per cpu area.
4802 zone->pageset = &boot_pageset;
4804 if (populated_zone(zone))
4805 printk(KERN_DEBUG " %s zone: %lu pages, LIFO batch:%u\n",
4806 zone->name, zone->present_pages,
4807 zone_batchsize(zone));
4810 int __meminit init_currently_empty_zone(struct zone *zone,
4811 unsigned long zone_start_pfn,
4814 struct pglist_data *pgdat = zone->zone_pgdat;
4816 ret = zone_wait_table_init(zone, size);
4819 pgdat->nr_zones = zone_idx(zone) + 1;
4821 zone->zone_start_pfn = zone_start_pfn;
4823 mminit_dprintk(MMINIT_TRACE, "memmap_init",
4824 "Initialising map node %d zone %lu pfns %lu -> %lu\n",
4826 (unsigned long)zone_idx(zone),
4827 zone_start_pfn, (zone_start_pfn + size));
4829 zone_init_free_lists(zone);
4834 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
4835 #ifndef CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID
4838 * Required by SPARSEMEM. Given a PFN, return what node the PFN is on.
4840 int __meminit __early_pfn_to_nid(unsigned long pfn,
4841 struct mminit_pfnnid_cache *state)
4843 unsigned long start_pfn, end_pfn;
4846 if (state->last_start <= pfn && pfn < state->last_end)
4847 return state->last_nid;
4849 nid = memblock_search_pfn_nid(pfn, &start_pfn, &end_pfn);
4851 state->last_start = start_pfn;
4852 state->last_end = end_pfn;
4853 state->last_nid = nid;
4858 #endif /* CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID */
4861 * free_bootmem_with_active_regions - Call memblock_free_early_nid for each active range
4862 * @nid: The node to free memory on. If MAX_NUMNODES, all nodes are freed.
4863 * @max_low_pfn: The highest PFN that will be passed to memblock_free_early_nid
4865 * If an architecture guarantees that all ranges registered contain no holes
4866 * and may be freed, this this function may be used instead of calling
4867 * memblock_free_early_nid() manually.
4869 void __init free_bootmem_with_active_regions(int nid, unsigned long max_low_pfn)
4871 unsigned long start_pfn, end_pfn;
4874 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, &this_nid) {
4875 start_pfn = min(start_pfn, max_low_pfn);
4876 end_pfn = min(end_pfn, max_low_pfn);
4878 if (start_pfn < end_pfn)
4879 memblock_free_early_nid(PFN_PHYS(start_pfn),
4880 (end_pfn - start_pfn) << PAGE_SHIFT,
4886 * sparse_memory_present_with_active_regions - Call memory_present for each active range
4887 * @nid: The node to call memory_present for. If MAX_NUMNODES, all nodes will be used.
4889 * If an architecture guarantees that all ranges registered contain no holes and may
4890 * be freed, this function may be used instead of calling memory_present() manually.
4892 void __init sparse_memory_present_with_active_regions(int nid)
4894 unsigned long start_pfn, end_pfn;
4897 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, &this_nid)
4898 memory_present(this_nid, start_pfn, end_pfn);
4902 * get_pfn_range_for_nid - Return the start and end page frames for a node
4903 * @nid: The nid to return the range for. If MAX_NUMNODES, the min and max PFN are returned.
4904 * @start_pfn: Passed by reference. On return, it will have the node start_pfn.
4905 * @end_pfn: Passed by reference. On return, it will have the node end_pfn.
4907 * It returns the start and end page frame of a node based on information
4908 * provided by memblock_set_node(). If called for a node
4909 * with no available memory, a warning is printed and the start and end
4912 void __meminit get_pfn_range_for_nid(unsigned int nid,
4913 unsigned long *start_pfn, unsigned long *end_pfn)
4915 unsigned long this_start_pfn, this_end_pfn;
4921 for_each_mem_pfn_range(i, nid, &this_start_pfn, &this_end_pfn, NULL) {
4922 *start_pfn = min(*start_pfn, this_start_pfn);
4923 *end_pfn = max(*end_pfn, this_end_pfn);
4926 if (*start_pfn == -1UL)
4931 * This finds a zone that can be used for ZONE_MOVABLE pages. The
4932 * assumption is made that zones within a node are ordered in monotonic
4933 * increasing memory addresses so that the "highest" populated zone is used
4935 static void __init find_usable_zone_for_movable(void)
4938 for (zone_index = MAX_NR_ZONES - 1; zone_index >= 0; zone_index--) {
4939 if (zone_index == ZONE_MOVABLE)
4942 if (arch_zone_highest_possible_pfn[zone_index] >
4943 arch_zone_lowest_possible_pfn[zone_index])
4947 VM_BUG_ON(zone_index == -1);
4948 movable_zone = zone_index;
4952 * The zone ranges provided by the architecture do not include ZONE_MOVABLE
4953 * because it is sized independent of architecture. Unlike the other zones,
4954 * the starting point for ZONE_MOVABLE is not fixed. It may be different
4955 * in each node depending on the size of each node and how evenly kernelcore
4956 * is distributed. This helper function adjusts the zone ranges
4957 * provided by the architecture for a given node by using the end of the
4958 * highest usable zone for ZONE_MOVABLE. This preserves the assumption that
4959 * zones within a node are in order of monotonic increases memory addresses
4961 static void __meminit adjust_zone_range_for_zone_movable(int nid,
4962 unsigned long zone_type,
4963 unsigned long node_start_pfn,
4964 unsigned long node_end_pfn,
4965 unsigned long *zone_start_pfn,
4966 unsigned long *zone_end_pfn)
4968 /* Only adjust if ZONE_MOVABLE is on this node */
4969 if (zone_movable_pfn[nid]) {
4970 /* Size ZONE_MOVABLE */
4971 if (zone_type == ZONE_MOVABLE) {
4972 *zone_start_pfn = zone_movable_pfn[nid];
4973 *zone_end_pfn = min(node_end_pfn,
4974 arch_zone_highest_possible_pfn[movable_zone]);
4976 /* Check if this whole range is within ZONE_MOVABLE */
4977 } else if (*zone_start_pfn >= zone_movable_pfn[nid])
4978 *zone_start_pfn = *zone_end_pfn;
4983 * Return the number of pages a zone spans in a node, including holes
4984 * present_pages = zone_spanned_pages_in_node() - zone_absent_pages_in_node()
4986 static unsigned long __meminit zone_spanned_pages_in_node(int nid,
4987 unsigned long zone_type,
4988 unsigned long node_start_pfn,
4989 unsigned long node_end_pfn,
4990 unsigned long *zone_start_pfn,
4991 unsigned long *zone_end_pfn,
4992 unsigned long *ignored)
4994 /* When hotadd a new node from cpu_up(), the node should be empty */
4995 if (!node_start_pfn && !node_end_pfn)
4998 /* Get the start and end of the zone */
4999 *zone_start_pfn = arch_zone_lowest_possible_pfn[zone_type];
5000 *zone_end_pfn = arch_zone_highest_possible_pfn[zone_type];
5001 adjust_zone_range_for_zone_movable(nid, zone_type,
5002 node_start_pfn, node_end_pfn,
5003 zone_start_pfn, zone_end_pfn);
5005 /* Check that this node has pages within the zone's required range */
5006 if (*zone_end_pfn < node_start_pfn || *zone_start_pfn > node_end_pfn)
5009 /* Move the zone boundaries inside the node if necessary */
5010 *zone_end_pfn = min(*zone_end_pfn, node_end_pfn);
5011 *zone_start_pfn = max(*zone_start_pfn, node_start_pfn);
5013 /* Return the spanned pages */
5014 return *zone_end_pfn - *zone_start_pfn;
5018 * Return the number of holes in a range on a node. If nid is MAX_NUMNODES,
5019 * then all holes in the requested range will be accounted for.
5021 unsigned long __meminit __absent_pages_in_range(int nid,
5022 unsigned long range_start_pfn,
5023 unsigned long range_end_pfn)
5025 unsigned long nr_absent = range_end_pfn - range_start_pfn;
5026 unsigned long start_pfn, end_pfn;
5029 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
5030 start_pfn = clamp(start_pfn, range_start_pfn, range_end_pfn);
5031 end_pfn = clamp(end_pfn, range_start_pfn, range_end_pfn);
5032 nr_absent -= end_pfn - start_pfn;
5038 * absent_pages_in_range - Return number of page frames in holes within a range
5039 * @start_pfn: The start PFN to start searching for holes
5040 * @end_pfn: The end PFN to stop searching for holes
5042 * It returns the number of pages frames in memory holes within a range.
5044 unsigned long __init absent_pages_in_range(unsigned long start_pfn,
5045 unsigned long end_pfn)
5047 return __absent_pages_in_range(MAX_NUMNODES, start_pfn, end_pfn);
5050 /* Return the number of page frames in holes in a zone on a node */
5051 static unsigned long __meminit zone_absent_pages_in_node(int nid,
5052 unsigned long zone_type,
5053 unsigned long node_start_pfn,
5054 unsigned long node_end_pfn,
5055 unsigned long *ignored)
5057 unsigned long zone_low = arch_zone_lowest_possible_pfn[zone_type];
5058 unsigned long zone_high = arch_zone_highest_possible_pfn[zone_type];
5059 unsigned long zone_start_pfn, zone_end_pfn;
5060 unsigned long nr_absent;
5062 /* When hotadd a new node from cpu_up(), the node should be empty */
5063 if (!node_start_pfn && !node_end_pfn)
5066 zone_start_pfn = clamp(node_start_pfn, zone_low, zone_high);
5067 zone_end_pfn = clamp(node_end_pfn, zone_low, zone_high);
5069 adjust_zone_range_for_zone_movable(nid, zone_type,
5070 node_start_pfn, node_end_pfn,
5071 &zone_start_pfn, &zone_end_pfn);
5072 nr_absent = __absent_pages_in_range(nid, zone_start_pfn, zone_end_pfn);
5075 * ZONE_MOVABLE handling.
5076 * Treat pages to be ZONE_MOVABLE in ZONE_NORMAL as absent pages
5079 if (zone_movable_pfn[nid]) {
5080 if (mirrored_kernelcore) {
5081 unsigned long start_pfn, end_pfn;
5082 struct memblock_region *r;
5084 for_each_memblock(memory, r) {
5085 start_pfn = clamp(memblock_region_memory_base_pfn(r),
5086 zone_start_pfn, zone_end_pfn);
5087 end_pfn = clamp(memblock_region_memory_end_pfn(r),
5088 zone_start_pfn, zone_end_pfn);
5090 if (zone_type == ZONE_MOVABLE &&
5091 memblock_is_mirror(r))
5092 nr_absent += end_pfn - start_pfn;
5094 if (zone_type == ZONE_NORMAL &&
5095 !memblock_is_mirror(r))
5096 nr_absent += end_pfn - start_pfn;
5099 if (zone_type == ZONE_NORMAL)
5100 nr_absent += node_end_pfn - zone_movable_pfn[nid];
5107 #else /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
5108 static inline unsigned long __meminit zone_spanned_pages_in_node(int nid,
5109 unsigned long zone_type,
5110 unsigned long node_start_pfn,
5111 unsigned long node_end_pfn,
5112 unsigned long *zone_start_pfn,
5113 unsigned long *zone_end_pfn,
5114 unsigned long *zones_size)
5118 *zone_start_pfn = node_start_pfn;
5119 for (zone = 0; zone < zone_type; zone++)
5120 *zone_start_pfn += zones_size[zone];
5122 *zone_end_pfn = *zone_start_pfn + zones_size[zone_type];
5124 return zones_size[zone_type];
5127 static inline unsigned long __meminit zone_absent_pages_in_node(int nid,
5128 unsigned long zone_type,
5129 unsigned long node_start_pfn,
5130 unsigned long node_end_pfn,
5131 unsigned long *zholes_size)
5136 return zholes_size[zone_type];
5139 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
5141 static void __meminit calculate_node_totalpages(struct pglist_data *pgdat,
5142 unsigned long node_start_pfn,
5143 unsigned long node_end_pfn,
5144 unsigned long *zones_size,
5145 unsigned long *zholes_size)
5147 unsigned long realtotalpages = 0, totalpages = 0;
5150 for (i = 0; i < MAX_NR_ZONES; i++) {
5151 struct zone *zone = pgdat->node_zones + i;
5152 unsigned long zone_start_pfn, zone_end_pfn;
5153 unsigned long size, real_size;
5155 size = zone_spanned_pages_in_node(pgdat->node_id, i,
5161 real_size = size - zone_absent_pages_in_node(pgdat->node_id, i,
5162 node_start_pfn, node_end_pfn,
5165 zone->zone_start_pfn = zone_start_pfn;
5167 zone->zone_start_pfn = 0;
5168 zone->spanned_pages = size;
5169 zone->present_pages = real_size;
5172 realtotalpages += real_size;
5175 pgdat->node_spanned_pages = totalpages;
5176 pgdat->node_present_pages = realtotalpages;
5177 printk(KERN_DEBUG "On node %d totalpages: %lu\n", pgdat->node_id,
5181 #ifndef CONFIG_SPARSEMEM
5183 * Calculate the size of the zone->blockflags rounded to an unsigned long
5184 * Start by making sure zonesize is a multiple of pageblock_order by rounding
5185 * up. Then use 1 NR_PAGEBLOCK_BITS worth of bits per pageblock, finally
5186 * round what is now in bits to nearest long in bits, then return it in
5189 static unsigned long __init usemap_size(unsigned long zone_start_pfn, unsigned long zonesize)
5191 unsigned long usemapsize;
5193 zonesize += zone_start_pfn & (pageblock_nr_pages-1);
5194 usemapsize = roundup(zonesize, pageblock_nr_pages);
5195 usemapsize = usemapsize >> pageblock_order;
5196 usemapsize *= NR_PAGEBLOCK_BITS;
5197 usemapsize = roundup(usemapsize, 8 * sizeof(unsigned long));
5199 return usemapsize / 8;
5202 static void __init setup_usemap(struct pglist_data *pgdat,
5204 unsigned long zone_start_pfn,
5205 unsigned long zonesize)
5207 unsigned long usemapsize = usemap_size(zone_start_pfn, zonesize);
5208 zone->pageblock_flags = NULL;
5210 zone->pageblock_flags =
5211 memblock_virt_alloc_node_nopanic(usemapsize,
5215 static inline void setup_usemap(struct pglist_data *pgdat, struct zone *zone,
5216 unsigned long zone_start_pfn, unsigned long zonesize) {}
5217 #endif /* CONFIG_SPARSEMEM */
5219 #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
5221 /* Initialise the number of pages represented by NR_PAGEBLOCK_BITS */
5222 void __paginginit set_pageblock_order(void)
5226 /* Check that pageblock_nr_pages has not already been setup */
5227 if (pageblock_order)
5230 if (HPAGE_SHIFT > PAGE_SHIFT)
5231 order = HUGETLB_PAGE_ORDER;
5233 order = MAX_ORDER - 1;
5236 * Assume the largest contiguous order of interest is a huge page.
5237 * This value may be variable depending on boot parameters on IA64 and
5240 pageblock_order = order;
5242 #else /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
5245 * When CONFIG_HUGETLB_PAGE_SIZE_VARIABLE is not set, set_pageblock_order()
5246 * is unused as pageblock_order is set at compile-time. See
5247 * include/linux/pageblock-flags.h for the values of pageblock_order based on
5250 void __paginginit set_pageblock_order(void)
5254 #endif /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
5256 static unsigned long __paginginit calc_memmap_size(unsigned long spanned_pages,
5257 unsigned long present_pages)
5259 unsigned long pages = spanned_pages;
5262 * Provide a more accurate estimation if there are holes within
5263 * the zone and SPARSEMEM is in use. If there are holes within the
5264 * zone, each populated memory region may cost us one or two extra
5265 * memmap pages due to alignment because memmap pages for each
5266 * populated regions may not naturally algined on page boundary.
5267 * So the (present_pages >> 4) heuristic is a tradeoff for that.
5269 if (spanned_pages > present_pages + (present_pages >> 4) &&
5270 IS_ENABLED(CONFIG_SPARSEMEM))
5271 pages = present_pages;
5273 return PAGE_ALIGN(pages * sizeof(struct page)) >> PAGE_SHIFT;
5277 * Set up the zone data structures:
5278 * - mark all pages reserved
5279 * - mark all memory queues empty
5280 * - clear the memory bitmaps
5282 * NOTE: pgdat should get zeroed by caller.
5284 static void __paginginit free_area_init_core(struct pglist_data *pgdat)
5287 int nid = pgdat->node_id;
5290 pgdat_resize_init(pgdat);
5291 #ifdef CONFIG_NUMA_BALANCING
5292 spin_lock_init(&pgdat->numabalancing_migrate_lock);
5293 pgdat->numabalancing_migrate_nr_pages = 0;
5294 pgdat->numabalancing_migrate_next_window = jiffies;
5296 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
5297 spin_lock_init(&pgdat->split_queue_lock);
5298 INIT_LIST_HEAD(&pgdat->split_queue);
5299 pgdat->split_queue_len = 0;
5301 init_waitqueue_head(&pgdat->kswapd_wait);
5302 init_waitqueue_head(&pgdat->pfmemalloc_wait);
5303 pgdat_page_ext_init(pgdat);
5305 for (j = 0; j < MAX_NR_ZONES; j++) {
5306 struct zone *zone = pgdat->node_zones + j;
5307 unsigned long size, realsize, freesize, memmap_pages;
5308 unsigned long zone_start_pfn = zone->zone_start_pfn;
5310 size = zone->spanned_pages;
5311 realsize = freesize = zone->present_pages;
5314 * Adjust freesize so that it accounts for how much memory
5315 * is used by this zone for memmap. This affects the watermark
5316 * and per-cpu initialisations
5318 memmap_pages = calc_memmap_size(size, realsize);
5319 if (!is_highmem_idx(j)) {
5320 if (freesize >= memmap_pages) {
5321 freesize -= memmap_pages;
5324 " %s zone: %lu pages used for memmap\n",
5325 zone_names[j], memmap_pages);
5328 " %s zone: %lu pages exceeds freesize %lu\n",
5329 zone_names[j], memmap_pages, freesize);
5332 /* Account for reserved pages */
5333 if (j == 0 && freesize > dma_reserve) {
5334 freesize -= dma_reserve;
5335 printk(KERN_DEBUG " %s zone: %lu pages reserved\n",
5336 zone_names[0], dma_reserve);
5339 if (!is_highmem_idx(j))
5340 nr_kernel_pages += freesize;
5341 /* Charge for highmem memmap if there are enough kernel pages */
5342 else if (nr_kernel_pages > memmap_pages * 2)
5343 nr_kernel_pages -= memmap_pages;
5344 nr_all_pages += freesize;
5347 * Set an approximate value for lowmem here, it will be adjusted
5348 * when the bootmem allocator frees pages into the buddy system.
5349 * And all highmem pages will be managed by the buddy system.
5351 zone->managed_pages = is_highmem_idx(j) ? realsize : freesize;
5354 zone->min_unmapped_pages = (freesize*sysctl_min_unmapped_ratio)
5356 zone->min_slab_pages = (freesize * sysctl_min_slab_ratio) / 100;
5358 zone->name = zone_names[j];
5359 spin_lock_init(&zone->lock);
5360 spin_lock_init(&zone->lru_lock);
5361 zone_seqlock_init(zone);
5362 zone->zone_pgdat = pgdat;
5363 zone_pcp_init(zone);
5365 /* For bootup, initialized properly in watermark setup */
5366 mod_zone_page_state(zone, NR_ALLOC_BATCH, zone->managed_pages);
5368 lruvec_init(&zone->lruvec);
5372 set_pageblock_order();
5373 setup_usemap(pgdat, zone, zone_start_pfn, size);
5374 ret = init_currently_empty_zone(zone, zone_start_pfn, size);
5376 memmap_init(size, nid, j, zone_start_pfn);
5380 static void __init_refok alloc_node_mem_map(struct pglist_data *pgdat)
5382 unsigned long __maybe_unused start = 0;
5383 unsigned long __maybe_unused offset = 0;
5385 /* Skip empty nodes */
5386 if (!pgdat->node_spanned_pages)
5389 #ifdef CONFIG_FLAT_NODE_MEM_MAP
5390 start = pgdat->node_start_pfn & ~(MAX_ORDER_NR_PAGES - 1);
5391 offset = pgdat->node_start_pfn - start;
5392 /* ia64 gets its own node_mem_map, before this, without bootmem */
5393 if (!pgdat->node_mem_map) {
5394 unsigned long size, end;
5398 * The zone's endpoints aren't required to be MAX_ORDER
5399 * aligned but the node_mem_map endpoints must be in order
5400 * for the buddy allocator to function correctly.
5402 end = pgdat_end_pfn(pgdat);
5403 end = ALIGN(end, MAX_ORDER_NR_PAGES);
5404 size = (end - start) * sizeof(struct page);
5405 map = alloc_remap(pgdat->node_id, size);
5407 map = memblock_virt_alloc_node_nopanic(size,
5409 pgdat->node_mem_map = map + offset;
5411 #ifndef CONFIG_NEED_MULTIPLE_NODES
5413 * With no DISCONTIG, the global mem_map is just set as node 0's
5415 if (pgdat == NODE_DATA(0)) {
5416 mem_map = NODE_DATA(0)->node_mem_map;
5417 #if defined(CONFIG_HAVE_MEMBLOCK_NODE_MAP) || defined(CONFIG_FLATMEM)
5418 if (page_to_pfn(mem_map) != pgdat->node_start_pfn)
5420 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
5423 #endif /* CONFIG_FLAT_NODE_MEM_MAP */
5426 void __paginginit free_area_init_node(int nid, unsigned long *zones_size,
5427 unsigned long node_start_pfn, unsigned long *zholes_size)
5429 pg_data_t *pgdat = NODE_DATA(nid);
5430 unsigned long start_pfn = 0;
5431 unsigned long end_pfn = 0;
5433 /* pg_data_t should be reset to zero when it's allocated */
5434 WARN_ON(pgdat->nr_zones || pgdat->classzone_idx);
5436 reset_deferred_meminit(pgdat);
5437 pgdat->node_id = nid;
5438 pgdat->node_start_pfn = node_start_pfn;
5439 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
5440 get_pfn_range_for_nid(nid, &start_pfn, &end_pfn);
5441 pr_info("Initmem setup node %d [mem %#018Lx-%#018Lx]\n", nid,
5442 (u64)start_pfn << PAGE_SHIFT,
5443 end_pfn ? ((u64)end_pfn << PAGE_SHIFT) - 1 : 0);
5445 start_pfn = node_start_pfn;
5447 calculate_node_totalpages(pgdat, start_pfn, end_pfn,
5448 zones_size, zholes_size);
5450 alloc_node_mem_map(pgdat);
5451 #ifdef CONFIG_FLAT_NODE_MEM_MAP
5452 printk(KERN_DEBUG "free_area_init_node: node %d, pgdat %08lx, node_mem_map %08lx\n",
5453 nid, (unsigned long)pgdat,
5454 (unsigned long)pgdat->node_mem_map);
5457 free_area_init_core(pgdat);
5460 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
5462 #if MAX_NUMNODES > 1
5464 * Figure out the number of possible node ids.
5466 void __init setup_nr_node_ids(void)
5468 unsigned int highest;
5470 highest = find_last_bit(node_possible_map.bits, MAX_NUMNODES);
5471 nr_node_ids = highest + 1;
5476 * node_map_pfn_alignment - determine the maximum internode alignment
5478 * This function should be called after node map is populated and sorted.
5479 * It calculates the maximum power of two alignment which can distinguish
5482 * For example, if all nodes are 1GiB and aligned to 1GiB, the return value
5483 * would indicate 1GiB alignment with (1 << (30 - PAGE_SHIFT)). If the
5484 * nodes are shifted by 256MiB, 256MiB. Note that if only the last node is
5485 * shifted, 1GiB is enough and this function will indicate so.
5487 * This is used to test whether pfn -> nid mapping of the chosen memory
5488 * model has fine enough granularity to avoid incorrect mapping for the
5489 * populated node map.
5491 * Returns the determined alignment in pfn's. 0 if there is no alignment
5492 * requirement (single node).
5494 unsigned long __init node_map_pfn_alignment(void)
5496 unsigned long accl_mask = 0, last_end = 0;
5497 unsigned long start, end, mask;
5501 for_each_mem_pfn_range(i, MAX_NUMNODES, &start, &end, &nid) {
5502 if (!start || last_nid < 0 || last_nid == nid) {
5509 * Start with a mask granular enough to pin-point to the
5510 * start pfn and tick off bits one-by-one until it becomes
5511 * too coarse to separate the current node from the last.
5513 mask = ~((1 << __ffs(start)) - 1);
5514 while (mask && last_end <= (start & (mask << 1)))
5517 /* accumulate all internode masks */
5521 /* convert mask to number of pages */
5522 return ~accl_mask + 1;
5525 /* Find the lowest pfn for a node */
5526 static unsigned long __init find_min_pfn_for_node(int nid)
5528 unsigned long min_pfn = ULONG_MAX;
5529 unsigned long start_pfn;
5532 for_each_mem_pfn_range(i, nid, &start_pfn, NULL, NULL)
5533 min_pfn = min(min_pfn, start_pfn);
5535 if (min_pfn == ULONG_MAX) {
5537 "Could not find start_pfn for node %d\n", nid);
5545 * find_min_pfn_with_active_regions - Find the minimum PFN registered
5547 * It returns the minimum PFN based on information provided via
5548 * memblock_set_node().
5550 unsigned long __init find_min_pfn_with_active_regions(void)
5552 return find_min_pfn_for_node(MAX_NUMNODES);
5556 * early_calculate_totalpages()
5557 * Sum pages in active regions for movable zone.
5558 * Populate N_MEMORY for calculating usable_nodes.
5560 static unsigned long __init early_calculate_totalpages(void)
5562 unsigned long totalpages = 0;
5563 unsigned long start_pfn, end_pfn;
5566 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid) {
5567 unsigned long pages = end_pfn - start_pfn;
5569 totalpages += pages;
5571 node_set_state(nid, N_MEMORY);
5577 * Find the PFN the Movable zone begins in each node. Kernel memory
5578 * is spread evenly between nodes as long as the nodes have enough
5579 * memory. When they don't, some nodes will have more kernelcore than
5582 static void __init find_zone_movable_pfns_for_nodes(void)
5585 unsigned long usable_startpfn;
5586 unsigned long kernelcore_node, kernelcore_remaining;
5587 /* save the state before borrow the nodemask */
5588 nodemask_t saved_node_state = node_states[N_MEMORY];
5589 unsigned long totalpages = early_calculate_totalpages();
5590 int usable_nodes = nodes_weight(node_states[N_MEMORY]);
5591 struct memblock_region *r;
5593 /* Need to find movable_zone earlier when movable_node is specified. */
5594 find_usable_zone_for_movable();
5597 * If movable_node is specified, ignore kernelcore and movablecore
5600 if (movable_node_is_enabled()) {
5601 for_each_memblock(memory, r) {
5602 if (!memblock_is_hotpluggable(r))
5607 usable_startpfn = PFN_DOWN(r->base);
5608 zone_movable_pfn[nid] = zone_movable_pfn[nid] ?
5609 min(usable_startpfn, zone_movable_pfn[nid]) :
5617 * If kernelcore=mirror is specified, ignore movablecore option
5619 if (mirrored_kernelcore) {
5620 bool mem_below_4gb_not_mirrored = false;
5622 for_each_memblock(memory, r) {
5623 if (memblock_is_mirror(r))
5628 usable_startpfn = memblock_region_memory_base_pfn(r);
5630 if (usable_startpfn < 0x100000) {
5631 mem_below_4gb_not_mirrored = true;
5635 zone_movable_pfn[nid] = zone_movable_pfn[nid] ?
5636 min(usable_startpfn, zone_movable_pfn[nid]) :
5640 if (mem_below_4gb_not_mirrored)
5641 pr_warn("This configuration results in unmirrored kernel memory.");
5647 * If movablecore=nn[KMG] was specified, calculate what size of
5648 * kernelcore that corresponds so that memory usable for
5649 * any allocation type is evenly spread. If both kernelcore
5650 * and movablecore are specified, then the value of kernelcore
5651 * will be used for required_kernelcore if it's greater than
5652 * what movablecore would have allowed.
5654 if (required_movablecore) {
5655 unsigned long corepages;
5658 * Round-up so that ZONE_MOVABLE is at least as large as what
5659 * was requested by the user
5661 required_movablecore =
5662 roundup(required_movablecore, MAX_ORDER_NR_PAGES);
5663 required_movablecore = min(totalpages, required_movablecore);
5664 corepages = totalpages - required_movablecore;
5666 required_kernelcore = max(required_kernelcore, corepages);
5670 * If kernelcore was not specified or kernelcore size is larger
5671 * than totalpages, there is no ZONE_MOVABLE.
5673 if (!required_kernelcore || required_kernelcore >= totalpages)
5676 /* usable_startpfn is the lowest possible pfn ZONE_MOVABLE can be at */
5677 usable_startpfn = arch_zone_lowest_possible_pfn[movable_zone];
5680 /* Spread kernelcore memory as evenly as possible throughout nodes */
5681 kernelcore_node = required_kernelcore / usable_nodes;
5682 for_each_node_state(nid, N_MEMORY) {
5683 unsigned long start_pfn, end_pfn;
5686 * Recalculate kernelcore_node if the division per node
5687 * now exceeds what is necessary to satisfy the requested
5688 * amount of memory for the kernel
5690 if (required_kernelcore < kernelcore_node)
5691 kernelcore_node = required_kernelcore / usable_nodes;
5694 * As the map is walked, we track how much memory is usable
5695 * by the kernel using kernelcore_remaining. When it is
5696 * 0, the rest of the node is usable by ZONE_MOVABLE
5698 kernelcore_remaining = kernelcore_node;
5700 /* Go through each range of PFNs within this node */
5701 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
5702 unsigned long size_pages;
5704 start_pfn = max(start_pfn, zone_movable_pfn[nid]);
5705 if (start_pfn >= end_pfn)
5708 /* Account for what is only usable for kernelcore */
5709 if (start_pfn < usable_startpfn) {
5710 unsigned long kernel_pages;
5711 kernel_pages = min(end_pfn, usable_startpfn)
5714 kernelcore_remaining -= min(kernel_pages,
5715 kernelcore_remaining);
5716 required_kernelcore -= min(kernel_pages,
5717 required_kernelcore);
5719 /* Continue if range is now fully accounted */
5720 if (end_pfn <= usable_startpfn) {
5723 * Push zone_movable_pfn to the end so
5724 * that if we have to rebalance
5725 * kernelcore across nodes, we will
5726 * not double account here
5728 zone_movable_pfn[nid] = end_pfn;
5731 start_pfn = usable_startpfn;
5735 * The usable PFN range for ZONE_MOVABLE is from
5736 * start_pfn->end_pfn. Calculate size_pages as the
5737 * number of pages used as kernelcore
5739 size_pages = end_pfn - start_pfn;
5740 if (size_pages > kernelcore_remaining)
5741 size_pages = kernelcore_remaining;
5742 zone_movable_pfn[nid] = start_pfn + size_pages;
5745 * Some kernelcore has been met, update counts and
5746 * break if the kernelcore for this node has been
5749 required_kernelcore -= min(required_kernelcore,
5751 kernelcore_remaining -= size_pages;
5752 if (!kernelcore_remaining)
5758 * If there is still required_kernelcore, we do another pass with one
5759 * less node in the count. This will push zone_movable_pfn[nid] further
5760 * along on the nodes that still have memory until kernelcore is
5764 if (usable_nodes && required_kernelcore > usable_nodes)
5768 /* Align start of ZONE_MOVABLE on all nids to MAX_ORDER_NR_PAGES */
5769 for (nid = 0; nid < MAX_NUMNODES; nid++)
5770 zone_movable_pfn[nid] =
5771 roundup(zone_movable_pfn[nid], MAX_ORDER_NR_PAGES);
5774 /* restore the node_state */
5775 node_states[N_MEMORY] = saved_node_state;
5778 /* Any regular or high memory on that node ? */
5779 static void check_for_memory(pg_data_t *pgdat, int nid)
5781 enum zone_type zone_type;
5783 if (N_MEMORY == N_NORMAL_MEMORY)
5786 for (zone_type = 0; zone_type <= ZONE_MOVABLE - 1; zone_type++) {
5787 struct zone *zone = &pgdat->node_zones[zone_type];
5788 if (populated_zone(zone)) {
5789 node_set_state(nid, N_HIGH_MEMORY);
5790 if (N_NORMAL_MEMORY != N_HIGH_MEMORY &&
5791 zone_type <= ZONE_NORMAL)
5792 node_set_state(nid, N_NORMAL_MEMORY);
5799 * free_area_init_nodes - Initialise all pg_data_t and zone data
5800 * @max_zone_pfn: an array of max PFNs for each zone
5802 * This will call free_area_init_node() for each active node in the system.
5803 * Using the page ranges provided by memblock_set_node(), the size of each
5804 * zone in each node and their holes is calculated. If the maximum PFN
5805 * between two adjacent zones match, it is assumed that the zone is empty.
5806 * For example, if arch_max_dma_pfn == arch_max_dma32_pfn, it is assumed
5807 * that arch_max_dma32_pfn has no pages. It is also assumed that a zone
5808 * starts where the previous one ended. For example, ZONE_DMA32 starts
5809 * at arch_max_dma_pfn.
5811 void __init free_area_init_nodes(unsigned long *max_zone_pfn)
5813 unsigned long start_pfn, end_pfn;
5816 /* Record where the zone boundaries are */
5817 memset(arch_zone_lowest_possible_pfn, 0,
5818 sizeof(arch_zone_lowest_possible_pfn));
5819 memset(arch_zone_highest_possible_pfn, 0,
5820 sizeof(arch_zone_highest_possible_pfn));
5821 arch_zone_lowest_possible_pfn[0] = find_min_pfn_with_active_regions();
5822 arch_zone_highest_possible_pfn[0] = max_zone_pfn[0];
5823 for (i = 1; i < MAX_NR_ZONES; i++) {
5824 if (i == ZONE_MOVABLE)
5826 arch_zone_lowest_possible_pfn[i] =
5827 arch_zone_highest_possible_pfn[i-1];
5828 arch_zone_highest_possible_pfn[i] =
5829 max(max_zone_pfn[i], arch_zone_lowest_possible_pfn[i]);
5831 arch_zone_lowest_possible_pfn[ZONE_MOVABLE] = 0;
5832 arch_zone_highest_possible_pfn[ZONE_MOVABLE] = 0;
5834 /* Find the PFNs that ZONE_MOVABLE begins at in each node */
5835 memset(zone_movable_pfn, 0, sizeof(zone_movable_pfn));
5836 find_zone_movable_pfns_for_nodes();
5838 /* Print out the zone ranges */
5839 pr_info("Zone ranges:\n");
5840 for (i = 0; i < MAX_NR_ZONES; i++) {
5841 if (i == ZONE_MOVABLE)
5843 pr_info(" %-8s ", zone_names[i]);
5844 if (arch_zone_lowest_possible_pfn[i] ==
5845 arch_zone_highest_possible_pfn[i])
5848 pr_cont("[mem %#018Lx-%#018Lx]\n",
5849 (u64)arch_zone_lowest_possible_pfn[i]
5851 ((u64)arch_zone_highest_possible_pfn[i]
5852 << PAGE_SHIFT) - 1);
5855 /* Print out the PFNs ZONE_MOVABLE begins at in each node */
5856 pr_info("Movable zone start for each node\n");
5857 for (i = 0; i < MAX_NUMNODES; i++) {
5858 if (zone_movable_pfn[i])
5859 pr_info(" Node %d: %#018Lx\n", i,
5860 (u64)zone_movable_pfn[i] << PAGE_SHIFT);
5863 /* Print out the early node map */
5864 pr_info("Early memory node ranges\n");
5865 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid)
5866 pr_info(" node %3d: [mem %#018Lx-%#018Lx]\n", nid,
5867 (u64)start_pfn << PAGE_SHIFT,
5868 ((u64)end_pfn << PAGE_SHIFT) - 1);
5870 /* Initialise every node */
5871 mminit_verify_pageflags_layout();
5872 setup_nr_node_ids();
5873 for_each_online_node(nid) {
5874 pg_data_t *pgdat = NODE_DATA(nid);
5875 free_area_init_node(nid, NULL,
5876 find_min_pfn_for_node(nid), NULL);
5878 /* Any memory on that node */
5879 if (pgdat->node_present_pages)
5880 node_set_state(nid, N_MEMORY);
5881 check_for_memory(pgdat, nid);
5885 static int __init cmdline_parse_core(char *p, unsigned long *core)
5887 unsigned long long coremem;
5891 coremem = memparse(p, &p);
5892 *core = coremem >> PAGE_SHIFT;
5894 /* Paranoid check that UL is enough for the coremem value */
5895 WARN_ON((coremem >> PAGE_SHIFT) > ULONG_MAX);
5901 * kernelcore=size sets the amount of memory for use for allocations that
5902 * cannot be reclaimed or migrated.
5904 static int __init cmdline_parse_kernelcore(char *p)
5906 /* parse kernelcore=mirror */
5907 if (parse_option_str(p, "mirror")) {
5908 mirrored_kernelcore = true;
5912 return cmdline_parse_core(p, &required_kernelcore);
5916 * movablecore=size sets the amount of memory for use for allocations that
5917 * can be reclaimed or migrated.
5919 static int __init cmdline_parse_movablecore(char *p)
5921 return cmdline_parse_core(p, &required_movablecore);
5924 early_param("kernelcore", cmdline_parse_kernelcore);
5925 early_param("movablecore", cmdline_parse_movablecore);
5927 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
5929 void adjust_managed_page_count(struct page *page, long count)
5931 spin_lock(&managed_page_count_lock);
5932 page_zone(page)->managed_pages += count;
5933 totalram_pages += count;
5934 #ifdef CONFIG_HIGHMEM
5935 if (PageHighMem(page))
5936 totalhigh_pages += count;
5938 spin_unlock(&managed_page_count_lock);
5940 EXPORT_SYMBOL(adjust_managed_page_count);
5942 unsigned long free_reserved_area(void *start, void *end, int poison, char *s)
5945 unsigned long pages = 0;
5947 start = (void *)PAGE_ALIGN((unsigned long)start);
5948 end = (void *)((unsigned long)end & PAGE_MASK);
5949 for (pos = start; pos < end; pos += PAGE_SIZE, pages++) {
5950 if ((unsigned int)poison <= 0xFF)
5951 memset(pos, poison, PAGE_SIZE);
5952 free_reserved_page(virt_to_page(pos));
5956 pr_info("Freeing %s memory: %ldK (%p - %p)\n",
5957 s, pages << (PAGE_SHIFT - 10), start, end);
5961 EXPORT_SYMBOL(free_reserved_area);
5963 #ifdef CONFIG_HIGHMEM
5964 void free_highmem_page(struct page *page)
5966 __free_reserved_page(page);
5968 page_zone(page)->managed_pages++;
5974 void __init mem_init_print_info(const char *str)
5976 unsigned long physpages, codesize, datasize, rosize, bss_size;
5977 unsigned long init_code_size, init_data_size;
5979 physpages = get_num_physpages();
5980 codesize = _etext - _stext;
5981 datasize = _edata - _sdata;
5982 rosize = __end_rodata - __start_rodata;
5983 bss_size = __bss_stop - __bss_start;
5984 init_data_size = __init_end - __init_begin;
5985 init_code_size = _einittext - _sinittext;
5988 * Detect special cases and adjust section sizes accordingly:
5989 * 1) .init.* may be embedded into .data sections
5990 * 2) .init.text.* may be out of [__init_begin, __init_end],
5991 * please refer to arch/tile/kernel/vmlinux.lds.S.
5992 * 3) .rodata.* may be embedded into .text or .data sections.
5994 #define adj_init_size(start, end, size, pos, adj) \
5996 if (start <= pos && pos < end && size > adj) \
6000 adj_init_size(__init_begin, __init_end, init_data_size,
6001 _sinittext, init_code_size);
6002 adj_init_size(_stext, _etext, codesize, _sinittext, init_code_size);
6003 adj_init_size(_sdata, _edata, datasize, __init_begin, init_data_size);
6004 adj_init_size(_stext, _etext, codesize, __start_rodata, rosize);
6005 adj_init_size(_sdata, _edata, datasize, __start_rodata, rosize);
6007 #undef adj_init_size
6009 pr_info("Memory: %luK/%luK available "
6010 "(%luK kernel code, %luK rwdata, %luK rodata, "
6011 "%luK init, %luK bss, %luK reserved, %luK cma-reserved"
6012 #ifdef CONFIG_HIGHMEM
6016 nr_free_pages() << (PAGE_SHIFT-10), physpages << (PAGE_SHIFT-10),
6017 codesize >> 10, datasize >> 10, rosize >> 10,
6018 (init_data_size + init_code_size) >> 10, bss_size >> 10,
6019 (physpages - totalram_pages - totalcma_pages) << (PAGE_SHIFT-10),
6020 totalcma_pages << (PAGE_SHIFT-10),
6021 #ifdef CONFIG_HIGHMEM
6022 totalhigh_pages << (PAGE_SHIFT-10),
6024 str ? ", " : "", str ? str : "");
6028 * set_dma_reserve - set the specified number of pages reserved in the first zone
6029 * @new_dma_reserve: The number of pages to mark reserved
6031 * The per-cpu batchsize and zone watermarks are determined by managed_pages.
6032 * In the DMA zone, a significant percentage may be consumed by kernel image
6033 * and other unfreeable allocations which can skew the watermarks badly. This
6034 * function may optionally be used to account for unfreeable pages in the
6035 * first zone (e.g., ZONE_DMA). The effect will be lower watermarks and
6036 * smaller per-cpu batchsize.
6038 void __init set_dma_reserve(unsigned long new_dma_reserve)
6040 dma_reserve = new_dma_reserve;
6043 void __init free_area_init(unsigned long *zones_size)
6045 free_area_init_node(0, zones_size,
6046 __pa(PAGE_OFFSET) >> PAGE_SHIFT, NULL);
6049 static int page_alloc_cpu_notify(struct notifier_block *self,
6050 unsigned long action, void *hcpu)
6052 int cpu = (unsigned long)hcpu;
6054 if (action == CPU_DEAD || action == CPU_DEAD_FROZEN) {
6055 lru_add_drain_cpu(cpu);
6059 * Spill the event counters of the dead processor
6060 * into the current processors event counters.
6061 * This artificially elevates the count of the current
6064 vm_events_fold_cpu(cpu);
6067 * Zero the differential counters of the dead processor
6068 * so that the vm statistics are consistent.
6070 * This is only okay since the processor is dead and cannot
6071 * race with what we are doing.
6073 cpu_vm_stats_fold(cpu);
6078 void __init page_alloc_init(void)
6080 hotcpu_notifier(page_alloc_cpu_notify, 0);
6084 * calculate_totalreserve_pages - called when sysctl_lowmem_reserve_ratio
6085 * or min_free_kbytes changes.
6087 static void calculate_totalreserve_pages(void)
6089 struct pglist_data *pgdat;
6090 unsigned long reserve_pages = 0;
6091 enum zone_type i, j;
6093 for_each_online_pgdat(pgdat) {
6094 for (i = 0; i < MAX_NR_ZONES; i++) {
6095 struct zone *zone = pgdat->node_zones + i;
6098 /* Find valid and maximum lowmem_reserve in the zone */
6099 for (j = i; j < MAX_NR_ZONES; j++) {
6100 if (zone->lowmem_reserve[j] > max)
6101 max = zone->lowmem_reserve[j];
6104 /* we treat the high watermark as reserved pages. */
6105 max += high_wmark_pages(zone);
6107 if (max > zone->managed_pages)
6108 max = zone->managed_pages;
6110 zone->totalreserve_pages = max;
6112 reserve_pages += max;
6115 totalreserve_pages = reserve_pages;
6119 * setup_per_zone_lowmem_reserve - called whenever
6120 * sysctl_lowmem_reserve_ratio changes. Ensures that each zone
6121 * has a correct pages reserved value, so an adequate number of
6122 * pages are left in the zone after a successful __alloc_pages().
6124 static void setup_per_zone_lowmem_reserve(void)
6126 struct pglist_data *pgdat;
6127 enum zone_type j, idx;
6129 for_each_online_pgdat(pgdat) {
6130 for (j = 0; j < MAX_NR_ZONES; j++) {
6131 struct zone *zone = pgdat->node_zones + j;
6132 unsigned long managed_pages = zone->managed_pages;
6134 zone->lowmem_reserve[j] = 0;
6138 struct zone *lower_zone;
6142 if (sysctl_lowmem_reserve_ratio[idx] < 1)
6143 sysctl_lowmem_reserve_ratio[idx] = 1;
6145 lower_zone = pgdat->node_zones + idx;
6146 lower_zone->lowmem_reserve[j] = managed_pages /
6147 sysctl_lowmem_reserve_ratio[idx];
6148 managed_pages += lower_zone->managed_pages;
6153 /* update totalreserve_pages */
6154 calculate_totalreserve_pages();
6157 static void __setup_per_zone_wmarks(void)
6159 unsigned long pages_min = min_free_kbytes >> (PAGE_SHIFT - 10);
6160 unsigned long lowmem_pages = 0;
6162 unsigned long flags;
6164 /* Calculate total number of !ZONE_HIGHMEM pages */
6165 for_each_zone(zone) {
6166 if (!is_highmem(zone))
6167 lowmem_pages += zone->managed_pages;
6170 for_each_zone(zone) {
6173 spin_lock_irqsave(&zone->lock, flags);
6174 tmp = (u64)pages_min * zone->managed_pages;
6175 do_div(tmp, lowmem_pages);
6176 if (is_highmem(zone)) {
6178 * __GFP_HIGH and PF_MEMALLOC allocations usually don't
6179 * need highmem pages, so cap pages_min to a small
6182 * The WMARK_HIGH-WMARK_LOW and (WMARK_LOW-WMARK_MIN)
6183 * deltas control asynch page reclaim, and so should
6184 * not be capped for highmem.
6186 unsigned long min_pages;
6188 min_pages = zone->managed_pages / 1024;
6189 min_pages = clamp(min_pages, SWAP_CLUSTER_MAX, 128UL);
6190 zone->watermark[WMARK_MIN] = min_pages;
6193 * If it's a lowmem zone, reserve a number of pages
6194 * proportionate to the zone's size.
6196 zone->watermark[WMARK_MIN] = tmp;
6199 zone->watermark[WMARK_LOW] = min_wmark_pages(zone) + (tmp >> 2);
6200 zone->watermark[WMARK_HIGH] = min_wmark_pages(zone) + (tmp >> 1);
6202 __mod_zone_page_state(zone, NR_ALLOC_BATCH,
6203 high_wmark_pages(zone) - low_wmark_pages(zone) -
6204 atomic_long_read(&zone->vm_stat[NR_ALLOC_BATCH]));
6206 spin_unlock_irqrestore(&zone->lock, flags);
6209 /* update totalreserve_pages */
6210 calculate_totalreserve_pages();
6214 * setup_per_zone_wmarks - called when min_free_kbytes changes
6215 * or when memory is hot-{added|removed}
6217 * Ensures that the watermark[min,low,high] values for each zone are set
6218 * correctly with respect to min_free_kbytes.
6220 void setup_per_zone_wmarks(void)
6222 mutex_lock(&zonelists_mutex);
6223 __setup_per_zone_wmarks();
6224 mutex_unlock(&zonelists_mutex);
6228 * The inactive anon list should be small enough that the VM never has to
6229 * do too much work, but large enough that each inactive page has a chance
6230 * to be referenced again before it is swapped out.
6232 * The inactive_anon ratio is the target ratio of ACTIVE_ANON to
6233 * INACTIVE_ANON pages on this zone's LRU, maintained by the
6234 * pageout code. A zone->inactive_ratio of 3 means 3:1 or 25% of
6235 * the anonymous pages are kept on the inactive list.
6238 * memory ratio inactive anon
6239 * -------------------------------------
6248 static void __meminit calculate_zone_inactive_ratio(struct zone *zone)
6250 unsigned int gb, ratio;
6252 /* Zone size in gigabytes */
6253 gb = zone->managed_pages >> (30 - PAGE_SHIFT);
6255 ratio = int_sqrt(10 * gb);
6259 zone->inactive_ratio = ratio;
6262 static void __meminit setup_per_zone_inactive_ratio(void)
6267 calculate_zone_inactive_ratio(zone);
6271 * Initialise min_free_kbytes.
6273 * For small machines we want it small (128k min). For large machines
6274 * we want it large (64MB max). But it is not linear, because network
6275 * bandwidth does not increase linearly with machine size. We use
6277 * min_free_kbytes = 4 * sqrt(lowmem_kbytes), for better accuracy:
6278 * min_free_kbytes = sqrt(lowmem_kbytes * 16)
6294 int __meminit init_per_zone_wmark_min(void)
6296 unsigned long lowmem_kbytes;
6297 int new_min_free_kbytes;
6299 lowmem_kbytes = nr_free_buffer_pages() * (PAGE_SIZE >> 10);
6300 new_min_free_kbytes = int_sqrt(lowmem_kbytes * 16);
6302 if (new_min_free_kbytes > user_min_free_kbytes) {
6303 min_free_kbytes = new_min_free_kbytes;
6304 if (min_free_kbytes < 128)
6305 min_free_kbytes = 128;
6306 if (min_free_kbytes > 65536)
6307 min_free_kbytes = 65536;
6309 pr_warn("min_free_kbytes is not updated to %d because user defined value %d is preferred\n",
6310 new_min_free_kbytes, user_min_free_kbytes);
6312 setup_per_zone_wmarks();
6313 refresh_zone_stat_thresholds();
6314 setup_per_zone_lowmem_reserve();
6315 setup_per_zone_inactive_ratio();
6318 module_init(init_per_zone_wmark_min)
6321 * min_free_kbytes_sysctl_handler - just a wrapper around proc_dointvec() so
6322 * that we can call two helper functions whenever min_free_kbytes
6325 int min_free_kbytes_sysctl_handler(struct ctl_table *table, int write,
6326 void __user *buffer, size_t *length, loff_t *ppos)
6330 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
6335 user_min_free_kbytes = min_free_kbytes;
6336 setup_per_zone_wmarks();
6342 int sysctl_min_unmapped_ratio_sysctl_handler(struct ctl_table *table, int write,
6343 void __user *buffer, size_t *length, loff_t *ppos)
6348 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
6353 zone->min_unmapped_pages = (zone->managed_pages *
6354 sysctl_min_unmapped_ratio) / 100;
6358 int sysctl_min_slab_ratio_sysctl_handler(struct ctl_table *table, int write,
6359 void __user *buffer, size_t *length, loff_t *ppos)
6364 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
6369 zone->min_slab_pages = (zone->managed_pages *
6370 sysctl_min_slab_ratio) / 100;
6376 * lowmem_reserve_ratio_sysctl_handler - just a wrapper around
6377 * proc_dointvec() so that we can call setup_per_zone_lowmem_reserve()
6378 * whenever sysctl_lowmem_reserve_ratio changes.
6380 * The reserve ratio obviously has absolutely no relation with the
6381 * minimum watermarks. The lowmem reserve ratio can only make sense
6382 * if in function of the boot time zone sizes.
6384 int lowmem_reserve_ratio_sysctl_handler(struct ctl_table *table, int write,
6385 void __user *buffer, size_t *length, loff_t *ppos)
6387 proc_dointvec_minmax(table, write, buffer, length, ppos);
6388 setup_per_zone_lowmem_reserve();
6393 * percpu_pagelist_fraction - changes the pcp->high for each zone on each
6394 * cpu. It is the fraction of total pages in each zone that a hot per cpu
6395 * pagelist can have before it gets flushed back to buddy allocator.
6397 int percpu_pagelist_fraction_sysctl_handler(struct ctl_table *table, int write,
6398 void __user *buffer, size_t *length, loff_t *ppos)
6401 int old_percpu_pagelist_fraction;
6404 mutex_lock(&pcp_batch_high_lock);
6405 old_percpu_pagelist_fraction = percpu_pagelist_fraction;
6407 ret = proc_dointvec_minmax(table, write, buffer, length, ppos);
6408 if (!write || ret < 0)
6411 /* Sanity checking to avoid pcp imbalance */
6412 if (percpu_pagelist_fraction &&
6413 percpu_pagelist_fraction < MIN_PERCPU_PAGELIST_FRACTION) {
6414 percpu_pagelist_fraction = old_percpu_pagelist_fraction;
6420 if (percpu_pagelist_fraction == old_percpu_pagelist_fraction)
6423 for_each_populated_zone(zone) {
6426 for_each_possible_cpu(cpu)
6427 pageset_set_high_and_batch(zone,
6428 per_cpu_ptr(zone->pageset, cpu));
6431 mutex_unlock(&pcp_batch_high_lock);
6436 int hashdist = HASHDIST_DEFAULT;
6438 static int __init set_hashdist(char *str)
6442 hashdist = simple_strtoul(str, &str, 0);
6445 __setup("hashdist=", set_hashdist);
6449 * allocate a large system hash table from bootmem
6450 * - it is assumed that the hash table must contain an exact power-of-2
6451 * quantity of entries
6452 * - limit is the number of hash buckets, not the total allocation size
6454 void *__init alloc_large_system_hash(const char *tablename,
6455 unsigned long bucketsize,
6456 unsigned long numentries,
6459 unsigned int *_hash_shift,
6460 unsigned int *_hash_mask,
6461 unsigned long low_limit,
6462 unsigned long high_limit)
6464 unsigned long long max = high_limit;
6465 unsigned long log2qty, size;
6468 /* allow the kernel cmdline to have a say */
6470 /* round applicable memory size up to nearest megabyte */
6471 numentries = nr_kernel_pages;
6473 /* It isn't necessary when PAGE_SIZE >= 1MB */
6474 if (PAGE_SHIFT < 20)
6475 numentries = round_up(numentries, (1<<20)/PAGE_SIZE);
6477 /* limit to 1 bucket per 2^scale bytes of low memory */
6478 if (scale > PAGE_SHIFT)
6479 numentries >>= (scale - PAGE_SHIFT);
6481 numentries <<= (PAGE_SHIFT - scale);
6483 /* Make sure we've got at least a 0-order allocation.. */
6484 if (unlikely(flags & HASH_SMALL)) {
6485 /* Makes no sense without HASH_EARLY */
6486 WARN_ON(!(flags & HASH_EARLY));
6487 if (!(numentries >> *_hash_shift)) {
6488 numentries = 1UL << *_hash_shift;
6489 BUG_ON(!numentries);
6491 } else if (unlikely((numentries * bucketsize) < PAGE_SIZE))
6492 numentries = PAGE_SIZE / bucketsize;
6494 numentries = roundup_pow_of_two(numentries);
6496 /* limit allocation size to 1/16 total memory by default */
6498 max = ((unsigned long long)nr_all_pages << PAGE_SHIFT) >> 4;
6499 do_div(max, bucketsize);
6501 max = min(max, 0x80000000ULL);
6503 if (numentries < low_limit)
6504 numentries = low_limit;
6505 if (numentries > max)
6508 log2qty = ilog2(numentries);
6511 size = bucketsize << log2qty;
6512 if (flags & HASH_EARLY)
6513 table = memblock_virt_alloc_nopanic(size, 0);
6515 table = __vmalloc(size, GFP_ATOMIC, PAGE_KERNEL);
6518 * If bucketsize is not a power-of-two, we may free
6519 * some pages at the end of hash table which
6520 * alloc_pages_exact() automatically does
6522 if (get_order(size) < MAX_ORDER) {
6523 table = alloc_pages_exact(size, GFP_ATOMIC);
6524 kmemleak_alloc(table, size, 1, GFP_ATOMIC);
6527 } while (!table && size > PAGE_SIZE && --log2qty);
6530 panic("Failed to allocate %s hash table\n", tablename);
6532 printk(KERN_INFO "%s hash table entries: %ld (order: %d, %lu bytes)\n",
6535 ilog2(size) - PAGE_SHIFT,
6539 *_hash_shift = log2qty;
6541 *_hash_mask = (1 << log2qty) - 1;
6546 /* Return a pointer to the bitmap storing bits affecting a block of pages */
6547 static inline unsigned long *get_pageblock_bitmap(struct zone *zone,
6550 #ifdef CONFIG_SPARSEMEM
6551 return __pfn_to_section(pfn)->pageblock_flags;
6553 return zone->pageblock_flags;
6554 #endif /* CONFIG_SPARSEMEM */
6557 static inline int pfn_to_bitidx(struct zone *zone, unsigned long pfn)
6559 #ifdef CONFIG_SPARSEMEM
6560 pfn &= (PAGES_PER_SECTION-1);
6561 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
6563 pfn = pfn - round_down(zone->zone_start_pfn, pageblock_nr_pages);
6564 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
6565 #endif /* CONFIG_SPARSEMEM */
6569 * get_pfnblock_flags_mask - Return the requested group of flags for the pageblock_nr_pages block of pages
6570 * @page: The page within the block of interest
6571 * @pfn: The target page frame number
6572 * @end_bitidx: The last bit of interest to retrieve
6573 * @mask: mask of bits that the caller is interested in
6575 * Return: pageblock_bits flags
6577 unsigned long get_pfnblock_flags_mask(struct page *page, unsigned long pfn,
6578 unsigned long end_bitidx,
6582 unsigned long *bitmap;
6583 unsigned long bitidx, word_bitidx;
6586 zone = page_zone(page);
6587 bitmap = get_pageblock_bitmap(zone, pfn);
6588 bitidx = pfn_to_bitidx(zone, pfn);
6589 word_bitidx = bitidx / BITS_PER_LONG;
6590 bitidx &= (BITS_PER_LONG-1);
6592 word = bitmap[word_bitidx];
6593 bitidx += end_bitidx;
6594 return (word >> (BITS_PER_LONG - bitidx - 1)) & mask;
6598 * set_pfnblock_flags_mask - Set the requested group of flags for a pageblock_nr_pages block of pages
6599 * @page: The page within the block of interest
6600 * @flags: The flags to set
6601 * @pfn: The target page frame number
6602 * @end_bitidx: The last bit of interest
6603 * @mask: mask of bits that the caller is interested in
6605 void set_pfnblock_flags_mask(struct page *page, unsigned long flags,
6607 unsigned long end_bitidx,
6611 unsigned long *bitmap;
6612 unsigned long bitidx, word_bitidx;
6613 unsigned long old_word, word;
6615 BUILD_BUG_ON(NR_PAGEBLOCK_BITS != 4);
6617 zone = page_zone(page);
6618 bitmap = get_pageblock_bitmap(zone, pfn);
6619 bitidx = pfn_to_bitidx(zone, pfn);
6620 word_bitidx = bitidx / BITS_PER_LONG;
6621 bitidx &= (BITS_PER_LONG-1);
6623 VM_BUG_ON_PAGE(!zone_spans_pfn(zone, pfn), page);
6625 bitidx += end_bitidx;
6626 mask <<= (BITS_PER_LONG - bitidx - 1);
6627 flags <<= (BITS_PER_LONG - bitidx - 1);
6629 word = READ_ONCE(bitmap[word_bitidx]);
6631 old_word = cmpxchg(&bitmap[word_bitidx], word, (word & ~mask) | flags);
6632 if (word == old_word)
6639 * This function checks whether pageblock includes unmovable pages or not.
6640 * If @count is not zero, it is okay to include less @count unmovable pages
6642 * PageLRU check without isolation or lru_lock could race so that
6643 * MIGRATE_MOVABLE block might include unmovable pages. It means you can't
6644 * expect this function should be exact.
6646 bool has_unmovable_pages(struct zone *zone, struct page *page, int count,
6647 bool skip_hwpoisoned_pages)
6649 unsigned long pfn, iter, found;
6653 * For avoiding noise data, lru_add_drain_all() should be called
6654 * If ZONE_MOVABLE, the zone never contains unmovable pages
6656 if (zone_idx(zone) == ZONE_MOVABLE)
6658 mt = get_pageblock_migratetype(page);
6659 if (mt == MIGRATE_MOVABLE || is_migrate_cma(mt))
6662 pfn = page_to_pfn(page);
6663 for (found = 0, iter = 0; iter < pageblock_nr_pages; iter++) {
6664 unsigned long check = pfn + iter;
6666 if (!pfn_valid_within(check))
6669 page = pfn_to_page(check);
6672 * Hugepages are not in LRU lists, but they're movable.
6673 * We need not scan over tail pages bacause we don't
6674 * handle each tail page individually in migration.
6676 if (PageHuge(page)) {
6677 iter = round_up(iter + 1, 1<<compound_order(page)) - 1;
6682 * We can't use page_count without pin a page
6683 * because another CPU can free compound page.
6684 * This check already skips compound tails of THP
6685 * because their page->_count is zero at all time.
6687 if (!atomic_read(&page->_count)) {
6688 if (PageBuddy(page))
6689 iter += (1 << page_order(page)) - 1;
6694 * The HWPoisoned page may be not in buddy system, and
6695 * page_count() is not 0.
6697 if (skip_hwpoisoned_pages && PageHWPoison(page))
6703 * If there are RECLAIMABLE pages, we need to check
6704 * it. But now, memory offline itself doesn't call
6705 * shrink_node_slabs() and it still to be fixed.
6708 * If the page is not RAM, page_count()should be 0.
6709 * we don't need more check. This is an _used_ not-movable page.
6711 * The problematic thing here is PG_reserved pages. PG_reserved
6712 * is set to both of a memory hole page and a _used_ kernel
6721 bool is_pageblock_removable_nolock(struct page *page)
6727 * We have to be careful here because we are iterating over memory
6728 * sections which are not zone aware so we might end up outside of
6729 * the zone but still within the section.
6730 * We have to take care about the node as well. If the node is offline
6731 * its NODE_DATA will be NULL - see page_zone.
6733 if (!node_online(page_to_nid(page)))
6736 zone = page_zone(page);
6737 pfn = page_to_pfn(page);
6738 if (!zone_spans_pfn(zone, pfn))
6741 return !has_unmovable_pages(zone, page, 0, true);
6744 #if (defined(CONFIG_MEMORY_ISOLATION) && defined(CONFIG_COMPACTION)) || defined(CONFIG_CMA)
6746 static unsigned long pfn_max_align_down(unsigned long pfn)
6748 return pfn & ~(max_t(unsigned long, MAX_ORDER_NR_PAGES,
6749 pageblock_nr_pages) - 1);
6752 static unsigned long pfn_max_align_up(unsigned long pfn)
6754 return ALIGN(pfn, max_t(unsigned long, MAX_ORDER_NR_PAGES,
6755 pageblock_nr_pages));
6758 /* [start, end) must belong to a single zone. */
6759 static int __alloc_contig_migrate_range(struct compact_control *cc,
6760 unsigned long start, unsigned long end)
6762 /* This function is based on compact_zone() from compaction.c. */
6763 unsigned long nr_reclaimed;
6764 unsigned long pfn = start;
6765 unsigned int tries = 0;
6770 while (pfn < end || !list_empty(&cc->migratepages)) {
6771 if (fatal_signal_pending(current)) {
6776 if (list_empty(&cc->migratepages)) {
6777 cc->nr_migratepages = 0;
6778 pfn = isolate_migratepages_range(cc, pfn, end);
6784 } else if (++tries == 5) {
6785 ret = ret < 0 ? ret : -EBUSY;
6789 nr_reclaimed = reclaim_clean_pages_from_list(cc->zone,
6791 cc->nr_migratepages -= nr_reclaimed;
6793 ret = migrate_pages(&cc->migratepages, alloc_migrate_target,
6794 NULL, 0, cc->mode, MR_CMA);
6797 putback_movable_pages(&cc->migratepages);
6804 * alloc_contig_range() -- tries to allocate given range of pages
6805 * @start: start PFN to allocate
6806 * @end: one-past-the-last PFN to allocate
6807 * @migratetype: migratetype of the underlaying pageblocks (either
6808 * #MIGRATE_MOVABLE or #MIGRATE_CMA). All pageblocks
6809 * in range must have the same migratetype and it must
6810 * be either of the two.
6812 * The PFN range does not have to be pageblock or MAX_ORDER_NR_PAGES
6813 * aligned, however it's the caller's responsibility to guarantee that
6814 * we are the only thread that changes migrate type of pageblocks the
6817 * The PFN range must belong to a single zone.
6819 * Returns zero on success or negative error code. On success all
6820 * pages which PFN is in [start, end) are allocated for the caller and
6821 * need to be freed with free_contig_range().
6823 int alloc_contig_range(unsigned long start, unsigned long end,
6824 unsigned migratetype)
6826 unsigned long outer_start, outer_end;
6830 struct compact_control cc = {
6831 .nr_migratepages = 0,
6833 .zone = page_zone(pfn_to_page(start)),
6834 .mode = MIGRATE_SYNC,
6835 .ignore_skip_hint = true,
6837 INIT_LIST_HEAD(&cc.migratepages);
6840 * What we do here is we mark all pageblocks in range as
6841 * MIGRATE_ISOLATE. Because pageblock and max order pages may
6842 * have different sizes, and due to the way page allocator
6843 * work, we align the range to biggest of the two pages so
6844 * that page allocator won't try to merge buddies from
6845 * different pageblocks and change MIGRATE_ISOLATE to some
6846 * other migration type.
6848 * Once the pageblocks are marked as MIGRATE_ISOLATE, we
6849 * migrate the pages from an unaligned range (ie. pages that
6850 * we are interested in). This will put all the pages in
6851 * range back to page allocator as MIGRATE_ISOLATE.
6853 * When this is done, we take the pages in range from page
6854 * allocator removing them from the buddy system. This way
6855 * page allocator will never consider using them.
6857 * This lets us mark the pageblocks back as
6858 * MIGRATE_CMA/MIGRATE_MOVABLE so that free pages in the
6859 * aligned range but not in the unaligned, original range are
6860 * put back to page allocator so that buddy can use them.
6863 ret = start_isolate_page_range(pfn_max_align_down(start),
6864 pfn_max_align_up(end), migratetype,
6870 * In case of -EBUSY, we'd like to know which page causes problem.
6871 * So, just fall through. We will check it in test_pages_isolated().
6873 ret = __alloc_contig_migrate_range(&cc, start, end);
6874 if (ret && ret != -EBUSY)
6878 * Pages from [start, end) are within a MAX_ORDER_NR_PAGES
6879 * aligned blocks that are marked as MIGRATE_ISOLATE. What's
6880 * more, all pages in [start, end) are free in page allocator.
6881 * What we are going to do is to allocate all pages from
6882 * [start, end) (that is remove them from page allocator).
6884 * The only problem is that pages at the beginning and at the
6885 * end of interesting range may be not aligned with pages that
6886 * page allocator holds, ie. they can be part of higher order
6887 * pages. Because of this, we reserve the bigger range and
6888 * once this is done free the pages we are not interested in.
6890 * We don't have to hold zone->lock here because the pages are
6891 * isolated thus they won't get removed from buddy.
6894 lru_add_drain_all();
6895 drain_all_pages(cc.zone);
6898 outer_start = start;
6899 while (!PageBuddy(pfn_to_page(outer_start))) {
6900 if (++order >= MAX_ORDER) {
6901 outer_start = start;
6904 outer_start &= ~0UL << order;
6907 if (outer_start != start) {
6908 order = page_order(pfn_to_page(outer_start));
6911 * outer_start page could be small order buddy page and
6912 * it doesn't include start page. Adjust outer_start
6913 * in this case to report failed page properly
6914 * on tracepoint in test_pages_isolated()
6916 if (outer_start + (1UL << order) <= start)
6917 outer_start = start;
6920 /* Make sure the range is really isolated. */
6921 if (test_pages_isolated(outer_start, end, false)) {
6922 pr_info("%s: [%lx, %lx) PFNs busy\n",
6923 __func__, outer_start, end);
6928 /* Grab isolated pages from freelists. */
6929 outer_end = isolate_freepages_range(&cc, outer_start, end);
6935 /* Free head and tail (if any) */
6936 if (start != outer_start)
6937 free_contig_range(outer_start, start - outer_start);
6938 if (end != outer_end)
6939 free_contig_range(end, outer_end - end);
6942 undo_isolate_page_range(pfn_max_align_down(start),
6943 pfn_max_align_up(end), migratetype);
6947 void free_contig_range(unsigned long pfn, unsigned nr_pages)
6949 unsigned int count = 0;
6951 for (; nr_pages--; pfn++) {
6952 struct page *page = pfn_to_page(pfn);
6954 count += page_count(page) != 1;
6957 WARN(count != 0, "%d pages are still in use!\n", count);
6961 #ifdef CONFIG_MEMORY_HOTPLUG
6963 * The zone indicated has a new number of managed_pages; batch sizes and percpu
6964 * page high values need to be recalulated.
6966 void __meminit zone_pcp_update(struct zone *zone)
6969 mutex_lock(&pcp_batch_high_lock);
6970 for_each_possible_cpu(cpu)
6971 pageset_set_high_and_batch(zone,
6972 per_cpu_ptr(zone->pageset, cpu));
6973 mutex_unlock(&pcp_batch_high_lock);
6977 void zone_pcp_reset(struct zone *zone)
6979 unsigned long flags;
6981 struct per_cpu_pageset *pset;
6983 /* avoid races with drain_pages() */
6984 local_irq_save(flags);
6985 if (zone->pageset != &boot_pageset) {
6986 for_each_online_cpu(cpu) {
6987 pset = per_cpu_ptr(zone->pageset, cpu);
6988 drain_zonestat(zone, pset);
6990 free_percpu(zone->pageset);
6991 zone->pageset = &boot_pageset;
6993 local_irq_restore(flags);
6996 #ifdef CONFIG_MEMORY_HOTREMOVE
6998 * All pages in the range must be isolated before calling this.
7001 __offline_isolated_pages(unsigned long start_pfn, unsigned long end_pfn)
7005 unsigned int order, i;
7007 unsigned long flags;
7008 /* find the first valid pfn */
7009 for (pfn = start_pfn; pfn < end_pfn; pfn++)
7014 zone = page_zone(pfn_to_page(pfn));
7015 spin_lock_irqsave(&zone->lock, flags);
7017 while (pfn < end_pfn) {
7018 if (!pfn_valid(pfn)) {
7022 page = pfn_to_page(pfn);
7024 * The HWPoisoned page may be not in buddy system, and
7025 * page_count() is not 0.
7027 if (unlikely(!PageBuddy(page) && PageHWPoison(page))) {
7029 SetPageReserved(page);
7033 BUG_ON(page_count(page));
7034 BUG_ON(!PageBuddy(page));
7035 order = page_order(page);
7036 #ifdef CONFIG_DEBUG_VM
7037 printk(KERN_INFO "remove from free list %lx %d %lx\n",
7038 pfn, 1 << order, end_pfn);
7040 list_del(&page->lru);
7041 rmv_page_order(page);
7042 zone->free_area[order].nr_free--;
7043 for (i = 0; i < (1 << order); i++)
7044 SetPageReserved((page+i));
7045 pfn += (1 << order);
7047 spin_unlock_irqrestore(&zone->lock, flags);
7051 #ifdef CONFIG_MEMORY_FAILURE
7052 bool is_free_buddy_page(struct page *page)
7054 struct zone *zone = page_zone(page);
7055 unsigned long pfn = page_to_pfn(page);
7056 unsigned long flags;
7059 spin_lock_irqsave(&zone->lock, flags);
7060 for (order = 0; order < MAX_ORDER; order++) {
7061 struct page *page_head = page - (pfn & ((1 << order) - 1));
7063 if (PageBuddy(page_head) && page_order(page_head) >= order)
7066 spin_unlock_irqrestore(&zone->lock, flags);
7068 return order < MAX_ORDER;