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 char * const migratetype_names[MIGRATE_TYPES] = {
234 #ifdef CONFIG_MEMORY_ISOLATION
239 compound_page_dtor * const compound_page_dtors[] = {
242 #ifdef CONFIG_HUGETLB_PAGE
245 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
250 int min_free_kbytes = 1024;
251 int user_min_free_kbytes = -1;
252 int watermark_scale_factor = 10;
254 static unsigned long __meminitdata nr_kernel_pages;
255 static unsigned long __meminitdata nr_all_pages;
256 static unsigned long __meminitdata dma_reserve;
258 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
259 static unsigned long __meminitdata arch_zone_lowest_possible_pfn[MAX_NR_ZONES];
260 static unsigned long __meminitdata arch_zone_highest_possible_pfn[MAX_NR_ZONES];
261 static unsigned long __initdata required_kernelcore;
262 static unsigned long __initdata required_movablecore;
263 static unsigned long __meminitdata zone_movable_pfn[MAX_NUMNODES];
264 static bool mirrored_kernelcore;
266 /* movable_zone is the "real" zone pages in ZONE_MOVABLE are taken from */
268 EXPORT_SYMBOL(movable_zone);
269 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
272 int nr_node_ids __read_mostly = MAX_NUMNODES;
273 int nr_online_nodes __read_mostly = 1;
274 EXPORT_SYMBOL(nr_node_ids);
275 EXPORT_SYMBOL(nr_online_nodes);
278 int page_group_by_mobility_disabled __read_mostly;
280 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
281 static inline void reset_deferred_meminit(pg_data_t *pgdat)
283 pgdat->first_deferred_pfn = ULONG_MAX;
286 /* Returns true if the struct page for the pfn is uninitialised */
287 static inline bool __meminit early_page_uninitialised(unsigned long pfn)
289 if (pfn >= NODE_DATA(early_pfn_to_nid(pfn))->first_deferred_pfn)
295 static inline bool early_page_nid_uninitialised(unsigned long pfn, int nid)
297 if (pfn >= NODE_DATA(nid)->first_deferred_pfn)
304 * Returns false when the remaining initialisation should be deferred until
305 * later in the boot cycle when it can be parallelised.
307 static inline bool update_defer_init(pg_data_t *pgdat,
308 unsigned long pfn, unsigned long zone_end,
309 unsigned long *nr_initialised)
311 unsigned long max_initialise;
313 /* Always populate low zones for address-contrained allocations */
314 if (zone_end < pgdat_end_pfn(pgdat))
317 * Initialise at least 2G of a node but also take into account that
318 * two large system hashes that can take up 1GB for 0.25TB/node.
320 max_initialise = max(2UL << (30 - PAGE_SHIFT),
321 (pgdat->node_spanned_pages >> 8));
324 if ((*nr_initialised > max_initialise) &&
325 (pfn & (PAGES_PER_SECTION - 1)) == 0) {
326 pgdat->first_deferred_pfn = pfn;
333 static inline void reset_deferred_meminit(pg_data_t *pgdat)
337 static inline bool early_page_uninitialised(unsigned long pfn)
342 static inline bool early_page_nid_uninitialised(unsigned long pfn, int nid)
347 static inline bool update_defer_init(pg_data_t *pgdat,
348 unsigned long pfn, unsigned long zone_end,
349 unsigned long *nr_initialised)
356 void set_pageblock_migratetype(struct page *page, int migratetype)
358 if (unlikely(page_group_by_mobility_disabled &&
359 migratetype < MIGRATE_PCPTYPES))
360 migratetype = MIGRATE_UNMOVABLE;
362 set_pageblock_flags_group(page, (unsigned long)migratetype,
363 PB_migrate, PB_migrate_end);
366 #ifdef CONFIG_DEBUG_VM
367 static int page_outside_zone_boundaries(struct zone *zone, struct page *page)
371 unsigned long pfn = page_to_pfn(page);
372 unsigned long sp, start_pfn;
375 seq = zone_span_seqbegin(zone);
376 start_pfn = zone->zone_start_pfn;
377 sp = zone->spanned_pages;
378 if (!zone_spans_pfn(zone, pfn))
380 } while (zone_span_seqretry(zone, seq));
383 pr_err("page 0x%lx outside node %d zone %s [ 0x%lx - 0x%lx ]\n",
384 pfn, zone_to_nid(zone), zone->name,
385 start_pfn, start_pfn + sp);
390 static int page_is_consistent(struct zone *zone, struct page *page)
392 if (!pfn_valid_within(page_to_pfn(page)))
394 if (zone != page_zone(page))
400 * Temporary debugging check for pages not lying within a given zone.
402 static int bad_range(struct zone *zone, struct page *page)
404 if (page_outside_zone_boundaries(zone, page))
406 if (!page_is_consistent(zone, page))
412 static inline int bad_range(struct zone *zone, struct page *page)
418 static void bad_page(struct page *page, const char *reason,
419 unsigned long bad_flags)
421 static unsigned long resume;
422 static unsigned long nr_shown;
423 static unsigned long nr_unshown;
425 /* Don't complain about poisoned pages */
426 if (PageHWPoison(page)) {
427 page_mapcount_reset(page); /* remove PageBuddy */
432 * Allow a burst of 60 reports, then keep quiet for that minute;
433 * or allow a steady drip of one report per second.
435 if (nr_shown == 60) {
436 if (time_before(jiffies, resume)) {
442 "BUG: Bad page state: %lu messages suppressed\n",
449 resume = jiffies + 60 * HZ;
451 pr_alert("BUG: Bad page state in process %s pfn:%05lx\n",
452 current->comm, page_to_pfn(page));
453 __dump_page(page, reason);
454 bad_flags &= page->flags;
456 pr_alert("bad because of flags: %#lx(%pGp)\n",
457 bad_flags, &bad_flags);
458 dump_page_owner(page);
463 /* Leave bad fields for debug, except PageBuddy could make trouble */
464 page_mapcount_reset(page); /* remove PageBuddy */
465 add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE);
469 * Higher-order pages are called "compound pages". They are structured thusly:
471 * The first PAGE_SIZE page is called the "head page" and have PG_head set.
473 * The remaining PAGE_SIZE pages are called "tail pages". PageTail() is encoded
474 * in bit 0 of page->compound_head. The rest of bits is pointer to head page.
476 * The first tail page's ->compound_dtor holds the offset in array of compound
477 * page destructors. See compound_page_dtors.
479 * The first tail page's ->compound_order holds the order of allocation.
480 * This usage means that zero-order pages may not be compound.
483 void free_compound_page(struct page *page)
485 __free_pages_ok(page, compound_order(page));
488 void prep_compound_page(struct page *page, unsigned int order)
491 int nr_pages = 1 << order;
493 set_compound_page_dtor(page, COMPOUND_PAGE_DTOR);
494 set_compound_order(page, order);
496 for (i = 1; i < nr_pages; i++) {
497 struct page *p = page + i;
498 set_page_count(p, 0);
499 p->mapping = TAIL_MAPPING;
500 set_compound_head(p, page);
502 atomic_set(compound_mapcount_ptr(page), -1);
505 #ifdef CONFIG_DEBUG_PAGEALLOC
506 unsigned int _debug_guardpage_minorder;
507 bool _debug_pagealloc_enabled __read_mostly
508 = IS_ENABLED(CONFIG_DEBUG_PAGEALLOC_ENABLE_DEFAULT);
509 EXPORT_SYMBOL(_debug_pagealloc_enabled);
510 bool _debug_guardpage_enabled __read_mostly;
512 static int __init early_debug_pagealloc(char *buf)
517 if (strcmp(buf, "on") == 0)
518 _debug_pagealloc_enabled = true;
520 if (strcmp(buf, "off") == 0)
521 _debug_pagealloc_enabled = false;
525 early_param("debug_pagealloc", early_debug_pagealloc);
527 static bool need_debug_guardpage(void)
529 /* If we don't use debug_pagealloc, we don't need guard page */
530 if (!debug_pagealloc_enabled())
536 static void init_debug_guardpage(void)
538 if (!debug_pagealloc_enabled())
541 _debug_guardpage_enabled = true;
544 struct page_ext_operations debug_guardpage_ops = {
545 .need = need_debug_guardpage,
546 .init = init_debug_guardpage,
549 static int __init debug_guardpage_minorder_setup(char *buf)
553 if (kstrtoul(buf, 10, &res) < 0 || res > MAX_ORDER / 2) {
554 pr_err("Bad debug_guardpage_minorder value\n");
557 _debug_guardpage_minorder = res;
558 pr_info("Setting debug_guardpage_minorder to %lu\n", res);
561 __setup("debug_guardpage_minorder=", debug_guardpage_minorder_setup);
563 static inline void set_page_guard(struct zone *zone, struct page *page,
564 unsigned int order, int migratetype)
566 struct page_ext *page_ext;
568 if (!debug_guardpage_enabled())
571 page_ext = lookup_page_ext(page);
572 __set_bit(PAGE_EXT_DEBUG_GUARD, &page_ext->flags);
574 INIT_LIST_HEAD(&page->lru);
575 set_page_private(page, order);
576 /* Guard pages are not available for any usage */
577 __mod_zone_freepage_state(zone, -(1 << order), migratetype);
580 static inline void clear_page_guard(struct zone *zone, struct page *page,
581 unsigned int order, int migratetype)
583 struct page_ext *page_ext;
585 if (!debug_guardpage_enabled())
588 page_ext = lookup_page_ext(page);
589 __clear_bit(PAGE_EXT_DEBUG_GUARD, &page_ext->flags);
591 set_page_private(page, 0);
592 if (!is_migrate_isolate(migratetype))
593 __mod_zone_freepage_state(zone, (1 << order), migratetype);
596 struct page_ext_operations debug_guardpage_ops = { NULL, };
597 static inline void set_page_guard(struct zone *zone, struct page *page,
598 unsigned int order, int migratetype) {}
599 static inline void clear_page_guard(struct zone *zone, struct page *page,
600 unsigned int order, int migratetype) {}
603 static inline void set_page_order(struct page *page, unsigned int order)
605 set_page_private(page, order);
606 __SetPageBuddy(page);
609 static inline void rmv_page_order(struct page *page)
611 __ClearPageBuddy(page);
612 set_page_private(page, 0);
616 * This function checks whether a page is free && is the buddy
617 * we can do coalesce a page and its buddy if
618 * (a) the buddy is not in a hole &&
619 * (b) the buddy is in the buddy system &&
620 * (c) a page and its buddy have the same order &&
621 * (d) a page and its buddy are in the same zone.
623 * For recording whether a page is in the buddy system, we set ->_mapcount
624 * PAGE_BUDDY_MAPCOUNT_VALUE.
625 * Setting, clearing, and testing _mapcount PAGE_BUDDY_MAPCOUNT_VALUE is
626 * serialized by zone->lock.
628 * For recording page's order, we use page_private(page).
630 static inline int page_is_buddy(struct page *page, struct page *buddy,
633 if (!pfn_valid_within(page_to_pfn(buddy)))
636 if (page_is_guard(buddy) && page_order(buddy) == order) {
637 if (page_zone_id(page) != page_zone_id(buddy))
640 VM_BUG_ON_PAGE(page_count(buddy) != 0, buddy);
645 if (PageBuddy(buddy) && page_order(buddy) == order) {
647 * zone check is done late to avoid uselessly
648 * calculating zone/node ids for pages that could
651 if (page_zone_id(page) != page_zone_id(buddy))
654 VM_BUG_ON_PAGE(page_count(buddy) != 0, buddy);
662 * Freeing function for a buddy system allocator.
664 * The concept of a buddy system is to maintain direct-mapped table
665 * (containing bit values) for memory blocks of various "orders".
666 * The bottom level table contains the map for the smallest allocatable
667 * units of memory (here, pages), and each level above it describes
668 * pairs of units from the levels below, hence, "buddies".
669 * At a high level, all that happens here is marking the table entry
670 * at the bottom level available, and propagating the changes upward
671 * as necessary, plus some accounting needed to play nicely with other
672 * parts of the VM system.
673 * At each level, we keep a list of pages, which are heads of continuous
674 * free pages of length of (1 << order) and marked with _mapcount
675 * PAGE_BUDDY_MAPCOUNT_VALUE. Page's order is recorded in page_private(page)
677 * So when we are allocating or freeing one, we can derive the state of the
678 * other. That is, if we allocate a small block, and both were
679 * free, the remainder of the region must be split into blocks.
680 * If a block is freed, and its buddy is also free, then this
681 * triggers coalescing into a block of larger size.
686 static inline void __free_one_page(struct page *page,
688 struct zone *zone, unsigned int order,
691 unsigned long page_idx;
692 unsigned long combined_idx;
693 unsigned long uninitialized_var(buddy_idx);
695 unsigned int max_order;
697 max_order = min_t(unsigned int, MAX_ORDER, pageblock_order + 1);
699 VM_BUG_ON(!zone_is_initialized(zone));
700 VM_BUG_ON_PAGE(page->flags & PAGE_FLAGS_CHECK_AT_PREP, page);
702 VM_BUG_ON(migratetype == -1);
703 if (likely(!is_migrate_isolate(migratetype)))
704 __mod_zone_freepage_state(zone, 1 << order, migratetype);
706 page_idx = pfn & ((1 << MAX_ORDER) - 1);
708 VM_BUG_ON_PAGE(page_idx & ((1 << order) - 1), page);
709 VM_BUG_ON_PAGE(bad_range(zone, page), page);
712 while (order < max_order - 1) {
713 buddy_idx = __find_buddy_index(page_idx, order);
714 buddy = page + (buddy_idx - page_idx);
715 if (!page_is_buddy(page, buddy, order))
718 * Our buddy is free or it is CONFIG_DEBUG_PAGEALLOC guard page,
719 * merge with it and move up one order.
721 if (page_is_guard(buddy)) {
722 clear_page_guard(zone, buddy, order, migratetype);
724 list_del(&buddy->lru);
725 zone->free_area[order].nr_free--;
726 rmv_page_order(buddy);
728 combined_idx = buddy_idx & page_idx;
729 page = page + (combined_idx - page_idx);
730 page_idx = combined_idx;
733 if (max_order < MAX_ORDER) {
734 /* If we are here, it means order is >= pageblock_order.
735 * We want to prevent merge between freepages on isolate
736 * pageblock and normal pageblock. Without this, pageblock
737 * isolation could cause incorrect freepage or CMA accounting.
739 * We don't want to hit this code for the more frequent
742 if (unlikely(has_isolate_pageblock(zone))) {
745 buddy_idx = __find_buddy_index(page_idx, order);
746 buddy = page + (buddy_idx - page_idx);
747 buddy_mt = get_pageblock_migratetype(buddy);
749 if (migratetype != buddy_mt
750 && (is_migrate_isolate(migratetype) ||
751 is_migrate_isolate(buddy_mt)))
755 goto continue_merging;
759 set_page_order(page, order);
762 * If this is not the largest possible page, check if the buddy
763 * of the next-highest order is free. If it is, it's possible
764 * that pages are being freed that will coalesce soon. In case,
765 * that is happening, add the free page to the tail of the list
766 * so it's less likely to be used soon and more likely to be merged
767 * as a higher order page
769 if ((order < MAX_ORDER-2) && pfn_valid_within(page_to_pfn(buddy))) {
770 struct page *higher_page, *higher_buddy;
771 combined_idx = buddy_idx & page_idx;
772 higher_page = page + (combined_idx - page_idx);
773 buddy_idx = __find_buddy_index(combined_idx, order + 1);
774 higher_buddy = higher_page + (buddy_idx - combined_idx);
775 if (page_is_buddy(higher_page, higher_buddy, order + 1)) {
776 list_add_tail(&page->lru,
777 &zone->free_area[order].free_list[migratetype]);
782 list_add(&page->lru, &zone->free_area[order].free_list[migratetype]);
784 zone->free_area[order].nr_free++;
787 static inline int free_pages_check(struct page *page)
789 const char *bad_reason = NULL;
790 unsigned long bad_flags = 0;
792 if (unlikely(atomic_read(&page->_mapcount) != -1))
793 bad_reason = "nonzero mapcount";
794 if (unlikely(page->mapping != NULL))
795 bad_reason = "non-NULL mapping";
796 if (unlikely(page_ref_count(page) != 0))
797 bad_reason = "nonzero _refcount";
798 if (unlikely(page->flags & PAGE_FLAGS_CHECK_AT_FREE)) {
799 bad_reason = "PAGE_FLAGS_CHECK_AT_FREE flag(s) set";
800 bad_flags = PAGE_FLAGS_CHECK_AT_FREE;
803 if (unlikely(page->mem_cgroup))
804 bad_reason = "page still charged to cgroup";
806 if (unlikely(bad_reason)) {
807 bad_page(page, bad_reason, bad_flags);
810 page_cpupid_reset_last(page);
811 if (page->flags & PAGE_FLAGS_CHECK_AT_PREP)
812 page->flags &= ~PAGE_FLAGS_CHECK_AT_PREP;
817 * Frees a number of pages from the PCP lists
818 * Assumes all pages on list are in same zone, and of same order.
819 * count is the number of pages to free.
821 * If the zone was previously in an "all pages pinned" state then look to
822 * see if this freeing clears that state.
824 * And clear the zone's pages_scanned counter, to hold off the "all pages are
825 * pinned" detection logic.
827 static void free_pcppages_bulk(struct zone *zone, int count,
828 struct per_cpu_pages *pcp)
833 unsigned long nr_scanned;
835 spin_lock(&zone->lock);
836 nr_scanned = zone_page_state(zone, NR_PAGES_SCANNED);
838 __mod_zone_page_state(zone, NR_PAGES_SCANNED, -nr_scanned);
842 struct list_head *list;
845 * Remove pages from lists in a round-robin fashion. A
846 * batch_free count is maintained that is incremented when an
847 * empty list is encountered. This is so more pages are freed
848 * off fuller lists instead of spinning excessively around empty
853 if (++migratetype == MIGRATE_PCPTYPES)
855 list = &pcp->lists[migratetype];
856 } while (list_empty(list));
858 /* This is the only non-empty list. Free them all. */
859 if (batch_free == MIGRATE_PCPTYPES)
860 batch_free = to_free;
863 int mt; /* migratetype of the to-be-freed page */
865 page = list_last_entry(list, struct page, lru);
866 /* must delete as __free_one_page list manipulates */
867 list_del(&page->lru);
869 mt = get_pcppage_migratetype(page);
870 /* MIGRATE_ISOLATE page should not go to pcplists */
871 VM_BUG_ON_PAGE(is_migrate_isolate(mt), page);
872 /* Pageblock could have been isolated meanwhile */
873 if (unlikely(has_isolate_pageblock(zone)))
874 mt = get_pageblock_migratetype(page);
876 __free_one_page(page, page_to_pfn(page), zone, 0, mt);
877 trace_mm_page_pcpu_drain(page, 0, mt);
878 } while (--to_free && --batch_free && !list_empty(list));
880 spin_unlock(&zone->lock);
883 static void free_one_page(struct zone *zone,
884 struct page *page, unsigned long pfn,
888 unsigned long nr_scanned;
889 spin_lock(&zone->lock);
890 nr_scanned = zone_page_state(zone, NR_PAGES_SCANNED);
892 __mod_zone_page_state(zone, NR_PAGES_SCANNED, -nr_scanned);
894 if (unlikely(has_isolate_pageblock(zone) ||
895 is_migrate_isolate(migratetype))) {
896 migratetype = get_pfnblock_migratetype(page, pfn);
898 __free_one_page(page, pfn, zone, order, migratetype);
899 spin_unlock(&zone->lock);
902 static int free_tail_pages_check(struct page *head_page, struct page *page)
907 * We rely page->lru.next never has bit 0 set, unless the page
908 * is PageTail(). Let's make sure that's true even for poisoned ->lru.
910 BUILD_BUG_ON((unsigned long)LIST_POISON1 & 1);
912 if (!IS_ENABLED(CONFIG_DEBUG_VM)) {
916 switch (page - head_page) {
918 /* the first tail page: ->mapping is compound_mapcount() */
919 if (unlikely(compound_mapcount(page))) {
920 bad_page(page, "nonzero compound_mapcount", 0);
926 * the second tail page: ->mapping is
927 * page_deferred_list().next -- ignore value.
931 if (page->mapping != TAIL_MAPPING) {
932 bad_page(page, "corrupted mapping in tail page", 0);
937 if (unlikely(!PageTail(page))) {
938 bad_page(page, "PageTail not set", 0);
941 if (unlikely(compound_head(page) != head_page)) {
942 bad_page(page, "compound_head not consistent", 0);
947 page->mapping = NULL;
948 clear_compound_head(page);
952 static void __meminit __init_single_page(struct page *page, unsigned long pfn,
953 unsigned long zone, int nid)
955 set_page_links(page, zone, nid, pfn);
956 init_page_count(page);
957 page_mapcount_reset(page);
958 page_cpupid_reset_last(page);
960 INIT_LIST_HEAD(&page->lru);
961 #ifdef WANT_PAGE_VIRTUAL
962 /* The shift won't overflow because ZONE_NORMAL is below 4G. */
963 if (!is_highmem_idx(zone))
964 set_page_address(page, __va(pfn << PAGE_SHIFT));
968 static void __meminit __init_single_pfn(unsigned long pfn, unsigned long zone,
971 return __init_single_page(pfn_to_page(pfn), pfn, zone, nid);
974 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
975 static void init_reserved_page(unsigned long pfn)
980 if (!early_page_uninitialised(pfn))
983 nid = early_pfn_to_nid(pfn);
984 pgdat = NODE_DATA(nid);
986 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
987 struct zone *zone = &pgdat->node_zones[zid];
989 if (pfn >= zone->zone_start_pfn && pfn < zone_end_pfn(zone))
992 __init_single_pfn(pfn, zid, nid);
995 static inline void init_reserved_page(unsigned long pfn)
998 #endif /* CONFIG_DEFERRED_STRUCT_PAGE_INIT */
1001 * Initialised pages do not have PageReserved set. This function is
1002 * called for each range allocated by the bootmem allocator and
1003 * marks the pages PageReserved. The remaining valid pages are later
1004 * sent to the buddy page allocator.
1006 void __meminit reserve_bootmem_region(unsigned long start, unsigned long end)
1008 unsigned long start_pfn = PFN_DOWN(start);
1009 unsigned long end_pfn = PFN_UP(end);
1011 for (; start_pfn < end_pfn; start_pfn++) {
1012 if (pfn_valid(start_pfn)) {
1013 struct page *page = pfn_to_page(start_pfn);
1015 init_reserved_page(start_pfn);
1017 /* Avoid false-positive PageTail() */
1018 INIT_LIST_HEAD(&page->lru);
1020 SetPageReserved(page);
1025 static bool free_pages_prepare(struct page *page, unsigned int order)
1029 VM_BUG_ON_PAGE(PageTail(page), page);
1031 trace_mm_page_free(page, order);
1032 kmemcheck_free_shadow(page, order);
1033 kasan_free_pages(page, order);
1036 * Check tail pages before head page information is cleared to
1037 * avoid checking PageCompound for order-0 pages.
1039 if (unlikely(order)) {
1040 bool compound = PageCompound(page);
1043 VM_BUG_ON_PAGE(compound && compound_order(page) != order, page);
1045 for (i = 1; i < (1 << order); i++) {
1047 bad += free_tail_pages_check(page, page + i);
1048 bad += free_pages_check(page + i);
1051 if (PageAnonHead(page))
1052 page->mapping = NULL;
1053 bad += free_pages_check(page);
1057 reset_page_owner(page, order);
1059 if (!PageHighMem(page)) {
1060 debug_check_no_locks_freed(page_address(page),
1061 PAGE_SIZE << order);
1062 debug_check_no_obj_freed(page_address(page),
1063 PAGE_SIZE << order);
1065 arch_free_page(page, order);
1066 kernel_poison_pages(page, 1 << order, 0);
1067 kernel_map_pages(page, 1 << order, 0);
1072 static void __free_pages_ok(struct page *page, unsigned int order)
1074 unsigned long flags;
1076 unsigned long pfn = page_to_pfn(page);
1078 if (!free_pages_prepare(page, order))
1081 migratetype = get_pfnblock_migratetype(page, pfn);
1082 local_irq_save(flags);
1083 __count_vm_events(PGFREE, 1 << order);
1084 free_one_page(page_zone(page), page, pfn, order, migratetype);
1085 local_irq_restore(flags);
1088 static void __init __free_pages_boot_core(struct page *page, unsigned int order)
1090 unsigned int nr_pages = 1 << order;
1091 struct page *p = page;
1095 for (loop = 0; loop < (nr_pages - 1); loop++, p++) {
1097 __ClearPageReserved(p);
1098 set_page_count(p, 0);
1100 __ClearPageReserved(p);
1101 set_page_count(p, 0);
1103 page_zone(page)->managed_pages += nr_pages;
1104 set_page_refcounted(page);
1105 __free_pages(page, order);
1108 #if defined(CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID) || \
1109 defined(CONFIG_HAVE_MEMBLOCK_NODE_MAP)
1111 static struct mminit_pfnnid_cache early_pfnnid_cache __meminitdata;
1113 int __meminit early_pfn_to_nid(unsigned long pfn)
1115 static DEFINE_SPINLOCK(early_pfn_lock);
1118 spin_lock(&early_pfn_lock);
1119 nid = __early_pfn_to_nid(pfn, &early_pfnnid_cache);
1122 spin_unlock(&early_pfn_lock);
1128 #ifdef CONFIG_NODES_SPAN_OTHER_NODES
1129 static inline bool __meminit meminit_pfn_in_nid(unsigned long pfn, int node,
1130 struct mminit_pfnnid_cache *state)
1134 nid = __early_pfn_to_nid(pfn, state);
1135 if (nid >= 0 && nid != node)
1140 /* Only safe to use early in boot when initialisation is single-threaded */
1141 static inline bool __meminit early_pfn_in_nid(unsigned long pfn, int node)
1143 return meminit_pfn_in_nid(pfn, node, &early_pfnnid_cache);
1148 static inline bool __meminit early_pfn_in_nid(unsigned long pfn, int node)
1152 static inline bool __meminit meminit_pfn_in_nid(unsigned long pfn, int node,
1153 struct mminit_pfnnid_cache *state)
1160 void __init __free_pages_bootmem(struct page *page, unsigned long pfn,
1163 if (early_page_uninitialised(pfn))
1165 return __free_pages_boot_core(page, order);
1169 * Check that the whole (or subset of) a pageblock given by the interval of
1170 * [start_pfn, end_pfn) is valid and within the same zone, before scanning it
1171 * with the migration of free compaction scanner. The scanners then need to
1172 * use only pfn_valid_within() check for arches that allow holes within
1175 * Return struct page pointer of start_pfn, or NULL if checks were not passed.
1177 * It's possible on some configurations to have a setup like node0 node1 node0
1178 * i.e. it's possible that all pages within a zones range of pages do not
1179 * belong to a single zone. We assume that a border between node0 and node1
1180 * can occur within a single pageblock, but not a node0 node1 node0
1181 * interleaving within a single pageblock. It is therefore sufficient to check
1182 * the first and last page of a pageblock and avoid checking each individual
1183 * page in a pageblock.
1185 struct page *__pageblock_pfn_to_page(unsigned long start_pfn,
1186 unsigned long end_pfn, struct zone *zone)
1188 struct page *start_page;
1189 struct page *end_page;
1191 /* end_pfn is one past the range we are checking */
1194 if (!pfn_valid(start_pfn) || !pfn_valid(end_pfn))
1197 start_page = pfn_to_page(start_pfn);
1199 if (page_zone(start_page) != zone)
1202 end_page = pfn_to_page(end_pfn);
1204 /* This gives a shorter code than deriving page_zone(end_page) */
1205 if (page_zone_id(start_page) != page_zone_id(end_page))
1211 void set_zone_contiguous(struct zone *zone)
1213 unsigned long block_start_pfn = zone->zone_start_pfn;
1214 unsigned long block_end_pfn;
1216 block_end_pfn = ALIGN(block_start_pfn + 1, pageblock_nr_pages);
1217 for (; block_start_pfn < zone_end_pfn(zone);
1218 block_start_pfn = block_end_pfn,
1219 block_end_pfn += pageblock_nr_pages) {
1221 block_end_pfn = min(block_end_pfn, zone_end_pfn(zone));
1223 if (!__pageblock_pfn_to_page(block_start_pfn,
1224 block_end_pfn, zone))
1228 /* We confirm that there is no hole */
1229 zone->contiguous = true;
1232 void clear_zone_contiguous(struct zone *zone)
1234 zone->contiguous = false;
1237 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
1238 static void __init deferred_free_range(struct page *page,
1239 unsigned long pfn, int nr_pages)
1246 /* Free a large naturally-aligned chunk if possible */
1247 if (nr_pages == MAX_ORDER_NR_PAGES &&
1248 (pfn & (MAX_ORDER_NR_PAGES-1)) == 0) {
1249 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
1250 __free_pages_boot_core(page, MAX_ORDER-1);
1254 for (i = 0; i < nr_pages; i++, page++)
1255 __free_pages_boot_core(page, 0);
1258 /* Completion tracking for deferred_init_memmap() threads */
1259 static atomic_t pgdat_init_n_undone __initdata;
1260 static __initdata DECLARE_COMPLETION(pgdat_init_all_done_comp);
1262 static inline void __init pgdat_init_report_one_done(void)
1264 if (atomic_dec_and_test(&pgdat_init_n_undone))
1265 complete(&pgdat_init_all_done_comp);
1268 /* Initialise remaining memory on a node */
1269 static int __init deferred_init_memmap(void *data)
1271 pg_data_t *pgdat = data;
1272 int nid = pgdat->node_id;
1273 struct mminit_pfnnid_cache nid_init_state = { };
1274 unsigned long start = jiffies;
1275 unsigned long nr_pages = 0;
1276 unsigned long walk_start, walk_end;
1279 unsigned long first_init_pfn = pgdat->first_deferred_pfn;
1280 const struct cpumask *cpumask = cpumask_of_node(pgdat->node_id);
1282 if (first_init_pfn == ULONG_MAX) {
1283 pgdat_init_report_one_done();
1287 /* Bind memory initialisation thread to a local node if possible */
1288 if (!cpumask_empty(cpumask))
1289 set_cpus_allowed_ptr(current, cpumask);
1291 /* Sanity check boundaries */
1292 BUG_ON(pgdat->first_deferred_pfn < pgdat->node_start_pfn);
1293 BUG_ON(pgdat->first_deferred_pfn > pgdat_end_pfn(pgdat));
1294 pgdat->first_deferred_pfn = ULONG_MAX;
1296 /* Only the highest zone is deferred so find it */
1297 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
1298 zone = pgdat->node_zones + zid;
1299 if (first_init_pfn < zone_end_pfn(zone))
1303 for_each_mem_pfn_range(i, nid, &walk_start, &walk_end, NULL) {
1304 unsigned long pfn, end_pfn;
1305 struct page *page = NULL;
1306 struct page *free_base_page = NULL;
1307 unsigned long free_base_pfn = 0;
1310 end_pfn = min(walk_end, zone_end_pfn(zone));
1311 pfn = first_init_pfn;
1312 if (pfn < walk_start)
1314 if (pfn < zone->zone_start_pfn)
1315 pfn = zone->zone_start_pfn;
1317 for (; pfn < end_pfn; pfn++) {
1318 if (!pfn_valid_within(pfn))
1322 * Ensure pfn_valid is checked every
1323 * MAX_ORDER_NR_PAGES for memory holes
1325 if ((pfn & (MAX_ORDER_NR_PAGES - 1)) == 0) {
1326 if (!pfn_valid(pfn)) {
1332 if (!meminit_pfn_in_nid(pfn, nid, &nid_init_state)) {
1337 /* Minimise pfn page lookups and scheduler checks */
1338 if (page && (pfn & (MAX_ORDER_NR_PAGES - 1)) != 0) {
1341 nr_pages += nr_to_free;
1342 deferred_free_range(free_base_page,
1343 free_base_pfn, nr_to_free);
1344 free_base_page = NULL;
1345 free_base_pfn = nr_to_free = 0;
1347 page = pfn_to_page(pfn);
1352 VM_BUG_ON(page_zone(page) != zone);
1356 __init_single_page(page, pfn, zid, nid);
1357 if (!free_base_page) {
1358 free_base_page = page;
1359 free_base_pfn = pfn;
1364 /* Where possible, batch up pages for a single free */
1367 /* Free the current block of pages to allocator */
1368 nr_pages += nr_to_free;
1369 deferred_free_range(free_base_page, free_base_pfn,
1371 free_base_page = NULL;
1372 free_base_pfn = nr_to_free = 0;
1375 first_init_pfn = max(end_pfn, first_init_pfn);
1378 /* Sanity check that the next zone really is unpopulated */
1379 WARN_ON(++zid < MAX_NR_ZONES && populated_zone(++zone));
1381 pr_info("node %d initialised, %lu pages in %ums\n", nid, nr_pages,
1382 jiffies_to_msecs(jiffies - start));
1384 pgdat_init_report_one_done();
1387 #endif /* CONFIG_DEFERRED_STRUCT_PAGE_INIT */
1389 void __init page_alloc_init_late(void)
1393 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
1396 /* There will be num_node_state(N_MEMORY) threads */
1397 atomic_set(&pgdat_init_n_undone, num_node_state(N_MEMORY));
1398 for_each_node_state(nid, N_MEMORY) {
1399 kthread_run(deferred_init_memmap, NODE_DATA(nid), "pgdatinit%d", nid);
1402 /* Block until all are initialised */
1403 wait_for_completion(&pgdat_init_all_done_comp);
1405 /* Reinit limits that are based on free pages after the kernel is up */
1406 files_maxfiles_init();
1409 for_each_populated_zone(zone)
1410 set_zone_contiguous(zone);
1414 /* Free whole pageblock and set its migration type to MIGRATE_CMA. */
1415 void __init init_cma_reserved_pageblock(struct page *page)
1417 unsigned i = pageblock_nr_pages;
1418 struct page *p = page;
1421 __ClearPageReserved(p);
1422 set_page_count(p, 0);
1425 set_pageblock_migratetype(page, MIGRATE_CMA);
1427 if (pageblock_order >= MAX_ORDER) {
1428 i = pageblock_nr_pages;
1431 set_page_refcounted(p);
1432 __free_pages(p, MAX_ORDER - 1);
1433 p += MAX_ORDER_NR_PAGES;
1434 } while (i -= MAX_ORDER_NR_PAGES);
1436 set_page_refcounted(page);
1437 __free_pages(page, pageblock_order);
1440 adjust_managed_page_count(page, pageblock_nr_pages);
1445 * The order of subdivision here is critical for the IO subsystem.
1446 * Please do not alter this order without good reasons and regression
1447 * testing. Specifically, as large blocks of memory are subdivided,
1448 * the order in which smaller blocks are delivered depends on the order
1449 * they're subdivided in this function. This is the primary factor
1450 * influencing the order in which pages are delivered to the IO
1451 * subsystem according to empirical testing, and this is also justified
1452 * by considering the behavior of a buddy system containing a single
1453 * large block of memory acted on by a series of small allocations.
1454 * This behavior is a critical factor in sglist merging's success.
1458 static inline void expand(struct zone *zone, struct page *page,
1459 int low, int high, struct free_area *area,
1462 unsigned long size = 1 << high;
1464 while (high > low) {
1468 VM_BUG_ON_PAGE(bad_range(zone, &page[size]), &page[size]);
1470 if (IS_ENABLED(CONFIG_DEBUG_PAGEALLOC) &&
1471 debug_guardpage_enabled() &&
1472 high < debug_guardpage_minorder()) {
1474 * Mark as guard pages (or page), that will allow to
1475 * merge back to allocator when buddy will be freed.
1476 * Corresponding page table entries will not be touched,
1477 * pages will stay not present in virtual address space
1479 set_page_guard(zone, &page[size], high, migratetype);
1482 list_add(&page[size].lru, &area->free_list[migratetype]);
1484 set_page_order(&page[size], high);
1489 * This page is about to be returned from the page allocator
1491 static inline int check_new_page(struct page *page)
1493 const char *bad_reason = NULL;
1494 unsigned long bad_flags = 0;
1496 if (unlikely(atomic_read(&page->_mapcount) != -1))
1497 bad_reason = "nonzero mapcount";
1498 if (unlikely(page->mapping != NULL))
1499 bad_reason = "non-NULL mapping";
1500 if (unlikely(page_ref_count(page) != 0))
1501 bad_reason = "nonzero _count";
1502 if (unlikely(page->flags & __PG_HWPOISON)) {
1503 bad_reason = "HWPoisoned (hardware-corrupted)";
1504 bad_flags = __PG_HWPOISON;
1506 if (unlikely(page->flags & PAGE_FLAGS_CHECK_AT_PREP)) {
1507 bad_reason = "PAGE_FLAGS_CHECK_AT_PREP flag set";
1508 bad_flags = PAGE_FLAGS_CHECK_AT_PREP;
1511 if (unlikely(page->mem_cgroup))
1512 bad_reason = "page still charged to cgroup";
1514 if (unlikely(bad_reason)) {
1515 bad_page(page, bad_reason, bad_flags);
1521 static inline bool free_pages_prezeroed(bool poisoned)
1523 return IS_ENABLED(CONFIG_PAGE_POISONING_ZERO) &&
1524 page_poisoning_enabled() && poisoned;
1527 static int prep_new_page(struct page *page, unsigned int order, gfp_t gfp_flags,
1528 unsigned int alloc_flags)
1531 bool poisoned = true;
1533 for (i = 0; i < (1 << order); i++) {
1534 struct page *p = page + i;
1535 if (unlikely(check_new_page(p)))
1538 poisoned &= page_is_poisoned(p);
1541 set_page_private(page, 0);
1542 set_page_refcounted(page);
1544 arch_alloc_page(page, order);
1545 kernel_map_pages(page, 1 << order, 1);
1546 kernel_poison_pages(page, 1 << order, 1);
1547 kasan_alloc_pages(page, order);
1549 if (!free_pages_prezeroed(poisoned) && (gfp_flags & __GFP_ZERO))
1550 for (i = 0; i < (1 << order); i++)
1551 clear_highpage(page + i);
1553 if (order && (gfp_flags & __GFP_COMP))
1554 prep_compound_page(page, order);
1556 set_page_owner(page, order, gfp_flags);
1559 * page is set pfmemalloc when ALLOC_NO_WATERMARKS was necessary to
1560 * allocate the page. The expectation is that the caller is taking
1561 * steps that will free more memory. The caller should avoid the page
1562 * being used for !PFMEMALLOC purposes.
1564 if (alloc_flags & ALLOC_NO_WATERMARKS)
1565 set_page_pfmemalloc(page);
1567 clear_page_pfmemalloc(page);
1573 * Go through the free lists for the given migratetype and remove
1574 * the smallest available page from the freelists
1577 struct page *__rmqueue_smallest(struct zone *zone, unsigned int order,
1580 unsigned int current_order;
1581 struct free_area *area;
1584 /* Find a page of the appropriate size in the preferred list */
1585 for (current_order = order; current_order < MAX_ORDER; ++current_order) {
1586 area = &(zone->free_area[current_order]);
1587 page = list_first_entry_or_null(&area->free_list[migratetype],
1591 list_del(&page->lru);
1592 rmv_page_order(page);
1594 expand(zone, page, order, current_order, area, migratetype);
1595 set_pcppage_migratetype(page, migratetype);
1604 * This array describes the order lists are fallen back to when
1605 * the free lists for the desirable migrate type are depleted
1607 static int fallbacks[MIGRATE_TYPES][4] = {
1608 [MIGRATE_UNMOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_MOVABLE, MIGRATE_TYPES },
1609 [MIGRATE_RECLAIMABLE] = { MIGRATE_UNMOVABLE, MIGRATE_MOVABLE, MIGRATE_TYPES },
1610 [MIGRATE_MOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_UNMOVABLE, MIGRATE_TYPES },
1612 [MIGRATE_CMA] = { MIGRATE_TYPES }, /* Never used */
1614 #ifdef CONFIG_MEMORY_ISOLATION
1615 [MIGRATE_ISOLATE] = { MIGRATE_TYPES }, /* Never used */
1620 static struct page *__rmqueue_cma_fallback(struct zone *zone,
1623 return __rmqueue_smallest(zone, order, MIGRATE_CMA);
1626 static inline struct page *__rmqueue_cma_fallback(struct zone *zone,
1627 unsigned int order) { return NULL; }
1631 * Move the free pages in a range to the free lists of the requested type.
1632 * Note that start_page and end_pages are not aligned on a pageblock
1633 * boundary. If alignment is required, use move_freepages_block()
1635 int move_freepages(struct zone *zone,
1636 struct page *start_page, struct page *end_page,
1641 int pages_moved = 0;
1643 #ifndef CONFIG_HOLES_IN_ZONE
1645 * page_zone is not safe to call in this context when
1646 * CONFIG_HOLES_IN_ZONE is set. This bug check is probably redundant
1647 * anyway as we check zone boundaries in move_freepages_block().
1648 * Remove at a later date when no bug reports exist related to
1649 * grouping pages by mobility
1651 VM_BUG_ON(page_zone(start_page) != page_zone(end_page));
1654 for (page = start_page; page <= end_page;) {
1655 /* Make sure we are not inadvertently changing nodes */
1656 VM_BUG_ON_PAGE(page_to_nid(page) != zone_to_nid(zone), page);
1658 if (!pfn_valid_within(page_to_pfn(page))) {
1663 if (!PageBuddy(page)) {
1668 order = page_order(page);
1669 list_move(&page->lru,
1670 &zone->free_area[order].free_list[migratetype]);
1672 pages_moved += 1 << order;
1678 int move_freepages_block(struct zone *zone, struct page *page,
1681 unsigned long start_pfn, end_pfn;
1682 struct page *start_page, *end_page;
1684 start_pfn = page_to_pfn(page);
1685 start_pfn = start_pfn & ~(pageblock_nr_pages-1);
1686 start_page = pfn_to_page(start_pfn);
1687 end_page = start_page + pageblock_nr_pages - 1;
1688 end_pfn = start_pfn + pageblock_nr_pages - 1;
1690 /* Do not cross zone boundaries */
1691 if (!zone_spans_pfn(zone, start_pfn))
1693 if (!zone_spans_pfn(zone, end_pfn))
1696 return move_freepages(zone, start_page, end_page, migratetype);
1699 static void change_pageblock_range(struct page *pageblock_page,
1700 int start_order, int migratetype)
1702 int nr_pageblocks = 1 << (start_order - pageblock_order);
1704 while (nr_pageblocks--) {
1705 set_pageblock_migratetype(pageblock_page, migratetype);
1706 pageblock_page += pageblock_nr_pages;
1711 * When we are falling back to another migratetype during allocation, try to
1712 * steal extra free pages from the same pageblocks to satisfy further
1713 * allocations, instead of polluting multiple pageblocks.
1715 * If we are stealing a relatively large buddy page, it is likely there will
1716 * be more free pages in the pageblock, so try to steal them all. For
1717 * reclaimable and unmovable allocations, we steal regardless of page size,
1718 * as fragmentation caused by those allocations polluting movable pageblocks
1719 * is worse than movable allocations stealing from unmovable and reclaimable
1722 static bool can_steal_fallback(unsigned int order, int start_mt)
1725 * Leaving this order check is intended, although there is
1726 * relaxed order check in next check. The reason is that
1727 * we can actually steal whole pageblock if this condition met,
1728 * but, below check doesn't guarantee it and that is just heuristic
1729 * so could be changed anytime.
1731 if (order >= pageblock_order)
1734 if (order >= pageblock_order / 2 ||
1735 start_mt == MIGRATE_RECLAIMABLE ||
1736 start_mt == MIGRATE_UNMOVABLE ||
1737 page_group_by_mobility_disabled)
1744 * This function implements actual steal behaviour. If order is large enough,
1745 * we can steal whole pageblock. If not, we first move freepages in this
1746 * pageblock and check whether half of pages are moved or not. If half of
1747 * pages are moved, we can change migratetype of pageblock and permanently
1748 * use it's pages as requested migratetype in the future.
1750 static void steal_suitable_fallback(struct zone *zone, struct page *page,
1753 unsigned int current_order = page_order(page);
1756 /* Take ownership for orders >= pageblock_order */
1757 if (current_order >= pageblock_order) {
1758 change_pageblock_range(page, current_order, start_type);
1762 pages = move_freepages_block(zone, page, start_type);
1764 /* Claim the whole block if over half of it is free */
1765 if (pages >= (1 << (pageblock_order-1)) ||
1766 page_group_by_mobility_disabled)
1767 set_pageblock_migratetype(page, start_type);
1771 * Check whether there is a suitable fallback freepage with requested order.
1772 * If only_stealable is true, this function returns fallback_mt only if
1773 * we can steal other freepages all together. This would help to reduce
1774 * fragmentation due to mixed migratetype pages in one pageblock.
1776 int find_suitable_fallback(struct free_area *area, unsigned int order,
1777 int migratetype, bool only_stealable, bool *can_steal)
1782 if (area->nr_free == 0)
1787 fallback_mt = fallbacks[migratetype][i];
1788 if (fallback_mt == MIGRATE_TYPES)
1791 if (list_empty(&area->free_list[fallback_mt]))
1794 if (can_steal_fallback(order, migratetype))
1797 if (!only_stealable)
1808 * Reserve a pageblock for exclusive use of high-order atomic allocations if
1809 * there are no empty page blocks that contain a page with a suitable order
1811 static void reserve_highatomic_pageblock(struct page *page, struct zone *zone,
1812 unsigned int alloc_order)
1815 unsigned long max_managed, flags;
1818 * Limit the number reserved to 1 pageblock or roughly 1% of a zone.
1819 * Check is race-prone but harmless.
1821 max_managed = (zone->managed_pages / 100) + pageblock_nr_pages;
1822 if (zone->nr_reserved_highatomic >= max_managed)
1825 spin_lock_irqsave(&zone->lock, flags);
1827 /* Recheck the nr_reserved_highatomic limit under the lock */
1828 if (zone->nr_reserved_highatomic >= max_managed)
1832 mt = get_pageblock_migratetype(page);
1833 if (mt != MIGRATE_HIGHATOMIC &&
1834 !is_migrate_isolate(mt) && !is_migrate_cma(mt)) {
1835 zone->nr_reserved_highatomic += pageblock_nr_pages;
1836 set_pageblock_migratetype(page, MIGRATE_HIGHATOMIC);
1837 move_freepages_block(zone, page, MIGRATE_HIGHATOMIC);
1841 spin_unlock_irqrestore(&zone->lock, flags);
1845 * Used when an allocation is about to fail under memory pressure. This
1846 * potentially hurts the reliability of high-order allocations when under
1847 * intense memory pressure but failed atomic allocations should be easier
1848 * to recover from than an OOM.
1850 static void unreserve_highatomic_pageblock(const struct alloc_context *ac)
1852 struct zonelist *zonelist = ac->zonelist;
1853 unsigned long flags;
1859 for_each_zone_zonelist_nodemask(zone, z, zonelist, ac->high_zoneidx,
1861 /* Preserve at least one pageblock */
1862 if (zone->nr_reserved_highatomic <= pageblock_nr_pages)
1865 spin_lock_irqsave(&zone->lock, flags);
1866 for (order = 0; order < MAX_ORDER; order++) {
1867 struct free_area *area = &(zone->free_area[order]);
1869 page = list_first_entry_or_null(
1870 &area->free_list[MIGRATE_HIGHATOMIC],
1876 * It should never happen but changes to locking could
1877 * inadvertently allow a per-cpu drain to add pages
1878 * to MIGRATE_HIGHATOMIC while unreserving so be safe
1879 * and watch for underflows.
1881 zone->nr_reserved_highatomic -= min(pageblock_nr_pages,
1882 zone->nr_reserved_highatomic);
1885 * Convert to ac->migratetype and avoid the normal
1886 * pageblock stealing heuristics. Minimally, the caller
1887 * is doing the work and needs the pages. More
1888 * importantly, if the block was always converted to
1889 * MIGRATE_UNMOVABLE or another type then the number
1890 * of pageblocks that cannot be completely freed
1893 set_pageblock_migratetype(page, ac->migratetype);
1894 move_freepages_block(zone, page, ac->migratetype);
1895 spin_unlock_irqrestore(&zone->lock, flags);
1898 spin_unlock_irqrestore(&zone->lock, flags);
1902 /* Remove an element from the buddy allocator from the fallback list */
1903 static inline struct page *
1904 __rmqueue_fallback(struct zone *zone, unsigned int order, int start_migratetype)
1906 struct free_area *area;
1907 unsigned int current_order;
1912 /* Find the largest possible block of pages in the other list */
1913 for (current_order = MAX_ORDER-1;
1914 current_order >= order && current_order <= MAX_ORDER-1;
1916 area = &(zone->free_area[current_order]);
1917 fallback_mt = find_suitable_fallback(area, current_order,
1918 start_migratetype, false, &can_steal);
1919 if (fallback_mt == -1)
1922 page = list_first_entry(&area->free_list[fallback_mt],
1925 steal_suitable_fallback(zone, page, start_migratetype);
1927 /* Remove the page from the freelists */
1929 list_del(&page->lru);
1930 rmv_page_order(page);
1932 expand(zone, page, order, current_order, area,
1935 * The pcppage_migratetype may differ from pageblock's
1936 * migratetype depending on the decisions in
1937 * find_suitable_fallback(). This is OK as long as it does not
1938 * differ for MIGRATE_CMA pageblocks. Those can be used as
1939 * fallback only via special __rmqueue_cma_fallback() function
1941 set_pcppage_migratetype(page, start_migratetype);
1943 trace_mm_page_alloc_extfrag(page, order, current_order,
1944 start_migratetype, fallback_mt);
1953 * Do the hard work of removing an element from the buddy allocator.
1954 * Call me with the zone->lock already held.
1956 static struct page *__rmqueue(struct zone *zone, unsigned int order,
1961 page = __rmqueue_smallest(zone, order, migratetype);
1962 if (unlikely(!page)) {
1963 if (migratetype == MIGRATE_MOVABLE)
1964 page = __rmqueue_cma_fallback(zone, order);
1967 page = __rmqueue_fallback(zone, order, migratetype);
1970 trace_mm_page_alloc_zone_locked(page, order, migratetype);
1975 * Obtain a specified number of elements from the buddy allocator, all under
1976 * a single hold of the lock, for efficiency. Add them to the supplied list.
1977 * Returns the number of new pages which were placed at *list.
1979 static int rmqueue_bulk(struct zone *zone, unsigned int order,
1980 unsigned long count, struct list_head *list,
1981 int migratetype, bool cold)
1985 spin_lock(&zone->lock);
1986 for (i = 0; i < count; ++i) {
1987 struct page *page = __rmqueue(zone, order, migratetype);
1988 if (unlikely(page == NULL))
1992 * Split buddy pages returned by expand() are received here
1993 * in physical page order. The page is added to the callers and
1994 * list and the list head then moves forward. From the callers
1995 * perspective, the linked list is ordered by page number in
1996 * some conditions. This is useful for IO devices that can
1997 * merge IO requests if the physical pages are ordered
2001 list_add(&page->lru, list);
2003 list_add_tail(&page->lru, list);
2005 if (is_migrate_cma(get_pcppage_migratetype(page)))
2006 __mod_zone_page_state(zone, NR_FREE_CMA_PAGES,
2009 __mod_zone_page_state(zone, NR_FREE_PAGES, -(i << order));
2010 spin_unlock(&zone->lock);
2016 * Called from the vmstat counter updater to drain pagesets of this
2017 * currently executing processor on remote nodes after they have
2020 * Note that this function must be called with the thread pinned to
2021 * a single processor.
2023 void drain_zone_pages(struct zone *zone, struct per_cpu_pages *pcp)
2025 unsigned long flags;
2026 int to_drain, batch;
2028 local_irq_save(flags);
2029 batch = READ_ONCE(pcp->batch);
2030 to_drain = min(pcp->count, batch);
2032 free_pcppages_bulk(zone, to_drain, pcp);
2033 pcp->count -= to_drain;
2035 local_irq_restore(flags);
2040 * Drain pcplists of the indicated processor and zone.
2042 * The processor must either be the current processor and the
2043 * thread pinned to the current processor or a processor that
2046 static void drain_pages_zone(unsigned int cpu, struct zone *zone)
2048 unsigned long flags;
2049 struct per_cpu_pageset *pset;
2050 struct per_cpu_pages *pcp;
2052 local_irq_save(flags);
2053 pset = per_cpu_ptr(zone->pageset, cpu);
2057 free_pcppages_bulk(zone, pcp->count, pcp);
2060 local_irq_restore(flags);
2064 * Drain pcplists of all zones on the indicated processor.
2066 * The processor must either be the current processor and the
2067 * thread pinned to the current processor or a processor that
2070 static void drain_pages(unsigned int cpu)
2074 for_each_populated_zone(zone) {
2075 drain_pages_zone(cpu, zone);
2080 * Spill all of this CPU's per-cpu pages back into the buddy allocator.
2082 * The CPU has to be pinned. When zone parameter is non-NULL, spill just
2083 * the single zone's pages.
2085 void drain_local_pages(struct zone *zone)
2087 int cpu = smp_processor_id();
2090 drain_pages_zone(cpu, zone);
2096 * Spill all the per-cpu pages from all CPUs back into the buddy allocator.
2098 * When zone parameter is non-NULL, spill just the single zone's pages.
2100 * Note that this code is protected against sending an IPI to an offline
2101 * CPU but does not guarantee sending an IPI to newly hotplugged CPUs:
2102 * on_each_cpu_mask() blocks hotplug and won't talk to offlined CPUs but
2103 * nothing keeps CPUs from showing up after we populated the cpumask and
2104 * before the call to on_each_cpu_mask().
2106 void drain_all_pages(struct zone *zone)
2111 * Allocate in the BSS so we wont require allocation in
2112 * direct reclaim path for CONFIG_CPUMASK_OFFSTACK=y
2114 static cpumask_t cpus_with_pcps;
2117 * We don't care about racing with CPU hotplug event
2118 * as offline notification will cause the notified
2119 * cpu to drain that CPU pcps and on_each_cpu_mask
2120 * disables preemption as part of its processing
2122 for_each_online_cpu(cpu) {
2123 struct per_cpu_pageset *pcp;
2125 bool has_pcps = false;
2128 pcp = per_cpu_ptr(zone->pageset, cpu);
2132 for_each_populated_zone(z) {
2133 pcp = per_cpu_ptr(z->pageset, cpu);
2134 if (pcp->pcp.count) {
2142 cpumask_set_cpu(cpu, &cpus_with_pcps);
2144 cpumask_clear_cpu(cpu, &cpus_with_pcps);
2146 on_each_cpu_mask(&cpus_with_pcps, (smp_call_func_t) drain_local_pages,
2150 #ifdef CONFIG_HIBERNATION
2152 void mark_free_pages(struct zone *zone)
2154 unsigned long pfn, max_zone_pfn;
2155 unsigned long flags;
2156 unsigned int order, t;
2159 if (zone_is_empty(zone))
2162 spin_lock_irqsave(&zone->lock, flags);
2164 max_zone_pfn = zone_end_pfn(zone);
2165 for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
2166 if (pfn_valid(pfn)) {
2167 page = pfn_to_page(pfn);
2169 if (page_zone(page) != zone)
2172 if (!swsusp_page_is_forbidden(page))
2173 swsusp_unset_page_free(page);
2176 for_each_migratetype_order(order, t) {
2177 list_for_each_entry(page,
2178 &zone->free_area[order].free_list[t], lru) {
2181 pfn = page_to_pfn(page);
2182 for (i = 0; i < (1UL << order); i++)
2183 swsusp_set_page_free(pfn_to_page(pfn + i));
2186 spin_unlock_irqrestore(&zone->lock, flags);
2188 #endif /* CONFIG_PM */
2191 * Free a 0-order page
2192 * cold == true ? free a cold page : free a hot page
2194 void free_hot_cold_page(struct page *page, bool cold)
2196 struct zone *zone = page_zone(page);
2197 struct per_cpu_pages *pcp;
2198 unsigned long flags;
2199 unsigned long pfn = page_to_pfn(page);
2202 if (!free_pages_prepare(page, 0))
2205 migratetype = get_pfnblock_migratetype(page, pfn);
2206 set_pcppage_migratetype(page, migratetype);
2207 local_irq_save(flags);
2208 __count_vm_event(PGFREE);
2211 * We only track unmovable, reclaimable and movable on pcp lists.
2212 * Free ISOLATE pages back to the allocator because they are being
2213 * offlined but treat RESERVE as movable pages so we can get those
2214 * areas back if necessary. Otherwise, we may have to free
2215 * excessively into the page allocator
2217 if (migratetype >= MIGRATE_PCPTYPES) {
2218 if (unlikely(is_migrate_isolate(migratetype))) {
2219 free_one_page(zone, page, pfn, 0, migratetype);
2222 migratetype = MIGRATE_MOVABLE;
2225 pcp = &this_cpu_ptr(zone->pageset)->pcp;
2227 list_add(&page->lru, &pcp->lists[migratetype]);
2229 list_add_tail(&page->lru, &pcp->lists[migratetype]);
2231 if (pcp->count >= pcp->high) {
2232 unsigned long batch = READ_ONCE(pcp->batch);
2233 free_pcppages_bulk(zone, batch, pcp);
2234 pcp->count -= batch;
2238 local_irq_restore(flags);
2242 * Free a list of 0-order pages
2244 void free_hot_cold_page_list(struct list_head *list, bool cold)
2246 struct page *page, *next;
2248 list_for_each_entry_safe(page, next, list, lru) {
2249 trace_mm_page_free_batched(page, cold);
2250 free_hot_cold_page(page, cold);
2255 * split_page takes a non-compound higher-order page, and splits it into
2256 * n (1<<order) sub-pages: page[0..n]
2257 * Each sub-page must be freed individually.
2259 * Note: this is probably too low level an operation for use in drivers.
2260 * Please consult with lkml before using this in your driver.
2262 void split_page(struct page *page, unsigned int order)
2267 VM_BUG_ON_PAGE(PageCompound(page), page);
2268 VM_BUG_ON_PAGE(!page_count(page), page);
2270 #ifdef CONFIG_KMEMCHECK
2272 * Split shadow pages too, because free(page[0]) would
2273 * otherwise free the whole shadow.
2275 if (kmemcheck_page_is_tracked(page))
2276 split_page(virt_to_page(page[0].shadow), order);
2279 gfp_mask = get_page_owner_gfp(page);
2280 set_page_owner(page, 0, gfp_mask);
2281 for (i = 1; i < (1 << order); i++) {
2282 set_page_refcounted(page + i);
2283 set_page_owner(page + i, 0, gfp_mask);
2286 EXPORT_SYMBOL_GPL(split_page);
2288 int __isolate_free_page(struct page *page, unsigned int order)
2290 unsigned long watermark;
2294 BUG_ON(!PageBuddy(page));
2296 zone = page_zone(page);
2297 mt = get_pageblock_migratetype(page);
2299 if (!is_migrate_isolate(mt)) {
2300 /* Obey watermarks as if the page was being allocated */
2301 watermark = low_wmark_pages(zone) + (1 << order);
2302 if (!zone_watermark_ok(zone, 0, watermark, 0, 0))
2305 __mod_zone_freepage_state(zone, -(1UL << order), mt);
2308 /* Remove page from free list */
2309 list_del(&page->lru);
2310 zone->free_area[order].nr_free--;
2311 rmv_page_order(page);
2313 set_page_owner(page, order, __GFP_MOVABLE);
2315 /* Set the pageblock if the isolated page is at least a pageblock */
2316 if (order >= pageblock_order - 1) {
2317 struct page *endpage = page + (1 << order) - 1;
2318 for (; page < endpage; page += pageblock_nr_pages) {
2319 int mt = get_pageblock_migratetype(page);
2320 if (!is_migrate_isolate(mt) && !is_migrate_cma(mt))
2321 set_pageblock_migratetype(page,
2327 return 1UL << order;
2331 * Similar to split_page except the page is already free. As this is only
2332 * being used for migration, the migratetype of the block also changes.
2333 * As this is called with interrupts disabled, the caller is responsible
2334 * for calling arch_alloc_page() and kernel_map_page() after interrupts
2337 * Note: this is probably too low level an operation for use in drivers.
2338 * Please consult with lkml before using this in your driver.
2340 int split_free_page(struct page *page)
2345 order = page_order(page);
2347 nr_pages = __isolate_free_page(page, order);
2351 /* Split into individual pages */
2352 set_page_refcounted(page);
2353 split_page(page, order);
2358 * Update NUMA hit/miss statistics
2360 * Must be called with interrupts disabled.
2362 * When __GFP_OTHER_NODE is set assume the node of the preferred
2363 * zone is the local node. This is useful for daemons who allocate
2364 * memory on behalf of other processes.
2366 static inline void zone_statistics(struct zone *preferred_zone, struct zone *z,
2370 int local_nid = numa_node_id();
2371 enum zone_stat_item local_stat = NUMA_LOCAL;
2373 if (unlikely(flags & __GFP_OTHER_NODE)) {
2374 local_stat = NUMA_OTHER;
2375 local_nid = preferred_zone->node;
2378 if (z->node == local_nid) {
2379 __inc_zone_state(z, NUMA_HIT);
2380 __inc_zone_state(z, local_stat);
2382 __inc_zone_state(z, NUMA_MISS);
2383 __inc_zone_state(preferred_zone, NUMA_FOREIGN);
2389 * Allocate a page from the given zone. Use pcplists for order-0 allocations.
2392 struct page *buffered_rmqueue(struct zone *preferred_zone,
2393 struct zone *zone, unsigned int order,
2394 gfp_t gfp_flags, unsigned int alloc_flags,
2397 unsigned long flags;
2399 bool cold = ((gfp_flags & __GFP_COLD) != 0);
2401 if (likely(order == 0)) {
2402 struct per_cpu_pages *pcp;
2403 struct list_head *list;
2405 local_irq_save(flags);
2406 pcp = &this_cpu_ptr(zone->pageset)->pcp;
2407 list = &pcp->lists[migratetype];
2408 if (list_empty(list)) {
2409 pcp->count += rmqueue_bulk(zone, 0,
2412 if (unlikely(list_empty(list)))
2417 page = list_last_entry(list, struct page, lru);
2419 page = list_first_entry(list, struct page, lru);
2421 __dec_zone_state(zone, NR_ALLOC_BATCH);
2422 list_del(&page->lru);
2426 * We most definitely don't want callers attempting to
2427 * allocate greater than order-1 page units with __GFP_NOFAIL.
2429 WARN_ON_ONCE((gfp_flags & __GFP_NOFAIL) && (order > 1));
2430 spin_lock_irqsave(&zone->lock, flags);
2433 if (alloc_flags & ALLOC_HARDER) {
2434 page = __rmqueue_smallest(zone, order, MIGRATE_HIGHATOMIC);
2436 trace_mm_page_alloc_zone_locked(page, order, migratetype);
2439 page = __rmqueue(zone, order, migratetype);
2440 spin_unlock(&zone->lock);
2443 __mod_zone_page_state(zone, NR_ALLOC_BATCH, -(1 << order));
2444 __mod_zone_freepage_state(zone, -(1 << order),
2445 get_pcppage_migratetype(page));
2448 if (atomic_long_read(&zone->vm_stat[NR_ALLOC_BATCH]) <= 0 &&
2449 !test_bit(ZONE_FAIR_DEPLETED, &zone->flags))
2450 set_bit(ZONE_FAIR_DEPLETED, &zone->flags);
2452 __count_zone_vm_events(PGALLOC, zone, 1 << order);
2453 zone_statistics(preferred_zone, zone, gfp_flags);
2454 local_irq_restore(flags);
2456 VM_BUG_ON_PAGE(bad_range(zone, page), page);
2460 local_irq_restore(flags);
2464 #ifdef CONFIG_FAIL_PAGE_ALLOC
2467 struct fault_attr attr;
2469 bool ignore_gfp_highmem;
2470 bool ignore_gfp_reclaim;
2472 } fail_page_alloc = {
2473 .attr = FAULT_ATTR_INITIALIZER,
2474 .ignore_gfp_reclaim = true,
2475 .ignore_gfp_highmem = true,
2479 static int __init setup_fail_page_alloc(char *str)
2481 return setup_fault_attr(&fail_page_alloc.attr, str);
2483 __setup("fail_page_alloc=", setup_fail_page_alloc);
2485 static bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
2487 if (order < fail_page_alloc.min_order)
2489 if (gfp_mask & __GFP_NOFAIL)
2491 if (fail_page_alloc.ignore_gfp_highmem && (gfp_mask & __GFP_HIGHMEM))
2493 if (fail_page_alloc.ignore_gfp_reclaim &&
2494 (gfp_mask & __GFP_DIRECT_RECLAIM))
2497 return should_fail(&fail_page_alloc.attr, 1 << order);
2500 #ifdef CONFIG_FAULT_INJECTION_DEBUG_FS
2502 static int __init fail_page_alloc_debugfs(void)
2504 umode_t mode = S_IFREG | S_IRUSR | S_IWUSR;
2507 dir = fault_create_debugfs_attr("fail_page_alloc", NULL,
2508 &fail_page_alloc.attr);
2510 return PTR_ERR(dir);
2512 if (!debugfs_create_bool("ignore-gfp-wait", mode, dir,
2513 &fail_page_alloc.ignore_gfp_reclaim))
2515 if (!debugfs_create_bool("ignore-gfp-highmem", mode, dir,
2516 &fail_page_alloc.ignore_gfp_highmem))
2518 if (!debugfs_create_u32("min-order", mode, dir,
2519 &fail_page_alloc.min_order))
2524 debugfs_remove_recursive(dir);
2529 late_initcall(fail_page_alloc_debugfs);
2531 #endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */
2533 #else /* CONFIG_FAIL_PAGE_ALLOC */
2535 static inline bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
2540 #endif /* CONFIG_FAIL_PAGE_ALLOC */
2543 * Return true if free base pages are above 'mark'. For high-order checks it
2544 * will return true of the order-0 watermark is reached and there is at least
2545 * one free page of a suitable size. Checking now avoids taking the zone lock
2546 * to check in the allocation paths if no pages are free.
2548 static bool __zone_watermark_ok(struct zone *z, unsigned int order,
2549 unsigned long mark, int classzone_idx,
2550 unsigned int alloc_flags,
2555 const bool alloc_harder = (alloc_flags & ALLOC_HARDER);
2557 /* free_pages may go negative - that's OK */
2558 free_pages -= (1 << order) - 1;
2560 if (alloc_flags & ALLOC_HIGH)
2564 * If the caller does not have rights to ALLOC_HARDER then subtract
2565 * the high-atomic reserves. This will over-estimate the size of the
2566 * atomic reserve but it avoids a search.
2568 if (likely(!alloc_harder))
2569 free_pages -= z->nr_reserved_highatomic;
2574 /* If allocation can't use CMA areas don't use free CMA pages */
2575 if (!(alloc_flags & ALLOC_CMA))
2576 free_pages -= zone_page_state(z, NR_FREE_CMA_PAGES);
2580 * Check watermarks for an order-0 allocation request. If these
2581 * are not met, then a high-order request also cannot go ahead
2582 * even if a suitable page happened to be free.
2584 if (free_pages <= min + z->lowmem_reserve[classzone_idx])
2587 /* If this is an order-0 request then the watermark is fine */
2591 /* For a high-order request, check at least one suitable page is free */
2592 for (o = order; o < MAX_ORDER; o++) {
2593 struct free_area *area = &z->free_area[o];
2602 for (mt = 0; mt < MIGRATE_PCPTYPES; mt++) {
2603 if (!list_empty(&area->free_list[mt]))
2608 if ((alloc_flags & ALLOC_CMA) &&
2609 !list_empty(&area->free_list[MIGRATE_CMA])) {
2617 bool zone_watermark_ok(struct zone *z, unsigned int order, unsigned long mark,
2618 int classzone_idx, unsigned int alloc_flags)
2620 return __zone_watermark_ok(z, order, mark, classzone_idx, alloc_flags,
2621 zone_page_state(z, NR_FREE_PAGES));
2624 bool zone_watermark_ok_safe(struct zone *z, unsigned int order,
2625 unsigned long mark, int classzone_idx)
2627 long free_pages = zone_page_state(z, NR_FREE_PAGES);
2629 if (z->percpu_drift_mark && free_pages < z->percpu_drift_mark)
2630 free_pages = zone_page_state_snapshot(z, NR_FREE_PAGES);
2632 return __zone_watermark_ok(z, order, mark, classzone_idx, 0,
2637 static bool zone_local(struct zone *local_zone, struct zone *zone)
2639 return local_zone->node == zone->node;
2642 static bool zone_allows_reclaim(struct zone *local_zone, struct zone *zone)
2644 return node_distance(zone_to_nid(local_zone), zone_to_nid(zone)) <
2647 #else /* CONFIG_NUMA */
2648 static bool zone_local(struct zone *local_zone, struct zone *zone)
2653 static bool zone_allows_reclaim(struct zone *local_zone, struct zone *zone)
2657 #endif /* CONFIG_NUMA */
2659 static void reset_alloc_batches(struct zone *preferred_zone)
2661 struct zone *zone = preferred_zone->zone_pgdat->node_zones;
2664 mod_zone_page_state(zone, NR_ALLOC_BATCH,
2665 high_wmark_pages(zone) - low_wmark_pages(zone) -
2666 atomic_long_read(&zone->vm_stat[NR_ALLOC_BATCH]));
2667 clear_bit(ZONE_FAIR_DEPLETED, &zone->flags);
2668 } while (zone++ != preferred_zone);
2672 * get_page_from_freelist goes through the zonelist trying to allocate
2675 static struct page *
2676 get_page_from_freelist(gfp_t gfp_mask, unsigned int order, int alloc_flags,
2677 const struct alloc_context *ac)
2682 bool zonelist_rescan;
2685 zonelist_rescan = false;
2688 * Scan zonelist, looking for a zone with enough free.
2689 * See also __cpuset_node_allowed() comment in kernel/cpuset.c.
2691 for_each_zone_zonelist_nodemask(zone, z, ac->zonelist, ac->high_zoneidx,
2696 if (cpusets_enabled() &&
2697 (alloc_flags & ALLOC_CPUSET) &&
2698 !cpuset_zone_allowed(zone, gfp_mask))
2701 * Distribute pages in proportion to the individual
2702 * zone size to ensure fair page aging. The zone a
2703 * page was allocated in should have no effect on the
2704 * time the page has in memory before being reclaimed.
2706 if (alloc_flags & ALLOC_FAIR) {
2707 if (!zone_local(ac->preferred_zone, zone))
2709 if (test_bit(ZONE_FAIR_DEPLETED, &zone->flags)) {
2710 fair_skipped = true;
2715 * When allocating a page cache page for writing, we
2716 * want to get it from a zone that is within its dirty
2717 * limit, such that no single zone holds more than its
2718 * proportional share of globally allowed dirty pages.
2719 * The dirty limits take into account the zone's
2720 * lowmem reserves and high watermark so that kswapd
2721 * should be able to balance it without having to
2722 * write pages from its LRU list.
2724 * This may look like it could increase pressure on
2725 * lower zones by failing allocations in higher zones
2726 * before they are full. But the pages that do spill
2727 * over are limited as the lower zones are protected
2728 * by this very same mechanism. It should not become
2729 * a practical burden to them.
2731 * XXX: For now, allow allocations to potentially
2732 * exceed the per-zone dirty limit in the slowpath
2733 * (spread_dirty_pages unset) before going into reclaim,
2734 * which is important when on a NUMA setup the allowed
2735 * zones are together not big enough to reach the
2736 * global limit. The proper fix for these situations
2737 * will require awareness of zones in the
2738 * dirty-throttling and the flusher threads.
2740 if (ac->spread_dirty_pages && !zone_dirty_ok(zone))
2743 mark = zone->watermark[alloc_flags & ALLOC_WMARK_MASK];
2744 if (!zone_watermark_ok(zone, order, mark,
2745 ac->classzone_idx, alloc_flags)) {
2748 /* Checked here to keep the fast path fast */
2749 BUILD_BUG_ON(ALLOC_NO_WATERMARKS < NR_WMARK);
2750 if (alloc_flags & ALLOC_NO_WATERMARKS)
2753 if (zone_reclaim_mode == 0 ||
2754 !zone_allows_reclaim(ac->preferred_zone, zone))
2757 ret = zone_reclaim(zone, gfp_mask, order);
2759 case ZONE_RECLAIM_NOSCAN:
2762 case ZONE_RECLAIM_FULL:
2763 /* scanned but unreclaimable */
2766 /* did we reclaim enough */
2767 if (zone_watermark_ok(zone, order, mark,
2768 ac->classzone_idx, alloc_flags))
2776 page = buffered_rmqueue(ac->preferred_zone, zone, order,
2777 gfp_mask, alloc_flags, ac->migratetype);
2779 if (prep_new_page(page, order, gfp_mask, alloc_flags))
2783 * If this is a high-order atomic allocation then check
2784 * if the pageblock should be reserved for the future
2786 if (unlikely(order && (alloc_flags & ALLOC_HARDER)))
2787 reserve_highatomic_pageblock(page, zone, order);
2794 * The first pass makes sure allocations are spread fairly within the
2795 * local node. However, the local node might have free pages left
2796 * after the fairness batches are exhausted, and remote zones haven't
2797 * even been considered yet. Try once more without fairness, and
2798 * include remote zones now, before entering the slowpath and waking
2799 * kswapd: prefer spilling to a remote zone over swapping locally.
2801 if (alloc_flags & ALLOC_FAIR) {
2802 alloc_flags &= ~ALLOC_FAIR;
2804 zonelist_rescan = true;
2805 reset_alloc_batches(ac->preferred_zone);
2807 if (nr_online_nodes > 1)
2808 zonelist_rescan = true;
2811 if (zonelist_rescan)
2818 * Large machines with many possible nodes should not always dump per-node
2819 * meminfo in irq context.
2821 static inline bool should_suppress_show_mem(void)
2826 ret = in_interrupt();
2831 static DEFINE_RATELIMIT_STATE(nopage_rs,
2832 DEFAULT_RATELIMIT_INTERVAL,
2833 DEFAULT_RATELIMIT_BURST);
2835 void warn_alloc_failed(gfp_t gfp_mask, unsigned int order, const char *fmt, ...)
2837 unsigned int filter = SHOW_MEM_FILTER_NODES;
2839 if ((gfp_mask & __GFP_NOWARN) || !__ratelimit(&nopage_rs) ||
2840 debug_guardpage_minorder() > 0)
2844 * This documents exceptions given to allocations in certain
2845 * contexts that are allowed to allocate outside current's set
2848 if (!(gfp_mask & __GFP_NOMEMALLOC))
2849 if (test_thread_flag(TIF_MEMDIE) ||
2850 (current->flags & (PF_MEMALLOC | PF_EXITING)))
2851 filter &= ~SHOW_MEM_FILTER_NODES;
2852 if (in_interrupt() || !(gfp_mask & __GFP_DIRECT_RECLAIM))
2853 filter &= ~SHOW_MEM_FILTER_NODES;
2856 struct va_format vaf;
2859 va_start(args, fmt);
2864 pr_warn("%pV", &vaf);
2869 pr_warn("%s: page allocation failure: order:%u, mode:%#x(%pGg)\n",
2870 current->comm, order, gfp_mask, &gfp_mask);
2872 if (!should_suppress_show_mem())
2876 static inline struct page *
2877 __alloc_pages_may_oom(gfp_t gfp_mask, unsigned int order,
2878 const struct alloc_context *ac, unsigned long *did_some_progress)
2880 struct oom_control oc = {
2881 .zonelist = ac->zonelist,
2882 .nodemask = ac->nodemask,
2883 .gfp_mask = gfp_mask,
2888 *did_some_progress = 0;
2891 * Acquire the oom lock. If that fails, somebody else is
2892 * making progress for us.
2894 if (!mutex_trylock(&oom_lock)) {
2895 *did_some_progress = 1;
2896 schedule_timeout_uninterruptible(1);
2901 * Go through the zonelist yet one more time, keep very high watermark
2902 * here, this is only to catch a parallel oom killing, we must fail if
2903 * we're still under heavy pressure.
2905 page = get_page_from_freelist(gfp_mask | __GFP_HARDWALL, order,
2906 ALLOC_WMARK_HIGH|ALLOC_CPUSET, ac);
2910 if (!(gfp_mask & __GFP_NOFAIL)) {
2911 /* Coredumps can quickly deplete all memory reserves */
2912 if (current->flags & PF_DUMPCORE)
2914 /* The OOM killer will not help higher order allocs */
2915 if (order > PAGE_ALLOC_COSTLY_ORDER)
2917 /* The OOM killer does not needlessly kill tasks for lowmem */
2918 if (ac->high_zoneidx < ZONE_NORMAL)
2920 if (pm_suspended_storage())
2923 * XXX: GFP_NOFS allocations should rather fail than rely on
2924 * other request to make a forward progress.
2925 * We are in an unfortunate situation where out_of_memory cannot
2926 * do much for this context but let's try it to at least get
2927 * access to memory reserved if the current task is killed (see
2928 * out_of_memory). Once filesystems are ready to handle allocation
2929 * failures more gracefully we should just bail out here.
2932 /* The OOM killer may not free memory on a specific node */
2933 if (gfp_mask & __GFP_THISNODE)
2936 /* Exhausted what can be done so it's blamo time */
2937 if (out_of_memory(&oc) || WARN_ON_ONCE(gfp_mask & __GFP_NOFAIL)) {
2938 *did_some_progress = 1;
2940 if (gfp_mask & __GFP_NOFAIL) {
2941 page = get_page_from_freelist(gfp_mask, order,
2942 ALLOC_NO_WATERMARKS|ALLOC_CPUSET, ac);
2944 * fallback to ignore cpuset restriction if our nodes
2948 page = get_page_from_freelist(gfp_mask, order,
2949 ALLOC_NO_WATERMARKS, ac);
2953 mutex_unlock(&oom_lock);
2957 #ifdef CONFIG_COMPACTION
2958 /* Try memory compaction for high-order allocations before reclaim */
2959 static struct page *
2960 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
2961 unsigned int alloc_flags, const struct alloc_context *ac,
2962 enum migrate_mode mode, int *contended_compaction,
2963 bool *deferred_compaction)
2965 unsigned long compact_result;
2971 current->flags |= PF_MEMALLOC;
2972 compact_result = try_to_compact_pages(gfp_mask, order, alloc_flags, ac,
2973 mode, contended_compaction);
2974 current->flags &= ~PF_MEMALLOC;
2976 switch (compact_result) {
2977 case COMPACT_DEFERRED:
2978 *deferred_compaction = true;
2980 case COMPACT_SKIPPED:
2987 * At least in one zone compaction wasn't deferred or skipped, so let's
2988 * count a compaction stall
2990 count_vm_event(COMPACTSTALL);
2992 page = get_page_from_freelist(gfp_mask, order,
2993 alloc_flags & ~ALLOC_NO_WATERMARKS, ac);
2996 struct zone *zone = page_zone(page);
2998 zone->compact_blockskip_flush = false;
2999 compaction_defer_reset(zone, order, true);
3000 count_vm_event(COMPACTSUCCESS);
3005 * It's bad if compaction run occurs and fails. The most likely reason
3006 * is that pages exist, but not enough to satisfy watermarks.
3008 count_vm_event(COMPACTFAIL);
3015 static inline struct page *
3016 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
3017 unsigned int alloc_flags, const struct alloc_context *ac,
3018 enum migrate_mode mode, int *contended_compaction,
3019 bool *deferred_compaction)
3023 #endif /* CONFIG_COMPACTION */
3025 /* Perform direct synchronous page reclaim */
3027 __perform_reclaim(gfp_t gfp_mask, unsigned int order,
3028 const struct alloc_context *ac)
3030 struct reclaim_state reclaim_state;
3035 /* We now go into synchronous reclaim */
3036 cpuset_memory_pressure_bump();
3037 current->flags |= PF_MEMALLOC;
3038 lockdep_set_current_reclaim_state(gfp_mask);
3039 reclaim_state.reclaimed_slab = 0;
3040 current->reclaim_state = &reclaim_state;
3042 progress = try_to_free_pages(ac->zonelist, order, gfp_mask,
3045 current->reclaim_state = NULL;
3046 lockdep_clear_current_reclaim_state();
3047 current->flags &= ~PF_MEMALLOC;
3054 /* The really slow allocator path where we enter direct reclaim */
3055 static inline struct page *
3056 __alloc_pages_direct_reclaim(gfp_t gfp_mask, unsigned int order,
3057 unsigned int alloc_flags, const struct alloc_context *ac,
3058 unsigned long *did_some_progress)
3060 struct page *page = NULL;
3061 bool drained = false;
3063 *did_some_progress = __perform_reclaim(gfp_mask, order, ac);
3064 if (unlikely(!(*did_some_progress)))
3068 page = get_page_from_freelist(gfp_mask, order,
3069 alloc_flags & ~ALLOC_NO_WATERMARKS, ac);
3072 * If an allocation failed after direct reclaim, it could be because
3073 * pages are pinned on the per-cpu lists or in high alloc reserves.
3074 * Shrink them them and try again
3076 if (!page && !drained) {
3077 unreserve_highatomic_pageblock(ac);
3078 drain_all_pages(NULL);
3086 static void wake_all_kswapds(unsigned int order, const struct alloc_context *ac)
3091 for_each_zone_zonelist_nodemask(zone, z, ac->zonelist,
3092 ac->high_zoneidx, ac->nodemask)
3093 wakeup_kswapd(zone, order, zone_idx(ac->preferred_zone));
3096 static inline unsigned int
3097 gfp_to_alloc_flags(gfp_t gfp_mask)
3099 unsigned int alloc_flags = ALLOC_WMARK_MIN | ALLOC_CPUSET;
3101 /* __GFP_HIGH is assumed to be the same as ALLOC_HIGH to save a branch. */
3102 BUILD_BUG_ON(__GFP_HIGH != (__force gfp_t) ALLOC_HIGH);
3105 * The caller may dip into page reserves a bit more if the caller
3106 * cannot run direct reclaim, or if the caller has realtime scheduling
3107 * policy or is asking for __GFP_HIGH memory. GFP_ATOMIC requests will
3108 * set both ALLOC_HARDER (__GFP_ATOMIC) and ALLOC_HIGH (__GFP_HIGH).
3110 alloc_flags |= (__force int) (gfp_mask & __GFP_HIGH);
3112 if (gfp_mask & __GFP_ATOMIC) {
3114 * Not worth trying to allocate harder for __GFP_NOMEMALLOC even
3115 * if it can't schedule.
3117 if (!(gfp_mask & __GFP_NOMEMALLOC))
3118 alloc_flags |= ALLOC_HARDER;
3120 * Ignore cpuset mems for GFP_ATOMIC rather than fail, see the
3121 * comment for __cpuset_node_allowed().
3123 alloc_flags &= ~ALLOC_CPUSET;
3124 } else if (unlikely(rt_task(current)) && !in_interrupt())
3125 alloc_flags |= ALLOC_HARDER;
3127 if (likely(!(gfp_mask & __GFP_NOMEMALLOC))) {
3128 if (gfp_mask & __GFP_MEMALLOC)
3129 alloc_flags |= ALLOC_NO_WATERMARKS;
3130 else if (in_serving_softirq() && (current->flags & PF_MEMALLOC))
3131 alloc_flags |= ALLOC_NO_WATERMARKS;
3132 else if (!in_interrupt() &&
3133 ((current->flags & PF_MEMALLOC) ||
3134 unlikely(test_thread_flag(TIF_MEMDIE))))
3135 alloc_flags |= ALLOC_NO_WATERMARKS;
3138 if (gfpflags_to_migratetype(gfp_mask) == MIGRATE_MOVABLE)
3139 alloc_flags |= ALLOC_CMA;
3144 bool gfp_pfmemalloc_allowed(gfp_t gfp_mask)
3146 return !!(gfp_to_alloc_flags(gfp_mask) & ALLOC_NO_WATERMARKS);
3149 static inline bool is_thp_gfp_mask(gfp_t gfp_mask)
3151 return (gfp_mask & (GFP_TRANSHUGE | __GFP_KSWAPD_RECLAIM)) == GFP_TRANSHUGE;
3154 static inline struct page *
3155 __alloc_pages_slowpath(gfp_t gfp_mask, unsigned int order,
3156 struct alloc_context *ac)
3158 bool can_direct_reclaim = gfp_mask & __GFP_DIRECT_RECLAIM;
3159 struct page *page = NULL;
3160 unsigned int alloc_flags;
3161 unsigned long pages_reclaimed = 0;
3162 unsigned long did_some_progress;
3163 enum migrate_mode migration_mode = MIGRATE_ASYNC;
3164 bool deferred_compaction = false;
3165 int contended_compaction = COMPACT_CONTENDED_NONE;
3168 * In the slowpath, we sanity check order to avoid ever trying to
3169 * reclaim >= MAX_ORDER areas which will never succeed. Callers may
3170 * be using allocators in order of preference for an area that is
3173 if (order >= MAX_ORDER) {
3174 WARN_ON_ONCE(!(gfp_mask & __GFP_NOWARN));
3179 * We also sanity check to catch abuse of atomic reserves being used by
3180 * callers that are not in atomic context.
3182 if (WARN_ON_ONCE((gfp_mask & (__GFP_ATOMIC|__GFP_DIRECT_RECLAIM)) ==
3183 (__GFP_ATOMIC|__GFP_DIRECT_RECLAIM)))
3184 gfp_mask &= ~__GFP_ATOMIC;
3187 if (gfp_mask & __GFP_KSWAPD_RECLAIM)
3188 wake_all_kswapds(order, ac);
3191 * OK, we're below the kswapd watermark and have kicked background
3192 * reclaim. Now things get more complex, so set up alloc_flags according
3193 * to how we want to proceed.
3195 alloc_flags = gfp_to_alloc_flags(gfp_mask);
3197 /* This is the last chance, in general, before the goto nopage. */
3198 page = get_page_from_freelist(gfp_mask, order,
3199 alloc_flags & ~ALLOC_NO_WATERMARKS, ac);
3203 /* Allocate without watermarks if the context allows */
3204 if (alloc_flags & ALLOC_NO_WATERMARKS) {
3206 * Ignore mempolicies if ALLOC_NO_WATERMARKS on the grounds
3207 * the allocation is high priority and these type of
3208 * allocations are system rather than user orientated
3210 ac->zonelist = node_zonelist(numa_node_id(), gfp_mask);
3211 page = get_page_from_freelist(gfp_mask, order,
3212 ALLOC_NO_WATERMARKS, ac);
3217 /* Caller is not willing to reclaim, we can't balance anything */
3218 if (!can_direct_reclaim) {
3220 * All existing users of the __GFP_NOFAIL are blockable, so warn
3221 * of any new users that actually allow this type of allocation
3224 WARN_ON_ONCE(gfp_mask & __GFP_NOFAIL);
3228 /* Avoid recursion of direct reclaim */
3229 if (current->flags & PF_MEMALLOC) {
3231 * __GFP_NOFAIL request from this context is rather bizarre
3232 * because we cannot reclaim anything and only can loop waiting
3233 * for somebody to do a work for us.
3235 if (WARN_ON_ONCE(gfp_mask & __GFP_NOFAIL)) {
3242 /* Avoid allocations with no watermarks from looping endlessly */
3243 if (test_thread_flag(TIF_MEMDIE) && !(gfp_mask & __GFP_NOFAIL))
3247 * Try direct compaction. The first pass is asynchronous. Subsequent
3248 * attempts after direct reclaim are synchronous
3250 page = __alloc_pages_direct_compact(gfp_mask, order, alloc_flags, ac,
3252 &contended_compaction,
3253 &deferred_compaction);
3257 /* Checks for THP-specific high-order allocations */
3258 if (is_thp_gfp_mask(gfp_mask)) {
3260 * If compaction is deferred for high-order allocations, it is
3261 * because sync compaction recently failed. If this is the case
3262 * and the caller requested a THP allocation, we do not want
3263 * to heavily disrupt the system, so we fail the allocation
3264 * instead of entering direct reclaim.
3266 if (deferred_compaction)
3270 * In all zones where compaction was attempted (and not
3271 * deferred or skipped), lock contention has been detected.
3272 * For THP allocation we do not want to disrupt the others
3273 * so we fallback to base pages instead.
3275 if (contended_compaction == COMPACT_CONTENDED_LOCK)
3279 * If compaction was aborted due to need_resched(), we do not
3280 * want to further increase allocation latency, unless it is
3281 * khugepaged trying to collapse.
3283 if (contended_compaction == COMPACT_CONTENDED_SCHED
3284 && !(current->flags & PF_KTHREAD))
3289 * It can become very expensive to allocate transparent hugepages at
3290 * fault, so use asynchronous memory compaction for THP unless it is
3291 * khugepaged trying to collapse.
3293 if (!is_thp_gfp_mask(gfp_mask) || (current->flags & PF_KTHREAD))
3294 migration_mode = MIGRATE_SYNC_LIGHT;
3296 /* Try direct reclaim and then allocating */
3297 page = __alloc_pages_direct_reclaim(gfp_mask, order, alloc_flags, ac,
3298 &did_some_progress);
3302 /* Do not loop if specifically requested */
3303 if (gfp_mask & __GFP_NORETRY)
3306 /* Keep reclaiming pages as long as there is reasonable progress */
3307 pages_reclaimed += did_some_progress;
3308 if ((did_some_progress && order <= PAGE_ALLOC_COSTLY_ORDER) ||
3309 ((gfp_mask & __GFP_REPEAT) && pages_reclaimed < (1 << order))) {
3310 /* Wait for some write requests to complete then retry */
3311 wait_iff_congested(ac->preferred_zone, BLK_RW_ASYNC, HZ/50);
3315 /* Reclaim has failed us, start killing things */
3316 page = __alloc_pages_may_oom(gfp_mask, order, ac, &did_some_progress);
3320 /* Retry as long as the OOM killer is making progress */
3321 if (did_some_progress)
3326 * High-order allocations do not necessarily loop after
3327 * direct reclaim and reclaim/compaction depends on compaction
3328 * being called after reclaim so call directly if necessary
3330 page = __alloc_pages_direct_compact(gfp_mask, order, alloc_flags,
3332 &contended_compaction,
3333 &deferred_compaction);
3337 warn_alloc_failed(gfp_mask, order, NULL);
3343 * This is the 'heart' of the zoned buddy allocator.
3346 __alloc_pages_nodemask(gfp_t gfp_mask, unsigned int order,
3347 struct zonelist *zonelist, nodemask_t *nodemask)
3349 struct zoneref *preferred_zoneref;
3350 struct page *page = NULL;
3351 unsigned int cpuset_mems_cookie;
3352 unsigned int alloc_flags = ALLOC_WMARK_LOW|ALLOC_FAIR;
3353 gfp_t alloc_mask; /* The gfp_t that was actually used for allocation */
3354 struct alloc_context ac = {
3355 .high_zoneidx = gfp_zone(gfp_mask),
3356 .zonelist = zonelist,
3357 .nodemask = nodemask,
3358 .migratetype = gfpflags_to_migratetype(gfp_mask),
3361 if (cpusets_enabled()) {
3362 alloc_flags |= ALLOC_CPUSET;
3364 ac.nodemask = &cpuset_current_mems_allowed;
3367 gfp_mask &= gfp_allowed_mask;
3369 lockdep_trace_alloc(gfp_mask);
3371 might_sleep_if(gfp_mask & __GFP_DIRECT_RECLAIM);
3373 if (should_fail_alloc_page(gfp_mask, order))
3377 * Check the zones suitable for the gfp_mask contain at least one
3378 * valid zone. It's possible to have an empty zonelist as a result
3379 * of __GFP_THISNODE and a memoryless node
3381 if (unlikely(!zonelist->_zonerefs->zone))
3384 if (IS_ENABLED(CONFIG_CMA) && ac.migratetype == MIGRATE_MOVABLE)
3385 alloc_flags |= ALLOC_CMA;
3388 cpuset_mems_cookie = read_mems_allowed_begin();
3390 /* Dirty zone balancing only done in the fast path */
3391 ac.spread_dirty_pages = (gfp_mask & __GFP_WRITE);
3393 /* The preferred zone is used for statistics later */
3394 preferred_zoneref = first_zones_zonelist(ac.zonelist, ac.high_zoneidx,
3395 ac.nodemask, &ac.preferred_zone);
3396 if (!ac.preferred_zone)
3398 ac.classzone_idx = zonelist_zone_idx(preferred_zoneref);
3400 /* First allocation attempt */
3401 alloc_mask = gfp_mask|__GFP_HARDWALL;
3402 page = get_page_from_freelist(alloc_mask, order, alloc_flags, &ac);
3403 if (unlikely(!page)) {
3405 * Runtime PM, block IO and its error handling path
3406 * can deadlock because I/O on the device might not
3409 alloc_mask = memalloc_noio_flags(gfp_mask);
3410 ac.spread_dirty_pages = false;
3412 page = __alloc_pages_slowpath(alloc_mask, order, &ac);
3415 if (kmemcheck_enabled && page)
3416 kmemcheck_pagealloc_alloc(page, order, gfp_mask);
3418 trace_mm_page_alloc(page, order, alloc_mask, ac.migratetype);
3422 * When updating a task's mems_allowed, it is possible to race with
3423 * parallel threads in such a way that an allocation can fail while
3424 * the mask is being updated. If a page allocation is about to fail,
3425 * check if the cpuset changed during allocation and if so, retry.
3427 if (unlikely(!page && read_mems_allowed_retry(cpuset_mems_cookie)))
3432 EXPORT_SYMBOL(__alloc_pages_nodemask);
3435 * Common helper functions.
3437 unsigned long __get_free_pages(gfp_t gfp_mask, unsigned int order)
3442 * __get_free_pages() returns a 32-bit address, which cannot represent
3445 VM_BUG_ON((gfp_mask & __GFP_HIGHMEM) != 0);
3447 page = alloc_pages(gfp_mask, order);
3450 return (unsigned long) page_address(page);
3452 EXPORT_SYMBOL(__get_free_pages);
3454 unsigned long get_zeroed_page(gfp_t gfp_mask)
3456 return __get_free_pages(gfp_mask | __GFP_ZERO, 0);
3458 EXPORT_SYMBOL(get_zeroed_page);
3460 void __free_pages(struct page *page, unsigned int order)
3462 if (put_page_testzero(page)) {
3464 free_hot_cold_page(page, false);
3466 __free_pages_ok(page, order);
3470 EXPORT_SYMBOL(__free_pages);
3472 void free_pages(unsigned long addr, unsigned int order)
3475 VM_BUG_ON(!virt_addr_valid((void *)addr));
3476 __free_pages(virt_to_page((void *)addr), order);
3480 EXPORT_SYMBOL(free_pages);
3484 * An arbitrary-length arbitrary-offset area of memory which resides
3485 * within a 0 or higher order page. Multiple fragments within that page
3486 * are individually refcounted, in the page's reference counter.
3488 * The page_frag functions below provide a simple allocation framework for
3489 * page fragments. This is used by the network stack and network device
3490 * drivers to provide a backing region of memory for use as either an
3491 * sk_buff->head, or to be used in the "frags" portion of skb_shared_info.
3493 static struct page *__page_frag_refill(struct page_frag_cache *nc,
3496 struct page *page = NULL;
3497 gfp_t gfp = gfp_mask;
3499 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
3500 gfp_mask |= __GFP_COMP | __GFP_NOWARN | __GFP_NORETRY |
3502 page = alloc_pages_node(NUMA_NO_NODE, gfp_mask,
3503 PAGE_FRAG_CACHE_MAX_ORDER);
3504 nc->size = page ? PAGE_FRAG_CACHE_MAX_SIZE : PAGE_SIZE;
3506 if (unlikely(!page))
3507 page = alloc_pages_node(NUMA_NO_NODE, gfp, 0);
3509 nc->va = page ? page_address(page) : NULL;
3514 void *__alloc_page_frag(struct page_frag_cache *nc,
3515 unsigned int fragsz, gfp_t gfp_mask)
3517 unsigned int size = PAGE_SIZE;
3521 if (unlikely(!nc->va)) {
3523 page = __page_frag_refill(nc, gfp_mask);
3527 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
3528 /* if size can vary use size else just use PAGE_SIZE */
3531 /* Even if we own the page, we do not use atomic_set().
3532 * This would break get_page_unless_zero() users.
3534 page_ref_add(page, size - 1);
3536 /* reset page count bias and offset to start of new frag */
3537 nc->pfmemalloc = page_is_pfmemalloc(page);
3538 nc->pagecnt_bias = size;
3542 offset = nc->offset - fragsz;
3543 if (unlikely(offset < 0)) {
3544 page = virt_to_page(nc->va);
3546 if (!page_ref_sub_and_test(page, nc->pagecnt_bias))
3549 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
3550 /* if size can vary use size else just use PAGE_SIZE */
3553 /* OK, page count is 0, we can safely set it */
3554 set_page_count(page, size);
3556 /* reset page count bias and offset to start of new frag */
3557 nc->pagecnt_bias = size;
3558 offset = size - fragsz;
3562 nc->offset = offset;
3564 return nc->va + offset;
3566 EXPORT_SYMBOL(__alloc_page_frag);
3569 * Frees a page fragment allocated out of either a compound or order 0 page.
3571 void __free_page_frag(void *addr)
3573 struct page *page = virt_to_head_page(addr);
3575 if (unlikely(put_page_testzero(page)))
3576 __free_pages_ok(page, compound_order(page));
3578 EXPORT_SYMBOL(__free_page_frag);
3581 * alloc_kmem_pages charges newly allocated pages to the kmem resource counter
3582 * of the current memory cgroup if __GFP_ACCOUNT is set, other than that it is
3583 * equivalent to alloc_pages.
3585 * It should be used when the caller would like to use kmalloc, but since the
3586 * allocation is large, it has to fall back to the page allocator.
3588 struct page *alloc_kmem_pages(gfp_t gfp_mask, unsigned int order)
3592 page = alloc_pages(gfp_mask, order);
3593 if (page && memcg_kmem_charge(page, gfp_mask, order) != 0) {
3594 __free_pages(page, order);
3600 struct page *alloc_kmem_pages_node(int nid, gfp_t gfp_mask, unsigned int order)
3604 page = alloc_pages_node(nid, gfp_mask, order);
3605 if (page && memcg_kmem_charge(page, gfp_mask, order) != 0) {
3606 __free_pages(page, order);
3613 * __free_kmem_pages and free_kmem_pages will free pages allocated with
3616 void __free_kmem_pages(struct page *page, unsigned int order)
3618 memcg_kmem_uncharge(page, order);
3619 __free_pages(page, order);
3622 void free_kmem_pages(unsigned long addr, unsigned int order)
3625 VM_BUG_ON(!virt_addr_valid((void *)addr));
3626 __free_kmem_pages(virt_to_page((void *)addr), order);
3630 static void *make_alloc_exact(unsigned long addr, unsigned int order,
3634 unsigned long alloc_end = addr + (PAGE_SIZE << order);
3635 unsigned long used = addr + PAGE_ALIGN(size);
3637 split_page(virt_to_page((void *)addr), order);
3638 while (used < alloc_end) {
3643 return (void *)addr;
3647 * alloc_pages_exact - allocate an exact number physically-contiguous pages.
3648 * @size: the number of bytes to allocate
3649 * @gfp_mask: GFP flags for the allocation
3651 * This function is similar to alloc_pages(), except that it allocates the
3652 * minimum number of pages to satisfy the request. alloc_pages() can only
3653 * allocate memory in power-of-two pages.
3655 * This function is also limited by MAX_ORDER.
3657 * Memory allocated by this function must be released by free_pages_exact().
3659 void *alloc_pages_exact(size_t size, gfp_t gfp_mask)
3661 unsigned int order = get_order(size);
3664 addr = __get_free_pages(gfp_mask, order);
3665 return make_alloc_exact(addr, order, size);
3667 EXPORT_SYMBOL(alloc_pages_exact);
3670 * alloc_pages_exact_nid - allocate an exact number of physically-contiguous
3672 * @nid: the preferred node ID where memory should be allocated
3673 * @size: the number of bytes to allocate
3674 * @gfp_mask: GFP flags for the allocation
3676 * Like alloc_pages_exact(), but try to allocate on node nid first before falling
3679 void * __meminit alloc_pages_exact_nid(int nid, size_t size, gfp_t gfp_mask)
3681 unsigned int order = get_order(size);
3682 struct page *p = alloc_pages_node(nid, gfp_mask, order);
3685 return make_alloc_exact((unsigned long)page_address(p), order, size);
3689 * free_pages_exact - release memory allocated via alloc_pages_exact()
3690 * @virt: the value returned by alloc_pages_exact.
3691 * @size: size of allocation, same value as passed to alloc_pages_exact().
3693 * Release the memory allocated by a previous call to alloc_pages_exact.
3695 void free_pages_exact(void *virt, size_t size)
3697 unsigned long addr = (unsigned long)virt;
3698 unsigned long end = addr + PAGE_ALIGN(size);
3700 while (addr < end) {
3705 EXPORT_SYMBOL(free_pages_exact);
3708 * nr_free_zone_pages - count number of pages beyond high watermark
3709 * @offset: The zone index of the highest zone
3711 * nr_free_zone_pages() counts the number of counts pages which are beyond the
3712 * high watermark within all zones at or below a given zone index. For each
3713 * zone, the number of pages is calculated as:
3714 * managed_pages - high_pages
3716 static unsigned long nr_free_zone_pages(int offset)
3721 /* Just pick one node, since fallback list is circular */
3722 unsigned long sum = 0;
3724 struct zonelist *zonelist = node_zonelist(numa_node_id(), GFP_KERNEL);
3726 for_each_zone_zonelist(zone, z, zonelist, offset) {
3727 unsigned long size = zone->managed_pages;
3728 unsigned long high = high_wmark_pages(zone);
3737 * nr_free_buffer_pages - count number of pages beyond high watermark
3739 * nr_free_buffer_pages() counts the number of pages which are beyond the high
3740 * watermark within ZONE_DMA and ZONE_NORMAL.
3742 unsigned long nr_free_buffer_pages(void)
3744 return nr_free_zone_pages(gfp_zone(GFP_USER));
3746 EXPORT_SYMBOL_GPL(nr_free_buffer_pages);
3749 * nr_free_pagecache_pages - count number of pages beyond high watermark
3751 * nr_free_pagecache_pages() counts the number of pages which are beyond the
3752 * high watermark within all zones.
3754 unsigned long nr_free_pagecache_pages(void)
3756 return nr_free_zone_pages(gfp_zone(GFP_HIGHUSER_MOVABLE));
3759 static inline void show_node(struct zone *zone)
3761 if (IS_ENABLED(CONFIG_NUMA))
3762 printk("Node %d ", zone_to_nid(zone));
3765 long si_mem_available(void)
3768 unsigned long pagecache;
3769 unsigned long wmark_low = 0;
3770 unsigned long pages[NR_LRU_LISTS];
3774 for (lru = LRU_BASE; lru < NR_LRU_LISTS; lru++)
3775 pages[lru] = global_page_state(NR_LRU_BASE + lru);
3778 wmark_low += zone->watermark[WMARK_LOW];
3781 * Estimate the amount of memory available for userspace allocations,
3782 * without causing swapping.
3784 available = global_page_state(NR_FREE_PAGES) - totalreserve_pages;
3787 * Not all the page cache can be freed, otherwise the system will
3788 * start swapping. Assume at least half of the page cache, or the
3789 * low watermark worth of cache, needs to stay.
3791 pagecache = pages[LRU_ACTIVE_FILE] + pages[LRU_INACTIVE_FILE];
3792 pagecache -= min(pagecache / 2, wmark_low);
3793 available += pagecache;
3796 * Part of the reclaimable slab consists of items that are in use,
3797 * and cannot be freed. Cap this estimate at the low watermark.
3799 available += global_page_state(NR_SLAB_RECLAIMABLE) -
3800 min(global_page_state(NR_SLAB_RECLAIMABLE) / 2, wmark_low);
3806 EXPORT_SYMBOL_GPL(si_mem_available);
3808 void si_meminfo(struct sysinfo *val)
3810 val->totalram = totalram_pages;
3811 val->sharedram = global_page_state(NR_SHMEM);
3812 val->freeram = global_page_state(NR_FREE_PAGES);
3813 val->bufferram = nr_blockdev_pages();
3814 val->totalhigh = totalhigh_pages;
3815 val->freehigh = nr_free_highpages();
3816 val->mem_unit = PAGE_SIZE;
3819 EXPORT_SYMBOL(si_meminfo);
3822 void si_meminfo_node(struct sysinfo *val, int nid)
3824 int zone_type; /* needs to be signed */
3825 unsigned long managed_pages = 0;
3826 unsigned long managed_highpages = 0;
3827 unsigned long free_highpages = 0;
3828 pg_data_t *pgdat = NODE_DATA(nid);
3830 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++)
3831 managed_pages += pgdat->node_zones[zone_type].managed_pages;
3832 val->totalram = managed_pages;
3833 val->sharedram = node_page_state(nid, NR_SHMEM);
3834 val->freeram = node_page_state(nid, NR_FREE_PAGES);
3835 #ifdef CONFIG_HIGHMEM
3836 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++) {
3837 struct zone *zone = &pgdat->node_zones[zone_type];
3839 if (is_highmem(zone)) {
3840 managed_highpages += zone->managed_pages;
3841 free_highpages += zone_page_state(zone, NR_FREE_PAGES);
3844 val->totalhigh = managed_highpages;
3845 val->freehigh = free_highpages;
3847 val->totalhigh = managed_highpages;
3848 val->freehigh = free_highpages;
3850 val->mem_unit = PAGE_SIZE;
3855 * Determine whether the node should be displayed or not, depending on whether
3856 * SHOW_MEM_FILTER_NODES was passed to show_free_areas().
3858 bool skip_free_areas_node(unsigned int flags, int nid)
3861 unsigned int cpuset_mems_cookie;
3863 if (!(flags & SHOW_MEM_FILTER_NODES))
3867 cpuset_mems_cookie = read_mems_allowed_begin();
3868 ret = !node_isset(nid, cpuset_current_mems_allowed);
3869 } while (read_mems_allowed_retry(cpuset_mems_cookie));
3874 #define K(x) ((x) << (PAGE_SHIFT-10))
3876 static void show_migration_types(unsigned char type)
3878 static const char types[MIGRATE_TYPES] = {
3879 [MIGRATE_UNMOVABLE] = 'U',
3880 [MIGRATE_MOVABLE] = 'M',
3881 [MIGRATE_RECLAIMABLE] = 'E',
3882 [MIGRATE_HIGHATOMIC] = 'H',
3884 [MIGRATE_CMA] = 'C',
3886 #ifdef CONFIG_MEMORY_ISOLATION
3887 [MIGRATE_ISOLATE] = 'I',
3890 char tmp[MIGRATE_TYPES + 1];
3894 for (i = 0; i < MIGRATE_TYPES; i++) {
3895 if (type & (1 << i))
3900 printk("(%s) ", tmp);
3904 * Show free area list (used inside shift_scroll-lock stuff)
3905 * We also calculate the percentage fragmentation. We do this by counting the
3906 * memory on each free list with the exception of the first item on the list.
3909 * SHOW_MEM_FILTER_NODES: suppress nodes that are not allowed by current's
3912 void show_free_areas(unsigned int filter)
3914 unsigned long free_pcp = 0;
3918 for_each_populated_zone(zone) {
3919 if (skip_free_areas_node(filter, zone_to_nid(zone)))
3922 for_each_online_cpu(cpu)
3923 free_pcp += per_cpu_ptr(zone->pageset, cpu)->pcp.count;
3926 printk("active_anon:%lu inactive_anon:%lu isolated_anon:%lu\n"
3927 " active_file:%lu inactive_file:%lu isolated_file:%lu\n"
3928 " unevictable:%lu dirty:%lu writeback:%lu unstable:%lu\n"
3929 " slab_reclaimable:%lu slab_unreclaimable:%lu\n"
3930 " mapped:%lu shmem:%lu pagetables:%lu bounce:%lu\n"
3931 " free:%lu free_pcp:%lu free_cma:%lu\n",
3932 global_page_state(NR_ACTIVE_ANON),
3933 global_page_state(NR_INACTIVE_ANON),
3934 global_page_state(NR_ISOLATED_ANON),
3935 global_page_state(NR_ACTIVE_FILE),
3936 global_page_state(NR_INACTIVE_FILE),
3937 global_page_state(NR_ISOLATED_FILE),
3938 global_page_state(NR_UNEVICTABLE),
3939 global_page_state(NR_FILE_DIRTY),
3940 global_page_state(NR_WRITEBACK),
3941 global_page_state(NR_UNSTABLE_NFS),
3942 global_page_state(NR_SLAB_RECLAIMABLE),
3943 global_page_state(NR_SLAB_UNRECLAIMABLE),
3944 global_page_state(NR_FILE_MAPPED),
3945 global_page_state(NR_SHMEM),
3946 global_page_state(NR_PAGETABLE),
3947 global_page_state(NR_BOUNCE),
3948 global_page_state(NR_FREE_PAGES),
3950 global_page_state(NR_FREE_CMA_PAGES));
3952 for_each_populated_zone(zone) {
3955 if (skip_free_areas_node(filter, zone_to_nid(zone)))
3959 for_each_online_cpu(cpu)
3960 free_pcp += per_cpu_ptr(zone->pageset, cpu)->pcp.count;
3968 " active_anon:%lukB"
3969 " inactive_anon:%lukB"
3970 " active_file:%lukB"
3971 " inactive_file:%lukB"
3972 " unevictable:%lukB"
3973 " isolated(anon):%lukB"
3974 " isolated(file):%lukB"
3982 " slab_reclaimable:%lukB"
3983 " slab_unreclaimable:%lukB"
3984 " kernel_stack:%lukB"
3991 " writeback_tmp:%lukB"
3992 " pages_scanned:%lu"
3993 " all_unreclaimable? %s"
3996 K(zone_page_state(zone, NR_FREE_PAGES)),
3997 K(min_wmark_pages(zone)),
3998 K(low_wmark_pages(zone)),
3999 K(high_wmark_pages(zone)),
4000 K(zone_page_state(zone, NR_ACTIVE_ANON)),
4001 K(zone_page_state(zone, NR_INACTIVE_ANON)),
4002 K(zone_page_state(zone, NR_ACTIVE_FILE)),
4003 K(zone_page_state(zone, NR_INACTIVE_FILE)),
4004 K(zone_page_state(zone, NR_UNEVICTABLE)),
4005 K(zone_page_state(zone, NR_ISOLATED_ANON)),
4006 K(zone_page_state(zone, NR_ISOLATED_FILE)),
4007 K(zone->present_pages),
4008 K(zone->managed_pages),
4009 K(zone_page_state(zone, NR_MLOCK)),
4010 K(zone_page_state(zone, NR_FILE_DIRTY)),
4011 K(zone_page_state(zone, NR_WRITEBACK)),
4012 K(zone_page_state(zone, NR_FILE_MAPPED)),
4013 K(zone_page_state(zone, NR_SHMEM)),
4014 K(zone_page_state(zone, NR_SLAB_RECLAIMABLE)),
4015 K(zone_page_state(zone, NR_SLAB_UNRECLAIMABLE)),
4016 zone_page_state(zone, NR_KERNEL_STACK) *
4018 K(zone_page_state(zone, NR_PAGETABLE)),
4019 K(zone_page_state(zone, NR_UNSTABLE_NFS)),
4020 K(zone_page_state(zone, NR_BOUNCE)),
4022 K(this_cpu_read(zone->pageset->pcp.count)),
4023 K(zone_page_state(zone, NR_FREE_CMA_PAGES)),
4024 K(zone_page_state(zone, NR_WRITEBACK_TEMP)),
4025 K(zone_page_state(zone, NR_PAGES_SCANNED)),
4026 (!zone_reclaimable(zone) ? "yes" : "no")
4028 printk("lowmem_reserve[]:");
4029 for (i = 0; i < MAX_NR_ZONES; i++)
4030 printk(" %ld", zone->lowmem_reserve[i]);
4034 for_each_populated_zone(zone) {
4036 unsigned long nr[MAX_ORDER], flags, total = 0;
4037 unsigned char types[MAX_ORDER];
4039 if (skip_free_areas_node(filter, zone_to_nid(zone)))
4042 printk("%s: ", zone->name);
4044 spin_lock_irqsave(&zone->lock, flags);
4045 for (order = 0; order < MAX_ORDER; order++) {
4046 struct free_area *area = &zone->free_area[order];
4049 nr[order] = area->nr_free;
4050 total += nr[order] << order;
4053 for (type = 0; type < MIGRATE_TYPES; type++) {
4054 if (!list_empty(&area->free_list[type]))
4055 types[order] |= 1 << type;
4058 spin_unlock_irqrestore(&zone->lock, flags);
4059 for (order = 0; order < MAX_ORDER; order++) {
4060 printk("%lu*%lukB ", nr[order], K(1UL) << order);
4062 show_migration_types(types[order]);
4064 printk("= %lukB\n", K(total));
4067 hugetlb_show_meminfo();
4069 printk("%ld total pagecache pages\n", global_page_state(NR_FILE_PAGES));
4071 show_swap_cache_info();
4074 static void zoneref_set_zone(struct zone *zone, struct zoneref *zoneref)
4076 zoneref->zone = zone;
4077 zoneref->zone_idx = zone_idx(zone);
4081 * Builds allocation fallback zone lists.
4083 * Add all populated zones of a node to the zonelist.
4085 static int build_zonelists_node(pg_data_t *pgdat, struct zonelist *zonelist,
4089 enum zone_type zone_type = MAX_NR_ZONES;
4093 zone = pgdat->node_zones + zone_type;
4094 if (populated_zone(zone)) {
4095 zoneref_set_zone(zone,
4096 &zonelist->_zonerefs[nr_zones++]);
4097 check_highest_zone(zone_type);
4099 } while (zone_type);
4107 * 0 = automatic detection of better ordering.
4108 * 1 = order by ([node] distance, -zonetype)
4109 * 2 = order by (-zonetype, [node] distance)
4111 * If not NUMA, ZONELIST_ORDER_ZONE and ZONELIST_ORDER_NODE will create
4112 * the same zonelist. So only NUMA can configure this param.
4114 #define ZONELIST_ORDER_DEFAULT 0
4115 #define ZONELIST_ORDER_NODE 1
4116 #define ZONELIST_ORDER_ZONE 2
4118 /* zonelist order in the kernel.
4119 * set_zonelist_order() will set this to NODE or ZONE.
4121 static int current_zonelist_order = ZONELIST_ORDER_DEFAULT;
4122 static char zonelist_order_name[3][8] = {"Default", "Node", "Zone"};
4126 /* The value user specified ....changed by config */
4127 static int user_zonelist_order = ZONELIST_ORDER_DEFAULT;
4128 /* string for sysctl */
4129 #define NUMA_ZONELIST_ORDER_LEN 16
4130 char numa_zonelist_order[16] = "default";
4133 * interface for configure zonelist ordering.
4134 * command line option "numa_zonelist_order"
4135 * = "[dD]efault - default, automatic configuration.
4136 * = "[nN]ode - order by node locality, then by zone within node
4137 * = "[zZ]one - order by zone, then by locality within zone
4140 static int __parse_numa_zonelist_order(char *s)
4142 if (*s == 'd' || *s == 'D') {
4143 user_zonelist_order = ZONELIST_ORDER_DEFAULT;
4144 } else if (*s == 'n' || *s == 'N') {
4145 user_zonelist_order = ZONELIST_ORDER_NODE;
4146 } else if (*s == 'z' || *s == 'Z') {
4147 user_zonelist_order = ZONELIST_ORDER_ZONE;
4149 pr_warn("Ignoring invalid numa_zonelist_order value: %s\n", s);
4155 static __init int setup_numa_zonelist_order(char *s)
4162 ret = __parse_numa_zonelist_order(s);
4164 strlcpy(numa_zonelist_order, s, NUMA_ZONELIST_ORDER_LEN);
4168 early_param("numa_zonelist_order", setup_numa_zonelist_order);
4171 * sysctl handler for numa_zonelist_order
4173 int numa_zonelist_order_handler(struct ctl_table *table, int write,
4174 void __user *buffer, size_t *length,
4177 char saved_string[NUMA_ZONELIST_ORDER_LEN];
4179 static DEFINE_MUTEX(zl_order_mutex);
4181 mutex_lock(&zl_order_mutex);
4183 if (strlen((char *)table->data) >= NUMA_ZONELIST_ORDER_LEN) {
4187 strcpy(saved_string, (char *)table->data);
4189 ret = proc_dostring(table, write, buffer, length, ppos);
4193 int oldval = user_zonelist_order;
4195 ret = __parse_numa_zonelist_order((char *)table->data);
4198 * bogus value. restore saved string
4200 strncpy((char *)table->data, saved_string,
4201 NUMA_ZONELIST_ORDER_LEN);
4202 user_zonelist_order = oldval;
4203 } else if (oldval != user_zonelist_order) {
4204 mutex_lock(&zonelists_mutex);
4205 build_all_zonelists(NULL, NULL);
4206 mutex_unlock(&zonelists_mutex);
4210 mutex_unlock(&zl_order_mutex);
4215 #define MAX_NODE_LOAD (nr_online_nodes)
4216 static int node_load[MAX_NUMNODES];
4219 * find_next_best_node - find the next node that should appear in a given node's fallback list
4220 * @node: node whose fallback list we're appending
4221 * @used_node_mask: nodemask_t of already used nodes
4223 * We use a number of factors to determine which is the next node that should
4224 * appear on a given node's fallback list. The node should not have appeared
4225 * already in @node's fallback list, and it should be the next closest node
4226 * according to the distance array (which contains arbitrary distance values
4227 * from each node to each node in the system), and should also prefer nodes
4228 * with no CPUs, since presumably they'll have very little allocation pressure
4229 * on them otherwise.
4230 * It returns -1 if no node is found.
4232 static int find_next_best_node(int node, nodemask_t *used_node_mask)
4235 int min_val = INT_MAX;
4236 int best_node = NUMA_NO_NODE;
4237 const struct cpumask *tmp = cpumask_of_node(0);
4239 /* Use the local node if we haven't already */
4240 if (!node_isset(node, *used_node_mask)) {
4241 node_set(node, *used_node_mask);
4245 for_each_node_state(n, N_MEMORY) {
4247 /* Don't want a node to appear more than once */
4248 if (node_isset(n, *used_node_mask))
4251 /* Use the distance array to find the distance */
4252 val = node_distance(node, n);
4254 /* Penalize nodes under us ("prefer the next node") */
4257 /* Give preference to headless and unused nodes */
4258 tmp = cpumask_of_node(n);
4259 if (!cpumask_empty(tmp))
4260 val += PENALTY_FOR_NODE_WITH_CPUS;
4262 /* Slight preference for less loaded node */
4263 val *= (MAX_NODE_LOAD*MAX_NUMNODES);
4264 val += node_load[n];
4266 if (val < min_val) {
4273 node_set(best_node, *used_node_mask);
4280 * Build zonelists ordered by node and zones within node.
4281 * This results in maximum locality--normal zone overflows into local
4282 * DMA zone, if any--but risks exhausting DMA zone.
4284 static void build_zonelists_in_node_order(pg_data_t *pgdat, int node)
4287 struct zonelist *zonelist;
4289 zonelist = &pgdat->node_zonelists[0];
4290 for (j = 0; zonelist->_zonerefs[j].zone != NULL; j++)
4292 j = build_zonelists_node(NODE_DATA(node), zonelist, j);
4293 zonelist->_zonerefs[j].zone = NULL;
4294 zonelist->_zonerefs[j].zone_idx = 0;
4298 * Build gfp_thisnode zonelists
4300 static void build_thisnode_zonelists(pg_data_t *pgdat)
4303 struct zonelist *zonelist;
4305 zonelist = &pgdat->node_zonelists[1];
4306 j = build_zonelists_node(pgdat, zonelist, 0);
4307 zonelist->_zonerefs[j].zone = NULL;
4308 zonelist->_zonerefs[j].zone_idx = 0;
4312 * Build zonelists ordered by zone and nodes within zones.
4313 * This results in conserving DMA zone[s] until all Normal memory is
4314 * exhausted, but results in overflowing to remote node while memory
4315 * may still exist in local DMA zone.
4317 static int node_order[MAX_NUMNODES];
4319 static void build_zonelists_in_zone_order(pg_data_t *pgdat, int nr_nodes)
4322 int zone_type; /* needs to be signed */
4324 struct zonelist *zonelist;
4326 zonelist = &pgdat->node_zonelists[0];
4328 for (zone_type = MAX_NR_ZONES - 1; zone_type >= 0; zone_type--) {
4329 for (j = 0; j < nr_nodes; j++) {
4330 node = node_order[j];
4331 z = &NODE_DATA(node)->node_zones[zone_type];
4332 if (populated_zone(z)) {
4334 &zonelist->_zonerefs[pos++]);
4335 check_highest_zone(zone_type);
4339 zonelist->_zonerefs[pos].zone = NULL;
4340 zonelist->_zonerefs[pos].zone_idx = 0;
4343 #if defined(CONFIG_64BIT)
4345 * Devices that require DMA32/DMA are relatively rare and do not justify a
4346 * penalty to every machine in case the specialised case applies. Default
4347 * to Node-ordering on 64-bit NUMA machines
4349 static int default_zonelist_order(void)
4351 return ZONELIST_ORDER_NODE;
4355 * On 32-bit, the Normal zone needs to be preserved for allocations accessible
4356 * by the kernel. If processes running on node 0 deplete the low memory zone
4357 * then reclaim will occur more frequency increasing stalls and potentially
4358 * be easier to OOM if a large percentage of the zone is under writeback or
4359 * dirty. The problem is significantly worse if CONFIG_HIGHPTE is not set.
4360 * Hence, default to zone ordering on 32-bit.
4362 static int default_zonelist_order(void)
4364 return ZONELIST_ORDER_ZONE;
4366 #endif /* CONFIG_64BIT */
4368 static void set_zonelist_order(void)
4370 if (user_zonelist_order == ZONELIST_ORDER_DEFAULT)
4371 current_zonelist_order = default_zonelist_order();
4373 current_zonelist_order = user_zonelist_order;
4376 static void build_zonelists(pg_data_t *pgdat)
4379 nodemask_t used_mask;
4380 int local_node, prev_node;
4381 struct zonelist *zonelist;
4382 unsigned int order = current_zonelist_order;
4384 /* initialize zonelists */
4385 for (i = 0; i < MAX_ZONELISTS; i++) {
4386 zonelist = pgdat->node_zonelists + i;
4387 zonelist->_zonerefs[0].zone = NULL;
4388 zonelist->_zonerefs[0].zone_idx = 0;
4391 /* NUMA-aware ordering of nodes */
4392 local_node = pgdat->node_id;
4393 load = nr_online_nodes;
4394 prev_node = local_node;
4395 nodes_clear(used_mask);
4397 memset(node_order, 0, sizeof(node_order));
4400 while ((node = find_next_best_node(local_node, &used_mask)) >= 0) {
4402 * We don't want to pressure a particular node.
4403 * So adding penalty to the first node in same
4404 * distance group to make it round-robin.
4406 if (node_distance(local_node, node) !=
4407 node_distance(local_node, prev_node))
4408 node_load[node] = load;
4412 if (order == ZONELIST_ORDER_NODE)
4413 build_zonelists_in_node_order(pgdat, node);
4415 node_order[i++] = node; /* remember order */
4418 if (order == ZONELIST_ORDER_ZONE) {
4419 /* calculate node order -- i.e., DMA last! */
4420 build_zonelists_in_zone_order(pgdat, i);
4423 build_thisnode_zonelists(pgdat);
4426 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
4428 * Return node id of node used for "local" allocations.
4429 * I.e., first node id of first zone in arg node's generic zonelist.
4430 * Used for initializing percpu 'numa_mem', which is used primarily
4431 * for kernel allocations, so use GFP_KERNEL flags to locate zonelist.
4433 int local_memory_node(int node)
4437 (void)first_zones_zonelist(node_zonelist(node, GFP_KERNEL),
4438 gfp_zone(GFP_KERNEL),
4445 #else /* CONFIG_NUMA */
4447 static void set_zonelist_order(void)
4449 current_zonelist_order = ZONELIST_ORDER_ZONE;
4452 static void build_zonelists(pg_data_t *pgdat)
4454 int node, local_node;
4456 struct zonelist *zonelist;
4458 local_node = pgdat->node_id;
4460 zonelist = &pgdat->node_zonelists[0];
4461 j = build_zonelists_node(pgdat, zonelist, 0);
4464 * Now we build the zonelist so that it contains the zones
4465 * of all the other nodes.
4466 * We don't want to pressure a particular node, so when
4467 * building the zones for node N, we make sure that the
4468 * zones coming right after the local ones are those from
4469 * node N+1 (modulo N)
4471 for (node = local_node + 1; node < MAX_NUMNODES; node++) {
4472 if (!node_online(node))
4474 j = build_zonelists_node(NODE_DATA(node), zonelist, j);
4476 for (node = 0; node < local_node; node++) {
4477 if (!node_online(node))
4479 j = build_zonelists_node(NODE_DATA(node), zonelist, j);
4482 zonelist->_zonerefs[j].zone = NULL;
4483 zonelist->_zonerefs[j].zone_idx = 0;
4486 #endif /* CONFIG_NUMA */
4489 * Boot pageset table. One per cpu which is going to be used for all
4490 * zones and all nodes. The parameters will be set in such a way
4491 * that an item put on a list will immediately be handed over to
4492 * the buddy list. This is safe since pageset manipulation is done
4493 * with interrupts disabled.
4495 * The boot_pagesets must be kept even after bootup is complete for
4496 * unused processors and/or zones. They do play a role for bootstrapping
4497 * hotplugged processors.
4499 * zoneinfo_show() and maybe other functions do
4500 * not check if the processor is online before following the pageset pointer.
4501 * Other parts of the kernel may not check if the zone is available.
4503 static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch);
4504 static DEFINE_PER_CPU(struct per_cpu_pageset, boot_pageset);
4505 static void setup_zone_pageset(struct zone *zone);
4508 * Global mutex to protect against size modification of zonelists
4509 * as well as to serialize pageset setup for the new populated zone.
4511 DEFINE_MUTEX(zonelists_mutex);
4513 /* return values int ....just for stop_machine() */
4514 static int __build_all_zonelists(void *data)
4518 pg_data_t *self = data;
4521 memset(node_load, 0, sizeof(node_load));
4524 if (self && !node_online(self->node_id)) {
4525 build_zonelists(self);
4528 for_each_online_node(nid) {
4529 pg_data_t *pgdat = NODE_DATA(nid);
4531 build_zonelists(pgdat);
4535 * Initialize the boot_pagesets that are going to be used
4536 * for bootstrapping processors. The real pagesets for
4537 * each zone will be allocated later when the per cpu
4538 * allocator is available.
4540 * boot_pagesets are used also for bootstrapping offline
4541 * cpus if the system is already booted because the pagesets
4542 * are needed to initialize allocators on a specific cpu too.
4543 * F.e. the percpu allocator needs the page allocator which
4544 * needs the percpu allocator in order to allocate its pagesets
4545 * (a chicken-egg dilemma).
4547 for_each_possible_cpu(cpu) {
4548 setup_pageset(&per_cpu(boot_pageset, cpu), 0);
4550 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
4552 * We now know the "local memory node" for each node--
4553 * i.e., the node of the first zone in the generic zonelist.
4554 * Set up numa_mem percpu variable for on-line cpus. During
4555 * boot, only the boot cpu should be on-line; we'll init the
4556 * secondary cpus' numa_mem as they come on-line. During
4557 * node/memory hotplug, we'll fixup all on-line cpus.
4559 if (cpu_online(cpu))
4560 set_cpu_numa_mem(cpu, local_memory_node(cpu_to_node(cpu)));
4567 static noinline void __init
4568 build_all_zonelists_init(void)
4570 __build_all_zonelists(NULL);
4571 mminit_verify_zonelist();
4572 cpuset_init_current_mems_allowed();
4576 * Called with zonelists_mutex held always
4577 * unless system_state == SYSTEM_BOOTING.
4579 * __ref due to (1) call of __meminit annotated setup_zone_pageset
4580 * [we're only called with non-NULL zone through __meminit paths] and
4581 * (2) call of __init annotated helper build_all_zonelists_init
4582 * [protected by SYSTEM_BOOTING].
4584 void __ref build_all_zonelists(pg_data_t *pgdat, struct zone *zone)
4586 set_zonelist_order();
4588 if (system_state == SYSTEM_BOOTING) {
4589 build_all_zonelists_init();
4591 #ifdef CONFIG_MEMORY_HOTPLUG
4593 setup_zone_pageset(zone);
4595 /* we have to stop all cpus to guarantee there is no user
4597 stop_machine(__build_all_zonelists, pgdat, NULL);
4598 /* cpuset refresh routine should be here */
4600 vm_total_pages = nr_free_pagecache_pages();
4602 * Disable grouping by mobility if the number of pages in the
4603 * system is too low to allow the mechanism to work. It would be
4604 * more accurate, but expensive to check per-zone. This check is
4605 * made on memory-hotadd so a system can start with mobility
4606 * disabled and enable it later
4608 if (vm_total_pages < (pageblock_nr_pages * MIGRATE_TYPES))
4609 page_group_by_mobility_disabled = 1;
4611 page_group_by_mobility_disabled = 0;
4613 pr_info("Built %i zonelists in %s order, mobility grouping %s. Total pages: %ld\n",
4615 zonelist_order_name[current_zonelist_order],
4616 page_group_by_mobility_disabled ? "off" : "on",
4619 pr_info("Policy zone: %s\n", zone_names[policy_zone]);
4624 * Helper functions to size the waitqueue hash table.
4625 * Essentially these want to choose hash table sizes sufficiently
4626 * large so that collisions trying to wait on pages are rare.
4627 * But in fact, the number of active page waitqueues on typical
4628 * systems is ridiculously low, less than 200. So this is even
4629 * conservative, even though it seems large.
4631 * The constant PAGES_PER_WAITQUEUE specifies the ratio of pages to
4632 * waitqueues, i.e. the size of the waitq table given the number of pages.
4634 #define PAGES_PER_WAITQUEUE 256
4636 #ifndef CONFIG_MEMORY_HOTPLUG
4637 static inline unsigned long wait_table_hash_nr_entries(unsigned long pages)
4639 unsigned long size = 1;
4641 pages /= PAGES_PER_WAITQUEUE;
4643 while (size < pages)
4647 * Once we have dozens or even hundreds of threads sleeping
4648 * on IO we've got bigger problems than wait queue collision.
4649 * Limit the size of the wait table to a reasonable size.
4651 size = min(size, 4096UL);
4653 return max(size, 4UL);
4657 * A zone's size might be changed by hot-add, so it is not possible to determine
4658 * a suitable size for its wait_table. So we use the maximum size now.
4660 * The max wait table size = 4096 x sizeof(wait_queue_head_t). ie:
4662 * i386 (preemption config) : 4096 x 16 = 64Kbyte.
4663 * ia64, x86-64 (no preemption): 4096 x 20 = 80Kbyte.
4664 * ia64, x86-64 (preemption) : 4096 x 24 = 96Kbyte.
4666 * The maximum entries are prepared when a zone's memory is (512K + 256) pages
4667 * or more by the traditional way. (See above). It equals:
4669 * i386, x86-64, powerpc(4K page size) : = ( 2G + 1M)byte.
4670 * ia64(16K page size) : = ( 8G + 4M)byte.
4671 * powerpc (64K page size) : = (32G +16M)byte.
4673 static inline unsigned long wait_table_hash_nr_entries(unsigned long pages)
4680 * This is an integer logarithm so that shifts can be used later
4681 * to extract the more random high bits from the multiplicative
4682 * hash function before the remainder is taken.
4684 static inline unsigned long wait_table_bits(unsigned long size)
4690 * Initially all pages are reserved - free ones are freed
4691 * up by free_all_bootmem() once the early boot process is
4692 * done. Non-atomic initialization, single-pass.
4694 void __meminit memmap_init_zone(unsigned long size, int nid, unsigned long zone,
4695 unsigned long start_pfn, enum memmap_context context)
4697 struct vmem_altmap *altmap = to_vmem_altmap(__pfn_to_phys(start_pfn));
4698 unsigned long end_pfn = start_pfn + size;
4699 pg_data_t *pgdat = NODE_DATA(nid);
4701 unsigned long nr_initialised = 0;
4702 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
4703 struct memblock_region *r = NULL, *tmp;
4706 if (highest_memmap_pfn < end_pfn - 1)
4707 highest_memmap_pfn = end_pfn - 1;
4710 * Honor reservation requested by the driver for this ZONE_DEVICE
4713 if (altmap && start_pfn == altmap->base_pfn)
4714 start_pfn += altmap->reserve;
4716 for (pfn = start_pfn; pfn < end_pfn; pfn++) {
4718 * There can be holes in boot-time mem_map[]s handed to this
4719 * function. They do not exist on hotplugged memory.
4721 if (context != MEMMAP_EARLY)
4724 if (!early_pfn_valid(pfn))
4726 if (!early_pfn_in_nid(pfn, nid))
4728 if (!update_defer_init(pgdat, pfn, end_pfn, &nr_initialised))
4731 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
4733 * If not mirrored_kernelcore and ZONE_MOVABLE exists, range
4734 * from zone_movable_pfn[nid] to end of each node should be
4735 * ZONE_MOVABLE not ZONE_NORMAL. skip it.
4737 if (!mirrored_kernelcore && zone_movable_pfn[nid])
4738 if (zone == ZONE_NORMAL && pfn >= zone_movable_pfn[nid])
4742 * Check given memblock attribute by firmware which can affect
4743 * kernel memory layout. If zone==ZONE_MOVABLE but memory is
4744 * mirrored, it's an overlapped memmap init. skip it.
4746 if (mirrored_kernelcore && zone == ZONE_MOVABLE) {
4747 if (!r || pfn >= memblock_region_memory_end_pfn(r)) {
4748 for_each_memblock(memory, tmp)
4749 if (pfn < memblock_region_memory_end_pfn(tmp))
4753 if (pfn >= memblock_region_memory_base_pfn(r) &&
4754 memblock_is_mirror(r)) {
4755 /* already initialized as NORMAL */
4756 pfn = memblock_region_memory_end_pfn(r);
4764 * Mark the block movable so that blocks are reserved for
4765 * movable at startup. This will force kernel allocations
4766 * to reserve their blocks rather than leaking throughout
4767 * the address space during boot when many long-lived
4768 * kernel allocations are made.
4770 * bitmap is created for zone's valid pfn range. but memmap
4771 * can be created for invalid pages (for alignment)
4772 * check here not to call set_pageblock_migratetype() against
4775 if (!(pfn & (pageblock_nr_pages - 1))) {
4776 struct page *page = pfn_to_page(pfn);
4778 __init_single_page(page, pfn, zone, nid);
4779 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
4781 __init_single_pfn(pfn, zone, nid);
4786 static void __meminit zone_init_free_lists(struct zone *zone)
4788 unsigned int order, t;
4789 for_each_migratetype_order(order, t) {
4790 INIT_LIST_HEAD(&zone->free_area[order].free_list[t]);
4791 zone->free_area[order].nr_free = 0;
4795 #ifndef __HAVE_ARCH_MEMMAP_INIT
4796 #define memmap_init(size, nid, zone, start_pfn) \
4797 memmap_init_zone((size), (nid), (zone), (start_pfn), MEMMAP_EARLY)
4800 static int zone_batchsize(struct zone *zone)
4806 * The per-cpu-pages pools are set to around 1000th of the
4807 * size of the zone. But no more than 1/2 of a meg.
4809 * OK, so we don't know how big the cache is. So guess.
4811 batch = zone->managed_pages / 1024;
4812 if (batch * PAGE_SIZE > 512 * 1024)
4813 batch = (512 * 1024) / PAGE_SIZE;
4814 batch /= 4; /* We effectively *= 4 below */
4819 * Clamp the batch to a 2^n - 1 value. Having a power
4820 * of 2 value was found to be more likely to have
4821 * suboptimal cache aliasing properties in some cases.
4823 * For example if 2 tasks are alternately allocating
4824 * batches of pages, one task can end up with a lot
4825 * of pages of one half of the possible page colors
4826 * and the other with pages of the other colors.
4828 batch = rounddown_pow_of_two(batch + batch/2) - 1;
4833 /* The deferral and batching of frees should be suppressed under NOMMU
4836 * The problem is that NOMMU needs to be able to allocate large chunks
4837 * of contiguous memory as there's no hardware page translation to
4838 * assemble apparent contiguous memory from discontiguous pages.
4840 * Queueing large contiguous runs of pages for batching, however,
4841 * causes the pages to actually be freed in smaller chunks. As there
4842 * can be a significant delay between the individual batches being
4843 * recycled, this leads to the once large chunks of space being
4844 * fragmented and becoming unavailable for high-order allocations.
4851 * pcp->high and pcp->batch values are related and dependent on one another:
4852 * ->batch must never be higher then ->high.
4853 * The following function updates them in a safe manner without read side
4856 * Any new users of pcp->batch and pcp->high should ensure they can cope with
4857 * those fields changing asynchronously (acording the the above rule).
4859 * mutex_is_locked(&pcp_batch_high_lock) required when calling this function
4860 * outside of boot time (or some other assurance that no concurrent updaters
4863 static void pageset_update(struct per_cpu_pages *pcp, unsigned long high,
4864 unsigned long batch)
4866 /* start with a fail safe value for batch */
4870 /* Update high, then batch, in order */
4877 /* a companion to pageset_set_high() */
4878 static void pageset_set_batch(struct per_cpu_pageset *p, unsigned long batch)
4880 pageset_update(&p->pcp, 6 * batch, max(1UL, 1 * batch));
4883 static void pageset_init(struct per_cpu_pageset *p)
4885 struct per_cpu_pages *pcp;
4888 memset(p, 0, sizeof(*p));
4892 for (migratetype = 0; migratetype < MIGRATE_PCPTYPES; migratetype++)
4893 INIT_LIST_HEAD(&pcp->lists[migratetype]);
4896 static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch)
4899 pageset_set_batch(p, batch);
4903 * pageset_set_high() sets the high water mark for hot per_cpu_pagelist
4904 * to the value high for the pageset p.
4906 static void pageset_set_high(struct per_cpu_pageset *p,
4909 unsigned long batch = max(1UL, high / 4);
4910 if ((high / 4) > (PAGE_SHIFT * 8))
4911 batch = PAGE_SHIFT * 8;
4913 pageset_update(&p->pcp, high, batch);
4916 static void pageset_set_high_and_batch(struct zone *zone,
4917 struct per_cpu_pageset *pcp)
4919 if (percpu_pagelist_fraction)
4920 pageset_set_high(pcp,
4921 (zone->managed_pages /
4922 percpu_pagelist_fraction));
4924 pageset_set_batch(pcp, zone_batchsize(zone));
4927 static void __meminit zone_pageset_init(struct zone *zone, int cpu)
4929 struct per_cpu_pageset *pcp = per_cpu_ptr(zone->pageset, cpu);
4932 pageset_set_high_and_batch(zone, pcp);
4935 static void __meminit setup_zone_pageset(struct zone *zone)
4938 zone->pageset = alloc_percpu(struct per_cpu_pageset);
4939 for_each_possible_cpu(cpu)
4940 zone_pageset_init(zone, cpu);
4944 * Allocate per cpu pagesets and initialize them.
4945 * Before this call only boot pagesets were available.
4947 void __init setup_per_cpu_pageset(void)
4951 for_each_populated_zone(zone)
4952 setup_zone_pageset(zone);
4955 static noinline __init_refok
4956 int zone_wait_table_init(struct zone *zone, unsigned long zone_size_pages)
4962 * The per-page waitqueue mechanism uses hashed waitqueues
4965 zone->wait_table_hash_nr_entries =
4966 wait_table_hash_nr_entries(zone_size_pages);
4967 zone->wait_table_bits =
4968 wait_table_bits(zone->wait_table_hash_nr_entries);
4969 alloc_size = zone->wait_table_hash_nr_entries
4970 * sizeof(wait_queue_head_t);
4972 if (!slab_is_available()) {
4973 zone->wait_table = (wait_queue_head_t *)
4974 memblock_virt_alloc_node_nopanic(
4975 alloc_size, zone->zone_pgdat->node_id);
4978 * This case means that a zone whose size was 0 gets new memory
4979 * via memory hot-add.
4980 * But it may be the case that a new node was hot-added. In
4981 * this case vmalloc() will not be able to use this new node's
4982 * memory - this wait_table must be initialized to use this new
4983 * node itself as well.
4984 * To use this new node's memory, further consideration will be
4987 zone->wait_table = vmalloc(alloc_size);
4989 if (!zone->wait_table)
4992 for (i = 0; i < zone->wait_table_hash_nr_entries; ++i)
4993 init_waitqueue_head(zone->wait_table + i);
4998 static __meminit void zone_pcp_init(struct zone *zone)
5001 * per cpu subsystem is not up at this point. The following code
5002 * relies on the ability of the linker to provide the
5003 * offset of a (static) per cpu variable into the per cpu area.
5005 zone->pageset = &boot_pageset;
5007 if (populated_zone(zone))
5008 printk(KERN_DEBUG " %s zone: %lu pages, LIFO batch:%u\n",
5009 zone->name, zone->present_pages,
5010 zone_batchsize(zone));
5013 int __meminit init_currently_empty_zone(struct zone *zone,
5014 unsigned long zone_start_pfn,
5017 struct pglist_data *pgdat = zone->zone_pgdat;
5019 ret = zone_wait_table_init(zone, size);
5022 pgdat->nr_zones = zone_idx(zone) + 1;
5024 zone->zone_start_pfn = zone_start_pfn;
5026 mminit_dprintk(MMINIT_TRACE, "memmap_init",
5027 "Initialising map node %d zone %lu pfns %lu -> %lu\n",
5029 (unsigned long)zone_idx(zone),
5030 zone_start_pfn, (zone_start_pfn + size));
5032 zone_init_free_lists(zone);
5037 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
5038 #ifndef CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID
5041 * Required by SPARSEMEM. Given a PFN, return what node the PFN is on.
5043 int __meminit __early_pfn_to_nid(unsigned long pfn,
5044 struct mminit_pfnnid_cache *state)
5046 unsigned long start_pfn, end_pfn;
5049 if (state->last_start <= pfn && pfn < state->last_end)
5050 return state->last_nid;
5052 nid = memblock_search_pfn_nid(pfn, &start_pfn, &end_pfn);
5054 state->last_start = start_pfn;
5055 state->last_end = end_pfn;
5056 state->last_nid = nid;
5061 #endif /* CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID */
5064 * free_bootmem_with_active_regions - Call memblock_free_early_nid for each active range
5065 * @nid: The node to free memory on. If MAX_NUMNODES, all nodes are freed.
5066 * @max_low_pfn: The highest PFN that will be passed to memblock_free_early_nid
5068 * If an architecture guarantees that all ranges registered contain no holes
5069 * and may be freed, this this function may be used instead of calling
5070 * memblock_free_early_nid() manually.
5072 void __init free_bootmem_with_active_regions(int nid, unsigned long max_low_pfn)
5074 unsigned long start_pfn, end_pfn;
5077 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, &this_nid) {
5078 start_pfn = min(start_pfn, max_low_pfn);
5079 end_pfn = min(end_pfn, max_low_pfn);
5081 if (start_pfn < end_pfn)
5082 memblock_free_early_nid(PFN_PHYS(start_pfn),
5083 (end_pfn - start_pfn) << PAGE_SHIFT,
5089 * sparse_memory_present_with_active_regions - Call memory_present for each active range
5090 * @nid: The node to call memory_present for. If MAX_NUMNODES, all nodes will be used.
5092 * If an architecture guarantees that all ranges registered contain no holes and may
5093 * be freed, this function may be used instead of calling memory_present() manually.
5095 void __init sparse_memory_present_with_active_regions(int nid)
5097 unsigned long start_pfn, end_pfn;
5100 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, &this_nid)
5101 memory_present(this_nid, start_pfn, end_pfn);
5105 * get_pfn_range_for_nid - Return the start and end page frames for a node
5106 * @nid: The nid to return the range for. If MAX_NUMNODES, the min and max PFN are returned.
5107 * @start_pfn: Passed by reference. On return, it will have the node start_pfn.
5108 * @end_pfn: Passed by reference. On return, it will have the node end_pfn.
5110 * It returns the start and end page frame of a node based on information
5111 * provided by memblock_set_node(). If called for a node
5112 * with no available memory, a warning is printed and the start and end
5115 void __meminit get_pfn_range_for_nid(unsigned int nid,
5116 unsigned long *start_pfn, unsigned long *end_pfn)
5118 unsigned long this_start_pfn, this_end_pfn;
5124 for_each_mem_pfn_range(i, nid, &this_start_pfn, &this_end_pfn, NULL) {
5125 *start_pfn = min(*start_pfn, this_start_pfn);
5126 *end_pfn = max(*end_pfn, this_end_pfn);
5129 if (*start_pfn == -1UL)
5134 * This finds a zone that can be used for ZONE_MOVABLE pages. The
5135 * assumption is made that zones within a node are ordered in monotonic
5136 * increasing memory addresses so that the "highest" populated zone is used
5138 static void __init find_usable_zone_for_movable(void)
5141 for (zone_index = MAX_NR_ZONES - 1; zone_index >= 0; zone_index--) {
5142 if (zone_index == ZONE_MOVABLE)
5145 if (arch_zone_highest_possible_pfn[zone_index] >
5146 arch_zone_lowest_possible_pfn[zone_index])
5150 VM_BUG_ON(zone_index == -1);
5151 movable_zone = zone_index;
5155 * The zone ranges provided by the architecture do not include ZONE_MOVABLE
5156 * because it is sized independent of architecture. Unlike the other zones,
5157 * the starting point for ZONE_MOVABLE is not fixed. It may be different
5158 * in each node depending on the size of each node and how evenly kernelcore
5159 * is distributed. This helper function adjusts the zone ranges
5160 * provided by the architecture for a given node by using the end of the
5161 * highest usable zone for ZONE_MOVABLE. This preserves the assumption that
5162 * zones within a node are in order of monotonic increases memory addresses
5164 static void __meminit adjust_zone_range_for_zone_movable(int nid,
5165 unsigned long zone_type,
5166 unsigned long node_start_pfn,
5167 unsigned long node_end_pfn,
5168 unsigned long *zone_start_pfn,
5169 unsigned long *zone_end_pfn)
5171 /* Only adjust if ZONE_MOVABLE is on this node */
5172 if (zone_movable_pfn[nid]) {
5173 /* Size ZONE_MOVABLE */
5174 if (zone_type == ZONE_MOVABLE) {
5175 *zone_start_pfn = zone_movable_pfn[nid];
5176 *zone_end_pfn = min(node_end_pfn,
5177 arch_zone_highest_possible_pfn[movable_zone]);
5179 /* Check if this whole range is within ZONE_MOVABLE */
5180 } else if (*zone_start_pfn >= zone_movable_pfn[nid])
5181 *zone_start_pfn = *zone_end_pfn;
5186 * Return the number of pages a zone spans in a node, including holes
5187 * present_pages = zone_spanned_pages_in_node() - zone_absent_pages_in_node()
5189 static unsigned long __meminit zone_spanned_pages_in_node(int nid,
5190 unsigned long zone_type,
5191 unsigned long node_start_pfn,
5192 unsigned long node_end_pfn,
5193 unsigned long *zone_start_pfn,
5194 unsigned long *zone_end_pfn,
5195 unsigned long *ignored)
5197 /* When hotadd a new node from cpu_up(), the node should be empty */
5198 if (!node_start_pfn && !node_end_pfn)
5201 /* Get the start and end of the zone */
5202 *zone_start_pfn = arch_zone_lowest_possible_pfn[zone_type];
5203 *zone_end_pfn = arch_zone_highest_possible_pfn[zone_type];
5204 adjust_zone_range_for_zone_movable(nid, zone_type,
5205 node_start_pfn, node_end_pfn,
5206 zone_start_pfn, zone_end_pfn);
5208 /* Check that this node has pages within the zone's required range */
5209 if (*zone_end_pfn < node_start_pfn || *zone_start_pfn > node_end_pfn)
5212 /* Move the zone boundaries inside the node if necessary */
5213 *zone_end_pfn = min(*zone_end_pfn, node_end_pfn);
5214 *zone_start_pfn = max(*zone_start_pfn, node_start_pfn);
5216 /* Return the spanned pages */
5217 return *zone_end_pfn - *zone_start_pfn;
5221 * Return the number of holes in a range on a node. If nid is MAX_NUMNODES,
5222 * then all holes in the requested range will be accounted for.
5224 unsigned long __meminit __absent_pages_in_range(int nid,
5225 unsigned long range_start_pfn,
5226 unsigned long range_end_pfn)
5228 unsigned long nr_absent = range_end_pfn - range_start_pfn;
5229 unsigned long start_pfn, end_pfn;
5232 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
5233 start_pfn = clamp(start_pfn, range_start_pfn, range_end_pfn);
5234 end_pfn = clamp(end_pfn, range_start_pfn, range_end_pfn);
5235 nr_absent -= end_pfn - start_pfn;
5241 * absent_pages_in_range - Return number of page frames in holes within a range
5242 * @start_pfn: The start PFN to start searching for holes
5243 * @end_pfn: The end PFN to stop searching for holes
5245 * It returns the number of pages frames in memory holes within a range.
5247 unsigned long __init absent_pages_in_range(unsigned long start_pfn,
5248 unsigned long end_pfn)
5250 return __absent_pages_in_range(MAX_NUMNODES, start_pfn, end_pfn);
5253 /* Return the number of page frames in holes in a zone on a node */
5254 static unsigned long __meminit zone_absent_pages_in_node(int nid,
5255 unsigned long zone_type,
5256 unsigned long node_start_pfn,
5257 unsigned long node_end_pfn,
5258 unsigned long *ignored)
5260 unsigned long zone_low = arch_zone_lowest_possible_pfn[zone_type];
5261 unsigned long zone_high = arch_zone_highest_possible_pfn[zone_type];
5262 unsigned long zone_start_pfn, zone_end_pfn;
5263 unsigned long nr_absent;
5265 /* When hotadd a new node from cpu_up(), the node should be empty */
5266 if (!node_start_pfn && !node_end_pfn)
5269 zone_start_pfn = clamp(node_start_pfn, zone_low, zone_high);
5270 zone_end_pfn = clamp(node_end_pfn, zone_low, zone_high);
5272 adjust_zone_range_for_zone_movable(nid, zone_type,
5273 node_start_pfn, node_end_pfn,
5274 &zone_start_pfn, &zone_end_pfn);
5275 nr_absent = __absent_pages_in_range(nid, zone_start_pfn, zone_end_pfn);
5278 * ZONE_MOVABLE handling.
5279 * Treat pages to be ZONE_MOVABLE in ZONE_NORMAL as absent pages
5282 if (zone_movable_pfn[nid]) {
5283 if (mirrored_kernelcore) {
5284 unsigned long start_pfn, end_pfn;
5285 struct memblock_region *r;
5287 for_each_memblock(memory, r) {
5288 start_pfn = clamp(memblock_region_memory_base_pfn(r),
5289 zone_start_pfn, zone_end_pfn);
5290 end_pfn = clamp(memblock_region_memory_end_pfn(r),
5291 zone_start_pfn, zone_end_pfn);
5293 if (zone_type == ZONE_MOVABLE &&
5294 memblock_is_mirror(r))
5295 nr_absent += end_pfn - start_pfn;
5297 if (zone_type == ZONE_NORMAL &&
5298 !memblock_is_mirror(r))
5299 nr_absent += end_pfn - start_pfn;
5302 if (zone_type == ZONE_NORMAL)
5303 nr_absent += node_end_pfn - zone_movable_pfn[nid];
5310 #else /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
5311 static inline unsigned long __meminit zone_spanned_pages_in_node(int nid,
5312 unsigned long zone_type,
5313 unsigned long node_start_pfn,
5314 unsigned long node_end_pfn,
5315 unsigned long *zone_start_pfn,
5316 unsigned long *zone_end_pfn,
5317 unsigned long *zones_size)
5321 *zone_start_pfn = node_start_pfn;
5322 for (zone = 0; zone < zone_type; zone++)
5323 *zone_start_pfn += zones_size[zone];
5325 *zone_end_pfn = *zone_start_pfn + zones_size[zone_type];
5327 return zones_size[zone_type];
5330 static inline unsigned long __meminit zone_absent_pages_in_node(int nid,
5331 unsigned long zone_type,
5332 unsigned long node_start_pfn,
5333 unsigned long node_end_pfn,
5334 unsigned long *zholes_size)
5339 return zholes_size[zone_type];
5342 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
5344 static void __meminit calculate_node_totalpages(struct pglist_data *pgdat,
5345 unsigned long node_start_pfn,
5346 unsigned long node_end_pfn,
5347 unsigned long *zones_size,
5348 unsigned long *zholes_size)
5350 unsigned long realtotalpages = 0, totalpages = 0;
5353 for (i = 0; i < MAX_NR_ZONES; i++) {
5354 struct zone *zone = pgdat->node_zones + i;
5355 unsigned long zone_start_pfn, zone_end_pfn;
5356 unsigned long size, real_size;
5358 size = zone_spanned_pages_in_node(pgdat->node_id, i,
5364 real_size = size - zone_absent_pages_in_node(pgdat->node_id, i,
5365 node_start_pfn, node_end_pfn,
5368 zone->zone_start_pfn = zone_start_pfn;
5370 zone->zone_start_pfn = 0;
5371 zone->spanned_pages = size;
5372 zone->present_pages = real_size;
5375 realtotalpages += real_size;
5378 pgdat->node_spanned_pages = totalpages;
5379 pgdat->node_present_pages = realtotalpages;
5380 printk(KERN_DEBUG "On node %d totalpages: %lu\n", pgdat->node_id,
5384 #ifndef CONFIG_SPARSEMEM
5386 * Calculate the size of the zone->blockflags rounded to an unsigned long
5387 * Start by making sure zonesize is a multiple of pageblock_order by rounding
5388 * up. Then use 1 NR_PAGEBLOCK_BITS worth of bits per pageblock, finally
5389 * round what is now in bits to nearest long in bits, then return it in
5392 static unsigned long __init usemap_size(unsigned long zone_start_pfn, unsigned long zonesize)
5394 unsigned long usemapsize;
5396 zonesize += zone_start_pfn & (pageblock_nr_pages-1);
5397 usemapsize = roundup(zonesize, pageblock_nr_pages);
5398 usemapsize = usemapsize >> pageblock_order;
5399 usemapsize *= NR_PAGEBLOCK_BITS;
5400 usemapsize = roundup(usemapsize, 8 * sizeof(unsigned long));
5402 return usemapsize / 8;
5405 static void __init setup_usemap(struct pglist_data *pgdat,
5407 unsigned long zone_start_pfn,
5408 unsigned long zonesize)
5410 unsigned long usemapsize = usemap_size(zone_start_pfn, zonesize);
5411 zone->pageblock_flags = NULL;
5413 zone->pageblock_flags =
5414 memblock_virt_alloc_node_nopanic(usemapsize,
5418 static inline void setup_usemap(struct pglist_data *pgdat, struct zone *zone,
5419 unsigned long zone_start_pfn, unsigned long zonesize) {}
5420 #endif /* CONFIG_SPARSEMEM */
5422 #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
5424 /* Initialise the number of pages represented by NR_PAGEBLOCK_BITS */
5425 void __paginginit set_pageblock_order(void)
5429 /* Check that pageblock_nr_pages has not already been setup */
5430 if (pageblock_order)
5433 if (HPAGE_SHIFT > PAGE_SHIFT)
5434 order = HUGETLB_PAGE_ORDER;
5436 order = MAX_ORDER - 1;
5439 * Assume the largest contiguous order of interest is a huge page.
5440 * This value may be variable depending on boot parameters on IA64 and
5443 pageblock_order = order;
5445 #else /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
5448 * When CONFIG_HUGETLB_PAGE_SIZE_VARIABLE is not set, set_pageblock_order()
5449 * is unused as pageblock_order is set at compile-time. See
5450 * include/linux/pageblock-flags.h for the values of pageblock_order based on
5453 void __paginginit set_pageblock_order(void)
5457 #endif /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
5459 static unsigned long __paginginit calc_memmap_size(unsigned long spanned_pages,
5460 unsigned long present_pages)
5462 unsigned long pages = spanned_pages;
5465 * Provide a more accurate estimation if there are holes within
5466 * the zone and SPARSEMEM is in use. If there are holes within the
5467 * zone, each populated memory region may cost us one or two extra
5468 * memmap pages due to alignment because memmap pages for each
5469 * populated regions may not naturally algined on page boundary.
5470 * So the (present_pages >> 4) heuristic is a tradeoff for that.
5472 if (spanned_pages > present_pages + (present_pages >> 4) &&
5473 IS_ENABLED(CONFIG_SPARSEMEM))
5474 pages = present_pages;
5476 return PAGE_ALIGN(pages * sizeof(struct page)) >> PAGE_SHIFT;
5480 * Set up the zone data structures:
5481 * - mark all pages reserved
5482 * - mark all memory queues empty
5483 * - clear the memory bitmaps
5485 * NOTE: pgdat should get zeroed by caller.
5487 static void __paginginit free_area_init_core(struct pglist_data *pgdat)
5490 int nid = pgdat->node_id;
5493 pgdat_resize_init(pgdat);
5494 #ifdef CONFIG_NUMA_BALANCING
5495 spin_lock_init(&pgdat->numabalancing_migrate_lock);
5496 pgdat->numabalancing_migrate_nr_pages = 0;
5497 pgdat->numabalancing_migrate_next_window = jiffies;
5499 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
5500 spin_lock_init(&pgdat->split_queue_lock);
5501 INIT_LIST_HEAD(&pgdat->split_queue);
5502 pgdat->split_queue_len = 0;
5504 init_waitqueue_head(&pgdat->kswapd_wait);
5505 init_waitqueue_head(&pgdat->pfmemalloc_wait);
5506 #ifdef CONFIG_COMPACTION
5507 init_waitqueue_head(&pgdat->kcompactd_wait);
5509 pgdat_page_ext_init(pgdat);
5511 for (j = 0; j < MAX_NR_ZONES; j++) {
5512 struct zone *zone = pgdat->node_zones + j;
5513 unsigned long size, realsize, freesize, memmap_pages;
5514 unsigned long zone_start_pfn = zone->zone_start_pfn;
5516 size = zone->spanned_pages;
5517 realsize = freesize = zone->present_pages;
5520 * Adjust freesize so that it accounts for how much memory
5521 * is used by this zone for memmap. This affects the watermark
5522 * and per-cpu initialisations
5524 memmap_pages = calc_memmap_size(size, realsize);
5525 if (!is_highmem_idx(j)) {
5526 if (freesize >= memmap_pages) {
5527 freesize -= memmap_pages;
5530 " %s zone: %lu pages used for memmap\n",
5531 zone_names[j], memmap_pages);
5533 pr_warn(" %s zone: %lu pages exceeds freesize %lu\n",
5534 zone_names[j], memmap_pages, freesize);
5537 /* Account for reserved pages */
5538 if (j == 0 && freesize > dma_reserve) {
5539 freesize -= dma_reserve;
5540 printk(KERN_DEBUG " %s zone: %lu pages reserved\n",
5541 zone_names[0], dma_reserve);
5544 if (!is_highmem_idx(j))
5545 nr_kernel_pages += freesize;
5546 /* Charge for highmem memmap if there are enough kernel pages */
5547 else if (nr_kernel_pages > memmap_pages * 2)
5548 nr_kernel_pages -= memmap_pages;
5549 nr_all_pages += freesize;
5552 * Set an approximate value for lowmem here, it will be adjusted
5553 * when the bootmem allocator frees pages into the buddy system.
5554 * And all highmem pages will be managed by the buddy system.
5556 zone->managed_pages = is_highmem_idx(j) ? realsize : freesize;
5559 zone->min_unmapped_pages = (freesize*sysctl_min_unmapped_ratio)
5561 zone->min_slab_pages = (freesize * sysctl_min_slab_ratio) / 100;
5563 zone->name = zone_names[j];
5564 spin_lock_init(&zone->lock);
5565 spin_lock_init(&zone->lru_lock);
5566 zone_seqlock_init(zone);
5567 zone->zone_pgdat = pgdat;
5568 zone_pcp_init(zone);
5570 /* For bootup, initialized properly in watermark setup */
5571 mod_zone_page_state(zone, NR_ALLOC_BATCH, zone->managed_pages);
5573 lruvec_init(&zone->lruvec);
5577 set_pageblock_order();
5578 setup_usemap(pgdat, zone, zone_start_pfn, size);
5579 ret = init_currently_empty_zone(zone, zone_start_pfn, size);
5581 memmap_init(size, nid, j, zone_start_pfn);
5585 static void __init_refok alloc_node_mem_map(struct pglist_data *pgdat)
5587 unsigned long __maybe_unused start = 0;
5588 unsigned long __maybe_unused offset = 0;
5590 /* Skip empty nodes */
5591 if (!pgdat->node_spanned_pages)
5594 #ifdef CONFIG_FLAT_NODE_MEM_MAP
5595 start = pgdat->node_start_pfn & ~(MAX_ORDER_NR_PAGES - 1);
5596 offset = pgdat->node_start_pfn - start;
5597 /* ia64 gets its own node_mem_map, before this, without bootmem */
5598 if (!pgdat->node_mem_map) {
5599 unsigned long size, end;
5603 * The zone's endpoints aren't required to be MAX_ORDER
5604 * aligned but the node_mem_map endpoints must be in order
5605 * for the buddy allocator to function correctly.
5607 end = pgdat_end_pfn(pgdat);
5608 end = ALIGN(end, MAX_ORDER_NR_PAGES);
5609 size = (end - start) * sizeof(struct page);
5610 map = alloc_remap(pgdat->node_id, size);
5612 map = memblock_virt_alloc_node_nopanic(size,
5614 pgdat->node_mem_map = map + offset;
5616 #ifndef CONFIG_NEED_MULTIPLE_NODES
5618 * With no DISCONTIG, the global mem_map is just set as node 0's
5620 if (pgdat == NODE_DATA(0)) {
5621 mem_map = NODE_DATA(0)->node_mem_map;
5622 #if defined(CONFIG_HAVE_MEMBLOCK_NODE_MAP) || defined(CONFIG_FLATMEM)
5623 if (page_to_pfn(mem_map) != pgdat->node_start_pfn)
5625 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
5628 #endif /* CONFIG_FLAT_NODE_MEM_MAP */
5631 void __paginginit free_area_init_node(int nid, unsigned long *zones_size,
5632 unsigned long node_start_pfn, unsigned long *zholes_size)
5634 pg_data_t *pgdat = NODE_DATA(nid);
5635 unsigned long start_pfn = 0;
5636 unsigned long end_pfn = 0;
5638 /* pg_data_t should be reset to zero when it's allocated */
5639 WARN_ON(pgdat->nr_zones || pgdat->classzone_idx);
5641 reset_deferred_meminit(pgdat);
5642 pgdat->node_id = nid;
5643 pgdat->node_start_pfn = node_start_pfn;
5644 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
5645 get_pfn_range_for_nid(nid, &start_pfn, &end_pfn);
5646 pr_info("Initmem setup node %d [mem %#018Lx-%#018Lx]\n", nid,
5647 (u64)start_pfn << PAGE_SHIFT,
5648 end_pfn ? ((u64)end_pfn << PAGE_SHIFT) - 1 : 0);
5650 start_pfn = node_start_pfn;
5652 calculate_node_totalpages(pgdat, start_pfn, end_pfn,
5653 zones_size, zholes_size);
5655 alloc_node_mem_map(pgdat);
5656 #ifdef CONFIG_FLAT_NODE_MEM_MAP
5657 printk(KERN_DEBUG "free_area_init_node: node %d, pgdat %08lx, node_mem_map %08lx\n",
5658 nid, (unsigned long)pgdat,
5659 (unsigned long)pgdat->node_mem_map);
5662 free_area_init_core(pgdat);
5665 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
5667 #if MAX_NUMNODES > 1
5669 * Figure out the number of possible node ids.
5671 void __init setup_nr_node_ids(void)
5673 unsigned int highest;
5675 highest = find_last_bit(node_possible_map.bits, MAX_NUMNODES);
5676 nr_node_ids = highest + 1;
5681 * node_map_pfn_alignment - determine the maximum internode alignment
5683 * This function should be called after node map is populated and sorted.
5684 * It calculates the maximum power of two alignment which can distinguish
5687 * For example, if all nodes are 1GiB and aligned to 1GiB, the return value
5688 * would indicate 1GiB alignment with (1 << (30 - PAGE_SHIFT)). If the
5689 * nodes are shifted by 256MiB, 256MiB. Note that if only the last node is
5690 * shifted, 1GiB is enough and this function will indicate so.
5692 * This is used to test whether pfn -> nid mapping of the chosen memory
5693 * model has fine enough granularity to avoid incorrect mapping for the
5694 * populated node map.
5696 * Returns the determined alignment in pfn's. 0 if there is no alignment
5697 * requirement (single node).
5699 unsigned long __init node_map_pfn_alignment(void)
5701 unsigned long accl_mask = 0, last_end = 0;
5702 unsigned long start, end, mask;
5706 for_each_mem_pfn_range(i, MAX_NUMNODES, &start, &end, &nid) {
5707 if (!start || last_nid < 0 || last_nid == nid) {
5714 * Start with a mask granular enough to pin-point to the
5715 * start pfn and tick off bits one-by-one until it becomes
5716 * too coarse to separate the current node from the last.
5718 mask = ~((1 << __ffs(start)) - 1);
5719 while (mask && last_end <= (start & (mask << 1)))
5722 /* accumulate all internode masks */
5726 /* convert mask to number of pages */
5727 return ~accl_mask + 1;
5730 /* Find the lowest pfn for a node */
5731 static unsigned long __init find_min_pfn_for_node(int nid)
5733 unsigned long min_pfn = ULONG_MAX;
5734 unsigned long start_pfn;
5737 for_each_mem_pfn_range(i, nid, &start_pfn, NULL, NULL)
5738 min_pfn = min(min_pfn, start_pfn);
5740 if (min_pfn == ULONG_MAX) {
5741 pr_warn("Could not find start_pfn for node %d\n", nid);
5749 * find_min_pfn_with_active_regions - Find the minimum PFN registered
5751 * It returns the minimum PFN based on information provided via
5752 * memblock_set_node().
5754 unsigned long __init find_min_pfn_with_active_regions(void)
5756 return find_min_pfn_for_node(MAX_NUMNODES);
5760 * early_calculate_totalpages()
5761 * Sum pages in active regions for movable zone.
5762 * Populate N_MEMORY for calculating usable_nodes.
5764 static unsigned long __init early_calculate_totalpages(void)
5766 unsigned long totalpages = 0;
5767 unsigned long start_pfn, end_pfn;
5770 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid) {
5771 unsigned long pages = end_pfn - start_pfn;
5773 totalpages += pages;
5775 node_set_state(nid, N_MEMORY);
5781 * Find the PFN the Movable zone begins in each node. Kernel memory
5782 * is spread evenly between nodes as long as the nodes have enough
5783 * memory. When they don't, some nodes will have more kernelcore than
5786 static void __init find_zone_movable_pfns_for_nodes(void)
5789 unsigned long usable_startpfn;
5790 unsigned long kernelcore_node, kernelcore_remaining;
5791 /* save the state before borrow the nodemask */
5792 nodemask_t saved_node_state = node_states[N_MEMORY];
5793 unsigned long totalpages = early_calculate_totalpages();
5794 int usable_nodes = nodes_weight(node_states[N_MEMORY]);
5795 struct memblock_region *r;
5797 /* Need to find movable_zone earlier when movable_node is specified. */
5798 find_usable_zone_for_movable();
5801 * If movable_node is specified, ignore kernelcore and movablecore
5804 if (movable_node_is_enabled()) {
5805 for_each_memblock(memory, r) {
5806 if (!memblock_is_hotpluggable(r))
5811 usable_startpfn = PFN_DOWN(r->base);
5812 zone_movable_pfn[nid] = zone_movable_pfn[nid] ?
5813 min(usable_startpfn, zone_movable_pfn[nid]) :
5821 * If kernelcore=mirror is specified, ignore movablecore option
5823 if (mirrored_kernelcore) {
5824 bool mem_below_4gb_not_mirrored = false;
5826 for_each_memblock(memory, r) {
5827 if (memblock_is_mirror(r))
5832 usable_startpfn = memblock_region_memory_base_pfn(r);
5834 if (usable_startpfn < 0x100000) {
5835 mem_below_4gb_not_mirrored = true;
5839 zone_movable_pfn[nid] = zone_movable_pfn[nid] ?
5840 min(usable_startpfn, zone_movable_pfn[nid]) :
5844 if (mem_below_4gb_not_mirrored)
5845 pr_warn("This configuration results in unmirrored kernel memory.");
5851 * If movablecore=nn[KMG] was specified, calculate what size of
5852 * kernelcore that corresponds so that memory usable for
5853 * any allocation type is evenly spread. If both kernelcore
5854 * and movablecore are specified, then the value of kernelcore
5855 * will be used for required_kernelcore if it's greater than
5856 * what movablecore would have allowed.
5858 if (required_movablecore) {
5859 unsigned long corepages;
5862 * Round-up so that ZONE_MOVABLE is at least as large as what
5863 * was requested by the user
5865 required_movablecore =
5866 roundup(required_movablecore, MAX_ORDER_NR_PAGES);
5867 required_movablecore = min(totalpages, required_movablecore);
5868 corepages = totalpages - required_movablecore;
5870 required_kernelcore = max(required_kernelcore, corepages);
5874 * If kernelcore was not specified or kernelcore size is larger
5875 * than totalpages, there is no ZONE_MOVABLE.
5877 if (!required_kernelcore || required_kernelcore >= totalpages)
5880 /* usable_startpfn is the lowest possible pfn ZONE_MOVABLE can be at */
5881 usable_startpfn = arch_zone_lowest_possible_pfn[movable_zone];
5884 /* Spread kernelcore memory as evenly as possible throughout nodes */
5885 kernelcore_node = required_kernelcore / usable_nodes;
5886 for_each_node_state(nid, N_MEMORY) {
5887 unsigned long start_pfn, end_pfn;
5890 * Recalculate kernelcore_node if the division per node
5891 * now exceeds what is necessary to satisfy the requested
5892 * amount of memory for the kernel
5894 if (required_kernelcore < kernelcore_node)
5895 kernelcore_node = required_kernelcore / usable_nodes;
5898 * As the map is walked, we track how much memory is usable
5899 * by the kernel using kernelcore_remaining. When it is
5900 * 0, the rest of the node is usable by ZONE_MOVABLE
5902 kernelcore_remaining = kernelcore_node;
5904 /* Go through each range of PFNs within this node */
5905 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
5906 unsigned long size_pages;
5908 start_pfn = max(start_pfn, zone_movable_pfn[nid]);
5909 if (start_pfn >= end_pfn)
5912 /* Account for what is only usable for kernelcore */
5913 if (start_pfn < usable_startpfn) {
5914 unsigned long kernel_pages;
5915 kernel_pages = min(end_pfn, usable_startpfn)
5918 kernelcore_remaining -= min(kernel_pages,
5919 kernelcore_remaining);
5920 required_kernelcore -= min(kernel_pages,
5921 required_kernelcore);
5923 /* Continue if range is now fully accounted */
5924 if (end_pfn <= usable_startpfn) {
5927 * Push zone_movable_pfn to the end so
5928 * that if we have to rebalance
5929 * kernelcore across nodes, we will
5930 * not double account here
5932 zone_movable_pfn[nid] = end_pfn;
5935 start_pfn = usable_startpfn;
5939 * The usable PFN range for ZONE_MOVABLE is from
5940 * start_pfn->end_pfn. Calculate size_pages as the
5941 * number of pages used as kernelcore
5943 size_pages = end_pfn - start_pfn;
5944 if (size_pages > kernelcore_remaining)
5945 size_pages = kernelcore_remaining;
5946 zone_movable_pfn[nid] = start_pfn + size_pages;
5949 * Some kernelcore has been met, update counts and
5950 * break if the kernelcore for this node has been
5953 required_kernelcore -= min(required_kernelcore,
5955 kernelcore_remaining -= size_pages;
5956 if (!kernelcore_remaining)
5962 * If there is still required_kernelcore, we do another pass with one
5963 * less node in the count. This will push zone_movable_pfn[nid] further
5964 * along on the nodes that still have memory until kernelcore is
5968 if (usable_nodes && required_kernelcore > usable_nodes)
5972 /* Align start of ZONE_MOVABLE on all nids to MAX_ORDER_NR_PAGES */
5973 for (nid = 0; nid < MAX_NUMNODES; nid++)
5974 zone_movable_pfn[nid] =
5975 roundup(zone_movable_pfn[nid], MAX_ORDER_NR_PAGES);
5978 /* restore the node_state */
5979 node_states[N_MEMORY] = saved_node_state;
5982 /* Any regular or high memory on that node ? */
5983 static void check_for_memory(pg_data_t *pgdat, int nid)
5985 enum zone_type zone_type;
5987 if (N_MEMORY == N_NORMAL_MEMORY)
5990 for (zone_type = 0; zone_type <= ZONE_MOVABLE - 1; zone_type++) {
5991 struct zone *zone = &pgdat->node_zones[zone_type];
5992 if (populated_zone(zone)) {
5993 node_set_state(nid, N_HIGH_MEMORY);
5994 if (N_NORMAL_MEMORY != N_HIGH_MEMORY &&
5995 zone_type <= ZONE_NORMAL)
5996 node_set_state(nid, N_NORMAL_MEMORY);
6003 * free_area_init_nodes - Initialise all pg_data_t and zone data
6004 * @max_zone_pfn: an array of max PFNs for each zone
6006 * This will call free_area_init_node() for each active node in the system.
6007 * Using the page ranges provided by memblock_set_node(), the size of each
6008 * zone in each node and their holes is calculated. If the maximum PFN
6009 * between two adjacent zones match, it is assumed that the zone is empty.
6010 * For example, if arch_max_dma_pfn == arch_max_dma32_pfn, it is assumed
6011 * that arch_max_dma32_pfn has no pages. It is also assumed that a zone
6012 * starts where the previous one ended. For example, ZONE_DMA32 starts
6013 * at arch_max_dma_pfn.
6015 void __init free_area_init_nodes(unsigned long *max_zone_pfn)
6017 unsigned long start_pfn, end_pfn;
6020 /* Record where the zone boundaries are */
6021 memset(arch_zone_lowest_possible_pfn, 0,
6022 sizeof(arch_zone_lowest_possible_pfn));
6023 memset(arch_zone_highest_possible_pfn, 0,
6024 sizeof(arch_zone_highest_possible_pfn));
6025 arch_zone_lowest_possible_pfn[0] = find_min_pfn_with_active_regions();
6026 arch_zone_highest_possible_pfn[0] = max_zone_pfn[0];
6027 for (i = 1; i < MAX_NR_ZONES; i++) {
6028 if (i == ZONE_MOVABLE)
6030 arch_zone_lowest_possible_pfn[i] =
6031 arch_zone_highest_possible_pfn[i-1];
6032 arch_zone_highest_possible_pfn[i] =
6033 max(max_zone_pfn[i], arch_zone_lowest_possible_pfn[i]);
6035 arch_zone_lowest_possible_pfn[ZONE_MOVABLE] = 0;
6036 arch_zone_highest_possible_pfn[ZONE_MOVABLE] = 0;
6038 /* Find the PFNs that ZONE_MOVABLE begins at in each node */
6039 memset(zone_movable_pfn, 0, sizeof(zone_movable_pfn));
6040 find_zone_movable_pfns_for_nodes();
6042 /* Print out the zone ranges */
6043 pr_info("Zone ranges:\n");
6044 for (i = 0; i < MAX_NR_ZONES; i++) {
6045 if (i == ZONE_MOVABLE)
6047 pr_info(" %-8s ", zone_names[i]);
6048 if (arch_zone_lowest_possible_pfn[i] ==
6049 arch_zone_highest_possible_pfn[i])
6052 pr_cont("[mem %#018Lx-%#018Lx]\n",
6053 (u64)arch_zone_lowest_possible_pfn[i]
6055 ((u64)arch_zone_highest_possible_pfn[i]
6056 << PAGE_SHIFT) - 1);
6059 /* Print out the PFNs ZONE_MOVABLE begins at in each node */
6060 pr_info("Movable zone start for each node\n");
6061 for (i = 0; i < MAX_NUMNODES; i++) {
6062 if (zone_movable_pfn[i])
6063 pr_info(" Node %d: %#018Lx\n", i,
6064 (u64)zone_movable_pfn[i] << PAGE_SHIFT);
6067 /* Print out the early node map */
6068 pr_info("Early memory node ranges\n");
6069 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid)
6070 pr_info(" node %3d: [mem %#018Lx-%#018Lx]\n", nid,
6071 (u64)start_pfn << PAGE_SHIFT,
6072 ((u64)end_pfn << PAGE_SHIFT) - 1);
6074 /* Initialise every node */
6075 mminit_verify_pageflags_layout();
6076 setup_nr_node_ids();
6077 for_each_online_node(nid) {
6078 pg_data_t *pgdat = NODE_DATA(nid);
6079 free_area_init_node(nid, NULL,
6080 find_min_pfn_for_node(nid), NULL);
6082 /* Any memory on that node */
6083 if (pgdat->node_present_pages)
6084 node_set_state(nid, N_MEMORY);
6085 check_for_memory(pgdat, nid);
6089 static int __init cmdline_parse_core(char *p, unsigned long *core)
6091 unsigned long long coremem;
6095 coremem = memparse(p, &p);
6096 *core = coremem >> PAGE_SHIFT;
6098 /* Paranoid check that UL is enough for the coremem value */
6099 WARN_ON((coremem >> PAGE_SHIFT) > ULONG_MAX);
6105 * kernelcore=size sets the amount of memory for use for allocations that
6106 * cannot be reclaimed or migrated.
6108 static int __init cmdline_parse_kernelcore(char *p)
6110 /* parse kernelcore=mirror */
6111 if (parse_option_str(p, "mirror")) {
6112 mirrored_kernelcore = true;
6116 return cmdline_parse_core(p, &required_kernelcore);
6120 * movablecore=size sets the amount of memory for use for allocations that
6121 * can be reclaimed or migrated.
6123 static int __init cmdline_parse_movablecore(char *p)
6125 return cmdline_parse_core(p, &required_movablecore);
6128 early_param("kernelcore", cmdline_parse_kernelcore);
6129 early_param("movablecore", cmdline_parse_movablecore);
6131 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
6133 void adjust_managed_page_count(struct page *page, long count)
6135 spin_lock(&managed_page_count_lock);
6136 page_zone(page)->managed_pages += count;
6137 totalram_pages += count;
6138 #ifdef CONFIG_HIGHMEM
6139 if (PageHighMem(page))
6140 totalhigh_pages += count;
6142 spin_unlock(&managed_page_count_lock);
6144 EXPORT_SYMBOL(adjust_managed_page_count);
6146 unsigned long free_reserved_area(void *start, void *end, int poison, char *s)
6149 unsigned long pages = 0;
6151 start = (void *)PAGE_ALIGN((unsigned long)start);
6152 end = (void *)((unsigned long)end & PAGE_MASK);
6153 for (pos = start; pos < end; pos += PAGE_SIZE, pages++) {
6154 if ((unsigned int)poison <= 0xFF)
6155 memset(pos, poison, PAGE_SIZE);
6156 free_reserved_page(virt_to_page(pos));
6160 pr_info("Freeing %s memory: %ldK (%p - %p)\n",
6161 s, pages << (PAGE_SHIFT - 10), start, end);
6165 EXPORT_SYMBOL(free_reserved_area);
6167 #ifdef CONFIG_HIGHMEM
6168 void free_highmem_page(struct page *page)
6170 __free_reserved_page(page);
6172 page_zone(page)->managed_pages++;
6178 void __init mem_init_print_info(const char *str)
6180 unsigned long physpages, codesize, datasize, rosize, bss_size;
6181 unsigned long init_code_size, init_data_size;
6183 physpages = get_num_physpages();
6184 codesize = _etext - _stext;
6185 datasize = _edata - _sdata;
6186 rosize = __end_rodata - __start_rodata;
6187 bss_size = __bss_stop - __bss_start;
6188 init_data_size = __init_end - __init_begin;
6189 init_code_size = _einittext - _sinittext;
6192 * Detect special cases and adjust section sizes accordingly:
6193 * 1) .init.* may be embedded into .data sections
6194 * 2) .init.text.* may be out of [__init_begin, __init_end],
6195 * please refer to arch/tile/kernel/vmlinux.lds.S.
6196 * 3) .rodata.* may be embedded into .text or .data sections.
6198 #define adj_init_size(start, end, size, pos, adj) \
6200 if (start <= pos && pos < end && size > adj) \
6204 adj_init_size(__init_begin, __init_end, init_data_size,
6205 _sinittext, init_code_size);
6206 adj_init_size(_stext, _etext, codesize, _sinittext, init_code_size);
6207 adj_init_size(_sdata, _edata, datasize, __init_begin, init_data_size);
6208 adj_init_size(_stext, _etext, codesize, __start_rodata, rosize);
6209 adj_init_size(_sdata, _edata, datasize, __start_rodata, rosize);
6211 #undef adj_init_size
6213 pr_info("Memory: %luK/%luK available (%luK kernel code, %luK rwdata, %luK rodata, %luK init, %luK bss, %luK reserved, %luK cma-reserved"
6214 #ifdef CONFIG_HIGHMEM
6218 nr_free_pages() << (PAGE_SHIFT - 10),
6219 physpages << (PAGE_SHIFT - 10),
6220 codesize >> 10, datasize >> 10, rosize >> 10,
6221 (init_data_size + init_code_size) >> 10, bss_size >> 10,
6222 (physpages - totalram_pages - totalcma_pages) << (PAGE_SHIFT - 10),
6223 totalcma_pages << (PAGE_SHIFT - 10),
6224 #ifdef CONFIG_HIGHMEM
6225 totalhigh_pages << (PAGE_SHIFT - 10),
6227 str ? ", " : "", str ? str : "");
6231 * set_dma_reserve - set the specified number of pages reserved in the first zone
6232 * @new_dma_reserve: The number of pages to mark reserved
6234 * The per-cpu batchsize and zone watermarks are determined by managed_pages.
6235 * In the DMA zone, a significant percentage may be consumed by kernel image
6236 * and other unfreeable allocations which can skew the watermarks badly. This
6237 * function may optionally be used to account for unfreeable pages in the
6238 * first zone (e.g., ZONE_DMA). The effect will be lower watermarks and
6239 * smaller per-cpu batchsize.
6241 void __init set_dma_reserve(unsigned long new_dma_reserve)
6243 dma_reserve = new_dma_reserve;
6246 void __init free_area_init(unsigned long *zones_size)
6248 free_area_init_node(0, zones_size,
6249 __pa(PAGE_OFFSET) >> PAGE_SHIFT, NULL);
6252 static int page_alloc_cpu_notify(struct notifier_block *self,
6253 unsigned long action, void *hcpu)
6255 int cpu = (unsigned long)hcpu;
6257 if (action == CPU_DEAD || action == CPU_DEAD_FROZEN) {
6258 lru_add_drain_cpu(cpu);
6262 * Spill the event counters of the dead processor
6263 * into the current processors event counters.
6264 * This artificially elevates the count of the current
6267 vm_events_fold_cpu(cpu);
6270 * Zero the differential counters of the dead processor
6271 * so that the vm statistics are consistent.
6273 * This is only okay since the processor is dead and cannot
6274 * race with what we are doing.
6276 cpu_vm_stats_fold(cpu);
6281 void __init page_alloc_init(void)
6283 hotcpu_notifier(page_alloc_cpu_notify, 0);
6287 * calculate_totalreserve_pages - called when sysctl_lowmem_reserve_ratio
6288 * or min_free_kbytes changes.
6290 static void calculate_totalreserve_pages(void)
6292 struct pglist_data *pgdat;
6293 unsigned long reserve_pages = 0;
6294 enum zone_type i, j;
6296 for_each_online_pgdat(pgdat) {
6297 for (i = 0; i < MAX_NR_ZONES; i++) {
6298 struct zone *zone = pgdat->node_zones + i;
6301 /* Find valid and maximum lowmem_reserve in the zone */
6302 for (j = i; j < MAX_NR_ZONES; j++) {
6303 if (zone->lowmem_reserve[j] > max)
6304 max = zone->lowmem_reserve[j];
6307 /* we treat the high watermark as reserved pages. */
6308 max += high_wmark_pages(zone);
6310 if (max > zone->managed_pages)
6311 max = zone->managed_pages;
6313 zone->totalreserve_pages = max;
6315 reserve_pages += max;
6318 totalreserve_pages = reserve_pages;
6322 * setup_per_zone_lowmem_reserve - called whenever
6323 * sysctl_lowmem_reserve_ratio changes. Ensures that each zone
6324 * has a correct pages reserved value, so an adequate number of
6325 * pages are left in the zone after a successful __alloc_pages().
6327 static void setup_per_zone_lowmem_reserve(void)
6329 struct pglist_data *pgdat;
6330 enum zone_type j, idx;
6332 for_each_online_pgdat(pgdat) {
6333 for (j = 0; j < MAX_NR_ZONES; j++) {
6334 struct zone *zone = pgdat->node_zones + j;
6335 unsigned long managed_pages = zone->managed_pages;
6337 zone->lowmem_reserve[j] = 0;
6341 struct zone *lower_zone;
6345 if (sysctl_lowmem_reserve_ratio[idx] < 1)
6346 sysctl_lowmem_reserve_ratio[idx] = 1;
6348 lower_zone = pgdat->node_zones + idx;
6349 lower_zone->lowmem_reserve[j] = managed_pages /
6350 sysctl_lowmem_reserve_ratio[idx];
6351 managed_pages += lower_zone->managed_pages;
6356 /* update totalreserve_pages */
6357 calculate_totalreserve_pages();
6360 static void __setup_per_zone_wmarks(void)
6362 unsigned long pages_min = min_free_kbytes >> (PAGE_SHIFT - 10);
6363 unsigned long lowmem_pages = 0;
6365 unsigned long flags;
6367 /* Calculate total number of !ZONE_HIGHMEM pages */
6368 for_each_zone(zone) {
6369 if (!is_highmem(zone))
6370 lowmem_pages += zone->managed_pages;
6373 for_each_zone(zone) {
6376 spin_lock_irqsave(&zone->lock, flags);
6377 tmp = (u64)pages_min * zone->managed_pages;
6378 do_div(tmp, lowmem_pages);
6379 if (is_highmem(zone)) {
6381 * __GFP_HIGH and PF_MEMALLOC allocations usually don't
6382 * need highmem pages, so cap pages_min to a small
6385 * The WMARK_HIGH-WMARK_LOW and (WMARK_LOW-WMARK_MIN)
6386 * deltas control asynch page reclaim, and so should
6387 * not be capped for highmem.
6389 unsigned long min_pages;
6391 min_pages = zone->managed_pages / 1024;
6392 min_pages = clamp(min_pages, SWAP_CLUSTER_MAX, 128UL);
6393 zone->watermark[WMARK_MIN] = min_pages;
6396 * If it's a lowmem zone, reserve a number of pages
6397 * proportionate to the zone's size.
6399 zone->watermark[WMARK_MIN] = tmp;
6403 * Set the kswapd watermarks distance according to the
6404 * scale factor in proportion to available memory, but
6405 * ensure a minimum size on small systems.
6407 tmp = max_t(u64, tmp >> 2,
6408 mult_frac(zone->managed_pages,
6409 watermark_scale_factor, 10000));
6411 zone->watermark[WMARK_LOW] = min_wmark_pages(zone) + tmp;
6412 zone->watermark[WMARK_HIGH] = min_wmark_pages(zone) + tmp * 2;
6414 __mod_zone_page_state(zone, NR_ALLOC_BATCH,
6415 high_wmark_pages(zone) - low_wmark_pages(zone) -
6416 atomic_long_read(&zone->vm_stat[NR_ALLOC_BATCH]));
6418 spin_unlock_irqrestore(&zone->lock, flags);
6421 /* update totalreserve_pages */
6422 calculate_totalreserve_pages();
6426 * setup_per_zone_wmarks - called when min_free_kbytes changes
6427 * or when memory is hot-{added|removed}
6429 * Ensures that the watermark[min,low,high] values for each zone are set
6430 * correctly with respect to min_free_kbytes.
6432 void setup_per_zone_wmarks(void)
6434 mutex_lock(&zonelists_mutex);
6435 __setup_per_zone_wmarks();
6436 mutex_unlock(&zonelists_mutex);
6440 * The inactive anon list should be small enough that the VM never has to
6441 * do too much work, but large enough that each inactive page has a chance
6442 * to be referenced again before it is swapped out.
6444 * The inactive_anon ratio is the target ratio of ACTIVE_ANON to
6445 * INACTIVE_ANON pages on this zone's LRU, maintained by the
6446 * pageout code. A zone->inactive_ratio of 3 means 3:1 or 25% of
6447 * the anonymous pages are kept on the inactive list.
6450 * memory ratio inactive anon
6451 * -------------------------------------
6460 static void __meminit calculate_zone_inactive_ratio(struct zone *zone)
6462 unsigned int gb, ratio;
6464 /* Zone size in gigabytes */
6465 gb = zone->managed_pages >> (30 - PAGE_SHIFT);
6467 ratio = int_sqrt(10 * gb);
6471 zone->inactive_ratio = ratio;
6474 static void __meminit setup_per_zone_inactive_ratio(void)
6479 calculate_zone_inactive_ratio(zone);
6483 * Initialise min_free_kbytes.
6485 * For small machines we want it small (128k min). For large machines
6486 * we want it large (64MB max). But it is not linear, because network
6487 * bandwidth does not increase linearly with machine size. We use
6489 * min_free_kbytes = 4 * sqrt(lowmem_kbytes), for better accuracy:
6490 * min_free_kbytes = sqrt(lowmem_kbytes * 16)
6506 int __meminit init_per_zone_wmark_min(void)
6508 unsigned long lowmem_kbytes;
6509 int new_min_free_kbytes;
6511 lowmem_kbytes = nr_free_buffer_pages() * (PAGE_SIZE >> 10);
6512 new_min_free_kbytes = int_sqrt(lowmem_kbytes * 16);
6514 if (new_min_free_kbytes > user_min_free_kbytes) {
6515 min_free_kbytes = new_min_free_kbytes;
6516 if (min_free_kbytes < 128)
6517 min_free_kbytes = 128;
6518 if (min_free_kbytes > 65536)
6519 min_free_kbytes = 65536;
6521 pr_warn("min_free_kbytes is not updated to %d because user defined value %d is preferred\n",
6522 new_min_free_kbytes, user_min_free_kbytes);
6524 setup_per_zone_wmarks();
6525 refresh_zone_stat_thresholds();
6526 setup_per_zone_lowmem_reserve();
6527 setup_per_zone_inactive_ratio();
6530 core_initcall(init_per_zone_wmark_min)
6533 * min_free_kbytes_sysctl_handler - just a wrapper around proc_dointvec() so
6534 * that we can call two helper functions whenever min_free_kbytes
6537 int min_free_kbytes_sysctl_handler(struct ctl_table *table, int write,
6538 void __user *buffer, size_t *length, loff_t *ppos)
6542 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
6547 user_min_free_kbytes = min_free_kbytes;
6548 setup_per_zone_wmarks();
6553 int watermark_scale_factor_sysctl_handler(struct ctl_table *table, int write,
6554 void __user *buffer, size_t *length, loff_t *ppos)
6558 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
6563 setup_per_zone_wmarks();
6569 int sysctl_min_unmapped_ratio_sysctl_handler(struct ctl_table *table, int write,
6570 void __user *buffer, size_t *length, loff_t *ppos)
6575 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
6580 zone->min_unmapped_pages = (zone->managed_pages *
6581 sysctl_min_unmapped_ratio) / 100;
6585 int sysctl_min_slab_ratio_sysctl_handler(struct ctl_table *table, int write,
6586 void __user *buffer, size_t *length, loff_t *ppos)
6591 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
6596 zone->min_slab_pages = (zone->managed_pages *
6597 sysctl_min_slab_ratio) / 100;
6603 * lowmem_reserve_ratio_sysctl_handler - just a wrapper around
6604 * proc_dointvec() so that we can call setup_per_zone_lowmem_reserve()
6605 * whenever sysctl_lowmem_reserve_ratio changes.
6607 * The reserve ratio obviously has absolutely no relation with the
6608 * minimum watermarks. The lowmem reserve ratio can only make sense
6609 * if in function of the boot time zone sizes.
6611 int lowmem_reserve_ratio_sysctl_handler(struct ctl_table *table, int write,
6612 void __user *buffer, size_t *length, loff_t *ppos)
6614 proc_dointvec_minmax(table, write, buffer, length, ppos);
6615 setup_per_zone_lowmem_reserve();
6620 * percpu_pagelist_fraction - changes the pcp->high for each zone on each
6621 * cpu. It is the fraction of total pages in each zone that a hot per cpu
6622 * pagelist can have before it gets flushed back to buddy allocator.
6624 int percpu_pagelist_fraction_sysctl_handler(struct ctl_table *table, int write,
6625 void __user *buffer, size_t *length, loff_t *ppos)
6628 int old_percpu_pagelist_fraction;
6631 mutex_lock(&pcp_batch_high_lock);
6632 old_percpu_pagelist_fraction = percpu_pagelist_fraction;
6634 ret = proc_dointvec_minmax(table, write, buffer, length, ppos);
6635 if (!write || ret < 0)
6638 /* Sanity checking to avoid pcp imbalance */
6639 if (percpu_pagelist_fraction &&
6640 percpu_pagelist_fraction < MIN_PERCPU_PAGELIST_FRACTION) {
6641 percpu_pagelist_fraction = old_percpu_pagelist_fraction;
6647 if (percpu_pagelist_fraction == old_percpu_pagelist_fraction)
6650 for_each_populated_zone(zone) {
6653 for_each_possible_cpu(cpu)
6654 pageset_set_high_and_batch(zone,
6655 per_cpu_ptr(zone->pageset, cpu));
6658 mutex_unlock(&pcp_batch_high_lock);
6663 int hashdist = HASHDIST_DEFAULT;
6665 static int __init set_hashdist(char *str)
6669 hashdist = simple_strtoul(str, &str, 0);
6672 __setup("hashdist=", set_hashdist);
6676 * allocate a large system hash table from bootmem
6677 * - it is assumed that the hash table must contain an exact power-of-2
6678 * quantity of entries
6679 * - limit is the number of hash buckets, not the total allocation size
6681 void *__init alloc_large_system_hash(const char *tablename,
6682 unsigned long bucketsize,
6683 unsigned long numentries,
6686 unsigned int *_hash_shift,
6687 unsigned int *_hash_mask,
6688 unsigned long low_limit,
6689 unsigned long high_limit)
6691 unsigned long long max = high_limit;
6692 unsigned long log2qty, size;
6695 /* allow the kernel cmdline to have a say */
6697 /* round applicable memory size up to nearest megabyte */
6698 numentries = nr_kernel_pages;
6700 /* It isn't necessary when PAGE_SIZE >= 1MB */
6701 if (PAGE_SHIFT < 20)
6702 numentries = round_up(numentries, (1<<20)/PAGE_SIZE);
6704 /* limit to 1 bucket per 2^scale bytes of low memory */
6705 if (scale > PAGE_SHIFT)
6706 numentries >>= (scale - PAGE_SHIFT);
6708 numentries <<= (PAGE_SHIFT - scale);
6710 /* Make sure we've got at least a 0-order allocation.. */
6711 if (unlikely(flags & HASH_SMALL)) {
6712 /* Makes no sense without HASH_EARLY */
6713 WARN_ON(!(flags & HASH_EARLY));
6714 if (!(numentries >> *_hash_shift)) {
6715 numentries = 1UL << *_hash_shift;
6716 BUG_ON(!numentries);
6718 } else if (unlikely((numentries * bucketsize) < PAGE_SIZE))
6719 numentries = PAGE_SIZE / bucketsize;
6721 numentries = roundup_pow_of_two(numentries);
6723 /* limit allocation size to 1/16 total memory by default */
6725 max = ((unsigned long long)nr_all_pages << PAGE_SHIFT) >> 4;
6726 do_div(max, bucketsize);
6728 max = min(max, 0x80000000ULL);
6730 if (numentries < low_limit)
6731 numentries = low_limit;
6732 if (numentries > max)
6735 log2qty = ilog2(numentries);
6738 size = bucketsize << log2qty;
6739 if (flags & HASH_EARLY)
6740 table = memblock_virt_alloc_nopanic(size, 0);
6742 table = __vmalloc(size, GFP_ATOMIC, PAGE_KERNEL);
6745 * If bucketsize is not a power-of-two, we may free
6746 * some pages at the end of hash table which
6747 * alloc_pages_exact() automatically does
6749 if (get_order(size) < MAX_ORDER) {
6750 table = alloc_pages_exact(size, GFP_ATOMIC);
6751 kmemleak_alloc(table, size, 1, GFP_ATOMIC);
6754 } while (!table && size > PAGE_SIZE && --log2qty);
6757 panic("Failed to allocate %s hash table\n", tablename);
6759 pr_info("%s hash table entries: %ld (order: %d, %lu bytes)\n",
6760 tablename, 1UL << log2qty, ilog2(size) - PAGE_SHIFT, size);
6763 *_hash_shift = log2qty;
6765 *_hash_mask = (1 << log2qty) - 1;
6770 /* Return a pointer to the bitmap storing bits affecting a block of pages */
6771 static inline unsigned long *get_pageblock_bitmap(struct page *page,
6774 #ifdef CONFIG_SPARSEMEM
6775 return __pfn_to_section(pfn)->pageblock_flags;
6777 return page_zone(page)->pageblock_flags;
6778 #endif /* CONFIG_SPARSEMEM */
6781 static inline int pfn_to_bitidx(struct page *page, unsigned long pfn)
6783 #ifdef CONFIG_SPARSEMEM
6784 pfn &= (PAGES_PER_SECTION-1);
6785 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
6787 pfn = pfn - round_down(page_zone(page)->zone_start_pfn, pageblock_nr_pages);
6788 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
6789 #endif /* CONFIG_SPARSEMEM */
6793 * get_pfnblock_flags_mask - Return the requested group of flags for the pageblock_nr_pages block of pages
6794 * @page: The page within the block of interest
6795 * @pfn: The target page frame number
6796 * @end_bitidx: The last bit of interest to retrieve
6797 * @mask: mask of bits that the caller is interested in
6799 * Return: pageblock_bits flags
6801 unsigned long get_pfnblock_flags_mask(struct page *page, unsigned long pfn,
6802 unsigned long end_bitidx,
6805 unsigned long *bitmap;
6806 unsigned long bitidx, word_bitidx;
6809 bitmap = get_pageblock_bitmap(page, pfn);
6810 bitidx = pfn_to_bitidx(page, pfn);
6811 word_bitidx = bitidx / BITS_PER_LONG;
6812 bitidx &= (BITS_PER_LONG-1);
6814 word = bitmap[word_bitidx];
6815 bitidx += end_bitidx;
6816 return (word >> (BITS_PER_LONG - bitidx - 1)) & mask;
6820 * set_pfnblock_flags_mask - Set the requested group of flags for a pageblock_nr_pages block of pages
6821 * @page: The page within the block of interest
6822 * @flags: The flags to set
6823 * @pfn: The target page frame number
6824 * @end_bitidx: The last bit of interest
6825 * @mask: mask of bits that the caller is interested in
6827 void set_pfnblock_flags_mask(struct page *page, unsigned long flags,
6829 unsigned long end_bitidx,
6832 unsigned long *bitmap;
6833 unsigned long bitidx, word_bitidx;
6834 unsigned long old_word, word;
6836 BUILD_BUG_ON(NR_PAGEBLOCK_BITS != 4);
6838 bitmap = get_pageblock_bitmap(page, pfn);
6839 bitidx = pfn_to_bitidx(page, pfn);
6840 word_bitidx = bitidx / BITS_PER_LONG;
6841 bitidx &= (BITS_PER_LONG-1);
6843 VM_BUG_ON_PAGE(!zone_spans_pfn(page_zone(page), pfn), page);
6845 bitidx += end_bitidx;
6846 mask <<= (BITS_PER_LONG - bitidx - 1);
6847 flags <<= (BITS_PER_LONG - bitidx - 1);
6849 word = READ_ONCE(bitmap[word_bitidx]);
6851 old_word = cmpxchg(&bitmap[word_bitidx], word, (word & ~mask) | flags);
6852 if (word == old_word)
6859 * This function checks whether pageblock includes unmovable pages or not.
6860 * If @count is not zero, it is okay to include less @count unmovable pages
6862 * PageLRU check without isolation or lru_lock could race so that
6863 * MIGRATE_MOVABLE block might include unmovable pages. It means you can't
6864 * expect this function should be exact.
6866 bool has_unmovable_pages(struct zone *zone, struct page *page, int count,
6867 bool skip_hwpoisoned_pages)
6869 unsigned long pfn, iter, found;
6873 * For avoiding noise data, lru_add_drain_all() should be called
6874 * If ZONE_MOVABLE, the zone never contains unmovable pages
6876 if (zone_idx(zone) == ZONE_MOVABLE)
6878 mt = get_pageblock_migratetype(page);
6879 if (mt == MIGRATE_MOVABLE || is_migrate_cma(mt))
6882 pfn = page_to_pfn(page);
6883 for (found = 0, iter = 0; iter < pageblock_nr_pages; iter++) {
6884 unsigned long check = pfn + iter;
6886 if (!pfn_valid_within(check))
6889 page = pfn_to_page(check);
6892 * Hugepages are not in LRU lists, but they're movable.
6893 * We need not scan over tail pages bacause we don't
6894 * handle each tail page individually in migration.
6896 if (PageHuge(page)) {
6897 iter = round_up(iter + 1, 1<<compound_order(page)) - 1;
6902 * We can't use page_count without pin a page
6903 * because another CPU can free compound page.
6904 * This check already skips compound tails of THP
6905 * because their page->_refcount is zero at all time.
6907 if (!page_ref_count(page)) {
6908 if (PageBuddy(page))
6909 iter += (1 << page_order(page)) - 1;
6914 * The HWPoisoned page may be not in buddy system, and
6915 * page_count() is not 0.
6917 if (skip_hwpoisoned_pages && PageHWPoison(page))
6923 * If there are RECLAIMABLE pages, we need to check
6924 * it. But now, memory offline itself doesn't call
6925 * shrink_node_slabs() and it still to be fixed.
6928 * If the page is not RAM, page_count()should be 0.
6929 * we don't need more check. This is an _used_ not-movable page.
6931 * The problematic thing here is PG_reserved pages. PG_reserved
6932 * is set to both of a memory hole page and a _used_ kernel
6941 bool is_pageblock_removable_nolock(struct page *page)
6947 * We have to be careful here because we are iterating over memory
6948 * sections which are not zone aware so we might end up outside of
6949 * the zone but still within the section.
6950 * We have to take care about the node as well. If the node is offline
6951 * its NODE_DATA will be NULL - see page_zone.
6953 if (!node_online(page_to_nid(page)))
6956 zone = page_zone(page);
6957 pfn = page_to_pfn(page);
6958 if (!zone_spans_pfn(zone, pfn))
6961 return !has_unmovable_pages(zone, page, 0, true);
6964 #if (defined(CONFIG_MEMORY_ISOLATION) && defined(CONFIG_COMPACTION)) || defined(CONFIG_CMA)
6966 static unsigned long pfn_max_align_down(unsigned long pfn)
6968 return pfn & ~(max_t(unsigned long, MAX_ORDER_NR_PAGES,
6969 pageblock_nr_pages) - 1);
6972 static unsigned long pfn_max_align_up(unsigned long pfn)
6974 return ALIGN(pfn, max_t(unsigned long, MAX_ORDER_NR_PAGES,
6975 pageblock_nr_pages));
6978 /* [start, end) must belong to a single zone. */
6979 static int __alloc_contig_migrate_range(struct compact_control *cc,
6980 unsigned long start, unsigned long end)
6982 /* This function is based on compact_zone() from compaction.c. */
6983 unsigned long nr_reclaimed;
6984 unsigned long pfn = start;
6985 unsigned int tries = 0;
6990 while (pfn < end || !list_empty(&cc->migratepages)) {
6991 if (fatal_signal_pending(current)) {
6996 if (list_empty(&cc->migratepages)) {
6997 cc->nr_migratepages = 0;
6998 pfn = isolate_migratepages_range(cc, pfn, end);
7004 } else if (++tries == 5) {
7005 ret = ret < 0 ? ret : -EBUSY;
7009 nr_reclaimed = reclaim_clean_pages_from_list(cc->zone,
7011 cc->nr_migratepages -= nr_reclaimed;
7013 ret = migrate_pages(&cc->migratepages, alloc_migrate_target,
7014 NULL, 0, cc->mode, MR_CMA);
7017 putback_movable_pages(&cc->migratepages);
7024 * alloc_contig_range() -- tries to allocate given range of pages
7025 * @start: start PFN to allocate
7026 * @end: one-past-the-last PFN to allocate
7027 * @migratetype: migratetype of the underlaying pageblocks (either
7028 * #MIGRATE_MOVABLE or #MIGRATE_CMA). All pageblocks
7029 * in range must have the same migratetype and it must
7030 * be either of the two.
7032 * The PFN range does not have to be pageblock or MAX_ORDER_NR_PAGES
7033 * aligned, however it's the caller's responsibility to guarantee that
7034 * we are the only thread that changes migrate type of pageblocks the
7037 * The PFN range must belong to a single zone.
7039 * Returns zero on success or negative error code. On success all
7040 * pages which PFN is in [start, end) are allocated for the caller and
7041 * need to be freed with free_contig_range().
7043 int alloc_contig_range(unsigned long start, unsigned long end,
7044 unsigned migratetype)
7046 unsigned long outer_start, outer_end;
7050 struct compact_control cc = {
7051 .nr_migratepages = 0,
7053 .zone = page_zone(pfn_to_page(start)),
7054 .mode = MIGRATE_SYNC,
7055 .ignore_skip_hint = true,
7057 INIT_LIST_HEAD(&cc.migratepages);
7060 * What we do here is we mark all pageblocks in range as
7061 * MIGRATE_ISOLATE. Because pageblock and max order pages may
7062 * have different sizes, and due to the way page allocator
7063 * work, we align the range to biggest of the two pages so
7064 * that page allocator won't try to merge buddies from
7065 * different pageblocks and change MIGRATE_ISOLATE to some
7066 * other migration type.
7068 * Once the pageblocks are marked as MIGRATE_ISOLATE, we
7069 * migrate the pages from an unaligned range (ie. pages that
7070 * we are interested in). This will put all the pages in
7071 * range back to page allocator as MIGRATE_ISOLATE.
7073 * When this is done, we take the pages in range from page
7074 * allocator removing them from the buddy system. This way
7075 * page allocator will never consider using them.
7077 * This lets us mark the pageblocks back as
7078 * MIGRATE_CMA/MIGRATE_MOVABLE so that free pages in the
7079 * aligned range but not in the unaligned, original range are
7080 * put back to page allocator so that buddy can use them.
7083 ret = start_isolate_page_range(pfn_max_align_down(start),
7084 pfn_max_align_up(end), migratetype,
7090 * In case of -EBUSY, we'd like to know which page causes problem.
7091 * So, just fall through. We will check it in test_pages_isolated().
7093 ret = __alloc_contig_migrate_range(&cc, start, end);
7094 if (ret && ret != -EBUSY)
7098 * Pages from [start, end) are within a MAX_ORDER_NR_PAGES
7099 * aligned blocks that are marked as MIGRATE_ISOLATE. What's
7100 * more, all pages in [start, end) are free in page allocator.
7101 * What we are going to do is to allocate all pages from
7102 * [start, end) (that is remove them from page allocator).
7104 * The only problem is that pages at the beginning and at the
7105 * end of interesting range may be not aligned with pages that
7106 * page allocator holds, ie. they can be part of higher order
7107 * pages. Because of this, we reserve the bigger range and
7108 * once this is done free the pages we are not interested in.
7110 * We don't have to hold zone->lock here because the pages are
7111 * isolated thus they won't get removed from buddy.
7114 lru_add_drain_all();
7115 drain_all_pages(cc.zone);
7118 outer_start = start;
7119 while (!PageBuddy(pfn_to_page(outer_start))) {
7120 if (++order >= MAX_ORDER) {
7121 outer_start = start;
7124 outer_start &= ~0UL << order;
7127 if (outer_start != start) {
7128 order = page_order(pfn_to_page(outer_start));
7131 * outer_start page could be small order buddy page and
7132 * it doesn't include start page. Adjust outer_start
7133 * in this case to report failed page properly
7134 * on tracepoint in test_pages_isolated()
7136 if (outer_start + (1UL << order) <= start)
7137 outer_start = start;
7140 /* Make sure the range is really isolated. */
7141 if (test_pages_isolated(outer_start, end, false)) {
7142 pr_info("%s: [%lx, %lx) PFNs busy\n",
7143 __func__, outer_start, end);
7148 /* Grab isolated pages from freelists. */
7149 outer_end = isolate_freepages_range(&cc, outer_start, end);
7155 /* Free head and tail (if any) */
7156 if (start != outer_start)
7157 free_contig_range(outer_start, start - outer_start);
7158 if (end != outer_end)
7159 free_contig_range(end, outer_end - end);
7162 undo_isolate_page_range(pfn_max_align_down(start),
7163 pfn_max_align_up(end), migratetype);
7167 void free_contig_range(unsigned long pfn, unsigned nr_pages)
7169 unsigned int count = 0;
7171 for (; nr_pages--; pfn++) {
7172 struct page *page = pfn_to_page(pfn);
7174 count += page_count(page) != 1;
7177 WARN(count != 0, "%d pages are still in use!\n", count);
7181 #ifdef CONFIG_MEMORY_HOTPLUG
7183 * The zone indicated has a new number of managed_pages; batch sizes and percpu
7184 * page high values need to be recalulated.
7186 void __meminit zone_pcp_update(struct zone *zone)
7189 mutex_lock(&pcp_batch_high_lock);
7190 for_each_possible_cpu(cpu)
7191 pageset_set_high_and_batch(zone,
7192 per_cpu_ptr(zone->pageset, cpu));
7193 mutex_unlock(&pcp_batch_high_lock);
7197 void zone_pcp_reset(struct zone *zone)
7199 unsigned long flags;
7201 struct per_cpu_pageset *pset;
7203 /* avoid races with drain_pages() */
7204 local_irq_save(flags);
7205 if (zone->pageset != &boot_pageset) {
7206 for_each_online_cpu(cpu) {
7207 pset = per_cpu_ptr(zone->pageset, cpu);
7208 drain_zonestat(zone, pset);
7210 free_percpu(zone->pageset);
7211 zone->pageset = &boot_pageset;
7213 local_irq_restore(flags);
7216 #ifdef CONFIG_MEMORY_HOTREMOVE
7218 * All pages in the range must be in a single zone and isolated
7219 * before calling this.
7222 __offline_isolated_pages(unsigned long start_pfn, unsigned long end_pfn)
7226 unsigned int order, i;
7228 unsigned long flags;
7229 /* find the first valid pfn */
7230 for (pfn = start_pfn; pfn < end_pfn; pfn++)
7235 zone = page_zone(pfn_to_page(pfn));
7236 spin_lock_irqsave(&zone->lock, flags);
7238 while (pfn < end_pfn) {
7239 if (!pfn_valid(pfn)) {
7243 page = pfn_to_page(pfn);
7245 * The HWPoisoned page may be not in buddy system, and
7246 * page_count() is not 0.
7248 if (unlikely(!PageBuddy(page) && PageHWPoison(page))) {
7250 SetPageReserved(page);
7254 BUG_ON(page_count(page));
7255 BUG_ON(!PageBuddy(page));
7256 order = page_order(page);
7257 #ifdef CONFIG_DEBUG_VM
7258 pr_info("remove from free list %lx %d %lx\n",
7259 pfn, 1 << order, end_pfn);
7261 list_del(&page->lru);
7262 rmv_page_order(page);
7263 zone->free_area[order].nr_free--;
7264 for (i = 0; i < (1 << order); i++)
7265 SetPageReserved((page+i));
7266 pfn += (1 << order);
7268 spin_unlock_irqrestore(&zone->lock, flags);
7272 bool is_free_buddy_page(struct page *page)
7274 struct zone *zone = page_zone(page);
7275 unsigned long pfn = page_to_pfn(page);
7276 unsigned long flags;
7279 spin_lock_irqsave(&zone->lock, flags);
7280 for (order = 0; order < MAX_ORDER; order++) {
7281 struct page *page_head = page - (pfn & ((1 << order) - 1));
7283 if (PageBuddy(page_head) && page_order(page_head) >= order)
7286 spin_unlock_irqrestore(&zone->lock, flags);
7288 return order < MAX_ORDER;