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/module.h>
29 #include <linux/suspend.h>
30 #include <linux/pagevec.h>
31 #include <linux/blkdev.h>
32 #include <linux/slab.h>
33 #include <linux/ratelimit.h>
34 #include <linux/oom.h>
35 #include <linux/notifier.h>
36 #include <linux/topology.h>
37 #include <linux/sysctl.h>
38 #include <linux/cpu.h>
39 #include <linux/cpuset.h>
40 #include <linux/memory_hotplug.h>
41 #include <linux/nodemask.h>
42 #include <linux/vmalloc.h>
43 #include <linux/vmstat.h>
44 #include <linux/mempolicy.h>
45 #include <linux/stop_machine.h>
46 #include <linux/sort.h>
47 #include <linux/pfn.h>
48 #include <linux/backing-dev.h>
49 #include <linux/fault-inject.h>
50 #include <linux/page-isolation.h>
51 #include <linux/page_cgroup.h>
52 #include <linux/debugobjects.h>
53 #include <linux/kmemleak.h>
54 #include <linux/compaction.h>
55 #include <trace/events/kmem.h>
56 #include <linux/ftrace_event.h>
57 #include <linux/memcontrol.h>
58 #include <linux/prefetch.h>
59 #include <linux/migrate.h>
60 #include <linux/page-debug-flags.h>
62 #include <asm/tlbflush.h>
63 #include <asm/div64.h>
66 #ifdef CONFIG_USE_PERCPU_NUMA_NODE_ID
67 DEFINE_PER_CPU(int, numa_node);
68 EXPORT_PER_CPU_SYMBOL(numa_node);
71 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
73 * N.B., Do NOT reference the '_numa_mem_' per cpu variable directly.
74 * It will not be defined when CONFIG_HAVE_MEMORYLESS_NODES is not defined.
75 * Use the accessor functions set_numa_mem(), numa_mem_id() and cpu_to_mem()
76 * defined in <linux/topology.h>.
78 DEFINE_PER_CPU(int, _numa_mem_); /* Kernel "local memory" node */
79 EXPORT_PER_CPU_SYMBOL(_numa_mem_);
83 * Array of node states.
85 nodemask_t node_states[NR_NODE_STATES] __read_mostly = {
86 [N_POSSIBLE] = NODE_MASK_ALL,
87 [N_ONLINE] = { { [0] = 1UL } },
89 [N_NORMAL_MEMORY] = { { [0] = 1UL } },
91 [N_HIGH_MEMORY] = { { [0] = 1UL } },
93 [N_CPU] = { { [0] = 1UL } },
96 EXPORT_SYMBOL(node_states);
98 unsigned long totalram_pages __read_mostly;
99 unsigned long totalreserve_pages __read_mostly;
101 * When calculating the number of globally allowed dirty pages, there
102 * is a certain number of per-zone reserves that should not be
103 * considered dirtyable memory. This is the sum of those reserves
104 * over all existing zones that contribute dirtyable memory.
106 unsigned long dirty_balance_reserve __read_mostly;
108 int percpu_pagelist_fraction;
109 gfp_t gfp_allowed_mask __read_mostly = GFP_BOOT_MASK;
111 #ifdef CONFIG_PM_SLEEP
113 * The following functions are used by the suspend/hibernate code to temporarily
114 * change gfp_allowed_mask in order to avoid using I/O during memory allocations
115 * while devices are suspended. To avoid races with the suspend/hibernate code,
116 * they should always be called with pm_mutex held (gfp_allowed_mask also should
117 * only be modified with pm_mutex held, unless the suspend/hibernate code is
118 * guaranteed not to run in parallel with that modification).
121 static gfp_t saved_gfp_mask;
123 void pm_restore_gfp_mask(void)
125 WARN_ON(!mutex_is_locked(&pm_mutex));
126 if (saved_gfp_mask) {
127 gfp_allowed_mask = saved_gfp_mask;
132 void pm_restrict_gfp_mask(void)
134 WARN_ON(!mutex_is_locked(&pm_mutex));
135 WARN_ON(saved_gfp_mask);
136 saved_gfp_mask = gfp_allowed_mask;
137 gfp_allowed_mask &= ~GFP_IOFS;
140 bool pm_suspended_storage(void)
142 if ((gfp_allowed_mask & GFP_IOFS) == GFP_IOFS)
146 #endif /* CONFIG_PM_SLEEP */
148 #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
149 int pageblock_order __read_mostly;
152 static void __free_pages_ok(struct page *page, unsigned int order);
155 * results with 256, 32 in the lowmem_reserve sysctl:
156 * 1G machine -> (16M dma, 800M-16M normal, 1G-800M high)
157 * 1G machine -> (16M dma, 784M normal, 224M high)
158 * NORMAL allocation will leave 784M/256 of ram reserved in the ZONE_DMA
159 * HIGHMEM allocation will leave 224M/32 of ram reserved in ZONE_NORMAL
160 * HIGHMEM allocation will (224M+784M)/256 of ram reserved in ZONE_DMA
162 * TBD: should special case ZONE_DMA32 machines here - in those we normally
163 * don't need any ZONE_NORMAL reservation
165 int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES-1] = {
166 #ifdef CONFIG_ZONE_DMA
169 #ifdef CONFIG_ZONE_DMA32
172 #ifdef CONFIG_HIGHMEM
178 EXPORT_SYMBOL(totalram_pages);
180 static char * const zone_names[MAX_NR_ZONES] = {
181 #ifdef CONFIG_ZONE_DMA
184 #ifdef CONFIG_ZONE_DMA32
188 #ifdef CONFIG_HIGHMEM
194 int min_free_kbytes = 1024;
196 static unsigned long __meminitdata nr_kernel_pages;
197 static unsigned long __meminitdata nr_all_pages;
198 static unsigned long __meminitdata dma_reserve;
200 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
201 static unsigned long __meminitdata arch_zone_lowest_possible_pfn[MAX_NR_ZONES];
202 static unsigned long __meminitdata arch_zone_highest_possible_pfn[MAX_NR_ZONES];
203 static unsigned long __initdata required_kernelcore;
204 static unsigned long __initdata required_movablecore;
205 static unsigned long __meminitdata zone_movable_pfn[MAX_NUMNODES];
207 /* movable_zone is the "real" zone pages in ZONE_MOVABLE are taken from */
209 EXPORT_SYMBOL(movable_zone);
210 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
213 int nr_node_ids __read_mostly = MAX_NUMNODES;
214 int nr_online_nodes __read_mostly = 1;
215 EXPORT_SYMBOL(nr_node_ids);
216 EXPORT_SYMBOL(nr_online_nodes);
219 int page_group_by_mobility_disabled __read_mostly;
223 * Don't use set_pageblock_migratetype(page, MIGRATE_ISOLATE) directly.
224 * Instead, use {un}set_pageblock_isolate.
226 void set_pageblock_migratetype(struct page *page, int migratetype)
229 if (unlikely(page_group_by_mobility_disabled))
230 migratetype = MIGRATE_UNMOVABLE;
232 set_pageblock_flags_group(page, (unsigned long)migratetype,
233 PB_migrate, PB_migrate_end);
236 bool oom_killer_disabled __read_mostly;
238 #ifdef CONFIG_DEBUG_VM
239 static int page_outside_zone_boundaries(struct zone *zone, struct page *page)
243 unsigned long pfn = page_to_pfn(page);
246 seq = zone_span_seqbegin(zone);
247 if (pfn >= zone->zone_start_pfn + zone->spanned_pages)
249 else if (pfn < zone->zone_start_pfn)
251 } while (zone_span_seqretry(zone, seq));
256 static int page_is_consistent(struct zone *zone, struct page *page)
258 if (!pfn_valid_within(page_to_pfn(page)))
260 if (zone != page_zone(page))
266 * Temporary debugging check for pages not lying within a given zone.
268 static int bad_range(struct zone *zone, struct page *page)
270 if (page_outside_zone_boundaries(zone, page))
272 if (!page_is_consistent(zone, page))
278 static inline int bad_range(struct zone *zone, struct page *page)
284 static void bad_page(struct page *page)
286 static unsigned long resume;
287 static unsigned long nr_shown;
288 static unsigned long nr_unshown;
290 /* Don't complain about poisoned pages */
291 if (PageHWPoison(page)) {
292 reset_page_mapcount(page); /* remove PageBuddy */
297 * Allow a burst of 60 reports, then keep quiet for that minute;
298 * or allow a steady drip of one report per second.
300 if (nr_shown == 60) {
301 if (time_before(jiffies, resume)) {
307 "BUG: Bad page state: %lu messages suppressed\n",
314 resume = jiffies + 60 * HZ;
316 printk(KERN_ALERT "BUG: Bad page state in process %s pfn:%05lx\n",
317 current->comm, page_to_pfn(page));
323 /* Leave bad fields for debug, except PageBuddy could make trouble */
324 reset_page_mapcount(page); /* remove PageBuddy */
325 add_taint(TAINT_BAD_PAGE);
329 * Higher-order pages are called "compound pages". They are structured thusly:
331 * The first PAGE_SIZE page is called the "head page".
333 * The remaining PAGE_SIZE pages are called "tail pages".
335 * All pages have PG_compound set. All tail pages have their ->first_page
336 * pointing at the head page.
338 * The first tail page's ->lru.next holds the address of the compound page's
339 * put_page() function. Its ->lru.prev holds the order of allocation.
340 * This usage means that zero-order pages may not be compound.
343 static void free_compound_page(struct page *page)
345 __free_pages_ok(page, compound_order(page));
348 void prep_compound_page(struct page *page, unsigned long order)
351 int nr_pages = 1 << order;
353 set_compound_page_dtor(page, free_compound_page);
354 set_compound_order(page, order);
356 for (i = 1; i < nr_pages; i++) {
357 struct page *p = page + i;
359 set_page_count(p, 0);
360 p->first_page = page;
364 /* update __split_huge_page_refcount if you change this function */
365 static int destroy_compound_page(struct page *page, unsigned long order)
368 int nr_pages = 1 << order;
371 if (unlikely(compound_order(page) != order) ||
372 unlikely(!PageHead(page))) {
377 __ClearPageHead(page);
379 for (i = 1; i < nr_pages; i++) {
380 struct page *p = page + i;
382 if (unlikely(!PageTail(p) || (p->first_page != page))) {
392 static inline void prep_zero_page(struct page *page, int order, gfp_t gfp_flags)
397 * clear_highpage() will use KM_USER0, so it's a bug to use __GFP_ZERO
398 * and __GFP_HIGHMEM from hard or soft interrupt context.
400 VM_BUG_ON((gfp_flags & __GFP_HIGHMEM) && in_interrupt());
401 for (i = 0; i < (1 << order); i++)
402 clear_highpage(page + i);
405 #ifdef CONFIG_DEBUG_PAGEALLOC
406 unsigned int _debug_guardpage_minorder;
408 static int __init debug_guardpage_minorder_setup(char *buf)
412 if (kstrtoul(buf, 10, &res) < 0 || res > MAX_ORDER / 2) {
413 printk(KERN_ERR "Bad debug_guardpage_minorder value\n");
416 _debug_guardpage_minorder = res;
417 printk(KERN_INFO "Setting debug_guardpage_minorder to %lu\n", res);
420 __setup("debug_guardpage_minorder=", debug_guardpage_minorder_setup);
422 static inline void set_page_guard_flag(struct page *page)
424 __set_bit(PAGE_DEBUG_FLAG_GUARD, &page->debug_flags);
427 static inline void clear_page_guard_flag(struct page *page)
429 __clear_bit(PAGE_DEBUG_FLAG_GUARD, &page->debug_flags);
432 static inline void set_page_guard_flag(struct page *page) { }
433 static inline void clear_page_guard_flag(struct page *page) { }
436 static inline void set_page_order(struct page *page, int order)
438 set_page_private(page, order);
439 __SetPageBuddy(page);
442 static inline void rmv_page_order(struct page *page)
444 __ClearPageBuddy(page);
445 set_page_private(page, 0);
449 * Locate the struct page for both the matching buddy in our
450 * pair (buddy1) and the combined O(n+1) page they form (page).
452 * 1) Any buddy B1 will have an order O twin B2 which satisfies
453 * the following equation:
455 * For example, if the starting buddy (buddy2) is #8 its order
457 * B2 = 8 ^ (1 << 1) = 8 ^ 2 = 10
459 * 2) Any buddy B will have an order O+1 parent P which
460 * satisfies the following equation:
463 * Assumption: *_mem_map is contiguous at least up to MAX_ORDER
465 static inline unsigned long
466 __find_buddy_index(unsigned long page_idx, unsigned int order)
468 return page_idx ^ (1 << order);
472 * This function checks whether a page is free && is the buddy
473 * we can do coalesce a page and its buddy if
474 * (a) the buddy is not in a hole &&
475 * (b) the buddy is in the buddy system &&
476 * (c) a page and its buddy have the same order &&
477 * (d) a page and its buddy are in the same zone.
479 * For recording whether a page is in the buddy system, we set ->_mapcount -2.
480 * Setting, clearing, and testing _mapcount -2 is serialized by zone->lock.
482 * For recording page's order, we use page_private(page).
484 static inline int page_is_buddy(struct page *page, struct page *buddy,
487 if (!pfn_valid_within(page_to_pfn(buddy)))
490 if (page_zone_id(page) != page_zone_id(buddy))
493 if (page_is_guard(buddy) && page_order(buddy) == order) {
494 VM_BUG_ON(page_count(buddy) != 0);
498 if (PageBuddy(buddy) && page_order(buddy) == order) {
499 VM_BUG_ON(page_count(buddy) != 0);
506 * Freeing function for a buddy system allocator.
508 * The concept of a buddy system is to maintain direct-mapped table
509 * (containing bit values) for memory blocks of various "orders".
510 * The bottom level table contains the map for the smallest allocatable
511 * units of memory (here, pages), and each level above it describes
512 * pairs of units from the levels below, hence, "buddies".
513 * At a high level, all that happens here is marking the table entry
514 * at the bottom level available, and propagating the changes upward
515 * as necessary, plus some accounting needed to play nicely with other
516 * parts of the VM system.
517 * At each level, we keep a list of pages, which are heads of continuous
518 * free pages of length of (1 << order) and marked with _mapcount -2. Page's
519 * order is recorded in page_private(page) field.
520 * So when we are allocating or freeing one, we can derive the state of the
521 * other. That is, if we allocate a small block, and both were
522 * free, the remainder of the region must be split into blocks.
523 * If a block is freed, and its buddy is also free, then this
524 * triggers coalescing into a block of larger size.
529 static inline void __free_one_page(struct page *page,
530 struct zone *zone, unsigned int order,
533 unsigned long page_idx;
534 unsigned long combined_idx;
535 unsigned long uninitialized_var(buddy_idx);
538 if (unlikely(PageCompound(page)))
539 if (unlikely(destroy_compound_page(page, order)))
542 VM_BUG_ON(migratetype == -1);
544 page_idx = page_to_pfn(page) & ((1 << MAX_ORDER) - 1);
546 VM_BUG_ON(page_idx & ((1 << order) - 1));
547 VM_BUG_ON(bad_range(zone, page));
549 while (order < MAX_ORDER-1) {
550 buddy_idx = __find_buddy_index(page_idx, order);
551 buddy = page + (buddy_idx - page_idx);
552 if (!page_is_buddy(page, buddy, order))
555 * Our buddy is free or it is CONFIG_DEBUG_PAGEALLOC guard page,
556 * merge with it and move up one order.
558 if (page_is_guard(buddy)) {
559 clear_page_guard_flag(buddy);
560 set_page_private(page, 0);
561 __mod_zone_freepage_state(zone, 1 << order,
564 list_del(&buddy->lru);
565 zone->free_area[order].nr_free--;
566 rmv_page_order(buddy);
568 combined_idx = buddy_idx & page_idx;
569 page = page + (combined_idx - page_idx);
570 page_idx = combined_idx;
573 set_page_order(page, order);
576 * If this is not the largest possible page, check if the buddy
577 * of the next-highest order is free. If it is, it's possible
578 * that pages are being freed that will coalesce soon. In case,
579 * that is happening, add the free page to the tail of the list
580 * so it's less likely to be used soon and more likely to be merged
581 * as a higher order page
583 if ((order < MAX_ORDER-2) && pfn_valid_within(page_to_pfn(buddy))) {
584 struct page *higher_page, *higher_buddy;
585 combined_idx = buddy_idx & page_idx;
586 higher_page = page + (combined_idx - page_idx);
587 buddy_idx = __find_buddy_index(combined_idx, order + 1);
588 higher_buddy = higher_page + (buddy_idx - combined_idx);
589 if (page_is_buddy(higher_page, higher_buddy, order + 1)) {
590 list_add_tail(&page->lru,
591 &zone->free_area[order].free_list[migratetype]);
596 list_add(&page->lru, &zone->free_area[order].free_list[migratetype]);
598 zone->free_area[order].nr_free++;
602 * free_page_mlock() -- clean up attempts to free and mlocked() page.
603 * Page should not be on lru, so no need to fix that up.
604 * free_pages_check() will verify...
606 static inline void free_page_mlock(struct page *page)
608 __dec_zone_page_state(page, NR_MLOCK);
609 __count_vm_event(UNEVICTABLE_MLOCKFREED);
612 static inline int free_pages_check(struct page *page)
614 if (unlikely(page_mapcount(page) |
615 (page->mapping != NULL) |
616 (atomic_read(&page->_count) != 0) |
617 (page->flags & PAGE_FLAGS_CHECK_AT_FREE) |
618 (mem_cgroup_bad_page_check(page)))) {
622 if (page->flags & PAGE_FLAGS_CHECK_AT_PREP)
623 page->flags &= ~PAGE_FLAGS_CHECK_AT_PREP;
628 * Frees a number of pages from the PCP lists
629 * Assumes all pages on list are in same zone, and of same order.
630 * count is the number of pages to free.
632 * If the zone was previously in an "all pages pinned" state then look to
633 * see if this freeing clears that state.
635 * And clear the zone's pages_scanned counter, to hold off the "all pages are
636 * pinned" detection logic.
638 static void free_pcppages_bulk(struct zone *zone, int count,
639 struct per_cpu_pages *pcp)
645 spin_lock(&zone->lock);
646 zone->all_unreclaimable = 0;
647 zone->pages_scanned = 0;
651 struct list_head *list;
654 * Remove pages from lists in a round-robin fashion. A
655 * batch_free count is maintained that is incremented when an
656 * empty list is encountered. This is so more pages are freed
657 * off fuller lists instead of spinning excessively around empty
662 if (++migratetype == MIGRATE_PCPTYPES)
664 list = &pcp->lists[migratetype];
665 } while (list_empty(list));
667 /* This is the only non-empty list. Free them all. */
668 if (batch_free == MIGRATE_PCPTYPES)
669 batch_free = to_free;
672 int mt; /* migratetype of the to-be-freed page */
674 page = list_entry(list->prev, struct page, lru);
675 /* must delete as __free_one_page list manipulates */
676 list_del(&page->lru);
677 mt = page_private(page);
678 /* MIGRATE_MOVABLE list may include MIGRATE_RESERVEs */
679 __free_one_page(page, zone, 0, mt);
680 trace_mm_page_pcpu_drain(page, 0, mt);
681 if (is_migrate_cma(mt))
682 __mod_zone_page_state(zone, NR_FREE_CMA_PAGES, 1);
683 } while (--to_free && --batch_free && !list_empty(list));
685 __mod_zone_page_state(zone, NR_FREE_PAGES, count);
686 spin_unlock(&zone->lock);
689 static void free_one_page(struct zone *zone, struct page *page, int order,
692 spin_lock(&zone->lock);
693 zone->all_unreclaimable = 0;
694 zone->pages_scanned = 0;
696 __free_one_page(page, zone, order, migratetype);
697 if (unlikely(migratetype != MIGRATE_ISOLATE))
698 __mod_zone_freepage_state(zone, 1 << order, migratetype);
699 spin_unlock(&zone->lock);
702 static bool free_pages_prepare(struct page *page, unsigned int order)
707 trace_mm_page_free(page, order);
708 kmemcheck_free_shadow(page, order);
711 page->mapping = NULL;
712 for (i = 0; i < (1 << order); i++)
713 bad += free_pages_check(page + i);
717 if (!PageHighMem(page)) {
718 debug_check_no_locks_freed(page_address(page),PAGE_SIZE<<order);
719 debug_check_no_obj_freed(page_address(page),
722 arch_free_page(page, order);
723 kernel_map_pages(page, 1 << order, 0);
728 static void __free_pages_ok(struct page *page, unsigned int order)
731 int wasMlocked = __TestClearPageMlocked(page);
733 if (!free_pages_prepare(page, order))
736 local_irq_save(flags);
737 if (unlikely(wasMlocked))
738 free_page_mlock(page);
739 __count_vm_events(PGFREE, 1 << order);
740 free_one_page(page_zone(page), page, order,
741 get_pageblock_migratetype(page));
742 local_irq_restore(flags);
745 void __meminit __free_pages_bootmem(struct page *page, unsigned int order)
747 unsigned int nr_pages = 1 << order;
751 for (loop = 0; loop < nr_pages; loop++) {
752 struct page *p = &page[loop];
754 if (loop + 1 < nr_pages)
756 __ClearPageReserved(p);
757 set_page_count(p, 0);
760 set_page_refcounted(page);
761 __free_pages(page, order);
765 /* Free whole pageblock and set it's migration type to MIGRATE_CMA. */
766 void __init init_cma_reserved_pageblock(struct page *page)
768 unsigned i = pageblock_nr_pages;
769 struct page *p = page;
772 __ClearPageReserved(p);
773 set_page_count(p, 0);
776 set_page_refcounted(page);
777 set_pageblock_migratetype(page, MIGRATE_CMA);
778 __free_pages(page, pageblock_order);
779 totalram_pages += pageblock_nr_pages;
784 * The order of subdivision here is critical for the IO subsystem.
785 * Please do not alter this order without good reasons and regression
786 * testing. Specifically, as large blocks of memory are subdivided,
787 * the order in which smaller blocks are delivered depends on the order
788 * they're subdivided in this function. This is the primary factor
789 * influencing the order in which pages are delivered to the IO
790 * subsystem according to empirical testing, and this is also justified
791 * by considering the behavior of a buddy system containing a single
792 * large block of memory acted on by a series of small allocations.
793 * This behavior is a critical factor in sglist merging's success.
797 static inline void expand(struct zone *zone, struct page *page,
798 int low, int high, struct free_area *area,
801 unsigned long size = 1 << high;
807 VM_BUG_ON(bad_range(zone, &page[size]));
809 #ifdef CONFIG_DEBUG_PAGEALLOC
810 if (high < debug_guardpage_minorder()) {
812 * Mark as guard pages (or page), that will allow to
813 * merge back to allocator when buddy will be freed.
814 * Corresponding page table entries will not be touched,
815 * pages will stay not present in virtual address space
817 INIT_LIST_HEAD(&page[size].lru);
818 set_page_guard_flag(&page[size]);
819 set_page_private(&page[size], high);
820 /* Guard pages are not available for any usage */
821 __mod_zone_freepage_state(zone, -(1 << high),
826 list_add(&page[size].lru, &area->free_list[migratetype]);
828 set_page_order(&page[size], high);
833 * This page is about to be returned from the page allocator
835 static inline int check_new_page(struct page *page)
837 if (unlikely(page_mapcount(page) |
838 (page->mapping != NULL) |
839 (atomic_read(&page->_count) != 0) |
840 (page->flags & PAGE_FLAGS_CHECK_AT_PREP) |
841 (mem_cgroup_bad_page_check(page)))) {
848 static int prep_new_page(struct page *page, int order, gfp_t gfp_flags)
852 for (i = 0; i < (1 << order); i++) {
853 struct page *p = page + i;
854 if (unlikely(check_new_page(p)))
858 set_page_private(page, 0);
859 set_page_refcounted(page);
861 arch_alloc_page(page, order);
862 kernel_map_pages(page, 1 << order, 1);
864 if (gfp_flags & __GFP_ZERO)
865 prep_zero_page(page, order, gfp_flags);
867 if (order && (gfp_flags & __GFP_COMP))
868 prep_compound_page(page, order);
874 * Go through the free lists for the given migratetype and remove
875 * the smallest available page from the freelists
878 struct page *__rmqueue_smallest(struct zone *zone, unsigned int order,
881 unsigned int current_order;
882 struct free_area * area;
885 /* Find a page of the appropriate size in the preferred list */
886 for (current_order = order; current_order < MAX_ORDER; ++current_order) {
887 area = &(zone->free_area[current_order]);
888 if (list_empty(&area->free_list[migratetype]))
891 page = list_entry(area->free_list[migratetype].next,
893 list_del(&page->lru);
894 rmv_page_order(page);
896 expand(zone, page, order, current_order, area, migratetype);
905 * This array describes the order lists are fallen back to when
906 * the free lists for the desirable migrate type are depleted
908 static int fallbacks[MIGRATE_TYPES][4] = {
909 [MIGRATE_UNMOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_MOVABLE, MIGRATE_RESERVE },
910 [MIGRATE_RECLAIMABLE] = { MIGRATE_UNMOVABLE, MIGRATE_MOVABLE, MIGRATE_RESERVE },
912 [MIGRATE_MOVABLE] = { MIGRATE_CMA, MIGRATE_RECLAIMABLE, MIGRATE_UNMOVABLE, MIGRATE_RESERVE },
913 [MIGRATE_CMA] = { MIGRATE_RESERVE }, /* Never used */
915 [MIGRATE_MOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_UNMOVABLE, MIGRATE_RESERVE },
917 [MIGRATE_RESERVE] = { MIGRATE_RESERVE }, /* Never used */
918 [MIGRATE_ISOLATE] = { MIGRATE_RESERVE }, /* Never used */
922 * Move the free pages in a range to the free lists of the requested type.
923 * Note that start_page and end_pages are not aligned on a pageblock
924 * boundary. If alignment is required, use move_freepages_block()
926 static int move_freepages(struct zone *zone,
927 struct page *start_page, struct page *end_page,
934 #ifndef CONFIG_HOLES_IN_ZONE
936 * page_zone is not safe to call in this context when
937 * CONFIG_HOLES_IN_ZONE is set. This bug check is probably redundant
938 * anyway as we check zone boundaries in move_freepages_block().
939 * Remove at a later date when no bug reports exist related to
940 * grouping pages by mobility
942 BUG_ON(page_zone(start_page) != page_zone(end_page));
945 for (page = start_page; page <= end_page;) {
946 /* Make sure we are not inadvertently changing nodes */
947 VM_BUG_ON(page_to_nid(page) != zone_to_nid(zone));
949 if (!pfn_valid_within(page_to_pfn(page))) {
954 if (!PageBuddy(page)) {
959 order = page_order(page);
960 list_move(&page->lru,
961 &zone->free_area[order].free_list[migratetype]);
963 pages_moved += 1 << order;
969 int move_freepages_block(struct zone *zone, struct page *page,
972 unsigned long start_pfn, end_pfn;
973 struct page *start_page, *end_page;
975 start_pfn = page_to_pfn(page);
976 start_pfn = start_pfn & ~(pageblock_nr_pages-1);
977 start_page = pfn_to_page(start_pfn);
978 end_page = start_page + pageblock_nr_pages - 1;
979 end_pfn = start_pfn + pageblock_nr_pages - 1;
981 /* Do not cross zone boundaries */
982 if (start_pfn < zone->zone_start_pfn)
984 if (end_pfn >= zone->zone_start_pfn + zone->spanned_pages)
987 return move_freepages(zone, start_page, end_page, migratetype);
990 static void change_pageblock_range(struct page *pageblock_page,
991 int start_order, int migratetype)
993 int nr_pageblocks = 1 << (start_order - pageblock_order);
995 while (nr_pageblocks--) {
996 set_pageblock_migratetype(pageblock_page, migratetype);
997 pageblock_page += pageblock_nr_pages;
1001 /* Remove an element from the buddy allocator from the fallback list */
1002 static inline struct page *
1003 __rmqueue_fallback(struct zone *zone, int order, int start_migratetype)
1005 struct free_area * area;
1010 /* Find the largest possible block of pages in the other list */
1011 for (current_order = MAX_ORDER-1; current_order >= order;
1014 migratetype = fallbacks[start_migratetype][i];
1016 /* MIGRATE_RESERVE handled later if necessary */
1017 if (migratetype == MIGRATE_RESERVE)
1020 area = &(zone->free_area[current_order]);
1021 if (list_empty(&area->free_list[migratetype]))
1024 page = list_entry(area->free_list[migratetype].next,
1029 * If breaking a large block of pages, move all free
1030 * pages to the preferred allocation list. If falling
1031 * back for a reclaimable kernel allocation, be more
1032 * aggressive about taking ownership of free pages
1034 * On the other hand, never change migration
1035 * type of MIGRATE_CMA pageblocks nor move CMA
1036 * pages on different free lists. We don't
1037 * want unmovable pages to be allocated from
1038 * MIGRATE_CMA areas.
1040 if (!is_migrate_cma(migratetype) &&
1041 (unlikely(current_order >= pageblock_order / 2) ||
1042 start_migratetype == MIGRATE_RECLAIMABLE ||
1043 page_group_by_mobility_disabled)) {
1045 pages = move_freepages_block(zone, page,
1048 /* Claim the whole block if over half of it is free */
1049 if (pages >= (1 << (pageblock_order-1)) ||
1050 page_group_by_mobility_disabled)
1051 set_pageblock_migratetype(page,
1054 migratetype = start_migratetype;
1057 /* Remove the page from the freelists */
1058 list_del(&page->lru);
1059 rmv_page_order(page);
1061 /* Take ownership for orders >= pageblock_order */
1062 if (current_order >= pageblock_order &&
1063 !is_migrate_cma(migratetype))
1064 change_pageblock_range(page, current_order,
1067 expand(zone, page, order, current_order, area,
1068 is_migrate_cma(migratetype)
1069 ? migratetype : start_migratetype);
1071 trace_mm_page_alloc_extfrag(page, order, current_order,
1072 start_migratetype, migratetype);
1082 * Do the hard work of removing an element from the buddy allocator.
1083 * Call me with the zone->lock already held.
1085 static struct page *__rmqueue(struct zone *zone, unsigned int order,
1091 page = __rmqueue_smallest(zone, order, migratetype);
1093 if (unlikely(!page) && migratetype != MIGRATE_RESERVE) {
1094 page = __rmqueue_fallback(zone, order, migratetype);
1097 * Use MIGRATE_RESERVE rather than fail an allocation. goto
1098 * is used because __rmqueue_smallest is an inline function
1099 * and we want just one call site
1102 migratetype = MIGRATE_RESERVE;
1107 trace_mm_page_alloc_zone_locked(page, order, migratetype);
1112 * Obtain a specified number of elements from the buddy allocator, all under
1113 * a single hold of the lock, for efficiency. Add them to the supplied list.
1114 * Returns the number of new pages which were placed at *list.
1116 static int rmqueue_bulk(struct zone *zone, unsigned int order,
1117 unsigned long count, struct list_head *list,
1118 int migratetype, int cold)
1120 int mt = migratetype, i;
1122 spin_lock(&zone->lock);
1123 for (i = 0; i < count; ++i) {
1124 struct page *page = __rmqueue(zone, order, migratetype);
1125 if (unlikely(page == NULL))
1129 * Split buddy pages returned by expand() are received here
1130 * in physical page order. The page is added to the callers and
1131 * list and the list head then moves forward. From the callers
1132 * perspective, the linked list is ordered by page number in
1133 * some conditions. This is useful for IO devices that can
1134 * merge IO requests if the physical pages are ordered
1137 if (likely(cold == 0))
1138 list_add(&page->lru, list);
1140 list_add_tail(&page->lru, list);
1141 if (IS_ENABLED(CONFIG_CMA)) {
1142 mt = get_pageblock_migratetype(page);
1143 if (!is_migrate_cma(mt) && mt != MIGRATE_ISOLATE)
1146 set_page_private(page, mt);
1148 if (is_migrate_cma(mt))
1149 __mod_zone_page_state(zone, NR_FREE_CMA_PAGES,
1152 __mod_zone_page_state(zone, NR_FREE_PAGES, -(i << order));
1153 spin_unlock(&zone->lock);
1159 * Called from the vmstat counter updater to drain pagesets of this
1160 * currently executing processor on remote nodes after they have
1163 * Note that this function must be called with the thread pinned to
1164 * a single processor.
1166 void drain_zone_pages(struct zone *zone, struct per_cpu_pages *pcp)
1168 unsigned long flags;
1171 local_irq_save(flags);
1172 if (pcp->count >= pcp->batch)
1173 to_drain = pcp->batch;
1175 to_drain = pcp->count;
1177 free_pcppages_bulk(zone, to_drain, pcp);
1178 pcp->count -= to_drain;
1180 local_irq_restore(flags);
1185 * Drain pages of the indicated processor.
1187 * The processor must either be the current processor and the
1188 * thread pinned to the current processor or a processor that
1191 static void drain_pages(unsigned int cpu)
1193 unsigned long flags;
1196 for_each_populated_zone(zone) {
1197 struct per_cpu_pageset *pset;
1198 struct per_cpu_pages *pcp;
1200 local_irq_save(flags);
1201 pset = per_cpu_ptr(zone->pageset, cpu);
1205 free_pcppages_bulk(zone, pcp->count, pcp);
1208 local_irq_restore(flags);
1213 * Spill all of this CPU's per-cpu pages back into the buddy allocator.
1215 void drain_local_pages(void *arg)
1217 drain_pages(smp_processor_id());
1221 * Spill all the per-cpu pages from all CPUs back into the buddy allocator.
1223 * Note that this code is protected against sending an IPI to an offline
1224 * CPU but does not guarantee sending an IPI to newly hotplugged CPUs:
1225 * on_each_cpu_mask() blocks hotplug and won't talk to offlined CPUs but
1226 * nothing keeps CPUs from showing up after we populated the cpumask and
1227 * before the call to on_each_cpu_mask().
1229 void drain_all_pages(void)
1232 struct per_cpu_pageset *pcp;
1236 * Allocate in the BSS so we wont require allocation in
1237 * direct reclaim path for CONFIG_CPUMASK_OFFSTACK=y
1239 static cpumask_t cpus_with_pcps;
1242 * We don't care about racing with CPU hotplug event
1243 * as offline notification will cause the notified
1244 * cpu to drain that CPU pcps and on_each_cpu_mask
1245 * disables preemption as part of its processing
1247 for_each_online_cpu(cpu) {
1248 bool has_pcps = false;
1249 for_each_populated_zone(zone) {
1250 pcp = per_cpu_ptr(zone->pageset, cpu);
1251 if (pcp->pcp.count) {
1257 cpumask_set_cpu(cpu, &cpus_with_pcps);
1259 cpumask_clear_cpu(cpu, &cpus_with_pcps);
1261 on_each_cpu_mask(&cpus_with_pcps, drain_local_pages, NULL, 1);
1264 #ifdef CONFIG_HIBERNATION
1266 void mark_free_pages(struct zone *zone)
1268 unsigned long pfn, max_zone_pfn;
1269 unsigned long flags;
1271 struct list_head *curr;
1273 if (!zone->spanned_pages)
1276 spin_lock_irqsave(&zone->lock, flags);
1278 max_zone_pfn = zone->zone_start_pfn + zone->spanned_pages;
1279 for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
1280 if (pfn_valid(pfn)) {
1281 struct page *page = pfn_to_page(pfn);
1283 if (!swsusp_page_is_forbidden(page))
1284 swsusp_unset_page_free(page);
1287 for_each_migratetype_order(order, t) {
1288 list_for_each(curr, &zone->free_area[order].free_list[t]) {
1291 pfn = page_to_pfn(list_entry(curr, struct page, lru));
1292 for (i = 0; i < (1UL << order); i++)
1293 swsusp_set_page_free(pfn_to_page(pfn + i));
1296 spin_unlock_irqrestore(&zone->lock, flags);
1298 #endif /* CONFIG_PM */
1301 * Free a 0-order page
1302 * cold == 1 ? free a cold page : free a hot page
1304 void free_hot_cold_page(struct page *page, int cold)
1306 struct zone *zone = page_zone(page);
1307 struct per_cpu_pages *pcp;
1308 unsigned long flags;
1310 int wasMlocked = __TestClearPageMlocked(page);
1312 if (!free_pages_prepare(page, 0))
1315 migratetype = get_pageblock_migratetype(page);
1316 set_page_private(page, migratetype);
1317 local_irq_save(flags);
1318 if (unlikely(wasMlocked))
1319 free_page_mlock(page);
1320 __count_vm_event(PGFREE);
1323 * We only track unmovable, reclaimable and movable on pcp lists.
1324 * Free ISOLATE pages back to the allocator because they are being
1325 * offlined but treat RESERVE as movable pages so we can get those
1326 * areas back if necessary. Otherwise, we may have to free
1327 * excessively into the page allocator
1329 if (migratetype >= MIGRATE_PCPTYPES) {
1330 if (unlikely(migratetype == MIGRATE_ISOLATE)) {
1331 free_one_page(zone, page, 0, migratetype);
1334 migratetype = MIGRATE_MOVABLE;
1337 pcp = &this_cpu_ptr(zone->pageset)->pcp;
1339 list_add_tail(&page->lru, &pcp->lists[migratetype]);
1341 list_add(&page->lru, &pcp->lists[migratetype]);
1343 if (pcp->count >= pcp->high) {
1344 free_pcppages_bulk(zone, pcp->batch, pcp);
1345 pcp->count -= pcp->batch;
1349 local_irq_restore(flags);
1353 * Free a list of 0-order pages
1355 void free_hot_cold_page_list(struct list_head *list, int cold)
1357 struct page *page, *next;
1359 list_for_each_entry_safe(page, next, list, lru) {
1360 trace_mm_page_free_batched(page, cold);
1361 free_hot_cold_page(page, cold);
1366 * split_page takes a non-compound higher-order page, and splits it into
1367 * n (1<<order) sub-pages: page[0..n]
1368 * Each sub-page must be freed individually.
1370 * Note: this is probably too low level an operation for use in drivers.
1371 * Please consult with lkml before using this in your driver.
1373 void split_page(struct page *page, unsigned int order)
1377 VM_BUG_ON(PageCompound(page));
1378 VM_BUG_ON(!page_count(page));
1380 #ifdef CONFIG_KMEMCHECK
1382 * Split shadow pages too, because free(page[0]) would
1383 * otherwise free the whole shadow.
1385 if (kmemcheck_page_is_tracked(page))
1386 split_page(virt_to_page(page[0].shadow), order);
1389 for (i = 1; i < (1 << order); i++)
1390 set_page_refcounted(page + i);
1394 * Similar to the split_page family of functions except that the page
1395 * required at the given order and being isolated now to prevent races
1396 * with parallel allocators
1398 int capture_free_page(struct page *page, int alloc_order, int migratetype)
1401 unsigned long watermark;
1405 BUG_ON(!PageBuddy(page));
1407 zone = page_zone(page);
1408 order = page_order(page);
1410 /* Obey watermarks as if the page was being allocated */
1411 watermark = low_wmark_pages(zone) + (1 << order);
1412 if (!zone_watermark_ok(zone, 0, watermark, 0, 0))
1415 /* Remove page from free list */
1416 list_del(&page->lru);
1417 zone->free_area[order].nr_free--;
1418 rmv_page_order(page);
1420 mt = get_pageblock_migratetype(page);
1421 if (unlikely(mt != MIGRATE_ISOLATE))
1422 __mod_zone_freepage_state(zone, -(1UL << order), mt);
1424 if (alloc_order != order)
1425 expand(zone, page, alloc_order, order,
1426 &zone->free_area[order], migratetype);
1428 /* Set the pageblock if the captured page is at least a pageblock */
1429 if (order >= pageblock_order - 1) {
1430 struct page *endpage = page + (1 << order) - 1;
1431 for (; page < endpage; page += pageblock_nr_pages) {
1432 int mt = get_pageblock_migratetype(page);
1433 if (mt != MIGRATE_ISOLATE && !is_migrate_cma(mt))
1434 set_pageblock_migratetype(page,
1439 return 1UL << order;
1443 * Similar to split_page except the page is already free. As this is only
1444 * being used for migration, the migratetype of the block also changes.
1445 * As this is called with interrupts disabled, the caller is responsible
1446 * for calling arch_alloc_page() and kernel_map_page() after interrupts
1449 * Note: this is probably too low level an operation for use in drivers.
1450 * Please consult with lkml before using this in your driver.
1452 int split_free_page(struct page *page)
1457 BUG_ON(!PageBuddy(page));
1458 order = page_order(page);
1460 nr_pages = capture_free_page(page, order, 0);
1464 /* Split into individual pages */
1465 set_page_refcounted(page);
1466 split_page(page, order);
1471 * Really, prep_compound_page() should be called from __rmqueue_bulk(). But
1472 * we cheat by calling it from here, in the order > 0 path. Saves a branch
1476 struct page *buffered_rmqueue(struct zone *preferred_zone,
1477 struct zone *zone, int order, gfp_t gfp_flags,
1480 unsigned long flags;
1482 int cold = !!(gfp_flags & __GFP_COLD);
1485 if (likely(order == 0)) {
1486 struct per_cpu_pages *pcp;
1487 struct list_head *list;
1489 local_irq_save(flags);
1490 pcp = &this_cpu_ptr(zone->pageset)->pcp;
1491 list = &pcp->lists[migratetype];
1492 if (list_empty(list)) {
1493 pcp->count += rmqueue_bulk(zone, 0,
1496 if (unlikely(list_empty(list)))
1501 page = list_entry(list->prev, struct page, lru);
1503 page = list_entry(list->next, struct page, lru);
1505 list_del(&page->lru);
1508 if (unlikely(gfp_flags & __GFP_NOFAIL)) {
1510 * __GFP_NOFAIL is not to be used in new code.
1512 * All __GFP_NOFAIL callers should be fixed so that they
1513 * properly detect and handle allocation failures.
1515 * We most definitely don't want callers attempting to
1516 * allocate greater than order-1 page units with
1519 WARN_ON_ONCE(order > 1);
1521 spin_lock_irqsave(&zone->lock, flags);
1522 page = __rmqueue(zone, order, migratetype);
1523 spin_unlock(&zone->lock);
1526 __mod_zone_freepage_state(zone, -(1 << order),
1527 get_pageblock_migratetype(page));
1530 __count_zone_vm_events(PGALLOC, zone, 1 << order);
1531 zone_statistics(preferred_zone, zone, gfp_flags);
1532 local_irq_restore(flags);
1534 VM_BUG_ON(bad_range(zone, page));
1535 if (prep_new_page(page, order, gfp_flags))
1540 local_irq_restore(flags);
1544 /* The ALLOC_WMARK bits are used as an index to zone->watermark */
1545 #define ALLOC_WMARK_MIN WMARK_MIN
1546 #define ALLOC_WMARK_LOW WMARK_LOW
1547 #define ALLOC_WMARK_HIGH WMARK_HIGH
1548 #define ALLOC_NO_WATERMARKS 0x04 /* don't check watermarks at all */
1550 /* Mask to get the watermark bits */
1551 #define ALLOC_WMARK_MASK (ALLOC_NO_WATERMARKS-1)
1553 #define ALLOC_HARDER 0x10 /* try to alloc harder */
1554 #define ALLOC_HIGH 0x20 /* __GFP_HIGH set */
1555 #define ALLOC_CPUSET 0x40 /* check for correct cpuset */
1557 #ifdef CONFIG_FAIL_PAGE_ALLOC
1560 struct fault_attr attr;
1562 u32 ignore_gfp_highmem;
1563 u32 ignore_gfp_wait;
1565 } fail_page_alloc = {
1566 .attr = FAULT_ATTR_INITIALIZER,
1567 .ignore_gfp_wait = 1,
1568 .ignore_gfp_highmem = 1,
1572 static int __init setup_fail_page_alloc(char *str)
1574 return setup_fault_attr(&fail_page_alloc.attr, str);
1576 __setup("fail_page_alloc=", setup_fail_page_alloc);
1578 static bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
1580 if (order < fail_page_alloc.min_order)
1582 if (gfp_mask & __GFP_NOFAIL)
1584 if (fail_page_alloc.ignore_gfp_highmem && (gfp_mask & __GFP_HIGHMEM))
1586 if (fail_page_alloc.ignore_gfp_wait && (gfp_mask & __GFP_WAIT))
1589 return should_fail(&fail_page_alloc.attr, 1 << order);
1592 #ifdef CONFIG_FAULT_INJECTION_DEBUG_FS
1594 static int __init fail_page_alloc_debugfs(void)
1596 umode_t mode = S_IFREG | S_IRUSR | S_IWUSR;
1599 dir = fault_create_debugfs_attr("fail_page_alloc", NULL,
1600 &fail_page_alloc.attr);
1602 return PTR_ERR(dir);
1604 if (!debugfs_create_bool("ignore-gfp-wait", mode, dir,
1605 &fail_page_alloc.ignore_gfp_wait))
1607 if (!debugfs_create_bool("ignore-gfp-highmem", mode, dir,
1608 &fail_page_alloc.ignore_gfp_highmem))
1610 if (!debugfs_create_u32("min-order", mode, dir,
1611 &fail_page_alloc.min_order))
1616 debugfs_remove_recursive(dir);
1621 late_initcall(fail_page_alloc_debugfs);
1623 #endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */
1625 #else /* CONFIG_FAIL_PAGE_ALLOC */
1627 static inline bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
1632 #endif /* CONFIG_FAIL_PAGE_ALLOC */
1635 * Return true if free pages are above 'mark'. This takes into account the order
1636 * of the allocation.
1638 static bool __zone_watermark_ok(struct zone *z, int order, unsigned long mark,
1639 int classzone_idx, int alloc_flags, long free_pages)
1641 /* free_pages my go negative - that's OK */
1643 long lowmem_reserve = z->lowmem_reserve[classzone_idx];
1646 free_pages -= (1 << order) - 1;
1647 if (alloc_flags & ALLOC_HIGH)
1649 if (alloc_flags & ALLOC_HARDER)
1652 if (free_pages <= min + lowmem_reserve)
1654 for (o = 0; o < order; o++) {
1655 /* At the next order, this order's pages become unavailable */
1656 free_pages -= z->free_area[o].nr_free << o;
1658 /* Require fewer higher order pages to be free */
1661 if (free_pages <= min)
1667 #ifdef CONFIG_MEMORY_ISOLATION
1668 static inline unsigned long nr_zone_isolate_freepages(struct zone *zone)
1670 if (unlikely(zone->nr_pageblock_isolate))
1671 return zone->nr_pageblock_isolate * pageblock_nr_pages;
1675 static inline unsigned long nr_zone_isolate_freepages(struct zone *zone)
1681 bool zone_watermark_ok(struct zone *z, int order, unsigned long mark,
1682 int classzone_idx, int alloc_flags)
1684 return __zone_watermark_ok(z, order, mark, classzone_idx, alloc_flags,
1685 zone_page_state(z, NR_FREE_PAGES));
1688 bool zone_watermark_ok_safe(struct zone *z, int order, unsigned long mark,
1689 int classzone_idx, int alloc_flags)
1691 long free_pages = zone_page_state(z, NR_FREE_PAGES);
1693 if (z->percpu_drift_mark && free_pages < z->percpu_drift_mark)
1694 free_pages = zone_page_state_snapshot(z, NR_FREE_PAGES);
1697 * If the zone has MIGRATE_ISOLATE type free pages, we should consider
1698 * it. nr_zone_isolate_freepages is never accurate so kswapd might not
1699 * sleep although it could do so. But this is more desirable for memory
1700 * hotplug than sleeping which can cause a livelock in the direct
1703 free_pages -= nr_zone_isolate_freepages(z);
1704 return __zone_watermark_ok(z, order, mark, classzone_idx, alloc_flags,
1710 * zlc_setup - Setup for "zonelist cache". Uses cached zone data to
1711 * skip over zones that are not allowed by the cpuset, or that have
1712 * been recently (in last second) found to be nearly full. See further
1713 * comments in mmzone.h. Reduces cache footprint of zonelist scans
1714 * that have to skip over a lot of full or unallowed zones.
1716 * If the zonelist cache is present in the passed in zonelist, then
1717 * returns a pointer to the allowed node mask (either the current
1718 * tasks mems_allowed, or node_states[N_HIGH_MEMORY].)
1720 * If the zonelist cache is not available for this zonelist, does
1721 * nothing and returns NULL.
1723 * If the fullzones BITMAP in the zonelist cache is stale (more than
1724 * a second since last zap'd) then we zap it out (clear its bits.)
1726 * We hold off even calling zlc_setup, until after we've checked the
1727 * first zone in the zonelist, on the theory that most allocations will
1728 * be satisfied from that first zone, so best to examine that zone as
1729 * quickly as we can.
1731 static nodemask_t *zlc_setup(struct zonelist *zonelist, int alloc_flags)
1733 struct zonelist_cache *zlc; /* cached zonelist speedup info */
1734 nodemask_t *allowednodes; /* zonelist_cache approximation */
1736 zlc = zonelist->zlcache_ptr;
1740 if (time_after(jiffies, zlc->last_full_zap + HZ)) {
1741 bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST);
1742 zlc->last_full_zap = jiffies;
1745 allowednodes = !in_interrupt() && (alloc_flags & ALLOC_CPUSET) ?
1746 &cpuset_current_mems_allowed :
1747 &node_states[N_HIGH_MEMORY];
1748 return allowednodes;
1752 * Given 'z' scanning a zonelist, run a couple of quick checks to see
1753 * if it is worth looking at further for free memory:
1754 * 1) Check that the zone isn't thought to be full (doesn't have its
1755 * bit set in the zonelist_cache fullzones BITMAP).
1756 * 2) Check that the zones node (obtained from the zonelist_cache
1757 * z_to_n[] mapping) is allowed in the passed in allowednodes mask.
1758 * Return true (non-zero) if zone is worth looking at further, or
1759 * else return false (zero) if it is not.
1761 * This check -ignores- the distinction between various watermarks,
1762 * such as GFP_HIGH, GFP_ATOMIC, PF_MEMALLOC, ... If a zone is
1763 * found to be full for any variation of these watermarks, it will
1764 * be considered full for up to one second by all requests, unless
1765 * we are so low on memory on all allowed nodes that we are forced
1766 * into the second scan of the zonelist.
1768 * In the second scan we ignore this zonelist cache and exactly
1769 * apply the watermarks to all zones, even it is slower to do so.
1770 * We are low on memory in the second scan, and should leave no stone
1771 * unturned looking for a free page.
1773 static int zlc_zone_worth_trying(struct zonelist *zonelist, struct zoneref *z,
1774 nodemask_t *allowednodes)
1776 struct zonelist_cache *zlc; /* cached zonelist speedup info */
1777 int i; /* index of *z in zonelist zones */
1778 int n; /* node that zone *z is on */
1780 zlc = zonelist->zlcache_ptr;
1784 i = z - zonelist->_zonerefs;
1787 /* This zone is worth trying if it is allowed but not full */
1788 return node_isset(n, *allowednodes) && !test_bit(i, zlc->fullzones);
1792 * Given 'z' scanning a zonelist, set the corresponding bit in
1793 * zlc->fullzones, so that subsequent attempts to allocate a page
1794 * from that zone don't waste time re-examining it.
1796 static void zlc_mark_zone_full(struct zonelist *zonelist, struct zoneref *z)
1798 struct zonelist_cache *zlc; /* cached zonelist speedup info */
1799 int i; /* index of *z in zonelist zones */
1801 zlc = zonelist->zlcache_ptr;
1805 i = z - zonelist->_zonerefs;
1807 set_bit(i, zlc->fullzones);
1811 * clear all zones full, called after direct reclaim makes progress so that
1812 * a zone that was recently full is not skipped over for up to a second
1814 static void zlc_clear_zones_full(struct zonelist *zonelist)
1816 struct zonelist_cache *zlc; /* cached zonelist speedup info */
1818 zlc = zonelist->zlcache_ptr;
1822 bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST);
1825 #else /* CONFIG_NUMA */
1827 static nodemask_t *zlc_setup(struct zonelist *zonelist, int alloc_flags)
1832 static int zlc_zone_worth_trying(struct zonelist *zonelist, struct zoneref *z,
1833 nodemask_t *allowednodes)
1838 static void zlc_mark_zone_full(struct zonelist *zonelist, struct zoneref *z)
1842 static void zlc_clear_zones_full(struct zonelist *zonelist)
1845 #endif /* CONFIG_NUMA */
1848 * get_page_from_freelist goes through the zonelist trying to allocate
1851 static struct page *
1852 get_page_from_freelist(gfp_t gfp_mask, nodemask_t *nodemask, unsigned int order,
1853 struct zonelist *zonelist, int high_zoneidx, int alloc_flags,
1854 struct zone *preferred_zone, int migratetype)
1857 struct page *page = NULL;
1860 nodemask_t *allowednodes = NULL;/* zonelist_cache approximation */
1861 int zlc_active = 0; /* set if using zonelist_cache */
1862 int did_zlc_setup = 0; /* just call zlc_setup() one time */
1864 classzone_idx = zone_idx(preferred_zone);
1867 * Scan zonelist, looking for a zone with enough free.
1868 * See also cpuset_zone_allowed() comment in kernel/cpuset.c.
1870 for_each_zone_zonelist_nodemask(zone, z, zonelist,
1871 high_zoneidx, nodemask) {
1872 if (NUMA_BUILD && zlc_active &&
1873 !zlc_zone_worth_trying(zonelist, z, allowednodes))
1875 if ((alloc_flags & ALLOC_CPUSET) &&
1876 !cpuset_zone_allowed_softwall(zone, gfp_mask))
1879 * When allocating a page cache page for writing, we
1880 * want to get it from a zone that is within its dirty
1881 * limit, such that no single zone holds more than its
1882 * proportional share of globally allowed dirty pages.
1883 * The dirty limits take into account the zone's
1884 * lowmem reserves and high watermark so that kswapd
1885 * should be able to balance it without having to
1886 * write pages from its LRU list.
1888 * This may look like it could increase pressure on
1889 * lower zones by failing allocations in higher zones
1890 * before they are full. But the pages that do spill
1891 * over are limited as the lower zones are protected
1892 * by this very same mechanism. It should not become
1893 * a practical burden to them.
1895 * XXX: For now, allow allocations to potentially
1896 * exceed the per-zone dirty limit in the slowpath
1897 * (ALLOC_WMARK_LOW unset) before going into reclaim,
1898 * which is important when on a NUMA setup the allowed
1899 * zones are together not big enough to reach the
1900 * global limit. The proper fix for these situations
1901 * will require awareness of zones in the
1902 * dirty-throttling and the flusher threads.
1904 if ((alloc_flags & ALLOC_WMARK_LOW) &&
1905 (gfp_mask & __GFP_WRITE) && !zone_dirty_ok(zone))
1906 goto this_zone_full;
1908 BUILD_BUG_ON(ALLOC_NO_WATERMARKS < NR_WMARK);
1909 if (!(alloc_flags & ALLOC_NO_WATERMARKS)) {
1913 mark = zone->watermark[alloc_flags & ALLOC_WMARK_MASK];
1914 if (zone_watermark_ok(zone, order, mark,
1915 classzone_idx, alloc_flags))
1918 if (NUMA_BUILD && !did_zlc_setup && nr_online_nodes > 1) {
1920 * we do zlc_setup if there are multiple nodes
1921 * and before considering the first zone allowed
1924 allowednodes = zlc_setup(zonelist, alloc_flags);
1929 if (zone_reclaim_mode == 0)
1930 goto this_zone_full;
1933 * As we may have just activated ZLC, check if the first
1934 * eligible zone has failed zone_reclaim recently.
1936 if (NUMA_BUILD && zlc_active &&
1937 !zlc_zone_worth_trying(zonelist, z, allowednodes))
1940 ret = zone_reclaim(zone, gfp_mask, order);
1942 case ZONE_RECLAIM_NOSCAN:
1945 case ZONE_RECLAIM_FULL:
1946 /* scanned but unreclaimable */
1949 /* did we reclaim enough */
1950 if (!zone_watermark_ok(zone, order, mark,
1951 classzone_idx, alloc_flags))
1952 goto this_zone_full;
1957 page = buffered_rmqueue(preferred_zone, zone, order,
1958 gfp_mask, migratetype);
1963 zlc_mark_zone_full(zonelist, z);
1966 if (unlikely(NUMA_BUILD && page == NULL && zlc_active)) {
1967 /* Disable zlc cache for second zonelist scan */
1974 * page->pfmemalloc is set when ALLOC_NO_WATERMARKS was
1975 * necessary to allocate the page. The expectation is
1976 * that the caller is taking steps that will free more
1977 * memory. The caller should avoid the page being used
1978 * for !PFMEMALLOC purposes.
1980 page->pfmemalloc = !!(alloc_flags & ALLOC_NO_WATERMARKS);
1986 * Large machines with many possible nodes should not always dump per-node
1987 * meminfo in irq context.
1989 static inline bool should_suppress_show_mem(void)
1994 ret = in_interrupt();
1999 static DEFINE_RATELIMIT_STATE(nopage_rs,
2000 DEFAULT_RATELIMIT_INTERVAL,
2001 DEFAULT_RATELIMIT_BURST);
2003 void warn_alloc_failed(gfp_t gfp_mask, int order, const char *fmt, ...)
2005 unsigned int filter = SHOW_MEM_FILTER_NODES;
2007 if ((gfp_mask & __GFP_NOWARN) || !__ratelimit(&nopage_rs) ||
2008 debug_guardpage_minorder() > 0)
2012 * This documents exceptions given to allocations in certain
2013 * contexts that are allowed to allocate outside current's set
2016 if (!(gfp_mask & __GFP_NOMEMALLOC))
2017 if (test_thread_flag(TIF_MEMDIE) ||
2018 (current->flags & (PF_MEMALLOC | PF_EXITING)))
2019 filter &= ~SHOW_MEM_FILTER_NODES;
2020 if (in_interrupt() || !(gfp_mask & __GFP_WAIT))
2021 filter &= ~SHOW_MEM_FILTER_NODES;
2024 struct va_format vaf;
2027 va_start(args, fmt);
2032 pr_warn("%pV", &vaf);
2037 pr_warn("%s: page allocation failure: order:%d, mode:0x%x\n",
2038 current->comm, order, gfp_mask);
2041 if (!should_suppress_show_mem())
2046 should_alloc_retry(gfp_t gfp_mask, unsigned int order,
2047 unsigned long did_some_progress,
2048 unsigned long pages_reclaimed)
2050 /* Do not loop if specifically requested */
2051 if (gfp_mask & __GFP_NORETRY)
2054 /* Always retry if specifically requested */
2055 if (gfp_mask & __GFP_NOFAIL)
2059 * Suspend converts GFP_KERNEL to __GFP_WAIT which can prevent reclaim
2060 * making forward progress without invoking OOM. Suspend also disables
2061 * storage devices so kswapd will not help. Bail if we are suspending.
2063 if (!did_some_progress && pm_suspended_storage())
2067 * In this implementation, order <= PAGE_ALLOC_COSTLY_ORDER
2068 * means __GFP_NOFAIL, but that may not be true in other
2071 if (order <= PAGE_ALLOC_COSTLY_ORDER)
2075 * For order > PAGE_ALLOC_COSTLY_ORDER, if __GFP_REPEAT is
2076 * specified, then we retry until we no longer reclaim any pages
2077 * (above), or we've reclaimed an order of pages at least as
2078 * large as the allocation's order. In both cases, if the
2079 * allocation still fails, we stop retrying.
2081 if (gfp_mask & __GFP_REPEAT && pages_reclaimed < (1 << order))
2087 static inline struct page *
2088 __alloc_pages_may_oom(gfp_t gfp_mask, unsigned int order,
2089 struct zonelist *zonelist, enum zone_type high_zoneidx,
2090 nodemask_t *nodemask, struct zone *preferred_zone,
2095 /* Acquire the OOM killer lock for the zones in zonelist */
2096 if (!try_set_zonelist_oom(zonelist, gfp_mask)) {
2097 schedule_timeout_uninterruptible(1);
2102 * Go through the zonelist yet one more time, keep very high watermark
2103 * here, this is only to catch a parallel oom killing, we must fail if
2104 * we're still under heavy pressure.
2106 page = get_page_from_freelist(gfp_mask|__GFP_HARDWALL, nodemask,
2107 order, zonelist, high_zoneidx,
2108 ALLOC_WMARK_HIGH|ALLOC_CPUSET,
2109 preferred_zone, migratetype);
2113 if (!(gfp_mask & __GFP_NOFAIL)) {
2114 /* The OOM killer will not help higher order allocs */
2115 if (order > PAGE_ALLOC_COSTLY_ORDER)
2117 /* The OOM killer does not needlessly kill tasks for lowmem */
2118 if (high_zoneidx < ZONE_NORMAL)
2121 * GFP_THISNODE contains __GFP_NORETRY and we never hit this.
2122 * Sanity check for bare calls of __GFP_THISNODE, not real OOM.
2123 * The caller should handle page allocation failure by itself if
2124 * it specifies __GFP_THISNODE.
2125 * Note: Hugepage uses it but will hit PAGE_ALLOC_COSTLY_ORDER.
2127 if (gfp_mask & __GFP_THISNODE)
2130 /* Exhausted what can be done so it's blamo time */
2131 out_of_memory(zonelist, gfp_mask, order, nodemask, false);
2134 clear_zonelist_oom(zonelist, gfp_mask);
2138 #ifdef CONFIG_COMPACTION
2139 /* Try memory compaction for high-order allocations before reclaim */
2140 static struct page *
2141 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
2142 struct zonelist *zonelist, enum zone_type high_zoneidx,
2143 nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone,
2144 int migratetype, bool sync_migration,
2145 bool *contended_compaction, bool *deferred_compaction,
2146 unsigned long *did_some_progress)
2148 struct page *page = NULL;
2153 if (compaction_deferred(preferred_zone, order)) {
2154 *deferred_compaction = true;
2158 current->flags |= PF_MEMALLOC;
2159 *did_some_progress = try_to_compact_pages(zonelist, order, gfp_mask,
2160 nodemask, sync_migration,
2161 contended_compaction, &page);
2162 current->flags &= ~PF_MEMALLOC;
2164 /* If compaction captured a page, prep and use it */
2166 prep_new_page(page, order, gfp_mask);
2170 if (*did_some_progress != COMPACT_SKIPPED) {
2171 /* Page migration frees to the PCP lists but we want merging */
2172 drain_pages(get_cpu());
2175 page = get_page_from_freelist(gfp_mask, nodemask,
2176 order, zonelist, high_zoneidx,
2177 alloc_flags & ~ALLOC_NO_WATERMARKS,
2178 preferred_zone, migratetype);
2181 preferred_zone->compact_considered = 0;
2182 preferred_zone->compact_defer_shift = 0;
2183 if (order >= preferred_zone->compact_order_failed)
2184 preferred_zone->compact_order_failed = order + 1;
2185 count_vm_event(COMPACTSUCCESS);
2190 * It's bad if compaction run occurs and fails.
2191 * The most likely reason is that pages exist,
2192 * but not enough to satisfy watermarks.
2194 count_vm_event(COMPACTFAIL);
2197 * As async compaction considers a subset of pageblocks, only
2198 * defer if the failure was a sync compaction failure.
2201 defer_compaction(preferred_zone, order);
2209 static inline struct page *
2210 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
2211 struct zonelist *zonelist, enum zone_type high_zoneidx,
2212 nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone,
2213 int migratetype, bool sync_migration,
2214 bool *contended_compaction, bool *deferred_compaction,
2215 unsigned long *did_some_progress)
2219 #endif /* CONFIG_COMPACTION */
2221 /* Perform direct synchronous page reclaim */
2223 __perform_reclaim(gfp_t gfp_mask, unsigned int order, struct zonelist *zonelist,
2224 nodemask_t *nodemask)
2226 struct reclaim_state reclaim_state;
2231 /* We now go into synchronous reclaim */
2232 cpuset_memory_pressure_bump();
2233 current->flags |= PF_MEMALLOC;
2234 lockdep_set_current_reclaim_state(gfp_mask);
2235 reclaim_state.reclaimed_slab = 0;
2236 current->reclaim_state = &reclaim_state;
2238 progress = try_to_free_pages(zonelist, order, gfp_mask, nodemask);
2240 current->reclaim_state = NULL;
2241 lockdep_clear_current_reclaim_state();
2242 current->flags &= ~PF_MEMALLOC;
2249 /* The really slow allocator path where we enter direct reclaim */
2250 static inline struct page *
2251 __alloc_pages_direct_reclaim(gfp_t gfp_mask, unsigned int order,
2252 struct zonelist *zonelist, enum zone_type high_zoneidx,
2253 nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone,
2254 int migratetype, unsigned long *did_some_progress)
2256 struct page *page = NULL;
2257 bool drained = false;
2259 *did_some_progress = __perform_reclaim(gfp_mask, order, zonelist,
2261 if (unlikely(!(*did_some_progress)))
2264 /* After successful reclaim, reconsider all zones for allocation */
2266 zlc_clear_zones_full(zonelist);
2269 page = get_page_from_freelist(gfp_mask, nodemask, order,
2270 zonelist, high_zoneidx,
2271 alloc_flags & ~ALLOC_NO_WATERMARKS,
2272 preferred_zone, migratetype);
2275 * If an allocation failed after direct reclaim, it could be because
2276 * pages are pinned on the per-cpu lists. Drain them and try again
2278 if (!page && !drained) {
2288 * This is called in the allocator slow-path if the allocation request is of
2289 * sufficient urgency to ignore watermarks and take other desperate measures
2291 static inline struct page *
2292 __alloc_pages_high_priority(gfp_t gfp_mask, unsigned int order,
2293 struct zonelist *zonelist, enum zone_type high_zoneidx,
2294 nodemask_t *nodemask, struct zone *preferred_zone,
2300 page = get_page_from_freelist(gfp_mask, nodemask, order,
2301 zonelist, high_zoneidx, ALLOC_NO_WATERMARKS,
2302 preferred_zone, migratetype);
2304 if (!page && gfp_mask & __GFP_NOFAIL)
2305 wait_iff_congested(preferred_zone, BLK_RW_ASYNC, HZ/50);
2306 } while (!page && (gfp_mask & __GFP_NOFAIL));
2312 void wake_all_kswapd(unsigned int order, struct zonelist *zonelist,
2313 enum zone_type high_zoneidx,
2314 enum zone_type classzone_idx)
2319 for_each_zone_zonelist(zone, z, zonelist, high_zoneidx)
2320 wakeup_kswapd(zone, order, classzone_idx);
2324 gfp_to_alloc_flags(gfp_t gfp_mask)
2326 int alloc_flags = ALLOC_WMARK_MIN | ALLOC_CPUSET;
2327 const gfp_t wait = gfp_mask & __GFP_WAIT;
2329 /* __GFP_HIGH is assumed to be the same as ALLOC_HIGH to save a branch. */
2330 BUILD_BUG_ON(__GFP_HIGH != (__force gfp_t) ALLOC_HIGH);
2333 * The caller may dip into page reserves a bit more if the caller
2334 * cannot run direct reclaim, or if the caller has realtime scheduling
2335 * policy or is asking for __GFP_HIGH memory. GFP_ATOMIC requests will
2336 * set both ALLOC_HARDER (!wait) and ALLOC_HIGH (__GFP_HIGH).
2338 alloc_flags |= (__force int) (gfp_mask & __GFP_HIGH);
2342 * Not worth trying to allocate harder for
2343 * __GFP_NOMEMALLOC even if it can't schedule.
2345 if (!(gfp_mask & __GFP_NOMEMALLOC))
2346 alloc_flags |= ALLOC_HARDER;
2348 * Ignore cpuset if GFP_ATOMIC (!wait) rather than fail alloc.
2349 * See also cpuset_zone_allowed() comment in kernel/cpuset.c.
2351 alloc_flags &= ~ALLOC_CPUSET;
2352 } else if (unlikely(rt_task(current)) && !in_interrupt())
2353 alloc_flags |= ALLOC_HARDER;
2355 if (likely(!(gfp_mask & __GFP_NOMEMALLOC))) {
2356 if (gfp_mask & __GFP_MEMALLOC)
2357 alloc_flags |= ALLOC_NO_WATERMARKS;
2358 else if (in_serving_softirq() && (current->flags & PF_MEMALLOC))
2359 alloc_flags |= ALLOC_NO_WATERMARKS;
2360 else if (!in_interrupt() &&
2361 ((current->flags & PF_MEMALLOC) ||
2362 unlikely(test_thread_flag(TIF_MEMDIE))))
2363 alloc_flags |= ALLOC_NO_WATERMARKS;
2369 bool gfp_pfmemalloc_allowed(gfp_t gfp_mask)
2371 return !!(gfp_to_alloc_flags(gfp_mask) & ALLOC_NO_WATERMARKS);
2374 static inline struct page *
2375 __alloc_pages_slowpath(gfp_t gfp_mask, unsigned int order,
2376 struct zonelist *zonelist, enum zone_type high_zoneidx,
2377 nodemask_t *nodemask, struct zone *preferred_zone,
2380 const gfp_t wait = gfp_mask & __GFP_WAIT;
2381 struct page *page = NULL;
2383 unsigned long pages_reclaimed = 0;
2384 unsigned long did_some_progress;
2385 bool sync_migration = false;
2386 bool deferred_compaction = false;
2387 bool contended_compaction = false;
2390 * In the slowpath, we sanity check order to avoid ever trying to
2391 * reclaim >= MAX_ORDER areas which will never succeed. Callers may
2392 * be using allocators in order of preference for an area that is
2395 if (order >= MAX_ORDER) {
2396 WARN_ON_ONCE(!(gfp_mask & __GFP_NOWARN));
2401 * GFP_THISNODE (meaning __GFP_THISNODE, __GFP_NORETRY and
2402 * __GFP_NOWARN set) should not cause reclaim since the subsystem
2403 * (f.e. slab) using GFP_THISNODE may choose to trigger reclaim
2404 * using a larger set of nodes after it has established that the
2405 * allowed per node queues are empty and that nodes are
2408 if (NUMA_BUILD && (gfp_mask & GFP_THISNODE) == GFP_THISNODE)
2412 wake_all_kswapd(order, zonelist, high_zoneidx,
2413 zone_idx(preferred_zone));
2416 * OK, we're below the kswapd watermark and have kicked background
2417 * reclaim. Now things get more complex, so set up alloc_flags according
2418 * to how we want to proceed.
2420 alloc_flags = gfp_to_alloc_flags(gfp_mask);
2423 * Find the true preferred zone if the allocation is unconstrained by
2426 if (!(alloc_flags & ALLOC_CPUSET) && !nodemask)
2427 first_zones_zonelist(zonelist, high_zoneidx, NULL,
2431 /* This is the last chance, in general, before the goto nopage. */
2432 page = get_page_from_freelist(gfp_mask, nodemask, order, zonelist,
2433 high_zoneidx, alloc_flags & ~ALLOC_NO_WATERMARKS,
2434 preferred_zone, migratetype);
2438 /* Allocate without watermarks if the context allows */
2439 if (alloc_flags & ALLOC_NO_WATERMARKS) {
2441 * Ignore mempolicies if ALLOC_NO_WATERMARKS on the grounds
2442 * the allocation is high priority and these type of
2443 * allocations are system rather than user orientated
2445 zonelist = node_zonelist(numa_node_id(), gfp_mask);
2447 page = __alloc_pages_high_priority(gfp_mask, order,
2448 zonelist, high_zoneidx, nodemask,
2449 preferred_zone, migratetype);
2455 /* Atomic allocations - we can't balance anything */
2459 /* Avoid recursion of direct reclaim */
2460 if (current->flags & PF_MEMALLOC)
2463 /* Avoid allocations with no watermarks from looping endlessly */
2464 if (test_thread_flag(TIF_MEMDIE) && !(gfp_mask & __GFP_NOFAIL))
2468 * Try direct compaction. The first pass is asynchronous. Subsequent
2469 * attempts after direct reclaim are synchronous
2471 page = __alloc_pages_direct_compact(gfp_mask, order,
2472 zonelist, high_zoneidx,
2474 alloc_flags, preferred_zone,
2475 migratetype, sync_migration,
2476 &contended_compaction,
2477 &deferred_compaction,
2478 &did_some_progress);
2481 sync_migration = true;
2484 * If compaction is deferred for high-order allocations, it is because
2485 * sync compaction recently failed. In this is the case and the caller
2486 * requested a movable allocation that does not heavily disrupt the
2487 * system then fail the allocation instead of entering direct reclaim.
2489 if ((deferred_compaction || contended_compaction) &&
2490 (gfp_mask & (__GFP_MOVABLE|__GFP_REPEAT)) == __GFP_MOVABLE)
2493 /* Try direct reclaim and then allocating */
2494 page = __alloc_pages_direct_reclaim(gfp_mask, order,
2495 zonelist, high_zoneidx,
2497 alloc_flags, preferred_zone,
2498 migratetype, &did_some_progress);
2503 * If we failed to make any progress reclaiming, then we are
2504 * running out of options and have to consider going OOM
2506 if (!did_some_progress) {
2507 if ((gfp_mask & __GFP_FS) && !(gfp_mask & __GFP_NORETRY)) {
2508 if (oom_killer_disabled)
2510 /* Coredumps can quickly deplete all memory reserves */
2511 if ((current->flags & PF_DUMPCORE) &&
2512 !(gfp_mask & __GFP_NOFAIL))
2514 page = __alloc_pages_may_oom(gfp_mask, order,
2515 zonelist, high_zoneidx,
2516 nodemask, preferred_zone,
2521 if (!(gfp_mask & __GFP_NOFAIL)) {
2523 * The oom killer is not called for high-order
2524 * allocations that may fail, so if no progress
2525 * is being made, there are no other options and
2526 * retrying is unlikely to help.
2528 if (order > PAGE_ALLOC_COSTLY_ORDER)
2531 * The oom killer is not called for lowmem
2532 * allocations to prevent needlessly killing
2535 if (high_zoneidx < ZONE_NORMAL)
2543 /* Check if we should retry the allocation */
2544 pages_reclaimed += did_some_progress;
2545 if (should_alloc_retry(gfp_mask, order, did_some_progress,
2547 /* Wait for some write requests to complete then retry */
2548 wait_iff_congested(preferred_zone, BLK_RW_ASYNC, HZ/50);
2552 * High-order allocations do not necessarily loop after
2553 * direct reclaim and reclaim/compaction depends on compaction
2554 * being called after reclaim so call directly if necessary
2556 page = __alloc_pages_direct_compact(gfp_mask, order,
2557 zonelist, high_zoneidx,
2559 alloc_flags, preferred_zone,
2560 migratetype, sync_migration,
2561 &contended_compaction,
2562 &deferred_compaction,
2563 &did_some_progress);
2569 warn_alloc_failed(gfp_mask, order, NULL);
2572 if (kmemcheck_enabled)
2573 kmemcheck_pagealloc_alloc(page, order, gfp_mask);
2579 * This is the 'heart' of the zoned buddy allocator.
2582 __alloc_pages_nodemask(gfp_t gfp_mask, unsigned int order,
2583 struct zonelist *zonelist, nodemask_t *nodemask)
2585 enum zone_type high_zoneidx = gfp_zone(gfp_mask);
2586 struct zone *preferred_zone;
2587 struct page *page = NULL;
2588 int migratetype = allocflags_to_migratetype(gfp_mask);
2589 unsigned int cpuset_mems_cookie;
2591 gfp_mask &= gfp_allowed_mask;
2593 lockdep_trace_alloc(gfp_mask);
2595 might_sleep_if(gfp_mask & __GFP_WAIT);
2597 if (should_fail_alloc_page(gfp_mask, order))
2601 * Check the zones suitable for the gfp_mask contain at least one
2602 * valid zone. It's possible to have an empty zonelist as a result
2603 * of GFP_THISNODE and a memoryless node
2605 if (unlikely(!zonelist->_zonerefs->zone))
2609 cpuset_mems_cookie = get_mems_allowed();
2611 /* The preferred zone is used for statistics later */
2612 first_zones_zonelist(zonelist, high_zoneidx,
2613 nodemask ? : &cpuset_current_mems_allowed,
2615 if (!preferred_zone)
2618 /* First allocation attempt */
2619 page = get_page_from_freelist(gfp_mask|__GFP_HARDWALL, nodemask, order,
2620 zonelist, high_zoneidx, ALLOC_WMARK_LOW|ALLOC_CPUSET,
2621 preferred_zone, migratetype);
2622 if (unlikely(!page))
2623 page = __alloc_pages_slowpath(gfp_mask, order,
2624 zonelist, high_zoneidx, nodemask,
2625 preferred_zone, migratetype);
2627 trace_mm_page_alloc(page, order, gfp_mask, migratetype);
2631 * When updating a task's mems_allowed, it is possible to race with
2632 * parallel threads in such a way that an allocation can fail while
2633 * the mask is being updated. If a page allocation is about to fail,
2634 * check if the cpuset changed during allocation and if so, retry.
2636 if (unlikely(!put_mems_allowed(cpuset_mems_cookie) && !page))
2641 EXPORT_SYMBOL(__alloc_pages_nodemask);
2644 * Common helper functions.
2646 unsigned long __get_free_pages(gfp_t gfp_mask, unsigned int order)
2651 * __get_free_pages() returns a 32-bit address, which cannot represent
2654 VM_BUG_ON((gfp_mask & __GFP_HIGHMEM) != 0);
2656 page = alloc_pages(gfp_mask, order);
2659 return (unsigned long) page_address(page);
2661 EXPORT_SYMBOL(__get_free_pages);
2663 unsigned long get_zeroed_page(gfp_t gfp_mask)
2665 return __get_free_pages(gfp_mask | __GFP_ZERO, 0);
2667 EXPORT_SYMBOL(get_zeroed_page);
2669 void __free_pages(struct page *page, unsigned int order)
2671 if (put_page_testzero(page)) {
2673 free_hot_cold_page(page, 0);
2675 __free_pages_ok(page, order);
2679 EXPORT_SYMBOL(__free_pages);
2681 void free_pages(unsigned long addr, unsigned int order)
2684 VM_BUG_ON(!virt_addr_valid((void *)addr));
2685 __free_pages(virt_to_page((void *)addr), order);
2689 EXPORT_SYMBOL(free_pages);
2691 static void *make_alloc_exact(unsigned long addr, unsigned order, size_t size)
2694 unsigned long alloc_end = addr + (PAGE_SIZE << order);
2695 unsigned long used = addr + PAGE_ALIGN(size);
2697 split_page(virt_to_page((void *)addr), order);
2698 while (used < alloc_end) {
2703 return (void *)addr;
2707 * alloc_pages_exact - allocate an exact number physically-contiguous pages.
2708 * @size: the number of bytes to allocate
2709 * @gfp_mask: GFP flags for the allocation
2711 * This function is similar to alloc_pages(), except that it allocates the
2712 * minimum number of pages to satisfy the request. alloc_pages() can only
2713 * allocate memory in power-of-two pages.
2715 * This function is also limited by MAX_ORDER.
2717 * Memory allocated by this function must be released by free_pages_exact().
2719 void *alloc_pages_exact(size_t size, gfp_t gfp_mask)
2721 unsigned int order = get_order(size);
2724 addr = __get_free_pages(gfp_mask, order);
2725 return make_alloc_exact(addr, order, size);
2727 EXPORT_SYMBOL(alloc_pages_exact);
2730 * alloc_pages_exact_nid - allocate an exact number of physically-contiguous
2732 * @nid: the preferred node ID where memory should be allocated
2733 * @size: the number of bytes to allocate
2734 * @gfp_mask: GFP flags for the allocation
2736 * Like alloc_pages_exact(), but try to allocate on node nid first before falling
2738 * Note this is not alloc_pages_exact_node() which allocates on a specific node,
2741 void *alloc_pages_exact_nid(int nid, size_t size, gfp_t gfp_mask)
2743 unsigned order = get_order(size);
2744 struct page *p = alloc_pages_node(nid, gfp_mask, order);
2747 return make_alloc_exact((unsigned long)page_address(p), order, size);
2749 EXPORT_SYMBOL(alloc_pages_exact_nid);
2752 * free_pages_exact - release memory allocated via alloc_pages_exact()
2753 * @virt: the value returned by alloc_pages_exact.
2754 * @size: size of allocation, same value as passed to alloc_pages_exact().
2756 * Release the memory allocated by a previous call to alloc_pages_exact.
2758 void free_pages_exact(void *virt, size_t size)
2760 unsigned long addr = (unsigned long)virt;
2761 unsigned long end = addr + PAGE_ALIGN(size);
2763 while (addr < end) {
2768 EXPORT_SYMBOL(free_pages_exact);
2770 static unsigned int nr_free_zone_pages(int offset)
2775 /* Just pick one node, since fallback list is circular */
2776 unsigned int sum = 0;
2778 struct zonelist *zonelist = node_zonelist(numa_node_id(), GFP_KERNEL);
2780 for_each_zone_zonelist(zone, z, zonelist, offset) {
2781 unsigned long size = zone->present_pages;
2782 unsigned long high = high_wmark_pages(zone);
2791 * Amount of free RAM allocatable within ZONE_DMA and ZONE_NORMAL
2793 unsigned int nr_free_buffer_pages(void)
2795 return nr_free_zone_pages(gfp_zone(GFP_USER));
2797 EXPORT_SYMBOL_GPL(nr_free_buffer_pages);
2800 * Amount of free RAM allocatable within all zones
2802 unsigned int nr_free_pagecache_pages(void)
2804 return nr_free_zone_pages(gfp_zone(GFP_HIGHUSER_MOVABLE));
2807 static inline void show_node(struct zone *zone)
2810 printk("Node %d ", zone_to_nid(zone));
2813 void si_meminfo(struct sysinfo *val)
2815 val->totalram = totalram_pages;
2817 val->freeram = global_page_state(NR_FREE_PAGES);
2818 val->bufferram = nr_blockdev_pages();
2819 val->totalhigh = totalhigh_pages;
2820 val->freehigh = nr_free_highpages();
2821 val->mem_unit = PAGE_SIZE;
2824 EXPORT_SYMBOL(si_meminfo);
2827 void si_meminfo_node(struct sysinfo *val, int nid)
2829 pg_data_t *pgdat = NODE_DATA(nid);
2831 val->totalram = pgdat->node_present_pages;
2832 val->freeram = node_page_state(nid, NR_FREE_PAGES);
2833 #ifdef CONFIG_HIGHMEM
2834 val->totalhigh = pgdat->node_zones[ZONE_HIGHMEM].present_pages;
2835 val->freehigh = zone_page_state(&pgdat->node_zones[ZONE_HIGHMEM],
2841 val->mem_unit = PAGE_SIZE;
2846 * Determine whether the node should be displayed or not, depending on whether
2847 * SHOW_MEM_FILTER_NODES was passed to show_free_areas().
2849 bool skip_free_areas_node(unsigned int flags, int nid)
2852 unsigned int cpuset_mems_cookie;
2854 if (!(flags & SHOW_MEM_FILTER_NODES))
2858 cpuset_mems_cookie = get_mems_allowed();
2859 ret = !node_isset(nid, cpuset_current_mems_allowed);
2860 } while (!put_mems_allowed(cpuset_mems_cookie));
2865 #define K(x) ((x) << (PAGE_SHIFT-10))
2868 * Show free area list (used inside shift_scroll-lock stuff)
2869 * We also calculate the percentage fragmentation. We do this by counting the
2870 * memory on each free list with the exception of the first item on the list.
2871 * Suppresses nodes that are not allowed by current's cpuset if
2872 * SHOW_MEM_FILTER_NODES is passed.
2874 void show_free_areas(unsigned int filter)
2879 for_each_populated_zone(zone) {
2880 if (skip_free_areas_node(filter, zone_to_nid(zone)))
2883 printk("%s per-cpu:\n", zone->name);
2885 for_each_online_cpu(cpu) {
2886 struct per_cpu_pageset *pageset;
2888 pageset = per_cpu_ptr(zone->pageset, cpu);
2890 printk("CPU %4d: hi:%5d, btch:%4d usd:%4d\n",
2891 cpu, pageset->pcp.high,
2892 pageset->pcp.batch, pageset->pcp.count);
2896 printk("active_anon:%lu inactive_anon:%lu isolated_anon:%lu\n"
2897 " active_file:%lu inactive_file:%lu isolated_file:%lu\n"
2899 " dirty:%lu writeback:%lu unstable:%lu\n"
2900 " free:%lu slab_reclaimable:%lu slab_unreclaimable:%lu\n"
2901 " mapped:%lu shmem:%lu pagetables:%lu bounce:%lu\n"
2903 global_page_state(NR_ACTIVE_ANON),
2904 global_page_state(NR_INACTIVE_ANON),
2905 global_page_state(NR_ISOLATED_ANON),
2906 global_page_state(NR_ACTIVE_FILE),
2907 global_page_state(NR_INACTIVE_FILE),
2908 global_page_state(NR_ISOLATED_FILE),
2909 global_page_state(NR_UNEVICTABLE),
2910 global_page_state(NR_FILE_DIRTY),
2911 global_page_state(NR_WRITEBACK),
2912 global_page_state(NR_UNSTABLE_NFS),
2913 global_page_state(NR_FREE_PAGES),
2914 global_page_state(NR_SLAB_RECLAIMABLE),
2915 global_page_state(NR_SLAB_UNRECLAIMABLE),
2916 global_page_state(NR_FILE_MAPPED),
2917 global_page_state(NR_SHMEM),
2918 global_page_state(NR_PAGETABLE),
2919 global_page_state(NR_BOUNCE),
2920 global_page_state(NR_FREE_CMA_PAGES));
2922 for_each_populated_zone(zone) {
2925 if (skip_free_areas_node(filter, zone_to_nid(zone)))
2933 " active_anon:%lukB"
2934 " inactive_anon:%lukB"
2935 " active_file:%lukB"
2936 " inactive_file:%lukB"
2937 " unevictable:%lukB"
2938 " isolated(anon):%lukB"
2939 " isolated(file):%lukB"
2946 " slab_reclaimable:%lukB"
2947 " slab_unreclaimable:%lukB"
2948 " kernel_stack:%lukB"
2953 " writeback_tmp:%lukB"
2954 " pages_scanned:%lu"
2955 " all_unreclaimable? %s"
2958 K(zone_page_state(zone, NR_FREE_PAGES)),
2959 K(min_wmark_pages(zone)),
2960 K(low_wmark_pages(zone)),
2961 K(high_wmark_pages(zone)),
2962 K(zone_page_state(zone, NR_ACTIVE_ANON)),
2963 K(zone_page_state(zone, NR_INACTIVE_ANON)),
2964 K(zone_page_state(zone, NR_ACTIVE_FILE)),
2965 K(zone_page_state(zone, NR_INACTIVE_FILE)),
2966 K(zone_page_state(zone, NR_UNEVICTABLE)),
2967 K(zone_page_state(zone, NR_ISOLATED_ANON)),
2968 K(zone_page_state(zone, NR_ISOLATED_FILE)),
2969 K(zone->present_pages),
2970 K(zone_page_state(zone, NR_MLOCK)),
2971 K(zone_page_state(zone, NR_FILE_DIRTY)),
2972 K(zone_page_state(zone, NR_WRITEBACK)),
2973 K(zone_page_state(zone, NR_FILE_MAPPED)),
2974 K(zone_page_state(zone, NR_SHMEM)),
2975 K(zone_page_state(zone, NR_SLAB_RECLAIMABLE)),
2976 K(zone_page_state(zone, NR_SLAB_UNRECLAIMABLE)),
2977 zone_page_state(zone, NR_KERNEL_STACK) *
2979 K(zone_page_state(zone, NR_PAGETABLE)),
2980 K(zone_page_state(zone, NR_UNSTABLE_NFS)),
2981 K(zone_page_state(zone, NR_BOUNCE)),
2982 K(zone_page_state(zone, NR_FREE_CMA_PAGES)),
2983 K(zone_page_state(zone, NR_WRITEBACK_TEMP)),
2984 zone->pages_scanned,
2985 (zone->all_unreclaimable ? "yes" : "no")
2987 printk("lowmem_reserve[]:");
2988 for (i = 0; i < MAX_NR_ZONES; i++)
2989 printk(" %lu", zone->lowmem_reserve[i]);
2993 for_each_populated_zone(zone) {
2994 unsigned long nr[MAX_ORDER], flags, order, total = 0;
2996 if (skip_free_areas_node(filter, zone_to_nid(zone)))
2999 printk("%s: ", zone->name);
3001 spin_lock_irqsave(&zone->lock, flags);
3002 for (order = 0; order < MAX_ORDER; order++) {
3003 nr[order] = zone->free_area[order].nr_free;
3004 total += nr[order] << order;
3006 spin_unlock_irqrestore(&zone->lock, flags);
3007 for (order = 0; order < MAX_ORDER; order++)
3008 printk("%lu*%lukB ", nr[order], K(1UL) << order);
3009 printk("= %lukB\n", K(total));
3012 printk("%ld total pagecache pages\n", global_page_state(NR_FILE_PAGES));
3014 show_swap_cache_info();
3017 static void zoneref_set_zone(struct zone *zone, struct zoneref *zoneref)
3019 zoneref->zone = zone;
3020 zoneref->zone_idx = zone_idx(zone);
3024 * Builds allocation fallback zone lists.
3026 * Add all populated zones of a node to the zonelist.
3028 static int build_zonelists_node(pg_data_t *pgdat, struct zonelist *zonelist,
3029 int nr_zones, enum zone_type zone_type)
3033 BUG_ON(zone_type >= MAX_NR_ZONES);
3038 zone = pgdat->node_zones + zone_type;
3039 if (populated_zone(zone)) {
3040 zoneref_set_zone(zone,
3041 &zonelist->_zonerefs[nr_zones++]);
3042 check_highest_zone(zone_type);
3045 } while (zone_type);
3052 * 0 = automatic detection of better ordering.
3053 * 1 = order by ([node] distance, -zonetype)
3054 * 2 = order by (-zonetype, [node] distance)
3056 * If not NUMA, ZONELIST_ORDER_ZONE and ZONELIST_ORDER_NODE will create
3057 * the same zonelist. So only NUMA can configure this param.
3059 #define ZONELIST_ORDER_DEFAULT 0
3060 #define ZONELIST_ORDER_NODE 1
3061 #define ZONELIST_ORDER_ZONE 2
3063 /* zonelist order in the kernel.
3064 * set_zonelist_order() will set this to NODE or ZONE.
3066 static int current_zonelist_order = ZONELIST_ORDER_DEFAULT;
3067 static char zonelist_order_name[3][8] = {"Default", "Node", "Zone"};
3071 /* The value user specified ....changed by config */
3072 static int user_zonelist_order = ZONELIST_ORDER_DEFAULT;
3073 /* string for sysctl */
3074 #define NUMA_ZONELIST_ORDER_LEN 16
3075 char numa_zonelist_order[16] = "default";
3078 * interface for configure zonelist ordering.
3079 * command line option "numa_zonelist_order"
3080 * = "[dD]efault - default, automatic configuration.
3081 * = "[nN]ode - order by node locality, then by zone within node
3082 * = "[zZ]one - order by zone, then by locality within zone
3085 static int __parse_numa_zonelist_order(char *s)
3087 if (*s == 'd' || *s == 'D') {
3088 user_zonelist_order = ZONELIST_ORDER_DEFAULT;
3089 } else if (*s == 'n' || *s == 'N') {
3090 user_zonelist_order = ZONELIST_ORDER_NODE;
3091 } else if (*s == 'z' || *s == 'Z') {
3092 user_zonelist_order = ZONELIST_ORDER_ZONE;
3095 "Ignoring invalid numa_zonelist_order value: "
3102 static __init int setup_numa_zonelist_order(char *s)
3109 ret = __parse_numa_zonelist_order(s);
3111 strlcpy(numa_zonelist_order, s, NUMA_ZONELIST_ORDER_LEN);
3115 early_param("numa_zonelist_order", setup_numa_zonelist_order);
3118 * sysctl handler for numa_zonelist_order
3120 int numa_zonelist_order_handler(ctl_table *table, int write,
3121 void __user *buffer, size_t *length,
3124 char saved_string[NUMA_ZONELIST_ORDER_LEN];
3126 static DEFINE_MUTEX(zl_order_mutex);
3128 mutex_lock(&zl_order_mutex);
3130 strcpy(saved_string, (char*)table->data);
3131 ret = proc_dostring(table, write, buffer, length, ppos);
3135 int oldval = user_zonelist_order;
3136 if (__parse_numa_zonelist_order((char*)table->data)) {
3138 * bogus value. restore saved string
3140 strncpy((char*)table->data, saved_string,
3141 NUMA_ZONELIST_ORDER_LEN);
3142 user_zonelist_order = oldval;
3143 } else if (oldval != user_zonelist_order) {
3144 mutex_lock(&zonelists_mutex);
3145 build_all_zonelists(NULL, NULL);
3146 mutex_unlock(&zonelists_mutex);
3150 mutex_unlock(&zl_order_mutex);
3155 #define MAX_NODE_LOAD (nr_online_nodes)
3156 static int node_load[MAX_NUMNODES];
3159 * find_next_best_node - find the next node that should appear in a given node's fallback list
3160 * @node: node whose fallback list we're appending
3161 * @used_node_mask: nodemask_t of already used nodes
3163 * We use a number of factors to determine which is the next node that should
3164 * appear on a given node's fallback list. The node should not have appeared
3165 * already in @node's fallback list, and it should be the next closest node
3166 * according to the distance array (which contains arbitrary distance values
3167 * from each node to each node in the system), and should also prefer nodes
3168 * with no CPUs, since presumably they'll have very little allocation pressure
3169 * on them otherwise.
3170 * It returns -1 if no node is found.
3172 static int find_next_best_node(int node, nodemask_t *used_node_mask)
3175 int min_val = INT_MAX;
3177 const struct cpumask *tmp = cpumask_of_node(0);
3179 /* Use the local node if we haven't already */
3180 if (!node_isset(node, *used_node_mask)) {
3181 node_set(node, *used_node_mask);
3185 for_each_node_state(n, N_HIGH_MEMORY) {
3187 /* Don't want a node to appear more than once */
3188 if (node_isset(n, *used_node_mask))
3191 /* Use the distance array to find the distance */
3192 val = node_distance(node, n);
3194 /* Penalize nodes under us ("prefer the next node") */
3197 /* Give preference to headless and unused nodes */
3198 tmp = cpumask_of_node(n);
3199 if (!cpumask_empty(tmp))
3200 val += PENALTY_FOR_NODE_WITH_CPUS;
3202 /* Slight preference for less loaded node */
3203 val *= (MAX_NODE_LOAD*MAX_NUMNODES);
3204 val += node_load[n];
3206 if (val < min_val) {
3213 node_set(best_node, *used_node_mask);
3220 * Build zonelists ordered by node and zones within node.
3221 * This results in maximum locality--normal zone overflows into local
3222 * DMA zone, if any--but risks exhausting DMA zone.
3224 static void build_zonelists_in_node_order(pg_data_t *pgdat, int node)
3227 struct zonelist *zonelist;
3229 zonelist = &pgdat->node_zonelists[0];
3230 for (j = 0; zonelist->_zonerefs[j].zone != NULL; j++)
3232 j = build_zonelists_node(NODE_DATA(node), zonelist, j,
3234 zonelist->_zonerefs[j].zone = NULL;
3235 zonelist->_zonerefs[j].zone_idx = 0;
3239 * Build gfp_thisnode zonelists
3241 static void build_thisnode_zonelists(pg_data_t *pgdat)
3244 struct zonelist *zonelist;
3246 zonelist = &pgdat->node_zonelists[1];
3247 j = build_zonelists_node(pgdat, zonelist, 0, MAX_NR_ZONES - 1);
3248 zonelist->_zonerefs[j].zone = NULL;
3249 zonelist->_zonerefs[j].zone_idx = 0;
3253 * Build zonelists ordered by zone and nodes within zones.
3254 * This results in conserving DMA zone[s] until all Normal memory is
3255 * exhausted, but results in overflowing to remote node while memory
3256 * may still exist in local DMA zone.
3258 static int node_order[MAX_NUMNODES];
3260 static void build_zonelists_in_zone_order(pg_data_t *pgdat, int nr_nodes)
3263 int zone_type; /* needs to be signed */
3265 struct zonelist *zonelist;
3267 zonelist = &pgdat->node_zonelists[0];
3269 for (zone_type = MAX_NR_ZONES - 1; zone_type >= 0; zone_type--) {
3270 for (j = 0; j < nr_nodes; j++) {
3271 node = node_order[j];
3272 z = &NODE_DATA(node)->node_zones[zone_type];
3273 if (populated_zone(z)) {
3275 &zonelist->_zonerefs[pos++]);
3276 check_highest_zone(zone_type);
3280 zonelist->_zonerefs[pos].zone = NULL;
3281 zonelist->_zonerefs[pos].zone_idx = 0;
3284 static int default_zonelist_order(void)
3287 unsigned long low_kmem_size,total_size;
3291 * ZONE_DMA and ZONE_DMA32 can be very small area in the system.
3292 * If they are really small and used heavily, the system can fall
3293 * into OOM very easily.
3294 * This function detect ZONE_DMA/DMA32 size and configures zone order.
3296 /* Is there ZONE_NORMAL ? (ex. ppc has only DMA zone..) */
3299 for_each_online_node(nid) {
3300 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++) {
3301 z = &NODE_DATA(nid)->node_zones[zone_type];
3302 if (populated_zone(z)) {
3303 if (zone_type < ZONE_NORMAL)
3304 low_kmem_size += z->present_pages;
3305 total_size += z->present_pages;
3306 } else if (zone_type == ZONE_NORMAL) {
3308 * If any node has only lowmem, then node order
3309 * is preferred to allow kernel allocations
3310 * locally; otherwise, they can easily infringe
3311 * on other nodes when there is an abundance of
3312 * lowmem available to allocate from.
3314 return ZONELIST_ORDER_NODE;
3318 if (!low_kmem_size || /* there are no DMA area. */
3319 low_kmem_size > total_size/2) /* DMA/DMA32 is big. */
3320 return ZONELIST_ORDER_NODE;
3322 * look into each node's config.
3323 * If there is a node whose DMA/DMA32 memory is very big area on
3324 * local memory, NODE_ORDER may be suitable.
3326 average_size = total_size /
3327 (nodes_weight(node_states[N_HIGH_MEMORY]) + 1);
3328 for_each_online_node(nid) {
3331 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++) {
3332 z = &NODE_DATA(nid)->node_zones[zone_type];
3333 if (populated_zone(z)) {
3334 if (zone_type < ZONE_NORMAL)
3335 low_kmem_size += z->present_pages;
3336 total_size += z->present_pages;
3339 if (low_kmem_size &&
3340 total_size > average_size && /* ignore small node */
3341 low_kmem_size > total_size * 70/100)
3342 return ZONELIST_ORDER_NODE;
3344 return ZONELIST_ORDER_ZONE;
3347 static void set_zonelist_order(void)
3349 if (user_zonelist_order == ZONELIST_ORDER_DEFAULT)
3350 current_zonelist_order = default_zonelist_order();
3352 current_zonelist_order = user_zonelist_order;
3355 static void build_zonelists(pg_data_t *pgdat)
3359 nodemask_t used_mask;
3360 int local_node, prev_node;
3361 struct zonelist *zonelist;
3362 int order = current_zonelist_order;
3364 /* initialize zonelists */
3365 for (i = 0; i < MAX_ZONELISTS; i++) {
3366 zonelist = pgdat->node_zonelists + i;
3367 zonelist->_zonerefs[0].zone = NULL;
3368 zonelist->_zonerefs[0].zone_idx = 0;
3371 /* NUMA-aware ordering of nodes */
3372 local_node = pgdat->node_id;
3373 load = nr_online_nodes;
3374 prev_node = local_node;
3375 nodes_clear(used_mask);
3377 memset(node_order, 0, sizeof(node_order));
3380 while ((node = find_next_best_node(local_node, &used_mask)) >= 0) {
3381 int distance = node_distance(local_node, node);
3384 * If another node is sufficiently far away then it is better
3385 * to reclaim pages in a zone before going off node.
3387 if (distance > RECLAIM_DISTANCE)
3388 zone_reclaim_mode = 1;
3391 * We don't want to pressure a particular node.
3392 * So adding penalty to the first node in same
3393 * distance group to make it round-robin.
3395 if (distance != node_distance(local_node, prev_node))
3396 node_load[node] = load;
3400 if (order == ZONELIST_ORDER_NODE)
3401 build_zonelists_in_node_order(pgdat, node);
3403 node_order[j++] = node; /* remember order */
3406 if (order == ZONELIST_ORDER_ZONE) {
3407 /* calculate node order -- i.e., DMA last! */
3408 build_zonelists_in_zone_order(pgdat, j);
3411 build_thisnode_zonelists(pgdat);
3414 /* Construct the zonelist performance cache - see further mmzone.h */
3415 static void build_zonelist_cache(pg_data_t *pgdat)
3417 struct zonelist *zonelist;
3418 struct zonelist_cache *zlc;
3421 zonelist = &pgdat->node_zonelists[0];
3422 zonelist->zlcache_ptr = zlc = &zonelist->zlcache;
3423 bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST);
3424 for (z = zonelist->_zonerefs; z->zone; z++)
3425 zlc->z_to_n[z - zonelist->_zonerefs] = zonelist_node_idx(z);
3428 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
3430 * Return node id of node used for "local" allocations.
3431 * I.e., first node id of first zone in arg node's generic zonelist.
3432 * Used for initializing percpu 'numa_mem', which is used primarily
3433 * for kernel allocations, so use GFP_KERNEL flags to locate zonelist.
3435 int local_memory_node(int node)
3439 (void)first_zones_zonelist(node_zonelist(node, GFP_KERNEL),
3440 gfp_zone(GFP_KERNEL),
3447 #else /* CONFIG_NUMA */
3449 static void set_zonelist_order(void)
3451 current_zonelist_order = ZONELIST_ORDER_ZONE;
3454 static void build_zonelists(pg_data_t *pgdat)
3456 int node, local_node;
3458 struct zonelist *zonelist;
3460 local_node = pgdat->node_id;
3462 zonelist = &pgdat->node_zonelists[0];
3463 j = build_zonelists_node(pgdat, zonelist, 0, MAX_NR_ZONES - 1);
3466 * Now we build the zonelist so that it contains the zones
3467 * of all the other nodes.
3468 * We don't want to pressure a particular node, so when
3469 * building the zones for node N, we make sure that the
3470 * zones coming right after the local ones are those from
3471 * node N+1 (modulo N)
3473 for (node = local_node + 1; node < MAX_NUMNODES; node++) {
3474 if (!node_online(node))
3476 j = build_zonelists_node(NODE_DATA(node), zonelist, j,
3479 for (node = 0; node < local_node; node++) {
3480 if (!node_online(node))
3482 j = build_zonelists_node(NODE_DATA(node), zonelist, j,
3486 zonelist->_zonerefs[j].zone = NULL;
3487 zonelist->_zonerefs[j].zone_idx = 0;
3490 /* non-NUMA variant of zonelist performance cache - just NULL zlcache_ptr */
3491 static void build_zonelist_cache(pg_data_t *pgdat)
3493 pgdat->node_zonelists[0].zlcache_ptr = NULL;
3496 #endif /* CONFIG_NUMA */
3499 * Boot pageset table. One per cpu which is going to be used for all
3500 * zones and all nodes. The parameters will be set in such a way
3501 * that an item put on a list will immediately be handed over to
3502 * the buddy list. This is safe since pageset manipulation is done
3503 * with interrupts disabled.
3505 * The boot_pagesets must be kept even after bootup is complete for
3506 * unused processors and/or zones. They do play a role for bootstrapping
3507 * hotplugged processors.
3509 * zoneinfo_show() and maybe other functions do
3510 * not check if the processor is online before following the pageset pointer.
3511 * Other parts of the kernel may not check if the zone is available.
3513 static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch);
3514 static DEFINE_PER_CPU(struct per_cpu_pageset, boot_pageset);
3515 static void setup_zone_pageset(struct zone *zone);
3518 * Global mutex to protect against size modification of zonelists
3519 * as well as to serialize pageset setup for the new populated zone.
3521 DEFINE_MUTEX(zonelists_mutex);
3523 /* return values int ....just for stop_machine() */
3524 static int __build_all_zonelists(void *data)
3528 pg_data_t *self = data;
3531 memset(node_load, 0, sizeof(node_load));
3534 if (self && !node_online(self->node_id)) {
3535 build_zonelists(self);
3536 build_zonelist_cache(self);
3539 for_each_online_node(nid) {
3540 pg_data_t *pgdat = NODE_DATA(nid);
3542 build_zonelists(pgdat);
3543 build_zonelist_cache(pgdat);
3547 * Initialize the boot_pagesets that are going to be used
3548 * for bootstrapping processors. The real pagesets for
3549 * each zone will be allocated later when the per cpu
3550 * allocator is available.
3552 * boot_pagesets are used also for bootstrapping offline
3553 * cpus if the system is already booted because the pagesets
3554 * are needed to initialize allocators on a specific cpu too.
3555 * F.e. the percpu allocator needs the page allocator which
3556 * needs the percpu allocator in order to allocate its pagesets
3557 * (a chicken-egg dilemma).
3559 for_each_possible_cpu(cpu) {
3560 setup_pageset(&per_cpu(boot_pageset, cpu), 0);
3562 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
3564 * We now know the "local memory node" for each node--
3565 * i.e., the node of the first zone in the generic zonelist.
3566 * Set up numa_mem percpu variable for on-line cpus. During
3567 * boot, only the boot cpu should be on-line; we'll init the
3568 * secondary cpus' numa_mem as they come on-line. During
3569 * node/memory hotplug, we'll fixup all on-line cpus.
3571 if (cpu_online(cpu))
3572 set_cpu_numa_mem(cpu, local_memory_node(cpu_to_node(cpu)));
3580 * Called with zonelists_mutex held always
3581 * unless system_state == SYSTEM_BOOTING.
3583 void __ref build_all_zonelists(pg_data_t *pgdat, struct zone *zone)
3585 set_zonelist_order();
3587 if (system_state == SYSTEM_BOOTING) {
3588 __build_all_zonelists(NULL);
3589 mminit_verify_zonelist();
3590 cpuset_init_current_mems_allowed();
3592 /* we have to stop all cpus to guarantee there is no user
3594 #ifdef CONFIG_MEMORY_HOTPLUG
3596 setup_zone_pageset(zone);
3598 stop_machine(__build_all_zonelists, pgdat, NULL);
3599 /* cpuset refresh routine should be here */
3601 vm_total_pages = nr_free_pagecache_pages();
3603 * Disable grouping by mobility if the number of pages in the
3604 * system is too low to allow the mechanism to work. It would be
3605 * more accurate, but expensive to check per-zone. This check is
3606 * made on memory-hotadd so a system can start with mobility
3607 * disabled and enable it later
3609 if (vm_total_pages < (pageblock_nr_pages * MIGRATE_TYPES))
3610 page_group_by_mobility_disabled = 1;
3612 page_group_by_mobility_disabled = 0;
3614 printk("Built %i zonelists in %s order, mobility grouping %s. "
3615 "Total pages: %ld\n",
3617 zonelist_order_name[current_zonelist_order],
3618 page_group_by_mobility_disabled ? "off" : "on",
3621 printk("Policy zone: %s\n", zone_names[policy_zone]);
3626 * Helper functions to size the waitqueue hash table.
3627 * Essentially these want to choose hash table sizes sufficiently
3628 * large so that collisions trying to wait on pages are rare.
3629 * But in fact, the number of active page waitqueues on typical
3630 * systems is ridiculously low, less than 200. So this is even
3631 * conservative, even though it seems large.
3633 * The constant PAGES_PER_WAITQUEUE specifies the ratio of pages to
3634 * waitqueues, i.e. the size of the waitq table given the number of pages.
3636 #define PAGES_PER_WAITQUEUE 256
3638 #ifndef CONFIG_MEMORY_HOTPLUG
3639 static inline unsigned long wait_table_hash_nr_entries(unsigned long pages)
3641 unsigned long size = 1;
3643 pages /= PAGES_PER_WAITQUEUE;
3645 while (size < pages)
3649 * Once we have dozens or even hundreds of threads sleeping
3650 * on IO we've got bigger problems than wait queue collision.
3651 * Limit the size of the wait table to a reasonable size.
3653 size = min(size, 4096UL);
3655 return max(size, 4UL);
3659 * A zone's size might be changed by hot-add, so it is not possible to determine
3660 * a suitable size for its wait_table. So we use the maximum size now.
3662 * The max wait table size = 4096 x sizeof(wait_queue_head_t). ie:
3664 * i386 (preemption config) : 4096 x 16 = 64Kbyte.
3665 * ia64, x86-64 (no preemption): 4096 x 20 = 80Kbyte.
3666 * ia64, x86-64 (preemption) : 4096 x 24 = 96Kbyte.
3668 * The maximum entries are prepared when a zone's memory is (512K + 256) pages
3669 * or more by the traditional way. (See above). It equals:
3671 * i386, x86-64, powerpc(4K page size) : = ( 2G + 1M)byte.
3672 * ia64(16K page size) : = ( 8G + 4M)byte.
3673 * powerpc (64K page size) : = (32G +16M)byte.
3675 static inline unsigned long wait_table_hash_nr_entries(unsigned long pages)
3682 * This is an integer logarithm so that shifts can be used later
3683 * to extract the more random high bits from the multiplicative
3684 * hash function before the remainder is taken.
3686 static inline unsigned long wait_table_bits(unsigned long size)
3691 #define LONG_ALIGN(x) (((x)+(sizeof(long))-1)&~((sizeof(long))-1))
3694 * Check if a pageblock contains reserved pages
3696 static int pageblock_is_reserved(unsigned long start_pfn, unsigned long end_pfn)
3700 for (pfn = start_pfn; pfn < end_pfn; pfn++) {
3701 if (!pfn_valid_within(pfn) || PageReserved(pfn_to_page(pfn)))
3708 * Mark a number of pageblocks as MIGRATE_RESERVE. The number
3709 * of blocks reserved is based on min_wmark_pages(zone). The memory within
3710 * the reserve will tend to store contiguous free pages. Setting min_free_kbytes
3711 * higher will lead to a bigger reserve which will get freed as contiguous
3712 * blocks as reclaim kicks in
3714 static void setup_zone_migrate_reserve(struct zone *zone)
3716 unsigned long start_pfn, pfn, end_pfn, block_end_pfn;
3718 unsigned long block_migratetype;
3722 * Get the start pfn, end pfn and the number of blocks to reserve
3723 * We have to be careful to be aligned to pageblock_nr_pages to
3724 * make sure that we always check pfn_valid for the first page in
3727 start_pfn = zone->zone_start_pfn;
3728 end_pfn = start_pfn + zone->spanned_pages;
3729 start_pfn = roundup(start_pfn, pageblock_nr_pages);
3730 reserve = roundup(min_wmark_pages(zone), pageblock_nr_pages) >>
3734 * Reserve blocks are generally in place to help high-order atomic
3735 * allocations that are short-lived. A min_free_kbytes value that
3736 * would result in more than 2 reserve blocks for atomic allocations
3737 * is assumed to be in place to help anti-fragmentation for the
3738 * future allocation of hugepages at runtime.
3740 reserve = min(2, reserve);
3742 for (pfn = start_pfn; pfn < end_pfn; pfn += pageblock_nr_pages) {
3743 if (!pfn_valid(pfn))
3745 page = pfn_to_page(pfn);
3747 /* Watch out for overlapping nodes */
3748 if (page_to_nid(page) != zone_to_nid(zone))
3751 block_migratetype = get_pageblock_migratetype(page);
3753 /* Only test what is necessary when the reserves are not met */
3756 * Blocks with reserved pages will never free, skip
3759 block_end_pfn = min(pfn + pageblock_nr_pages, end_pfn);
3760 if (pageblock_is_reserved(pfn, block_end_pfn))
3763 /* If this block is reserved, account for it */
3764 if (block_migratetype == MIGRATE_RESERVE) {
3769 /* Suitable for reserving if this block is movable */
3770 if (block_migratetype == MIGRATE_MOVABLE) {
3771 set_pageblock_migratetype(page,
3773 move_freepages_block(zone, page,
3781 * If the reserve is met and this is a previous reserved block,
3784 if (block_migratetype == MIGRATE_RESERVE) {
3785 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
3786 move_freepages_block(zone, page, MIGRATE_MOVABLE);
3792 * Initially all pages are reserved - free ones are freed
3793 * up by free_all_bootmem() once the early boot process is
3794 * done. Non-atomic initialization, single-pass.
3796 void __meminit memmap_init_zone(unsigned long size, int nid, unsigned long zone,
3797 unsigned long start_pfn, enum memmap_context context)
3800 unsigned long end_pfn = start_pfn + size;
3804 if (highest_memmap_pfn < end_pfn - 1)
3805 highest_memmap_pfn = end_pfn - 1;
3807 z = &NODE_DATA(nid)->node_zones[zone];
3808 for (pfn = start_pfn; pfn < end_pfn; pfn++) {
3810 * There can be holes in boot-time mem_map[]s
3811 * handed to this function. They do not
3812 * exist on hotplugged memory.
3814 if (context == MEMMAP_EARLY) {
3815 if (!early_pfn_valid(pfn))
3817 if (!early_pfn_in_nid(pfn, nid))
3820 page = pfn_to_page(pfn);
3821 set_page_links(page, zone, nid, pfn);
3822 mminit_verify_page_links(page, zone, nid, pfn);
3823 init_page_count(page);
3824 reset_page_mapcount(page);
3825 SetPageReserved(page);
3827 * Mark the block movable so that blocks are reserved for
3828 * movable at startup. This will force kernel allocations
3829 * to reserve their blocks rather than leaking throughout
3830 * the address space during boot when many long-lived
3831 * kernel allocations are made. Later some blocks near
3832 * the start are marked MIGRATE_RESERVE by
3833 * setup_zone_migrate_reserve()
3835 * bitmap is created for zone's valid pfn range. but memmap
3836 * can be created for invalid pages (for alignment)
3837 * check here not to call set_pageblock_migratetype() against
3840 if ((z->zone_start_pfn <= pfn)
3841 && (pfn < z->zone_start_pfn + z->spanned_pages)
3842 && !(pfn & (pageblock_nr_pages - 1)))
3843 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
3845 INIT_LIST_HEAD(&page->lru);
3846 #ifdef WANT_PAGE_VIRTUAL
3847 /* The shift won't overflow because ZONE_NORMAL is below 4G. */
3848 if (!is_highmem_idx(zone))
3849 set_page_address(page, __va(pfn << PAGE_SHIFT));
3854 static void __meminit zone_init_free_lists(struct zone *zone)
3857 for_each_migratetype_order(order, t) {
3858 INIT_LIST_HEAD(&zone->free_area[order].free_list[t]);
3859 zone->free_area[order].nr_free = 0;
3863 #ifndef __HAVE_ARCH_MEMMAP_INIT
3864 #define memmap_init(size, nid, zone, start_pfn) \
3865 memmap_init_zone((size), (nid), (zone), (start_pfn), MEMMAP_EARLY)
3868 static int __meminit zone_batchsize(struct zone *zone)
3874 * The per-cpu-pages pools are set to around 1000th of the
3875 * size of the zone. But no more than 1/2 of a meg.
3877 * OK, so we don't know how big the cache is. So guess.
3879 batch = zone->present_pages / 1024;
3880 if (batch * PAGE_SIZE > 512 * 1024)
3881 batch = (512 * 1024) / PAGE_SIZE;
3882 batch /= 4; /* We effectively *= 4 below */
3887 * Clamp the batch to a 2^n - 1 value. Having a power
3888 * of 2 value was found to be more likely to have
3889 * suboptimal cache aliasing properties in some cases.
3891 * For example if 2 tasks are alternately allocating
3892 * batches of pages, one task can end up with a lot
3893 * of pages of one half of the possible page colors
3894 * and the other with pages of the other colors.
3896 batch = rounddown_pow_of_two(batch + batch/2) - 1;
3901 /* The deferral and batching of frees should be suppressed under NOMMU
3904 * The problem is that NOMMU needs to be able to allocate large chunks
3905 * of contiguous memory as there's no hardware page translation to
3906 * assemble apparent contiguous memory from discontiguous pages.
3908 * Queueing large contiguous runs of pages for batching, however,
3909 * causes the pages to actually be freed in smaller chunks. As there
3910 * can be a significant delay between the individual batches being
3911 * recycled, this leads to the once large chunks of space being
3912 * fragmented and becoming unavailable for high-order allocations.
3918 static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch)
3920 struct per_cpu_pages *pcp;
3923 memset(p, 0, sizeof(*p));
3927 pcp->high = 6 * batch;
3928 pcp->batch = max(1UL, 1 * batch);
3929 for (migratetype = 0; migratetype < MIGRATE_PCPTYPES; migratetype++)
3930 INIT_LIST_HEAD(&pcp->lists[migratetype]);
3934 * setup_pagelist_highmark() sets the high water mark for hot per_cpu_pagelist
3935 * to the value high for the pageset p.
3938 static void setup_pagelist_highmark(struct per_cpu_pageset *p,
3941 struct per_cpu_pages *pcp;
3945 pcp->batch = max(1UL, high/4);
3946 if ((high/4) > (PAGE_SHIFT * 8))
3947 pcp->batch = PAGE_SHIFT * 8;
3950 static void __meminit setup_zone_pageset(struct zone *zone)
3954 zone->pageset = alloc_percpu(struct per_cpu_pageset);
3956 for_each_possible_cpu(cpu) {
3957 struct per_cpu_pageset *pcp = per_cpu_ptr(zone->pageset, cpu);
3959 setup_pageset(pcp, zone_batchsize(zone));
3961 if (percpu_pagelist_fraction)
3962 setup_pagelist_highmark(pcp,
3963 (zone->present_pages /
3964 percpu_pagelist_fraction));
3969 * Allocate per cpu pagesets and initialize them.
3970 * Before this call only boot pagesets were available.
3972 void __init setup_per_cpu_pageset(void)
3976 for_each_populated_zone(zone)
3977 setup_zone_pageset(zone);
3980 static noinline __init_refok
3981 int zone_wait_table_init(struct zone *zone, unsigned long zone_size_pages)
3984 struct pglist_data *pgdat = zone->zone_pgdat;
3988 * The per-page waitqueue mechanism uses hashed waitqueues
3991 zone->wait_table_hash_nr_entries =
3992 wait_table_hash_nr_entries(zone_size_pages);
3993 zone->wait_table_bits =
3994 wait_table_bits(zone->wait_table_hash_nr_entries);
3995 alloc_size = zone->wait_table_hash_nr_entries
3996 * sizeof(wait_queue_head_t);
3998 if (!slab_is_available()) {
3999 zone->wait_table = (wait_queue_head_t *)
4000 alloc_bootmem_node_nopanic(pgdat, alloc_size);
4003 * This case means that a zone whose size was 0 gets new memory
4004 * via memory hot-add.
4005 * But it may be the case that a new node was hot-added. In
4006 * this case vmalloc() will not be able to use this new node's
4007 * memory - this wait_table must be initialized to use this new
4008 * node itself as well.
4009 * To use this new node's memory, further consideration will be
4012 zone->wait_table = vmalloc(alloc_size);
4014 if (!zone->wait_table)
4017 for(i = 0; i < zone->wait_table_hash_nr_entries; ++i)
4018 init_waitqueue_head(zone->wait_table + i);
4023 static __meminit void zone_pcp_init(struct zone *zone)
4026 * per cpu subsystem is not up at this point. The following code
4027 * relies on the ability of the linker to provide the
4028 * offset of a (static) per cpu variable into the per cpu area.
4030 zone->pageset = &boot_pageset;
4032 if (zone->present_pages)
4033 printk(KERN_DEBUG " %s zone: %lu pages, LIFO batch:%u\n",
4034 zone->name, zone->present_pages,
4035 zone_batchsize(zone));
4038 int __meminit init_currently_empty_zone(struct zone *zone,
4039 unsigned long zone_start_pfn,
4041 enum memmap_context context)
4043 struct pglist_data *pgdat = zone->zone_pgdat;
4045 ret = zone_wait_table_init(zone, size);
4048 pgdat->nr_zones = zone_idx(zone) + 1;
4050 zone->zone_start_pfn = zone_start_pfn;
4052 mminit_dprintk(MMINIT_TRACE, "memmap_init",
4053 "Initialising map node %d zone %lu pfns %lu -> %lu\n",
4055 (unsigned long)zone_idx(zone),
4056 zone_start_pfn, (zone_start_pfn + size));
4058 zone_init_free_lists(zone);
4063 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
4064 #ifndef CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID
4066 * Required by SPARSEMEM. Given a PFN, return what node the PFN is on.
4067 * Architectures may implement their own version but if add_active_range()
4068 * was used and there are no special requirements, this is a convenient
4071 int __meminit __early_pfn_to_nid(unsigned long pfn)
4073 unsigned long start_pfn, end_pfn;
4076 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid)
4077 if (start_pfn <= pfn && pfn < end_pfn)
4079 /* This is a memory hole */
4082 #endif /* CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID */
4084 int __meminit early_pfn_to_nid(unsigned long pfn)
4088 nid = __early_pfn_to_nid(pfn);
4091 /* just returns 0 */
4095 #ifdef CONFIG_NODES_SPAN_OTHER_NODES
4096 bool __meminit early_pfn_in_nid(unsigned long pfn, int node)
4100 nid = __early_pfn_to_nid(pfn);
4101 if (nid >= 0 && nid != node)
4108 * free_bootmem_with_active_regions - Call free_bootmem_node for each active range
4109 * @nid: The node to free memory on. If MAX_NUMNODES, all nodes are freed.
4110 * @max_low_pfn: The highest PFN that will be passed to free_bootmem_node
4112 * If an architecture guarantees that all ranges registered with
4113 * add_active_ranges() contain no holes and may be freed, this
4114 * this function may be used instead of calling free_bootmem() manually.
4116 void __init free_bootmem_with_active_regions(int nid, unsigned long max_low_pfn)
4118 unsigned long start_pfn, end_pfn;
4121 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, &this_nid) {
4122 start_pfn = min(start_pfn, max_low_pfn);
4123 end_pfn = min(end_pfn, max_low_pfn);
4125 if (start_pfn < end_pfn)
4126 free_bootmem_node(NODE_DATA(this_nid),
4127 PFN_PHYS(start_pfn),
4128 (end_pfn - start_pfn) << PAGE_SHIFT);
4133 * sparse_memory_present_with_active_regions - Call memory_present for each active range
4134 * @nid: The node to call memory_present for. If MAX_NUMNODES, all nodes will be used.
4136 * If an architecture guarantees that all ranges registered with
4137 * add_active_ranges() contain no holes and may be freed, this
4138 * function may be used instead of calling memory_present() manually.
4140 void __init sparse_memory_present_with_active_regions(int nid)
4142 unsigned long start_pfn, end_pfn;
4145 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, &this_nid)
4146 memory_present(this_nid, start_pfn, end_pfn);
4150 * get_pfn_range_for_nid - Return the start and end page frames for a node
4151 * @nid: The nid to return the range for. If MAX_NUMNODES, the min and max PFN are returned.
4152 * @start_pfn: Passed by reference. On return, it will have the node start_pfn.
4153 * @end_pfn: Passed by reference. On return, it will have the node end_pfn.
4155 * It returns the start and end page frame of a node based on information
4156 * provided by an arch calling add_active_range(). If called for a node
4157 * with no available memory, a warning is printed and the start and end
4160 void __meminit get_pfn_range_for_nid(unsigned int nid,
4161 unsigned long *start_pfn, unsigned long *end_pfn)
4163 unsigned long this_start_pfn, this_end_pfn;
4169 for_each_mem_pfn_range(i, nid, &this_start_pfn, &this_end_pfn, NULL) {
4170 *start_pfn = min(*start_pfn, this_start_pfn);
4171 *end_pfn = max(*end_pfn, this_end_pfn);
4174 if (*start_pfn == -1UL)
4179 * This finds a zone that can be used for ZONE_MOVABLE pages. The
4180 * assumption is made that zones within a node are ordered in monotonic
4181 * increasing memory addresses so that the "highest" populated zone is used
4183 static void __init find_usable_zone_for_movable(void)
4186 for (zone_index = MAX_NR_ZONES - 1; zone_index >= 0; zone_index--) {
4187 if (zone_index == ZONE_MOVABLE)
4190 if (arch_zone_highest_possible_pfn[zone_index] >
4191 arch_zone_lowest_possible_pfn[zone_index])
4195 VM_BUG_ON(zone_index == -1);
4196 movable_zone = zone_index;
4200 * The zone ranges provided by the architecture do not include ZONE_MOVABLE
4201 * because it is sized independent of architecture. Unlike the other zones,
4202 * the starting point for ZONE_MOVABLE is not fixed. It may be different
4203 * in each node depending on the size of each node and how evenly kernelcore
4204 * is distributed. This helper function adjusts the zone ranges
4205 * provided by the architecture for a given node by using the end of the
4206 * highest usable zone for ZONE_MOVABLE. This preserves the assumption that
4207 * zones within a node are in order of monotonic increases memory addresses
4209 static void __meminit adjust_zone_range_for_zone_movable(int nid,
4210 unsigned long zone_type,
4211 unsigned long node_start_pfn,
4212 unsigned long node_end_pfn,
4213 unsigned long *zone_start_pfn,
4214 unsigned long *zone_end_pfn)
4216 /* Only adjust if ZONE_MOVABLE is on this node */
4217 if (zone_movable_pfn[nid]) {
4218 /* Size ZONE_MOVABLE */
4219 if (zone_type == ZONE_MOVABLE) {
4220 *zone_start_pfn = zone_movable_pfn[nid];
4221 *zone_end_pfn = min(node_end_pfn,
4222 arch_zone_highest_possible_pfn[movable_zone]);
4224 /* Adjust for ZONE_MOVABLE starting within this range */
4225 } else if (*zone_start_pfn < zone_movable_pfn[nid] &&
4226 *zone_end_pfn > zone_movable_pfn[nid]) {
4227 *zone_end_pfn = zone_movable_pfn[nid];
4229 /* Check if this whole range is within ZONE_MOVABLE */
4230 } else if (*zone_start_pfn >= zone_movable_pfn[nid])
4231 *zone_start_pfn = *zone_end_pfn;
4236 * Return the number of pages a zone spans in a node, including holes
4237 * present_pages = zone_spanned_pages_in_node() - zone_absent_pages_in_node()
4239 static unsigned long __meminit zone_spanned_pages_in_node(int nid,
4240 unsigned long zone_type,
4241 unsigned long *ignored)
4243 unsigned long node_start_pfn, node_end_pfn;
4244 unsigned long zone_start_pfn, zone_end_pfn;
4246 /* Get the start and end of the node and zone */
4247 get_pfn_range_for_nid(nid, &node_start_pfn, &node_end_pfn);
4248 zone_start_pfn = arch_zone_lowest_possible_pfn[zone_type];
4249 zone_end_pfn = arch_zone_highest_possible_pfn[zone_type];
4250 adjust_zone_range_for_zone_movable(nid, zone_type,
4251 node_start_pfn, node_end_pfn,
4252 &zone_start_pfn, &zone_end_pfn);
4254 /* Check that this node has pages within the zone's required range */
4255 if (zone_end_pfn < node_start_pfn || zone_start_pfn > node_end_pfn)
4258 /* Move the zone boundaries inside the node if necessary */
4259 zone_end_pfn = min(zone_end_pfn, node_end_pfn);
4260 zone_start_pfn = max(zone_start_pfn, node_start_pfn);
4262 /* Return the spanned pages */
4263 return zone_end_pfn - zone_start_pfn;
4267 * Return the number of holes in a range on a node. If nid is MAX_NUMNODES,
4268 * then all holes in the requested range will be accounted for.
4270 unsigned long __meminit __absent_pages_in_range(int nid,
4271 unsigned long range_start_pfn,
4272 unsigned long range_end_pfn)
4274 unsigned long nr_absent = range_end_pfn - range_start_pfn;
4275 unsigned long start_pfn, end_pfn;
4278 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
4279 start_pfn = clamp(start_pfn, range_start_pfn, range_end_pfn);
4280 end_pfn = clamp(end_pfn, range_start_pfn, range_end_pfn);
4281 nr_absent -= end_pfn - start_pfn;
4287 * absent_pages_in_range - Return number of page frames in holes within a range
4288 * @start_pfn: The start PFN to start searching for holes
4289 * @end_pfn: The end PFN to stop searching for holes
4291 * It returns the number of pages frames in memory holes within a range.
4293 unsigned long __init absent_pages_in_range(unsigned long start_pfn,
4294 unsigned long end_pfn)
4296 return __absent_pages_in_range(MAX_NUMNODES, start_pfn, end_pfn);
4299 /* Return the number of page frames in holes in a zone on a node */
4300 static unsigned long __meminit zone_absent_pages_in_node(int nid,
4301 unsigned long zone_type,
4302 unsigned long *ignored)
4304 unsigned long zone_low = arch_zone_lowest_possible_pfn[zone_type];
4305 unsigned long zone_high = arch_zone_highest_possible_pfn[zone_type];
4306 unsigned long node_start_pfn, node_end_pfn;
4307 unsigned long zone_start_pfn, zone_end_pfn;
4309 get_pfn_range_for_nid(nid, &node_start_pfn, &node_end_pfn);
4310 zone_start_pfn = clamp(node_start_pfn, zone_low, zone_high);
4311 zone_end_pfn = clamp(node_end_pfn, zone_low, zone_high);
4313 adjust_zone_range_for_zone_movable(nid, zone_type,
4314 node_start_pfn, node_end_pfn,
4315 &zone_start_pfn, &zone_end_pfn);
4316 return __absent_pages_in_range(nid, zone_start_pfn, zone_end_pfn);
4319 #else /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
4320 static inline unsigned long __meminit zone_spanned_pages_in_node(int nid,
4321 unsigned long zone_type,
4322 unsigned long *zones_size)
4324 return zones_size[zone_type];
4327 static inline unsigned long __meminit zone_absent_pages_in_node(int nid,
4328 unsigned long zone_type,
4329 unsigned long *zholes_size)
4334 return zholes_size[zone_type];
4337 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
4339 static void __meminit calculate_node_totalpages(struct pglist_data *pgdat,
4340 unsigned long *zones_size, unsigned long *zholes_size)
4342 unsigned long realtotalpages, totalpages = 0;
4345 for (i = 0; i < MAX_NR_ZONES; i++)
4346 totalpages += zone_spanned_pages_in_node(pgdat->node_id, i,
4348 pgdat->node_spanned_pages = totalpages;
4350 realtotalpages = totalpages;
4351 for (i = 0; i < MAX_NR_ZONES; i++)
4353 zone_absent_pages_in_node(pgdat->node_id, i,
4355 pgdat->node_present_pages = realtotalpages;
4356 printk(KERN_DEBUG "On node %d totalpages: %lu\n", pgdat->node_id,
4360 #ifndef CONFIG_SPARSEMEM
4362 * Calculate the size of the zone->blockflags rounded to an unsigned long
4363 * Start by making sure zonesize is a multiple of pageblock_order by rounding
4364 * up. Then use 1 NR_PAGEBLOCK_BITS worth of bits per pageblock, finally
4365 * round what is now in bits to nearest long in bits, then return it in
4368 static unsigned long __init usemap_size(unsigned long zonesize)
4370 unsigned long usemapsize;
4372 usemapsize = roundup(zonesize, pageblock_nr_pages);
4373 usemapsize = usemapsize >> pageblock_order;
4374 usemapsize *= NR_PAGEBLOCK_BITS;
4375 usemapsize = roundup(usemapsize, 8 * sizeof(unsigned long));
4377 return usemapsize / 8;
4380 static void __init setup_usemap(struct pglist_data *pgdat,
4381 struct zone *zone, unsigned long zonesize)
4383 unsigned long usemapsize = usemap_size(zonesize);
4384 zone->pageblock_flags = NULL;
4386 zone->pageblock_flags = alloc_bootmem_node_nopanic(pgdat,
4390 static inline void setup_usemap(struct pglist_data *pgdat,
4391 struct zone *zone, unsigned long zonesize) {}
4392 #endif /* CONFIG_SPARSEMEM */
4394 #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
4396 /* Initialise the number of pages represented by NR_PAGEBLOCK_BITS */
4397 void __init set_pageblock_order(void)
4401 /* Check that pageblock_nr_pages has not already been setup */
4402 if (pageblock_order)
4405 if (HPAGE_SHIFT > PAGE_SHIFT)
4406 order = HUGETLB_PAGE_ORDER;
4408 order = MAX_ORDER - 1;
4411 * Assume the largest contiguous order of interest is a huge page.
4412 * This value may be variable depending on boot parameters on IA64 and
4415 pageblock_order = order;
4417 #else /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
4420 * When CONFIG_HUGETLB_PAGE_SIZE_VARIABLE is not set, set_pageblock_order()
4421 * is unused as pageblock_order is set at compile-time. See
4422 * include/linux/pageblock-flags.h for the values of pageblock_order based on
4425 void __init set_pageblock_order(void)
4429 #endif /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
4432 * Set up the zone data structures:
4433 * - mark all pages reserved
4434 * - mark all memory queues empty
4435 * - clear the memory bitmaps
4437 * NOTE: pgdat should get zeroed by caller.
4439 static void __paginginit free_area_init_core(struct pglist_data *pgdat,
4440 unsigned long *zones_size, unsigned long *zholes_size)
4443 int nid = pgdat->node_id;
4444 unsigned long zone_start_pfn = pgdat->node_start_pfn;
4447 pgdat_resize_init(pgdat);
4448 init_waitqueue_head(&pgdat->kswapd_wait);
4449 init_waitqueue_head(&pgdat->pfmemalloc_wait);
4450 pgdat_page_cgroup_init(pgdat);
4452 for (j = 0; j < MAX_NR_ZONES; j++) {
4453 struct zone *zone = pgdat->node_zones + j;
4454 unsigned long size, realsize, memmap_pages;
4456 size = zone_spanned_pages_in_node(nid, j, zones_size);
4457 realsize = size - zone_absent_pages_in_node(nid, j,
4461 * Adjust realsize so that it accounts for how much memory
4462 * is used by this zone for memmap. This affects the watermark
4463 * and per-cpu initialisations
4466 PAGE_ALIGN(size * sizeof(struct page)) >> PAGE_SHIFT;
4467 if (realsize >= memmap_pages) {
4468 realsize -= memmap_pages;
4471 " %s zone: %lu pages used for memmap\n",
4472 zone_names[j], memmap_pages);
4475 " %s zone: %lu pages exceeds realsize %lu\n",
4476 zone_names[j], memmap_pages, realsize);
4478 /* Account for reserved pages */
4479 if (j == 0 && realsize > dma_reserve) {
4480 realsize -= dma_reserve;
4481 printk(KERN_DEBUG " %s zone: %lu pages reserved\n",
4482 zone_names[0], dma_reserve);
4485 if (!is_highmem_idx(j))
4486 nr_kernel_pages += realsize;
4487 nr_all_pages += realsize;
4489 zone->spanned_pages = size;
4490 zone->present_pages = realsize;
4491 #if defined CONFIG_COMPACTION || defined CONFIG_CMA
4492 zone->compact_cached_free_pfn = zone->zone_start_pfn +
4493 zone->spanned_pages;
4494 zone->compact_cached_free_pfn &= ~(pageblock_nr_pages-1);
4498 zone->min_unmapped_pages = (realsize*sysctl_min_unmapped_ratio)
4500 zone->min_slab_pages = (realsize * sysctl_min_slab_ratio) / 100;
4502 zone->name = zone_names[j];
4503 spin_lock_init(&zone->lock);
4504 spin_lock_init(&zone->lru_lock);
4505 zone_seqlock_init(zone);
4506 zone->zone_pgdat = pgdat;
4508 zone_pcp_init(zone);
4509 lruvec_init(&zone->lruvec, zone);
4513 set_pageblock_order();
4514 setup_usemap(pgdat, zone, size);
4515 ret = init_currently_empty_zone(zone, zone_start_pfn,
4516 size, MEMMAP_EARLY);
4518 memmap_init(size, nid, j, zone_start_pfn);
4519 zone_start_pfn += size;
4523 static void __init_refok alloc_node_mem_map(struct pglist_data *pgdat)
4525 /* Skip empty nodes */
4526 if (!pgdat->node_spanned_pages)
4529 #ifdef CONFIG_FLAT_NODE_MEM_MAP
4530 /* ia64 gets its own node_mem_map, before this, without bootmem */
4531 if (!pgdat->node_mem_map) {
4532 unsigned long size, start, end;
4536 * The zone's endpoints aren't required to be MAX_ORDER
4537 * aligned but the node_mem_map endpoints must be in order
4538 * for the buddy allocator to function correctly.
4540 start = pgdat->node_start_pfn & ~(MAX_ORDER_NR_PAGES - 1);
4541 end = pgdat->node_start_pfn + pgdat->node_spanned_pages;
4542 end = ALIGN(end, MAX_ORDER_NR_PAGES);
4543 size = (end - start) * sizeof(struct page);
4544 map = alloc_remap(pgdat->node_id, size);
4546 map = alloc_bootmem_node_nopanic(pgdat, size);
4547 pgdat->node_mem_map = map + (pgdat->node_start_pfn - start);
4549 #ifndef CONFIG_NEED_MULTIPLE_NODES
4551 * With no DISCONTIG, the global mem_map is just set as node 0's
4553 if (pgdat == NODE_DATA(0)) {
4554 mem_map = NODE_DATA(0)->node_mem_map;
4555 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
4556 if (page_to_pfn(mem_map) != pgdat->node_start_pfn)
4557 mem_map -= (pgdat->node_start_pfn - ARCH_PFN_OFFSET);
4558 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
4561 #endif /* CONFIG_FLAT_NODE_MEM_MAP */
4564 void __paginginit free_area_init_node(int nid, unsigned long *zones_size,
4565 unsigned long node_start_pfn, unsigned long *zholes_size)
4567 pg_data_t *pgdat = NODE_DATA(nid);
4569 /* pg_data_t should be reset to zero when it's allocated */
4570 WARN_ON(pgdat->nr_zones || pgdat->classzone_idx);
4572 pgdat->node_id = nid;
4573 pgdat->node_start_pfn = node_start_pfn;
4574 calculate_node_totalpages(pgdat, zones_size, zholes_size);
4576 alloc_node_mem_map(pgdat);
4577 #ifdef CONFIG_FLAT_NODE_MEM_MAP
4578 printk(KERN_DEBUG "free_area_init_node: node %d, pgdat %08lx, node_mem_map %08lx\n",
4579 nid, (unsigned long)pgdat,
4580 (unsigned long)pgdat->node_mem_map);
4583 free_area_init_core(pgdat, zones_size, zholes_size);
4586 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
4588 #if MAX_NUMNODES > 1
4590 * Figure out the number of possible node ids.
4592 static void __init setup_nr_node_ids(void)
4595 unsigned int highest = 0;
4597 for_each_node_mask(node, node_possible_map)
4599 nr_node_ids = highest + 1;
4602 static inline void setup_nr_node_ids(void)
4608 * node_map_pfn_alignment - determine the maximum internode alignment
4610 * This function should be called after node map is populated and sorted.
4611 * It calculates the maximum power of two alignment which can distinguish
4614 * For example, if all nodes are 1GiB and aligned to 1GiB, the return value
4615 * would indicate 1GiB alignment with (1 << (30 - PAGE_SHIFT)). If the
4616 * nodes are shifted by 256MiB, 256MiB. Note that if only the last node is
4617 * shifted, 1GiB is enough and this function will indicate so.
4619 * This is used to test whether pfn -> nid mapping of the chosen memory
4620 * model has fine enough granularity to avoid incorrect mapping for the
4621 * populated node map.
4623 * Returns the determined alignment in pfn's. 0 if there is no alignment
4624 * requirement (single node).
4626 unsigned long __init node_map_pfn_alignment(void)
4628 unsigned long accl_mask = 0, last_end = 0;
4629 unsigned long start, end, mask;
4633 for_each_mem_pfn_range(i, MAX_NUMNODES, &start, &end, &nid) {
4634 if (!start || last_nid < 0 || last_nid == nid) {
4641 * Start with a mask granular enough to pin-point to the
4642 * start pfn and tick off bits one-by-one until it becomes
4643 * too coarse to separate the current node from the last.
4645 mask = ~((1 << __ffs(start)) - 1);
4646 while (mask && last_end <= (start & (mask << 1)))
4649 /* accumulate all internode masks */
4653 /* convert mask to number of pages */
4654 return ~accl_mask + 1;
4657 /* Find the lowest pfn for a node */
4658 static unsigned long __init find_min_pfn_for_node(int nid)
4660 unsigned long min_pfn = ULONG_MAX;
4661 unsigned long start_pfn;
4664 for_each_mem_pfn_range(i, nid, &start_pfn, NULL, NULL)
4665 min_pfn = min(min_pfn, start_pfn);
4667 if (min_pfn == ULONG_MAX) {
4669 "Could not find start_pfn for node %d\n", nid);
4677 * find_min_pfn_with_active_regions - Find the minimum PFN registered
4679 * It returns the minimum PFN based on information provided via
4680 * add_active_range().
4682 unsigned long __init find_min_pfn_with_active_regions(void)
4684 return find_min_pfn_for_node(MAX_NUMNODES);
4688 * early_calculate_totalpages()
4689 * Sum pages in active regions for movable zone.
4690 * Populate N_HIGH_MEMORY for calculating usable_nodes.
4692 static unsigned long __init early_calculate_totalpages(void)
4694 unsigned long totalpages = 0;
4695 unsigned long start_pfn, end_pfn;
4698 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid) {
4699 unsigned long pages = end_pfn - start_pfn;
4701 totalpages += pages;
4703 node_set_state(nid, N_HIGH_MEMORY);
4709 * Find the PFN the Movable zone begins in each node. Kernel memory
4710 * is spread evenly between nodes as long as the nodes have enough
4711 * memory. When they don't, some nodes will have more kernelcore than
4714 static void __init find_zone_movable_pfns_for_nodes(void)
4717 unsigned long usable_startpfn;
4718 unsigned long kernelcore_node, kernelcore_remaining;
4719 /* save the state before borrow the nodemask */
4720 nodemask_t saved_node_state = node_states[N_HIGH_MEMORY];
4721 unsigned long totalpages = early_calculate_totalpages();
4722 int usable_nodes = nodes_weight(node_states[N_HIGH_MEMORY]);
4725 * If movablecore was specified, calculate what size of
4726 * kernelcore that corresponds so that memory usable for
4727 * any allocation type is evenly spread. If both kernelcore
4728 * and movablecore are specified, then the value of kernelcore
4729 * will be used for required_kernelcore if it's greater than
4730 * what movablecore would have allowed.
4732 if (required_movablecore) {
4733 unsigned long corepages;
4736 * Round-up so that ZONE_MOVABLE is at least as large as what
4737 * was requested by the user
4739 required_movablecore =
4740 roundup(required_movablecore, MAX_ORDER_NR_PAGES);
4741 corepages = totalpages - required_movablecore;
4743 required_kernelcore = max(required_kernelcore, corepages);
4746 /* If kernelcore was not specified, there is no ZONE_MOVABLE */
4747 if (!required_kernelcore)
4750 /* usable_startpfn is the lowest possible pfn ZONE_MOVABLE can be at */
4751 find_usable_zone_for_movable();
4752 usable_startpfn = arch_zone_lowest_possible_pfn[movable_zone];
4755 /* Spread kernelcore memory as evenly as possible throughout nodes */
4756 kernelcore_node = required_kernelcore / usable_nodes;
4757 for_each_node_state(nid, N_HIGH_MEMORY) {
4758 unsigned long start_pfn, end_pfn;
4761 * Recalculate kernelcore_node if the division per node
4762 * now exceeds what is necessary to satisfy the requested
4763 * amount of memory for the kernel
4765 if (required_kernelcore < kernelcore_node)
4766 kernelcore_node = required_kernelcore / usable_nodes;
4769 * As the map is walked, we track how much memory is usable
4770 * by the kernel using kernelcore_remaining. When it is
4771 * 0, the rest of the node is usable by ZONE_MOVABLE
4773 kernelcore_remaining = kernelcore_node;
4775 /* Go through each range of PFNs within this node */
4776 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
4777 unsigned long size_pages;
4779 start_pfn = max(start_pfn, zone_movable_pfn[nid]);
4780 if (start_pfn >= end_pfn)
4783 /* Account for what is only usable for kernelcore */
4784 if (start_pfn < usable_startpfn) {
4785 unsigned long kernel_pages;
4786 kernel_pages = min(end_pfn, usable_startpfn)
4789 kernelcore_remaining -= min(kernel_pages,
4790 kernelcore_remaining);
4791 required_kernelcore -= min(kernel_pages,
4792 required_kernelcore);
4794 /* Continue if range is now fully accounted */
4795 if (end_pfn <= usable_startpfn) {
4798 * Push zone_movable_pfn to the end so
4799 * that if we have to rebalance
4800 * kernelcore across nodes, we will
4801 * not double account here
4803 zone_movable_pfn[nid] = end_pfn;
4806 start_pfn = usable_startpfn;
4810 * The usable PFN range for ZONE_MOVABLE is from
4811 * start_pfn->end_pfn. Calculate size_pages as the
4812 * number of pages used as kernelcore
4814 size_pages = end_pfn - start_pfn;
4815 if (size_pages > kernelcore_remaining)
4816 size_pages = kernelcore_remaining;
4817 zone_movable_pfn[nid] = start_pfn + size_pages;
4820 * Some kernelcore has been met, update counts and
4821 * break if the kernelcore for this node has been
4824 required_kernelcore -= min(required_kernelcore,
4826 kernelcore_remaining -= size_pages;
4827 if (!kernelcore_remaining)
4833 * If there is still required_kernelcore, we do another pass with one
4834 * less node in the count. This will push zone_movable_pfn[nid] further
4835 * along on the nodes that still have memory until kernelcore is
4839 if (usable_nodes && required_kernelcore > usable_nodes)
4842 /* Align start of ZONE_MOVABLE on all nids to MAX_ORDER_NR_PAGES */
4843 for (nid = 0; nid < MAX_NUMNODES; nid++)
4844 zone_movable_pfn[nid] =
4845 roundup(zone_movable_pfn[nid], MAX_ORDER_NR_PAGES);
4848 /* restore the node_state */
4849 node_states[N_HIGH_MEMORY] = saved_node_state;
4852 /* Any regular memory on that node ? */
4853 static void __init check_for_regular_memory(pg_data_t *pgdat)
4855 #ifdef CONFIG_HIGHMEM
4856 enum zone_type zone_type;
4858 for (zone_type = 0; zone_type <= ZONE_NORMAL; zone_type++) {
4859 struct zone *zone = &pgdat->node_zones[zone_type];
4860 if (zone->present_pages) {
4861 node_set_state(zone_to_nid(zone), N_NORMAL_MEMORY);
4869 * free_area_init_nodes - Initialise all pg_data_t and zone data
4870 * @max_zone_pfn: an array of max PFNs for each zone
4872 * This will call free_area_init_node() for each active node in the system.
4873 * Using the page ranges provided by add_active_range(), the size of each
4874 * zone in each node and their holes is calculated. If the maximum PFN
4875 * between two adjacent zones match, it is assumed that the zone is empty.
4876 * For example, if arch_max_dma_pfn == arch_max_dma32_pfn, it is assumed
4877 * that arch_max_dma32_pfn has no pages. It is also assumed that a zone
4878 * starts where the previous one ended. For example, ZONE_DMA32 starts
4879 * at arch_max_dma_pfn.
4881 void __init free_area_init_nodes(unsigned long *max_zone_pfn)
4883 unsigned long start_pfn, end_pfn;
4886 /* Record where the zone boundaries are */
4887 memset(arch_zone_lowest_possible_pfn, 0,
4888 sizeof(arch_zone_lowest_possible_pfn));
4889 memset(arch_zone_highest_possible_pfn, 0,
4890 sizeof(arch_zone_highest_possible_pfn));
4891 arch_zone_lowest_possible_pfn[0] = find_min_pfn_with_active_regions();
4892 arch_zone_highest_possible_pfn[0] = max_zone_pfn[0];
4893 for (i = 1; i < MAX_NR_ZONES; i++) {
4894 if (i == ZONE_MOVABLE)
4896 arch_zone_lowest_possible_pfn[i] =
4897 arch_zone_highest_possible_pfn[i-1];
4898 arch_zone_highest_possible_pfn[i] =
4899 max(max_zone_pfn[i], arch_zone_lowest_possible_pfn[i]);
4901 arch_zone_lowest_possible_pfn[ZONE_MOVABLE] = 0;
4902 arch_zone_highest_possible_pfn[ZONE_MOVABLE] = 0;
4904 /* Find the PFNs that ZONE_MOVABLE begins at in each node */
4905 memset(zone_movable_pfn, 0, sizeof(zone_movable_pfn));
4906 find_zone_movable_pfns_for_nodes();
4908 /* Print out the zone ranges */
4909 printk("Zone ranges:\n");
4910 for (i = 0; i < MAX_NR_ZONES; i++) {
4911 if (i == ZONE_MOVABLE)
4913 printk(KERN_CONT " %-8s ", zone_names[i]);
4914 if (arch_zone_lowest_possible_pfn[i] ==
4915 arch_zone_highest_possible_pfn[i])
4916 printk(KERN_CONT "empty\n");
4918 printk(KERN_CONT "[mem %0#10lx-%0#10lx]\n",
4919 arch_zone_lowest_possible_pfn[i] << PAGE_SHIFT,
4920 (arch_zone_highest_possible_pfn[i]
4921 << PAGE_SHIFT) - 1);
4924 /* Print out the PFNs ZONE_MOVABLE begins at in each node */
4925 printk("Movable zone start for each node\n");
4926 for (i = 0; i < MAX_NUMNODES; i++) {
4927 if (zone_movable_pfn[i])
4928 printk(" Node %d: %#010lx\n", i,
4929 zone_movable_pfn[i] << PAGE_SHIFT);
4932 /* Print out the early_node_map[] */
4933 printk("Early memory node ranges\n");
4934 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid)
4935 printk(" node %3d: [mem %#010lx-%#010lx]\n", nid,
4936 start_pfn << PAGE_SHIFT, (end_pfn << PAGE_SHIFT) - 1);
4938 /* Initialise every node */
4939 mminit_verify_pageflags_layout();
4940 setup_nr_node_ids();
4941 for_each_online_node(nid) {
4942 pg_data_t *pgdat = NODE_DATA(nid);
4943 free_area_init_node(nid, NULL,
4944 find_min_pfn_for_node(nid), NULL);
4946 /* Any memory on that node */
4947 if (pgdat->node_present_pages)
4948 node_set_state(nid, N_HIGH_MEMORY);
4949 check_for_regular_memory(pgdat);
4953 static int __init cmdline_parse_core(char *p, unsigned long *core)
4955 unsigned long long coremem;
4959 coremem = memparse(p, &p);
4960 *core = coremem >> PAGE_SHIFT;
4962 /* Paranoid check that UL is enough for the coremem value */
4963 WARN_ON((coremem >> PAGE_SHIFT) > ULONG_MAX);
4969 * kernelcore=size sets the amount of memory for use for allocations that
4970 * cannot be reclaimed or migrated.
4972 static int __init cmdline_parse_kernelcore(char *p)
4974 return cmdline_parse_core(p, &required_kernelcore);
4978 * movablecore=size sets the amount of memory for use for allocations that
4979 * can be reclaimed or migrated.
4981 static int __init cmdline_parse_movablecore(char *p)
4983 return cmdline_parse_core(p, &required_movablecore);
4986 early_param("kernelcore", cmdline_parse_kernelcore);
4987 early_param("movablecore", cmdline_parse_movablecore);
4989 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
4992 * set_dma_reserve - set the specified number of pages reserved in the first zone
4993 * @new_dma_reserve: The number of pages to mark reserved
4995 * The per-cpu batchsize and zone watermarks are determined by present_pages.
4996 * In the DMA zone, a significant percentage may be consumed by kernel image
4997 * and other unfreeable allocations which can skew the watermarks badly. This
4998 * function may optionally be used to account for unfreeable pages in the
4999 * first zone (e.g., ZONE_DMA). The effect will be lower watermarks and
5000 * smaller per-cpu batchsize.
5002 void __init set_dma_reserve(unsigned long new_dma_reserve)
5004 dma_reserve = new_dma_reserve;
5007 void __init free_area_init(unsigned long *zones_size)
5009 free_area_init_node(0, zones_size,
5010 __pa(PAGE_OFFSET) >> PAGE_SHIFT, NULL);
5013 static int page_alloc_cpu_notify(struct notifier_block *self,
5014 unsigned long action, void *hcpu)
5016 int cpu = (unsigned long)hcpu;
5018 if (action == CPU_DEAD || action == CPU_DEAD_FROZEN) {
5019 lru_add_drain_cpu(cpu);
5023 * Spill the event counters of the dead processor
5024 * into the current processors event counters.
5025 * This artificially elevates the count of the current
5028 vm_events_fold_cpu(cpu);
5031 * Zero the differential counters of the dead processor
5032 * so that the vm statistics are consistent.
5034 * This is only okay since the processor is dead and cannot
5035 * race with what we are doing.
5037 refresh_cpu_vm_stats(cpu);
5042 void __init page_alloc_init(void)
5044 hotcpu_notifier(page_alloc_cpu_notify, 0);
5048 * calculate_totalreserve_pages - called when sysctl_lower_zone_reserve_ratio
5049 * or min_free_kbytes changes.
5051 static void calculate_totalreserve_pages(void)
5053 struct pglist_data *pgdat;
5054 unsigned long reserve_pages = 0;
5055 enum zone_type i, j;
5057 for_each_online_pgdat(pgdat) {
5058 for (i = 0; i < MAX_NR_ZONES; i++) {
5059 struct zone *zone = pgdat->node_zones + i;
5060 unsigned long max = 0;
5062 /* Find valid and maximum lowmem_reserve in the zone */
5063 for (j = i; j < MAX_NR_ZONES; j++) {
5064 if (zone->lowmem_reserve[j] > max)
5065 max = zone->lowmem_reserve[j];
5068 /* we treat the high watermark as reserved pages. */
5069 max += high_wmark_pages(zone);
5071 if (max > zone->present_pages)
5072 max = zone->present_pages;
5073 reserve_pages += max;
5075 * Lowmem reserves are not available to
5076 * GFP_HIGHUSER page cache allocations and
5077 * kswapd tries to balance zones to their high
5078 * watermark. As a result, neither should be
5079 * regarded as dirtyable memory, to prevent a
5080 * situation where reclaim has to clean pages
5081 * in order to balance the zones.
5083 zone->dirty_balance_reserve = max;
5086 dirty_balance_reserve = reserve_pages;
5087 totalreserve_pages = reserve_pages;
5091 * setup_per_zone_lowmem_reserve - called whenever
5092 * sysctl_lower_zone_reserve_ratio changes. Ensures that each zone
5093 * has a correct pages reserved value, so an adequate number of
5094 * pages are left in the zone after a successful __alloc_pages().
5096 static void setup_per_zone_lowmem_reserve(void)
5098 struct pglist_data *pgdat;
5099 enum zone_type j, idx;
5101 for_each_online_pgdat(pgdat) {
5102 for (j = 0; j < MAX_NR_ZONES; j++) {
5103 struct zone *zone = pgdat->node_zones + j;
5104 unsigned long present_pages = zone->present_pages;
5106 zone->lowmem_reserve[j] = 0;
5110 struct zone *lower_zone;
5114 if (sysctl_lowmem_reserve_ratio[idx] < 1)
5115 sysctl_lowmem_reserve_ratio[idx] = 1;
5117 lower_zone = pgdat->node_zones + idx;
5118 lower_zone->lowmem_reserve[j] = present_pages /
5119 sysctl_lowmem_reserve_ratio[idx];
5120 present_pages += lower_zone->present_pages;
5125 /* update totalreserve_pages */
5126 calculate_totalreserve_pages();
5129 static void __setup_per_zone_wmarks(void)
5131 unsigned long pages_min = min_free_kbytes >> (PAGE_SHIFT - 10);
5132 unsigned long lowmem_pages = 0;
5134 unsigned long flags;
5136 /* Calculate total number of !ZONE_HIGHMEM pages */
5137 for_each_zone(zone) {
5138 if (!is_highmem(zone))
5139 lowmem_pages += zone->present_pages;
5142 for_each_zone(zone) {
5145 spin_lock_irqsave(&zone->lock, flags);
5146 tmp = (u64)pages_min * zone->present_pages;
5147 do_div(tmp, lowmem_pages);
5148 if (is_highmem(zone)) {
5150 * __GFP_HIGH and PF_MEMALLOC allocations usually don't
5151 * need highmem pages, so cap pages_min to a small
5154 * The WMARK_HIGH-WMARK_LOW and (WMARK_LOW-WMARK_MIN)
5155 * deltas controls asynch page reclaim, and so should
5156 * not be capped for highmem.
5160 min_pages = zone->present_pages / 1024;
5161 if (min_pages < SWAP_CLUSTER_MAX)
5162 min_pages = SWAP_CLUSTER_MAX;
5163 if (min_pages > 128)
5165 zone->watermark[WMARK_MIN] = min_pages;
5168 * If it's a lowmem zone, reserve a number of pages
5169 * proportionate to the zone's size.
5171 zone->watermark[WMARK_MIN] = tmp;
5174 zone->watermark[WMARK_LOW] = min_wmark_pages(zone) + (tmp >> 2);
5175 zone->watermark[WMARK_HIGH] = min_wmark_pages(zone) + (tmp >> 1);
5177 zone->watermark[WMARK_MIN] += cma_wmark_pages(zone);
5178 zone->watermark[WMARK_LOW] += cma_wmark_pages(zone);
5179 zone->watermark[WMARK_HIGH] += cma_wmark_pages(zone);
5181 setup_zone_migrate_reserve(zone);
5182 spin_unlock_irqrestore(&zone->lock, flags);
5185 /* update totalreserve_pages */
5186 calculate_totalreserve_pages();
5190 * setup_per_zone_wmarks - called when min_free_kbytes changes
5191 * or when memory is hot-{added|removed}
5193 * Ensures that the watermark[min,low,high] values for each zone are set
5194 * correctly with respect to min_free_kbytes.
5196 void setup_per_zone_wmarks(void)
5198 mutex_lock(&zonelists_mutex);
5199 __setup_per_zone_wmarks();
5200 mutex_unlock(&zonelists_mutex);
5204 * The inactive anon list should be small enough that the VM never has to
5205 * do too much work, but large enough that each inactive page has a chance
5206 * to be referenced again before it is swapped out.
5208 * The inactive_anon ratio is the target ratio of ACTIVE_ANON to
5209 * INACTIVE_ANON pages on this zone's LRU, maintained by the
5210 * pageout code. A zone->inactive_ratio of 3 means 3:1 or 25% of
5211 * the anonymous pages are kept on the inactive list.
5214 * memory ratio inactive anon
5215 * -------------------------------------
5224 static void __meminit calculate_zone_inactive_ratio(struct zone *zone)
5226 unsigned int gb, ratio;
5228 /* Zone size in gigabytes */
5229 gb = zone->present_pages >> (30 - PAGE_SHIFT);
5231 ratio = int_sqrt(10 * gb);
5235 zone->inactive_ratio = ratio;
5238 static void __meminit setup_per_zone_inactive_ratio(void)
5243 calculate_zone_inactive_ratio(zone);
5247 * Initialise min_free_kbytes.
5249 * For small machines we want it small (128k min). For large machines
5250 * we want it large (64MB max). But it is not linear, because network
5251 * bandwidth does not increase linearly with machine size. We use
5253 * min_free_kbytes = 4 * sqrt(lowmem_kbytes), for better accuracy:
5254 * min_free_kbytes = sqrt(lowmem_kbytes * 16)
5270 int __meminit init_per_zone_wmark_min(void)
5272 unsigned long lowmem_kbytes;
5274 lowmem_kbytes = nr_free_buffer_pages() * (PAGE_SIZE >> 10);
5276 min_free_kbytes = int_sqrt(lowmem_kbytes * 16);
5277 if (min_free_kbytes < 128)
5278 min_free_kbytes = 128;
5279 if (min_free_kbytes > 65536)
5280 min_free_kbytes = 65536;
5281 setup_per_zone_wmarks();
5282 refresh_zone_stat_thresholds();
5283 setup_per_zone_lowmem_reserve();
5284 setup_per_zone_inactive_ratio();
5287 module_init(init_per_zone_wmark_min)
5290 * min_free_kbytes_sysctl_handler - just a wrapper around proc_dointvec() so
5291 * that we can call two helper functions whenever min_free_kbytes
5294 int min_free_kbytes_sysctl_handler(ctl_table *table, int write,
5295 void __user *buffer, size_t *length, loff_t *ppos)
5297 proc_dointvec(table, write, buffer, length, ppos);
5299 setup_per_zone_wmarks();
5304 int sysctl_min_unmapped_ratio_sysctl_handler(ctl_table *table, int write,
5305 void __user *buffer, size_t *length, loff_t *ppos)
5310 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
5315 zone->min_unmapped_pages = (zone->present_pages *
5316 sysctl_min_unmapped_ratio) / 100;
5320 int sysctl_min_slab_ratio_sysctl_handler(ctl_table *table, int write,
5321 void __user *buffer, size_t *length, loff_t *ppos)
5326 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
5331 zone->min_slab_pages = (zone->present_pages *
5332 sysctl_min_slab_ratio) / 100;
5338 * lowmem_reserve_ratio_sysctl_handler - just a wrapper around
5339 * proc_dointvec() so that we can call setup_per_zone_lowmem_reserve()
5340 * whenever sysctl_lowmem_reserve_ratio changes.
5342 * The reserve ratio obviously has absolutely no relation with the
5343 * minimum watermarks. The lowmem reserve ratio can only make sense
5344 * if in function of the boot time zone sizes.
5346 int lowmem_reserve_ratio_sysctl_handler(ctl_table *table, int write,
5347 void __user *buffer, size_t *length, loff_t *ppos)
5349 proc_dointvec_minmax(table, write, buffer, length, ppos);
5350 setup_per_zone_lowmem_reserve();
5355 * percpu_pagelist_fraction - changes the pcp->high for each zone on each
5356 * cpu. It is the fraction of total pages in each zone that a hot per cpu pagelist
5357 * can have before it gets flushed back to buddy allocator.
5360 int percpu_pagelist_fraction_sysctl_handler(ctl_table *table, int write,
5361 void __user *buffer, size_t *length, loff_t *ppos)
5367 ret = proc_dointvec_minmax(table, write, buffer, length, ppos);
5368 if (!write || (ret < 0))
5370 for_each_populated_zone(zone) {
5371 for_each_possible_cpu(cpu) {
5373 high = zone->present_pages / percpu_pagelist_fraction;
5374 setup_pagelist_highmark(
5375 per_cpu_ptr(zone->pageset, cpu), high);
5381 int hashdist = HASHDIST_DEFAULT;
5384 static int __init set_hashdist(char *str)
5388 hashdist = simple_strtoul(str, &str, 0);
5391 __setup("hashdist=", set_hashdist);
5395 * allocate a large system hash table from bootmem
5396 * - it is assumed that the hash table must contain an exact power-of-2
5397 * quantity of entries
5398 * - limit is the number of hash buckets, not the total allocation size
5400 void *__init alloc_large_system_hash(const char *tablename,
5401 unsigned long bucketsize,
5402 unsigned long numentries,
5405 unsigned int *_hash_shift,
5406 unsigned int *_hash_mask,
5407 unsigned long low_limit,
5408 unsigned long high_limit)
5410 unsigned long long max = high_limit;
5411 unsigned long log2qty, size;
5414 /* allow the kernel cmdline to have a say */
5416 /* round applicable memory size up to nearest megabyte */
5417 numentries = nr_kernel_pages;
5418 numentries += (1UL << (20 - PAGE_SHIFT)) - 1;
5419 numentries >>= 20 - PAGE_SHIFT;
5420 numentries <<= 20 - PAGE_SHIFT;
5422 /* limit to 1 bucket per 2^scale bytes of low memory */
5423 if (scale > PAGE_SHIFT)
5424 numentries >>= (scale - PAGE_SHIFT);
5426 numentries <<= (PAGE_SHIFT - scale);
5428 /* Make sure we've got at least a 0-order allocation.. */
5429 if (unlikely(flags & HASH_SMALL)) {
5430 /* Makes no sense without HASH_EARLY */
5431 WARN_ON(!(flags & HASH_EARLY));
5432 if (!(numentries >> *_hash_shift)) {
5433 numentries = 1UL << *_hash_shift;
5434 BUG_ON(!numentries);
5436 } else if (unlikely((numentries * bucketsize) < PAGE_SIZE))
5437 numentries = PAGE_SIZE / bucketsize;
5439 numentries = roundup_pow_of_two(numentries);
5441 /* limit allocation size to 1/16 total memory by default */
5443 max = ((unsigned long long)nr_all_pages << PAGE_SHIFT) >> 4;
5444 do_div(max, bucketsize);
5446 max = min(max, 0x80000000ULL);
5448 if (numentries < low_limit)
5449 numentries = low_limit;
5450 if (numentries > max)
5453 log2qty = ilog2(numentries);
5456 size = bucketsize << log2qty;
5457 if (flags & HASH_EARLY)
5458 table = alloc_bootmem_nopanic(size);
5460 table = __vmalloc(size, GFP_ATOMIC, PAGE_KERNEL);
5463 * If bucketsize is not a power-of-two, we may free
5464 * some pages at the end of hash table which
5465 * alloc_pages_exact() automatically does
5467 if (get_order(size) < MAX_ORDER) {
5468 table = alloc_pages_exact(size, GFP_ATOMIC);
5469 kmemleak_alloc(table, size, 1, GFP_ATOMIC);
5472 } while (!table && size > PAGE_SIZE && --log2qty);
5475 panic("Failed to allocate %s hash table\n", tablename);
5477 printk(KERN_INFO "%s hash table entries: %ld (order: %d, %lu bytes)\n",
5480 ilog2(size) - PAGE_SHIFT,
5484 *_hash_shift = log2qty;
5486 *_hash_mask = (1 << log2qty) - 1;
5491 /* Return a pointer to the bitmap storing bits affecting a block of pages */
5492 static inline unsigned long *get_pageblock_bitmap(struct zone *zone,
5495 #ifdef CONFIG_SPARSEMEM
5496 return __pfn_to_section(pfn)->pageblock_flags;
5498 return zone->pageblock_flags;
5499 #endif /* CONFIG_SPARSEMEM */
5502 static inline int pfn_to_bitidx(struct zone *zone, unsigned long pfn)
5504 #ifdef CONFIG_SPARSEMEM
5505 pfn &= (PAGES_PER_SECTION-1);
5506 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
5508 pfn = pfn - zone->zone_start_pfn;
5509 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
5510 #endif /* CONFIG_SPARSEMEM */
5514 * get_pageblock_flags_group - Return the requested group of flags for the pageblock_nr_pages block of pages
5515 * @page: The page within the block of interest
5516 * @start_bitidx: The first bit of interest to retrieve
5517 * @end_bitidx: The last bit of interest
5518 * returns pageblock_bits flags
5520 unsigned long get_pageblock_flags_group(struct page *page,
5521 int start_bitidx, int end_bitidx)
5524 unsigned long *bitmap;
5525 unsigned long pfn, bitidx;
5526 unsigned long flags = 0;
5527 unsigned long value = 1;
5529 zone = page_zone(page);
5530 pfn = page_to_pfn(page);
5531 bitmap = get_pageblock_bitmap(zone, pfn);
5532 bitidx = pfn_to_bitidx(zone, pfn);
5534 for (; start_bitidx <= end_bitidx; start_bitidx++, value <<= 1)
5535 if (test_bit(bitidx + start_bitidx, bitmap))
5542 * set_pageblock_flags_group - Set the requested group of flags for a pageblock_nr_pages block of pages
5543 * @page: The page within the block of interest
5544 * @start_bitidx: The first bit of interest
5545 * @end_bitidx: The last bit of interest
5546 * @flags: The flags to set
5548 void set_pageblock_flags_group(struct page *page, unsigned long flags,
5549 int start_bitidx, int end_bitidx)
5552 unsigned long *bitmap;
5553 unsigned long pfn, bitidx;
5554 unsigned long value = 1;
5556 zone = page_zone(page);
5557 pfn = page_to_pfn(page);
5558 bitmap = get_pageblock_bitmap(zone, pfn);
5559 bitidx = pfn_to_bitidx(zone, pfn);
5560 VM_BUG_ON(pfn < zone->zone_start_pfn);
5561 VM_BUG_ON(pfn >= zone->zone_start_pfn + zone->spanned_pages);
5563 for (; start_bitidx <= end_bitidx; start_bitidx++, value <<= 1)
5565 __set_bit(bitidx + start_bitidx, bitmap);
5567 __clear_bit(bitidx + start_bitidx, bitmap);
5571 * This function checks whether pageblock includes unmovable pages or not.
5572 * If @count is not zero, it is okay to include less @count unmovable pages
5574 * PageLRU check wihtout isolation or lru_lock could race so that
5575 * MIGRATE_MOVABLE block might include unmovable pages. It means you can't
5576 * expect this function should be exact.
5578 bool has_unmovable_pages(struct zone *zone, struct page *page, int count)
5580 unsigned long pfn, iter, found;
5584 * For avoiding noise data, lru_add_drain_all() should be called
5585 * If ZONE_MOVABLE, the zone never contains unmovable pages
5587 if (zone_idx(zone) == ZONE_MOVABLE)
5589 mt = get_pageblock_migratetype(page);
5590 if (mt == MIGRATE_MOVABLE || is_migrate_cma(mt))
5593 pfn = page_to_pfn(page);
5594 for (found = 0, iter = 0; iter < pageblock_nr_pages; iter++) {
5595 unsigned long check = pfn + iter;
5597 if (!pfn_valid_within(check))
5600 page = pfn_to_page(check);
5602 * We can't use page_count without pin a page
5603 * because another CPU can free compound page.
5604 * This check already skips compound tails of THP
5605 * because their page->_count is zero at all time.
5607 if (!atomic_read(&page->_count)) {
5608 if (PageBuddy(page))
5609 iter += (1 << page_order(page)) - 1;
5616 * If there are RECLAIMABLE pages, we need to check it.
5617 * But now, memory offline itself doesn't call shrink_slab()
5618 * and it still to be fixed.
5621 * If the page is not RAM, page_count()should be 0.
5622 * we don't need more check. This is an _used_ not-movable page.
5624 * The problematic thing here is PG_reserved pages. PG_reserved
5625 * is set to both of a memory hole page and a _used_ kernel
5634 bool is_pageblock_removable_nolock(struct page *page)
5640 * We have to be careful here because we are iterating over memory
5641 * sections which are not zone aware so we might end up outside of
5642 * the zone but still within the section.
5643 * We have to take care about the node as well. If the node is offline
5644 * its NODE_DATA will be NULL - see page_zone.
5646 if (!node_online(page_to_nid(page)))
5649 zone = page_zone(page);
5650 pfn = page_to_pfn(page);
5651 if (zone->zone_start_pfn > pfn ||
5652 zone->zone_start_pfn + zone->spanned_pages <= pfn)
5655 return !has_unmovable_pages(zone, page, 0);
5660 static unsigned long pfn_max_align_down(unsigned long pfn)
5662 return pfn & ~(max_t(unsigned long, MAX_ORDER_NR_PAGES,
5663 pageblock_nr_pages) - 1);
5666 static unsigned long pfn_max_align_up(unsigned long pfn)
5668 return ALIGN(pfn, max_t(unsigned long, MAX_ORDER_NR_PAGES,
5669 pageblock_nr_pages));
5672 static struct page *
5673 __alloc_contig_migrate_alloc(struct page *page, unsigned long private,
5676 gfp_t gfp_mask = GFP_USER | __GFP_MOVABLE;
5678 if (PageHighMem(page))
5679 gfp_mask |= __GFP_HIGHMEM;
5681 return alloc_page(gfp_mask);
5684 /* [start, end) must belong to a single zone. */
5685 static int __alloc_contig_migrate_range(unsigned long start, unsigned long end)
5687 /* This function is based on compact_zone() from compaction.c. */
5689 unsigned long pfn = start;
5690 unsigned int tries = 0;
5693 struct compact_control cc = {
5694 .nr_migratepages = 0,
5696 .zone = page_zone(pfn_to_page(start)),
5699 INIT_LIST_HEAD(&cc.migratepages);
5701 migrate_prep_local();
5703 while (pfn < end || !list_empty(&cc.migratepages)) {
5704 if (fatal_signal_pending(current)) {
5709 if (list_empty(&cc.migratepages)) {
5710 cc.nr_migratepages = 0;
5711 pfn = isolate_migratepages_range(cc.zone, &cc,
5718 } else if (++tries == 5) {
5719 ret = ret < 0 ? ret : -EBUSY;
5723 reclaim_clean_pages_from_list(cc.zone, &cc.migratepages);
5725 ret = migrate_pages(&cc.migratepages,
5726 __alloc_contig_migrate_alloc,
5727 0, false, MIGRATE_SYNC);
5730 putback_lru_pages(&cc.migratepages);
5731 return ret > 0 ? 0 : ret;
5735 * Update zone's cma pages counter used for watermark level calculation.
5737 static inline void __update_cma_watermarks(struct zone *zone, int count)
5739 unsigned long flags;
5740 spin_lock_irqsave(&zone->lock, flags);
5741 zone->min_cma_pages += count;
5742 spin_unlock_irqrestore(&zone->lock, flags);
5743 setup_per_zone_wmarks();
5747 * Trigger memory pressure bump to reclaim some pages in order to be able to
5748 * allocate 'count' pages in single page units. Does similar work as
5749 *__alloc_pages_slowpath() function.
5751 static int __reclaim_pages(struct zone *zone, gfp_t gfp_mask, int count)
5753 enum zone_type high_zoneidx = gfp_zone(gfp_mask);
5754 struct zonelist *zonelist = node_zonelist(0, gfp_mask);
5755 int did_some_progress = 0;
5759 * Increase level of watermarks to force kswapd do his job
5760 * to stabilise at new watermark level.
5762 __update_cma_watermarks(zone, count);
5764 /* Obey watermarks as if the page was being allocated */
5765 while (!zone_watermark_ok(zone, 0, low_wmark_pages(zone), 0, 0)) {
5766 wake_all_kswapd(order, zonelist, high_zoneidx, zone_idx(zone));
5768 did_some_progress = __perform_reclaim(gfp_mask, order, zonelist,
5770 if (!did_some_progress) {
5771 /* Exhausted what can be done so it's blamo time */
5772 out_of_memory(zonelist, gfp_mask, order, NULL, false);
5776 /* Restore original watermark levels. */
5777 __update_cma_watermarks(zone, -count);
5783 * alloc_contig_range() -- tries to allocate given range of pages
5784 * @start: start PFN to allocate
5785 * @end: one-past-the-last PFN to allocate
5786 * @migratetype: migratetype of the underlaying pageblocks (either
5787 * #MIGRATE_MOVABLE or #MIGRATE_CMA). All pageblocks
5788 * in range must have the same migratetype and it must
5789 * be either of the two.
5791 * The PFN range does not have to be pageblock or MAX_ORDER_NR_PAGES
5792 * aligned, however it's the caller's responsibility to guarantee that
5793 * we are the only thread that changes migrate type of pageblocks the
5796 * The PFN range must belong to a single zone.
5798 * Returns zero on success or negative error code. On success all
5799 * pages which PFN is in [start, end) are allocated for the caller and
5800 * need to be freed with free_contig_range().
5802 int alloc_contig_range(unsigned long start, unsigned long end,
5803 unsigned migratetype)
5805 struct zone *zone = page_zone(pfn_to_page(start));
5806 unsigned long outer_start, outer_end;
5810 * What we do here is we mark all pageblocks in range as
5811 * MIGRATE_ISOLATE. Because pageblock and max order pages may
5812 * have different sizes, and due to the way page allocator
5813 * work, we align the range to biggest of the two pages so
5814 * that page allocator won't try to merge buddies from
5815 * different pageblocks and change MIGRATE_ISOLATE to some
5816 * other migration type.
5818 * Once the pageblocks are marked as MIGRATE_ISOLATE, we
5819 * migrate the pages from an unaligned range (ie. pages that
5820 * we are interested in). This will put all the pages in
5821 * range back to page allocator as MIGRATE_ISOLATE.
5823 * When this is done, we take the pages in range from page
5824 * allocator removing them from the buddy system. This way
5825 * page allocator will never consider using them.
5827 * This lets us mark the pageblocks back as
5828 * MIGRATE_CMA/MIGRATE_MOVABLE so that free pages in the
5829 * aligned range but not in the unaligned, original range are
5830 * put back to page allocator so that buddy can use them.
5833 ret = start_isolate_page_range(pfn_max_align_down(start),
5834 pfn_max_align_up(end), migratetype);
5838 ret = __alloc_contig_migrate_range(start, end);
5843 * Pages from [start, end) are within a MAX_ORDER_NR_PAGES
5844 * aligned blocks that are marked as MIGRATE_ISOLATE. What's
5845 * more, all pages in [start, end) are free in page allocator.
5846 * What we are going to do is to allocate all pages from
5847 * [start, end) (that is remove them from page allocator).
5849 * The only problem is that pages at the beginning and at the
5850 * end of interesting range may be not aligned with pages that
5851 * page allocator holds, ie. they can be part of higher order
5852 * pages. Because of this, we reserve the bigger range and
5853 * once this is done free the pages we are not interested in.
5855 * We don't have to hold zone->lock here because the pages are
5856 * isolated thus they won't get removed from buddy.
5859 lru_add_drain_all();
5863 outer_start = start;
5864 while (!PageBuddy(pfn_to_page(outer_start))) {
5865 if (++order >= MAX_ORDER) {
5869 outer_start &= ~0UL << order;
5872 /* Make sure the range is really isolated. */
5873 if (test_pages_isolated(outer_start, end)) {
5874 pr_warn("alloc_contig_range test_pages_isolated(%lx, %lx) failed\n",
5881 * Reclaim enough pages to make sure that contiguous allocation
5882 * will not starve the system.
5884 __reclaim_pages(zone, GFP_HIGHUSER_MOVABLE, end-start);
5886 /* Grab isolated pages from freelists. */
5887 outer_end = isolate_freepages_range(outer_start, end);
5893 /* Free head and tail (if any) */
5894 if (start != outer_start)
5895 free_contig_range(outer_start, start - outer_start);
5896 if (end != outer_end)
5897 free_contig_range(end, outer_end - end);
5900 undo_isolate_page_range(pfn_max_align_down(start),
5901 pfn_max_align_up(end), migratetype);
5905 void free_contig_range(unsigned long pfn, unsigned nr_pages)
5907 for (; nr_pages--; ++pfn)
5908 __free_page(pfn_to_page(pfn));
5912 #ifdef CONFIG_MEMORY_HOTPLUG
5913 static int __meminit __zone_pcp_update(void *data)
5915 struct zone *zone = data;
5917 unsigned long batch = zone_batchsize(zone), flags;
5919 for_each_possible_cpu(cpu) {
5920 struct per_cpu_pageset *pset;
5921 struct per_cpu_pages *pcp;
5923 pset = per_cpu_ptr(zone->pageset, cpu);
5926 local_irq_save(flags);
5928 free_pcppages_bulk(zone, pcp->count, pcp);
5929 setup_pageset(pset, batch);
5930 local_irq_restore(flags);
5935 void __meminit zone_pcp_update(struct zone *zone)
5937 stop_machine(__zone_pcp_update, zone, NULL);
5941 #ifdef CONFIG_MEMORY_HOTREMOVE
5942 void zone_pcp_reset(struct zone *zone)
5944 unsigned long flags;
5946 /* avoid races with drain_pages() */
5947 local_irq_save(flags);
5948 if (zone->pageset != &boot_pageset) {
5949 free_percpu(zone->pageset);
5950 zone->pageset = &boot_pageset;
5952 local_irq_restore(flags);
5956 * All pages in the range must be isolated before calling this.
5959 __offline_isolated_pages(unsigned long start_pfn, unsigned long end_pfn)
5965 unsigned long flags;
5966 /* find the first valid pfn */
5967 for (pfn = start_pfn; pfn < end_pfn; pfn++)
5972 zone = page_zone(pfn_to_page(pfn));
5973 spin_lock_irqsave(&zone->lock, flags);
5975 while (pfn < end_pfn) {
5976 if (!pfn_valid(pfn)) {
5980 page = pfn_to_page(pfn);
5981 BUG_ON(page_count(page));
5982 BUG_ON(!PageBuddy(page));
5983 order = page_order(page);
5984 #ifdef CONFIG_DEBUG_VM
5985 printk(KERN_INFO "remove from free list %lx %d %lx\n",
5986 pfn, 1 << order, end_pfn);
5988 list_del(&page->lru);
5989 rmv_page_order(page);
5990 zone->free_area[order].nr_free--;
5991 __mod_zone_page_state(zone, NR_FREE_PAGES,
5993 for (i = 0; i < (1 << order); i++)
5994 SetPageReserved((page+i));
5995 pfn += (1 << order);
5997 spin_unlock_irqrestore(&zone->lock, flags);
6001 #ifdef CONFIG_MEMORY_FAILURE
6002 bool is_free_buddy_page(struct page *page)
6004 struct zone *zone = page_zone(page);
6005 unsigned long pfn = page_to_pfn(page);
6006 unsigned long flags;
6009 spin_lock_irqsave(&zone->lock, flags);
6010 for (order = 0; order < MAX_ORDER; order++) {
6011 struct page *page_head = page - (pfn & ((1 << order) - 1));
6013 if (PageBuddy(page_head) && page_order(page_head) >= order)
6016 spin_unlock_irqrestore(&zone->lock, flags);
6018 return order < MAX_ORDER;
6022 static const struct trace_print_flags pageflag_names[] = {
6023 {1UL << PG_locked, "locked" },
6024 {1UL << PG_error, "error" },
6025 {1UL << PG_referenced, "referenced" },
6026 {1UL << PG_uptodate, "uptodate" },
6027 {1UL << PG_dirty, "dirty" },
6028 {1UL << PG_lru, "lru" },
6029 {1UL << PG_active, "active" },
6030 {1UL << PG_slab, "slab" },
6031 {1UL << PG_owner_priv_1, "owner_priv_1" },
6032 {1UL << PG_arch_1, "arch_1" },
6033 {1UL << PG_reserved, "reserved" },
6034 {1UL << PG_private, "private" },
6035 {1UL << PG_private_2, "private_2" },
6036 {1UL << PG_writeback, "writeback" },
6037 #ifdef CONFIG_PAGEFLAGS_EXTENDED
6038 {1UL << PG_head, "head" },
6039 {1UL << PG_tail, "tail" },
6041 {1UL << PG_compound, "compound" },
6043 {1UL << PG_swapcache, "swapcache" },
6044 {1UL << PG_mappedtodisk, "mappedtodisk" },
6045 {1UL << PG_reclaim, "reclaim" },
6046 {1UL << PG_swapbacked, "swapbacked" },
6047 {1UL << PG_unevictable, "unevictable" },
6049 {1UL << PG_mlocked, "mlocked" },
6051 #ifdef CONFIG_ARCH_USES_PG_UNCACHED
6052 {1UL << PG_uncached, "uncached" },
6054 #ifdef CONFIG_MEMORY_FAILURE
6055 {1UL << PG_hwpoison, "hwpoison" },
6057 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
6058 {1UL << PG_compound_lock, "compound_lock" },
6062 static void dump_page_flags(unsigned long flags)
6064 const char *delim = "";
6068 BUILD_BUG_ON(ARRAY_SIZE(pageflag_names) != __NR_PAGEFLAGS);
6070 printk(KERN_ALERT "page flags: %#lx(", flags);
6072 /* remove zone id */
6073 flags &= (1UL << NR_PAGEFLAGS) - 1;
6075 for (i = 0; i < ARRAY_SIZE(pageflag_names) && flags; i++) {
6077 mask = pageflag_names[i].mask;
6078 if ((flags & mask) != mask)
6082 printk("%s%s", delim, pageflag_names[i].name);
6086 /* check for left over flags */
6088 printk("%s%#lx", delim, flags);
6093 void dump_page(struct page *page)
6096 "page:%p count:%d mapcount:%d mapping:%p index:%#lx\n",
6097 page, atomic_read(&page->_count), page_mapcount(page),
6098 page->mapping, page->index);
6099 dump_page_flags(page->flags);
6100 mem_cgroup_print_bad_page(page);