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/memory.h>
55 #include <linux/compaction.h>
56 #include <trace/events/kmem.h>
57 #include <linux/ftrace_event.h>
58 #include <linux/memcontrol.h>
59 #include <linux/prefetch.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;
221 static void set_pageblock_migratetype(struct page *page, int migratetype)
224 if (unlikely(page_group_by_mobility_disabled))
225 migratetype = MIGRATE_UNMOVABLE;
227 set_pageblock_flags_group(page, (unsigned long)migratetype,
228 PB_migrate, PB_migrate_end);
231 bool oom_killer_disabled __read_mostly;
233 #ifdef CONFIG_DEBUG_VM
234 static int page_outside_zone_boundaries(struct zone *zone, struct page *page)
238 unsigned long pfn = page_to_pfn(page);
241 seq = zone_span_seqbegin(zone);
242 if (pfn >= zone->zone_start_pfn + zone->spanned_pages)
244 else if (pfn < zone->zone_start_pfn)
246 } while (zone_span_seqretry(zone, seq));
251 static int page_is_consistent(struct zone *zone, struct page *page)
253 if (!pfn_valid_within(page_to_pfn(page)))
255 if (zone != page_zone(page))
261 * Temporary debugging check for pages not lying within a given zone.
263 static int bad_range(struct zone *zone, struct page *page)
265 if (page_outside_zone_boundaries(zone, page))
267 if (!page_is_consistent(zone, page))
273 static inline int bad_range(struct zone *zone, struct page *page)
279 static void bad_page(struct page *page)
281 static unsigned long resume;
282 static unsigned long nr_shown;
283 static unsigned long nr_unshown;
285 /* Don't complain about poisoned pages */
286 if (PageHWPoison(page)) {
287 reset_page_mapcount(page); /* remove PageBuddy */
292 * Allow a burst of 60 reports, then keep quiet for that minute;
293 * or allow a steady drip of one report per second.
295 if (nr_shown == 60) {
296 if (time_before(jiffies, resume)) {
302 "BUG: Bad page state: %lu messages suppressed\n",
309 resume = jiffies + 60 * HZ;
311 printk(KERN_ALERT "BUG: Bad page state in process %s pfn:%05lx\n",
312 current->comm, page_to_pfn(page));
318 /* Leave bad fields for debug, except PageBuddy could make trouble */
319 reset_page_mapcount(page); /* remove PageBuddy */
320 add_taint(TAINT_BAD_PAGE);
324 * Higher-order pages are called "compound pages". They are structured thusly:
326 * The first PAGE_SIZE page is called the "head page".
328 * The remaining PAGE_SIZE pages are called "tail pages".
330 * All pages have PG_compound set. All tail pages have their ->first_page
331 * pointing at the head page.
333 * The first tail page's ->lru.next holds the address of the compound page's
334 * put_page() function. Its ->lru.prev holds the order of allocation.
335 * This usage means that zero-order pages may not be compound.
338 static void free_compound_page(struct page *page)
340 __free_pages_ok(page, compound_order(page));
343 void prep_compound_page(struct page *page, unsigned long order)
346 int nr_pages = 1 << order;
348 set_compound_page_dtor(page, free_compound_page);
349 set_compound_order(page, order);
351 for (i = 1; i < nr_pages; i++) {
352 struct page *p = page + i;
354 set_page_count(p, 0);
355 p->first_page = page;
359 /* update __split_huge_page_refcount if you change this function */
360 static int destroy_compound_page(struct page *page, unsigned long order)
363 int nr_pages = 1 << order;
366 if (unlikely(compound_order(page) != order) ||
367 unlikely(!PageHead(page))) {
372 __ClearPageHead(page);
374 for (i = 1; i < nr_pages; i++) {
375 struct page *p = page + i;
377 if (unlikely(!PageTail(p) || (p->first_page != page))) {
387 static inline void prep_zero_page(struct page *page, int order, gfp_t gfp_flags)
392 * clear_highpage() will use KM_USER0, so it's a bug to use __GFP_ZERO
393 * and __GFP_HIGHMEM from hard or soft interrupt context.
395 VM_BUG_ON((gfp_flags & __GFP_HIGHMEM) && in_interrupt());
396 for (i = 0; i < (1 << order); i++)
397 clear_highpage(page + i);
400 #ifdef CONFIG_DEBUG_PAGEALLOC
401 unsigned int _debug_guardpage_minorder;
403 static int __init debug_guardpage_minorder_setup(char *buf)
407 if (kstrtoul(buf, 10, &res) < 0 || res > MAX_ORDER / 2) {
408 printk(KERN_ERR "Bad debug_guardpage_minorder value\n");
411 _debug_guardpage_minorder = res;
412 printk(KERN_INFO "Setting debug_guardpage_minorder to %lu\n", res);
415 __setup("debug_guardpage_minorder=", debug_guardpage_minorder_setup);
417 static inline void set_page_guard_flag(struct page *page)
419 __set_bit(PAGE_DEBUG_FLAG_GUARD, &page->debug_flags);
422 static inline void clear_page_guard_flag(struct page *page)
424 __clear_bit(PAGE_DEBUG_FLAG_GUARD, &page->debug_flags);
427 static inline void set_page_guard_flag(struct page *page) { }
428 static inline void clear_page_guard_flag(struct page *page) { }
431 static inline void set_page_order(struct page *page, int order)
433 set_page_private(page, order);
434 __SetPageBuddy(page);
437 static inline void rmv_page_order(struct page *page)
439 __ClearPageBuddy(page);
440 set_page_private(page, 0);
444 * Locate the struct page for both the matching buddy in our
445 * pair (buddy1) and the combined O(n+1) page they form (page).
447 * 1) Any buddy B1 will have an order O twin B2 which satisfies
448 * the following equation:
450 * For example, if the starting buddy (buddy2) is #8 its order
452 * B2 = 8 ^ (1 << 1) = 8 ^ 2 = 10
454 * 2) Any buddy B will have an order O+1 parent P which
455 * satisfies the following equation:
458 * Assumption: *_mem_map is contiguous at least up to MAX_ORDER
460 static inline unsigned long
461 __find_buddy_index(unsigned long page_idx, unsigned int order)
463 return page_idx ^ (1 << order);
467 * This function checks whether a page is free && is the buddy
468 * we can do coalesce a page and its buddy if
469 * (a) the buddy is not in a hole &&
470 * (b) the buddy is in the buddy system &&
471 * (c) a page and its buddy have the same order &&
472 * (d) a page and its buddy are in the same zone.
474 * For recording whether a page is in the buddy system, we set ->_mapcount -2.
475 * Setting, clearing, and testing _mapcount -2 is serialized by zone->lock.
477 * For recording page's order, we use page_private(page).
479 static inline int page_is_buddy(struct page *page, struct page *buddy,
482 if (!pfn_valid_within(page_to_pfn(buddy)))
485 if (page_zone_id(page) != page_zone_id(buddy))
488 if (page_is_guard(buddy) && page_order(buddy) == order) {
489 VM_BUG_ON(page_count(buddy) != 0);
493 if (PageBuddy(buddy) && page_order(buddy) == order) {
494 VM_BUG_ON(page_count(buddy) != 0);
501 * Freeing function for a buddy system allocator.
503 * The concept of a buddy system is to maintain direct-mapped table
504 * (containing bit values) for memory blocks of various "orders".
505 * The bottom level table contains the map for the smallest allocatable
506 * units of memory (here, pages), and each level above it describes
507 * pairs of units from the levels below, hence, "buddies".
508 * At a high level, all that happens here is marking the table entry
509 * at the bottom level available, and propagating the changes upward
510 * as necessary, plus some accounting needed to play nicely with other
511 * parts of the VM system.
512 * At each level, we keep a list of pages, which are heads of continuous
513 * free pages of length of (1 << order) and marked with _mapcount -2. Page's
514 * order is recorded in page_private(page) field.
515 * So when we are allocating or freeing one, we can derive the state of the
516 * other. That is, if we allocate a small block, and both were
517 * free, the remainder of the region must be split into blocks.
518 * If a block is freed, and its buddy is also free, then this
519 * triggers coalescing into a block of larger size.
524 static inline void __free_one_page(struct page *page,
525 struct zone *zone, unsigned int order,
528 unsigned long page_idx;
529 unsigned long combined_idx;
530 unsigned long uninitialized_var(buddy_idx);
533 if (unlikely(PageCompound(page)))
534 if (unlikely(destroy_compound_page(page, order)))
537 VM_BUG_ON(migratetype == -1);
539 page_idx = page_to_pfn(page) & ((1 << MAX_ORDER) - 1);
541 VM_BUG_ON(page_idx & ((1 << order) - 1));
542 VM_BUG_ON(bad_range(zone, page));
544 while (order < MAX_ORDER-1) {
545 buddy_idx = __find_buddy_index(page_idx, order);
546 buddy = page + (buddy_idx - page_idx);
547 if (!page_is_buddy(page, buddy, order))
550 * Our buddy is free or it is CONFIG_DEBUG_PAGEALLOC guard page,
551 * merge with it and move up one order.
553 if (page_is_guard(buddy)) {
554 clear_page_guard_flag(buddy);
555 set_page_private(page, 0);
556 __mod_zone_page_state(zone, NR_FREE_PAGES, 1 << order);
558 list_del(&buddy->lru);
559 zone->free_area[order].nr_free--;
560 rmv_page_order(buddy);
562 combined_idx = buddy_idx & page_idx;
563 page = page + (combined_idx - page_idx);
564 page_idx = combined_idx;
567 set_page_order(page, order);
570 * If this is not the largest possible page, check if the buddy
571 * of the next-highest order is free. If it is, it's possible
572 * that pages are being freed that will coalesce soon. In case,
573 * that is happening, add the free page to the tail of the list
574 * so it's less likely to be used soon and more likely to be merged
575 * as a higher order page
577 if ((order < MAX_ORDER-2) && pfn_valid_within(page_to_pfn(buddy))) {
578 struct page *higher_page, *higher_buddy;
579 combined_idx = buddy_idx & page_idx;
580 higher_page = page + (combined_idx - page_idx);
581 buddy_idx = __find_buddy_index(combined_idx, order + 1);
582 higher_buddy = page + (buddy_idx - combined_idx);
583 if (page_is_buddy(higher_page, higher_buddy, order + 1)) {
584 list_add_tail(&page->lru,
585 &zone->free_area[order].free_list[migratetype]);
590 list_add(&page->lru, &zone->free_area[order].free_list[migratetype]);
592 zone->free_area[order].nr_free++;
596 * free_page_mlock() -- clean up attempts to free and mlocked() page.
597 * Page should not be on lru, so no need to fix that up.
598 * free_pages_check() will verify...
600 static inline void free_page_mlock(struct page *page)
602 __dec_zone_page_state(page, NR_MLOCK);
603 __count_vm_event(UNEVICTABLE_MLOCKFREED);
606 static inline int free_pages_check(struct page *page)
608 if (unlikely(page_mapcount(page) |
609 (page->mapping != NULL) |
610 (atomic_read(&page->_count) != 0) |
611 (page->flags & PAGE_FLAGS_CHECK_AT_FREE) |
612 (mem_cgroup_bad_page_check(page)))) {
616 if (page->flags & PAGE_FLAGS_CHECK_AT_PREP)
617 page->flags &= ~PAGE_FLAGS_CHECK_AT_PREP;
622 * Frees a number of pages from the PCP lists
623 * Assumes all pages on list are in same zone, and of same order.
624 * count is the number of pages to free.
626 * If the zone was previously in an "all pages pinned" state then look to
627 * see if this freeing clears that state.
629 * And clear the zone's pages_scanned counter, to hold off the "all pages are
630 * pinned" detection logic.
632 static void free_pcppages_bulk(struct zone *zone, int count,
633 struct per_cpu_pages *pcp)
639 spin_lock(&zone->lock);
640 zone->all_unreclaimable = 0;
641 zone->pages_scanned = 0;
645 struct list_head *list;
648 * Remove pages from lists in a round-robin fashion. A
649 * batch_free count is maintained that is incremented when an
650 * empty list is encountered. This is so more pages are freed
651 * off fuller lists instead of spinning excessively around empty
656 if (++migratetype == MIGRATE_PCPTYPES)
658 list = &pcp->lists[migratetype];
659 } while (list_empty(list));
661 /* This is the only non-empty list. Free them all. */
662 if (batch_free == MIGRATE_PCPTYPES)
663 batch_free = to_free;
666 page = list_entry(list->prev, struct page, lru);
667 /* must delete as __free_one_page list manipulates */
668 list_del(&page->lru);
669 /* MIGRATE_MOVABLE list may include MIGRATE_RESERVEs */
670 __free_one_page(page, zone, 0, page_private(page));
671 trace_mm_page_pcpu_drain(page, 0, page_private(page));
672 } while (--to_free && --batch_free && !list_empty(list));
674 __mod_zone_page_state(zone, NR_FREE_PAGES, count);
675 spin_unlock(&zone->lock);
678 static void free_one_page(struct zone *zone, struct page *page, int order,
681 spin_lock(&zone->lock);
682 zone->all_unreclaimable = 0;
683 zone->pages_scanned = 0;
685 __free_one_page(page, zone, order, migratetype);
686 __mod_zone_page_state(zone, NR_FREE_PAGES, 1 << order);
687 spin_unlock(&zone->lock);
690 static bool free_pages_prepare(struct page *page, unsigned int order)
695 trace_mm_page_free(page, order);
696 kmemcheck_free_shadow(page, order);
699 page->mapping = NULL;
700 for (i = 0; i < (1 << order); i++)
701 bad += free_pages_check(page + i);
705 if (!PageHighMem(page)) {
706 debug_check_no_locks_freed(page_address(page),PAGE_SIZE<<order);
707 debug_check_no_obj_freed(page_address(page),
710 arch_free_page(page, order);
711 kernel_map_pages(page, 1 << order, 0);
716 static void __free_pages_ok(struct page *page, unsigned int order)
719 int wasMlocked = __TestClearPageMlocked(page);
721 if (!free_pages_prepare(page, order))
724 local_irq_save(flags);
725 if (unlikely(wasMlocked))
726 free_page_mlock(page);
727 __count_vm_events(PGFREE, 1 << order);
728 free_one_page(page_zone(page), page, order,
729 get_pageblock_migratetype(page));
730 local_irq_restore(flags);
734 * permit the bootmem allocator to evade page validation on high-order frees
736 void __meminit __free_pages_bootmem(struct page *page, unsigned int order)
739 __ClearPageReserved(page);
740 set_page_count(page, 0);
741 set_page_refcounted(page);
747 for (loop = 0; loop < (1 << order); loop++) {
748 struct page *p = &page[loop];
750 if (loop + 1 < (1 << order))
752 __ClearPageReserved(p);
753 set_page_count(p, 0);
756 set_page_refcounted(page);
757 __free_pages(page, order);
763 * The order of subdivision here is critical for the IO subsystem.
764 * Please do not alter this order without good reasons and regression
765 * testing. Specifically, as large blocks of memory are subdivided,
766 * the order in which smaller blocks are delivered depends on the order
767 * they're subdivided in this function. This is the primary factor
768 * influencing the order in which pages are delivered to the IO
769 * subsystem according to empirical testing, and this is also justified
770 * by considering the behavior of a buddy system containing a single
771 * large block of memory acted on by a series of small allocations.
772 * This behavior is a critical factor in sglist merging's success.
776 static inline void expand(struct zone *zone, struct page *page,
777 int low, int high, struct free_area *area,
780 unsigned long size = 1 << high;
786 VM_BUG_ON(bad_range(zone, &page[size]));
788 #ifdef CONFIG_DEBUG_PAGEALLOC
789 if (high < debug_guardpage_minorder()) {
791 * Mark as guard pages (or page), that will allow to
792 * merge back to allocator when buddy will be freed.
793 * Corresponding page table entries will not be touched,
794 * pages will stay not present in virtual address space
796 INIT_LIST_HEAD(&page[size].lru);
797 set_page_guard_flag(&page[size]);
798 set_page_private(&page[size], high);
799 /* Guard pages are not available for any usage */
800 __mod_zone_page_state(zone, NR_FREE_PAGES, -(1 << high));
804 list_add(&page[size].lru, &area->free_list[migratetype]);
806 set_page_order(&page[size], high);
811 * This page is about to be returned from the page allocator
813 static inline int check_new_page(struct page *page)
815 if (unlikely(page_mapcount(page) |
816 (page->mapping != NULL) |
817 (atomic_read(&page->_count) != 0) |
818 (page->flags & PAGE_FLAGS_CHECK_AT_PREP) |
819 (mem_cgroup_bad_page_check(page)))) {
826 static int prep_new_page(struct page *page, int order, gfp_t gfp_flags)
830 for (i = 0; i < (1 << order); i++) {
831 struct page *p = page + i;
832 if (unlikely(check_new_page(p)))
836 set_page_private(page, 0);
837 set_page_refcounted(page);
839 arch_alloc_page(page, order);
840 kernel_map_pages(page, 1 << order, 1);
842 if (gfp_flags & __GFP_ZERO)
843 prep_zero_page(page, order, gfp_flags);
845 if (order && (gfp_flags & __GFP_COMP))
846 prep_compound_page(page, order);
852 * Go through the free lists for the given migratetype and remove
853 * the smallest available page from the freelists
856 struct page *__rmqueue_smallest(struct zone *zone, unsigned int order,
859 unsigned int current_order;
860 struct free_area * area;
863 /* Find a page of the appropriate size in the preferred list */
864 for (current_order = order; current_order < MAX_ORDER; ++current_order) {
865 area = &(zone->free_area[current_order]);
866 if (list_empty(&area->free_list[migratetype]))
869 page = list_entry(area->free_list[migratetype].next,
871 list_del(&page->lru);
872 rmv_page_order(page);
874 expand(zone, page, order, current_order, area, migratetype);
883 * This array describes the order lists are fallen back to when
884 * the free lists for the desirable migrate type are depleted
886 static int fallbacks[MIGRATE_TYPES][MIGRATE_TYPES-1] = {
887 [MIGRATE_UNMOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_MOVABLE, MIGRATE_RESERVE },
888 [MIGRATE_RECLAIMABLE] = { MIGRATE_UNMOVABLE, MIGRATE_MOVABLE, MIGRATE_RESERVE },
889 [MIGRATE_MOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_UNMOVABLE, MIGRATE_RESERVE },
890 [MIGRATE_RESERVE] = { MIGRATE_RESERVE, MIGRATE_RESERVE, MIGRATE_RESERVE }, /* Never used */
894 * Move the free pages in a range to the free lists of the requested type.
895 * Note that start_page and end_pages are not aligned on a pageblock
896 * boundary. If alignment is required, use move_freepages_block()
898 static int move_freepages(struct zone *zone,
899 struct page *start_page, struct page *end_page,
906 #ifndef CONFIG_HOLES_IN_ZONE
908 * page_zone is not safe to call in this context when
909 * CONFIG_HOLES_IN_ZONE is set. This bug check is probably redundant
910 * anyway as we check zone boundaries in move_freepages_block().
911 * Remove at a later date when no bug reports exist related to
912 * grouping pages by mobility
914 BUG_ON(page_zone(start_page) != page_zone(end_page));
917 for (page = start_page; page <= end_page;) {
918 /* Make sure we are not inadvertently changing nodes */
919 VM_BUG_ON(page_to_nid(page) != zone_to_nid(zone));
921 if (!pfn_valid_within(page_to_pfn(page))) {
926 if (!PageBuddy(page)) {
931 order = page_order(page);
932 list_move(&page->lru,
933 &zone->free_area[order].free_list[migratetype]);
935 pages_moved += 1 << order;
941 static int move_freepages_block(struct zone *zone, struct page *page,
944 unsigned long start_pfn, end_pfn;
945 struct page *start_page, *end_page;
947 start_pfn = page_to_pfn(page);
948 start_pfn = start_pfn & ~(pageblock_nr_pages-1);
949 start_page = pfn_to_page(start_pfn);
950 end_page = start_page + pageblock_nr_pages - 1;
951 end_pfn = start_pfn + pageblock_nr_pages - 1;
953 /* Do not cross zone boundaries */
954 if (start_pfn < zone->zone_start_pfn)
956 if (end_pfn >= zone->zone_start_pfn + zone->spanned_pages)
959 return move_freepages(zone, start_page, end_page, migratetype);
962 static void change_pageblock_range(struct page *pageblock_page,
963 int start_order, int migratetype)
965 int nr_pageblocks = 1 << (start_order - pageblock_order);
967 while (nr_pageblocks--) {
968 set_pageblock_migratetype(pageblock_page, migratetype);
969 pageblock_page += pageblock_nr_pages;
973 /* Remove an element from the buddy allocator from the fallback list */
974 static inline struct page *
975 __rmqueue_fallback(struct zone *zone, int order, int start_migratetype)
977 struct free_area * area;
982 /* Find the largest possible block of pages in the other list */
983 for (current_order = MAX_ORDER-1; current_order >= order;
985 for (i = 0; i < MIGRATE_TYPES - 1; i++) {
986 migratetype = fallbacks[start_migratetype][i];
988 /* MIGRATE_RESERVE handled later if necessary */
989 if (migratetype == MIGRATE_RESERVE)
992 area = &(zone->free_area[current_order]);
993 if (list_empty(&area->free_list[migratetype]))
996 page = list_entry(area->free_list[migratetype].next,
1001 * If breaking a large block of pages, move all free
1002 * pages to the preferred allocation list. If falling
1003 * back for a reclaimable kernel allocation, be more
1004 * aggressive about taking ownership of free pages
1006 if (unlikely(current_order >= (pageblock_order >> 1)) ||
1007 start_migratetype == MIGRATE_RECLAIMABLE ||
1008 page_group_by_mobility_disabled) {
1009 unsigned long pages;
1010 pages = move_freepages_block(zone, page,
1013 /* Claim the whole block if over half of it is free */
1014 if (pages >= (1 << (pageblock_order-1)) ||
1015 page_group_by_mobility_disabled)
1016 set_pageblock_migratetype(page,
1019 migratetype = start_migratetype;
1022 /* Remove the page from the freelists */
1023 list_del(&page->lru);
1024 rmv_page_order(page);
1026 /* Take ownership for orders >= pageblock_order */
1027 if (current_order >= pageblock_order)
1028 change_pageblock_range(page, current_order,
1031 expand(zone, page, order, current_order, area, migratetype);
1033 trace_mm_page_alloc_extfrag(page, order, current_order,
1034 start_migratetype, migratetype);
1044 * Do the hard work of removing an element from the buddy allocator.
1045 * Call me with the zone->lock already held.
1047 static struct page *__rmqueue(struct zone *zone, unsigned int order,
1053 page = __rmqueue_smallest(zone, order, migratetype);
1055 if (unlikely(!page) && migratetype != MIGRATE_RESERVE) {
1056 page = __rmqueue_fallback(zone, order, migratetype);
1059 * Use MIGRATE_RESERVE rather than fail an allocation. goto
1060 * is used because __rmqueue_smallest is an inline function
1061 * and we want just one call site
1064 migratetype = MIGRATE_RESERVE;
1069 trace_mm_page_alloc_zone_locked(page, order, migratetype);
1074 * Obtain a specified number of elements from the buddy allocator, all under
1075 * a single hold of the lock, for efficiency. Add them to the supplied list.
1076 * Returns the number of new pages which were placed at *list.
1078 static int rmqueue_bulk(struct zone *zone, unsigned int order,
1079 unsigned long count, struct list_head *list,
1080 int migratetype, int cold)
1084 spin_lock(&zone->lock);
1085 for (i = 0; i < count; ++i) {
1086 struct page *page = __rmqueue(zone, order, migratetype);
1087 if (unlikely(page == NULL))
1091 * Split buddy pages returned by expand() are received here
1092 * in physical page order. The page is added to the callers and
1093 * list and the list head then moves forward. From the callers
1094 * perspective, the linked list is ordered by page number in
1095 * some conditions. This is useful for IO devices that can
1096 * merge IO requests if the physical pages are ordered
1099 if (likely(cold == 0))
1100 list_add(&page->lru, list);
1102 list_add_tail(&page->lru, list);
1103 set_page_private(page, migratetype);
1106 __mod_zone_page_state(zone, NR_FREE_PAGES, -(i << order));
1107 spin_unlock(&zone->lock);
1113 * Called from the vmstat counter updater to drain pagesets of this
1114 * currently executing processor on remote nodes after they have
1117 * Note that this function must be called with the thread pinned to
1118 * a single processor.
1120 void drain_zone_pages(struct zone *zone, struct per_cpu_pages *pcp)
1122 unsigned long flags;
1125 local_irq_save(flags);
1126 if (pcp->count >= pcp->batch)
1127 to_drain = pcp->batch;
1129 to_drain = pcp->count;
1130 free_pcppages_bulk(zone, to_drain, pcp);
1131 pcp->count -= to_drain;
1132 local_irq_restore(flags);
1137 * Drain pages of the indicated processor.
1139 * The processor must either be the current processor and the
1140 * thread pinned to the current processor or a processor that
1143 static void drain_pages(unsigned int cpu)
1145 unsigned long flags;
1148 for_each_populated_zone(zone) {
1149 struct per_cpu_pageset *pset;
1150 struct per_cpu_pages *pcp;
1152 local_irq_save(flags);
1153 pset = per_cpu_ptr(zone->pageset, cpu);
1157 free_pcppages_bulk(zone, pcp->count, pcp);
1160 local_irq_restore(flags);
1165 * Spill all of this CPU's per-cpu pages back into the buddy allocator.
1167 void drain_local_pages(void *arg)
1169 drain_pages(smp_processor_id());
1173 * Spill all the per-cpu pages from all CPUs back into the buddy allocator
1175 void drain_all_pages(void)
1177 on_each_cpu(drain_local_pages, NULL, 1);
1180 #ifdef CONFIG_HIBERNATION
1182 void mark_free_pages(struct zone *zone)
1184 unsigned long pfn, max_zone_pfn;
1185 unsigned long flags;
1187 struct list_head *curr;
1189 if (!zone->spanned_pages)
1192 spin_lock_irqsave(&zone->lock, flags);
1194 max_zone_pfn = zone->zone_start_pfn + zone->spanned_pages;
1195 for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
1196 if (pfn_valid(pfn)) {
1197 struct page *page = pfn_to_page(pfn);
1199 if (!swsusp_page_is_forbidden(page))
1200 swsusp_unset_page_free(page);
1203 for_each_migratetype_order(order, t) {
1204 list_for_each(curr, &zone->free_area[order].free_list[t]) {
1207 pfn = page_to_pfn(list_entry(curr, struct page, lru));
1208 for (i = 0; i < (1UL << order); i++)
1209 swsusp_set_page_free(pfn_to_page(pfn + i));
1212 spin_unlock_irqrestore(&zone->lock, flags);
1214 #endif /* CONFIG_PM */
1217 * Free a 0-order page
1218 * cold == 1 ? free a cold page : free a hot page
1220 void free_hot_cold_page(struct page *page, int cold)
1222 struct zone *zone = page_zone(page);
1223 struct per_cpu_pages *pcp;
1224 unsigned long flags;
1226 int wasMlocked = __TestClearPageMlocked(page);
1228 if (!free_pages_prepare(page, 0))
1231 migratetype = get_pageblock_migratetype(page);
1232 set_page_private(page, migratetype);
1233 local_irq_save(flags);
1234 if (unlikely(wasMlocked))
1235 free_page_mlock(page);
1236 __count_vm_event(PGFREE);
1239 * We only track unmovable, reclaimable and movable on pcp lists.
1240 * Free ISOLATE pages back to the allocator because they are being
1241 * offlined but treat RESERVE as movable pages so we can get those
1242 * areas back if necessary. Otherwise, we may have to free
1243 * excessively into the page allocator
1245 if (migratetype >= MIGRATE_PCPTYPES) {
1246 if (unlikely(migratetype == MIGRATE_ISOLATE)) {
1247 free_one_page(zone, page, 0, migratetype);
1250 migratetype = MIGRATE_MOVABLE;
1253 pcp = &this_cpu_ptr(zone->pageset)->pcp;
1255 list_add_tail(&page->lru, &pcp->lists[migratetype]);
1257 list_add(&page->lru, &pcp->lists[migratetype]);
1259 if (pcp->count >= pcp->high) {
1260 free_pcppages_bulk(zone, pcp->batch, pcp);
1261 pcp->count -= pcp->batch;
1265 local_irq_restore(flags);
1269 * Free a list of 0-order pages
1271 void free_hot_cold_page_list(struct list_head *list, int cold)
1273 struct page *page, *next;
1275 list_for_each_entry_safe(page, next, list, lru) {
1276 trace_mm_page_free_batched(page, cold);
1277 free_hot_cold_page(page, cold);
1282 * split_page takes a non-compound higher-order page, and splits it into
1283 * n (1<<order) sub-pages: page[0..n]
1284 * Each sub-page must be freed individually.
1286 * Note: this is probably too low level an operation for use in drivers.
1287 * Please consult with lkml before using this in your driver.
1289 void split_page(struct page *page, unsigned int order)
1293 VM_BUG_ON(PageCompound(page));
1294 VM_BUG_ON(!page_count(page));
1296 #ifdef CONFIG_KMEMCHECK
1298 * Split shadow pages too, because free(page[0]) would
1299 * otherwise free the whole shadow.
1301 if (kmemcheck_page_is_tracked(page))
1302 split_page(virt_to_page(page[0].shadow), order);
1305 for (i = 1; i < (1 << order); i++)
1306 set_page_refcounted(page + i);
1310 * Similar to split_page except the page is already free. As this is only
1311 * being used for migration, the migratetype of the block also changes.
1312 * As this is called with interrupts disabled, the caller is responsible
1313 * for calling arch_alloc_page() and kernel_map_page() after interrupts
1316 * Note: this is probably too low level an operation for use in drivers.
1317 * Please consult with lkml before using this in your driver.
1319 int split_free_page(struct page *page)
1322 unsigned long watermark;
1325 BUG_ON(!PageBuddy(page));
1327 zone = page_zone(page);
1328 order = page_order(page);
1330 /* Obey watermarks as if the page was being allocated */
1331 watermark = low_wmark_pages(zone) + (1 << order);
1332 if (!zone_watermark_ok(zone, 0, watermark, 0, 0))
1335 /* Remove page from free list */
1336 list_del(&page->lru);
1337 zone->free_area[order].nr_free--;
1338 rmv_page_order(page);
1339 __mod_zone_page_state(zone, NR_FREE_PAGES, -(1UL << order));
1341 /* Split into individual pages */
1342 set_page_refcounted(page);
1343 split_page(page, order);
1345 if (order >= pageblock_order - 1) {
1346 struct page *endpage = page + (1 << order) - 1;
1347 for (; page < endpage; page += pageblock_nr_pages)
1348 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
1355 * Really, prep_compound_page() should be called from __rmqueue_bulk(). But
1356 * we cheat by calling it from here, in the order > 0 path. Saves a branch
1360 struct page *buffered_rmqueue(struct zone *preferred_zone,
1361 struct zone *zone, int order, gfp_t gfp_flags,
1364 unsigned long flags;
1366 int cold = !!(gfp_flags & __GFP_COLD);
1369 if (likely(order == 0)) {
1370 struct per_cpu_pages *pcp;
1371 struct list_head *list;
1373 local_irq_save(flags);
1374 pcp = &this_cpu_ptr(zone->pageset)->pcp;
1375 list = &pcp->lists[migratetype];
1376 if (list_empty(list)) {
1377 pcp->count += rmqueue_bulk(zone, 0,
1380 if (unlikely(list_empty(list)))
1385 page = list_entry(list->prev, struct page, lru);
1387 page = list_entry(list->next, struct page, lru);
1389 list_del(&page->lru);
1392 if (unlikely(gfp_flags & __GFP_NOFAIL)) {
1394 * __GFP_NOFAIL is not to be used in new code.
1396 * All __GFP_NOFAIL callers should be fixed so that they
1397 * properly detect and handle allocation failures.
1399 * We most definitely don't want callers attempting to
1400 * allocate greater than order-1 page units with
1403 WARN_ON_ONCE(order > 1);
1405 spin_lock_irqsave(&zone->lock, flags);
1406 page = __rmqueue(zone, order, migratetype);
1407 spin_unlock(&zone->lock);
1410 __mod_zone_page_state(zone, NR_FREE_PAGES, -(1 << order));
1413 __count_zone_vm_events(PGALLOC, zone, 1 << order);
1414 zone_statistics(preferred_zone, zone, gfp_flags);
1415 local_irq_restore(flags);
1417 VM_BUG_ON(bad_range(zone, page));
1418 if (prep_new_page(page, order, gfp_flags))
1423 local_irq_restore(flags);
1427 /* The ALLOC_WMARK bits are used as an index to zone->watermark */
1428 #define ALLOC_WMARK_MIN WMARK_MIN
1429 #define ALLOC_WMARK_LOW WMARK_LOW
1430 #define ALLOC_WMARK_HIGH WMARK_HIGH
1431 #define ALLOC_NO_WATERMARKS 0x04 /* don't check watermarks at all */
1433 /* Mask to get the watermark bits */
1434 #define ALLOC_WMARK_MASK (ALLOC_NO_WATERMARKS-1)
1436 #define ALLOC_HARDER 0x10 /* try to alloc harder */
1437 #define ALLOC_HIGH 0x20 /* __GFP_HIGH set */
1438 #define ALLOC_CPUSET 0x40 /* check for correct cpuset */
1440 #ifdef CONFIG_FAIL_PAGE_ALLOC
1443 struct fault_attr attr;
1445 u32 ignore_gfp_highmem;
1446 u32 ignore_gfp_wait;
1448 } fail_page_alloc = {
1449 .attr = FAULT_ATTR_INITIALIZER,
1450 .ignore_gfp_wait = 1,
1451 .ignore_gfp_highmem = 1,
1455 static int __init setup_fail_page_alloc(char *str)
1457 return setup_fault_attr(&fail_page_alloc.attr, str);
1459 __setup("fail_page_alloc=", setup_fail_page_alloc);
1461 static int should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
1463 if (order < fail_page_alloc.min_order)
1465 if (gfp_mask & __GFP_NOFAIL)
1467 if (fail_page_alloc.ignore_gfp_highmem && (gfp_mask & __GFP_HIGHMEM))
1469 if (fail_page_alloc.ignore_gfp_wait && (gfp_mask & __GFP_WAIT))
1472 return should_fail(&fail_page_alloc.attr, 1 << order);
1475 #ifdef CONFIG_FAULT_INJECTION_DEBUG_FS
1477 static int __init fail_page_alloc_debugfs(void)
1479 umode_t mode = S_IFREG | S_IRUSR | S_IWUSR;
1482 dir = fault_create_debugfs_attr("fail_page_alloc", NULL,
1483 &fail_page_alloc.attr);
1485 return PTR_ERR(dir);
1487 if (!debugfs_create_bool("ignore-gfp-wait", mode, dir,
1488 &fail_page_alloc.ignore_gfp_wait))
1490 if (!debugfs_create_bool("ignore-gfp-highmem", mode, dir,
1491 &fail_page_alloc.ignore_gfp_highmem))
1493 if (!debugfs_create_u32("min-order", mode, dir,
1494 &fail_page_alloc.min_order))
1499 debugfs_remove_recursive(dir);
1504 late_initcall(fail_page_alloc_debugfs);
1506 #endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */
1508 #else /* CONFIG_FAIL_PAGE_ALLOC */
1510 static inline int should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
1515 #endif /* CONFIG_FAIL_PAGE_ALLOC */
1518 * Return true if free pages are above 'mark'. This takes into account the order
1519 * of the allocation.
1521 static bool __zone_watermark_ok(struct zone *z, int order, unsigned long mark,
1522 int classzone_idx, int alloc_flags, long free_pages)
1524 /* free_pages my go negative - that's OK */
1528 free_pages -= (1 << order) + 1;
1529 if (alloc_flags & ALLOC_HIGH)
1531 if (alloc_flags & ALLOC_HARDER)
1534 if (free_pages <= min + z->lowmem_reserve[classzone_idx])
1536 for (o = 0; o < order; o++) {
1537 /* At the next order, this order's pages become unavailable */
1538 free_pages -= z->free_area[o].nr_free << o;
1540 /* Require fewer higher order pages to be free */
1543 if (free_pages <= min)
1549 bool zone_watermark_ok(struct zone *z, int order, unsigned long mark,
1550 int classzone_idx, int alloc_flags)
1552 return __zone_watermark_ok(z, order, mark, classzone_idx, alloc_flags,
1553 zone_page_state(z, NR_FREE_PAGES));
1556 bool zone_watermark_ok_safe(struct zone *z, int order, unsigned long mark,
1557 int classzone_idx, int alloc_flags)
1559 long free_pages = zone_page_state(z, NR_FREE_PAGES);
1561 if (z->percpu_drift_mark && free_pages < z->percpu_drift_mark)
1562 free_pages = zone_page_state_snapshot(z, NR_FREE_PAGES);
1564 return __zone_watermark_ok(z, order, mark, classzone_idx, alloc_flags,
1570 * zlc_setup - Setup for "zonelist cache". Uses cached zone data to
1571 * skip over zones that are not allowed by the cpuset, or that have
1572 * been recently (in last second) found to be nearly full. See further
1573 * comments in mmzone.h. Reduces cache footprint of zonelist scans
1574 * that have to skip over a lot of full or unallowed zones.
1576 * If the zonelist cache is present in the passed in zonelist, then
1577 * returns a pointer to the allowed node mask (either the current
1578 * tasks mems_allowed, or node_states[N_HIGH_MEMORY].)
1580 * If the zonelist cache is not available for this zonelist, does
1581 * nothing and returns NULL.
1583 * If the fullzones BITMAP in the zonelist cache is stale (more than
1584 * a second since last zap'd) then we zap it out (clear its bits.)
1586 * We hold off even calling zlc_setup, until after we've checked the
1587 * first zone in the zonelist, on the theory that most allocations will
1588 * be satisfied from that first zone, so best to examine that zone as
1589 * quickly as we can.
1591 static nodemask_t *zlc_setup(struct zonelist *zonelist, int alloc_flags)
1593 struct zonelist_cache *zlc; /* cached zonelist speedup info */
1594 nodemask_t *allowednodes; /* zonelist_cache approximation */
1596 zlc = zonelist->zlcache_ptr;
1600 if (time_after(jiffies, zlc->last_full_zap + HZ)) {
1601 bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST);
1602 zlc->last_full_zap = jiffies;
1605 allowednodes = !in_interrupt() && (alloc_flags & ALLOC_CPUSET) ?
1606 &cpuset_current_mems_allowed :
1607 &node_states[N_HIGH_MEMORY];
1608 return allowednodes;
1612 * Given 'z' scanning a zonelist, run a couple of quick checks to see
1613 * if it is worth looking at further for free memory:
1614 * 1) Check that the zone isn't thought to be full (doesn't have its
1615 * bit set in the zonelist_cache fullzones BITMAP).
1616 * 2) Check that the zones node (obtained from the zonelist_cache
1617 * z_to_n[] mapping) is allowed in the passed in allowednodes mask.
1618 * Return true (non-zero) if zone is worth looking at further, or
1619 * else return false (zero) if it is not.
1621 * This check -ignores- the distinction between various watermarks,
1622 * such as GFP_HIGH, GFP_ATOMIC, PF_MEMALLOC, ... If a zone is
1623 * found to be full for any variation of these watermarks, it will
1624 * be considered full for up to one second by all requests, unless
1625 * we are so low on memory on all allowed nodes that we are forced
1626 * into the second scan of the zonelist.
1628 * In the second scan we ignore this zonelist cache and exactly
1629 * apply the watermarks to all zones, even it is slower to do so.
1630 * We are low on memory in the second scan, and should leave no stone
1631 * unturned looking for a free page.
1633 static int zlc_zone_worth_trying(struct zonelist *zonelist, struct zoneref *z,
1634 nodemask_t *allowednodes)
1636 struct zonelist_cache *zlc; /* cached zonelist speedup info */
1637 int i; /* index of *z in zonelist zones */
1638 int n; /* node that zone *z is on */
1640 zlc = zonelist->zlcache_ptr;
1644 i = z - zonelist->_zonerefs;
1647 /* This zone is worth trying if it is allowed but not full */
1648 return node_isset(n, *allowednodes) && !test_bit(i, zlc->fullzones);
1652 * Given 'z' scanning a zonelist, set the corresponding bit in
1653 * zlc->fullzones, so that subsequent attempts to allocate a page
1654 * from that zone don't waste time re-examining it.
1656 static void zlc_mark_zone_full(struct zonelist *zonelist, struct zoneref *z)
1658 struct zonelist_cache *zlc; /* cached zonelist speedup info */
1659 int i; /* index of *z in zonelist zones */
1661 zlc = zonelist->zlcache_ptr;
1665 i = z - zonelist->_zonerefs;
1667 set_bit(i, zlc->fullzones);
1671 * clear all zones full, called after direct reclaim makes progress so that
1672 * a zone that was recently full is not skipped over for up to a second
1674 static void zlc_clear_zones_full(struct zonelist *zonelist)
1676 struct zonelist_cache *zlc; /* cached zonelist speedup info */
1678 zlc = zonelist->zlcache_ptr;
1682 bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST);
1685 #else /* CONFIG_NUMA */
1687 static nodemask_t *zlc_setup(struct zonelist *zonelist, int alloc_flags)
1692 static int zlc_zone_worth_trying(struct zonelist *zonelist, struct zoneref *z,
1693 nodemask_t *allowednodes)
1698 static void zlc_mark_zone_full(struct zonelist *zonelist, struct zoneref *z)
1702 static void zlc_clear_zones_full(struct zonelist *zonelist)
1705 #endif /* CONFIG_NUMA */
1708 * get_page_from_freelist goes through the zonelist trying to allocate
1711 static struct page *
1712 get_page_from_freelist(gfp_t gfp_mask, nodemask_t *nodemask, unsigned int order,
1713 struct zonelist *zonelist, int high_zoneidx, int alloc_flags,
1714 struct zone *preferred_zone, int migratetype)
1717 struct page *page = NULL;
1720 nodemask_t *allowednodes = NULL;/* zonelist_cache approximation */
1721 int zlc_active = 0; /* set if using zonelist_cache */
1722 int did_zlc_setup = 0; /* just call zlc_setup() one time */
1724 classzone_idx = zone_idx(preferred_zone);
1727 * Scan zonelist, looking for a zone with enough free.
1728 * See also cpuset_zone_allowed() comment in kernel/cpuset.c.
1730 for_each_zone_zonelist_nodemask(zone, z, zonelist,
1731 high_zoneidx, nodemask) {
1732 if (NUMA_BUILD && zlc_active &&
1733 !zlc_zone_worth_trying(zonelist, z, allowednodes))
1735 if ((alloc_flags & ALLOC_CPUSET) &&
1736 !cpuset_zone_allowed_softwall(zone, gfp_mask))
1739 * When allocating a page cache page for writing, we
1740 * want to get it from a zone that is within its dirty
1741 * limit, such that no single zone holds more than its
1742 * proportional share of globally allowed dirty pages.
1743 * The dirty limits take into account the zone's
1744 * lowmem reserves and high watermark so that kswapd
1745 * should be able to balance it without having to
1746 * write pages from its LRU list.
1748 * This may look like it could increase pressure on
1749 * lower zones by failing allocations in higher zones
1750 * before they are full. But the pages that do spill
1751 * over are limited as the lower zones are protected
1752 * by this very same mechanism. It should not become
1753 * a practical burden to them.
1755 * XXX: For now, allow allocations to potentially
1756 * exceed the per-zone dirty limit in the slowpath
1757 * (ALLOC_WMARK_LOW unset) before going into reclaim,
1758 * which is important when on a NUMA setup the allowed
1759 * zones are together not big enough to reach the
1760 * global limit. The proper fix for these situations
1761 * will require awareness of zones in the
1762 * dirty-throttling and the flusher threads.
1764 if ((alloc_flags & ALLOC_WMARK_LOW) &&
1765 (gfp_mask & __GFP_WRITE) && !zone_dirty_ok(zone))
1766 goto this_zone_full;
1768 BUILD_BUG_ON(ALLOC_NO_WATERMARKS < NR_WMARK);
1769 if (!(alloc_flags & ALLOC_NO_WATERMARKS)) {
1773 mark = zone->watermark[alloc_flags & ALLOC_WMARK_MASK];
1774 if (zone_watermark_ok(zone, order, mark,
1775 classzone_idx, alloc_flags))
1778 if (NUMA_BUILD && !did_zlc_setup && nr_online_nodes > 1) {
1780 * we do zlc_setup if there are multiple nodes
1781 * and before considering the first zone allowed
1784 allowednodes = zlc_setup(zonelist, alloc_flags);
1789 if (zone_reclaim_mode == 0)
1790 goto this_zone_full;
1793 * As we may have just activated ZLC, check if the first
1794 * eligible zone has failed zone_reclaim recently.
1796 if (NUMA_BUILD && zlc_active &&
1797 !zlc_zone_worth_trying(zonelist, z, allowednodes))
1800 ret = zone_reclaim(zone, gfp_mask, order);
1802 case ZONE_RECLAIM_NOSCAN:
1805 case ZONE_RECLAIM_FULL:
1806 /* scanned but unreclaimable */
1809 /* did we reclaim enough */
1810 if (!zone_watermark_ok(zone, order, mark,
1811 classzone_idx, alloc_flags))
1812 goto this_zone_full;
1817 page = buffered_rmqueue(preferred_zone, zone, order,
1818 gfp_mask, migratetype);
1823 zlc_mark_zone_full(zonelist, z);
1826 if (unlikely(NUMA_BUILD && page == NULL && zlc_active)) {
1827 /* Disable zlc cache for second zonelist scan */
1835 * Large machines with many possible nodes should not always dump per-node
1836 * meminfo in irq context.
1838 static inline bool should_suppress_show_mem(void)
1843 ret = in_interrupt();
1848 static DEFINE_RATELIMIT_STATE(nopage_rs,
1849 DEFAULT_RATELIMIT_INTERVAL,
1850 DEFAULT_RATELIMIT_BURST);
1852 void warn_alloc_failed(gfp_t gfp_mask, int order, const char *fmt, ...)
1854 unsigned int filter = SHOW_MEM_FILTER_NODES;
1856 if ((gfp_mask & __GFP_NOWARN) || !__ratelimit(&nopage_rs) ||
1857 debug_guardpage_minorder() > 0)
1861 * This documents exceptions given to allocations in certain
1862 * contexts that are allowed to allocate outside current's set
1865 if (!(gfp_mask & __GFP_NOMEMALLOC))
1866 if (test_thread_flag(TIF_MEMDIE) ||
1867 (current->flags & (PF_MEMALLOC | PF_EXITING)))
1868 filter &= ~SHOW_MEM_FILTER_NODES;
1869 if (in_interrupt() || !(gfp_mask & __GFP_WAIT))
1870 filter &= ~SHOW_MEM_FILTER_NODES;
1873 struct va_format vaf;
1876 va_start(args, fmt);
1881 pr_warn("%pV", &vaf);
1886 pr_warn("%s: page allocation failure: order:%d, mode:0x%x\n",
1887 current->comm, order, gfp_mask);
1890 if (!should_suppress_show_mem())
1895 should_alloc_retry(gfp_t gfp_mask, unsigned int order,
1896 unsigned long did_some_progress,
1897 unsigned long pages_reclaimed)
1899 /* Do not loop if specifically requested */
1900 if (gfp_mask & __GFP_NORETRY)
1903 /* Always retry if specifically requested */
1904 if (gfp_mask & __GFP_NOFAIL)
1908 * Suspend converts GFP_KERNEL to __GFP_WAIT which can prevent reclaim
1909 * making forward progress without invoking OOM. Suspend also disables
1910 * storage devices so kswapd will not help. Bail if we are suspending.
1912 if (!did_some_progress && pm_suspended_storage())
1916 * In this implementation, order <= PAGE_ALLOC_COSTLY_ORDER
1917 * means __GFP_NOFAIL, but that may not be true in other
1920 if (order <= PAGE_ALLOC_COSTLY_ORDER)
1924 * For order > PAGE_ALLOC_COSTLY_ORDER, if __GFP_REPEAT is
1925 * specified, then we retry until we no longer reclaim any pages
1926 * (above), or we've reclaimed an order of pages at least as
1927 * large as the allocation's order. In both cases, if the
1928 * allocation still fails, we stop retrying.
1930 if (gfp_mask & __GFP_REPEAT && pages_reclaimed < (1 << order))
1936 static inline struct page *
1937 __alloc_pages_may_oom(gfp_t gfp_mask, unsigned int order,
1938 struct zonelist *zonelist, enum zone_type high_zoneidx,
1939 nodemask_t *nodemask, struct zone *preferred_zone,
1944 /* Acquire the OOM killer lock for the zones in zonelist */
1945 if (!try_set_zonelist_oom(zonelist, gfp_mask)) {
1946 schedule_timeout_uninterruptible(1);
1951 * Go through the zonelist yet one more time, keep very high watermark
1952 * here, this is only to catch a parallel oom killing, we must fail if
1953 * we're still under heavy pressure.
1955 page = get_page_from_freelist(gfp_mask|__GFP_HARDWALL, nodemask,
1956 order, zonelist, high_zoneidx,
1957 ALLOC_WMARK_HIGH|ALLOC_CPUSET,
1958 preferred_zone, migratetype);
1962 if (!(gfp_mask & __GFP_NOFAIL)) {
1963 /* The OOM killer will not help higher order allocs */
1964 if (order > PAGE_ALLOC_COSTLY_ORDER)
1966 /* The OOM killer does not needlessly kill tasks for lowmem */
1967 if (high_zoneidx < ZONE_NORMAL)
1970 * GFP_THISNODE contains __GFP_NORETRY and we never hit this.
1971 * Sanity check for bare calls of __GFP_THISNODE, not real OOM.
1972 * The caller should handle page allocation failure by itself if
1973 * it specifies __GFP_THISNODE.
1974 * Note: Hugepage uses it but will hit PAGE_ALLOC_COSTLY_ORDER.
1976 if (gfp_mask & __GFP_THISNODE)
1979 /* Exhausted what can be done so it's blamo time */
1980 out_of_memory(zonelist, gfp_mask, order, nodemask);
1983 clear_zonelist_oom(zonelist, gfp_mask);
1987 #ifdef CONFIG_COMPACTION
1988 /* Try memory compaction for high-order allocations before reclaim */
1989 static struct page *
1990 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
1991 struct zonelist *zonelist, enum zone_type high_zoneidx,
1992 nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone,
1993 int migratetype, unsigned long *did_some_progress,
1994 bool sync_migration)
1998 if (!order || compaction_deferred(preferred_zone))
2001 current->flags |= PF_MEMALLOC;
2002 *did_some_progress = try_to_compact_pages(zonelist, order, gfp_mask,
2003 nodemask, sync_migration);
2004 current->flags &= ~PF_MEMALLOC;
2005 if (*did_some_progress != COMPACT_SKIPPED) {
2007 /* Page migration frees to the PCP lists but we want merging */
2008 drain_pages(get_cpu());
2011 page = get_page_from_freelist(gfp_mask, nodemask,
2012 order, zonelist, high_zoneidx,
2013 alloc_flags, preferred_zone,
2016 preferred_zone->compact_considered = 0;
2017 preferred_zone->compact_defer_shift = 0;
2018 count_vm_event(COMPACTSUCCESS);
2023 * It's bad if compaction run occurs and fails.
2024 * The most likely reason is that pages exist,
2025 * but not enough to satisfy watermarks.
2027 count_vm_event(COMPACTFAIL);
2028 defer_compaction(preferred_zone);
2036 static inline struct page *
2037 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
2038 struct zonelist *zonelist, enum zone_type high_zoneidx,
2039 nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone,
2040 int migratetype, unsigned long *did_some_progress,
2041 bool sync_migration)
2045 #endif /* CONFIG_COMPACTION */
2047 /* The really slow allocator path where we enter direct reclaim */
2048 static inline struct page *
2049 __alloc_pages_direct_reclaim(gfp_t gfp_mask, unsigned int order,
2050 struct zonelist *zonelist, enum zone_type high_zoneidx,
2051 nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone,
2052 int migratetype, unsigned long *did_some_progress)
2054 struct page *page = NULL;
2055 struct reclaim_state reclaim_state;
2056 bool drained = false;
2060 /* We now go into synchronous reclaim */
2061 cpuset_memory_pressure_bump();
2062 current->flags |= PF_MEMALLOC;
2063 lockdep_set_current_reclaim_state(gfp_mask);
2064 reclaim_state.reclaimed_slab = 0;
2065 current->reclaim_state = &reclaim_state;
2067 *did_some_progress = try_to_free_pages(zonelist, order, gfp_mask, nodemask);
2069 current->reclaim_state = NULL;
2070 lockdep_clear_current_reclaim_state();
2071 current->flags &= ~PF_MEMALLOC;
2075 if (unlikely(!(*did_some_progress)))
2078 /* After successful reclaim, reconsider all zones for allocation */
2080 zlc_clear_zones_full(zonelist);
2083 page = get_page_from_freelist(gfp_mask, nodemask, order,
2084 zonelist, high_zoneidx,
2085 alloc_flags, preferred_zone,
2089 * If an allocation failed after direct reclaim, it could be because
2090 * pages are pinned on the per-cpu lists. Drain them and try again
2092 if (!page && !drained) {
2102 * This is called in the allocator slow-path if the allocation request is of
2103 * sufficient urgency to ignore watermarks and take other desperate measures
2105 static inline struct page *
2106 __alloc_pages_high_priority(gfp_t gfp_mask, unsigned int order,
2107 struct zonelist *zonelist, enum zone_type high_zoneidx,
2108 nodemask_t *nodemask, struct zone *preferred_zone,
2114 page = get_page_from_freelist(gfp_mask, nodemask, order,
2115 zonelist, high_zoneidx, ALLOC_NO_WATERMARKS,
2116 preferred_zone, migratetype);
2118 if (!page && gfp_mask & __GFP_NOFAIL)
2119 wait_iff_congested(preferred_zone, BLK_RW_ASYNC, HZ/50);
2120 } while (!page && (gfp_mask & __GFP_NOFAIL));
2126 void wake_all_kswapd(unsigned int order, struct zonelist *zonelist,
2127 enum zone_type high_zoneidx,
2128 enum zone_type classzone_idx)
2133 for_each_zone_zonelist(zone, z, zonelist, high_zoneidx)
2134 wakeup_kswapd(zone, order, classzone_idx);
2138 gfp_to_alloc_flags(gfp_t gfp_mask)
2140 int alloc_flags = ALLOC_WMARK_MIN | ALLOC_CPUSET;
2141 const gfp_t wait = gfp_mask & __GFP_WAIT;
2143 /* __GFP_HIGH is assumed to be the same as ALLOC_HIGH to save a branch. */
2144 BUILD_BUG_ON(__GFP_HIGH != (__force gfp_t) ALLOC_HIGH);
2147 * The caller may dip into page reserves a bit more if the caller
2148 * cannot run direct reclaim, or if the caller has realtime scheduling
2149 * policy or is asking for __GFP_HIGH memory. GFP_ATOMIC requests will
2150 * set both ALLOC_HARDER (!wait) and ALLOC_HIGH (__GFP_HIGH).
2152 alloc_flags |= (__force int) (gfp_mask & __GFP_HIGH);
2156 * Not worth trying to allocate harder for
2157 * __GFP_NOMEMALLOC even if it can't schedule.
2159 if (!(gfp_mask & __GFP_NOMEMALLOC))
2160 alloc_flags |= ALLOC_HARDER;
2162 * Ignore cpuset if GFP_ATOMIC (!wait) rather than fail alloc.
2163 * See also cpuset_zone_allowed() comment in kernel/cpuset.c.
2165 alloc_flags &= ~ALLOC_CPUSET;
2166 } else if (unlikely(rt_task(current)) && !in_interrupt())
2167 alloc_flags |= ALLOC_HARDER;
2169 if (likely(!(gfp_mask & __GFP_NOMEMALLOC))) {
2170 if (!in_interrupt() &&
2171 ((current->flags & PF_MEMALLOC) ||
2172 unlikely(test_thread_flag(TIF_MEMDIE))))
2173 alloc_flags |= ALLOC_NO_WATERMARKS;
2179 static inline struct page *
2180 __alloc_pages_slowpath(gfp_t gfp_mask, unsigned int order,
2181 struct zonelist *zonelist, enum zone_type high_zoneidx,
2182 nodemask_t *nodemask, struct zone *preferred_zone,
2185 const gfp_t wait = gfp_mask & __GFP_WAIT;
2186 struct page *page = NULL;
2188 unsigned long pages_reclaimed = 0;
2189 unsigned long did_some_progress;
2190 bool sync_migration = false;
2193 * In the slowpath, we sanity check order to avoid ever trying to
2194 * reclaim >= MAX_ORDER areas which will never succeed. Callers may
2195 * be using allocators in order of preference for an area that is
2198 if (order >= MAX_ORDER) {
2199 WARN_ON_ONCE(!(gfp_mask & __GFP_NOWARN));
2204 * GFP_THISNODE (meaning __GFP_THISNODE, __GFP_NORETRY and
2205 * __GFP_NOWARN set) should not cause reclaim since the subsystem
2206 * (f.e. slab) using GFP_THISNODE may choose to trigger reclaim
2207 * using a larger set of nodes after it has established that the
2208 * allowed per node queues are empty and that nodes are
2211 if (NUMA_BUILD && (gfp_mask & GFP_THISNODE) == GFP_THISNODE)
2215 if (!(gfp_mask & __GFP_NO_KSWAPD))
2216 wake_all_kswapd(order, zonelist, high_zoneidx,
2217 zone_idx(preferred_zone));
2220 * OK, we're below the kswapd watermark and have kicked background
2221 * reclaim. Now things get more complex, so set up alloc_flags according
2222 * to how we want to proceed.
2224 alloc_flags = gfp_to_alloc_flags(gfp_mask);
2227 * Find the true preferred zone if the allocation is unconstrained by
2230 if (!(alloc_flags & ALLOC_CPUSET) && !nodemask)
2231 first_zones_zonelist(zonelist, high_zoneidx, NULL,
2235 /* This is the last chance, in general, before the goto nopage. */
2236 page = get_page_from_freelist(gfp_mask, nodemask, order, zonelist,
2237 high_zoneidx, alloc_flags & ~ALLOC_NO_WATERMARKS,
2238 preferred_zone, migratetype);
2242 /* Allocate without watermarks if the context allows */
2243 if (alloc_flags & ALLOC_NO_WATERMARKS) {
2244 page = __alloc_pages_high_priority(gfp_mask, order,
2245 zonelist, high_zoneidx, nodemask,
2246 preferred_zone, migratetype);
2251 /* Atomic allocations - we can't balance anything */
2255 /* Avoid recursion of direct reclaim */
2256 if (current->flags & PF_MEMALLOC)
2259 /* Avoid allocations with no watermarks from looping endlessly */
2260 if (test_thread_flag(TIF_MEMDIE) && !(gfp_mask & __GFP_NOFAIL))
2264 * Try direct compaction. The first pass is asynchronous. Subsequent
2265 * attempts after direct reclaim are synchronous
2267 page = __alloc_pages_direct_compact(gfp_mask, order,
2268 zonelist, high_zoneidx,
2270 alloc_flags, preferred_zone,
2271 migratetype, &did_some_progress,
2275 sync_migration = true;
2277 /* Try direct reclaim and then allocating */
2278 page = __alloc_pages_direct_reclaim(gfp_mask, order,
2279 zonelist, high_zoneidx,
2281 alloc_flags, preferred_zone,
2282 migratetype, &did_some_progress);
2287 * If we failed to make any progress reclaiming, then we are
2288 * running out of options and have to consider going OOM
2290 if (!did_some_progress) {
2291 if ((gfp_mask & __GFP_FS) && !(gfp_mask & __GFP_NORETRY)) {
2292 if (oom_killer_disabled)
2294 page = __alloc_pages_may_oom(gfp_mask, order,
2295 zonelist, high_zoneidx,
2296 nodemask, preferred_zone,
2301 if (!(gfp_mask & __GFP_NOFAIL)) {
2303 * The oom killer is not called for high-order
2304 * allocations that may fail, so if no progress
2305 * is being made, there are no other options and
2306 * retrying is unlikely to help.
2308 if (order > PAGE_ALLOC_COSTLY_ORDER)
2311 * The oom killer is not called for lowmem
2312 * allocations to prevent needlessly killing
2315 if (high_zoneidx < ZONE_NORMAL)
2323 /* Check if we should retry the allocation */
2324 pages_reclaimed += did_some_progress;
2325 if (should_alloc_retry(gfp_mask, order, did_some_progress,
2327 /* Wait for some write requests to complete then retry */
2328 wait_iff_congested(preferred_zone, BLK_RW_ASYNC, HZ/50);
2332 * High-order allocations do not necessarily loop after
2333 * direct reclaim and reclaim/compaction depends on compaction
2334 * being called after reclaim so call directly if necessary
2336 page = __alloc_pages_direct_compact(gfp_mask, order,
2337 zonelist, high_zoneidx,
2339 alloc_flags, preferred_zone,
2340 migratetype, &did_some_progress,
2347 warn_alloc_failed(gfp_mask, order, NULL);
2350 if (kmemcheck_enabled)
2351 kmemcheck_pagealloc_alloc(page, order, gfp_mask);
2357 * This is the 'heart' of the zoned buddy allocator.
2360 __alloc_pages_nodemask(gfp_t gfp_mask, unsigned int order,
2361 struct zonelist *zonelist, nodemask_t *nodemask)
2363 enum zone_type high_zoneidx = gfp_zone(gfp_mask);
2364 struct zone *preferred_zone;
2366 int migratetype = allocflags_to_migratetype(gfp_mask);
2368 gfp_mask &= gfp_allowed_mask;
2370 lockdep_trace_alloc(gfp_mask);
2372 might_sleep_if(gfp_mask & __GFP_WAIT);
2374 if (should_fail_alloc_page(gfp_mask, order))
2378 * Check the zones suitable for the gfp_mask contain at least one
2379 * valid zone. It's possible to have an empty zonelist as a result
2380 * of GFP_THISNODE and a memoryless node
2382 if (unlikely(!zonelist->_zonerefs->zone))
2386 /* The preferred zone is used for statistics later */
2387 first_zones_zonelist(zonelist, high_zoneidx,
2388 nodemask ? : &cpuset_current_mems_allowed,
2390 if (!preferred_zone) {
2395 /* First allocation attempt */
2396 page = get_page_from_freelist(gfp_mask|__GFP_HARDWALL, nodemask, order,
2397 zonelist, high_zoneidx, ALLOC_WMARK_LOW|ALLOC_CPUSET,
2398 preferred_zone, migratetype);
2399 if (unlikely(!page))
2400 page = __alloc_pages_slowpath(gfp_mask, order,
2401 zonelist, high_zoneidx, nodemask,
2402 preferred_zone, migratetype);
2405 trace_mm_page_alloc(page, order, gfp_mask, migratetype);
2408 EXPORT_SYMBOL(__alloc_pages_nodemask);
2411 * Common helper functions.
2413 unsigned long __get_free_pages(gfp_t gfp_mask, unsigned int order)
2418 * __get_free_pages() returns a 32-bit address, which cannot represent
2421 VM_BUG_ON((gfp_mask & __GFP_HIGHMEM) != 0);
2423 page = alloc_pages(gfp_mask, order);
2426 return (unsigned long) page_address(page);
2428 EXPORT_SYMBOL(__get_free_pages);
2430 unsigned long get_zeroed_page(gfp_t gfp_mask)
2432 return __get_free_pages(gfp_mask | __GFP_ZERO, 0);
2434 EXPORT_SYMBOL(get_zeroed_page);
2436 void __free_pages(struct page *page, unsigned int order)
2438 if (put_page_testzero(page)) {
2440 free_hot_cold_page(page, 0);
2442 __free_pages_ok(page, order);
2446 EXPORT_SYMBOL(__free_pages);
2448 void free_pages(unsigned long addr, unsigned int order)
2451 VM_BUG_ON(!virt_addr_valid((void *)addr));
2452 __free_pages(virt_to_page((void *)addr), order);
2456 EXPORT_SYMBOL(free_pages);
2458 static void *make_alloc_exact(unsigned long addr, unsigned order, size_t size)
2461 unsigned long alloc_end = addr + (PAGE_SIZE << order);
2462 unsigned long used = addr + PAGE_ALIGN(size);
2464 split_page(virt_to_page((void *)addr), order);
2465 while (used < alloc_end) {
2470 return (void *)addr;
2474 * alloc_pages_exact - allocate an exact number physically-contiguous pages.
2475 * @size: the number of bytes to allocate
2476 * @gfp_mask: GFP flags for the allocation
2478 * This function is similar to alloc_pages(), except that it allocates the
2479 * minimum number of pages to satisfy the request. alloc_pages() can only
2480 * allocate memory in power-of-two pages.
2482 * This function is also limited by MAX_ORDER.
2484 * Memory allocated by this function must be released by free_pages_exact().
2486 void *alloc_pages_exact(size_t size, gfp_t gfp_mask)
2488 unsigned int order = get_order(size);
2491 addr = __get_free_pages(gfp_mask, order);
2492 return make_alloc_exact(addr, order, size);
2494 EXPORT_SYMBOL(alloc_pages_exact);
2497 * alloc_pages_exact_nid - allocate an exact number of physically-contiguous
2499 * @nid: the preferred node ID where memory should be allocated
2500 * @size: the number of bytes to allocate
2501 * @gfp_mask: GFP flags for the allocation
2503 * Like alloc_pages_exact(), but try to allocate on node nid first before falling
2505 * Note this is not alloc_pages_exact_node() which allocates on a specific node,
2508 void *alloc_pages_exact_nid(int nid, size_t size, gfp_t gfp_mask)
2510 unsigned order = get_order(size);
2511 struct page *p = alloc_pages_node(nid, gfp_mask, order);
2514 return make_alloc_exact((unsigned long)page_address(p), order, size);
2516 EXPORT_SYMBOL(alloc_pages_exact_nid);
2519 * free_pages_exact - release memory allocated via alloc_pages_exact()
2520 * @virt: the value returned by alloc_pages_exact.
2521 * @size: size of allocation, same value as passed to alloc_pages_exact().
2523 * Release the memory allocated by a previous call to alloc_pages_exact.
2525 void free_pages_exact(void *virt, size_t size)
2527 unsigned long addr = (unsigned long)virt;
2528 unsigned long end = addr + PAGE_ALIGN(size);
2530 while (addr < end) {
2535 EXPORT_SYMBOL(free_pages_exact);
2537 static unsigned int nr_free_zone_pages(int offset)
2542 /* Just pick one node, since fallback list is circular */
2543 unsigned int sum = 0;
2545 struct zonelist *zonelist = node_zonelist(numa_node_id(), GFP_KERNEL);
2547 for_each_zone_zonelist(zone, z, zonelist, offset) {
2548 unsigned long size = zone->present_pages;
2549 unsigned long high = high_wmark_pages(zone);
2558 * Amount of free RAM allocatable within ZONE_DMA and ZONE_NORMAL
2560 unsigned int nr_free_buffer_pages(void)
2562 return nr_free_zone_pages(gfp_zone(GFP_USER));
2564 EXPORT_SYMBOL_GPL(nr_free_buffer_pages);
2567 * Amount of free RAM allocatable within all zones
2569 unsigned int nr_free_pagecache_pages(void)
2571 return nr_free_zone_pages(gfp_zone(GFP_HIGHUSER_MOVABLE));
2574 static inline void show_node(struct zone *zone)
2577 printk("Node %d ", zone_to_nid(zone));
2580 void si_meminfo(struct sysinfo *val)
2582 val->totalram = totalram_pages;
2584 val->freeram = global_page_state(NR_FREE_PAGES);
2585 val->bufferram = nr_blockdev_pages();
2586 val->totalhigh = totalhigh_pages;
2587 val->freehigh = nr_free_highpages();
2588 val->mem_unit = PAGE_SIZE;
2591 EXPORT_SYMBOL(si_meminfo);
2594 void si_meminfo_node(struct sysinfo *val, int nid)
2596 pg_data_t *pgdat = NODE_DATA(nid);
2598 val->totalram = pgdat->node_present_pages;
2599 val->freeram = node_page_state(nid, NR_FREE_PAGES);
2600 #ifdef CONFIG_HIGHMEM
2601 val->totalhigh = pgdat->node_zones[ZONE_HIGHMEM].present_pages;
2602 val->freehigh = zone_page_state(&pgdat->node_zones[ZONE_HIGHMEM],
2608 val->mem_unit = PAGE_SIZE;
2613 * Determine whether the node should be displayed or not, depending on whether
2614 * SHOW_MEM_FILTER_NODES was passed to show_free_areas().
2616 bool skip_free_areas_node(unsigned int flags, int nid)
2620 if (!(flags & SHOW_MEM_FILTER_NODES))
2624 ret = !node_isset(nid, cpuset_current_mems_allowed);
2630 #define K(x) ((x) << (PAGE_SHIFT-10))
2633 * Show free area list (used inside shift_scroll-lock stuff)
2634 * We also calculate the percentage fragmentation. We do this by counting the
2635 * memory on each free list with the exception of the first item on the list.
2636 * Suppresses nodes that are not allowed by current's cpuset if
2637 * SHOW_MEM_FILTER_NODES is passed.
2639 void show_free_areas(unsigned int filter)
2644 for_each_populated_zone(zone) {
2645 if (skip_free_areas_node(filter, zone_to_nid(zone)))
2648 printk("%s per-cpu:\n", zone->name);
2650 for_each_online_cpu(cpu) {
2651 struct per_cpu_pageset *pageset;
2653 pageset = per_cpu_ptr(zone->pageset, cpu);
2655 printk("CPU %4d: hi:%5d, btch:%4d usd:%4d\n",
2656 cpu, pageset->pcp.high,
2657 pageset->pcp.batch, pageset->pcp.count);
2661 printk("active_anon:%lu inactive_anon:%lu isolated_anon:%lu\n"
2662 " active_file:%lu inactive_file:%lu isolated_file:%lu\n"
2664 " dirty:%lu writeback:%lu unstable:%lu\n"
2665 " free:%lu slab_reclaimable:%lu slab_unreclaimable:%lu\n"
2666 " mapped:%lu shmem:%lu pagetables:%lu bounce:%lu\n",
2667 global_page_state(NR_ACTIVE_ANON),
2668 global_page_state(NR_INACTIVE_ANON),
2669 global_page_state(NR_ISOLATED_ANON),
2670 global_page_state(NR_ACTIVE_FILE),
2671 global_page_state(NR_INACTIVE_FILE),
2672 global_page_state(NR_ISOLATED_FILE),
2673 global_page_state(NR_UNEVICTABLE),
2674 global_page_state(NR_FILE_DIRTY),
2675 global_page_state(NR_WRITEBACK),
2676 global_page_state(NR_UNSTABLE_NFS),
2677 global_page_state(NR_FREE_PAGES),
2678 global_page_state(NR_SLAB_RECLAIMABLE),
2679 global_page_state(NR_SLAB_UNRECLAIMABLE),
2680 global_page_state(NR_FILE_MAPPED),
2681 global_page_state(NR_SHMEM),
2682 global_page_state(NR_PAGETABLE),
2683 global_page_state(NR_BOUNCE));
2685 for_each_populated_zone(zone) {
2688 if (skip_free_areas_node(filter, zone_to_nid(zone)))
2696 " active_anon:%lukB"
2697 " inactive_anon:%lukB"
2698 " active_file:%lukB"
2699 " inactive_file:%lukB"
2700 " unevictable:%lukB"
2701 " isolated(anon):%lukB"
2702 " isolated(file):%lukB"
2709 " slab_reclaimable:%lukB"
2710 " slab_unreclaimable:%lukB"
2711 " kernel_stack:%lukB"
2715 " writeback_tmp:%lukB"
2716 " pages_scanned:%lu"
2717 " all_unreclaimable? %s"
2720 K(zone_page_state(zone, NR_FREE_PAGES)),
2721 K(min_wmark_pages(zone)),
2722 K(low_wmark_pages(zone)),
2723 K(high_wmark_pages(zone)),
2724 K(zone_page_state(zone, NR_ACTIVE_ANON)),
2725 K(zone_page_state(zone, NR_INACTIVE_ANON)),
2726 K(zone_page_state(zone, NR_ACTIVE_FILE)),
2727 K(zone_page_state(zone, NR_INACTIVE_FILE)),
2728 K(zone_page_state(zone, NR_UNEVICTABLE)),
2729 K(zone_page_state(zone, NR_ISOLATED_ANON)),
2730 K(zone_page_state(zone, NR_ISOLATED_FILE)),
2731 K(zone->present_pages),
2732 K(zone_page_state(zone, NR_MLOCK)),
2733 K(zone_page_state(zone, NR_FILE_DIRTY)),
2734 K(zone_page_state(zone, NR_WRITEBACK)),
2735 K(zone_page_state(zone, NR_FILE_MAPPED)),
2736 K(zone_page_state(zone, NR_SHMEM)),
2737 K(zone_page_state(zone, NR_SLAB_RECLAIMABLE)),
2738 K(zone_page_state(zone, NR_SLAB_UNRECLAIMABLE)),
2739 zone_page_state(zone, NR_KERNEL_STACK) *
2741 K(zone_page_state(zone, NR_PAGETABLE)),
2742 K(zone_page_state(zone, NR_UNSTABLE_NFS)),
2743 K(zone_page_state(zone, NR_BOUNCE)),
2744 K(zone_page_state(zone, NR_WRITEBACK_TEMP)),
2745 zone->pages_scanned,
2746 (zone->all_unreclaimable ? "yes" : "no")
2748 printk("lowmem_reserve[]:");
2749 for (i = 0; i < MAX_NR_ZONES; i++)
2750 printk(" %lu", zone->lowmem_reserve[i]);
2754 for_each_populated_zone(zone) {
2755 unsigned long nr[MAX_ORDER], flags, order, total = 0;
2757 if (skip_free_areas_node(filter, zone_to_nid(zone)))
2760 printk("%s: ", zone->name);
2762 spin_lock_irqsave(&zone->lock, flags);
2763 for (order = 0; order < MAX_ORDER; order++) {
2764 nr[order] = zone->free_area[order].nr_free;
2765 total += nr[order] << order;
2767 spin_unlock_irqrestore(&zone->lock, flags);
2768 for (order = 0; order < MAX_ORDER; order++)
2769 printk("%lu*%lukB ", nr[order], K(1UL) << order);
2770 printk("= %lukB\n", K(total));
2773 printk("%ld total pagecache pages\n", global_page_state(NR_FILE_PAGES));
2775 show_swap_cache_info();
2778 static void zoneref_set_zone(struct zone *zone, struct zoneref *zoneref)
2780 zoneref->zone = zone;
2781 zoneref->zone_idx = zone_idx(zone);
2785 * Builds allocation fallback zone lists.
2787 * Add all populated zones of a node to the zonelist.
2789 static int build_zonelists_node(pg_data_t *pgdat, struct zonelist *zonelist,
2790 int nr_zones, enum zone_type zone_type)
2794 BUG_ON(zone_type >= MAX_NR_ZONES);
2799 zone = pgdat->node_zones + zone_type;
2800 if (populated_zone(zone)) {
2801 zoneref_set_zone(zone,
2802 &zonelist->_zonerefs[nr_zones++]);
2803 check_highest_zone(zone_type);
2806 } while (zone_type);
2813 * 0 = automatic detection of better ordering.
2814 * 1 = order by ([node] distance, -zonetype)
2815 * 2 = order by (-zonetype, [node] distance)
2817 * If not NUMA, ZONELIST_ORDER_ZONE and ZONELIST_ORDER_NODE will create
2818 * the same zonelist. So only NUMA can configure this param.
2820 #define ZONELIST_ORDER_DEFAULT 0
2821 #define ZONELIST_ORDER_NODE 1
2822 #define ZONELIST_ORDER_ZONE 2
2824 /* zonelist order in the kernel.
2825 * set_zonelist_order() will set this to NODE or ZONE.
2827 static int current_zonelist_order = ZONELIST_ORDER_DEFAULT;
2828 static char zonelist_order_name[3][8] = {"Default", "Node", "Zone"};
2832 /* The value user specified ....changed by config */
2833 static int user_zonelist_order = ZONELIST_ORDER_DEFAULT;
2834 /* string for sysctl */
2835 #define NUMA_ZONELIST_ORDER_LEN 16
2836 char numa_zonelist_order[16] = "default";
2839 * interface for configure zonelist ordering.
2840 * command line option "numa_zonelist_order"
2841 * = "[dD]efault - default, automatic configuration.
2842 * = "[nN]ode - order by node locality, then by zone within node
2843 * = "[zZ]one - order by zone, then by locality within zone
2846 static int __parse_numa_zonelist_order(char *s)
2848 if (*s == 'd' || *s == 'D') {
2849 user_zonelist_order = ZONELIST_ORDER_DEFAULT;
2850 } else if (*s == 'n' || *s == 'N') {
2851 user_zonelist_order = ZONELIST_ORDER_NODE;
2852 } else if (*s == 'z' || *s == 'Z') {
2853 user_zonelist_order = ZONELIST_ORDER_ZONE;
2856 "Ignoring invalid numa_zonelist_order value: "
2863 static __init int setup_numa_zonelist_order(char *s)
2870 ret = __parse_numa_zonelist_order(s);
2872 strlcpy(numa_zonelist_order, s, NUMA_ZONELIST_ORDER_LEN);
2876 early_param("numa_zonelist_order", setup_numa_zonelist_order);
2879 * sysctl handler for numa_zonelist_order
2881 int numa_zonelist_order_handler(ctl_table *table, int write,
2882 void __user *buffer, size_t *length,
2885 char saved_string[NUMA_ZONELIST_ORDER_LEN];
2887 static DEFINE_MUTEX(zl_order_mutex);
2889 mutex_lock(&zl_order_mutex);
2891 strcpy(saved_string, (char*)table->data);
2892 ret = proc_dostring(table, write, buffer, length, ppos);
2896 int oldval = user_zonelist_order;
2897 if (__parse_numa_zonelist_order((char*)table->data)) {
2899 * bogus value. restore saved string
2901 strncpy((char*)table->data, saved_string,
2902 NUMA_ZONELIST_ORDER_LEN);
2903 user_zonelist_order = oldval;
2904 } else if (oldval != user_zonelist_order) {
2905 mutex_lock(&zonelists_mutex);
2906 build_all_zonelists(NULL);
2907 mutex_unlock(&zonelists_mutex);
2911 mutex_unlock(&zl_order_mutex);
2916 #define MAX_NODE_LOAD (nr_online_nodes)
2917 static int node_load[MAX_NUMNODES];
2920 * find_next_best_node - find the next node that should appear in a given node's fallback list
2921 * @node: node whose fallback list we're appending
2922 * @used_node_mask: nodemask_t of already used nodes
2924 * We use a number of factors to determine which is the next node that should
2925 * appear on a given node's fallback list. The node should not have appeared
2926 * already in @node's fallback list, and it should be the next closest node
2927 * according to the distance array (which contains arbitrary distance values
2928 * from each node to each node in the system), and should also prefer nodes
2929 * with no CPUs, since presumably they'll have very little allocation pressure
2930 * on them otherwise.
2931 * It returns -1 if no node is found.
2933 static int find_next_best_node(int node, nodemask_t *used_node_mask)
2936 int min_val = INT_MAX;
2938 const struct cpumask *tmp = cpumask_of_node(0);
2940 /* Use the local node if we haven't already */
2941 if (!node_isset(node, *used_node_mask)) {
2942 node_set(node, *used_node_mask);
2946 for_each_node_state(n, N_HIGH_MEMORY) {
2948 /* Don't want a node to appear more than once */
2949 if (node_isset(n, *used_node_mask))
2952 /* Use the distance array to find the distance */
2953 val = node_distance(node, n);
2955 /* Penalize nodes under us ("prefer the next node") */
2958 /* Give preference to headless and unused nodes */
2959 tmp = cpumask_of_node(n);
2960 if (!cpumask_empty(tmp))
2961 val += PENALTY_FOR_NODE_WITH_CPUS;
2963 /* Slight preference for less loaded node */
2964 val *= (MAX_NODE_LOAD*MAX_NUMNODES);
2965 val += node_load[n];
2967 if (val < min_val) {
2974 node_set(best_node, *used_node_mask);
2981 * Build zonelists ordered by node and zones within node.
2982 * This results in maximum locality--normal zone overflows into local
2983 * DMA zone, if any--but risks exhausting DMA zone.
2985 static void build_zonelists_in_node_order(pg_data_t *pgdat, int node)
2988 struct zonelist *zonelist;
2990 zonelist = &pgdat->node_zonelists[0];
2991 for (j = 0; zonelist->_zonerefs[j].zone != NULL; j++)
2993 j = build_zonelists_node(NODE_DATA(node), zonelist, j,
2995 zonelist->_zonerefs[j].zone = NULL;
2996 zonelist->_zonerefs[j].zone_idx = 0;
3000 * Build gfp_thisnode zonelists
3002 static void build_thisnode_zonelists(pg_data_t *pgdat)
3005 struct zonelist *zonelist;
3007 zonelist = &pgdat->node_zonelists[1];
3008 j = build_zonelists_node(pgdat, zonelist, 0, MAX_NR_ZONES - 1);
3009 zonelist->_zonerefs[j].zone = NULL;
3010 zonelist->_zonerefs[j].zone_idx = 0;
3014 * Build zonelists ordered by zone and nodes within zones.
3015 * This results in conserving DMA zone[s] until all Normal memory is
3016 * exhausted, but results in overflowing to remote node while memory
3017 * may still exist in local DMA zone.
3019 static int node_order[MAX_NUMNODES];
3021 static void build_zonelists_in_zone_order(pg_data_t *pgdat, int nr_nodes)
3024 int zone_type; /* needs to be signed */
3026 struct zonelist *zonelist;
3028 zonelist = &pgdat->node_zonelists[0];
3030 for (zone_type = MAX_NR_ZONES - 1; zone_type >= 0; zone_type--) {
3031 for (j = 0; j < nr_nodes; j++) {
3032 node = node_order[j];
3033 z = &NODE_DATA(node)->node_zones[zone_type];
3034 if (populated_zone(z)) {
3036 &zonelist->_zonerefs[pos++]);
3037 check_highest_zone(zone_type);
3041 zonelist->_zonerefs[pos].zone = NULL;
3042 zonelist->_zonerefs[pos].zone_idx = 0;
3045 static int default_zonelist_order(void)
3048 unsigned long low_kmem_size,total_size;
3052 * ZONE_DMA and ZONE_DMA32 can be very small area in the system.
3053 * If they are really small and used heavily, the system can fall
3054 * into OOM very easily.
3055 * This function detect ZONE_DMA/DMA32 size and configures zone order.
3057 /* Is there ZONE_NORMAL ? (ex. ppc has only DMA zone..) */
3060 for_each_online_node(nid) {
3061 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++) {
3062 z = &NODE_DATA(nid)->node_zones[zone_type];
3063 if (populated_zone(z)) {
3064 if (zone_type < ZONE_NORMAL)
3065 low_kmem_size += z->present_pages;
3066 total_size += z->present_pages;
3067 } else if (zone_type == ZONE_NORMAL) {
3069 * If any node has only lowmem, then node order
3070 * is preferred to allow kernel allocations
3071 * locally; otherwise, they can easily infringe
3072 * on other nodes when there is an abundance of
3073 * lowmem available to allocate from.
3075 return ZONELIST_ORDER_NODE;
3079 if (!low_kmem_size || /* there are no DMA area. */
3080 low_kmem_size > total_size/2) /* DMA/DMA32 is big. */
3081 return ZONELIST_ORDER_NODE;
3083 * look into each node's config.
3084 * If there is a node whose DMA/DMA32 memory is very big area on
3085 * local memory, NODE_ORDER may be suitable.
3087 average_size = total_size /
3088 (nodes_weight(node_states[N_HIGH_MEMORY]) + 1);
3089 for_each_online_node(nid) {
3092 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++) {
3093 z = &NODE_DATA(nid)->node_zones[zone_type];
3094 if (populated_zone(z)) {
3095 if (zone_type < ZONE_NORMAL)
3096 low_kmem_size += z->present_pages;
3097 total_size += z->present_pages;
3100 if (low_kmem_size &&
3101 total_size > average_size && /* ignore small node */
3102 low_kmem_size > total_size * 70/100)
3103 return ZONELIST_ORDER_NODE;
3105 return ZONELIST_ORDER_ZONE;
3108 static void set_zonelist_order(void)
3110 if (user_zonelist_order == ZONELIST_ORDER_DEFAULT)
3111 current_zonelist_order = default_zonelist_order();
3113 current_zonelist_order = user_zonelist_order;
3116 static void build_zonelists(pg_data_t *pgdat)
3120 nodemask_t used_mask;
3121 int local_node, prev_node;
3122 struct zonelist *zonelist;
3123 int order = current_zonelist_order;
3125 /* initialize zonelists */
3126 for (i = 0; i < MAX_ZONELISTS; i++) {
3127 zonelist = pgdat->node_zonelists + i;
3128 zonelist->_zonerefs[0].zone = NULL;
3129 zonelist->_zonerefs[0].zone_idx = 0;
3132 /* NUMA-aware ordering of nodes */
3133 local_node = pgdat->node_id;
3134 load = nr_online_nodes;
3135 prev_node = local_node;
3136 nodes_clear(used_mask);
3138 memset(node_order, 0, sizeof(node_order));
3141 while ((node = find_next_best_node(local_node, &used_mask)) >= 0) {
3142 int distance = node_distance(local_node, node);
3145 * If another node is sufficiently far away then it is better
3146 * to reclaim pages in a zone before going off node.
3148 if (distance > RECLAIM_DISTANCE)
3149 zone_reclaim_mode = 1;
3152 * We don't want to pressure a particular node.
3153 * So adding penalty to the first node in same
3154 * distance group to make it round-robin.
3156 if (distance != node_distance(local_node, prev_node))
3157 node_load[node] = load;
3161 if (order == ZONELIST_ORDER_NODE)
3162 build_zonelists_in_node_order(pgdat, node);
3164 node_order[j++] = node; /* remember order */
3167 if (order == ZONELIST_ORDER_ZONE) {
3168 /* calculate node order -- i.e., DMA last! */
3169 build_zonelists_in_zone_order(pgdat, j);
3172 build_thisnode_zonelists(pgdat);
3175 /* Construct the zonelist performance cache - see further mmzone.h */
3176 static void build_zonelist_cache(pg_data_t *pgdat)
3178 struct zonelist *zonelist;
3179 struct zonelist_cache *zlc;
3182 zonelist = &pgdat->node_zonelists[0];
3183 zonelist->zlcache_ptr = zlc = &zonelist->zlcache;
3184 bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST);
3185 for (z = zonelist->_zonerefs; z->zone; z++)
3186 zlc->z_to_n[z - zonelist->_zonerefs] = zonelist_node_idx(z);
3189 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
3191 * Return node id of node used for "local" allocations.
3192 * I.e., first node id of first zone in arg node's generic zonelist.
3193 * Used for initializing percpu 'numa_mem', which is used primarily
3194 * for kernel allocations, so use GFP_KERNEL flags to locate zonelist.
3196 int local_memory_node(int node)
3200 (void)first_zones_zonelist(node_zonelist(node, GFP_KERNEL),
3201 gfp_zone(GFP_KERNEL),
3208 #else /* CONFIG_NUMA */
3210 static void set_zonelist_order(void)
3212 current_zonelist_order = ZONELIST_ORDER_ZONE;
3215 static void build_zonelists(pg_data_t *pgdat)
3217 int node, local_node;
3219 struct zonelist *zonelist;
3221 local_node = pgdat->node_id;
3223 zonelist = &pgdat->node_zonelists[0];
3224 j = build_zonelists_node(pgdat, zonelist, 0, MAX_NR_ZONES - 1);
3227 * Now we build the zonelist so that it contains the zones
3228 * of all the other nodes.
3229 * We don't want to pressure a particular node, so when
3230 * building the zones for node N, we make sure that the
3231 * zones coming right after the local ones are those from
3232 * node N+1 (modulo N)
3234 for (node = local_node + 1; node < MAX_NUMNODES; node++) {
3235 if (!node_online(node))
3237 j = build_zonelists_node(NODE_DATA(node), zonelist, j,
3240 for (node = 0; node < local_node; node++) {
3241 if (!node_online(node))
3243 j = build_zonelists_node(NODE_DATA(node), zonelist, j,
3247 zonelist->_zonerefs[j].zone = NULL;
3248 zonelist->_zonerefs[j].zone_idx = 0;
3251 /* non-NUMA variant of zonelist performance cache - just NULL zlcache_ptr */
3252 static void build_zonelist_cache(pg_data_t *pgdat)
3254 pgdat->node_zonelists[0].zlcache_ptr = NULL;
3257 #endif /* CONFIG_NUMA */
3260 * Boot pageset table. One per cpu which is going to be used for all
3261 * zones and all nodes. The parameters will be set in such a way
3262 * that an item put on a list will immediately be handed over to
3263 * the buddy list. This is safe since pageset manipulation is done
3264 * with interrupts disabled.
3266 * The boot_pagesets must be kept even after bootup is complete for
3267 * unused processors and/or zones. They do play a role for bootstrapping
3268 * hotplugged processors.
3270 * zoneinfo_show() and maybe other functions do
3271 * not check if the processor is online before following the pageset pointer.
3272 * Other parts of the kernel may not check if the zone is available.
3274 static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch);
3275 static DEFINE_PER_CPU(struct per_cpu_pageset, boot_pageset);
3276 static void setup_zone_pageset(struct zone *zone);
3279 * Global mutex to protect against size modification of zonelists
3280 * as well as to serialize pageset setup for the new populated zone.
3282 DEFINE_MUTEX(zonelists_mutex);
3284 /* return values int ....just for stop_machine() */
3285 static __init_refok int __build_all_zonelists(void *data)
3291 memset(node_load, 0, sizeof(node_load));
3293 for_each_online_node(nid) {
3294 pg_data_t *pgdat = NODE_DATA(nid);
3296 build_zonelists(pgdat);
3297 build_zonelist_cache(pgdat);
3301 * Initialize the boot_pagesets that are going to be used
3302 * for bootstrapping processors. The real pagesets for
3303 * each zone will be allocated later when the per cpu
3304 * allocator is available.
3306 * boot_pagesets are used also for bootstrapping offline
3307 * cpus if the system is already booted because the pagesets
3308 * are needed to initialize allocators on a specific cpu too.
3309 * F.e. the percpu allocator needs the page allocator which
3310 * needs the percpu allocator in order to allocate its pagesets
3311 * (a chicken-egg dilemma).
3313 for_each_possible_cpu(cpu) {
3314 setup_pageset(&per_cpu(boot_pageset, cpu), 0);
3316 #ifdef CONFIG_HAVE_MEMORYLESS_NODES
3318 * We now know the "local memory node" for each node--
3319 * i.e., the node of the first zone in the generic zonelist.
3320 * Set up numa_mem percpu variable for on-line cpus. During
3321 * boot, only the boot cpu should be on-line; we'll init the
3322 * secondary cpus' numa_mem as they come on-line. During
3323 * node/memory hotplug, we'll fixup all on-line cpus.
3325 if (cpu_online(cpu))
3326 set_cpu_numa_mem(cpu, local_memory_node(cpu_to_node(cpu)));
3334 * Called with zonelists_mutex held always
3335 * unless system_state == SYSTEM_BOOTING.
3337 void __ref build_all_zonelists(void *data)
3339 set_zonelist_order();
3341 if (system_state == SYSTEM_BOOTING) {
3342 __build_all_zonelists(NULL);
3343 mminit_verify_zonelist();
3344 cpuset_init_current_mems_allowed();
3346 /* we have to stop all cpus to guarantee there is no user
3348 #ifdef CONFIG_MEMORY_HOTPLUG
3350 setup_zone_pageset((struct zone *)data);
3352 stop_machine(__build_all_zonelists, NULL, NULL);
3353 /* cpuset refresh routine should be here */
3355 vm_total_pages = nr_free_pagecache_pages();
3357 * Disable grouping by mobility if the number of pages in the
3358 * system is too low to allow the mechanism to work. It would be
3359 * more accurate, but expensive to check per-zone. This check is
3360 * made on memory-hotadd so a system can start with mobility
3361 * disabled and enable it later
3363 if (vm_total_pages < (pageblock_nr_pages * MIGRATE_TYPES))
3364 page_group_by_mobility_disabled = 1;
3366 page_group_by_mobility_disabled = 0;
3368 printk("Built %i zonelists in %s order, mobility grouping %s. "
3369 "Total pages: %ld\n",
3371 zonelist_order_name[current_zonelist_order],
3372 page_group_by_mobility_disabled ? "off" : "on",
3375 printk("Policy zone: %s\n", zone_names[policy_zone]);
3380 * Helper functions to size the waitqueue hash table.
3381 * Essentially these want to choose hash table sizes sufficiently
3382 * large so that collisions trying to wait on pages are rare.
3383 * But in fact, the number of active page waitqueues on typical
3384 * systems is ridiculously low, less than 200. So this is even
3385 * conservative, even though it seems large.
3387 * The constant PAGES_PER_WAITQUEUE specifies the ratio of pages to
3388 * waitqueues, i.e. the size of the waitq table given the number of pages.
3390 #define PAGES_PER_WAITQUEUE 256
3392 #ifndef CONFIG_MEMORY_HOTPLUG
3393 static inline unsigned long wait_table_hash_nr_entries(unsigned long pages)
3395 unsigned long size = 1;
3397 pages /= PAGES_PER_WAITQUEUE;
3399 while (size < pages)
3403 * Once we have dozens or even hundreds of threads sleeping
3404 * on IO we've got bigger problems than wait queue collision.
3405 * Limit the size of the wait table to a reasonable size.
3407 size = min(size, 4096UL);
3409 return max(size, 4UL);
3413 * A zone's size might be changed by hot-add, so it is not possible to determine
3414 * a suitable size for its wait_table. So we use the maximum size now.
3416 * The max wait table size = 4096 x sizeof(wait_queue_head_t). ie:
3418 * i386 (preemption config) : 4096 x 16 = 64Kbyte.
3419 * ia64, x86-64 (no preemption): 4096 x 20 = 80Kbyte.
3420 * ia64, x86-64 (preemption) : 4096 x 24 = 96Kbyte.
3422 * The maximum entries are prepared when a zone's memory is (512K + 256) pages
3423 * or more by the traditional way. (See above). It equals:
3425 * i386, x86-64, powerpc(4K page size) : = ( 2G + 1M)byte.
3426 * ia64(16K page size) : = ( 8G + 4M)byte.
3427 * powerpc (64K page size) : = (32G +16M)byte.
3429 static inline unsigned long wait_table_hash_nr_entries(unsigned long pages)
3436 * This is an integer logarithm so that shifts can be used later
3437 * to extract the more random high bits from the multiplicative
3438 * hash function before the remainder is taken.
3440 static inline unsigned long wait_table_bits(unsigned long size)
3445 #define LONG_ALIGN(x) (((x)+(sizeof(long))-1)&~((sizeof(long))-1))
3448 * Check if a pageblock contains reserved pages
3450 static int pageblock_is_reserved(unsigned long start_pfn, unsigned long end_pfn)
3454 for (pfn = start_pfn; pfn < end_pfn; pfn++) {
3455 if (!pfn_valid_within(pfn) || PageReserved(pfn_to_page(pfn)))
3462 * Mark a number of pageblocks as MIGRATE_RESERVE. The number
3463 * of blocks reserved is based on min_wmark_pages(zone). The memory within
3464 * the reserve will tend to store contiguous free pages. Setting min_free_kbytes
3465 * higher will lead to a bigger reserve which will get freed as contiguous
3466 * blocks as reclaim kicks in
3468 static void setup_zone_migrate_reserve(struct zone *zone)
3470 unsigned long start_pfn, pfn, end_pfn, block_end_pfn;
3472 unsigned long block_migratetype;
3476 * Get the start pfn, end pfn and the number of blocks to reserve
3477 * We have to be careful to be aligned to pageblock_nr_pages to
3478 * make sure that we always check pfn_valid for the first page in
3481 start_pfn = zone->zone_start_pfn;
3482 end_pfn = start_pfn + zone->spanned_pages;
3483 start_pfn = roundup(start_pfn, pageblock_nr_pages);
3484 reserve = roundup(min_wmark_pages(zone), pageblock_nr_pages) >>
3488 * Reserve blocks are generally in place to help high-order atomic
3489 * allocations that are short-lived. A min_free_kbytes value that
3490 * would result in more than 2 reserve blocks for atomic allocations
3491 * is assumed to be in place to help anti-fragmentation for the
3492 * future allocation of hugepages at runtime.
3494 reserve = min(2, reserve);
3496 for (pfn = start_pfn; pfn < end_pfn; pfn += pageblock_nr_pages) {
3497 if (!pfn_valid(pfn))
3499 page = pfn_to_page(pfn);
3501 /* Watch out for overlapping nodes */
3502 if (page_to_nid(page) != zone_to_nid(zone))
3505 block_migratetype = get_pageblock_migratetype(page);
3507 /* Only test what is necessary when the reserves are not met */
3510 * Blocks with reserved pages will never free, skip
3513 block_end_pfn = min(pfn + pageblock_nr_pages, end_pfn);
3514 if (pageblock_is_reserved(pfn, block_end_pfn))
3517 /* If this block is reserved, account for it */
3518 if (block_migratetype == MIGRATE_RESERVE) {
3523 /* Suitable for reserving if this block is movable */
3524 if (block_migratetype == MIGRATE_MOVABLE) {
3525 set_pageblock_migratetype(page,
3527 move_freepages_block(zone, page,
3535 * If the reserve is met and this is a previous reserved block,
3538 if (block_migratetype == MIGRATE_RESERVE) {
3539 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
3540 move_freepages_block(zone, page, MIGRATE_MOVABLE);
3546 * Initially all pages are reserved - free ones are freed
3547 * up by free_all_bootmem() once the early boot process is
3548 * done. Non-atomic initialization, single-pass.
3550 void __meminit memmap_init_zone(unsigned long size, int nid, unsigned long zone,
3551 unsigned long start_pfn, enum memmap_context context)
3554 unsigned long end_pfn = start_pfn + size;
3558 if (highest_memmap_pfn < end_pfn - 1)
3559 highest_memmap_pfn = end_pfn - 1;
3561 z = &NODE_DATA(nid)->node_zones[zone];
3562 for (pfn = start_pfn; pfn < end_pfn; pfn++) {
3564 * There can be holes in boot-time mem_map[]s
3565 * handed to this function. They do not
3566 * exist on hotplugged memory.
3568 if (context == MEMMAP_EARLY) {
3569 if (!early_pfn_valid(pfn))
3571 if (!early_pfn_in_nid(pfn, nid))
3574 page = pfn_to_page(pfn);
3575 set_page_links(page, zone, nid, pfn);
3576 mminit_verify_page_links(page, zone, nid, pfn);
3577 init_page_count(page);
3578 reset_page_mapcount(page);
3579 SetPageReserved(page);
3581 * Mark the block movable so that blocks are reserved for
3582 * movable at startup. This will force kernel allocations
3583 * to reserve their blocks rather than leaking throughout
3584 * the address space during boot when many long-lived
3585 * kernel allocations are made. Later some blocks near
3586 * the start are marked MIGRATE_RESERVE by
3587 * setup_zone_migrate_reserve()
3589 * bitmap is created for zone's valid pfn range. but memmap
3590 * can be created for invalid pages (for alignment)
3591 * check here not to call set_pageblock_migratetype() against
3594 if ((z->zone_start_pfn <= pfn)
3595 && (pfn < z->zone_start_pfn + z->spanned_pages)
3596 && !(pfn & (pageblock_nr_pages - 1)))
3597 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
3599 INIT_LIST_HEAD(&page->lru);
3600 #ifdef WANT_PAGE_VIRTUAL
3601 /* The shift won't overflow because ZONE_NORMAL is below 4G. */
3602 if (!is_highmem_idx(zone))
3603 set_page_address(page, __va(pfn << PAGE_SHIFT));
3608 static void __meminit zone_init_free_lists(struct zone *zone)
3611 for_each_migratetype_order(order, t) {
3612 INIT_LIST_HEAD(&zone->free_area[order].free_list[t]);
3613 zone->free_area[order].nr_free = 0;
3617 #ifndef __HAVE_ARCH_MEMMAP_INIT
3618 #define memmap_init(size, nid, zone, start_pfn) \
3619 memmap_init_zone((size), (nid), (zone), (start_pfn), MEMMAP_EARLY)
3622 static int zone_batchsize(struct zone *zone)
3628 * The per-cpu-pages pools are set to around 1000th of the
3629 * size of the zone. But no more than 1/2 of a meg.
3631 * OK, so we don't know how big the cache is. So guess.
3633 batch = zone->present_pages / 1024;
3634 if (batch * PAGE_SIZE > 512 * 1024)
3635 batch = (512 * 1024) / PAGE_SIZE;
3636 batch /= 4; /* We effectively *= 4 below */
3641 * Clamp the batch to a 2^n - 1 value. Having a power
3642 * of 2 value was found to be more likely to have
3643 * suboptimal cache aliasing properties in some cases.
3645 * For example if 2 tasks are alternately allocating
3646 * batches of pages, one task can end up with a lot
3647 * of pages of one half of the possible page colors
3648 * and the other with pages of the other colors.
3650 batch = rounddown_pow_of_two(batch + batch/2) - 1;
3655 /* The deferral and batching of frees should be suppressed under NOMMU
3658 * The problem is that NOMMU needs to be able to allocate large chunks
3659 * of contiguous memory as there's no hardware page translation to
3660 * assemble apparent contiguous memory from discontiguous pages.
3662 * Queueing large contiguous runs of pages for batching, however,
3663 * causes the pages to actually be freed in smaller chunks. As there
3664 * can be a significant delay between the individual batches being
3665 * recycled, this leads to the once large chunks of space being
3666 * fragmented and becoming unavailable for high-order allocations.
3672 static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch)
3674 struct per_cpu_pages *pcp;
3677 memset(p, 0, sizeof(*p));
3681 pcp->high = 6 * batch;
3682 pcp->batch = max(1UL, 1 * batch);
3683 for (migratetype = 0; migratetype < MIGRATE_PCPTYPES; migratetype++)
3684 INIT_LIST_HEAD(&pcp->lists[migratetype]);
3688 * setup_pagelist_highmark() sets the high water mark for hot per_cpu_pagelist
3689 * to the value high for the pageset p.
3692 static void setup_pagelist_highmark(struct per_cpu_pageset *p,
3695 struct per_cpu_pages *pcp;
3699 pcp->batch = max(1UL, high/4);
3700 if ((high/4) > (PAGE_SHIFT * 8))
3701 pcp->batch = PAGE_SHIFT * 8;
3704 static void setup_zone_pageset(struct zone *zone)
3708 zone->pageset = alloc_percpu(struct per_cpu_pageset);
3710 for_each_possible_cpu(cpu) {
3711 struct per_cpu_pageset *pcp = per_cpu_ptr(zone->pageset, cpu);
3713 setup_pageset(pcp, zone_batchsize(zone));
3715 if (percpu_pagelist_fraction)
3716 setup_pagelist_highmark(pcp,
3717 (zone->present_pages /
3718 percpu_pagelist_fraction));
3723 * Allocate per cpu pagesets and initialize them.
3724 * Before this call only boot pagesets were available.
3726 void __init setup_per_cpu_pageset(void)
3730 for_each_populated_zone(zone)
3731 setup_zone_pageset(zone);
3734 static noinline __init_refok
3735 int zone_wait_table_init(struct zone *zone, unsigned long zone_size_pages)
3738 struct pglist_data *pgdat = zone->zone_pgdat;
3742 * The per-page waitqueue mechanism uses hashed waitqueues
3745 zone->wait_table_hash_nr_entries =
3746 wait_table_hash_nr_entries(zone_size_pages);
3747 zone->wait_table_bits =
3748 wait_table_bits(zone->wait_table_hash_nr_entries);
3749 alloc_size = zone->wait_table_hash_nr_entries
3750 * sizeof(wait_queue_head_t);
3752 if (!slab_is_available()) {
3753 zone->wait_table = (wait_queue_head_t *)
3754 alloc_bootmem_node_nopanic(pgdat, alloc_size);
3757 * This case means that a zone whose size was 0 gets new memory
3758 * via memory hot-add.
3759 * But it may be the case that a new node was hot-added. In
3760 * this case vmalloc() will not be able to use this new node's
3761 * memory - this wait_table must be initialized to use this new
3762 * node itself as well.
3763 * To use this new node's memory, further consideration will be
3766 zone->wait_table = vmalloc(alloc_size);
3768 if (!zone->wait_table)
3771 for(i = 0; i < zone->wait_table_hash_nr_entries; ++i)
3772 init_waitqueue_head(zone->wait_table + i);
3777 static int __zone_pcp_update(void *data)
3779 struct zone *zone = data;
3781 unsigned long batch = zone_batchsize(zone), flags;
3783 for_each_possible_cpu(cpu) {
3784 struct per_cpu_pageset *pset;
3785 struct per_cpu_pages *pcp;
3787 pset = per_cpu_ptr(zone->pageset, cpu);
3790 local_irq_save(flags);
3791 free_pcppages_bulk(zone, pcp->count, pcp);
3792 setup_pageset(pset, batch);
3793 local_irq_restore(flags);
3798 void zone_pcp_update(struct zone *zone)
3800 stop_machine(__zone_pcp_update, zone, NULL);
3803 static __meminit void zone_pcp_init(struct zone *zone)
3806 * per cpu subsystem is not up at this point. The following code
3807 * relies on the ability of the linker to provide the
3808 * offset of a (static) per cpu variable into the per cpu area.
3810 zone->pageset = &boot_pageset;
3812 if (zone->present_pages)
3813 printk(KERN_DEBUG " %s zone: %lu pages, LIFO batch:%u\n",
3814 zone->name, zone->present_pages,
3815 zone_batchsize(zone));
3818 __meminit int init_currently_empty_zone(struct zone *zone,
3819 unsigned long zone_start_pfn,
3821 enum memmap_context context)
3823 struct pglist_data *pgdat = zone->zone_pgdat;
3825 ret = zone_wait_table_init(zone, size);
3828 pgdat->nr_zones = zone_idx(zone) + 1;
3830 zone->zone_start_pfn = zone_start_pfn;
3832 mminit_dprintk(MMINIT_TRACE, "memmap_init",
3833 "Initialising map node %d zone %lu pfns %lu -> %lu\n",
3835 (unsigned long)zone_idx(zone),
3836 zone_start_pfn, (zone_start_pfn + size));
3838 zone_init_free_lists(zone);
3843 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
3844 #ifndef CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID
3846 * Required by SPARSEMEM. Given a PFN, return what node the PFN is on.
3847 * Architectures may implement their own version but if add_active_range()
3848 * was used and there are no special requirements, this is a convenient
3851 int __meminit __early_pfn_to_nid(unsigned long pfn)
3853 unsigned long start_pfn, end_pfn;
3856 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid)
3857 if (start_pfn <= pfn && pfn < end_pfn)
3859 /* This is a memory hole */
3862 #endif /* CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID */
3864 int __meminit early_pfn_to_nid(unsigned long pfn)
3868 nid = __early_pfn_to_nid(pfn);
3871 /* just returns 0 */
3875 #ifdef CONFIG_NODES_SPAN_OTHER_NODES
3876 bool __meminit early_pfn_in_nid(unsigned long pfn, int node)
3880 nid = __early_pfn_to_nid(pfn);
3881 if (nid >= 0 && nid != node)
3888 * free_bootmem_with_active_regions - Call free_bootmem_node for each active range
3889 * @nid: The node to free memory on. If MAX_NUMNODES, all nodes are freed.
3890 * @max_low_pfn: The highest PFN that will be passed to free_bootmem_node
3892 * If an architecture guarantees that all ranges registered with
3893 * add_active_ranges() contain no holes and may be freed, this
3894 * this function may be used instead of calling free_bootmem() manually.
3896 void __init free_bootmem_with_active_regions(int nid, unsigned long max_low_pfn)
3898 unsigned long start_pfn, end_pfn;
3901 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, &this_nid) {
3902 start_pfn = min(start_pfn, max_low_pfn);
3903 end_pfn = min(end_pfn, max_low_pfn);
3905 if (start_pfn < end_pfn)
3906 free_bootmem_node(NODE_DATA(this_nid),
3907 PFN_PHYS(start_pfn),
3908 (end_pfn - start_pfn) << PAGE_SHIFT);
3912 int __init add_from_early_node_map(struct range *range, int az,
3913 int nr_range, int nid)
3915 unsigned long start_pfn, end_pfn;
3918 /* need to go over early_node_map to find out good range for node */
3919 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL)
3920 nr_range = add_range(range, az, nr_range, start_pfn, end_pfn);
3925 * sparse_memory_present_with_active_regions - Call memory_present for each active range
3926 * @nid: The node to call memory_present for. If MAX_NUMNODES, all nodes will be used.
3928 * If an architecture guarantees that all ranges registered with
3929 * add_active_ranges() contain no holes and may be freed, this
3930 * function may be used instead of calling memory_present() manually.
3932 void __init sparse_memory_present_with_active_regions(int nid)
3934 unsigned long start_pfn, end_pfn;
3937 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, &this_nid)
3938 memory_present(this_nid, start_pfn, end_pfn);
3942 * get_pfn_range_for_nid - Return the start and end page frames for a node
3943 * @nid: The nid to return the range for. If MAX_NUMNODES, the min and max PFN are returned.
3944 * @start_pfn: Passed by reference. On return, it will have the node start_pfn.
3945 * @end_pfn: Passed by reference. On return, it will have the node end_pfn.
3947 * It returns the start and end page frame of a node based on information
3948 * provided by an arch calling add_active_range(). If called for a node
3949 * with no available memory, a warning is printed and the start and end
3952 void __meminit get_pfn_range_for_nid(unsigned int nid,
3953 unsigned long *start_pfn, unsigned long *end_pfn)
3955 unsigned long this_start_pfn, this_end_pfn;
3961 for_each_mem_pfn_range(i, nid, &this_start_pfn, &this_end_pfn, NULL) {
3962 *start_pfn = min(*start_pfn, this_start_pfn);
3963 *end_pfn = max(*end_pfn, this_end_pfn);
3966 if (*start_pfn == -1UL)
3971 * This finds a zone that can be used for ZONE_MOVABLE pages. The
3972 * assumption is made that zones within a node are ordered in monotonic
3973 * increasing memory addresses so that the "highest" populated zone is used
3975 static void __init find_usable_zone_for_movable(void)
3978 for (zone_index = MAX_NR_ZONES - 1; zone_index >= 0; zone_index--) {
3979 if (zone_index == ZONE_MOVABLE)
3982 if (arch_zone_highest_possible_pfn[zone_index] >
3983 arch_zone_lowest_possible_pfn[zone_index])
3987 VM_BUG_ON(zone_index == -1);
3988 movable_zone = zone_index;
3992 * The zone ranges provided by the architecture do not include ZONE_MOVABLE
3993 * because it is sized independent of architecture. Unlike the other zones,
3994 * the starting point for ZONE_MOVABLE is not fixed. It may be different
3995 * in each node depending on the size of each node and how evenly kernelcore
3996 * is distributed. This helper function adjusts the zone ranges
3997 * provided by the architecture for a given node by using the end of the
3998 * highest usable zone for ZONE_MOVABLE. This preserves the assumption that
3999 * zones within a node are in order of monotonic increases memory addresses
4001 static void __meminit adjust_zone_range_for_zone_movable(int nid,
4002 unsigned long zone_type,
4003 unsigned long node_start_pfn,
4004 unsigned long node_end_pfn,
4005 unsigned long *zone_start_pfn,
4006 unsigned long *zone_end_pfn)
4008 /* Only adjust if ZONE_MOVABLE is on this node */
4009 if (zone_movable_pfn[nid]) {
4010 /* Size ZONE_MOVABLE */
4011 if (zone_type == ZONE_MOVABLE) {
4012 *zone_start_pfn = zone_movable_pfn[nid];
4013 *zone_end_pfn = min(node_end_pfn,
4014 arch_zone_highest_possible_pfn[movable_zone]);
4016 /* Adjust for ZONE_MOVABLE starting within this range */
4017 } else if (*zone_start_pfn < zone_movable_pfn[nid] &&
4018 *zone_end_pfn > zone_movable_pfn[nid]) {
4019 *zone_end_pfn = zone_movable_pfn[nid];
4021 /* Check if this whole range is within ZONE_MOVABLE */
4022 } else if (*zone_start_pfn >= zone_movable_pfn[nid])
4023 *zone_start_pfn = *zone_end_pfn;
4028 * Return the number of pages a zone spans in a node, including holes
4029 * present_pages = zone_spanned_pages_in_node() - zone_absent_pages_in_node()
4031 static unsigned long __meminit zone_spanned_pages_in_node(int nid,
4032 unsigned long zone_type,
4033 unsigned long *ignored)
4035 unsigned long node_start_pfn, node_end_pfn;
4036 unsigned long zone_start_pfn, zone_end_pfn;
4038 /* Get the start and end of the node and zone */
4039 get_pfn_range_for_nid(nid, &node_start_pfn, &node_end_pfn);
4040 zone_start_pfn = arch_zone_lowest_possible_pfn[zone_type];
4041 zone_end_pfn = arch_zone_highest_possible_pfn[zone_type];
4042 adjust_zone_range_for_zone_movable(nid, zone_type,
4043 node_start_pfn, node_end_pfn,
4044 &zone_start_pfn, &zone_end_pfn);
4046 /* Check that this node has pages within the zone's required range */
4047 if (zone_end_pfn < node_start_pfn || zone_start_pfn > node_end_pfn)
4050 /* Move the zone boundaries inside the node if necessary */
4051 zone_end_pfn = min(zone_end_pfn, node_end_pfn);
4052 zone_start_pfn = max(zone_start_pfn, node_start_pfn);
4054 /* Return the spanned pages */
4055 return zone_end_pfn - zone_start_pfn;
4059 * Return the number of holes in a range on a node. If nid is MAX_NUMNODES,
4060 * then all holes in the requested range will be accounted for.
4062 unsigned long __meminit __absent_pages_in_range(int nid,
4063 unsigned long range_start_pfn,
4064 unsigned long range_end_pfn)
4066 unsigned long nr_absent = range_end_pfn - range_start_pfn;
4067 unsigned long start_pfn, end_pfn;
4070 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
4071 start_pfn = clamp(start_pfn, range_start_pfn, range_end_pfn);
4072 end_pfn = clamp(end_pfn, range_start_pfn, range_end_pfn);
4073 nr_absent -= end_pfn - start_pfn;
4079 * absent_pages_in_range - Return number of page frames in holes within a range
4080 * @start_pfn: The start PFN to start searching for holes
4081 * @end_pfn: The end PFN to stop searching for holes
4083 * It returns the number of pages frames in memory holes within a range.
4085 unsigned long __init absent_pages_in_range(unsigned long start_pfn,
4086 unsigned long end_pfn)
4088 return __absent_pages_in_range(MAX_NUMNODES, start_pfn, end_pfn);
4091 /* Return the number of page frames in holes in a zone on a node */
4092 static unsigned long __meminit zone_absent_pages_in_node(int nid,
4093 unsigned long zone_type,
4094 unsigned long *ignored)
4096 unsigned long zone_low = arch_zone_lowest_possible_pfn[zone_type];
4097 unsigned long zone_high = arch_zone_highest_possible_pfn[zone_type];
4098 unsigned long node_start_pfn, node_end_pfn;
4099 unsigned long zone_start_pfn, zone_end_pfn;
4101 get_pfn_range_for_nid(nid, &node_start_pfn, &node_end_pfn);
4102 zone_start_pfn = clamp(node_start_pfn, zone_low, zone_high);
4103 zone_end_pfn = clamp(node_end_pfn, zone_low, zone_high);
4105 adjust_zone_range_for_zone_movable(nid, zone_type,
4106 node_start_pfn, node_end_pfn,
4107 &zone_start_pfn, &zone_end_pfn);
4108 return __absent_pages_in_range(nid, zone_start_pfn, zone_end_pfn);
4111 #else /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
4112 static inline unsigned long __meminit zone_spanned_pages_in_node(int nid,
4113 unsigned long zone_type,
4114 unsigned long *zones_size)
4116 return zones_size[zone_type];
4119 static inline unsigned long __meminit zone_absent_pages_in_node(int nid,
4120 unsigned long zone_type,
4121 unsigned long *zholes_size)
4126 return zholes_size[zone_type];
4129 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
4131 static void __meminit calculate_node_totalpages(struct pglist_data *pgdat,
4132 unsigned long *zones_size, unsigned long *zholes_size)
4134 unsigned long realtotalpages, totalpages = 0;
4137 for (i = 0; i < MAX_NR_ZONES; i++)
4138 totalpages += zone_spanned_pages_in_node(pgdat->node_id, i,
4140 pgdat->node_spanned_pages = totalpages;
4142 realtotalpages = totalpages;
4143 for (i = 0; i < MAX_NR_ZONES; i++)
4145 zone_absent_pages_in_node(pgdat->node_id, i,
4147 pgdat->node_present_pages = realtotalpages;
4148 printk(KERN_DEBUG "On node %d totalpages: %lu\n", pgdat->node_id,
4152 #ifndef CONFIG_SPARSEMEM
4154 * Calculate the size of the zone->blockflags rounded to an unsigned long
4155 * Start by making sure zonesize is a multiple of pageblock_order by rounding
4156 * up. Then use 1 NR_PAGEBLOCK_BITS worth of bits per pageblock, finally
4157 * round what is now in bits to nearest long in bits, then return it in
4160 static unsigned long __init usemap_size(unsigned long zonesize)
4162 unsigned long usemapsize;
4164 usemapsize = roundup(zonesize, pageblock_nr_pages);
4165 usemapsize = usemapsize >> pageblock_order;
4166 usemapsize *= NR_PAGEBLOCK_BITS;
4167 usemapsize = roundup(usemapsize, 8 * sizeof(unsigned long));
4169 return usemapsize / 8;
4172 static void __init setup_usemap(struct pglist_data *pgdat,
4173 struct zone *zone, unsigned long zonesize)
4175 unsigned long usemapsize = usemap_size(zonesize);
4176 zone->pageblock_flags = NULL;
4178 zone->pageblock_flags = alloc_bootmem_node_nopanic(pgdat,
4182 static inline void setup_usemap(struct pglist_data *pgdat,
4183 struct zone *zone, unsigned long zonesize) {}
4184 #endif /* CONFIG_SPARSEMEM */
4186 #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
4188 /* Return a sensible default order for the pageblock size. */
4189 static inline int pageblock_default_order(void)
4191 if (HPAGE_SHIFT > PAGE_SHIFT)
4192 return HUGETLB_PAGE_ORDER;
4197 /* Initialise the number of pages represented by NR_PAGEBLOCK_BITS */
4198 static inline void __init set_pageblock_order(unsigned int order)
4200 /* Check that pageblock_nr_pages has not already been setup */
4201 if (pageblock_order)
4205 * Assume the largest contiguous order of interest is a huge page.
4206 * This value may be variable depending on boot parameters on IA64
4208 pageblock_order = order;
4210 #else /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
4213 * When CONFIG_HUGETLB_PAGE_SIZE_VARIABLE is not set, set_pageblock_order()
4214 * and pageblock_default_order() are unused as pageblock_order is set
4215 * at compile-time. See include/linux/pageblock-flags.h for the values of
4216 * pageblock_order based on the kernel config
4218 static inline int pageblock_default_order(unsigned int order)
4222 #define set_pageblock_order(x) do {} while (0)
4224 #endif /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
4227 * Set up the zone data structures:
4228 * - mark all pages reserved
4229 * - mark all memory queues empty
4230 * - clear the memory bitmaps
4232 static void __paginginit free_area_init_core(struct pglist_data *pgdat,
4233 unsigned long *zones_size, unsigned long *zholes_size)
4236 int nid = pgdat->node_id;
4237 unsigned long zone_start_pfn = pgdat->node_start_pfn;
4240 pgdat_resize_init(pgdat);
4241 pgdat->nr_zones = 0;
4242 init_waitqueue_head(&pgdat->kswapd_wait);
4243 pgdat->kswapd_max_order = 0;
4244 pgdat_page_cgroup_init(pgdat);
4246 for (j = 0; j < MAX_NR_ZONES; j++) {
4247 struct zone *zone = pgdat->node_zones + j;
4248 unsigned long size, realsize, memmap_pages;
4251 size = zone_spanned_pages_in_node(nid, j, zones_size);
4252 realsize = size - zone_absent_pages_in_node(nid, j,
4256 * Adjust realsize so that it accounts for how much memory
4257 * is used by this zone for memmap. This affects the watermark
4258 * and per-cpu initialisations
4261 PAGE_ALIGN(size * sizeof(struct page)) >> PAGE_SHIFT;
4262 if (realsize >= memmap_pages) {
4263 realsize -= memmap_pages;
4266 " %s zone: %lu pages used for memmap\n",
4267 zone_names[j], memmap_pages);
4270 " %s zone: %lu pages exceeds realsize %lu\n",
4271 zone_names[j], memmap_pages, realsize);
4273 /* Account for reserved pages */
4274 if (j == 0 && realsize > dma_reserve) {
4275 realsize -= dma_reserve;
4276 printk(KERN_DEBUG " %s zone: %lu pages reserved\n",
4277 zone_names[0], dma_reserve);
4280 if (!is_highmem_idx(j))
4281 nr_kernel_pages += realsize;
4282 nr_all_pages += realsize;
4284 zone->spanned_pages = size;
4285 zone->present_pages = realsize;
4288 zone->min_unmapped_pages = (realsize*sysctl_min_unmapped_ratio)
4290 zone->min_slab_pages = (realsize * sysctl_min_slab_ratio) / 100;
4292 zone->name = zone_names[j];
4293 spin_lock_init(&zone->lock);
4294 spin_lock_init(&zone->lru_lock);
4295 zone_seqlock_init(zone);
4296 zone->zone_pgdat = pgdat;
4298 zone_pcp_init(zone);
4300 INIT_LIST_HEAD(&zone->lru[l].list);
4301 zone->reclaim_stat.recent_rotated[0] = 0;
4302 zone->reclaim_stat.recent_rotated[1] = 0;
4303 zone->reclaim_stat.recent_scanned[0] = 0;
4304 zone->reclaim_stat.recent_scanned[1] = 0;
4305 zap_zone_vm_stats(zone);
4310 set_pageblock_order(pageblock_default_order());
4311 setup_usemap(pgdat, zone, size);
4312 ret = init_currently_empty_zone(zone, zone_start_pfn,
4313 size, MEMMAP_EARLY);
4315 memmap_init(size, nid, j, zone_start_pfn);
4316 zone_start_pfn += size;
4320 static void __init_refok alloc_node_mem_map(struct pglist_data *pgdat)
4322 /* Skip empty nodes */
4323 if (!pgdat->node_spanned_pages)
4326 #ifdef CONFIG_FLAT_NODE_MEM_MAP
4327 /* ia64 gets its own node_mem_map, before this, without bootmem */
4328 if (!pgdat->node_mem_map) {
4329 unsigned long size, start, end;
4333 * The zone's endpoints aren't required to be MAX_ORDER
4334 * aligned but the node_mem_map endpoints must be in order
4335 * for the buddy allocator to function correctly.
4337 start = pgdat->node_start_pfn & ~(MAX_ORDER_NR_PAGES - 1);
4338 end = pgdat->node_start_pfn + pgdat->node_spanned_pages;
4339 end = ALIGN(end, MAX_ORDER_NR_PAGES);
4340 size = (end - start) * sizeof(struct page);
4341 map = alloc_remap(pgdat->node_id, size);
4343 map = alloc_bootmem_node_nopanic(pgdat, size);
4344 pgdat->node_mem_map = map + (pgdat->node_start_pfn - start);
4346 #ifndef CONFIG_NEED_MULTIPLE_NODES
4348 * With no DISCONTIG, the global mem_map is just set as node 0's
4350 if (pgdat == NODE_DATA(0)) {
4351 mem_map = NODE_DATA(0)->node_mem_map;
4352 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
4353 if (page_to_pfn(mem_map) != pgdat->node_start_pfn)
4354 mem_map -= (pgdat->node_start_pfn - ARCH_PFN_OFFSET);
4355 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
4358 #endif /* CONFIG_FLAT_NODE_MEM_MAP */
4361 void __paginginit free_area_init_node(int nid, unsigned long *zones_size,
4362 unsigned long node_start_pfn, unsigned long *zholes_size)
4364 pg_data_t *pgdat = NODE_DATA(nid);
4366 pgdat->node_id = nid;
4367 pgdat->node_start_pfn = node_start_pfn;
4368 calculate_node_totalpages(pgdat, zones_size, zholes_size);
4370 alloc_node_mem_map(pgdat);
4371 #ifdef CONFIG_FLAT_NODE_MEM_MAP
4372 printk(KERN_DEBUG "free_area_init_node: node %d, pgdat %08lx, node_mem_map %08lx\n",
4373 nid, (unsigned long)pgdat,
4374 (unsigned long)pgdat->node_mem_map);
4377 free_area_init_core(pgdat, zones_size, zholes_size);
4380 #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
4382 #if MAX_NUMNODES > 1
4384 * Figure out the number of possible node ids.
4386 static void __init setup_nr_node_ids(void)
4389 unsigned int highest = 0;
4391 for_each_node_mask(node, node_possible_map)
4393 nr_node_ids = highest + 1;
4396 static inline void setup_nr_node_ids(void)
4402 * node_map_pfn_alignment - determine the maximum internode alignment
4404 * This function should be called after node map is populated and sorted.
4405 * It calculates the maximum power of two alignment which can distinguish
4408 * For example, if all nodes are 1GiB and aligned to 1GiB, the return value
4409 * would indicate 1GiB alignment with (1 << (30 - PAGE_SHIFT)). If the
4410 * nodes are shifted by 256MiB, 256MiB. Note that if only the last node is
4411 * shifted, 1GiB is enough and this function will indicate so.
4413 * This is used to test whether pfn -> nid mapping of the chosen memory
4414 * model has fine enough granularity to avoid incorrect mapping for the
4415 * populated node map.
4417 * Returns the determined alignment in pfn's. 0 if there is no alignment
4418 * requirement (single node).
4420 unsigned long __init node_map_pfn_alignment(void)
4422 unsigned long accl_mask = 0, last_end = 0;
4423 unsigned long start, end, mask;
4427 for_each_mem_pfn_range(i, MAX_NUMNODES, &start, &end, &nid) {
4428 if (!start || last_nid < 0 || last_nid == nid) {
4435 * Start with a mask granular enough to pin-point to the
4436 * start pfn and tick off bits one-by-one until it becomes
4437 * too coarse to separate the current node from the last.
4439 mask = ~((1 << __ffs(start)) - 1);
4440 while (mask && last_end <= (start & (mask << 1)))
4443 /* accumulate all internode masks */
4447 /* convert mask to number of pages */
4448 return ~accl_mask + 1;
4451 /* Find the lowest pfn for a node */
4452 static unsigned long __init find_min_pfn_for_node(int nid)
4454 unsigned long min_pfn = ULONG_MAX;
4455 unsigned long start_pfn;
4458 for_each_mem_pfn_range(i, nid, &start_pfn, NULL, NULL)
4459 min_pfn = min(min_pfn, start_pfn);
4461 if (min_pfn == ULONG_MAX) {
4463 "Could not find start_pfn for node %d\n", nid);
4471 * find_min_pfn_with_active_regions - Find the minimum PFN registered
4473 * It returns the minimum PFN based on information provided via
4474 * add_active_range().
4476 unsigned long __init find_min_pfn_with_active_regions(void)
4478 return find_min_pfn_for_node(MAX_NUMNODES);
4482 * early_calculate_totalpages()
4483 * Sum pages in active regions for movable zone.
4484 * Populate N_HIGH_MEMORY for calculating usable_nodes.
4486 static unsigned long __init early_calculate_totalpages(void)
4488 unsigned long totalpages = 0;
4489 unsigned long start_pfn, end_pfn;
4492 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid) {
4493 unsigned long pages = end_pfn - start_pfn;
4495 totalpages += pages;
4497 node_set_state(nid, N_HIGH_MEMORY);
4503 * Find the PFN the Movable zone begins in each node. Kernel memory
4504 * is spread evenly between nodes as long as the nodes have enough
4505 * memory. When they don't, some nodes will have more kernelcore than
4508 static void __init find_zone_movable_pfns_for_nodes(unsigned long *movable_pfn)
4511 unsigned long usable_startpfn;
4512 unsigned long kernelcore_node, kernelcore_remaining;
4513 /* save the state before borrow the nodemask */
4514 nodemask_t saved_node_state = node_states[N_HIGH_MEMORY];
4515 unsigned long totalpages = early_calculate_totalpages();
4516 int usable_nodes = nodes_weight(node_states[N_HIGH_MEMORY]);
4519 * If movablecore was specified, calculate what size of
4520 * kernelcore that corresponds so that memory usable for
4521 * any allocation type is evenly spread. If both kernelcore
4522 * and movablecore are specified, then the value of kernelcore
4523 * will be used for required_kernelcore if it's greater than
4524 * what movablecore would have allowed.
4526 if (required_movablecore) {
4527 unsigned long corepages;
4530 * Round-up so that ZONE_MOVABLE is at least as large as what
4531 * was requested by the user
4533 required_movablecore =
4534 roundup(required_movablecore, MAX_ORDER_NR_PAGES);
4535 corepages = totalpages - required_movablecore;
4537 required_kernelcore = max(required_kernelcore, corepages);
4540 /* If kernelcore was not specified, there is no ZONE_MOVABLE */
4541 if (!required_kernelcore)
4544 /* usable_startpfn is the lowest possible pfn ZONE_MOVABLE can be at */
4545 find_usable_zone_for_movable();
4546 usable_startpfn = arch_zone_lowest_possible_pfn[movable_zone];
4549 /* Spread kernelcore memory as evenly as possible throughout nodes */
4550 kernelcore_node = required_kernelcore / usable_nodes;
4551 for_each_node_state(nid, N_HIGH_MEMORY) {
4552 unsigned long start_pfn, end_pfn;
4555 * Recalculate kernelcore_node if the division per node
4556 * now exceeds what is necessary to satisfy the requested
4557 * amount of memory for the kernel
4559 if (required_kernelcore < kernelcore_node)
4560 kernelcore_node = required_kernelcore / usable_nodes;
4563 * As the map is walked, we track how much memory is usable
4564 * by the kernel using kernelcore_remaining. When it is
4565 * 0, the rest of the node is usable by ZONE_MOVABLE
4567 kernelcore_remaining = kernelcore_node;
4569 /* Go through each range of PFNs within this node */
4570 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
4571 unsigned long size_pages;
4573 start_pfn = max(start_pfn, zone_movable_pfn[nid]);
4574 if (start_pfn >= end_pfn)
4577 /* Account for what is only usable for kernelcore */
4578 if (start_pfn < usable_startpfn) {
4579 unsigned long kernel_pages;
4580 kernel_pages = min(end_pfn, usable_startpfn)
4583 kernelcore_remaining -= min(kernel_pages,
4584 kernelcore_remaining);
4585 required_kernelcore -= min(kernel_pages,
4586 required_kernelcore);
4588 /* Continue if range is now fully accounted */
4589 if (end_pfn <= usable_startpfn) {
4592 * Push zone_movable_pfn to the end so
4593 * that if we have to rebalance
4594 * kernelcore across nodes, we will
4595 * not double account here
4597 zone_movable_pfn[nid] = end_pfn;
4600 start_pfn = usable_startpfn;
4604 * The usable PFN range for ZONE_MOVABLE is from
4605 * start_pfn->end_pfn. Calculate size_pages as the
4606 * number of pages used as kernelcore
4608 size_pages = end_pfn - start_pfn;
4609 if (size_pages > kernelcore_remaining)
4610 size_pages = kernelcore_remaining;
4611 zone_movable_pfn[nid] = start_pfn + size_pages;
4614 * Some kernelcore has been met, update counts and
4615 * break if the kernelcore for this node has been
4618 required_kernelcore -= min(required_kernelcore,
4620 kernelcore_remaining -= size_pages;
4621 if (!kernelcore_remaining)
4627 * If there is still required_kernelcore, we do another pass with one
4628 * less node in the count. This will push zone_movable_pfn[nid] further
4629 * along on the nodes that still have memory until kernelcore is
4633 if (usable_nodes && required_kernelcore > usable_nodes)
4636 /* Align start of ZONE_MOVABLE on all nids to MAX_ORDER_NR_PAGES */
4637 for (nid = 0; nid < MAX_NUMNODES; nid++)
4638 zone_movable_pfn[nid] =
4639 roundup(zone_movable_pfn[nid], MAX_ORDER_NR_PAGES);
4642 /* restore the node_state */
4643 node_states[N_HIGH_MEMORY] = saved_node_state;
4646 /* Any regular memory on that node ? */
4647 static void check_for_regular_memory(pg_data_t *pgdat)
4649 #ifdef CONFIG_HIGHMEM
4650 enum zone_type zone_type;
4652 for (zone_type = 0; zone_type <= ZONE_NORMAL; zone_type++) {
4653 struct zone *zone = &pgdat->node_zones[zone_type];
4654 if (zone->present_pages)
4655 node_set_state(zone_to_nid(zone), N_NORMAL_MEMORY);
4661 * free_area_init_nodes - Initialise all pg_data_t and zone data
4662 * @max_zone_pfn: an array of max PFNs for each zone
4664 * This will call free_area_init_node() for each active node in the system.
4665 * Using the page ranges provided by add_active_range(), the size of each
4666 * zone in each node and their holes is calculated. If the maximum PFN
4667 * between two adjacent zones match, it is assumed that the zone is empty.
4668 * For example, if arch_max_dma_pfn == arch_max_dma32_pfn, it is assumed
4669 * that arch_max_dma32_pfn has no pages. It is also assumed that a zone
4670 * starts where the previous one ended. For example, ZONE_DMA32 starts
4671 * at arch_max_dma_pfn.
4673 void __init free_area_init_nodes(unsigned long *max_zone_pfn)
4675 unsigned long start_pfn, end_pfn;
4678 /* Record where the zone boundaries are */
4679 memset(arch_zone_lowest_possible_pfn, 0,
4680 sizeof(arch_zone_lowest_possible_pfn));
4681 memset(arch_zone_highest_possible_pfn, 0,
4682 sizeof(arch_zone_highest_possible_pfn));
4683 arch_zone_lowest_possible_pfn[0] = find_min_pfn_with_active_regions();
4684 arch_zone_highest_possible_pfn[0] = max_zone_pfn[0];
4685 for (i = 1; i < MAX_NR_ZONES; i++) {
4686 if (i == ZONE_MOVABLE)
4688 arch_zone_lowest_possible_pfn[i] =
4689 arch_zone_highest_possible_pfn[i-1];
4690 arch_zone_highest_possible_pfn[i] =
4691 max(max_zone_pfn[i], arch_zone_lowest_possible_pfn[i]);
4693 arch_zone_lowest_possible_pfn[ZONE_MOVABLE] = 0;
4694 arch_zone_highest_possible_pfn[ZONE_MOVABLE] = 0;
4696 /* Find the PFNs that ZONE_MOVABLE begins at in each node */
4697 memset(zone_movable_pfn, 0, sizeof(zone_movable_pfn));
4698 find_zone_movable_pfns_for_nodes(zone_movable_pfn);
4700 /* Print out the zone ranges */
4701 printk("Zone PFN ranges:\n");
4702 for (i = 0; i < MAX_NR_ZONES; i++) {
4703 if (i == ZONE_MOVABLE)
4705 printk(" %-8s ", zone_names[i]);
4706 if (arch_zone_lowest_possible_pfn[i] ==
4707 arch_zone_highest_possible_pfn[i])
4710 printk("%0#10lx -> %0#10lx\n",
4711 arch_zone_lowest_possible_pfn[i],
4712 arch_zone_highest_possible_pfn[i]);
4715 /* Print out the PFNs ZONE_MOVABLE begins at in each node */
4716 printk("Movable zone start PFN for each node\n");
4717 for (i = 0; i < MAX_NUMNODES; i++) {
4718 if (zone_movable_pfn[i])
4719 printk(" Node %d: %lu\n", i, zone_movable_pfn[i]);
4722 /* Print out the early_node_map[] */
4723 printk("Early memory PFN ranges\n");
4724 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid)
4725 printk(" %3d: %0#10lx -> %0#10lx\n", nid, start_pfn, end_pfn);
4727 /* Initialise every node */
4728 mminit_verify_pageflags_layout();
4729 setup_nr_node_ids();
4730 for_each_online_node(nid) {
4731 pg_data_t *pgdat = NODE_DATA(nid);
4732 free_area_init_node(nid, NULL,
4733 find_min_pfn_for_node(nid), NULL);
4735 /* Any memory on that node */
4736 if (pgdat->node_present_pages)
4737 node_set_state(nid, N_HIGH_MEMORY);
4738 check_for_regular_memory(pgdat);
4742 static int __init cmdline_parse_core(char *p, unsigned long *core)
4744 unsigned long long coremem;
4748 coremem = memparse(p, &p);
4749 *core = coremem >> PAGE_SHIFT;
4751 /* Paranoid check that UL is enough for the coremem value */
4752 WARN_ON((coremem >> PAGE_SHIFT) > ULONG_MAX);
4758 * kernelcore=size sets the amount of memory for use for allocations that
4759 * cannot be reclaimed or migrated.
4761 static int __init cmdline_parse_kernelcore(char *p)
4763 return cmdline_parse_core(p, &required_kernelcore);
4767 * movablecore=size sets the amount of memory for use for allocations that
4768 * can be reclaimed or migrated.
4770 static int __init cmdline_parse_movablecore(char *p)
4772 return cmdline_parse_core(p, &required_movablecore);
4775 early_param("kernelcore", cmdline_parse_kernelcore);
4776 early_param("movablecore", cmdline_parse_movablecore);
4778 #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
4781 * set_dma_reserve - set the specified number of pages reserved in the first zone
4782 * @new_dma_reserve: The number of pages to mark reserved
4784 * The per-cpu batchsize and zone watermarks are determined by present_pages.
4785 * In the DMA zone, a significant percentage may be consumed by kernel image
4786 * and other unfreeable allocations which can skew the watermarks badly. This
4787 * function may optionally be used to account for unfreeable pages in the
4788 * first zone (e.g., ZONE_DMA). The effect will be lower watermarks and
4789 * smaller per-cpu batchsize.
4791 void __init set_dma_reserve(unsigned long new_dma_reserve)
4793 dma_reserve = new_dma_reserve;
4796 void __init free_area_init(unsigned long *zones_size)
4798 free_area_init_node(0, zones_size,
4799 __pa(PAGE_OFFSET) >> PAGE_SHIFT, NULL);
4802 static int page_alloc_cpu_notify(struct notifier_block *self,
4803 unsigned long action, void *hcpu)
4805 int cpu = (unsigned long)hcpu;
4807 if (action == CPU_DEAD || action == CPU_DEAD_FROZEN) {
4811 * Spill the event counters of the dead processor
4812 * into the current processors event counters.
4813 * This artificially elevates the count of the current
4816 vm_events_fold_cpu(cpu);
4819 * Zero the differential counters of the dead processor
4820 * so that the vm statistics are consistent.
4822 * This is only okay since the processor is dead and cannot
4823 * race with what we are doing.
4825 refresh_cpu_vm_stats(cpu);
4830 void __init page_alloc_init(void)
4832 hotcpu_notifier(page_alloc_cpu_notify, 0);
4836 * calculate_totalreserve_pages - called when sysctl_lower_zone_reserve_ratio
4837 * or min_free_kbytes changes.
4839 static void calculate_totalreserve_pages(void)
4841 struct pglist_data *pgdat;
4842 unsigned long reserve_pages = 0;
4843 enum zone_type i, j;
4845 for_each_online_pgdat(pgdat) {
4846 for (i = 0; i < MAX_NR_ZONES; i++) {
4847 struct zone *zone = pgdat->node_zones + i;
4848 unsigned long max = 0;
4850 /* Find valid and maximum lowmem_reserve in the zone */
4851 for (j = i; j < MAX_NR_ZONES; j++) {
4852 if (zone->lowmem_reserve[j] > max)
4853 max = zone->lowmem_reserve[j];
4856 /* we treat the high watermark as reserved pages. */
4857 max += high_wmark_pages(zone);
4859 if (max > zone->present_pages)
4860 max = zone->present_pages;
4861 reserve_pages += max;
4863 * Lowmem reserves are not available to
4864 * GFP_HIGHUSER page cache allocations and
4865 * kswapd tries to balance zones to their high
4866 * watermark. As a result, neither should be
4867 * regarded as dirtyable memory, to prevent a
4868 * situation where reclaim has to clean pages
4869 * in order to balance the zones.
4871 zone->dirty_balance_reserve = max;
4874 dirty_balance_reserve = reserve_pages;
4875 totalreserve_pages = reserve_pages;
4879 * setup_per_zone_lowmem_reserve - called whenever
4880 * sysctl_lower_zone_reserve_ratio changes. Ensures that each zone
4881 * has a correct pages reserved value, so an adequate number of
4882 * pages are left in the zone after a successful __alloc_pages().
4884 static void setup_per_zone_lowmem_reserve(void)
4886 struct pglist_data *pgdat;
4887 enum zone_type j, idx;
4889 for_each_online_pgdat(pgdat) {
4890 for (j = 0; j < MAX_NR_ZONES; j++) {
4891 struct zone *zone = pgdat->node_zones + j;
4892 unsigned long present_pages = zone->present_pages;
4894 zone->lowmem_reserve[j] = 0;
4898 struct zone *lower_zone;
4902 if (sysctl_lowmem_reserve_ratio[idx] < 1)
4903 sysctl_lowmem_reserve_ratio[idx] = 1;
4905 lower_zone = pgdat->node_zones + idx;
4906 lower_zone->lowmem_reserve[j] = present_pages /
4907 sysctl_lowmem_reserve_ratio[idx];
4908 present_pages += lower_zone->present_pages;
4913 /* update totalreserve_pages */
4914 calculate_totalreserve_pages();
4918 * setup_per_zone_wmarks - called when min_free_kbytes changes
4919 * or when memory is hot-{added|removed}
4921 * Ensures that the watermark[min,low,high] values for each zone are set
4922 * correctly with respect to min_free_kbytes.
4924 void setup_per_zone_wmarks(void)
4926 unsigned long pages_min = min_free_kbytes >> (PAGE_SHIFT - 10);
4927 unsigned long lowmem_pages = 0;
4929 unsigned long flags;
4931 /* Calculate total number of !ZONE_HIGHMEM pages */
4932 for_each_zone(zone) {
4933 if (!is_highmem(zone))
4934 lowmem_pages += zone->present_pages;
4937 for_each_zone(zone) {
4940 spin_lock_irqsave(&zone->lock, flags);
4941 tmp = (u64)pages_min * zone->present_pages;
4942 do_div(tmp, lowmem_pages);
4943 if (is_highmem(zone)) {
4945 * __GFP_HIGH and PF_MEMALLOC allocations usually don't
4946 * need highmem pages, so cap pages_min to a small
4949 * The WMARK_HIGH-WMARK_LOW and (WMARK_LOW-WMARK_MIN)
4950 * deltas controls asynch page reclaim, and so should
4951 * not be capped for highmem.
4955 min_pages = zone->present_pages / 1024;
4956 if (min_pages < SWAP_CLUSTER_MAX)
4957 min_pages = SWAP_CLUSTER_MAX;
4958 if (min_pages > 128)
4960 zone->watermark[WMARK_MIN] = min_pages;
4963 * If it's a lowmem zone, reserve a number of pages
4964 * proportionate to the zone's size.
4966 zone->watermark[WMARK_MIN] = tmp;
4969 zone->watermark[WMARK_LOW] = min_wmark_pages(zone) + (tmp >> 2);
4970 zone->watermark[WMARK_HIGH] = min_wmark_pages(zone) + (tmp >> 1);
4971 setup_zone_migrate_reserve(zone);
4972 spin_unlock_irqrestore(&zone->lock, flags);
4975 /* update totalreserve_pages */
4976 calculate_totalreserve_pages();
4980 * The inactive anon list should be small enough that the VM never has to
4981 * do too much work, but large enough that each inactive page has a chance
4982 * to be referenced again before it is swapped out.
4984 * The inactive_anon ratio is the target ratio of ACTIVE_ANON to
4985 * INACTIVE_ANON pages on this zone's LRU, maintained by the
4986 * pageout code. A zone->inactive_ratio of 3 means 3:1 or 25% of
4987 * the anonymous pages are kept on the inactive list.
4990 * memory ratio inactive anon
4991 * -------------------------------------
5000 static void __meminit calculate_zone_inactive_ratio(struct zone *zone)
5002 unsigned int gb, ratio;
5004 /* Zone size in gigabytes */
5005 gb = zone->present_pages >> (30 - PAGE_SHIFT);
5007 ratio = int_sqrt(10 * gb);
5011 zone->inactive_ratio = ratio;
5014 static void __meminit setup_per_zone_inactive_ratio(void)
5019 calculate_zone_inactive_ratio(zone);
5023 * Initialise min_free_kbytes.
5025 * For small machines we want it small (128k min). For large machines
5026 * we want it large (64MB max). But it is not linear, because network
5027 * bandwidth does not increase linearly with machine size. We use
5029 * min_free_kbytes = 4 * sqrt(lowmem_kbytes), for better accuracy:
5030 * min_free_kbytes = sqrt(lowmem_kbytes * 16)
5046 int __meminit init_per_zone_wmark_min(void)
5048 unsigned long lowmem_kbytes;
5050 lowmem_kbytes = nr_free_buffer_pages() * (PAGE_SIZE >> 10);
5052 min_free_kbytes = int_sqrt(lowmem_kbytes * 16);
5053 if (min_free_kbytes < 128)
5054 min_free_kbytes = 128;
5055 if (min_free_kbytes > 65536)
5056 min_free_kbytes = 65536;
5057 setup_per_zone_wmarks();
5058 refresh_zone_stat_thresholds();
5059 setup_per_zone_lowmem_reserve();
5060 setup_per_zone_inactive_ratio();
5063 module_init(init_per_zone_wmark_min)
5066 * min_free_kbytes_sysctl_handler - just a wrapper around proc_dointvec() so
5067 * that we can call two helper functions whenever min_free_kbytes
5070 int min_free_kbytes_sysctl_handler(ctl_table *table, int write,
5071 void __user *buffer, size_t *length, loff_t *ppos)
5073 proc_dointvec(table, write, buffer, length, ppos);
5075 setup_per_zone_wmarks();
5080 int sysctl_min_unmapped_ratio_sysctl_handler(ctl_table *table, int write,
5081 void __user *buffer, size_t *length, loff_t *ppos)
5086 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
5091 zone->min_unmapped_pages = (zone->present_pages *
5092 sysctl_min_unmapped_ratio) / 100;
5096 int sysctl_min_slab_ratio_sysctl_handler(ctl_table *table, int write,
5097 void __user *buffer, size_t *length, loff_t *ppos)
5102 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
5107 zone->min_slab_pages = (zone->present_pages *
5108 sysctl_min_slab_ratio) / 100;
5114 * lowmem_reserve_ratio_sysctl_handler - just a wrapper around
5115 * proc_dointvec() so that we can call setup_per_zone_lowmem_reserve()
5116 * whenever sysctl_lowmem_reserve_ratio changes.
5118 * The reserve ratio obviously has absolutely no relation with the
5119 * minimum watermarks. The lowmem reserve ratio can only make sense
5120 * if in function of the boot time zone sizes.
5122 int lowmem_reserve_ratio_sysctl_handler(ctl_table *table, int write,
5123 void __user *buffer, size_t *length, loff_t *ppos)
5125 proc_dointvec_minmax(table, write, buffer, length, ppos);
5126 setup_per_zone_lowmem_reserve();
5131 * percpu_pagelist_fraction - changes the pcp->high for each zone on each
5132 * cpu. It is the fraction of total pages in each zone that a hot per cpu pagelist
5133 * can have before it gets flushed back to buddy allocator.
5136 int percpu_pagelist_fraction_sysctl_handler(ctl_table *table, int write,
5137 void __user *buffer, size_t *length, loff_t *ppos)
5143 ret = proc_dointvec_minmax(table, write, buffer, length, ppos);
5144 if (!write || (ret == -EINVAL))
5146 for_each_populated_zone(zone) {
5147 for_each_possible_cpu(cpu) {
5149 high = zone->present_pages / percpu_pagelist_fraction;
5150 setup_pagelist_highmark(
5151 per_cpu_ptr(zone->pageset, cpu), high);
5157 int hashdist = HASHDIST_DEFAULT;
5160 static int __init set_hashdist(char *str)
5164 hashdist = simple_strtoul(str, &str, 0);
5167 __setup("hashdist=", set_hashdist);
5171 * allocate a large system hash table from bootmem
5172 * - it is assumed that the hash table must contain an exact power-of-2
5173 * quantity of entries
5174 * - limit is the number of hash buckets, not the total allocation size
5176 void *__init alloc_large_system_hash(const char *tablename,
5177 unsigned long bucketsize,
5178 unsigned long numentries,
5181 unsigned int *_hash_shift,
5182 unsigned int *_hash_mask,
5183 unsigned long limit)
5185 unsigned long long max = limit;
5186 unsigned long log2qty, size;
5189 /* allow the kernel cmdline to have a say */
5191 /* round applicable memory size up to nearest megabyte */
5192 numentries = nr_kernel_pages;
5193 numentries += (1UL << (20 - PAGE_SHIFT)) - 1;
5194 numentries >>= 20 - PAGE_SHIFT;
5195 numentries <<= 20 - PAGE_SHIFT;
5197 /* limit to 1 bucket per 2^scale bytes of low memory */
5198 if (scale > PAGE_SHIFT)
5199 numentries >>= (scale - PAGE_SHIFT);
5201 numentries <<= (PAGE_SHIFT - scale);
5203 /* Make sure we've got at least a 0-order allocation.. */
5204 if (unlikely(flags & HASH_SMALL)) {
5205 /* Makes no sense without HASH_EARLY */
5206 WARN_ON(!(flags & HASH_EARLY));
5207 if (!(numentries >> *_hash_shift)) {
5208 numentries = 1UL << *_hash_shift;
5209 BUG_ON(!numentries);
5211 } else if (unlikely((numentries * bucketsize) < PAGE_SIZE))
5212 numentries = PAGE_SIZE / bucketsize;
5214 numentries = roundup_pow_of_two(numentries);
5216 /* limit allocation size to 1/16 total memory by default */
5218 max = ((unsigned long long)nr_all_pages << PAGE_SHIFT) >> 4;
5219 do_div(max, bucketsize);
5222 if (numentries > max)
5225 log2qty = ilog2(numentries);
5228 size = bucketsize << log2qty;
5229 if (flags & HASH_EARLY)
5230 table = alloc_bootmem_nopanic(size);
5232 table = __vmalloc(size, GFP_ATOMIC, PAGE_KERNEL);
5235 * If bucketsize is not a power-of-two, we may free
5236 * some pages at the end of hash table which
5237 * alloc_pages_exact() automatically does
5239 if (get_order(size) < MAX_ORDER) {
5240 table = alloc_pages_exact(size, GFP_ATOMIC);
5241 kmemleak_alloc(table, size, 1, GFP_ATOMIC);
5244 } while (!table && size > PAGE_SIZE && --log2qty);
5247 panic("Failed to allocate %s hash table\n", tablename);
5249 printk(KERN_INFO "%s hash table entries: %ld (order: %d, %lu bytes)\n",
5252 ilog2(size) - PAGE_SHIFT,
5256 *_hash_shift = log2qty;
5258 *_hash_mask = (1 << log2qty) - 1;
5263 /* Return a pointer to the bitmap storing bits affecting a block of pages */
5264 static inline unsigned long *get_pageblock_bitmap(struct zone *zone,
5267 #ifdef CONFIG_SPARSEMEM
5268 return __pfn_to_section(pfn)->pageblock_flags;
5270 return zone->pageblock_flags;
5271 #endif /* CONFIG_SPARSEMEM */
5274 static inline int pfn_to_bitidx(struct zone *zone, unsigned long pfn)
5276 #ifdef CONFIG_SPARSEMEM
5277 pfn &= (PAGES_PER_SECTION-1);
5278 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
5280 pfn = pfn - zone->zone_start_pfn;
5281 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
5282 #endif /* CONFIG_SPARSEMEM */
5286 * get_pageblock_flags_group - Return the requested group of flags for the pageblock_nr_pages block of pages
5287 * @page: The page within the block of interest
5288 * @start_bitidx: The first bit of interest to retrieve
5289 * @end_bitidx: The last bit of interest
5290 * returns pageblock_bits flags
5292 unsigned long get_pageblock_flags_group(struct page *page,
5293 int start_bitidx, int end_bitidx)
5296 unsigned long *bitmap;
5297 unsigned long pfn, bitidx;
5298 unsigned long flags = 0;
5299 unsigned long value = 1;
5301 zone = page_zone(page);
5302 pfn = page_to_pfn(page);
5303 bitmap = get_pageblock_bitmap(zone, pfn);
5304 bitidx = pfn_to_bitidx(zone, pfn);
5306 for (; start_bitidx <= end_bitidx; start_bitidx++, value <<= 1)
5307 if (test_bit(bitidx + start_bitidx, bitmap))
5314 * set_pageblock_flags_group - Set the requested group of flags for a pageblock_nr_pages block of pages
5315 * @page: The page within the block of interest
5316 * @start_bitidx: The first bit of interest
5317 * @end_bitidx: The last bit of interest
5318 * @flags: The flags to set
5320 void set_pageblock_flags_group(struct page *page, unsigned long flags,
5321 int start_bitidx, int end_bitidx)
5324 unsigned long *bitmap;
5325 unsigned long pfn, bitidx;
5326 unsigned long value = 1;
5328 zone = page_zone(page);
5329 pfn = page_to_pfn(page);
5330 bitmap = get_pageblock_bitmap(zone, pfn);
5331 bitidx = pfn_to_bitidx(zone, pfn);
5332 VM_BUG_ON(pfn < zone->zone_start_pfn);
5333 VM_BUG_ON(pfn >= zone->zone_start_pfn + zone->spanned_pages);
5335 for (; start_bitidx <= end_bitidx; start_bitidx++, value <<= 1)
5337 __set_bit(bitidx + start_bitidx, bitmap);
5339 __clear_bit(bitidx + start_bitidx, bitmap);
5343 * This is designed as sub function...plz see page_isolation.c also.
5344 * set/clear page block's type to be ISOLATE.
5345 * page allocater never alloc memory from ISOLATE block.
5349 __count_immobile_pages(struct zone *zone, struct page *page, int count)
5351 unsigned long pfn, iter, found;
5353 * For avoiding noise data, lru_add_drain_all() should be called
5354 * If ZONE_MOVABLE, the zone never contains immobile pages
5356 if (zone_idx(zone) == ZONE_MOVABLE)
5359 if (get_pageblock_migratetype(page) == MIGRATE_MOVABLE)
5362 pfn = page_to_pfn(page);
5363 for (found = 0, iter = 0; iter < pageblock_nr_pages; iter++) {
5364 unsigned long check = pfn + iter;
5366 if (!pfn_valid_within(check))
5369 page = pfn_to_page(check);
5370 if (!page_count(page)) {
5371 if (PageBuddy(page))
5372 iter += (1 << page_order(page)) - 1;
5378 * If there are RECLAIMABLE pages, we need to check it.
5379 * But now, memory offline itself doesn't call shrink_slab()
5380 * and it still to be fixed.
5383 * If the page is not RAM, page_count()should be 0.
5384 * we don't need more check. This is an _used_ not-movable page.
5386 * The problematic thing here is PG_reserved pages. PG_reserved
5387 * is set to both of a memory hole page and a _used_ kernel
5396 bool is_pageblock_removable_nolock(struct page *page)
5398 struct zone *zone = page_zone(page);
5399 return __count_immobile_pages(zone, page, 0);
5402 int set_migratetype_isolate(struct page *page)
5405 unsigned long flags, pfn;
5406 struct memory_isolate_notify arg;
5410 zone = page_zone(page);
5412 spin_lock_irqsave(&zone->lock, flags);
5414 pfn = page_to_pfn(page);
5415 arg.start_pfn = pfn;
5416 arg.nr_pages = pageblock_nr_pages;
5417 arg.pages_found = 0;
5420 * It may be possible to isolate a pageblock even if the
5421 * migratetype is not MIGRATE_MOVABLE. The memory isolation
5422 * notifier chain is used by balloon drivers to return the
5423 * number of pages in a range that are held by the balloon
5424 * driver to shrink memory. If all the pages are accounted for
5425 * by balloons, are free, or on the LRU, isolation can continue.
5426 * Later, for example, when memory hotplug notifier runs, these
5427 * pages reported as "can be isolated" should be isolated(freed)
5428 * by the balloon driver through the memory notifier chain.
5430 notifier_ret = memory_isolate_notify(MEM_ISOLATE_COUNT, &arg);
5431 notifier_ret = notifier_to_errno(notifier_ret);
5435 * FIXME: Now, memory hotplug doesn't call shrink_slab() by itself.
5436 * We just check MOVABLE pages.
5438 if (__count_immobile_pages(zone, page, arg.pages_found))
5442 * immobile means "not-on-lru" paes. If immobile is larger than
5443 * removable-by-driver pages reported by notifier, we'll fail.
5448 set_pageblock_migratetype(page, MIGRATE_ISOLATE);
5449 move_freepages_block(zone, page, MIGRATE_ISOLATE);
5452 spin_unlock_irqrestore(&zone->lock, flags);
5458 void unset_migratetype_isolate(struct page *page)
5461 unsigned long flags;
5462 zone = page_zone(page);
5463 spin_lock_irqsave(&zone->lock, flags);
5464 if (get_pageblock_migratetype(page) != MIGRATE_ISOLATE)
5466 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
5467 move_freepages_block(zone, page, MIGRATE_MOVABLE);
5469 spin_unlock_irqrestore(&zone->lock, flags);
5472 #ifdef CONFIG_MEMORY_HOTREMOVE
5474 * All pages in the range must be isolated before calling this.
5477 __offline_isolated_pages(unsigned long start_pfn, unsigned long end_pfn)
5483 unsigned long flags;
5484 /* find the first valid pfn */
5485 for (pfn = start_pfn; pfn < end_pfn; pfn++)
5490 zone = page_zone(pfn_to_page(pfn));
5491 spin_lock_irqsave(&zone->lock, flags);
5493 while (pfn < end_pfn) {
5494 if (!pfn_valid(pfn)) {
5498 page = pfn_to_page(pfn);
5499 BUG_ON(page_count(page));
5500 BUG_ON(!PageBuddy(page));
5501 order = page_order(page);
5502 #ifdef CONFIG_DEBUG_VM
5503 printk(KERN_INFO "remove from free list %lx %d %lx\n",
5504 pfn, 1 << order, end_pfn);
5506 list_del(&page->lru);
5507 rmv_page_order(page);
5508 zone->free_area[order].nr_free--;
5509 __mod_zone_page_state(zone, NR_FREE_PAGES,
5511 for (i = 0; i < (1 << order); i++)
5512 SetPageReserved((page+i));
5513 pfn += (1 << order);
5515 spin_unlock_irqrestore(&zone->lock, flags);
5519 #ifdef CONFIG_MEMORY_FAILURE
5520 bool is_free_buddy_page(struct page *page)
5522 struct zone *zone = page_zone(page);
5523 unsigned long pfn = page_to_pfn(page);
5524 unsigned long flags;
5527 spin_lock_irqsave(&zone->lock, flags);
5528 for (order = 0; order < MAX_ORDER; order++) {
5529 struct page *page_head = page - (pfn & ((1 << order) - 1));
5531 if (PageBuddy(page_head) && page_order(page_head) >= order)
5534 spin_unlock_irqrestore(&zone->lock, flags);
5536 return order < MAX_ORDER;
5540 static struct trace_print_flags pageflag_names[] = {
5541 {1UL << PG_locked, "locked" },
5542 {1UL << PG_error, "error" },
5543 {1UL << PG_referenced, "referenced" },
5544 {1UL << PG_uptodate, "uptodate" },
5545 {1UL << PG_dirty, "dirty" },
5546 {1UL << PG_lru, "lru" },
5547 {1UL << PG_active, "active" },
5548 {1UL << PG_slab, "slab" },
5549 {1UL << PG_owner_priv_1, "owner_priv_1" },
5550 {1UL << PG_arch_1, "arch_1" },
5551 {1UL << PG_reserved, "reserved" },
5552 {1UL << PG_private, "private" },
5553 {1UL << PG_private_2, "private_2" },
5554 {1UL << PG_writeback, "writeback" },
5555 #ifdef CONFIG_PAGEFLAGS_EXTENDED
5556 {1UL << PG_head, "head" },
5557 {1UL << PG_tail, "tail" },
5559 {1UL << PG_compound, "compound" },
5561 {1UL << PG_swapcache, "swapcache" },
5562 {1UL << PG_mappedtodisk, "mappedtodisk" },
5563 {1UL << PG_reclaim, "reclaim" },
5564 {1UL << PG_swapbacked, "swapbacked" },
5565 {1UL << PG_unevictable, "unevictable" },
5567 {1UL << PG_mlocked, "mlocked" },
5569 #ifdef CONFIG_ARCH_USES_PG_UNCACHED
5570 {1UL << PG_uncached, "uncached" },
5572 #ifdef CONFIG_MEMORY_FAILURE
5573 {1UL << PG_hwpoison, "hwpoison" },
5578 static void dump_page_flags(unsigned long flags)
5580 const char *delim = "";
5584 printk(KERN_ALERT "page flags: %#lx(", flags);
5586 /* remove zone id */
5587 flags &= (1UL << NR_PAGEFLAGS) - 1;
5589 for (i = 0; pageflag_names[i].name && flags; i++) {
5591 mask = pageflag_names[i].mask;
5592 if ((flags & mask) != mask)
5596 printk("%s%s", delim, pageflag_names[i].name);
5600 /* check for left over flags */
5602 printk("%s%#lx", delim, flags);
5607 void dump_page(struct page *page)
5610 "page:%p count:%d mapcount:%d mapping:%p index:%#lx\n",
5611 page, atomic_read(&page->_count), page_mapcount(page),
5612 page->mapping, page->index);
5613 dump_page_flags(page->flags);
5614 mem_cgroup_print_bad_page(page);