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;
253 static unsigned long __meminitdata nr_kernel_pages;
254 static unsigned long __meminitdata nr_all_pages;
255 static unsigned long __meminitdata dma_reserve;
257 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
258 static unsigned long __meminitdata arch_zone_lowest_possible_pfn[MAX_NR_ZONES];
259 static unsigned long __meminitdata arch_zone_highest_possible_pfn[MAX_NR_ZONES];
260 static unsigned long __initdata required_kernelcore;
261 static unsigned long __initdata required_movablecore;
262 static unsigned long __meminitdata zone_movable_pfn[MAX_NUMNODES];
263 static bool mirrored_kernelcore;
265 /* movable_zone is the "real" zone pages in ZONE_MOVABLE are taken from */
267 EXPORT_SYMBOL(movable_zone);
268 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
271 int nr_node_ids __read_mostly = MAX_NUMNODES;
272 int nr_online_nodes __read_mostly = 1;
273 EXPORT_SYMBOL(nr_node_ids);
274 EXPORT_SYMBOL(nr_online_nodes);
277 int page_group_by_mobility_disabled __read_mostly;
279 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
280 static inline void reset_deferred_meminit(pg_data_t *pgdat)
282 pgdat->first_deferred_pfn = ULONG_MAX;
285 /* Returns true if the struct page for the pfn is uninitialised */
286 static inline bool __meminit early_page_uninitialised(unsigned long pfn)
288 if (pfn >= NODE_DATA(early_pfn_to_nid(pfn))->first_deferred_pfn)
294 static inline bool early_page_nid_uninitialised(unsigned long pfn, int nid)
296 if (pfn >= NODE_DATA(nid)->first_deferred_pfn)
303 * Returns false when the remaining initialisation should be deferred until
304 * later in the boot cycle when it can be parallelised.
306 static inline bool update_defer_init(pg_data_t *pgdat,
307 unsigned long pfn, unsigned long zone_end,
308 unsigned long *nr_initialised)
310 /* Always populate low zones for address-contrained allocations */
311 if (zone_end < pgdat_end_pfn(pgdat))
314 /* Initialise at least 2G of the highest zone */
316 if (*nr_initialised > (2UL << (30 - PAGE_SHIFT)) &&
317 (pfn & (PAGES_PER_SECTION - 1)) == 0) {
318 pgdat->first_deferred_pfn = pfn;
325 static inline void reset_deferred_meminit(pg_data_t *pgdat)
329 static inline bool early_page_uninitialised(unsigned long pfn)
334 static inline bool early_page_nid_uninitialised(unsigned long pfn, int nid)
339 static inline bool update_defer_init(pg_data_t *pgdat,
340 unsigned long pfn, unsigned long zone_end,
341 unsigned long *nr_initialised)
348 void set_pageblock_migratetype(struct page *page, int migratetype)
350 if (unlikely(page_group_by_mobility_disabled &&
351 migratetype < MIGRATE_PCPTYPES))
352 migratetype = MIGRATE_UNMOVABLE;
354 set_pageblock_flags_group(page, (unsigned long)migratetype,
355 PB_migrate, PB_migrate_end);
358 #ifdef CONFIG_DEBUG_VM
359 static int page_outside_zone_boundaries(struct zone *zone, struct page *page)
363 unsigned long pfn = page_to_pfn(page);
364 unsigned long sp, start_pfn;
367 seq = zone_span_seqbegin(zone);
368 start_pfn = zone->zone_start_pfn;
369 sp = zone->spanned_pages;
370 if (!zone_spans_pfn(zone, pfn))
372 } while (zone_span_seqretry(zone, seq));
375 pr_err("page 0x%lx outside node %d zone %s [ 0x%lx - 0x%lx ]\n",
376 pfn, zone_to_nid(zone), zone->name,
377 start_pfn, start_pfn + sp);
382 static int page_is_consistent(struct zone *zone, struct page *page)
384 if (!pfn_valid_within(page_to_pfn(page)))
386 if (zone != page_zone(page))
392 * Temporary debugging check for pages not lying within a given zone.
394 static int bad_range(struct zone *zone, struct page *page)
396 if (page_outside_zone_boundaries(zone, page))
398 if (!page_is_consistent(zone, page))
404 static inline int bad_range(struct zone *zone, struct page *page)
410 static void bad_page(struct page *page, const char *reason,
411 unsigned long bad_flags)
413 static unsigned long resume;
414 static unsigned long nr_shown;
415 static unsigned long nr_unshown;
417 /* Don't complain about poisoned pages */
418 if (PageHWPoison(page)) {
419 page_mapcount_reset(page); /* remove PageBuddy */
424 * Allow a burst of 60 reports, then keep quiet for that minute;
425 * or allow a steady drip of one report per second.
427 if (nr_shown == 60) {
428 if (time_before(jiffies, resume)) {
434 "BUG: Bad page state: %lu messages suppressed\n",
441 resume = jiffies + 60 * HZ;
443 pr_alert("BUG: Bad page state in process %s pfn:%05lx\n",
444 current->comm, page_to_pfn(page));
445 __dump_page(page, reason);
446 bad_flags &= page->flags;
448 pr_alert("bad because of flags: %#lx(%pGp)\n",
449 bad_flags, &bad_flags);
450 dump_page_owner(page);
455 /* Leave bad fields for debug, except PageBuddy could make trouble */
456 page_mapcount_reset(page); /* remove PageBuddy */
457 add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE);
461 * Higher-order pages are called "compound pages". They are structured thusly:
463 * The first PAGE_SIZE page is called the "head page" and have PG_head set.
465 * The remaining PAGE_SIZE pages are called "tail pages". PageTail() is encoded
466 * in bit 0 of page->compound_head. The rest of bits is pointer to head page.
468 * The first tail page's ->compound_dtor holds the offset in array of compound
469 * page destructors. See compound_page_dtors.
471 * The first tail page's ->compound_order holds the order of allocation.
472 * This usage means that zero-order pages may not be compound.
475 void free_compound_page(struct page *page)
477 __free_pages_ok(page, compound_order(page));
480 void prep_compound_page(struct page *page, unsigned int order)
483 int nr_pages = 1 << order;
485 set_compound_page_dtor(page, COMPOUND_PAGE_DTOR);
486 set_compound_order(page, order);
488 for (i = 1; i < nr_pages; i++) {
489 struct page *p = page + i;
490 set_page_count(p, 0);
491 p->mapping = TAIL_MAPPING;
492 set_compound_head(p, page);
494 atomic_set(compound_mapcount_ptr(page), -1);
497 #ifdef CONFIG_DEBUG_PAGEALLOC
498 unsigned int _debug_guardpage_minorder;
499 bool _debug_pagealloc_enabled __read_mostly
500 = IS_ENABLED(CONFIG_DEBUG_PAGEALLOC_ENABLE_DEFAULT);
501 EXPORT_SYMBOL(_debug_pagealloc_enabled);
502 bool _debug_guardpage_enabled __read_mostly;
504 static int __init early_debug_pagealloc(char *buf)
509 if (strcmp(buf, "on") == 0)
510 _debug_pagealloc_enabled = true;
512 if (strcmp(buf, "off") == 0)
513 _debug_pagealloc_enabled = false;
517 early_param("debug_pagealloc", early_debug_pagealloc);
519 static bool need_debug_guardpage(void)
521 /* If we don't use debug_pagealloc, we don't need guard page */
522 if (!debug_pagealloc_enabled())
528 static void init_debug_guardpage(void)
530 if (!debug_pagealloc_enabled())
533 _debug_guardpage_enabled = true;
536 struct page_ext_operations debug_guardpage_ops = {
537 .need = need_debug_guardpage,
538 .init = init_debug_guardpage,
541 static int __init debug_guardpage_minorder_setup(char *buf)
545 if (kstrtoul(buf, 10, &res) < 0 || res > MAX_ORDER / 2) {
546 printk(KERN_ERR "Bad debug_guardpage_minorder value\n");
549 _debug_guardpage_minorder = res;
550 printk(KERN_INFO "Setting debug_guardpage_minorder to %lu\n", res);
553 __setup("debug_guardpage_minorder=", debug_guardpage_minorder_setup);
555 static inline void set_page_guard(struct zone *zone, struct page *page,
556 unsigned int order, int migratetype)
558 struct page_ext *page_ext;
560 if (!debug_guardpage_enabled())
563 page_ext = lookup_page_ext(page);
564 __set_bit(PAGE_EXT_DEBUG_GUARD, &page_ext->flags);
566 INIT_LIST_HEAD(&page->lru);
567 set_page_private(page, order);
568 /* Guard pages are not available for any usage */
569 __mod_zone_freepage_state(zone, -(1 << order), migratetype);
572 static inline void clear_page_guard(struct zone *zone, struct page *page,
573 unsigned int order, int migratetype)
575 struct page_ext *page_ext;
577 if (!debug_guardpage_enabled())
580 page_ext = lookup_page_ext(page);
581 __clear_bit(PAGE_EXT_DEBUG_GUARD, &page_ext->flags);
583 set_page_private(page, 0);
584 if (!is_migrate_isolate(migratetype))
585 __mod_zone_freepage_state(zone, (1 << order), migratetype);
588 struct page_ext_operations debug_guardpage_ops = { NULL, };
589 static inline void set_page_guard(struct zone *zone, struct page *page,
590 unsigned int order, int migratetype) {}
591 static inline void clear_page_guard(struct zone *zone, struct page *page,
592 unsigned int order, int migratetype) {}
595 static inline void set_page_order(struct page *page, unsigned int order)
597 set_page_private(page, order);
598 __SetPageBuddy(page);
601 static inline void rmv_page_order(struct page *page)
603 __ClearPageBuddy(page);
604 set_page_private(page, 0);
608 * This function checks whether a page is free && is the buddy
609 * we can do coalesce a page and its buddy if
610 * (a) the buddy is not in a hole &&
611 * (b) the buddy is in the buddy system &&
612 * (c) a page and its buddy have the same order &&
613 * (d) a page and its buddy are in the same zone.
615 * For recording whether a page is in the buddy system, we set ->_mapcount
616 * PAGE_BUDDY_MAPCOUNT_VALUE.
617 * Setting, clearing, and testing _mapcount PAGE_BUDDY_MAPCOUNT_VALUE is
618 * serialized by zone->lock.
620 * For recording page's order, we use page_private(page).
622 static inline int page_is_buddy(struct page *page, struct page *buddy,
625 if (!pfn_valid_within(page_to_pfn(buddy)))
628 if (page_is_guard(buddy) && page_order(buddy) == order) {
629 if (page_zone_id(page) != page_zone_id(buddy))
632 VM_BUG_ON_PAGE(page_count(buddy) != 0, buddy);
637 if (PageBuddy(buddy) && page_order(buddy) == order) {
639 * zone check is done late to avoid uselessly
640 * calculating zone/node ids for pages that could
643 if (page_zone_id(page) != page_zone_id(buddy))
646 VM_BUG_ON_PAGE(page_count(buddy) != 0, buddy);
654 * Freeing function for a buddy system allocator.
656 * The concept of a buddy system is to maintain direct-mapped table
657 * (containing bit values) for memory blocks of various "orders".
658 * The bottom level table contains the map for the smallest allocatable
659 * units of memory (here, pages), and each level above it describes
660 * pairs of units from the levels below, hence, "buddies".
661 * At a high level, all that happens here is marking the table entry
662 * at the bottom level available, and propagating the changes upward
663 * as necessary, plus some accounting needed to play nicely with other
664 * parts of the VM system.
665 * At each level, we keep a list of pages, which are heads of continuous
666 * free pages of length of (1 << order) and marked with _mapcount
667 * PAGE_BUDDY_MAPCOUNT_VALUE. Page's order is recorded in page_private(page)
669 * So when we are allocating or freeing one, we can derive the state of the
670 * other. That is, if we allocate a small block, and both were
671 * free, the remainder of the region must be split into blocks.
672 * If a block is freed, and its buddy is also free, then this
673 * triggers coalescing into a block of larger size.
678 static inline void __free_one_page(struct page *page,
680 struct zone *zone, unsigned int order,
683 unsigned long page_idx;
684 unsigned long combined_idx;
685 unsigned long uninitialized_var(buddy_idx);
687 unsigned int max_order = MAX_ORDER;
689 VM_BUG_ON(!zone_is_initialized(zone));
690 VM_BUG_ON_PAGE(page->flags & PAGE_FLAGS_CHECK_AT_PREP, page);
692 VM_BUG_ON(migratetype == -1);
693 if (is_migrate_isolate(migratetype)) {
695 * We restrict max order of merging to prevent merge
696 * between freepages on isolate pageblock and normal
697 * pageblock. Without this, pageblock isolation
698 * could cause incorrect freepage accounting.
700 max_order = min_t(unsigned int, MAX_ORDER, pageblock_order + 1);
702 __mod_zone_freepage_state(zone, 1 << order, migratetype);
705 page_idx = pfn & ((1 << max_order) - 1);
707 VM_BUG_ON_PAGE(page_idx & ((1 << order) - 1), page);
708 VM_BUG_ON_PAGE(bad_range(zone, page), page);
710 while (order < max_order - 1) {
711 buddy_idx = __find_buddy_index(page_idx, order);
712 buddy = page + (buddy_idx - page_idx);
713 if (!page_is_buddy(page, buddy, order))
716 * Our buddy is free or it is CONFIG_DEBUG_PAGEALLOC guard page,
717 * merge with it and move up one order.
719 if (page_is_guard(buddy)) {
720 clear_page_guard(zone, buddy, order, migratetype);
722 list_del(&buddy->lru);
723 zone->free_area[order].nr_free--;
724 rmv_page_order(buddy);
726 combined_idx = buddy_idx & page_idx;
727 page = page + (combined_idx - page_idx);
728 page_idx = combined_idx;
731 set_page_order(page, order);
734 * If this is not the largest possible page, check if the buddy
735 * of the next-highest order is free. If it is, it's possible
736 * that pages are being freed that will coalesce soon. In case,
737 * that is happening, add the free page to the tail of the list
738 * so it's less likely to be used soon and more likely to be merged
739 * as a higher order page
741 if ((order < MAX_ORDER-2) && pfn_valid_within(page_to_pfn(buddy))) {
742 struct page *higher_page, *higher_buddy;
743 combined_idx = buddy_idx & page_idx;
744 higher_page = page + (combined_idx - page_idx);
745 buddy_idx = __find_buddy_index(combined_idx, order + 1);
746 higher_buddy = higher_page + (buddy_idx - combined_idx);
747 if (page_is_buddy(higher_page, higher_buddy, order + 1)) {
748 list_add_tail(&page->lru,
749 &zone->free_area[order].free_list[migratetype]);
754 list_add(&page->lru, &zone->free_area[order].free_list[migratetype]);
756 zone->free_area[order].nr_free++;
759 static inline int free_pages_check(struct page *page)
761 const char *bad_reason = NULL;
762 unsigned long bad_flags = 0;
764 if (unlikely(atomic_read(&page->_mapcount) != -1))
765 bad_reason = "nonzero mapcount";
766 if (unlikely(page->mapping != NULL))
767 bad_reason = "non-NULL mapping";
768 if (unlikely(atomic_read(&page->_count) != 0))
769 bad_reason = "nonzero _count";
770 if (unlikely(page->flags & PAGE_FLAGS_CHECK_AT_FREE)) {
771 bad_reason = "PAGE_FLAGS_CHECK_AT_FREE flag(s) set";
772 bad_flags = PAGE_FLAGS_CHECK_AT_FREE;
775 if (unlikely(page->mem_cgroup))
776 bad_reason = "page still charged to cgroup";
778 if (unlikely(bad_reason)) {
779 bad_page(page, bad_reason, bad_flags);
782 page_cpupid_reset_last(page);
783 if (page->flags & PAGE_FLAGS_CHECK_AT_PREP)
784 page->flags &= ~PAGE_FLAGS_CHECK_AT_PREP;
789 * Frees a number of pages from the PCP lists
790 * Assumes all pages on list are in same zone, and of same order.
791 * count is the number of pages to free.
793 * If the zone was previously in an "all pages pinned" state then look to
794 * see if this freeing clears that state.
796 * And clear the zone's pages_scanned counter, to hold off the "all pages are
797 * pinned" detection logic.
799 static void free_pcppages_bulk(struct zone *zone, int count,
800 struct per_cpu_pages *pcp)
805 unsigned long nr_scanned;
807 spin_lock(&zone->lock);
808 nr_scanned = zone_page_state(zone, NR_PAGES_SCANNED);
810 __mod_zone_page_state(zone, NR_PAGES_SCANNED, -nr_scanned);
814 struct list_head *list;
817 * Remove pages from lists in a round-robin fashion. A
818 * batch_free count is maintained that is incremented when an
819 * empty list is encountered. This is so more pages are freed
820 * off fuller lists instead of spinning excessively around empty
825 if (++migratetype == MIGRATE_PCPTYPES)
827 list = &pcp->lists[migratetype];
828 } while (list_empty(list));
830 /* This is the only non-empty list. Free them all. */
831 if (batch_free == MIGRATE_PCPTYPES)
832 batch_free = to_free;
835 int mt; /* migratetype of the to-be-freed page */
837 page = list_last_entry(list, struct page, lru);
838 /* must delete as __free_one_page list manipulates */
839 list_del(&page->lru);
841 mt = get_pcppage_migratetype(page);
842 /* MIGRATE_ISOLATE page should not go to pcplists */
843 VM_BUG_ON_PAGE(is_migrate_isolate(mt), page);
844 /* Pageblock could have been isolated meanwhile */
845 if (unlikely(has_isolate_pageblock(zone)))
846 mt = get_pageblock_migratetype(page);
848 __free_one_page(page, page_to_pfn(page), zone, 0, mt);
849 trace_mm_page_pcpu_drain(page, 0, mt);
850 } while (--to_free && --batch_free && !list_empty(list));
852 spin_unlock(&zone->lock);
855 static void free_one_page(struct zone *zone,
856 struct page *page, unsigned long pfn,
860 unsigned long nr_scanned;
861 spin_lock(&zone->lock);
862 nr_scanned = zone_page_state(zone, NR_PAGES_SCANNED);
864 __mod_zone_page_state(zone, NR_PAGES_SCANNED, -nr_scanned);
866 if (unlikely(has_isolate_pageblock(zone) ||
867 is_migrate_isolate(migratetype))) {
868 migratetype = get_pfnblock_migratetype(page, pfn);
870 __free_one_page(page, pfn, zone, order, migratetype);
871 spin_unlock(&zone->lock);
874 static int free_tail_pages_check(struct page *head_page, struct page *page)
879 * We rely page->lru.next never has bit 0 set, unless the page
880 * is PageTail(). Let's make sure that's true even for poisoned ->lru.
882 BUILD_BUG_ON((unsigned long)LIST_POISON1 & 1);
884 if (!IS_ENABLED(CONFIG_DEBUG_VM)) {
888 switch (page - head_page) {
890 /* the first tail page: ->mapping is compound_mapcount() */
891 if (unlikely(compound_mapcount(page))) {
892 bad_page(page, "nonzero compound_mapcount", 0);
898 * the second tail page: ->mapping is
899 * page_deferred_list().next -- ignore value.
903 if (page->mapping != TAIL_MAPPING) {
904 bad_page(page, "corrupted mapping in tail page", 0);
909 if (unlikely(!PageTail(page))) {
910 bad_page(page, "PageTail not set", 0);
913 if (unlikely(compound_head(page) != head_page)) {
914 bad_page(page, "compound_head not consistent", 0);
919 page->mapping = NULL;
920 clear_compound_head(page);
924 static void __meminit __init_single_page(struct page *page, unsigned long pfn,
925 unsigned long zone, int nid)
927 set_page_links(page, zone, nid, pfn);
928 init_page_count(page);
929 page_mapcount_reset(page);
930 page_cpupid_reset_last(page);
932 INIT_LIST_HEAD(&page->lru);
933 #ifdef WANT_PAGE_VIRTUAL
934 /* The shift won't overflow because ZONE_NORMAL is below 4G. */
935 if (!is_highmem_idx(zone))
936 set_page_address(page, __va(pfn << PAGE_SHIFT));
940 static void __meminit __init_single_pfn(unsigned long pfn, unsigned long zone,
943 return __init_single_page(pfn_to_page(pfn), pfn, zone, nid);
946 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
947 static void init_reserved_page(unsigned long pfn)
952 if (!early_page_uninitialised(pfn))
955 nid = early_pfn_to_nid(pfn);
956 pgdat = NODE_DATA(nid);
958 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
959 struct zone *zone = &pgdat->node_zones[zid];
961 if (pfn >= zone->zone_start_pfn && pfn < zone_end_pfn(zone))
964 __init_single_pfn(pfn, zid, nid);
967 static inline void init_reserved_page(unsigned long pfn)
970 #endif /* CONFIG_DEFERRED_STRUCT_PAGE_INIT */
973 * Initialised pages do not have PageReserved set. This function is
974 * called for each range allocated by the bootmem allocator and
975 * marks the pages PageReserved. The remaining valid pages are later
976 * sent to the buddy page allocator.
978 void __meminit reserve_bootmem_region(unsigned long start, unsigned long end)
980 unsigned long start_pfn = PFN_DOWN(start);
981 unsigned long end_pfn = PFN_UP(end);
983 for (; start_pfn < end_pfn; start_pfn++) {
984 if (pfn_valid(start_pfn)) {
985 struct page *page = pfn_to_page(start_pfn);
987 init_reserved_page(start_pfn);
989 /* Avoid false-positive PageTail() */
990 INIT_LIST_HEAD(&page->lru);
992 SetPageReserved(page);
997 static bool free_pages_prepare(struct page *page, unsigned int order)
999 bool compound = PageCompound(page);
1002 VM_BUG_ON_PAGE(PageTail(page), page);
1003 VM_BUG_ON_PAGE(compound && compound_order(page) != order, page);
1005 trace_mm_page_free(page, order);
1006 kmemcheck_free_shadow(page, order);
1007 kasan_free_pages(page, order);
1010 page->mapping = NULL;
1011 bad += free_pages_check(page);
1012 for (i = 1; i < (1 << order); i++) {
1014 bad += free_tail_pages_check(page, page + i);
1015 bad += free_pages_check(page + i);
1020 reset_page_owner(page, order);
1022 if (!PageHighMem(page)) {
1023 debug_check_no_locks_freed(page_address(page),
1024 PAGE_SIZE << order);
1025 debug_check_no_obj_freed(page_address(page),
1026 PAGE_SIZE << order);
1028 arch_free_page(page, order);
1029 kernel_poison_pages(page, 1 << order, 0);
1030 kernel_map_pages(page, 1 << order, 0);
1035 static void __free_pages_ok(struct page *page, unsigned int order)
1037 unsigned long flags;
1039 unsigned long pfn = page_to_pfn(page);
1041 if (!free_pages_prepare(page, order))
1044 migratetype = get_pfnblock_migratetype(page, pfn);
1045 local_irq_save(flags);
1046 __count_vm_events(PGFREE, 1 << order);
1047 free_one_page(page_zone(page), page, pfn, order, migratetype);
1048 local_irq_restore(flags);
1051 static void __init __free_pages_boot_core(struct page *page,
1052 unsigned long pfn, unsigned int order)
1054 unsigned int nr_pages = 1 << order;
1055 struct page *p = page;
1059 for (loop = 0; loop < (nr_pages - 1); loop++, p++) {
1061 __ClearPageReserved(p);
1062 set_page_count(p, 0);
1064 __ClearPageReserved(p);
1065 set_page_count(p, 0);
1067 page_zone(page)->managed_pages += nr_pages;
1068 set_page_refcounted(page);
1069 __free_pages(page, order);
1072 #if defined(CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID) || \
1073 defined(CONFIG_HAVE_MEMBLOCK_NODE_MAP)
1075 static struct mminit_pfnnid_cache early_pfnnid_cache __meminitdata;
1077 int __meminit early_pfn_to_nid(unsigned long pfn)
1079 static DEFINE_SPINLOCK(early_pfn_lock);
1082 spin_lock(&early_pfn_lock);
1083 nid = __early_pfn_to_nid(pfn, &early_pfnnid_cache);
1086 spin_unlock(&early_pfn_lock);
1092 #ifdef CONFIG_NODES_SPAN_OTHER_NODES
1093 static inline bool __meminit meminit_pfn_in_nid(unsigned long pfn, int node,
1094 struct mminit_pfnnid_cache *state)
1098 nid = __early_pfn_to_nid(pfn, state);
1099 if (nid >= 0 && nid != node)
1104 /* Only safe to use early in boot when initialisation is single-threaded */
1105 static inline bool __meminit early_pfn_in_nid(unsigned long pfn, int node)
1107 return meminit_pfn_in_nid(pfn, node, &early_pfnnid_cache);
1112 static inline bool __meminit early_pfn_in_nid(unsigned long pfn, int node)
1116 static inline bool __meminit meminit_pfn_in_nid(unsigned long pfn, int node,
1117 struct mminit_pfnnid_cache *state)
1124 void __init __free_pages_bootmem(struct page *page, unsigned long pfn,
1127 if (early_page_uninitialised(pfn))
1129 return __free_pages_boot_core(page, pfn, order);
1133 * Check that the whole (or subset of) a pageblock given by the interval of
1134 * [start_pfn, end_pfn) is valid and within the same zone, before scanning it
1135 * with the migration of free compaction scanner. The scanners then need to
1136 * use only pfn_valid_within() check for arches that allow holes within
1139 * Return struct page pointer of start_pfn, or NULL if checks were not passed.
1141 * It's possible on some configurations to have a setup like node0 node1 node0
1142 * i.e. it's possible that all pages within a zones range of pages do not
1143 * belong to a single zone. We assume that a border between node0 and node1
1144 * can occur within a single pageblock, but not a node0 node1 node0
1145 * interleaving within a single pageblock. It is therefore sufficient to check
1146 * the first and last page of a pageblock and avoid checking each individual
1147 * page in a pageblock.
1149 struct page *__pageblock_pfn_to_page(unsigned long start_pfn,
1150 unsigned long end_pfn, struct zone *zone)
1152 struct page *start_page;
1153 struct page *end_page;
1155 /* end_pfn is one past the range we are checking */
1158 if (!pfn_valid(start_pfn) || !pfn_valid(end_pfn))
1161 start_page = pfn_to_page(start_pfn);
1163 if (page_zone(start_page) != zone)
1166 end_page = pfn_to_page(end_pfn);
1168 /* This gives a shorter code than deriving page_zone(end_page) */
1169 if (page_zone_id(start_page) != page_zone_id(end_page))
1175 void set_zone_contiguous(struct zone *zone)
1177 unsigned long block_start_pfn = zone->zone_start_pfn;
1178 unsigned long block_end_pfn;
1180 block_end_pfn = ALIGN(block_start_pfn + 1, pageblock_nr_pages);
1181 for (; block_start_pfn < zone_end_pfn(zone);
1182 block_start_pfn = block_end_pfn,
1183 block_end_pfn += pageblock_nr_pages) {
1185 block_end_pfn = min(block_end_pfn, zone_end_pfn(zone));
1187 if (!__pageblock_pfn_to_page(block_start_pfn,
1188 block_end_pfn, zone))
1192 /* We confirm that there is no hole */
1193 zone->contiguous = true;
1196 void clear_zone_contiguous(struct zone *zone)
1198 zone->contiguous = false;
1201 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
1202 static void __init deferred_free_range(struct page *page,
1203 unsigned long pfn, int nr_pages)
1210 /* Free a large naturally-aligned chunk if possible */
1211 if (nr_pages == MAX_ORDER_NR_PAGES &&
1212 (pfn & (MAX_ORDER_NR_PAGES-1)) == 0) {
1213 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
1214 __free_pages_boot_core(page, pfn, MAX_ORDER-1);
1218 for (i = 0; i < nr_pages; i++, page++, pfn++)
1219 __free_pages_boot_core(page, pfn, 0);
1222 /* Completion tracking for deferred_init_memmap() threads */
1223 static atomic_t pgdat_init_n_undone __initdata;
1224 static __initdata DECLARE_COMPLETION(pgdat_init_all_done_comp);
1226 static inline void __init pgdat_init_report_one_done(void)
1228 if (atomic_dec_and_test(&pgdat_init_n_undone))
1229 complete(&pgdat_init_all_done_comp);
1232 /* Initialise remaining memory on a node */
1233 static int __init deferred_init_memmap(void *data)
1235 pg_data_t *pgdat = data;
1236 int nid = pgdat->node_id;
1237 struct mminit_pfnnid_cache nid_init_state = { };
1238 unsigned long start = jiffies;
1239 unsigned long nr_pages = 0;
1240 unsigned long walk_start, walk_end;
1243 unsigned long first_init_pfn = pgdat->first_deferred_pfn;
1244 const struct cpumask *cpumask = cpumask_of_node(pgdat->node_id);
1246 if (first_init_pfn == ULONG_MAX) {
1247 pgdat_init_report_one_done();
1251 /* Bind memory initialisation thread to a local node if possible */
1252 if (!cpumask_empty(cpumask))
1253 set_cpus_allowed_ptr(current, cpumask);
1255 /* Sanity check boundaries */
1256 BUG_ON(pgdat->first_deferred_pfn < pgdat->node_start_pfn);
1257 BUG_ON(pgdat->first_deferred_pfn > pgdat_end_pfn(pgdat));
1258 pgdat->first_deferred_pfn = ULONG_MAX;
1260 /* Only the highest zone is deferred so find it */
1261 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
1262 zone = pgdat->node_zones + zid;
1263 if (first_init_pfn < zone_end_pfn(zone))
1267 for_each_mem_pfn_range(i, nid, &walk_start, &walk_end, NULL) {
1268 unsigned long pfn, end_pfn;
1269 struct page *page = NULL;
1270 struct page *free_base_page = NULL;
1271 unsigned long free_base_pfn = 0;
1274 end_pfn = min(walk_end, zone_end_pfn(zone));
1275 pfn = first_init_pfn;
1276 if (pfn < walk_start)
1278 if (pfn < zone->zone_start_pfn)
1279 pfn = zone->zone_start_pfn;
1281 for (; pfn < end_pfn; pfn++) {
1282 if (!pfn_valid_within(pfn))
1286 * Ensure pfn_valid is checked every
1287 * MAX_ORDER_NR_PAGES for memory holes
1289 if ((pfn & (MAX_ORDER_NR_PAGES - 1)) == 0) {
1290 if (!pfn_valid(pfn)) {
1296 if (!meminit_pfn_in_nid(pfn, nid, &nid_init_state)) {
1301 /* Minimise pfn page lookups and scheduler checks */
1302 if (page && (pfn & (MAX_ORDER_NR_PAGES - 1)) != 0) {
1305 nr_pages += nr_to_free;
1306 deferred_free_range(free_base_page,
1307 free_base_pfn, nr_to_free);
1308 free_base_page = NULL;
1309 free_base_pfn = nr_to_free = 0;
1311 page = pfn_to_page(pfn);
1316 VM_BUG_ON(page_zone(page) != zone);
1320 __init_single_page(page, pfn, zid, nid);
1321 if (!free_base_page) {
1322 free_base_page = page;
1323 free_base_pfn = pfn;
1328 /* Where possible, batch up pages for a single free */
1331 /* Free the current block of pages to allocator */
1332 nr_pages += nr_to_free;
1333 deferred_free_range(free_base_page, free_base_pfn,
1335 free_base_page = NULL;
1336 free_base_pfn = nr_to_free = 0;
1339 first_init_pfn = max(end_pfn, first_init_pfn);
1342 /* Sanity check that the next zone really is unpopulated */
1343 WARN_ON(++zid < MAX_NR_ZONES && populated_zone(++zone));
1345 pr_info("node %d initialised, %lu pages in %ums\n", nid, nr_pages,
1346 jiffies_to_msecs(jiffies - start));
1348 pgdat_init_report_one_done();
1351 #endif /* CONFIG_DEFERRED_STRUCT_PAGE_INIT */
1353 void __init page_alloc_init_late(void)
1357 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
1360 /* There will be num_node_state(N_MEMORY) threads */
1361 atomic_set(&pgdat_init_n_undone, num_node_state(N_MEMORY));
1362 for_each_node_state(nid, N_MEMORY) {
1363 kthread_run(deferred_init_memmap, NODE_DATA(nid), "pgdatinit%d", nid);
1366 /* Block until all are initialised */
1367 wait_for_completion(&pgdat_init_all_done_comp);
1369 /* Reinit limits that are based on free pages after the kernel is up */
1370 files_maxfiles_init();
1373 for_each_populated_zone(zone)
1374 set_zone_contiguous(zone);
1378 /* Free whole pageblock and set its migration type to MIGRATE_CMA. */
1379 void __init init_cma_reserved_pageblock(struct page *page)
1381 unsigned i = pageblock_nr_pages;
1382 struct page *p = page;
1385 __ClearPageReserved(p);
1386 set_page_count(p, 0);
1389 set_pageblock_migratetype(page, MIGRATE_CMA);
1391 if (pageblock_order >= MAX_ORDER) {
1392 i = pageblock_nr_pages;
1395 set_page_refcounted(p);
1396 __free_pages(p, MAX_ORDER - 1);
1397 p += MAX_ORDER_NR_PAGES;
1398 } while (i -= MAX_ORDER_NR_PAGES);
1400 set_page_refcounted(page);
1401 __free_pages(page, pageblock_order);
1404 adjust_managed_page_count(page, pageblock_nr_pages);
1409 * The order of subdivision here is critical for the IO subsystem.
1410 * Please do not alter this order without good reasons and regression
1411 * testing. Specifically, as large blocks of memory are subdivided,
1412 * the order in which smaller blocks are delivered depends on the order
1413 * they're subdivided in this function. This is the primary factor
1414 * influencing the order in which pages are delivered to the IO
1415 * subsystem according to empirical testing, and this is also justified
1416 * by considering the behavior of a buddy system containing a single
1417 * large block of memory acted on by a series of small allocations.
1418 * This behavior is a critical factor in sglist merging's success.
1422 static inline void expand(struct zone *zone, struct page *page,
1423 int low, int high, struct free_area *area,
1426 unsigned long size = 1 << high;
1428 while (high > low) {
1432 VM_BUG_ON_PAGE(bad_range(zone, &page[size]), &page[size]);
1434 if (IS_ENABLED(CONFIG_DEBUG_PAGEALLOC) &&
1435 debug_guardpage_enabled() &&
1436 high < debug_guardpage_minorder()) {
1438 * Mark as guard pages (or page), that will allow to
1439 * merge back to allocator when buddy will be freed.
1440 * Corresponding page table entries will not be touched,
1441 * pages will stay not present in virtual address space
1443 set_page_guard(zone, &page[size], high, migratetype);
1446 list_add(&page[size].lru, &area->free_list[migratetype]);
1448 set_page_order(&page[size], high);
1453 * This page is about to be returned from the page allocator
1455 static inline int check_new_page(struct page *page)
1457 const char *bad_reason = NULL;
1458 unsigned long bad_flags = 0;
1460 if (unlikely(atomic_read(&page->_mapcount) != -1))
1461 bad_reason = "nonzero mapcount";
1462 if (unlikely(page->mapping != NULL))
1463 bad_reason = "non-NULL mapping";
1464 if (unlikely(atomic_read(&page->_count) != 0))
1465 bad_reason = "nonzero _count";
1466 if (unlikely(page->flags & __PG_HWPOISON)) {
1467 bad_reason = "HWPoisoned (hardware-corrupted)";
1468 bad_flags = __PG_HWPOISON;
1470 if (unlikely(page->flags & PAGE_FLAGS_CHECK_AT_PREP)) {
1471 bad_reason = "PAGE_FLAGS_CHECK_AT_PREP flag set";
1472 bad_flags = PAGE_FLAGS_CHECK_AT_PREP;
1475 if (unlikely(page->mem_cgroup))
1476 bad_reason = "page still charged to cgroup";
1478 if (unlikely(bad_reason)) {
1479 bad_page(page, bad_reason, bad_flags);
1485 static inline bool should_zero(void)
1487 return !IS_ENABLED(CONFIG_PAGE_POISONING_ZERO) ||
1488 !page_poisoning_enabled();
1491 static int prep_new_page(struct page *page, unsigned int order, gfp_t gfp_flags,
1496 for (i = 0; i < (1 << order); i++) {
1497 struct page *p = page + i;
1498 if (unlikely(check_new_page(p)))
1502 set_page_private(page, 0);
1503 set_page_refcounted(page);
1505 arch_alloc_page(page, order);
1506 kernel_poison_pages(page, 1 << order, 1);
1507 kernel_map_pages(page, 1 << order, 1);
1508 kasan_alloc_pages(page, order);
1510 if (should_zero() && gfp_flags & __GFP_ZERO)
1511 for (i = 0; i < (1 << order); i++)
1512 clear_highpage(page + i);
1514 if (order && (gfp_flags & __GFP_COMP))
1515 prep_compound_page(page, order);
1517 set_page_owner(page, order, gfp_flags);
1520 * page is set pfmemalloc when ALLOC_NO_WATERMARKS was necessary to
1521 * allocate the page. The expectation is that the caller is taking
1522 * steps that will free more memory. The caller should avoid the page
1523 * being used for !PFMEMALLOC purposes.
1525 if (alloc_flags & ALLOC_NO_WATERMARKS)
1526 set_page_pfmemalloc(page);
1528 clear_page_pfmemalloc(page);
1534 * Go through the free lists for the given migratetype and remove
1535 * the smallest available page from the freelists
1538 struct page *__rmqueue_smallest(struct zone *zone, unsigned int order,
1541 unsigned int current_order;
1542 struct free_area *area;
1545 /* Find a page of the appropriate size in the preferred list */
1546 for (current_order = order; current_order < MAX_ORDER; ++current_order) {
1547 area = &(zone->free_area[current_order]);
1548 page = list_first_entry_or_null(&area->free_list[migratetype],
1552 list_del(&page->lru);
1553 rmv_page_order(page);
1555 expand(zone, page, order, current_order, area, migratetype);
1556 set_pcppage_migratetype(page, migratetype);
1565 * This array describes the order lists are fallen back to when
1566 * the free lists for the desirable migrate type are depleted
1568 static int fallbacks[MIGRATE_TYPES][4] = {
1569 [MIGRATE_UNMOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_MOVABLE, MIGRATE_TYPES },
1570 [MIGRATE_RECLAIMABLE] = { MIGRATE_UNMOVABLE, MIGRATE_MOVABLE, MIGRATE_TYPES },
1571 [MIGRATE_MOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_UNMOVABLE, MIGRATE_TYPES },
1573 [MIGRATE_CMA] = { MIGRATE_TYPES }, /* Never used */
1575 #ifdef CONFIG_MEMORY_ISOLATION
1576 [MIGRATE_ISOLATE] = { MIGRATE_TYPES }, /* Never used */
1581 static struct page *__rmqueue_cma_fallback(struct zone *zone,
1584 return __rmqueue_smallest(zone, order, MIGRATE_CMA);
1587 static inline struct page *__rmqueue_cma_fallback(struct zone *zone,
1588 unsigned int order) { return NULL; }
1592 * Move the free pages in a range to the free lists of the requested type.
1593 * Note that start_page and end_pages are not aligned on a pageblock
1594 * boundary. If alignment is required, use move_freepages_block()
1596 int move_freepages(struct zone *zone,
1597 struct page *start_page, struct page *end_page,
1602 int pages_moved = 0;
1604 #ifndef CONFIG_HOLES_IN_ZONE
1606 * page_zone is not safe to call in this context when
1607 * CONFIG_HOLES_IN_ZONE is set. This bug check is probably redundant
1608 * anyway as we check zone boundaries in move_freepages_block().
1609 * Remove at a later date when no bug reports exist related to
1610 * grouping pages by mobility
1612 VM_BUG_ON(page_zone(start_page) != page_zone(end_page));
1615 for (page = start_page; page <= end_page;) {
1616 /* Make sure we are not inadvertently changing nodes */
1617 VM_BUG_ON_PAGE(page_to_nid(page) != zone_to_nid(zone), page);
1619 if (!pfn_valid_within(page_to_pfn(page))) {
1624 if (!PageBuddy(page)) {
1629 order = page_order(page);
1630 list_move(&page->lru,
1631 &zone->free_area[order].free_list[migratetype]);
1633 pages_moved += 1 << order;
1639 int move_freepages_block(struct zone *zone, struct page *page,
1642 unsigned long start_pfn, end_pfn;
1643 struct page *start_page, *end_page;
1645 start_pfn = page_to_pfn(page);
1646 start_pfn = start_pfn & ~(pageblock_nr_pages-1);
1647 start_page = pfn_to_page(start_pfn);
1648 end_page = start_page + pageblock_nr_pages - 1;
1649 end_pfn = start_pfn + pageblock_nr_pages - 1;
1651 /* Do not cross zone boundaries */
1652 if (!zone_spans_pfn(zone, start_pfn))
1654 if (!zone_spans_pfn(zone, end_pfn))
1657 return move_freepages(zone, start_page, end_page, migratetype);
1660 static void change_pageblock_range(struct page *pageblock_page,
1661 int start_order, int migratetype)
1663 int nr_pageblocks = 1 << (start_order - pageblock_order);
1665 while (nr_pageblocks--) {
1666 set_pageblock_migratetype(pageblock_page, migratetype);
1667 pageblock_page += pageblock_nr_pages;
1672 * When we are falling back to another migratetype during allocation, try to
1673 * steal extra free pages from the same pageblocks to satisfy further
1674 * allocations, instead of polluting multiple pageblocks.
1676 * If we are stealing a relatively large buddy page, it is likely there will
1677 * be more free pages in the pageblock, so try to steal them all. For
1678 * reclaimable and unmovable allocations, we steal regardless of page size,
1679 * as fragmentation caused by those allocations polluting movable pageblocks
1680 * is worse than movable allocations stealing from unmovable and reclaimable
1683 static bool can_steal_fallback(unsigned int order, int start_mt)
1686 * Leaving this order check is intended, although there is
1687 * relaxed order check in next check. The reason is that
1688 * we can actually steal whole pageblock if this condition met,
1689 * but, below check doesn't guarantee it and that is just heuristic
1690 * so could be changed anytime.
1692 if (order >= pageblock_order)
1695 if (order >= pageblock_order / 2 ||
1696 start_mt == MIGRATE_RECLAIMABLE ||
1697 start_mt == MIGRATE_UNMOVABLE ||
1698 page_group_by_mobility_disabled)
1705 * This function implements actual steal behaviour. If order is large enough,
1706 * we can steal whole pageblock. If not, we first move freepages in this
1707 * pageblock and check whether half of pages are moved or not. If half of
1708 * pages are moved, we can change migratetype of pageblock and permanently
1709 * use it's pages as requested migratetype in the future.
1711 static void steal_suitable_fallback(struct zone *zone, struct page *page,
1714 unsigned int current_order = page_order(page);
1717 /* Take ownership for orders >= pageblock_order */
1718 if (current_order >= pageblock_order) {
1719 change_pageblock_range(page, current_order, start_type);
1723 pages = move_freepages_block(zone, page, start_type);
1725 /* Claim the whole block if over half of it is free */
1726 if (pages >= (1 << (pageblock_order-1)) ||
1727 page_group_by_mobility_disabled)
1728 set_pageblock_migratetype(page, start_type);
1732 * Check whether there is a suitable fallback freepage with requested order.
1733 * If only_stealable is true, this function returns fallback_mt only if
1734 * we can steal other freepages all together. This would help to reduce
1735 * fragmentation due to mixed migratetype pages in one pageblock.
1737 int find_suitable_fallback(struct free_area *area, unsigned int order,
1738 int migratetype, bool only_stealable, bool *can_steal)
1743 if (area->nr_free == 0)
1748 fallback_mt = fallbacks[migratetype][i];
1749 if (fallback_mt == MIGRATE_TYPES)
1752 if (list_empty(&area->free_list[fallback_mt]))
1755 if (can_steal_fallback(order, migratetype))
1758 if (!only_stealable)
1769 * Reserve a pageblock for exclusive use of high-order atomic allocations if
1770 * there are no empty page blocks that contain a page with a suitable order
1772 static void reserve_highatomic_pageblock(struct page *page, struct zone *zone,
1773 unsigned int alloc_order)
1776 unsigned long max_managed, flags;
1779 * Limit the number reserved to 1 pageblock or roughly 1% of a zone.
1780 * Check is race-prone but harmless.
1782 max_managed = (zone->managed_pages / 100) + pageblock_nr_pages;
1783 if (zone->nr_reserved_highatomic >= max_managed)
1786 spin_lock_irqsave(&zone->lock, flags);
1788 /* Recheck the nr_reserved_highatomic limit under the lock */
1789 if (zone->nr_reserved_highatomic >= max_managed)
1793 mt = get_pageblock_migratetype(page);
1794 if (mt != MIGRATE_HIGHATOMIC &&
1795 !is_migrate_isolate(mt) && !is_migrate_cma(mt)) {
1796 zone->nr_reserved_highatomic += pageblock_nr_pages;
1797 set_pageblock_migratetype(page, MIGRATE_HIGHATOMIC);
1798 move_freepages_block(zone, page, MIGRATE_HIGHATOMIC);
1802 spin_unlock_irqrestore(&zone->lock, flags);
1806 * Used when an allocation is about to fail under memory pressure. This
1807 * potentially hurts the reliability of high-order allocations when under
1808 * intense memory pressure but failed atomic allocations should be easier
1809 * to recover from than an OOM.
1811 static void unreserve_highatomic_pageblock(const struct alloc_context *ac)
1813 struct zonelist *zonelist = ac->zonelist;
1814 unsigned long flags;
1820 for_each_zone_zonelist_nodemask(zone, z, zonelist, ac->high_zoneidx,
1822 /* Preserve at least one pageblock */
1823 if (zone->nr_reserved_highatomic <= pageblock_nr_pages)
1826 spin_lock_irqsave(&zone->lock, flags);
1827 for (order = 0; order < MAX_ORDER; order++) {
1828 struct free_area *area = &(zone->free_area[order]);
1830 page = list_first_entry_or_null(
1831 &area->free_list[MIGRATE_HIGHATOMIC],
1837 * It should never happen but changes to locking could
1838 * inadvertently allow a per-cpu drain to add pages
1839 * to MIGRATE_HIGHATOMIC while unreserving so be safe
1840 * and watch for underflows.
1842 zone->nr_reserved_highatomic -= min(pageblock_nr_pages,
1843 zone->nr_reserved_highatomic);
1846 * Convert to ac->migratetype and avoid the normal
1847 * pageblock stealing heuristics. Minimally, the caller
1848 * is doing the work and needs the pages. More
1849 * importantly, if the block was always converted to
1850 * MIGRATE_UNMOVABLE or another type then the number
1851 * of pageblocks that cannot be completely freed
1854 set_pageblock_migratetype(page, ac->migratetype);
1855 move_freepages_block(zone, page, ac->migratetype);
1856 spin_unlock_irqrestore(&zone->lock, flags);
1859 spin_unlock_irqrestore(&zone->lock, flags);
1863 /* Remove an element from the buddy allocator from the fallback list */
1864 static inline struct page *
1865 __rmqueue_fallback(struct zone *zone, unsigned int order, int start_migratetype)
1867 struct free_area *area;
1868 unsigned int current_order;
1873 /* Find the largest possible block of pages in the other list */
1874 for (current_order = MAX_ORDER-1;
1875 current_order >= order && current_order <= MAX_ORDER-1;
1877 area = &(zone->free_area[current_order]);
1878 fallback_mt = find_suitable_fallback(area, current_order,
1879 start_migratetype, false, &can_steal);
1880 if (fallback_mt == -1)
1883 page = list_first_entry(&area->free_list[fallback_mt],
1886 steal_suitable_fallback(zone, page, start_migratetype);
1888 /* Remove the page from the freelists */
1890 list_del(&page->lru);
1891 rmv_page_order(page);
1893 expand(zone, page, order, current_order, area,
1896 * The pcppage_migratetype may differ from pageblock's
1897 * migratetype depending on the decisions in
1898 * find_suitable_fallback(). This is OK as long as it does not
1899 * differ for MIGRATE_CMA pageblocks. Those can be used as
1900 * fallback only via special __rmqueue_cma_fallback() function
1902 set_pcppage_migratetype(page, start_migratetype);
1904 trace_mm_page_alloc_extfrag(page, order, current_order,
1905 start_migratetype, fallback_mt);
1914 * Do the hard work of removing an element from the buddy allocator.
1915 * Call me with the zone->lock already held.
1917 static struct page *__rmqueue(struct zone *zone, unsigned int order,
1922 page = __rmqueue_smallest(zone, order, migratetype);
1923 if (unlikely(!page)) {
1924 if (migratetype == MIGRATE_MOVABLE)
1925 page = __rmqueue_cma_fallback(zone, order);
1928 page = __rmqueue_fallback(zone, order, migratetype);
1931 trace_mm_page_alloc_zone_locked(page, order, migratetype);
1936 * Obtain a specified number of elements from the buddy allocator, all under
1937 * a single hold of the lock, for efficiency. Add them to the supplied list.
1938 * Returns the number of new pages which were placed at *list.
1940 static int rmqueue_bulk(struct zone *zone, unsigned int order,
1941 unsigned long count, struct list_head *list,
1942 int migratetype, bool cold)
1946 spin_lock(&zone->lock);
1947 for (i = 0; i < count; ++i) {
1948 struct page *page = __rmqueue(zone, order, migratetype);
1949 if (unlikely(page == NULL))
1953 * Split buddy pages returned by expand() are received here
1954 * in physical page order. The page is added to the callers and
1955 * list and the list head then moves forward. From the callers
1956 * perspective, the linked list is ordered by page number in
1957 * some conditions. This is useful for IO devices that can
1958 * merge IO requests if the physical pages are ordered
1962 list_add(&page->lru, list);
1964 list_add_tail(&page->lru, list);
1966 if (is_migrate_cma(get_pcppage_migratetype(page)))
1967 __mod_zone_page_state(zone, NR_FREE_CMA_PAGES,
1970 __mod_zone_page_state(zone, NR_FREE_PAGES, -(i << order));
1971 spin_unlock(&zone->lock);
1977 * Called from the vmstat counter updater to drain pagesets of this
1978 * currently executing processor on remote nodes after they have
1981 * Note that this function must be called with the thread pinned to
1982 * a single processor.
1984 void drain_zone_pages(struct zone *zone, struct per_cpu_pages *pcp)
1986 unsigned long flags;
1987 int to_drain, batch;
1989 local_irq_save(flags);
1990 batch = READ_ONCE(pcp->batch);
1991 to_drain = min(pcp->count, batch);
1993 free_pcppages_bulk(zone, to_drain, pcp);
1994 pcp->count -= to_drain;
1996 local_irq_restore(flags);
2001 * Drain pcplists of the indicated processor and zone.
2003 * The processor must either be the current processor and the
2004 * thread pinned to the current processor or a processor that
2007 static void drain_pages_zone(unsigned int cpu, struct zone *zone)
2009 unsigned long flags;
2010 struct per_cpu_pageset *pset;
2011 struct per_cpu_pages *pcp;
2013 local_irq_save(flags);
2014 pset = per_cpu_ptr(zone->pageset, cpu);
2018 free_pcppages_bulk(zone, pcp->count, pcp);
2021 local_irq_restore(flags);
2025 * Drain pcplists of all zones on the indicated processor.
2027 * The processor must either be the current processor and the
2028 * thread pinned to the current processor or a processor that
2031 static void drain_pages(unsigned int cpu)
2035 for_each_populated_zone(zone) {
2036 drain_pages_zone(cpu, zone);
2041 * Spill all of this CPU's per-cpu pages back into the buddy allocator.
2043 * The CPU has to be pinned. When zone parameter is non-NULL, spill just
2044 * the single zone's pages.
2046 void drain_local_pages(struct zone *zone)
2048 int cpu = smp_processor_id();
2051 drain_pages_zone(cpu, zone);
2057 * Spill all the per-cpu pages from all CPUs back into the buddy allocator.
2059 * When zone parameter is non-NULL, spill just the single zone's pages.
2061 * Note that this code is protected against sending an IPI to an offline
2062 * CPU but does not guarantee sending an IPI to newly hotplugged CPUs:
2063 * on_each_cpu_mask() blocks hotplug and won't talk to offlined CPUs but
2064 * nothing keeps CPUs from showing up after we populated the cpumask and
2065 * before the call to on_each_cpu_mask().
2067 void drain_all_pages(struct zone *zone)
2072 * Allocate in the BSS so we wont require allocation in
2073 * direct reclaim path for CONFIG_CPUMASK_OFFSTACK=y
2075 static cpumask_t cpus_with_pcps;
2078 * We don't care about racing with CPU hotplug event
2079 * as offline notification will cause the notified
2080 * cpu to drain that CPU pcps and on_each_cpu_mask
2081 * disables preemption as part of its processing
2083 for_each_online_cpu(cpu) {
2084 struct per_cpu_pageset *pcp;
2086 bool has_pcps = false;
2089 pcp = per_cpu_ptr(zone->pageset, cpu);
2093 for_each_populated_zone(z) {
2094 pcp = per_cpu_ptr(z->pageset, cpu);
2095 if (pcp->pcp.count) {
2103 cpumask_set_cpu(cpu, &cpus_with_pcps);
2105 cpumask_clear_cpu(cpu, &cpus_with_pcps);
2107 on_each_cpu_mask(&cpus_with_pcps, (smp_call_func_t) drain_local_pages,
2111 #ifdef CONFIG_HIBERNATION
2113 void mark_free_pages(struct zone *zone)
2115 unsigned long pfn, max_zone_pfn;
2116 unsigned long flags;
2117 unsigned int order, t;
2120 if (zone_is_empty(zone))
2123 spin_lock_irqsave(&zone->lock, flags);
2125 max_zone_pfn = zone_end_pfn(zone);
2126 for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
2127 if (pfn_valid(pfn)) {
2128 page = pfn_to_page(pfn);
2129 if (!swsusp_page_is_forbidden(page))
2130 swsusp_unset_page_free(page);
2133 for_each_migratetype_order(order, t) {
2134 list_for_each_entry(page,
2135 &zone->free_area[order].free_list[t], lru) {
2138 pfn = page_to_pfn(page);
2139 for (i = 0; i < (1UL << order); i++)
2140 swsusp_set_page_free(pfn_to_page(pfn + i));
2143 spin_unlock_irqrestore(&zone->lock, flags);
2145 #endif /* CONFIG_PM */
2148 * Free a 0-order page
2149 * cold == true ? free a cold page : free a hot page
2151 void free_hot_cold_page(struct page *page, bool cold)
2153 struct zone *zone = page_zone(page);
2154 struct per_cpu_pages *pcp;
2155 unsigned long flags;
2156 unsigned long pfn = page_to_pfn(page);
2159 if (!free_pages_prepare(page, 0))
2162 migratetype = get_pfnblock_migratetype(page, pfn);
2163 set_pcppage_migratetype(page, migratetype);
2164 local_irq_save(flags);
2165 __count_vm_event(PGFREE);
2168 * We only track unmovable, reclaimable and movable on pcp lists.
2169 * Free ISOLATE pages back to the allocator because they are being
2170 * offlined but treat RESERVE as movable pages so we can get those
2171 * areas back if necessary. Otherwise, we may have to free
2172 * excessively into the page allocator
2174 if (migratetype >= MIGRATE_PCPTYPES) {
2175 if (unlikely(is_migrate_isolate(migratetype))) {
2176 free_one_page(zone, page, pfn, 0, migratetype);
2179 migratetype = MIGRATE_MOVABLE;
2182 pcp = &this_cpu_ptr(zone->pageset)->pcp;
2184 list_add(&page->lru, &pcp->lists[migratetype]);
2186 list_add_tail(&page->lru, &pcp->lists[migratetype]);
2188 if (pcp->count >= pcp->high) {
2189 unsigned long batch = READ_ONCE(pcp->batch);
2190 free_pcppages_bulk(zone, batch, pcp);
2191 pcp->count -= batch;
2195 local_irq_restore(flags);
2199 * Free a list of 0-order pages
2201 void free_hot_cold_page_list(struct list_head *list, bool cold)
2203 struct page *page, *next;
2205 list_for_each_entry_safe(page, next, list, lru) {
2206 trace_mm_page_free_batched(page, cold);
2207 free_hot_cold_page(page, cold);
2212 * split_page takes a non-compound higher-order page, and splits it into
2213 * n (1<<order) sub-pages: page[0..n]
2214 * Each sub-page must be freed individually.
2216 * Note: this is probably too low level an operation for use in drivers.
2217 * Please consult with lkml before using this in your driver.
2219 void split_page(struct page *page, unsigned int order)
2224 VM_BUG_ON_PAGE(PageCompound(page), page);
2225 VM_BUG_ON_PAGE(!page_count(page), page);
2227 #ifdef CONFIG_KMEMCHECK
2229 * Split shadow pages too, because free(page[0]) would
2230 * otherwise free the whole shadow.
2232 if (kmemcheck_page_is_tracked(page))
2233 split_page(virt_to_page(page[0].shadow), order);
2236 gfp_mask = get_page_owner_gfp(page);
2237 set_page_owner(page, 0, gfp_mask);
2238 for (i = 1; i < (1 << order); i++) {
2239 set_page_refcounted(page + i);
2240 set_page_owner(page + i, 0, gfp_mask);
2243 EXPORT_SYMBOL_GPL(split_page);
2245 int __isolate_free_page(struct page *page, unsigned int order)
2247 unsigned long watermark;
2251 BUG_ON(!PageBuddy(page));
2253 zone = page_zone(page);
2254 mt = get_pageblock_migratetype(page);
2256 if (!is_migrate_isolate(mt)) {
2257 /* Obey watermarks as if the page was being allocated */
2258 watermark = low_wmark_pages(zone) + (1 << order);
2259 if (!zone_watermark_ok(zone, 0, watermark, 0, 0))
2262 __mod_zone_freepage_state(zone, -(1UL << order), mt);
2265 /* Remove page from free list */
2266 list_del(&page->lru);
2267 zone->free_area[order].nr_free--;
2268 rmv_page_order(page);
2270 set_page_owner(page, order, __GFP_MOVABLE);
2272 /* Set the pageblock if the isolated page is at least a pageblock */
2273 if (order >= pageblock_order - 1) {
2274 struct page *endpage = page + (1 << order) - 1;
2275 for (; page < endpage; page += pageblock_nr_pages) {
2276 int mt = get_pageblock_migratetype(page);
2277 if (!is_migrate_isolate(mt) && !is_migrate_cma(mt))
2278 set_pageblock_migratetype(page,
2284 return 1UL << order;
2288 * Similar to split_page except the page is already free. As this is only
2289 * being used for migration, the migratetype of the block also changes.
2290 * As this is called with interrupts disabled, the caller is responsible
2291 * for calling arch_alloc_page() and kernel_map_page() after interrupts
2294 * Note: this is probably too low level an operation for use in drivers.
2295 * Please consult with lkml before using this in your driver.
2297 int split_free_page(struct page *page)
2302 order = page_order(page);
2304 nr_pages = __isolate_free_page(page, order);
2308 /* Split into individual pages */
2309 set_page_refcounted(page);
2310 split_page(page, order);
2315 * Allocate a page from the given zone. Use pcplists for order-0 allocations.
2318 struct page *buffered_rmqueue(struct zone *preferred_zone,
2319 struct zone *zone, unsigned int order,
2320 gfp_t gfp_flags, int alloc_flags, int migratetype)
2322 unsigned long flags;
2324 bool cold = ((gfp_flags & __GFP_COLD) != 0);
2326 if (likely(order == 0)) {
2327 struct per_cpu_pages *pcp;
2328 struct list_head *list;
2330 local_irq_save(flags);
2331 pcp = &this_cpu_ptr(zone->pageset)->pcp;
2332 list = &pcp->lists[migratetype];
2333 if (list_empty(list)) {
2334 pcp->count += rmqueue_bulk(zone, 0,
2337 if (unlikely(list_empty(list)))
2342 page = list_last_entry(list, struct page, lru);
2344 page = list_first_entry(list, struct page, lru);
2346 list_del(&page->lru);
2349 if (unlikely(gfp_flags & __GFP_NOFAIL)) {
2351 * __GFP_NOFAIL is not to be used in new code.
2353 * All __GFP_NOFAIL callers should be fixed so that they
2354 * properly detect and handle allocation failures.
2356 * We most definitely don't want callers attempting to
2357 * allocate greater than order-1 page units with
2360 WARN_ON_ONCE(order > 1);
2362 spin_lock_irqsave(&zone->lock, flags);
2365 if (alloc_flags & ALLOC_HARDER) {
2366 page = __rmqueue_smallest(zone, order, MIGRATE_HIGHATOMIC);
2368 trace_mm_page_alloc_zone_locked(page, order, migratetype);
2371 page = __rmqueue(zone, order, migratetype);
2372 spin_unlock(&zone->lock);
2375 __mod_zone_freepage_state(zone, -(1 << order),
2376 get_pcppage_migratetype(page));
2379 __mod_zone_page_state(zone, NR_ALLOC_BATCH, -(1 << order));
2380 if (atomic_long_read(&zone->vm_stat[NR_ALLOC_BATCH]) <= 0 &&
2381 !test_bit(ZONE_FAIR_DEPLETED, &zone->flags))
2382 set_bit(ZONE_FAIR_DEPLETED, &zone->flags);
2384 __count_zone_vm_events(PGALLOC, zone, 1 << order);
2385 zone_statistics(preferred_zone, zone, gfp_flags);
2386 local_irq_restore(flags);
2388 VM_BUG_ON_PAGE(bad_range(zone, page), page);
2392 local_irq_restore(flags);
2396 #ifdef CONFIG_FAIL_PAGE_ALLOC
2399 struct fault_attr attr;
2401 bool ignore_gfp_highmem;
2402 bool ignore_gfp_reclaim;
2404 } fail_page_alloc = {
2405 .attr = FAULT_ATTR_INITIALIZER,
2406 .ignore_gfp_reclaim = true,
2407 .ignore_gfp_highmem = true,
2411 static int __init setup_fail_page_alloc(char *str)
2413 return setup_fault_attr(&fail_page_alloc.attr, str);
2415 __setup("fail_page_alloc=", setup_fail_page_alloc);
2417 static bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
2419 if (order < fail_page_alloc.min_order)
2421 if (gfp_mask & __GFP_NOFAIL)
2423 if (fail_page_alloc.ignore_gfp_highmem && (gfp_mask & __GFP_HIGHMEM))
2425 if (fail_page_alloc.ignore_gfp_reclaim &&
2426 (gfp_mask & __GFP_DIRECT_RECLAIM))
2429 return should_fail(&fail_page_alloc.attr, 1 << order);
2432 #ifdef CONFIG_FAULT_INJECTION_DEBUG_FS
2434 static int __init fail_page_alloc_debugfs(void)
2436 umode_t mode = S_IFREG | S_IRUSR | S_IWUSR;
2439 dir = fault_create_debugfs_attr("fail_page_alloc", NULL,
2440 &fail_page_alloc.attr);
2442 return PTR_ERR(dir);
2444 if (!debugfs_create_bool("ignore-gfp-wait", mode, dir,
2445 &fail_page_alloc.ignore_gfp_reclaim))
2447 if (!debugfs_create_bool("ignore-gfp-highmem", mode, dir,
2448 &fail_page_alloc.ignore_gfp_highmem))
2450 if (!debugfs_create_u32("min-order", mode, dir,
2451 &fail_page_alloc.min_order))
2456 debugfs_remove_recursive(dir);
2461 late_initcall(fail_page_alloc_debugfs);
2463 #endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */
2465 #else /* CONFIG_FAIL_PAGE_ALLOC */
2467 static inline bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
2472 #endif /* CONFIG_FAIL_PAGE_ALLOC */
2475 * Return true if free base pages are above 'mark'. For high-order checks it
2476 * will return true of the order-0 watermark is reached and there is at least
2477 * one free page of a suitable size. Checking now avoids taking the zone lock
2478 * to check in the allocation paths if no pages are free.
2480 static bool __zone_watermark_ok(struct zone *z, unsigned int order,
2481 unsigned long mark, int classzone_idx, int alloc_flags,
2486 const int alloc_harder = (alloc_flags & ALLOC_HARDER);
2488 /* free_pages may go negative - that's OK */
2489 free_pages -= (1 << order) - 1;
2491 if (alloc_flags & ALLOC_HIGH)
2495 * If the caller does not have rights to ALLOC_HARDER then subtract
2496 * the high-atomic reserves. This will over-estimate the size of the
2497 * atomic reserve but it avoids a search.
2499 if (likely(!alloc_harder))
2500 free_pages -= z->nr_reserved_highatomic;
2505 /* If allocation can't use CMA areas don't use free CMA pages */
2506 if (!(alloc_flags & ALLOC_CMA))
2507 free_pages -= zone_page_state(z, NR_FREE_CMA_PAGES);
2511 * Check watermarks for an order-0 allocation request. If these
2512 * are not met, then a high-order request also cannot go ahead
2513 * even if a suitable page happened to be free.
2515 if (free_pages <= min + z->lowmem_reserve[classzone_idx])
2518 /* If this is an order-0 request then the watermark is fine */
2522 /* For a high-order request, check at least one suitable page is free */
2523 for (o = order; o < MAX_ORDER; o++) {
2524 struct free_area *area = &z->free_area[o];
2533 for (mt = 0; mt < MIGRATE_PCPTYPES; mt++) {
2534 if (!list_empty(&area->free_list[mt]))
2539 if ((alloc_flags & ALLOC_CMA) &&
2540 !list_empty(&area->free_list[MIGRATE_CMA])) {
2548 bool zone_watermark_ok(struct zone *z, unsigned int order, unsigned long mark,
2549 int classzone_idx, int alloc_flags)
2551 return __zone_watermark_ok(z, order, mark, classzone_idx, alloc_flags,
2552 zone_page_state(z, NR_FREE_PAGES));
2555 bool zone_watermark_ok_safe(struct zone *z, unsigned int order,
2556 unsigned long mark, int classzone_idx)
2558 long free_pages = zone_page_state(z, NR_FREE_PAGES);
2560 if (z->percpu_drift_mark && free_pages < z->percpu_drift_mark)
2561 free_pages = zone_page_state_snapshot(z, NR_FREE_PAGES);
2563 return __zone_watermark_ok(z, order, mark, classzone_idx, 0,
2568 static bool zone_local(struct zone *local_zone, struct zone *zone)
2570 return local_zone->node == zone->node;
2573 static bool zone_allows_reclaim(struct zone *local_zone, struct zone *zone)
2575 return node_distance(zone_to_nid(local_zone), zone_to_nid(zone)) <
2578 #else /* CONFIG_NUMA */
2579 static bool zone_local(struct zone *local_zone, struct zone *zone)
2584 static bool zone_allows_reclaim(struct zone *local_zone, struct zone *zone)
2588 #endif /* CONFIG_NUMA */
2590 static void reset_alloc_batches(struct zone *preferred_zone)
2592 struct zone *zone = preferred_zone->zone_pgdat->node_zones;
2595 mod_zone_page_state(zone, NR_ALLOC_BATCH,
2596 high_wmark_pages(zone) - low_wmark_pages(zone) -
2597 atomic_long_read(&zone->vm_stat[NR_ALLOC_BATCH]));
2598 clear_bit(ZONE_FAIR_DEPLETED, &zone->flags);
2599 } while (zone++ != preferred_zone);
2603 * get_page_from_freelist goes through the zonelist trying to allocate
2606 static struct page *
2607 get_page_from_freelist(gfp_t gfp_mask, unsigned int order, int alloc_flags,
2608 const struct alloc_context *ac)
2610 struct zonelist *zonelist = ac->zonelist;
2612 struct page *page = NULL;
2614 int nr_fair_skipped = 0;
2615 bool zonelist_rescan;
2618 zonelist_rescan = false;
2621 * Scan zonelist, looking for a zone with enough free.
2622 * See also __cpuset_node_allowed() comment in kernel/cpuset.c.
2624 for_each_zone_zonelist_nodemask(zone, z, zonelist, ac->high_zoneidx,
2628 if (cpusets_enabled() &&
2629 (alloc_flags & ALLOC_CPUSET) &&
2630 !cpuset_zone_allowed(zone, gfp_mask))
2633 * Distribute pages in proportion to the individual
2634 * zone size to ensure fair page aging. The zone a
2635 * page was allocated in should have no effect on the
2636 * time the page has in memory before being reclaimed.
2638 if (alloc_flags & ALLOC_FAIR) {
2639 if (!zone_local(ac->preferred_zone, zone))
2641 if (test_bit(ZONE_FAIR_DEPLETED, &zone->flags)) {
2647 * When allocating a page cache page for writing, we
2648 * want to get it from a zone that is within its dirty
2649 * limit, such that no single zone holds more than its
2650 * proportional share of globally allowed dirty pages.
2651 * The dirty limits take into account the zone's
2652 * lowmem reserves and high watermark so that kswapd
2653 * should be able to balance it without having to
2654 * write pages from its LRU list.
2656 * This may look like it could increase pressure on
2657 * lower zones by failing allocations in higher zones
2658 * before they are full. But the pages that do spill
2659 * over are limited as the lower zones are protected
2660 * by this very same mechanism. It should not become
2661 * a practical burden to them.
2663 * XXX: For now, allow allocations to potentially
2664 * exceed the per-zone dirty limit in the slowpath
2665 * (spread_dirty_pages unset) before going into reclaim,
2666 * which is important when on a NUMA setup the allowed
2667 * zones are together not big enough to reach the
2668 * global limit. The proper fix for these situations
2669 * will require awareness of zones in the
2670 * dirty-throttling and the flusher threads.
2672 if (ac->spread_dirty_pages && !zone_dirty_ok(zone))
2675 mark = zone->watermark[alloc_flags & ALLOC_WMARK_MASK];
2676 if (!zone_watermark_ok(zone, order, mark,
2677 ac->classzone_idx, alloc_flags)) {
2680 /* Checked here to keep the fast path fast */
2681 BUILD_BUG_ON(ALLOC_NO_WATERMARKS < NR_WMARK);
2682 if (alloc_flags & ALLOC_NO_WATERMARKS)
2685 if (zone_reclaim_mode == 0 ||
2686 !zone_allows_reclaim(ac->preferred_zone, zone))
2689 ret = zone_reclaim(zone, gfp_mask, order);
2691 case ZONE_RECLAIM_NOSCAN:
2694 case ZONE_RECLAIM_FULL:
2695 /* scanned but unreclaimable */
2698 /* did we reclaim enough */
2699 if (zone_watermark_ok(zone, order, mark,
2700 ac->classzone_idx, alloc_flags))
2708 page = buffered_rmqueue(ac->preferred_zone, zone, order,
2709 gfp_mask, alloc_flags, ac->migratetype);
2711 if (prep_new_page(page, order, gfp_mask, alloc_flags))
2715 * If this is a high-order atomic allocation then check
2716 * if the pageblock should be reserved for the future
2718 if (unlikely(order && (alloc_flags & ALLOC_HARDER)))
2719 reserve_highatomic_pageblock(page, zone, order);
2726 * The first pass makes sure allocations are spread fairly within the
2727 * local node. However, the local node might have free pages left
2728 * after the fairness batches are exhausted, and remote zones haven't
2729 * even been considered yet. Try once more without fairness, and
2730 * include remote zones now, before entering the slowpath and waking
2731 * kswapd: prefer spilling to a remote zone over swapping locally.
2733 if (alloc_flags & ALLOC_FAIR) {
2734 alloc_flags &= ~ALLOC_FAIR;
2735 if (nr_fair_skipped) {
2736 zonelist_rescan = true;
2737 reset_alloc_batches(ac->preferred_zone);
2739 if (nr_online_nodes > 1)
2740 zonelist_rescan = true;
2743 if (zonelist_rescan)
2750 * Large machines with many possible nodes should not always dump per-node
2751 * meminfo in irq context.
2753 static inline bool should_suppress_show_mem(void)
2758 ret = in_interrupt();
2763 static DEFINE_RATELIMIT_STATE(nopage_rs,
2764 DEFAULT_RATELIMIT_INTERVAL,
2765 DEFAULT_RATELIMIT_BURST);
2767 void warn_alloc_failed(gfp_t gfp_mask, unsigned int order, const char *fmt, ...)
2769 unsigned int filter = SHOW_MEM_FILTER_NODES;
2771 if ((gfp_mask & __GFP_NOWARN) || !__ratelimit(&nopage_rs) ||
2772 debug_guardpage_minorder() > 0)
2776 * This documents exceptions given to allocations in certain
2777 * contexts that are allowed to allocate outside current's set
2780 if (!(gfp_mask & __GFP_NOMEMALLOC))
2781 if (test_thread_flag(TIF_MEMDIE) ||
2782 (current->flags & (PF_MEMALLOC | PF_EXITING)))
2783 filter &= ~SHOW_MEM_FILTER_NODES;
2784 if (in_interrupt() || !(gfp_mask & __GFP_DIRECT_RECLAIM))
2785 filter &= ~SHOW_MEM_FILTER_NODES;
2788 struct va_format vaf;
2791 va_start(args, fmt);
2796 pr_warn("%pV", &vaf);
2801 pr_warn("%s: page allocation failure: order:%u, mode:%#x(%pGg)\n",
2802 current->comm, order, gfp_mask, &gfp_mask);
2804 if (!should_suppress_show_mem())
2808 static inline struct page *
2809 __alloc_pages_may_oom(gfp_t gfp_mask, unsigned int order,
2810 const struct alloc_context *ac, unsigned long *did_some_progress)
2812 struct oom_control oc = {
2813 .zonelist = ac->zonelist,
2814 .nodemask = ac->nodemask,
2815 .gfp_mask = gfp_mask,
2820 *did_some_progress = 0;
2823 * Acquire the oom lock. If that fails, somebody else is
2824 * making progress for us.
2826 if (!mutex_trylock(&oom_lock)) {
2827 *did_some_progress = 1;
2828 schedule_timeout_uninterruptible(1);
2833 * Go through the zonelist yet one more time, keep very high watermark
2834 * here, this is only to catch a parallel oom killing, we must fail if
2835 * we're still under heavy pressure.
2837 page = get_page_from_freelist(gfp_mask | __GFP_HARDWALL, order,
2838 ALLOC_WMARK_HIGH|ALLOC_CPUSET, ac);
2842 if (!(gfp_mask & __GFP_NOFAIL)) {
2843 /* Coredumps can quickly deplete all memory reserves */
2844 if (current->flags & PF_DUMPCORE)
2846 /* The OOM killer will not help higher order allocs */
2847 if (order > PAGE_ALLOC_COSTLY_ORDER)
2849 /* The OOM killer does not needlessly kill tasks for lowmem */
2850 if (ac->high_zoneidx < ZONE_NORMAL)
2852 /* The OOM killer does not compensate for IO-less reclaim */
2853 if (!(gfp_mask & __GFP_FS)) {
2855 * XXX: Page reclaim didn't yield anything,
2856 * and the OOM killer can't be invoked, but
2857 * keep looping as per tradition.
2859 * But do not keep looping if oom_killer_disable()
2860 * was already called, for the system is trying to
2861 * enter a quiescent state during suspend.
2863 *did_some_progress = !oom_killer_disabled;
2866 if (pm_suspended_storage())
2868 /* The OOM killer may not free memory on a specific node */
2869 if (gfp_mask & __GFP_THISNODE)
2872 /* Exhausted what can be done so it's blamo time */
2873 if (out_of_memory(&oc) || WARN_ON_ONCE(gfp_mask & __GFP_NOFAIL)) {
2874 *did_some_progress = 1;
2876 if (gfp_mask & __GFP_NOFAIL) {
2877 page = get_page_from_freelist(gfp_mask, order,
2878 ALLOC_NO_WATERMARKS|ALLOC_CPUSET, ac);
2880 * fallback to ignore cpuset restriction if our nodes
2884 page = get_page_from_freelist(gfp_mask, order,
2885 ALLOC_NO_WATERMARKS, ac);
2889 mutex_unlock(&oom_lock);
2893 #ifdef CONFIG_COMPACTION
2894 /* Try memory compaction for high-order allocations before reclaim */
2895 static struct page *
2896 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
2897 int alloc_flags, const struct alloc_context *ac,
2898 enum migrate_mode mode, int *contended_compaction,
2899 bool *deferred_compaction)
2901 unsigned long compact_result;
2907 current->flags |= PF_MEMALLOC;
2908 compact_result = try_to_compact_pages(gfp_mask, order, alloc_flags, ac,
2909 mode, contended_compaction);
2910 current->flags &= ~PF_MEMALLOC;
2912 switch (compact_result) {
2913 case COMPACT_DEFERRED:
2914 *deferred_compaction = true;
2916 case COMPACT_SKIPPED:
2923 * At least in one zone compaction wasn't deferred or skipped, so let's
2924 * count a compaction stall
2926 count_vm_event(COMPACTSTALL);
2928 page = get_page_from_freelist(gfp_mask, order,
2929 alloc_flags & ~ALLOC_NO_WATERMARKS, ac);
2932 struct zone *zone = page_zone(page);
2934 zone->compact_blockskip_flush = false;
2935 compaction_defer_reset(zone, order, true);
2936 count_vm_event(COMPACTSUCCESS);
2941 * It's bad if compaction run occurs and fails. The most likely reason
2942 * is that pages exist, but not enough to satisfy watermarks.
2944 count_vm_event(COMPACTFAIL);
2951 static inline struct page *
2952 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
2953 int alloc_flags, const struct alloc_context *ac,
2954 enum migrate_mode mode, int *contended_compaction,
2955 bool *deferred_compaction)
2959 #endif /* CONFIG_COMPACTION */
2961 /* Perform direct synchronous page reclaim */
2963 __perform_reclaim(gfp_t gfp_mask, unsigned int order,
2964 const struct alloc_context *ac)
2966 struct reclaim_state reclaim_state;
2971 /* We now go into synchronous reclaim */
2972 cpuset_memory_pressure_bump();
2973 current->flags |= PF_MEMALLOC;
2974 lockdep_set_current_reclaim_state(gfp_mask);
2975 reclaim_state.reclaimed_slab = 0;
2976 current->reclaim_state = &reclaim_state;
2978 progress = try_to_free_pages(ac->zonelist, order, gfp_mask,
2981 current->reclaim_state = NULL;
2982 lockdep_clear_current_reclaim_state();
2983 current->flags &= ~PF_MEMALLOC;
2990 /* The really slow allocator path where we enter direct reclaim */
2991 static inline struct page *
2992 __alloc_pages_direct_reclaim(gfp_t gfp_mask, unsigned int order,
2993 int alloc_flags, const struct alloc_context *ac,
2994 unsigned long *did_some_progress)
2996 struct page *page = NULL;
2997 bool drained = false;
2999 *did_some_progress = __perform_reclaim(gfp_mask, order, ac);
3000 if (unlikely(!(*did_some_progress)))
3004 page = get_page_from_freelist(gfp_mask, order,
3005 alloc_flags & ~ALLOC_NO_WATERMARKS, ac);
3008 * If an allocation failed after direct reclaim, it could be because
3009 * pages are pinned on the per-cpu lists or in high alloc reserves.
3010 * Shrink them them and try again
3012 if (!page && !drained) {
3013 unreserve_highatomic_pageblock(ac);
3014 drain_all_pages(NULL);
3022 static void wake_all_kswapds(unsigned int order, const struct alloc_context *ac)
3027 for_each_zone_zonelist_nodemask(zone, z, ac->zonelist,
3028 ac->high_zoneidx, ac->nodemask)
3029 wakeup_kswapd(zone, order, zone_idx(ac->preferred_zone));
3033 gfp_to_alloc_flags(gfp_t gfp_mask)
3035 int alloc_flags = ALLOC_WMARK_MIN | ALLOC_CPUSET;
3037 /* __GFP_HIGH is assumed to be the same as ALLOC_HIGH to save a branch. */
3038 BUILD_BUG_ON(__GFP_HIGH != (__force gfp_t) ALLOC_HIGH);
3041 * The caller may dip into page reserves a bit more if the caller
3042 * cannot run direct reclaim, or if the caller has realtime scheduling
3043 * policy or is asking for __GFP_HIGH memory. GFP_ATOMIC requests will
3044 * set both ALLOC_HARDER (__GFP_ATOMIC) and ALLOC_HIGH (__GFP_HIGH).
3046 alloc_flags |= (__force int) (gfp_mask & __GFP_HIGH);
3048 if (gfp_mask & __GFP_ATOMIC) {
3050 * Not worth trying to allocate harder for __GFP_NOMEMALLOC even
3051 * if it can't schedule.
3053 if (!(gfp_mask & __GFP_NOMEMALLOC))
3054 alloc_flags |= ALLOC_HARDER;
3056 * Ignore cpuset mems for GFP_ATOMIC rather than fail, see the
3057 * comment for __cpuset_node_allowed().
3059 alloc_flags &= ~ALLOC_CPUSET;
3060 } else if (unlikely(rt_task(current)) && !in_interrupt())
3061 alloc_flags |= ALLOC_HARDER;
3063 if (likely(!(gfp_mask & __GFP_NOMEMALLOC))) {
3064 if (gfp_mask & __GFP_MEMALLOC)
3065 alloc_flags |= ALLOC_NO_WATERMARKS;
3066 else if (in_serving_softirq() && (current->flags & PF_MEMALLOC))
3067 alloc_flags |= ALLOC_NO_WATERMARKS;
3068 else if (!in_interrupt() &&
3069 ((current->flags & PF_MEMALLOC) ||
3070 unlikely(test_thread_flag(TIF_MEMDIE))))
3071 alloc_flags |= ALLOC_NO_WATERMARKS;
3074 if (gfpflags_to_migratetype(gfp_mask) == MIGRATE_MOVABLE)
3075 alloc_flags |= ALLOC_CMA;
3080 bool gfp_pfmemalloc_allowed(gfp_t gfp_mask)
3082 return !!(gfp_to_alloc_flags(gfp_mask) & ALLOC_NO_WATERMARKS);
3085 static inline bool is_thp_gfp_mask(gfp_t gfp_mask)
3087 return (gfp_mask & (GFP_TRANSHUGE | __GFP_KSWAPD_RECLAIM)) == GFP_TRANSHUGE;
3091 * Maximum number of reclaim retries without any progress before OOM killer
3092 * is consider as the only way to move forward.
3094 #define MAX_RECLAIM_RETRIES 16
3097 * Checks whether it makes sense to retry the reclaim to make a forward progress
3098 * for the given allocation request.
3099 * The reclaim feedback represented by did_some_progress (any progress during
3100 * the last reclaim round) and no_progress_loops (number of reclaim rounds
3101 * without any progress in a row) is considered as well as the reclaimable pages
3102 * on the applicable zone list (with a backoff mechanism which is a function of
3103 * no_progress_loops).
3105 * Returns true if a retry is viable or false to enter the oom path.
3108 should_reclaim_retry(gfp_t gfp_mask, unsigned order,
3109 struct alloc_context *ac, int alloc_flags,
3110 bool did_some_progress,
3111 int no_progress_loops)
3117 * Make sure we converge to OOM if we cannot make any progress
3118 * several times in the row.
3120 if (no_progress_loops > MAX_RECLAIM_RETRIES)
3123 /* Do not retry high order allocations unless they are __GFP_REPEAT */
3124 if (order > PAGE_ALLOC_COSTLY_ORDER && !(gfp_mask & __GFP_REPEAT))
3128 * Keep reclaiming pages while there is a chance this will lead
3129 * somewhere. If none of the target zones can satisfy our allocation
3130 * request even if all reclaimable pages are considered then we are
3131 * screwed and have to go OOM.
3133 for_each_zone_zonelist_nodemask(zone, z, ac->zonelist,
3134 ac->high_zoneidx, ac->nodemask) {
3135 unsigned long available;
3136 unsigned long reclaimable;
3138 available = reclaimable = zone_reclaimable_pages(zone);
3139 available -= DIV_ROUND_UP(no_progress_loops * available,
3140 MAX_RECLAIM_RETRIES);
3141 available += zone_page_state_snapshot(zone, NR_FREE_PAGES);
3144 * Would the allocation succeed if we reclaimed the whole
3147 if (__zone_watermark_ok(zone, order, min_wmark_pages(zone),
3148 ac->high_zoneidx, alloc_flags, available)) {
3149 unsigned long writeback;
3150 unsigned long dirty;
3152 writeback = zone_page_state_snapshot(zone, NR_WRITEBACK);
3153 dirty = zone_page_state_snapshot(zone, NR_FILE_DIRTY);
3156 * If we didn't make any progress and have a lot of
3157 * dirty + writeback pages then we should wait for
3158 * an IO to complete to slow down the reclaim and
3159 * prevent from pre mature OOM
3161 if (!did_some_progress && 2*(writeback + dirty) > reclaimable) {
3162 congestion_wait(BLK_RW_ASYNC, HZ/10);
3167 * Memory allocation/reclaim might be called from a WQ
3168 * context and the current implementation of the WQ
3169 * concurrency control doesn't recognize that
3170 * a particular WQ is congested if the worker thread is
3171 * looping without ever sleeping. Therefore we have to
3172 * do a short sleep here rather than calling
3175 if (current->flags & PF_WQ_WORKER)
3176 schedule_timeout(1);
3187 static inline struct page *
3188 __alloc_pages_slowpath(gfp_t gfp_mask, unsigned int order,
3189 struct alloc_context *ac)
3191 bool can_direct_reclaim = gfp_mask & __GFP_DIRECT_RECLAIM;
3192 struct page *page = NULL;
3194 unsigned long did_some_progress;
3195 enum migrate_mode migration_mode = MIGRATE_ASYNC;
3196 bool deferred_compaction = false;
3197 int contended_compaction = COMPACT_CONTENDED_NONE;
3198 int no_progress_loops = 0;
3201 * In the slowpath, we sanity check order to avoid ever trying to
3202 * reclaim >= MAX_ORDER areas which will never succeed. Callers may
3203 * be using allocators in order of preference for an area that is
3206 if (order >= MAX_ORDER) {
3207 WARN_ON_ONCE(!(gfp_mask & __GFP_NOWARN));
3212 * We also sanity check to catch abuse of atomic reserves being used by
3213 * callers that are not in atomic context.
3215 if (WARN_ON_ONCE((gfp_mask & (__GFP_ATOMIC|__GFP_DIRECT_RECLAIM)) ==
3216 (__GFP_ATOMIC|__GFP_DIRECT_RECLAIM)))
3217 gfp_mask &= ~__GFP_ATOMIC;
3220 * If this allocation cannot block and it is for a specific node, then
3221 * fail early. There's no need to wakeup kswapd or retry for a
3222 * speculative node-specific allocation.
3224 if (IS_ENABLED(CONFIG_NUMA) && (gfp_mask & __GFP_THISNODE) && !can_direct_reclaim)
3228 if (gfp_mask & __GFP_KSWAPD_RECLAIM)
3229 wake_all_kswapds(order, ac);
3232 * OK, we're below the kswapd watermark and have kicked background
3233 * reclaim. Now things get more complex, so set up alloc_flags according
3234 * to how we want to proceed.
3236 alloc_flags = gfp_to_alloc_flags(gfp_mask);
3239 * Find the true preferred zone if the allocation is unconstrained by
3242 if (!(alloc_flags & ALLOC_CPUSET) && !ac->nodemask) {
3243 struct zoneref *preferred_zoneref;
3244 preferred_zoneref = first_zones_zonelist(ac->zonelist,
3245 ac->high_zoneidx, NULL, &ac->preferred_zone);
3246 ac->classzone_idx = zonelist_zone_idx(preferred_zoneref);
3249 /* This is the last chance, in general, before the goto nopage. */
3250 page = get_page_from_freelist(gfp_mask, order,
3251 alloc_flags & ~ALLOC_NO_WATERMARKS, ac);
3255 /* Allocate without watermarks if the context allows */
3256 if (alloc_flags & ALLOC_NO_WATERMARKS) {
3258 * Ignore mempolicies if ALLOC_NO_WATERMARKS on the grounds
3259 * the allocation is high priority and these type of
3260 * allocations are system rather than user orientated
3262 ac->zonelist = node_zonelist(numa_node_id(), gfp_mask);
3263 page = get_page_from_freelist(gfp_mask, order,
3264 ALLOC_NO_WATERMARKS, ac);
3269 /* Caller is not willing to reclaim, we can't balance anything */
3270 if (!can_direct_reclaim) {
3272 * All existing users of the __GFP_NOFAIL are blockable, so warn
3273 * of any new users that actually allow this type of allocation
3276 WARN_ON_ONCE(gfp_mask & __GFP_NOFAIL);
3280 /* Avoid recursion of direct reclaim */
3281 if (current->flags & PF_MEMALLOC) {
3283 * __GFP_NOFAIL request from this context is rather bizarre
3284 * because we cannot reclaim anything and only can loop waiting
3285 * for somebody to do a work for us.
3287 if (WARN_ON_ONCE(gfp_mask & __GFP_NOFAIL)) {
3294 /* Avoid allocations with no watermarks from looping endlessly */
3295 if (test_thread_flag(TIF_MEMDIE) && !(gfp_mask & __GFP_NOFAIL))
3299 * Try direct compaction. The first pass is asynchronous. Subsequent
3300 * attempts after direct reclaim are synchronous
3302 page = __alloc_pages_direct_compact(gfp_mask, order, alloc_flags, ac,
3304 &contended_compaction,
3305 &deferred_compaction);
3309 /* Checks for THP-specific high-order allocations */
3310 if (is_thp_gfp_mask(gfp_mask)) {
3312 * If compaction is deferred for high-order allocations, it is
3313 * because sync compaction recently failed. If this is the case
3314 * and the caller requested a THP allocation, we do not want
3315 * to heavily disrupt the system, so we fail the allocation
3316 * instead of entering direct reclaim.
3318 if (deferred_compaction)
3322 * In all zones where compaction was attempted (and not
3323 * deferred or skipped), lock contention has been detected.
3324 * For THP allocation we do not want to disrupt the others
3325 * so we fallback to base pages instead.
3327 if (contended_compaction == COMPACT_CONTENDED_LOCK)
3331 * If compaction was aborted due to need_resched(), we do not
3332 * want to further increase allocation latency, unless it is
3333 * khugepaged trying to collapse.
3335 if (contended_compaction == COMPACT_CONTENDED_SCHED
3336 && !(current->flags & PF_KTHREAD))
3341 * It can become very expensive to allocate transparent hugepages at
3342 * fault, so use asynchronous memory compaction for THP unless it is
3343 * khugepaged trying to collapse.
3345 if (!is_thp_gfp_mask(gfp_mask) || (current->flags & PF_KTHREAD))
3346 migration_mode = MIGRATE_SYNC_LIGHT;
3348 /* Try direct reclaim and then allocating */
3349 page = __alloc_pages_direct_reclaim(gfp_mask, order, alloc_flags, ac,
3350 &did_some_progress);
3354 /* Do not loop if specifically requested */
3355 if (gfp_mask & __GFP_NORETRY)
3359 * Costly allocations might have made a progress but this doesn't mean
3360 * their order will become available due to high fragmentation so do
3361 * not reset the no progress counter for them
3363 if (did_some_progress && order <= PAGE_ALLOC_COSTLY_ORDER)
3364 no_progress_loops = 0;
3366 no_progress_loops++;
3368 if (should_reclaim_retry(gfp_mask, order, ac, alloc_flags,
3369 did_some_progress > 0, no_progress_loops))
3372 /* Reclaim has failed us, start killing things */
3373 page = __alloc_pages_may_oom(gfp_mask, order, ac, &did_some_progress);
3377 /* Retry as long as the OOM killer is making progress */
3378 if (did_some_progress) {
3379 no_progress_loops = 0;
3385 * High-order allocations do not necessarily loop after
3386 * direct reclaim and reclaim/compaction depends on compaction
3387 * being called after reclaim so call directly if necessary
3389 page = __alloc_pages_direct_compact(gfp_mask, order, alloc_flags,
3391 &contended_compaction,
3392 &deferred_compaction);
3396 warn_alloc_failed(gfp_mask, order, NULL);
3402 * This is the 'heart' of the zoned buddy allocator.
3405 __alloc_pages_nodemask(gfp_t gfp_mask, unsigned int order,
3406 struct zonelist *zonelist, nodemask_t *nodemask)
3408 struct zoneref *preferred_zoneref;
3409 struct page *page = NULL;
3410 unsigned int cpuset_mems_cookie;
3411 int alloc_flags = ALLOC_WMARK_LOW|ALLOC_CPUSET|ALLOC_FAIR;
3412 gfp_t alloc_mask; /* The gfp_t that was actually used for allocation */
3413 struct alloc_context ac = {
3414 .high_zoneidx = gfp_zone(gfp_mask),
3415 .nodemask = nodemask,
3416 .migratetype = gfpflags_to_migratetype(gfp_mask),
3419 gfp_mask &= gfp_allowed_mask;
3421 lockdep_trace_alloc(gfp_mask);
3423 might_sleep_if(gfp_mask & __GFP_DIRECT_RECLAIM);
3425 if (should_fail_alloc_page(gfp_mask, order))
3429 * Check the zones suitable for the gfp_mask contain at least one
3430 * valid zone. It's possible to have an empty zonelist as a result
3431 * of __GFP_THISNODE and a memoryless node
3433 if (unlikely(!zonelist->_zonerefs->zone))
3436 if (IS_ENABLED(CONFIG_CMA) && ac.migratetype == MIGRATE_MOVABLE)
3437 alloc_flags |= ALLOC_CMA;
3440 cpuset_mems_cookie = read_mems_allowed_begin();
3442 /* We set it here, as __alloc_pages_slowpath might have changed it */
3443 ac.zonelist = zonelist;
3445 /* Dirty zone balancing only done in the fast path */
3446 ac.spread_dirty_pages = (gfp_mask & __GFP_WRITE);
3448 /* The preferred zone is used for statistics later */
3449 preferred_zoneref = first_zones_zonelist(ac.zonelist, ac.high_zoneidx,
3450 ac.nodemask ? : &cpuset_current_mems_allowed,
3451 &ac.preferred_zone);
3452 if (!ac.preferred_zone)
3454 ac.classzone_idx = zonelist_zone_idx(preferred_zoneref);
3456 /* First allocation attempt */
3457 alloc_mask = gfp_mask|__GFP_HARDWALL;
3458 page = get_page_from_freelist(alloc_mask, order, alloc_flags, &ac);
3459 if (unlikely(!page)) {
3461 * Runtime PM, block IO and its error handling path
3462 * can deadlock because I/O on the device might not
3465 alloc_mask = memalloc_noio_flags(gfp_mask);
3466 ac.spread_dirty_pages = false;
3468 page = __alloc_pages_slowpath(alloc_mask, order, &ac);
3471 if (kmemcheck_enabled && page)
3472 kmemcheck_pagealloc_alloc(page, order, gfp_mask);
3474 trace_mm_page_alloc(page, order, alloc_mask, ac.migratetype);
3478 * When updating a task's mems_allowed, it is possible to race with
3479 * parallel threads in such a way that an allocation can fail while
3480 * the mask is being updated. If a page allocation is about to fail,
3481 * check if the cpuset changed during allocation and if so, retry.
3483 if (unlikely(!page && read_mems_allowed_retry(cpuset_mems_cookie)))
3488 EXPORT_SYMBOL(__alloc_pages_nodemask);
3491 * Common helper functions.
3493 unsigned long __get_free_pages(gfp_t gfp_mask, unsigned int order)
3498 * __get_free_pages() returns a 32-bit address, which cannot represent
3501 VM_BUG_ON((gfp_mask & __GFP_HIGHMEM) != 0);
3503 page = alloc_pages(gfp_mask, order);
3506 return (unsigned long) page_address(page);
3508 EXPORT_SYMBOL(__get_free_pages);
3510 unsigned long get_zeroed_page(gfp_t gfp_mask)
3512 return __get_free_pages(gfp_mask | __GFP_ZERO, 0);
3514 EXPORT_SYMBOL(get_zeroed_page);
3516 void __free_pages(struct page *page, unsigned int order)
3518 if (put_page_testzero(page)) {
3520 free_hot_cold_page(page, false);
3522 __free_pages_ok(page, order);
3526 EXPORT_SYMBOL(__free_pages);
3528 void free_pages(unsigned long addr, unsigned int order)
3531 VM_BUG_ON(!virt_addr_valid((void *)addr));
3532 __free_pages(virt_to_page((void *)addr), order);
3536 EXPORT_SYMBOL(free_pages);
3540 * An arbitrary-length arbitrary-offset area of memory which resides
3541 * within a 0 or higher order page. Multiple fragments within that page
3542 * are individually refcounted, in the page's reference counter.
3544 * The page_frag functions below provide a simple allocation framework for
3545 * page fragments. This is used by the network stack and network device
3546 * drivers to provide a backing region of memory for use as either an
3547 * sk_buff->head, or to be used in the "frags" portion of skb_shared_info.
3549 static struct page *__page_frag_refill(struct page_frag_cache *nc,
3552 struct page *page = NULL;
3553 gfp_t gfp = gfp_mask;
3555 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
3556 gfp_mask |= __GFP_COMP | __GFP_NOWARN | __GFP_NORETRY |
3558 page = alloc_pages_node(NUMA_NO_NODE, gfp_mask,
3559 PAGE_FRAG_CACHE_MAX_ORDER);
3560 nc->size = page ? PAGE_FRAG_CACHE_MAX_SIZE : PAGE_SIZE;
3562 if (unlikely(!page))
3563 page = alloc_pages_node(NUMA_NO_NODE, gfp, 0);
3565 nc->va = page ? page_address(page) : NULL;
3570 void *__alloc_page_frag(struct page_frag_cache *nc,
3571 unsigned int fragsz, gfp_t gfp_mask)
3573 unsigned int size = PAGE_SIZE;
3577 if (unlikely(!nc->va)) {
3579 page = __page_frag_refill(nc, gfp_mask);
3583 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
3584 /* if size can vary use size else just use PAGE_SIZE */
3587 /* Even if we own the page, we do not use atomic_set().
3588 * This would break get_page_unless_zero() users.
3590 atomic_add(size - 1, &page->_count);
3592 /* reset page count bias and offset to start of new frag */
3593 nc->pfmemalloc = page_is_pfmemalloc(page);
3594 nc->pagecnt_bias = size;
3598 offset = nc->offset - fragsz;
3599 if (unlikely(offset < 0)) {
3600 page = virt_to_page(nc->va);
3602 if (!atomic_sub_and_test(nc->pagecnt_bias, &page->_count))
3605 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
3606 /* if size can vary use size else just use PAGE_SIZE */
3609 /* OK, page count is 0, we can safely set it */
3610 atomic_set(&page->_count, size);
3612 /* reset page count bias and offset to start of new frag */
3613 nc->pagecnt_bias = size;
3614 offset = size - fragsz;
3618 nc->offset = offset;
3620 return nc->va + offset;
3622 EXPORT_SYMBOL(__alloc_page_frag);
3625 * Frees a page fragment allocated out of either a compound or order 0 page.
3627 void __free_page_frag(void *addr)
3629 struct page *page = virt_to_head_page(addr);
3631 if (unlikely(put_page_testzero(page)))
3632 __free_pages_ok(page, compound_order(page));
3634 EXPORT_SYMBOL(__free_page_frag);
3637 * alloc_kmem_pages charges newly allocated pages to the kmem resource counter
3638 * of the current memory cgroup if __GFP_ACCOUNT is set, other than that it is
3639 * equivalent to alloc_pages.
3641 * It should be used when the caller would like to use kmalloc, but since the
3642 * allocation is large, it has to fall back to the page allocator.
3644 struct page *alloc_kmem_pages(gfp_t gfp_mask, unsigned int order)
3648 page = alloc_pages(gfp_mask, order);
3649 if (page && memcg_kmem_charge(page, gfp_mask, order) != 0) {
3650 __free_pages(page, order);
3656 struct page *alloc_kmem_pages_node(int nid, gfp_t gfp_mask, unsigned int order)
3660 page = alloc_pages_node(nid, gfp_mask, order);
3661 if (page && memcg_kmem_charge(page, gfp_mask, order) != 0) {
3662 __free_pages(page, order);
3669 * __free_kmem_pages and free_kmem_pages will free pages allocated with
3672 void __free_kmem_pages(struct page *page, unsigned int order)
3674 memcg_kmem_uncharge(page, order);
3675 __free_pages(page, order);
3678 void free_kmem_pages(unsigned long addr, unsigned int order)
3681 VM_BUG_ON(!virt_addr_valid((void *)addr));
3682 __free_kmem_pages(virt_to_page((void *)addr), order);
3686 static void *make_alloc_exact(unsigned long addr, unsigned int order,
3690 unsigned long alloc_end = addr + (PAGE_SIZE << order);
3691 unsigned long used = addr + PAGE_ALIGN(size);
3693 split_page(virt_to_page((void *)addr), order);
3694 while (used < alloc_end) {
3699 return (void *)addr;
3703 * alloc_pages_exact - allocate an exact number physically-contiguous pages.
3704 * @size: the number of bytes to allocate
3705 * @gfp_mask: GFP flags for the allocation
3707 * This function is similar to alloc_pages(), except that it allocates the
3708 * minimum number of pages to satisfy the request. alloc_pages() can only
3709 * allocate memory in power-of-two pages.
3711 * This function is also limited by MAX_ORDER.
3713 * Memory allocated by this function must be released by free_pages_exact().
3715 void *alloc_pages_exact(size_t size, gfp_t gfp_mask)
3717 unsigned int order = get_order(size);
3720 addr = __get_free_pages(gfp_mask, order);
3721 return make_alloc_exact(addr, order, size);
3723 EXPORT_SYMBOL(alloc_pages_exact);
3726 * alloc_pages_exact_nid - allocate an exact number of physically-contiguous
3728 * @nid: the preferred node ID where memory should be allocated
3729 * @size: the number of bytes to allocate
3730 * @gfp_mask: GFP flags for the allocation
3732 * Like alloc_pages_exact(), but try to allocate on node nid first before falling
3735 void * __meminit alloc_pages_exact_nid(int nid, size_t size, gfp_t gfp_mask)
3737 unsigned int order = get_order(size);
3738 struct page *p = alloc_pages_node(nid, gfp_mask, order);
3741 return make_alloc_exact((unsigned long)page_address(p), order, size);
3745 * free_pages_exact - release memory allocated via alloc_pages_exact()
3746 * @virt: the value returned by alloc_pages_exact.
3747 * @size: size of allocation, same value as passed to alloc_pages_exact().
3749 * Release the memory allocated by a previous call to alloc_pages_exact.
3751 void free_pages_exact(void *virt, size_t size)
3753 unsigned long addr = (unsigned long)virt;
3754 unsigned long end = addr + PAGE_ALIGN(size);
3756 while (addr < end) {
3761 EXPORT_SYMBOL(free_pages_exact);
3764 * nr_free_zone_pages - count number of pages beyond high watermark
3765 * @offset: The zone index of the highest zone
3767 * nr_free_zone_pages() counts the number of counts pages which are beyond the
3768 * high watermark within all zones at or below a given zone index. For each
3769 * zone, the number of pages is calculated as:
3770 * managed_pages - high_pages
3772 static unsigned long nr_free_zone_pages(int offset)
3777 /* Just pick one node, since fallback list is circular */
3778 unsigned long sum = 0;
3780 struct zonelist *zonelist = node_zonelist(numa_node_id(), GFP_KERNEL);
3782 for_each_zone_zonelist(zone, z, zonelist, offset) {
3783 unsigned long size = zone->managed_pages;
3784 unsigned long high = high_wmark_pages(zone);
3793 * nr_free_buffer_pages - count number of pages beyond high watermark
3795 * nr_free_buffer_pages() counts the number of pages which are beyond the high
3796 * watermark within ZONE_DMA and ZONE_NORMAL.
3798 unsigned long nr_free_buffer_pages(void)
3800 return nr_free_zone_pages(gfp_zone(GFP_USER));
3802 EXPORT_SYMBOL_GPL(nr_free_buffer_pages);
3805 * nr_free_pagecache_pages - count number of pages beyond high watermark
3807 * nr_free_pagecache_pages() counts the number of pages which are beyond the
3808 * high watermark within all zones.
3810 unsigned long nr_free_pagecache_pages(void)
3812 return nr_free_zone_pages(gfp_zone(GFP_HIGHUSER_MOVABLE));
3815 static inline void show_node(struct zone *zone)
3817 if (IS_ENABLED(CONFIG_NUMA))
3818 printk("Node %d ", zone_to_nid(zone));
3821 void si_meminfo(struct sysinfo *val)
3823 val->totalram = totalram_pages;
3824 val->sharedram = global_page_state(NR_SHMEM);
3825 val->freeram = global_page_state(NR_FREE_PAGES);
3826 val->bufferram = nr_blockdev_pages();
3827 val->totalhigh = totalhigh_pages;
3828 val->freehigh = nr_free_highpages();
3829 val->mem_unit = PAGE_SIZE;
3832 EXPORT_SYMBOL(si_meminfo);
3835 void si_meminfo_node(struct sysinfo *val, int nid)
3837 int zone_type; /* needs to be signed */
3838 unsigned long managed_pages = 0;
3839 pg_data_t *pgdat = NODE_DATA(nid);
3841 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++)
3842 managed_pages += pgdat->node_zones[zone_type].managed_pages;
3843 val->totalram = managed_pages;
3844 val->sharedram = node_page_state(nid, NR_SHMEM);
3845 val->freeram = node_page_state(nid, NR_FREE_PAGES);
3846 #ifdef CONFIG_HIGHMEM
3847 val->totalhigh = pgdat->node_zones[ZONE_HIGHMEM].managed_pages;
3848 val->freehigh = zone_page_state(&pgdat->node_zones[ZONE_HIGHMEM],
3854 val->mem_unit = PAGE_SIZE;
3859 * Determine whether the node should be displayed or not, depending on whether
3860 * SHOW_MEM_FILTER_NODES was passed to show_free_areas().
3862 bool skip_free_areas_node(unsigned int flags, int nid)
3865 unsigned int cpuset_mems_cookie;
3867 if (!(flags & SHOW_MEM_FILTER_NODES))
3871 cpuset_mems_cookie = read_mems_allowed_begin();
3872 ret = !node_isset(nid, cpuset_current_mems_allowed);
3873 } while (read_mems_allowed_retry(cpuset_mems_cookie));
3878 #define K(x) ((x) << (PAGE_SHIFT-10))
3880 static void show_migration_types(unsigned char type)
3882 static const char types[MIGRATE_TYPES] = {
3883 [MIGRATE_UNMOVABLE] = 'U',
3884 [MIGRATE_MOVABLE] = 'M',
3885 [MIGRATE_RECLAIMABLE] = 'E',
3886 [MIGRATE_HIGHATOMIC] = 'H',
3888 [MIGRATE_CMA] = 'C',
3890 #ifdef CONFIG_MEMORY_ISOLATION
3891 [MIGRATE_ISOLATE] = 'I',
3894 char tmp[MIGRATE_TYPES + 1];
3898 for (i = 0; i < MIGRATE_TYPES; i++) {
3899 if (type & (1 << i))
3904 printk("(%s) ", tmp);
3908 * Show free area list (used inside shift_scroll-lock stuff)
3909 * We also calculate the percentage fragmentation. We do this by counting the
3910 * memory on each free list with the exception of the first item on the list.
3913 * SHOW_MEM_FILTER_NODES: suppress nodes that are not allowed by current's
3916 void show_free_areas(unsigned int filter)
3918 unsigned long free_pcp = 0;
3922 for_each_populated_zone(zone) {
3923 if (skip_free_areas_node(filter, zone_to_nid(zone)))
3926 for_each_online_cpu(cpu)
3927 free_pcp += per_cpu_ptr(zone->pageset, cpu)->pcp.count;
3930 printk("active_anon:%lu inactive_anon:%lu isolated_anon:%lu\n"
3931 " active_file:%lu inactive_file:%lu isolated_file:%lu\n"
3932 " unevictable:%lu dirty:%lu writeback:%lu unstable:%lu\n"
3933 " slab_reclaimable:%lu slab_unreclaimable:%lu\n"
3934 " mapped:%lu shmem:%lu pagetables:%lu bounce:%lu\n"
3935 " free:%lu free_pcp:%lu free_cma:%lu\n",
3936 global_page_state(NR_ACTIVE_ANON),
3937 global_page_state(NR_INACTIVE_ANON),
3938 global_page_state(NR_ISOLATED_ANON),
3939 global_page_state(NR_ACTIVE_FILE),
3940 global_page_state(NR_INACTIVE_FILE),
3941 global_page_state(NR_ISOLATED_FILE),
3942 global_page_state(NR_UNEVICTABLE),
3943 global_page_state(NR_FILE_DIRTY),
3944 global_page_state(NR_WRITEBACK),
3945 global_page_state(NR_UNSTABLE_NFS),
3946 global_page_state(NR_SLAB_RECLAIMABLE),
3947 global_page_state(NR_SLAB_UNRECLAIMABLE),
3948 global_page_state(NR_FILE_MAPPED),
3949 global_page_state(NR_SHMEM),
3950 global_page_state(NR_PAGETABLE),
3951 global_page_state(NR_BOUNCE),
3952 global_page_state(NR_FREE_PAGES),
3954 global_page_state(NR_FREE_CMA_PAGES));
3956 for_each_populated_zone(zone) {
3959 if (skip_free_areas_node(filter, zone_to_nid(zone)))
3963 for_each_online_cpu(cpu)
3964 free_pcp += per_cpu_ptr(zone->pageset, cpu)->pcp.count;
3972 " active_anon:%lukB"
3973 " inactive_anon:%lukB"
3974 " active_file:%lukB"
3975 " inactive_file:%lukB"
3976 " unevictable:%lukB"
3977 " isolated(anon):%lukB"
3978 " isolated(file):%lukB"
3986 " slab_reclaimable:%lukB"
3987 " slab_unreclaimable:%lukB"
3988 " kernel_stack:%lukB"
3995 " writeback_tmp:%lukB"
3996 " pages_scanned:%lu"
3997 " all_unreclaimable? %s"
4000 K(zone_page_state(zone, NR_FREE_PAGES)),
4001 K(min_wmark_pages(zone)),
4002 K(low_wmark_pages(zone)),
4003 K(high_wmark_pages(zone)),
4004 K(zone_page_state(zone, NR_ACTIVE_ANON)),
4005 K(zone_page_state(zone, NR_INACTIVE_ANON)),
4006 K(zone_page_state(zone, NR_ACTIVE_FILE)),
4007 K(zone_page_state(zone, NR_INACTIVE_FILE)),
4008 K(zone_page_state(zone, NR_UNEVICTABLE)),
4009 K(zone_page_state(zone, NR_ISOLATED_ANON)),
4010 K(zone_page_state(zone, NR_ISOLATED_FILE)),
4011 K(zone->present_pages),
4012 K(zone->managed_pages),
4013 K(zone_page_state(zone, NR_MLOCK)),
4014 K(zone_page_state(zone, NR_FILE_DIRTY)),
4015 K(zone_page_state(zone, NR_WRITEBACK)),
4016 K(zone_page_state(zone, NR_FILE_MAPPED)),
4017 K(zone_page_state(zone, NR_SHMEM)),
4018 K(zone_page_state(zone, NR_SLAB_RECLAIMABLE)),
4019 K(zone_page_state(zone, NR_SLAB_UNRECLAIMABLE)),
4020 zone_page_state(zone, NR_KERNEL_STACK) *
4022 K(zone_page_state(zone, NR_PAGETABLE)),
4023 K(zone_page_state(zone, NR_UNSTABLE_NFS)),
4024 K(zone_page_state(zone, NR_BOUNCE)),
4026 K(this_cpu_read(zone->pageset->pcp.count)),
4027 K(zone_page_state(zone, NR_FREE_CMA_PAGES)),
4028 K(zone_page_state(zone, NR_WRITEBACK_TEMP)),
4029 K(zone_page_state(zone, NR_PAGES_SCANNED)),
4030 (!zone_reclaimable(zone) ? "yes" : "no")
4032 printk("lowmem_reserve[]:");
4033 for (i = 0; i < MAX_NR_ZONES; i++)
4034 printk(" %ld", zone->lowmem_reserve[i]);
4038 for_each_populated_zone(zone) {
4040 unsigned long nr[MAX_ORDER], flags, total = 0;
4041 unsigned char types[MAX_ORDER];
4043 if (skip_free_areas_node(filter, zone_to_nid(zone)))
4046 printk("%s: ", zone->name);
4048 spin_lock_irqsave(&zone->lock, flags);
4049 for (order = 0; order < MAX_ORDER; order++) {
4050 struct free_area *area = &zone->free_area[order];
4053 nr[order] = area->nr_free;
4054 total += nr[order] << order;
4057 for (type = 0; type < MIGRATE_TYPES; type++) {
4058 if (!list_empty(&area->free_list[type]))
4059 types[order] |= 1 << type;
4062 spin_unlock_irqrestore(&zone->lock, flags);
4063 for (order = 0; order < MAX_ORDER; order++) {
4064 printk("%lu*%lukB ", nr[order], K(1UL) << order);
4066 show_migration_types(types[order]);
4068 printk("= %lukB\n", K(total));
4071 hugetlb_show_meminfo();
4073 printk("%ld total pagecache pages\n", global_page_state(NR_FILE_PAGES));
4075 show_swap_cache_info();
4078 static void zoneref_set_zone(struct zone *zone, struct zoneref *zoneref)
4080 zoneref->zone = zone;
4081 zoneref->zone_idx = zone_idx(zone);
4085 * Builds allocation fallback zone lists.
4087 * Add all populated zones of a node to the zonelist.
4089 static int build_zonelists_node(pg_data_t *pgdat, struct zonelist *zonelist,
4093 enum zone_type zone_type = MAX_NR_ZONES;
4097 zone = pgdat->node_zones + zone_type;
4098 if (populated_zone(zone)) {
4099 zoneref_set_zone(zone,
4100 &zonelist->_zonerefs[nr_zones++]);
4101 check_highest_zone(zone_type);
4103 } while (zone_type);
4111 * 0 = automatic detection of better ordering.
4112 * 1 = order by ([node] distance, -zonetype)
4113 * 2 = order by (-zonetype, [node] distance)
4115 * If not NUMA, ZONELIST_ORDER_ZONE and ZONELIST_ORDER_NODE will create
4116 * the same zonelist. So only NUMA can configure this param.
4118 #define ZONELIST_ORDER_DEFAULT 0
4119 #define ZONELIST_ORDER_NODE 1
4120 #define ZONELIST_ORDER_ZONE 2
4122 /* zonelist order in the kernel.
4123 * set_zonelist_order() will set this to NODE or ZONE.
4125 static int current_zonelist_order = ZONELIST_ORDER_DEFAULT;
4126 static char zonelist_order_name[3][8] = {"Default", "Node", "Zone"};
4130 /* The value user specified ....changed by config */
4131 static int user_zonelist_order = ZONELIST_ORDER_DEFAULT;
4132 /* string for sysctl */
4133 #define NUMA_ZONELIST_ORDER_LEN 16
4134 char numa_zonelist_order[16] = "default";
4137 * interface for configure zonelist ordering.
4138 * command line option "numa_zonelist_order"
4139 * = "[dD]efault - default, automatic configuration.
4140 * = "[nN]ode - order by node locality, then by zone within node
4141 * = "[zZ]one - order by zone, then by locality within zone
4144 static int __parse_numa_zonelist_order(char *s)
4146 if (*s == 'd' || *s == 'D') {
4147 user_zonelist_order = ZONELIST_ORDER_DEFAULT;
4148 } else if (*s == 'n' || *s == 'N') {
4149 user_zonelist_order = ZONELIST_ORDER_NODE;
4150 } else if (*s == 'z' || *s == 'Z') {
4151 user_zonelist_order = ZONELIST_ORDER_ZONE;
4154 "Ignoring invalid numa_zonelist_order value: "
4161 static __init int setup_numa_zonelist_order(char *s)
4168 ret = __parse_numa_zonelist_order(s);
4170 strlcpy(numa_zonelist_order, s, NUMA_ZONELIST_ORDER_LEN);
4174 early_param("numa_zonelist_order", setup_numa_zonelist_order);
4177 * sysctl handler for numa_zonelist_order
4179 int numa_zonelist_order_handler(struct ctl_table *table, int write,
4180 void __user *buffer, size_t *length,
4183 char saved_string[NUMA_ZONELIST_ORDER_LEN];
4185 static DEFINE_MUTEX(zl_order_mutex);
4187 mutex_lock(&zl_order_mutex);
4189 if (strlen((char *)table->data) >= NUMA_ZONELIST_ORDER_LEN) {
4193 strcpy(saved_string, (char *)table->data);
4195 ret = proc_dostring(table, write, buffer, length, ppos);
4199 int oldval = user_zonelist_order;
4201 ret = __parse_numa_zonelist_order((char *)table->data);
4204 * bogus value. restore saved string
4206 strncpy((char *)table->data, saved_string,
4207 NUMA_ZONELIST_ORDER_LEN);
4208 user_zonelist_order = oldval;
4209 } else if (oldval != user_zonelist_order) {
4210 mutex_lock(&zonelists_mutex);
4211 build_all_zonelists(NULL, NULL);
4212 mutex_unlock(&zonelists_mutex);
4216 mutex_unlock(&zl_order_mutex);
4221 #define MAX_NODE_LOAD (nr_online_nodes)
4222 static int node_load[MAX_NUMNODES];
4225 * find_next_best_node - find the next node that should appear in a given node's fallback list
4226 * @node: node whose fallback list we're appending
4227 * @used_node_mask: nodemask_t of already used nodes
4229 * We use a number of factors to determine which is the next node that should
4230 * appear on a given node's fallback list. The node should not have appeared
4231 * already in @node's fallback list, and it should be the next closest node
4232 * according to the distance array (which contains arbitrary distance values
4233 * from each node to each node in the system), and should also prefer nodes
4234 * with no CPUs, since presumably they'll have very little allocation pressure
4235 * on them otherwise.
4236 * It returns -1 if no node is found.
4238 static int find_next_best_node(int node, nodemask_t *used_node_mask)
4241 int min_val = INT_MAX;
4242 int best_node = NUMA_NO_NODE;
4243 const struct cpumask *tmp = cpumask_of_node(0);
4245 /* Use the local node if we haven't already */
4246 if (!node_isset(node, *used_node_mask)) {
4247 node_set(node, *used_node_mask);
4251 for_each_node_state(n, N_MEMORY) {
4253 /* Don't want a node to appear more than once */
4254 if (node_isset(n, *used_node_mask))
4257 /* Use the distance array to find the distance */
4258 val = node_distance(node, n);
4260 /* Penalize nodes under us ("prefer the next node") */
4263 /* Give preference to headless and unused nodes */
4264 tmp = cpumask_of_node(n);
4265 if (!cpumask_empty(tmp))
4266 val += PENALTY_FOR_NODE_WITH_CPUS;
4268 /* Slight preference for less loaded node */
4269 val *= (MAX_NODE_LOAD*MAX_NUMNODES);
4270 val += node_load[n];
4272 if (val < min_val) {
4279 node_set(best_node, *used_node_mask);
4286 * Build zonelists ordered by node and zones within node.
4287 * This results in maximum locality--normal zone overflows into local
4288 * DMA zone, if any--but risks exhausting DMA zone.
4290 static void build_zonelists_in_node_order(pg_data_t *pgdat, int node)
4293 struct zonelist *zonelist;
4295 zonelist = &pgdat->node_zonelists[0];
4296 for (j = 0; zonelist->_zonerefs[j].zone != NULL; j++)
4298 j = build_zonelists_node(NODE_DATA(node), zonelist, j);
4299 zonelist->_zonerefs[j].zone = NULL;
4300 zonelist->_zonerefs[j].zone_idx = 0;
4304 * Build gfp_thisnode zonelists
4306 static void build_thisnode_zonelists(pg_data_t *pgdat)
4309 struct zonelist *zonelist;
4311 zonelist = &pgdat->node_zonelists[1];
4312 j = build_zonelists_node(pgdat, zonelist, 0);
4313 zonelist->_zonerefs[j].zone = NULL;
4314 zonelist->_zonerefs[j].zone_idx = 0;
4318 * Build zonelists ordered by zone and nodes within zones.
4319 * This results in conserving DMA zone[s] until all Normal memory is
4320 * exhausted, but results in overflowing to remote node while memory
4321 * may still exist in local DMA zone.
4323 static int node_order[MAX_NUMNODES];
4325 static void build_zonelists_in_zone_order(pg_data_t *pgdat, int nr_nodes)
4328 int zone_type; /* needs to be signed */
4330 struct zonelist *zonelist;
4332 zonelist = &pgdat->node_zonelists[0];
4334 for (zone_type = MAX_NR_ZONES - 1; zone_type >= 0; zone_type--) {
4335 for (j = 0; j < nr_nodes; j++) {
4336 node = node_order[j];
4337 z = &NODE_DATA(node)->node_zones[zone_type];
4338 if (populated_zone(z)) {
4340 &zonelist->_zonerefs[pos++]);
4341 check_highest_zone(zone_type);
4345 zonelist->_zonerefs[pos].zone = NULL;
4346 zonelist->_zonerefs[pos].zone_idx = 0;
4349 #if defined(CONFIG_64BIT)
4351 * Devices that require DMA32/DMA are relatively rare and do not justify a
4352 * penalty to every machine in case the specialised case applies. Default
4353 * to Node-ordering on 64-bit NUMA machines
4355 static int default_zonelist_order(void)
4357 return ZONELIST_ORDER_NODE;
4361 * On 32-bit, the Normal zone needs to be preserved for allocations accessible
4362 * by the kernel. If processes running on node 0 deplete the low memory zone
4363 * then reclaim will occur more frequency increasing stalls and potentially
4364 * be easier to OOM if a large percentage of the zone is under writeback or
4365 * dirty. The problem is significantly worse if CONFIG_HIGHPTE is not set.
4366 * Hence, default to zone ordering on 32-bit.
4368 static int default_zonelist_order(void)
4370 return ZONELIST_ORDER_ZONE;
4372 #endif /* CONFIG_64BIT */
4374 static void set_zonelist_order(void)
4376 if (user_zonelist_order == ZONELIST_ORDER_DEFAULT)
4377 current_zonelist_order = default_zonelist_order();
4379 current_zonelist_order = user_zonelist_order;
4382 static void build_zonelists(pg_data_t *pgdat)
4385 nodemask_t used_mask;
4386 int local_node, prev_node;
4387 struct zonelist *zonelist;
4388 unsigned int order = current_zonelist_order;
4390 /* initialize zonelists */
4391 for (i = 0; i < MAX_ZONELISTS; i++) {
4392 zonelist = pgdat->node_zonelists + i;
4393 zonelist->_zonerefs[0].zone = NULL;
4394 zonelist->_zonerefs[0].zone_idx = 0;
4397 /* NUMA-aware ordering of nodes */
4398 local_node = pgdat->node_id;
4399 load = nr_online_nodes;
4400 prev_node = local_node;
4401 nodes_clear(used_mask);
4403 memset(node_order, 0, sizeof(node_order));
4406 while ((node = find_next_best_node(local_node, &used_mask)) >= 0) {
4408 * We don't want to pressure a particular node.
4409 * So adding penalty to the first node in same
4410 * distance group to make it round-robin.
4412 if (node_distance(local_node, node) !=
4413 node_distance(local_node, prev_node))
4414 node_load[node] = load;
4418 if (order == ZONELIST_ORDER_NODE)
4419 build_zonelists_in_node_order(pgdat, node);
4421 node_order[i++] = node; /* remember order */
4424 if (order == ZONELIST_ORDER_ZONE) {
4425 /* calculate node order -- i.e., DMA last! */
4426 build_zonelists_in_zone_order(pgdat, i);
4429 build_thisnode_zonelists(pgdat);
4432 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
4434 * Return node id of node used for "local" allocations.
4435 * I.e., first node id of first zone in arg node's generic zonelist.
4436 * Used for initializing percpu 'numa_mem', which is used primarily
4437 * for kernel allocations, so use GFP_KERNEL flags to locate zonelist.
4439 int local_memory_node(int node)
4443 (void)first_zones_zonelist(node_zonelist(node, GFP_KERNEL),
4444 gfp_zone(GFP_KERNEL),
4451 #else /* CONFIG_NUMA */
4453 static void set_zonelist_order(void)
4455 current_zonelist_order = ZONELIST_ORDER_ZONE;
4458 static void build_zonelists(pg_data_t *pgdat)
4460 int node, local_node;
4462 struct zonelist *zonelist;
4464 local_node = pgdat->node_id;
4466 zonelist = &pgdat->node_zonelists[0];
4467 j = build_zonelists_node(pgdat, zonelist, 0);
4470 * Now we build the zonelist so that it contains the zones
4471 * of all the other nodes.
4472 * We don't want to pressure a particular node, so when
4473 * building the zones for node N, we make sure that the
4474 * zones coming right after the local ones are those from
4475 * node N+1 (modulo N)
4477 for (node = local_node + 1; node < MAX_NUMNODES; node++) {
4478 if (!node_online(node))
4480 j = build_zonelists_node(NODE_DATA(node), zonelist, j);
4482 for (node = 0; node < local_node; node++) {
4483 if (!node_online(node))
4485 j = build_zonelists_node(NODE_DATA(node), zonelist, j);
4488 zonelist->_zonerefs[j].zone = NULL;
4489 zonelist->_zonerefs[j].zone_idx = 0;
4492 #endif /* CONFIG_NUMA */
4495 * Boot pageset table. One per cpu which is going to be used for all
4496 * zones and all nodes. The parameters will be set in such a way
4497 * that an item put on a list will immediately be handed over to
4498 * the buddy list. This is safe since pageset manipulation is done
4499 * with interrupts disabled.
4501 * The boot_pagesets must be kept even after bootup is complete for
4502 * unused processors and/or zones. They do play a role for bootstrapping
4503 * hotplugged processors.
4505 * zoneinfo_show() and maybe other functions do
4506 * not check if the processor is online before following the pageset pointer.
4507 * Other parts of the kernel may not check if the zone is available.
4509 static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch);
4510 static DEFINE_PER_CPU(struct per_cpu_pageset, boot_pageset);
4511 static void setup_zone_pageset(struct zone *zone);
4514 * Global mutex to protect against size modification of zonelists
4515 * as well as to serialize pageset setup for the new populated zone.
4517 DEFINE_MUTEX(zonelists_mutex);
4519 /* return values int ....just for stop_machine() */
4520 static int __build_all_zonelists(void *data)
4524 pg_data_t *self = data;
4527 memset(node_load, 0, sizeof(node_load));
4530 if (self && !node_online(self->node_id)) {
4531 build_zonelists(self);
4534 for_each_online_node(nid) {
4535 pg_data_t *pgdat = NODE_DATA(nid);
4537 build_zonelists(pgdat);
4541 * Initialize the boot_pagesets that are going to be used
4542 * for bootstrapping processors. The real pagesets for
4543 * each zone will be allocated later when the per cpu
4544 * allocator is available.
4546 * boot_pagesets are used also for bootstrapping offline
4547 * cpus if the system is already booted because the pagesets
4548 * are needed to initialize allocators on a specific cpu too.
4549 * F.e. the percpu allocator needs the page allocator which
4550 * needs the percpu allocator in order to allocate its pagesets
4551 * (a chicken-egg dilemma).
4553 for_each_possible_cpu(cpu) {
4554 setup_pageset(&per_cpu(boot_pageset, cpu), 0);
4556 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
4558 * We now know the "local memory node" for each node--
4559 * i.e., the node of the first zone in the generic zonelist.
4560 * Set up numa_mem percpu variable for on-line cpus. During
4561 * boot, only the boot cpu should be on-line; we'll init the
4562 * secondary cpus' numa_mem as they come on-line. During
4563 * node/memory hotplug, we'll fixup all on-line cpus.
4565 if (cpu_online(cpu))
4566 set_cpu_numa_mem(cpu, local_memory_node(cpu_to_node(cpu)));
4573 static noinline void __init
4574 build_all_zonelists_init(void)
4576 __build_all_zonelists(NULL);
4577 mminit_verify_zonelist();
4578 cpuset_init_current_mems_allowed();
4582 * Called with zonelists_mutex held always
4583 * unless system_state == SYSTEM_BOOTING.
4585 * __ref due to (1) call of __meminit annotated setup_zone_pageset
4586 * [we're only called with non-NULL zone through __meminit paths] and
4587 * (2) call of __init annotated helper build_all_zonelists_init
4588 * [protected by SYSTEM_BOOTING].
4590 void __ref build_all_zonelists(pg_data_t *pgdat, struct zone *zone)
4592 set_zonelist_order();
4594 if (system_state == SYSTEM_BOOTING) {
4595 build_all_zonelists_init();
4597 #ifdef CONFIG_MEMORY_HOTPLUG
4599 setup_zone_pageset(zone);
4601 /* we have to stop all cpus to guarantee there is no user
4603 stop_machine(__build_all_zonelists, pgdat, NULL);
4604 /* cpuset refresh routine should be here */
4606 vm_total_pages = nr_free_pagecache_pages();
4608 * Disable grouping by mobility if the number of pages in the
4609 * system is too low to allow the mechanism to work. It would be
4610 * more accurate, but expensive to check per-zone. This check is
4611 * made on memory-hotadd so a system can start with mobility
4612 * disabled and enable it later
4614 if (vm_total_pages < (pageblock_nr_pages * MIGRATE_TYPES))
4615 page_group_by_mobility_disabled = 1;
4617 page_group_by_mobility_disabled = 0;
4619 pr_info("Built %i zonelists in %s order, mobility grouping %s. "
4620 "Total pages: %ld\n",
4622 zonelist_order_name[current_zonelist_order],
4623 page_group_by_mobility_disabled ? "off" : "on",
4626 pr_info("Policy zone: %s\n", zone_names[policy_zone]);
4631 * Helper functions to size the waitqueue hash table.
4632 * Essentially these want to choose hash table sizes sufficiently
4633 * large so that collisions trying to wait on pages are rare.
4634 * But in fact, the number of active page waitqueues on typical
4635 * systems is ridiculously low, less than 200. So this is even
4636 * conservative, even though it seems large.
4638 * The constant PAGES_PER_WAITQUEUE specifies the ratio of pages to
4639 * waitqueues, i.e. the size of the waitq table given the number of pages.
4641 #define PAGES_PER_WAITQUEUE 256
4643 #ifndef CONFIG_MEMORY_HOTPLUG
4644 static inline unsigned long wait_table_hash_nr_entries(unsigned long pages)
4646 unsigned long size = 1;
4648 pages /= PAGES_PER_WAITQUEUE;
4650 while (size < pages)
4654 * Once we have dozens or even hundreds of threads sleeping
4655 * on IO we've got bigger problems than wait queue collision.
4656 * Limit the size of the wait table to a reasonable size.
4658 size = min(size, 4096UL);
4660 return max(size, 4UL);
4664 * A zone's size might be changed by hot-add, so it is not possible to determine
4665 * a suitable size for its wait_table. So we use the maximum size now.
4667 * The max wait table size = 4096 x sizeof(wait_queue_head_t). ie:
4669 * i386 (preemption config) : 4096 x 16 = 64Kbyte.
4670 * ia64, x86-64 (no preemption): 4096 x 20 = 80Kbyte.
4671 * ia64, x86-64 (preemption) : 4096 x 24 = 96Kbyte.
4673 * The maximum entries are prepared when a zone's memory is (512K + 256) pages
4674 * or more by the traditional way. (See above). It equals:
4676 * i386, x86-64, powerpc(4K page size) : = ( 2G + 1M)byte.
4677 * ia64(16K page size) : = ( 8G + 4M)byte.
4678 * powerpc (64K page size) : = (32G +16M)byte.
4680 static inline unsigned long wait_table_hash_nr_entries(unsigned long pages)
4687 * This is an integer logarithm so that shifts can be used later
4688 * to extract the more random high bits from the multiplicative
4689 * hash function before the remainder is taken.
4691 static inline unsigned long wait_table_bits(unsigned long size)
4697 * Initially all pages are reserved - free ones are freed
4698 * up by free_all_bootmem() once the early boot process is
4699 * done. Non-atomic initialization, single-pass.
4701 void __meminit memmap_init_zone(unsigned long size, int nid, unsigned long zone,
4702 unsigned long start_pfn, enum memmap_context context)
4704 struct vmem_altmap *altmap = to_vmem_altmap(__pfn_to_phys(start_pfn));
4705 unsigned long end_pfn = start_pfn + size;
4706 pg_data_t *pgdat = NODE_DATA(nid);
4708 unsigned long nr_initialised = 0;
4709 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
4710 struct memblock_region *r = NULL, *tmp;
4713 if (highest_memmap_pfn < end_pfn - 1)
4714 highest_memmap_pfn = end_pfn - 1;
4717 * Honor reservation requested by the driver for this ZONE_DEVICE
4720 if (altmap && start_pfn == altmap->base_pfn)
4721 start_pfn += altmap->reserve;
4723 for (pfn = start_pfn; pfn < end_pfn; pfn++) {
4725 * There can be holes in boot-time mem_map[]s handed to this
4726 * function. They do not exist on hotplugged memory.
4728 if (context != MEMMAP_EARLY)
4731 if (!early_pfn_valid(pfn))
4733 if (!early_pfn_in_nid(pfn, nid))
4735 if (!update_defer_init(pgdat, pfn, end_pfn, &nr_initialised))
4738 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
4740 * If not mirrored_kernelcore and ZONE_MOVABLE exists, range
4741 * from zone_movable_pfn[nid] to end of each node should be
4742 * ZONE_MOVABLE not ZONE_NORMAL. skip it.
4744 if (!mirrored_kernelcore && zone_movable_pfn[nid])
4745 if (zone == ZONE_NORMAL && pfn >= zone_movable_pfn[nid])
4749 * Check given memblock attribute by firmware which can affect
4750 * kernel memory layout. If zone==ZONE_MOVABLE but memory is
4751 * mirrored, it's an overlapped memmap init. skip it.
4753 if (mirrored_kernelcore && zone == ZONE_MOVABLE) {
4754 if (!r || pfn >= memblock_region_memory_end_pfn(r)) {
4755 for_each_memblock(memory, tmp)
4756 if (pfn < memblock_region_memory_end_pfn(tmp))
4760 if (pfn >= memblock_region_memory_base_pfn(r) &&
4761 memblock_is_mirror(r)) {
4762 /* already initialized as NORMAL */
4763 pfn = memblock_region_memory_end_pfn(r);
4771 * Mark the block movable so that blocks are reserved for
4772 * movable at startup. This will force kernel allocations
4773 * to reserve their blocks rather than leaking throughout
4774 * the address space during boot when many long-lived
4775 * kernel allocations are made.
4777 * bitmap is created for zone's valid pfn range. but memmap
4778 * can be created for invalid pages (for alignment)
4779 * check here not to call set_pageblock_migratetype() against
4782 if (!(pfn & (pageblock_nr_pages - 1))) {
4783 struct page *page = pfn_to_page(pfn);
4785 __init_single_page(page, pfn, zone, nid);
4786 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
4788 __init_single_pfn(pfn, zone, nid);
4793 static void __meminit zone_init_free_lists(struct zone *zone)
4795 unsigned int order, t;
4796 for_each_migratetype_order(order, t) {
4797 INIT_LIST_HEAD(&zone->free_area[order].free_list[t]);
4798 zone->free_area[order].nr_free = 0;
4802 #ifndef __HAVE_ARCH_MEMMAP_INIT
4803 #define memmap_init(size, nid, zone, start_pfn) \
4804 memmap_init_zone((size), (nid), (zone), (start_pfn), MEMMAP_EARLY)
4807 static int zone_batchsize(struct zone *zone)
4813 * The per-cpu-pages pools are set to around 1000th of the
4814 * size of the zone. But no more than 1/2 of a meg.
4816 * OK, so we don't know how big the cache is. So guess.
4818 batch = zone->managed_pages / 1024;
4819 if (batch * PAGE_SIZE > 512 * 1024)
4820 batch = (512 * 1024) / PAGE_SIZE;
4821 batch /= 4; /* We effectively *= 4 below */
4826 * Clamp the batch to a 2^n - 1 value. Having a power
4827 * of 2 value was found to be more likely to have
4828 * suboptimal cache aliasing properties in some cases.
4830 * For example if 2 tasks are alternately allocating
4831 * batches of pages, one task can end up with a lot
4832 * of pages of one half of the possible page colors
4833 * and the other with pages of the other colors.
4835 batch = rounddown_pow_of_two(batch + batch/2) - 1;
4840 /* The deferral and batching of frees should be suppressed under NOMMU
4843 * The problem is that NOMMU needs to be able to allocate large chunks
4844 * of contiguous memory as there's no hardware page translation to
4845 * assemble apparent contiguous memory from discontiguous pages.
4847 * Queueing large contiguous runs of pages for batching, however,
4848 * causes the pages to actually be freed in smaller chunks. As there
4849 * can be a significant delay between the individual batches being
4850 * recycled, this leads to the once large chunks of space being
4851 * fragmented and becoming unavailable for high-order allocations.
4858 * pcp->high and pcp->batch values are related and dependent on one another:
4859 * ->batch must never be higher then ->high.
4860 * The following function updates them in a safe manner without read side
4863 * Any new users of pcp->batch and pcp->high should ensure they can cope with
4864 * those fields changing asynchronously (acording the the above rule).
4866 * mutex_is_locked(&pcp_batch_high_lock) required when calling this function
4867 * outside of boot time (or some other assurance that no concurrent updaters
4870 static void pageset_update(struct per_cpu_pages *pcp, unsigned long high,
4871 unsigned long batch)
4873 /* start with a fail safe value for batch */
4877 /* Update high, then batch, in order */
4884 /* a companion to pageset_set_high() */
4885 static void pageset_set_batch(struct per_cpu_pageset *p, unsigned long batch)
4887 pageset_update(&p->pcp, 6 * batch, max(1UL, 1 * batch));
4890 static void pageset_init(struct per_cpu_pageset *p)
4892 struct per_cpu_pages *pcp;
4895 memset(p, 0, sizeof(*p));
4899 for (migratetype = 0; migratetype < MIGRATE_PCPTYPES; migratetype++)
4900 INIT_LIST_HEAD(&pcp->lists[migratetype]);
4903 static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch)
4906 pageset_set_batch(p, batch);
4910 * pageset_set_high() sets the high water mark for hot per_cpu_pagelist
4911 * to the value high for the pageset p.
4913 static void pageset_set_high(struct per_cpu_pageset *p,
4916 unsigned long batch = max(1UL, high / 4);
4917 if ((high / 4) > (PAGE_SHIFT * 8))
4918 batch = PAGE_SHIFT * 8;
4920 pageset_update(&p->pcp, high, batch);
4923 static void pageset_set_high_and_batch(struct zone *zone,
4924 struct per_cpu_pageset *pcp)
4926 if (percpu_pagelist_fraction)
4927 pageset_set_high(pcp,
4928 (zone->managed_pages /
4929 percpu_pagelist_fraction));
4931 pageset_set_batch(pcp, zone_batchsize(zone));
4934 static void __meminit zone_pageset_init(struct zone *zone, int cpu)
4936 struct per_cpu_pageset *pcp = per_cpu_ptr(zone->pageset, cpu);
4939 pageset_set_high_and_batch(zone, pcp);
4942 static void __meminit setup_zone_pageset(struct zone *zone)
4945 zone->pageset = alloc_percpu(struct per_cpu_pageset);
4946 for_each_possible_cpu(cpu)
4947 zone_pageset_init(zone, cpu);
4951 * Allocate per cpu pagesets and initialize them.
4952 * Before this call only boot pagesets were available.
4954 void __init setup_per_cpu_pageset(void)
4958 for_each_populated_zone(zone)
4959 setup_zone_pageset(zone);
4962 static noinline __init_refok
4963 int zone_wait_table_init(struct zone *zone, unsigned long zone_size_pages)
4969 * The per-page waitqueue mechanism uses hashed waitqueues
4972 zone->wait_table_hash_nr_entries =
4973 wait_table_hash_nr_entries(zone_size_pages);
4974 zone->wait_table_bits =
4975 wait_table_bits(zone->wait_table_hash_nr_entries);
4976 alloc_size = zone->wait_table_hash_nr_entries
4977 * sizeof(wait_queue_head_t);
4979 if (!slab_is_available()) {
4980 zone->wait_table = (wait_queue_head_t *)
4981 memblock_virt_alloc_node_nopanic(
4982 alloc_size, zone->zone_pgdat->node_id);
4985 * This case means that a zone whose size was 0 gets new memory
4986 * via memory hot-add.
4987 * But it may be the case that a new node was hot-added. In
4988 * this case vmalloc() will not be able to use this new node's
4989 * memory - this wait_table must be initialized to use this new
4990 * node itself as well.
4991 * To use this new node's memory, further consideration will be
4994 zone->wait_table = vmalloc(alloc_size);
4996 if (!zone->wait_table)
4999 for (i = 0; i < zone->wait_table_hash_nr_entries; ++i)
5000 init_waitqueue_head(zone->wait_table + i);
5005 static __meminit void zone_pcp_init(struct zone *zone)
5008 * per cpu subsystem is not up at this point. The following code
5009 * relies on the ability of the linker to provide the
5010 * offset of a (static) per cpu variable into the per cpu area.
5012 zone->pageset = &boot_pageset;
5014 if (populated_zone(zone))
5015 printk(KERN_DEBUG " %s zone: %lu pages, LIFO batch:%u\n",
5016 zone->name, zone->present_pages,
5017 zone_batchsize(zone));
5020 int __meminit init_currently_empty_zone(struct zone *zone,
5021 unsigned long zone_start_pfn,
5024 struct pglist_data *pgdat = zone->zone_pgdat;
5026 ret = zone_wait_table_init(zone, size);
5029 pgdat->nr_zones = zone_idx(zone) + 1;
5031 zone->zone_start_pfn = zone_start_pfn;
5033 mminit_dprintk(MMINIT_TRACE, "memmap_init",
5034 "Initialising map node %d zone %lu pfns %lu -> %lu\n",
5036 (unsigned long)zone_idx(zone),
5037 zone_start_pfn, (zone_start_pfn + size));
5039 zone_init_free_lists(zone);
5044 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
5045 #ifndef CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID
5048 * Required by SPARSEMEM. Given a PFN, return what node the PFN is on.
5050 int __meminit __early_pfn_to_nid(unsigned long pfn,
5051 struct mminit_pfnnid_cache *state)
5053 unsigned long start_pfn, end_pfn;
5056 if (state->last_start <= pfn && pfn < state->last_end)
5057 return state->last_nid;
5059 nid = memblock_search_pfn_nid(pfn, &start_pfn, &end_pfn);
5061 state->last_start = start_pfn;
5062 state->last_end = end_pfn;
5063 state->last_nid = nid;
5068 #endif /* CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID */
5071 * free_bootmem_with_active_regions - Call memblock_free_early_nid for each active range
5072 * @nid: The node to free memory on. If MAX_NUMNODES, all nodes are freed.
5073 * @max_low_pfn: The highest PFN that will be passed to memblock_free_early_nid
5075 * If an architecture guarantees that all ranges registered contain no holes
5076 * and may be freed, this this function may be used instead of calling
5077 * memblock_free_early_nid() manually.
5079 void __init free_bootmem_with_active_regions(int nid, unsigned long max_low_pfn)
5081 unsigned long start_pfn, end_pfn;
5084 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, &this_nid) {
5085 start_pfn = min(start_pfn, max_low_pfn);
5086 end_pfn = min(end_pfn, max_low_pfn);
5088 if (start_pfn < end_pfn)
5089 memblock_free_early_nid(PFN_PHYS(start_pfn),
5090 (end_pfn - start_pfn) << PAGE_SHIFT,
5096 * sparse_memory_present_with_active_regions - Call memory_present for each active range
5097 * @nid: The node to call memory_present for. If MAX_NUMNODES, all nodes will be used.
5099 * If an architecture guarantees that all ranges registered contain no holes and may
5100 * be freed, this function may be used instead of calling memory_present() manually.
5102 void __init sparse_memory_present_with_active_regions(int nid)
5104 unsigned long start_pfn, end_pfn;
5107 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, &this_nid)
5108 memory_present(this_nid, start_pfn, end_pfn);
5112 * get_pfn_range_for_nid - Return the start and end page frames for a node
5113 * @nid: The nid to return the range for. If MAX_NUMNODES, the min and max PFN are returned.
5114 * @start_pfn: Passed by reference. On return, it will have the node start_pfn.
5115 * @end_pfn: Passed by reference. On return, it will have the node end_pfn.
5117 * It returns the start and end page frame of a node based on information
5118 * provided by memblock_set_node(). If called for a node
5119 * with no available memory, a warning is printed and the start and end
5122 void __meminit get_pfn_range_for_nid(unsigned int nid,
5123 unsigned long *start_pfn, unsigned long *end_pfn)
5125 unsigned long this_start_pfn, this_end_pfn;
5131 for_each_mem_pfn_range(i, nid, &this_start_pfn, &this_end_pfn, NULL) {
5132 *start_pfn = min(*start_pfn, this_start_pfn);
5133 *end_pfn = max(*end_pfn, this_end_pfn);
5136 if (*start_pfn == -1UL)
5141 * This finds a zone that can be used for ZONE_MOVABLE pages. The
5142 * assumption is made that zones within a node are ordered in monotonic
5143 * increasing memory addresses so that the "highest" populated zone is used
5145 static void __init find_usable_zone_for_movable(void)
5148 for (zone_index = MAX_NR_ZONES - 1; zone_index >= 0; zone_index--) {
5149 if (zone_index == ZONE_MOVABLE)
5152 if (arch_zone_highest_possible_pfn[zone_index] >
5153 arch_zone_lowest_possible_pfn[zone_index])
5157 VM_BUG_ON(zone_index == -1);
5158 movable_zone = zone_index;
5162 * The zone ranges provided by the architecture do not include ZONE_MOVABLE
5163 * because it is sized independent of architecture. Unlike the other zones,
5164 * the starting point for ZONE_MOVABLE is not fixed. It may be different
5165 * in each node depending on the size of each node and how evenly kernelcore
5166 * is distributed. This helper function adjusts the zone ranges
5167 * provided by the architecture for a given node by using the end of the
5168 * highest usable zone for ZONE_MOVABLE. This preserves the assumption that
5169 * zones within a node are in order of monotonic increases memory addresses
5171 static void __meminit adjust_zone_range_for_zone_movable(int nid,
5172 unsigned long zone_type,
5173 unsigned long node_start_pfn,
5174 unsigned long node_end_pfn,
5175 unsigned long *zone_start_pfn,
5176 unsigned long *zone_end_pfn)
5178 /* Only adjust if ZONE_MOVABLE is on this node */
5179 if (zone_movable_pfn[nid]) {
5180 /* Size ZONE_MOVABLE */
5181 if (zone_type == ZONE_MOVABLE) {
5182 *zone_start_pfn = zone_movable_pfn[nid];
5183 *zone_end_pfn = min(node_end_pfn,
5184 arch_zone_highest_possible_pfn[movable_zone]);
5186 /* Check if this whole range is within ZONE_MOVABLE */
5187 } else if (*zone_start_pfn >= zone_movable_pfn[nid])
5188 *zone_start_pfn = *zone_end_pfn;
5193 * Return the number of pages a zone spans in a node, including holes
5194 * present_pages = zone_spanned_pages_in_node() - zone_absent_pages_in_node()
5196 static unsigned long __meminit zone_spanned_pages_in_node(int nid,
5197 unsigned long zone_type,
5198 unsigned long node_start_pfn,
5199 unsigned long node_end_pfn,
5200 unsigned long *zone_start_pfn,
5201 unsigned long *zone_end_pfn,
5202 unsigned long *ignored)
5204 /* When hotadd a new node from cpu_up(), the node should be empty */
5205 if (!node_start_pfn && !node_end_pfn)
5208 /* Get the start and end of the zone */
5209 *zone_start_pfn = arch_zone_lowest_possible_pfn[zone_type];
5210 *zone_end_pfn = arch_zone_highest_possible_pfn[zone_type];
5211 adjust_zone_range_for_zone_movable(nid, zone_type,
5212 node_start_pfn, node_end_pfn,
5213 zone_start_pfn, zone_end_pfn);
5215 /* Check that this node has pages within the zone's required range */
5216 if (*zone_end_pfn < node_start_pfn || *zone_start_pfn > node_end_pfn)
5219 /* Move the zone boundaries inside the node if necessary */
5220 *zone_end_pfn = min(*zone_end_pfn, node_end_pfn);
5221 *zone_start_pfn = max(*zone_start_pfn, node_start_pfn);
5223 /* Return the spanned pages */
5224 return *zone_end_pfn - *zone_start_pfn;
5228 * Return the number of holes in a range on a node. If nid is MAX_NUMNODES,
5229 * then all holes in the requested range will be accounted for.
5231 unsigned long __meminit __absent_pages_in_range(int nid,
5232 unsigned long range_start_pfn,
5233 unsigned long range_end_pfn)
5235 unsigned long nr_absent = range_end_pfn - range_start_pfn;
5236 unsigned long start_pfn, end_pfn;
5239 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
5240 start_pfn = clamp(start_pfn, range_start_pfn, range_end_pfn);
5241 end_pfn = clamp(end_pfn, range_start_pfn, range_end_pfn);
5242 nr_absent -= end_pfn - start_pfn;
5248 * absent_pages_in_range - Return number of page frames in holes within a range
5249 * @start_pfn: The start PFN to start searching for holes
5250 * @end_pfn: The end PFN to stop searching for holes
5252 * It returns the number of pages frames in memory holes within a range.
5254 unsigned long __init absent_pages_in_range(unsigned long start_pfn,
5255 unsigned long end_pfn)
5257 return __absent_pages_in_range(MAX_NUMNODES, start_pfn, end_pfn);
5260 /* Return the number of page frames in holes in a zone on a node */
5261 static unsigned long __meminit zone_absent_pages_in_node(int nid,
5262 unsigned long zone_type,
5263 unsigned long node_start_pfn,
5264 unsigned long node_end_pfn,
5265 unsigned long *ignored)
5267 unsigned long zone_low = arch_zone_lowest_possible_pfn[zone_type];
5268 unsigned long zone_high = arch_zone_highest_possible_pfn[zone_type];
5269 unsigned long zone_start_pfn, zone_end_pfn;
5270 unsigned long nr_absent;
5272 /* When hotadd a new node from cpu_up(), the node should be empty */
5273 if (!node_start_pfn && !node_end_pfn)
5276 zone_start_pfn = clamp(node_start_pfn, zone_low, zone_high);
5277 zone_end_pfn = clamp(node_end_pfn, zone_low, zone_high);
5279 adjust_zone_range_for_zone_movable(nid, zone_type,
5280 node_start_pfn, node_end_pfn,
5281 &zone_start_pfn, &zone_end_pfn);
5282 nr_absent = __absent_pages_in_range(nid, zone_start_pfn, zone_end_pfn);
5285 * ZONE_MOVABLE handling.
5286 * Treat pages to be ZONE_MOVABLE in ZONE_NORMAL as absent pages
5289 if (zone_movable_pfn[nid]) {
5290 if (mirrored_kernelcore) {
5291 unsigned long start_pfn, end_pfn;
5292 struct memblock_region *r;
5294 for_each_memblock(memory, r) {
5295 start_pfn = clamp(memblock_region_memory_base_pfn(r),
5296 zone_start_pfn, zone_end_pfn);
5297 end_pfn = clamp(memblock_region_memory_end_pfn(r),
5298 zone_start_pfn, zone_end_pfn);
5300 if (zone_type == ZONE_MOVABLE &&
5301 memblock_is_mirror(r))
5302 nr_absent += end_pfn - start_pfn;
5304 if (zone_type == ZONE_NORMAL &&
5305 !memblock_is_mirror(r))
5306 nr_absent += end_pfn - start_pfn;
5309 if (zone_type == ZONE_NORMAL)
5310 nr_absent += node_end_pfn - zone_movable_pfn[nid];
5317 #else /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
5318 static inline unsigned long __meminit zone_spanned_pages_in_node(int nid,
5319 unsigned long zone_type,
5320 unsigned long node_start_pfn,
5321 unsigned long node_end_pfn,
5322 unsigned long *zone_start_pfn,
5323 unsigned long *zone_end_pfn,
5324 unsigned long *zones_size)
5328 *zone_start_pfn = node_start_pfn;
5329 for (zone = 0; zone < zone_type; zone++)
5330 *zone_start_pfn += zones_size[zone];
5332 *zone_end_pfn = *zone_start_pfn + zones_size[zone_type];
5334 return zones_size[zone_type];
5337 static inline unsigned long __meminit zone_absent_pages_in_node(int nid,
5338 unsigned long zone_type,
5339 unsigned long node_start_pfn,
5340 unsigned long node_end_pfn,
5341 unsigned long *zholes_size)
5346 return zholes_size[zone_type];
5349 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
5351 static void __meminit calculate_node_totalpages(struct pglist_data *pgdat,
5352 unsigned long node_start_pfn,
5353 unsigned long node_end_pfn,
5354 unsigned long *zones_size,
5355 unsigned long *zholes_size)
5357 unsigned long realtotalpages = 0, totalpages = 0;
5360 for (i = 0; i < MAX_NR_ZONES; i++) {
5361 struct zone *zone = pgdat->node_zones + i;
5362 unsigned long zone_start_pfn, zone_end_pfn;
5363 unsigned long size, real_size;
5365 size = zone_spanned_pages_in_node(pgdat->node_id, i,
5371 real_size = size - zone_absent_pages_in_node(pgdat->node_id, i,
5372 node_start_pfn, node_end_pfn,
5375 zone->zone_start_pfn = zone_start_pfn;
5377 zone->zone_start_pfn = 0;
5378 zone->spanned_pages = size;
5379 zone->present_pages = real_size;
5382 realtotalpages += real_size;
5385 pgdat->node_spanned_pages = totalpages;
5386 pgdat->node_present_pages = realtotalpages;
5387 printk(KERN_DEBUG "On node %d totalpages: %lu\n", pgdat->node_id,
5391 #ifndef CONFIG_SPARSEMEM
5393 * Calculate the size of the zone->blockflags rounded to an unsigned long
5394 * Start by making sure zonesize is a multiple of pageblock_order by rounding
5395 * up. Then use 1 NR_PAGEBLOCK_BITS worth of bits per pageblock, finally
5396 * round what is now in bits to nearest long in bits, then return it in
5399 static unsigned long __init usemap_size(unsigned long zone_start_pfn, unsigned long zonesize)
5401 unsigned long usemapsize;
5403 zonesize += zone_start_pfn & (pageblock_nr_pages-1);
5404 usemapsize = roundup(zonesize, pageblock_nr_pages);
5405 usemapsize = usemapsize >> pageblock_order;
5406 usemapsize *= NR_PAGEBLOCK_BITS;
5407 usemapsize = roundup(usemapsize, 8 * sizeof(unsigned long));
5409 return usemapsize / 8;
5412 static void __init setup_usemap(struct pglist_data *pgdat,
5414 unsigned long zone_start_pfn,
5415 unsigned long zonesize)
5417 unsigned long usemapsize = usemap_size(zone_start_pfn, zonesize);
5418 zone->pageblock_flags = NULL;
5420 zone->pageblock_flags =
5421 memblock_virt_alloc_node_nopanic(usemapsize,
5425 static inline void setup_usemap(struct pglist_data *pgdat, struct zone *zone,
5426 unsigned long zone_start_pfn, unsigned long zonesize) {}
5427 #endif /* CONFIG_SPARSEMEM */
5429 #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
5431 /* Initialise the number of pages represented by NR_PAGEBLOCK_BITS */
5432 void __paginginit set_pageblock_order(void)
5436 /* Check that pageblock_nr_pages has not already been setup */
5437 if (pageblock_order)
5440 if (HPAGE_SHIFT > PAGE_SHIFT)
5441 order = HUGETLB_PAGE_ORDER;
5443 order = MAX_ORDER - 1;
5446 * Assume the largest contiguous order of interest is a huge page.
5447 * This value may be variable depending on boot parameters on IA64 and
5450 pageblock_order = order;
5452 #else /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
5455 * When CONFIG_HUGETLB_PAGE_SIZE_VARIABLE is not set, set_pageblock_order()
5456 * is unused as pageblock_order is set at compile-time. See
5457 * include/linux/pageblock-flags.h for the values of pageblock_order based on
5460 void __paginginit set_pageblock_order(void)
5464 #endif /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
5466 static unsigned long __paginginit calc_memmap_size(unsigned long spanned_pages,
5467 unsigned long present_pages)
5469 unsigned long pages = spanned_pages;
5472 * Provide a more accurate estimation if there are holes within
5473 * the zone and SPARSEMEM is in use. If there are holes within the
5474 * zone, each populated memory region may cost us one or two extra
5475 * memmap pages due to alignment because memmap pages for each
5476 * populated regions may not naturally algined on page boundary.
5477 * So the (present_pages >> 4) heuristic is a tradeoff for that.
5479 if (spanned_pages > present_pages + (present_pages >> 4) &&
5480 IS_ENABLED(CONFIG_SPARSEMEM))
5481 pages = present_pages;
5483 return PAGE_ALIGN(pages * sizeof(struct page)) >> PAGE_SHIFT;
5487 * Set up the zone data structures:
5488 * - mark all pages reserved
5489 * - mark all memory queues empty
5490 * - clear the memory bitmaps
5492 * NOTE: pgdat should get zeroed by caller.
5494 static void __paginginit free_area_init_core(struct pglist_data *pgdat)
5497 int nid = pgdat->node_id;
5500 pgdat_resize_init(pgdat);
5501 #ifdef CONFIG_NUMA_BALANCING
5502 spin_lock_init(&pgdat->numabalancing_migrate_lock);
5503 pgdat->numabalancing_migrate_nr_pages = 0;
5504 pgdat->numabalancing_migrate_next_window = jiffies;
5506 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
5507 spin_lock_init(&pgdat->split_queue_lock);
5508 INIT_LIST_HEAD(&pgdat->split_queue);
5509 pgdat->split_queue_len = 0;
5511 init_waitqueue_head(&pgdat->kswapd_wait);
5512 init_waitqueue_head(&pgdat->pfmemalloc_wait);
5513 #ifdef CONFIG_COMPACTION
5514 init_waitqueue_head(&pgdat->kcompactd_wait);
5516 pgdat_page_ext_init(pgdat);
5518 for (j = 0; j < MAX_NR_ZONES; j++) {
5519 struct zone *zone = pgdat->node_zones + j;
5520 unsigned long size, realsize, freesize, memmap_pages;
5521 unsigned long zone_start_pfn = zone->zone_start_pfn;
5523 size = zone->spanned_pages;
5524 realsize = freesize = zone->present_pages;
5527 * Adjust freesize so that it accounts for how much memory
5528 * is used by this zone for memmap. This affects the watermark
5529 * and per-cpu initialisations
5531 memmap_pages = calc_memmap_size(size, realsize);
5532 if (!is_highmem_idx(j)) {
5533 if (freesize >= memmap_pages) {
5534 freesize -= memmap_pages;
5537 " %s zone: %lu pages used for memmap\n",
5538 zone_names[j], memmap_pages);
5541 " %s zone: %lu pages exceeds freesize %lu\n",
5542 zone_names[j], memmap_pages, freesize);
5545 /* Account for reserved pages */
5546 if (j == 0 && freesize > dma_reserve) {
5547 freesize -= dma_reserve;
5548 printk(KERN_DEBUG " %s zone: %lu pages reserved\n",
5549 zone_names[0], dma_reserve);
5552 if (!is_highmem_idx(j))
5553 nr_kernel_pages += freesize;
5554 /* Charge for highmem memmap if there are enough kernel pages */
5555 else if (nr_kernel_pages > memmap_pages * 2)
5556 nr_kernel_pages -= memmap_pages;
5557 nr_all_pages += freesize;
5560 * Set an approximate value for lowmem here, it will be adjusted
5561 * when the bootmem allocator frees pages into the buddy system.
5562 * And all highmem pages will be managed by the buddy system.
5564 zone->managed_pages = is_highmem_idx(j) ? realsize : freesize;
5567 zone->min_unmapped_pages = (freesize*sysctl_min_unmapped_ratio)
5569 zone->min_slab_pages = (freesize * sysctl_min_slab_ratio) / 100;
5571 zone->name = zone_names[j];
5572 spin_lock_init(&zone->lock);
5573 spin_lock_init(&zone->lru_lock);
5574 zone_seqlock_init(zone);
5575 zone->zone_pgdat = pgdat;
5576 zone_pcp_init(zone);
5578 /* For bootup, initialized properly in watermark setup */
5579 mod_zone_page_state(zone, NR_ALLOC_BATCH, zone->managed_pages);
5581 lruvec_init(&zone->lruvec);
5585 set_pageblock_order();
5586 setup_usemap(pgdat, zone, zone_start_pfn, size);
5587 ret = init_currently_empty_zone(zone, zone_start_pfn, size);
5589 memmap_init(size, nid, j, zone_start_pfn);
5593 static void __init_refok alloc_node_mem_map(struct pglist_data *pgdat)
5595 unsigned long __maybe_unused start = 0;
5596 unsigned long __maybe_unused offset = 0;
5598 /* Skip empty nodes */
5599 if (!pgdat->node_spanned_pages)
5602 #ifdef CONFIG_FLAT_NODE_MEM_MAP
5603 start = pgdat->node_start_pfn & ~(MAX_ORDER_NR_PAGES - 1);
5604 offset = pgdat->node_start_pfn - start;
5605 /* ia64 gets its own node_mem_map, before this, without bootmem */
5606 if (!pgdat->node_mem_map) {
5607 unsigned long size, end;
5611 * The zone's endpoints aren't required to be MAX_ORDER
5612 * aligned but the node_mem_map endpoints must be in order
5613 * for the buddy allocator to function correctly.
5615 end = pgdat_end_pfn(pgdat);
5616 end = ALIGN(end, MAX_ORDER_NR_PAGES);
5617 size = (end - start) * sizeof(struct page);
5618 map = alloc_remap(pgdat->node_id, size);
5620 map = memblock_virt_alloc_node_nopanic(size,
5622 pgdat->node_mem_map = map + offset;
5624 #ifndef CONFIG_NEED_MULTIPLE_NODES
5626 * With no DISCONTIG, the global mem_map is just set as node 0's
5628 if (pgdat == NODE_DATA(0)) {
5629 mem_map = NODE_DATA(0)->node_mem_map;
5630 #if defined(CONFIG_HAVE_MEMBLOCK_NODE_MAP) || defined(CONFIG_FLATMEM)
5631 if (page_to_pfn(mem_map) != pgdat->node_start_pfn)
5633 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
5636 #endif /* CONFIG_FLAT_NODE_MEM_MAP */
5639 void __paginginit free_area_init_node(int nid, unsigned long *zones_size,
5640 unsigned long node_start_pfn, unsigned long *zholes_size)
5642 pg_data_t *pgdat = NODE_DATA(nid);
5643 unsigned long start_pfn = 0;
5644 unsigned long end_pfn = 0;
5646 /* pg_data_t should be reset to zero when it's allocated */
5647 WARN_ON(pgdat->nr_zones || pgdat->classzone_idx);
5649 reset_deferred_meminit(pgdat);
5650 pgdat->node_id = nid;
5651 pgdat->node_start_pfn = node_start_pfn;
5652 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
5653 get_pfn_range_for_nid(nid, &start_pfn, &end_pfn);
5654 pr_info("Initmem setup node %d [mem %#018Lx-%#018Lx]\n", nid,
5655 (u64)start_pfn << PAGE_SHIFT,
5656 end_pfn ? ((u64)end_pfn << PAGE_SHIFT) - 1 : 0);
5658 start_pfn = node_start_pfn;
5660 calculate_node_totalpages(pgdat, start_pfn, end_pfn,
5661 zones_size, zholes_size);
5663 alloc_node_mem_map(pgdat);
5664 #ifdef CONFIG_FLAT_NODE_MEM_MAP
5665 printk(KERN_DEBUG "free_area_init_node: node %d, pgdat %08lx, node_mem_map %08lx\n",
5666 nid, (unsigned long)pgdat,
5667 (unsigned long)pgdat->node_mem_map);
5670 free_area_init_core(pgdat);
5673 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
5675 #if MAX_NUMNODES > 1
5677 * Figure out the number of possible node ids.
5679 void __init setup_nr_node_ids(void)
5681 unsigned int highest;
5683 highest = find_last_bit(node_possible_map.bits, MAX_NUMNODES);
5684 nr_node_ids = highest + 1;
5689 * node_map_pfn_alignment - determine the maximum internode alignment
5691 * This function should be called after node map is populated and sorted.
5692 * It calculates the maximum power of two alignment which can distinguish
5695 * For example, if all nodes are 1GiB and aligned to 1GiB, the return value
5696 * would indicate 1GiB alignment with (1 << (30 - PAGE_SHIFT)). If the
5697 * nodes are shifted by 256MiB, 256MiB. Note that if only the last node is
5698 * shifted, 1GiB is enough and this function will indicate so.
5700 * This is used to test whether pfn -> nid mapping of the chosen memory
5701 * model has fine enough granularity to avoid incorrect mapping for the
5702 * populated node map.
5704 * Returns the determined alignment in pfn's. 0 if there is no alignment
5705 * requirement (single node).
5707 unsigned long __init node_map_pfn_alignment(void)
5709 unsigned long accl_mask = 0, last_end = 0;
5710 unsigned long start, end, mask;
5714 for_each_mem_pfn_range(i, MAX_NUMNODES, &start, &end, &nid) {
5715 if (!start || last_nid < 0 || last_nid == nid) {
5722 * Start with a mask granular enough to pin-point to the
5723 * start pfn and tick off bits one-by-one until it becomes
5724 * too coarse to separate the current node from the last.
5726 mask = ~((1 << __ffs(start)) - 1);
5727 while (mask && last_end <= (start & (mask << 1)))
5730 /* accumulate all internode masks */
5734 /* convert mask to number of pages */
5735 return ~accl_mask + 1;
5738 /* Find the lowest pfn for a node */
5739 static unsigned long __init find_min_pfn_for_node(int nid)
5741 unsigned long min_pfn = ULONG_MAX;
5742 unsigned long start_pfn;
5745 for_each_mem_pfn_range(i, nid, &start_pfn, NULL, NULL)
5746 min_pfn = min(min_pfn, start_pfn);
5748 if (min_pfn == ULONG_MAX) {
5750 "Could not find start_pfn for node %d\n", nid);
5758 * find_min_pfn_with_active_regions - Find the minimum PFN registered
5760 * It returns the minimum PFN based on information provided via
5761 * memblock_set_node().
5763 unsigned long __init find_min_pfn_with_active_regions(void)
5765 return find_min_pfn_for_node(MAX_NUMNODES);
5769 * early_calculate_totalpages()
5770 * Sum pages in active regions for movable zone.
5771 * Populate N_MEMORY for calculating usable_nodes.
5773 static unsigned long __init early_calculate_totalpages(void)
5775 unsigned long totalpages = 0;
5776 unsigned long start_pfn, end_pfn;
5779 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid) {
5780 unsigned long pages = end_pfn - start_pfn;
5782 totalpages += pages;
5784 node_set_state(nid, N_MEMORY);
5790 * Find the PFN the Movable zone begins in each node. Kernel memory
5791 * is spread evenly between nodes as long as the nodes have enough
5792 * memory. When they don't, some nodes will have more kernelcore than
5795 static void __init find_zone_movable_pfns_for_nodes(void)
5798 unsigned long usable_startpfn;
5799 unsigned long kernelcore_node, kernelcore_remaining;
5800 /* save the state before borrow the nodemask */
5801 nodemask_t saved_node_state = node_states[N_MEMORY];
5802 unsigned long totalpages = early_calculate_totalpages();
5803 int usable_nodes = nodes_weight(node_states[N_MEMORY]);
5804 struct memblock_region *r;
5806 /* Need to find movable_zone earlier when movable_node is specified. */
5807 find_usable_zone_for_movable();
5810 * If movable_node is specified, ignore kernelcore and movablecore
5813 if (movable_node_is_enabled()) {
5814 for_each_memblock(memory, r) {
5815 if (!memblock_is_hotpluggable(r))
5820 usable_startpfn = PFN_DOWN(r->base);
5821 zone_movable_pfn[nid] = zone_movable_pfn[nid] ?
5822 min(usable_startpfn, zone_movable_pfn[nid]) :
5830 * If kernelcore=mirror is specified, ignore movablecore option
5832 if (mirrored_kernelcore) {
5833 bool mem_below_4gb_not_mirrored = false;
5835 for_each_memblock(memory, r) {
5836 if (memblock_is_mirror(r))
5841 usable_startpfn = memblock_region_memory_base_pfn(r);
5843 if (usable_startpfn < 0x100000) {
5844 mem_below_4gb_not_mirrored = true;
5848 zone_movable_pfn[nid] = zone_movable_pfn[nid] ?
5849 min(usable_startpfn, zone_movable_pfn[nid]) :
5853 if (mem_below_4gb_not_mirrored)
5854 pr_warn("This configuration results in unmirrored kernel memory.");
5860 * If movablecore=nn[KMG] was specified, calculate what size of
5861 * kernelcore that corresponds so that memory usable for
5862 * any allocation type is evenly spread. If both kernelcore
5863 * and movablecore are specified, then the value of kernelcore
5864 * will be used for required_kernelcore if it's greater than
5865 * what movablecore would have allowed.
5867 if (required_movablecore) {
5868 unsigned long corepages;
5871 * Round-up so that ZONE_MOVABLE is at least as large as what
5872 * was requested by the user
5874 required_movablecore =
5875 roundup(required_movablecore, MAX_ORDER_NR_PAGES);
5876 required_movablecore = min(totalpages, required_movablecore);
5877 corepages = totalpages - required_movablecore;
5879 required_kernelcore = max(required_kernelcore, corepages);
5883 * If kernelcore was not specified or kernelcore size is larger
5884 * than totalpages, there is no ZONE_MOVABLE.
5886 if (!required_kernelcore || required_kernelcore >= totalpages)
5889 /* usable_startpfn is the lowest possible pfn ZONE_MOVABLE can be at */
5890 usable_startpfn = arch_zone_lowest_possible_pfn[movable_zone];
5893 /* Spread kernelcore memory as evenly as possible throughout nodes */
5894 kernelcore_node = required_kernelcore / usable_nodes;
5895 for_each_node_state(nid, N_MEMORY) {
5896 unsigned long start_pfn, end_pfn;
5899 * Recalculate kernelcore_node if the division per node
5900 * now exceeds what is necessary to satisfy the requested
5901 * amount of memory for the kernel
5903 if (required_kernelcore < kernelcore_node)
5904 kernelcore_node = required_kernelcore / usable_nodes;
5907 * As the map is walked, we track how much memory is usable
5908 * by the kernel using kernelcore_remaining. When it is
5909 * 0, the rest of the node is usable by ZONE_MOVABLE
5911 kernelcore_remaining = kernelcore_node;
5913 /* Go through each range of PFNs within this node */
5914 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
5915 unsigned long size_pages;
5917 start_pfn = max(start_pfn, zone_movable_pfn[nid]);
5918 if (start_pfn >= end_pfn)
5921 /* Account for what is only usable for kernelcore */
5922 if (start_pfn < usable_startpfn) {
5923 unsigned long kernel_pages;
5924 kernel_pages = min(end_pfn, usable_startpfn)
5927 kernelcore_remaining -= min(kernel_pages,
5928 kernelcore_remaining);
5929 required_kernelcore -= min(kernel_pages,
5930 required_kernelcore);
5932 /* Continue if range is now fully accounted */
5933 if (end_pfn <= usable_startpfn) {
5936 * Push zone_movable_pfn to the end so
5937 * that if we have to rebalance
5938 * kernelcore across nodes, we will
5939 * not double account here
5941 zone_movable_pfn[nid] = end_pfn;
5944 start_pfn = usable_startpfn;
5948 * The usable PFN range for ZONE_MOVABLE is from
5949 * start_pfn->end_pfn. Calculate size_pages as the
5950 * number of pages used as kernelcore
5952 size_pages = end_pfn - start_pfn;
5953 if (size_pages > kernelcore_remaining)
5954 size_pages = kernelcore_remaining;
5955 zone_movable_pfn[nid] = start_pfn + size_pages;
5958 * Some kernelcore has been met, update counts and
5959 * break if the kernelcore for this node has been
5962 required_kernelcore -= min(required_kernelcore,
5964 kernelcore_remaining -= size_pages;
5965 if (!kernelcore_remaining)
5971 * If there is still required_kernelcore, we do another pass with one
5972 * less node in the count. This will push zone_movable_pfn[nid] further
5973 * along on the nodes that still have memory until kernelcore is
5977 if (usable_nodes && required_kernelcore > usable_nodes)
5981 /* Align start of ZONE_MOVABLE on all nids to MAX_ORDER_NR_PAGES */
5982 for (nid = 0; nid < MAX_NUMNODES; nid++)
5983 zone_movable_pfn[nid] =
5984 roundup(zone_movable_pfn[nid], MAX_ORDER_NR_PAGES);
5987 /* restore the node_state */
5988 node_states[N_MEMORY] = saved_node_state;
5991 /* Any regular or high memory on that node ? */
5992 static void check_for_memory(pg_data_t *pgdat, int nid)
5994 enum zone_type zone_type;
5996 if (N_MEMORY == N_NORMAL_MEMORY)
5999 for (zone_type = 0; zone_type <= ZONE_MOVABLE - 1; zone_type++) {
6000 struct zone *zone = &pgdat->node_zones[zone_type];
6001 if (populated_zone(zone)) {
6002 node_set_state(nid, N_HIGH_MEMORY);
6003 if (N_NORMAL_MEMORY != N_HIGH_MEMORY &&
6004 zone_type <= ZONE_NORMAL)
6005 node_set_state(nid, N_NORMAL_MEMORY);
6012 * free_area_init_nodes - Initialise all pg_data_t and zone data
6013 * @max_zone_pfn: an array of max PFNs for each zone
6015 * This will call free_area_init_node() for each active node in the system.
6016 * Using the page ranges provided by memblock_set_node(), the size of each
6017 * zone in each node and their holes is calculated. If the maximum PFN
6018 * between two adjacent zones match, it is assumed that the zone is empty.
6019 * For example, if arch_max_dma_pfn == arch_max_dma32_pfn, it is assumed
6020 * that arch_max_dma32_pfn has no pages. It is also assumed that a zone
6021 * starts where the previous one ended. For example, ZONE_DMA32 starts
6022 * at arch_max_dma_pfn.
6024 void __init free_area_init_nodes(unsigned long *max_zone_pfn)
6026 unsigned long start_pfn, end_pfn;
6029 /* Record where the zone boundaries are */
6030 memset(arch_zone_lowest_possible_pfn, 0,
6031 sizeof(arch_zone_lowest_possible_pfn));
6032 memset(arch_zone_highest_possible_pfn, 0,
6033 sizeof(arch_zone_highest_possible_pfn));
6034 arch_zone_lowest_possible_pfn[0] = find_min_pfn_with_active_regions();
6035 arch_zone_highest_possible_pfn[0] = max_zone_pfn[0];
6036 for (i = 1; i < MAX_NR_ZONES; i++) {
6037 if (i == ZONE_MOVABLE)
6039 arch_zone_lowest_possible_pfn[i] =
6040 arch_zone_highest_possible_pfn[i-1];
6041 arch_zone_highest_possible_pfn[i] =
6042 max(max_zone_pfn[i], arch_zone_lowest_possible_pfn[i]);
6044 arch_zone_lowest_possible_pfn[ZONE_MOVABLE] = 0;
6045 arch_zone_highest_possible_pfn[ZONE_MOVABLE] = 0;
6047 /* Find the PFNs that ZONE_MOVABLE begins at in each node */
6048 memset(zone_movable_pfn, 0, sizeof(zone_movable_pfn));
6049 find_zone_movable_pfns_for_nodes();
6051 /* Print out the zone ranges */
6052 pr_info("Zone ranges:\n");
6053 for (i = 0; i < MAX_NR_ZONES; i++) {
6054 if (i == ZONE_MOVABLE)
6056 pr_info(" %-8s ", zone_names[i]);
6057 if (arch_zone_lowest_possible_pfn[i] ==
6058 arch_zone_highest_possible_pfn[i])
6061 pr_cont("[mem %#018Lx-%#018Lx]\n",
6062 (u64)arch_zone_lowest_possible_pfn[i]
6064 ((u64)arch_zone_highest_possible_pfn[i]
6065 << PAGE_SHIFT) - 1);
6068 /* Print out the PFNs ZONE_MOVABLE begins at in each node */
6069 pr_info("Movable zone start for each node\n");
6070 for (i = 0; i < MAX_NUMNODES; i++) {
6071 if (zone_movable_pfn[i])
6072 pr_info(" Node %d: %#018Lx\n", i,
6073 (u64)zone_movable_pfn[i] << PAGE_SHIFT);
6076 /* Print out the early node map */
6077 pr_info("Early memory node ranges\n");
6078 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid)
6079 pr_info(" node %3d: [mem %#018Lx-%#018Lx]\n", nid,
6080 (u64)start_pfn << PAGE_SHIFT,
6081 ((u64)end_pfn << PAGE_SHIFT) - 1);
6083 /* Initialise every node */
6084 mminit_verify_pageflags_layout();
6085 setup_nr_node_ids();
6086 for_each_online_node(nid) {
6087 pg_data_t *pgdat = NODE_DATA(nid);
6088 free_area_init_node(nid, NULL,
6089 find_min_pfn_for_node(nid), NULL);
6091 /* Any memory on that node */
6092 if (pgdat->node_present_pages)
6093 node_set_state(nid, N_MEMORY);
6094 check_for_memory(pgdat, nid);
6098 static int __init cmdline_parse_core(char *p, unsigned long *core)
6100 unsigned long long coremem;
6104 coremem = memparse(p, &p);
6105 *core = coremem >> PAGE_SHIFT;
6107 /* Paranoid check that UL is enough for the coremem value */
6108 WARN_ON((coremem >> PAGE_SHIFT) > ULONG_MAX);
6114 * kernelcore=size sets the amount of memory for use for allocations that
6115 * cannot be reclaimed or migrated.
6117 static int __init cmdline_parse_kernelcore(char *p)
6119 /* parse kernelcore=mirror */
6120 if (parse_option_str(p, "mirror")) {
6121 mirrored_kernelcore = true;
6125 return cmdline_parse_core(p, &required_kernelcore);
6129 * movablecore=size sets the amount of memory for use for allocations that
6130 * can be reclaimed or migrated.
6132 static int __init cmdline_parse_movablecore(char *p)
6134 return cmdline_parse_core(p, &required_movablecore);
6137 early_param("kernelcore", cmdline_parse_kernelcore);
6138 early_param("movablecore", cmdline_parse_movablecore);
6140 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
6142 void adjust_managed_page_count(struct page *page, long count)
6144 spin_lock(&managed_page_count_lock);
6145 page_zone(page)->managed_pages += count;
6146 totalram_pages += count;
6147 #ifdef CONFIG_HIGHMEM
6148 if (PageHighMem(page))
6149 totalhigh_pages += count;
6151 spin_unlock(&managed_page_count_lock);
6153 EXPORT_SYMBOL(adjust_managed_page_count);
6155 unsigned long free_reserved_area(void *start, void *end, int poison, char *s)
6158 unsigned long pages = 0;
6160 start = (void *)PAGE_ALIGN((unsigned long)start);
6161 end = (void *)((unsigned long)end & PAGE_MASK);
6162 for (pos = start; pos < end; pos += PAGE_SIZE, pages++) {
6163 if ((unsigned int)poison <= 0xFF)
6164 memset(pos, poison, PAGE_SIZE);
6165 free_reserved_page(virt_to_page(pos));
6169 pr_info("Freeing %s memory: %ldK (%p - %p)\n",
6170 s, pages << (PAGE_SHIFT - 10), start, end);
6174 EXPORT_SYMBOL(free_reserved_area);
6176 #ifdef CONFIG_HIGHMEM
6177 void free_highmem_page(struct page *page)
6179 __free_reserved_page(page);
6181 page_zone(page)->managed_pages++;
6187 void __init mem_init_print_info(const char *str)
6189 unsigned long physpages, codesize, datasize, rosize, bss_size;
6190 unsigned long init_code_size, init_data_size;
6192 physpages = get_num_physpages();
6193 codesize = _etext - _stext;
6194 datasize = _edata - _sdata;
6195 rosize = __end_rodata - __start_rodata;
6196 bss_size = __bss_stop - __bss_start;
6197 init_data_size = __init_end - __init_begin;
6198 init_code_size = _einittext - _sinittext;
6201 * Detect special cases and adjust section sizes accordingly:
6202 * 1) .init.* may be embedded into .data sections
6203 * 2) .init.text.* may be out of [__init_begin, __init_end],
6204 * please refer to arch/tile/kernel/vmlinux.lds.S.
6205 * 3) .rodata.* may be embedded into .text or .data sections.
6207 #define adj_init_size(start, end, size, pos, adj) \
6209 if (start <= pos && pos < end && size > adj) \
6213 adj_init_size(__init_begin, __init_end, init_data_size,
6214 _sinittext, init_code_size);
6215 adj_init_size(_stext, _etext, codesize, _sinittext, init_code_size);
6216 adj_init_size(_sdata, _edata, datasize, __init_begin, init_data_size);
6217 adj_init_size(_stext, _etext, codesize, __start_rodata, rosize);
6218 adj_init_size(_sdata, _edata, datasize, __start_rodata, rosize);
6220 #undef adj_init_size
6222 pr_info("Memory: %luK/%luK available "
6223 "(%luK kernel code, %luK rwdata, %luK rodata, "
6224 "%luK init, %luK bss, %luK reserved, %luK cma-reserved"
6225 #ifdef CONFIG_HIGHMEM
6229 nr_free_pages() << (PAGE_SHIFT-10), physpages << (PAGE_SHIFT-10),
6230 codesize >> 10, datasize >> 10, rosize >> 10,
6231 (init_data_size + init_code_size) >> 10, bss_size >> 10,
6232 (physpages - totalram_pages - totalcma_pages) << (PAGE_SHIFT-10),
6233 totalcma_pages << (PAGE_SHIFT-10),
6234 #ifdef CONFIG_HIGHMEM
6235 totalhigh_pages << (PAGE_SHIFT-10),
6237 str ? ", " : "", str ? str : "");
6241 * set_dma_reserve - set the specified number of pages reserved in the first zone
6242 * @new_dma_reserve: The number of pages to mark reserved
6244 * The per-cpu batchsize and zone watermarks are determined by managed_pages.
6245 * In the DMA zone, a significant percentage may be consumed by kernel image
6246 * and other unfreeable allocations which can skew the watermarks badly. This
6247 * function may optionally be used to account for unfreeable pages in the
6248 * first zone (e.g., ZONE_DMA). The effect will be lower watermarks and
6249 * smaller per-cpu batchsize.
6251 void __init set_dma_reserve(unsigned long new_dma_reserve)
6253 dma_reserve = new_dma_reserve;
6256 void __init free_area_init(unsigned long *zones_size)
6258 free_area_init_node(0, zones_size,
6259 __pa(PAGE_OFFSET) >> PAGE_SHIFT, NULL);
6262 static int page_alloc_cpu_notify(struct notifier_block *self,
6263 unsigned long action, void *hcpu)
6265 int cpu = (unsigned long)hcpu;
6267 if (action == CPU_DEAD || action == CPU_DEAD_FROZEN) {
6268 lru_add_drain_cpu(cpu);
6272 * Spill the event counters of the dead processor
6273 * into the current processors event counters.
6274 * This artificially elevates the count of the current
6277 vm_events_fold_cpu(cpu);
6280 * Zero the differential counters of the dead processor
6281 * so that the vm statistics are consistent.
6283 * This is only okay since the processor is dead and cannot
6284 * race with what we are doing.
6286 cpu_vm_stats_fold(cpu);
6291 void __init page_alloc_init(void)
6293 hotcpu_notifier(page_alloc_cpu_notify, 0);
6297 * calculate_totalreserve_pages - called when sysctl_lowmem_reserve_ratio
6298 * or min_free_kbytes changes.
6300 static void calculate_totalreserve_pages(void)
6302 struct pglist_data *pgdat;
6303 unsigned long reserve_pages = 0;
6304 enum zone_type i, j;
6306 for_each_online_pgdat(pgdat) {
6307 for (i = 0; i < MAX_NR_ZONES; i++) {
6308 struct zone *zone = pgdat->node_zones + i;
6311 /* Find valid and maximum lowmem_reserve in the zone */
6312 for (j = i; j < MAX_NR_ZONES; j++) {
6313 if (zone->lowmem_reserve[j] > max)
6314 max = zone->lowmem_reserve[j];
6317 /* we treat the high watermark as reserved pages. */
6318 max += high_wmark_pages(zone);
6320 if (max > zone->managed_pages)
6321 max = zone->managed_pages;
6323 zone->totalreserve_pages = max;
6325 reserve_pages += max;
6328 totalreserve_pages = reserve_pages;
6332 * setup_per_zone_lowmem_reserve - called whenever
6333 * sysctl_lowmem_reserve_ratio changes. Ensures that each zone
6334 * has a correct pages reserved value, so an adequate number of
6335 * pages are left in the zone after a successful __alloc_pages().
6337 static void setup_per_zone_lowmem_reserve(void)
6339 struct pglist_data *pgdat;
6340 enum zone_type j, idx;
6342 for_each_online_pgdat(pgdat) {
6343 for (j = 0; j < MAX_NR_ZONES; j++) {
6344 struct zone *zone = pgdat->node_zones + j;
6345 unsigned long managed_pages = zone->managed_pages;
6347 zone->lowmem_reserve[j] = 0;
6351 struct zone *lower_zone;
6355 if (sysctl_lowmem_reserve_ratio[idx] < 1)
6356 sysctl_lowmem_reserve_ratio[idx] = 1;
6358 lower_zone = pgdat->node_zones + idx;
6359 lower_zone->lowmem_reserve[j] = managed_pages /
6360 sysctl_lowmem_reserve_ratio[idx];
6361 managed_pages += lower_zone->managed_pages;
6366 /* update totalreserve_pages */
6367 calculate_totalreserve_pages();
6370 static void __setup_per_zone_wmarks(void)
6372 unsigned long pages_min = min_free_kbytes >> (PAGE_SHIFT - 10);
6373 unsigned long lowmem_pages = 0;
6375 unsigned long flags;
6377 /* Calculate total number of !ZONE_HIGHMEM pages */
6378 for_each_zone(zone) {
6379 if (!is_highmem(zone))
6380 lowmem_pages += zone->managed_pages;
6383 for_each_zone(zone) {
6386 spin_lock_irqsave(&zone->lock, flags);
6387 tmp = (u64)pages_min * zone->managed_pages;
6388 do_div(tmp, lowmem_pages);
6389 if (is_highmem(zone)) {
6391 * __GFP_HIGH and PF_MEMALLOC allocations usually don't
6392 * need highmem pages, so cap pages_min to a small
6395 * The WMARK_HIGH-WMARK_LOW and (WMARK_LOW-WMARK_MIN)
6396 * deltas control asynch page reclaim, and so should
6397 * not be capped for highmem.
6399 unsigned long min_pages;
6401 min_pages = zone->managed_pages / 1024;
6402 min_pages = clamp(min_pages, SWAP_CLUSTER_MAX, 128UL);
6403 zone->watermark[WMARK_MIN] = min_pages;
6406 * If it's a lowmem zone, reserve a number of pages
6407 * proportionate to the zone's size.
6409 zone->watermark[WMARK_MIN] = tmp;
6412 zone->watermark[WMARK_LOW] = min_wmark_pages(zone) + (tmp >> 2);
6413 zone->watermark[WMARK_HIGH] = min_wmark_pages(zone) + (tmp >> 1);
6415 __mod_zone_page_state(zone, NR_ALLOC_BATCH,
6416 high_wmark_pages(zone) - low_wmark_pages(zone) -
6417 atomic_long_read(&zone->vm_stat[NR_ALLOC_BATCH]));
6419 spin_unlock_irqrestore(&zone->lock, flags);
6422 /* update totalreserve_pages */
6423 calculate_totalreserve_pages();
6427 * setup_per_zone_wmarks - called when min_free_kbytes changes
6428 * or when memory is hot-{added|removed}
6430 * Ensures that the watermark[min,low,high] values for each zone are set
6431 * correctly with respect to min_free_kbytes.
6433 void setup_per_zone_wmarks(void)
6435 mutex_lock(&zonelists_mutex);
6436 __setup_per_zone_wmarks();
6437 mutex_unlock(&zonelists_mutex);
6441 * The inactive anon list should be small enough that the VM never has to
6442 * do too much work, but large enough that each inactive page has a chance
6443 * to be referenced again before it is swapped out.
6445 * The inactive_anon ratio is the target ratio of ACTIVE_ANON to
6446 * INACTIVE_ANON pages on this zone's LRU, maintained by the
6447 * pageout code. A zone->inactive_ratio of 3 means 3:1 or 25% of
6448 * the anonymous pages are kept on the inactive list.
6451 * memory ratio inactive anon
6452 * -------------------------------------
6461 static void __meminit calculate_zone_inactive_ratio(struct zone *zone)
6463 unsigned int gb, ratio;
6465 /* Zone size in gigabytes */
6466 gb = zone->managed_pages >> (30 - PAGE_SHIFT);
6468 ratio = int_sqrt(10 * gb);
6472 zone->inactive_ratio = ratio;
6475 static void __meminit setup_per_zone_inactive_ratio(void)
6480 calculate_zone_inactive_ratio(zone);
6484 * Initialise min_free_kbytes.
6486 * For small machines we want it small (128k min). For large machines
6487 * we want it large (64MB max). But it is not linear, because network
6488 * bandwidth does not increase linearly with machine size. We use
6490 * min_free_kbytes = 4 * sqrt(lowmem_kbytes), for better accuracy:
6491 * min_free_kbytes = sqrt(lowmem_kbytes * 16)
6507 int __meminit init_per_zone_wmark_min(void)
6509 unsigned long lowmem_kbytes;
6510 int new_min_free_kbytes;
6512 lowmem_kbytes = nr_free_buffer_pages() * (PAGE_SIZE >> 10);
6513 new_min_free_kbytes = int_sqrt(lowmem_kbytes * 16);
6515 if (new_min_free_kbytes > user_min_free_kbytes) {
6516 min_free_kbytes = new_min_free_kbytes;
6517 if (min_free_kbytes < 128)
6518 min_free_kbytes = 128;
6519 if (min_free_kbytes > 65536)
6520 min_free_kbytes = 65536;
6522 pr_warn("min_free_kbytes is not updated to %d because user defined value %d is preferred\n",
6523 new_min_free_kbytes, user_min_free_kbytes);
6525 setup_per_zone_wmarks();
6526 refresh_zone_stat_thresholds();
6527 setup_per_zone_lowmem_reserve();
6528 setup_per_zone_inactive_ratio();
6531 module_init(init_per_zone_wmark_min)
6534 * min_free_kbytes_sysctl_handler - just a wrapper around proc_dointvec() so
6535 * that we can call two helper functions whenever min_free_kbytes
6538 int min_free_kbytes_sysctl_handler(struct ctl_table *table, int write,
6539 void __user *buffer, size_t *length, loff_t *ppos)
6543 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
6548 user_min_free_kbytes = min_free_kbytes;
6549 setup_per_zone_wmarks();
6555 int sysctl_min_unmapped_ratio_sysctl_handler(struct ctl_table *table, int write,
6556 void __user *buffer, size_t *length, loff_t *ppos)
6561 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
6566 zone->min_unmapped_pages = (zone->managed_pages *
6567 sysctl_min_unmapped_ratio) / 100;
6571 int sysctl_min_slab_ratio_sysctl_handler(struct ctl_table *table, int write,
6572 void __user *buffer, size_t *length, loff_t *ppos)
6577 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
6582 zone->min_slab_pages = (zone->managed_pages *
6583 sysctl_min_slab_ratio) / 100;
6589 * lowmem_reserve_ratio_sysctl_handler - just a wrapper around
6590 * proc_dointvec() so that we can call setup_per_zone_lowmem_reserve()
6591 * whenever sysctl_lowmem_reserve_ratio changes.
6593 * The reserve ratio obviously has absolutely no relation with the
6594 * minimum watermarks. The lowmem reserve ratio can only make sense
6595 * if in function of the boot time zone sizes.
6597 int lowmem_reserve_ratio_sysctl_handler(struct ctl_table *table, int write,
6598 void __user *buffer, size_t *length, loff_t *ppos)
6600 proc_dointvec_minmax(table, write, buffer, length, ppos);
6601 setup_per_zone_lowmem_reserve();
6606 * percpu_pagelist_fraction - changes the pcp->high for each zone on each
6607 * cpu. It is the fraction of total pages in each zone that a hot per cpu
6608 * pagelist can have before it gets flushed back to buddy allocator.
6610 int percpu_pagelist_fraction_sysctl_handler(struct ctl_table *table, int write,
6611 void __user *buffer, size_t *length, loff_t *ppos)
6614 int old_percpu_pagelist_fraction;
6617 mutex_lock(&pcp_batch_high_lock);
6618 old_percpu_pagelist_fraction = percpu_pagelist_fraction;
6620 ret = proc_dointvec_minmax(table, write, buffer, length, ppos);
6621 if (!write || ret < 0)
6624 /* Sanity checking to avoid pcp imbalance */
6625 if (percpu_pagelist_fraction &&
6626 percpu_pagelist_fraction < MIN_PERCPU_PAGELIST_FRACTION) {
6627 percpu_pagelist_fraction = old_percpu_pagelist_fraction;
6633 if (percpu_pagelist_fraction == old_percpu_pagelist_fraction)
6636 for_each_populated_zone(zone) {
6639 for_each_possible_cpu(cpu)
6640 pageset_set_high_and_batch(zone,
6641 per_cpu_ptr(zone->pageset, cpu));
6644 mutex_unlock(&pcp_batch_high_lock);
6649 int hashdist = HASHDIST_DEFAULT;
6651 static int __init set_hashdist(char *str)
6655 hashdist = simple_strtoul(str, &str, 0);
6658 __setup("hashdist=", set_hashdist);
6662 * allocate a large system hash table from bootmem
6663 * - it is assumed that the hash table must contain an exact power-of-2
6664 * quantity of entries
6665 * - limit is the number of hash buckets, not the total allocation size
6667 void *__init alloc_large_system_hash(const char *tablename,
6668 unsigned long bucketsize,
6669 unsigned long numentries,
6672 unsigned int *_hash_shift,
6673 unsigned int *_hash_mask,
6674 unsigned long low_limit,
6675 unsigned long high_limit)
6677 unsigned long long max = high_limit;
6678 unsigned long log2qty, size;
6681 /* allow the kernel cmdline to have a say */
6683 /* round applicable memory size up to nearest megabyte */
6684 numentries = nr_kernel_pages;
6686 /* It isn't necessary when PAGE_SIZE >= 1MB */
6687 if (PAGE_SHIFT < 20)
6688 numentries = round_up(numentries, (1<<20)/PAGE_SIZE);
6690 /* limit to 1 bucket per 2^scale bytes of low memory */
6691 if (scale > PAGE_SHIFT)
6692 numentries >>= (scale - PAGE_SHIFT);
6694 numentries <<= (PAGE_SHIFT - scale);
6696 /* Make sure we've got at least a 0-order allocation.. */
6697 if (unlikely(flags & HASH_SMALL)) {
6698 /* Makes no sense without HASH_EARLY */
6699 WARN_ON(!(flags & HASH_EARLY));
6700 if (!(numentries >> *_hash_shift)) {
6701 numentries = 1UL << *_hash_shift;
6702 BUG_ON(!numentries);
6704 } else if (unlikely((numentries * bucketsize) < PAGE_SIZE))
6705 numentries = PAGE_SIZE / bucketsize;
6707 numentries = roundup_pow_of_two(numentries);
6709 /* limit allocation size to 1/16 total memory by default */
6711 max = ((unsigned long long)nr_all_pages << PAGE_SHIFT) >> 4;
6712 do_div(max, bucketsize);
6714 max = min(max, 0x80000000ULL);
6716 if (numentries < low_limit)
6717 numentries = low_limit;
6718 if (numentries > max)
6721 log2qty = ilog2(numentries);
6724 size = bucketsize << log2qty;
6725 if (flags & HASH_EARLY)
6726 table = memblock_virt_alloc_nopanic(size, 0);
6728 table = __vmalloc(size, GFP_ATOMIC, PAGE_KERNEL);
6731 * If bucketsize is not a power-of-two, we may free
6732 * some pages at the end of hash table which
6733 * alloc_pages_exact() automatically does
6735 if (get_order(size) < MAX_ORDER) {
6736 table = alloc_pages_exact(size, GFP_ATOMIC);
6737 kmemleak_alloc(table, size, 1, GFP_ATOMIC);
6740 } while (!table && size > PAGE_SIZE && --log2qty);
6743 panic("Failed to allocate %s hash table\n", tablename);
6745 printk(KERN_INFO "%s hash table entries: %ld (order: %d, %lu bytes)\n",
6748 ilog2(size) - PAGE_SHIFT,
6752 *_hash_shift = log2qty;
6754 *_hash_mask = (1 << log2qty) - 1;
6759 /* Return a pointer to the bitmap storing bits affecting a block of pages */
6760 static inline unsigned long *get_pageblock_bitmap(struct zone *zone,
6763 #ifdef CONFIG_SPARSEMEM
6764 return __pfn_to_section(pfn)->pageblock_flags;
6766 return zone->pageblock_flags;
6767 #endif /* CONFIG_SPARSEMEM */
6770 static inline int pfn_to_bitidx(struct zone *zone, unsigned long pfn)
6772 #ifdef CONFIG_SPARSEMEM
6773 pfn &= (PAGES_PER_SECTION-1);
6774 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
6776 pfn = pfn - round_down(zone->zone_start_pfn, pageblock_nr_pages);
6777 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
6778 #endif /* CONFIG_SPARSEMEM */
6782 * get_pfnblock_flags_mask - Return the requested group of flags for the pageblock_nr_pages block of pages
6783 * @page: The page within the block of interest
6784 * @pfn: The target page frame number
6785 * @end_bitidx: The last bit of interest to retrieve
6786 * @mask: mask of bits that the caller is interested in
6788 * Return: pageblock_bits flags
6790 unsigned long get_pfnblock_flags_mask(struct page *page, unsigned long pfn,
6791 unsigned long end_bitidx,
6795 unsigned long *bitmap;
6796 unsigned long bitidx, word_bitidx;
6799 zone = page_zone(page);
6800 bitmap = get_pageblock_bitmap(zone, pfn);
6801 bitidx = pfn_to_bitidx(zone, pfn);
6802 word_bitidx = bitidx / BITS_PER_LONG;
6803 bitidx &= (BITS_PER_LONG-1);
6805 word = bitmap[word_bitidx];
6806 bitidx += end_bitidx;
6807 return (word >> (BITS_PER_LONG - bitidx - 1)) & mask;
6811 * set_pfnblock_flags_mask - Set the requested group of flags for a pageblock_nr_pages block of pages
6812 * @page: The page within the block of interest
6813 * @flags: The flags to set
6814 * @pfn: The target page frame number
6815 * @end_bitidx: The last bit of interest
6816 * @mask: mask of bits that the caller is interested in
6818 void set_pfnblock_flags_mask(struct page *page, unsigned long flags,
6820 unsigned long end_bitidx,
6824 unsigned long *bitmap;
6825 unsigned long bitidx, word_bitidx;
6826 unsigned long old_word, word;
6828 BUILD_BUG_ON(NR_PAGEBLOCK_BITS != 4);
6830 zone = page_zone(page);
6831 bitmap = get_pageblock_bitmap(zone, pfn);
6832 bitidx = pfn_to_bitidx(zone, pfn);
6833 word_bitidx = bitidx / BITS_PER_LONG;
6834 bitidx &= (BITS_PER_LONG-1);
6836 VM_BUG_ON_PAGE(!zone_spans_pfn(zone, pfn), page);
6838 bitidx += end_bitidx;
6839 mask <<= (BITS_PER_LONG - bitidx - 1);
6840 flags <<= (BITS_PER_LONG - bitidx - 1);
6842 word = READ_ONCE(bitmap[word_bitidx]);
6844 old_word = cmpxchg(&bitmap[word_bitidx], word, (word & ~mask) | flags);
6845 if (word == old_word)
6852 * This function checks whether pageblock includes unmovable pages or not.
6853 * If @count is not zero, it is okay to include less @count unmovable pages
6855 * PageLRU check without isolation or lru_lock could race so that
6856 * MIGRATE_MOVABLE block might include unmovable pages. It means you can't
6857 * expect this function should be exact.
6859 bool has_unmovable_pages(struct zone *zone, struct page *page, int count,
6860 bool skip_hwpoisoned_pages)
6862 unsigned long pfn, iter, found;
6866 * For avoiding noise data, lru_add_drain_all() should be called
6867 * If ZONE_MOVABLE, the zone never contains unmovable pages
6869 if (zone_idx(zone) == ZONE_MOVABLE)
6871 mt = get_pageblock_migratetype(page);
6872 if (mt == MIGRATE_MOVABLE || is_migrate_cma(mt))
6875 pfn = page_to_pfn(page);
6876 for (found = 0, iter = 0; iter < pageblock_nr_pages; iter++) {
6877 unsigned long check = pfn + iter;
6879 if (!pfn_valid_within(check))
6882 page = pfn_to_page(check);
6885 * Hugepages are not in LRU lists, but they're movable.
6886 * We need not scan over tail pages bacause we don't
6887 * handle each tail page individually in migration.
6889 if (PageHuge(page)) {
6890 iter = round_up(iter + 1, 1<<compound_order(page)) - 1;
6895 * We can't use page_count without pin a page
6896 * because another CPU can free compound page.
6897 * This check already skips compound tails of THP
6898 * because their page->_count is zero at all time.
6900 if (!atomic_read(&page->_count)) {
6901 if (PageBuddy(page))
6902 iter += (1 << page_order(page)) - 1;
6907 * The HWPoisoned page may be not in buddy system, and
6908 * page_count() is not 0.
6910 if (skip_hwpoisoned_pages && PageHWPoison(page))
6916 * If there are RECLAIMABLE pages, we need to check
6917 * it. But now, memory offline itself doesn't call
6918 * shrink_node_slabs() and it still to be fixed.
6921 * If the page is not RAM, page_count()should be 0.
6922 * we don't need more check. This is an _used_ not-movable page.
6924 * The problematic thing here is PG_reserved pages. PG_reserved
6925 * is set to both of a memory hole page and a _used_ kernel
6934 bool is_pageblock_removable_nolock(struct page *page)
6940 * We have to be careful here because we are iterating over memory
6941 * sections which are not zone aware so we might end up outside of
6942 * the zone but still within the section.
6943 * We have to take care about the node as well. If the node is offline
6944 * its NODE_DATA will be NULL - see page_zone.
6946 if (!node_online(page_to_nid(page)))
6949 zone = page_zone(page);
6950 pfn = page_to_pfn(page);
6951 if (!zone_spans_pfn(zone, pfn))
6954 return !has_unmovable_pages(zone, page, 0, true);
6957 #if (defined(CONFIG_MEMORY_ISOLATION) && defined(CONFIG_COMPACTION)) || defined(CONFIG_CMA)
6959 static unsigned long pfn_max_align_down(unsigned long pfn)
6961 return pfn & ~(max_t(unsigned long, MAX_ORDER_NR_PAGES,
6962 pageblock_nr_pages) - 1);
6965 static unsigned long pfn_max_align_up(unsigned long pfn)
6967 return ALIGN(pfn, max_t(unsigned long, MAX_ORDER_NR_PAGES,
6968 pageblock_nr_pages));
6971 /* [start, end) must belong to a single zone. */
6972 static int __alloc_contig_migrate_range(struct compact_control *cc,
6973 unsigned long start, unsigned long end)
6975 /* This function is based on compact_zone() from compaction.c. */
6976 unsigned long nr_reclaimed;
6977 unsigned long pfn = start;
6978 unsigned int tries = 0;
6983 while (pfn < end || !list_empty(&cc->migratepages)) {
6984 if (fatal_signal_pending(current)) {
6989 if (list_empty(&cc->migratepages)) {
6990 cc->nr_migratepages = 0;
6991 pfn = isolate_migratepages_range(cc, pfn, end);
6997 } else if (++tries == 5) {
6998 ret = ret < 0 ? ret : -EBUSY;
7002 nr_reclaimed = reclaim_clean_pages_from_list(cc->zone,
7004 cc->nr_migratepages -= nr_reclaimed;
7006 ret = migrate_pages(&cc->migratepages, alloc_migrate_target,
7007 NULL, 0, cc->mode, MR_CMA);
7010 putback_movable_pages(&cc->migratepages);
7017 * alloc_contig_range() -- tries to allocate given range of pages
7018 * @start: start PFN to allocate
7019 * @end: one-past-the-last PFN to allocate
7020 * @migratetype: migratetype of the underlaying pageblocks (either
7021 * #MIGRATE_MOVABLE or #MIGRATE_CMA). All pageblocks
7022 * in range must have the same migratetype and it must
7023 * be either of the two.
7025 * The PFN range does not have to be pageblock or MAX_ORDER_NR_PAGES
7026 * aligned, however it's the caller's responsibility to guarantee that
7027 * we are the only thread that changes migrate type of pageblocks the
7030 * The PFN range must belong to a single zone.
7032 * Returns zero on success or negative error code. On success all
7033 * pages which PFN is in [start, end) are allocated for the caller and
7034 * need to be freed with free_contig_range().
7036 int alloc_contig_range(unsigned long start, unsigned long end,
7037 unsigned migratetype)
7039 unsigned long outer_start, outer_end;
7043 struct compact_control cc = {
7044 .nr_migratepages = 0,
7046 .zone = page_zone(pfn_to_page(start)),
7047 .mode = MIGRATE_SYNC,
7048 .ignore_skip_hint = true,
7050 INIT_LIST_HEAD(&cc.migratepages);
7053 * What we do here is we mark all pageblocks in range as
7054 * MIGRATE_ISOLATE. Because pageblock and max order pages may
7055 * have different sizes, and due to the way page allocator
7056 * work, we align the range to biggest of the two pages so
7057 * that page allocator won't try to merge buddies from
7058 * different pageblocks and change MIGRATE_ISOLATE to some
7059 * other migration type.
7061 * Once the pageblocks are marked as MIGRATE_ISOLATE, we
7062 * migrate the pages from an unaligned range (ie. pages that
7063 * we are interested in). This will put all the pages in
7064 * range back to page allocator as MIGRATE_ISOLATE.
7066 * When this is done, we take the pages in range from page
7067 * allocator removing them from the buddy system. This way
7068 * page allocator will never consider using them.
7070 * This lets us mark the pageblocks back as
7071 * MIGRATE_CMA/MIGRATE_MOVABLE so that free pages in the
7072 * aligned range but not in the unaligned, original range are
7073 * put back to page allocator so that buddy can use them.
7076 ret = start_isolate_page_range(pfn_max_align_down(start),
7077 pfn_max_align_up(end), migratetype,
7083 * In case of -EBUSY, we'd like to know which page causes problem.
7084 * So, just fall through. We will check it in test_pages_isolated().
7086 ret = __alloc_contig_migrate_range(&cc, start, end);
7087 if (ret && ret != -EBUSY)
7091 * Pages from [start, end) are within a MAX_ORDER_NR_PAGES
7092 * aligned blocks that are marked as MIGRATE_ISOLATE. What's
7093 * more, all pages in [start, end) are free in page allocator.
7094 * What we are going to do is to allocate all pages from
7095 * [start, end) (that is remove them from page allocator).
7097 * The only problem is that pages at the beginning and at the
7098 * end of interesting range may be not aligned with pages that
7099 * page allocator holds, ie. they can be part of higher order
7100 * pages. Because of this, we reserve the bigger range and
7101 * once this is done free the pages we are not interested in.
7103 * We don't have to hold zone->lock here because the pages are
7104 * isolated thus they won't get removed from buddy.
7107 lru_add_drain_all();
7108 drain_all_pages(cc.zone);
7111 outer_start = start;
7112 while (!PageBuddy(pfn_to_page(outer_start))) {
7113 if (++order >= MAX_ORDER) {
7114 outer_start = start;
7117 outer_start &= ~0UL << order;
7120 if (outer_start != start) {
7121 order = page_order(pfn_to_page(outer_start));
7124 * outer_start page could be small order buddy page and
7125 * it doesn't include start page. Adjust outer_start
7126 * in this case to report failed page properly
7127 * on tracepoint in test_pages_isolated()
7129 if (outer_start + (1UL << order) <= start)
7130 outer_start = start;
7133 /* Make sure the range is really isolated. */
7134 if (test_pages_isolated(outer_start, end, false)) {
7135 pr_info("%s: [%lx, %lx) PFNs busy\n",
7136 __func__, outer_start, end);
7141 /* Grab isolated pages from freelists. */
7142 outer_end = isolate_freepages_range(&cc, outer_start, end);
7148 /* Free head and tail (if any) */
7149 if (start != outer_start)
7150 free_contig_range(outer_start, start - outer_start);
7151 if (end != outer_end)
7152 free_contig_range(end, outer_end - end);
7155 undo_isolate_page_range(pfn_max_align_down(start),
7156 pfn_max_align_up(end), migratetype);
7160 void free_contig_range(unsigned long pfn, unsigned nr_pages)
7162 unsigned int count = 0;
7164 for (; nr_pages--; pfn++) {
7165 struct page *page = pfn_to_page(pfn);
7167 count += page_count(page) != 1;
7170 WARN(count != 0, "%d pages are still in use!\n", count);
7174 #ifdef CONFIG_MEMORY_HOTPLUG
7176 * The zone indicated has a new number of managed_pages; batch sizes and percpu
7177 * page high values need to be recalulated.
7179 void __meminit zone_pcp_update(struct zone *zone)
7182 mutex_lock(&pcp_batch_high_lock);
7183 for_each_possible_cpu(cpu)
7184 pageset_set_high_and_batch(zone,
7185 per_cpu_ptr(zone->pageset, cpu));
7186 mutex_unlock(&pcp_batch_high_lock);
7190 void zone_pcp_reset(struct zone *zone)
7192 unsigned long flags;
7194 struct per_cpu_pageset *pset;
7196 /* avoid races with drain_pages() */
7197 local_irq_save(flags);
7198 if (zone->pageset != &boot_pageset) {
7199 for_each_online_cpu(cpu) {
7200 pset = per_cpu_ptr(zone->pageset, cpu);
7201 drain_zonestat(zone, pset);
7203 free_percpu(zone->pageset);
7204 zone->pageset = &boot_pageset;
7206 local_irq_restore(flags);
7209 #ifdef CONFIG_MEMORY_HOTREMOVE
7211 * All pages in the range must be isolated before calling this.
7214 __offline_isolated_pages(unsigned long start_pfn, unsigned long end_pfn)
7218 unsigned int order, i;
7220 unsigned long flags;
7221 /* find the first valid pfn */
7222 for (pfn = start_pfn; pfn < end_pfn; pfn++)
7227 zone = page_zone(pfn_to_page(pfn));
7228 spin_lock_irqsave(&zone->lock, flags);
7230 while (pfn < end_pfn) {
7231 if (!pfn_valid(pfn)) {
7235 page = pfn_to_page(pfn);
7237 * The HWPoisoned page may be not in buddy system, and
7238 * page_count() is not 0.
7240 if (unlikely(!PageBuddy(page) && PageHWPoison(page))) {
7242 SetPageReserved(page);
7246 BUG_ON(page_count(page));
7247 BUG_ON(!PageBuddy(page));
7248 order = page_order(page);
7249 #ifdef CONFIG_DEBUG_VM
7250 printk(KERN_INFO "remove from free list %lx %d %lx\n",
7251 pfn, 1 << order, end_pfn);
7253 list_del(&page->lru);
7254 rmv_page_order(page);
7255 zone->free_area[order].nr_free--;
7256 for (i = 0; i < (1 << order); i++)
7257 SetPageReserved((page+i));
7258 pfn += (1 << order);
7260 spin_unlock_irqrestore(&zone->lock, flags);
7264 bool is_free_buddy_page(struct page *page)
7266 struct zone *zone = page_zone(page);
7267 unsigned long pfn = page_to_pfn(page);
7268 unsigned long flags;
7271 spin_lock_irqsave(&zone->lock, flags);
7272 for (order = 0; order < MAX_ORDER; order++) {
7273 struct page *page_head = page - (pfn & ((1 << order) - 1));
7275 if (PageBuddy(page_head) && page_order(page_head) >= order)
7278 spin_unlock_irqrestore(&zone->lock, flags);
7280 return order < MAX_ORDER;