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/stop_machine.h>
47 #include <linux/sort.h>
48 #include <linux/pfn.h>
49 #include <linux/backing-dev.h>
50 #include <linux/fault-inject.h>
51 #include <linux/page-isolation.h>
52 #include <linux/page_ext.h>
53 #include <linux/debugobjects.h>
54 #include <linux/kmemleak.h>
55 #include <linux/compaction.h>
56 #include <trace/events/kmem.h>
57 #include <linux/prefetch.h>
58 #include <linux/mm_inline.h>
59 #include <linux/migrate.h>
60 #include <linux/page_ext.h>
61 #include <linux/hugetlb.h>
62 #include <linux/sched/rt.h>
63 #include <linux/page_owner.h>
64 #include <linux/kthread.h>
66 #include <asm/sections.h>
67 #include <asm/tlbflush.h>
68 #include <asm/div64.h>
71 /* prevent >1 _updater_ of zone percpu pageset ->high and ->batch fields */
72 static DEFINE_MUTEX(pcp_batch_high_lock
);
73 #define MIN_PERCPU_PAGELIST_FRACTION (8)
75 #ifdef CONFIG_USE_PERCPU_NUMA_NODE_ID
76 DEFINE_PER_CPU(int, numa_node
);
77 EXPORT_PER_CPU_SYMBOL(numa_node
);
80 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
82 * N.B., Do NOT reference the '_numa_mem_' per cpu variable directly.
83 * It will not be defined when CONFIG_HAVE_MEMORYLESS_NODES is not defined.
84 * Use the accessor functions set_numa_mem(), numa_mem_id() and cpu_to_mem()
85 * defined in <linux/topology.h>.
87 DEFINE_PER_CPU(int, _numa_mem_
); /* Kernel "local memory" node */
88 EXPORT_PER_CPU_SYMBOL(_numa_mem_
);
89 int _node_numa_mem_
[MAX_NUMNODES
];
93 * Array of node states.
95 nodemask_t node_states
[NR_NODE_STATES
] __read_mostly
= {
96 [N_POSSIBLE
] = NODE_MASK_ALL
,
97 [N_ONLINE
] = { { [0] = 1UL } },
99 [N_NORMAL_MEMORY
] = { { [0] = 1UL } },
100 #ifdef CONFIG_HIGHMEM
101 [N_HIGH_MEMORY
] = { { [0] = 1UL } },
103 #ifdef CONFIG_MOVABLE_NODE
104 [N_MEMORY
] = { { [0] = 1UL } },
106 [N_CPU
] = { { [0] = 1UL } },
109 EXPORT_SYMBOL(node_states
);
111 /* Protect totalram_pages and zone->managed_pages */
112 static DEFINE_SPINLOCK(managed_page_count_lock
);
114 unsigned long totalram_pages __read_mostly
;
115 unsigned long totalreserve_pages __read_mostly
;
116 unsigned long totalcma_pages __read_mostly
;
118 * When calculating the number of globally allowed dirty pages, there
119 * is a certain number of per-zone reserves that should not be
120 * considered dirtyable memory. This is the sum of those reserves
121 * over all existing zones that contribute dirtyable memory.
123 unsigned long dirty_balance_reserve __read_mostly
;
125 int percpu_pagelist_fraction
;
126 gfp_t gfp_allowed_mask __read_mostly
= GFP_BOOT_MASK
;
128 #ifdef CONFIG_PM_SLEEP
130 * The following functions are used by the suspend/hibernate code to temporarily
131 * change gfp_allowed_mask in order to avoid using I/O during memory allocations
132 * while devices are suspended. To avoid races with the suspend/hibernate code,
133 * they should always be called with pm_mutex held (gfp_allowed_mask also should
134 * only be modified with pm_mutex held, unless the suspend/hibernate code is
135 * guaranteed not to run in parallel with that modification).
138 static gfp_t saved_gfp_mask
;
140 void pm_restore_gfp_mask(void)
142 WARN_ON(!mutex_is_locked(&pm_mutex
));
143 if (saved_gfp_mask
) {
144 gfp_allowed_mask
= saved_gfp_mask
;
149 void pm_restrict_gfp_mask(void)
151 WARN_ON(!mutex_is_locked(&pm_mutex
));
152 WARN_ON(saved_gfp_mask
);
153 saved_gfp_mask
= gfp_allowed_mask
;
154 gfp_allowed_mask
&= ~GFP_IOFS
;
157 bool pm_suspended_storage(void)
159 if ((gfp_allowed_mask
& GFP_IOFS
) == GFP_IOFS
)
163 #endif /* CONFIG_PM_SLEEP */
165 #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
166 int pageblock_order __read_mostly
;
169 static void __free_pages_ok(struct page
*page
, unsigned int order
);
172 * results with 256, 32 in the lowmem_reserve sysctl:
173 * 1G machine -> (16M dma, 800M-16M normal, 1G-800M high)
174 * 1G machine -> (16M dma, 784M normal, 224M high)
175 * NORMAL allocation will leave 784M/256 of ram reserved in the ZONE_DMA
176 * HIGHMEM allocation will leave 224M/32 of ram reserved in ZONE_NORMAL
177 * HIGHMEM allocation will leave (224M+784M)/256 of ram reserved in ZONE_DMA
179 * TBD: should special case ZONE_DMA32 machines here - in those we normally
180 * don't need any ZONE_NORMAL reservation
182 int sysctl_lowmem_reserve_ratio
[MAX_NR_ZONES
-1] = {
183 #ifdef CONFIG_ZONE_DMA
186 #ifdef CONFIG_ZONE_DMA32
189 #ifdef CONFIG_HIGHMEM
195 EXPORT_SYMBOL(totalram_pages
);
197 static char * const zone_names
[MAX_NR_ZONES
] = {
198 #ifdef CONFIG_ZONE_DMA
201 #ifdef CONFIG_ZONE_DMA32
205 #ifdef CONFIG_HIGHMEM
211 int min_free_kbytes
= 1024;
212 int user_min_free_kbytes
= -1;
214 static unsigned long __meminitdata nr_kernel_pages
;
215 static unsigned long __meminitdata nr_all_pages
;
216 static unsigned long __meminitdata dma_reserve
;
218 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
219 static unsigned long __meminitdata arch_zone_lowest_possible_pfn
[MAX_NR_ZONES
];
220 static unsigned long __meminitdata arch_zone_highest_possible_pfn
[MAX_NR_ZONES
];
221 static unsigned long __initdata required_kernelcore
;
222 static unsigned long __initdata required_movablecore
;
223 static unsigned long __meminitdata zone_movable_pfn
[MAX_NUMNODES
];
225 /* movable_zone is the "real" zone pages in ZONE_MOVABLE are taken from */
227 EXPORT_SYMBOL(movable_zone
);
228 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
231 int nr_node_ids __read_mostly
= MAX_NUMNODES
;
232 int nr_online_nodes __read_mostly
= 1;
233 EXPORT_SYMBOL(nr_node_ids
);
234 EXPORT_SYMBOL(nr_online_nodes
);
237 int page_group_by_mobility_disabled __read_mostly
;
239 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
240 static inline void reset_deferred_meminit(pg_data_t
*pgdat
)
242 pgdat
->first_deferred_pfn
= ULONG_MAX
;
245 /* Returns true if the struct page for the pfn is uninitialised */
246 static inline bool __meminit
early_page_uninitialised(unsigned long pfn
)
248 if (pfn
>= NODE_DATA(early_pfn_to_nid(pfn
))->first_deferred_pfn
)
254 static inline bool early_page_nid_uninitialised(unsigned long pfn
, int nid
)
256 if (pfn
>= NODE_DATA(nid
)->first_deferred_pfn
)
263 * Returns false when the remaining initialisation should be deferred until
264 * later in the boot cycle when it can be parallelised.
266 static inline bool update_defer_init(pg_data_t
*pgdat
,
267 unsigned long pfn
, unsigned long zone_end
,
268 unsigned long *nr_initialised
)
270 /* Always populate low zones for address-contrained allocations */
271 if (zone_end
< pgdat_end_pfn(pgdat
))
274 /* Initialise at least 2G of the highest zone */
276 if (*nr_initialised
> (2UL << (30 - PAGE_SHIFT
)) &&
277 (pfn
& (PAGES_PER_SECTION
- 1)) == 0) {
278 pgdat
->first_deferred_pfn
= pfn
;
285 static inline void reset_deferred_meminit(pg_data_t
*pgdat
)
289 static inline bool early_page_uninitialised(unsigned long pfn
)
294 static inline bool early_page_nid_uninitialised(unsigned long pfn
, int nid
)
299 static inline bool update_defer_init(pg_data_t
*pgdat
,
300 unsigned long pfn
, unsigned long zone_end
,
301 unsigned long *nr_initialised
)
308 void set_pageblock_migratetype(struct page
*page
, int migratetype
)
310 if (unlikely(page_group_by_mobility_disabled
&&
311 migratetype
< MIGRATE_PCPTYPES
))
312 migratetype
= MIGRATE_UNMOVABLE
;
314 set_pageblock_flags_group(page
, (unsigned long)migratetype
,
315 PB_migrate
, PB_migrate_end
);
318 #ifdef CONFIG_DEBUG_VM
319 static int page_outside_zone_boundaries(struct zone
*zone
, struct page
*page
)
323 unsigned long pfn
= page_to_pfn(page
);
324 unsigned long sp
, start_pfn
;
327 seq
= zone_span_seqbegin(zone
);
328 start_pfn
= zone
->zone_start_pfn
;
329 sp
= zone
->spanned_pages
;
330 if (!zone_spans_pfn(zone
, pfn
))
332 } while (zone_span_seqretry(zone
, seq
));
335 pr_err("page 0x%lx outside node %d zone %s [ 0x%lx - 0x%lx ]\n",
336 pfn
, zone_to_nid(zone
), zone
->name
,
337 start_pfn
, start_pfn
+ sp
);
342 static int page_is_consistent(struct zone
*zone
, struct page
*page
)
344 if (!pfn_valid_within(page_to_pfn(page
)))
346 if (zone
!= page_zone(page
))
352 * Temporary debugging check for pages not lying within a given zone.
354 static int bad_range(struct zone
*zone
, struct page
*page
)
356 if (page_outside_zone_boundaries(zone
, page
))
358 if (!page_is_consistent(zone
, page
))
364 static inline int bad_range(struct zone
*zone
, struct page
*page
)
370 static void bad_page(struct page
*page
, const char *reason
,
371 unsigned long bad_flags
)
373 static unsigned long resume
;
374 static unsigned long nr_shown
;
375 static unsigned long nr_unshown
;
377 /* Don't complain about poisoned pages */
378 if (PageHWPoison(page
)) {
379 page_mapcount_reset(page
); /* remove PageBuddy */
384 * Allow a burst of 60 reports, then keep quiet for that minute;
385 * or allow a steady drip of one report per second.
387 if (nr_shown
== 60) {
388 if (time_before(jiffies
, resume
)) {
394 "BUG: Bad page state: %lu messages suppressed\n",
401 resume
= jiffies
+ 60 * HZ
;
403 printk(KERN_ALERT
"BUG: Bad page state in process %s pfn:%05lx\n",
404 current
->comm
, page_to_pfn(page
));
405 dump_page_badflags(page
, reason
, bad_flags
);
410 /* Leave bad fields for debug, except PageBuddy could make trouble */
411 page_mapcount_reset(page
); /* remove PageBuddy */
412 add_taint(TAINT_BAD_PAGE
, LOCKDEP_NOW_UNRELIABLE
);
416 * Higher-order pages are called "compound pages". They are structured thusly:
418 * The first PAGE_SIZE page is called the "head page".
420 * The remaining PAGE_SIZE pages are called "tail pages".
422 * All pages have PG_compound set. All tail pages have their ->first_page
423 * pointing at the head page.
425 * The first tail page's ->lru.next holds the address of the compound page's
426 * put_page() function. Its ->lru.prev holds the order of allocation.
427 * This usage means that zero-order pages may not be compound.
430 static void free_compound_page(struct page
*page
)
432 __free_pages_ok(page
, compound_order(page
));
435 void prep_compound_page(struct page
*page
, unsigned long order
)
438 int nr_pages
= 1 << order
;
440 set_compound_page_dtor(page
, free_compound_page
);
441 set_compound_order(page
, order
);
443 for (i
= 1; i
< nr_pages
; i
++) {
444 struct page
*p
= page
+ i
;
445 set_page_count(p
, 0);
446 p
->first_page
= page
;
447 /* Make sure p->first_page is always valid for PageTail() */
453 #ifdef CONFIG_DEBUG_PAGEALLOC
454 unsigned int _debug_guardpage_minorder
;
455 bool _debug_pagealloc_enabled __read_mostly
;
456 bool _debug_guardpage_enabled __read_mostly
;
458 static int __init
early_debug_pagealloc(char *buf
)
463 if (strcmp(buf
, "on") == 0)
464 _debug_pagealloc_enabled
= true;
468 early_param("debug_pagealloc", early_debug_pagealloc
);
470 static bool need_debug_guardpage(void)
472 /* If we don't use debug_pagealloc, we don't need guard page */
473 if (!debug_pagealloc_enabled())
479 static void init_debug_guardpage(void)
481 if (!debug_pagealloc_enabled())
484 _debug_guardpage_enabled
= true;
487 struct page_ext_operations debug_guardpage_ops
= {
488 .need
= need_debug_guardpage
,
489 .init
= init_debug_guardpage
,
492 static int __init
debug_guardpage_minorder_setup(char *buf
)
496 if (kstrtoul(buf
, 10, &res
) < 0 || res
> MAX_ORDER
/ 2) {
497 printk(KERN_ERR
"Bad debug_guardpage_minorder value\n");
500 _debug_guardpage_minorder
= res
;
501 printk(KERN_INFO
"Setting debug_guardpage_minorder to %lu\n", res
);
504 __setup("debug_guardpage_minorder=", debug_guardpage_minorder_setup
);
506 static inline void set_page_guard(struct zone
*zone
, struct page
*page
,
507 unsigned int order
, int migratetype
)
509 struct page_ext
*page_ext
;
511 if (!debug_guardpage_enabled())
514 page_ext
= lookup_page_ext(page
);
515 __set_bit(PAGE_EXT_DEBUG_GUARD
, &page_ext
->flags
);
517 INIT_LIST_HEAD(&page
->lru
);
518 set_page_private(page
, order
);
519 /* Guard pages are not available for any usage */
520 __mod_zone_freepage_state(zone
, -(1 << order
), migratetype
);
523 static inline void clear_page_guard(struct zone
*zone
, struct page
*page
,
524 unsigned int order
, int migratetype
)
526 struct page_ext
*page_ext
;
528 if (!debug_guardpage_enabled())
531 page_ext
= lookup_page_ext(page
);
532 __clear_bit(PAGE_EXT_DEBUG_GUARD
, &page_ext
->flags
);
534 set_page_private(page
, 0);
535 if (!is_migrate_isolate(migratetype
))
536 __mod_zone_freepage_state(zone
, (1 << order
), migratetype
);
539 struct page_ext_operations debug_guardpage_ops
= { NULL
, };
540 static inline void set_page_guard(struct zone
*zone
, struct page
*page
,
541 unsigned int order
, int migratetype
) {}
542 static inline void clear_page_guard(struct zone
*zone
, struct page
*page
,
543 unsigned int order
, int migratetype
) {}
546 static inline void set_page_order(struct page
*page
, unsigned int order
)
548 set_page_private(page
, order
);
549 __SetPageBuddy(page
);
552 static inline void rmv_page_order(struct page
*page
)
554 __ClearPageBuddy(page
);
555 set_page_private(page
, 0);
559 * This function checks whether a page is free && is the buddy
560 * we can do coalesce a page and its buddy if
561 * (a) the buddy is not in a hole &&
562 * (b) the buddy is in the buddy system &&
563 * (c) a page and its buddy have the same order &&
564 * (d) a page and its buddy are in the same zone.
566 * For recording whether a page is in the buddy system, we set ->_mapcount
567 * PAGE_BUDDY_MAPCOUNT_VALUE.
568 * Setting, clearing, and testing _mapcount PAGE_BUDDY_MAPCOUNT_VALUE is
569 * serialized by zone->lock.
571 * For recording page's order, we use page_private(page).
573 static inline int page_is_buddy(struct page
*page
, struct page
*buddy
,
576 if (!pfn_valid_within(page_to_pfn(buddy
)))
579 if (page_is_guard(buddy
) && page_order(buddy
) == order
) {
580 if (page_zone_id(page
) != page_zone_id(buddy
))
583 VM_BUG_ON_PAGE(page_count(buddy
) != 0, buddy
);
588 if (PageBuddy(buddy
) && page_order(buddy
) == order
) {
590 * zone check is done late to avoid uselessly
591 * calculating zone/node ids for pages that could
594 if (page_zone_id(page
) != page_zone_id(buddy
))
597 VM_BUG_ON_PAGE(page_count(buddy
) != 0, buddy
);
605 * Freeing function for a buddy system allocator.
607 * The concept of a buddy system is to maintain direct-mapped table
608 * (containing bit values) for memory blocks of various "orders".
609 * The bottom level table contains the map for the smallest allocatable
610 * units of memory (here, pages), and each level above it describes
611 * pairs of units from the levels below, hence, "buddies".
612 * At a high level, all that happens here is marking the table entry
613 * at the bottom level available, and propagating the changes upward
614 * as necessary, plus some accounting needed to play nicely with other
615 * parts of the VM system.
616 * At each level, we keep a list of pages, which are heads of continuous
617 * free pages of length of (1 << order) and marked with _mapcount
618 * PAGE_BUDDY_MAPCOUNT_VALUE. Page's order is recorded in page_private(page)
620 * So when we are allocating or freeing one, we can derive the state of the
621 * other. That is, if we allocate a small block, and both were
622 * free, the remainder of the region must be split into blocks.
623 * If a block is freed, and its buddy is also free, then this
624 * triggers coalescing into a block of larger size.
629 static inline void __free_one_page(struct page
*page
,
631 struct zone
*zone
, unsigned int order
,
634 unsigned long page_idx
;
635 unsigned long combined_idx
;
636 unsigned long uninitialized_var(buddy_idx
);
638 int max_order
= MAX_ORDER
;
640 VM_BUG_ON(!zone_is_initialized(zone
));
641 VM_BUG_ON_PAGE(page
->flags
& PAGE_FLAGS_CHECK_AT_PREP
, page
);
643 VM_BUG_ON(migratetype
== -1);
644 if (is_migrate_isolate(migratetype
)) {
646 * We restrict max order of merging to prevent merge
647 * between freepages on isolate pageblock and normal
648 * pageblock. Without this, pageblock isolation
649 * could cause incorrect freepage accounting.
651 max_order
= min(MAX_ORDER
, pageblock_order
+ 1);
653 __mod_zone_freepage_state(zone
, 1 << order
, migratetype
);
656 page_idx
= pfn
& ((1 << max_order
) - 1);
658 VM_BUG_ON_PAGE(page_idx
& ((1 << order
) - 1), page
);
659 VM_BUG_ON_PAGE(bad_range(zone
, page
), page
);
661 while (order
< max_order
- 1) {
662 buddy_idx
= __find_buddy_index(page_idx
, order
);
663 buddy
= page
+ (buddy_idx
- page_idx
);
664 if (!page_is_buddy(page
, buddy
, order
))
667 * Our buddy is free or it is CONFIG_DEBUG_PAGEALLOC guard page,
668 * merge with it and move up one order.
670 if (page_is_guard(buddy
)) {
671 clear_page_guard(zone
, buddy
, order
, migratetype
);
673 list_del(&buddy
->lru
);
674 zone
->free_area
[order
].nr_free
--;
675 rmv_page_order(buddy
);
677 combined_idx
= buddy_idx
& page_idx
;
678 page
= page
+ (combined_idx
- page_idx
);
679 page_idx
= combined_idx
;
682 set_page_order(page
, order
);
685 * If this is not the largest possible page, check if the buddy
686 * of the next-highest order is free. If it is, it's possible
687 * that pages are being freed that will coalesce soon. In case,
688 * that is happening, add the free page to the tail of the list
689 * so it's less likely to be used soon and more likely to be merged
690 * as a higher order page
692 if ((order
< MAX_ORDER
-2) && pfn_valid_within(page_to_pfn(buddy
))) {
693 struct page
*higher_page
, *higher_buddy
;
694 combined_idx
= buddy_idx
& page_idx
;
695 higher_page
= page
+ (combined_idx
- page_idx
);
696 buddy_idx
= __find_buddy_index(combined_idx
, order
+ 1);
697 higher_buddy
= higher_page
+ (buddy_idx
- combined_idx
);
698 if (page_is_buddy(higher_page
, higher_buddy
, order
+ 1)) {
699 list_add_tail(&page
->lru
,
700 &zone
->free_area
[order
].free_list
[migratetype
]);
705 list_add(&page
->lru
, &zone
->free_area
[order
].free_list
[migratetype
]);
707 zone
->free_area
[order
].nr_free
++;
710 static inline int free_pages_check(struct page
*page
)
712 const char *bad_reason
= NULL
;
713 unsigned long bad_flags
= 0;
715 if (unlikely(page_mapcount(page
)))
716 bad_reason
= "nonzero mapcount";
717 if (unlikely(page
->mapping
!= NULL
))
718 bad_reason
= "non-NULL mapping";
719 if (unlikely(atomic_read(&page
->_count
) != 0))
720 bad_reason
= "nonzero _count";
721 if (unlikely(page
->flags
& PAGE_FLAGS_CHECK_AT_FREE
)) {
722 bad_reason
= "PAGE_FLAGS_CHECK_AT_FREE flag(s) set";
723 bad_flags
= PAGE_FLAGS_CHECK_AT_FREE
;
726 if (unlikely(page
->mem_cgroup
))
727 bad_reason
= "page still charged to cgroup";
729 if (unlikely(bad_reason
)) {
730 bad_page(page
, bad_reason
, bad_flags
);
733 page_cpupid_reset_last(page
);
734 if (page
->flags
& PAGE_FLAGS_CHECK_AT_PREP
)
735 page
->flags
&= ~PAGE_FLAGS_CHECK_AT_PREP
;
740 * Frees a number of pages from the PCP lists
741 * Assumes all pages on list are in same zone, and of same order.
742 * count is the number of pages to free.
744 * If the zone was previously in an "all pages pinned" state then look to
745 * see if this freeing clears that state.
747 * And clear the zone's pages_scanned counter, to hold off the "all pages are
748 * pinned" detection logic.
750 static void free_pcppages_bulk(struct zone
*zone
, int count
,
751 struct per_cpu_pages
*pcp
)
756 unsigned long nr_scanned
;
758 spin_lock(&zone
->lock
);
759 nr_scanned
= zone_page_state(zone
, NR_PAGES_SCANNED
);
761 __mod_zone_page_state(zone
, NR_PAGES_SCANNED
, -nr_scanned
);
765 struct list_head
*list
;
768 * Remove pages from lists in a round-robin fashion. A
769 * batch_free count is maintained that is incremented when an
770 * empty list is encountered. This is so more pages are freed
771 * off fuller lists instead of spinning excessively around empty
776 if (++migratetype
== MIGRATE_PCPTYPES
)
778 list
= &pcp
->lists
[migratetype
];
779 } while (list_empty(list
));
781 /* This is the only non-empty list. Free them all. */
782 if (batch_free
== MIGRATE_PCPTYPES
)
783 batch_free
= to_free
;
786 int mt
; /* migratetype of the to-be-freed page */
788 page
= list_entry(list
->prev
, struct page
, lru
);
789 /* must delete as __free_one_page list manipulates */
790 list_del(&page
->lru
);
791 mt
= get_freepage_migratetype(page
);
792 if (unlikely(has_isolate_pageblock(zone
)))
793 mt
= get_pageblock_migratetype(page
);
795 /* MIGRATE_MOVABLE list may include MIGRATE_RESERVEs */
796 __free_one_page(page
, page_to_pfn(page
), zone
, 0, mt
);
797 trace_mm_page_pcpu_drain(page
, 0, mt
);
798 } while (--to_free
&& --batch_free
&& !list_empty(list
));
800 spin_unlock(&zone
->lock
);
803 static void free_one_page(struct zone
*zone
,
804 struct page
*page
, unsigned long pfn
,
808 unsigned long nr_scanned
;
809 spin_lock(&zone
->lock
);
810 nr_scanned
= zone_page_state(zone
, NR_PAGES_SCANNED
);
812 __mod_zone_page_state(zone
, NR_PAGES_SCANNED
, -nr_scanned
);
814 if (unlikely(has_isolate_pageblock(zone
) ||
815 is_migrate_isolate(migratetype
))) {
816 migratetype
= get_pfnblock_migratetype(page
, pfn
);
818 __free_one_page(page
, pfn
, zone
, order
, migratetype
);
819 spin_unlock(&zone
->lock
);
822 static int free_tail_pages_check(struct page
*head_page
, struct page
*page
)
824 if (!IS_ENABLED(CONFIG_DEBUG_VM
))
826 if (unlikely(!PageTail(page
))) {
827 bad_page(page
, "PageTail not set", 0);
830 if (unlikely(page
->first_page
!= head_page
)) {
831 bad_page(page
, "first_page not consistent", 0);
837 static void __meminit
__init_single_page(struct page
*page
, unsigned long pfn
,
838 unsigned long zone
, int nid
)
840 set_page_links(page
, zone
, nid
, pfn
);
841 init_page_count(page
);
842 page_mapcount_reset(page
);
843 page_cpupid_reset_last(page
);
845 INIT_LIST_HEAD(&page
->lru
);
846 #ifdef WANT_PAGE_VIRTUAL
847 /* The shift won't overflow because ZONE_NORMAL is below 4G. */
848 if (!is_highmem_idx(zone
))
849 set_page_address(page
, __va(pfn
<< PAGE_SHIFT
));
853 static void __meminit
__init_single_pfn(unsigned long pfn
, unsigned long zone
,
856 return __init_single_page(pfn_to_page(pfn
), pfn
, zone
, nid
);
859 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
860 static void init_reserved_page(unsigned long pfn
)
865 if (!early_page_uninitialised(pfn
))
868 nid
= early_pfn_to_nid(pfn
);
869 pgdat
= NODE_DATA(nid
);
871 for (zid
= 0; zid
< MAX_NR_ZONES
; zid
++) {
872 struct zone
*zone
= &pgdat
->node_zones
[zid
];
874 if (pfn
>= zone
->zone_start_pfn
&& pfn
< zone_end_pfn(zone
))
877 __init_single_pfn(pfn
, zid
, nid
);
880 static inline void init_reserved_page(unsigned long pfn
)
883 #endif /* CONFIG_DEFERRED_STRUCT_PAGE_INIT */
886 * Initialised pages do not have PageReserved set. This function is
887 * called for each range allocated by the bootmem allocator and
888 * marks the pages PageReserved. The remaining valid pages are later
889 * sent to the buddy page allocator.
891 void __meminit
reserve_bootmem_region(unsigned long start
, unsigned long end
)
893 unsigned long start_pfn
= PFN_DOWN(start
);
894 unsigned long end_pfn
= PFN_UP(end
);
896 for (; start_pfn
< end_pfn
; start_pfn
++) {
897 if (pfn_valid(start_pfn
)) {
898 struct page
*page
= pfn_to_page(start_pfn
);
900 init_reserved_page(start_pfn
);
901 SetPageReserved(page
);
906 static bool free_pages_prepare(struct page
*page
, unsigned int order
)
908 bool compound
= PageCompound(page
);
911 VM_BUG_ON_PAGE(PageTail(page
), page
);
912 VM_BUG_ON_PAGE(compound
&& compound_order(page
) != order
, page
);
914 trace_mm_page_free(page
, order
);
915 kmemcheck_free_shadow(page
, order
);
916 kasan_free_pages(page
, order
);
919 page
->mapping
= NULL
;
920 bad
+= free_pages_check(page
);
921 for (i
= 1; i
< (1 << order
); i
++) {
923 bad
+= free_tail_pages_check(page
, page
+ i
);
924 bad
+= free_pages_check(page
+ i
);
929 reset_page_owner(page
, order
);
931 if (!PageHighMem(page
)) {
932 debug_check_no_locks_freed(page_address(page
),
934 debug_check_no_obj_freed(page_address(page
),
937 arch_free_page(page
, order
);
938 kernel_map_pages(page
, 1 << order
, 0);
943 static void __free_pages_ok(struct page
*page
, unsigned int order
)
947 unsigned long pfn
= page_to_pfn(page
);
949 if (!free_pages_prepare(page
, order
))
952 migratetype
= get_pfnblock_migratetype(page
, pfn
);
953 local_irq_save(flags
);
954 __count_vm_events(PGFREE
, 1 << order
);
955 set_freepage_migratetype(page
, migratetype
);
956 free_one_page(page_zone(page
), page
, pfn
, order
, migratetype
);
957 local_irq_restore(flags
);
960 static void __init
__free_pages_boot_core(struct page
*page
,
961 unsigned long pfn
, unsigned int order
)
963 unsigned int nr_pages
= 1 << order
;
964 struct page
*p
= page
;
968 for (loop
= 0; loop
< (nr_pages
- 1); loop
++, p
++) {
970 __ClearPageReserved(p
);
971 set_page_count(p
, 0);
973 __ClearPageReserved(p
);
974 set_page_count(p
, 0);
976 page_zone(page
)->managed_pages
+= nr_pages
;
977 set_page_refcounted(page
);
978 __free_pages(page
, order
);
981 #if defined(CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID) || \
982 defined(CONFIG_HAVE_MEMBLOCK_NODE_MAP)
984 static struct mminit_pfnnid_cache early_pfnnid_cache __meminitdata
;
986 int __meminit
early_pfn_to_nid(unsigned long pfn
)
988 static DEFINE_SPINLOCK(early_pfn_lock
);
991 spin_lock(&early_pfn_lock
);
992 nid
= __early_pfn_to_nid(pfn
, &early_pfnnid_cache
);
995 spin_unlock(&early_pfn_lock
);
1001 #ifdef CONFIG_NODES_SPAN_OTHER_NODES
1002 static inline bool __meminit
meminit_pfn_in_nid(unsigned long pfn
, int node
,
1003 struct mminit_pfnnid_cache
*state
)
1007 nid
= __early_pfn_to_nid(pfn
, state
);
1008 if (nid
>= 0 && nid
!= node
)
1013 /* Only safe to use early in boot when initialisation is single-threaded */
1014 static inline bool __meminit
early_pfn_in_nid(unsigned long pfn
, int node
)
1016 return meminit_pfn_in_nid(pfn
, node
, &early_pfnnid_cache
);
1021 static inline bool __meminit
early_pfn_in_nid(unsigned long pfn
, int node
)
1025 static inline bool __meminit
meminit_pfn_in_nid(unsigned long pfn
, int node
,
1026 struct mminit_pfnnid_cache
*state
)
1033 void __init
__free_pages_bootmem(struct page
*page
, unsigned long pfn
,
1036 if (early_page_uninitialised(pfn
))
1038 return __free_pages_boot_core(page
, pfn
, order
);
1041 #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT
1042 static void __init
deferred_free_range(struct page
*page
,
1043 unsigned long pfn
, int nr_pages
)
1050 /* Free a large naturally-aligned chunk if possible */
1051 if (nr_pages
== MAX_ORDER_NR_PAGES
&&
1052 (pfn
& (MAX_ORDER_NR_PAGES
-1)) == 0) {
1053 set_pageblock_migratetype(page
, MIGRATE_MOVABLE
);
1054 __free_pages_boot_core(page
, pfn
, MAX_ORDER
-1);
1058 for (i
= 0; i
< nr_pages
; i
++, page
++, pfn
++)
1059 __free_pages_boot_core(page
, pfn
, 0);
1062 /* Completion tracking for deferred_init_memmap() threads */
1063 static atomic_t pgdat_init_n_undone __initdata
;
1064 static __initdata
DECLARE_COMPLETION(pgdat_init_all_done_comp
);
1066 static inline void __init
pgdat_init_report_one_done(void)
1068 if (atomic_dec_and_test(&pgdat_init_n_undone
))
1069 complete(&pgdat_init_all_done_comp
);
1072 /* Initialise remaining memory on a node */
1073 static int __init
deferred_init_memmap(void *data
)
1075 pg_data_t
*pgdat
= data
;
1076 int nid
= pgdat
->node_id
;
1077 struct mminit_pfnnid_cache nid_init_state
= { };
1078 unsigned long start
= jiffies
;
1079 unsigned long nr_pages
= 0;
1080 unsigned long walk_start
, walk_end
;
1083 unsigned long first_init_pfn
= pgdat
->first_deferred_pfn
;
1084 const struct cpumask
*cpumask
= cpumask_of_node(pgdat
->node_id
);
1086 if (first_init_pfn
== ULONG_MAX
) {
1087 pgdat_init_report_one_done();
1091 /* Bind memory initialisation thread to a local node if possible */
1092 if (!cpumask_empty(cpumask
))
1093 set_cpus_allowed_ptr(current
, cpumask
);
1095 /* Sanity check boundaries */
1096 BUG_ON(pgdat
->first_deferred_pfn
< pgdat
->node_start_pfn
);
1097 BUG_ON(pgdat
->first_deferred_pfn
> pgdat_end_pfn(pgdat
));
1098 pgdat
->first_deferred_pfn
= ULONG_MAX
;
1100 /* Only the highest zone is deferred so find it */
1101 for (zid
= 0; zid
< MAX_NR_ZONES
; zid
++) {
1102 zone
= pgdat
->node_zones
+ zid
;
1103 if (first_init_pfn
< zone_end_pfn(zone
))
1107 for_each_mem_pfn_range(i
, nid
, &walk_start
, &walk_end
, NULL
) {
1108 unsigned long pfn
, end_pfn
;
1109 struct page
*page
= NULL
;
1110 struct page
*free_base_page
= NULL
;
1111 unsigned long free_base_pfn
= 0;
1114 end_pfn
= min(walk_end
, zone_end_pfn(zone
));
1115 pfn
= first_init_pfn
;
1116 if (pfn
< walk_start
)
1118 if (pfn
< zone
->zone_start_pfn
)
1119 pfn
= zone
->zone_start_pfn
;
1121 for (; pfn
< end_pfn
; pfn
++) {
1122 if (!pfn_valid_within(pfn
))
1126 * Ensure pfn_valid is checked every
1127 * MAX_ORDER_NR_PAGES for memory holes
1129 if ((pfn
& (MAX_ORDER_NR_PAGES
- 1)) == 0) {
1130 if (!pfn_valid(pfn
)) {
1136 if (!meminit_pfn_in_nid(pfn
, nid
, &nid_init_state
)) {
1141 /* Minimise pfn page lookups and scheduler checks */
1142 if (page
&& (pfn
& (MAX_ORDER_NR_PAGES
- 1)) != 0) {
1145 nr_pages
+= nr_to_free
;
1146 deferred_free_range(free_base_page
,
1147 free_base_pfn
, nr_to_free
);
1148 free_base_page
= NULL
;
1149 free_base_pfn
= nr_to_free
= 0;
1151 page
= pfn_to_page(pfn
);
1156 VM_BUG_ON(page_zone(page
) != zone
);
1160 __init_single_page(page
, pfn
, zid
, nid
);
1161 if (!free_base_page
) {
1162 free_base_page
= page
;
1163 free_base_pfn
= pfn
;
1168 /* Where possible, batch up pages for a single free */
1171 /* Free the current block of pages to allocator */
1172 nr_pages
+= nr_to_free
;
1173 deferred_free_range(free_base_page
, free_base_pfn
,
1175 free_base_page
= NULL
;
1176 free_base_pfn
= nr_to_free
= 0;
1179 first_init_pfn
= max(end_pfn
, first_init_pfn
);
1182 /* Sanity check that the next zone really is unpopulated */
1183 WARN_ON(++zid
< MAX_NR_ZONES
&& populated_zone(++zone
));
1185 pr_info("node %d initialised, %lu pages in %ums\n", nid
, nr_pages
,
1186 jiffies_to_msecs(jiffies
- start
));
1188 pgdat_init_report_one_done();
1192 void __init
page_alloc_init_late(void)
1196 /* There will be num_node_state(N_MEMORY) threads */
1197 atomic_set(&pgdat_init_n_undone
, num_node_state(N_MEMORY
));
1198 for_each_node_state(nid
, N_MEMORY
) {
1199 kthread_run(deferred_init_memmap
, NODE_DATA(nid
), "pgdatinit%d", nid
);
1202 /* Block until all are initialised */
1203 wait_for_completion(&pgdat_init_all_done_comp
);
1205 /* Reinit limits that are based on free pages after the kernel is up */
1206 files_maxfiles_init();
1208 #endif /* CONFIG_DEFERRED_STRUCT_PAGE_INIT */
1211 /* Free whole pageblock and set its migration type to MIGRATE_CMA. */
1212 void __init
init_cma_reserved_pageblock(struct page
*page
)
1214 unsigned i
= pageblock_nr_pages
;
1215 struct page
*p
= page
;
1218 __ClearPageReserved(p
);
1219 set_page_count(p
, 0);
1222 set_pageblock_migratetype(page
, MIGRATE_CMA
);
1224 if (pageblock_order
>= MAX_ORDER
) {
1225 i
= pageblock_nr_pages
;
1228 set_page_refcounted(p
);
1229 __free_pages(p
, MAX_ORDER
- 1);
1230 p
+= MAX_ORDER_NR_PAGES
;
1231 } while (i
-= MAX_ORDER_NR_PAGES
);
1233 set_page_refcounted(page
);
1234 __free_pages(page
, pageblock_order
);
1237 adjust_managed_page_count(page
, pageblock_nr_pages
);
1242 * The order of subdivision here is critical for the IO subsystem.
1243 * Please do not alter this order without good reasons and regression
1244 * testing. Specifically, as large blocks of memory are subdivided,
1245 * the order in which smaller blocks are delivered depends on the order
1246 * they're subdivided in this function. This is the primary factor
1247 * influencing the order in which pages are delivered to the IO
1248 * subsystem according to empirical testing, and this is also justified
1249 * by considering the behavior of a buddy system containing a single
1250 * large block of memory acted on by a series of small allocations.
1251 * This behavior is a critical factor in sglist merging's success.
1255 static inline void expand(struct zone
*zone
, struct page
*page
,
1256 int low
, int high
, struct free_area
*area
,
1259 unsigned long size
= 1 << high
;
1261 while (high
> low
) {
1265 VM_BUG_ON_PAGE(bad_range(zone
, &page
[size
]), &page
[size
]);
1267 if (IS_ENABLED(CONFIG_DEBUG_PAGEALLOC
) &&
1268 debug_guardpage_enabled() &&
1269 high
< debug_guardpage_minorder()) {
1271 * Mark as guard pages (or page), that will allow to
1272 * merge back to allocator when buddy will be freed.
1273 * Corresponding page table entries will not be touched,
1274 * pages will stay not present in virtual address space
1276 set_page_guard(zone
, &page
[size
], high
, migratetype
);
1279 list_add(&page
[size
].lru
, &area
->free_list
[migratetype
]);
1281 set_page_order(&page
[size
], high
);
1286 * This page is about to be returned from the page allocator
1288 static inline int check_new_page(struct page
*page
)
1290 const char *bad_reason
= NULL
;
1291 unsigned long bad_flags
= 0;
1293 if (unlikely(page_mapcount(page
)))
1294 bad_reason
= "nonzero mapcount";
1295 if (unlikely(page
->mapping
!= NULL
))
1296 bad_reason
= "non-NULL mapping";
1297 if (unlikely(atomic_read(&page
->_count
) != 0))
1298 bad_reason
= "nonzero _count";
1299 if (unlikely(page
->flags
& __PG_HWPOISON
)) {
1300 bad_reason
= "HWPoisoned (hardware-corrupted)";
1301 bad_flags
= __PG_HWPOISON
;
1303 if (unlikely(page
->flags
& PAGE_FLAGS_CHECK_AT_PREP
)) {
1304 bad_reason
= "PAGE_FLAGS_CHECK_AT_PREP flag set";
1305 bad_flags
= PAGE_FLAGS_CHECK_AT_PREP
;
1308 if (unlikely(page
->mem_cgroup
))
1309 bad_reason
= "page still charged to cgroup";
1311 if (unlikely(bad_reason
)) {
1312 bad_page(page
, bad_reason
, bad_flags
);
1318 static int prep_new_page(struct page
*page
, unsigned int order
, gfp_t gfp_flags
,
1323 for (i
= 0; i
< (1 << order
); i
++) {
1324 struct page
*p
= page
+ i
;
1325 if (unlikely(check_new_page(p
)))
1329 set_page_private(page
, 0);
1330 set_page_refcounted(page
);
1332 arch_alloc_page(page
, order
);
1333 kernel_map_pages(page
, 1 << order
, 1);
1334 kasan_alloc_pages(page
, order
);
1336 if (gfp_flags
& __GFP_ZERO
)
1337 for (i
= 0; i
< (1 << order
); i
++)
1338 clear_highpage(page
+ i
);
1340 if (order
&& (gfp_flags
& __GFP_COMP
))
1341 prep_compound_page(page
, order
);
1343 set_page_owner(page
, order
, gfp_flags
);
1346 * page is set pfmemalloc when ALLOC_NO_WATERMARKS was necessary to
1347 * allocate the page. The expectation is that the caller is taking
1348 * steps that will free more memory. The caller should avoid the page
1349 * being used for !PFMEMALLOC purposes.
1351 if (alloc_flags
& ALLOC_NO_WATERMARKS
)
1352 set_page_pfmemalloc(page
);
1354 clear_page_pfmemalloc(page
);
1360 * Go through the free lists for the given migratetype and remove
1361 * the smallest available page from the freelists
1364 struct page
*__rmqueue_smallest(struct zone
*zone
, unsigned int order
,
1367 unsigned int current_order
;
1368 struct free_area
*area
;
1371 /* Find a page of the appropriate size in the preferred list */
1372 for (current_order
= order
; current_order
< MAX_ORDER
; ++current_order
) {
1373 area
= &(zone
->free_area
[current_order
]);
1374 if (list_empty(&area
->free_list
[migratetype
]))
1377 page
= list_entry(area
->free_list
[migratetype
].next
,
1379 list_del(&page
->lru
);
1380 rmv_page_order(page
);
1382 expand(zone
, page
, order
, current_order
, area
, migratetype
);
1383 set_freepage_migratetype(page
, migratetype
);
1392 * This array describes the order lists are fallen back to when
1393 * the free lists for the desirable migrate type are depleted
1395 static int fallbacks
[MIGRATE_TYPES
][4] = {
1396 [MIGRATE_UNMOVABLE
] = { MIGRATE_RECLAIMABLE
, MIGRATE_MOVABLE
, MIGRATE_RESERVE
},
1397 [MIGRATE_RECLAIMABLE
] = { MIGRATE_UNMOVABLE
, MIGRATE_MOVABLE
, MIGRATE_RESERVE
},
1398 [MIGRATE_MOVABLE
] = { MIGRATE_RECLAIMABLE
, MIGRATE_UNMOVABLE
, MIGRATE_RESERVE
},
1400 [MIGRATE_CMA
] = { MIGRATE_RESERVE
}, /* Never used */
1402 [MIGRATE_RESERVE
] = { MIGRATE_RESERVE
}, /* Never used */
1403 #ifdef CONFIG_MEMORY_ISOLATION
1404 [MIGRATE_ISOLATE
] = { MIGRATE_RESERVE
}, /* Never used */
1409 static struct page
*__rmqueue_cma_fallback(struct zone
*zone
,
1412 return __rmqueue_smallest(zone
, order
, MIGRATE_CMA
);
1415 static inline struct page
*__rmqueue_cma_fallback(struct zone
*zone
,
1416 unsigned int order
) { return NULL
; }
1420 * Move the free pages in a range to the free lists of the requested type.
1421 * Note that start_page and end_pages are not aligned on a pageblock
1422 * boundary. If alignment is required, use move_freepages_block()
1424 int move_freepages(struct zone
*zone
,
1425 struct page
*start_page
, struct page
*end_page
,
1429 unsigned long order
;
1430 int pages_moved
= 0;
1432 #ifndef CONFIG_HOLES_IN_ZONE
1434 * page_zone is not safe to call in this context when
1435 * CONFIG_HOLES_IN_ZONE is set. This bug check is probably redundant
1436 * anyway as we check zone boundaries in move_freepages_block().
1437 * Remove at a later date when no bug reports exist related to
1438 * grouping pages by mobility
1440 VM_BUG_ON(page_zone(start_page
) != page_zone(end_page
));
1443 for (page
= start_page
; page
<= end_page
;) {
1444 /* Make sure we are not inadvertently changing nodes */
1445 VM_BUG_ON_PAGE(page_to_nid(page
) != zone_to_nid(zone
), page
);
1447 if (!pfn_valid_within(page_to_pfn(page
))) {
1452 if (!PageBuddy(page
)) {
1457 order
= page_order(page
);
1458 list_move(&page
->lru
,
1459 &zone
->free_area
[order
].free_list
[migratetype
]);
1460 set_freepage_migratetype(page
, migratetype
);
1462 pages_moved
+= 1 << order
;
1468 int move_freepages_block(struct zone
*zone
, struct page
*page
,
1471 unsigned long start_pfn
, end_pfn
;
1472 struct page
*start_page
, *end_page
;
1474 start_pfn
= page_to_pfn(page
);
1475 start_pfn
= start_pfn
& ~(pageblock_nr_pages
-1);
1476 start_page
= pfn_to_page(start_pfn
);
1477 end_page
= start_page
+ pageblock_nr_pages
- 1;
1478 end_pfn
= start_pfn
+ pageblock_nr_pages
- 1;
1480 /* Do not cross zone boundaries */
1481 if (!zone_spans_pfn(zone
, start_pfn
))
1483 if (!zone_spans_pfn(zone
, end_pfn
))
1486 return move_freepages(zone
, start_page
, end_page
, migratetype
);
1489 static void change_pageblock_range(struct page
*pageblock_page
,
1490 int start_order
, int migratetype
)
1492 int nr_pageblocks
= 1 << (start_order
- pageblock_order
);
1494 while (nr_pageblocks
--) {
1495 set_pageblock_migratetype(pageblock_page
, migratetype
);
1496 pageblock_page
+= pageblock_nr_pages
;
1501 * When we are falling back to another migratetype during allocation, try to
1502 * steal extra free pages from the same pageblocks to satisfy further
1503 * allocations, instead of polluting multiple pageblocks.
1505 * If we are stealing a relatively large buddy page, it is likely there will
1506 * be more free pages in the pageblock, so try to steal them all. For
1507 * reclaimable and unmovable allocations, we steal regardless of page size,
1508 * as fragmentation caused by those allocations polluting movable pageblocks
1509 * is worse than movable allocations stealing from unmovable and reclaimable
1512 static bool can_steal_fallback(unsigned int order
, int start_mt
)
1515 * Leaving this order check is intended, although there is
1516 * relaxed order check in next check. The reason is that
1517 * we can actually steal whole pageblock if this condition met,
1518 * but, below check doesn't guarantee it and that is just heuristic
1519 * so could be changed anytime.
1521 if (order
>= pageblock_order
)
1524 if (order
>= pageblock_order
/ 2 ||
1525 start_mt
== MIGRATE_RECLAIMABLE
||
1526 start_mt
== MIGRATE_UNMOVABLE
||
1527 page_group_by_mobility_disabled
)
1534 * This function implements actual steal behaviour. If order is large enough,
1535 * we can steal whole pageblock. If not, we first move freepages in this
1536 * pageblock and check whether half of pages are moved or not. If half of
1537 * pages are moved, we can change migratetype of pageblock and permanently
1538 * use it's pages as requested migratetype in the future.
1540 static void steal_suitable_fallback(struct zone
*zone
, struct page
*page
,
1543 int current_order
= page_order(page
);
1546 /* Take ownership for orders >= pageblock_order */
1547 if (current_order
>= pageblock_order
) {
1548 change_pageblock_range(page
, current_order
, start_type
);
1552 pages
= move_freepages_block(zone
, page
, start_type
);
1554 /* Claim the whole block if over half of it is free */
1555 if (pages
>= (1 << (pageblock_order
-1)) ||
1556 page_group_by_mobility_disabled
)
1557 set_pageblock_migratetype(page
, start_type
);
1561 * Check whether there is a suitable fallback freepage with requested order.
1562 * If only_stealable is true, this function returns fallback_mt only if
1563 * we can steal other freepages all together. This would help to reduce
1564 * fragmentation due to mixed migratetype pages in one pageblock.
1566 int find_suitable_fallback(struct free_area
*area
, unsigned int order
,
1567 int migratetype
, bool only_stealable
, bool *can_steal
)
1572 if (area
->nr_free
== 0)
1577 fallback_mt
= fallbacks
[migratetype
][i
];
1578 if (fallback_mt
== MIGRATE_RESERVE
)
1581 if (list_empty(&area
->free_list
[fallback_mt
]))
1584 if (can_steal_fallback(order
, migratetype
))
1587 if (!only_stealable
)
1597 /* Remove an element from the buddy allocator from the fallback list */
1598 static inline struct page
*
1599 __rmqueue_fallback(struct zone
*zone
, unsigned int order
, int start_migratetype
)
1601 struct free_area
*area
;
1602 unsigned int current_order
;
1607 /* Find the largest possible block of pages in the other list */
1608 for (current_order
= MAX_ORDER
-1;
1609 current_order
>= order
&& current_order
<= MAX_ORDER
-1;
1611 area
= &(zone
->free_area
[current_order
]);
1612 fallback_mt
= find_suitable_fallback(area
, current_order
,
1613 start_migratetype
, false, &can_steal
);
1614 if (fallback_mt
== -1)
1617 page
= list_entry(area
->free_list
[fallback_mt
].next
,
1620 steal_suitable_fallback(zone
, page
, start_migratetype
);
1622 /* Remove the page from the freelists */
1624 list_del(&page
->lru
);
1625 rmv_page_order(page
);
1627 expand(zone
, page
, order
, current_order
, area
,
1630 * The freepage_migratetype may differ from pageblock's
1631 * migratetype depending on the decisions in
1632 * try_to_steal_freepages(). This is OK as long as it
1633 * does not differ for MIGRATE_CMA pageblocks. For CMA
1634 * we need to make sure unallocated pages flushed from
1635 * pcp lists are returned to the correct freelist.
1637 set_freepage_migratetype(page
, start_migratetype
);
1639 trace_mm_page_alloc_extfrag(page
, order
, current_order
,
1640 start_migratetype
, fallback_mt
);
1649 * Do the hard work of removing an element from the buddy allocator.
1650 * Call me with the zone->lock already held.
1652 static struct page
*__rmqueue(struct zone
*zone
, unsigned int order
,
1658 page
= __rmqueue_smallest(zone
, order
, migratetype
);
1660 if (unlikely(!page
) && migratetype
!= MIGRATE_RESERVE
) {
1661 if (migratetype
== MIGRATE_MOVABLE
)
1662 page
= __rmqueue_cma_fallback(zone
, order
);
1665 page
= __rmqueue_fallback(zone
, order
, migratetype
);
1668 * Use MIGRATE_RESERVE rather than fail an allocation. goto
1669 * is used because __rmqueue_smallest is an inline function
1670 * and we want just one call site
1673 migratetype
= MIGRATE_RESERVE
;
1678 trace_mm_page_alloc_zone_locked(page
, order
, migratetype
);
1683 * Obtain a specified number of elements from the buddy allocator, all under
1684 * a single hold of the lock, for efficiency. Add them to the supplied list.
1685 * Returns the number of new pages which were placed at *list.
1687 static int rmqueue_bulk(struct zone
*zone
, unsigned int order
,
1688 unsigned long count
, struct list_head
*list
,
1689 int migratetype
, bool cold
)
1693 spin_lock(&zone
->lock
);
1694 for (i
= 0; i
< count
; ++i
) {
1695 struct page
*page
= __rmqueue(zone
, order
, migratetype
);
1696 if (unlikely(page
== NULL
))
1700 * Split buddy pages returned by expand() are received here
1701 * in physical page order. The page is added to the callers and
1702 * list and the list head then moves forward. From the callers
1703 * perspective, the linked list is ordered by page number in
1704 * some conditions. This is useful for IO devices that can
1705 * merge IO requests if the physical pages are ordered
1709 list_add(&page
->lru
, list
);
1711 list_add_tail(&page
->lru
, list
);
1713 if (is_migrate_cma(get_freepage_migratetype(page
)))
1714 __mod_zone_page_state(zone
, NR_FREE_CMA_PAGES
,
1717 __mod_zone_page_state(zone
, NR_FREE_PAGES
, -(i
<< order
));
1718 spin_unlock(&zone
->lock
);
1724 * Called from the vmstat counter updater to drain pagesets of this
1725 * currently executing processor on remote nodes after they have
1728 * Note that this function must be called with the thread pinned to
1729 * a single processor.
1731 void drain_zone_pages(struct zone
*zone
, struct per_cpu_pages
*pcp
)
1733 unsigned long flags
;
1734 int to_drain
, batch
;
1736 local_irq_save(flags
);
1737 batch
= READ_ONCE(pcp
->batch
);
1738 to_drain
= min(pcp
->count
, batch
);
1740 free_pcppages_bulk(zone
, to_drain
, pcp
);
1741 pcp
->count
-= to_drain
;
1743 local_irq_restore(flags
);
1748 * Drain pcplists of the indicated processor and zone.
1750 * The processor must either be the current processor and the
1751 * thread pinned to the current processor or a processor that
1754 static void drain_pages_zone(unsigned int cpu
, struct zone
*zone
)
1756 unsigned long flags
;
1757 struct per_cpu_pageset
*pset
;
1758 struct per_cpu_pages
*pcp
;
1760 local_irq_save(flags
);
1761 pset
= per_cpu_ptr(zone
->pageset
, cpu
);
1765 free_pcppages_bulk(zone
, pcp
->count
, pcp
);
1768 local_irq_restore(flags
);
1772 * Drain pcplists of all zones on the indicated processor.
1774 * The processor must either be the current processor and the
1775 * thread pinned to the current processor or a processor that
1778 static void drain_pages(unsigned int cpu
)
1782 for_each_populated_zone(zone
) {
1783 drain_pages_zone(cpu
, zone
);
1788 * Spill all of this CPU's per-cpu pages back into the buddy allocator.
1790 * The CPU has to be pinned. When zone parameter is non-NULL, spill just
1791 * the single zone's pages.
1793 void drain_local_pages(struct zone
*zone
)
1795 int cpu
= smp_processor_id();
1798 drain_pages_zone(cpu
, zone
);
1804 * Spill all the per-cpu pages from all CPUs back into the buddy allocator.
1806 * When zone parameter is non-NULL, spill just the single zone's pages.
1808 * Note that this code is protected against sending an IPI to an offline
1809 * CPU but does not guarantee sending an IPI to newly hotplugged CPUs:
1810 * on_each_cpu_mask() blocks hotplug and won't talk to offlined CPUs but
1811 * nothing keeps CPUs from showing up after we populated the cpumask and
1812 * before the call to on_each_cpu_mask().
1814 void drain_all_pages(struct zone
*zone
)
1819 * Allocate in the BSS so we wont require allocation in
1820 * direct reclaim path for CONFIG_CPUMASK_OFFSTACK=y
1822 static cpumask_t cpus_with_pcps
;
1825 * We don't care about racing with CPU hotplug event
1826 * as offline notification will cause the notified
1827 * cpu to drain that CPU pcps and on_each_cpu_mask
1828 * disables preemption as part of its processing
1830 for_each_online_cpu(cpu
) {
1831 struct per_cpu_pageset
*pcp
;
1833 bool has_pcps
= false;
1836 pcp
= per_cpu_ptr(zone
->pageset
, cpu
);
1840 for_each_populated_zone(z
) {
1841 pcp
= per_cpu_ptr(z
->pageset
, cpu
);
1842 if (pcp
->pcp
.count
) {
1850 cpumask_set_cpu(cpu
, &cpus_with_pcps
);
1852 cpumask_clear_cpu(cpu
, &cpus_with_pcps
);
1854 on_each_cpu_mask(&cpus_with_pcps
, (smp_call_func_t
) drain_local_pages
,
1858 #ifdef CONFIG_HIBERNATION
1860 void mark_free_pages(struct zone
*zone
)
1862 unsigned long pfn
, max_zone_pfn
;
1863 unsigned long flags
;
1864 unsigned int order
, t
;
1865 struct list_head
*curr
;
1867 if (zone_is_empty(zone
))
1870 spin_lock_irqsave(&zone
->lock
, flags
);
1872 max_zone_pfn
= zone_end_pfn(zone
);
1873 for (pfn
= zone
->zone_start_pfn
; pfn
< max_zone_pfn
; pfn
++)
1874 if (pfn_valid(pfn
)) {
1875 struct page
*page
= pfn_to_page(pfn
);
1877 if (!swsusp_page_is_forbidden(page
))
1878 swsusp_unset_page_free(page
);
1881 for_each_migratetype_order(order
, t
) {
1882 list_for_each(curr
, &zone
->free_area
[order
].free_list
[t
]) {
1885 pfn
= page_to_pfn(list_entry(curr
, struct page
, lru
));
1886 for (i
= 0; i
< (1UL << order
); i
++)
1887 swsusp_set_page_free(pfn_to_page(pfn
+ i
));
1890 spin_unlock_irqrestore(&zone
->lock
, flags
);
1892 #endif /* CONFIG_PM */
1895 * Free a 0-order page
1896 * cold == true ? free a cold page : free a hot page
1898 void free_hot_cold_page(struct page
*page
, bool cold
)
1900 struct zone
*zone
= page_zone(page
);
1901 struct per_cpu_pages
*pcp
;
1902 unsigned long flags
;
1903 unsigned long pfn
= page_to_pfn(page
);
1906 if (!free_pages_prepare(page
, 0))
1909 migratetype
= get_pfnblock_migratetype(page
, pfn
);
1910 set_freepage_migratetype(page
, migratetype
);
1911 local_irq_save(flags
);
1912 __count_vm_event(PGFREE
);
1915 * We only track unmovable, reclaimable and movable on pcp lists.
1916 * Free ISOLATE pages back to the allocator because they are being
1917 * offlined but treat RESERVE as movable pages so we can get those
1918 * areas back if necessary. Otherwise, we may have to free
1919 * excessively into the page allocator
1921 if (migratetype
>= MIGRATE_PCPTYPES
) {
1922 if (unlikely(is_migrate_isolate(migratetype
))) {
1923 free_one_page(zone
, page
, pfn
, 0, migratetype
);
1926 migratetype
= MIGRATE_MOVABLE
;
1929 pcp
= &this_cpu_ptr(zone
->pageset
)->pcp
;
1931 list_add(&page
->lru
, &pcp
->lists
[migratetype
]);
1933 list_add_tail(&page
->lru
, &pcp
->lists
[migratetype
]);
1935 if (pcp
->count
>= pcp
->high
) {
1936 unsigned long batch
= READ_ONCE(pcp
->batch
);
1937 free_pcppages_bulk(zone
, batch
, pcp
);
1938 pcp
->count
-= batch
;
1942 local_irq_restore(flags
);
1946 * Free a list of 0-order pages
1948 void free_hot_cold_page_list(struct list_head
*list
, bool cold
)
1950 struct page
*page
, *next
;
1952 list_for_each_entry_safe(page
, next
, list
, lru
) {
1953 trace_mm_page_free_batched(page
, cold
);
1954 free_hot_cold_page(page
, cold
);
1959 * split_page takes a non-compound higher-order page, and splits it into
1960 * n (1<<order) sub-pages: page[0..n]
1961 * Each sub-page must be freed individually.
1963 * Note: this is probably too low level an operation for use in drivers.
1964 * Please consult with lkml before using this in your driver.
1966 void split_page(struct page
*page
, unsigned int order
)
1971 VM_BUG_ON_PAGE(PageCompound(page
), page
);
1972 VM_BUG_ON_PAGE(!page_count(page
), page
);
1974 #ifdef CONFIG_KMEMCHECK
1976 * Split shadow pages too, because free(page[0]) would
1977 * otherwise free the whole shadow.
1979 if (kmemcheck_page_is_tracked(page
))
1980 split_page(virt_to_page(page
[0].shadow
), order
);
1983 gfp_mask
= get_page_owner_gfp(page
);
1984 set_page_owner(page
, 0, gfp_mask
);
1985 for (i
= 1; i
< (1 << order
); i
++) {
1986 set_page_refcounted(page
+ i
);
1987 set_page_owner(page
+ i
, 0, gfp_mask
);
1990 EXPORT_SYMBOL_GPL(split_page
);
1992 int __isolate_free_page(struct page
*page
, unsigned int order
)
1994 unsigned long watermark
;
1998 BUG_ON(!PageBuddy(page
));
2000 zone
= page_zone(page
);
2001 mt
= get_pageblock_migratetype(page
);
2003 if (!is_migrate_isolate(mt
)) {
2004 /* Obey watermarks as if the page was being allocated */
2005 watermark
= low_wmark_pages(zone
) + (1 << order
);
2006 if (!zone_watermark_ok(zone
, 0, watermark
, 0, 0))
2009 __mod_zone_freepage_state(zone
, -(1UL << order
), mt
);
2012 /* Remove page from free list */
2013 list_del(&page
->lru
);
2014 zone
->free_area
[order
].nr_free
--;
2015 rmv_page_order(page
);
2017 set_page_owner(page
, order
, __GFP_MOVABLE
);
2019 /* Set the pageblock if the isolated page is at least a pageblock */
2020 if (order
>= pageblock_order
- 1) {
2021 struct page
*endpage
= page
+ (1 << order
) - 1;
2022 for (; page
< endpage
; page
+= pageblock_nr_pages
) {
2023 int mt
= get_pageblock_migratetype(page
);
2024 if (!is_migrate_isolate(mt
) && !is_migrate_cma(mt
))
2025 set_pageblock_migratetype(page
,
2031 return 1UL << order
;
2035 * Similar to split_page except the page is already free. As this is only
2036 * being used for migration, the migratetype of the block also changes.
2037 * As this is called with interrupts disabled, the caller is responsible
2038 * for calling arch_alloc_page() and kernel_map_page() after interrupts
2041 * Note: this is probably too low level an operation for use in drivers.
2042 * Please consult with lkml before using this in your driver.
2044 int split_free_page(struct page
*page
)
2049 order
= page_order(page
);
2051 nr_pages
= __isolate_free_page(page
, order
);
2055 /* Split into individual pages */
2056 set_page_refcounted(page
);
2057 split_page(page
, order
);
2062 * Allocate a page from the given zone. Use pcplists for order-0 allocations.
2065 struct page
*buffered_rmqueue(struct zone
*preferred_zone
,
2066 struct zone
*zone
, unsigned int order
,
2067 gfp_t gfp_flags
, int migratetype
)
2069 unsigned long flags
;
2071 bool cold
= ((gfp_flags
& __GFP_COLD
) != 0);
2073 if (likely(order
== 0)) {
2074 struct per_cpu_pages
*pcp
;
2075 struct list_head
*list
;
2077 local_irq_save(flags
);
2078 pcp
= &this_cpu_ptr(zone
->pageset
)->pcp
;
2079 list
= &pcp
->lists
[migratetype
];
2080 if (list_empty(list
)) {
2081 pcp
->count
+= rmqueue_bulk(zone
, 0,
2084 if (unlikely(list_empty(list
)))
2089 page
= list_entry(list
->prev
, struct page
, lru
);
2091 page
= list_entry(list
->next
, struct page
, lru
);
2093 list_del(&page
->lru
);
2096 if (unlikely(gfp_flags
& __GFP_NOFAIL
)) {
2098 * __GFP_NOFAIL is not to be used in new code.
2100 * All __GFP_NOFAIL callers should be fixed so that they
2101 * properly detect and handle allocation failures.
2103 * We most definitely don't want callers attempting to
2104 * allocate greater than order-1 page units with
2107 WARN_ON_ONCE(order
> 1);
2109 spin_lock_irqsave(&zone
->lock
, flags
);
2110 page
= __rmqueue(zone
, order
, migratetype
);
2111 spin_unlock(&zone
->lock
);
2114 __mod_zone_freepage_state(zone
, -(1 << order
),
2115 get_freepage_migratetype(page
));
2118 __mod_zone_page_state(zone
, NR_ALLOC_BATCH
, -(1 << order
));
2119 if (atomic_long_read(&zone
->vm_stat
[NR_ALLOC_BATCH
]) <= 0 &&
2120 !test_bit(ZONE_FAIR_DEPLETED
, &zone
->flags
))
2121 set_bit(ZONE_FAIR_DEPLETED
, &zone
->flags
);
2123 __count_zone_vm_events(PGALLOC
, zone
, 1 << order
);
2124 zone_statistics(preferred_zone
, zone
, gfp_flags
);
2125 local_irq_restore(flags
);
2127 VM_BUG_ON_PAGE(bad_range(zone
, page
), page
);
2131 local_irq_restore(flags
);
2135 #ifdef CONFIG_FAIL_PAGE_ALLOC
2138 struct fault_attr attr
;
2140 u32 ignore_gfp_highmem
;
2141 u32 ignore_gfp_wait
;
2143 } fail_page_alloc
= {
2144 .attr
= FAULT_ATTR_INITIALIZER
,
2145 .ignore_gfp_wait
= 1,
2146 .ignore_gfp_highmem
= 1,
2150 static int __init
setup_fail_page_alloc(char *str
)
2152 return setup_fault_attr(&fail_page_alloc
.attr
, str
);
2154 __setup("fail_page_alloc=", setup_fail_page_alloc
);
2156 static bool should_fail_alloc_page(gfp_t gfp_mask
, unsigned int order
)
2158 if (order
< fail_page_alloc
.min_order
)
2160 if (gfp_mask
& __GFP_NOFAIL
)
2162 if (fail_page_alloc
.ignore_gfp_highmem
&& (gfp_mask
& __GFP_HIGHMEM
))
2164 if (fail_page_alloc
.ignore_gfp_wait
&& (gfp_mask
& __GFP_WAIT
))
2167 return should_fail(&fail_page_alloc
.attr
, 1 << order
);
2170 #ifdef CONFIG_FAULT_INJECTION_DEBUG_FS
2172 static int __init
fail_page_alloc_debugfs(void)
2174 umode_t mode
= S_IFREG
| S_IRUSR
| S_IWUSR
;
2177 dir
= fault_create_debugfs_attr("fail_page_alloc", NULL
,
2178 &fail_page_alloc
.attr
);
2180 return PTR_ERR(dir
);
2182 if (!debugfs_create_bool("ignore-gfp-wait", mode
, dir
,
2183 &fail_page_alloc
.ignore_gfp_wait
))
2185 if (!debugfs_create_bool("ignore-gfp-highmem", mode
, dir
,
2186 &fail_page_alloc
.ignore_gfp_highmem
))
2188 if (!debugfs_create_u32("min-order", mode
, dir
,
2189 &fail_page_alloc
.min_order
))
2194 debugfs_remove_recursive(dir
);
2199 late_initcall(fail_page_alloc_debugfs
);
2201 #endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */
2203 #else /* CONFIG_FAIL_PAGE_ALLOC */
2205 static inline bool should_fail_alloc_page(gfp_t gfp_mask
, unsigned int order
)
2210 #endif /* CONFIG_FAIL_PAGE_ALLOC */
2213 * Return true if free pages are above 'mark'. This takes into account the order
2214 * of the allocation.
2216 static bool __zone_watermark_ok(struct zone
*z
, unsigned int order
,
2217 unsigned long mark
, int classzone_idx
, int alloc_flags
,
2220 /* free_pages may go negative - that's OK */
2225 free_pages
-= (1 << order
) - 1;
2226 if (alloc_flags
& ALLOC_HIGH
)
2228 if (alloc_flags
& ALLOC_HARDER
)
2231 /* If allocation can't use CMA areas don't use free CMA pages */
2232 if (!(alloc_flags
& ALLOC_CMA
))
2233 free_cma
= zone_page_state(z
, NR_FREE_CMA_PAGES
);
2236 if (free_pages
- free_cma
<= min
+ z
->lowmem_reserve
[classzone_idx
])
2238 for (o
= 0; o
< order
; o
++) {
2239 /* At the next order, this order's pages become unavailable */
2240 free_pages
-= z
->free_area
[o
].nr_free
<< o
;
2242 /* Require fewer higher order pages to be free */
2245 if (free_pages
<= min
)
2251 bool zone_watermark_ok(struct zone
*z
, unsigned int order
, unsigned long mark
,
2252 int classzone_idx
, int alloc_flags
)
2254 return __zone_watermark_ok(z
, order
, mark
, classzone_idx
, alloc_flags
,
2255 zone_page_state(z
, NR_FREE_PAGES
));
2258 bool zone_watermark_ok_safe(struct zone
*z
, unsigned int order
,
2259 unsigned long mark
, int classzone_idx
, int alloc_flags
)
2261 long free_pages
= zone_page_state(z
, NR_FREE_PAGES
);
2263 if (z
->percpu_drift_mark
&& free_pages
< z
->percpu_drift_mark
)
2264 free_pages
= zone_page_state_snapshot(z
, NR_FREE_PAGES
);
2266 return __zone_watermark_ok(z
, order
, mark
, classzone_idx
, alloc_flags
,
2272 * zlc_setup - Setup for "zonelist cache". Uses cached zone data to
2273 * skip over zones that are not allowed by the cpuset, or that have
2274 * been recently (in last second) found to be nearly full. See further
2275 * comments in mmzone.h. Reduces cache footprint of zonelist scans
2276 * that have to skip over a lot of full or unallowed zones.
2278 * If the zonelist cache is present in the passed zonelist, then
2279 * returns a pointer to the allowed node mask (either the current
2280 * tasks mems_allowed, or node_states[N_MEMORY].)
2282 * If the zonelist cache is not available for this zonelist, does
2283 * nothing and returns NULL.
2285 * If the fullzones BITMAP in the zonelist cache is stale (more than
2286 * a second since last zap'd) then we zap it out (clear its bits.)
2288 * We hold off even calling zlc_setup, until after we've checked the
2289 * first zone in the zonelist, on the theory that most allocations will
2290 * be satisfied from that first zone, so best to examine that zone as
2291 * quickly as we can.
2293 static nodemask_t
*zlc_setup(struct zonelist
*zonelist
, int alloc_flags
)
2295 struct zonelist_cache
*zlc
; /* cached zonelist speedup info */
2296 nodemask_t
*allowednodes
; /* zonelist_cache approximation */
2298 zlc
= zonelist
->zlcache_ptr
;
2302 if (time_after(jiffies
, zlc
->last_full_zap
+ HZ
)) {
2303 bitmap_zero(zlc
->fullzones
, MAX_ZONES_PER_ZONELIST
);
2304 zlc
->last_full_zap
= jiffies
;
2307 allowednodes
= !in_interrupt() && (alloc_flags
& ALLOC_CPUSET
) ?
2308 &cpuset_current_mems_allowed
:
2309 &node_states
[N_MEMORY
];
2310 return allowednodes
;
2314 * Given 'z' scanning a zonelist, run a couple of quick checks to see
2315 * if it is worth looking at further for free memory:
2316 * 1) Check that the zone isn't thought to be full (doesn't have its
2317 * bit set in the zonelist_cache fullzones BITMAP).
2318 * 2) Check that the zones node (obtained from the zonelist_cache
2319 * z_to_n[] mapping) is allowed in the passed in allowednodes mask.
2320 * Return true (non-zero) if zone is worth looking at further, or
2321 * else return false (zero) if it is not.
2323 * This check -ignores- the distinction between various watermarks,
2324 * such as GFP_HIGH, GFP_ATOMIC, PF_MEMALLOC, ... If a zone is
2325 * found to be full for any variation of these watermarks, it will
2326 * be considered full for up to one second by all requests, unless
2327 * we are so low on memory on all allowed nodes that we are forced
2328 * into the second scan of the zonelist.
2330 * In the second scan we ignore this zonelist cache and exactly
2331 * apply the watermarks to all zones, even it is slower to do so.
2332 * We are low on memory in the second scan, and should leave no stone
2333 * unturned looking for a free page.
2335 static int zlc_zone_worth_trying(struct zonelist
*zonelist
, struct zoneref
*z
,
2336 nodemask_t
*allowednodes
)
2338 struct zonelist_cache
*zlc
; /* cached zonelist speedup info */
2339 int i
; /* index of *z in zonelist zones */
2340 int n
; /* node that zone *z is on */
2342 zlc
= zonelist
->zlcache_ptr
;
2346 i
= z
- zonelist
->_zonerefs
;
2349 /* This zone is worth trying if it is allowed but not full */
2350 return node_isset(n
, *allowednodes
) && !test_bit(i
, zlc
->fullzones
);
2354 * Given 'z' scanning a zonelist, set the corresponding bit in
2355 * zlc->fullzones, so that subsequent attempts to allocate a page
2356 * from that zone don't waste time re-examining it.
2358 static void zlc_mark_zone_full(struct zonelist
*zonelist
, struct zoneref
*z
)
2360 struct zonelist_cache
*zlc
; /* cached zonelist speedup info */
2361 int i
; /* index of *z in zonelist zones */
2363 zlc
= zonelist
->zlcache_ptr
;
2367 i
= z
- zonelist
->_zonerefs
;
2369 set_bit(i
, zlc
->fullzones
);
2373 * clear all zones full, called after direct reclaim makes progress so that
2374 * a zone that was recently full is not skipped over for up to a second
2376 static void zlc_clear_zones_full(struct zonelist
*zonelist
)
2378 struct zonelist_cache
*zlc
; /* cached zonelist speedup info */
2380 zlc
= zonelist
->zlcache_ptr
;
2384 bitmap_zero(zlc
->fullzones
, MAX_ZONES_PER_ZONELIST
);
2387 static bool zone_local(struct zone
*local_zone
, struct zone
*zone
)
2389 return local_zone
->node
== zone
->node
;
2392 static bool zone_allows_reclaim(struct zone
*local_zone
, struct zone
*zone
)
2394 return node_distance(zone_to_nid(local_zone
), zone_to_nid(zone
)) <
2398 #else /* CONFIG_NUMA */
2400 static nodemask_t
*zlc_setup(struct zonelist
*zonelist
, int alloc_flags
)
2405 static int zlc_zone_worth_trying(struct zonelist
*zonelist
, struct zoneref
*z
,
2406 nodemask_t
*allowednodes
)
2411 static void zlc_mark_zone_full(struct zonelist
*zonelist
, struct zoneref
*z
)
2415 static void zlc_clear_zones_full(struct zonelist
*zonelist
)
2419 static bool zone_local(struct zone
*local_zone
, struct zone
*zone
)
2424 static bool zone_allows_reclaim(struct zone
*local_zone
, struct zone
*zone
)
2429 #endif /* CONFIG_NUMA */
2431 static void reset_alloc_batches(struct zone
*preferred_zone
)
2433 struct zone
*zone
= preferred_zone
->zone_pgdat
->node_zones
;
2436 mod_zone_page_state(zone
, NR_ALLOC_BATCH
,
2437 high_wmark_pages(zone
) - low_wmark_pages(zone
) -
2438 atomic_long_read(&zone
->vm_stat
[NR_ALLOC_BATCH
]));
2439 clear_bit(ZONE_FAIR_DEPLETED
, &zone
->flags
);
2440 } while (zone
++ != preferred_zone
);
2444 * get_page_from_freelist goes through the zonelist trying to allocate
2447 static struct page
*
2448 get_page_from_freelist(gfp_t gfp_mask
, unsigned int order
, int alloc_flags
,
2449 const struct alloc_context
*ac
)
2451 struct zonelist
*zonelist
= ac
->zonelist
;
2453 struct page
*page
= NULL
;
2455 nodemask_t
*allowednodes
= NULL
;/* zonelist_cache approximation */
2456 int zlc_active
= 0; /* set if using zonelist_cache */
2457 int did_zlc_setup
= 0; /* just call zlc_setup() one time */
2458 bool consider_zone_dirty
= (alloc_flags
& ALLOC_WMARK_LOW
) &&
2459 (gfp_mask
& __GFP_WRITE
);
2460 int nr_fair_skipped
= 0;
2461 bool zonelist_rescan
;
2464 zonelist_rescan
= false;
2467 * Scan zonelist, looking for a zone with enough free.
2468 * See also __cpuset_node_allowed() comment in kernel/cpuset.c.
2470 for_each_zone_zonelist_nodemask(zone
, z
, zonelist
, ac
->high_zoneidx
,
2474 if (IS_ENABLED(CONFIG_NUMA
) && zlc_active
&&
2475 !zlc_zone_worth_trying(zonelist
, z
, allowednodes
))
2477 if (cpusets_enabled() &&
2478 (alloc_flags
& ALLOC_CPUSET
) &&
2479 !cpuset_zone_allowed(zone
, gfp_mask
))
2482 * Distribute pages in proportion to the individual
2483 * zone size to ensure fair page aging. The zone a
2484 * page was allocated in should have no effect on the
2485 * time the page has in memory before being reclaimed.
2487 if (alloc_flags
& ALLOC_FAIR
) {
2488 if (!zone_local(ac
->preferred_zone
, zone
))
2490 if (test_bit(ZONE_FAIR_DEPLETED
, &zone
->flags
)) {
2496 * When allocating a page cache page for writing, we
2497 * want to get it from a zone that is within its dirty
2498 * limit, such that no single zone holds more than its
2499 * proportional share of globally allowed dirty pages.
2500 * The dirty limits take into account the zone's
2501 * lowmem reserves and high watermark so that kswapd
2502 * should be able to balance it without having to
2503 * write pages from its LRU list.
2505 * This may look like it could increase pressure on
2506 * lower zones by failing allocations in higher zones
2507 * before they are full. But the pages that do spill
2508 * over are limited as the lower zones are protected
2509 * by this very same mechanism. It should not become
2510 * a practical burden to them.
2512 * XXX: For now, allow allocations to potentially
2513 * exceed the per-zone dirty limit in the slowpath
2514 * (ALLOC_WMARK_LOW unset) before going into reclaim,
2515 * which is important when on a NUMA setup the allowed
2516 * zones are together not big enough to reach the
2517 * global limit. The proper fix for these situations
2518 * will require awareness of zones in the
2519 * dirty-throttling and the flusher threads.
2521 if (consider_zone_dirty
&& !zone_dirty_ok(zone
))
2524 mark
= zone
->watermark
[alloc_flags
& ALLOC_WMARK_MASK
];
2525 if (!zone_watermark_ok(zone
, order
, mark
,
2526 ac
->classzone_idx
, alloc_flags
)) {
2529 /* Checked here to keep the fast path fast */
2530 BUILD_BUG_ON(ALLOC_NO_WATERMARKS
< NR_WMARK
);
2531 if (alloc_flags
& ALLOC_NO_WATERMARKS
)
2534 if (IS_ENABLED(CONFIG_NUMA
) &&
2535 !did_zlc_setup
&& nr_online_nodes
> 1) {
2537 * we do zlc_setup if there are multiple nodes
2538 * and before considering the first zone allowed
2541 allowednodes
= zlc_setup(zonelist
, alloc_flags
);
2546 if (zone_reclaim_mode
== 0 ||
2547 !zone_allows_reclaim(ac
->preferred_zone
, zone
))
2548 goto this_zone_full
;
2551 * As we may have just activated ZLC, check if the first
2552 * eligible zone has failed zone_reclaim recently.
2554 if (IS_ENABLED(CONFIG_NUMA
) && zlc_active
&&
2555 !zlc_zone_worth_trying(zonelist
, z
, allowednodes
))
2558 ret
= zone_reclaim(zone
, gfp_mask
, order
);
2560 case ZONE_RECLAIM_NOSCAN
:
2563 case ZONE_RECLAIM_FULL
:
2564 /* scanned but unreclaimable */
2567 /* did we reclaim enough */
2568 if (zone_watermark_ok(zone
, order
, mark
,
2569 ac
->classzone_idx
, alloc_flags
))
2573 * Failed to reclaim enough to meet watermark.
2574 * Only mark the zone full if checking the min
2575 * watermark or if we failed to reclaim just
2576 * 1<<order pages or else the page allocator
2577 * fastpath will prematurely mark zones full
2578 * when the watermark is between the low and
2581 if (((alloc_flags
& ALLOC_WMARK_MASK
) == ALLOC_WMARK_MIN
) ||
2582 ret
== ZONE_RECLAIM_SOME
)
2583 goto this_zone_full
;
2590 page
= buffered_rmqueue(ac
->preferred_zone
, zone
, order
,
2591 gfp_mask
, ac
->migratetype
);
2593 if (prep_new_page(page
, order
, gfp_mask
, alloc_flags
))
2598 if (IS_ENABLED(CONFIG_NUMA
) && zlc_active
)
2599 zlc_mark_zone_full(zonelist
, z
);
2603 * The first pass makes sure allocations are spread fairly within the
2604 * local node. However, the local node might have free pages left
2605 * after the fairness batches are exhausted, and remote zones haven't
2606 * even been considered yet. Try once more without fairness, and
2607 * include remote zones now, before entering the slowpath and waking
2608 * kswapd: prefer spilling to a remote zone over swapping locally.
2610 if (alloc_flags
& ALLOC_FAIR
) {
2611 alloc_flags
&= ~ALLOC_FAIR
;
2612 if (nr_fair_skipped
) {
2613 zonelist_rescan
= true;
2614 reset_alloc_batches(ac
->preferred_zone
);
2616 if (nr_online_nodes
> 1)
2617 zonelist_rescan
= true;
2620 if (unlikely(IS_ENABLED(CONFIG_NUMA
) && zlc_active
)) {
2621 /* Disable zlc cache for second zonelist scan */
2623 zonelist_rescan
= true;
2626 if (zonelist_rescan
)
2633 * Large machines with many possible nodes should not always dump per-node
2634 * meminfo in irq context.
2636 static inline bool should_suppress_show_mem(void)
2641 ret
= in_interrupt();
2646 static DEFINE_RATELIMIT_STATE(nopage_rs
,
2647 DEFAULT_RATELIMIT_INTERVAL
,
2648 DEFAULT_RATELIMIT_BURST
);
2650 void warn_alloc_failed(gfp_t gfp_mask
, int order
, const char *fmt
, ...)
2652 unsigned int filter
= SHOW_MEM_FILTER_NODES
;
2654 if ((gfp_mask
& __GFP_NOWARN
) || !__ratelimit(&nopage_rs
) ||
2655 debug_guardpage_minorder() > 0)
2659 * This documents exceptions given to allocations in certain
2660 * contexts that are allowed to allocate outside current's set
2663 if (!(gfp_mask
& __GFP_NOMEMALLOC
))
2664 if (test_thread_flag(TIF_MEMDIE
) ||
2665 (current
->flags
& (PF_MEMALLOC
| PF_EXITING
)))
2666 filter
&= ~SHOW_MEM_FILTER_NODES
;
2667 if (in_interrupt() || !(gfp_mask
& __GFP_WAIT
))
2668 filter
&= ~SHOW_MEM_FILTER_NODES
;
2671 struct va_format vaf
;
2674 va_start(args
, fmt
);
2679 pr_warn("%pV", &vaf
);
2684 pr_warn("%s: page allocation failure: order:%d, mode:0x%x\n",
2685 current
->comm
, order
, gfp_mask
);
2688 if (!should_suppress_show_mem())
2692 static inline struct page
*
2693 __alloc_pages_may_oom(gfp_t gfp_mask
, unsigned int order
,
2694 const struct alloc_context
*ac
, unsigned long *did_some_progress
)
2696 struct oom_control oc
= {
2697 .zonelist
= ac
->zonelist
,
2698 .nodemask
= ac
->nodemask
,
2699 .gfp_mask
= gfp_mask
,
2704 *did_some_progress
= 0;
2707 * Acquire the oom lock. If that fails, somebody else is
2708 * making progress for us.
2710 if (!mutex_trylock(&oom_lock
)) {
2711 *did_some_progress
= 1;
2712 schedule_timeout_uninterruptible(1);
2717 * Go through the zonelist yet one more time, keep very high watermark
2718 * here, this is only to catch a parallel oom killing, we must fail if
2719 * we're still under heavy pressure.
2721 page
= get_page_from_freelist(gfp_mask
| __GFP_HARDWALL
, order
,
2722 ALLOC_WMARK_HIGH
|ALLOC_CPUSET
, ac
);
2726 if (!(gfp_mask
& __GFP_NOFAIL
)) {
2727 /* Coredumps can quickly deplete all memory reserves */
2728 if (current
->flags
& PF_DUMPCORE
)
2730 /* The OOM killer will not help higher order allocs */
2731 if (order
> PAGE_ALLOC_COSTLY_ORDER
)
2733 /* The OOM killer does not needlessly kill tasks for lowmem */
2734 if (ac
->high_zoneidx
< ZONE_NORMAL
)
2736 /* The OOM killer does not compensate for IO-less reclaim */
2737 if (!(gfp_mask
& __GFP_FS
)) {
2739 * XXX: Page reclaim didn't yield anything,
2740 * and the OOM killer can't be invoked, but
2741 * keep looping as per tradition.
2743 *did_some_progress
= 1;
2746 if (pm_suspended_storage())
2748 /* The OOM killer may not free memory on a specific node */
2749 if (gfp_mask
& __GFP_THISNODE
)
2752 /* Exhausted what can be done so it's blamo time */
2753 if (out_of_memory(&oc
) || WARN_ON_ONCE(gfp_mask
& __GFP_NOFAIL
))
2754 *did_some_progress
= 1;
2756 mutex_unlock(&oom_lock
);
2760 #ifdef CONFIG_COMPACTION
2761 /* Try memory compaction for high-order allocations before reclaim */
2762 static struct page
*
2763 __alloc_pages_direct_compact(gfp_t gfp_mask
, unsigned int order
,
2764 int alloc_flags
, const struct alloc_context
*ac
,
2765 enum migrate_mode mode
, int *contended_compaction
,
2766 bool *deferred_compaction
)
2768 unsigned long compact_result
;
2774 current
->flags
|= PF_MEMALLOC
;
2775 compact_result
= try_to_compact_pages(gfp_mask
, order
, alloc_flags
, ac
,
2776 mode
, contended_compaction
);
2777 current
->flags
&= ~PF_MEMALLOC
;
2779 switch (compact_result
) {
2780 case COMPACT_DEFERRED
:
2781 *deferred_compaction
= true;
2783 case COMPACT_SKIPPED
:
2790 * At least in one zone compaction wasn't deferred or skipped, so let's
2791 * count a compaction stall
2793 count_vm_event(COMPACTSTALL
);
2795 page
= get_page_from_freelist(gfp_mask
, order
,
2796 alloc_flags
& ~ALLOC_NO_WATERMARKS
, ac
);
2799 struct zone
*zone
= page_zone(page
);
2801 zone
->compact_blockskip_flush
= false;
2802 compaction_defer_reset(zone
, order
, true);
2803 count_vm_event(COMPACTSUCCESS
);
2808 * It's bad if compaction run occurs and fails. The most likely reason
2809 * is that pages exist, but not enough to satisfy watermarks.
2811 count_vm_event(COMPACTFAIL
);
2818 static inline struct page
*
2819 __alloc_pages_direct_compact(gfp_t gfp_mask
, unsigned int order
,
2820 int alloc_flags
, const struct alloc_context
*ac
,
2821 enum migrate_mode mode
, int *contended_compaction
,
2822 bool *deferred_compaction
)
2826 #endif /* CONFIG_COMPACTION */
2828 /* Perform direct synchronous page reclaim */
2830 __perform_reclaim(gfp_t gfp_mask
, unsigned int order
,
2831 const struct alloc_context
*ac
)
2833 struct reclaim_state reclaim_state
;
2838 /* We now go into synchronous reclaim */
2839 cpuset_memory_pressure_bump();
2840 current
->flags
|= PF_MEMALLOC
;
2841 lockdep_set_current_reclaim_state(gfp_mask
);
2842 reclaim_state
.reclaimed_slab
= 0;
2843 current
->reclaim_state
= &reclaim_state
;
2845 progress
= try_to_free_pages(ac
->zonelist
, order
, gfp_mask
,
2848 current
->reclaim_state
= NULL
;
2849 lockdep_clear_current_reclaim_state();
2850 current
->flags
&= ~PF_MEMALLOC
;
2857 /* The really slow allocator path where we enter direct reclaim */
2858 static inline struct page
*
2859 __alloc_pages_direct_reclaim(gfp_t gfp_mask
, unsigned int order
,
2860 int alloc_flags
, const struct alloc_context
*ac
,
2861 unsigned long *did_some_progress
)
2863 struct page
*page
= NULL
;
2864 bool drained
= false;
2866 *did_some_progress
= __perform_reclaim(gfp_mask
, order
, ac
);
2867 if (unlikely(!(*did_some_progress
)))
2870 /* After successful reclaim, reconsider all zones for allocation */
2871 if (IS_ENABLED(CONFIG_NUMA
))
2872 zlc_clear_zones_full(ac
->zonelist
);
2875 page
= get_page_from_freelist(gfp_mask
, order
,
2876 alloc_flags
& ~ALLOC_NO_WATERMARKS
, ac
);
2879 * If an allocation failed after direct reclaim, it could be because
2880 * pages are pinned on the per-cpu lists. Drain them and try again
2882 if (!page
&& !drained
) {
2883 drain_all_pages(NULL
);
2892 * This is called in the allocator slow-path if the allocation request is of
2893 * sufficient urgency to ignore watermarks and take other desperate measures
2895 static inline struct page
*
2896 __alloc_pages_high_priority(gfp_t gfp_mask
, unsigned int order
,
2897 const struct alloc_context
*ac
)
2902 page
= get_page_from_freelist(gfp_mask
, order
,
2903 ALLOC_NO_WATERMARKS
, ac
);
2905 if (!page
&& gfp_mask
& __GFP_NOFAIL
)
2906 wait_iff_congested(ac
->preferred_zone
, BLK_RW_ASYNC
,
2908 } while (!page
&& (gfp_mask
& __GFP_NOFAIL
));
2913 static void wake_all_kswapds(unsigned int order
, const struct alloc_context
*ac
)
2918 for_each_zone_zonelist_nodemask(zone
, z
, ac
->zonelist
,
2919 ac
->high_zoneidx
, ac
->nodemask
)
2920 wakeup_kswapd(zone
, order
, zone_idx(ac
->preferred_zone
));
2924 gfp_to_alloc_flags(gfp_t gfp_mask
)
2926 int alloc_flags
= ALLOC_WMARK_MIN
| ALLOC_CPUSET
;
2927 const bool atomic
= !(gfp_mask
& (__GFP_WAIT
| __GFP_NO_KSWAPD
));
2929 /* __GFP_HIGH is assumed to be the same as ALLOC_HIGH to save a branch. */
2930 BUILD_BUG_ON(__GFP_HIGH
!= (__force gfp_t
) ALLOC_HIGH
);
2933 * The caller may dip into page reserves a bit more if the caller
2934 * cannot run direct reclaim, or if the caller has realtime scheduling
2935 * policy or is asking for __GFP_HIGH memory. GFP_ATOMIC requests will
2936 * set both ALLOC_HARDER (atomic == true) and ALLOC_HIGH (__GFP_HIGH).
2938 alloc_flags
|= (__force
int) (gfp_mask
& __GFP_HIGH
);
2942 * Not worth trying to allocate harder for __GFP_NOMEMALLOC even
2943 * if it can't schedule.
2945 if (!(gfp_mask
& __GFP_NOMEMALLOC
))
2946 alloc_flags
|= ALLOC_HARDER
;
2948 * Ignore cpuset mems for GFP_ATOMIC rather than fail, see the
2949 * comment for __cpuset_node_allowed().
2951 alloc_flags
&= ~ALLOC_CPUSET
;
2952 } else if (unlikely(rt_task(current
)) && !in_interrupt())
2953 alloc_flags
|= ALLOC_HARDER
;
2955 if (likely(!(gfp_mask
& __GFP_NOMEMALLOC
))) {
2956 if (gfp_mask
& __GFP_MEMALLOC
)
2957 alloc_flags
|= ALLOC_NO_WATERMARKS
;
2958 else if (in_serving_softirq() && (current
->flags
& PF_MEMALLOC
))
2959 alloc_flags
|= ALLOC_NO_WATERMARKS
;
2960 else if (!in_interrupt() &&
2961 ((current
->flags
& PF_MEMALLOC
) ||
2962 unlikely(test_thread_flag(TIF_MEMDIE
))))
2963 alloc_flags
|= ALLOC_NO_WATERMARKS
;
2966 if (gfpflags_to_migratetype(gfp_mask
) == MIGRATE_MOVABLE
)
2967 alloc_flags
|= ALLOC_CMA
;
2972 bool gfp_pfmemalloc_allowed(gfp_t gfp_mask
)
2974 return !!(gfp_to_alloc_flags(gfp_mask
) & ALLOC_NO_WATERMARKS
);
2977 static inline struct page
*
2978 __alloc_pages_slowpath(gfp_t gfp_mask
, unsigned int order
,
2979 struct alloc_context
*ac
)
2981 const gfp_t wait
= gfp_mask
& __GFP_WAIT
;
2982 struct page
*page
= NULL
;
2984 unsigned long pages_reclaimed
= 0;
2985 unsigned long did_some_progress
;
2986 enum migrate_mode migration_mode
= MIGRATE_ASYNC
;
2987 bool deferred_compaction
= false;
2988 int contended_compaction
= COMPACT_CONTENDED_NONE
;
2991 * In the slowpath, we sanity check order to avoid ever trying to
2992 * reclaim >= MAX_ORDER areas which will never succeed. Callers may
2993 * be using allocators in order of preference for an area that is
2996 if (order
>= MAX_ORDER
) {
2997 WARN_ON_ONCE(!(gfp_mask
& __GFP_NOWARN
));
3002 * If this allocation cannot block and it is for a specific node, then
3003 * fail early. There's no need to wakeup kswapd or retry for a
3004 * speculative node-specific allocation.
3006 if (IS_ENABLED(CONFIG_NUMA
) && (gfp_mask
& __GFP_THISNODE
) && !wait
)
3010 if (!(gfp_mask
& __GFP_NO_KSWAPD
))
3011 wake_all_kswapds(order
, ac
);
3014 * OK, we're below the kswapd watermark and have kicked background
3015 * reclaim. Now things get more complex, so set up alloc_flags according
3016 * to how we want to proceed.
3018 alloc_flags
= gfp_to_alloc_flags(gfp_mask
);
3021 * Find the true preferred zone if the allocation is unconstrained by
3024 if (!(alloc_flags
& ALLOC_CPUSET
) && !ac
->nodemask
) {
3025 struct zoneref
*preferred_zoneref
;
3026 preferred_zoneref
= first_zones_zonelist(ac
->zonelist
,
3027 ac
->high_zoneidx
, NULL
, &ac
->preferred_zone
);
3028 ac
->classzone_idx
= zonelist_zone_idx(preferred_zoneref
);
3031 /* This is the last chance, in general, before the goto nopage. */
3032 page
= get_page_from_freelist(gfp_mask
, order
,
3033 alloc_flags
& ~ALLOC_NO_WATERMARKS
, ac
);
3037 /* Allocate without watermarks if the context allows */
3038 if (alloc_flags
& ALLOC_NO_WATERMARKS
) {
3040 * Ignore mempolicies if ALLOC_NO_WATERMARKS on the grounds
3041 * the allocation is high priority and these type of
3042 * allocations are system rather than user orientated
3044 ac
->zonelist
= node_zonelist(numa_node_id(), gfp_mask
);
3046 page
= __alloc_pages_high_priority(gfp_mask
, order
, ac
);
3053 /* Atomic allocations - we can't balance anything */
3056 * All existing users of the deprecated __GFP_NOFAIL are
3057 * blockable, so warn of any new users that actually allow this
3058 * type of allocation to fail.
3060 WARN_ON_ONCE(gfp_mask
& __GFP_NOFAIL
);
3064 /* Avoid recursion of direct reclaim */
3065 if (current
->flags
& PF_MEMALLOC
)
3068 /* Avoid allocations with no watermarks from looping endlessly */
3069 if (test_thread_flag(TIF_MEMDIE
) && !(gfp_mask
& __GFP_NOFAIL
))
3073 * Try direct compaction. The first pass is asynchronous. Subsequent
3074 * attempts after direct reclaim are synchronous
3076 page
= __alloc_pages_direct_compact(gfp_mask
, order
, alloc_flags
, ac
,
3078 &contended_compaction
,
3079 &deferred_compaction
);
3083 /* Checks for THP-specific high-order allocations */
3084 if ((gfp_mask
& GFP_TRANSHUGE
) == GFP_TRANSHUGE
) {
3086 * If compaction is deferred for high-order allocations, it is
3087 * because sync compaction recently failed. If this is the case
3088 * and the caller requested a THP allocation, we do not want
3089 * to heavily disrupt the system, so we fail the allocation
3090 * instead of entering direct reclaim.
3092 if (deferred_compaction
)
3096 * In all zones where compaction was attempted (and not
3097 * deferred or skipped), lock contention has been detected.
3098 * For THP allocation we do not want to disrupt the others
3099 * so we fallback to base pages instead.
3101 if (contended_compaction
== COMPACT_CONTENDED_LOCK
)
3105 * If compaction was aborted due to need_resched(), we do not
3106 * want to further increase allocation latency, unless it is
3107 * khugepaged trying to collapse.
3109 if (contended_compaction
== COMPACT_CONTENDED_SCHED
3110 && !(current
->flags
& PF_KTHREAD
))
3115 * It can become very expensive to allocate transparent hugepages at
3116 * fault, so use asynchronous memory compaction for THP unless it is
3117 * khugepaged trying to collapse.
3119 if ((gfp_mask
& GFP_TRANSHUGE
) != GFP_TRANSHUGE
||
3120 (current
->flags
& PF_KTHREAD
))
3121 migration_mode
= MIGRATE_SYNC_LIGHT
;
3123 /* Try direct reclaim and then allocating */
3124 page
= __alloc_pages_direct_reclaim(gfp_mask
, order
, alloc_flags
, ac
,
3125 &did_some_progress
);
3129 /* Do not loop if specifically requested */
3130 if (gfp_mask
& __GFP_NORETRY
)
3133 /* Keep reclaiming pages as long as there is reasonable progress */
3134 pages_reclaimed
+= did_some_progress
;
3135 if ((did_some_progress
&& order
<= PAGE_ALLOC_COSTLY_ORDER
) ||
3136 ((gfp_mask
& __GFP_REPEAT
) && pages_reclaimed
< (1 << order
))) {
3137 /* Wait for some write requests to complete then retry */
3138 wait_iff_congested(ac
->preferred_zone
, BLK_RW_ASYNC
, HZ
/50);
3142 /* Reclaim has failed us, start killing things */
3143 page
= __alloc_pages_may_oom(gfp_mask
, order
, ac
, &did_some_progress
);
3147 /* Retry as long as the OOM killer is making progress */
3148 if (did_some_progress
)
3153 * High-order allocations do not necessarily loop after
3154 * direct reclaim and reclaim/compaction depends on compaction
3155 * being called after reclaim so call directly if necessary
3157 page
= __alloc_pages_direct_compact(gfp_mask
, order
, alloc_flags
,
3159 &contended_compaction
,
3160 &deferred_compaction
);
3164 warn_alloc_failed(gfp_mask
, order
, NULL
);
3170 * This is the 'heart' of the zoned buddy allocator.
3173 __alloc_pages_nodemask(gfp_t gfp_mask
, unsigned int order
,
3174 struct zonelist
*zonelist
, nodemask_t
*nodemask
)
3176 struct zoneref
*preferred_zoneref
;
3177 struct page
*page
= NULL
;
3178 unsigned int cpuset_mems_cookie
;
3179 int alloc_flags
= ALLOC_WMARK_LOW
|ALLOC_CPUSET
|ALLOC_FAIR
;
3180 gfp_t alloc_mask
; /* The gfp_t that was actually used for allocation */
3181 struct alloc_context ac
= {
3182 .high_zoneidx
= gfp_zone(gfp_mask
),
3183 .nodemask
= nodemask
,
3184 .migratetype
= gfpflags_to_migratetype(gfp_mask
),
3187 gfp_mask
&= gfp_allowed_mask
;
3189 lockdep_trace_alloc(gfp_mask
);
3191 might_sleep_if(gfp_mask
& __GFP_WAIT
);
3193 if (should_fail_alloc_page(gfp_mask
, order
))
3197 * Check the zones suitable for the gfp_mask contain at least one
3198 * valid zone. It's possible to have an empty zonelist as a result
3199 * of __GFP_THISNODE and a memoryless node
3201 if (unlikely(!zonelist
->_zonerefs
->zone
))
3204 if (IS_ENABLED(CONFIG_CMA
) && ac
.migratetype
== MIGRATE_MOVABLE
)
3205 alloc_flags
|= ALLOC_CMA
;
3208 cpuset_mems_cookie
= read_mems_allowed_begin();
3210 /* We set it here, as __alloc_pages_slowpath might have changed it */
3211 ac
.zonelist
= zonelist
;
3212 /* The preferred zone is used for statistics later */
3213 preferred_zoneref
= first_zones_zonelist(ac
.zonelist
, ac
.high_zoneidx
,
3214 ac
.nodemask
? : &cpuset_current_mems_allowed
,
3215 &ac
.preferred_zone
);
3216 if (!ac
.preferred_zone
)
3218 ac
.classzone_idx
= zonelist_zone_idx(preferred_zoneref
);
3220 /* First allocation attempt */
3221 alloc_mask
= gfp_mask
|__GFP_HARDWALL
;
3222 page
= get_page_from_freelist(alloc_mask
, order
, alloc_flags
, &ac
);
3223 if (unlikely(!page
)) {
3225 * Runtime PM, block IO and its error handling path
3226 * can deadlock because I/O on the device might not
3229 alloc_mask
= memalloc_noio_flags(gfp_mask
);
3231 page
= __alloc_pages_slowpath(alloc_mask
, order
, &ac
);
3234 if (kmemcheck_enabled
&& page
)
3235 kmemcheck_pagealloc_alloc(page
, order
, gfp_mask
);
3237 trace_mm_page_alloc(page
, order
, alloc_mask
, ac
.migratetype
);
3241 * When updating a task's mems_allowed, it is possible to race with
3242 * parallel threads in such a way that an allocation can fail while
3243 * the mask is being updated. If a page allocation is about to fail,
3244 * check if the cpuset changed during allocation and if so, retry.
3246 if (unlikely(!page
&& read_mems_allowed_retry(cpuset_mems_cookie
)))
3251 EXPORT_SYMBOL(__alloc_pages_nodemask
);
3254 * Common helper functions.
3256 unsigned long __get_free_pages(gfp_t gfp_mask
, unsigned int order
)
3261 * __get_free_pages() returns a 32-bit address, which cannot represent
3264 VM_BUG_ON((gfp_mask
& __GFP_HIGHMEM
) != 0);
3266 page
= alloc_pages(gfp_mask
, order
);
3269 return (unsigned long) page_address(page
);
3271 EXPORT_SYMBOL(__get_free_pages
);
3273 unsigned long get_zeroed_page(gfp_t gfp_mask
)
3275 return __get_free_pages(gfp_mask
| __GFP_ZERO
, 0);
3277 EXPORT_SYMBOL(get_zeroed_page
);
3279 void __free_pages(struct page
*page
, unsigned int order
)
3281 if (put_page_testzero(page
)) {
3283 free_hot_cold_page(page
, false);
3285 __free_pages_ok(page
, order
);
3289 EXPORT_SYMBOL(__free_pages
);
3291 void free_pages(unsigned long addr
, unsigned int order
)
3294 VM_BUG_ON(!virt_addr_valid((void *)addr
));
3295 __free_pages(virt_to_page((void *)addr
), order
);
3299 EXPORT_SYMBOL(free_pages
);
3303 * An arbitrary-length arbitrary-offset area of memory which resides
3304 * within a 0 or higher order page. Multiple fragments within that page
3305 * are individually refcounted, in the page's reference counter.
3307 * The page_frag functions below provide a simple allocation framework for
3308 * page fragments. This is used by the network stack and network device
3309 * drivers to provide a backing region of memory for use as either an
3310 * sk_buff->head, or to be used in the "frags" portion of skb_shared_info.
3312 static struct page
*__page_frag_refill(struct page_frag_cache
*nc
,
3315 struct page
*page
= NULL
;
3316 gfp_t gfp
= gfp_mask
;
3318 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
3319 gfp_mask
|= __GFP_COMP
| __GFP_NOWARN
| __GFP_NORETRY
|
3321 page
= alloc_pages_node(NUMA_NO_NODE
, gfp_mask
,
3322 PAGE_FRAG_CACHE_MAX_ORDER
);
3323 nc
->size
= page
? PAGE_FRAG_CACHE_MAX_SIZE
: PAGE_SIZE
;
3325 if (unlikely(!page
))
3326 page
= alloc_pages_node(NUMA_NO_NODE
, gfp
, 0);
3328 nc
->va
= page
? page_address(page
) : NULL
;
3333 void *__alloc_page_frag(struct page_frag_cache
*nc
,
3334 unsigned int fragsz
, gfp_t gfp_mask
)
3336 unsigned int size
= PAGE_SIZE
;
3340 if (unlikely(!nc
->va
)) {
3342 page
= __page_frag_refill(nc
, gfp_mask
);
3346 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
3347 /* if size can vary use size else just use PAGE_SIZE */
3350 /* Even if we own the page, we do not use atomic_set().
3351 * This would break get_page_unless_zero() users.
3353 atomic_add(size
- 1, &page
->_count
);
3355 /* reset page count bias and offset to start of new frag */
3356 nc
->pfmemalloc
= page_is_pfmemalloc(page
);
3357 nc
->pagecnt_bias
= size
;
3361 offset
= nc
->offset
- fragsz
;
3362 if (unlikely(offset
< 0)) {
3363 page
= virt_to_page(nc
->va
);
3365 if (!atomic_sub_and_test(nc
->pagecnt_bias
, &page
->_count
))
3368 #if (PAGE_SIZE < PAGE_FRAG_CACHE_MAX_SIZE)
3369 /* if size can vary use size else just use PAGE_SIZE */
3372 /* OK, page count is 0, we can safely set it */
3373 atomic_set(&page
->_count
, size
);
3375 /* reset page count bias and offset to start of new frag */
3376 nc
->pagecnt_bias
= size
;
3377 offset
= size
- fragsz
;
3381 nc
->offset
= offset
;
3383 return nc
->va
+ offset
;
3385 EXPORT_SYMBOL(__alloc_page_frag
);
3388 * Frees a page fragment allocated out of either a compound or order 0 page.
3390 void __free_page_frag(void *addr
)
3392 struct page
*page
= virt_to_head_page(addr
);
3394 if (unlikely(put_page_testzero(page
)))
3395 __free_pages_ok(page
, compound_order(page
));
3397 EXPORT_SYMBOL(__free_page_frag
);
3400 * alloc_kmem_pages charges newly allocated pages to the kmem resource counter
3401 * of the current memory cgroup.
3403 * It should be used when the caller would like to use kmalloc, but since the
3404 * allocation is large, it has to fall back to the page allocator.
3406 struct page
*alloc_kmem_pages(gfp_t gfp_mask
, unsigned int order
)
3409 struct mem_cgroup
*memcg
= NULL
;
3411 if (!memcg_kmem_newpage_charge(gfp_mask
, &memcg
, order
))
3413 page
= alloc_pages(gfp_mask
, order
);
3414 memcg_kmem_commit_charge(page
, memcg
, order
);
3418 struct page
*alloc_kmem_pages_node(int nid
, gfp_t gfp_mask
, unsigned int order
)
3421 struct mem_cgroup
*memcg
= NULL
;
3423 if (!memcg_kmem_newpage_charge(gfp_mask
, &memcg
, order
))
3425 page
= alloc_pages_node(nid
, gfp_mask
, order
);
3426 memcg_kmem_commit_charge(page
, memcg
, order
);
3431 * __free_kmem_pages and free_kmem_pages will free pages allocated with
3434 void __free_kmem_pages(struct page
*page
, unsigned int order
)
3436 memcg_kmem_uncharge_pages(page
, order
);
3437 __free_pages(page
, order
);
3440 void free_kmem_pages(unsigned long addr
, unsigned int order
)
3443 VM_BUG_ON(!virt_addr_valid((void *)addr
));
3444 __free_kmem_pages(virt_to_page((void *)addr
), order
);
3448 static void *make_alloc_exact(unsigned long addr
, unsigned order
, size_t size
)
3451 unsigned long alloc_end
= addr
+ (PAGE_SIZE
<< order
);
3452 unsigned long used
= addr
+ PAGE_ALIGN(size
);
3454 split_page(virt_to_page((void *)addr
), order
);
3455 while (used
< alloc_end
) {
3460 return (void *)addr
;
3464 * alloc_pages_exact - allocate an exact number physically-contiguous pages.
3465 * @size: the number of bytes to allocate
3466 * @gfp_mask: GFP flags for the allocation
3468 * This function is similar to alloc_pages(), except that it allocates the
3469 * minimum number of pages to satisfy the request. alloc_pages() can only
3470 * allocate memory in power-of-two pages.
3472 * This function is also limited by MAX_ORDER.
3474 * Memory allocated by this function must be released by free_pages_exact().
3476 void *alloc_pages_exact(size_t size
, gfp_t gfp_mask
)
3478 unsigned int order
= get_order(size
);
3481 addr
= __get_free_pages(gfp_mask
, order
);
3482 return make_alloc_exact(addr
, order
, size
);
3484 EXPORT_SYMBOL(alloc_pages_exact
);
3487 * alloc_pages_exact_nid - allocate an exact number of physically-contiguous
3489 * @nid: the preferred node ID where memory should be allocated
3490 * @size: the number of bytes to allocate
3491 * @gfp_mask: GFP flags for the allocation
3493 * Like alloc_pages_exact(), but try to allocate on node nid first before falling
3495 * Note this is not alloc_pages_exact_node() which allocates on a specific node,
3498 void * __meminit
alloc_pages_exact_nid(int nid
, size_t size
, gfp_t gfp_mask
)
3500 unsigned order
= get_order(size
);
3501 struct page
*p
= alloc_pages_node(nid
, gfp_mask
, order
);
3504 return make_alloc_exact((unsigned long)page_address(p
), order
, size
);
3508 * free_pages_exact - release memory allocated via alloc_pages_exact()
3509 * @virt: the value returned by alloc_pages_exact.
3510 * @size: size of allocation, same value as passed to alloc_pages_exact().
3512 * Release the memory allocated by a previous call to alloc_pages_exact.
3514 void free_pages_exact(void *virt
, size_t size
)
3516 unsigned long addr
= (unsigned long)virt
;
3517 unsigned long end
= addr
+ PAGE_ALIGN(size
);
3519 while (addr
< end
) {
3524 EXPORT_SYMBOL(free_pages_exact
);
3527 * nr_free_zone_pages - count number of pages beyond high watermark
3528 * @offset: The zone index of the highest zone
3530 * nr_free_zone_pages() counts the number of counts pages which are beyond the
3531 * high watermark within all zones at or below a given zone index. For each
3532 * zone, the number of pages is calculated as:
3533 * managed_pages - high_pages
3535 static unsigned long nr_free_zone_pages(int offset
)
3540 /* Just pick one node, since fallback list is circular */
3541 unsigned long sum
= 0;
3543 struct zonelist
*zonelist
= node_zonelist(numa_node_id(), GFP_KERNEL
);
3545 for_each_zone_zonelist(zone
, z
, zonelist
, offset
) {
3546 unsigned long size
= zone
->managed_pages
;
3547 unsigned long high
= high_wmark_pages(zone
);
3556 * nr_free_buffer_pages - count number of pages beyond high watermark
3558 * nr_free_buffer_pages() counts the number of pages which are beyond the high
3559 * watermark within ZONE_DMA and ZONE_NORMAL.
3561 unsigned long nr_free_buffer_pages(void)
3563 return nr_free_zone_pages(gfp_zone(GFP_USER
));
3565 EXPORT_SYMBOL_GPL(nr_free_buffer_pages
);
3568 * nr_free_pagecache_pages - count number of pages beyond high watermark
3570 * nr_free_pagecache_pages() counts the number of pages which are beyond the
3571 * high watermark within all zones.
3573 unsigned long nr_free_pagecache_pages(void)
3575 return nr_free_zone_pages(gfp_zone(GFP_HIGHUSER_MOVABLE
));
3578 static inline void show_node(struct zone
*zone
)
3580 if (IS_ENABLED(CONFIG_NUMA
))
3581 printk("Node %d ", zone_to_nid(zone
));
3584 void si_meminfo(struct sysinfo
*val
)
3586 val
->totalram
= totalram_pages
;
3587 val
->sharedram
= global_page_state(NR_SHMEM
);
3588 val
->freeram
= global_page_state(NR_FREE_PAGES
);
3589 val
->bufferram
= nr_blockdev_pages();
3590 val
->totalhigh
= totalhigh_pages
;
3591 val
->freehigh
= nr_free_highpages();
3592 val
->mem_unit
= PAGE_SIZE
;
3595 EXPORT_SYMBOL(si_meminfo
);
3598 void si_meminfo_node(struct sysinfo
*val
, int nid
)
3600 int zone_type
; /* needs to be signed */
3601 unsigned long managed_pages
= 0;
3602 pg_data_t
*pgdat
= NODE_DATA(nid
);
3604 for (zone_type
= 0; zone_type
< MAX_NR_ZONES
; zone_type
++)
3605 managed_pages
+= pgdat
->node_zones
[zone_type
].managed_pages
;
3606 val
->totalram
= managed_pages
;
3607 val
->sharedram
= node_page_state(nid
, NR_SHMEM
);
3608 val
->freeram
= node_page_state(nid
, NR_FREE_PAGES
);
3609 #ifdef CONFIG_HIGHMEM
3610 val
->totalhigh
= pgdat
->node_zones
[ZONE_HIGHMEM
].managed_pages
;
3611 val
->freehigh
= zone_page_state(&pgdat
->node_zones
[ZONE_HIGHMEM
],
3617 val
->mem_unit
= PAGE_SIZE
;
3622 * Determine whether the node should be displayed or not, depending on whether
3623 * SHOW_MEM_FILTER_NODES was passed to show_free_areas().
3625 bool skip_free_areas_node(unsigned int flags
, int nid
)
3628 unsigned int cpuset_mems_cookie
;
3630 if (!(flags
& SHOW_MEM_FILTER_NODES
))
3634 cpuset_mems_cookie
= read_mems_allowed_begin();
3635 ret
= !node_isset(nid
, cpuset_current_mems_allowed
);
3636 } while (read_mems_allowed_retry(cpuset_mems_cookie
));
3641 #define K(x) ((x) << (PAGE_SHIFT-10))
3643 static void show_migration_types(unsigned char type
)
3645 static const char types
[MIGRATE_TYPES
] = {
3646 [MIGRATE_UNMOVABLE
] = 'U',
3647 [MIGRATE_RECLAIMABLE
] = 'E',
3648 [MIGRATE_MOVABLE
] = 'M',
3649 [MIGRATE_RESERVE
] = 'R',
3651 [MIGRATE_CMA
] = 'C',
3653 #ifdef CONFIG_MEMORY_ISOLATION
3654 [MIGRATE_ISOLATE
] = 'I',
3657 char tmp
[MIGRATE_TYPES
+ 1];
3661 for (i
= 0; i
< MIGRATE_TYPES
; i
++) {
3662 if (type
& (1 << i
))
3667 printk("(%s) ", tmp
);
3671 * Show free area list (used inside shift_scroll-lock stuff)
3672 * We also calculate the percentage fragmentation. We do this by counting the
3673 * memory on each free list with the exception of the first item on the list.
3676 * SHOW_MEM_FILTER_NODES: suppress nodes that are not allowed by current's
3679 void show_free_areas(unsigned int filter
)
3681 unsigned long free_pcp
= 0;
3685 for_each_populated_zone(zone
) {
3686 if (skip_free_areas_node(filter
, zone_to_nid(zone
)))
3689 for_each_online_cpu(cpu
)
3690 free_pcp
+= per_cpu_ptr(zone
->pageset
, cpu
)->pcp
.count
;
3693 printk("active_anon:%lu inactive_anon:%lu isolated_anon:%lu\n"
3694 " active_file:%lu inactive_file:%lu isolated_file:%lu\n"
3695 " unevictable:%lu dirty:%lu writeback:%lu unstable:%lu\n"
3696 " slab_reclaimable:%lu slab_unreclaimable:%lu\n"
3697 " mapped:%lu shmem:%lu pagetables:%lu bounce:%lu\n"
3698 " free:%lu free_pcp:%lu free_cma:%lu\n",
3699 global_page_state(NR_ACTIVE_ANON
),
3700 global_page_state(NR_INACTIVE_ANON
),
3701 global_page_state(NR_ISOLATED_ANON
),
3702 global_page_state(NR_ACTIVE_FILE
),
3703 global_page_state(NR_INACTIVE_FILE
),
3704 global_page_state(NR_ISOLATED_FILE
),
3705 global_page_state(NR_UNEVICTABLE
),
3706 global_page_state(NR_FILE_DIRTY
),
3707 global_page_state(NR_WRITEBACK
),
3708 global_page_state(NR_UNSTABLE_NFS
),
3709 global_page_state(NR_SLAB_RECLAIMABLE
),
3710 global_page_state(NR_SLAB_UNRECLAIMABLE
),
3711 global_page_state(NR_FILE_MAPPED
),
3712 global_page_state(NR_SHMEM
),
3713 global_page_state(NR_PAGETABLE
),
3714 global_page_state(NR_BOUNCE
),
3715 global_page_state(NR_FREE_PAGES
),
3717 global_page_state(NR_FREE_CMA_PAGES
));
3719 for_each_populated_zone(zone
) {
3722 if (skip_free_areas_node(filter
, zone_to_nid(zone
)))
3726 for_each_online_cpu(cpu
)
3727 free_pcp
+= per_cpu_ptr(zone
->pageset
, cpu
)->pcp
.count
;
3735 " active_anon:%lukB"
3736 " inactive_anon:%lukB"
3737 " active_file:%lukB"
3738 " inactive_file:%lukB"
3739 " unevictable:%lukB"
3740 " isolated(anon):%lukB"
3741 " isolated(file):%lukB"
3749 " slab_reclaimable:%lukB"
3750 " slab_unreclaimable:%lukB"
3751 " kernel_stack:%lukB"
3758 " writeback_tmp:%lukB"
3759 " pages_scanned:%lu"
3760 " all_unreclaimable? %s"
3763 K(zone_page_state(zone
, NR_FREE_PAGES
)),
3764 K(min_wmark_pages(zone
)),
3765 K(low_wmark_pages(zone
)),
3766 K(high_wmark_pages(zone
)),
3767 K(zone_page_state(zone
, NR_ACTIVE_ANON
)),
3768 K(zone_page_state(zone
, NR_INACTIVE_ANON
)),
3769 K(zone_page_state(zone
, NR_ACTIVE_FILE
)),
3770 K(zone_page_state(zone
, NR_INACTIVE_FILE
)),
3771 K(zone_page_state(zone
, NR_UNEVICTABLE
)),
3772 K(zone_page_state(zone
, NR_ISOLATED_ANON
)),
3773 K(zone_page_state(zone
, NR_ISOLATED_FILE
)),
3774 K(zone
->present_pages
),
3775 K(zone
->managed_pages
),
3776 K(zone_page_state(zone
, NR_MLOCK
)),
3777 K(zone_page_state(zone
, NR_FILE_DIRTY
)),
3778 K(zone_page_state(zone
, NR_WRITEBACK
)),
3779 K(zone_page_state(zone
, NR_FILE_MAPPED
)),
3780 K(zone_page_state(zone
, NR_SHMEM
)),
3781 K(zone_page_state(zone
, NR_SLAB_RECLAIMABLE
)),
3782 K(zone_page_state(zone
, NR_SLAB_UNRECLAIMABLE
)),
3783 zone_page_state(zone
, NR_KERNEL_STACK
) *
3785 K(zone_page_state(zone
, NR_PAGETABLE
)),
3786 K(zone_page_state(zone
, NR_UNSTABLE_NFS
)),
3787 K(zone_page_state(zone
, NR_BOUNCE
)),
3789 K(this_cpu_read(zone
->pageset
->pcp
.count
)),
3790 K(zone_page_state(zone
, NR_FREE_CMA_PAGES
)),
3791 K(zone_page_state(zone
, NR_WRITEBACK_TEMP
)),
3792 K(zone_page_state(zone
, NR_PAGES_SCANNED
)),
3793 (!zone_reclaimable(zone
) ? "yes" : "no")
3795 printk("lowmem_reserve[]:");
3796 for (i
= 0; i
< MAX_NR_ZONES
; i
++)
3797 printk(" %ld", zone
->lowmem_reserve
[i
]);
3801 for_each_populated_zone(zone
) {
3802 unsigned long nr
[MAX_ORDER
], flags
, order
, total
= 0;
3803 unsigned char types
[MAX_ORDER
];
3805 if (skip_free_areas_node(filter
, zone_to_nid(zone
)))
3808 printk("%s: ", zone
->name
);
3810 spin_lock_irqsave(&zone
->lock
, flags
);
3811 for (order
= 0; order
< MAX_ORDER
; order
++) {
3812 struct free_area
*area
= &zone
->free_area
[order
];
3815 nr
[order
] = area
->nr_free
;
3816 total
+= nr
[order
] << order
;
3819 for (type
= 0; type
< MIGRATE_TYPES
; type
++) {
3820 if (!list_empty(&area
->free_list
[type
]))
3821 types
[order
] |= 1 << type
;
3824 spin_unlock_irqrestore(&zone
->lock
, flags
);
3825 for (order
= 0; order
< MAX_ORDER
; order
++) {
3826 printk("%lu*%lukB ", nr
[order
], K(1UL) << order
);
3828 show_migration_types(types
[order
]);
3830 printk("= %lukB\n", K(total
));
3833 hugetlb_show_meminfo();
3835 printk("%ld total pagecache pages\n", global_page_state(NR_FILE_PAGES
));
3837 show_swap_cache_info();
3840 static void zoneref_set_zone(struct zone
*zone
, struct zoneref
*zoneref
)
3842 zoneref
->zone
= zone
;
3843 zoneref
->zone_idx
= zone_idx(zone
);
3847 * Builds allocation fallback zone lists.
3849 * Add all populated zones of a node to the zonelist.
3851 static int build_zonelists_node(pg_data_t
*pgdat
, struct zonelist
*zonelist
,
3855 enum zone_type zone_type
= MAX_NR_ZONES
;
3859 zone
= pgdat
->node_zones
+ zone_type
;
3860 if (populated_zone(zone
)) {
3861 zoneref_set_zone(zone
,
3862 &zonelist
->_zonerefs
[nr_zones
++]);
3863 check_highest_zone(zone_type
);
3865 } while (zone_type
);
3873 * 0 = automatic detection of better ordering.
3874 * 1 = order by ([node] distance, -zonetype)
3875 * 2 = order by (-zonetype, [node] distance)
3877 * If not NUMA, ZONELIST_ORDER_ZONE and ZONELIST_ORDER_NODE will create
3878 * the same zonelist. So only NUMA can configure this param.
3880 #define ZONELIST_ORDER_DEFAULT 0
3881 #define ZONELIST_ORDER_NODE 1
3882 #define ZONELIST_ORDER_ZONE 2
3884 /* zonelist order in the kernel.
3885 * set_zonelist_order() will set this to NODE or ZONE.
3887 static int current_zonelist_order
= ZONELIST_ORDER_DEFAULT
;
3888 static char zonelist_order_name
[3][8] = {"Default", "Node", "Zone"};
3892 /* The value user specified ....changed by config */
3893 static int user_zonelist_order
= ZONELIST_ORDER_DEFAULT
;
3894 /* string for sysctl */
3895 #define NUMA_ZONELIST_ORDER_LEN 16
3896 char numa_zonelist_order
[16] = "default";
3899 * interface for configure zonelist ordering.
3900 * command line option "numa_zonelist_order"
3901 * = "[dD]efault - default, automatic configuration.
3902 * = "[nN]ode - order by node locality, then by zone within node
3903 * = "[zZ]one - order by zone, then by locality within zone
3906 static int __parse_numa_zonelist_order(char *s
)
3908 if (*s
== 'd' || *s
== 'D') {
3909 user_zonelist_order
= ZONELIST_ORDER_DEFAULT
;
3910 } else if (*s
== 'n' || *s
== 'N') {
3911 user_zonelist_order
= ZONELIST_ORDER_NODE
;
3912 } else if (*s
== 'z' || *s
== 'Z') {
3913 user_zonelist_order
= ZONELIST_ORDER_ZONE
;
3916 "Ignoring invalid numa_zonelist_order value: "
3923 static __init
int setup_numa_zonelist_order(char *s
)
3930 ret
= __parse_numa_zonelist_order(s
);
3932 strlcpy(numa_zonelist_order
, s
, NUMA_ZONELIST_ORDER_LEN
);
3936 early_param("numa_zonelist_order", setup_numa_zonelist_order
);
3939 * sysctl handler for numa_zonelist_order
3941 int numa_zonelist_order_handler(struct ctl_table
*table
, int write
,
3942 void __user
*buffer
, size_t *length
,
3945 char saved_string
[NUMA_ZONELIST_ORDER_LEN
];
3947 static DEFINE_MUTEX(zl_order_mutex
);
3949 mutex_lock(&zl_order_mutex
);
3951 if (strlen((char *)table
->data
) >= NUMA_ZONELIST_ORDER_LEN
) {
3955 strcpy(saved_string
, (char *)table
->data
);
3957 ret
= proc_dostring(table
, write
, buffer
, length
, ppos
);
3961 int oldval
= user_zonelist_order
;
3963 ret
= __parse_numa_zonelist_order((char *)table
->data
);
3966 * bogus value. restore saved string
3968 strncpy((char *)table
->data
, saved_string
,
3969 NUMA_ZONELIST_ORDER_LEN
);
3970 user_zonelist_order
= oldval
;
3971 } else if (oldval
!= user_zonelist_order
) {
3972 mutex_lock(&zonelists_mutex
);
3973 build_all_zonelists(NULL
, NULL
);
3974 mutex_unlock(&zonelists_mutex
);
3978 mutex_unlock(&zl_order_mutex
);
3983 #define MAX_NODE_LOAD (nr_online_nodes)
3984 static int node_load
[MAX_NUMNODES
];
3987 * find_next_best_node - find the next node that should appear in a given node's fallback list
3988 * @node: node whose fallback list we're appending
3989 * @used_node_mask: nodemask_t of already used nodes
3991 * We use a number of factors to determine which is the next node that should
3992 * appear on a given node's fallback list. The node should not have appeared
3993 * already in @node's fallback list, and it should be the next closest node
3994 * according to the distance array (which contains arbitrary distance values
3995 * from each node to each node in the system), and should also prefer nodes
3996 * with no CPUs, since presumably they'll have very little allocation pressure
3997 * on them otherwise.
3998 * It returns -1 if no node is found.
4000 static int find_next_best_node(int node
, nodemask_t
*used_node_mask
)
4003 int min_val
= INT_MAX
;
4004 int best_node
= NUMA_NO_NODE
;
4005 const struct cpumask
*tmp
= cpumask_of_node(0);
4007 /* Use the local node if we haven't already */
4008 if (!node_isset(node
, *used_node_mask
)) {
4009 node_set(node
, *used_node_mask
);
4013 for_each_node_state(n
, N_MEMORY
) {
4015 /* Don't want a node to appear more than once */
4016 if (node_isset(n
, *used_node_mask
))
4019 /* Use the distance array to find the distance */
4020 val
= node_distance(node
, n
);
4022 /* Penalize nodes under us ("prefer the next node") */
4025 /* Give preference to headless and unused nodes */
4026 tmp
= cpumask_of_node(n
);
4027 if (!cpumask_empty(tmp
))
4028 val
+= PENALTY_FOR_NODE_WITH_CPUS
;
4030 /* Slight preference for less loaded node */
4031 val
*= (MAX_NODE_LOAD
*MAX_NUMNODES
);
4032 val
+= node_load
[n
];
4034 if (val
< min_val
) {
4041 node_set(best_node
, *used_node_mask
);
4048 * Build zonelists ordered by node and zones within node.
4049 * This results in maximum locality--normal zone overflows into local
4050 * DMA zone, if any--but risks exhausting DMA zone.
4052 static void build_zonelists_in_node_order(pg_data_t
*pgdat
, int node
)
4055 struct zonelist
*zonelist
;
4057 zonelist
= &pgdat
->node_zonelists
[0];
4058 for (j
= 0; zonelist
->_zonerefs
[j
].zone
!= NULL
; j
++)
4060 j
= build_zonelists_node(NODE_DATA(node
), zonelist
, j
);
4061 zonelist
->_zonerefs
[j
].zone
= NULL
;
4062 zonelist
->_zonerefs
[j
].zone_idx
= 0;
4066 * Build gfp_thisnode zonelists
4068 static void build_thisnode_zonelists(pg_data_t
*pgdat
)
4071 struct zonelist
*zonelist
;
4073 zonelist
= &pgdat
->node_zonelists
[1];
4074 j
= build_zonelists_node(pgdat
, zonelist
, 0);
4075 zonelist
->_zonerefs
[j
].zone
= NULL
;
4076 zonelist
->_zonerefs
[j
].zone_idx
= 0;
4080 * Build zonelists ordered by zone and nodes within zones.
4081 * This results in conserving DMA zone[s] until all Normal memory is
4082 * exhausted, but results in overflowing to remote node while memory
4083 * may still exist in local DMA zone.
4085 static int node_order
[MAX_NUMNODES
];
4087 static void build_zonelists_in_zone_order(pg_data_t
*pgdat
, int nr_nodes
)
4090 int zone_type
; /* needs to be signed */
4092 struct zonelist
*zonelist
;
4094 zonelist
= &pgdat
->node_zonelists
[0];
4096 for (zone_type
= MAX_NR_ZONES
- 1; zone_type
>= 0; zone_type
--) {
4097 for (j
= 0; j
< nr_nodes
; j
++) {
4098 node
= node_order
[j
];
4099 z
= &NODE_DATA(node
)->node_zones
[zone_type
];
4100 if (populated_zone(z
)) {
4102 &zonelist
->_zonerefs
[pos
++]);
4103 check_highest_zone(zone_type
);
4107 zonelist
->_zonerefs
[pos
].zone
= NULL
;
4108 zonelist
->_zonerefs
[pos
].zone_idx
= 0;
4111 #if defined(CONFIG_64BIT)
4113 * Devices that require DMA32/DMA are relatively rare and do not justify a
4114 * penalty to every machine in case the specialised case applies. Default
4115 * to Node-ordering on 64-bit NUMA machines
4117 static int default_zonelist_order(void)
4119 return ZONELIST_ORDER_NODE
;
4123 * On 32-bit, the Normal zone needs to be preserved for allocations accessible
4124 * by the kernel. If processes running on node 0 deplete the low memory zone
4125 * then reclaim will occur more frequency increasing stalls and potentially
4126 * be easier to OOM if a large percentage of the zone is under writeback or
4127 * dirty. The problem is significantly worse if CONFIG_HIGHPTE is not set.
4128 * Hence, default to zone ordering on 32-bit.
4130 static int default_zonelist_order(void)
4132 return ZONELIST_ORDER_ZONE
;
4134 #endif /* CONFIG_64BIT */
4136 static void set_zonelist_order(void)
4138 if (user_zonelist_order
== ZONELIST_ORDER_DEFAULT
)
4139 current_zonelist_order
= default_zonelist_order();
4141 current_zonelist_order
= user_zonelist_order
;
4144 static void build_zonelists(pg_data_t
*pgdat
)
4148 nodemask_t used_mask
;
4149 int local_node
, prev_node
;
4150 struct zonelist
*zonelist
;
4151 int order
= current_zonelist_order
;
4153 /* initialize zonelists */
4154 for (i
= 0; i
< MAX_ZONELISTS
; i
++) {
4155 zonelist
= pgdat
->node_zonelists
+ i
;
4156 zonelist
->_zonerefs
[0].zone
= NULL
;
4157 zonelist
->_zonerefs
[0].zone_idx
= 0;
4160 /* NUMA-aware ordering of nodes */
4161 local_node
= pgdat
->node_id
;
4162 load
= nr_online_nodes
;
4163 prev_node
= local_node
;
4164 nodes_clear(used_mask
);
4166 memset(node_order
, 0, sizeof(node_order
));
4169 while ((node
= find_next_best_node(local_node
, &used_mask
)) >= 0) {
4171 * We don't want to pressure a particular node.
4172 * So adding penalty to the first node in same
4173 * distance group to make it round-robin.
4175 if (node_distance(local_node
, node
) !=
4176 node_distance(local_node
, prev_node
))
4177 node_load
[node
] = load
;
4181 if (order
== ZONELIST_ORDER_NODE
)
4182 build_zonelists_in_node_order(pgdat
, node
);
4184 node_order
[j
++] = node
; /* remember order */
4187 if (order
== ZONELIST_ORDER_ZONE
) {
4188 /* calculate node order -- i.e., DMA last! */
4189 build_zonelists_in_zone_order(pgdat
, j
);
4192 build_thisnode_zonelists(pgdat
);
4195 /* Construct the zonelist performance cache - see further mmzone.h */
4196 static void build_zonelist_cache(pg_data_t
*pgdat
)
4198 struct zonelist
*zonelist
;
4199 struct zonelist_cache
*zlc
;
4202 zonelist
= &pgdat
->node_zonelists
[0];
4203 zonelist
->zlcache_ptr
= zlc
= &zonelist
->zlcache
;
4204 bitmap_zero(zlc
->fullzones
, MAX_ZONES_PER_ZONELIST
);
4205 for (z
= zonelist
->_zonerefs
; z
->zone
; z
++)
4206 zlc
->z_to_n
[z
- zonelist
->_zonerefs
] = zonelist_node_idx(z
);
4209 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
4211 * Return node id of node used for "local" allocations.
4212 * I.e., first node id of first zone in arg node's generic zonelist.
4213 * Used for initializing percpu 'numa_mem', which is used primarily
4214 * for kernel allocations, so use GFP_KERNEL flags to locate zonelist.
4216 int local_memory_node(int node
)
4220 (void)first_zones_zonelist(node_zonelist(node
, GFP_KERNEL
),
4221 gfp_zone(GFP_KERNEL
),
4228 #else /* CONFIG_NUMA */
4230 static void set_zonelist_order(void)
4232 current_zonelist_order
= ZONELIST_ORDER_ZONE
;
4235 static void build_zonelists(pg_data_t
*pgdat
)
4237 int node
, local_node
;
4239 struct zonelist
*zonelist
;
4241 local_node
= pgdat
->node_id
;
4243 zonelist
= &pgdat
->node_zonelists
[0];
4244 j
= build_zonelists_node(pgdat
, zonelist
, 0);
4247 * Now we build the zonelist so that it contains the zones
4248 * of all the other nodes.
4249 * We don't want to pressure a particular node, so when
4250 * building the zones for node N, we make sure that the
4251 * zones coming right after the local ones are those from
4252 * node N+1 (modulo N)
4254 for (node
= local_node
+ 1; node
< MAX_NUMNODES
; node
++) {
4255 if (!node_online(node
))
4257 j
= build_zonelists_node(NODE_DATA(node
), zonelist
, j
);
4259 for (node
= 0; node
< local_node
; node
++) {
4260 if (!node_online(node
))
4262 j
= build_zonelists_node(NODE_DATA(node
), zonelist
, j
);
4265 zonelist
->_zonerefs
[j
].zone
= NULL
;
4266 zonelist
->_zonerefs
[j
].zone_idx
= 0;
4269 /* non-NUMA variant of zonelist performance cache - just NULL zlcache_ptr */
4270 static void build_zonelist_cache(pg_data_t
*pgdat
)
4272 pgdat
->node_zonelists
[0].zlcache_ptr
= NULL
;
4275 #endif /* CONFIG_NUMA */
4278 * Boot pageset table. One per cpu which is going to be used for all
4279 * zones and all nodes. The parameters will be set in such a way
4280 * that an item put on a list will immediately be handed over to
4281 * the buddy list. This is safe since pageset manipulation is done
4282 * with interrupts disabled.
4284 * The boot_pagesets must be kept even after bootup is complete for
4285 * unused processors and/or zones. They do play a role for bootstrapping
4286 * hotplugged processors.
4288 * zoneinfo_show() and maybe other functions do
4289 * not check if the processor is online before following the pageset pointer.
4290 * Other parts of the kernel may not check if the zone is available.
4292 static void setup_pageset(struct per_cpu_pageset
*p
, unsigned long batch
);
4293 static DEFINE_PER_CPU(struct per_cpu_pageset
, boot_pageset
);
4294 static void setup_zone_pageset(struct zone
*zone
);
4297 * Global mutex to protect against size modification of zonelists
4298 * as well as to serialize pageset setup for the new populated zone.
4300 DEFINE_MUTEX(zonelists_mutex
);
4302 /* return values int ....just for stop_machine() */
4303 static int __build_all_zonelists(void *data
)
4307 pg_data_t
*self
= data
;
4310 memset(node_load
, 0, sizeof(node_load
));
4313 if (self
&& !node_online(self
->node_id
)) {
4314 build_zonelists(self
);
4315 build_zonelist_cache(self
);
4318 for_each_online_node(nid
) {
4319 pg_data_t
*pgdat
= NODE_DATA(nid
);
4321 build_zonelists(pgdat
);
4322 build_zonelist_cache(pgdat
);
4326 * Initialize the boot_pagesets that are going to be used
4327 * for bootstrapping processors. The real pagesets for
4328 * each zone will be allocated later when the per cpu
4329 * allocator is available.
4331 * boot_pagesets are used also for bootstrapping offline
4332 * cpus if the system is already booted because the pagesets
4333 * are needed to initialize allocators on a specific cpu too.
4334 * F.e. the percpu allocator needs the page allocator which
4335 * needs the percpu allocator in order to allocate its pagesets
4336 * (a chicken-egg dilemma).
4338 for_each_possible_cpu(cpu
) {
4339 setup_pageset(&per_cpu(boot_pageset
, cpu
), 0);
4341 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
4343 * We now know the "local memory node" for each node--
4344 * i.e., the node of the first zone in the generic zonelist.
4345 * Set up numa_mem percpu variable for on-line cpus. During
4346 * boot, only the boot cpu should be on-line; we'll init the
4347 * secondary cpus' numa_mem as they come on-line. During
4348 * node/memory hotplug, we'll fixup all on-line cpus.
4350 if (cpu_online(cpu
))
4351 set_cpu_numa_mem(cpu
, local_memory_node(cpu_to_node(cpu
)));
4358 static noinline
void __init
4359 build_all_zonelists_init(void)
4361 __build_all_zonelists(NULL
);
4362 mminit_verify_zonelist();
4363 cpuset_init_current_mems_allowed();
4367 * Called with zonelists_mutex held always
4368 * unless system_state == SYSTEM_BOOTING.
4370 * __ref due to (1) call of __meminit annotated setup_zone_pageset
4371 * [we're only called with non-NULL zone through __meminit paths] and
4372 * (2) call of __init annotated helper build_all_zonelists_init
4373 * [protected by SYSTEM_BOOTING].
4375 void __ref
build_all_zonelists(pg_data_t
*pgdat
, struct zone
*zone
)
4377 set_zonelist_order();
4379 if (system_state
== SYSTEM_BOOTING
) {
4380 build_all_zonelists_init();
4382 #ifdef CONFIG_MEMORY_HOTPLUG
4384 setup_zone_pageset(zone
);
4386 /* we have to stop all cpus to guarantee there is no user
4388 stop_machine(__build_all_zonelists
, pgdat
, NULL
);
4389 /* cpuset refresh routine should be here */
4391 vm_total_pages
= nr_free_pagecache_pages();
4393 * Disable grouping by mobility if the number of pages in the
4394 * system is too low to allow the mechanism to work. It would be
4395 * more accurate, but expensive to check per-zone. This check is
4396 * made on memory-hotadd so a system can start with mobility
4397 * disabled and enable it later
4399 if (vm_total_pages
< (pageblock_nr_pages
* MIGRATE_TYPES
))
4400 page_group_by_mobility_disabled
= 1;
4402 page_group_by_mobility_disabled
= 0;
4404 pr_info("Built %i zonelists in %s order, mobility grouping %s. "
4405 "Total pages: %ld\n",
4407 zonelist_order_name
[current_zonelist_order
],
4408 page_group_by_mobility_disabled
? "off" : "on",
4411 pr_info("Policy zone: %s\n", zone_names
[policy_zone
]);
4416 * Helper functions to size the waitqueue hash table.
4417 * Essentially these want to choose hash table sizes sufficiently
4418 * large so that collisions trying to wait on pages are rare.
4419 * But in fact, the number of active page waitqueues on typical
4420 * systems is ridiculously low, less than 200. So this is even
4421 * conservative, even though it seems large.
4423 * The constant PAGES_PER_WAITQUEUE specifies the ratio of pages to
4424 * waitqueues, i.e. the size of the waitq table given the number of pages.
4426 #define PAGES_PER_WAITQUEUE 256
4428 #ifndef CONFIG_MEMORY_HOTPLUG
4429 static inline unsigned long wait_table_hash_nr_entries(unsigned long pages
)
4431 unsigned long size
= 1;
4433 pages
/= PAGES_PER_WAITQUEUE
;
4435 while (size
< pages
)
4439 * Once we have dozens or even hundreds of threads sleeping
4440 * on IO we've got bigger problems than wait queue collision.
4441 * Limit the size of the wait table to a reasonable size.
4443 size
= min(size
, 4096UL);
4445 return max(size
, 4UL);
4449 * A zone's size might be changed by hot-add, so it is not possible to determine
4450 * a suitable size for its wait_table. So we use the maximum size now.
4452 * The max wait table size = 4096 x sizeof(wait_queue_head_t). ie:
4454 * i386 (preemption config) : 4096 x 16 = 64Kbyte.
4455 * ia64, x86-64 (no preemption): 4096 x 20 = 80Kbyte.
4456 * ia64, x86-64 (preemption) : 4096 x 24 = 96Kbyte.
4458 * The maximum entries are prepared when a zone's memory is (512K + 256) pages
4459 * or more by the traditional way. (See above). It equals:
4461 * i386, x86-64, powerpc(4K page size) : = ( 2G + 1M)byte.
4462 * ia64(16K page size) : = ( 8G + 4M)byte.
4463 * powerpc (64K page size) : = (32G +16M)byte.
4465 static inline unsigned long wait_table_hash_nr_entries(unsigned long pages
)
4472 * This is an integer logarithm so that shifts can be used later
4473 * to extract the more random high bits from the multiplicative
4474 * hash function before the remainder is taken.
4476 static inline unsigned long wait_table_bits(unsigned long size
)
4482 * Check if a pageblock contains reserved pages
4484 static int pageblock_is_reserved(unsigned long start_pfn
, unsigned long end_pfn
)
4488 for (pfn
= start_pfn
; pfn
< end_pfn
; pfn
++) {
4489 if (!pfn_valid_within(pfn
) || PageReserved(pfn_to_page(pfn
)))
4496 * Mark a number of pageblocks as MIGRATE_RESERVE. The number
4497 * of blocks reserved is based on min_wmark_pages(zone). The memory within
4498 * the reserve will tend to store contiguous free pages. Setting min_free_kbytes
4499 * higher will lead to a bigger reserve which will get freed as contiguous
4500 * blocks as reclaim kicks in
4502 static void setup_zone_migrate_reserve(struct zone
*zone
)
4504 unsigned long start_pfn
, pfn
, end_pfn
, block_end_pfn
;
4506 unsigned long block_migratetype
;
4511 * Get the start pfn, end pfn and the number of blocks to reserve
4512 * We have to be careful to be aligned to pageblock_nr_pages to
4513 * make sure that we always check pfn_valid for the first page in
4516 start_pfn
= zone
->zone_start_pfn
;
4517 end_pfn
= zone_end_pfn(zone
);
4518 start_pfn
= roundup(start_pfn
, pageblock_nr_pages
);
4519 reserve
= roundup(min_wmark_pages(zone
), pageblock_nr_pages
) >>
4523 * Reserve blocks are generally in place to help high-order atomic
4524 * allocations that are short-lived. A min_free_kbytes value that
4525 * would result in more than 2 reserve blocks for atomic allocations
4526 * is assumed to be in place to help anti-fragmentation for the
4527 * future allocation of hugepages at runtime.
4529 reserve
= min(2, reserve
);
4530 old_reserve
= zone
->nr_migrate_reserve_block
;
4532 /* When memory hot-add, we almost always need to do nothing */
4533 if (reserve
== old_reserve
)
4535 zone
->nr_migrate_reserve_block
= reserve
;
4537 for (pfn
= start_pfn
; pfn
< end_pfn
; pfn
+= pageblock_nr_pages
) {
4538 if (!early_page_nid_uninitialised(pfn
, zone_to_nid(zone
)))
4541 if (!pfn_valid(pfn
))
4543 page
= pfn_to_page(pfn
);
4545 /* Watch out for overlapping nodes */
4546 if (page_to_nid(page
) != zone_to_nid(zone
))
4549 block_migratetype
= get_pageblock_migratetype(page
);
4551 /* Only test what is necessary when the reserves are not met */
4554 * Blocks with reserved pages will never free, skip
4557 block_end_pfn
= min(pfn
+ pageblock_nr_pages
, end_pfn
);
4558 if (pageblock_is_reserved(pfn
, block_end_pfn
))
4561 /* If this block is reserved, account for it */
4562 if (block_migratetype
== MIGRATE_RESERVE
) {
4567 /* Suitable for reserving if this block is movable */
4568 if (block_migratetype
== MIGRATE_MOVABLE
) {
4569 set_pageblock_migratetype(page
,
4571 move_freepages_block(zone
, page
,
4576 } else if (!old_reserve
) {
4578 * At boot time we don't need to scan the whole zone
4579 * for turning off MIGRATE_RESERVE.
4585 * If the reserve is met and this is a previous reserved block,
4588 if (block_migratetype
== MIGRATE_RESERVE
) {
4589 set_pageblock_migratetype(page
, MIGRATE_MOVABLE
);
4590 move_freepages_block(zone
, page
, MIGRATE_MOVABLE
);
4596 * Initially all pages are reserved - free ones are freed
4597 * up by free_all_bootmem() once the early boot process is
4598 * done. Non-atomic initialization, single-pass.
4600 void __meminit
memmap_init_zone(unsigned long size
, int nid
, unsigned long zone
,
4601 unsigned long start_pfn
, enum memmap_context context
)
4603 pg_data_t
*pgdat
= NODE_DATA(nid
);
4604 unsigned long end_pfn
= start_pfn
+ size
;
4607 unsigned long nr_initialised
= 0;
4609 if (highest_memmap_pfn
< end_pfn
- 1)
4610 highest_memmap_pfn
= end_pfn
- 1;
4612 z
= &pgdat
->node_zones
[zone
];
4613 for (pfn
= start_pfn
; pfn
< end_pfn
; pfn
++) {
4615 * There can be holes in boot-time mem_map[]s
4616 * handed to this function. They do not
4617 * exist on hotplugged memory.
4619 if (context
== MEMMAP_EARLY
) {
4620 if (!early_pfn_valid(pfn
))
4622 if (!early_pfn_in_nid(pfn
, nid
))
4624 if (!update_defer_init(pgdat
, pfn
, end_pfn
,
4630 * Mark the block movable so that blocks are reserved for
4631 * movable at startup. This will force kernel allocations
4632 * to reserve their blocks rather than leaking throughout
4633 * the address space during boot when many long-lived
4634 * kernel allocations are made. Later some blocks near
4635 * the start are marked MIGRATE_RESERVE by
4636 * setup_zone_migrate_reserve()
4638 * bitmap is created for zone's valid pfn range. but memmap
4639 * can be created for invalid pages (for alignment)
4640 * check here not to call set_pageblock_migratetype() against
4643 if (!(pfn
& (pageblock_nr_pages
- 1))) {
4644 struct page
*page
= pfn_to_page(pfn
);
4646 __init_single_page(page
, pfn
, zone
, nid
);
4647 set_pageblock_migratetype(page
, MIGRATE_MOVABLE
);
4649 __init_single_pfn(pfn
, zone
, nid
);
4654 static void __meminit
zone_init_free_lists(struct zone
*zone
)
4656 unsigned int order
, t
;
4657 for_each_migratetype_order(order
, t
) {
4658 INIT_LIST_HEAD(&zone
->free_area
[order
].free_list
[t
]);
4659 zone
->free_area
[order
].nr_free
= 0;
4663 #ifndef __HAVE_ARCH_MEMMAP_INIT
4664 #define memmap_init(size, nid, zone, start_pfn) \
4665 memmap_init_zone((size), (nid), (zone), (start_pfn), MEMMAP_EARLY)
4668 static int zone_batchsize(struct zone
*zone
)
4674 * The per-cpu-pages pools are set to around 1000th of the
4675 * size of the zone. But no more than 1/2 of a meg.
4677 * OK, so we don't know how big the cache is. So guess.
4679 batch
= zone
->managed_pages
/ 1024;
4680 if (batch
* PAGE_SIZE
> 512 * 1024)
4681 batch
= (512 * 1024) / PAGE_SIZE
;
4682 batch
/= 4; /* We effectively *= 4 below */
4687 * Clamp the batch to a 2^n - 1 value. Having a power
4688 * of 2 value was found to be more likely to have
4689 * suboptimal cache aliasing properties in some cases.
4691 * For example if 2 tasks are alternately allocating
4692 * batches of pages, one task can end up with a lot
4693 * of pages of one half of the possible page colors
4694 * and the other with pages of the other colors.
4696 batch
= rounddown_pow_of_two(batch
+ batch
/2) - 1;
4701 /* The deferral and batching of frees should be suppressed under NOMMU
4704 * The problem is that NOMMU needs to be able to allocate large chunks
4705 * of contiguous memory as there's no hardware page translation to
4706 * assemble apparent contiguous memory from discontiguous pages.
4708 * Queueing large contiguous runs of pages for batching, however,
4709 * causes the pages to actually be freed in smaller chunks. As there
4710 * can be a significant delay between the individual batches being
4711 * recycled, this leads to the once large chunks of space being
4712 * fragmented and becoming unavailable for high-order allocations.
4719 * pcp->high and pcp->batch values are related and dependent on one another:
4720 * ->batch must never be higher then ->high.
4721 * The following function updates them in a safe manner without read side
4724 * Any new users of pcp->batch and pcp->high should ensure they can cope with
4725 * those fields changing asynchronously (acording the the above rule).
4727 * mutex_is_locked(&pcp_batch_high_lock) required when calling this function
4728 * outside of boot time (or some other assurance that no concurrent updaters
4731 static void pageset_update(struct per_cpu_pages
*pcp
, unsigned long high
,
4732 unsigned long batch
)
4734 /* start with a fail safe value for batch */
4738 /* Update high, then batch, in order */
4745 /* a companion to pageset_set_high() */
4746 static void pageset_set_batch(struct per_cpu_pageset
*p
, unsigned long batch
)
4748 pageset_update(&p
->pcp
, 6 * batch
, max(1UL, 1 * batch
));
4751 static void pageset_init(struct per_cpu_pageset
*p
)
4753 struct per_cpu_pages
*pcp
;
4756 memset(p
, 0, sizeof(*p
));
4760 for (migratetype
= 0; migratetype
< MIGRATE_PCPTYPES
; migratetype
++)
4761 INIT_LIST_HEAD(&pcp
->lists
[migratetype
]);
4764 static void setup_pageset(struct per_cpu_pageset
*p
, unsigned long batch
)
4767 pageset_set_batch(p
, batch
);
4771 * pageset_set_high() sets the high water mark for hot per_cpu_pagelist
4772 * to the value high for the pageset p.
4774 static void pageset_set_high(struct per_cpu_pageset
*p
,
4777 unsigned long batch
= max(1UL, high
/ 4);
4778 if ((high
/ 4) > (PAGE_SHIFT
* 8))
4779 batch
= PAGE_SHIFT
* 8;
4781 pageset_update(&p
->pcp
, high
, batch
);
4784 static void pageset_set_high_and_batch(struct zone
*zone
,
4785 struct per_cpu_pageset
*pcp
)
4787 if (percpu_pagelist_fraction
)
4788 pageset_set_high(pcp
,
4789 (zone
->managed_pages
/
4790 percpu_pagelist_fraction
));
4792 pageset_set_batch(pcp
, zone_batchsize(zone
));
4795 static void __meminit
zone_pageset_init(struct zone
*zone
, int cpu
)
4797 struct per_cpu_pageset
*pcp
= per_cpu_ptr(zone
->pageset
, cpu
);
4800 pageset_set_high_and_batch(zone
, pcp
);
4803 static void __meminit
setup_zone_pageset(struct zone
*zone
)
4806 zone
->pageset
= alloc_percpu(struct per_cpu_pageset
);
4807 for_each_possible_cpu(cpu
)
4808 zone_pageset_init(zone
, cpu
);
4812 * Allocate per cpu pagesets and initialize them.
4813 * Before this call only boot pagesets were available.
4815 void __init
setup_per_cpu_pageset(void)
4819 for_each_populated_zone(zone
)
4820 setup_zone_pageset(zone
);
4823 static noinline __init_refok
4824 int zone_wait_table_init(struct zone
*zone
, unsigned long zone_size_pages
)
4830 * The per-page waitqueue mechanism uses hashed waitqueues
4833 zone
->wait_table_hash_nr_entries
=
4834 wait_table_hash_nr_entries(zone_size_pages
);
4835 zone
->wait_table_bits
=
4836 wait_table_bits(zone
->wait_table_hash_nr_entries
);
4837 alloc_size
= zone
->wait_table_hash_nr_entries
4838 * sizeof(wait_queue_head_t
);
4840 if (!slab_is_available()) {
4841 zone
->wait_table
= (wait_queue_head_t
*)
4842 memblock_virt_alloc_node_nopanic(
4843 alloc_size
, zone
->zone_pgdat
->node_id
);
4846 * This case means that a zone whose size was 0 gets new memory
4847 * via memory hot-add.
4848 * But it may be the case that a new node was hot-added. In
4849 * this case vmalloc() will not be able to use this new node's
4850 * memory - this wait_table must be initialized to use this new
4851 * node itself as well.
4852 * To use this new node's memory, further consideration will be
4855 zone
->wait_table
= vmalloc(alloc_size
);
4857 if (!zone
->wait_table
)
4860 for (i
= 0; i
< zone
->wait_table_hash_nr_entries
; ++i
)
4861 init_waitqueue_head(zone
->wait_table
+ i
);
4866 static __meminit
void zone_pcp_init(struct zone
*zone
)
4869 * per cpu subsystem is not up at this point. The following code
4870 * relies on the ability of the linker to provide the
4871 * offset of a (static) per cpu variable into the per cpu area.
4873 zone
->pageset
= &boot_pageset
;
4875 if (populated_zone(zone
))
4876 printk(KERN_DEBUG
" %s zone: %lu pages, LIFO batch:%u\n",
4877 zone
->name
, zone
->present_pages
,
4878 zone_batchsize(zone
));
4881 int __meminit
init_currently_empty_zone(struct zone
*zone
,
4882 unsigned long zone_start_pfn
,
4884 enum memmap_context context
)
4886 struct pglist_data
*pgdat
= zone
->zone_pgdat
;
4888 ret
= zone_wait_table_init(zone
, size
);
4891 pgdat
->nr_zones
= zone_idx(zone
) + 1;
4893 zone
->zone_start_pfn
= zone_start_pfn
;
4895 mminit_dprintk(MMINIT_TRACE
, "memmap_init",
4896 "Initialising map node %d zone %lu pfns %lu -> %lu\n",
4898 (unsigned long)zone_idx(zone
),
4899 zone_start_pfn
, (zone_start_pfn
+ size
));
4901 zone_init_free_lists(zone
);
4906 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
4907 #ifndef CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID
4910 * Required by SPARSEMEM. Given a PFN, return what node the PFN is on.
4912 int __meminit
__early_pfn_to_nid(unsigned long pfn
,
4913 struct mminit_pfnnid_cache
*state
)
4915 unsigned long start_pfn
, end_pfn
;
4918 if (state
->last_start
<= pfn
&& pfn
< state
->last_end
)
4919 return state
->last_nid
;
4921 nid
= memblock_search_pfn_nid(pfn
, &start_pfn
, &end_pfn
);
4923 state
->last_start
= start_pfn
;
4924 state
->last_end
= end_pfn
;
4925 state
->last_nid
= nid
;
4930 #endif /* CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID */
4933 * free_bootmem_with_active_regions - Call memblock_free_early_nid for each active range
4934 * @nid: The node to free memory on. If MAX_NUMNODES, all nodes are freed.
4935 * @max_low_pfn: The highest PFN that will be passed to memblock_free_early_nid
4937 * If an architecture guarantees that all ranges registered contain no holes
4938 * and may be freed, this this function may be used instead of calling
4939 * memblock_free_early_nid() manually.
4941 void __init
free_bootmem_with_active_regions(int nid
, unsigned long max_low_pfn
)
4943 unsigned long start_pfn
, end_pfn
;
4946 for_each_mem_pfn_range(i
, nid
, &start_pfn
, &end_pfn
, &this_nid
) {
4947 start_pfn
= min(start_pfn
, max_low_pfn
);
4948 end_pfn
= min(end_pfn
, max_low_pfn
);
4950 if (start_pfn
< end_pfn
)
4951 memblock_free_early_nid(PFN_PHYS(start_pfn
),
4952 (end_pfn
- start_pfn
) << PAGE_SHIFT
,
4958 * sparse_memory_present_with_active_regions - Call memory_present for each active range
4959 * @nid: The node to call memory_present for. If MAX_NUMNODES, all nodes will be used.
4961 * If an architecture guarantees that all ranges registered contain no holes and may
4962 * be freed, this function may be used instead of calling memory_present() manually.
4964 void __init
sparse_memory_present_with_active_regions(int nid
)
4966 unsigned long start_pfn
, end_pfn
;
4969 for_each_mem_pfn_range(i
, nid
, &start_pfn
, &end_pfn
, &this_nid
)
4970 memory_present(this_nid
, start_pfn
, end_pfn
);
4974 * get_pfn_range_for_nid - Return the start and end page frames for a node
4975 * @nid: The nid to return the range for. If MAX_NUMNODES, the min and max PFN are returned.
4976 * @start_pfn: Passed by reference. On return, it will have the node start_pfn.
4977 * @end_pfn: Passed by reference. On return, it will have the node end_pfn.
4979 * It returns the start and end page frame of a node based on information
4980 * provided by memblock_set_node(). If called for a node
4981 * with no available memory, a warning is printed and the start and end
4984 void __meminit
get_pfn_range_for_nid(unsigned int nid
,
4985 unsigned long *start_pfn
, unsigned long *end_pfn
)
4987 unsigned long this_start_pfn
, this_end_pfn
;
4993 for_each_mem_pfn_range(i
, nid
, &this_start_pfn
, &this_end_pfn
, NULL
) {
4994 *start_pfn
= min(*start_pfn
, this_start_pfn
);
4995 *end_pfn
= max(*end_pfn
, this_end_pfn
);
4998 if (*start_pfn
== -1UL)
5003 * This finds a zone that can be used for ZONE_MOVABLE pages. The
5004 * assumption is made that zones within a node are ordered in monotonic
5005 * increasing memory addresses so that the "highest" populated zone is used
5007 static void __init
find_usable_zone_for_movable(void)
5010 for (zone_index
= MAX_NR_ZONES
- 1; zone_index
>= 0; zone_index
--) {
5011 if (zone_index
== ZONE_MOVABLE
)
5014 if (arch_zone_highest_possible_pfn
[zone_index
] >
5015 arch_zone_lowest_possible_pfn
[zone_index
])
5019 VM_BUG_ON(zone_index
== -1);
5020 movable_zone
= zone_index
;
5024 * The zone ranges provided by the architecture do not include ZONE_MOVABLE
5025 * because it is sized independent of architecture. Unlike the other zones,
5026 * the starting point for ZONE_MOVABLE is not fixed. It may be different
5027 * in each node depending on the size of each node and how evenly kernelcore
5028 * is distributed. This helper function adjusts the zone ranges
5029 * provided by the architecture for a given node by using the end of the
5030 * highest usable zone for ZONE_MOVABLE. This preserves the assumption that
5031 * zones within a node are in order of monotonic increases memory addresses
5033 static void __meminit
adjust_zone_range_for_zone_movable(int nid
,
5034 unsigned long zone_type
,
5035 unsigned long node_start_pfn
,
5036 unsigned long node_end_pfn
,
5037 unsigned long *zone_start_pfn
,
5038 unsigned long *zone_end_pfn
)
5040 /* Only adjust if ZONE_MOVABLE is on this node */
5041 if (zone_movable_pfn
[nid
]) {
5042 /* Size ZONE_MOVABLE */
5043 if (zone_type
== ZONE_MOVABLE
) {
5044 *zone_start_pfn
= zone_movable_pfn
[nid
];
5045 *zone_end_pfn
= min(node_end_pfn
,
5046 arch_zone_highest_possible_pfn
[movable_zone
]);
5048 /* Adjust for ZONE_MOVABLE starting within this range */
5049 } else if (*zone_start_pfn
< zone_movable_pfn
[nid
] &&
5050 *zone_end_pfn
> zone_movable_pfn
[nid
]) {
5051 *zone_end_pfn
= zone_movable_pfn
[nid
];
5053 /* Check if this whole range is within ZONE_MOVABLE */
5054 } else if (*zone_start_pfn
>= zone_movable_pfn
[nid
])
5055 *zone_start_pfn
= *zone_end_pfn
;
5060 * Return the number of pages a zone spans in a node, including holes
5061 * present_pages = zone_spanned_pages_in_node() - zone_absent_pages_in_node()
5063 static unsigned long __meminit
zone_spanned_pages_in_node(int nid
,
5064 unsigned long zone_type
,
5065 unsigned long node_start_pfn
,
5066 unsigned long node_end_pfn
,
5067 unsigned long *ignored
)
5069 unsigned long zone_start_pfn
, zone_end_pfn
;
5071 /* When hotadd a new node, the node should be empty */
5072 if (!node_start_pfn
&& !node_end_pfn
)
5075 /* Get the start and end of the zone */
5076 zone_start_pfn
= arch_zone_lowest_possible_pfn
[zone_type
];
5077 zone_end_pfn
= arch_zone_highest_possible_pfn
[zone_type
];
5078 adjust_zone_range_for_zone_movable(nid
, zone_type
,
5079 node_start_pfn
, node_end_pfn
,
5080 &zone_start_pfn
, &zone_end_pfn
);
5082 /* Check that this node has pages within the zone's required range */
5083 if (zone_end_pfn
< node_start_pfn
|| zone_start_pfn
> node_end_pfn
)
5086 /* Move the zone boundaries inside the node if necessary */
5087 zone_end_pfn
= min(zone_end_pfn
, node_end_pfn
);
5088 zone_start_pfn
= max(zone_start_pfn
, node_start_pfn
);
5090 /* Return the spanned pages */
5091 return zone_end_pfn
- zone_start_pfn
;
5095 * Return the number of holes in a range on a node. If nid is MAX_NUMNODES,
5096 * then all holes in the requested range will be accounted for.
5098 unsigned long __meminit
__absent_pages_in_range(int nid
,
5099 unsigned long range_start_pfn
,
5100 unsigned long range_end_pfn
)
5102 unsigned long nr_absent
= range_end_pfn
- range_start_pfn
;
5103 unsigned long start_pfn
, end_pfn
;
5106 for_each_mem_pfn_range(i
, nid
, &start_pfn
, &end_pfn
, NULL
) {
5107 start_pfn
= clamp(start_pfn
, range_start_pfn
, range_end_pfn
);
5108 end_pfn
= clamp(end_pfn
, range_start_pfn
, range_end_pfn
);
5109 nr_absent
-= end_pfn
- start_pfn
;
5115 * absent_pages_in_range - Return number of page frames in holes within a range
5116 * @start_pfn: The start PFN to start searching for holes
5117 * @end_pfn: The end PFN to stop searching for holes
5119 * It returns the number of pages frames in memory holes within a range.
5121 unsigned long __init
absent_pages_in_range(unsigned long start_pfn
,
5122 unsigned long end_pfn
)
5124 return __absent_pages_in_range(MAX_NUMNODES
, start_pfn
, end_pfn
);
5127 /* Return the number of page frames in holes in a zone on a node */
5128 static unsigned long __meminit
zone_absent_pages_in_node(int nid
,
5129 unsigned long zone_type
,
5130 unsigned long node_start_pfn
,
5131 unsigned long node_end_pfn
,
5132 unsigned long *ignored
)
5134 unsigned long zone_low
= arch_zone_lowest_possible_pfn
[zone_type
];
5135 unsigned long zone_high
= arch_zone_highest_possible_pfn
[zone_type
];
5136 unsigned long zone_start_pfn
, zone_end_pfn
;
5138 /* When hotadd a new node, the node should be empty */
5139 if (!node_start_pfn
&& !node_end_pfn
)
5142 zone_start_pfn
= clamp(node_start_pfn
, zone_low
, zone_high
);
5143 zone_end_pfn
= clamp(node_end_pfn
, zone_low
, zone_high
);
5145 adjust_zone_range_for_zone_movable(nid
, zone_type
,
5146 node_start_pfn
, node_end_pfn
,
5147 &zone_start_pfn
, &zone_end_pfn
);
5148 return __absent_pages_in_range(nid
, zone_start_pfn
, zone_end_pfn
);
5151 #else /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
5152 static inline unsigned long __meminit
zone_spanned_pages_in_node(int nid
,
5153 unsigned long zone_type
,
5154 unsigned long node_start_pfn
,
5155 unsigned long node_end_pfn
,
5156 unsigned long *zones_size
)
5158 return zones_size
[zone_type
];
5161 static inline unsigned long __meminit
zone_absent_pages_in_node(int nid
,
5162 unsigned long zone_type
,
5163 unsigned long node_start_pfn
,
5164 unsigned long node_end_pfn
,
5165 unsigned long *zholes_size
)
5170 return zholes_size
[zone_type
];
5173 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
5175 static void __meminit
calculate_node_totalpages(struct pglist_data
*pgdat
,
5176 unsigned long node_start_pfn
,
5177 unsigned long node_end_pfn
,
5178 unsigned long *zones_size
,
5179 unsigned long *zholes_size
)
5181 unsigned long realtotalpages
= 0, totalpages
= 0;
5184 for (i
= 0; i
< MAX_NR_ZONES
; i
++) {
5185 struct zone
*zone
= pgdat
->node_zones
+ i
;
5186 unsigned long size
, real_size
;
5188 size
= zone_spanned_pages_in_node(pgdat
->node_id
, i
,
5192 real_size
= size
- zone_absent_pages_in_node(pgdat
->node_id
, i
,
5193 node_start_pfn
, node_end_pfn
,
5195 zone
->spanned_pages
= size
;
5196 zone
->present_pages
= real_size
;
5199 realtotalpages
+= real_size
;
5202 pgdat
->node_spanned_pages
= totalpages
;
5203 pgdat
->node_present_pages
= realtotalpages
;
5204 printk(KERN_DEBUG
"On node %d totalpages: %lu\n", pgdat
->node_id
,
5208 #ifndef CONFIG_SPARSEMEM
5210 * Calculate the size of the zone->blockflags rounded to an unsigned long
5211 * Start by making sure zonesize is a multiple of pageblock_order by rounding
5212 * up. Then use 1 NR_PAGEBLOCK_BITS worth of bits per pageblock, finally
5213 * round what is now in bits to nearest long in bits, then return it in
5216 static unsigned long __init
usemap_size(unsigned long zone_start_pfn
, unsigned long zonesize
)
5218 unsigned long usemapsize
;
5220 zonesize
+= zone_start_pfn
& (pageblock_nr_pages
-1);
5221 usemapsize
= roundup(zonesize
, pageblock_nr_pages
);
5222 usemapsize
= usemapsize
>> pageblock_order
;
5223 usemapsize
*= NR_PAGEBLOCK_BITS
;
5224 usemapsize
= roundup(usemapsize
, 8 * sizeof(unsigned long));
5226 return usemapsize
/ 8;
5229 static void __init
setup_usemap(struct pglist_data
*pgdat
,
5231 unsigned long zone_start_pfn
,
5232 unsigned long zonesize
)
5234 unsigned long usemapsize
= usemap_size(zone_start_pfn
, zonesize
);
5235 zone
->pageblock_flags
= NULL
;
5237 zone
->pageblock_flags
=
5238 memblock_virt_alloc_node_nopanic(usemapsize
,
5242 static inline void setup_usemap(struct pglist_data
*pgdat
, struct zone
*zone
,
5243 unsigned long zone_start_pfn
, unsigned long zonesize
) {}
5244 #endif /* CONFIG_SPARSEMEM */
5246 #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
5248 /* Initialise the number of pages represented by NR_PAGEBLOCK_BITS */
5249 void __paginginit
set_pageblock_order(void)
5253 /* Check that pageblock_nr_pages has not already been setup */
5254 if (pageblock_order
)
5257 if (HPAGE_SHIFT
> PAGE_SHIFT
)
5258 order
= HUGETLB_PAGE_ORDER
;
5260 order
= MAX_ORDER
- 1;
5263 * Assume the largest contiguous order of interest is a huge page.
5264 * This value may be variable depending on boot parameters on IA64 and
5267 pageblock_order
= order
;
5269 #else /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
5272 * When CONFIG_HUGETLB_PAGE_SIZE_VARIABLE is not set, set_pageblock_order()
5273 * is unused as pageblock_order is set at compile-time. See
5274 * include/linux/pageblock-flags.h for the values of pageblock_order based on
5277 void __paginginit
set_pageblock_order(void)
5281 #endif /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
5283 static unsigned long __paginginit
calc_memmap_size(unsigned long spanned_pages
,
5284 unsigned long present_pages
)
5286 unsigned long pages
= spanned_pages
;
5289 * Provide a more accurate estimation if there are holes within
5290 * the zone and SPARSEMEM is in use. If there are holes within the
5291 * zone, each populated memory region may cost us one or two extra
5292 * memmap pages due to alignment because memmap pages for each
5293 * populated regions may not naturally algined on page boundary.
5294 * So the (present_pages >> 4) heuristic is a tradeoff for that.
5296 if (spanned_pages
> present_pages
+ (present_pages
>> 4) &&
5297 IS_ENABLED(CONFIG_SPARSEMEM
))
5298 pages
= present_pages
;
5300 return PAGE_ALIGN(pages
* sizeof(struct page
)) >> PAGE_SHIFT
;
5304 * Set up the zone data structures:
5305 * - mark all pages reserved
5306 * - mark all memory queues empty
5307 * - clear the memory bitmaps
5309 * NOTE: pgdat should get zeroed by caller.
5311 static void __paginginit
free_area_init_core(struct pglist_data
*pgdat
)
5314 int nid
= pgdat
->node_id
;
5315 unsigned long zone_start_pfn
= pgdat
->node_start_pfn
;
5318 pgdat_resize_init(pgdat
);
5319 #ifdef CONFIG_NUMA_BALANCING
5320 spin_lock_init(&pgdat
->numabalancing_migrate_lock
);
5321 pgdat
->numabalancing_migrate_nr_pages
= 0;
5322 pgdat
->numabalancing_migrate_next_window
= jiffies
;
5324 init_waitqueue_head(&pgdat
->kswapd_wait
);
5325 init_waitqueue_head(&pgdat
->pfmemalloc_wait
);
5326 pgdat_page_ext_init(pgdat
);
5328 for (j
= 0; j
< MAX_NR_ZONES
; j
++) {
5329 struct zone
*zone
= pgdat
->node_zones
+ j
;
5330 unsigned long size
, realsize
, freesize
, memmap_pages
;
5332 size
= zone
->spanned_pages
;
5333 realsize
= freesize
= zone
->present_pages
;
5336 * Adjust freesize so that it accounts for how much memory
5337 * is used by this zone for memmap. This affects the watermark
5338 * and per-cpu initialisations
5340 memmap_pages
= calc_memmap_size(size
, realsize
);
5341 if (!is_highmem_idx(j
)) {
5342 if (freesize
>= memmap_pages
) {
5343 freesize
-= memmap_pages
;
5346 " %s zone: %lu pages used for memmap\n",
5347 zone_names
[j
], memmap_pages
);
5350 " %s zone: %lu pages exceeds freesize %lu\n",
5351 zone_names
[j
], memmap_pages
, freesize
);
5354 /* Account for reserved pages */
5355 if (j
== 0 && freesize
> dma_reserve
) {
5356 freesize
-= dma_reserve
;
5357 printk(KERN_DEBUG
" %s zone: %lu pages reserved\n",
5358 zone_names
[0], dma_reserve
);
5361 if (!is_highmem_idx(j
))
5362 nr_kernel_pages
+= freesize
;
5363 /* Charge for highmem memmap if there are enough kernel pages */
5364 else if (nr_kernel_pages
> memmap_pages
* 2)
5365 nr_kernel_pages
-= memmap_pages
;
5366 nr_all_pages
+= freesize
;
5369 * Set an approximate value for lowmem here, it will be adjusted
5370 * when the bootmem allocator frees pages into the buddy system.
5371 * And all highmem pages will be managed by the buddy system.
5373 zone
->managed_pages
= is_highmem_idx(j
) ? realsize
: freesize
;
5376 zone
->min_unmapped_pages
= (freesize
*sysctl_min_unmapped_ratio
)
5378 zone
->min_slab_pages
= (freesize
* sysctl_min_slab_ratio
) / 100;
5380 zone
->name
= zone_names
[j
];
5381 spin_lock_init(&zone
->lock
);
5382 spin_lock_init(&zone
->lru_lock
);
5383 zone_seqlock_init(zone
);
5384 zone
->zone_pgdat
= pgdat
;
5385 zone_pcp_init(zone
);
5387 /* For bootup, initialized properly in watermark setup */
5388 mod_zone_page_state(zone
, NR_ALLOC_BATCH
, zone
->managed_pages
);
5390 lruvec_init(&zone
->lruvec
);
5394 set_pageblock_order();
5395 setup_usemap(pgdat
, zone
, zone_start_pfn
, size
);
5396 ret
= init_currently_empty_zone(zone
, zone_start_pfn
,
5397 size
, MEMMAP_EARLY
);
5399 memmap_init(size
, nid
, j
, zone_start_pfn
);
5400 zone_start_pfn
+= size
;
5404 static void __init_refok
alloc_node_mem_map(struct pglist_data
*pgdat
)
5406 /* Skip empty nodes */
5407 if (!pgdat
->node_spanned_pages
)
5410 #ifdef CONFIG_FLAT_NODE_MEM_MAP
5411 /* ia64 gets its own node_mem_map, before this, without bootmem */
5412 if (!pgdat
->node_mem_map
) {
5413 unsigned long size
, start
, end
;
5417 * The zone's endpoints aren't required to be MAX_ORDER
5418 * aligned but the node_mem_map endpoints must be in order
5419 * for the buddy allocator to function correctly.
5421 start
= pgdat
->node_start_pfn
& ~(MAX_ORDER_NR_PAGES
- 1);
5422 end
= pgdat_end_pfn(pgdat
);
5423 end
= ALIGN(end
, MAX_ORDER_NR_PAGES
);
5424 size
= (end
- start
) * sizeof(struct page
);
5425 map
= alloc_remap(pgdat
->node_id
, size
);
5427 map
= memblock_virt_alloc_node_nopanic(size
,
5429 pgdat
->node_mem_map
= map
+ (pgdat
->node_start_pfn
- start
);
5431 #ifndef CONFIG_NEED_MULTIPLE_NODES
5433 * With no DISCONTIG, the global mem_map is just set as node 0's
5435 if (pgdat
== NODE_DATA(0)) {
5436 mem_map
= NODE_DATA(0)->node_mem_map
;
5437 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
5438 if (page_to_pfn(mem_map
) != pgdat
->node_start_pfn
)
5439 mem_map
-= (pgdat
->node_start_pfn
- ARCH_PFN_OFFSET
);
5440 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
5443 #endif /* CONFIG_FLAT_NODE_MEM_MAP */
5446 void __paginginit
free_area_init_node(int nid
, unsigned long *zones_size
,
5447 unsigned long node_start_pfn
, unsigned long *zholes_size
)
5449 pg_data_t
*pgdat
= NODE_DATA(nid
);
5450 unsigned long start_pfn
= 0;
5451 unsigned long end_pfn
= 0;
5453 /* pg_data_t should be reset to zero when it's allocated */
5454 WARN_ON(pgdat
->nr_zones
|| pgdat
->classzone_idx
);
5456 reset_deferred_meminit(pgdat
);
5457 pgdat
->node_id
= nid
;
5458 pgdat
->node_start_pfn
= node_start_pfn
;
5459 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
5460 get_pfn_range_for_nid(nid
, &start_pfn
, &end_pfn
);
5461 pr_info("Initmem setup node %d [mem %#018Lx-%#018Lx]\n", nid
,
5462 (u64
)start_pfn
<< PAGE_SHIFT
, ((u64
)end_pfn
<< PAGE_SHIFT
) - 1);
5464 calculate_node_totalpages(pgdat
, start_pfn
, end_pfn
,
5465 zones_size
, zholes_size
);
5467 alloc_node_mem_map(pgdat
);
5468 #ifdef CONFIG_FLAT_NODE_MEM_MAP
5469 printk(KERN_DEBUG
"free_area_init_node: node %d, pgdat %08lx, node_mem_map %08lx\n",
5470 nid
, (unsigned long)pgdat
,
5471 (unsigned long)pgdat
->node_mem_map
);
5474 free_area_init_core(pgdat
);
5477 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
5479 #if MAX_NUMNODES > 1
5481 * Figure out the number of possible node ids.
5483 void __init
setup_nr_node_ids(void)
5485 unsigned int highest
;
5487 highest
= find_last_bit(node_possible_map
.bits
, MAX_NUMNODES
);
5488 nr_node_ids
= highest
+ 1;
5493 * node_map_pfn_alignment - determine the maximum internode alignment
5495 * This function should be called after node map is populated and sorted.
5496 * It calculates the maximum power of two alignment which can distinguish
5499 * For example, if all nodes are 1GiB and aligned to 1GiB, the return value
5500 * would indicate 1GiB alignment with (1 << (30 - PAGE_SHIFT)). If the
5501 * nodes are shifted by 256MiB, 256MiB. Note that if only the last node is
5502 * shifted, 1GiB is enough and this function will indicate so.
5504 * This is used to test whether pfn -> nid mapping of the chosen memory
5505 * model has fine enough granularity to avoid incorrect mapping for the
5506 * populated node map.
5508 * Returns the determined alignment in pfn's. 0 if there is no alignment
5509 * requirement (single node).
5511 unsigned long __init
node_map_pfn_alignment(void)
5513 unsigned long accl_mask
= 0, last_end
= 0;
5514 unsigned long start
, end
, mask
;
5518 for_each_mem_pfn_range(i
, MAX_NUMNODES
, &start
, &end
, &nid
) {
5519 if (!start
|| last_nid
< 0 || last_nid
== nid
) {
5526 * Start with a mask granular enough to pin-point to the
5527 * start pfn and tick off bits one-by-one until it becomes
5528 * too coarse to separate the current node from the last.
5530 mask
= ~((1 << __ffs(start
)) - 1);
5531 while (mask
&& last_end
<= (start
& (mask
<< 1)))
5534 /* accumulate all internode masks */
5538 /* convert mask to number of pages */
5539 return ~accl_mask
+ 1;
5542 /* Find the lowest pfn for a node */
5543 static unsigned long __init
find_min_pfn_for_node(int nid
)
5545 unsigned long min_pfn
= ULONG_MAX
;
5546 unsigned long start_pfn
;
5549 for_each_mem_pfn_range(i
, nid
, &start_pfn
, NULL
, NULL
)
5550 min_pfn
= min(min_pfn
, start_pfn
);
5552 if (min_pfn
== ULONG_MAX
) {
5554 "Could not find start_pfn for node %d\n", nid
);
5562 * find_min_pfn_with_active_regions - Find the minimum PFN registered
5564 * It returns the minimum PFN based on information provided via
5565 * memblock_set_node().
5567 unsigned long __init
find_min_pfn_with_active_regions(void)
5569 return find_min_pfn_for_node(MAX_NUMNODES
);
5573 * early_calculate_totalpages()
5574 * Sum pages in active regions for movable zone.
5575 * Populate N_MEMORY for calculating usable_nodes.
5577 static unsigned long __init
early_calculate_totalpages(void)
5579 unsigned long totalpages
= 0;
5580 unsigned long start_pfn
, end_pfn
;
5583 for_each_mem_pfn_range(i
, MAX_NUMNODES
, &start_pfn
, &end_pfn
, &nid
) {
5584 unsigned long pages
= end_pfn
- start_pfn
;
5586 totalpages
+= pages
;
5588 node_set_state(nid
, N_MEMORY
);
5594 * Find the PFN the Movable zone begins in each node. Kernel memory
5595 * is spread evenly between nodes as long as the nodes have enough
5596 * memory. When they don't, some nodes will have more kernelcore than
5599 static void __init
find_zone_movable_pfns_for_nodes(void)
5602 unsigned long usable_startpfn
;
5603 unsigned long kernelcore_node
, kernelcore_remaining
;
5604 /* save the state before borrow the nodemask */
5605 nodemask_t saved_node_state
= node_states
[N_MEMORY
];
5606 unsigned long totalpages
= early_calculate_totalpages();
5607 int usable_nodes
= nodes_weight(node_states
[N_MEMORY
]);
5608 struct memblock_region
*r
;
5610 /* Need to find movable_zone earlier when movable_node is specified. */
5611 find_usable_zone_for_movable();
5614 * If movable_node is specified, ignore kernelcore and movablecore
5617 if (movable_node_is_enabled()) {
5618 for_each_memblock(memory
, r
) {
5619 if (!memblock_is_hotpluggable(r
))
5624 usable_startpfn
= PFN_DOWN(r
->base
);
5625 zone_movable_pfn
[nid
] = zone_movable_pfn
[nid
] ?
5626 min(usable_startpfn
, zone_movable_pfn
[nid
]) :
5634 * If movablecore=nn[KMG] was specified, calculate what size of
5635 * kernelcore that corresponds so that memory usable for
5636 * any allocation type is evenly spread. If both kernelcore
5637 * and movablecore are specified, then the value of kernelcore
5638 * will be used for required_kernelcore if it's greater than
5639 * what movablecore would have allowed.
5641 if (required_movablecore
) {
5642 unsigned long corepages
;
5645 * Round-up so that ZONE_MOVABLE is at least as large as what
5646 * was requested by the user
5648 required_movablecore
=
5649 roundup(required_movablecore
, MAX_ORDER_NR_PAGES
);
5650 corepages
= totalpages
- required_movablecore
;
5652 required_kernelcore
= max(required_kernelcore
, corepages
);
5655 /* If kernelcore was not specified, there is no ZONE_MOVABLE */
5656 if (!required_kernelcore
)
5659 /* usable_startpfn is the lowest possible pfn ZONE_MOVABLE can be at */
5660 usable_startpfn
= arch_zone_lowest_possible_pfn
[movable_zone
];
5663 /* Spread kernelcore memory as evenly as possible throughout nodes */
5664 kernelcore_node
= required_kernelcore
/ usable_nodes
;
5665 for_each_node_state(nid
, N_MEMORY
) {
5666 unsigned long start_pfn
, end_pfn
;
5669 * Recalculate kernelcore_node if the division per node
5670 * now exceeds what is necessary to satisfy the requested
5671 * amount of memory for the kernel
5673 if (required_kernelcore
< kernelcore_node
)
5674 kernelcore_node
= required_kernelcore
/ usable_nodes
;
5677 * As the map is walked, we track how much memory is usable
5678 * by the kernel using kernelcore_remaining. When it is
5679 * 0, the rest of the node is usable by ZONE_MOVABLE
5681 kernelcore_remaining
= kernelcore_node
;
5683 /* Go through each range of PFNs within this node */
5684 for_each_mem_pfn_range(i
, nid
, &start_pfn
, &end_pfn
, NULL
) {
5685 unsigned long size_pages
;
5687 start_pfn
= max(start_pfn
, zone_movable_pfn
[nid
]);
5688 if (start_pfn
>= end_pfn
)
5691 /* Account for what is only usable for kernelcore */
5692 if (start_pfn
< usable_startpfn
) {
5693 unsigned long kernel_pages
;
5694 kernel_pages
= min(end_pfn
, usable_startpfn
)
5697 kernelcore_remaining
-= min(kernel_pages
,
5698 kernelcore_remaining
);
5699 required_kernelcore
-= min(kernel_pages
,
5700 required_kernelcore
);
5702 /* Continue if range is now fully accounted */
5703 if (end_pfn
<= usable_startpfn
) {
5706 * Push zone_movable_pfn to the end so
5707 * that if we have to rebalance
5708 * kernelcore across nodes, we will
5709 * not double account here
5711 zone_movable_pfn
[nid
] = end_pfn
;
5714 start_pfn
= usable_startpfn
;
5718 * The usable PFN range for ZONE_MOVABLE is from
5719 * start_pfn->end_pfn. Calculate size_pages as the
5720 * number of pages used as kernelcore
5722 size_pages
= end_pfn
- start_pfn
;
5723 if (size_pages
> kernelcore_remaining
)
5724 size_pages
= kernelcore_remaining
;
5725 zone_movable_pfn
[nid
] = start_pfn
+ size_pages
;
5728 * Some kernelcore has been met, update counts and
5729 * break if the kernelcore for this node has been
5732 required_kernelcore
-= min(required_kernelcore
,
5734 kernelcore_remaining
-= size_pages
;
5735 if (!kernelcore_remaining
)
5741 * If there is still required_kernelcore, we do another pass with one
5742 * less node in the count. This will push zone_movable_pfn[nid] further
5743 * along on the nodes that still have memory until kernelcore is
5747 if (usable_nodes
&& required_kernelcore
> usable_nodes
)
5751 /* Align start of ZONE_MOVABLE on all nids to MAX_ORDER_NR_PAGES */
5752 for (nid
= 0; nid
< MAX_NUMNODES
; nid
++)
5753 zone_movable_pfn
[nid
] =
5754 roundup(zone_movable_pfn
[nid
], MAX_ORDER_NR_PAGES
);
5757 /* restore the node_state */
5758 node_states
[N_MEMORY
] = saved_node_state
;
5761 /* Any regular or high memory on that node ? */
5762 static void check_for_memory(pg_data_t
*pgdat
, int nid
)
5764 enum zone_type zone_type
;
5766 if (N_MEMORY
== N_NORMAL_MEMORY
)
5769 for (zone_type
= 0; zone_type
<= ZONE_MOVABLE
- 1; zone_type
++) {
5770 struct zone
*zone
= &pgdat
->node_zones
[zone_type
];
5771 if (populated_zone(zone
)) {
5772 node_set_state(nid
, N_HIGH_MEMORY
);
5773 if (N_NORMAL_MEMORY
!= N_HIGH_MEMORY
&&
5774 zone_type
<= ZONE_NORMAL
)
5775 node_set_state(nid
, N_NORMAL_MEMORY
);
5782 * free_area_init_nodes - Initialise all pg_data_t and zone data
5783 * @max_zone_pfn: an array of max PFNs for each zone
5785 * This will call free_area_init_node() for each active node in the system.
5786 * Using the page ranges provided by memblock_set_node(), the size of each
5787 * zone in each node and their holes is calculated. If the maximum PFN
5788 * between two adjacent zones match, it is assumed that the zone is empty.
5789 * For example, if arch_max_dma_pfn == arch_max_dma32_pfn, it is assumed
5790 * that arch_max_dma32_pfn has no pages. It is also assumed that a zone
5791 * starts where the previous one ended. For example, ZONE_DMA32 starts
5792 * at arch_max_dma_pfn.
5794 void __init
free_area_init_nodes(unsigned long *max_zone_pfn
)
5796 unsigned long start_pfn
, end_pfn
;
5799 /* Record where the zone boundaries are */
5800 memset(arch_zone_lowest_possible_pfn
, 0,
5801 sizeof(arch_zone_lowest_possible_pfn
));
5802 memset(arch_zone_highest_possible_pfn
, 0,
5803 sizeof(arch_zone_highest_possible_pfn
));
5804 arch_zone_lowest_possible_pfn
[0] = find_min_pfn_with_active_regions();
5805 arch_zone_highest_possible_pfn
[0] = max_zone_pfn
[0];
5806 for (i
= 1; i
< MAX_NR_ZONES
; i
++) {
5807 if (i
== ZONE_MOVABLE
)
5809 arch_zone_lowest_possible_pfn
[i
] =
5810 arch_zone_highest_possible_pfn
[i
-1];
5811 arch_zone_highest_possible_pfn
[i
] =
5812 max(max_zone_pfn
[i
], arch_zone_lowest_possible_pfn
[i
]);
5814 arch_zone_lowest_possible_pfn
[ZONE_MOVABLE
] = 0;
5815 arch_zone_highest_possible_pfn
[ZONE_MOVABLE
] = 0;
5817 /* Find the PFNs that ZONE_MOVABLE begins at in each node */
5818 memset(zone_movable_pfn
, 0, sizeof(zone_movable_pfn
));
5819 find_zone_movable_pfns_for_nodes();
5821 /* Print out the zone ranges */
5822 pr_info("Zone ranges:\n");
5823 for (i
= 0; i
< MAX_NR_ZONES
; i
++) {
5824 if (i
== ZONE_MOVABLE
)
5826 pr_info(" %-8s ", zone_names
[i
]);
5827 if (arch_zone_lowest_possible_pfn
[i
] ==
5828 arch_zone_highest_possible_pfn
[i
])
5831 pr_cont("[mem %#018Lx-%#018Lx]\n",
5832 (u64
)arch_zone_lowest_possible_pfn
[i
]
5834 ((u64
)arch_zone_highest_possible_pfn
[i
]
5835 << PAGE_SHIFT
) - 1);
5838 /* Print out the PFNs ZONE_MOVABLE begins at in each node */
5839 pr_info("Movable zone start for each node\n");
5840 for (i
= 0; i
< MAX_NUMNODES
; i
++) {
5841 if (zone_movable_pfn
[i
])
5842 pr_info(" Node %d: %#018Lx\n", i
,
5843 (u64
)zone_movable_pfn
[i
] << PAGE_SHIFT
);
5846 /* Print out the early node map */
5847 pr_info("Early memory node ranges\n");
5848 for_each_mem_pfn_range(i
, MAX_NUMNODES
, &start_pfn
, &end_pfn
, &nid
)
5849 pr_info(" node %3d: [mem %#018Lx-%#018Lx]\n", nid
,
5850 (u64
)start_pfn
<< PAGE_SHIFT
,
5851 ((u64
)end_pfn
<< PAGE_SHIFT
) - 1);
5853 /* Initialise every node */
5854 mminit_verify_pageflags_layout();
5855 setup_nr_node_ids();
5856 for_each_online_node(nid
) {
5857 pg_data_t
*pgdat
= NODE_DATA(nid
);
5858 free_area_init_node(nid
, NULL
,
5859 find_min_pfn_for_node(nid
), NULL
);
5861 /* Any memory on that node */
5862 if (pgdat
->node_present_pages
)
5863 node_set_state(nid
, N_MEMORY
);
5864 check_for_memory(pgdat
, nid
);
5868 static int __init
cmdline_parse_core(char *p
, unsigned long *core
)
5870 unsigned long long coremem
;
5874 coremem
= memparse(p
, &p
);
5875 *core
= coremem
>> PAGE_SHIFT
;
5877 /* Paranoid check that UL is enough for the coremem value */
5878 WARN_ON((coremem
>> PAGE_SHIFT
) > ULONG_MAX
);
5884 * kernelcore=size sets the amount of memory for use for allocations that
5885 * cannot be reclaimed or migrated.
5887 static int __init
cmdline_parse_kernelcore(char *p
)
5889 return cmdline_parse_core(p
, &required_kernelcore
);
5893 * movablecore=size sets the amount of memory for use for allocations that
5894 * can be reclaimed or migrated.
5896 static int __init
cmdline_parse_movablecore(char *p
)
5898 return cmdline_parse_core(p
, &required_movablecore
);
5901 early_param("kernelcore", cmdline_parse_kernelcore
);
5902 early_param("movablecore", cmdline_parse_movablecore
);
5904 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
5906 void adjust_managed_page_count(struct page
*page
, long count
)
5908 spin_lock(&managed_page_count_lock
);
5909 page_zone(page
)->managed_pages
+= count
;
5910 totalram_pages
+= count
;
5911 #ifdef CONFIG_HIGHMEM
5912 if (PageHighMem(page
))
5913 totalhigh_pages
+= count
;
5915 spin_unlock(&managed_page_count_lock
);
5917 EXPORT_SYMBOL(adjust_managed_page_count
);
5919 unsigned long free_reserved_area(void *start
, void *end
, int poison
, char *s
)
5922 unsigned long pages
= 0;
5924 start
= (void *)PAGE_ALIGN((unsigned long)start
);
5925 end
= (void *)((unsigned long)end
& PAGE_MASK
);
5926 for (pos
= start
; pos
< end
; pos
+= PAGE_SIZE
, pages
++) {
5927 if ((unsigned int)poison
<= 0xFF)
5928 memset(pos
, poison
, PAGE_SIZE
);
5929 free_reserved_page(virt_to_page(pos
));
5933 pr_info("Freeing %s memory: %ldK (%p - %p)\n",
5934 s
, pages
<< (PAGE_SHIFT
- 10), start
, end
);
5938 EXPORT_SYMBOL(free_reserved_area
);
5940 #ifdef CONFIG_HIGHMEM
5941 void free_highmem_page(struct page
*page
)
5943 __free_reserved_page(page
);
5945 page_zone(page
)->managed_pages
++;
5951 void __init
mem_init_print_info(const char *str
)
5953 unsigned long physpages
, codesize
, datasize
, rosize
, bss_size
;
5954 unsigned long init_code_size
, init_data_size
;
5956 physpages
= get_num_physpages();
5957 codesize
= _etext
- _stext
;
5958 datasize
= _edata
- _sdata
;
5959 rosize
= __end_rodata
- __start_rodata
;
5960 bss_size
= __bss_stop
- __bss_start
;
5961 init_data_size
= __init_end
- __init_begin
;
5962 init_code_size
= _einittext
- _sinittext
;
5965 * Detect special cases and adjust section sizes accordingly:
5966 * 1) .init.* may be embedded into .data sections
5967 * 2) .init.text.* may be out of [__init_begin, __init_end],
5968 * please refer to arch/tile/kernel/vmlinux.lds.S.
5969 * 3) .rodata.* may be embedded into .text or .data sections.
5971 #define adj_init_size(start, end, size, pos, adj) \
5973 if (start <= pos && pos < end && size > adj) \
5977 adj_init_size(__init_begin
, __init_end
, init_data_size
,
5978 _sinittext
, init_code_size
);
5979 adj_init_size(_stext
, _etext
, codesize
, _sinittext
, init_code_size
);
5980 adj_init_size(_sdata
, _edata
, datasize
, __init_begin
, init_data_size
);
5981 adj_init_size(_stext
, _etext
, codesize
, __start_rodata
, rosize
);
5982 adj_init_size(_sdata
, _edata
, datasize
, __start_rodata
, rosize
);
5984 #undef adj_init_size
5986 pr_info("Memory: %luK/%luK available "
5987 "(%luK kernel code, %luK rwdata, %luK rodata, "
5988 "%luK init, %luK bss, %luK reserved, %luK cma-reserved"
5989 #ifdef CONFIG_HIGHMEM
5993 nr_free_pages() << (PAGE_SHIFT
-10), physpages
<< (PAGE_SHIFT
-10),
5994 codesize
>> 10, datasize
>> 10, rosize
>> 10,
5995 (init_data_size
+ init_code_size
) >> 10, bss_size
>> 10,
5996 (physpages
- totalram_pages
- totalcma_pages
) << (PAGE_SHIFT
-10),
5997 totalcma_pages
<< (PAGE_SHIFT
-10),
5998 #ifdef CONFIG_HIGHMEM
5999 totalhigh_pages
<< (PAGE_SHIFT
-10),
6001 str
? ", " : "", str
? str
: "");
6005 * set_dma_reserve - set the specified number of pages reserved in the first zone
6006 * @new_dma_reserve: The number of pages to mark reserved
6008 * The per-cpu batchsize and zone watermarks are determined by present_pages.
6009 * In the DMA zone, a significant percentage may be consumed by kernel image
6010 * and other unfreeable allocations which can skew the watermarks badly. This
6011 * function may optionally be used to account for unfreeable pages in the
6012 * first zone (e.g., ZONE_DMA). The effect will be lower watermarks and
6013 * smaller per-cpu batchsize.
6015 void __init
set_dma_reserve(unsigned long new_dma_reserve
)
6017 dma_reserve
= new_dma_reserve
;
6020 void __init
free_area_init(unsigned long *zones_size
)
6022 free_area_init_node(0, zones_size
,
6023 __pa(PAGE_OFFSET
) >> PAGE_SHIFT
, NULL
);
6026 static int page_alloc_cpu_notify(struct notifier_block
*self
,
6027 unsigned long action
, void *hcpu
)
6029 int cpu
= (unsigned long)hcpu
;
6031 if (action
== CPU_DEAD
|| action
== CPU_DEAD_FROZEN
) {
6032 lru_add_drain_cpu(cpu
);
6036 * Spill the event counters of the dead processor
6037 * into the current processors event counters.
6038 * This artificially elevates the count of the current
6041 vm_events_fold_cpu(cpu
);
6044 * Zero the differential counters of the dead processor
6045 * so that the vm statistics are consistent.
6047 * This is only okay since the processor is dead and cannot
6048 * race with what we are doing.
6050 cpu_vm_stats_fold(cpu
);
6055 void __init
page_alloc_init(void)
6057 hotcpu_notifier(page_alloc_cpu_notify
, 0);
6061 * calculate_totalreserve_pages - called when sysctl_lower_zone_reserve_ratio
6062 * or min_free_kbytes changes.
6064 static void calculate_totalreserve_pages(void)
6066 struct pglist_data
*pgdat
;
6067 unsigned long reserve_pages
= 0;
6068 enum zone_type i
, j
;
6070 for_each_online_pgdat(pgdat
) {
6071 for (i
= 0; i
< MAX_NR_ZONES
; i
++) {
6072 struct zone
*zone
= pgdat
->node_zones
+ i
;
6075 /* Find valid and maximum lowmem_reserve in the zone */
6076 for (j
= i
; j
< MAX_NR_ZONES
; j
++) {
6077 if (zone
->lowmem_reserve
[j
] > max
)
6078 max
= zone
->lowmem_reserve
[j
];
6081 /* we treat the high watermark as reserved pages. */
6082 max
+= high_wmark_pages(zone
);
6084 if (max
> zone
->managed_pages
)
6085 max
= zone
->managed_pages
;
6086 reserve_pages
+= max
;
6088 * Lowmem reserves are not available to
6089 * GFP_HIGHUSER page cache allocations and
6090 * kswapd tries to balance zones to their high
6091 * watermark. As a result, neither should be
6092 * regarded as dirtyable memory, to prevent a
6093 * situation where reclaim has to clean pages
6094 * in order to balance the zones.
6096 zone
->dirty_balance_reserve
= max
;
6099 dirty_balance_reserve
= reserve_pages
;
6100 totalreserve_pages
= reserve_pages
;
6104 * setup_per_zone_lowmem_reserve - called whenever
6105 * sysctl_lower_zone_reserve_ratio changes. Ensures that each zone
6106 * has a correct pages reserved value, so an adequate number of
6107 * pages are left in the zone after a successful __alloc_pages().
6109 static void setup_per_zone_lowmem_reserve(void)
6111 struct pglist_data
*pgdat
;
6112 enum zone_type j
, idx
;
6114 for_each_online_pgdat(pgdat
) {
6115 for (j
= 0; j
< MAX_NR_ZONES
; j
++) {
6116 struct zone
*zone
= pgdat
->node_zones
+ j
;
6117 unsigned long managed_pages
= zone
->managed_pages
;
6119 zone
->lowmem_reserve
[j
] = 0;
6123 struct zone
*lower_zone
;
6127 if (sysctl_lowmem_reserve_ratio
[idx
] < 1)
6128 sysctl_lowmem_reserve_ratio
[idx
] = 1;
6130 lower_zone
= pgdat
->node_zones
+ idx
;
6131 lower_zone
->lowmem_reserve
[j
] = managed_pages
/
6132 sysctl_lowmem_reserve_ratio
[idx
];
6133 managed_pages
+= lower_zone
->managed_pages
;
6138 /* update totalreserve_pages */
6139 calculate_totalreserve_pages();
6142 static void __setup_per_zone_wmarks(void)
6144 unsigned long pages_min
= min_free_kbytes
>> (PAGE_SHIFT
- 10);
6145 unsigned long lowmem_pages
= 0;
6147 unsigned long flags
;
6149 /* Calculate total number of !ZONE_HIGHMEM pages */
6150 for_each_zone(zone
) {
6151 if (!is_highmem(zone
))
6152 lowmem_pages
+= zone
->managed_pages
;
6155 for_each_zone(zone
) {
6158 spin_lock_irqsave(&zone
->lock
, flags
);
6159 tmp
= (u64
)pages_min
* zone
->managed_pages
;
6160 do_div(tmp
, lowmem_pages
);
6161 if (is_highmem(zone
)) {
6163 * __GFP_HIGH and PF_MEMALLOC allocations usually don't
6164 * need highmem pages, so cap pages_min to a small
6167 * The WMARK_HIGH-WMARK_LOW and (WMARK_LOW-WMARK_MIN)
6168 * deltas control asynch page reclaim, and so should
6169 * not be capped for highmem.
6171 unsigned long min_pages
;
6173 min_pages
= zone
->managed_pages
/ 1024;
6174 min_pages
= clamp(min_pages
, SWAP_CLUSTER_MAX
, 128UL);
6175 zone
->watermark
[WMARK_MIN
] = min_pages
;
6178 * If it's a lowmem zone, reserve a number of pages
6179 * proportionate to the zone's size.
6181 zone
->watermark
[WMARK_MIN
] = tmp
;
6184 zone
->watermark
[WMARK_LOW
] = min_wmark_pages(zone
) + (tmp
>> 2);
6185 zone
->watermark
[WMARK_HIGH
] = min_wmark_pages(zone
) + (tmp
>> 1);
6187 __mod_zone_page_state(zone
, NR_ALLOC_BATCH
,
6188 high_wmark_pages(zone
) - low_wmark_pages(zone
) -
6189 atomic_long_read(&zone
->vm_stat
[NR_ALLOC_BATCH
]));
6191 setup_zone_migrate_reserve(zone
);
6192 spin_unlock_irqrestore(&zone
->lock
, flags
);
6195 /* update totalreserve_pages */
6196 calculate_totalreserve_pages();
6200 * setup_per_zone_wmarks - called when min_free_kbytes changes
6201 * or when memory is hot-{added|removed}
6203 * Ensures that the watermark[min,low,high] values for each zone are set
6204 * correctly with respect to min_free_kbytes.
6206 void setup_per_zone_wmarks(void)
6208 mutex_lock(&zonelists_mutex
);
6209 __setup_per_zone_wmarks();
6210 mutex_unlock(&zonelists_mutex
);
6214 * The inactive anon list should be small enough that the VM never has to
6215 * do too much work, but large enough that each inactive page has a chance
6216 * to be referenced again before it is swapped out.
6218 * The inactive_anon ratio is the target ratio of ACTIVE_ANON to
6219 * INACTIVE_ANON pages on this zone's LRU, maintained by the
6220 * pageout code. A zone->inactive_ratio of 3 means 3:1 or 25% of
6221 * the anonymous pages are kept on the inactive list.
6224 * memory ratio inactive anon
6225 * -------------------------------------
6234 static void __meminit
calculate_zone_inactive_ratio(struct zone
*zone
)
6236 unsigned int gb
, ratio
;
6238 /* Zone size in gigabytes */
6239 gb
= zone
->managed_pages
>> (30 - PAGE_SHIFT
);
6241 ratio
= int_sqrt(10 * gb
);
6245 zone
->inactive_ratio
= ratio
;
6248 static void __meminit
setup_per_zone_inactive_ratio(void)
6253 calculate_zone_inactive_ratio(zone
);
6257 * Initialise min_free_kbytes.
6259 * For small machines we want it small (128k min). For large machines
6260 * we want it large (64MB max). But it is not linear, because network
6261 * bandwidth does not increase linearly with machine size. We use
6263 * min_free_kbytes = 4 * sqrt(lowmem_kbytes), for better accuracy:
6264 * min_free_kbytes = sqrt(lowmem_kbytes * 16)
6280 int __meminit
init_per_zone_wmark_min(void)
6282 unsigned long lowmem_kbytes
;
6283 int new_min_free_kbytes
;
6285 lowmem_kbytes
= nr_free_buffer_pages() * (PAGE_SIZE
>> 10);
6286 new_min_free_kbytes
= int_sqrt(lowmem_kbytes
* 16);
6288 if (new_min_free_kbytes
> user_min_free_kbytes
) {
6289 min_free_kbytes
= new_min_free_kbytes
;
6290 if (min_free_kbytes
< 128)
6291 min_free_kbytes
= 128;
6292 if (min_free_kbytes
> 65536)
6293 min_free_kbytes
= 65536;
6295 pr_warn("min_free_kbytes is not updated to %d because user defined value %d is preferred\n",
6296 new_min_free_kbytes
, user_min_free_kbytes
);
6298 setup_per_zone_wmarks();
6299 refresh_zone_stat_thresholds();
6300 setup_per_zone_lowmem_reserve();
6301 setup_per_zone_inactive_ratio();
6304 module_init(init_per_zone_wmark_min
)
6307 * min_free_kbytes_sysctl_handler - just a wrapper around proc_dointvec() so
6308 * that we can call two helper functions whenever min_free_kbytes
6311 int min_free_kbytes_sysctl_handler(struct ctl_table
*table
, int write
,
6312 void __user
*buffer
, size_t *length
, loff_t
*ppos
)
6316 rc
= proc_dointvec_minmax(table
, write
, buffer
, length
, ppos
);
6321 user_min_free_kbytes
= min_free_kbytes
;
6322 setup_per_zone_wmarks();
6328 int sysctl_min_unmapped_ratio_sysctl_handler(struct ctl_table
*table
, int write
,
6329 void __user
*buffer
, size_t *length
, loff_t
*ppos
)
6334 rc
= proc_dointvec_minmax(table
, write
, buffer
, length
, ppos
);
6339 zone
->min_unmapped_pages
= (zone
->managed_pages
*
6340 sysctl_min_unmapped_ratio
) / 100;
6344 int sysctl_min_slab_ratio_sysctl_handler(struct ctl_table
*table
, int write
,
6345 void __user
*buffer
, size_t *length
, loff_t
*ppos
)
6350 rc
= proc_dointvec_minmax(table
, write
, buffer
, length
, ppos
);
6355 zone
->min_slab_pages
= (zone
->managed_pages
*
6356 sysctl_min_slab_ratio
) / 100;
6362 * lowmem_reserve_ratio_sysctl_handler - just a wrapper around
6363 * proc_dointvec() so that we can call setup_per_zone_lowmem_reserve()
6364 * whenever sysctl_lowmem_reserve_ratio changes.
6366 * The reserve ratio obviously has absolutely no relation with the
6367 * minimum watermarks. The lowmem reserve ratio can only make sense
6368 * if in function of the boot time zone sizes.
6370 int lowmem_reserve_ratio_sysctl_handler(struct ctl_table
*table
, int write
,
6371 void __user
*buffer
, size_t *length
, loff_t
*ppos
)
6373 proc_dointvec_minmax(table
, write
, buffer
, length
, ppos
);
6374 setup_per_zone_lowmem_reserve();
6379 * percpu_pagelist_fraction - changes the pcp->high for each zone on each
6380 * cpu. It is the fraction of total pages in each zone that a hot per cpu
6381 * pagelist can have before it gets flushed back to buddy allocator.
6383 int percpu_pagelist_fraction_sysctl_handler(struct ctl_table
*table
, int write
,
6384 void __user
*buffer
, size_t *length
, loff_t
*ppos
)
6387 int old_percpu_pagelist_fraction
;
6390 mutex_lock(&pcp_batch_high_lock
);
6391 old_percpu_pagelist_fraction
= percpu_pagelist_fraction
;
6393 ret
= proc_dointvec_minmax(table
, write
, buffer
, length
, ppos
);
6394 if (!write
|| ret
< 0)
6397 /* Sanity checking to avoid pcp imbalance */
6398 if (percpu_pagelist_fraction
&&
6399 percpu_pagelist_fraction
< MIN_PERCPU_PAGELIST_FRACTION
) {
6400 percpu_pagelist_fraction
= old_percpu_pagelist_fraction
;
6406 if (percpu_pagelist_fraction
== old_percpu_pagelist_fraction
)
6409 for_each_populated_zone(zone
) {
6412 for_each_possible_cpu(cpu
)
6413 pageset_set_high_and_batch(zone
,
6414 per_cpu_ptr(zone
->pageset
, cpu
));
6417 mutex_unlock(&pcp_batch_high_lock
);
6422 int hashdist
= HASHDIST_DEFAULT
;
6424 static int __init
set_hashdist(char *str
)
6428 hashdist
= simple_strtoul(str
, &str
, 0);
6431 __setup("hashdist=", set_hashdist
);
6435 * allocate a large system hash table from bootmem
6436 * - it is assumed that the hash table must contain an exact power-of-2
6437 * quantity of entries
6438 * - limit is the number of hash buckets, not the total allocation size
6440 void *__init
alloc_large_system_hash(const char *tablename
,
6441 unsigned long bucketsize
,
6442 unsigned long numentries
,
6445 unsigned int *_hash_shift
,
6446 unsigned int *_hash_mask
,
6447 unsigned long low_limit
,
6448 unsigned long high_limit
)
6450 unsigned long long max
= high_limit
;
6451 unsigned long log2qty
, size
;
6454 /* allow the kernel cmdline to have a say */
6456 /* round applicable memory size up to nearest megabyte */
6457 numentries
= nr_kernel_pages
;
6459 /* It isn't necessary when PAGE_SIZE >= 1MB */
6460 if (PAGE_SHIFT
< 20)
6461 numentries
= round_up(numentries
, (1<<20)/PAGE_SIZE
);
6463 /* limit to 1 bucket per 2^scale bytes of low memory */
6464 if (scale
> PAGE_SHIFT
)
6465 numentries
>>= (scale
- PAGE_SHIFT
);
6467 numentries
<<= (PAGE_SHIFT
- scale
);
6469 /* Make sure we've got at least a 0-order allocation.. */
6470 if (unlikely(flags
& HASH_SMALL
)) {
6471 /* Makes no sense without HASH_EARLY */
6472 WARN_ON(!(flags
& HASH_EARLY
));
6473 if (!(numentries
>> *_hash_shift
)) {
6474 numentries
= 1UL << *_hash_shift
;
6475 BUG_ON(!numentries
);
6477 } else if (unlikely((numentries
* bucketsize
) < PAGE_SIZE
))
6478 numentries
= PAGE_SIZE
/ bucketsize
;
6480 numentries
= roundup_pow_of_two(numentries
);
6482 /* limit allocation size to 1/16 total memory by default */
6484 max
= ((unsigned long long)nr_all_pages
<< PAGE_SHIFT
) >> 4;
6485 do_div(max
, bucketsize
);
6487 max
= min(max
, 0x80000000ULL
);
6489 if (numentries
< low_limit
)
6490 numentries
= low_limit
;
6491 if (numentries
> max
)
6494 log2qty
= ilog2(numentries
);
6497 size
= bucketsize
<< log2qty
;
6498 if (flags
& HASH_EARLY
)
6499 table
= memblock_virt_alloc_nopanic(size
, 0);
6501 table
= __vmalloc(size
, GFP_ATOMIC
, PAGE_KERNEL
);
6504 * If bucketsize is not a power-of-two, we may free
6505 * some pages at the end of hash table which
6506 * alloc_pages_exact() automatically does
6508 if (get_order(size
) < MAX_ORDER
) {
6509 table
= alloc_pages_exact(size
, GFP_ATOMIC
);
6510 kmemleak_alloc(table
, size
, 1, GFP_ATOMIC
);
6513 } while (!table
&& size
> PAGE_SIZE
&& --log2qty
);
6516 panic("Failed to allocate %s hash table\n", tablename
);
6518 printk(KERN_INFO
"%s hash table entries: %ld (order: %d, %lu bytes)\n",
6521 ilog2(size
) - PAGE_SHIFT
,
6525 *_hash_shift
= log2qty
;
6527 *_hash_mask
= (1 << log2qty
) - 1;
6532 /* Return a pointer to the bitmap storing bits affecting a block of pages */
6533 static inline unsigned long *get_pageblock_bitmap(struct zone
*zone
,
6536 #ifdef CONFIG_SPARSEMEM
6537 return __pfn_to_section(pfn
)->pageblock_flags
;
6539 return zone
->pageblock_flags
;
6540 #endif /* CONFIG_SPARSEMEM */
6543 static inline int pfn_to_bitidx(struct zone
*zone
, unsigned long pfn
)
6545 #ifdef CONFIG_SPARSEMEM
6546 pfn
&= (PAGES_PER_SECTION
-1);
6547 return (pfn
>> pageblock_order
) * NR_PAGEBLOCK_BITS
;
6549 pfn
= pfn
- round_down(zone
->zone_start_pfn
, pageblock_nr_pages
);
6550 return (pfn
>> pageblock_order
) * NR_PAGEBLOCK_BITS
;
6551 #endif /* CONFIG_SPARSEMEM */
6555 * get_pfnblock_flags_mask - Return the requested group of flags for the pageblock_nr_pages block of pages
6556 * @page: The page within the block of interest
6557 * @pfn: The target page frame number
6558 * @end_bitidx: The last bit of interest to retrieve
6559 * @mask: mask of bits that the caller is interested in
6561 * Return: pageblock_bits flags
6563 unsigned long get_pfnblock_flags_mask(struct page
*page
, unsigned long pfn
,
6564 unsigned long end_bitidx
,
6568 unsigned long *bitmap
;
6569 unsigned long bitidx
, word_bitidx
;
6572 zone
= page_zone(page
);
6573 bitmap
= get_pageblock_bitmap(zone
, pfn
);
6574 bitidx
= pfn_to_bitidx(zone
, pfn
);
6575 word_bitidx
= bitidx
/ BITS_PER_LONG
;
6576 bitidx
&= (BITS_PER_LONG
-1);
6578 word
= bitmap
[word_bitidx
];
6579 bitidx
+= end_bitidx
;
6580 return (word
>> (BITS_PER_LONG
- bitidx
- 1)) & mask
;
6584 * set_pfnblock_flags_mask - Set the requested group of flags for a pageblock_nr_pages block of pages
6585 * @page: The page within the block of interest
6586 * @flags: The flags to set
6587 * @pfn: The target page frame number
6588 * @end_bitidx: The last bit of interest
6589 * @mask: mask of bits that the caller is interested in
6591 void set_pfnblock_flags_mask(struct page
*page
, unsigned long flags
,
6593 unsigned long end_bitidx
,
6597 unsigned long *bitmap
;
6598 unsigned long bitidx
, word_bitidx
;
6599 unsigned long old_word
, word
;
6601 BUILD_BUG_ON(NR_PAGEBLOCK_BITS
!= 4);
6603 zone
= page_zone(page
);
6604 bitmap
= get_pageblock_bitmap(zone
, pfn
);
6605 bitidx
= pfn_to_bitidx(zone
, pfn
);
6606 word_bitidx
= bitidx
/ BITS_PER_LONG
;
6607 bitidx
&= (BITS_PER_LONG
-1);
6609 VM_BUG_ON_PAGE(!zone_spans_pfn(zone
, pfn
), page
);
6611 bitidx
+= end_bitidx
;
6612 mask
<<= (BITS_PER_LONG
- bitidx
- 1);
6613 flags
<<= (BITS_PER_LONG
- bitidx
- 1);
6615 word
= READ_ONCE(bitmap
[word_bitidx
]);
6617 old_word
= cmpxchg(&bitmap
[word_bitidx
], word
, (word
& ~mask
) | flags
);
6618 if (word
== old_word
)
6625 * This function checks whether pageblock includes unmovable pages or not.
6626 * If @count is not zero, it is okay to include less @count unmovable pages
6628 * PageLRU check without isolation or lru_lock could race so that
6629 * MIGRATE_MOVABLE block might include unmovable pages. It means you can't
6630 * expect this function should be exact.
6632 bool has_unmovable_pages(struct zone
*zone
, struct page
*page
, int count
,
6633 bool skip_hwpoisoned_pages
)
6635 unsigned long pfn
, iter
, found
;
6639 * For avoiding noise data, lru_add_drain_all() should be called
6640 * If ZONE_MOVABLE, the zone never contains unmovable pages
6642 if (zone_idx(zone
) == ZONE_MOVABLE
)
6644 mt
= get_pageblock_migratetype(page
);
6645 if (mt
== MIGRATE_MOVABLE
|| is_migrate_cma(mt
))
6648 pfn
= page_to_pfn(page
);
6649 for (found
= 0, iter
= 0; iter
< pageblock_nr_pages
; iter
++) {
6650 unsigned long check
= pfn
+ iter
;
6652 if (!pfn_valid_within(check
))
6655 page
= pfn_to_page(check
);
6658 * Hugepages are not in LRU lists, but they're movable.
6659 * We need not scan over tail pages bacause we don't
6660 * handle each tail page individually in migration.
6662 if (PageHuge(page
)) {
6663 iter
= round_up(iter
+ 1, 1<<compound_order(page
)) - 1;
6668 * We can't use page_count without pin a page
6669 * because another CPU can free compound page.
6670 * This check already skips compound tails of THP
6671 * because their page->_count is zero at all time.
6673 if (!atomic_read(&page
->_count
)) {
6674 if (PageBuddy(page
))
6675 iter
+= (1 << page_order(page
)) - 1;
6680 * The HWPoisoned page may be not in buddy system, and
6681 * page_count() is not 0.
6683 if (skip_hwpoisoned_pages
&& PageHWPoison(page
))
6689 * If there are RECLAIMABLE pages, we need to check
6690 * it. But now, memory offline itself doesn't call
6691 * shrink_node_slabs() and it still to be fixed.
6694 * If the page is not RAM, page_count()should be 0.
6695 * we don't need more check. This is an _used_ not-movable page.
6697 * The problematic thing here is PG_reserved pages. PG_reserved
6698 * is set to both of a memory hole page and a _used_ kernel
6707 bool is_pageblock_removable_nolock(struct page
*page
)
6713 * We have to be careful here because we are iterating over memory
6714 * sections which are not zone aware so we might end up outside of
6715 * the zone but still within the section.
6716 * We have to take care about the node as well. If the node is offline
6717 * its NODE_DATA will be NULL - see page_zone.
6719 if (!node_online(page_to_nid(page
)))
6722 zone
= page_zone(page
);
6723 pfn
= page_to_pfn(page
);
6724 if (!zone_spans_pfn(zone
, pfn
))
6727 return !has_unmovable_pages(zone
, page
, 0, true);
6732 static unsigned long pfn_max_align_down(unsigned long pfn
)
6734 return pfn
& ~(max_t(unsigned long, MAX_ORDER_NR_PAGES
,
6735 pageblock_nr_pages
) - 1);
6738 static unsigned long pfn_max_align_up(unsigned long pfn
)
6740 return ALIGN(pfn
, max_t(unsigned long, MAX_ORDER_NR_PAGES
,
6741 pageblock_nr_pages
));
6744 /* [start, end) must belong to a single zone. */
6745 static int __alloc_contig_migrate_range(struct compact_control
*cc
,
6746 unsigned long start
, unsigned long end
)
6748 /* This function is based on compact_zone() from compaction.c. */
6749 unsigned long nr_reclaimed
;
6750 unsigned long pfn
= start
;
6751 unsigned int tries
= 0;
6756 while (pfn
< end
|| !list_empty(&cc
->migratepages
)) {
6757 if (fatal_signal_pending(current
)) {
6762 if (list_empty(&cc
->migratepages
)) {
6763 cc
->nr_migratepages
= 0;
6764 pfn
= isolate_migratepages_range(cc
, pfn
, end
);
6770 } else if (++tries
== 5) {
6771 ret
= ret
< 0 ? ret
: -EBUSY
;
6775 nr_reclaimed
= reclaim_clean_pages_from_list(cc
->zone
,
6777 cc
->nr_migratepages
-= nr_reclaimed
;
6779 ret
= migrate_pages(&cc
->migratepages
, alloc_migrate_target
,
6780 NULL
, 0, cc
->mode
, MR_CMA
);
6783 putback_movable_pages(&cc
->migratepages
);
6790 * alloc_contig_range() -- tries to allocate given range of pages
6791 * @start: start PFN to allocate
6792 * @end: one-past-the-last PFN to allocate
6793 * @migratetype: migratetype of the underlaying pageblocks (either
6794 * #MIGRATE_MOVABLE or #MIGRATE_CMA). All pageblocks
6795 * in range must have the same migratetype and it must
6796 * be either of the two.
6798 * The PFN range does not have to be pageblock or MAX_ORDER_NR_PAGES
6799 * aligned, however it's the caller's responsibility to guarantee that
6800 * we are the only thread that changes migrate type of pageblocks the
6803 * The PFN range must belong to a single zone.
6805 * Returns zero on success or negative error code. On success all
6806 * pages which PFN is in [start, end) are allocated for the caller and
6807 * need to be freed with free_contig_range().
6809 int alloc_contig_range(unsigned long start
, unsigned long end
,
6810 unsigned migratetype
)
6812 unsigned long outer_start
, outer_end
;
6815 struct compact_control cc
= {
6816 .nr_migratepages
= 0,
6818 .zone
= page_zone(pfn_to_page(start
)),
6819 .mode
= MIGRATE_SYNC
,
6820 .ignore_skip_hint
= true,
6822 INIT_LIST_HEAD(&cc
.migratepages
);
6825 * What we do here is we mark all pageblocks in range as
6826 * MIGRATE_ISOLATE. Because pageblock and max order pages may
6827 * have different sizes, and due to the way page allocator
6828 * work, we align the range to biggest of the two pages so
6829 * that page allocator won't try to merge buddies from
6830 * different pageblocks and change MIGRATE_ISOLATE to some
6831 * other migration type.
6833 * Once the pageblocks are marked as MIGRATE_ISOLATE, we
6834 * migrate the pages from an unaligned range (ie. pages that
6835 * we are interested in). This will put all the pages in
6836 * range back to page allocator as MIGRATE_ISOLATE.
6838 * When this is done, we take the pages in range from page
6839 * allocator removing them from the buddy system. This way
6840 * page allocator will never consider using them.
6842 * This lets us mark the pageblocks back as
6843 * MIGRATE_CMA/MIGRATE_MOVABLE so that free pages in the
6844 * aligned range but not in the unaligned, original range are
6845 * put back to page allocator so that buddy can use them.
6848 ret
= start_isolate_page_range(pfn_max_align_down(start
),
6849 pfn_max_align_up(end
), migratetype
,
6854 ret
= __alloc_contig_migrate_range(&cc
, start
, end
);
6859 * Pages from [start, end) are within a MAX_ORDER_NR_PAGES
6860 * aligned blocks that are marked as MIGRATE_ISOLATE. What's
6861 * more, all pages in [start, end) are free in page allocator.
6862 * What we are going to do is to allocate all pages from
6863 * [start, end) (that is remove them from page allocator).
6865 * The only problem is that pages at the beginning and at the
6866 * end of interesting range may be not aligned with pages that
6867 * page allocator holds, ie. they can be part of higher order
6868 * pages. Because of this, we reserve the bigger range and
6869 * once this is done free the pages we are not interested in.
6871 * We don't have to hold zone->lock here because the pages are
6872 * isolated thus they won't get removed from buddy.
6875 lru_add_drain_all();
6876 drain_all_pages(cc
.zone
);
6879 outer_start
= start
;
6880 while (!PageBuddy(pfn_to_page(outer_start
))) {
6881 if (++order
>= MAX_ORDER
) {
6885 outer_start
&= ~0UL << order
;
6888 /* Make sure the range is really isolated. */
6889 if (test_pages_isolated(outer_start
, end
, false)) {
6890 pr_info("%s: [%lx, %lx) PFNs busy\n",
6891 __func__
, outer_start
, end
);
6896 /* Grab isolated pages from freelists. */
6897 outer_end
= isolate_freepages_range(&cc
, outer_start
, end
);
6903 /* Free head and tail (if any) */
6904 if (start
!= outer_start
)
6905 free_contig_range(outer_start
, start
- outer_start
);
6906 if (end
!= outer_end
)
6907 free_contig_range(end
, outer_end
- end
);
6910 undo_isolate_page_range(pfn_max_align_down(start
),
6911 pfn_max_align_up(end
), migratetype
);
6915 void free_contig_range(unsigned long pfn
, unsigned nr_pages
)
6917 unsigned int count
= 0;
6919 for (; nr_pages
--; pfn
++) {
6920 struct page
*page
= pfn_to_page(pfn
);
6922 count
+= page_count(page
) != 1;
6925 WARN(count
!= 0, "%d pages are still in use!\n", count
);
6929 #ifdef CONFIG_MEMORY_HOTPLUG
6931 * The zone indicated has a new number of managed_pages; batch sizes and percpu
6932 * page high values need to be recalulated.
6934 void __meminit
zone_pcp_update(struct zone
*zone
)
6937 mutex_lock(&pcp_batch_high_lock
);
6938 for_each_possible_cpu(cpu
)
6939 pageset_set_high_and_batch(zone
,
6940 per_cpu_ptr(zone
->pageset
, cpu
));
6941 mutex_unlock(&pcp_batch_high_lock
);
6945 void zone_pcp_reset(struct zone
*zone
)
6947 unsigned long flags
;
6949 struct per_cpu_pageset
*pset
;
6951 /* avoid races with drain_pages() */
6952 local_irq_save(flags
);
6953 if (zone
->pageset
!= &boot_pageset
) {
6954 for_each_online_cpu(cpu
) {
6955 pset
= per_cpu_ptr(zone
->pageset
, cpu
);
6956 drain_zonestat(zone
, pset
);
6958 free_percpu(zone
->pageset
);
6959 zone
->pageset
= &boot_pageset
;
6961 local_irq_restore(flags
);
6964 #ifdef CONFIG_MEMORY_HOTREMOVE
6966 * All pages in the range must be isolated before calling this.
6969 __offline_isolated_pages(unsigned long start_pfn
, unsigned long end_pfn
)
6973 unsigned int order
, i
;
6975 unsigned long flags
;
6976 /* find the first valid pfn */
6977 for (pfn
= start_pfn
; pfn
< end_pfn
; pfn
++)
6982 zone
= page_zone(pfn_to_page(pfn
));
6983 spin_lock_irqsave(&zone
->lock
, flags
);
6985 while (pfn
< end_pfn
) {
6986 if (!pfn_valid(pfn
)) {
6990 page
= pfn_to_page(pfn
);
6992 * The HWPoisoned page may be not in buddy system, and
6993 * page_count() is not 0.
6995 if (unlikely(!PageBuddy(page
) && PageHWPoison(page
))) {
6997 SetPageReserved(page
);
7001 BUG_ON(page_count(page
));
7002 BUG_ON(!PageBuddy(page
));
7003 order
= page_order(page
);
7004 #ifdef CONFIG_DEBUG_VM
7005 printk(KERN_INFO
"remove from free list %lx %d %lx\n",
7006 pfn
, 1 << order
, end_pfn
);
7008 list_del(&page
->lru
);
7009 rmv_page_order(page
);
7010 zone
->free_area
[order
].nr_free
--;
7011 for (i
= 0; i
< (1 << order
); i
++)
7012 SetPageReserved((page
+i
));
7013 pfn
+= (1 << order
);
7015 spin_unlock_irqrestore(&zone
->lock
, flags
);
7019 #ifdef CONFIG_MEMORY_FAILURE
7020 bool is_free_buddy_page(struct page
*page
)
7022 struct zone
*zone
= page_zone(page
);
7023 unsigned long pfn
= page_to_pfn(page
);
7024 unsigned long flags
;
7027 spin_lock_irqsave(&zone
->lock
, flags
);
7028 for (order
= 0; order
< MAX_ORDER
; order
++) {
7029 struct page
*page_head
= page
- (pfn
& ((1 << order
) - 1));
7031 if (PageBuddy(page_head
) && page_order(page_head
) >= order
)
7034 spin_unlock_irqrestore(&zone
->lock
, flags
);
7036 return order
< MAX_ORDER
;