Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | /* |
| 2 | * linux/mm/page_alloc.c |
| 3 | * |
| 4 | * Manages the free list, the system allocates free pages here. |
| 5 | * Note that kmalloc() lives in slab.c |
| 6 | * |
| 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) |
| 15 | */ |
| 16 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 17 | #include <linux/stddef.h> |
| 18 | #include <linux/mm.h> |
| 19 | #include <linux/swap.h> |
| 20 | #include <linux/interrupt.h> |
| 21 | #include <linux/pagemap.h> |
KOSAKI Motohiro | 10ed273 | 2008-03-04 14:28:32 -0800 | [diff] [blame] | 22 | #include <linux/jiffies.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 23 | #include <linux/bootmem.h> |
Yinghai Lu | edbe7d2 | 2010-08-25 13:39:16 -0700 | [diff] [blame] | 24 | #include <linux/memblock.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 25 | #include <linux/compiler.h> |
Randy Dunlap | 9f15833 | 2005-09-13 01:25:16 -0700 | [diff] [blame] | 26 | #include <linux/kernel.h> |
Vegard Nossum | b1eeab6 | 2008-11-25 16:55:53 +0100 | [diff] [blame] | 27 | #include <linux/kmemcheck.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 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> |
Dave Hansen | a238ab5 | 2011-05-24 17:12:16 -0700 | [diff] [blame] | 33 | #include <linux/ratelimit.h> |
David Rientjes | 5a3135c2 | 2007-10-16 23:25:53 -0700 | [diff] [blame] | 34 | #include <linux/oom.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 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> |
Dave Hansen | bdc8cb9 | 2005-10-29 18:16:53 -0700 | [diff] [blame] | 40 | #include <linux/memory_hotplug.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 41 | #include <linux/nodemask.h> |
| 42 | #include <linux/vmalloc.h> |
KOSAKI Motohiro | a6cccdc | 2011-05-24 17:11:33 -0700 | [diff] [blame] | 43 | #include <linux/vmstat.h> |
Christoph Lameter | 4be38e3 | 2006-01-06 00:11:17 -0800 | [diff] [blame] | 44 | #include <linux/mempolicy.h> |
Yasunori Goto | 6811378 | 2006-06-23 02:03:11 -0700 | [diff] [blame] | 45 | #include <linux/stop_machine.h> |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 46 | #include <linux/sort.h> |
| 47 | #include <linux/pfn.h> |
Andrew Morton | 3fcfab1 | 2006-10-19 23:28:16 -0700 | [diff] [blame] | 48 | #include <linux/backing-dev.h> |
Akinobu Mita | 933e312 | 2006-12-08 02:39:45 -0800 | [diff] [blame] | 49 | #include <linux/fault-inject.h> |
KAMEZAWA Hiroyuki | a5d76b54 | 2007-10-16 01:26:11 -0700 | [diff] [blame] | 50 | #include <linux/page-isolation.h> |
KAMEZAWA Hiroyuki | 52d4b9a | 2008-10-18 20:28:16 -0700 | [diff] [blame] | 51 | #include <linux/page_cgroup.h> |
Thomas Gleixner | 3ac7fe5 | 2008-04-30 00:55:01 -0700 | [diff] [blame] | 52 | #include <linux/debugobjects.h> |
Catalin Marinas | dbb1f81 | 2009-06-11 13:23:19 +0100 | [diff] [blame] | 53 | #include <linux/kmemleak.h> |
Robert Jennings | 925cc71 | 2009-12-17 14:44:38 +0000 | [diff] [blame] | 54 | #include <linux/memory.h> |
Mel Gorman | 56de726 | 2010-05-24 14:32:30 -0700 | [diff] [blame] | 55 | #include <linux/compaction.h> |
Mel Gorman | 0d3d062 | 2009-09-21 17:02:44 -0700 | [diff] [blame] | 56 | #include <trace/events/kmem.h> |
Wu Fengguang | 718a382 | 2010-03-10 15:20:43 -0800 | [diff] [blame] | 57 | #include <linux/ftrace_event.h> |
Daisuke Nishimura | f212ad7 | 2011-03-23 16:42:25 -0700 | [diff] [blame] | 58 | #include <linux/memcontrol.h> |
Linus Torvalds | 268bb0c | 2011-05-20 12:50:29 -0700 | [diff] [blame] | 59 | #include <linux/prefetch.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 60 | |
| 61 | #include <asm/tlbflush.h> |
Andrew Morton | ac924c6 | 2006-05-15 09:43:59 -0700 | [diff] [blame] | 62 | #include <asm/div64.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 63 | #include "internal.h" |
| 64 | |
Lee Schermerhorn | 7281201 | 2010-05-26 14:44:56 -0700 | [diff] [blame] | 65 | #ifdef CONFIG_USE_PERCPU_NUMA_NODE_ID |
| 66 | DEFINE_PER_CPU(int, numa_node); |
| 67 | EXPORT_PER_CPU_SYMBOL(numa_node); |
| 68 | #endif |
| 69 | |
Lee Schermerhorn | 7aac789 | 2010-05-26 14:45:00 -0700 | [diff] [blame] | 70 | #ifdef CONFIG_HAVE_MEMORYLESS_NODES |
| 71 | /* |
| 72 | * N.B., Do NOT reference the '_numa_mem_' per cpu variable directly. |
| 73 | * It will not be defined when CONFIG_HAVE_MEMORYLESS_NODES is not defined. |
| 74 | * Use the accessor functions set_numa_mem(), numa_mem_id() and cpu_to_mem() |
| 75 | * defined in <linux/topology.h>. |
| 76 | */ |
| 77 | DEFINE_PER_CPU(int, _numa_mem_); /* Kernel "local memory" node */ |
| 78 | EXPORT_PER_CPU_SYMBOL(_numa_mem_); |
| 79 | #endif |
| 80 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 81 | /* |
Christoph Lameter | 1380891 | 2007-10-16 01:25:27 -0700 | [diff] [blame] | 82 | * Array of node states. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 83 | */ |
Christoph Lameter | 1380891 | 2007-10-16 01:25:27 -0700 | [diff] [blame] | 84 | nodemask_t node_states[NR_NODE_STATES] __read_mostly = { |
| 85 | [N_POSSIBLE] = NODE_MASK_ALL, |
| 86 | [N_ONLINE] = { { [0] = 1UL } }, |
| 87 | #ifndef CONFIG_NUMA |
| 88 | [N_NORMAL_MEMORY] = { { [0] = 1UL } }, |
| 89 | #ifdef CONFIG_HIGHMEM |
| 90 | [N_HIGH_MEMORY] = { { [0] = 1UL } }, |
| 91 | #endif |
| 92 | [N_CPU] = { { [0] = 1UL } }, |
| 93 | #endif /* NUMA */ |
| 94 | }; |
| 95 | EXPORT_SYMBOL(node_states); |
| 96 | |
Ravikiran G Thirumalai | 6c231b7 | 2005-09-06 15:17:45 -0700 | [diff] [blame] | 97 | unsigned long totalram_pages __read_mostly; |
Hideo AOKI | cb45b0e | 2006-04-10 22:52:59 -0700 | [diff] [blame] | 98 | unsigned long totalreserve_pages __read_mostly; |
Rohit Seth | 8ad4b1f | 2006-01-08 01:00:40 -0800 | [diff] [blame] | 99 | int percpu_pagelist_fraction; |
Benjamin Herrenschmidt | dcce284 | 2009-06-18 13:24:12 +1000 | [diff] [blame] | 100 | gfp_t gfp_allowed_mask __read_mostly = GFP_BOOT_MASK; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 101 | |
Rafael J. Wysocki | 452aa69 | 2010-03-05 13:42:13 -0800 | [diff] [blame] | 102 | #ifdef CONFIG_PM_SLEEP |
| 103 | /* |
| 104 | * The following functions are used by the suspend/hibernate code to temporarily |
| 105 | * change gfp_allowed_mask in order to avoid using I/O during memory allocations |
| 106 | * while devices are suspended. To avoid races with the suspend/hibernate code, |
| 107 | * they should always be called with pm_mutex held (gfp_allowed_mask also should |
| 108 | * only be modified with pm_mutex held, unless the suspend/hibernate code is |
| 109 | * guaranteed not to run in parallel with that modification). |
| 110 | */ |
Rafael J. Wysocki | c9e664f | 2010-12-03 22:57:45 +0100 | [diff] [blame] | 111 | |
| 112 | static gfp_t saved_gfp_mask; |
| 113 | |
| 114 | void pm_restore_gfp_mask(void) |
Rafael J. Wysocki | 452aa69 | 2010-03-05 13:42:13 -0800 | [diff] [blame] | 115 | { |
| 116 | WARN_ON(!mutex_is_locked(&pm_mutex)); |
Rafael J. Wysocki | c9e664f | 2010-12-03 22:57:45 +0100 | [diff] [blame] | 117 | if (saved_gfp_mask) { |
| 118 | gfp_allowed_mask = saved_gfp_mask; |
| 119 | saved_gfp_mask = 0; |
| 120 | } |
Rafael J. Wysocki | 452aa69 | 2010-03-05 13:42:13 -0800 | [diff] [blame] | 121 | } |
| 122 | |
Rafael J. Wysocki | c9e664f | 2010-12-03 22:57:45 +0100 | [diff] [blame] | 123 | void pm_restrict_gfp_mask(void) |
Rafael J. Wysocki | 452aa69 | 2010-03-05 13:42:13 -0800 | [diff] [blame] | 124 | { |
Rafael J. Wysocki | 452aa69 | 2010-03-05 13:42:13 -0800 | [diff] [blame] | 125 | WARN_ON(!mutex_is_locked(&pm_mutex)); |
Rafael J. Wysocki | c9e664f | 2010-12-03 22:57:45 +0100 | [diff] [blame] | 126 | WARN_ON(saved_gfp_mask); |
| 127 | saved_gfp_mask = gfp_allowed_mask; |
| 128 | gfp_allowed_mask &= ~GFP_IOFS; |
Rafael J. Wysocki | 452aa69 | 2010-03-05 13:42:13 -0800 | [diff] [blame] | 129 | } |
| 130 | #endif /* CONFIG_PM_SLEEP */ |
| 131 | |
Mel Gorman | d9c2340 | 2007-10-16 01:26:01 -0700 | [diff] [blame] | 132 | #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE |
| 133 | int pageblock_order __read_mostly; |
| 134 | #endif |
| 135 | |
Hugh Dickins | d98c7a0 | 2006-02-14 13:52:59 -0800 | [diff] [blame] | 136 | static void __free_pages_ok(struct page *page, unsigned int order); |
David Howells | a226f6c | 2006-01-06 00:11:08 -0800 | [diff] [blame] | 137 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 138 | /* |
| 139 | * results with 256, 32 in the lowmem_reserve sysctl: |
| 140 | * 1G machine -> (16M dma, 800M-16M normal, 1G-800M high) |
| 141 | * 1G machine -> (16M dma, 784M normal, 224M high) |
| 142 | * NORMAL allocation will leave 784M/256 of ram reserved in the ZONE_DMA |
| 143 | * HIGHMEM allocation will leave 224M/32 of ram reserved in ZONE_NORMAL |
| 144 | * HIGHMEM allocation will (224M+784M)/256 of ram reserved in ZONE_DMA |
Andi Kleen | a2f1b42 | 2005-11-05 17:25:53 +0100 | [diff] [blame] | 145 | * |
| 146 | * TBD: should special case ZONE_DMA32 machines here - in those we normally |
| 147 | * don't need any ZONE_NORMAL reservation |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 148 | */ |
Christoph Lameter | 2f1b624 | 2006-09-25 23:31:13 -0700 | [diff] [blame] | 149 | int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES-1] = { |
Christoph Lameter | 4b51d66 | 2007-02-10 01:43:10 -0800 | [diff] [blame] | 150 | #ifdef CONFIG_ZONE_DMA |
Christoph Lameter | 2f1b624 | 2006-09-25 23:31:13 -0700 | [diff] [blame] | 151 | 256, |
Christoph Lameter | 4b51d66 | 2007-02-10 01:43:10 -0800 | [diff] [blame] | 152 | #endif |
Christoph Lameter | fb0e794 | 2006-09-25 23:31:13 -0700 | [diff] [blame] | 153 | #ifdef CONFIG_ZONE_DMA32 |
Christoph Lameter | 2f1b624 | 2006-09-25 23:31:13 -0700 | [diff] [blame] | 154 | 256, |
Christoph Lameter | fb0e794 | 2006-09-25 23:31:13 -0700 | [diff] [blame] | 155 | #endif |
Christoph Lameter | e53ef38 | 2006-09-25 23:31:14 -0700 | [diff] [blame] | 156 | #ifdef CONFIG_HIGHMEM |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 157 | 32, |
Christoph Lameter | e53ef38 | 2006-09-25 23:31:14 -0700 | [diff] [blame] | 158 | #endif |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 159 | 32, |
Christoph Lameter | 2f1b624 | 2006-09-25 23:31:13 -0700 | [diff] [blame] | 160 | }; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 161 | |
| 162 | EXPORT_SYMBOL(totalram_pages); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 163 | |
Helge Deller | 15ad7cd | 2006-12-06 20:40:36 -0800 | [diff] [blame] | 164 | static char * const zone_names[MAX_NR_ZONES] = { |
Christoph Lameter | 4b51d66 | 2007-02-10 01:43:10 -0800 | [diff] [blame] | 165 | #ifdef CONFIG_ZONE_DMA |
Christoph Lameter | 2f1b624 | 2006-09-25 23:31:13 -0700 | [diff] [blame] | 166 | "DMA", |
Christoph Lameter | 4b51d66 | 2007-02-10 01:43:10 -0800 | [diff] [blame] | 167 | #endif |
Christoph Lameter | fb0e794 | 2006-09-25 23:31:13 -0700 | [diff] [blame] | 168 | #ifdef CONFIG_ZONE_DMA32 |
Christoph Lameter | 2f1b624 | 2006-09-25 23:31:13 -0700 | [diff] [blame] | 169 | "DMA32", |
Christoph Lameter | fb0e794 | 2006-09-25 23:31:13 -0700 | [diff] [blame] | 170 | #endif |
Christoph Lameter | 2f1b624 | 2006-09-25 23:31:13 -0700 | [diff] [blame] | 171 | "Normal", |
Christoph Lameter | e53ef38 | 2006-09-25 23:31:14 -0700 | [diff] [blame] | 172 | #ifdef CONFIG_HIGHMEM |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 173 | "HighMem", |
Christoph Lameter | e53ef38 | 2006-09-25 23:31:14 -0700 | [diff] [blame] | 174 | #endif |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 175 | "Movable", |
Christoph Lameter | 2f1b624 | 2006-09-25 23:31:13 -0700 | [diff] [blame] | 176 | }; |
| 177 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 178 | int min_free_kbytes = 1024; |
| 179 | |
Jan Beulich | 2c85f51 | 2009-09-21 17:03:07 -0700 | [diff] [blame] | 180 | static unsigned long __meminitdata nr_kernel_pages; |
| 181 | static unsigned long __meminitdata nr_all_pages; |
Yasunori Goto | a3142c8 | 2007-05-08 00:23:07 -0700 | [diff] [blame] | 182 | static unsigned long __meminitdata dma_reserve; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 183 | |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 184 | #ifdef CONFIG_ARCH_POPULATES_NODE_MAP |
| 185 | /* |
Simon Arlott | 183ff22 | 2007-10-20 01:27:18 +0200 | [diff] [blame] | 186 | * MAX_ACTIVE_REGIONS determines the maximum number of distinct |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 187 | * ranges of memory (RAM) that may be registered with add_active_range(). |
| 188 | * Ranges passed to add_active_range() will be merged if possible |
| 189 | * so the number of times add_active_range() can be called is |
| 190 | * related to the number of nodes and the number of holes |
| 191 | */ |
| 192 | #ifdef CONFIG_MAX_ACTIVE_REGIONS |
| 193 | /* Allow an architecture to set MAX_ACTIVE_REGIONS to save memory */ |
| 194 | #define MAX_ACTIVE_REGIONS CONFIG_MAX_ACTIVE_REGIONS |
| 195 | #else |
| 196 | #if MAX_NUMNODES >= 32 |
| 197 | /* If there can be many nodes, allow up to 50 holes per node */ |
| 198 | #define MAX_ACTIVE_REGIONS (MAX_NUMNODES*50) |
| 199 | #else |
| 200 | /* By default, allow up to 256 distinct regions */ |
| 201 | #define MAX_ACTIVE_REGIONS 256 |
| 202 | #endif |
| 203 | #endif |
| 204 | |
Jan Beulich | 98011f5 | 2007-07-15 23:38:17 -0700 | [diff] [blame] | 205 | static struct node_active_region __meminitdata early_node_map[MAX_ACTIVE_REGIONS]; |
| 206 | static int __meminitdata nr_nodemap_entries; |
| 207 | static unsigned long __meminitdata arch_zone_lowest_possible_pfn[MAX_NR_ZONES]; |
| 208 | static unsigned long __meminitdata arch_zone_highest_possible_pfn[MAX_NR_ZONES]; |
Adrian Bunk | b69a728 | 2008-07-23 21:28:12 -0700 | [diff] [blame] | 209 | static unsigned long __initdata required_kernelcore; |
Adrian Bunk | 484f51f | 2007-10-16 01:26:03 -0700 | [diff] [blame] | 210 | static unsigned long __initdata required_movablecore; |
Adrian Bunk | b69a728 | 2008-07-23 21:28:12 -0700 | [diff] [blame] | 211 | static unsigned long __meminitdata zone_movable_pfn[MAX_NUMNODES]; |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 212 | |
| 213 | /* movable_zone is the "real" zone pages in ZONE_MOVABLE are taken from */ |
| 214 | int movable_zone; |
| 215 | EXPORT_SYMBOL(movable_zone); |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 216 | #endif /* CONFIG_ARCH_POPULATES_NODE_MAP */ |
| 217 | |
Miklos Szeredi | 418508c | 2007-05-23 13:57:55 -0700 | [diff] [blame] | 218 | #if MAX_NUMNODES > 1 |
| 219 | int nr_node_ids __read_mostly = MAX_NUMNODES; |
Christoph Lameter | 62bc62a | 2009-06-16 15:32:15 -0700 | [diff] [blame] | 220 | int nr_online_nodes __read_mostly = 1; |
Miklos Szeredi | 418508c | 2007-05-23 13:57:55 -0700 | [diff] [blame] | 221 | EXPORT_SYMBOL(nr_node_ids); |
Christoph Lameter | 62bc62a | 2009-06-16 15:32:15 -0700 | [diff] [blame] | 222 | EXPORT_SYMBOL(nr_online_nodes); |
Miklos Szeredi | 418508c | 2007-05-23 13:57:55 -0700 | [diff] [blame] | 223 | #endif |
| 224 | |
Mel Gorman | 9ef9acb | 2007-10-16 01:25:54 -0700 | [diff] [blame] | 225 | int page_group_by_mobility_disabled __read_mostly; |
| 226 | |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 227 | static void set_pageblock_migratetype(struct page *page, int migratetype) |
| 228 | { |
Mel Gorman | 49255c6 | 2009-06-16 15:31:58 -0700 | [diff] [blame] | 229 | |
| 230 | if (unlikely(page_group_by_mobility_disabled)) |
| 231 | migratetype = MIGRATE_UNMOVABLE; |
| 232 | |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 233 | set_pageblock_flags_group(page, (unsigned long)migratetype, |
| 234 | PB_migrate, PB_migrate_end); |
| 235 | } |
| 236 | |
Rafael J. Wysocki | 7f33d49 | 2009-06-16 15:32:41 -0700 | [diff] [blame] | 237 | bool oom_killer_disabled __read_mostly; |
| 238 | |
Nick Piggin | 13e7444 | 2006-01-06 00:10:58 -0800 | [diff] [blame] | 239 | #ifdef CONFIG_DEBUG_VM |
Dave Hansen | c6a57e1 | 2005-10-29 18:16:52 -0700 | [diff] [blame] | 240 | static int page_outside_zone_boundaries(struct zone *zone, struct page *page) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 241 | { |
Dave Hansen | bdc8cb9 | 2005-10-29 18:16:53 -0700 | [diff] [blame] | 242 | int ret = 0; |
| 243 | unsigned seq; |
| 244 | unsigned long pfn = page_to_pfn(page); |
Dave Hansen | c6a57e1 | 2005-10-29 18:16:52 -0700 | [diff] [blame] | 245 | |
Dave Hansen | bdc8cb9 | 2005-10-29 18:16:53 -0700 | [diff] [blame] | 246 | do { |
| 247 | seq = zone_span_seqbegin(zone); |
| 248 | if (pfn >= zone->zone_start_pfn + zone->spanned_pages) |
| 249 | ret = 1; |
| 250 | else if (pfn < zone->zone_start_pfn) |
| 251 | ret = 1; |
| 252 | } while (zone_span_seqretry(zone, seq)); |
| 253 | |
| 254 | return ret; |
Dave Hansen | c6a57e1 | 2005-10-29 18:16:52 -0700 | [diff] [blame] | 255 | } |
| 256 | |
| 257 | static int page_is_consistent(struct zone *zone, struct page *page) |
| 258 | { |
Andy Whitcroft | 14e0729 | 2007-05-06 14:49:14 -0700 | [diff] [blame] | 259 | if (!pfn_valid_within(page_to_pfn(page))) |
Dave Hansen | c6a57e1 | 2005-10-29 18:16:52 -0700 | [diff] [blame] | 260 | return 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 261 | if (zone != page_zone(page)) |
Dave Hansen | c6a57e1 | 2005-10-29 18:16:52 -0700 | [diff] [blame] | 262 | return 0; |
| 263 | |
| 264 | return 1; |
| 265 | } |
| 266 | /* |
| 267 | * Temporary debugging check for pages not lying within a given zone. |
| 268 | */ |
| 269 | static int bad_range(struct zone *zone, struct page *page) |
| 270 | { |
| 271 | if (page_outside_zone_boundaries(zone, page)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 272 | return 1; |
Dave Hansen | c6a57e1 | 2005-10-29 18:16:52 -0700 | [diff] [blame] | 273 | if (!page_is_consistent(zone, page)) |
| 274 | return 1; |
| 275 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 276 | return 0; |
| 277 | } |
Nick Piggin | 13e7444 | 2006-01-06 00:10:58 -0800 | [diff] [blame] | 278 | #else |
| 279 | static inline int bad_range(struct zone *zone, struct page *page) |
| 280 | { |
| 281 | return 0; |
| 282 | } |
| 283 | #endif |
| 284 | |
Nick Piggin | 224abf9 | 2006-01-06 00:11:11 -0800 | [diff] [blame] | 285 | static void bad_page(struct page *page) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 286 | { |
Hugh Dickins | d936cf9 | 2009-01-06 14:40:12 -0800 | [diff] [blame] | 287 | static unsigned long resume; |
| 288 | static unsigned long nr_shown; |
| 289 | static unsigned long nr_unshown; |
| 290 | |
Wu Fengguang | 2a7684a | 2009-09-16 11:50:12 +0200 | [diff] [blame] | 291 | /* Don't complain about poisoned pages */ |
| 292 | if (PageHWPoison(page)) { |
Andrea Arcangeli | ef2b4b9 | 2011-03-18 00:16:35 +0100 | [diff] [blame] | 293 | reset_page_mapcount(page); /* remove PageBuddy */ |
Wu Fengguang | 2a7684a | 2009-09-16 11:50:12 +0200 | [diff] [blame] | 294 | return; |
| 295 | } |
| 296 | |
Hugh Dickins | d936cf9 | 2009-01-06 14:40:12 -0800 | [diff] [blame] | 297 | /* |
| 298 | * Allow a burst of 60 reports, then keep quiet for that minute; |
| 299 | * or allow a steady drip of one report per second. |
| 300 | */ |
| 301 | if (nr_shown == 60) { |
| 302 | if (time_before(jiffies, resume)) { |
| 303 | nr_unshown++; |
| 304 | goto out; |
| 305 | } |
| 306 | if (nr_unshown) { |
Hugh Dickins | 1e9e636 | 2009-01-06 14:40:13 -0800 | [diff] [blame] | 307 | printk(KERN_ALERT |
| 308 | "BUG: Bad page state: %lu messages suppressed\n", |
Hugh Dickins | d936cf9 | 2009-01-06 14:40:12 -0800 | [diff] [blame] | 309 | nr_unshown); |
| 310 | nr_unshown = 0; |
| 311 | } |
| 312 | nr_shown = 0; |
| 313 | } |
| 314 | if (nr_shown++ == 0) |
| 315 | resume = jiffies + 60 * HZ; |
| 316 | |
Hugh Dickins | 1e9e636 | 2009-01-06 14:40:13 -0800 | [diff] [blame] | 317 | printk(KERN_ALERT "BUG: Bad page state in process %s pfn:%05lx\n", |
Hugh Dickins | 3dc1474 | 2009-01-06 14:40:08 -0800 | [diff] [blame] | 318 | current->comm, page_to_pfn(page)); |
Wu Fengguang | 718a382 | 2010-03-10 15:20:43 -0800 | [diff] [blame] | 319 | dump_page(page); |
KAMEZAWA Hiroyuki | 52d4b9a | 2008-10-18 20:28:16 -0700 | [diff] [blame] | 320 | |
Dave Jones | 4f31888 | 2011-10-31 17:07:24 -0700 | [diff] [blame] | 321 | print_modules(); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 322 | dump_stack(); |
Hugh Dickins | d936cf9 | 2009-01-06 14:40:12 -0800 | [diff] [blame] | 323 | out: |
Hugh Dickins | 8cc3b39 | 2009-01-06 14:40:06 -0800 | [diff] [blame] | 324 | /* Leave bad fields for debug, except PageBuddy could make trouble */ |
Andrea Arcangeli | ef2b4b9 | 2011-03-18 00:16:35 +0100 | [diff] [blame] | 325 | reset_page_mapcount(page); /* remove PageBuddy */ |
Randy Dunlap | 9f15833 | 2005-09-13 01:25:16 -0700 | [diff] [blame] | 326 | add_taint(TAINT_BAD_PAGE); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 327 | } |
| 328 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 329 | /* |
| 330 | * Higher-order pages are called "compound pages". They are structured thusly: |
| 331 | * |
| 332 | * The first PAGE_SIZE page is called the "head page". |
| 333 | * |
| 334 | * The remaining PAGE_SIZE pages are called "tail pages". |
| 335 | * |
| 336 | * All pages have PG_compound set. All pages have their ->private pointing at |
| 337 | * the head page (even the head page has this). |
| 338 | * |
Hugh Dickins | 41d78ba | 2006-02-14 13:52:58 -0800 | [diff] [blame] | 339 | * The first tail page's ->lru.next holds the address of the compound page's |
| 340 | * put_page() function. Its ->lru.prev holds the order of allocation. |
| 341 | * This usage means that zero-order pages may not be compound. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 342 | */ |
Hugh Dickins | d98c7a0 | 2006-02-14 13:52:59 -0800 | [diff] [blame] | 343 | |
| 344 | static void free_compound_page(struct page *page) |
| 345 | { |
Christoph Lameter | d85f338 | 2007-05-06 14:49:39 -0700 | [diff] [blame] | 346 | __free_pages_ok(page, compound_order(page)); |
Hugh Dickins | d98c7a0 | 2006-02-14 13:52:59 -0800 | [diff] [blame] | 347 | } |
| 348 | |
Andi Kleen | 01ad1c0 | 2008-07-23 21:27:46 -0700 | [diff] [blame] | 349 | void prep_compound_page(struct page *page, unsigned long order) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 350 | { |
| 351 | int i; |
| 352 | int nr_pages = 1 << order; |
| 353 | |
Andy Whitcroft | 33f2ef8 | 2006-12-06 20:33:32 -0800 | [diff] [blame] | 354 | set_compound_page_dtor(page, free_compound_page); |
Christoph Lameter | d85f338 | 2007-05-06 14:49:39 -0700 | [diff] [blame] | 355 | set_compound_order(page, order); |
Christoph Lameter | 6d77795 | 2007-05-06 14:49:40 -0700 | [diff] [blame] | 356 | __SetPageHead(page); |
Andy Whitcroft | 18229df | 2008-11-06 12:53:27 -0800 | [diff] [blame] | 357 | for (i = 1; i < nr_pages; i++) { |
| 358 | struct page *p = page + i; |
Christoph Lameter | d85f338 | 2007-05-06 14:49:39 -0700 | [diff] [blame] | 359 | __SetPageTail(p); |
Youquan Song | 58a84aa | 2011-12-08 14:34:18 -0800 | [diff] [blame] | 360 | set_page_count(p, 0); |
Christoph Lameter | d85f338 | 2007-05-06 14:49:39 -0700 | [diff] [blame] | 361 | p->first_page = page; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 362 | } |
| 363 | } |
| 364 | |
Andrea Arcangeli | 59ff421 | 2011-01-13 15:46:38 -0800 | [diff] [blame] | 365 | /* update __split_huge_page_refcount if you change this function */ |
Hugh Dickins | 8cc3b39 | 2009-01-06 14:40:06 -0800 | [diff] [blame] | 366 | static int destroy_compound_page(struct page *page, unsigned long order) |
Andy Whitcroft | 18229df | 2008-11-06 12:53:27 -0800 | [diff] [blame] | 367 | { |
| 368 | int i; |
| 369 | int nr_pages = 1 << order; |
Hugh Dickins | 8cc3b39 | 2009-01-06 14:40:06 -0800 | [diff] [blame] | 370 | int bad = 0; |
Andy Whitcroft | 18229df | 2008-11-06 12:53:27 -0800 | [diff] [blame] | 371 | |
Hugh Dickins | 8cc3b39 | 2009-01-06 14:40:06 -0800 | [diff] [blame] | 372 | if (unlikely(compound_order(page) != order) || |
| 373 | unlikely(!PageHead(page))) { |
Nick Piggin | 224abf9 | 2006-01-06 00:11:11 -0800 | [diff] [blame] | 374 | bad_page(page); |
Hugh Dickins | 8cc3b39 | 2009-01-06 14:40:06 -0800 | [diff] [blame] | 375 | bad++; |
| 376 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 377 | |
Christoph Lameter | 6d77795 | 2007-05-06 14:49:40 -0700 | [diff] [blame] | 378 | __ClearPageHead(page); |
Hugh Dickins | 8cc3b39 | 2009-01-06 14:40:06 -0800 | [diff] [blame] | 379 | |
Andy Whitcroft | 18229df | 2008-11-06 12:53:27 -0800 | [diff] [blame] | 380 | for (i = 1; i < nr_pages; i++) { |
| 381 | struct page *p = page + i; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 382 | |
Alexey Zaytsev | e713a21 | 2009-01-10 02:47:57 +0300 | [diff] [blame] | 383 | if (unlikely(!PageTail(p) || (p->first_page != page))) { |
Nick Piggin | 224abf9 | 2006-01-06 00:11:11 -0800 | [diff] [blame] | 384 | bad_page(page); |
Hugh Dickins | 8cc3b39 | 2009-01-06 14:40:06 -0800 | [diff] [blame] | 385 | bad++; |
| 386 | } |
Christoph Lameter | d85f338 | 2007-05-06 14:49:39 -0700 | [diff] [blame] | 387 | __ClearPageTail(p); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 388 | } |
Hugh Dickins | 8cc3b39 | 2009-01-06 14:40:06 -0800 | [diff] [blame] | 389 | |
| 390 | return bad; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 391 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 392 | |
Nick Piggin | 17cf440 | 2006-03-22 00:08:41 -0800 | [diff] [blame] | 393 | static inline void prep_zero_page(struct page *page, int order, gfp_t gfp_flags) |
| 394 | { |
| 395 | int i; |
| 396 | |
Andrew Morton | 6626c5d | 2006-03-22 00:08:42 -0800 | [diff] [blame] | 397 | /* |
| 398 | * clear_highpage() will use KM_USER0, so it's a bug to use __GFP_ZERO |
| 399 | * and __GFP_HIGHMEM from hard or soft interrupt context. |
| 400 | */ |
Nick Piggin | 725d704 | 2006-09-25 23:30:55 -0700 | [diff] [blame] | 401 | VM_BUG_ON((gfp_flags & __GFP_HIGHMEM) && in_interrupt()); |
Nick Piggin | 17cf440 | 2006-03-22 00:08:41 -0800 | [diff] [blame] | 402 | for (i = 0; i < (1 << order); i++) |
| 403 | clear_highpage(page + i); |
| 404 | } |
| 405 | |
Andrew Morton | 6aa3001b2 | 2006-04-18 22:20:52 -0700 | [diff] [blame] | 406 | static inline void set_page_order(struct page *page, int order) |
| 407 | { |
Hugh Dickins | 4c21e2f | 2005-10-29 18:16:40 -0700 | [diff] [blame] | 408 | set_page_private(page, order); |
Nick Piggin | 676165a | 2006-04-10 11:21:48 +1000 | [diff] [blame] | 409 | __SetPageBuddy(page); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 410 | } |
| 411 | |
| 412 | static inline void rmv_page_order(struct page *page) |
| 413 | { |
Nick Piggin | 676165a | 2006-04-10 11:21:48 +1000 | [diff] [blame] | 414 | __ClearPageBuddy(page); |
Hugh Dickins | 4c21e2f | 2005-10-29 18:16:40 -0700 | [diff] [blame] | 415 | set_page_private(page, 0); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 416 | } |
| 417 | |
| 418 | /* |
| 419 | * Locate the struct page for both the matching buddy in our |
| 420 | * pair (buddy1) and the combined O(n+1) page they form (page). |
| 421 | * |
| 422 | * 1) Any buddy B1 will have an order O twin B2 which satisfies |
| 423 | * the following equation: |
| 424 | * B2 = B1 ^ (1 << O) |
| 425 | * For example, if the starting buddy (buddy2) is #8 its order |
| 426 | * 1 buddy is #10: |
| 427 | * B2 = 8 ^ (1 << 1) = 8 ^ 2 = 10 |
| 428 | * |
| 429 | * 2) Any buddy B will have an order O+1 parent P which |
| 430 | * satisfies the following equation: |
| 431 | * P = B & ~(1 << O) |
| 432 | * |
Andreas Mohr | d6e05ed | 2006-06-26 18:35:02 +0200 | [diff] [blame] | 433 | * Assumption: *_mem_map is contiguous at least up to MAX_ORDER |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 434 | */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 435 | static inline unsigned long |
KyongHo Cho | 43506fa | 2011-01-13 15:47:24 -0800 | [diff] [blame] | 436 | __find_buddy_index(unsigned long page_idx, unsigned int order) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 437 | { |
KyongHo Cho | 43506fa | 2011-01-13 15:47:24 -0800 | [diff] [blame] | 438 | return page_idx ^ (1 << order); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 439 | } |
| 440 | |
| 441 | /* |
| 442 | * This function checks whether a page is free && is the buddy |
| 443 | * we can do coalesce a page and its buddy if |
Nick Piggin | 13e7444 | 2006-01-06 00:10:58 -0800 | [diff] [blame] | 444 | * (a) the buddy is not in a hole && |
Nick Piggin | 676165a | 2006-04-10 11:21:48 +1000 | [diff] [blame] | 445 | * (b) the buddy is in the buddy system && |
Andy Whitcroft | cb2b95e | 2006-06-23 02:03:01 -0700 | [diff] [blame] | 446 | * (c) a page and its buddy have the same order && |
| 447 | * (d) a page and its buddy are in the same zone. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 448 | * |
Andrea Arcangeli | 5f24ce5 | 2011-01-13 15:47:00 -0800 | [diff] [blame] | 449 | * For recording whether a page is in the buddy system, we set ->_mapcount -2. |
| 450 | * Setting, clearing, and testing _mapcount -2 is serialized by zone->lock. |
Nick Piggin | 676165a | 2006-04-10 11:21:48 +1000 | [diff] [blame] | 451 | * |
| 452 | * For recording page's order, we use page_private(page). |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 453 | */ |
Andy Whitcroft | cb2b95e | 2006-06-23 02:03:01 -0700 | [diff] [blame] | 454 | static inline int page_is_buddy(struct page *page, struct page *buddy, |
| 455 | int order) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 456 | { |
Andy Whitcroft | 14e0729 | 2007-05-06 14:49:14 -0700 | [diff] [blame] | 457 | if (!pfn_valid_within(page_to_pfn(buddy))) |
Nick Piggin | 13e7444 | 2006-01-06 00:10:58 -0800 | [diff] [blame] | 458 | return 0; |
Nick Piggin | 13e7444 | 2006-01-06 00:10:58 -0800 | [diff] [blame] | 459 | |
Andy Whitcroft | cb2b95e | 2006-06-23 02:03:01 -0700 | [diff] [blame] | 460 | if (page_zone_id(page) != page_zone_id(buddy)) |
| 461 | return 0; |
| 462 | |
| 463 | if (PageBuddy(buddy) && page_order(buddy) == order) { |
Nick Piggin | a3af9c3 | 2009-06-16 15:32:10 -0700 | [diff] [blame] | 464 | VM_BUG_ON(page_count(buddy) != 0); |
Andrew Morton | 6aa3001b2 | 2006-04-18 22:20:52 -0700 | [diff] [blame] | 465 | return 1; |
Nick Piggin | 676165a | 2006-04-10 11:21:48 +1000 | [diff] [blame] | 466 | } |
Andrew Morton | 6aa3001b2 | 2006-04-18 22:20:52 -0700 | [diff] [blame] | 467 | return 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 468 | } |
| 469 | |
| 470 | /* |
| 471 | * Freeing function for a buddy system allocator. |
| 472 | * |
| 473 | * The concept of a buddy system is to maintain direct-mapped table |
| 474 | * (containing bit values) for memory blocks of various "orders". |
| 475 | * The bottom level table contains the map for the smallest allocatable |
| 476 | * units of memory (here, pages), and each level above it describes |
| 477 | * pairs of units from the levels below, hence, "buddies". |
| 478 | * At a high level, all that happens here is marking the table entry |
| 479 | * at the bottom level available, and propagating the changes upward |
| 480 | * as necessary, plus some accounting needed to play nicely with other |
| 481 | * parts of the VM system. |
| 482 | * At each level, we keep a list of pages, which are heads of continuous |
Andrea Arcangeli | 5f24ce5 | 2011-01-13 15:47:00 -0800 | [diff] [blame] | 483 | * free pages of length of (1 << order) and marked with _mapcount -2. Page's |
Hugh Dickins | 4c21e2f | 2005-10-29 18:16:40 -0700 | [diff] [blame] | 484 | * order is recorded in page_private(page) field. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 485 | * So when we are allocating or freeing one, we can derive the state of the |
| 486 | * other. That is, if we allocate a small block, and both were |
| 487 | * free, the remainder of the region must be split into blocks. |
| 488 | * If a block is freed, and its buddy is also free, then this |
| 489 | * triggers coalescing into a block of larger size. |
| 490 | * |
| 491 | * -- wli |
| 492 | */ |
| 493 | |
Nick Piggin | 48db57f | 2006-01-08 01:00:42 -0800 | [diff] [blame] | 494 | static inline void __free_one_page(struct page *page, |
Mel Gorman | ed0ae21 | 2009-06-16 15:32:07 -0700 | [diff] [blame] | 495 | struct zone *zone, unsigned int order, |
| 496 | int migratetype) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 497 | { |
| 498 | unsigned long page_idx; |
Corrado Zoccolo | 6dda9d5 | 2010-05-24 14:31:54 -0700 | [diff] [blame] | 499 | unsigned long combined_idx; |
KyongHo Cho | 43506fa | 2011-01-13 15:47:24 -0800 | [diff] [blame] | 500 | unsigned long uninitialized_var(buddy_idx); |
Corrado Zoccolo | 6dda9d5 | 2010-05-24 14:31:54 -0700 | [diff] [blame] | 501 | struct page *buddy; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 502 | |
Nick Piggin | 224abf9 | 2006-01-06 00:11:11 -0800 | [diff] [blame] | 503 | if (unlikely(PageCompound(page))) |
Hugh Dickins | 8cc3b39 | 2009-01-06 14:40:06 -0800 | [diff] [blame] | 504 | if (unlikely(destroy_compound_page(page, order))) |
| 505 | return; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 506 | |
Mel Gorman | ed0ae21 | 2009-06-16 15:32:07 -0700 | [diff] [blame] | 507 | VM_BUG_ON(migratetype == -1); |
| 508 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 509 | page_idx = page_to_pfn(page) & ((1 << MAX_ORDER) - 1); |
| 510 | |
Mel Gorman | f2260e6 | 2009-06-16 15:32:13 -0700 | [diff] [blame] | 511 | VM_BUG_ON(page_idx & ((1 << order) - 1)); |
Nick Piggin | 725d704 | 2006-09-25 23:30:55 -0700 | [diff] [blame] | 512 | VM_BUG_ON(bad_range(zone, page)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 513 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 514 | while (order < MAX_ORDER-1) { |
KyongHo Cho | 43506fa | 2011-01-13 15:47:24 -0800 | [diff] [blame] | 515 | buddy_idx = __find_buddy_index(page_idx, order); |
| 516 | buddy = page + (buddy_idx - page_idx); |
Andy Whitcroft | cb2b95e | 2006-06-23 02:03:01 -0700 | [diff] [blame] | 517 | if (!page_is_buddy(page, buddy, order)) |
Andy Whitcroft | 3c82d0c | 2008-07-23 21:27:11 -0700 | [diff] [blame] | 518 | break; |
Nick Piggin | 13e7444 | 2006-01-06 00:10:58 -0800 | [diff] [blame] | 519 | |
Andy Whitcroft | 3c82d0c | 2008-07-23 21:27:11 -0700 | [diff] [blame] | 520 | /* Our buddy is free, merge with it and move up one order. */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 521 | list_del(&buddy->lru); |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 522 | zone->free_area[order].nr_free--; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 523 | rmv_page_order(buddy); |
KyongHo Cho | 43506fa | 2011-01-13 15:47:24 -0800 | [diff] [blame] | 524 | combined_idx = buddy_idx & page_idx; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 525 | page = page + (combined_idx - page_idx); |
| 526 | page_idx = combined_idx; |
| 527 | order++; |
| 528 | } |
| 529 | set_page_order(page, order); |
Corrado Zoccolo | 6dda9d5 | 2010-05-24 14:31:54 -0700 | [diff] [blame] | 530 | |
| 531 | /* |
| 532 | * If this is not the largest possible page, check if the buddy |
| 533 | * of the next-highest order is free. If it is, it's possible |
| 534 | * that pages are being freed that will coalesce soon. In case, |
| 535 | * that is happening, add the free page to the tail of the list |
| 536 | * so it's less likely to be used soon and more likely to be merged |
| 537 | * as a higher order page |
| 538 | */ |
Mel Gorman | b7f50cf | 2010-10-26 14:21:11 -0700 | [diff] [blame] | 539 | if ((order < MAX_ORDER-2) && pfn_valid_within(page_to_pfn(buddy))) { |
Corrado Zoccolo | 6dda9d5 | 2010-05-24 14:31:54 -0700 | [diff] [blame] | 540 | struct page *higher_page, *higher_buddy; |
KyongHo Cho | 43506fa | 2011-01-13 15:47:24 -0800 | [diff] [blame] | 541 | combined_idx = buddy_idx & page_idx; |
| 542 | higher_page = page + (combined_idx - page_idx); |
| 543 | buddy_idx = __find_buddy_index(combined_idx, order + 1); |
| 544 | higher_buddy = page + (buddy_idx - combined_idx); |
Corrado Zoccolo | 6dda9d5 | 2010-05-24 14:31:54 -0700 | [diff] [blame] | 545 | if (page_is_buddy(higher_page, higher_buddy, order + 1)) { |
| 546 | list_add_tail(&page->lru, |
| 547 | &zone->free_area[order].free_list[migratetype]); |
| 548 | goto out; |
| 549 | } |
| 550 | } |
| 551 | |
| 552 | list_add(&page->lru, &zone->free_area[order].free_list[migratetype]); |
| 553 | out: |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 554 | zone->free_area[order].nr_free++; |
| 555 | } |
| 556 | |
KOSAKI Motohiro | 092cead | 2009-06-16 15:32:17 -0700 | [diff] [blame] | 557 | /* |
| 558 | * free_page_mlock() -- clean up attempts to free and mlocked() page. |
| 559 | * Page should not be on lru, so no need to fix that up. |
| 560 | * free_pages_check() will verify... |
| 561 | */ |
| 562 | static inline void free_page_mlock(struct page *page) |
| 563 | { |
KOSAKI Motohiro | 092cead | 2009-06-16 15:32:17 -0700 | [diff] [blame] | 564 | __dec_zone_page_state(page, NR_MLOCK); |
| 565 | __count_vm_event(UNEVICTABLE_MLOCKFREED); |
| 566 | } |
KOSAKI Motohiro | 092cead | 2009-06-16 15:32:17 -0700 | [diff] [blame] | 567 | |
Nick Piggin | 224abf9 | 2006-01-06 00:11:11 -0800 | [diff] [blame] | 568 | static inline int free_pages_check(struct page *page) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 569 | { |
Nick Piggin | 92be2e33 | 2006-01-06 00:10:57 -0800 | [diff] [blame] | 570 | if (unlikely(page_mapcount(page) | |
| 571 | (page->mapping != NULL) | |
Nick Piggin | a3af9c3 | 2009-06-16 15:32:10 -0700 | [diff] [blame] | 572 | (atomic_read(&page->_count) != 0) | |
Daisuke Nishimura | f212ad7 | 2011-03-23 16:42:25 -0700 | [diff] [blame] | 573 | (page->flags & PAGE_FLAGS_CHECK_AT_FREE) | |
| 574 | (mem_cgroup_bad_page_check(page)))) { |
Nick Piggin | 224abf9 | 2006-01-06 00:11:11 -0800 | [diff] [blame] | 575 | bad_page(page); |
Hugh Dickins | 79f4b7b | 2009-01-06 14:40:05 -0800 | [diff] [blame] | 576 | return 1; |
Hugh Dickins | 8cc3b39 | 2009-01-06 14:40:06 -0800 | [diff] [blame] | 577 | } |
Hugh Dickins | 79f4b7b | 2009-01-06 14:40:05 -0800 | [diff] [blame] | 578 | if (page->flags & PAGE_FLAGS_CHECK_AT_PREP) |
| 579 | page->flags &= ~PAGE_FLAGS_CHECK_AT_PREP; |
| 580 | return 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 581 | } |
| 582 | |
| 583 | /* |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 584 | * Frees a number of pages from the PCP lists |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 585 | * Assumes all pages on list are in same zone, and of same order. |
Renaud Lienhart | 207f36e | 2005-09-10 00:26:59 -0700 | [diff] [blame] | 586 | * count is the number of pages to free. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 587 | * |
| 588 | * If the zone was previously in an "all pages pinned" state then look to |
| 589 | * see if this freeing clears that state. |
| 590 | * |
| 591 | * And clear the zone's pages_scanned counter, to hold off the "all pages are |
| 592 | * pinned" detection logic. |
| 593 | */ |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 594 | static void free_pcppages_bulk(struct zone *zone, int count, |
| 595 | struct per_cpu_pages *pcp) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 596 | { |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 597 | int migratetype = 0; |
Mel Gorman | a6f9edd6 | 2009-09-21 17:03:20 -0700 | [diff] [blame] | 598 | int batch_free = 0; |
Mel Gorman | 72853e2 | 2010-09-09 16:38:16 -0700 | [diff] [blame] | 599 | int to_free = count; |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 600 | |
Nick Piggin | c54ad30 | 2006-01-06 00:10:56 -0800 | [diff] [blame] | 601 | spin_lock(&zone->lock); |
KOSAKI Motohiro | 93e4a89 | 2010-03-05 13:41:55 -0800 | [diff] [blame] | 602 | zone->all_unreclaimable = 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 603 | zone->pages_scanned = 0; |
Mel Gorman | f2260e6 | 2009-06-16 15:32:13 -0700 | [diff] [blame] | 604 | |
Mel Gorman | 72853e2 | 2010-09-09 16:38:16 -0700 | [diff] [blame] | 605 | while (to_free) { |
Nick Piggin | 48db57f | 2006-01-08 01:00:42 -0800 | [diff] [blame] | 606 | struct page *page; |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 607 | struct list_head *list; |
Nick Piggin | 48db57f | 2006-01-08 01:00:42 -0800 | [diff] [blame] | 608 | |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 609 | /* |
Mel Gorman | a6f9edd6 | 2009-09-21 17:03:20 -0700 | [diff] [blame] | 610 | * Remove pages from lists in a round-robin fashion. A |
| 611 | * batch_free count is maintained that is incremented when an |
| 612 | * empty list is encountered. This is so more pages are freed |
| 613 | * off fuller lists instead of spinning excessively around empty |
| 614 | * lists |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 615 | */ |
| 616 | do { |
Mel Gorman | a6f9edd6 | 2009-09-21 17:03:20 -0700 | [diff] [blame] | 617 | batch_free++; |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 618 | if (++migratetype == MIGRATE_PCPTYPES) |
| 619 | migratetype = 0; |
| 620 | list = &pcp->lists[migratetype]; |
| 621 | } while (list_empty(list)); |
| 622 | |
Namhyung Kim | 1d16871 | 2011-03-22 16:32:45 -0700 | [diff] [blame] | 623 | /* This is the only non-empty list. Free them all. */ |
| 624 | if (batch_free == MIGRATE_PCPTYPES) |
| 625 | batch_free = to_free; |
| 626 | |
Mel Gorman | a6f9edd6 | 2009-09-21 17:03:20 -0700 | [diff] [blame] | 627 | do { |
| 628 | page = list_entry(list->prev, struct page, lru); |
| 629 | /* must delete as __free_one_page list manipulates */ |
| 630 | list_del(&page->lru); |
Hugh Dickins | a701623 | 2010-01-29 17:46:34 +0000 | [diff] [blame] | 631 | /* MIGRATE_MOVABLE list may include MIGRATE_RESERVEs */ |
| 632 | __free_one_page(page, zone, 0, page_private(page)); |
| 633 | trace_mm_page_pcpu_drain(page, 0, page_private(page)); |
Mel Gorman | 72853e2 | 2010-09-09 16:38:16 -0700 | [diff] [blame] | 634 | } while (--to_free && --batch_free && !list_empty(list)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 635 | } |
Mel Gorman | 72853e2 | 2010-09-09 16:38:16 -0700 | [diff] [blame] | 636 | __mod_zone_page_state(zone, NR_FREE_PAGES, count); |
Nick Piggin | c54ad30 | 2006-01-06 00:10:56 -0800 | [diff] [blame] | 637 | spin_unlock(&zone->lock); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 638 | } |
| 639 | |
Mel Gorman | ed0ae21 | 2009-06-16 15:32:07 -0700 | [diff] [blame] | 640 | static void free_one_page(struct zone *zone, struct page *page, int order, |
| 641 | int migratetype) |
Nick Piggin | 48db57f | 2006-01-08 01:00:42 -0800 | [diff] [blame] | 642 | { |
Christoph Lameter | 006d22d | 2006-09-25 23:31:48 -0700 | [diff] [blame] | 643 | spin_lock(&zone->lock); |
KOSAKI Motohiro | 93e4a89 | 2010-03-05 13:41:55 -0800 | [diff] [blame] | 644 | zone->all_unreclaimable = 0; |
Christoph Lameter | 006d22d | 2006-09-25 23:31:48 -0700 | [diff] [blame] | 645 | zone->pages_scanned = 0; |
Mel Gorman | f2260e6 | 2009-06-16 15:32:13 -0700 | [diff] [blame] | 646 | |
Mel Gorman | ed0ae21 | 2009-06-16 15:32:07 -0700 | [diff] [blame] | 647 | __free_one_page(page, zone, order, migratetype); |
Mel Gorman | 72853e2 | 2010-09-09 16:38:16 -0700 | [diff] [blame] | 648 | __mod_zone_page_state(zone, NR_FREE_PAGES, 1 << order); |
Christoph Lameter | 006d22d | 2006-09-25 23:31:48 -0700 | [diff] [blame] | 649 | spin_unlock(&zone->lock); |
Nick Piggin | 48db57f | 2006-01-08 01:00:42 -0800 | [diff] [blame] | 650 | } |
| 651 | |
KOSAKI Motohiro | ec95f53 | 2010-05-24 14:32:38 -0700 | [diff] [blame] | 652 | static bool free_pages_prepare(struct page *page, unsigned int order) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 653 | { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 654 | int i; |
Hugh Dickins | 8cc3b39 | 2009-01-06 14:40:06 -0800 | [diff] [blame] | 655 | int bad = 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 656 | |
Li Hong | f650316 | 2010-03-05 13:41:52 -0800 | [diff] [blame] | 657 | trace_mm_page_free_direct(page, order); |
Vegard Nossum | b1eeab6 | 2008-11-25 16:55:53 +0100 | [diff] [blame] | 658 | kmemcheck_free_shadow(page, order); |
| 659 | |
Andrea Arcangeli | 8dd60a3 | 2011-01-13 15:46:34 -0800 | [diff] [blame] | 660 | if (PageAnon(page)) |
| 661 | page->mapping = NULL; |
| 662 | for (i = 0; i < (1 << order); i++) |
| 663 | bad += free_pages_check(page + i); |
Hugh Dickins | 8cc3b39 | 2009-01-06 14:40:06 -0800 | [diff] [blame] | 664 | if (bad) |
KOSAKI Motohiro | ec95f53 | 2010-05-24 14:32:38 -0700 | [diff] [blame] | 665 | return false; |
Hugh Dickins | 689bceb | 2005-11-21 21:32:20 -0800 | [diff] [blame] | 666 | |
Thomas Gleixner | 3ac7fe5 | 2008-04-30 00:55:01 -0700 | [diff] [blame] | 667 | if (!PageHighMem(page)) { |
Nick Piggin | 9858db5 | 2006-10-11 01:21:30 -0700 | [diff] [blame] | 668 | debug_check_no_locks_freed(page_address(page),PAGE_SIZE<<order); |
Thomas Gleixner | 3ac7fe5 | 2008-04-30 00:55:01 -0700 | [diff] [blame] | 669 | debug_check_no_obj_freed(page_address(page), |
| 670 | PAGE_SIZE << order); |
| 671 | } |
Nick Piggin | dafb136 | 2006-10-11 01:21:30 -0700 | [diff] [blame] | 672 | arch_free_page(page, order); |
Nick Piggin | 48db57f | 2006-01-08 01:00:42 -0800 | [diff] [blame] | 673 | kernel_map_pages(page, 1 << order, 0); |
Nick Piggin | dafb136 | 2006-10-11 01:21:30 -0700 | [diff] [blame] | 674 | |
KOSAKI Motohiro | ec95f53 | 2010-05-24 14:32:38 -0700 | [diff] [blame] | 675 | return true; |
| 676 | } |
| 677 | |
| 678 | static void __free_pages_ok(struct page *page, unsigned int order) |
| 679 | { |
| 680 | unsigned long flags; |
| 681 | int wasMlocked = __TestClearPageMlocked(page); |
| 682 | |
| 683 | if (!free_pages_prepare(page, order)) |
| 684 | return; |
| 685 | |
Nick Piggin | c54ad30 | 2006-01-06 00:10:56 -0800 | [diff] [blame] | 686 | local_irq_save(flags); |
Johannes Weiner | c277331 | 2009-06-19 19:30:56 +0200 | [diff] [blame] | 687 | if (unlikely(wasMlocked)) |
Mel Gorman | da456f1 | 2009-06-16 15:32:08 -0700 | [diff] [blame] | 688 | free_page_mlock(page); |
Christoph Lameter | f8891e5 | 2006-06-30 01:55:45 -0700 | [diff] [blame] | 689 | __count_vm_events(PGFREE, 1 << order); |
Mel Gorman | ed0ae21 | 2009-06-16 15:32:07 -0700 | [diff] [blame] | 690 | free_one_page(page_zone(page), page, order, |
| 691 | get_pageblock_migratetype(page)); |
Nick Piggin | c54ad30 | 2006-01-06 00:10:56 -0800 | [diff] [blame] | 692 | local_irq_restore(flags); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 693 | } |
| 694 | |
David Howells | a226f6c | 2006-01-06 00:11:08 -0800 | [diff] [blame] | 695 | /* |
| 696 | * permit the bootmem allocator to evade page validation on high-order frees |
| 697 | */ |
Yasunori Goto | af370fb | 2008-07-23 21:28:17 -0700 | [diff] [blame] | 698 | void __meminit __free_pages_bootmem(struct page *page, unsigned int order) |
David Howells | a226f6c | 2006-01-06 00:11:08 -0800 | [diff] [blame] | 699 | { |
| 700 | if (order == 0) { |
| 701 | __ClearPageReserved(page); |
| 702 | set_page_count(page, 0); |
Nick Piggin | 7835e98 | 2006-03-22 00:08:40 -0800 | [diff] [blame] | 703 | set_page_refcounted(page); |
Nick Piggin | 545b1ea | 2006-03-22 00:08:07 -0800 | [diff] [blame] | 704 | __free_page(page); |
David Howells | a226f6c | 2006-01-06 00:11:08 -0800 | [diff] [blame] | 705 | } else { |
David Howells | a226f6c | 2006-01-06 00:11:08 -0800 | [diff] [blame] | 706 | int loop; |
| 707 | |
Nick Piggin | 545b1ea | 2006-03-22 00:08:07 -0800 | [diff] [blame] | 708 | prefetchw(page); |
David Howells | a226f6c | 2006-01-06 00:11:08 -0800 | [diff] [blame] | 709 | for (loop = 0; loop < BITS_PER_LONG; loop++) { |
| 710 | struct page *p = &page[loop]; |
| 711 | |
Nick Piggin | 545b1ea | 2006-03-22 00:08:07 -0800 | [diff] [blame] | 712 | if (loop + 1 < BITS_PER_LONG) |
| 713 | prefetchw(p + 1); |
David Howells | a226f6c | 2006-01-06 00:11:08 -0800 | [diff] [blame] | 714 | __ClearPageReserved(p); |
| 715 | set_page_count(p, 0); |
| 716 | } |
| 717 | |
Nick Piggin | 7835e98 | 2006-03-22 00:08:40 -0800 | [diff] [blame] | 718 | set_page_refcounted(page); |
Nick Piggin | 545b1ea | 2006-03-22 00:08:07 -0800 | [diff] [blame] | 719 | __free_pages(page, order); |
David Howells | a226f6c | 2006-01-06 00:11:08 -0800 | [diff] [blame] | 720 | } |
| 721 | } |
| 722 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 723 | |
| 724 | /* |
| 725 | * The order of subdivision here is critical for the IO subsystem. |
| 726 | * Please do not alter this order without good reasons and regression |
| 727 | * testing. Specifically, as large blocks of memory are subdivided, |
| 728 | * the order in which smaller blocks are delivered depends on the order |
| 729 | * they're subdivided in this function. This is the primary factor |
| 730 | * influencing the order in which pages are delivered to the IO |
| 731 | * subsystem according to empirical testing, and this is also justified |
| 732 | * by considering the behavior of a buddy system containing a single |
| 733 | * large block of memory acted on by a series of small allocations. |
| 734 | * This behavior is a critical factor in sglist merging's success. |
| 735 | * |
| 736 | * -- wli |
| 737 | */ |
Nick Piggin | 085cc7d | 2006-01-06 00:11:01 -0800 | [diff] [blame] | 738 | static inline void expand(struct zone *zone, struct page *page, |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 739 | int low, int high, struct free_area *area, |
| 740 | int migratetype) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 741 | { |
| 742 | unsigned long size = 1 << high; |
| 743 | |
| 744 | while (high > low) { |
| 745 | area--; |
| 746 | high--; |
| 747 | size >>= 1; |
Nick Piggin | 725d704 | 2006-09-25 23:30:55 -0700 | [diff] [blame] | 748 | VM_BUG_ON(bad_range(zone, &page[size])); |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 749 | list_add(&page[size].lru, &area->free_list[migratetype]); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 750 | area->nr_free++; |
| 751 | set_page_order(&page[size], high); |
| 752 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 753 | } |
| 754 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 755 | /* |
| 756 | * This page is about to be returned from the page allocator |
| 757 | */ |
Wu Fengguang | 2a7684a | 2009-09-16 11:50:12 +0200 | [diff] [blame] | 758 | static inline int check_new_page(struct page *page) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 759 | { |
Nick Piggin | 92be2e33 | 2006-01-06 00:10:57 -0800 | [diff] [blame] | 760 | if (unlikely(page_mapcount(page) | |
| 761 | (page->mapping != NULL) | |
Nick Piggin | a3af9c3 | 2009-06-16 15:32:10 -0700 | [diff] [blame] | 762 | (atomic_read(&page->_count) != 0) | |
Daisuke Nishimura | f212ad7 | 2011-03-23 16:42:25 -0700 | [diff] [blame] | 763 | (page->flags & PAGE_FLAGS_CHECK_AT_PREP) | |
| 764 | (mem_cgroup_bad_page_check(page)))) { |
Nick Piggin | 224abf9 | 2006-01-06 00:11:11 -0800 | [diff] [blame] | 765 | bad_page(page); |
Hugh Dickins | 689bceb | 2005-11-21 21:32:20 -0800 | [diff] [blame] | 766 | return 1; |
Hugh Dickins | 8cc3b39 | 2009-01-06 14:40:06 -0800 | [diff] [blame] | 767 | } |
Wu Fengguang | 2a7684a | 2009-09-16 11:50:12 +0200 | [diff] [blame] | 768 | return 0; |
| 769 | } |
| 770 | |
| 771 | static int prep_new_page(struct page *page, int order, gfp_t gfp_flags) |
| 772 | { |
| 773 | int i; |
| 774 | |
| 775 | for (i = 0; i < (1 << order); i++) { |
| 776 | struct page *p = page + i; |
| 777 | if (unlikely(check_new_page(p))) |
| 778 | return 1; |
| 779 | } |
Hugh Dickins | 689bceb | 2005-11-21 21:32:20 -0800 | [diff] [blame] | 780 | |
Hugh Dickins | 4c21e2f | 2005-10-29 18:16:40 -0700 | [diff] [blame] | 781 | set_page_private(page, 0); |
Nick Piggin | 7835e98 | 2006-03-22 00:08:40 -0800 | [diff] [blame] | 782 | set_page_refcounted(page); |
Nick Piggin | cc102509 | 2006-12-06 20:32:00 -0800 | [diff] [blame] | 783 | |
| 784 | arch_alloc_page(page, order); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 785 | kernel_map_pages(page, 1 << order, 1); |
Nick Piggin | 17cf440 | 2006-03-22 00:08:41 -0800 | [diff] [blame] | 786 | |
| 787 | if (gfp_flags & __GFP_ZERO) |
| 788 | prep_zero_page(page, order, gfp_flags); |
| 789 | |
| 790 | if (order && (gfp_flags & __GFP_COMP)) |
| 791 | prep_compound_page(page, order); |
| 792 | |
Hugh Dickins | 689bceb | 2005-11-21 21:32:20 -0800 | [diff] [blame] | 793 | return 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 794 | } |
| 795 | |
Mel Gorman | 56fd56b | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 796 | /* |
| 797 | * Go through the free lists for the given migratetype and remove |
| 798 | * the smallest available page from the freelists |
| 799 | */ |
Mel Gorman | 728ec98 | 2009-06-16 15:32:04 -0700 | [diff] [blame] | 800 | static inline |
| 801 | struct page *__rmqueue_smallest(struct zone *zone, unsigned int order, |
Mel Gorman | 56fd56b | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 802 | int migratetype) |
| 803 | { |
| 804 | unsigned int current_order; |
| 805 | struct free_area * area; |
| 806 | struct page *page; |
| 807 | |
| 808 | /* Find a page of the appropriate size in the preferred list */ |
| 809 | for (current_order = order; current_order < MAX_ORDER; ++current_order) { |
| 810 | area = &(zone->free_area[current_order]); |
| 811 | if (list_empty(&area->free_list[migratetype])) |
| 812 | continue; |
| 813 | |
| 814 | page = list_entry(area->free_list[migratetype].next, |
| 815 | struct page, lru); |
| 816 | list_del(&page->lru); |
| 817 | rmv_page_order(page); |
| 818 | area->nr_free--; |
Mel Gorman | 56fd56b | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 819 | expand(zone, page, order, current_order, area, migratetype); |
| 820 | return page; |
| 821 | } |
| 822 | |
| 823 | return NULL; |
| 824 | } |
| 825 | |
| 826 | |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 827 | /* |
| 828 | * This array describes the order lists are fallen back to when |
| 829 | * the free lists for the desirable migrate type are depleted |
| 830 | */ |
| 831 | static int fallbacks[MIGRATE_TYPES][MIGRATE_TYPES-1] = { |
Mel Gorman | 64c5e13 | 2007-10-16 01:25:59 -0700 | [diff] [blame] | 832 | [MIGRATE_UNMOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_MOVABLE, MIGRATE_RESERVE }, |
| 833 | [MIGRATE_RECLAIMABLE] = { MIGRATE_UNMOVABLE, MIGRATE_MOVABLE, MIGRATE_RESERVE }, |
| 834 | [MIGRATE_MOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_UNMOVABLE, MIGRATE_RESERVE }, |
| 835 | [MIGRATE_RESERVE] = { MIGRATE_RESERVE, MIGRATE_RESERVE, MIGRATE_RESERVE }, /* Never used */ |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 836 | }; |
| 837 | |
Mel Gorman | c361be5 | 2007-10-16 01:25:51 -0700 | [diff] [blame] | 838 | /* |
| 839 | * Move the free pages in a range to the free lists of the requested type. |
Mel Gorman | d9c2340 | 2007-10-16 01:26:01 -0700 | [diff] [blame] | 840 | * Note that start_page and end_pages are not aligned on a pageblock |
Mel Gorman | c361be5 | 2007-10-16 01:25:51 -0700 | [diff] [blame] | 841 | * boundary. If alignment is required, use move_freepages_block() |
| 842 | */ |
Adrian Bunk | b69a728 | 2008-07-23 21:28:12 -0700 | [diff] [blame] | 843 | static int move_freepages(struct zone *zone, |
| 844 | struct page *start_page, struct page *end_page, |
| 845 | int migratetype) |
Mel Gorman | c361be5 | 2007-10-16 01:25:51 -0700 | [diff] [blame] | 846 | { |
| 847 | struct page *page; |
| 848 | unsigned long order; |
Mel Gorman | d100313 | 2007-10-16 01:26:00 -0700 | [diff] [blame] | 849 | int pages_moved = 0; |
Mel Gorman | c361be5 | 2007-10-16 01:25:51 -0700 | [diff] [blame] | 850 | |
| 851 | #ifndef CONFIG_HOLES_IN_ZONE |
| 852 | /* |
| 853 | * page_zone is not safe to call in this context when |
| 854 | * CONFIG_HOLES_IN_ZONE is set. This bug check is probably redundant |
| 855 | * anyway as we check zone boundaries in move_freepages_block(). |
| 856 | * Remove at a later date when no bug reports exist related to |
Mel Gorman | ac0e5b7 | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 857 | * grouping pages by mobility |
Mel Gorman | c361be5 | 2007-10-16 01:25:51 -0700 | [diff] [blame] | 858 | */ |
| 859 | BUG_ON(page_zone(start_page) != page_zone(end_page)); |
| 860 | #endif |
| 861 | |
| 862 | for (page = start_page; page <= end_page;) { |
Adam Litke | 344c790 | 2008-09-02 14:35:38 -0700 | [diff] [blame] | 863 | /* Make sure we are not inadvertently changing nodes */ |
| 864 | VM_BUG_ON(page_to_nid(page) != zone_to_nid(zone)); |
| 865 | |
Mel Gorman | c361be5 | 2007-10-16 01:25:51 -0700 | [diff] [blame] | 866 | if (!pfn_valid_within(page_to_pfn(page))) { |
| 867 | page++; |
| 868 | continue; |
| 869 | } |
| 870 | |
| 871 | if (!PageBuddy(page)) { |
| 872 | page++; |
| 873 | continue; |
| 874 | } |
| 875 | |
| 876 | order = page_order(page); |
Kirill A. Shutemov | 84be48d | 2011-03-22 16:33:41 -0700 | [diff] [blame] | 877 | list_move(&page->lru, |
| 878 | &zone->free_area[order].free_list[migratetype]); |
Mel Gorman | c361be5 | 2007-10-16 01:25:51 -0700 | [diff] [blame] | 879 | page += 1 << order; |
Mel Gorman | d100313 | 2007-10-16 01:26:00 -0700 | [diff] [blame] | 880 | pages_moved += 1 << order; |
Mel Gorman | c361be5 | 2007-10-16 01:25:51 -0700 | [diff] [blame] | 881 | } |
| 882 | |
Mel Gorman | d100313 | 2007-10-16 01:26:00 -0700 | [diff] [blame] | 883 | return pages_moved; |
Mel Gorman | c361be5 | 2007-10-16 01:25:51 -0700 | [diff] [blame] | 884 | } |
| 885 | |
Adrian Bunk | b69a728 | 2008-07-23 21:28:12 -0700 | [diff] [blame] | 886 | static int move_freepages_block(struct zone *zone, struct page *page, |
| 887 | int migratetype) |
Mel Gorman | c361be5 | 2007-10-16 01:25:51 -0700 | [diff] [blame] | 888 | { |
| 889 | unsigned long start_pfn, end_pfn; |
| 890 | struct page *start_page, *end_page; |
| 891 | |
| 892 | start_pfn = page_to_pfn(page); |
Mel Gorman | d9c2340 | 2007-10-16 01:26:01 -0700 | [diff] [blame] | 893 | start_pfn = start_pfn & ~(pageblock_nr_pages-1); |
Mel Gorman | c361be5 | 2007-10-16 01:25:51 -0700 | [diff] [blame] | 894 | start_page = pfn_to_page(start_pfn); |
Mel Gorman | d9c2340 | 2007-10-16 01:26:01 -0700 | [diff] [blame] | 895 | end_page = start_page + pageblock_nr_pages - 1; |
| 896 | end_pfn = start_pfn + pageblock_nr_pages - 1; |
Mel Gorman | c361be5 | 2007-10-16 01:25:51 -0700 | [diff] [blame] | 897 | |
| 898 | /* Do not cross zone boundaries */ |
| 899 | if (start_pfn < zone->zone_start_pfn) |
| 900 | start_page = page; |
| 901 | if (end_pfn >= zone->zone_start_pfn + zone->spanned_pages) |
| 902 | return 0; |
| 903 | |
| 904 | return move_freepages(zone, start_page, end_page, migratetype); |
| 905 | } |
| 906 | |
Mel Gorman | 2f66a68 | 2009-09-21 17:02:31 -0700 | [diff] [blame] | 907 | static void change_pageblock_range(struct page *pageblock_page, |
| 908 | int start_order, int migratetype) |
| 909 | { |
| 910 | int nr_pageblocks = 1 << (start_order - pageblock_order); |
| 911 | |
| 912 | while (nr_pageblocks--) { |
| 913 | set_pageblock_migratetype(pageblock_page, migratetype); |
| 914 | pageblock_page += pageblock_nr_pages; |
| 915 | } |
| 916 | } |
| 917 | |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 918 | /* Remove an element from the buddy allocator from the fallback list */ |
Mel Gorman | 0ac3a40 | 2009-06-16 15:32:06 -0700 | [diff] [blame] | 919 | static inline struct page * |
| 920 | __rmqueue_fallback(struct zone *zone, int order, int start_migratetype) |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 921 | { |
| 922 | struct free_area * area; |
| 923 | int current_order; |
| 924 | struct page *page; |
| 925 | int migratetype, i; |
| 926 | |
| 927 | /* Find the largest possible block of pages in the other list */ |
| 928 | for (current_order = MAX_ORDER-1; current_order >= order; |
| 929 | --current_order) { |
| 930 | for (i = 0; i < MIGRATE_TYPES - 1; i++) { |
| 931 | migratetype = fallbacks[start_migratetype][i]; |
| 932 | |
Mel Gorman | 56fd56b | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 933 | /* MIGRATE_RESERVE handled later if necessary */ |
| 934 | if (migratetype == MIGRATE_RESERVE) |
| 935 | continue; |
Mel Gorman | e010487 | 2007-10-16 01:25:53 -0700 | [diff] [blame] | 936 | |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 937 | area = &(zone->free_area[current_order]); |
| 938 | if (list_empty(&area->free_list[migratetype])) |
| 939 | continue; |
| 940 | |
| 941 | page = list_entry(area->free_list[migratetype].next, |
| 942 | struct page, lru); |
| 943 | area->nr_free--; |
| 944 | |
| 945 | /* |
Mel Gorman | c361be5 | 2007-10-16 01:25:51 -0700 | [diff] [blame] | 946 | * If breaking a large block of pages, move all free |
Mel Gorman | 46dafbc | 2007-10-16 01:25:55 -0700 | [diff] [blame] | 947 | * pages to the preferred allocation list. If falling |
| 948 | * back for a reclaimable kernel allocation, be more |
Lucas De Marchi | 25985ed | 2011-03-30 22:57:33 -0300 | [diff] [blame] | 949 | * aggressive about taking ownership of free pages |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 950 | */ |
Mel Gorman | d9c2340 | 2007-10-16 01:26:01 -0700 | [diff] [blame] | 951 | if (unlikely(current_order >= (pageblock_order >> 1)) || |
Mel Gorman | dd5d241 | 2009-09-05 11:17:11 -0700 | [diff] [blame] | 952 | start_migratetype == MIGRATE_RECLAIMABLE || |
| 953 | page_group_by_mobility_disabled) { |
Mel Gorman | 46dafbc | 2007-10-16 01:25:55 -0700 | [diff] [blame] | 954 | unsigned long pages; |
| 955 | pages = move_freepages_block(zone, page, |
| 956 | start_migratetype); |
| 957 | |
| 958 | /* Claim the whole block if over half of it is free */ |
Mel Gorman | dd5d241 | 2009-09-05 11:17:11 -0700 | [diff] [blame] | 959 | if (pages >= (1 << (pageblock_order-1)) || |
| 960 | page_group_by_mobility_disabled) |
Mel Gorman | 46dafbc | 2007-10-16 01:25:55 -0700 | [diff] [blame] | 961 | set_pageblock_migratetype(page, |
| 962 | start_migratetype); |
| 963 | |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 964 | migratetype = start_migratetype; |
Mel Gorman | c361be5 | 2007-10-16 01:25:51 -0700 | [diff] [blame] | 965 | } |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 966 | |
| 967 | /* Remove the page from the freelists */ |
| 968 | list_del(&page->lru); |
| 969 | rmv_page_order(page); |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 970 | |
Mel Gorman | 2f66a68 | 2009-09-21 17:02:31 -0700 | [diff] [blame] | 971 | /* Take ownership for orders >= pageblock_order */ |
| 972 | if (current_order >= pageblock_order) |
| 973 | change_pageblock_range(page, current_order, |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 974 | start_migratetype); |
| 975 | |
| 976 | expand(zone, page, order, current_order, area, migratetype); |
Mel Gorman | e0fff1b | 2009-09-21 17:02:42 -0700 | [diff] [blame] | 977 | |
| 978 | trace_mm_page_alloc_extfrag(page, order, current_order, |
| 979 | start_migratetype, migratetype); |
| 980 | |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 981 | return page; |
| 982 | } |
| 983 | } |
| 984 | |
Mel Gorman | 728ec98 | 2009-06-16 15:32:04 -0700 | [diff] [blame] | 985 | return NULL; |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 986 | } |
| 987 | |
Mel Gorman | 56fd56b | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 988 | /* |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 989 | * Do the hard work of removing an element from the buddy allocator. |
| 990 | * Call me with the zone->lock already held. |
| 991 | */ |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 992 | static struct page *__rmqueue(struct zone *zone, unsigned int order, |
| 993 | int migratetype) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 994 | { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 995 | struct page *page; |
| 996 | |
Mel Gorman | 728ec98 | 2009-06-16 15:32:04 -0700 | [diff] [blame] | 997 | retry_reserve: |
Mel Gorman | 56fd56b | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 998 | page = __rmqueue_smallest(zone, order, migratetype); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 999 | |
Mel Gorman | 728ec98 | 2009-06-16 15:32:04 -0700 | [diff] [blame] | 1000 | if (unlikely(!page) && migratetype != MIGRATE_RESERVE) { |
Mel Gorman | 56fd56b | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 1001 | page = __rmqueue_fallback(zone, order, migratetype); |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 1002 | |
Mel Gorman | 728ec98 | 2009-06-16 15:32:04 -0700 | [diff] [blame] | 1003 | /* |
| 1004 | * Use MIGRATE_RESERVE rather than fail an allocation. goto |
| 1005 | * is used because __rmqueue_smallest is an inline function |
| 1006 | * and we want just one call site |
| 1007 | */ |
| 1008 | if (!page) { |
| 1009 | migratetype = MIGRATE_RESERVE; |
| 1010 | goto retry_reserve; |
| 1011 | } |
| 1012 | } |
| 1013 | |
Mel Gorman | 0d3d062 | 2009-09-21 17:02:44 -0700 | [diff] [blame] | 1014 | trace_mm_page_alloc_zone_locked(page, order, migratetype); |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 1015 | return page; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1016 | } |
| 1017 | |
| 1018 | /* |
| 1019 | * Obtain a specified number of elements from the buddy allocator, all under |
| 1020 | * a single hold of the lock, for efficiency. Add them to the supplied list. |
| 1021 | * Returns the number of new pages which were placed at *list. |
| 1022 | */ |
| 1023 | static int rmqueue_bulk(struct zone *zone, unsigned int order, |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 1024 | unsigned long count, struct list_head *list, |
Mel Gorman | e084b2d | 2009-07-29 15:02:04 -0700 | [diff] [blame] | 1025 | int migratetype, int cold) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1026 | { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1027 | int i; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1028 | |
Nick Piggin | c54ad30 | 2006-01-06 00:10:56 -0800 | [diff] [blame] | 1029 | spin_lock(&zone->lock); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1030 | for (i = 0; i < count; ++i) { |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 1031 | struct page *page = __rmqueue(zone, order, migratetype); |
Nick Piggin | 085cc7d | 2006-01-06 00:11:01 -0800 | [diff] [blame] | 1032 | if (unlikely(page == NULL)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1033 | break; |
Mel Gorman | 81eabcb | 2007-12-17 16:20:05 -0800 | [diff] [blame] | 1034 | |
| 1035 | /* |
| 1036 | * Split buddy pages returned by expand() are received here |
| 1037 | * in physical page order. The page is added to the callers and |
| 1038 | * list and the list head then moves forward. From the callers |
| 1039 | * perspective, the linked list is ordered by page number in |
| 1040 | * some conditions. This is useful for IO devices that can |
| 1041 | * merge IO requests if the physical pages are ordered |
| 1042 | * properly. |
| 1043 | */ |
Mel Gorman | e084b2d | 2009-07-29 15:02:04 -0700 | [diff] [blame] | 1044 | if (likely(cold == 0)) |
| 1045 | list_add(&page->lru, list); |
| 1046 | else |
| 1047 | list_add_tail(&page->lru, list); |
Mel Gorman | 535131e6 | 2007-10-16 01:25:49 -0700 | [diff] [blame] | 1048 | set_page_private(page, migratetype); |
Mel Gorman | 81eabcb | 2007-12-17 16:20:05 -0800 | [diff] [blame] | 1049 | list = &page->lru; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1050 | } |
Mel Gorman | f2260e6 | 2009-06-16 15:32:13 -0700 | [diff] [blame] | 1051 | __mod_zone_page_state(zone, NR_FREE_PAGES, -(i << order)); |
Nick Piggin | c54ad30 | 2006-01-06 00:10:56 -0800 | [diff] [blame] | 1052 | spin_unlock(&zone->lock); |
Nick Piggin | 085cc7d | 2006-01-06 00:11:01 -0800 | [diff] [blame] | 1053 | return i; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1054 | } |
| 1055 | |
Christoph Lameter | 4ae7c03 | 2005-06-21 17:14:57 -0700 | [diff] [blame] | 1056 | #ifdef CONFIG_NUMA |
Christoph Lameter | 8fce4d8 | 2006-03-09 17:33:54 -0800 | [diff] [blame] | 1057 | /* |
Christoph Lameter | 4037d45 | 2007-05-09 02:35:14 -0700 | [diff] [blame] | 1058 | * Called from the vmstat counter updater to drain pagesets of this |
| 1059 | * currently executing processor on remote nodes after they have |
| 1060 | * expired. |
| 1061 | * |
Christoph Lameter | 879336c | 2006-03-22 00:09:08 -0800 | [diff] [blame] | 1062 | * Note that this function must be called with the thread pinned to |
| 1063 | * a single processor. |
Christoph Lameter | 8fce4d8 | 2006-03-09 17:33:54 -0800 | [diff] [blame] | 1064 | */ |
Christoph Lameter | 4037d45 | 2007-05-09 02:35:14 -0700 | [diff] [blame] | 1065 | void drain_zone_pages(struct zone *zone, struct per_cpu_pages *pcp) |
Christoph Lameter | 4ae7c03 | 2005-06-21 17:14:57 -0700 | [diff] [blame] | 1066 | { |
Christoph Lameter | 4ae7c03 | 2005-06-21 17:14:57 -0700 | [diff] [blame] | 1067 | unsigned long flags; |
Christoph Lameter | 4037d45 | 2007-05-09 02:35:14 -0700 | [diff] [blame] | 1068 | int to_drain; |
Christoph Lameter | 4ae7c03 | 2005-06-21 17:14:57 -0700 | [diff] [blame] | 1069 | |
Christoph Lameter | 4037d45 | 2007-05-09 02:35:14 -0700 | [diff] [blame] | 1070 | local_irq_save(flags); |
| 1071 | if (pcp->count >= pcp->batch) |
| 1072 | to_drain = pcp->batch; |
| 1073 | else |
| 1074 | to_drain = pcp->count; |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 1075 | free_pcppages_bulk(zone, to_drain, pcp); |
Christoph Lameter | 4037d45 | 2007-05-09 02:35:14 -0700 | [diff] [blame] | 1076 | pcp->count -= to_drain; |
| 1077 | local_irq_restore(flags); |
Christoph Lameter | 4ae7c03 | 2005-06-21 17:14:57 -0700 | [diff] [blame] | 1078 | } |
| 1079 | #endif |
| 1080 | |
Christoph Lameter | 9f8f217 | 2008-02-04 22:29:11 -0800 | [diff] [blame] | 1081 | /* |
| 1082 | * Drain pages of the indicated processor. |
| 1083 | * |
| 1084 | * The processor must either be the current processor and the |
| 1085 | * thread pinned to the current processor or a processor that |
| 1086 | * is not online. |
| 1087 | */ |
| 1088 | static void drain_pages(unsigned int cpu) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1089 | { |
Nick Piggin | c54ad30 | 2006-01-06 00:10:56 -0800 | [diff] [blame] | 1090 | unsigned long flags; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1091 | struct zone *zone; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1092 | |
KOSAKI Motohiro | ee99c71 | 2009-03-31 15:19:31 -0700 | [diff] [blame] | 1093 | for_each_populated_zone(zone) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1094 | struct per_cpu_pageset *pset; |
Christoph Lameter | 3dfa572 | 2008-02-04 22:29:19 -0800 | [diff] [blame] | 1095 | struct per_cpu_pages *pcp; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1096 | |
Christoph Lameter | 99dcc3e | 2010-01-05 15:34:51 +0900 | [diff] [blame] | 1097 | local_irq_save(flags); |
| 1098 | pset = per_cpu_ptr(zone->pageset, cpu); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1099 | |
Christoph Lameter | 3dfa572 | 2008-02-04 22:29:19 -0800 | [diff] [blame] | 1100 | pcp = &pset->pcp; |
David Rientjes | 2ff754f | 2011-01-25 15:07:23 -0800 | [diff] [blame] | 1101 | if (pcp->count) { |
| 1102 | free_pcppages_bulk(zone, pcp->count, pcp); |
| 1103 | pcp->count = 0; |
| 1104 | } |
Christoph Lameter | 3dfa572 | 2008-02-04 22:29:19 -0800 | [diff] [blame] | 1105 | local_irq_restore(flags); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1106 | } |
| 1107 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1108 | |
Christoph Lameter | 9f8f217 | 2008-02-04 22:29:11 -0800 | [diff] [blame] | 1109 | /* |
| 1110 | * Spill all of this CPU's per-cpu pages back into the buddy allocator. |
| 1111 | */ |
| 1112 | void drain_local_pages(void *arg) |
| 1113 | { |
| 1114 | drain_pages(smp_processor_id()); |
| 1115 | } |
| 1116 | |
| 1117 | /* |
| 1118 | * Spill all the per-cpu pages from all CPUs back into the buddy allocator |
| 1119 | */ |
| 1120 | void drain_all_pages(void) |
| 1121 | { |
Jens Axboe | 15c8b6c | 2008-05-09 09:39:44 +0200 | [diff] [blame] | 1122 | on_each_cpu(drain_local_pages, NULL, 1); |
Christoph Lameter | 9f8f217 | 2008-02-04 22:29:11 -0800 | [diff] [blame] | 1123 | } |
| 1124 | |
Rafael J. Wysocki | 296699d | 2007-07-29 23:27:18 +0200 | [diff] [blame] | 1125 | #ifdef CONFIG_HIBERNATION |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1126 | |
| 1127 | void mark_free_pages(struct zone *zone) |
| 1128 | { |
Rafael J. Wysocki | f623f0d | 2006-09-25 23:32:49 -0700 | [diff] [blame] | 1129 | unsigned long pfn, max_zone_pfn; |
| 1130 | unsigned long flags; |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 1131 | int order, t; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1132 | struct list_head *curr; |
| 1133 | |
| 1134 | if (!zone->spanned_pages) |
| 1135 | return; |
| 1136 | |
| 1137 | spin_lock_irqsave(&zone->lock, flags); |
Rafael J. Wysocki | f623f0d | 2006-09-25 23:32:49 -0700 | [diff] [blame] | 1138 | |
| 1139 | max_zone_pfn = zone->zone_start_pfn + zone->spanned_pages; |
| 1140 | for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++) |
| 1141 | if (pfn_valid(pfn)) { |
| 1142 | struct page *page = pfn_to_page(pfn); |
| 1143 | |
Rafael J. Wysocki | 7be9823 | 2007-05-06 14:50:42 -0700 | [diff] [blame] | 1144 | if (!swsusp_page_is_forbidden(page)) |
| 1145 | swsusp_unset_page_free(page); |
Rafael J. Wysocki | f623f0d | 2006-09-25 23:32:49 -0700 | [diff] [blame] | 1146 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1147 | |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 1148 | for_each_migratetype_order(order, t) { |
| 1149 | list_for_each(curr, &zone->free_area[order].free_list[t]) { |
Rafael J. Wysocki | f623f0d | 2006-09-25 23:32:49 -0700 | [diff] [blame] | 1150 | unsigned long i; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1151 | |
Rafael J. Wysocki | f623f0d | 2006-09-25 23:32:49 -0700 | [diff] [blame] | 1152 | pfn = page_to_pfn(list_entry(curr, struct page, lru)); |
| 1153 | for (i = 0; i < (1UL << order); i++) |
Rafael J. Wysocki | 7be9823 | 2007-05-06 14:50:42 -0700 | [diff] [blame] | 1154 | swsusp_set_page_free(pfn_to_page(pfn + i)); |
Rafael J. Wysocki | f623f0d | 2006-09-25 23:32:49 -0700 | [diff] [blame] | 1155 | } |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 1156 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1157 | spin_unlock_irqrestore(&zone->lock, flags); |
| 1158 | } |
Mel Gorman | e2c55dc | 2007-10-16 01:25:50 -0700 | [diff] [blame] | 1159 | #endif /* CONFIG_PM */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1160 | |
| 1161 | /* |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1162 | * Free a 0-order page |
Li Hong | fc91668 | 2010-03-05 13:41:54 -0800 | [diff] [blame] | 1163 | * cold == 1 ? free a cold page : free a hot page |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1164 | */ |
Li Hong | fc91668 | 2010-03-05 13:41:54 -0800 | [diff] [blame] | 1165 | void free_hot_cold_page(struct page *page, int cold) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1166 | { |
| 1167 | struct zone *zone = page_zone(page); |
| 1168 | struct per_cpu_pages *pcp; |
| 1169 | unsigned long flags; |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 1170 | int migratetype; |
Johannes Weiner | 451ea25 | 2009-09-21 17:01:48 -0700 | [diff] [blame] | 1171 | int wasMlocked = __TestClearPageMlocked(page); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1172 | |
KOSAKI Motohiro | ec95f53 | 2010-05-24 14:32:38 -0700 | [diff] [blame] | 1173 | if (!free_pages_prepare(page, 0)) |
Hugh Dickins | 689bceb | 2005-11-21 21:32:20 -0800 | [diff] [blame] | 1174 | return; |
| 1175 | |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 1176 | migratetype = get_pageblock_migratetype(page); |
| 1177 | set_page_private(page, migratetype); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1178 | local_irq_save(flags); |
Johannes Weiner | c277331 | 2009-06-19 19:30:56 +0200 | [diff] [blame] | 1179 | if (unlikely(wasMlocked)) |
Mel Gorman | da456f1 | 2009-06-16 15:32:08 -0700 | [diff] [blame] | 1180 | free_page_mlock(page); |
Christoph Lameter | f8891e5 | 2006-06-30 01:55:45 -0700 | [diff] [blame] | 1181 | __count_vm_event(PGFREE); |
Mel Gorman | da456f1 | 2009-06-16 15:32:08 -0700 | [diff] [blame] | 1182 | |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 1183 | /* |
| 1184 | * We only track unmovable, reclaimable and movable on pcp lists. |
| 1185 | * Free ISOLATE pages back to the allocator because they are being |
| 1186 | * offlined but treat RESERVE as movable pages so we can get those |
| 1187 | * areas back if necessary. Otherwise, we may have to free |
| 1188 | * excessively into the page allocator |
| 1189 | */ |
| 1190 | if (migratetype >= MIGRATE_PCPTYPES) { |
| 1191 | if (unlikely(migratetype == MIGRATE_ISOLATE)) { |
| 1192 | free_one_page(zone, page, 0, migratetype); |
| 1193 | goto out; |
| 1194 | } |
| 1195 | migratetype = MIGRATE_MOVABLE; |
| 1196 | } |
| 1197 | |
Christoph Lameter | 99dcc3e | 2010-01-05 15:34:51 +0900 | [diff] [blame] | 1198 | pcp = &this_cpu_ptr(zone->pageset)->pcp; |
Christoph Lameter | 3dfa572 | 2008-02-04 22:29:19 -0800 | [diff] [blame] | 1199 | if (cold) |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 1200 | list_add_tail(&page->lru, &pcp->lists[migratetype]); |
Christoph Lameter | 3dfa572 | 2008-02-04 22:29:19 -0800 | [diff] [blame] | 1201 | else |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 1202 | list_add(&page->lru, &pcp->lists[migratetype]); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1203 | pcp->count++; |
Nick Piggin | 48db57f | 2006-01-08 01:00:42 -0800 | [diff] [blame] | 1204 | if (pcp->count >= pcp->high) { |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 1205 | free_pcppages_bulk(zone, pcp->batch, pcp); |
Nick Piggin | 48db57f | 2006-01-08 01:00:42 -0800 | [diff] [blame] | 1206 | pcp->count -= pcp->batch; |
| 1207 | } |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 1208 | |
| 1209 | out: |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1210 | local_irq_restore(flags); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1211 | } |
| 1212 | |
Nick Piggin | 8dfcc9b | 2006-03-22 00:08:05 -0800 | [diff] [blame] | 1213 | /* |
| 1214 | * split_page takes a non-compound higher-order page, and splits it into |
| 1215 | * n (1<<order) sub-pages: page[0..n] |
| 1216 | * Each sub-page must be freed individually. |
| 1217 | * |
| 1218 | * Note: this is probably too low level an operation for use in drivers. |
| 1219 | * Please consult with lkml before using this in your driver. |
| 1220 | */ |
| 1221 | void split_page(struct page *page, unsigned int order) |
| 1222 | { |
| 1223 | int i; |
| 1224 | |
Nick Piggin | 725d704 | 2006-09-25 23:30:55 -0700 | [diff] [blame] | 1225 | VM_BUG_ON(PageCompound(page)); |
| 1226 | VM_BUG_ON(!page_count(page)); |
Vegard Nossum | b1eeab6 | 2008-11-25 16:55:53 +0100 | [diff] [blame] | 1227 | |
| 1228 | #ifdef CONFIG_KMEMCHECK |
| 1229 | /* |
| 1230 | * Split shadow pages too, because free(page[0]) would |
| 1231 | * otherwise free the whole shadow. |
| 1232 | */ |
| 1233 | if (kmemcheck_page_is_tracked(page)) |
| 1234 | split_page(virt_to_page(page[0].shadow), order); |
| 1235 | #endif |
| 1236 | |
Nick Piggin | 7835e98 | 2006-03-22 00:08:40 -0800 | [diff] [blame] | 1237 | for (i = 1; i < (1 << order); i++) |
| 1238 | set_page_refcounted(page + i); |
Nick Piggin | 8dfcc9b | 2006-03-22 00:08:05 -0800 | [diff] [blame] | 1239 | } |
Nick Piggin | 8dfcc9b | 2006-03-22 00:08:05 -0800 | [diff] [blame] | 1240 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1241 | /* |
Mel Gorman | 748446b | 2010-05-24 14:32:27 -0700 | [diff] [blame] | 1242 | * Similar to split_page except the page is already free. As this is only |
| 1243 | * being used for migration, the migratetype of the block also changes. |
| 1244 | * As this is called with interrupts disabled, the caller is responsible |
| 1245 | * for calling arch_alloc_page() and kernel_map_page() after interrupts |
| 1246 | * are enabled. |
| 1247 | * |
| 1248 | * Note: this is probably too low level an operation for use in drivers. |
| 1249 | * Please consult with lkml before using this in your driver. |
| 1250 | */ |
| 1251 | int split_free_page(struct page *page) |
| 1252 | { |
| 1253 | unsigned int order; |
| 1254 | unsigned long watermark; |
| 1255 | struct zone *zone; |
| 1256 | |
| 1257 | BUG_ON(!PageBuddy(page)); |
| 1258 | |
| 1259 | zone = page_zone(page); |
| 1260 | order = page_order(page); |
| 1261 | |
| 1262 | /* Obey watermarks as if the page was being allocated */ |
| 1263 | watermark = low_wmark_pages(zone) + (1 << order); |
| 1264 | if (!zone_watermark_ok(zone, 0, watermark, 0, 0)) |
| 1265 | return 0; |
| 1266 | |
| 1267 | /* Remove page from free list */ |
| 1268 | list_del(&page->lru); |
| 1269 | zone->free_area[order].nr_free--; |
| 1270 | rmv_page_order(page); |
| 1271 | __mod_zone_page_state(zone, NR_FREE_PAGES, -(1UL << order)); |
| 1272 | |
| 1273 | /* Split into individual pages */ |
| 1274 | set_page_refcounted(page); |
| 1275 | split_page(page, order); |
| 1276 | |
| 1277 | if (order >= pageblock_order - 1) { |
| 1278 | struct page *endpage = page + (1 << order) - 1; |
| 1279 | for (; page < endpage; page += pageblock_nr_pages) |
| 1280 | set_pageblock_migratetype(page, MIGRATE_MOVABLE); |
| 1281 | } |
| 1282 | |
| 1283 | return 1 << order; |
| 1284 | } |
| 1285 | |
| 1286 | /* |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1287 | * Really, prep_compound_page() should be called from __rmqueue_bulk(). But |
| 1288 | * we cheat by calling it from here, in the order > 0 path. Saves a branch |
| 1289 | * or two. |
| 1290 | */ |
Mel Gorman | 0a15c3e | 2009-06-16 15:32:05 -0700 | [diff] [blame] | 1291 | static inline |
| 1292 | struct page *buffered_rmqueue(struct zone *preferred_zone, |
Mel Gorman | 3dd2826 | 2009-06-16 15:32:00 -0700 | [diff] [blame] | 1293 | struct zone *zone, int order, gfp_t gfp_flags, |
| 1294 | int migratetype) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1295 | { |
| 1296 | unsigned long flags; |
Hugh Dickins | 689bceb | 2005-11-21 21:32:20 -0800 | [diff] [blame] | 1297 | struct page *page; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1298 | int cold = !!(gfp_flags & __GFP_COLD); |
| 1299 | |
Hugh Dickins | 689bceb | 2005-11-21 21:32:20 -0800 | [diff] [blame] | 1300 | again: |
Nick Piggin | 48db57f | 2006-01-08 01:00:42 -0800 | [diff] [blame] | 1301 | if (likely(order == 0)) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1302 | struct per_cpu_pages *pcp; |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 1303 | struct list_head *list; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1304 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1305 | local_irq_save(flags); |
Christoph Lameter | 99dcc3e | 2010-01-05 15:34:51 +0900 | [diff] [blame] | 1306 | pcp = &this_cpu_ptr(zone->pageset)->pcp; |
| 1307 | list = &pcp->lists[migratetype]; |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 1308 | if (list_empty(list)) { |
Mel Gorman | 535131e6 | 2007-10-16 01:25:49 -0700 | [diff] [blame] | 1309 | pcp->count += rmqueue_bulk(zone, 0, |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 1310 | pcp->batch, list, |
Mel Gorman | e084b2d | 2009-07-29 15:02:04 -0700 | [diff] [blame] | 1311 | migratetype, cold); |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 1312 | if (unlikely(list_empty(list))) |
Shaohua Li | 6fb332f | 2009-09-21 17:01:17 -0700 | [diff] [blame] | 1313 | goto failed; |
Mel Gorman | 535131e6 | 2007-10-16 01:25:49 -0700 | [diff] [blame] | 1314 | } |
Mel Gorman | b92a6ed | 2007-10-16 01:25:50 -0700 | [diff] [blame] | 1315 | |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 1316 | if (cold) |
| 1317 | page = list_entry(list->prev, struct page, lru); |
| 1318 | else |
| 1319 | page = list_entry(list->next, struct page, lru); |
| 1320 | |
Mel Gorman | b92a6ed | 2007-10-16 01:25:50 -0700 | [diff] [blame] | 1321 | list_del(&page->lru); |
| 1322 | pcp->count--; |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 1323 | } else { |
Andrew Morton | dab48da | 2009-06-16 15:32:37 -0700 | [diff] [blame] | 1324 | if (unlikely(gfp_flags & __GFP_NOFAIL)) { |
| 1325 | /* |
| 1326 | * __GFP_NOFAIL is not to be used in new code. |
| 1327 | * |
| 1328 | * All __GFP_NOFAIL callers should be fixed so that they |
| 1329 | * properly detect and handle allocation failures. |
| 1330 | * |
| 1331 | * We most definitely don't want callers attempting to |
Linus Torvalds | 4923abf | 2009-06-24 12:16:49 -0700 | [diff] [blame] | 1332 | * allocate greater than order-1 page units with |
Andrew Morton | dab48da | 2009-06-16 15:32:37 -0700 | [diff] [blame] | 1333 | * __GFP_NOFAIL. |
| 1334 | */ |
Linus Torvalds | 4923abf | 2009-06-24 12:16:49 -0700 | [diff] [blame] | 1335 | WARN_ON_ONCE(order > 1); |
Andrew Morton | dab48da | 2009-06-16 15:32:37 -0700 | [diff] [blame] | 1336 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1337 | spin_lock_irqsave(&zone->lock, flags); |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 1338 | page = __rmqueue(zone, order, migratetype); |
Nick Piggin | a74609f | 2006-01-06 00:11:20 -0800 | [diff] [blame] | 1339 | spin_unlock(&zone->lock); |
| 1340 | if (!page) |
| 1341 | goto failed; |
KOSAKI Motohiro | 6ccf80e | 2010-01-15 17:01:18 -0800 | [diff] [blame] | 1342 | __mod_zone_page_state(zone, NR_FREE_PAGES, -(1 << order)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1343 | } |
| 1344 | |
Christoph Lameter | f8891e5 | 2006-06-30 01:55:45 -0700 | [diff] [blame] | 1345 | __count_zone_vm_events(PGALLOC, zone, 1 << order); |
Andi Kleen | 78afd56 | 2011-03-22 16:33:12 -0700 | [diff] [blame] | 1346 | zone_statistics(preferred_zone, zone, gfp_flags); |
Nick Piggin | a74609f | 2006-01-06 00:11:20 -0800 | [diff] [blame] | 1347 | local_irq_restore(flags); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1348 | |
Nick Piggin | 725d704 | 2006-09-25 23:30:55 -0700 | [diff] [blame] | 1349 | VM_BUG_ON(bad_range(zone, page)); |
Nick Piggin | 17cf440 | 2006-03-22 00:08:41 -0800 | [diff] [blame] | 1350 | if (prep_new_page(page, order, gfp_flags)) |
Nick Piggin | a74609f | 2006-01-06 00:11:20 -0800 | [diff] [blame] | 1351 | goto again; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1352 | return page; |
Nick Piggin | a74609f | 2006-01-06 00:11:20 -0800 | [diff] [blame] | 1353 | |
| 1354 | failed: |
| 1355 | local_irq_restore(flags); |
Nick Piggin | a74609f | 2006-01-06 00:11:20 -0800 | [diff] [blame] | 1356 | return NULL; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1357 | } |
| 1358 | |
Mel Gorman | 4185896 | 2009-06-16 15:32:12 -0700 | [diff] [blame] | 1359 | /* The ALLOC_WMARK bits are used as an index to zone->watermark */ |
| 1360 | #define ALLOC_WMARK_MIN WMARK_MIN |
| 1361 | #define ALLOC_WMARK_LOW WMARK_LOW |
| 1362 | #define ALLOC_WMARK_HIGH WMARK_HIGH |
| 1363 | #define ALLOC_NO_WATERMARKS 0x04 /* don't check watermarks at all */ |
| 1364 | |
| 1365 | /* Mask to get the watermark bits */ |
| 1366 | #define ALLOC_WMARK_MASK (ALLOC_NO_WATERMARKS-1) |
| 1367 | |
Nick Piggin | 3148890 | 2005-11-28 13:44:03 -0800 | [diff] [blame] | 1368 | #define ALLOC_HARDER 0x10 /* try to alloc harder */ |
| 1369 | #define ALLOC_HIGH 0x20 /* __GFP_HIGH set */ |
| 1370 | #define ALLOC_CPUSET 0x40 /* check for correct cpuset */ |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 1371 | |
Akinobu Mita | 933e312 | 2006-12-08 02:39:45 -0800 | [diff] [blame] | 1372 | #ifdef CONFIG_FAIL_PAGE_ALLOC |
| 1373 | |
Akinobu Mita | b2588c4 | 2011-07-26 16:09:03 -0700 | [diff] [blame] | 1374 | static struct { |
Akinobu Mita | 933e312 | 2006-12-08 02:39:45 -0800 | [diff] [blame] | 1375 | struct fault_attr attr; |
| 1376 | |
| 1377 | u32 ignore_gfp_highmem; |
| 1378 | u32 ignore_gfp_wait; |
Akinobu Mita | 5411499 | 2007-07-15 23:40:23 -0700 | [diff] [blame] | 1379 | u32 min_order; |
Akinobu Mita | 933e312 | 2006-12-08 02:39:45 -0800 | [diff] [blame] | 1380 | } fail_page_alloc = { |
| 1381 | .attr = FAULT_ATTR_INITIALIZER, |
Don Mullis | 6b1b60f | 2006-12-08 02:39:53 -0800 | [diff] [blame] | 1382 | .ignore_gfp_wait = 1, |
| 1383 | .ignore_gfp_highmem = 1, |
Akinobu Mita | 5411499 | 2007-07-15 23:40:23 -0700 | [diff] [blame] | 1384 | .min_order = 1, |
Akinobu Mita | 933e312 | 2006-12-08 02:39:45 -0800 | [diff] [blame] | 1385 | }; |
| 1386 | |
| 1387 | static int __init setup_fail_page_alloc(char *str) |
| 1388 | { |
| 1389 | return setup_fault_attr(&fail_page_alloc.attr, str); |
| 1390 | } |
| 1391 | __setup("fail_page_alloc=", setup_fail_page_alloc); |
| 1392 | |
| 1393 | static int should_fail_alloc_page(gfp_t gfp_mask, unsigned int order) |
| 1394 | { |
Akinobu Mita | 5411499 | 2007-07-15 23:40:23 -0700 | [diff] [blame] | 1395 | if (order < fail_page_alloc.min_order) |
| 1396 | return 0; |
Akinobu Mita | 933e312 | 2006-12-08 02:39:45 -0800 | [diff] [blame] | 1397 | if (gfp_mask & __GFP_NOFAIL) |
| 1398 | return 0; |
| 1399 | if (fail_page_alloc.ignore_gfp_highmem && (gfp_mask & __GFP_HIGHMEM)) |
| 1400 | return 0; |
| 1401 | if (fail_page_alloc.ignore_gfp_wait && (gfp_mask & __GFP_WAIT)) |
| 1402 | return 0; |
| 1403 | |
| 1404 | return should_fail(&fail_page_alloc.attr, 1 << order); |
| 1405 | } |
| 1406 | |
| 1407 | #ifdef CONFIG_FAULT_INJECTION_DEBUG_FS |
| 1408 | |
| 1409 | static int __init fail_page_alloc_debugfs(void) |
| 1410 | { |
| 1411 | mode_t mode = S_IFREG | S_IRUSR | S_IWUSR; |
| 1412 | struct dentry *dir; |
Akinobu Mita | 933e312 | 2006-12-08 02:39:45 -0800 | [diff] [blame] | 1413 | |
Akinobu Mita | dd48c08 | 2011-08-03 16:21:01 -0700 | [diff] [blame] | 1414 | dir = fault_create_debugfs_attr("fail_page_alloc", NULL, |
| 1415 | &fail_page_alloc.attr); |
| 1416 | if (IS_ERR(dir)) |
| 1417 | return PTR_ERR(dir); |
Akinobu Mita | 933e312 | 2006-12-08 02:39:45 -0800 | [diff] [blame] | 1418 | |
Akinobu Mita | b2588c4 | 2011-07-26 16:09:03 -0700 | [diff] [blame] | 1419 | if (!debugfs_create_bool("ignore-gfp-wait", mode, dir, |
| 1420 | &fail_page_alloc.ignore_gfp_wait)) |
| 1421 | goto fail; |
| 1422 | if (!debugfs_create_bool("ignore-gfp-highmem", mode, dir, |
| 1423 | &fail_page_alloc.ignore_gfp_highmem)) |
| 1424 | goto fail; |
| 1425 | if (!debugfs_create_u32("min-order", mode, dir, |
| 1426 | &fail_page_alloc.min_order)) |
| 1427 | goto fail; |
Akinobu Mita | 933e312 | 2006-12-08 02:39:45 -0800 | [diff] [blame] | 1428 | |
Akinobu Mita | b2588c4 | 2011-07-26 16:09:03 -0700 | [diff] [blame] | 1429 | return 0; |
| 1430 | fail: |
Akinobu Mita | dd48c08 | 2011-08-03 16:21:01 -0700 | [diff] [blame] | 1431 | debugfs_remove_recursive(dir); |
Akinobu Mita | 933e312 | 2006-12-08 02:39:45 -0800 | [diff] [blame] | 1432 | |
Akinobu Mita | b2588c4 | 2011-07-26 16:09:03 -0700 | [diff] [blame] | 1433 | return -ENOMEM; |
Akinobu Mita | 933e312 | 2006-12-08 02:39:45 -0800 | [diff] [blame] | 1434 | } |
| 1435 | |
| 1436 | late_initcall(fail_page_alloc_debugfs); |
| 1437 | |
| 1438 | #endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */ |
| 1439 | |
| 1440 | #else /* CONFIG_FAIL_PAGE_ALLOC */ |
| 1441 | |
| 1442 | static inline int should_fail_alloc_page(gfp_t gfp_mask, unsigned int order) |
| 1443 | { |
| 1444 | return 0; |
| 1445 | } |
| 1446 | |
| 1447 | #endif /* CONFIG_FAIL_PAGE_ALLOC */ |
| 1448 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1449 | /* |
Mel Gorman | 88f5acf | 2011-01-13 15:45:41 -0800 | [diff] [blame] | 1450 | * Return true if free pages are above 'mark'. This takes into account the order |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1451 | * of the allocation. |
| 1452 | */ |
Mel Gorman | 88f5acf | 2011-01-13 15:45:41 -0800 | [diff] [blame] | 1453 | static bool __zone_watermark_ok(struct zone *z, int order, unsigned long mark, |
| 1454 | int classzone_idx, int alloc_flags, long free_pages) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1455 | { |
| 1456 | /* free_pages my go negative - that's OK */ |
Christoph Lameter | d23ad42 | 2007-02-10 01:43:02 -0800 | [diff] [blame] | 1457 | long min = mark; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1458 | int o; |
| 1459 | |
Mel Gorman | 88f5acf | 2011-01-13 15:45:41 -0800 | [diff] [blame] | 1460 | free_pages -= (1 << order) + 1; |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 1461 | if (alloc_flags & ALLOC_HIGH) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1462 | min -= min / 2; |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 1463 | if (alloc_flags & ALLOC_HARDER) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1464 | min -= min / 4; |
| 1465 | |
| 1466 | if (free_pages <= min + z->lowmem_reserve[classzone_idx]) |
Mel Gorman | 88f5acf | 2011-01-13 15:45:41 -0800 | [diff] [blame] | 1467 | return false; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1468 | for (o = 0; o < order; o++) { |
| 1469 | /* At the next order, this order's pages become unavailable */ |
| 1470 | free_pages -= z->free_area[o].nr_free << o; |
| 1471 | |
| 1472 | /* Require fewer higher order pages to be free */ |
| 1473 | min >>= 1; |
| 1474 | |
| 1475 | if (free_pages <= min) |
Mel Gorman | 88f5acf | 2011-01-13 15:45:41 -0800 | [diff] [blame] | 1476 | return false; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1477 | } |
Mel Gorman | 88f5acf | 2011-01-13 15:45:41 -0800 | [diff] [blame] | 1478 | return true; |
| 1479 | } |
| 1480 | |
| 1481 | bool zone_watermark_ok(struct zone *z, int order, unsigned long mark, |
| 1482 | int classzone_idx, int alloc_flags) |
| 1483 | { |
| 1484 | return __zone_watermark_ok(z, order, mark, classzone_idx, alloc_flags, |
| 1485 | zone_page_state(z, NR_FREE_PAGES)); |
| 1486 | } |
| 1487 | |
| 1488 | bool zone_watermark_ok_safe(struct zone *z, int order, unsigned long mark, |
| 1489 | int classzone_idx, int alloc_flags) |
| 1490 | { |
| 1491 | long free_pages = zone_page_state(z, NR_FREE_PAGES); |
| 1492 | |
| 1493 | if (z->percpu_drift_mark && free_pages < z->percpu_drift_mark) |
| 1494 | free_pages = zone_page_state_snapshot(z, NR_FREE_PAGES); |
| 1495 | |
| 1496 | return __zone_watermark_ok(z, order, mark, classzone_idx, alloc_flags, |
| 1497 | free_pages); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1498 | } |
| 1499 | |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 1500 | #ifdef CONFIG_NUMA |
| 1501 | /* |
| 1502 | * zlc_setup - Setup for "zonelist cache". Uses cached zone data to |
| 1503 | * skip over zones that are not allowed by the cpuset, or that have |
| 1504 | * been recently (in last second) found to be nearly full. See further |
| 1505 | * comments in mmzone.h. Reduces cache footprint of zonelist scans |
Simon Arlott | 183ff22 | 2007-10-20 01:27:18 +0200 | [diff] [blame] | 1506 | * that have to skip over a lot of full or unallowed zones. |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 1507 | * |
| 1508 | * If the zonelist cache is present in the passed in zonelist, then |
| 1509 | * returns a pointer to the allowed node mask (either the current |
Lee Schermerhorn | 37b07e4 | 2007-10-16 01:25:39 -0700 | [diff] [blame] | 1510 | * tasks mems_allowed, or node_states[N_HIGH_MEMORY].) |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 1511 | * |
| 1512 | * If the zonelist cache is not available for this zonelist, does |
| 1513 | * nothing and returns NULL. |
| 1514 | * |
| 1515 | * If the fullzones BITMAP in the zonelist cache is stale (more than |
| 1516 | * a second since last zap'd) then we zap it out (clear its bits.) |
| 1517 | * |
| 1518 | * We hold off even calling zlc_setup, until after we've checked the |
| 1519 | * first zone in the zonelist, on the theory that most allocations will |
| 1520 | * be satisfied from that first zone, so best to examine that zone as |
| 1521 | * quickly as we can. |
| 1522 | */ |
| 1523 | static nodemask_t *zlc_setup(struct zonelist *zonelist, int alloc_flags) |
| 1524 | { |
| 1525 | struct zonelist_cache *zlc; /* cached zonelist speedup info */ |
| 1526 | nodemask_t *allowednodes; /* zonelist_cache approximation */ |
| 1527 | |
| 1528 | zlc = zonelist->zlcache_ptr; |
| 1529 | if (!zlc) |
| 1530 | return NULL; |
| 1531 | |
S.Caglar Onur | f05111f | 2008-04-28 02:12:38 -0700 | [diff] [blame] | 1532 | if (time_after(jiffies, zlc->last_full_zap + HZ)) { |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 1533 | bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST); |
| 1534 | zlc->last_full_zap = jiffies; |
| 1535 | } |
| 1536 | |
| 1537 | allowednodes = !in_interrupt() && (alloc_flags & ALLOC_CPUSET) ? |
| 1538 | &cpuset_current_mems_allowed : |
Lee Schermerhorn | 37b07e4 | 2007-10-16 01:25:39 -0700 | [diff] [blame] | 1539 | &node_states[N_HIGH_MEMORY]; |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 1540 | return allowednodes; |
| 1541 | } |
| 1542 | |
| 1543 | /* |
| 1544 | * Given 'z' scanning a zonelist, run a couple of quick checks to see |
| 1545 | * if it is worth looking at further for free memory: |
| 1546 | * 1) Check that the zone isn't thought to be full (doesn't have its |
| 1547 | * bit set in the zonelist_cache fullzones BITMAP). |
| 1548 | * 2) Check that the zones node (obtained from the zonelist_cache |
| 1549 | * z_to_n[] mapping) is allowed in the passed in allowednodes mask. |
| 1550 | * Return true (non-zero) if zone is worth looking at further, or |
| 1551 | * else return false (zero) if it is not. |
| 1552 | * |
| 1553 | * This check -ignores- the distinction between various watermarks, |
| 1554 | * such as GFP_HIGH, GFP_ATOMIC, PF_MEMALLOC, ... If a zone is |
| 1555 | * found to be full for any variation of these watermarks, it will |
| 1556 | * be considered full for up to one second by all requests, unless |
| 1557 | * we are so low on memory on all allowed nodes that we are forced |
| 1558 | * into the second scan of the zonelist. |
| 1559 | * |
| 1560 | * In the second scan we ignore this zonelist cache and exactly |
| 1561 | * apply the watermarks to all zones, even it is slower to do so. |
| 1562 | * We are low on memory in the second scan, and should leave no stone |
| 1563 | * unturned looking for a free page. |
| 1564 | */ |
Mel Gorman | dd1a239 | 2008-04-28 02:12:17 -0700 | [diff] [blame] | 1565 | static int zlc_zone_worth_trying(struct zonelist *zonelist, struct zoneref *z, |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 1566 | nodemask_t *allowednodes) |
| 1567 | { |
| 1568 | struct zonelist_cache *zlc; /* cached zonelist speedup info */ |
| 1569 | int i; /* index of *z in zonelist zones */ |
| 1570 | int n; /* node that zone *z is on */ |
| 1571 | |
| 1572 | zlc = zonelist->zlcache_ptr; |
| 1573 | if (!zlc) |
| 1574 | return 1; |
| 1575 | |
Mel Gorman | dd1a239 | 2008-04-28 02:12:17 -0700 | [diff] [blame] | 1576 | i = z - zonelist->_zonerefs; |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 1577 | n = zlc->z_to_n[i]; |
| 1578 | |
| 1579 | /* This zone is worth trying if it is allowed but not full */ |
| 1580 | return node_isset(n, *allowednodes) && !test_bit(i, zlc->fullzones); |
| 1581 | } |
| 1582 | |
| 1583 | /* |
| 1584 | * Given 'z' scanning a zonelist, set the corresponding bit in |
| 1585 | * zlc->fullzones, so that subsequent attempts to allocate a page |
| 1586 | * from that zone don't waste time re-examining it. |
| 1587 | */ |
Mel Gorman | dd1a239 | 2008-04-28 02:12:17 -0700 | [diff] [blame] | 1588 | static void zlc_mark_zone_full(struct zonelist *zonelist, struct zoneref *z) |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 1589 | { |
| 1590 | struct zonelist_cache *zlc; /* cached zonelist speedup info */ |
| 1591 | int i; /* index of *z in zonelist zones */ |
| 1592 | |
| 1593 | zlc = zonelist->zlcache_ptr; |
| 1594 | if (!zlc) |
| 1595 | return; |
| 1596 | |
Mel Gorman | dd1a239 | 2008-04-28 02:12:17 -0700 | [diff] [blame] | 1597 | i = z - zonelist->_zonerefs; |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 1598 | |
| 1599 | set_bit(i, zlc->fullzones); |
| 1600 | } |
| 1601 | |
Mel Gorman | 76d3fbf | 2011-07-25 17:12:30 -0700 | [diff] [blame] | 1602 | /* |
| 1603 | * clear all zones full, called after direct reclaim makes progress so that |
| 1604 | * a zone that was recently full is not skipped over for up to a second |
| 1605 | */ |
| 1606 | static void zlc_clear_zones_full(struct zonelist *zonelist) |
| 1607 | { |
| 1608 | struct zonelist_cache *zlc; /* cached zonelist speedup info */ |
| 1609 | |
| 1610 | zlc = zonelist->zlcache_ptr; |
| 1611 | if (!zlc) |
| 1612 | return; |
| 1613 | |
| 1614 | bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST); |
| 1615 | } |
| 1616 | |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 1617 | #else /* CONFIG_NUMA */ |
| 1618 | |
| 1619 | static nodemask_t *zlc_setup(struct zonelist *zonelist, int alloc_flags) |
| 1620 | { |
| 1621 | return NULL; |
| 1622 | } |
| 1623 | |
Mel Gorman | dd1a239 | 2008-04-28 02:12:17 -0700 | [diff] [blame] | 1624 | static int zlc_zone_worth_trying(struct zonelist *zonelist, struct zoneref *z, |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 1625 | nodemask_t *allowednodes) |
| 1626 | { |
| 1627 | return 1; |
| 1628 | } |
| 1629 | |
Mel Gorman | dd1a239 | 2008-04-28 02:12:17 -0700 | [diff] [blame] | 1630 | static void zlc_mark_zone_full(struct zonelist *zonelist, struct zoneref *z) |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 1631 | { |
| 1632 | } |
Mel Gorman | 76d3fbf | 2011-07-25 17:12:30 -0700 | [diff] [blame] | 1633 | |
| 1634 | static void zlc_clear_zones_full(struct zonelist *zonelist) |
| 1635 | { |
| 1636 | } |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 1637 | #endif /* CONFIG_NUMA */ |
| 1638 | |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 1639 | /* |
Paul Jackson | 0798e51 | 2006-12-06 20:31:38 -0800 | [diff] [blame] | 1640 | * get_page_from_freelist goes through the zonelist trying to allocate |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 1641 | * a page. |
| 1642 | */ |
| 1643 | static struct page * |
Mel Gorman | 19770b3 | 2008-04-28 02:12:18 -0700 | [diff] [blame] | 1644 | get_page_from_freelist(gfp_t gfp_mask, nodemask_t *nodemask, unsigned int order, |
Mel Gorman | 5117f45 | 2009-06-16 15:31:59 -0700 | [diff] [blame] | 1645 | struct zonelist *zonelist, int high_zoneidx, int alloc_flags, |
Mel Gorman | 3dd2826 | 2009-06-16 15:32:00 -0700 | [diff] [blame] | 1646 | struct zone *preferred_zone, int migratetype) |
Martin Hicks | 753ee72 | 2005-06-21 17:14:41 -0700 | [diff] [blame] | 1647 | { |
Mel Gorman | dd1a239 | 2008-04-28 02:12:17 -0700 | [diff] [blame] | 1648 | struct zoneref *z; |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 1649 | struct page *page = NULL; |
Mel Gorman | 54a6eb5 | 2008-04-28 02:12:16 -0700 | [diff] [blame] | 1650 | int classzone_idx; |
Mel Gorman | 5117f45 | 2009-06-16 15:31:59 -0700 | [diff] [blame] | 1651 | struct zone *zone; |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 1652 | nodemask_t *allowednodes = NULL;/* zonelist_cache approximation */ |
| 1653 | int zlc_active = 0; /* set if using zonelist_cache */ |
| 1654 | int did_zlc_setup = 0; /* just call zlc_setup() one time */ |
Mel Gorman | 54a6eb5 | 2008-04-28 02:12:16 -0700 | [diff] [blame] | 1655 | |
Mel Gorman | 19770b3 | 2008-04-28 02:12:18 -0700 | [diff] [blame] | 1656 | classzone_idx = zone_idx(preferred_zone); |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 1657 | zonelist_scan: |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 1658 | /* |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 1659 | * Scan zonelist, looking for a zone with enough free. |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 1660 | * See also cpuset_zone_allowed() comment in kernel/cpuset.c. |
| 1661 | */ |
Mel Gorman | 19770b3 | 2008-04-28 02:12:18 -0700 | [diff] [blame] | 1662 | for_each_zone_zonelist_nodemask(zone, z, zonelist, |
| 1663 | high_zoneidx, nodemask) { |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 1664 | if (NUMA_BUILD && zlc_active && |
| 1665 | !zlc_zone_worth_trying(zonelist, z, allowednodes)) |
| 1666 | continue; |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 1667 | if ((alloc_flags & ALLOC_CPUSET) && |
Paul Jackson | 02a0e53 | 2006-12-13 00:34:25 -0800 | [diff] [blame] | 1668 | !cpuset_zone_allowed_softwall(zone, gfp_mask)) |
Mel Gorman | cd38b11 | 2011-07-25 17:12:29 -0700 | [diff] [blame] | 1669 | continue; |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 1670 | |
Mel Gorman | 4185896 | 2009-06-16 15:32:12 -0700 | [diff] [blame] | 1671 | BUILD_BUG_ON(ALLOC_NO_WATERMARKS < NR_WMARK); |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 1672 | if (!(alloc_flags & ALLOC_NO_WATERMARKS)) { |
Nick Piggin | 3148890 | 2005-11-28 13:44:03 -0800 | [diff] [blame] | 1673 | unsigned long mark; |
Mel Gorman | fa5e084 | 2009-06-16 15:33:22 -0700 | [diff] [blame] | 1674 | int ret; |
| 1675 | |
Mel Gorman | 4185896 | 2009-06-16 15:32:12 -0700 | [diff] [blame] | 1676 | mark = zone->watermark[alloc_flags & ALLOC_WMARK_MASK]; |
Mel Gorman | fa5e084 | 2009-06-16 15:33:22 -0700 | [diff] [blame] | 1677 | if (zone_watermark_ok(zone, order, mark, |
| 1678 | classzone_idx, alloc_flags)) |
| 1679 | goto try_this_zone; |
| 1680 | |
Mel Gorman | cd38b11 | 2011-07-25 17:12:29 -0700 | [diff] [blame] | 1681 | if (NUMA_BUILD && !did_zlc_setup && nr_online_nodes > 1) { |
| 1682 | /* |
| 1683 | * we do zlc_setup if there are multiple nodes |
| 1684 | * and before considering the first zone allowed |
| 1685 | * by the cpuset. |
| 1686 | */ |
| 1687 | allowednodes = zlc_setup(zonelist, alloc_flags); |
| 1688 | zlc_active = 1; |
| 1689 | did_zlc_setup = 1; |
| 1690 | } |
| 1691 | |
Mel Gorman | fa5e084 | 2009-06-16 15:33:22 -0700 | [diff] [blame] | 1692 | if (zone_reclaim_mode == 0) |
| 1693 | goto this_zone_full; |
| 1694 | |
Mel Gorman | cd38b11 | 2011-07-25 17:12:29 -0700 | [diff] [blame] | 1695 | /* |
| 1696 | * As we may have just activated ZLC, check if the first |
| 1697 | * eligible zone has failed zone_reclaim recently. |
| 1698 | */ |
| 1699 | if (NUMA_BUILD && zlc_active && |
| 1700 | !zlc_zone_worth_trying(zonelist, z, allowednodes)) |
| 1701 | continue; |
| 1702 | |
Mel Gorman | fa5e084 | 2009-06-16 15:33:22 -0700 | [diff] [blame] | 1703 | ret = zone_reclaim(zone, gfp_mask, order); |
| 1704 | switch (ret) { |
| 1705 | case ZONE_RECLAIM_NOSCAN: |
| 1706 | /* did not scan */ |
Mel Gorman | cd38b11 | 2011-07-25 17:12:29 -0700 | [diff] [blame] | 1707 | continue; |
Mel Gorman | fa5e084 | 2009-06-16 15:33:22 -0700 | [diff] [blame] | 1708 | case ZONE_RECLAIM_FULL: |
| 1709 | /* scanned but unreclaimable */ |
Mel Gorman | cd38b11 | 2011-07-25 17:12:29 -0700 | [diff] [blame] | 1710 | continue; |
Mel Gorman | fa5e084 | 2009-06-16 15:33:22 -0700 | [diff] [blame] | 1711 | default: |
| 1712 | /* did we reclaim enough */ |
| 1713 | if (!zone_watermark_ok(zone, order, mark, |
| 1714 | classzone_idx, alloc_flags)) |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 1715 | goto this_zone_full; |
Paul Jackson | 0798e51 | 2006-12-06 20:31:38 -0800 | [diff] [blame] | 1716 | } |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 1717 | } |
| 1718 | |
Mel Gorman | fa5e084 | 2009-06-16 15:33:22 -0700 | [diff] [blame] | 1719 | try_this_zone: |
Mel Gorman | 3dd2826 | 2009-06-16 15:32:00 -0700 | [diff] [blame] | 1720 | page = buffered_rmqueue(preferred_zone, zone, order, |
| 1721 | gfp_mask, migratetype); |
Paul Jackson | 0798e51 | 2006-12-06 20:31:38 -0800 | [diff] [blame] | 1722 | if (page) |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 1723 | break; |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 1724 | this_zone_full: |
| 1725 | if (NUMA_BUILD) |
| 1726 | zlc_mark_zone_full(zonelist, z); |
Mel Gorman | 54a6eb5 | 2008-04-28 02:12:16 -0700 | [diff] [blame] | 1727 | } |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 1728 | |
| 1729 | if (unlikely(NUMA_BUILD && page == NULL && zlc_active)) { |
| 1730 | /* Disable zlc cache for second zonelist scan */ |
| 1731 | zlc_active = 0; |
| 1732 | goto zonelist_scan; |
| 1733 | } |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 1734 | return page; |
Martin Hicks | 753ee72 | 2005-06-21 17:14:41 -0700 | [diff] [blame] | 1735 | } |
| 1736 | |
David Rientjes | 29423e77 | 2011-03-22 16:30:47 -0700 | [diff] [blame] | 1737 | /* |
| 1738 | * Large machines with many possible nodes should not always dump per-node |
| 1739 | * meminfo in irq context. |
| 1740 | */ |
| 1741 | static inline bool should_suppress_show_mem(void) |
| 1742 | { |
| 1743 | bool ret = false; |
| 1744 | |
| 1745 | #if NODES_SHIFT > 8 |
| 1746 | ret = in_interrupt(); |
| 1747 | #endif |
| 1748 | return ret; |
| 1749 | } |
| 1750 | |
Dave Hansen | a238ab5 | 2011-05-24 17:12:16 -0700 | [diff] [blame] | 1751 | static DEFINE_RATELIMIT_STATE(nopage_rs, |
| 1752 | DEFAULT_RATELIMIT_INTERVAL, |
| 1753 | DEFAULT_RATELIMIT_BURST); |
| 1754 | |
| 1755 | void warn_alloc_failed(gfp_t gfp_mask, int order, const char *fmt, ...) |
| 1756 | { |
Dave Hansen | a238ab5 | 2011-05-24 17:12:16 -0700 | [diff] [blame] | 1757 | unsigned int filter = SHOW_MEM_FILTER_NODES; |
| 1758 | |
| 1759 | if ((gfp_mask & __GFP_NOWARN) || !__ratelimit(&nopage_rs)) |
| 1760 | return; |
| 1761 | |
| 1762 | /* |
| 1763 | * This documents exceptions given to allocations in certain |
| 1764 | * contexts that are allowed to allocate outside current's set |
| 1765 | * of allowed nodes. |
| 1766 | */ |
| 1767 | if (!(gfp_mask & __GFP_NOMEMALLOC)) |
| 1768 | if (test_thread_flag(TIF_MEMDIE) || |
| 1769 | (current->flags & (PF_MEMALLOC | PF_EXITING))) |
| 1770 | filter &= ~SHOW_MEM_FILTER_NODES; |
| 1771 | if (in_interrupt() || !(gfp_mask & __GFP_WAIT)) |
| 1772 | filter &= ~SHOW_MEM_FILTER_NODES; |
| 1773 | |
| 1774 | if (fmt) { |
Joe Perches | 3ee9a4f | 2011-10-31 17:08:35 -0700 | [diff] [blame] | 1775 | struct va_format vaf; |
| 1776 | va_list args; |
| 1777 | |
Dave Hansen | a238ab5 | 2011-05-24 17:12:16 -0700 | [diff] [blame] | 1778 | va_start(args, fmt); |
Joe Perches | 3ee9a4f | 2011-10-31 17:08:35 -0700 | [diff] [blame] | 1779 | |
| 1780 | vaf.fmt = fmt; |
| 1781 | vaf.va = &args; |
| 1782 | |
| 1783 | pr_warn("%pV", &vaf); |
| 1784 | |
Dave Hansen | a238ab5 | 2011-05-24 17:12:16 -0700 | [diff] [blame] | 1785 | va_end(args); |
| 1786 | } |
| 1787 | |
Joe Perches | 3ee9a4f | 2011-10-31 17:08:35 -0700 | [diff] [blame] | 1788 | pr_warn("%s: page allocation failure: order:%d, mode:0x%x\n", |
| 1789 | current->comm, order, gfp_mask); |
Dave Hansen | a238ab5 | 2011-05-24 17:12:16 -0700 | [diff] [blame] | 1790 | |
| 1791 | dump_stack(); |
| 1792 | if (!should_suppress_show_mem()) |
| 1793 | show_mem(filter); |
| 1794 | } |
| 1795 | |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 1796 | static inline int |
| 1797 | should_alloc_retry(gfp_t gfp_mask, unsigned int order, |
| 1798 | unsigned long pages_reclaimed) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1799 | { |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 1800 | /* Do not loop if specifically requested */ |
| 1801 | if (gfp_mask & __GFP_NORETRY) |
| 1802 | return 0; |
| 1803 | |
| 1804 | /* |
| 1805 | * In this implementation, order <= PAGE_ALLOC_COSTLY_ORDER |
| 1806 | * means __GFP_NOFAIL, but that may not be true in other |
| 1807 | * implementations. |
| 1808 | */ |
| 1809 | if (order <= PAGE_ALLOC_COSTLY_ORDER) |
| 1810 | return 1; |
| 1811 | |
| 1812 | /* |
| 1813 | * For order > PAGE_ALLOC_COSTLY_ORDER, if __GFP_REPEAT is |
| 1814 | * specified, then we retry until we no longer reclaim any pages |
| 1815 | * (above), or we've reclaimed an order of pages at least as |
| 1816 | * large as the allocation's order. In both cases, if the |
| 1817 | * allocation still fails, we stop retrying. |
| 1818 | */ |
| 1819 | if (gfp_mask & __GFP_REPEAT && pages_reclaimed < (1 << order)) |
| 1820 | return 1; |
| 1821 | |
| 1822 | /* |
| 1823 | * Don't let big-order allocations loop unless the caller |
| 1824 | * explicitly requests that. |
| 1825 | */ |
| 1826 | if (gfp_mask & __GFP_NOFAIL) |
| 1827 | return 1; |
| 1828 | |
| 1829 | return 0; |
| 1830 | } |
| 1831 | |
| 1832 | static inline struct page * |
| 1833 | __alloc_pages_may_oom(gfp_t gfp_mask, unsigned int order, |
| 1834 | struct zonelist *zonelist, enum zone_type high_zoneidx, |
Mel Gorman | 3dd2826 | 2009-06-16 15:32:00 -0700 | [diff] [blame] | 1835 | nodemask_t *nodemask, struct zone *preferred_zone, |
| 1836 | int migratetype) |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 1837 | { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1838 | struct page *page; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1839 | |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 1840 | /* Acquire the OOM killer lock for the zones in zonelist */ |
Minchan Kim | ff321fe | 2010-08-09 17:18:57 -0700 | [diff] [blame] | 1841 | if (!try_set_zonelist_oom(zonelist, gfp_mask)) { |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 1842 | schedule_timeout_uninterruptible(1); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1843 | return NULL; |
| 1844 | } |
Jens Axboe | 6b1de91 | 2005-11-17 21:35:02 +0100 | [diff] [blame] | 1845 | |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 1846 | /* |
| 1847 | * Go through the zonelist yet one more time, keep very high watermark |
| 1848 | * here, this is only to catch a parallel oom killing, we must fail if |
| 1849 | * we're still under heavy pressure. |
| 1850 | */ |
| 1851 | page = get_page_from_freelist(gfp_mask|__GFP_HARDWALL, nodemask, |
| 1852 | order, zonelist, high_zoneidx, |
Mel Gorman | 5117f45 | 2009-06-16 15:31:59 -0700 | [diff] [blame] | 1853 | ALLOC_WMARK_HIGH|ALLOC_CPUSET, |
Mel Gorman | 3dd2826 | 2009-06-16 15:32:00 -0700 | [diff] [blame] | 1854 | preferred_zone, migratetype); |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 1855 | if (page) |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 1856 | goto out; |
| 1857 | |
KAMEZAWA Hiroyuki | 4365a56 | 2009-12-15 16:45:33 -0800 | [diff] [blame] | 1858 | if (!(gfp_mask & __GFP_NOFAIL)) { |
| 1859 | /* The OOM killer will not help higher order allocs */ |
| 1860 | if (order > PAGE_ALLOC_COSTLY_ORDER) |
| 1861 | goto out; |
David Rientjes | 03668b3 | 2010-08-09 17:18:54 -0700 | [diff] [blame] | 1862 | /* The OOM killer does not needlessly kill tasks for lowmem */ |
| 1863 | if (high_zoneidx < ZONE_NORMAL) |
| 1864 | goto out; |
KAMEZAWA Hiroyuki | 4365a56 | 2009-12-15 16:45:33 -0800 | [diff] [blame] | 1865 | /* |
| 1866 | * GFP_THISNODE contains __GFP_NORETRY and we never hit this. |
| 1867 | * Sanity check for bare calls of __GFP_THISNODE, not real OOM. |
| 1868 | * The caller should handle page allocation failure by itself if |
| 1869 | * it specifies __GFP_THISNODE. |
| 1870 | * Note: Hugepage uses it but will hit PAGE_ALLOC_COSTLY_ORDER. |
| 1871 | */ |
| 1872 | if (gfp_mask & __GFP_THISNODE) |
| 1873 | goto out; |
| 1874 | } |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 1875 | /* Exhausted what can be done so it's blamo time */ |
KAMEZAWA Hiroyuki | 4365a56 | 2009-12-15 16:45:33 -0800 | [diff] [blame] | 1876 | out_of_memory(zonelist, gfp_mask, order, nodemask); |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 1877 | |
| 1878 | out: |
| 1879 | clear_zonelist_oom(zonelist, gfp_mask); |
| 1880 | return page; |
| 1881 | } |
| 1882 | |
Mel Gorman | 56de726 | 2010-05-24 14:32:30 -0700 | [diff] [blame] | 1883 | #ifdef CONFIG_COMPACTION |
| 1884 | /* Try memory compaction for high-order allocations before reclaim */ |
| 1885 | static struct page * |
| 1886 | __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order, |
| 1887 | struct zonelist *zonelist, enum zone_type high_zoneidx, |
| 1888 | nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone, |
Mel Gorman | 77f1fe6 | 2011-01-13 15:45:57 -0800 | [diff] [blame] | 1889 | int migratetype, unsigned long *did_some_progress, |
| 1890 | bool sync_migration) |
Mel Gorman | 56de726 | 2010-05-24 14:32:30 -0700 | [diff] [blame] | 1891 | { |
| 1892 | struct page *page; |
| 1893 | |
Mel Gorman | 4f92e25 | 2010-05-24 14:32:32 -0700 | [diff] [blame] | 1894 | if (!order || compaction_deferred(preferred_zone)) |
Mel Gorman | 56de726 | 2010-05-24 14:32:30 -0700 | [diff] [blame] | 1895 | return NULL; |
| 1896 | |
Andrew Morton | c06b1fc | 2011-01-13 15:47:32 -0800 | [diff] [blame] | 1897 | current->flags |= PF_MEMALLOC; |
Mel Gorman | 56de726 | 2010-05-24 14:32:30 -0700 | [diff] [blame] | 1898 | *did_some_progress = try_to_compact_pages(zonelist, order, gfp_mask, |
Mel Gorman | 77f1fe6 | 2011-01-13 15:45:57 -0800 | [diff] [blame] | 1899 | nodemask, sync_migration); |
Andrew Morton | c06b1fc | 2011-01-13 15:47:32 -0800 | [diff] [blame] | 1900 | current->flags &= ~PF_MEMALLOC; |
Mel Gorman | 56de726 | 2010-05-24 14:32:30 -0700 | [diff] [blame] | 1901 | if (*did_some_progress != COMPACT_SKIPPED) { |
| 1902 | |
| 1903 | /* Page migration frees to the PCP lists but we want merging */ |
| 1904 | drain_pages(get_cpu()); |
| 1905 | put_cpu(); |
| 1906 | |
| 1907 | page = get_page_from_freelist(gfp_mask, nodemask, |
| 1908 | order, zonelist, high_zoneidx, |
| 1909 | alloc_flags, preferred_zone, |
| 1910 | migratetype); |
| 1911 | if (page) { |
Mel Gorman | 4f92e25 | 2010-05-24 14:32:32 -0700 | [diff] [blame] | 1912 | preferred_zone->compact_considered = 0; |
| 1913 | preferred_zone->compact_defer_shift = 0; |
Mel Gorman | 56de726 | 2010-05-24 14:32:30 -0700 | [diff] [blame] | 1914 | count_vm_event(COMPACTSUCCESS); |
| 1915 | return page; |
| 1916 | } |
| 1917 | |
| 1918 | /* |
| 1919 | * It's bad if compaction run occurs and fails. |
| 1920 | * The most likely reason is that pages exist, |
| 1921 | * but not enough to satisfy watermarks. |
| 1922 | */ |
| 1923 | count_vm_event(COMPACTFAIL); |
Mel Gorman | 4f92e25 | 2010-05-24 14:32:32 -0700 | [diff] [blame] | 1924 | defer_compaction(preferred_zone); |
Mel Gorman | 56de726 | 2010-05-24 14:32:30 -0700 | [diff] [blame] | 1925 | |
| 1926 | cond_resched(); |
| 1927 | } |
| 1928 | |
| 1929 | return NULL; |
| 1930 | } |
| 1931 | #else |
| 1932 | static inline struct page * |
| 1933 | __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order, |
| 1934 | struct zonelist *zonelist, enum zone_type high_zoneidx, |
| 1935 | nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone, |
Mel Gorman | 77f1fe6 | 2011-01-13 15:45:57 -0800 | [diff] [blame] | 1936 | int migratetype, unsigned long *did_some_progress, |
| 1937 | bool sync_migration) |
Mel Gorman | 56de726 | 2010-05-24 14:32:30 -0700 | [diff] [blame] | 1938 | { |
| 1939 | return NULL; |
| 1940 | } |
| 1941 | #endif /* CONFIG_COMPACTION */ |
| 1942 | |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 1943 | /* The really slow allocator path where we enter direct reclaim */ |
| 1944 | static inline struct page * |
| 1945 | __alloc_pages_direct_reclaim(gfp_t gfp_mask, unsigned int order, |
| 1946 | struct zonelist *zonelist, enum zone_type high_zoneidx, |
Mel Gorman | 5117f45 | 2009-06-16 15:31:59 -0700 | [diff] [blame] | 1947 | nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone, |
Mel Gorman | 3dd2826 | 2009-06-16 15:32:00 -0700 | [diff] [blame] | 1948 | int migratetype, unsigned long *did_some_progress) |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 1949 | { |
| 1950 | struct page *page = NULL; |
| 1951 | struct reclaim_state reclaim_state; |
Mel Gorman | 9ee493c | 2010-09-09 16:38:18 -0700 | [diff] [blame] | 1952 | bool drained = false; |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 1953 | |
| 1954 | cond_resched(); |
| 1955 | |
| 1956 | /* We now go into synchronous reclaim */ |
| 1957 | cpuset_memory_pressure_bump(); |
Andrew Morton | c06b1fc | 2011-01-13 15:47:32 -0800 | [diff] [blame] | 1958 | current->flags |= PF_MEMALLOC; |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 1959 | lockdep_set_current_reclaim_state(gfp_mask); |
| 1960 | reclaim_state.reclaimed_slab = 0; |
Andrew Morton | c06b1fc | 2011-01-13 15:47:32 -0800 | [diff] [blame] | 1961 | current->reclaim_state = &reclaim_state; |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 1962 | |
| 1963 | *did_some_progress = try_to_free_pages(zonelist, order, gfp_mask, nodemask); |
| 1964 | |
Andrew Morton | c06b1fc | 2011-01-13 15:47:32 -0800 | [diff] [blame] | 1965 | current->reclaim_state = NULL; |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 1966 | lockdep_clear_current_reclaim_state(); |
Andrew Morton | c06b1fc | 2011-01-13 15:47:32 -0800 | [diff] [blame] | 1967 | current->flags &= ~PF_MEMALLOC; |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 1968 | |
| 1969 | cond_resched(); |
| 1970 | |
Mel Gorman | 9ee493c | 2010-09-09 16:38:18 -0700 | [diff] [blame] | 1971 | if (unlikely(!(*did_some_progress))) |
| 1972 | return NULL; |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 1973 | |
Mel Gorman | 76d3fbf | 2011-07-25 17:12:30 -0700 | [diff] [blame] | 1974 | /* After successful reclaim, reconsider all zones for allocation */ |
| 1975 | if (NUMA_BUILD) |
| 1976 | zlc_clear_zones_full(zonelist); |
| 1977 | |
Mel Gorman | 9ee493c | 2010-09-09 16:38:18 -0700 | [diff] [blame] | 1978 | retry: |
| 1979 | page = get_page_from_freelist(gfp_mask, nodemask, order, |
Mel Gorman | 5117f45 | 2009-06-16 15:31:59 -0700 | [diff] [blame] | 1980 | zonelist, high_zoneidx, |
Mel Gorman | 3dd2826 | 2009-06-16 15:32:00 -0700 | [diff] [blame] | 1981 | alloc_flags, preferred_zone, |
| 1982 | migratetype); |
Mel Gorman | 9ee493c | 2010-09-09 16:38:18 -0700 | [diff] [blame] | 1983 | |
| 1984 | /* |
| 1985 | * If an allocation failed after direct reclaim, it could be because |
| 1986 | * pages are pinned on the per-cpu lists. Drain them and try again |
| 1987 | */ |
| 1988 | if (!page && !drained) { |
| 1989 | drain_all_pages(); |
| 1990 | drained = true; |
| 1991 | goto retry; |
| 1992 | } |
| 1993 | |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 1994 | return page; |
| 1995 | } |
| 1996 | |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 1997 | /* |
| 1998 | * This is called in the allocator slow-path if the allocation request is of |
| 1999 | * sufficient urgency to ignore watermarks and take other desperate measures |
| 2000 | */ |
| 2001 | static inline struct page * |
| 2002 | __alloc_pages_high_priority(gfp_t gfp_mask, unsigned int order, |
| 2003 | struct zonelist *zonelist, enum zone_type high_zoneidx, |
Mel Gorman | 3dd2826 | 2009-06-16 15:32:00 -0700 | [diff] [blame] | 2004 | nodemask_t *nodemask, struct zone *preferred_zone, |
| 2005 | int migratetype) |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2006 | { |
| 2007 | struct page *page; |
| 2008 | |
| 2009 | do { |
| 2010 | page = get_page_from_freelist(gfp_mask, nodemask, order, |
Mel Gorman | 5117f45 | 2009-06-16 15:31:59 -0700 | [diff] [blame] | 2011 | zonelist, high_zoneidx, ALLOC_NO_WATERMARKS, |
Mel Gorman | 3dd2826 | 2009-06-16 15:32:00 -0700 | [diff] [blame] | 2012 | preferred_zone, migratetype); |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2013 | |
| 2014 | if (!page && gfp_mask & __GFP_NOFAIL) |
Mel Gorman | 0e093d99 | 2010-10-26 14:21:45 -0700 | [diff] [blame] | 2015 | wait_iff_congested(preferred_zone, BLK_RW_ASYNC, HZ/50); |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2016 | } while (!page && (gfp_mask & __GFP_NOFAIL)); |
| 2017 | |
| 2018 | return page; |
| 2019 | } |
| 2020 | |
| 2021 | static inline |
| 2022 | void wake_all_kswapd(unsigned int order, struct zonelist *zonelist, |
Mel Gorman | 9950474 | 2011-01-13 15:46:20 -0800 | [diff] [blame] | 2023 | enum zone_type high_zoneidx, |
| 2024 | enum zone_type classzone_idx) |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2025 | { |
| 2026 | struct zoneref *z; |
| 2027 | struct zone *zone; |
| 2028 | |
| 2029 | for_each_zone_zonelist(zone, z, zonelist, high_zoneidx) |
Mel Gorman | 9950474 | 2011-01-13 15:46:20 -0800 | [diff] [blame] | 2030 | wakeup_kswapd(zone, order, classzone_idx); |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2031 | } |
| 2032 | |
Peter Zijlstra | 341ce06 | 2009-06-16 15:32:02 -0700 | [diff] [blame] | 2033 | static inline int |
| 2034 | gfp_to_alloc_flags(gfp_t gfp_mask) |
| 2035 | { |
Peter Zijlstra | 341ce06 | 2009-06-16 15:32:02 -0700 | [diff] [blame] | 2036 | int alloc_flags = ALLOC_WMARK_MIN | ALLOC_CPUSET; |
| 2037 | const gfp_t wait = gfp_mask & __GFP_WAIT; |
| 2038 | |
Mel Gorman | a56f57f | 2009-06-16 15:32:02 -0700 | [diff] [blame] | 2039 | /* __GFP_HIGH is assumed to be the same as ALLOC_HIGH to save a branch. */ |
Namhyung Kim | e6223a3 | 2010-10-26 14:21:59 -0700 | [diff] [blame] | 2040 | BUILD_BUG_ON(__GFP_HIGH != (__force gfp_t) ALLOC_HIGH); |
Mel Gorman | a56f57f | 2009-06-16 15:32:02 -0700 | [diff] [blame] | 2041 | |
Peter Zijlstra | 341ce06 | 2009-06-16 15:32:02 -0700 | [diff] [blame] | 2042 | /* |
| 2043 | * The caller may dip into page reserves a bit more if the caller |
| 2044 | * cannot run direct reclaim, or if the caller has realtime scheduling |
| 2045 | * policy or is asking for __GFP_HIGH memory. GFP_ATOMIC requests will |
| 2046 | * set both ALLOC_HARDER (!wait) and ALLOC_HIGH (__GFP_HIGH). |
| 2047 | */ |
Namhyung Kim | e6223a3 | 2010-10-26 14:21:59 -0700 | [diff] [blame] | 2048 | alloc_flags |= (__force int) (gfp_mask & __GFP_HIGH); |
Peter Zijlstra | 341ce06 | 2009-06-16 15:32:02 -0700 | [diff] [blame] | 2049 | |
| 2050 | if (!wait) { |
Andrea Arcangeli | 5c3240d | 2011-01-13 15:46:49 -0800 | [diff] [blame] | 2051 | /* |
| 2052 | * Not worth trying to allocate harder for |
| 2053 | * __GFP_NOMEMALLOC even if it can't schedule. |
| 2054 | */ |
| 2055 | if (!(gfp_mask & __GFP_NOMEMALLOC)) |
| 2056 | alloc_flags |= ALLOC_HARDER; |
Peter Zijlstra | 341ce06 | 2009-06-16 15:32:02 -0700 | [diff] [blame] | 2057 | /* |
| 2058 | * Ignore cpuset if GFP_ATOMIC (!wait) rather than fail alloc. |
| 2059 | * See also cpuset_zone_allowed() comment in kernel/cpuset.c. |
| 2060 | */ |
| 2061 | alloc_flags &= ~ALLOC_CPUSET; |
Andrew Morton | c06b1fc | 2011-01-13 15:47:32 -0800 | [diff] [blame] | 2062 | } else if (unlikely(rt_task(current)) && !in_interrupt()) |
Peter Zijlstra | 341ce06 | 2009-06-16 15:32:02 -0700 | [diff] [blame] | 2063 | alloc_flags |= ALLOC_HARDER; |
| 2064 | |
| 2065 | if (likely(!(gfp_mask & __GFP_NOMEMALLOC))) { |
| 2066 | if (!in_interrupt() && |
Andrew Morton | c06b1fc | 2011-01-13 15:47:32 -0800 | [diff] [blame] | 2067 | ((current->flags & PF_MEMALLOC) || |
Peter Zijlstra | 341ce06 | 2009-06-16 15:32:02 -0700 | [diff] [blame] | 2068 | unlikely(test_thread_flag(TIF_MEMDIE)))) |
| 2069 | alloc_flags |= ALLOC_NO_WATERMARKS; |
| 2070 | } |
| 2071 | |
| 2072 | return alloc_flags; |
| 2073 | } |
| 2074 | |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2075 | static inline struct page * |
| 2076 | __alloc_pages_slowpath(gfp_t gfp_mask, unsigned int order, |
| 2077 | struct zonelist *zonelist, enum zone_type high_zoneidx, |
Mel Gorman | 3dd2826 | 2009-06-16 15:32:00 -0700 | [diff] [blame] | 2078 | nodemask_t *nodemask, struct zone *preferred_zone, |
| 2079 | int migratetype) |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2080 | { |
| 2081 | const gfp_t wait = gfp_mask & __GFP_WAIT; |
| 2082 | struct page *page = NULL; |
| 2083 | int alloc_flags; |
| 2084 | unsigned long pages_reclaimed = 0; |
| 2085 | unsigned long did_some_progress; |
Mel Gorman | 77f1fe6 | 2011-01-13 15:45:57 -0800 | [diff] [blame] | 2086 | bool sync_migration = false; |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 2087 | |
Christoph Lameter | 952f3b5 | 2006-12-06 20:33:26 -0800 | [diff] [blame] | 2088 | /* |
Mel Gorman | 72807a7 | 2009-06-16 15:32:18 -0700 | [diff] [blame] | 2089 | * In the slowpath, we sanity check order to avoid ever trying to |
| 2090 | * reclaim >= MAX_ORDER areas which will never succeed. Callers may |
| 2091 | * be using allocators in order of preference for an area that is |
| 2092 | * too large. |
| 2093 | */ |
Mel Gorman | 1fc28b7 | 2009-07-29 15:04:08 -0700 | [diff] [blame] | 2094 | if (order >= MAX_ORDER) { |
| 2095 | WARN_ON_ONCE(!(gfp_mask & __GFP_NOWARN)); |
Mel Gorman | 72807a7 | 2009-06-16 15:32:18 -0700 | [diff] [blame] | 2096 | return NULL; |
Mel Gorman | 1fc28b7 | 2009-07-29 15:04:08 -0700 | [diff] [blame] | 2097 | } |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 2098 | |
Christoph Lameter | 952f3b5 | 2006-12-06 20:33:26 -0800 | [diff] [blame] | 2099 | /* |
| 2100 | * GFP_THISNODE (meaning __GFP_THISNODE, __GFP_NORETRY and |
| 2101 | * __GFP_NOWARN set) should not cause reclaim since the subsystem |
| 2102 | * (f.e. slab) using GFP_THISNODE may choose to trigger reclaim |
| 2103 | * using a larger set of nodes after it has established that the |
| 2104 | * allowed per node queues are empty and that nodes are |
| 2105 | * over allocated. |
| 2106 | */ |
| 2107 | if (NUMA_BUILD && (gfp_mask & GFP_THISNODE) == GFP_THISNODE) |
| 2108 | goto nopage; |
| 2109 | |
Mel Gorman | cc4a685 | 2009-11-11 14:26:14 -0800 | [diff] [blame] | 2110 | restart: |
Andrea Arcangeli | 32dba98 | 2011-01-13 15:46:49 -0800 | [diff] [blame] | 2111 | if (!(gfp_mask & __GFP_NO_KSWAPD)) |
| 2112 | wake_all_kswapd(order, zonelist, high_zoneidx, |
Mel Gorman | 9950474 | 2011-01-13 15:46:20 -0800 | [diff] [blame] | 2113 | zone_idx(preferred_zone)); |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 2114 | |
Paul Jackson | 9bf2229 | 2005-09-06 15:18:12 -0700 | [diff] [blame] | 2115 | /* |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 2116 | * OK, we're below the kswapd watermark and have kicked background |
| 2117 | * reclaim. Now things get more complex, so set up alloc_flags according |
| 2118 | * to how we want to proceed. |
Paul Jackson | 9bf2229 | 2005-09-06 15:18:12 -0700 | [diff] [blame] | 2119 | */ |
Peter Zijlstra | 341ce06 | 2009-06-16 15:32:02 -0700 | [diff] [blame] | 2120 | alloc_flags = gfp_to_alloc_flags(gfp_mask); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2121 | |
David Rientjes | f33261d | 2011-01-25 15:07:20 -0800 | [diff] [blame] | 2122 | /* |
| 2123 | * Find the true preferred zone if the allocation is unconstrained by |
| 2124 | * cpusets. |
| 2125 | */ |
| 2126 | if (!(alloc_flags & ALLOC_CPUSET) && !nodemask) |
| 2127 | first_zones_zonelist(zonelist, high_zoneidx, NULL, |
| 2128 | &preferred_zone); |
| 2129 | |
Andrew Barry | cfa54a0 | 2011-05-24 17:12:52 -0700 | [diff] [blame] | 2130 | rebalance: |
Peter Zijlstra | 341ce06 | 2009-06-16 15:32:02 -0700 | [diff] [blame] | 2131 | /* This is the last chance, in general, before the goto nopage. */ |
Mel Gorman | 19770b3 | 2008-04-28 02:12:18 -0700 | [diff] [blame] | 2132 | page = get_page_from_freelist(gfp_mask, nodemask, order, zonelist, |
Peter Zijlstra | 341ce06 | 2009-06-16 15:32:02 -0700 | [diff] [blame] | 2133 | high_zoneidx, alloc_flags & ~ALLOC_NO_WATERMARKS, |
| 2134 | preferred_zone, migratetype); |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 2135 | if (page) |
| 2136 | goto got_pg; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2137 | |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2138 | /* Allocate without watermarks if the context allows */ |
Peter Zijlstra | 341ce06 | 2009-06-16 15:32:02 -0700 | [diff] [blame] | 2139 | if (alloc_flags & ALLOC_NO_WATERMARKS) { |
| 2140 | page = __alloc_pages_high_priority(gfp_mask, order, |
| 2141 | zonelist, high_zoneidx, nodemask, |
| 2142 | preferred_zone, migratetype); |
| 2143 | if (page) |
| 2144 | goto got_pg; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2145 | } |
| 2146 | |
| 2147 | /* Atomic allocations - we can't balance anything */ |
| 2148 | if (!wait) |
| 2149 | goto nopage; |
| 2150 | |
Peter Zijlstra | 341ce06 | 2009-06-16 15:32:02 -0700 | [diff] [blame] | 2151 | /* Avoid recursion of direct reclaim */ |
Andrew Morton | c06b1fc | 2011-01-13 15:47:32 -0800 | [diff] [blame] | 2152 | if (current->flags & PF_MEMALLOC) |
Peter Zijlstra | 341ce06 | 2009-06-16 15:32:02 -0700 | [diff] [blame] | 2153 | goto nopage; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2154 | |
David Rientjes | 6583bb6 | 2009-07-29 15:02:06 -0700 | [diff] [blame] | 2155 | /* Avoid allocations with no watermarks from looping endlessly */ |
| 2156 | if (test_thread_flag(TIF_MEMDIE) && !(gfp_mask & __GFP_NOFAIL)) |
| 2157 | goto nopage; |
| 2158 | |
Mel Gorman | 77f1fe6 | 2011-01-13 15:45:57 -0800 | [diff] [blame] | 2159 | /* |
| 2160 | * Try direct compaction. The first pass is asynchronous. Subsequent |
| 2161 | * attempts after direct reclaim are synchronous |
| 2162 | */ |
Mel Gorman | 56de726 | 2010-05-24 14:32:30 -0700 | [diff] [blame] | 2163 | page = __alloc_pages_direct_compact(gfp_mask, order, |
| 2164 | zonelist, high_zoneidx, |
| 2165 | nodemask, |
| 2166 | alloc_flags, preferred_zone, |
Mel Gorman | 77f1fe6 | 2011-01-13 15:45:57 -0800 | [diff] [blame] | 2167 | migratetype, &did_some_progress, |
| 2168 | sync_migration); |
Mel Gorman | 56de726 | 2010-05-24 14:32:30 -0700 | [diff] [blame] | 2169 | if (page) |
| 2170 | goto got_pg; |
Andrea Arcangeli | c6a140b | 2011-05-24 17:11:38 -0700 | [diff] [blame] | 2171 | sync_migration = true; |
Mel Gorman | 56de726 | 2010-05-24 14:32:30 -0700 | [diff] [blame] | 2172 | |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2173 | /* Try direct reclaim and then allocating */ |
| 2174 | page = __alloc_pages_direct_reclaim(gfp_mask, order, |
| 2175 | zonelist, high_zoneidx, |
| 2176 | nodemask, |
Mel Gorman | 5117f45 | 2009-06-16 15:31:59 -0700 | [diff] [blame] | 2177 | alloc_flags, preferred_zone, |
Mel Gorman | 3dd2826 | 2009-06-16 15:32:00 -0700 | [diff] [blame] | 2178 | migratetype, &did_some_progress); |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2179 | if (page) |
| 2180 | goto got_pg; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2181 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2182 | /* |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2183 | * If we failed to make any progress reclaiming, then we are |
| 2184 | * running out of options and have to consider going OOM |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2185 | */ |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2186 | if (!did_some_progress) { |
| 2187 | if ((gfp_mask & __GFP_FS) && !(gfp_mask & __GFP_NORETRY)) { |
Rafael J. Wysocki | 7f33d49 | 2009-06-16 15:32:41 -0700 | [diff] [blame] | 2188 | if (oom_killer_disabled) |
| 2189 | goto nopage; |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2190 | page = __alloc_pages_may_oom(gfp_mask, order, |
| 2191 | zonelist, high_zoneidx, |
Mel Gorman | 3dd2826 | 2009-06-16 15:32:00 -0700 | [diff] [blame] | 2192 | nodemask, preferred_zone, |
| 2193 | migratetype); |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2194 | if (page) |
| 2195 | goto got_pg; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2196 | |
David Rientjes | 03668b3 | 2010-08-09 17:18:54 -0700 | [diff] [blame] | 2197 | if (!(gfp_mask & __GFP_NOFAIL)) { |
| 2198 | /* |
| 2199 | * The oom killer is not called for high-order |
| 2200 | * allocations that may fail, so if no progress |
| 2201 | * is being made, there are no other options and |
| 2202 | * retrying is unlikely to help. |
| 2203 | */ |
| 2204 | if (order > PAGE_ALLOC_COSTLY_ORDER) |
| 2205 | goto nopage; |
| 2206 | /* |
| 2207 | * The oom killer is not called for lowmem |
| 2208 | * allocations to prevent needlessly killing |
| 2209 | * innocent tasks. |
| 2210 | */ |
| 2211 | if (high_zoneidx < ZONE_NORMAL) |
| 2212 | goto nopage; |
| 2213 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2214 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2215 | goto restart; |
| 2216 | } |
| 2217 | } |
| 2218 | |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2219 | /* Check if we should retry the allocation */ |
Nishanth Aravamudan | a41f24e | 2008-04-29 00:58:25 -0700 | [diff] [blame] | 2220 | pages_reclaimed += did_some_progress; |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2221 | if (should_alloc_retry(gfp_mask, order, pages_reclaimed)) { |
| 2222 | /* Wait for some write requests to complete then retry */ |
Mel Gorman | 0e093d99 | 2010-10-26 14:21:45 -0700 | [diff] [blame] | 2223 | wait_iff_congested(preferred_zone, BLK_RW_ASYNC, HZ/50); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2224 | goto rebalance; |
Mel Gorman | 3e7d344 | 2011-01-13 15:45:56 -0800 | [diff] [blame] | 2225 | } else { |
| 2226 | /* |
| 2227 | * High-order allocations do not necessarily loop after |
| 2228 | * direct reclaim and reclaim/compaction depends on compaction |
| 2229 | * being called after reclaim so call directly if necessary |
| 2230 | */ |
| 2231 | page = __alloc_pages_direct_compact(gfp_mask, order, |
| 2232 | zonelist, high_zoneidx, |
| 2233 | nodemask, |
| 2234 | alloc_flags, preferred_zone, |
Mel Gorman | 77f1fe6 | 2011-01-13 15:45:57 -0800 | [diff] [blame] | 2235 | migratetype, &did_some_progress, |
| 2236 | sync_migration); |
Mel Gorman | 3e7d344 | 2011-01-13 15:45:56 -0800 | [diff] [blame] | 2237 | if (page) |
| 2238 | goto got_pg; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2239 | } |
| 2240 | |
| 2241 | nopage: |
Dave Hansen | a238ab5 | 2011-05-24 17:12:16 -0700 | [diff] [blame] | 2242 | warn_alloc_failed(gfp_mask, order, NULL); |
Vegard Nossum | b1eeab6 | 2008-11-25 16:55:53 +0100 | [diff] [blame] | 2243 | return page; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2244 | got_pg: |
Vegard Nossum | b1eeab6 | 2008-11-25 16:55:53 +0100 | [diff] [blame] | 2245 | if (kmemcheck_enabled) |
| 2246 | kmemcheck_pagealloc_alloc(page, order, gfp_mask); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2247 | return page; |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2248 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2249 | } |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2250 | |
| 2251 | /* |
| 2252 | * This is the 'heart' of the zoned buddy allocator. |
| 2253 | */ |
| 2254 | struct page * |
| 2255 | __alloc_pages_nodemask(gfp_t gfp_mask, unsigned int order, |
| 2256 | struct zonelist *zonelist, nodemask_t *nodemask) |
| 2257 | { |
| 2258 | enum zone_type high_zoneidx = gfp_zone(gfp_mask); |
Mel Gorman | 5117f45 | 2009-06-16 15:31:59 -0700 | [diff] [blame] | 2259 | struct zone *preferred_zone; |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2260 | struct page *page; |
Mel Gorman | 3dd2826 | 2009-06-16 15:32:00 -0700 | [diff] [blame] | 2261 | int migratetype = allocflags_to_migratetype(gfp_mask); |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2262 | |
Benjamin Herrenschmidt | dcce284 | 2009-06-18 13:24:12 +1000 | [diff] [blame] | 2263 | gfp_mask &= gfp_allowed_mask; |
| 2264 | |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2265 | lockdep_trace_alloc(gfp_mask); |
| 2266 | |
| 2267 | might_sleep_if(gfp_mask & __GFP_WAIT); |
| 2268 | |
| 2269 | if (should_fail_alloc_page(gfp_mask, order)) |
| 2270 | return NULL; |
| 2271 | |
| 2272 | /* |
| 2273 | * Check the zones suitable for the gfp_mask contain at least one |
| 2274 | * valid zone. It's possible to have an empty zonelist as a result |
| 2275 | * of GFP_THISNODE and a memoryless node |
| 2276 | */ |
| 2277 | if (unlikely(!zonelist->_zonerefs->zone)) |
| 2278 | return NULL; |
| 2279 | |
Miao Xie | c0ff745 | 2010-05-24 14:32:08 -0700 | [diff] [blame] | 2280 | get_mems_allowed(); |
Mel Gorman | 5117f45 | 2009-06-16 15:31:59 -0700 | [diff] [blame] | 2281 | /* The preferred zone is used for statistics later */ |
David Rientjes | f33261d | 2011-01-25 15:07:20 -0800 | [diff] [blame] | 2282 | first_zones_zonelist(zonelist, high_zoneidx, |
| 2283 | nodemask ? : &cpuset_current_mems_allowed, |
| 2284 | &preferred_zone); |
Miao Xie | c0ff745 | 2010-05-24 14:32:08 -0700 | [diff] [blame] | 2285 | if (!preferred_zone) { |
| 2286 | put_mems_allowed(); |
Mel Gorman | 5117f45 | 2009-06-16 15:31:59 -0700 | [diff] [blame] | 2287 | return NULL; |
Miao Xie | c0ff745 | 2010-05-24 14:32:08 -0700 | [diff] [blame] | 2288 | } |
Mel Gorman | 5117f45 | 2009-06-16 15:31:59 -0700 | [diff] [blame] | 2289 | |
| 2290 | /* First allocation attempt */ |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2291 | page = get_page_from_freelist(gfp_mask|__GFP_HARDWALL, nodemask, order, |
Mel Gorman | 5117f45 | 2009-06-16 15:31:59 -0700 | [diff] [blame] | 2292 | zonelist, high_zoneidx, ALLOC_WMARK_LOW|ALLOC_CPUSET, |
Mel Gorman | 3dd2826 | 2009-06-16 15:32:00 -0700 | [diff] [blame] | 2293 | preferred_zone, migratetype); |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2294 | if (unlikely(!page)) |
| 2295 | page = __alloc_pages_slowpath(gfp_mask, order, |
Mel Gorman | 5117f45 | 2009-06-16 15:31:59 -0700 | [diff] [blame] | 2296 | zonelist, high_zoneidx, nodemask, |
Mel Gorman | 3dd2826 | 2009-06-16 15:32:00 -0700 | [diff] [blame] | 2297 | preferred_zone, migratetype); |
Miao Xie | c0ff745 | 2010-05-24 14:32:08 -0700 | [diff] [blame] | 2298 | put_mems_allowed(); |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2299 | |
Mel Gorman | 4b4f278 | 2009-09-21 17:02:41 -0700 | [diff] [blame] | 2300 | trace_mm_page_alloc(page, order, gfp_mask, migratetype); |
Mel Gorman | 11e33f6 | 2009-06-16 15:31:57 -0700 | [diff] [blame] | 2301 | return page; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2302 | } |
Mel Gorman | d239171 | 2009-06-16 15:31:52 -0700 | [diff] [blame] | 2303 | EXPORT_SYMBOL(__alloc_pages_nodemask); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2304 | |
| 2305 | /* |
| 2306 | * Common helper functions. |
| 2307 | */ |
Harvey Harrison | 920c7a5 | 2008-02-04 22:29:26 -0800 | [diff] [blame] | 2308 | unsigned long __get_free_pages(gfp_t gfp_mask, unsigned int order) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2309 | { |
Akinobu Mita | 945a111 | 2009-09-21 17:01:47 -0700 | [diff] [blame] | 2310 | struct page *page; |
| 2311 | |
| 2312 | /* |
| 2313 | * __get_free_pages() returns a 32-bit address, which cannot represent |
| 2314 | * a highmem page |
| 2315 | */ |
| 2316 | VM_BUG_ON((gfp_mask & __GFP_HIGHMEM) != 0); |
| 2317 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2318 | page = alloc_pages(gfp_mask, order); |
| 2319 | if (!page) |
| 2320 | return 0; |
| 2321 | return (unsigned long) page_address(page); |
| 2322 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2323 | EXPORT_SYMBOL(__get_free_pages); |
| 2324 | |
Harvey Harrison | 920c7a5 | 2008-02-04 22:29:26 -0800 | [diff] [blame] | 2325 | unsigned long get_zeroed_page(gfp_t gfp_mask) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2326 | { |
Akinobu Mita | 945a111 | 2009-09-21 17:01:47 -0700 | [diff] [blame] | 2327 | return __get_free_pages(gfp_mask | __GFP_ZERO, 0); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2328 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2329 | EXPORT_SYMBOL(get_zeroed_page); |
| 2330 | |
| 2331 | void __pagevec_free(struct pagevec *pvec) |
| 2332 | { |
| 2333 | int i = pagevec_count(pvec); |
| 2334 | |
Mel Gorman | 4b4f278 | 2009-09-21 17:02:41 -0700 | [diff] [blame] | 2335 | while (--i >= 0) { |
| 2336 | trace_mm_pagevec_free(pvec->pages[i], pvec->cold); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2337 | free_hot_cold_page(pvec->pages[i], pvec->cold); |
Mel Gorman | 4b4f278 | 2009-09-21 17:02:41 -0700 | [diff] [blame] | 2338 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2339 | } |
| 2340 | |
Harvey Harrison | 920c7a5 | 2008-02-04 22:29:26 -0800 | [diff] [blame] | 2341 | void __free_pages(struct page *page, unsigned int order) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2342 | { |
Nick Piggin | b581003 | 2005-10-29 18:16:12 -0700 | [diff] [blame] | 2343 | if (put_page_testzero(page)) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2344 | if (order == 0) |
Li Hong | fc91668 | 2010-03-05 13:41:54 -0800 | [diff] [blame] | 2345 | free_hot_cold_page(page, 0); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2346 | else |
| 2347 | __free_pages_ok(page, order); |
| 2348 | } |
| 2349 | } |
| 2350 | |
| 2351 | EXPORT_SYMBOL(__free_pages); |
| 2352 | |
Harvey Harrison | 920c7a5 | 2008-02-04 22:29:26 -0800 | [diff] [blame] | 2353 | void free_pages(unsigned long addr, unsigned int order) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2354 | { |
| 2355 | if (addr != 0) { |
Nick Piggin | 725d704 | 2006-09-25 23:30:55 -0700 | [diff] [blame] | 2356 | VM_BUG_ON(!virt_addr_valid((void *)addr)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2357 | __free_pages(virt_to_page((void *)addr), order); |
| 2358 | } |
| 2359 | } |
| 2360 | |
| 2361 | EXPORT_SYMBOL(free_pages); |
| 2362 | |
Andi Kleen | ee85c2e | 2011-05-11 15:13:34 -0700 | [diff] [blame] | 2363 | static void *make_alloc_exact(unsigned long addr, unsigned order, size_t size) |
| 2364 | { |
| 2365 | if (addr) { |
| 2366 | unsigned long alloc_end = addr + (PAGE_SIZE << order); |
| 2367 | unsigned long used = addr + PAGE_ALIGN(size); |
| 2368 | |
| 2369 | split_page(virt_to_page((void *)addr), order); |
| 2370 | while (used < alloc_end) { |
| 2371 | free_page(used); |
| 2372 | used += PAGE_SIZE; |
| 2373 | } |
| 2374 | } |
| 2375 | return (void *)addr; |
| 2376 | } |
| 2377 | |
Timur Tabi | 2be0ffe | 2008-07-23 21:28:11 -0700 | [diff] [blame] | 2378 | /** |
| 2379 | * alloc_pages_exact - allocate an exact number physically-contiguous pages. |
| 2380 | * @size: the number of bytes to allocate |
| 2381 | * @gfp_mask: GFP flags for the allocation |
| 2382 | * |
| 2383 | * This function is similar to alloc_pages(), except that it allocates the |
| 2384 | * minimum number of pages to satisfy the request. alloc_pages() can only |
| 2385 | * allocate memory in power-of-two pages. |
| 2386 | * |
| 2387 | * This function is also limited by MAX_ORDER. |
| 2388 | * |
| 2389 | * Memory allocated by this function must be released by free_pages_exact(). |
| 2390 | */ |
| 2391 | void *alloc_pages_exact(size_t size, gfp_t gfp_mask) |
| 2392 | { |
| 2393 | unsigned int order = get_order(size); |
| 2394 | unsigned long addr; |
| 2395 | |
| 2396 | addr = __get_free_pages(gfp_mask, order); |
Andi Kleen | ee85c2e | 2011-05-11 15:13:34 -0700 | [diff] [blame] | 2397 | return make_alloc_exact(addr, order, size); |
Timur Tabi | 2be0ffe | 2008-07-23 21:28:11 -0700 | [diff] [blame] | 2398 | } |
| 2399 | EXPORT_SYMBOL(alloc_pages_exact); |
| 2400 | |
| 2401 | /** |
Andi Kleen | ee85c2e | 2011-05-11 15:13:34 -0700 | [diff] [blame] | 2402 | * alloc_pages_exact_nid - allocate an exact number of physically-contiguous |
| 2403 | * pages on a node. |
Randy Dunlap | b5e6ab5 | 2011-05-16 13:16:54 -0700 | [diff] [blame] | 2404 | * @nid: the preferred node ID where memory should be allocated |
Andi Kleen | ee85c2e | 2011-05-11 15:13:34 -0700 | [diff] [blame] | 2405 | * @size: the number of bytes to allocate |
| 2406 | * @gfp_mask: GFP flags for the allocation |
| 2407 | * |
| 2408 | * Like alloc_pages_exact(), but try to allocate on node nid first before falling |
| 2409 | * back. |
| 2410 | * Note this is not alloc_pages_exact_node() which allocates on a specific node, |
| 2411 | * but is not exact. |
| 2412 | */ |
| 2413 | void *alloc_pages_exact_nid(int nid, size_t size, gfp_t gfp_mask) |
| 2414 | { |
| 2415 | unsigned order = get_order(size); |
| 2416 | struct page *p = alloc_pages_node(nid, gfp_mask, order); |
| 2417 | if (!p) |
| 2418 | return NULL; |
| 2419 | return make_alloc_exact((unsigned long)page_address(p), order, size); |
| 2420 | } |
| 2421 | EXPORT_SYMBOL(alloc_pages_exact_nid); |
| 2422 | |
| 2423 | /** |
Timur Tabi | 2be0ffe | 2008-07-23 21:28:11 -0700 | [diff] [blame] | 2424 | * free_pages_exact - release memory allocated via alloc_pages_exact() |
| 2425 | * @virt: the value returned by alloc_pages_exact. |
| 2426 | * @size: size of allocation, same value as passed to alloc_pages_exact(). |
| 2427 | * |
| 2428 | * Release the memory allocated by a previous call to alloc_pages_exact. |
| 2429 | */ |
| 2430 | void free_pages_exact(void *virt, size_t size) |
| 2431 | { |
| 2432 | unsigned long addr = (unsigned long)virt; |
| 2433 | unsigned long end = addr + PAGE_ALIGN(size); |
| 2434 | |
| 2435 | while (addr < end) { |
| 2436 | free_page(addr); |
| 2437 | addr += PAGE_SIZE; |
| 2438 | } |
| 2439 | } |
| 2440 | EXPORT_SYMBOL(free_pages_exact); |
| 2441 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2442 | static unsigned int nr_free_zone_pages(int offset) |
| 2443 | { |
Mel Gorman | dd1a239 | 2008-04-28 02:12:17 -0700 | [diff] [blame] | 2444 | struct zoneref *z; |
Mel Gorman | 54a6eb5 | 2008-04-28 02:12:16 -0700 | [diff] [blame] | 2445 | struct zone *zone; |
| 2446 | |
Martin J. Bligh | e310fd4 | 2005-07-29 22:59:18 -0700 | [diff] [blame] | 2447 | /* Just pick one node, since fallback list is circular */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2448 | unsigned int sum = 0; |
| 2449 | |
Mel Gorman | 0e88460 | 2008-04-28 02:12:14 -0700 | [diff] [blame] | 2450 | struct zonelist *zonelist = node_zonelist(numa_node_id(), GFP_KERNEL); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2451 | |
Mel Gorman | 54a6eb5 | 2008-04-28 02:12:16 -0700 | [diff] [blame] | 2452 | for_each_zone_zonelist(zone, z, zonelist, offset) { |
Martin J. Bligh | e310fd4 | 2005-07-29 22:59:18 -0700 | [diff] [blame] | 2453 | unsigned long size = zone->present_pages; |
Mel Gorman | 4185896 | 2009-06-16 15:32:12 -0700 | [diff] [blame] | 2454 | unsigned long high = high_wmark_pages(zone); |
Martin J. Bligh | e310fd4 | 2005-07-29 22:59:18 -0700 | [diff] [blame] | 2455 | if (size > high) |
| 2456 | sum += size - high; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2457 | } |
| 2458 | |
| 2459 | return sum; |
| 2460 | } |
| 2461 | |
| 2462 | /* |
| 2463 | * Amount of free RAM allocatable within ZONE_DMA and ZONE_NORMAL |
| 2464 | */ |
| 2465 | unsigned int nr_free_buffer_pages(void) |
| 2466 | { |
Al Viro | af4ca45 | 2005-10-21 02:55:38 -0400 | [diff] [blame] | 2467 | return nr_free_zone_pages(gfp_zone(GFP_USER)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2468 | } |
Meelap Shah | c2f1a55 | 2007-07-17 04:04:39 -0700 | [diff] [blame] | 2469 | EXPORT_SYMBOL_GPL(nr_free_buffer_pages); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2470 | |
| 2471 | /* |
| 2472 | * Amount of free RAM allocatable within all zones |
| 2473 | */ |
| 2474 | unsigned int nr_free_pagecache_pages(void) |
| 2475 | { |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 2476 | return nr_free_zone_pages(gfp_zone(GFP_HIGHUSER_MOVABLE)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2477 | } |
Christoph Lameter | 08e0f6a | 2006-09-27 01:50:06 -0700 | [diff] [blame] | 2478 | |
| 2479 | static inline void show_node(struct zone *zone) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2480 | { |
Christoph Lameter | 08e0f6a | 2006-09-27 01:50:06 -0700 | [diff] [blame] | 2481 | if (NUMA_BUILD) |
Andy Whitcroft | 25ba77c | 2006-12-06 20:33:03 -0800 | [diff] [blame] | 2482 | printk("Node %d ", zone_to_nid(zone)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2483 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2484 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2485 | void si_meminfo(struct sysinfo *val) |
| 2486 | { |
| 2487 | val->totalram = totalram_pages; |
| 2488 | val->sharedram = 0; |
Christoph Lameter | d23ad42 | 2007-02-10 01:43:02 -0800 | [diff] [blame] | 2489 | val->freeram = global_page_state(NR_FREE_PAGES); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2490 | val->bufferram = nr_blockdev_pages(); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2491 | val->totalhigh = totalhigh_pages; |
| 2492 | val->freehigh = nr_free_highpages(); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2493 | val->mem_unit = PAGE_SIZE; |
| 2494 | } |
| 2495 | |
| 2496 | EXPORT_SYMBOL(si_meminfo); |
| 2497 | |
| 2498 | #ifdef CONFIG_NUMA |
| 2499 | void si_meminfo_node(struct sysinfo *val, int nid) |
| 2500 | { |
| 2501 | pg_data_t *pgdat = NODE_DATA(nid); |
| 2502 | |
| 2503 | val->totalram = pgdat->node_present_pages; |
Christoph Lameter | d23ad42 | 2007-02-10 01:43:02 -0800 | [diff] [blame] | 2504 | val->freeram = node_page_state(nid, NR_FREE_PAGES); |
Christoph Lameter | 98d2b0e | 2006-09-25 23:31:12 -0700 | [diff] [blame] | 2505 | #ifdef CONFIG_HIGHMEM |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2506 | val->totalhigh = pgdat->node_zones[ZONE_HIGHMEM].present_pages; |
Christoph Lameter | d23ad42 | 2007-02-10 01:43:02 -0800 | [diff] [blame] | 2507 | val->freehigh = zone_page_state(&pgdat->node_zones[ZONE_HIGHMEM], |
| 2508 | NR_FREE_PAGES); |
Christoph Lameter | 98d2b0e | 2006-09-25 23:31:12 -0700 | [diff] [blame] | 2509 | #else |
| 2510 | val->totalhigh = 0; |
| 2511 | val->freehigh = 0; |
| 2512 | #endif |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2513 | val->mem_unit = PAGE_SIZE; |
| 2514 | } |
| 2515 | #endif |
| 2516 | |
David Rientjes | ddd588b | 2011-03-22 16:30:46 -0700 | [diff] [blame] | 2517 | /* |
David Rientjes | 7bf02ea | 2011-05-24 17:11:16 -0700 | [diff] [blame] | 2518 | * Determine whether the node should be displayed or not, depending on whether |
| 2519 | * SHOW_MEM_FILTER_NODES was passed to show_free_areas(). |
David Rientjes | ddd588b | 2011-03-22 16:30:46 -0700 | [diff] [blame] | 2520 | */ |
David Rientjes | 7bf02ea | 2011-05-24 17:11:16 -0700 | [diff] [blame] | 2521 | bool skip_free_areas_node(unsigned int flags, int nid) |
David Rientjes | ddd588b | 2011-03-22 16:30:46 -0700 | [diff] [blame] | 2522 | { |
| 2523 | bool ret = false; |
| 2524 | |
| 2525 | if (!(flags & SHOW_MEM_FILTER_NODES)) |
| 2526 | goto out; |
| 2527 | |
| 2528 | get_mems_allowed(); |
David Rientjes | 7bf02ea | 2011-05-24 17:11:16 -0700 | [diff] [blame] | 2529 | ret = !node_isset(nid, cpuset_current_mems_allowed); |
David Rientjes | ddd588b | 2011-03-22 16:30:46 -0700 | [diff] [blame] | 2530 | put_mems_allowed(); |
| 2531 | out: |
| 2532 | return ret; |
| 2533 | } |
| 2534 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2535 | #define K(x) ((x) << (PAGE_SHIFT-10)) |
| 2536 | |
| 2537 | /* |
| 2538 | * Show free area list (used inside shift_scroll-lock stuff) |
| 2539 | * We also calculate the percentage fragmentation. We do this by counting the |
| 2540 | * memory on each free list with the exception of the first item on the list. |
David Rientjes | ddd588b | 2011-03-22 16:30:46 -0700 | [diff] [blame] | 2541 | * Suppresses nodes that are not allowed by current's cpuset if |
| 2542 | * SHOW_MEM_FILTER_NODES is passed. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2543 | */ |
David Rientjes | 7bf02ea | 2011-05-24 17:11:16 -0700 | [diff] [blame] | 2544 | void show_free_areas(unsigned int filter) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2545 | { |
Jes Sorensen | c724191 | 2006-09-27 01:50:05 -0700 | [diff] [blame] | 2546 | int cpu; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2547 | struct zone *zone; |
| 2548 | |
KOSAKI Motohiro | ee99c71 | 2009-03-31 15:19:31 -0700 | [diff] [blame] | 2549 | for_each_populated_zone(zone) { |
David Rientjes | 7bf02ea | 2011-05-24 17:11:16 -0700 | [diff] [blame] | 2550 | if (skip_free_areas_node(filter, zone_to_nid(zone))) |
David Rientjes | ddd588b | 2011-03-22 16:30:46 -0700 | [diff] [blame] | 2551 | continue; |
Jes Sorensen | c724191 | 2006-09-27 01:50:05 -0700 | [diff] [blame] | 2552 | show_node(zone); |
| 2553 | printk("%s per-cpu:\n", zone->name); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2554 | |
Dave Jones | 6b482c6 | 2005-11-10 15:45:56 -0500 | [diff] [blame] | 2555 | for_each_online_cpu(cpu) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2556 | struct per_cpu_pageset *pageset; |
| 2557 | |
Christoph Lameter | 99dcc3e | 2010-01-05 15:34:51 +0900 | [diff] [blame] | 2558 | pageset = per_cpu_ptr(zone->pageset, cpu); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2559 | |
Christoph Lameter | 3dfa572 | 2008-02-04 22:29:19 -0800 | [diff] [blame] | 2560 | printk("CPU %4d: hi:%5d, btch:%4d usd:%4d\n", |
| 2561 | cpu, pageset->pcp.high, |
| 2562 | pageset->pcp.batch, pageset->pcp.count); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2563 | } |
| 2564 | } |
| 2565 | |
KOSAKI Motohiro | a731286 | 2009-09-21 17:01:37 -0700 | [diff] [blame] | 2566 | printk("active_anon:%lu inactive_anon:%lu isolated_anon:%lu\n" |
| 2567 | " active_file:%lu inactive_file:%lu isolated_file:%lu\n" |
Lee Schermerhorn | 7b85412 | 2008-10-18 20:26:40 -0700 | [diff] [blame] | 2568 | " unevictable:%lu" |
Andrew Morton | b76146e | 2009-10-26 16:49:52 -0700 | [diff] [blame] | 2569 | " dirty:%lu writeback:%lu unstable:%lu\n" |
KOSAKI Motohiro | 3701b03 | 2009-09-21 17:01:29 -0700 | [diff] [blame] | 2570 | " free:%lu slab_reclaimable:%lu slab_unreclaimable:%lu\n" |
KOSAKI Motohiro | 4b02108 | 2009-09-21 17:01:33 -0700 | [diff] [blame] | 2571 | " mapped:%lu shmem:%lu pagetables:%lu bounce:%lu\n", |
Rik van Riel | 4f98a2f | 2008-10-18 20:26:32 -0700 | [diff] [blame] | 2572 | global_page_state(NR_ACTIVE_ANON), |
Rik van Riel | 4f98a2f | 2008-10-18 20:26:32 -0700 | [diff] [blame] | 2573 | global_page_state(NR_INACTIVE_ANON), |
KOSAKI Motohiro | a731286 | 2009-09-21 17:01:37 -0700 | [diff] [blame] | 2574 | global_page_state(NR_ISOLATED_ANON), |
| 2575 | global_page_state(NR_ACTIVE_FILE), |
Rik van Riel | 4f98a2f | 2008-10-18 20:26:32 -0700 | [diff] [blame] | 2576 | global_page_state(NR_INACTIVE_FILE), |
KOSAKI Motohiro | a731286 | 2009-09-21 17:01:37 -0700 | [diff] [blame] | 2577 | global_page_state(NR_ISOLATED_FILE), |
Lee Schermerhorn | 7b85412 | 2008-10-18 20:26:40 -0700 | [diff] [blame] | 2578 | global_page_state(NR_UNEVICTABLE), |
Christoph Lameter | b1e7a8f | 2006-06-30 01:55:39 -0700 | [diff] [blame] | 2579 | global_page_state(NR_FILE_DIRTY), |
Christoph Lameter | ce866b3 | 2006-06-30 01:55:40 -0700 | [diff] [blame] | 2580 | global_page_state(NR_WRITEBACK), |
Christoph Lameter | fd39fc8 | 2006-06-30 01:55:40 -0700 | [diff] [blame] | 2581 | global_page_state(NR_UNSTABLE_NFS), |
Christoph Lameter | d23ad42 | 2007-02-10 01:43:02 -0800 | [diff] [blame] | 2582 | global_page_state(NR_FREE_PAGES), |
KOSAKI Motohiro | 3701b03 | 2009-09-21 17:01:29 -0700 | [diff] [blame] | 2583 | global_page_state(NR_SLAB_RECLAIMABLE), |
| 2584 | global_page_state(NR_SLAB_UNRECLAIMABLE), |
Christoph Lameter | 65ba55f | 2006-06-30 01:55:34 -0700 | [diff] [blame] | 2585 | global_page_state(NR_FILE_MAPPED), |
KOSAKI Motohiro | 4b02108 | 2009-09-21 17:01:33 -0700 | [diff] [blame] | 2586 | global_page_state(NR_SHMEM), |
Andrew Morton | a25700a | 2007-02-08 14:20:40 -0800 | [diff] [blame] | 2587 | global_page_state(NR_PAGETABLE), |
| 2588 | global_page_state(NR_BOUNCE)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2589 | |
KOSAKI Motohiro | ee99c71 | 2009-03-31 15:19:31 -0700 | [diff] [blame] | 2590 | for_each_populated_zone(zone) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2591 | int i; |
| 2592 | |
David Rientjes | 7bf02ea | 2011-05-24 17:11:16 -0700 | [diff] [blame] | 2593 | if (skip_free_areas_node(filter, zone_to_nid(zone))) |
David Rientjes | ddd588b | 2011-03-22 16:30:46 -0700 | [diff] [blame] | 2594 | continue; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2595 | show_node(zone); |
| 2596 | printk("%s" |
| 2597 | " free:%lukB" |
| 2598 | " min:%lukB" |
| 2599 | " low:%lukB" |
| 2600 | " high:%lukB" |
Rik van Riel | 4f98a2f | 2008-10-18 20:26:32 -0700 | [diff] [blame] | 2601 | " active_anon:%lukB" |
| 2602 | " inactive_anon:%lukB" |
| 2603 | " active_file:%lukB" |
| 2604 | " inactive_file:%lukB" |
Lee Schermerhorn | 7b85412 | 2008-10-18 20:26:40 -0700 | [diff] [blame] | 2605 | " unevictable:%lukB" |
KOSAKI Motohiro | a731286 | 2009-09-21 17:01:37 -0700 | [diff] [blame] | 2606 | " isolated(anon):%lukB" |
| 2607 | " isolated(file):%lukB" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2608 | " present:%lukB" |
KOSAKI Motohiro | 4a0aa73 | 2009-09-21 17:01:30 -0700 | [diff] [blame] | 2609 | " mlocked:%lukB" |
| 2610 | " dirty:%lukB" |
| 2611 | " writeback:%lukB" |
| 2612 | " mapped:%lukB" |
KOSAKI Motohiro | 4b02108 | 2009-09-21 17:01:33 -0700 | [diff] [blame] | 2613 | " shmem:%lukB" |
KOSAKI Motohiro | 4a0aa73 | 2009-09-21 17:01:30 -0700 | [diff] [blame] | 2614 | " slab_reclaimable:%lukB" |
| 2615 | " slab_unreclaimable:%lukB" |
KOSAKI Motohiro | c6a7f57 | 2009-09-21 17:01:32 -0700 | [diff] [blame] | 2616 | " kernel_stack:%lukB" |
KOSAKI Motohiro | 4a0aa73 | 2009-09-21 17:01:30 -0700 | [diff] [blame] | 2617 | " pagetables:%lukB" |
| 2618 | " unstable:%lukB" |
| 2619 | " bounce:%lukB" |
| 2620 | " writeback_tmp:%lukB" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2621 | " pages_scanned:%lu" |
| 2622 | " all_unreclaimable? %s" |
| 2623 | "\n", |
| 2624 | zone->name, |
Mel Gorman | 88f5acf | 2011-01-13 15:45:41 -0800 | [diff] [blame] | 2625 | K(zone_page_state(zone, NR_FREE_PAGES)), |
Mel Gorman | 4185896 | 2009-06-16 15:32:12 -0700 | [diff] [blame] | 2626 | K(min_wmark_pages(zone)), |
| 2627 | K(low_wmark_pages(zone)), |
| 2628 | K(high_wmark_pages(zone)), |
Rik van Riel | 4f98a2f | 2008-10-18 20:26:32 -0700 | [diff] [blame] | 2629 | K(zone_page_state(zone, NR_ACTIVE_ANON)), |
| 2630 | K(zone_page_state(zone, NR_INACTIVE_ANON)), |
| 2631 | K(zone_page_state(zone, NR_ACTIVE_FILE)), |
| 2632 | K(zone_page_state(zone, NR_INACTIVE_FILE)), |
Lee Schermerhorn | 7b85412 | 2008-10-18 20:26:40 -0700 | [diff] [blame] | 2633 | K(zone_page_state(zone, NR_UNEVICTABLE)), |
KOSAKI Motohiro | a731286 | 2009-09-21 17:01:37 -0700 | [diff] [blame] | 2634 | K(zone_page_state(zone, NR_ISOLATED_ANON)), |
| 2635 | K(zone_page_state(zone, NR_ISOLATED_FILE)), |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2636 | K(zone->present_pages), |
KOSAKI Motohiro | 4a0aa73 | 2009-09-21 17:01:30 -0700 | [diff] [blame] | 2637 | K(zone_page_state(zone, NR_MLOCK)), |
| 2638 | K(zone_page_state(zone, NR_FILE_DIRTY)), |
| 2639 | K(zone_page_state(zone, NR_WRITEBACK)), |
| 2640 | K(zone_page_state(zone, NR_FILE_MAPPED)), |
KOSAKI Motohiro | 4b02108 | 2009-09-21 17:01:33 -0700 | [diff] [blame] | 2641 | K(zone_page_state(zone, NR_SHMEM)), |
KOSAKI Motohiro | 4a0aa73 | 2009-09-21 17:01:30 -0700 | [diff] [blame] | 2642 | K(zone_page_state(zone, NR_SLAB_RECLAIMABLE)), |
| 2643 | K(zone_page_state(zone, NR_SLAB_UNRECLAIMABLE)), |
KOSAKI Motohiro | c6a7f57 | 2009-09-21 17:01:32 -0700 | [diff] [blame] | 2644 | zone_page_state(zone, NR_KERNEL_STACK) * |
| 2645 | THREAD_SIZE / 1024, |
KOSAKI Motohiro | 4a0aa73 | 2009-09-21 17:01:30 -0700 | [diff] [blame] | 2646 | K(zone_page_state(zone, NR_PAGETABLE)), |
| 2647 | K(zone_page_state(zone, NR_UNSTABLE_NFS)), |
| 2648 | K(zone_page_state(zone, NR_BOUNCE)), |
| 2649 | K(zone_page_state(zone, NR_WRITEBACK_TEMP)), |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2650 | zone->pages_scanned, |
KOSAKI Motohiro | 93e4a89 | 2010-03-05 13:41:55 -0800 | [diff] [blame] | 2651 | (zone->all_unreclaimable ? "yes" : "no") |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2652 | ); |
| 2653 | printk("lowmem_reserve[]:"); |
| 2654 | for (i = 0; i < MAX_NR_ZONES; i++) |
| 2655 | printk(" %lu", zone->lowmem_reserve[i]); |
| 2656 | printk("\n"); |
| 2657 | } |
| 2658 | |
KOSAKI Motohiro | ee99c71 | 2009-03-31 15:19:31 -0700 | [diff] [blame] | 2659 | for_each_populated_zone(zone) { |
Kirill Korotaev | 8f9de51 | 2006-06-23 02:03:50 -0700 | [diff] [blame] | 2660 | unsigned long nr[MAX_ORDER], flags, order, total = 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2661 | |
David Rientjes | 7bf02ea | 2011-05-24 17:11:16 -0700 | [diff] [blame] | 2662 | if (skip_free_areas_node(filter, zone_to_nid(zone))) |
David Rientjes | ddd588b | 2011-03-22 16:30:46 -0700 | [diff] [blame] | 2663 | continue; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2664 | show_node(zone); |
| 2665 | printk("%s: ", zone->name); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2666 | |
| 2667 | spin_lock_irqsave(&zone->lock, flags); |
| 2668 | for (order = 0; order < MAX_ORDER; order++) { |
Kirill Korotaev | 8f9de51 | 2006-06-23 02:03:50 -0700 | [diff] [blame] | 2669 | nr[order] = zone->free_area[order].nr_free; |
| 2670 | total += nr[order] << order; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2671 | } |
| 2672 | spin_unlock_irqrestore(&zone->lock, flags); |
Kirill Korotaev | 8f9de51 | 2006-06-23 02:03:50 -0700 | [diff] [blame] | 2673 | for (order = 0; order < MAX_ORDER; order++) |
| 2674 | printk("%lu*%lukB ", nr[order], K(1UL) << order); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2675 | printk("= %lukB\n", K(total)); |
| 2676 | } |
| 2677 | |
Larry Woodman | e6f3602 | 2008-02-04 22:29:30 -0800 | [diff] [blame] | 2678 | printk("%ld total pagecache pages\n", global_page_state(NR_FILE_PAGES)); |
| 2679 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2680 | show_swap_cache_info(); |
| 2681 | } |
| 2682 | |
Mel Gorman | 19770b3 | 2008-04-28 02:12:18 -0700 | [diff] [blame] | 2683 | static void zoneref_set_zone(struct zone *zone, struct zoneref *zoneref) |
| 2684 | { |
| 2685 | zoneref->zone = zone; |
| 2686 | zoneref->zone_idx = zone_idx(zone); |
| 2687 | } |
| 2688 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2689 | /* |
| 2690 | * Builds allocation fallback zone lists. |
Christoph Lameter | 1a93205 | 2006-01-06 00:11:16 -0800 | [diff] [blame] | 2691 | * |
| 2692 | * Add all populated zones of a node to the zonelist. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2693 | */ |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2694 | static int build_zonelists_node(pg_data_t *pgdat, struct zonelist *zonelist, |
| 2695 | int nr_zones, enum zone_type zone_type) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2696 | { |
Christoph Lameter | 1a93205 | 2006-01-06 00:11:16 -0800 | [diff] [blame] | 2697 | struct zone *zone; |
| 2698 | |
Christoph Lameter | 98d2b0e | 2006-09-25 23:31:12 -0700 | [diff] [blame] | 2699 | BUG_ON(zone_type >= MAX_NR_ZONES); |
Christoph Lameter | 2f6726e | 2006-09-25 23:31:18 -0700 | [diff] [blame] | 2700 | zone_type++; |
Christoph Lameter | 02a68a5 | 2006-01-06 00:11:18 -0800 | [diff] [blame] | 2701 | |
| 2702 | do { |
Christoph Lameter | 2f6726e | 2006-09-25 23:31:18 -0700 | [diff] [blame] | 2703 | zone_type--; |
Christoph Lameter | 070f803 | 2006-01-06 00:11:19 -0800 | [diff] [blame] | 2704 | zone = pgdat->node_zones + zone_type; |
Christoph Lameter | 1a93205 | 2006-01-06 00:11:16 -0800 | [diff] [blame] | 2705 | if (populated_zone(zone)) { |
Mel Gorman | dd1a239 | 2008-04-28 02:12:17 -0700 | [diff] [blame] | 2706 | zoneref_set_zone(zone, |
| 2707 | &zonelist->_zonerefs[nr_zones++]); |
Christoph Lameter | 070f803 | 2006-01-06 00:11:19 -0800 | [diff] [blame] | 2708 | check_highest_zone(zone_type); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2709 | } |
Christoph Lameter | 02a68a5 | 2006-01-06 00:11:18 -0800 | [diff] [blame] | 2710 | |
Christoph Lameter | 2f6726e | 2006-09-25 23:31:18 -0700 | [diff] [blame] | 2711 | } while (zone_type); |
Christoph Lameter | 070f803 | 2006-01-06 00:11:19 -0800 | [diff] [blame] | 2712 | return nr_zones; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2713 | } |
| 2714 | |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2715 | |
| 2716 | /* |
| 2717 | * zonelist_order: |
| 2718 | * 0 = automatic detection of better ordering. |
| 2719 | * 1 = order by ([node] distance, -zonetype) |
| 2720 | * 2 = order by (-zonetype, [node] distance) |
| 2721 | * |
| 2722 | * If not NUMA, ZONELIST_ORDER_ZONE and ZONELIST_ORDER_NODE will create |
| 2723 | * the same zonelist. So only NUMA can configure this param. |
| 2724 | */ |
| 2725 | #define ZONELIST_ORDER_DEFAULT 0 |
| 2726 | #define ZONELIST_ORDER_NODE 1 |
| 2727 | #define ZONELIST_ORDER_ZONE 2 |
| 2728 | |
| 2729 | /* zonelist order in the kernel. |
| 2730 | * set_zonelist_order() will set this to NODE or ZONE. |
| 2731 | */ |
| 2732 | static int current_zonelist_order = ZONELIST_ORDER_DEFAULT; |
| 2733 | static char zonelist_order_name[3][8] = {"Default", "Node", "Zone"}; |
| 2734 | |
| 2735 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2736 | #ifdef CONFIG_NUMA |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2737 | /* The value user specified ....changed by config */ |
| 2738 | static int user_zonelist_order = ZONELIST_ORDER_DEFAULT; |
| 2739 | /* string for sysctl */ |
| 2740 | #define NUMA_ZONELIST_ORDER_LEN 16 |
| 2741 | char numa_zonelist_order[16] = "default"; |
| 2742 | |
| 2743 | /* |
| 2744 | * interface for configure zonelist ordering. |
| 2745 | * command line option "numa_zonelist_order" |
| 2746 | * = "[dD]efault - default, automatic configuration. |
| 2747 | * = "[nN]ode - order by node locality, then by zone within node |
| 2748 | * = "[zZ]one - order by zone, then by locality within zone |
| 2749 | */ |
| 2750 | |
| 2751 | static int __parse_numa_zonelist_order(char *s) |
| 2752 | { |
| 2753 | if (*s == 'd' || *s == 'D') { |
| 2754 | user_zonelist_order = ZONELIST_ORDER_DEFAULT; |
| 2755 | } else if (*s == 'n' || *s == 'N') { |
| 2756 | user_zonelist_order = ZONELIST_ORDER_NODE; |
| 2757 | } else if (*s == 'z' || *s == 'Z') { |
| 2758 | user_zonelist_order = ZONELIST_ORDER_ZONE; |
| 2759 | } else { |
| 2760 | printk(KERN_WARNING |
| 2761 | "Ignoring invalid numa_zonelist_order value: " |
| 2762 | "%s\n", s); |
| 2763 | return -EINVAL; |
| 2764 | } |
| 2765 | return 0; |
| 2766 | } |
| 2767 | |
| 2768 | static __init int setup_numa_zonelist_order(char *s) |
| 2769 | { |
Volodymyr G. Lukiianyk | ecb256f | 2011-01-13 15:46:26 -0800 | [diff] [blame] | 2770 | int ret; |
| 2771 | |
| 2772 | if (!s) |
| 2773 | return 0; |
| 2774 | |
| 2775 | ret = __parse_numa_zonelist_order(s); |
| 2776 | if (ret == 0) |
| 2777 | strlcpy(numa_zonelist_order, s, NUMA_ZONELIST_ORDER_LEN); |
| 2778 | |
| 2779 | return ret; |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2780 | } |
| 2781 | early_param("numa_zonelist_order", setup_numa_zonelist_order); |
| 2782 | |
| 2783 | /* |
| 2784 | * sysctl handler for numa_zonelist_order |
| 2785 | */ |
| 2786 | int numa_zonelist_order_handler(ctl_table *table, int write, |
Alexey Dobriyan | 8d65af7 | 2009-09-23 15:57:19 -0700 | [diff] [blame] | 2787 | void __user *buffer, size_t *length, |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2788 | loff_t *ppos) |
| 2789 | { |
| 2790 | char saved_string[NUMA_ZONELIST_ORDER_LEN]; |
| 2791 | int ret; |
Andi Kleen | 443c6f1 | 2009-12-23 21:00:47 +0100 | [diff] [blame] | 2792 | static DEFINE_MUTEX(zl_order_mutex); |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2793 | |
Andi Kleen | 443c6f1 | 2009-12-23 21:00:47 +0100 | [diff] [blame] | 2794 | mutex_lock(&zl_order_mutex); |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2795 | if (write) |
Andi Kleen | 443c6f1 | 2009-12-23 21:00:47 +0100 | [diff] [blame] | 2796 | strcpy(saved_string, (char*)table->data); |
Alexey Dobriyan | 8d65af7 | 2009-09-23 15:57:19 -0700 | [diff] [blame] | 2797 | ret = proc_dostring(table, write, buffer, length, ppos); |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2798 | if (ret) |
Andi Kleen | 443c6f1 | 2009-12-23 21:00:47 +0100 | [diff] [blame] | 2799 | goto out; |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2800 | if (write) { |
| 2801 | int oldval = user_zonelist_order; |
| 2802 | if (__parse_numa_zonelist_order((char*)table->data)) { |
| 2803 | /* |
| 2804 | * bogus value. restore saved string |
| 2805 | */ |
| 2806 | strncpy((char*)table->data, saved_string, |
| 2807 | NUMA_ZONELIST_ORDER_LEN); |
| 2808 | user_zonelist_order = oldval; |
Haicheng Li | 4eaf3f6 | 2010-05-24 14:32:52 -0700 | [diff] [blame] | 2809 | } else if (oldval != user_zonelist_order) { |
| 2810 | mutex_lock(&zonelists_mutex); |
Haicheng Li | 1f52250 | 2010-05-24 14:32:51 -0700 | [diff] [blame] | 2811 | build_all_zonelists(NULL); |
Haicheng Li | 4eaf3f6 | 2010-05-24 14:32:52 -0700 | [diff] [blame] | 2812 | mutex_unlock(&zonelists_mutex); |
| 2813 | } |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2814 | } |
Andi Kleen | 443c6f1 | 2009-12-23 21:00:47 +0100 | [diff] [blame] | 2815 | out: |
| 2816 | mutex_unlock(&zl_order_mutex); |
| 2817 | return ret; |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2818 | } |
| 2819 | |
| 2820 | |
Christoph Lameter | 62bc62a | 2009-06-16 15:32:15 -0700 | [diff] [blame] | 2821 | #define MAX_NODE_LOAD (nr_online_nodes) |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2822 | static int node_load[MAX_NUMNODES]; |
| 2823 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2824 | /** |
Pavel Pisa | 4dc3b16 | 2005-05-01 08:59:25 -0700 | [diff] [blame] | 2825 | * find_next_best_node - find the next node that should appear in a given node's fallback list |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2826 | * @node: node whose fallback list we're appending |
| 2827 | * @used_node_mask: nodemask_t of already used nodes |
| 2828 | * |
| 2829 | * We use a number of factors to determine which is the next node that should |
| 2830 | * appear on a given node's fallback list. The node should not have appeared |
| 2831 | * already in @node's fallback list, and it should be the next closest node |
| 2832 | * according to the distance array (which contains arbitrary distance values |
| 2833 | * from each node to each node in the system), and should also prefer nodes |
| 2834 | * with no CPUs, since presumably they'll have very little allocation pressure |
| 2835 | * on them otherwise. |
| 2836 | * It returns -1 if no node is found. |
| 2837 | */ |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2838 | static int find_next_best_node(int node, nodemask_t *used_node_mask) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2839 | { |
Linus Torvalds | 4cf808eb | 2006-02-17 20:38:21 +0100 | [diff] [blame] | 2840 | int n, val; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2841 | int min_val = INT_MAX; |
| 2842 | int best_node = -1; |
Rusty Russell | a70f730 | 2009-03-13 14:49:46 +1030 | [diff] [blame] | 2843 | const struct cpumask *tmp = cpumask_of_node(0); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2844 | |
Linus Torvalds | 4cf808eb | 2006-02-17 20:38:21 +0100 | [diff] [blame] | 2845 | /* Use the local node if we haven't already */ |
| 2846 | if (!node_isset(node, *used_node_mask)) { |
| 2847 | node_set(node, *used_node_mask); |
| 2848 | return node; |
| 2849 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2850 | |
Lee Schermerhorn | 37b07e4 | 2007-10-16 01:25:39 -0700 | [diff] [blame] | 2851 | for_each_node_state(n, N_HIGH_MEMORY) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2852 | |
| 2853 | /* Don't want a node to appear more than once */ |
| 2854 | if (node_isset(n, *used_node_mask)) |
| 2855 | continue; |
| 2856 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2857 | /* Use the distance array to find the distance */ |
| 2858 | val = node_distance(node, n); |
| 2859 | |
Linus Torvalds | 4cf808eb | 2006-02-17 20:38:21 +0100 | [diff] [blame] | 2860 | /* Penalize nodes under us ("prefer the next node") */ |
| 2861 | val += (n < node); |
| 2862 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2863 | /* Give preference to headless and unused nodes */ |
Rusty Russell | a70f730 | 2009-03-13 14:49:46 +1030 | [diff] [blame] | 2864 | tmp = cpumask_of_node(n); |
| 2865 | if (!cpumask_empty(tmp)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2866 | val += PENALTY_FOR_NODE_WITH_CPUS; |
| 2867 | |
| 2868 | /* Slight preference for less loaded node */ |
| 2869 | val *= (MAX_NODE_LOAD*MAX_NUMNODES); |
| 2870 | val += node_load[n]; |
| 2871 | |
| 2872 | if (val < min_val) { |
| 2873 | min_val = val; |
| 2874 | best_node = n; |
| 2875 | } |
| 2876 | } |
| 2877 | |
| 2878 | if (best_node >= 0) |
| 2879 | node_set(best_node, *used_node_mask); |
| 2880 | |
| 2881 | return best_node; |
| 2882 | } |
| 2883 | |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2884 | |
| 2885 | /* |
| 2886 | * Build zonelists ordered by node and zones within node. |
| 2887 | * This results in maximum locality--normal zone overflows into local |
| 2888 | * DMA zone, if any--but risks exhausting DMA zone. |
| 2889 | */ |
| 2890 | static void build_zonelists_in_node_order(pg_data_t *pgdat, int node) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2891 | { |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2892 | int j; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2893 | struct zonelist *zonelist; |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2894 | |
Mel Gorman | 54a6eb5 | 2008-04-28 02:12:16 -0700 | [diff] [blame] | 2895 | zonelist = &pgdat->node_zonelists[0]; |
Mel Gorman | dd1a239 | 2008-04-28 02:12:17 -0700 | [diff] [blame] | 2896 | for (j = 0; zonelist->_zonerefs[j].zone != NULL; j++) |
Mel Gorman | 54a6eb5 | 2008-04-28 02:12:16 -0700 | [diff] [blame] | 2897 | ; |
| 2898 | j = build_zonelists_node(NODE_DATA(node), zonelist, j, |
| 2899 | MAX_NR_ZONES - 1); |
Mel Gorman | dd1a239 | 2008-04-28 02:12:17 -0700 | [diff] [blame] | 2900 | zonelist->_zonerefs[j].zone = NULL; |
| 2901 | zonelist->_zonerefs[j].zone_idx = 0; |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2902 | } |
| 2903 | |
| 2904 | /* |
Christoph Lameter | 523b945 | 2007-10-16 01:25:37 -0700 | [diff] [blame] | 2905 | * Build gfp_thisnode zonelists |
| 2906 | */ |
| 2907 | static void build_thisnode_zonelists(pg_data_t *pgdat) |
| 2908 | { |
Christoph Lameter | 523b945 | 2007-10-16 01:25:37 -0700 | [diff] [blame] | 2909 | int j; |
| 2910 | struct zonelist *zonelist; |
| 2911 | |
Mel Gorman | 54a6eb5 | 2008-04-28 02:12:16 -0700 | [diff] [blame] | 2912 | zonelist = &pgdat->node_zonelists[1]; |
| 2913 | j = build_zonelists_node(pgdat, zonelist, 0, MAX_NR_ZONES - 1); |
Mel Gorman | dd1a239 | 2008-04-28 02:12:17 -0700 | [diff] [blame] | 2914 | zonelist->_zonerefs[j].zone = NULL; |
| 2915 | zonelist->_zonerefs[j].zone_idx = 0; |
Christoph Lameter | 523b945 | 2007-10-16 01:25:37 -0700 | [diff] [blame] | 2916 | } |
| 2917 | |
| 2918 | /* |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2919 | * Build zonelists ordered by zone and nodes within zones. |
| 2920 | * This results in conserving DMA zone[s] until all Normal memory is |
| 2921 | * exhausted, but results in overflowing to remote node while memory |
| 2922 | * may still exist in local DMA zone. |
| 2923 | */ |
| 2924 | static int node_order[MAX_NUMNODES]; |
| 2925 | |
| 2926 | static void build_zonelists_in_zone_order(pg_data_t *pgdat, int nr_nodes) |
| 2927 | { |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2928 | int pos, j, node; |
| 2929 | int zone_type; /* needs to be signed */ |
| 2930 | struct zone *z; |
| 2931 | struct zonelist *zonelist; |
| 2932 | |
Mel Gorman | 54a6eb5 | 2008-04-28 02:12:16 -0700 | [diff] [blame] | 2933 | zonelist = &pgdat->node_zonelists[0]; |
| 2934 | pos = 0; |
| 2935 | for (zone_type = MAX_NR_ZONES - 1; zone_type >= 0; zone_type--) { |
| 2936 | for (j = 0; j < nr_nodes; j++) { |
| 2937 | node = node_order[j]; |
| 2938 | z = &NODE_DATA(node)->node_zones[zone_type]; |
| 2939 | if (populated_zone(z)) { |
Mel Gorman | dd1a239 | 2008-04-28 02:12:17 -0700 | [diff] [blame] | 2940 | zoneref_set_zone(z, |
| 2941 | &zonelist->_zonerefs[pos++]); |
Mel Gorman | 54a6eb5 | 2008-04-28 02:12:16 -0700 | [diff] [blame] | 2942 | check_highest_zone(zone_type); |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2943 | } |
| 2944 | } |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2945 | } |
Mel Gorman | dd1a239 | 2008-04-28 02:12:17 -0700 | [diff] [blame] | 2946 | zonelist->_zonerefs[pos].zone = NULL; |
| 2947 | zonelist->_zonerefs[pos].zone_idx = 0; |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2948 | } |
| 2949 | |
| 2950 | static int default_zonelist_order(void) |
| 2951 | { |
| 2952 | int nid, zone_type; |
| 2953 | unsigned long low_kmem_size,total_size; |
| 2954 | struct zone *z; |
| 2955 | int average_size; |
| 2956 | /* |
Thomas Weber | 8839316 | 2010-03-16 11:47:56 +0100 | [diff] [blame] | 2957 | * ZONE_DMA and ZONE_DMA32 can be very small area in the system. |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2958 | * If they are really small and used heavily, the system can fall |
| 2959 | * into OOM very easily. |
David Rientjes | e325c90 | 2010-05-24 14:32:13 -0700 | [diff] [blame] | 2960 | * This function detect ZONE_DMA/DMA32 size and configures zone order. |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2961 | */ |
| 2962 | /* Is there ZONE_NORMAL ? (ex. ppc has only DMA zone..) */ |
| 2963 | low_kmem_size = 0; |
| 2964 | total_size = 0; |
| 2965 | for_each_online_node(nid) { |
| 2966 | for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++) { |
| 2967 | z = &NODE_DATA(nid)->node_zones[zone_type]; |
| 2968 | if (populated_zone(z)) { |
| 2969 | if (zone_type < ZONE_NORMAL) |
| 2970 | low_kmem_size += z->present_pages; |
| 2971 | total_size += z->present_pages; |
David Rientjes | e325c90 | 2010-05-24 14:32:13 -0700 | [diff] [blame] | 2972 | } else if (zone_type == ZONE_NORMAL) { |
| 2973 | /* |
| 2974 | * If any node has only lowmem, then node order |
| 2975 | * is preferred to allow kernel allocations |
| 2976 | * locally; otherwise, they can easily infringe |
| 2977 | * on other nodes when there is an abundance of |
| 2978 | * lowmem available to allocate from. |
| 2979 | */ |
| 2980 | return ZONELIST_ORDER_NODE; |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2981 | } |
| 2982 | } |
| 2983 | } |
| 2984 | if (!low_kmem_size || /* there are no DMA area. */ |
| 2985 | low_kmem_size > total_size/2) /* DMA/DMA32 is big. */ |
| 2986 | return ZONELIST_ORDER_NODE; |
| 2987 | /* |
| 2988 | * look into each node's config. |
| 2989 | * If there is a node whose DMA/DMA32 memory is very big area on |
| 2990 | * local memory, NODE_ORDER may be suitable. |
| 2991 | */ |
Lee Schermerhorn | 37b07e4 | 2007-10-16 01:25:39 -0700 | [diff] [blame] | 2992 | average_size = total_size / |
| 2993 | (nodes_weight(node_states[N_HIGH_MEMORY]) + 1); |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 2994 | for_each_online_node(nid) { |
| 2995 | low_kmem_size = 0; |
| 2996 | total_size = 0; |
| 2997 | for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++) { |
| 2998 | z = &NODE_DATA(nid)->node_zones[zone_type]; |
| 2999 | if (populated_zone(z)) { |
| 3000 | if (zone_type < ZONE_NORMAL) |
| 3001 | low_kmem_size += z->present_pages; |
| 3002 | total_size += z->present_pages; |
| 3003 | } |
| 3004 | } |
| 3005 | if (low_kmem_size && |
| 3006 | total_size > average_size && /* ignore small node */ |
| 3007 | low_kmem_size > total_size * 70/100) |
| 3008 | return ZONELIST_ORDER_NODE; |
| 3009 | } |
| 3010 | return ZONELIST_ORDER_ZONE; |
| 3011 | } |
| 3012 | |
| 3013 | static void set_zonelist_order(void) |
| 3014 | { |
| 3015 | if (user_zonelist_order == ZONELIST_ORDER_DEFAULT) |
| 3016 | current_zonelist_order = default_zonelist_order(); |
| 3017 | else |
| 3018 | current_zonelist_order = user_zonelist_order; |
| 3019 | } |
| 3020 | |
| 3021 | static void build_zonelists(pg_data_t *pgdat) |
| 3022 | { |
| 3023 | int j, node, load; |
| 3024 | enum zone_type i; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3025 | nodemask_t used_mask; |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 3026 | int local_node, prev_node; |
| 3027 | struct zonelist *zonelist; |
| 3028 | int order = current_zonelist_order; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3029 | |
| 3030 | /* initialize zonelists */ |
Christoph Lameter | 523b945 | 2007-10-16 01:25:37 -0700 | [diff] [blame] | 3031 | for (i = 0; i < MAX_ZONELISTS; i++) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3032 | zonelist = pgdat->node_zonelists + i; |
Mel Gorman | dd1a239 | 2008-04-28 02:12:17 -0700 | [diff] [blame] | 3033 | zonelist->_zonerefs[0].zone = NULL; |
| 3034 | zonelist->_zonerefs[0].zone_idx = 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3035 | } |
| 3036 | |
| 3037 | /* NUMA-aware ordering of nodes */ |
| 3038 | local_node = pgdat->node_id; |
Christoph Lameter | 62bc62a | 2009-06-16 15:32:15 -0700 | [diff] [blame] | 3039 | load = nr_online_nodes; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3040 | prev_node = local_node; |
| 3041 | nodes_clear(used_mask); |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 3042 | |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 3043 | memset(node_order, 0, sizeof(node_order)); |
| 3044 | j = 0; |
| 3045 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3046 | while ((node = find_next_best_node(local_node, &used_mask)) >= 0) { |
Christoph Lameter | 9eeff23 | 2006-01-18 17:42:31 -0800 | [diff] [blame] | 3047 | int distance = node_distance(local_node, node); |
| 3048 | |
| 3049 | /* |
| 3050 | * If another node is sufficiently far away then it is better |
| 3051 | * to reclaim pages in a zone before going off node. |
| 3052 | */ |
| 3053 | if (distance > RECLAIM_DISTANCE) |
| 3054 | zone_reclaim_mode = 1; |
| 3055 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3056 | /* |
| 3057 | * We don't want to pressure a particular node. |
| 3058 | * So adding penalty to the first node in same |
| 3059 | * distance group to make it round-robin. |
| 3060 | */ |
Christoph Lameter | 9eeff23 | 2006-01-18 17:42:31 -0800 | [diff] [blame] | 3061 | if (distance != node_distance(local_node, prev_node)) |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 3062 | node_load[node] = load; |
| 3063 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3064 | prev_node = node; |
| 3065 | load--; |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 3066 | if (order == ZONELIST_ORDER_NODE) |
| 3067 | build_zonelists_in_node_order(pgdat, node); |
| 3068 | else |
| 3069 | node_order[j++] = node; /* remember order */ |
| 3070 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3071 | |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 3072 | if (order == ZONELIST_ORDER_ZONE) { |
| 3073 | /* calculate node order -- i.e., DMA last! */ |
| 3074 | build_zonelists_in_zone_order(pgdat, j); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3075 | } |
Christoph Lameter | 523b945 | 2007-10-16 01:25:37 -0700 | [diff] [blame] | 3076 | |
| 3077 | build_thisnode_zonelists(pgdat); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3078 | } |
| 3079 | |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 3080 | /* Construct the zonelist performance cache - see further mmzone.h */ |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 3081 | static void build_zonelist_cache(pg_data_t *pgdat) |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 3082 | { |
Mel Gorman | 54a6eb5 | 2008-04-28 02:12:16 -0700 | [diff] [blame] | 3083 | struct zonelist *zonelist; |
| 3084 | struct zonelist_cache *zlc; |
Mel Gorman | dd1a239 | 2008-04-28 02:12:17 -0700 | [diff] [blame] | 3085 | struct zoneref *z; |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 3086 | |
Mel Gorman | 54a6eb5 | 2008-04-28 02:12:16 -0700 | [diff] [blame] | 3087 | zonelist = &pgdat->node_zonelists[0]; |
| 3088 | zonelist->zlcache_ptr = zlc = &zonelist->zlcache; |
| 3089 | bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST); |
Mel Gorman | dd1a239 | 2008-04-28 02:12:17 -0700 | [diff] [blame] | 3090 | for (z = zonelist->_zonerefs; z->zone; z++) |
| 3091 | zlc->z_to_n[z - zonelist->_zonerefs] = zonelist_node_idx(z); |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 3092 | } |
| 3093 | |
Lee Schermerhorn | 7aac789 | 2010-05-26 14:45:00 -0700 | [diff] [blame] | 3094 | #ifdef CONFIG_HAVE_MEMORYLESS_NODES |
| 3095 | /* |
| 3096 | * Return node id of node used for "local" allocations. |
| 3097 | * I.e., first node id of first zone in arg node's generic zonelist. |
| 3098 | * Used for initializing percpu 'numa_mem', which is used primarily |
| 3099 | * for kernel allocations, so use GFP_KERNEL flags to locate zonelist. |
| 3100 | */ |
| 3101 | int local_memory_node(int node) |
| 3102 | { |
| 3103 | struct zone *zone; |
| 3104 | |
| 3105 | (void)first_zones_zonelist(node_zonelist(node, GFP_KERNEL), |
| 3106 | gfp_zone(GFP_KERNEL), |
| 3107 | NULL, |
| 3108 | &zone); |
| 3109 | return zone->node; |
| 3110 | } |
| 3111 | #endif |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 3112 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3113 | #else /* CONFIG_NUMA */ |
| 3114 | |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 3115 | static void set_zonelist_order(void) |
| 3116 | { |
| 3117 | current_zonelist_order = ZONELIST_ORDER_ZONE; |
| 3118 | } |
| 3119 | |
| 3120 | static void build_zonelists(pg_data_t *pgdat) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3121 | { |
Christoph Lameter | 19655d3 | 2006-09-25 23:31:19 -0700 | [diff] [blame] | 3122 | int node, local_node; |
Mel Gorman | 54a6eb5 | 2008-04-28 02:12:16 -0700 | [diff] [blame] | 3123 | enum zone_type j; |
| 3124 | struct zonelist *zonelist; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3125 | |
| 3126 | local_node = pgdat->node_id; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3127 | |
Mel Gorman | 54a6eb5 | 2008-04-28 02:12:16 -0700 | [diff] [blame] | 3128 | zonelist = &pgdat->node_zonelists[0]; |
| 3129 | j = build_zonelists_node(pgdat, zonelist, 0, MAX_NR_ZONES - 1); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3130 | |
Mel Gorman | 54a6eb5 | 2008-04-28 02:12:16 -0700 | [diff] [blame] | 3131 | /* |
| 3132 | * Now we build the zonelist so that it contains the zones |
| 3133 | * of all the other nodes. |
| 3134 | * We don't want to pressure a particular node, so when |
| 3135 | * building the zones for node N, we make sure that the |
| 3136 | * zones coming right after the local ones are those from |
| 3137 | * node N+1 (modulo N) |
| 3138 | */ |
| 3139 | for (node = local_node + 1; node < MAX_NUMNODES; node++) { |
| 3140 | if (!node_online(node)) |
| 3141 | continue; |
| 3142 | j = build_zonelists_node(NODE_DATA(node), zonelist, j, |
| 3143 | MAX_NR_ZONES - 1); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3144 | } |
Mel Gorman | 54a6eb5 | 2008-04-28 02:12:16 -0700 | [diff] [blame] | 3145 | for (node = 0; node < local_node; node++) { |
| 3146 | if (!node_online(node)) |
| 3147 | continue; |
| 3148 | j = build_zonelists_node(NODE_DATA(node), zonelist, j, |
| 3149 | MAX_NR_ZONES - 1); |
| 3150 | } |
| 3151 | |
Mel Gorman | dd1a239 | 2008-04-28 02:12:17 -0700 | [diff] [blame] | 3152 | zonelist->_zonerefs[j].zone = NULL; |
| 3153 | zonelist->_zonerefs[j].zone_idx = 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3154 | } |
| 3155 | |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 3156 | /* non-NUMA variant of zonelist performance cache - just NULL zlcache_ptr */ |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 3157 | static void build_zonelist_cache(pg_data_t *pgdat) |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 3158 | { |
Mel Gorman | 54a6eb5 | 2008-04-28 02:12:16 -0700 | [diff] [blame] | 3159 | pgdat->node_zonelists[0].zlcache_ptr = NULL; |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 3160 | } |
| 3161 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3162 | #endif /* CONFIG_NUMA */ |
| 3163 | |
Christoph Lameter | 99dcc3e | 2010-01-05 15:34:51 +0900 | [diff] [blame] | 3164 | /* |
| 3165 | * Boot pageset table. One per cpu which is going to be used for all |
| 3166 | * zones and all nodes. The parameters will be set in such a way |
| 3167 | * that an item put on a list will immediately be handed over to |
| 3168 | * the buddy list. This is safe since pageset manipulation is done |
| 3169 | * with interrupts disabled. |
| 3170 | * |
| 3171 | * The boot_pagesets must be kept even after bootup is complete for |
| 3172 | * unused processors and/or zones. They do play a role for bootstrapping |
| 3173 | * hotplugged processors. |
| 3174 | * |
| 3175 | * zoneinfo_show() and maybe other functions do |
| 3176 | * not check if the processor is online before following the pageset pointer. |
| 3177 | * Other parts of the kernel may not check if the zone is available. |
| 3178 | */ |
| 3179 | static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch); |
| 3180 | static DEFINE_PER_CPU(struct per_cpu_pageset, boot_pageset); |
Haicheng Li | 1f52250 | 2010-05-24 14:32:51 -0700 | [diff] [blame] | 3181 | static void setup_zone_pageset(struct zone *zone); |
Christoph Lameter | 99dcc3e | 2010-01-05 15:34:51 +0900 | [diff] [blame] | 3182 | |
Haicheng Li | 4eaf3f6 | 2010-05-24 14:32:52 -0700 | [diff] [blame] | 3183 | /* |
| 3184 | * Global mutex to protect against size modification of zonelists |
| 3185 | * as well as to serialize pageset setup for the new populated zone. |
| 3186 | */ |
| 3187 | DEFINE_MUTEX(zonelists_mutex); |
| 3188 | |
Rusty Russell | 9b1a4d3 | 2008-07-28 12:16:30 -0500 | [diff] [blame] | 3189 | /* return values int ....just for stop_machine() */ |
Haicheng Li | 1f52250 | 2010-05-24 14:32:51 -0700 | [diff] [blame] | 3190 | static __init_refok int __build_all_zonelists(void *data) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3191 | { |
Yasunori Goto | 6811378 | 2006-06-23 02:03:11 -0700 | [diff] [blame] | 3192 | int nid; |
Christoph Lameter | 99dcc3e | 2010-01-05 15:34:51 +0900 | [diff] [blame] | 3193 | int cpu; |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 3194 | |
Bo Liu | 7f9cfb3 | 2009-08-18 14:11:19 -0700 | [diff] [blame] | 3195 | #ifdef CONFIG_NUMA |
| 3196 | memset(node_load, 0, sizeof(node_load)); |
| 3197 | #endif |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 3198 | for_each_online_node(nid) { |
Christoph Lameter | 7ea1530 | 2007-10-16 01:25:29 -0700 | [diff] [blame] | 3199 | pg_data_t *pgdat = NODE_DATA(nid); |
| 3200 | |
| 3201 | build_zonelists(pgdat); |
| 3202 | build_zonelist_cache(pgdat); |
Paul Jackson | 9276b1bc | 2006-12-06 20:31:48 -0800 | [diff] [blame] | 3203 | } |
Christoph Lameter | 99dcc3e | 2010-01-05 15:34:51 +0900 | [diff] [blame] | 3204 | |
| 3205 | /* |
| 3206 | * Initialize the boot_pagesets that are going to be used |
| 3207 | * for bootstrapping processors. The real pagesets for |
| 3208 | * each zone will be allocated later when the per cpu |
| 3209 | * allocator is available. |
| 3210 | * |
| 3211 | * boot_pagesets are used also for bootstrapping offline |
| 3212 | * cpus if the system is already booted because the pagesets |
| 3213 | * are needed to initialize allocators on a specific cpu too. |
| 3214 | * F.e. the percpu allocator needs the page allocator which |
| 3215 | * needs the percpu allocator in order to allocate its pagesets |
| 3216 | * (a chicken-egg dilemma). |
| 3217 | */ |
Lee Schermerhorn | 7aac789 | 2010-05-26 14:45:00 -0700 | [diff] [blame] | 3218 | for_each_possible_cpu(cpu) { |
Christoph Lameter | 99dcc3e | 2010-01-05 15:34:51 +0900 | [diff] [blame] | 3219 | setup_pageset(&per_cpu(boot_pageset, cpu), 0); |
| 3220 | |
Lee Schermerhorn | 7aac789 | 2010-05-26 14:45:00 -0700 | [diff] [blame] | 3221 | #ifdef CONFIG_HAVE_MEMORYLESS_NODES |
| 3222 | /* |
| 3223 | * We now know the "local memory node" for each node-- |
| 3224 | * i.e., the node of the first zone in the generic zonelist. |
| 3225 | * Set up numa_mem percpu variable for on-line cpus. During |
| 3226 | * boot, only the boot cpu should be on-line; we'll init the |
| 3227 | * secondary cpus' numa_mem as they come on-line. During |
| 3228 | * node/memory hotplug, we'll fixup all on-line cpus. |
| 3229 | */ |
| 3230 | if (cpu_online(cpu)) |
| 3231 | set_cpu_numa_mem(cpu, local_memory_node(cpu_to_node(cpu))); |
| 3232 | #endif |
| 3233 | } |
| 3234 | |
Yasunori Goto | 6811378 | 2006-06-23 02:03:11 -0700 | [diff] [blame] | 3235 | return 0; |
| 3236 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3237 | |
Haicheng Li | 4eaf3f6 | 2010-05-24 14:32:52 -0700 | [diff] [blame] | 3238 | /* |
| 3239 | * Called with zonelists_mutex held always |
| 3240 | * unless system_state == SYSTEM_BOOTING. |
| 3241 | */ |
Paul Mundt | 9f6ae44 | 2011-04-14 15:21:57 -0700 | [diff] [blame] | 3242 | void __ref build_all_zonelists(void *data) |
Yasunori Goto | 6811378 | 2006-06-23 02:03:11 -0700 | [diff] [blame] | 3243 | { |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 3244 | set_zonelist_order(); |
| 3245 | |
Yasunori Goto | 6811378 | 2006-06-23 02:03:11 -0700 | [diff] [blame] | 3246 | if (system_state == SYSTEM_BOOTING) { |
Randy Dunlap | 423b41d | 2006-09-27 01:50:12 -0700 | [diff] [blame] | 3247 | __build_all_zonelists(NULL); |
Mel Gorman | 68ad8df | 2008-07-23 21:26:52 -0700 | [diff] [blame] | 3248 | mminit_verify_zonelist(); |
Yasunori Goto | 6811378 | 2006-06-23 02:03:11 -0700 | [diff] [blame] | 3249 | cpuset_init_current_mems_allowed(); |
| 3250 | } else { |
Simon Arlott | 183ff22 | 2007-10-20 01:27:18 +0200 | [diff] [blame] | 3251 | /* we have to stop all cpus to guarantee there is no user |
Yasunori Goto | 6811378 | 2006-06-23 02:03:11 -0700 | [diff] [blame] | 3252 | of zonelist */ |
KAMEZAWA Hiroyuki | e9959f0 | 2010-11-24 12:57:09 -0800 | [diff] [blame] | 3253 | #ifdef CONFIG_MEMORY_HOTPLUG |
| 3254 | if (data) |
| 3255 | setup_zone_pageset((struct zone *)data); |
| 3256 | #endif |
| 3257 | stop_machine(__build_all_zonelists, NULL, NULL); |
Yasunori Goto | 6811378 | 2006-06-23 02:03:11 -0700 | [diff] [blame] | 3258 | /* cpuset refresh routine should be here */ |
| 3259 | } |
Andrew Morton | bd1e22b | 2006-06-23 02:03:47 -0700 | [diff] [blame] | 3260 | vm_total_pages = nr_free_pagecache_pages(); |
Mel Gorman | 9ef9acb | 2007-10-16 01:25:54 -0700 | [diff] [blame] | 3261 | /* |
| 3262 | * Disable grouping by mobility if the number of pages in the |
| 3263 | * system is too low to allow the mechanism to work. It would be |
| 3264 | * more accurate, but expensive to check per-zone. This check is |
| 3265 | * made on memory-hotadd so a system can start with mobility |
| 3266 | * disabled and enable it later |
| 3267 | */ |
Mel Gorman | d9c2340 | 2007-10-16 01:26:01 -0700 | [diff] [blame] | 3268 | if (vm_total_pages < (pageblock_nr_pages * MIGRATE_TYPES)) |
Mel Gorman | 9ef9acb | 2007-10-16 01:25:54 -0700 | [diff] [blame] | 3269 | page_group_by_mobility_disabled = 1; |
| 3270 | else |
| 3271 | page_group_by_mobility_disabled = 0; |
| 3272 | |
| 3273 | printk("Built %i zonelists in %s order, mobility grouping %s. " |
| 3274 | "Total pages: %ld\n", |
Christoph Lameter | 62bc62a | 2009-06-16 15:32:15 -0700 | [diff] [blame] | 3275 | nr_online_nodes, |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 3276 | zonelist_order_name[current_zonelist_order], |
Mel Gorman | 9ef9acb | 2007-10-16 01:25:54 -0700 | [diff] [blame] | 3277 | page_group_by_mobility_disabled ? "off" : "on", |
KAMEZAWA Hiroyuki | f0c0b2b | 2007-07-15 23:38:01 -0700 | [diff] [blame] | 3278 | vm_total_pages); |
| 3279 | #ifdef CONFIG_NUMA |
| 3280 | printk("Policy zone: %s\n", zone_names[policy_zone]); |
| 3281 | #endif |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3282 | } |
| 3283 | |
| 3284 | /* |
| 3285 | * Helper functions to size the waitqueue hash table. |
| 3286 | * Essentially these want to choose hash table sizes sufficiently |
| 3287 | * large so that collisions trying to wait on pages are rare. |
| 3288 | * But in fact, the number of active page waitqueues on typical |
| 3289 | * systems is ridiculously low, less than 200. So this is even |
| 3290 | * conservative, even though it seems large. |
| 3291 | * |
| 3292 | * The constant PAGES_PER_WAITQUEUE specifies the ratio of pages to |
| 3293 | * waitqueues, i.e. the size of the waitq table given the number of pages. |
| 3294 | */ |
| 3295 | #define PAGES_PER_WAITQUEUE 256 |
| 3296 | |
Yasunori Goto | cca448f | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 3297 | #ifndef CONFIG_MEMORY_HOTPLUG |
Yasunori Goto | 02b694d | 2006-06-23 02:03:08 -0700 | [diff] [blame] | 3298 | static inline unsigned long wait_table_hash_nr_entries(unsigned long pages) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3299 | { |
| 3300 | unsigned long size = 1; |
| 3301 | |
| 3302 | pages /= PAGES_PER_WAITQUEUE; |
| 3303 | |
| 3304 | while (size < pages) |
| 3305 | size <<= 1; |
| 3306 | |
| 3307 | /* |
| 3308 | * Once we have dozens or even hundreds of threads sleeping |
| 3309 | * on IO we've got bigger problems than wait queue collision. |
| 3310 | * Limit the size of the wait table to a reasonable size. |
| 3311 | */ |
| 3312 | size = min(size, 4096UL); |
| 3313 | |
| 3314 | return max(size, 4UL); |
| 3315 | } |
Yasunori Goto | cca448f | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 3316 | #else |
| 3317 | /* |
| 3318 | * A zone's size might be changed by hot-add, so it is not possible to determine |
| 3319 | * a suitable size for its wait_table. So we use the maximum size now. |
| 3320 | * |
| 3321 | * The max wait table size = 4096 x sizeof(wait_queue_head_t). ie: |
| 3322 | * |
| 3323 | * i386 (preemption config) : 4096 x 16 = 64Kbyte. |
| 3324 | * ia64, x86-64 (no preemption): 4096 x 20 = 80Kbyte. |
| 3325 | * ia64, x86-64 (preemption) : 4096 x 24 = 96Kbyte. |
| 3326 | * |
| 3327 | * The maximum entries are prepared when a zone's memory is (512K + 256) pages |
| 3328 | * or more by the traditional way. (See above). It equals: |
| 3329 | * |
| 3330 | * i386, x86-64, powerpc(4K page size) : = ( 2G + 1M)byte. |
| 3331 | * ia64(16K page size) : = ( 8G + 4M)byte. |
| 3332 | * powerpc (64K page size) : = (32G +16M)byte. |
| 3333 | */ |
| 3334 | static inline unsigned long wait_table_hash_nr_entries(unsigned long pages) |
| 3335 | { |
| 3336 | return 4096UL; |
| 3337 | } |
| 3338 | #endif |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3339 | |
| 3340 | /* |
| 3341 | * This is an integer logarithm so that shifts can be used later |
| 3342 | * to extract the more random high bits from the multiplicative |
| 3343 | * hash function before the remainder is taken. |
| 3344 | */ |
| 3345 | static inline unsigned long wait_table_bits(unsigned long size) |
| 3346 | { |
| 3347 | return ffz(~size); |
| 3348 | } |
| 3349 | |
| 3350 | #define LONG_ALIGN(x) (((x)+(sizeof(long))-1)&~((sizeof(long))-1)) |
| 3351 | |
Mel Gorman | 56fd56b | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 3352 | /* |
Arve Hjønnevåg | 6d3163c | 2011-05-24 17:12:24 -0700 | [diff] [blame] | 3353 | * Check if a pageblock contains reserved pages |
| 3354 | */ |
| 3355 | static int pageblock_is_reserved(unsigned long start_pfn, unsigned long end_pfn) |
| 3356 | { |
| 3357 | unsigned long pfn; |
| 3358 | |
| 3359 | for (pfn = start_pfn; pfn < end_pfn; pfn++) { |
| 3360 | if (!pfn_valid_within(pfn) || PageReserved(pfn_to_page(pfn))) |
| 3361 | return 1; |
| 3362 | } |
| 3363 | return 0; |
| 3364 | } |
| 3365 | |
| 3366 | /* |
Mel Gorman | d9c2340 | 2007-10-16 01:26:01 -0700 | [diff] [blame] | 3367 | * Mark a number of pageblocks as MIGRATE_RESERVE. The number |
Mel Gorman | 4185896 | 2009-06-16 15:32:12 -0700 | [diff] [blame] | 3368 | * of blocks reserved is based on min_wmark_pages(zone). The memory within |
| 3369 | * the reserve will tend to store contiguous free pages. Setting min_free_kbytes |
Mel Gorman | 56fd56b | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 3370 | * higher will lead to a bigger reserve which will get freed as contiguous |
| 3371 | * blocks as reclaim kicks in |
| 3372 | */ |
| 3373 | static void setup_zone_migrate_reserve(struct zone *zone) |
| 3374 | { |
Arve Hjønnevåg | 6d3163c | 2011-05-24 17:12:24 -0700 | [diff] [blame] | 3375 | unsigned long start_pfn, pfn, end_pfn, block_end_pfn; |
Mel Gorman | 56fd56b | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 3376 | struct page *page; |
Mel Gorman | 78986a6 | 2009-09-21 17:03:02 -0700 | [diff] [blame] | 3377 | unsigned long block_migratetype; |
| 3378 | int reserve; |
Mel Gorman | 56fd56b | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 3379 | |
Michal Hocko | d0215638 | 2011-12-08 14:34:27 -0800 | [diff] [blame] | 3380 | /* |
| 3381 | * Get the start pfn, end pfn and the number of blocks to reserve |
| 3382 | * We have to be careful to be aligned to pageblock_nr_pages to |
| 3383 | * make sure that we always check pfn_valid for the first page in |
| 3384 | * the block. |
| 3385 | */ |
Mel Gorman | 56fd56b | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 3386 | start_pfn = zone->zone_start_pfn; |
| 3387 | end_pfn = start_pfn + zone->spanned_pages; |
Michal Hocko | d0215638 | 2011-12-08 14:34:27 -0800 | [diff] [blame] | 3388 | start_pfn = roundup(start_pfn, pageblock_nr_pages); |
Mel Gorman | 4185896 | 2009-06-16 15:32:12 -0700 | [diff] [blame] | 3389 | reserve = roundup(min_wmark_pages(zone), pageblock_nr_pages) >> |
Mel Gorman | d9c2340 | 2007-10-16 01:26:01 -0700 | [diff] [blame] | 3390 | pageblock_order; |
Mel Gorman | 56fd56b | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 3391 | |
Mel Gorman | 78986a6 | 2009-09-21 17:03:02 -0700 | [diff] [blame] | 3392 | /* |
| 3393 | * Reserve blocks are generally in place to help high-order atomic |
| 3394 | * allocations that are short-lived. A min_free_kbytes value that |
| 3395 | * would result in more than 2 reserve blocks for atomic allocations |
| 3396 | * is assumed to be in place to help anti-fragmentation for the |
| 3397 | * future allocation of hugepages at runtime. |
| 3398 | */ |
| 3399 | reserve = min(2, reserve); |
| 3400 | |
Mel Gorman | d9c2340 | 2007-10-16 01:26:01 -0700 | [diff] [blame] | 3401 | for (pfn = start_pfn; pfn < end_pfn; pfn += pageblock_nr_pages) { |
Mel Gorman | 56fd56b | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 3402 | if (!pfn_valid(pfn)) |
| 3403 | continue; |
| 3404 | page = pfn_to_page(pfn); |
| 3405 | |
Adam Litke | 344c790 | 2008-09-02 14:35:38 -0700 | [diff] [blame] | 3406 | /* Watch out for overlapping nodes */ |
| 3407 | if (page_to_nid(page) != zone_to_nid(zone)) |
| 3408 | continue; |
| 3409 | |
Mel Gorman | 56fd56b | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 3410 | /* Blocks with reserved pages will never free, skip them. */ |
Arve Hjønnevåg | 6d3163c | 2011-05-24 17:12:24 -0700 | [diff] [blame] | 3411 | block_end_pfn = min(pfn + pageblock_nr_pages, end_pfn); |
| 3412 | if (pageblock_is_reserved(pfn, block_end_pfn)) |
Mel Gorman | 56fd56b | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 3413 | continue; |
| 3414 | |
| 3415 | block_migratetype = get_pageblock_migratetype(page); |
| 3416 | |
| 3417 | /* If this block is reserved, account for it */ |
| 3418 | if (reserve > 0 && block_migratetype == MIGRATE_RESERVE) { |
| 3419 | reserve--; |
| 3420 | continue; |
| 3421 | } |
| 3422 | |
| 3423 | /* Suitable for reserving if this block is movable */ |
| 3424 | if (reserve > 0 && block_migratetype == MIGRATE_MOVABLE) { |
| 3425 | set_pageblock_migratetype(page, MIGRATE_RESERVE); |
| 3426 | move_freepages_block(zone, page, MIGRATE_RESERVE); |
| 3427 | reserve--; |
| 3428 | continue; |
| 3429 | } |
| 3430 | |
| 3431 | /* |
| 3432 | * If the reserve is met and this is a previous reserved block, |
| 3433 | * take it back |
| 3434 | */ |
| 3435 | if (block_migratetype == MIGRATE_RESERVE) { |
| 3436 | set_pageblock_migratetype(page, MIGRATE_MOVABLE); |
| 3437 | move_freepages_block(zone, page, MIGRATE_MOVABLE); |
| 3438 | } |
| 3439 | } |
| 3440 | } |
Mel Gorman | ac0e5b7 | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 3441 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3442 | /* |
| 3443 | * Initially all pages are reserved - free ones are freed |
| 3444 | * up by free_all_bootmem() once the early boot process is |
| 3445 | * done. Non-atomic initialization, single-pass. |
| 3446 | */ |
Matt Tolentino | c09b424 | 2006-01-17 07:03:44 +0100 | [diff] [blame] | 3447 | void __meminit memmap_init_zone(unsigned long size, int nid, unsigned long zone, |
Dave Hansen | a2f3aa02 | 2007-01-10 23:15:30 -0800 | [diff] [blame] | 3448 | unsigned long start_pfn, enum memmap_context context) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3449 | { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3450 | struct page *page; |
Andy Whitcroft | 29751f6 | 2005-06-23 00:08:00 -0700 | [diff] [blame] | 3451 | unsigned long end_pfn = start_pfn + size; |
| 3452 | unsigned long pfn; |
KAMEZAWA Hiroyuki | 86051ca | 2008-04-29 00:58:21 -0700 | [diff] [blame] | 3453 | struct zone *z; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3454 | |
Hugh Dickins | 22b31ee | 2009-01-06 14:40:09 -0800 | [diff] [blame] | 3455 | if (highest_memmap_pfn < end_pfn - 1) |
| 3456 | highest_memmap_pfn = end_pfn - 1; |
| 3457 | |
KAMEZAWA Hiroyuki | 86051ca | 2008-04-29 00:58:21 -0700 | [diff] [blame] | 3458 | z = &NODE_DATA(nid)->node_zones[zone]; |
Greg Ungerer | cbe8dd4 | 2006-01-12 01:05:24 -0800 | [diff] [blame] | 3459 | for (pfn = start_pfn; pfn < end_pfn; pfn++) { |
Dave Hansen | a2f3aa02 | 2007-01-10 23:15:30 -0800 | [diff] [blame] | 3460 | /* |
| 3461 | * There can be holes in boot-time mem_map[]s |
| 3462 | * handed to this function. They do not |
| 3463 | * exist on hotplugged memory. |
| 3464 | */ |
| 3465 | if (context == MEMMAP_EARLY) { |
| 3466 | if (!early_pfn_valid(pfn)) |
| 3467 | continue; |
| 3468 | if (!early_pfn_in_nid(pfn, nid)) |
| 3469 | continue; |
| 3470 | } |
Andy Whitcroft | d41dee3 | 2005-06-23 00:07:54 -0700 | [diff] [blame] | 3471 | page = pfn_to_page(pfn); |
| 3472 | set_page_links(page, zone, nid, pfn); |
Mel Gorman | 708614e | 2008-07-23 21:26:51 -0700 | [diff] [blame] | 3473 | mminit_verify_page_links(page, zone, nid, pfn); |
Nick Piggin | 7835e98 | 2006-03-22 00:08:40 -0800 | [diff] [blame] | 3474 | init_page_count(page); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3475 | reset_page_mapcount(page); |
| 3476 | SetPageReserved(page); |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 3477 | /* |
| 3478 | * Mark the block movable so that blocks are reserved for |
| 3479 | * movable at startup. This will force kernel allocations |
| 3480 | * to reserve their blocks rather than leaking throughout |
| 3481 | * the address space during boot when many long-lived |
Mel Gorman | 56fd56b | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 3482 | * kernel allocations are made. Later some blocks near |
| 3483 | * the start are marked MIGRATE_RESERVE by |
| 3484 | * setup_zone_migrate_reserve() |
KAMEZAWA Hiroyuki | 86051ca | 2008-04-29 00:58:21 -0700 | [diff] [blame] | 3485 | * |
| 3486 | * bitmap is created for zone's valid pfn range. but memmap |
| 3487 | * can be created for invalid pages (for alignment) |
| 3488 | * check here not to call set_pageblock_migratetype() against |
| 3489 | * pfn out of zone. |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 3490 | */ |
KAMEZAWA Hiroyuki | 86051ca | 2008-04-29 00:58:21 -0700 | [diff] [blame] | 3491 | if ((z->zone_start_pfn <= pfn) |
| 3492 | && (pfn < z->zone_start_pfn + z->spanned_pages) |
| 3493 | && !(pfn & (pageblock_nr_pages - 1))) |
Mel Gorman | 56fd56b | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 3494 | set_pageblock_migratetype(page, MIGRATE_MOVABLE); |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 3495 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3496 | INIT_LIST_HEAD(&page->lru); |
| 3497 | #ifdef WANT_PAGE_VIRTUAL |
| 3498 | /* The shift won't overflow because ZONE_NORMAL is below 4G. */ |
| 3499 | if (!is_highmem_idx(zone)) |
Bob Picco | 3212c6b | 2005-06-27 14:36:28 -0700 | [diff] [blame] | 3500 | set_page_address(page, __va(pfn << PAGE_SHIFT)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3501 | #endif |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3502 | } |
| 3503 | } |
| 3504 | |
Andi Kleen | 1e548de | 2008-02-04 22:29:26 -0800 | [diff] [blame] | 3505 | static void __meminit zone_init_free_lists(struct zone *zone) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3506 | { |
Mel Gorman | b2a0ac8 | 2007-10-16 01:25:48 -0700 | [diff] [blame] | 3507 | int order, t; |
| 3508 | for_each_migratetype_order(order, t) { |
| 3509 | INIT_LIST_HEAD(&zone->free_area[order].free_list[t]); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3510 | zone->free_area[order].nr_free = 0; |
| 3511 | } |
| 3512 | } |
| 3513 | |
| 3514 | #ifndef __HAVE_ARCH_MEMMAP_INIT |
| 3515 | #define memmap_init(size, nid, zone, start_pfn) \ |
Dave Hansen | a2f3aa02 | 2007-01-10 23:15:30 -0800 | [diff] [blame] | 3516 | memmap_init_zone((size), (nid), (zone), (start_pfn), MEMMAP_EARLY) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 3517 | #endif |
| 3518 | |
Sam Ravnborg | 1d6f4e6 | 2008-01-17 15:21:12 -0800 | [diff] [blame] | 3519 | static int zone_batchsize(struct zone *zone) |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 3520 | { |
David Howells | 3a6be87 | 2009-05-06 16:03:03 -0700 | [diff] [blame] | 3521 | #ifdef CONFIG_MMU |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 3522 | int batch; |
| 3523 | |
| 3524 | /* |
| 3525 | * The per-cpu-pages pools are set to around 1000th of the |
Seth, Rohit | ba56e91 | 2005-10-29 18:15:47 -0700 | [diff] [blame] | 3526 | * size of the zone. But no more than 1/2 of a meg. |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 3527 | * |
| 3528 | * OK, so we don't know how big the cache is. So guess. |
| 3529 | */ |
| 3530 | batch = zone->present_pages / 1024; |
Seth, Rohit | ba56e91 | 2005-10-29 18:15:47 -0700 | [diff] [blame] | 3531 | if (batch * PAGE_SIZE > 512 * 1024) |
| 3532 | batch = (512 * 1024) / PAGE_SIZE; |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 3533 | batch /= 4; /* We effectively *= 4 below */ |
| 3534 | if (batch < 1) |
| 3535 | batch = 1; |
| 3536 | |
| 3537 | /* |
Nick Piggin | 0ceaacc | 2005-12-04 13:55:25 +1100 | [diff] [blame] | 3538 | * Clamp the batch to a 2^n - 1 value. Having a power |
| 3539 | * of 2 value was found to be more likely to have |
| 3540 | * suboptimal cache aliasing properties in some cases. |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 3541 | * |
Nick Piggin | 0ceaacc | 2005-12-04 13:55:25 +1100 | [diff] [blame] | 3542 | * For example if 2 tasks are alternately allocating |
| 3543 | * batches of pages, one task can end up with a lot |
| 3544 | * of pages of one half of the possible page colors |
| 3545 | * and the other with pages of the other colors. |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 3546 | */ |
David Howells | 9155203 | 2009-05-06 16:03:02 -0700 | [diff] [blame] | 3547 | batch = rounddown_pow_of_two(batch + batch/2) - 1; |
Seth, Rohit | ba56e91 | 2005-10-29 18:15:47 -0700 | [diff] [blame] | 3548 | |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 3549 | return batch; |
David Howells | 3a6be87 | 2009-05-06 16:03:03 -0700 | [diff] [blame] | 3550 | |
| 3551 | #else |
| 3552 | /* The deferral and batching of frees should be suppressed under NOMMU |
| 3553 | * conditions. |
| 3554 | * |
| 3555 | * The problem is that NOMMU needs to be able to allocate large chunks |
| 3556 | * of contiguous memory as there's no hardware page translation to |
| 3557 | * assemble apparent contiguous memory from discontiguous pages. |
| 3558 | * |
| 3559 | * Queueing large contiguous runs of pages for batching, however, |
| 3560 | * causes the pages to actually be freed in smaller chunks. As there |
| 3561 | * can be a significant delay between the individual batches being |
| 3562 | * recycled, this leads to the once large chunks of space being |
| 3563 | * fragmented and becoming unavailable for high-order allocations. |
| 3564 | */ |
| 3565 | return 0; |
| 3566 | #endif |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 3567 | } |
| 3568 | |
Adrian Bunk | b69a728 | 2008-07-23 21:28:12 -0700 | [diff] [blame] | 3569 | static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch) |
Christoph Lameter | 2caaad4 | 2005-06-21 17:15:00 -0700 | [diff] [blame] | 3570 | { |
| 3571 | struct per_cpu_pages *pcp; |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 3572 | int migratetype; |
Christoph Lameter | 2caaad4 | 2005-06-21 17:15:00 -0700 | [diff] [blame] | 3573 | |
Magnus Damm | 1c6fe94 | 2005-10-26 01:58:59 -0700 | [diff] [blame] | 3574 | memset(p, 0, sizeof(*p)); |
| 3575 | |
Christoph Lameter | 3dfa572 | 2008-02-04 22:29:19 -0800 | [diff] [blame] | 3576 | pcp = &p->pcp; |
Christoph Lameter | 2caaad4 | 2005-06-21 17:15:00 -0700 | [diff] [blame] | 3577 | pcp->count = 0; |
Christoph Lameter | 2caaad4 | 2005-06-21 17:15:00 -0700 | [diff] [blame] | 3578 | pcp->high = 6 * batch; |
| 3579 | pcp->batch = max(1UL, 1 * batch); |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 3580 | for (migratetype = 0; migratetype < MIGRATE_PCPTYPES; migratetype++) |
| 3581 | INIT_LIST_HEAD(&pcp->lists[migratetype]); |
Christoph Lameter | 2caaad4 | 2005-06-21 17:15:00 -0700 | [diff] [blame] | 3582 | } |
| 3583 | |
Rohit Seth | 8ad4b1f | 2006-01-08 01:00:40 -0800 | [diff] [blame] | 3584 | /* |
| 3585 | * setup_pagelist_highmark() sets the high water mark for hot per_cpu_pagelist |
| 3586 | * to the value high for the pageset p. |
| 3587 | */ |
| 3588 | |
| 3589 | static void setup_pagelist_highmark(struct per_cpu_pageset *p, |
| 3590 | unsigned long high) |
| 3591 | { |
| 3592 | struct per_cpu_pages *pcp; |
| 3593 | |
Christoph Lameter | 3dfa572 | 2008-02-04 22:29:19 -0800 | [diff] [blame] | 3594 | pcp = &p->pcp; |
Rohit Seth | 8ad4b1f | 2006-01-08 01:00:40 -0800 | [diff] [blame] | 3595 | pcp->high = high; |
| 3596 | pcp->batch = max(1UL, high/4); |
| 3597 | if ((high/4) > (PAGE_SHIFT * 8)) |
| 3598 | pcp->batch = PAGE_SHIFT * 8; |
| 3599 | } |
| 3600 | |
Nikanth Karthikesan | 58c2ee4 | 2011-03-15 10:59:02 +0530 | [diff] [blame] | 3601 | static void setup_zone_pageset(struct zone *zone) |
Wu Fengguang | 319774e | 2010-05-24 14:32:49 -0700 | [diff] [blame] | 3602 | { |
| 3603 | int cpu; |
| 3604 | |
| 3605 | zone->pageset = alloc_percpu(struct per_cpu_pageset); |
| 3606 | |
| 3607 | for_each_possible_cpu(cpu) { |
| 3608 | struct per_cpu_pageset *pcp = per_cpu_ptr(zone->pageset, cpu); |
| 3609 | |
| 3610 | setup_pageset(pcp, zone_batchsize(zone)); |
| 3611 | |
| 3612 | if (percpu_pagelist_fraction) |
| 3613 | setup_pagelist_highmark(pcp, |
| 3614 | (zone->present_pages / |
| 3615 | percpu_pagelist_fraction)); |
| 3616 | } |
| 3617 | } |
| 3618 | |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 3619 | /* |
Christoph Lameter | 99dcc3e | 2010-01-05 15:34:51 +0900 | [diff] [blame] | 3620 | * Allocate per cpu pagesets and initialize them. |
| 3621 | * Before this call only boot pagesets were available. |
Christoph Lameter | 2caaad4 | 2005-06-21 17:15:00 -0700 | [diff] [blame] | 3622 | */ |
Al Viro | 78d9955 | 2005-12-15 09:18:25 +0000 | [diff] [blame] | 3623 | void __init setup_per_cpu_pageset(void) |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 3624 | { |
Christoph Lameter | 99dcc3e | 2010-01-05 15:34:51 +0900 | [diff] [blame] | 3625 | struct zone *zone; |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 3626 | |
Wu Fengguang | 319774e | 2010-05-24 14:32:49 -0700 | [diff] [blame] | 3627 | for_each_populated_zone(zone) |
| 3628 | setup_zone_pageset(zone); |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 3629 | } |
| 3630 | |
Sam Ravnborg | 577a32f | 2007-05-17 23:29:25 +0200 | [diff] [blame] | 3631 | static noinline __init_refok |
Yasunori Goto | cca448f | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 3632 | int zone_wait_table_init(struct zone *zone, unsigned long zone_size_pages) |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 3633 | { |
| 3634 | int i; |
| 3635 | struct pglist_data *pgdat = zone->zone_pgdat; |
Yasunori Goto | cca448f | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 3636 | size_t alloc_size; |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 3637 | |
| 3638 | /* |
| 3639 | * The per-page waitqueue mechanism uses hashed waitqueues |
| 3640 | * per zone. |
| 3641 | */ |
Yasunori Goto | 02b694d | 2006-06-23 02:03:08 -0700 | [diff] [blame] | 3642 | zone->wait_table_hash_nr_entries = |
| 3643 | wait_table_hash_nr_entries(zone_size_pages); |
| 3644 | zone->wait_table_bits = |
| 3645 | wait_table_bits(zone->wait_table_hash_nr_entries); |
Yasunori Goto | cca448f | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 3646 | alloc_size = zone->wait_table_hash_nr_entries |
| 3647 | * sizeof(wait_queue_head_t); |
| 3648 | |
Heiko Carstens | cd94b9d | 2008-05-23 13:04:52 -0700 | [diff] [blame] | 3649 | if (!slab_is_available()) { |
Yasunori Goto | cca448f | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 3650 | zone->wait_table = (wait_queue_head_t *) |
Yinghai Lu | 8f389a99 | 2011-05-11 15:13:32 -0700 | [diff] [blame] | 3651 | alloc_bootmem_node_nopanic(pgdat, alloc_size); |
Yasunori Goto | cca448f | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 3652 | } else { |
| 3653 | /* |
| 3654 | * This case means that a zone whose size was 0 gets new memory |
| 3655 | * via memory hot-add. |
| 3656 | * But it may be the case that a new node was hot-added. In |
| 3657 | * this case vmalloc() will not be able to use this new node's |
| 3658 | * memory - this wait_table must be initialized to use this new |
| 3659 | * node itself as well. |
| 3660 | * To use this new node's memory, further consideration will be |
| 3661 | * necessary. |
| 3662 | */ |
Jesper Juhl | 8691f3a | 2007-10-16 01:24:49 -0700 | [diff] [blame] | 3663 | zone->wait_table = vmalloc(alloc_size); |
Yasunori Goto | cca448f | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 3664 | } |
| 3665 | if (!zone->wait_table) |
| 3666 | return -ENOMEM; |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 3667 | |
Yasunori Goto | 02b694d | 2006-06-23 02:03:08 -0700 | [diff] [blame] | 3668 | for(i = 0; i < zone->wait_table_hash_nr_entries; ++i) |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 3669 | init_waitqueue_head(zone->wait_table + i); |
Yasunori Goto | cca448f | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 3670 | |
| 3671 | return 0; |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 3672 | } |
| 3673 | |
Shaohua Li | 112067f | 2009-09-21 17:01:16 -0700 | [diff] [blame] | 3674 | static int __zone_pcp_update(void *data) |
| 3675 | { |
| 3676 | struct zone *zone = data; |
| 3677 | int cpu; |
| 3678 | unsigned long batch = zone_batchsize(zone), flags; |
| 3679 | |
Thomas Gleixner | 2d30a1f | 2010-03-10 15:20:40 -0800 | [diff] [blame] | 3680 | for_each_possible_cpu(cpu) { |
Shaohua Li | 112067f | 2009-09-21 17:01:16 -0700 | [diff] [blame] | 3681 | struct per_cpu_pageset *pset; |
| 3682 | struct per_cpu_pages *pcp; |
| 3683 | |
Christoph Lameter | 99dcc3e | 2010-01-05 15:34:51 +0900 | [diff] [blame] | 3684 | pset = per_cpu_ptr(zone->pageset, cpu); |
Shaohua Li | 112067f | 2009-09-21 17:01:16 -0700 | [diff] [blame] | 3685 | pcp = &pset->pcp; |
| 3686 | |
| 3687 | local_irq_save(flags); |
Mel Gorman | 5f8dcc2 | 2009-09-21 17:03:19 -0700 | [diff] [blame] | 3688 | free_pcppages_bulk(zone, pcp->count, pcp); |
Shaohua Li | 112067f | 2009-09-21 17:01:16 -0700 | [diff] [blame] | 3689 | setup_pageset(pset, batch); |
| 3690 | local_irq_restore(flags); |
| 3691 | } |
| 3692 | return 0; |
| 3693 | } |
| 3694 | |
| 3695 | void zone_pcp_update(struct zone *zone) |
| 3696 | { |
| 3697 | stop_machine(__zone_pcp_update, zone, NULL); |
| 3698 | } |
| 3699 | |
Matt Tolentino | c09b424 | 2006-01-17 07:03:44 +0100 | [diff] [blame] | 3700 | static __meminit void zone_pcp_init(struct zone *zone) |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 3701 | { |
Christoph Lameter | 99dcc3e | 2010-01-05 15:34:51 +0900 | [diff] [blame] | 3702 | /* |
| 3703 | * per cpu subsystem is not up at this point. The following code |
| 3704 | * relies on the ability of the linker to provide the |
| 3705 | * offset of a (static) per cpu variable into the per cpu area. |
| 3706 | */ |
| 3707 | zone->pageset = &boot_pageset; |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 3708 | |
Anton Blanchard | f5335c0 | 2006-03-25 03:06:49 -0800 | [diff] [blame] | 3709 | if (zone->present_pages) |
Christoph Lameter | 99dcc3e | 2010-01-05 15:34:51 +0900 | [diff] [blame] | 3710 | printk(KERN_DEBUG " %s zone: %lu pages, LIFO batch:%u\n", |
| 3711 | zone->name, zone->present_pages, |
| 3712 | zone_batchsize(zone)); |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 3713 | } |
| 3714 | |
Yasunori Goto | 718127c | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 3715 | __meminit int init_currently_empty_zone(struct zone *zone, |
| 3716 | unsigned long zone_start_pfn, |
Dave Hansen | a2f3aa02 | 2007-01-10 23:15:30 -0800 | [diff] [blame] | 3717 | unsigned long size, |
| 3718 | enum memmap_context context) |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 3719 | { |
| 3720 | struct pglist_data *pgdat = zone->zone_pgdat; |
Yasunori Goto | cca448f | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 3721 | int ret; |
| 3722 | ret = zone_wait_table_init(zone, size); |
| 3723 | if (ret) |
| 3724 | return ret; |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 3725 | pgdat->nr_zones = zone_idx(zone) + 1; |
| 3726 | |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 3727 | zone->zone_start_pfn = zone_start_pfn; |
| 3728 | |
Mel Gorman | 708614e | 2008-07-23 21:26:51 -0700 | [diff] [blame] | 3729 | mminit_dprintk(MMINIT_TRACE, "memmap_init", |
| 3730 | "Initialising map node %d zone %lu pfns %lu -> %lu\n", |
| 3731 | pgdat->node_id, |
| 3732 | (unsigned long)zone_idx(zone), |
| 3733 | zone_start_pfn, (zone_start_pfn + size)); |
| 3734 | |
Andi Kleen | 1e548de | 2008-02-04 22:29:26 -0800 | [diff] [blame] | 3735 | zone_init_free_lists(zone); |
Yasunori Goto | 718127c | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 3736 | |
| 3737 | return 0; |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 3738 | } |
| 3739 | |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 3740 | #ifdef CONFIG_ARCH_POPULATES_NODE_MAP |
| 3741 | /* |
| 3742 | * Basic iterator support. Return the first range of PFNs for a node |
| 3743 | * Note: nid == MAX_NUMNODES returns first region regardless of node |
| 3744 | */ |
Yasunori Goto | a3142c8 | 2007-05-08 00:23:07 -0700 | [diff] [blame] | 3745 | static int __meminit first_active_region_index_in_nid(int nid) |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 3746 | { |
| 3747 | int i; |
| 3748 | |
| 3749 | for (i = 0; i < nr_nodemap_entries; i++) |
| 3750 | if (nid == MAX_NUMNODES || early_node_map[i].nid == nid) |
| 3751 | return i; |
| 3752 | |
| 3753 | return -1; |
| 3754 | } |
| 3755 | |
| 3756 | /* |
| 3757 | * Basic iterator support. Return the next active range of PFNs for a node |
Simon Arlott | 183ff22 | 2007-10-20 01:27:18 +0200 | [diff] [blame] | 3758 | * Note: nid == MAX_NUMNODES returns next region regardless of node |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 3759 | */ |
Yasunori Goto | a3142c8 | 2007-05-08 00:23:07 -0700 | [diff] [blame] | 3760 | static int __meminit next_active_region_index_in_nid(int index, int nid) |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 3761 | { |
| 3762 | for (index = index + 1; index < nr_nodemap_entries; index++) |
| 3763 | if (nid == MAX_NUMNODES || early_node_map[index].nid == nid) |
| 3764 | return index; |
| 3765 | |
| 3766 | return -1; |
| 3767 | } |
| 3768 | |
| 3769 | #ifndef CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID |
| 3770 | /* |
| 3771 | * Required by SPARSEMEM. Given a PFN, return what node the PFN is on. |
| 3772 | * Architectures may implement their own version but if add_active_range() |
| 3773 | * was used and there are no special requirements, this is a convenient |
| 3774 | * alternative |
| 3775 | */ |
KAMEZAWA Hiroyuki | f2dbcfa | 2009-02-18 14:48:32 -0800 | [diff] [blame] | 3776 | int __meminit __early_pfn_to_nid(unsigned long pfn) |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 3777 | { |
| 3778 | int i; |
| 3779 | |
| 3780 | for (i = 0; i < nr_nodemap_entries; i++) { |
| 3781 | unsigned long start_pfn = early_node_map[i].start_pfn; |
| 3782 | unsigned long end_pfn = early_node_map[i].end_pfn; |
| 3783 | |
| 3784 | if (start_pfn <= pfn && pfn < end_pfn) |
| 3785 | return early_node_map[i].nid; |
| 3786 | } |
KAMEZAWA Hiroyuki | cc2559b | 2009-02-18 14:48:33 -0800 | [diff] [blame] | 3787 | /* This is a memory hole */ |
| 3788 | return -1; |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 3789 | } |
| 3790 | #endif /* CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID */ |
| 3791 | |
KAMEZAWA Hiroyuki | f2dbcfa | 2009-02-18 14:48:32 -0800 | [diff] [blame] | 3792 | int __meminit early_pfn_to_nid(unsigned long pfn) |
| 3793 | { |
KAMEZAWA Hiroyuki | cc2559b | 2009-02-18 14:48:33 -0800 | [diff] [blame] | 3794 | int nid; |
| 3795 | |
| 3796 | nid = __early_pfn_to_nid(pfn); |
| 3797 | if (nid >= 0) |
| 3798 | return nid; |
| 3799 | /* just returns 0 */ |
| 3800 | return 0; |
KAMEZAWA Hiroyuki | f2dbcfa | 2009-02-18 14:48:32 -0800 | [diff] [blame] | 3801 | } |
| 3802 | |
KAMEZAWA Hiroyuki | cc2559b | 2009-02-18 14:48:33 -0800 | [diff] [blame] | 3803 | #ifdef CONFIG_NODES_SPAN_OTHER_NODES |
| 3804 | bool __meminit early_pfn_in_nid(unsigned long pfn, int node) |
| 3805 | { |
| 3806 | int nid; |
| 3807 | |
| 3808 | nid = __early_pfn_to_nid(pfn); |
| 3809 | if (nid >= 0 && nid != node) |
| 3810 | return false; |
| 3811 | return true; |
| 3812 | } |
| 3813 | #endif |
KAMEZAWA Hiroyuki | f2dbcfa | 2009-02-18 14:48:32 -0800 | [diff] [blame] | 3814 | |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 3815 | /* Basic iterator support to walk early_node_map[] */ |
| 3816 | #define for_each_active_range_index_in_nid(i, nid) \ |
| 3817 | for (i = first_active_region_index_in_nid(nid); i != -1; \ |
| 3818 | i = next_active_region_index_in_nid(i, nid)) |
| 3819 | |
| 3820 | /** |
| 3821 | * free_bootmem_with_active_regions - Call free_bootmem_node for each active range |
Randy Dunlap | 88ca3b9 | 2006-10-04 02:15:25 -0700 | [diff] [blame] | 3822 | * @nid: The node to free memory on. If MAX_NUMNODES, all nodes are freed. |
| 3823 | * @max_low_pfn: The highest PFN that will be passed to free_bootmem_node |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 3824 | * |
| 3825 | * If an architecture guarantees that all ranges registered with |
| 3826 | * add_active_ranges() contain no holes and may be freed, this |
| 3827 | * this function may be used instead of calling free_bootmem() manually. |
| 3828 | */ |
| 3829 | void __init free_bootmem_with_active_regions(int nid, |
| 3830 | unsigned long max_low_pfn) |
| 3831 | { |
| 3832 | int i; |
| 3833 | |
| 3834 | for_each_active_range_index_in_nid(i, nid) { |
| 3835 | unsigned long size_pages = 0; |
| 3836 | unsigned long end_pfn = early_node_map[i].end_pfn; |
| 3837 | |
| 3838 | if (early_node_map[i].start_pfn >= max_low_pfn) |
| 3839 | continue; |
| 3840 | |
| 3841 | if (end_pfn > max_low_pfn) |
| 3842 | end_pfn = max_low_pfn; |
| 3843 | |
| 3844 | size_pages = end_pfn - early_node_map[i].start_pfn; |
| 3845 | free_bootmem_node(NODE_DATA(early_node_map[i].nid), |
| 3846 | PFN_PHYS(early_node_map[i].start_pfn), |
| 3847 | size_pages << PAGE_SHIFT); |
| 3848 | } |
| 3849 | } |
| 3850 | |
Yinghai Lu | edbe7d2 | 2010-08-25 13:39:16 -0700 | [diff] [blame] | 3851 | #ifdef CONFIG_HAVE_MEMBLOCK |
Yinghai Lu | cc28989 | 2011-02-26 13:05:43 +0100 | [diff] [blame] | 3852 | /* |
| 3853 | * Basic iterator support. Return the last range of PFNs for a node |
| 3854 | * Note: nid == MAX_NUMNODES returns last region regardless of node |
| 3855 | */ |
| 3856 | static int __meminit last_active_region_index_in_nid(int nid) |
| 3857 | { |
| 3858 | int i; |
| 3859 | |
| 3860 | for (i = nr_nodemap_entries - 1; i >= 0; i--) |
| 3861 | if (nid == MAX_NUMNODES || early_node_map[i].nid == nid) |
| 3862 | return i; |
| 3863 | |
| 3864 | return -1; |
| 3865 | } |
| 3866 | |
| 3867 | /* |
| 3868 | * Basic iterator support. Return the previous active range of PFNs for a node |
| 3869 | * Note: nid == MAX_NUMNODES returns next region regardless of node |
| 3870 | */ |
| 3871 | static int __meminit previous_active_region_index_in_nid(int index, int nid) |
| 3872 | { |
| 3873 | for (index = index - 1; index >= 0; index--) |
| 3874 | if (nid == MAX_NUMNODES || early_node_map[index].nid == nid) |
| 3875 | return index; |
| 3876 | |
| 3877 | return -1; |
| 3878 | } |
| 3879 | |
| 3880 | #define for_each_active_range_index_in_nid_reverse(i, nid) \ |
| 3881 | for (i = last_active_region_index_in_nid(nid); i != -1; \ |
| 3882 | i = previous_active_region_index_in_nid(i, nid)) |
| 3883 | |
Yinghai Lu | edbe7d2 | 2010-08-25 13:39:16 -0700 | [diff] [blame] | 3884 | u64 __init find_memory_core_early(int nid, u64 size, u64 align, |
| 3885 | u64 goal, u64 limit) |
| 3886 | { |
| 3887 | int i; |
| 3888 | |
| 3889 | /* Need to go over early_node_map to find out good range for node */ |
Yinghai Lu | 1a4a678 | 2010-12-17 16:59:07 -0800 | [diff] [blame] | 3890 | for_each_active_range_index_in_nid_reverse(i, nid) { |
Yinghai Lu | edbe7d2 | 2010-08-25 13:39:16 -0700 | [diff] [blame] | 3891 | u64 addr; |
| 3892 | u64 ei_start, ei_last; |
| 3893 | u64 final_start, final_end; |
| 3894 | |
| 3895 | ei_last = early_node_map[i].end_pfn; |
| 3896 | ei_last <<= PAGE_SHIFT; |
| 3897 | ei_start = early_node_map[i].start_pfn; |
| 3898 | ei_start <<= PAGE_SHIFT; |
| 3899 | |
| 3900 | final_start = max(ei_start, goal); |
| 3901 | final_end = min(ei_last, limit); |
| 3902 | |
| 3903 | if (final_start >= final_end) |
| 3904 | continue; |
| 3905 | |
| 3906 | addr = memblock_find_in_range(final_start, final_end, size, align); |
| 3907 | |
| 3908 | if (addr == MEMBLOCK_ERROR) |
| 3909 | continue; |
| 3910 | |
| 3911 | return addr; |
| 3912 | } |
| 3913 | |
| 3914 | return MEMBLOCK_ERROR; |
| 3915 | } |
| 3916 | #endif |
| 3917 | |
Yinghai Lu | 0867721 | 2010-02-10 01:20:20 -0800 | [diff] [blame] | 3918 | int __init add_from_early_node_map(struct range *range, int az, |
| 3919 | int nr_range, int nid) |
| 3920 | { |
| 3921 | int i; |
| 3922 | u64 start, end; |
| 3923 | |
| 3924 | /* need to go over early_node_map to find out good range for node */ |
| 3925 | for_each_active_range_index_in_nid(i, nid) { |
| 3926 | start = early_node_map[i].start_pfn; |
| 3927 | end = early_node_map[i].end_pfn; |
| 3928 | nr_range = add_range(range, az, nr_range, start, end); |
| 3929 | } |
| 3930 | return nr_range; |
| 3931 | } |
| 3932 | |
Yinghai Lu | b5bc6c0 | 2008-06-14 18:32:52 -0700 | [diff] [blame] | 3933 | void __init work_with_active_regions(int nid, work_fn_t work_fn, void *data) |
| 3934 | { |
| 3935 | int i; |
Yinghai Lu | d52d53b | 2008-06-16 20:10:55 -0700 | [diff] [blame] | 3936 | int ret; |
Yinghai Lu | b5bc6c0 | 2008-06-14 18:32:52 -0700 | [diff] [blame] | 3937 | |
Yinghai Lu | d52d53b | 2008-06-16 20:10:55 -0700 | [diff] [blame] | 3938 | for_each_active_range_index_in_nid(i, nid) { |
| 3939 | ret = work_fn(early_node_map[i].start_pfn, |
| 3940 | early_node_map[i].end_pfn, data); |
| 3941 | if (ret) |
| 3942 | break; |
| 3943 | } |
Yinghai Lu | b5bc6c0 | 2008-06-14 18:32:52 -0700 | [diff] [blame] | 3944 | } |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 3945 | /** |
| 3946 | * sparse_memory_present_with_active_regions - Call memory_present for each active range |
Randy Dunlap | 88ca3b9 | 2006-10-04 02:15:25 -0700 | [diff] [blame] | 3947 | * @nid: The node to call memory_present for. If MAX_NUMNODES, all nodes will be used. |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 3948 | * |
| 3949 | * If an architecture guarantees that all ranges registered with |
| 3950 | * add_active_ranges() contain no holes and may be freed, this |
Randy Dunlap | 88ca3b9 | 2006-10-04 02:15:25 -0700 | [diff] [blame] | 3951 | * function may be used instead of calling memory_present() manually. |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 3952 | */ |
| 3953 | void __init sparse_memory_present_with_active_regions(int nid) |
| 3954 | { |
| 3955 | int i; |
| 3956 | |
| 3957 | for_each_active_range_index_in_nid(i, nid) |
| 3958 | memory_present(early_node_map[i].nid, |
| 3959 | early_node_map[i].start_pfn, |
| 3960 | early_node_map[i].end_pfn); |
| 3961 | } |
| 3962 | |
| 3963 | /** |
| 3964 | * get_pfn_range_for_nid - Return the start and end page frames for a node |
Randy Dunlap | 88ca3b9 | 2006-10-04 02:15:25 -0700 | [diff] [blame] | 3965 | * @nid: The nid to return the range for. If MAX_NUMNODES, the min and max PFN are returned. |
| 3966 | * @start_pfn: Passed by reference. On return, it will have the node start_pfn. |
| 3967 | * @end_pfn: Passed by reference. On return, it will have the node end_pfn. |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 3968 | * |
| 3969 | * It returns the start and end page frame of a node based on information |
| 3970 | * provided by an arch calling add_active_range(). If called for a node |
| 3971 | * with no available memory, a warning is printed and the start and end |
Randy Dunlap | 88ca3b9 | 2006-10-04 02:15:25 -0700 | [diff] [blame] | 3972 | * PFNs will be 0. |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 3973 | */ |
Yasunori Goto | a3142c8 | 2007-05-08 00:23:07 -0700 | [diff] [blame] | 3974 | void __meminit get_pfn_range_for_nid(unsigned int nid, |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 3975 | unsigned long *start_pfn, unsigned long *end_pfn) |
| 3976 | { |
| 3977 | int i; |
| 3978 | *start_pfn = -1UL; |
| 3979 | *end_pfn = 0; |
| 3980 | |
| 3981 | for_each_active_range_index_in_nid(i, nid) { |
| 3982 | *start_pfn = min(*start_pfn, early_node_map[i].start_pfn); |
| 3983 | *end_pfn = max(*end_pfn, early_node_map[i].end_pfn); |
| 3984 | } |
| 3985 | |
Christoph Lameter | 633c066 | 2007-10-16 01:25:37 -0700 | [diff] [blame] | 3986 | if (*start_pfn == -1UL) |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 3987 | *start_pfn = 0; |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 3988 | } |
| 3989 | |
| 3990 | /* |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 3991 | * This finds a zone that can be used for ZONE_MOVABLE pages. The |
| 3992 | * assumption is made that zones within a node are ordered in monotonic |
| 3993 | * increasing memory addresses so that the "highest" populated zone is used |
| 3994 | */ |
Adrian Bunk | b69a728 | 2008-07-23 21:28:12 -0700 | [diff] [blame] | 3995 | static void __init find_usable_zone_for_movable(void) |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 3996 | { |
| 3997 | int zone_index; |
| 3998 | for (zone_index = MAX_NR_ZONES - 1; zone_index >= 0; zone_index--) { |
| 3999 | if (zone_index == ZONE_MOVABLE) |
| 4000 | continue; |
| 4001 | |
| 4002 | if (arch_zone_highest_possible_pfn[zone_index] > |
| 4003 | arch_zone_lowest_possible_pfn[zone_index]) |
| 4004 | break; |
| 4005 | } |
| 4006 | |
| 4007 | VM_BUG_ON(zone_index == -1); |
| 4008 | movable_zone = zone_index; |
| 4009 | } |
| 4010 | |
| 4011 | /* |
| 4012 | * The zone ranges provided by the architecture do not include ZONE_MOVABLE |
Lucas De Marchi | 25985ed | 2011-03-30 22:57:33 -0300 | [diff] [blame] | 4013 | * because it is sized independent of architecture. Unlike the other zones, |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 4014 | * the starting point for ZONE_MOVABLE is not fixed. It may be different |
| 4015 | * in each node depending on the size of each node and how evenly kernelcore |
| 4016 | * is distributed. This helper function adjusts the zone ranges |
| 4017 | * provided by the architecture for a given node by using the end of the |
| 4018 | * highest usable zone for ZONE_MOVABLE. This preserves the assumption that |
| 4019 | * zones within a node are in order of monotonic increases memory addresses |
| 4020 | */ |
Adrian Bunk | b69a728 | 2008-07-23 21:28:12 -0700 | [diff] [blame] | 4021 | static void __meminit adjust_zone_range_for_zone_movable(int nid, |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 4022 | unsigned long zone_type, |
| 4023 | unsigned long node_start_pfn, |
| 4024 | unsigned long node_end_pfn, |
| 4025 | unsigned long *zone_start_pfn, |
| 4026 | unsigned long *zone_end_pfn) |
| 4027 | { |
| 4028 | /* Only adjust if ZONE_MOVABLE is on this node */ |
| 4029 | if (zone_movable_pfn[nid]) { |
| 4030 | /* Size ZONE_MOVABLE */ |
| 4031 | if (zone_type == ZONE_MOVABLE) { |
| 4032 | *zone_start_pfn = zone_movable_pfn[nid]; |
| 4033 | *zone_end_pfn = min(node_end_pfn, |
| 4034 | arch_zone_highest_possible_pfn[movable_zone]); |
| 4035 | |
| 4036 | /* Adjust for ZONE_MOVABLE starting within this range */ |
| 4037 | } else if (*zone_start_pfn < zone_movable_pfn[nid] && |
| 4038 | *zone_end_pfn > zone_movable_pfn[nid]) { |
| 4039 | *zone_end_pfn = zone_movable_pfn[nid]; |
| 4040 | |
| 4041 | /* Check if this whole range is within ZONE_MOVABLE */ |
| 4042 | } else if (*zone_start_pfn >= zone_movable_pfn[nid]) |
| 4043 | *zone_start_pfn = *zone_end_pfn; |
| 4044 | } |
| 4045 | } |
| 4046 | |
| 4047 | /* |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4048 | * Return the number of pages a zone spans in a node, including holes |
| 4049 | * present_pages = zone_spanned_pages_in_node() - zone_absent_pages_in_node() |
| 4050 | */ |
Paul Mundt | 6ea6e68 | 2007-07-15 23:38:20 -0700 | [diff] [blame] | 4051 | static unsigned long __meminit zone_spanned_pages_in_node(int nid, |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4052 | unsigned long zone_type, |
| 4053 | unsigned long *ignored) |
| 4054 | { |
| 4055 | unsigned long node_start_pfn, node_end_pfn; |
| 4056 | unsigned long zone_start_pfn, zone_end_pfn; |
| 4057 | |
| 4058 | /* Get the start and end of the node and zone */ |
| 4059 | get_pfn_range_for_nid(nid, &node_start_pfn, &node_end_pfn); |
| 4060 | zone_start_pfn = arch_zone_lowest_possible_pfn[zone_type]; |
| 4061 | zone_end_pfn = arch_zone_highest_possible_pfn[zone_type]; |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 4062 | adjust_zone_range_for_zone_movable(nid, zone_type, |
| 4063 | node_start_pfn, node_end_pfn, |
| 4064 | &zone_start_pfn, &zone_end_pfn); |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4065 | |
| 4066 | /* Check that this node has pages within the zone's required range */ |
| 4067 | if (zone_end_pfn < node_start_pfn || zone_start_pfn > node_end_pfn) |
| 4068 | return 0; |
| 4069 | |
| 4070 | /* Move the zone boundaries inside the node if necessary */ |
| 4071 | zone_end_pfn = min(zone_end_pfn, node_end_pfn); |
| 4072 | zone_start_pfn = max(zone_start_pfn, node_start_pfn); |
| 4073 | |
| 4074 | /* Return the spanned pages */ |
| 4075 | return zone_end_pfn - zone_start_pfn; |
| 4076 | } |
| 4077 | |
| 4078 | /* |
| 4079 | * Return the number of holes in a range on a node. If nid is MAX_NUMNODES, |
Randy Dunlap | 88ca3b9 | 2006-10-04 02:15:25 -0700 | [diff] [blame] | 4080 | * then all holes in the requested range will be accounted for. |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4081 | */ |
Yinghai Lu | 3299625 | 2009-12-15 17:59:02 -0800 | [diff] [blame] | 4082 | unsigned long __meminit __absent_pages_in_range(int nid, |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4083 | unsigned long range_start_pfn, |
| 4084 | unsigned long range_end_pfn) |
| 4085 | { |
| 4086 | int i = 0; |
| 4087 | unsigned long prev_end_pfn = 0, hole_pages = 0; |
| 4088 | unsigned long start_pfn; |
| 4089 | |
| 4090 | /* Find the end_pfn of the first active range of pfns in the node */ |
| 4091 | i = first_active_region_index_in_nid(nid); |
| 4092 | if (i == -1) |
| 4093 | return 0; |
| 4094 | |
Mel Gorman | b5445f9 | 2007-07-26 10:41:18 -0700 | [diff] [blame] | 4095 | prev_end_pfn = min(early_node_map[i].start_pfn, range_end_pfn); |
| 4096 | |
Mel Gorman | 9c7cd68 | 2006-09-27 01:49:58 -0700 | [diff] [blame] | 4097 | /* Account for ranges before physical memory on this node */ |
| 4098 | if (early_node_map[i].start_pfn > range_start_pfn) |
Mel Gorman | b5445f9 | 2007-07-26 10:41:18 -0700 | [diff] [blame] | 4099 | hole_pages = prev_end_pfn - range_start_pfn; |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4100 | |
| 4101 | /* Find all holes for the zone within the node */ |
| 4102 | for (; i != -1; i = next_active_region_index_in_nid(i, nid)) { |
| 4103 | |
| 4104 | /* No need to continue if prev_end_pfn is outside the zone */ |
| 4105 | if (prev_end_pfn >= range_end_pfn) |
| 4106 | break; |
| 4107 | |
| 4108 | /* Make sure the end of the zone is not within the hole */ |
| 4109 | start_pfn = min(early_node_map[i].start_pfn, range_end_pfn); |
| 4110 | prev_end_pfn = max(prev_end_pfn, range_start_pfn); |
| 4111 | |
| 4112 | /* Update the hole size cound and move on */ |
| 4113 | if (start_pfn > range_start_pfn) { |
| 4114 | BUG_ON(prev_end_pfn > start_pfn); |
| 4115 | hole_pages += start_pfn - prev_end_pfn; |
| 4116 | } |
| 4117 | prev_end_pfn = early_node_map[i].end_pfn; |
| 4118 | } |
| 4119 | |
Mel Gorman | 9c7cd68 | 2006-09-27 01:49:58 -0700 | [diff] [blame] | 4120 | /* Account for ranges past physical memory on this node */ |
| 4121 | if (range_end_pfn > prev_end_pfn) |
Mel Gorman | 0c6cb97 | 2006-10-28 10:38:59 -0700 | [diff] [blame] | 4122 | hole_pages += range_end_pfn - |
Mel Gorman | 9c7cd68 | 2006-09-27 01:49:58 -0700 | [diff] [blame] | 4123 | max(range_start_pfn, prev_end_pfn); |
| 4124 | |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4125 | return hole_pages; |
| 4126 | } |
| 4127 | |
| 4128 | /** |
| 4129 | * absent_pages_in_range - Return number of page frames in holes within a range |
| 4130 | * @start_pfn: The start PFN to start searching for holes |
| 4131 | * @end_pfn: The end PFN to stop searching for holes |
| 4132 | * |
Randy Dunlap | 88ca3b9 | 2006-10-04 02:15:25 -0700 | [diff] [blame] | 4133 | * It returns the number of pages frames in memory holes within a range. |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4134 | */ |
| 4135 | unsigned long __init absent_pages_in_range(unsigned long start_pfn, |
| 4136 | unsigned long end_pfn) |
| 4137 | { |
| 4138 | return __absent_pages_in_range(MAX_NUMNODES, start_pfn, end_pfn); |
| 4139 | } |
| 4140 | |
| 4141 | /* Return the number of page frames in holes in a zone on a node */ |
Paul Mundt | 6ea6e68 | 2007-07-15 23:38:20 -0700 | [diff] [blame] | 4142 | static unsigned long __meminit zone_absent_pages_in_node(int nid, |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4143 | unsigned long zone_type, |
| 4144 | unsigned long *ignored) |
| 4145 | { |
Mel Gorman | 9c7cd68 | 2006-09-27 01:49:58 -0700 | [diff] [blame] | 4146 | unsigned long node_start_pfn, node_end_pfn; |
| 4147 | unsigned long zone_start_pfn, zone_end_pfn; |
| 4148 | |
| 4149 | get_pfn_range_for_nid(nid, &node_start_pfn, &node_end_pfn); |
| 4150 | zone_start_pfn = max(arch_zone_lowest_possible_pfn[zone_type], |
| 4151 | node_start_pfn); |
| 4152 | zone_end_pfn = min(arch_zone_highest_possible_pfn[zone_type], |
| 4153 | node_end_pfn); |
| 4154 | |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 4155 | adjust_zone_range_for_zone_movable(nid, zone_type, |
| 4156 | node_start_pfn, node_end_pfn, |
| 4157 | &zone_start_pfn, &zone_end_pfn); |
Mel Gorman | 9c7cd68 | 2006-09-27 01:49:58 -0700 | [diff] [blame] | 4158 | return __absent_pages_in_range(nid, zone_start_pfn, zone_end_pfn); |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4159 | } |
Mel Gorman | 0e0b864 | 2006-09-27 01:49:56 -0700 | [diff] [blame] | 4160 | |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4161 | #else |
Paul Mundt | 6ea6e68 | 2007-07-15 23:38:20 -0700 | [diff] [blame] | 4162 | static inline unsigned long __meminit zone_spanned_pages_in_node(int nid, |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4163 | unsigned long zone_type, |
| 4164 | unsigned long *zones_size) |
| 4165 | { |
| 4166 | return zones_size[zone_type]; |
| 4167 | } |
| 4168 | |
Paul Mundt | 6ea6e68 | 2007-07-15 23:38:20 -0700 | [diff] [blame] | 4169 | static inline unsigned long __meminit zone_absent_pages_in_node(int nid, |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4170 | unsigned long zone_type, |
| 4171 | unsigned long *zholes_size) |
| 4172 | { |
| 4173 | if (!zholes_size) |
| 4174 | return 0; |
| 4175 | |
| 4176 | return zholes_size[zone_type]; |
| 4177 | } |
Mel Gorman | 0e0b864 | 2006-09-27 01:49:56 -0700 | [diff] [blame] | 4178 | |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4179 | #endif |
| 4180 | |
Yasunori Goto | a3142c8 | 2007-05-08 00:23:07 -0700 | [diff] [blame] | 4181 | static void __meminit calculate_node_totalpages(struct pglist_data *pgdat, |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4182 | unsigned long *zones_size, unsigned long *zholes_size) |
| 4183 | { |
| 4184 | unsigned long realtotalpages, totalpages = 0; |
| 4185 | enum zone_type i; |
| 4186 | |
| 4187 | for (i = 0; i < MAX_NR_ZONES; i++) |
| 4188 | totalpages += zone_spanned_pages_in_node(pgdat->node_id, i, |
| 4189 | zones_size); |
| 4190 | pgdat->node_spanned_pages = totalpages; |
| 4191 | |
| 4192 | realtotalpages = totalpages; |
| 4193 | for (i = 0; i < MAX_NR_ZONES; i++) |
| 4194 | realtotalpages -= |
| 4195 | zone_absent_pages_in_node(pgdat->node_id, i, |
| 4196 | zholes_size); |
| 4197 | pgdat->node_present_pages = realtotalpages; |
| 4198 | printk(KERN_DEBUG "On node %d totalpages: %lu\n", pgdat->node_id, |
| 4199 | realtotalpages); |
| 4200 | } |
| 4201 | |
Mel Gorman | 835c134 | 2007-10-16 01:25:47 -0700 | [diff] [blame] | 4202 | #ifndef CONFIG_SPARSEMEM |
| 4203 | /* |
| 4204 | * Calculate the size of the zone->blockflags rounded to an unsigned long |
Mel Gorman | d9c2340 | 2007-10-16 01:26:01 -0700 | [diff] [blame] | 4205 | * Start by making sure zonesize is a multiple of pageblock_order by rounding |
| 4206 | * up. Then use 1 NR_PAGEBLOCK_BITS worth of bits per pageblock, finally |
Mel Gorman | 835c134 | 2007-10-16 01:25:47 -0700 | [diff] [blame] | 4207 | * round what is now in bits to nearest long in bits, then return it in |
| 4208 | * bytes. |
| 4209 | */ |
| 4210 | static unsigned long __init usemap_size(unsigned long zonesize) |
| 4211 | { |
| 4212 | unsigned long usemapsize; |
| 4213 | |
Mel Gorman | d9c2340 | 2007-10-16 01:26:01 -0700 | [diff] [blame] | 4214 | usemapsize = roundup(zonesize, pageblock_nr_pages); |
| 4215 | usemapsize = usemapsize >> pageblock_order; |
Mel Gorman | 835c134 | 2007-10-16 01:25:47 -0700 | [diff] [blame] | 4216 | usemapsize *= NR_PAGEBLOCK_BITS; |
| 4217 | usemapsize = roundup(usemapsize, 8 * sizeof(unsigned long)); |
| 4218 | |
| 4219 | return usemapsize / 8; |
| 4220 | } |
| 4221 | |
| 4222 | static void __init setup_usemap(struct pglist_data *pgdat, |
| 4223 | struct zone *zone, unsigned long zonesize) |
| 4224 | { |
| 4225 | unsigned long usemapsize = usemap_size(zonesize); |
| 4226 | zone->pageblock_flags = NULL; |
Julia Lawall | 58a01a4 | 2009-01-06 14:39:28 -0800 | [diff] [blame] | 4227 | if (usemapsize) |
Yinghai Lu | 8f389a99 | 2011-05-11 15:13:32 -0700 | [diff] [blame] | 4228 | zone->pageblock_flags = alloc_bootmem_node_nopanic(pgdat, |
| 4229 | usemapsize); |
Mel Gorman | 835c134 | 2007-10-16 01:25:47 -0700 | [diff] [blame] | 4230 | } |
| 4231 | #else |
Jesper Juhl | fa9f90b | 2010-11-28 21:39:34 +0100 | [diff] [blame] | 4232 | static inline void setup_usemap(struct pglist_data *pgdat, |
Mel Gorman | 835c134 | 2007-10-16 01:25:47 -0700 | [diff] [blame] | 4233 | struct zone *zone, unsigned long zonesize) {} |
| 4234 | #endif /* CONFIG_SPARSEMEM */ |
| 4235 | |
Mel Gorman | d9c2340 | 2007-10-16 01:26:01 -0700 | [diff] [blame] | 4236 | #ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE |
Mel Gorman | ba72cb8 | 2007-11-28 16:21:13 -0800 | [diff] [blame] | 4237 | |
| 4238 | /* Return a sensible default order for the pageblock size. */ |
| 4239 | static inline int pageblock_default_order(void) |
| 4240 | { |
| 4241 | if (HPAGE_SHIFT > PAGE_SHIFT) |
| 4242 | return HUGETLB_PAGE_ORDER; |
| 4243 | |
| 4244 | return MAX_ORDER-1; |
| 4245 | } |
| 4246 | |
Mel Gorman | d9c2340 | 2007-10-16 01:26:01 -0700 | [diff] [blame] | 4247 | /* Initialise the number of pages represented by NR_PAGEBLOCK_BITS */ |
| 4248 | static inline void __init set_pageblock_order(unsigned int order) |
| 4249 | { |
| 4250 | /* Check that pageblock_nr_pages has not already been setup */ |
| 4251 | if (pageblock_order) |
| 4252 | return; |
| 4253 | |
| 4254 | /* |
| 4255 | * Assume the largest contiguous order of interest is a huge page. |
| 4256 | * This value may be variable depending on boot parameters on IA64 |
| 4257 | */ |
| 4258 | pageblock_order = order; |
| 4259 | } |
| 4260 | #else /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */ |
| 4261 | |
Mel Gorman | ba72cb8 | 2007-11-28 16:21:13 -0800 | [diff] [blame] | 4262 | /* |
| 4263 | * When CONFIG_HUGETLB_PAGE_SIZE_VARIABLE is not set, set_pageblock_order() |
| 4264 | * and pageblock_default_order() are unused as pageblock_order is set |
| 4265 | * at compile-time. See include/linux/pageblock-flags.h for the values of |
| 4266 | * pageblock_order based on the kernel config |
| 4267 | */ |
| 4268 | static inline int pageblock_default_order(unsigned int order) |
| 4269 | { |
| 4270 | return MAX_ORDER-1; |
| 4271 | } |
Mel Gorman | d9c2340 | 2007-10-16 01:26:01 -0700 | [diff] [blame] | 4272 | #define set_pageblock_order(x) do {} while (0) |
| 4273 | |
| 4274 | #endif /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */ |
| 4275 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4276 | /* |
| 4277 | * Set up the zone data structures: |
| 4278 | * - mark all pages reserved |
| 4279 | * - mark all memory queues empty |
| 4280 | * - clear the memory bitmaps |
| 4281 | */ |
Alexander van Heukelum | b5a0e01 | 2008-02-23 15:24:06 -0800 | [diff] [blame] | 4282 | static void __paginginit free_area_init_core(struct pglist_data *pgdat, |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4283 | unsigned long *zones_size, unsigned long *zholes_size) |
| 4284 | { |
Christoph Lameter | 2f1b624 | 2006-09-25 23:31:13 -0700 | [diff] [blame] | 4285 | enum zone_type j; |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 4286 | int nid = pgdat->node_id; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4287 | unsigned long zone_start_pfn = pgdat->node_start_pfn; |
Yasunori Goto | 718127c | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 4288 | int ret; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4289 | |
Dave Hansen | 208d54e | 2005-10-29 18:16:52 -0700 | [diff] [blame] | 4290 | pgdat_resize_init(pgdat); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4291 | pgdat->nr_zones = 0; |
| 4292 | init_waitqueue_head(&pgdat->kswapd_wait); |
| 4293 | pgdat->kswapd_max_order = 0; |
KAMEZAWA Hiroyuki | 52d4b9a | 2008-10-18 20:28:16 -0700 | [diff] [blame] | 4294 | pgdat_page_cgroup_init(pgdat); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4295 | |
| 4296 | for (j = 0; j < MAX_NR_ZONES; j++) { |
| 4297 | struct zone *zone = pgdat->node_zones + j; |
Mel Gorman | 0e0b864 | 2006-09-27 01:49:56 -0700 | [diff] [blame] | 4298 | unsigned long size, realsize, memmap_pages; |
Christoph Lameter | b69408e | 2008-10-18 20:26:14 -0700 | [diff] [blame] | 4299 | enum lru_list l; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4300 | |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4301 | size = zone_spanned_pages_in_node(nid, j, zones_size); |
| 4302 | realsize = size - zone_absent_pages_in_node(nid, j, |
| 4303 | zholes_size); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4304 | |
Mel Gorman | 0e0b864 | 2006-09-27 01:49:56 -0700 | [diff] [blame] | 4305 | /* |
| 4306 | * Adjust realsize so that it accounts for how much memory |
| 4307 | * is used by this zone for memmap. This affects the watermark |
| 4308 | * and per-cpu initialisations |
| 4309 | */ |
Johannes Weiner | f723215 | 2008-05-23 13:04:21 -0700 | [diff] [blame] | 4310 | memmap_pages = |
| 4311 | PAGE_ALIGN(size * sizeof(struct page)) >> PAGE_SHIFT; |
Mel Gorman | 0e0b864 | 2006-09-27 01:49:56 -0700 | [diff] [blame] | 4312 | if (realsize >= memmap_pages) { |
| 4313 | realsize -= memmap_pages; |
Yinghai Lu | 5594c8c | 2009-01-06 14:39:14 -0800 | [diff] [blame] | 4314 | if (memmap_pages) |
| 4315 | printk(KERN_DEBUG |
| 4316 | " %s zone: %lu pages used for memmap\n", |
| 4317 | zone_names[j], memmap_pages); |
Mel Gorman | 0e0b864 | 2006-09-27 01:49:56 -0700 | [diff] [blame] | 4318 | } else |
| 4319 | printk(KERN_WARNING |
| 4320 | " %s zone: %lu pages exceeds realsize %lu\n", |
| 4321 | zone_names[j], memmap_pages, realsize); |
| 4322 | |
Christoph Lameter | 6267276 | 2007-02-10 01:43:07 -0800 | [diff] [blame] | 4323 | /* Account for reserved pages */ |
| 4324 | if (j == 0 && realsize > dma_reserve) { |
Mel Gorman | 0e0b864 | 2006-09-27 01:49:56 -0700 | [diff] [blame] | 4325 | realsize -= dma_reserve; |
Yinghai Lu | d903ef9 | 2008-10-18 20:27:06 -0700 | [diff] [blame] | 4326 | printk(KERN_DEBUG " %s zone: %lu pages reserved\n", |
Christoph Lameter | 6267276 | 2007-02-10 01:43:07 -0800 | [diff] [blame] | 4327 | zone_names[0], dma_reserve); |
Mel Gorman | 0e0b864 | 2006-09-27 01:49:56 -0700 | [diff] [blame] | 4328 | } |
| 4329 | |
Christoph Lameter | 98d2b0e | 2006-09-25 23:31:12 -0700 | [diff] [blame] | 4330 | if (!is_highmem_idx(j)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4331 | nr_kernel_pages += realsize; |
| 4332 | nr_all_pages += realsize; |
| 4333 | |
| 4334 | zone->spanned_pages = size; |
| 4335 | zone->present_pages = realsize; |
Christoph Lameter | 9614634 | 2006-07-03 00:24:13 -0700 | [diff] [blame] | 4336 | #ifdef CONFIG_NUMA |
Christoph Lameter | d5f541e | 2006-09-27 01:50:08 -0700 | [diff] [blame] | 4337 | zone->node = nid; |
Christoph Lameter | 8417bba | 2006-09-25 23:31:51 -0700 | [diff] [blame] | 4338 | zone->min_unmapped_pages = (realsize*sysctl_min_unmapped_ratio) |
Christoph Lameter | 9614634 | 2006-07-03 00:24:13 -0700 | [diff] [blame] | 4339 | / 100; |
Christoph Lameter | 0ff3849 | 2006-09-25 23:31:52 -0700 | [diff] [blame] | 4340 | zone->min_slab_pages = (realsize * sysctl_min_slab_ratio) / 100; |
Christoph Lameter | 9614634 | 2006-07-03 00:24:13 -0700 | [diff] [blame] | 4341 | #endif |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4342 | zone->name = zone_names[j]; |
| 4343 | spin_lock_init(&zone->lock); |
| 4344 | spin_lock_init(&zone->lru_lock); |
Dave Hansen | bdc8cb9 | 2005-10-29 18:16:53 -0700 | [diff] [blame] | 4345 | zone_seqlock_init(zone); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4346 | zone->zone_pgdat = pgdat; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4347 | |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 4348 | zone_pcp_init(zone); |
KAMEZAWA Hiroyuki | 246e87a | 2011-05-26 16:25:34 -0700 | [diff] [blame] | 4349 | for_each_lru(l) |
Christoph Lameter | b69408e | 2008-10-18 20:26:14 -0700 | [diff] [blame] | 4350 | INIT_LIST_HEAD(&zone->lru[l].list); |
KOSAKI Motohiro | 6e90157 | 2009-01-07 18:08:15 -0800 | [diff] [blame] | 4351 | zone->reclaim_stat.recent_rotated[0] = 0; |
| 4352 | zone->reclaim_stat.recent_rotated[1] = 0; |
| 4353 | zone->reclaim_stat.recent_scanned[0] = 0; |
| 4354 | zone->reclaim_stat.recent_scanned[1] = 0; |
Christoph Lameter | 2244b95 | 2006-06-30 01:55:33 -0700 | [diff] [blame] | 4355 | zap_zone_vm_stats(zone); |
David Rientjes | e815af9 | 2007-10-16 23:25:54 -0700 | [diff] [blame] | 4356 | zone->flags = 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4357 | if (!size) |
| 4358 | continue; |
| 4359 | |
Mel Gorman | ba72cb8 | 2007-11-28 16:21:13 -0800 | [diff] [blame] | 4360 | set_pageblock_order(pageblock_default_order()); |
Mel Gorman | 835c134 | 2007-10-16 01:25:47 -0700 | [diff] [blame] | 4361 | setup_usemap(pgdat, zone, size); |
Dave Hansen | a2f3aa02 | 2007-01-10 23:15:30 -0800 | [diff] [blame] | 4362 | ret = init_currently_empty_zone(zone, zone_start_pfn, |
| 4363 | size, MEMMAP_EARLY); |
Yasunori Goto | 718127c | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 4364 | BUG_ON(ret); |
Heiko Carstens | 76cdd58 | 2008-05-14 16:05:52 -0700 | [diff] [blame] | 4365 | memmap_init(size, nid, j, zone_start_pfn); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4366 | zone_start_pfn += size; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4367 | } |
| 4368 | } |
| 4369 | |
Sam Ravnborg | 577a32f | 2007-05-17 23:29:25 +0200 | [diff] [blame] | 4370 | static void __init_refok alloc_node_mem_map(struct pglist_data *pgdat) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4371 | { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4372 | /* Skip empty nodes */ |
| 4373 | if (!pgdat->node_spanned_pages) |
| 4374 | return; |
| 4375 | |
Andy Whitcroft | d41dee3 | 2005-06-23 00:07:54 -0700 | [diff] [blame] | 4376 | #ifdef CONFIG_FLAT_NODE_MEM_MAP |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4377 | /* ia64 gets its own node_mem_map, before this, without bootmem */ |
| 4378 | if (!pgdat->node_mem_map) { |
Bob Picco | e984bb4 | 2006-05-20 15:00:31 -0700 | [diff] [blame] | 4379 | unsigned long size, start, end; |
Andy Whitcroft | d41dee3 | 2005-06-23 00:07:54 -0700 | [diff] [blame] | 4380 | struct page *map; |
| 4381 | |
Bob Picco | e984bb4 | 2006-05-20 15:00:31 -0700 | [diff] [blame] | 4382 | /* |
| 4383 | * The zone's endpoints aren't required to be MAX_ORDER |
| 4384 | * aligned but the node_mem_map endpoints must be in order |
| 4385 | * for the buddy allocator to function correctly. |
| 4386 | */ |
| 4387 | start = pgdat->node_start_pfn & ~(MAX_ORDER_NR_PAGES - 1); |
| 4388 | end = pgdat->node_start_pfn + pgdat->node_spanned_pages; |
| 4389 | end = ALIGN(end, MAX_ORDER_NR_PAGES); |
| 4390 | size = (end - start) * sizeof(struct page); |
Dave Hansen | 6f167ec | 2005-06-23 00:07:39 -0700 | [diff] [blame] | 4391 | map = alloc_remap(pgdat->node_id, size); |
| 4392 | if (!map) |
Yinghai Lu | 8f389a99 | 2011-05-11 15:13:32 -0700 | [diff] [blame] | 4393 | map = alloc_bootmem_node_nopanic(pgdat, size); |
Bob Picco | e984bb4 | 2006-05-20 15:00:31 -0700 | [diff] [blame] | 4394 | pgdat->node_mem_map = map + (pgdat->node_start_pfn - start); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4395 | } |
Roman Zippel | 12d810c | 2007-05-31 00:40:54 -0700 | [diff] [blame] | 4396 | #ifndef CONFIG_NEED_MULTIPLE_NODES |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4397 | /* |
| 4398 | * With no DISCONTIG, the global mem_map is just set as node 0's |
| 4399 | */ |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4400 | if (pgdat == NODE_DATA(0)) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4401 | mem_map = NODE_DATA(0)->node_mem_map; |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4402 | #ifdef CONFIG_ARCH_POPULATES_NODE_MAP |
| 4403 | if (page_to_pfn(mem_map) != pgdat->node_start_pfn) |
Thomas Bogendoerfer | 467bc46 | 2008-01-08 15:33:11 -0800 | [diff] [blame] | 4404 | mem_map -= (pgdat->node_start_pfn - ARCH_PFN_OFFSET); |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4405 | #endif /* CONFIG_ARCH_POPULATES_NODE_MAP */ |
| 4406 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4407 | #endif |
Andy Whitcroft | d41dee3 | 2005-06-23 00:07:54 -0700 | [diff] [blame] | 4408 | #endif /* CONFIG_FLAT_NODE_MEM_MAP */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4409 | } |
| 4410 | |
Johannes Weiner | 9109fb7 | 2008-07-23 21:27:20 -0700 | [diff] [blame] | 4411 | void __paginginit free_area_init_node(int nid, unsigned long *zones_size, |
| 4412 | unsigned long node_start_pfn, unsigned long *zholes_size) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4413 | { |
Johannes Weiner | 9109fb7 | 2008-07-23 21:27:20 -0700 | [diff] [blame] | 4414 | pg_data_t *pgdat = NODE_DATA(nid); |
| 4415 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4416 | pgdat->node_id = nid; |
| 4417 | pgdat->node_start_pfn = node_start_pfn; |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4418 | calculate_node_totalpages(pgdat, zones_size, zholes_size); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4419 | |
| 4420 | alloc_node_mem_map(pgdat); |
Yinghai Lu | e8c27ac | 2008-06-01 13:15:22 -0700 | [diff] [blame] | 4421 | #ifdef CONFIG_FLAT_NODE_MEM_MAP |
| 4422 | printk(KERN_DEBUG "free_area_init_node: node %d, pgdat %08lx, node_mem_map %08lx\n", |
| 4423 | nid, (unsigned long)pgdat, |
| 4424 | (unsigned long)pgdat->node_mem_map); |
| 4425 | #endif |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4426 | |
| 4427 | free_area_init_core(pgdat, zones_size, zholes_size); |
| 4428 | } |
| 4429 | |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4430 | #ifdef CONFIG_ARCH_POPULATES_NODE_MAP |
Miklos Szeredi | 418508c | 2007-05-23 13:57:55 -0700 | [diff] [blame] | 4431 | |
| 4432 | #if MAX_NUMNODES > 1 |
| 4433 | /* |
| 4434 | * Figure out the number of possible node ids. |
| 4435 | */ |
| 4436 | static void __init setup_nr_node_ids(void) |
| 4437 | { |
| 4438 | unsigned int node; |
| 4439 | unsigned int highest = 0; |
| 4440 | |
| 4441 | for_each_node_mask(node, node_possible_map) |
| 4442 | highest = node; |
| 4443 | nr_node_ids = highest + 1; |
| 4444 | } |
| 4445 | #else |
| 4446 | static inline void setup_nr_node_ids(void) |
| 4447 | { |
| 4448 | } |
| 4449 | #endif |
| 4450 | |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4451 | /** |
| 4452 | * add_active_range - Register a range of PFNs backed by physical memory |
| 4453 | * @nid: The node ID the range resides on |
| 4454 | * @start_pfn: The start PFN of the available physical memory |
| 4455 | * @end_pfn: The end PFN of the available physical memory |
| 4456 | * |
| 4457 | * These ranges are stored in an early_node_map[] and later used by |
| 4458 | * free_area_init_nodes() to calculate zone sizes and holes. If the |
| 4459 | * range spans a memory hole, it is up to the architecture to ensure |
| 4460 | * the memory is not freed by the bootmem allocator. If possible |
| 4461 | * the range being registered will be merged with existing ranges. |
| 4462 | */ |
| 4463 | void __init add_active_range(unsigned int nid, unsigned long start_pfn, |
| 4464 | unsigned long end_pfn) |
| 4465 | { |
| 4466 | int i; |
| 4467 | |
Mel Gorman | 6b74ab9 | 2008-07-23 21:26:49 -0700 | [diff] [blame] | 4468 | mminit_dprintk(MMINIT_TRACE, "memory_register", |
| 4469 | "Entering add_active_range(%d, %#lx, %#lx) " |
| 4470 | "%d entries of %d used\n", |
| 4471 | nid, start_pfn, end_pfn, |
| 4472 | nr_nodemap_entries, MAX_ACTIVE_REGIONS); |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4473 | |
Mel Gorman | 2dbb51c | 2008-07-23 21:26:52 -0700 | [diff] [blame] | 4474 | mminit_validate_memmodel_limits(&start_pfn, &end_pfn); |
| 4475 | |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4476 | /* Merge with existing active regions if possible */ |
| 4477 | for (i = 0; i < nr_nodemap_entries; i++) { |
| 4478 | if (early_node_map[i].nid != nid) |
| 4479 | continue; |
| 4480 | |
| 4481 | /* Skip if an existing region covers this new one */ |
| 4482 | if (start_pfn >= early_node_map[i].start_pfn && |
| 4483 | end_pfn <= early_node_map[i].end_pfn) |
| 4484 | return; |
| 4485 | |
| 4486 | /* Merge forward if suitable */ |
| 4487 | if (start_pfn <= early_node_map[i].end_pfn && |
| 4488 | end_pfn > early_node_map[i].end_pfn) { |
| 4489 | early_node_map[i].end_pfn = end_pfn; |
| 4490 | return; |
| 4491 | } |
| 4492 | |
| 4493 | /* Merge backward if suitable */ |
Kazuhisa Ichikawa | d2dbe08 | 2010-01-15 17:01:20 -0800 | [diff] [blame] | 4494 | if (start_pfn < early_node_map[i].start_pfn && |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4495 | end_pfn >= early_node_map[i].start_pfn) { |
| 4496 | early_node_map[i].start_pfn = start_pfn; |
| 4497 | return; |
| 4498 | } |
| 4499 | } |
| 4500 | |
| 4501 | /* Check that early_node_map is large enough */ |
| 4502 | if (i >= MAX_ACTIVE_REGIONS) { |
| 4503 | printk(KERN_CRIT "More than %d memory regions, truncating\n", |
| 4504 | MAX_ACTIVE_REGIONS); |
| 4505 | return; |
| 4506 | } |
| 4507 | |
| 4508 | early_node_map[i].nid = nid; |
| 4509 | early_node_map[i].start_pfn = start_pfn; |
| 4510 | early_node_map[i].end_pfn = end_pfn; |
| 4511 | nr_nodemap_entries = i + 1; |
| 4512 | } |
| 4513 | |
| 4514 | /** |
Yinghai Lu | cc1050b | 2008-06-13 19:08:52 -0700 | [diff] [blame] | 4515 | * remove_active_range - Shrink an existing registered range of PFNs |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4516 | * @nid: The node id the range is on that should be shrunk |
Yinghai Lu | cc1050b | 2008-06-13 19:08:52 -0700 | [diff] [blame] | 4517 | * @start_pfn: The new PFN of the range |
| 4518 | * @end_pfn: The new PFN of the range |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4519 | * |
| 4520 | * i386 with NUMA use alloc_remap() to store a node_mem_map on a local node. |
Yinghai Lu | cc1a9d8 | 2008-06-08 19:39:16 -0700 | [diff] [blame] | 4521 | * The map is kept near the end physical page range that has already been |
| 4522 | * registered. This function allows an arch to shrink an existing registered |
| 4523 | * range. |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4524 | */ |
Yinghai Lu | cc1050b | 2008-06-13 19:08:52 -0700 | [diff] [blame] | 4525 | void __init remove_active_range(unsigned int nid, unsigned long start_pfn, |
| 4526 | unsigned long end_pfn) |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4527 | { |
Yinghai Lu | cc1a9d8 | 2008-06-08 19:39:16 -0700 | [diff] [blame] | 4528 | int i, j; |
| 4529 | int removed = 0; |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4530 | |
Yinghai Lu | cc1050b | 2008-06-13 19:08:52 -0700 | [diff] [blame] | 4531 | printk(KERN_DEBUG "remove_active_range (%d, %lu, %lu)\n", |
| 4532 | nid, start_pfn, end_pfn); |
| 4533 | |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4534 | /* Find the old active region end and shrink */ |
Yinghai Lu | cc1a9d8 | 2008-06-08 19:39:16 -0700 | [diff] [blame] | 4535 | for_each_active_range_index_in_nid(i, nid) { |
Yinghai Lu | cc1050b | 2008-06-13 19:08:52 -0700 | [diff] [blame] | 4536 | if (early_node_map[i].start_pfn >= start_pfn && |
| 4537 | early_node_map[i].end_pfn <= end_pfn) { |
Yinghai Lu | cc1a9d8 | 2008-06-08 19:39:16 -0700 | [diff] [blame] | 4538 | /* clear it */ |
Yinghai Lu | cc1050b | 2008-06-13 19:08:52 -0700 | [diff] [blame] | 4539 | early_node_map[i].start_pfn = 0; |
Yinghai Lu | cc1a9d8 | 2008-06-08 19:39:16 -0700 | [diff] [blame] | 4540 | early_node_map[i].end_pfn = 0; |
| 4541 | removed = 1; |
| 4542 | continue; |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4543 | } |
Yinghai Lu | cc1050b | 2008-06-13 19:08:52 -0700 | [diff] [blame] | 4544 | if (early_node_map[i].start_pfn < start_pfn && |
| 4545 | early_node_map[i].end_pfn > start_pfn) { |
| 4546 | unsigned long temp_end_pfn = early_node_map[i].end_pfn; |
| 4547 | early_node_map[i].end_pfn = start_pfn; |
| 4548 | if (temp_end_pfn > end_pfn) |
| 4549 | add_active_range(nid, end_pfn, temp_end_pfn); |
| 4550 | continue; |
| 4551 | } |
| 4552 | if (early_node_map[i].start_pfn >= start_pfn && |
| 4553 | early_node_map[i].end_pfn > end_pfn && |
| 4554 | early_node_map[i].start_pfn < end_pfn) { |
| 4555 | early_node_map[i].start_pfn = end_pfn; |
Yinghai Lu | cc1a9d8 | 2008-06-08 19:39:16 -0700 | [diff] [blame] | 4556 | continue; |
| 4557 | } |
| 4558 | } |
| 4559 | |
| 4560 | if (!removed) |
| 4561 | return; |
| 4562 | |
| 4563 | /* remove the blank ones */ |
| 4564 | for (i = nr_nodemap_entries - 1; i > 0; i--) { |
| 4565 | if (early_node_map[i].nid != nid) |
| 4566 | continue; |
| 4567 | if (early_node_map[i].end_pfn) |
| 4568 | continue; |
| 4569 | /* we found it, get rid of it */ |
| 4570 | for (j = i; j < nr_nodemap_entries - 1; j++) |
| 4571 | memcpy(&early_node_map[j], &early_node_map[j+1], |
| 4572 | sizeof(early_node_map[j])); |
| 4573 | j = nr_nodemap_entries - 1; |
| 4574 | memset(&early_node_map[j], 0, sizeof(early_node_map[j])); |
| 4575 | nr_nodemap_entries--; |
| 4576 | } |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4577 | } |
| 4578 | |
| 4579 | /** |
| 4580 | * remove_all_active_ranges - Remove all currently registered regions |
Randy Dunlap | 88ca3b9 | 2006-10-04 02:15:25 -0700 | [diff] [blame] | 4581 | * |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4582 | * During discovery, it may be found that a table like SRAT is invalid |
| 4583 | * and an alternative discovery method must be used. This function removes |
| 4584 | * all currently registered regions. |
| 4585 | */ |
Randy Dunlap | 88ca3b9 | 2006-10-04 02:15:25 -0700 | [diff] [blame] | 4586 | void __init remove_all_active_ranges(void) |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4587 | { |
| 4588 | memset(early_node_map, 0, sizeof(early_node_map)); |
| 4589 | nr_nodemap_entries = 0; |
| 4590 | } |
| 4591 | |
| 4592 | /* Compare two active node_active_regions */ |
| 4593 | static int __init cmp_node_active_region(const void *a, const void *b) |
| 4594 | { |
| 4595 | struct node_active_region *arange = (struct node_active_region *)a; |
| 4596 | struct node_active_region *brange = (struct node_active_region *)b; |
| 4597 | |
| 4598 | /* Done this way to avoid overflows */ |
| 4599 | if (arange->start_pfn > brange->start_pfn) |
| 4600 | return 1; |
| 4601 | if (arange->start_pfn < brange->start_pfn) |
| 4602 | return -1; |
| 4603 | |
| 4604 | return 0; |
| 4605 | } |
| 4606 | |
| 4607 | /* sort the node_map by start_pfn */ |
Yinghai Lu | 3299625 | 2009-12-15 17:59:02 -0800 | [diff] [blame] | 4608 | void __init sort_node_map(void) |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4609 | { |
| 4610 | sort(early_node_map, (size_t)nr_nodemap_entries, |
| 4611 | sizeof(struct node_active_region), |
| 4612 | cmp_node_active_region, NULL); |
| 4613 | } |
| 4614 | |
Tejun Heo | 1e01979 | 2011-07-12 09:45:34 +0200 | [diff] [blame] | 4615 | /** |
| 4616 | * node_map_pfn_alignment - determine the maximum internode alignment |
| 4617 | * |
| 4618 | * This function should be called after node map is populated and sorted. |
| 4619 | * It calculates the maximum power of two alignment which can distinguish |
| 4620 | * all the nodes. |
| 4621 | * |
| 4622 | * For example, if all nodes are 1GiB and aligned to 1GiB, the return value |
| 4623 | * would indicate 1GiB alignment with (1 << (30 - PAGE_SHIFT)). If the |
| 4624 | * nodes are shifted by 256MiB, 256MiB. Note that if only the last node is |
| 4625 | * shifted, 1GiB is enough and this function will indicate so. |
| 4626 | * |
| 4627 | * This is used to test whether pfn -> nid mapping of the chosen memory |
| 4628 | * model has fine enough granularity to avoid incorrect mapping for the |
| 4629 | * populated node map. |
| 4630 | * |
| 4631 | * Returns the determined alignment in pfn's. 0 if there is no alignment |
| 4632 | * requirement (single node). |
| 4633 | */ |
| 4634 | unsigned long __init node_map_pfn_alignment(void) |
| 4635 | { |
| 4636 | unsigned long accl_mask = 0, last_end = 0; |
| 4637 | int last_nid = -1; |
| 4638 | int i; |
| 4639 | |
| 4640 | for_each_active_range_index_in_nid(i, MAX_NUMNODES) { |
| 4641 | int nid = early_node_map[i].nid; |
| 4642 | unsigned long start = early_node_map[i].start_pfn; |
| 4643 | unsigned long end = early_node_map[i].end_pfn; |
| 4644 | unsigned long mask; |
| 4645 | |
| 4646 | if (!start || last_nid < 0 || last_nid == nid) { |
| 4647 | last_nid = nid; |
| 4648 | last_end = end; |
| 4649 | continue; |
| 4650 | } |
| 4651 | |
| 4652 | /* |
| 4653 | * Start with a mask granular enough to pin-point to the |
| 4654 | * start pfn and tick off bits one-by-one until it becomes |
| 4655 | * too coarse to separate the current node from the last. |
| 4656 | */ |
| 4657 | mask = ~((1 << __ffs(start)) - 1); |
| 4658 | while (mask && last_end <= (start & (mask << 1))) |
| 4659 | mask <<= 1; |
| 4660 | |
| 4661 | /* accumulate all internode masks */ |
| 4662 | accl_mask |= mask; |
| 4663 | } |
| 4664 | |
| 4665 | /* convert mask to number of pages */ |
| 4666 | return ~accl_mask + 1; |
| 4667 | } |
| 4668 | |
Mel Gorman | a6af2bc | 2007-02-10 01:42:57 -0800 | [diff] [blame] | 4669 | /* Find the lowest pfn for a node */ |
Adrian Bunk | b69a728 | 2008-07-23 21:28:12 -0700 | [diff] [blame] | 4670 | static unsigned long __init find_min_pfn_for_node(int nid) |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4671 | { |
| 4672 | int i; |
Mel Gorman | a6af2bc | 2007-02-10 01:42:57 -0800 | [diff] [blame] | 4673 | unsigned long min_pfn = ULONG_MAX; |
Mel Gorman | 1abbfb4 | 2006-11-23 12:01:41 +0000 | [diff] [blame] | 4674 | |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4675 | /* Assuming a sorted map, the first range found has the starting pfn */ |
| 4676 | for_each_active_range_index_in_nid(i, nid) |
Mel Gorman | a6af2bc | 2007-02-10 01:42:57 -0800 | [diff] [blame] | 4677 | min_pfn = min(min_pfn, early_node_map[i].start_pfn); |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4678 | |
Mel Gorman | a6af2bc | 2007-02-10 01:42:57 -0800 | [diff] [blame] | 4679 | if (min_pfn == ULONG_MAX) { |
| 4680 | printk(KERN_WARNING |
Paul Jackson | 2bc0d261 | 2008-06-22 07:22:17 -0700 | [diff] [blame] | 4681 | "Could not find start_pfn for node %d\n", nid); |
Mel Gorman | a6af2bc | 2007-02-10 01:42:57 -0800 | [diff] [blame] | 4682 | return 0; |
| 4683 | } |
| 4684 | |
| 4685 | return min_pfn; |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4686 | } |
| 4687 | |
| 4688 | /** |
| 4689 | * find_min_pfn_with_active_regions - Find the minimum PFN registered |
| 4690 | * |
| 4691 | * It returns the minimum PFN based on information provided via |
Randy Dunlap | 88ca3b9 | 2006-10-04 02:15:25 -0700 | [diff] [blame] | 4692 | * add_active_range(). |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4693 | */ |
| 4694 | unsigned long __init find_min_pfn_with_active_regions(void) |
| 4695 | { |
| 4696 | return find_min_pfn_for_node(MAX_NUMNODES); |
| 4697 | } |
| 4698 | |
Lee Schermerhorn | 37b07e4 | 2007-10-16 01:25:39 -0700 | [diff] [blame] | 4699 | /* |
| 4700 | * early_calculate_totalpages() |
| 4701 | * Sum pages in active regions for movable zone. |
| 4702 | * Populate N_HIGH_MEMORY for calculating usable_nodes. |
| 4703 | */ |
Adrian Bunk | 484f51f | 2007-10-16 01:26:03 -0700 | [diff] [blame] | 4704 | static unsigned long __init early_calculate_totalpages(void) |
Mel Gorman | 7e63efe | 2007-07-17 04:03:15 -0700 | [diff] [blame] | 4705 | { |
| 4706 | int i; |
| 4707 | unsigned long totalpages = 0; |
| 4708 | |
Lee Schermerhorn | 37b07e4 | 2007-10-16 01:25:39 -0700 | [diff] [blame] | 4709 | for (i = 0; i < nr_nodemap_entries; i++) { |
| 4710 | unsigned long pages = early_node_map[i].end_pfn - |
Mel Gorman | 7e63efe | 2007-07-17 04:03:15 -0700 | [diff] [blame] | 4711 | early_node_map[i].start_pfn; |
Lee Schermerhorn | 37b07e4 | 2007-10-16 01:25:39 -0700 | [diff] [blame] | 4712 | totalpages += pages; |
| 4713 | if (pages) |
| 4714 | node_set_state(early_node_map[i].nid, N_HIGH_MEMORY); |
| 4715 | } |
| 4716 | return totalpages; |
Mel Gorman | 7e63efe | 2007-07-17 04:03:15 -0700 | [diff] [blame] | 4717 | } |
| 4718 | |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 4719 | /* |
| 4720 | * Find the PFN the Movable zone begins in each node. Kernel memory |
| 4721 | * is spread evenly between nodes as long as the nodes have enough |
| 4722 | * memory. When they don't, some nodes will have more kernelcore than |
| 4723 | * others |
| 4724 | */ |
Adrian Bunk | b69a728 | 2008-07-23 21:28:12 -0700 | [diff] [blame] | 4725 | static void __init find_zone_movable_pfns_for_nodes(unsigned long *movable_pfn) |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 4726 | { |
| 4727 | int i, nid; |
| 4728 | unsigned long usable_startpfn; |
| 4729 | unsigned long kernelcore_node, kernelcore_remaining; |
Yinghai Lu | 66918dc | 2009-06-30 11:41:37 -0700 | [diff] [blame] | 4730 | /* save the state before borrow the nodemask */ |
| 4731 | nodemask_t saved_node_state = node_states[N_HIGH_MEMORY]; |
Lee Schermerhorn | 37b07e4 | 2007-10-16 01:25:39 -0700 | [diff] [blame] | 4732 | unsigned long totalpages = early_calculate_totalpages(); |
| 4733 | int usable_nodes = nodes_weight(node_states[N_HIGH_MEMORY]); |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 4734 | |
Mel Gorman | 7e63efe | 2007-07-17 04:03:15 -0700 | [diff] [blame] | 4735 | /* |
| 4736 | * If movablecore was specified, calculate what size of |
| 4737 | * kernelcore that corresponds so that memory usable for |
| 4738 | * any allocation type is evenly spread. If both kernelcore |
| 4739 | * and movablecore are specified, then the value of kernelcore |
| 4740 | * will be used for required_kernelcore if it's greater than |
| 4741 | * what movablecore would have allowed. |
| 4742 | */ |
| 4743 | if (required_movablecore) { |
Mel Gorman | 7e63efe | 2007-07-17 04:03:15 -0700 | [diff] [blame] | 4744 | unsigned long corepages; |
| 4745 | |
| 4746 | /* |
| 4747 | * Round-up so that ZONE_MOVABLE is at least as large as what |
| 4748 | * was requested by the user |
| 4749 | */ |
| 4750 | required_movablecore = |
| 4751 | roundup(required_movablecore, MAX_ORDER_NR_PAGES); |
| 4752 | corepages = totalpages - required_movablecore; |
| 4753 | |
| 4754 | required_kernelcore = max(required_kernelcore, corepages); |
| 4755 | } |
| 4756 | |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 4757 | /* If kernelcore was not specified, there is no ZONE_MOVABLE */ |
| 4758 | if (!required_kernelcore) |
Yinghai Lu | 66918dc | 2009-06-30 11:41:37 -0700 | [diff] [blame] | 4759 | goto out; |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 4760 | |
| 4761 | /* usable_startpfn is the lowest possible pfn ZONE_MOVABLE can be at */ |
| 4762 | find_usable_zone_for_movable(); |
| 4763 | usable_startpfn = arch_zone_lowest_possible_pfn[movable_zone]; |
| 4764 | |
| 4765 | restart: |
| 4766 | /* Spread kernelcore memory as evenly as possible throughout nodes */ |
| 4767 | kernelcore_node = required_kernelcore / usable_nodes; |
Lee Schermerhorn | 37b07e4 | 2007-10-16 01:25:39 -0700 | [diff] [blame] | 4768 | for_each_node_state(nid, N_HIGH_MEMORY) { |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 4769 | /* |
| 4770 | * Recalculate kernelcore_node if the division per node |
| 4771 | * now exceeds what is necessary to satisfy the requested |
| 4772 | * amount of memory for the kernel |
| 4773 | */ |
| 4774 | if (required_kernelcore < kernelcore_node) |
| 4775 | kernelcore_node = required_kernelcore / usable_nodes; |
| 4776 | |
| 4777 | /* |
| 4778 | * As the map is walked, we track how much memory is usable |
| 4779 | * by the kernel using kernelcore_remaining. When it is |
| 4780 | * 0, the rest of the node is usable by ZONE_MOVABLE |
| 4781 | */ |
| 4782 | kernelcore_remaining = kernelcore_node; |
| 4783 | |
| 4784 | /* Go through each range of PFNs within this node */ |
| 4785 | for_each_active_range_index_in_nid(i, nid) { |
| 4786 | unsigned long start_pfn, end_pfn; |
| 4787 | unsigned long size_pages; |
| 4788 | |
| 4789 | start_pfn = max(early_node_map[i].start_pfn, |
| 4790 | zone_movable_pfn[nid]); |
| 4791 | end_pfn = early_node_map[i].end_pfn; |
| 4792 | if (start_pfn >= end_pfn) |
| 4793 | continue; |
| 4794 | |
| 4795 | /* Account for what is only usable for kernelcore */ |
| 4796 | if (start_pfn < usable_startpfn) { |
| 4797 | unsigned long kernel_pages; |
| 4798 | kernel_pages = min(end_pfn, usable_startpfn) |
| 4799 | - start_pfn; |
| 4800 | |
| 4801 | kernelcore_remaining -= min(kernel_pages, |
| 4802 | kernelcore_remaining); |
| 4803 | required_kernelcore -= min(kernel_pages, |
| 4804 | required_kernelcore); |
| 4805 | |
| 4806 | /* Continue if range is now fully accounted */ |
| 4807 | if (end_pfn <= usable_startpfn) { |
| 4808 | |
| 4809 | /* |
| 4810 | * Push zone_movable_pfn to the end so |
| 4811 | * that if we have to rebalance |
| 4812 | * kernelcore across nodes, we will |
| 4813 | * not double account here |
| 4814 | */ |
| 4815 | zone_movable_pfn[nid] = end_pfn; |
| 4816 | continue; |
| 4817 | } |
| 4818 | start_pfn = usable_startpfn; |
| 4819 | } |
| 4820 | |
| 4821 | /* |
| 4822 | * The usable PFN range for ZONE_MOVABLE is from |
| 4823 | * start_pfn->end_pfn. Calculate size_pages as the |
| 4824 | * number of pages used as kernelcore |
| 4825 | */ |
| 4826 | size_pages = end_pfn - start_pfn; |
| 4827 | if (size_pages > kernelcore_remaining) |
| 4828 | size_pages = kernelcore_remaining; |
| 4829 | zone_movable_pfn[nid] = start_pfn + size_pages; |
| 4830 | |
| 4831 | /* |
| 4832 | * Some kernelcore has been met, update counts and |
| 4833 | * break if the kernelcore for this node has been |
| 4834 | * satisified |
| 4835 | */ |
| 4836 | required_kernelcore -= min(required_kernelcore, |
| 4837 | size_pages); |
| 4838 | kernelcore_remaining -= size_pages; |
| 4839 | if (!kernelcore_remaining) |
| 4840 | break; |
| 4841 | } |
| 4842 | } |
| 4843 | |
| 4844 | /* |
| 4845 | * If there is still required_kernelcore, we do another pass with one |
| 4846 | * less node in the count. This will push zone_movable_pfn[nid] further |
| 4847 | * along on the nodes that still have memory until kernelcore is |
| 4848 | * satisified |
| 4849 | */ |
| 4850 | usable_nodes--; |
| 4851 | if (usable_nodes && required_kernelcore > usable_nodes) |
| 4852 | goto restart; |
| 4853 | |
| 4854 | /* Align start of ZONE_MOVABLE on all nids to MAX_ORDER_NR_PAGES */ |
| 4855 | for (nid = 0; nid < MAX_NUMNODES; nid++) |
| 4856 | zone_movable_pfn[nid] = |
| 4857 | roundup(zone_movable_pfn[nid], MAX_ORDER_NR_PAGES); |
Yinghai Lu | 66918dc | 2009-06-30 11:41:37 -0700 | [diff] [blame] | 4858 | |
| 4859 | out: |
| 4860 | /* restore the node_state */ |
| 4861 | node_states[N_HIGH_MEMORY] = saved_node_state; |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 4862 | } |
| 4863 | |
Lee Schermerhorn | 37b07e4 | 2007-10-16 01:25:39 -0700 | [diff] [blame] | 4864 | /* Any regular memory on that node ? */ |
| 4865 | static void check_for_regular_memory(pg_data_t *pgdat) |
| 4866 | { |
| 4867 | #ifdef CONFIG_HIGHMEM |
| 4868 | enum zone_type zone_type; |
| 4869 | |
| 4870 | for (zone_type = 0; zone_type <= ZONE_NORMAL; zone_type++) { |
| 4871 | struct zone *zone = &pgdat->node_zones[zone_type]; |
| 4872 | if (zone->present_pages) |
| 4873 | node_set_state(zone_to_nid(zone), N_NORMAL_MEMORY); |
| 4874 | } |
| 4875 | #endif |
| 4876 | } |
| 4877 | |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4878 | /** |
| 4879 | * free_area_init_nodes - Initialise all pg_data_t and zone data |
Randy Dunlap | 88ca3b9 | 2006-10-04 02:15:25 -0700 | [diff] [blame] | 4880 | * @max_zone_pfn: an array of max PFNs for each zone |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4881 | * |
| 4882 | * This will call free_area_init_node() for each active node in the system. |
| 4883 | * Using the page ranges provided by add_active_range(), the size of each |
| 4884 | * zone in each node and their holes is calculated. If the maximum PFN |
| 4885 | * between two adjacent zones match, it is assumed that the zone is empty. |
| 4886 | * For example, if arch_max_dma_pfn == arch_max_dma32_pfn, it is assumed |
| 4887 | * that arch_max_dma32_pfn has no pages. It is also assumed that a zone |
| 4888 | * starts where the previous one ended. For example, ZONE_DMA32 starts |
| 4889 | * at arch_max_dma_pfn. |
| 4890 | */ |
| 4891 | void __init free_area_init_nodes(unsigned long *max_zone_pfn) |
| 4892 | { |
| 4893 | unsigned long nid; |
Andrew Morton | db99100 | 2008-10-15 22:01:07 -0700 | [diff] [blame] | 4894 | int i; |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4895 | |
Mel Gorman | a6af2bc | 2007-02-10 01:42:57 -0800 | [diff] [blame] | 4896 | /* Sort early_node_map as initialisation assumes it is sorted */ |
| 4897 | sort_node_map(); |
| 4898 | |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4899 | /* Record where the zone boundaries are */ |
| 4900 | memset(arch_zone_lowest_possible_pfn, 0, |
| 4901 | sizeof(arch_zone_lowest_possible_pfn)); |
| 4902 | memset(arch_zone_highest_possible_pfn, 0, |
| 4903 | sizeof(arch_zone_highest_possible_pfn)); |
| 4904 | arch_zone_lowest_possible_pfn[0] = find_min_pfn_with_active_regions(); |
| 4905 | arch_zone_highest_possible_pfn[0] = max_zone_pfn[0]; |
| 4906 | for (i = 1; i < MAX_NR_ZONES; i++) { |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 4907 | if (i == ZONE_MOVABLE) |
| 4908 | continue; |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4909 | arch_zone_lowest_possible_pfn[i] = |
| 4910 | arch_zone_highest_possible_pfn[i-1]; |
| 4911 | arch_zone_highest_possible_pfn[i] = |
| 4912 | max(max_zone_pfn[i], arch_zone_lowest_possible_pfn[i]); |
| 4913 | } |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 4914 | arch_zone_lowest_possible_pfn[ZONE_MOVABLE] = 0; |
| 4915 | arch_zone_highest_possible_pfn[ZONE_MOVABLE] = 0; |
| 4916 | |
| 4917 | /* Find the PFNs that ZONE_MOVABLE begins at in each node */ |
| 4918 | memset(zone_movable_pfn, 0, sizeof(zone_movable_pfn)); |
| 4919 | find_zone_movable_pfns_for_nodes(zone_movable_pfn); |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4920 | |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4921 | /* Print out the zone ranges */ |
| 4922 | printk("Zone PFN ranges:\n"); |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 4923 | for (i = 0; i < MAX_NR_ZONES; i++) { |
| 4924 | if (i == ZONE_MOVABLE) |
| 4925 | continue; |
David Rientjes | 72f0ba0 | 2010-03-05 13:42:14 -0800 | [diff] [blame] | 4926 | printk(" %-8s ", zone_names[i]); |
| 4927 | if (arch_zone_lowest_possible_pfn[i] == |
| 4928 | arch_zone_highest_possible_pfn[i]) |
| 4929 | printk("empty\n"); |
| 4930 | else |
| 4931 | printk("%0#10lx -> %0#10lx\n", |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4932 | arch_zone_lowest_possible_pfn[i], |
| 4933 | arch_zone_highest_possible_pfn[i]); |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 4934 | } |
| 4935 | |
| 4936 | /* Print out the PFNs ZONE_MOVABLE begins at in each node */ |
| 4937 | printk("Movable zone start PFN for each node\n"); |
| 4938 | for (i = 0; i < MAX_NUMNODES; i++) { |
| 4939 | if (zone_movable_pfn[i]) |
| 4940 | printk(" Node %d: %lu\n", i, zone_movable_pfn[i]); |
| 4941 | } |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4942 | |
| 4943 | /* Print out the early_node_map[] */ |
| 4944 | printk("early_node_map[%d] active PFN ranges\n", nr_nodemap_entries); |
| 4945 | for (i = 0; i < nr_nodemap_entries; i++) |
Paul Jackson | 5dab8ec | 2008-06-25 05:44:40 -0700 | [diff] [blame] | 4946 | printk(" %3d: %0#10lx -> %0#10lx\n", early_node_map[i].nid, |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4947 | early_node_map[i].start_pfn, |
| 4948 | early_node_map[i].end_pfn); |
| 4949 | |
| 4950 | /* Initialise every node */ |
Mel Gorman | 708614e | 2008-07-23 21:26:51 -0700 | [diff] [blame] | 4951 | mminit_verify_pageflags_layout(); |
Christoph Lameter | 8ef8286 | 2007-02-20 13:57:52 -0800 | [diff] [blame] | 4952 | setup_nr_node_ids(); |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4953 | for_each_online_node(nid) { |
| 4954 | pg_data_t *pgdat = NODE_DATA(nid); |
Johannes Weiner | 9109fb7 | 2008-07-23 21:27:20 -0700 | [diff] [blame] | 4955 | free_area_init_node(nid, NULL, |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4956 | find_min_pfn_for_node(nid), NULL); |
Lee Schermerhorn | 37b07e4 | 2007-10-16 01:25:39 -0700 | [diff] [blame] | 4957 | |
| 4958 | /* Any memory on that node */ |
| 4959 | if (pgdat->node_present_pages) |
| 4960 | node_set_state(nid, N_HIGH_MEMORY); |
| 4961 | check_for_regular_memory(pgdat); |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 4962 | } |
| 4963 | } |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 4964 | |
Mel Gorman | 7e63efe | 2007-07-17 04:03:15 -0700 | [diff] [blame] | 4965 | static int __init cmdline_parse_core(char *p, unsigned long *core) |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 4966 | { |
| 4967 | unsigned long long coremem; |
| 4968 | if (!p) |
| 4969 | return -EINVAL; |
| 4970 | |
| 4971 | coremem = memparse(p, &p); |
Mel Gorman | 7e63efe | 2007-07-17 04:03:15 -0700 | [diff] [blame] | 4972 | *core = coremem >> PAGE_SHIFT; |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 4973 | |
Mel Gorman | 7e63efe | 2007-07-17 04:03:15 -0700 | [diff] [blame] | 4974 | /* Paranoid check that UL is enough for the coremem value */ |
Mel Gorman | 2a1e274 | 2007-07-17 04:03:12 -0700 | [diff] [blame] | 4975 | WARN_ON((coremem >> PAGE_SHIFT) > ULONG_MAX); |
| 4976 | |
| 4977 | return 0; |
| 4978 | } |
Mel Gorman | ed7ed36 | 2007-07-17 04:03:14 -0700 | [diff] [blame] | 4979 | |
Mel Gorman | 7e63efe | 2007-07-17 04:03:15 -0700 | [diff] [blame] | 4980 | /* |
| 4981 | * kernelcore=size sets the amount of memory for use for allocations that |
| 4982 | * cannot be reclaimed or migrated. |
| 4983 | */ |
| 4984 | static int __init cmdline_parse_kernelcore(char *p) |
| 4985 | { |
| 4986 | return cmdline_parse_core(p, &required_kernelcore); |
| 4987 | } |
| 4988 | |
| 4989 | /* |
| 4990 | * movablecore=size sets the amount of memory for use for allocations that |
| 4991 | * can be reclaimed or migrated. |
| 4992 | */ |
| 4993 | static int __init cmdline_parse_movablecore(char *p) |
| 4994 | { |
| 4995 | return cmdline_parse_core(p, &required_movablecore); |
| 4996 | } |
| 4997 | |
Mel Gorman | ed7ed36 | 2007-07-17 04:03:14 -0700 | [diff] [blame] | 4998 | early_param("kernelcore", cmdline_parse_kernelcore); |
Mel Gorman | 7e63efe | 2007-07-17 04:03:15 -0700 | [diff] [blame] | 4999 | early_param("movablecore", cmdline_parse_movablecore); |
Mel Gorman | ed7ed36 | 2007-07-17 04:03:14 -0700 | [diff] [blame] | 5000 | |
Mel Gorman | c713216 | 2006-09-27 01:49:43 -0700 | [diff] [blame] | 5001 | #endif /* CONFIG_ARCH_POPULATES_NODE_MAP */ |
| 5002 | |
Mel Gorman | 0e0b864 | 2006-09-27 01:49:56 -0700 | [diff] [blame] | 5003 | /** |
Randy Dunlap | 88ca3b9 | 2006-10-04 02:15:25 -0700 | [diff] [blame] | 5004 | * set_dma_reserve - set the specified number of pages reserved in the first zone |
| 5005 | * @new_dma_reserve: The number of pages to mark reserved |
Mel Gorman | 0e0b864 | 2006-09-27 01:49:56 -0700 | [diff] [blame] | 5006 | * |
| 5007 | * The per-cpu batchsize and zone watermarks are determined by present_pages. |
| 5008 | * In the DMA zone, a significant percentage may be consumed by kernel image |
| 5009 | * and other unfreeable allocations which can skew the watermarks badly. This |
Randy Dunlap | 88ca3b9 | 2006-10-04 02:15:25 -0700 | [diff] [blame] | 5010 | * function may optionally be used to account for unfreeable pages in the |
| 5011 | * first zone (e.g., ZONE_DMA). The effect will be lower watermarks and |
| 5012 | * smaller per-cpu batchsize. |
Mel Gorman | 0e0b864 | 2006-09-27 01:49:56 -0700 | [diff] [blame] | 5013 | */ |
| 5014 | void __init set_dma_reserve(unsigned long new_dma_reserve) |
| 5015 | { |
| 5016 | dma_reserve = new_dma_reserve; |
| 5017 | } |
| 5018 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5019 | void __init free_area_init(unsigned long *zones_size) |
| 5020 | { |
Johannes Weiner | 9109fb7 | 2008-07-23 21:27:20 -0700 | [diff] [blame] | 5021 | free_area_init_node(0, zones_size, |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5022 | __pa(PAGE_OFFSET) >> PAGE_SHIFT, NULL); |
| 5023 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5024 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5025 | static int page_alloc_cpu_notify(struct notifier_block *self, |
| 5026 | unsigned long action, void *hcpu) |
| 5027 | { |
| 5028 | int cpu = (unsigned long)hcpu; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5029 | |
Rafael J. Wysocki | 8bb7844 | 2007-05-09 02:35:10 -0700 | [diff] [blame] | 5030 | if (action == CPU_DEAD || action == CPU_DEAD_FROZEN) { |
Christoph Lameter | 9f8f217 | 2008-02-04 22:29:11 -0800 | [diff] [blame] | 5031 | drain_pages(cpu); |
| 5032 | |
| 5033 | /* |
| 5034 | * Spill the event counters of the dead processor |
| 5035 | * into the current processors event counters. |
| 5036 | * This artificially elevates the count of the current |
| 5037 | * processor. |
| 5038 | */ |
Christoph Lameter | f8891e5 | 2006-06-30 01:55:45 -0700 | [diff] [blame] | 5039 | vm_events_fold_cpu(cpu); |
Christoph Lameter | 9f8f217 | 2008-02-04 22:29:11 -0800 | [diff] [blame] | 5040 | |
| 5041 | /* |
| 5042 | * Zero the differential counters of the dead processor |
| 5043 | * so that the vm statistics are consistent. |
| 5044 | * |
| 5045 | * This is only okay since the processor is dead and cannot |
| 5046 | * race with what we are doing. |
| 5047 | */ |
Christoph Lameter | 2244b95 | 2006-06-30 01:55:33 -0700 | [diff] [blame] | 5048 | refresh_cpu_vm_stats(cpu); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5049 | } |
| 5050 | return NOTIFY_OK; |
| 5051 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5052 | |
| 5053 | void __init page_alloc_init(void) |
| 5054 | { |
| 5055 | hotcpu_notifier(page_alloc_cpu_notify, 0); |
| 5056 | } |
| 5057 | |
| 5058 | /* |
Hideo AOKI | cb45b0e | 2006-04-10 22:52:59 -0700 | [diff] [blame] | 5059 | * calculate_totalreserve_pages - called when sysctl_lower_zone_reserve_ratio |
| 5060 | * or min_free_kbytes changes. |
| 5061 | */ |
| 5062 | static void calculate_totalreserve_pages(void) |
| 5063 | { |
| 5064 | struct pglist_data *pgdat; |
| 5065 | unsigned long reserve_pages = 0; |
Christoph Lameter | 2f6726e | 2006-09-25 23:31:18 -0700 | [diff] [blame] | 5066 | enum zone_type i, j; |
Hideo AOKI | cb45b0e | 2006-04-10 22:52:59 -0700 | [diff] [blame] | 5067 | |
| 5068 | for_each_online_pgdat(pgdat) { |
| 5069 | for (i = 0; i < MAX_NR_ZONES; i++) { |
| 5070 | struct zone *zone = pgdat->node_zones + i; |
| 5071 | unsigned long max = 0; |
| 5072 | |
| 5073 | /* Find valid and maximum lowmem_reserve in the zone */ |
| 5074 | for (j = i; j < MAX_NR_ZONES; j++) { |
| 5075 | if (zone->lowmem_reserve[j] > max) |
| 5076 | max = zone->lowmem_reserve[j]; |
| 5077 | } |
| 5078 | |
Mel Gorman | 4185896 | 2009-06-16 15:32:12 -0700 | [diff] [blame] | 5079 | /* we treat the high watermark as reserved pages. */ |
| 5080 | max += high_wmark_pages(zone); |
Hideo AOKI | cb45b0e | 2006-04-10 22:52:59 -0700 | [diff] [blame] | 5081 | |
| 5082 | if (max > zone->present_pages) |
| 5083 | max = zone->present_pages; |
| 5084 | reserve_pages += max; |
| 5085 | } |
| 5086 | } |
| 5087 | totalreserve_pages = reserve_pages; |
| 5088 | } |
| 5089 | |
| 5090 | /* |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5091 | * setup_per_zone_lowmem_reserve - called whenever |
| 5092 | * sysctl_lower_zone_reserve_ratio changes. Ensures that each zone |
| 5093 | * has a correct pages reserved value, so an adequate number of |
| 5094 | * pages are left in the zone after a successful __alloc_pages(). |
| 5095 | */ |
| 5096 | static void setup_per_zone_lowmem_reserve(void) |
| 5097 | { |
| 5098 | struct pglist_data *pgdat; |
Christoph Lameter | 2f6726e | 2006-09-25 23:31:18 -0700 | [diff] [blame] | 5099 | enum zone_type j, idx; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5100 | |
KAMEZAWA Hiroyuki | ec936fc | 2006-03-27 01:15:59 -0800 | [diff] [blame] | 5101 | for_each_online_pgdat(pgdat) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5102 | for (j = 0; j < MAX_NR_ZONES; j++) { |
| 5103 | struct zone *zone = pgdat->node_zones + j; |
| 5104 | unsigned long present_pages = zone->present_pages; |
| 5105 | |
| 5106 | zone->lowmem_reserve[j] = 0; |
| 5107 | |
Christoph Lameter | 2f6726e | 2006-09-25 23:31:18 -0700 | [diff] [blame] | 5108 | idx = j; |
| 5109 | while (idx) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5110 | struct zone *lower_zone; |
| 5111 | |
Christoph Lameter | 2f6726e | 2006-09-25 23:31:18 -0700 | [diff] [blame] | 5112 | idx--; |
| 5113 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5114 | if (sysctl_lowmem_reserve_ratio[idx] < 1) |
| 5115 | sysctl_lowmem_reserve_ratio[idx] = 1; |
| 5116 | |
| 5117 | lower_zone = pgdat->node_zones + idx; |
| 5118 | lower_zone->lowmem_reserve[j] = present_pages / |
| 5119 | sysctl_lowmem_reserve_ratio[idx]; |
| 5120 | present_pages += lower_zone->present_pages; |
| 5121 | } |
| 5122 | } |
| 5123 | } |
Hideo AOKI | cb45b0e | 2006-04-10 22:52:59 -0700 | [diff] [blame] | 5124 | |
| 5125 | /* update totalreserve_pages */ |
| 5126 | calculate_totalreserve_pages(); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5127 | } |
| 5128 | |
Randy Dunlap | 88ca3b9 | 2006-10-04 02:15:25 -0700 | [diff] [blame] | 5129 | /** |
Minchan Kim | bc75d33 | 2009-06-16 15:32:48 -0700 | [diff] [blame] | 5130 | * setup_per_zone_wmarks - called when min_free_kbytes changes |
Minchan Kim | bce7394 | 2009-06-16 15:32:50 -0700 | [diff] [blame] | 5131 | * or when memory is hot-{added|removed} |
Randy Dunlap | 88ca3b9 | 2006-10-04 02:15:25 -0700 | [diff] [blame] | 5132 | * |
Minchan Kim | bc75d33 | 2009-06-16 15:32:48 -0700 | [diff] [blame] | 5133 | * Ensures that the watermark[min,low,high] values for each zone are set |
| 5134 | * correctly with respect to min_free_kbytes. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5135 | */ |
Minchan Kim | bc75d33 | 2009-06-16 15:32:48 -0700 | [diff] [blame] | 5136 | void setup_per_zone_wmarks(void) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5137 | { |
| 5138 | unsigned long pages_min = min_free_kbytes >> (PAGE_SHIFT - 10); |
| 5139 | unsigned long lowmem_pages = 0; |
| 5140 | struct zone *zone; |
| 5141 | unsigned long flags; |
| 5142 | |
| 5143 | /* Calculate total number of !ZONE_HIGHMEM pages */ |
| 5144 | for_each_zone(zone) { |
| 5145 | if (!is_highmem(zone)) |
| 5146 | lowmem_pages += zone->present_pages; |
| 5147 | } |
| 5148 | |
| 5149 | for_each_zone(zone) { |
Andrew Morton | ac924c6 | 2006-05-15 09:43:59 -0700 | [diff] [blame] | 5150 | u64 tmp; |
| 5151 | |
Gerald Schaefer | 1125b4e | 2008-10-18 20:27:11 -0700 | [diff] [blame] | 5152 | spin_lock_irqsave(&zone->lock, flags); |
Andrew Morton | ac924c6 | 2006-05-15 09:43:59 -0700 | [diff] [blame] | 5153 | tmp = (u64)pages_min * zone->present_pages; |
| 5154 | do_div(tmp, lowmem_pages); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5155 | if (is_highmem(zone)) { |
| 5156 | /* |
Nick Piggin | 669ed17 | 2005-11-13 16:06:45 -0800 | [diff] [blame] | 5157 | * __GFP_HIGH and PF_MEMALLOC allocations usually don't |
| 5158 | * need highmem pages, so cap pages_min to a small |
| 5159 | * value here. |
| 5160 | * |
Mel Gorman | 4185896 | 2009-06-16 15:32:12 -0700 | [diff] [blame] | 5161 | * The WMARK_HIGH-WMARK_LOW and (WMARK_LOW-WMARK_MIN) |
Nick Piggin | 669ed17 | 2005-11-13 16:06:45 -0800 | [diff] [blame] | 5162 | * deltas controls asynch page reclaim, and so should |
| 5163 | * not be capped for highmem. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5164 | */ |
| 5165 | int min_pages; |
| 5166 | |
| 5167 | min_pages = zone->present_pages / 1024; |
| 5168 | if (min_pages < SWAP_CLUSTER_MAX) |
| 5169 | min_pages = SWAP_CLUSTER_MAX; |
| 5170 | if (min_pages > 128) |
| 5171 | min_pages = 128; |
Mel Gorman | 4185896 | 2009-06-16 15:32:12 -0700 | [diff] [blame] | 5172 | zone->watermark[WMARK_MIN] = min_pages; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5173 | } else { |
Nick Piggin | 669ed17 | 2005-11-13 16:06:45 -0800 | [diff] [blame] | 5174 | /* |
| 5175 | * If it's a lowmem zone, reserve a number of pages |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5176 | * proportionate to the zone's size. |
| 5177 | */ |
Mel Gorman | 4185896 | 2009-06-16 15:32:12 -0700 | [diff] [blame] | 5178 | zone->watermark[WMARK_MIN] = tmp; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5179 | } |
| 5180 | |
Mel Gorman | 4185896 | 2009-06-16 15:32:12 -0700 | [diff] [blame] | 5181 | zone->watermark[WMARK_LOW] = min_wmark_pages(zone) + (tmp >> 2); |
| 5182 | zone->watermark[WMARK_HIGH] = min_wmark_pages(zone) + (tmp >> 1); |
Mel Gorman | 56fd56b | 2007-10-16 01:25:58 -0700 | [diff] [blame] | 5183 | setup_zone_migrate_reserve(zone); |
Gerald Schaefer | 1125b4e | 2008-10-18 20:27:11 -0700 | [diff] [blame] | 5184 | spin_unlock_irqrestore(&zone->lock, flags); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5185 | } |
Hideo AOKI | cb45b0e | 2006-04-10 22:52:59 -0700 | [diff] [blame] | 5186 | |
| 5187 | /* update totalreserve_pages */ |
| 5188 | calculate_totalreserve_pages(); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5189 | } |
| 5190 | |
Randy Dunlap | 55a4462 | 2009-09-21 17:01:20 -0700 | [diff] [blame] | 5191 | /* |
Rik van Riel | 556adec | 2008-10-18 20:26:34 -0700 | [diff] [blame] | 5192 | * The inactive anon list should be small enough that the VM never has to |
| 5193 | * do too much work, but large enough that each inactive page has a chance |
| 5194 | * to be referenced again before it is swapped out. |
| 5195 | * |
| 5196 | * The inactive_anon ratio is the target ratio of ACTIVE_ANON to |
| 5197 | * INACTIVE_ANON pages on this zone's LRU, maintained by the |
| 5198 | * pageout code. A zone->inactive_ratio of 3 means 3:1 or 25% of |
| 5199 | * the anonymous pages are kept on the inactive list. |
| 5200 | * |
| 5201 | * total target max |
| 5202 | * memory ratio inactive anon |
| 5203 | * ------------------------------------- |
| 5204 | * 10MB 1 5MB |
| 5205 | * 100MB 1 50MB |
| 5206 | * 1GB 3 250MB |
| 5207 | * 10GB 10 0.9GB |
| 5208 | * 100GB 31 3GB |
| 5209 | * 1TB 101 10GB |
| 5210 | * 10TB 320 32GB |
| 5211 | */ |
KOSAKI Motohiro | 1b79acc | 2011-05-24 17:11:32 -0700 | [diff] [blame] | 5212 | static void __meminit calculate_zone_inactive_ratio(struct zone *zone) |
Minchan Kim | 96cb4df | 2009-06-16 15:32:49 -0700 | [diff] [blame] | 5213 | { |
| 5214 | unsigned int gb, ratio; |
| 5215 | |
| 5216 | /* Zone size in gigabytes */ |
| 5217 | gb = zone->present_pages >> (30 - PAGE_SHIFT); |
| 5218 | if (gb) |
| 5219 | ratio = int_sqrt(10 * gb); |
| 5220 | else |
| 5221 | ratio = 1; |
| 5222 | |
| 5223 | zone->inactive_ratio = ratio; |
| 5224 | } |
| 5225 | |
KOSAKI Motohiro | 839a4fc | 2011-05-24 17:11:31 -0700 | [diff] [blame] | 5226 | static void __meminit setup_per_zone_inactive_ratio(void) |
Rik van Riel | 556adec | 2008-10-18 20:26:34 -0700 | [diff] [blame] | 5227 | { |
| 5228 | struct zone *zone; |
| 5229 | |
Minchan Kim | 96cb4df | 2009-06-16 15:32:49 -0700 | [diff] [blame] | 5230 | for_each_zone(zone) |
| 5231 | calculate_zone_inactive_ratio(zone); |
Rik van Riel | 556adec | 2008-10-18 20:26:34 -0700 | [diff] [blame] | 5232 | } |
| 5233 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5234 | /* |
| 5235 | * Initialise min_free_kbytes. |
| 5236 | * |
| 5237 | * For small machines we want it small (128k min). For large machines |
| 5238 | * we want it large (64MB max). But it is not linear, because network |
| 5239 | * bandwidth does not increase linearly with machine size. We use |
| 5240 | * |
| 5241 | * min_free_kbytes = 4 * sqrt(lowmem_kbytes), for better accuracy: |
| 5242 | * min_free_kbytes = sqrt(lowmem_kbytes * 16) |
| 5243 | * |
| 5244 | * which yields |
| 5245 | * |
| 5246 | * 16MB: 512k |
| 5247 | * 32MB: 724k |
| 5248 | * 64MB: 1024k |
| 5249 | * 128MB: 1448k |
| 5250 | * 256MB: 2048k |
| 5251 | * 512MB: 2896k |
| 5252 | * 1024MB: 4096k |
| 5253 | * 2048MB: 5792k |
| 5254 | * 4096MB: 8192k |
| 5255 | * 8192MB: 11584k |
| 5256 | * 16384MB: 16384k |
| 5257 | */ |
KOSAKI Motohiro | 1b79acc | 2011-05-24 17:11:32 -0700 | [diff] [blame] | 5258 | int __meminit init_per_zone_wmark_min(void) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5259 | { |
| 5260 | unsigned long lowmem_kbytes; |
| 5261 | |
| 5262 | lowmem_kbytes = nr_free_buffer_pages() * (PAGE_SIZE >> 10); |
| 5263 | |
| 5264 | min_free_kbytes = int_sqrt(lowmem_kbytes * 16); |
| 5265 | if (min_free_kbytes < 128) |
| 5266 | min_free_kbytes = 128; |
| 5267 | if (min_free_kbytes > 65536) |
| 5268 | min_free_kbytes = 65536; |
Minchan Kim | bc75d33 | 2009-06-16 15:32:48 -0700 | [diff] [blame] | 5269 | setup_per_zone_wmarks(); |
KOSAKI Motohiro | a6cccdc | 2011-05-24 17:11:33 -0700 | [diff] [blame] | 5270 | refresh_zone_stat_thresholds(); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5271 | setup_per_zone_lowmem_reserve(); |
Rik van Riel | 556adec | 2008-10-18 20:26:34 -0700 | [diff] [blame] | 5272 | setup_per_zone_inactive_ratio(); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5273 | return 0; |
| 5274 | } |
Minchan Kim | bc75d33 | 2009-06-16 15:32:48 -0700 | [diff] [blame] | 5275 | module_init(init_per_zone_wmark_min) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5276 | |
| 5277 | /* |
| 5278 | * min_free_kbytes_sysctl_handler - just a wrapper around proc_dointvec() so |
| 5279 | * that we can call two helper functions whenever min_free_kbytes |
| 5280 | * changes. |
| 5281 | */ |
| 5282 | int min_free_kbytes_sysctl_handler(ctl_table *table, int write, |
Alexey Dobriyan | 8d65af7 | 2009-09-23 15:57:19 -0700 | [diff] [blame] | 5283 | void __user *buffer, size_t *length, loff_t *ppos) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5284 | { |
Alexey Dobriyan | 8d65af7 | 2009-09-23 15:57:19 -0700 | [diff] [blame] | 5285 | proc_dointvec(table, write, buffer, length, ppos); |
Mel Gorman | 3b1d92c | 2007-05-06 14:49:30 -0700 | [diff] [blame] | 5286 | if (write) |
Minchan Kim | bc75d33 | 2009-06-16 15:32:48 -0700 | [diff] [blame] | 5287 | setup_per_zone_wmarks(); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5288 | return 0; |
| 5289 | } |
| 5290 | |
Christoph Lameter | 9614634 | 2006-07-03 00:24:13 -0700 | [diff] [blame] | 5291 | #ifdef CONFIG_NUMA |
| 5292 | int sysctl_min_unmapped_ratio_sysctl_handler(ctl_table *table, int write, |
Alexey Dobriyan | 8d65af7 | 2009-09-23 15:57:19 -0700 | [diff] [blame] | 5293 | void __user *buffer, size_t *length, loff_t *ppos) |
Christoph Lameter | 9614634 | 2006-07-03 00:24:13 -0700 | [diff] [blame] | 5294 | { |
| 5295 | struct zone *zone; |
| 5296 | int rc; |
| 5297 | |
Alexey Dobriyan | 8d65af7 | 2009-09-23 15:57:19 -0700 | [diff] [blame] | 5298 | rc = proc_dointvec_minmax(table, write, buffer, length, ppos); |
Christoph Lameter | 9614634 | 2006-07-03 00:24:13 -0700 | [diff] [blame] | 5299 | if (rc) |
| 5300 | return rc; |
| 5301 | |
| 5302 | for_each_zone(zone) |
Christoph Lameter | 8417bba | 2006-09-25 23:31:51 -0700 | [diff] [blame] | 5303 | zone->min_unmapped_pages = (zone->present_pages * |
Christoph Lameter | 9614634 | 2006-07-03 00:24:13 -0700 | [diff] [blame] | 5304 | sysctl_min_unmapped_ratio) / 100; |
| 5305 | return 0; |
| 5306 | } |
Christoph Lameter | 0ff3849 | 2006-09-25 23:31:52 -0700 | [diff] [blame] | 5307 | |
| 5308 | int sysctl_min_slab_ratio_sysctl_handler(ctl_table *table, int write, |
Alexey Dobriyan | 8d65af7 | 2009-09-23 15:57:19 -0700 | [diff] [blame] | 5309 | void __user *buffer, size_t *length, loff_t *ppos) |
Christoph Lameter | 0ff3849 | 2006-09-25 23:31:52 -0700 | [diff] [blame] | 5310 | { |
| 5311 | struct zone *zone; |
| 5312 | int rc; |
| 5313 | |
Alexey Dobriyan | 8d65af7 | 2009-09-23 15:57:19 -0700 | [diff] [blame] | 5314 | rc = proc_dointvec_minmax(table, write, buffer, length, ppos); |
Christoph Lameter | 0ff3849 | 2006-09-25 23:31:52 -0700 | [diff] [blame] | 5315 | if (rc) |
| 5316 | return rc; |
| 5317 | |
| 5318 | for_each_zone(zone) |
| 5319 | zone->min_slab_pages = (zone->present_pages * |
| 5320 | sysctl_min_slab_ratio) / 100; |
| 5321 | return 0; |
| 5322 | } |
Christoph Lameter | 9614634 | 2006-07-03 00:24:13 -0700 | [diff] [blame] | 5323 | #endif |
| 5324 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5325 | /* |
| 5326 | * lowmem_reserve_ratio_sysctl_handler - just a wrapper around |
| 5327 | * proc_dointvec() so that we can call setup_per_zone_lowmem_reserve() |
| 5328 | * whenever sysctl_lowmem_reserve_ratio changes. |
| 5329 | * |
| 5330 | * The reserve ratio obviously has absolutely no relation with the |
Mel Gorman | 4185896 | 2009-06-16 15:32:12 -0700 | [diff] [blame] | 5331 | * minimum watermarks. The lowmem reserve ratio can only make sense |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5332 | * if in function of the boot time zone sizes. |
| 5333 | */ |
| 5334 | int lowmem_reserve_ratio_sysctl_handler(ctl_table *table, int write, |
Alexey Dobriyan | 8d65af7 | 2009-09-23 15:57:19 -0700 | [diff] [blame] | 5335 | void __user *buffer, size_t *length, loff_t *ppos) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5336 | { |
Alexey Dobriyan | 8d65af7 | 2009-09-23 15:57:19 -0700 | [diff] [blame] | 5337 | proc_dointvec_minmax(table, write, buffer, length, ppos); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5338 | setup_per_zone_lowmem_reserve(); |
| 5339 | return 0; |
| 5340 | } |
| 5341 | |
Rohit Seth | 8ad4b1f | 2006-01-08 01:00:40 -0800 | [diff] [blame] | 5342 | /* |
| 5343 | * percpu_pagelist_fraction - changes the pcp->high for each zone on each |
| 5344 | * cpu. It is the fraction of total pages in each zone that a hot per cpu pagelist |
| 5345 | * can have before it gets flushed back to buddy allocator. |
| 5346 | */ |
| 5347 | |
| 5348 | int percpu_pagelist_fraction_sysctl_handler(ctl_table *table, int write, |
Alexey Dobriyan | 8d65af7 | 2009-09-23 15:57:19 -0700 | [diff] [blame] | 5349 | void __user *buffer, size_t *length, loff_t *ppos) |
Rohit Seth | 8ad4b1f | 2006-01-08 01:00:40 -0800 | [diff] [blame] | 5350 | { |
| 5351 | struct zone *zone; |
| 5352 | unsigned int cpu; |
| 5353 | int ret; |
| 5354 | |
Alexey Dobriyan | 8d65af7 | 2009-09-23 15:57:19 -0700 | [diff] [blame] | 5355 | ret = proc_dointvec_minmax(table, write, buffer, length, ppos); |
Rohit Seth | 8ad4b1f | 2006-01-08 01:00:40 -0800 | [diff] [blame] | 5356 | if (!write || (ret == -EINVAL)) |
| 5357 | return ret; |
Dimitri Sivanich | 364df0e | 2009-06-23 12:37:04 -0700 | [diff] [blame] | 5358 | for_each_populated_zone(zone) { |
Christoph Lameter | 99dcc3e | 2010-01-05 15:34:51 +0900 | [diff] [blame] | 5359 | for_each_possible_cpu(cpu) { |
Rohit Seth | 8ad4b1f | 2006-01-08 01:00:40 -0800 | [diff] [blame] | 5360 | unsigned long high; |
| 5361 | high = zone->present_pages / percpu_pagelist_fraction; |
Christoph Lameter | 99dcc3e | 2010-01-05 15:34:51 +0900 | [diff] [blame] | 5362 | setup_pagelist_highmark( |
| 5363 | per_cpu_ptr(zone->pageset, cpu), high); |
Rohit Seth | 8ad4b1f | 2006-01-08 01:00:40 -0800 | [diff] [blame] | 5364 | } |
| 5365 | } |
| 5366 | return 0; |
| 5367 | } |
| 5368 | |
David S. Miller | f034b5d | 2006-08-24 03:08:07 -0700 | [diff] [blame] | 5369 | int hashdist = HASHDIST_DEFAULT; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5370 | |
| 5371 | #ifdef CONFIG_NUMA |
| 5372 | static int __init set_hashdist(char *str) |
| 5373 | { |
| 5374 | if (!str) |
| 5375 | return 0; |
| 5376 | hashdist = simple_strtoul(str, &str, 0); |
| 5377 | return 1; |
| 5378 | } |
| 5379 | __setup("hashdist=", set_hashdist); |
| 5380 | #endif |
| 5381 | |
| 5382 | /* |
| 5383 | * allocate a large system hash table from bootmem |
| 5384 | * - it is assumed that the hash table must contain an exact power-of-2 |
| 5385 | * quantity of entries |
| 5386 | * - limit is the number of hash buckets, not the total allocation size |
| 5387 | */ |
| 5388 | void *__init alloc_large_system_hash(const char *tablename, |
| 5389 | unsigned long bucketsize, |
| 5390 | unsigned long numentries, |
| 5391 | int scale, |
| 5392 | int flags, |
| 5393 | unsigned int *_hash_shift, |
| 5394 | unsigned int *_hash_mask, |
| 5395 | unsigned long limit) |
| 5396 | { |
| 5397 | unsigned long long max = limit; |
| 5398 | unsigned long log2qty, size; |
| 5399 | void *table = NULL; |
| 5400 | |
| 5401 | /* allow the kernel cmdline to have a say */ |
| 5402 | if (!numentries) { |
| 5403 | /* round applicable memory size up to nearest megabyte */ |
Andrew Morton | 0490366 | 2006-12-06 20:37:33 -0800 | [diff] [blame] | 5404 | numentries = nr_kernel_pages; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5405 | numentries += (1UL << (20 - PAGE_SHIFT)) - 1; |
| 5406 | numentries >>= 20 - PAGE_SHIFT; |
| 5407 | numentries <<= 20 - PAGE_SHIFT; |
| 5408 | |
| 5409 | /* limit to 1 bucket per 2^scale bytes of low memory */ |
| 5410 | if (scale > PAGE_SHIFT) |
| 5411 | numentries >>= (scale - PAGE_SHIFT); |
| 5412 | else |
| 5413 | numentries <<= (PAGE_SHIFT - scale); |
Paul Mundt | 9ab37b8 | 2007-01-05 16:36:30 -0800 | [diff] [blame] | 5414 | |
| 5415 | /* Make sure we've got at least a 0-order allocation.. */ |
Jan Beulich | 2c85f51 | 2009-09-21 17:03:07 -0700 | [diff] [blame] | 5416 | if (unlikely(flags & HASH_SMALL)) { |
| 5417 | /* Makes no sense without HASH_EARLY */ |
| 5418 | WARN_ON(!(flags & HASH_EARLY)); |
| 5419 | if (!(numentries >> *_hash_shift)) { |
| 5420 | numentries = 1UL << *_hash_shift; |
| 5421 | BUG_ON(!numentries); |
| 5422 | } |
| 5423 | } else if (unlikely((numentries * bucketsize) < PAGE_SIZE)) |
Paul Mundt | 9ab37b8 | 2007-01-05 16:36:30 -0800 | [diff] [blame] | 5424 | numentries = PAGE_SIZE / bucketsize; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5425 | } |
John Hawkes | 6e692ed | 2006-03-25 03:08:02 -0800 | [diff] [blame] | 5426 | numentries = roundup_pow_of_two(numentries); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5427 | |
| 5428 | /* limit allocation size to 1/16 total memory by default */ |
| 5429 | if (max == 0) { |
| 5430 | max = ((unsigned long long)nr_all_pages << PAGE_SHIFT) >> 4; |
| 5431 | do_div(max, bucketsize); |
| 5432 | } |
| 5433 | |
| 5434 | if (numentries > max) |
| 5435 | numentries = max; |
| 5436 | |
David Howells | f0d1b0b | 2006-12-08 02:37:49 -0800 | [diff] [blame] | 5437 | log2qty = ilog2(numentries); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5438 | |
| 5439 | do { |
| 5440 | size = bucketsize << log2qty; |
| 5441 | if (flags & HASH_EARLY) |
Jan Beulich | 74768ed | 2008-08-12 15:08:39 -0700 | [diff] [blame] | 5442 | table = alloc_bootmem_nopanic(size); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5443 | else if (hashdist) |
| 5444 | table = __vmalloc(size, GFP_ATOMIC, PAGE_KERNEL); |
| 5445 | else { |
Eric Dumazet | 1037b83 | 2007-07-15 23:38:05 -0700 | [diff] [blame] | 5446 | /* |
| 5447 | * If bucketsize is not a power-of-two, we may free |
Mel Gorman | a1dd268 | 2009-06-16 15:32:19 -0700 | [diff] [blame] | 5448 | * some pages at the end of hash table which |
| 5449 | * alloc_pages_exact() automatically does |
Eric Dumazet | 1037b83 | 2007-07-15 23:38:05 -0700 | [diff] [blame] | 5450 | */ |
Catalin Marinas | 264ef8a | 2009-07-07 10:33:01 +0100 | [diff] [blame] | 5451 | if (get_order(size) < MAX_ORDER) { |
Mel Gorman | a1dd268 | 2009-06-16 15:32:19 -0700 | [diff] [blame] | 5452 | table = alloc_pages_exact(size, GFP_ATOMIC); |
Catalin Marinas | 264ef8a | 2009-07-07 10:33:01 +0100 | [diff] [blame] | 5453 | kmemleak_alloc(table, size, 1, GFP_ATOMIC); |
| 5454 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5455 | } |
| 5456 | } while (!table && size > PAGE_SIZE && --log2qty); |
| 5457 | |
| 5458 | if (!table) |
| 5459 | panic("Failed to allocate %s hash table\n", tablename); |
| 5460 | |
Robin Holt | f241e660 | 2010-10-07 12:59:26 -0700 | [diff] [blame] | 5461 | printk(KERN_INFO "%s hash table entries: %ld (order: %d, %lu bytes)\n", |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5462 | tablename, |
Robin Holt | f241e660 | 2010-10-07 12:59:26 -0700 | [diff] [blame] | 5463 | (1UL << log2qty), |
David Howells | f0d1b0b | 2006-12-08 02:37:49 -0800 | [diff] [blame] | 5464 | ilog2(size) - PAGE_SHIFT, |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 5465 | size); |
| 5466 | |
| 5467 | if (_hash_shift) |
| 5468 | *_hash_shift = log2qty; |
| 5469 | if (_hash_mask) |
| 5470 | *_hash_mask = (1 << log2qty) - 1; |
| 5471 | |
| 5472 | return table; |
| 5473 | } |
KAMEZAWA Hiroyuki | a117e66 | 2006-03-27 01:15:25 -0800 | [diff] [blame] | 5474 | |
Mel Gorman | 835c134 | 2007-10-16 01:25:47 -0700 | [diff] [blame] | 5475 | /* Return a pointer to the bitmap storing bits affecting a block of pages */ |
| 5476 | static inline unsigned long *get_pageblock_bitmap(struct zone *zone, |
| 5477 | unsigned long pfn) |
| 5478 | { |
| 5479 | #ifdef CONFIG_SPARSEMEM |
| 5480 | return __pfn_to_section(pfn)->pageblock_flags; |
| 5481 | #else |
| 5482 | return zone->pageblock_flags; |
| 5483 | #endif /* CONFIG_SPARSEMEM */ |
| 5484 | } |
Andrew Morton | 6220ec7 | 2006-10-19 23:29:05 -0700 | [diff] [blame] | 5485 | |
Mel Gorman | 835c134 | 2007-10-16 01:25:47 -0700 | [diff] [blame] | 5486 | static inline int pfn_to_bitidx(struct zone *zone, unsigned long pfn) |
| 5487 | { |
| 5488 | #ifdef CONFIG_SPARSEMEM |
| 5489 | pfn &= (PAGES_PER_SECTION-1); |
Mel Gorman | d9c2340 | 2007-10-16 01:26:01 -0700 | [diff] [blame] | 5490 | return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS; |
Mel Gorman | 835c134 | 2007-10-16 01:25:47 -0700 | [diff] [blame] | 5491 | #else |
| 5492 | pfn = pfn - zone->zone_start_pfn; |
Mel Gorman | d9c2340 | 2007-10-16 01:26:01 -0700 | [diff] [blame] | 5493 | return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS; |
Mel Gorman | 835c134 | 2007-10-16 01:25:47 -0700 | [diff] [blame] | 5494 | #endif /* CONFIG_SPARSEMEM */ |
| 5495 | } |
| 5496 | |
| 5497 | /** |
Mel Gorman | d9c2340 | 2007-10-16 01:26:01 -0700 | [diff] [blame] | 5498 | * get_pageblock_flags_group - Return the requested group of flags for the pageblock_nr_pages block of pages |
Mel Gorman | 835c134 | 2007-10-16 01:25:47 -0700 | [diff] [blame] | 5499 | * @page: The page within the block of interest |
| 5500 | * @start_bitidx: The first bit of interest to retrieve |
| 5501 | * @end_bitidx: The last bit of interest |
| 5502 | * returns pageblock_bits flags |
| 5503 | */ |
| 5504 | unsigned long get_pageblock_flags_group(struct page *page, |
| 5505 | int start_bitidx, int end_bitidx) |
| 5506 | { |
| 5507 | struct zone *zone; |
| 5508 | unsigned long *bitmap; |
| 5509 | unsigned long pfn, bitidx; |
| 5510 | unsigned long flags = 0; |
| 5511 | unsigned long value = 1; |
| 5512 | |
| 5513 | zone = page_zone(page); |
| 5514 | pfn = page_to_pfn(page); |
| 5515 | bitmap = get_pageblock_bitmap(zone, pfn); |
| 5516 | bitidx = pfn_to_bitidx(zone, pfn); |
| 5517 | |
| 5518 | for (; start_bitidx <= end_bitidx; start_bitidx++, value <<= 1) |
| 5519 | if (test_bit(bitidx + start_bitidx, bitmap)) |
| 5520 | flags |= value; |
| 5521 | |
| 5522 | return flags; |
| 5523 | } |
| 5524 | |
| 5525 | /** |
Mel Gorman | d9c2340 | 2007-10-16 01:26:01 -0700 | [diff] [blame] | 5526 | * set_pageblock_flags_group - Set the requested group of flags for a pageblock_nr_pages block of pages |
Mel Gorman | 835c134 | 2007-10-16 01:25:47 -0700 | [diff] [blame] | 5527 | * @page: The page within the block of interest |
| 5528 | * @start_bitidx: The first bit of interest |
| 5529 | * @end_bitidx: The last bit of interest |
| 5530 | * @flags: The flags to set |
| 5531 | */ |
| 5532 | void set_pageblock_flags_group(struct page *page, unsigned long flags, |
| 5533 | int start_bitidx, int end_bitidx) |
| 5534 | { |
| 5535 | struct zone *zone; |
| 5536 | unsigned long *bitmap; |
| 5537 | unsigned long pfn, bitidx; |
| 5538 | unsigned long value = 1; |
| 5539 | |
| 5540 | zone = page_zone(page); |
| 5541 | pfn = page_to_pfn(page); |
| 5542 | bitmap = get_pageblock_bitmap(zone, pfn); |
| 5543 | bitidx = pfn_to_bitidx(zone, pfn); |
KAMEZAWA Hiroyuki | 86051ca | 2008-04-29 00:58:21 -0700 | [diff] [blame] | 5544 | VM_BUG_ON(pfn < zone->zone_start_pfn); |
| 5545 | VM_BUG_ON(pfn >= zone->zone_start_pfn + zone->spanned_pages); |
Mel Gorman | 835c134 | 2007-10-16 01:25:47 -0700 | [diff] [blame] | 5546 | |
| 5547 | for (; start_bitidx <= end_bitidx; start_bitidx++, value <<= 1) |
| 5548 | if (flags & value) |
| 5549 | __set_bit(bitidx + start_bitidx, bitmap); |
| 5550 | else |
| 5551 | __clear_bit(bitidx + start_bitidx, bitmap); |
| 5552 | } |
KAMEZAWA Hiroyuki | a5d76b54 | 2007-10-16 01:26:11 -0700 | [diff] [blame] | 5553 | |
| 5554 | /* |
| 5555 | * This is designed as sub function...plz see page_isolation.c also. |
| 5556 | * set/clear page block's type to be ISOLATE. |
| 5557 | * page allocater never alloc memory from ISOLATE block. |
| 5558 | */ |
| 5559 | |
KAMEZAWA Hiroyuki | 49ac825 | 2010-10-26 14:21:30 -0700 | [diff] [blame] | 5560 | static int |
| 5561 | __count_immobile_pages(struct zone *zone, struct page *page, int count) |
| 5562 | { |
| 5563 | unsigned long pfn, iter, found; |
| 5564 | /* |
| 5565 | * For avoiding noise data, lru_add_drain_all() should be called |
| 5566 | * If ZONE_MOVABLE, the zone never contains immobile pages |
| 5567 | */ |
| 5568 | if (zone_idx(zone) == ZONE_MOVABLE) |
| 5569 | return true; |
| 5570 | |
| 5571 | if (get_pageblock_migratetype(page) == MIGRATE_MOVABLE) |
| 5572 | return true; |
| 5573 | |
| 5574 | pfn = page_to_pfn(page); |
| 5575 | for (found = 0, iter = 0; iter < pageblock_nr_pages; iter++) { |
| 5576 | unsigned long check = pfn + iter; |
| 5577 | |
Namhyung Kim | 29723fc | 2011-02-25 14:44:25 -0800 | [diff] [blame] | 5578 | if (!pfn_valid_within(check)) |
KAMEZAWA Hiroyuki | 49ac825 | 2010-10-26 14:21:30 -0700 | [diff] [blame] | 5579 | continue; |
Namhyung Kim | 29723fc | 2011-02-25 14:44:25 -0800 | [diff] [blame] | 5580 | |
KAMEZAWA Hiroyuki | 49ac825 | 2010-10-26 14:21:30 -0700 | [diff] [blame] | 5581 | page = pfn_to_page(check); |
| 5582 | if (!page_count(page)) { |
| 5583 | if (PageBuddy(page)) |
| 5584 | iter += (1 << page_order(page)) - 1; |
| 5585 | continue; |
| 5586 | } |
| 5587 | if (!PageLRU(page)) |
| 5588 | found++; |
| 5589 | /* |
| 5590 | * If there are RECLAIMABLE pages, we need to check it. |
| 5591 | * But now, memory offline itself doesn't call shrink_slab() |
| 5592 | * and it still to be fixed. |
| 5593 | */ |
| 5594 | /* |
| 5595 | * If the page is not RAM, page_count()should be 0. |
| 5596 | * we don't need more check. This is an _used_ not-movable page. |
| 5597 | * |
| 5598 | * The problematic thing here is PG_reserved pages. PG_reserved |
| 5599 | * is set to both of a memory hole page and a _used_ kernel |
| 5600 | * page at boot. |
| 5601 | */ |
| 5602 | if (found > count) |
| 5603 | return false; |
| 5604 | } |
| 5605 | return true; |
| 5606 | } |
| 5607 | |
| 5608 | bool is_pageblock_removable_nolock(struct page *page) |
| 5609 | { |
| 5610 | struct zone *zone = page_zone(page); |
| 5611 | return __count_immobile_pages(zone, page, 0); |
| 5612 | } |
| 5613 | |
KAMEZAWA Hiroyuki | a5d76b54 | 2007-10-16 01:26:11 -0700 | [diff] [blame] | 5614 | int set_migratetype_isolate(struct page *page) |
| 5615 | { |
| 5616 | struct zone *zone; |
KAMEZAWA Hiroyuki | 49ac825 | 2010-10-26 14:21:30 -0700 | [diff] [blame] | 5617 | unsigned long flags, pfn; |
Robert Jennings | 925cc71 | 2009-12-17 14:44:38 +0000 | [diff] [blame] | 5618 | struct memory_isolate_notify arg; |
| 5619 | int notifier_ret; |
KAMEZAWA Hiroyuki | a5d76b54 | 2007-10-16 01:26:11 -0700 | [diff] [blame] | 5620 | int ret = -EBUSY; |
| 5621 | |
| 5622 | zone = page_zone(page); |
Robert Jennings | 925cc71 | 2009-12-17 14:44:38 +0000 | [diff] [blame] | 5623 | |
KAMEZAWA Hiroyuki | a5d76b54 | 2007-10-16 01:26:11 -0700 | [diff] [blame] | 5624 | spin_lock_irqsave(&zone->lock, flags); |
Robert Jennings | 925cc71 | 2009-12-17 14:44:38 +0000 | [diff] [blame] | 5625 | |
| 5626 | pfn = page_to_pfn(page); |
| 5627 | arg.start_pfn = pfn; |
| 5628 | arg.nr_pages = pageblock_nr_pages; |
| 5629 | arg.pages_found = 0; |
| 5630 | |
| 5631 | /* |
| 5632 | * It may be possible to isolate a pageblock even if the |
| 5633 | * migratetype is not MIGRATE_MOVABLE. The memory isolation |
| 5634 | * notifier chain is used by balloon drivers to return the |
| 5635 | * number of pages in a range that are held by the balloon |
| 5636 | * driver to shrink memory. If all the pages are accounted for |
| 5637 | * by balloons, are free, or on the LRU, isolation can continue. |
| 5638 | * Later, for example, when memory hotplug notifier runs, these |
| 5639 | * pages reported as "can be isolated" should be isolated(freed) |
| 5640 | * by the balloon driver through the memory notifier chain. |
| 5641 | */ |
| 5642 | notifier_ret = memory_isolate_notify(MEM_ISOLATE_COUNT, &arg); |
| 5643 | notifier_ret = notifier_to_errno(notifier_ret); |
KAMEZAWA Hiroyuki | 4b20477 | 2010-10-26 14:21:29 -0700 | [diff] [blame] | 5644 | if (notifier_ret) |
Robert Jennings | 925cc71 | 2009-12-17 14:44:38 +0000 | [diff] [blame] | 5645 | goto out; |
KAMEZAWA Hiroyuki | 49ac825 | 2010-10-26 14:21:30 -0700 | [diff] [blame] | 5646 | /* |
| 5647 | * FIXME: Now, memory hotplug doesn't call shrink_slab() by itself. |
| 5648 | * We just check MOVABLE pages. |
| 5649 | */ |
| 5650 | if (__count_immobile_pages(zone, page, arg.pages_found)) |
Robert Jennings | 925cc71 | 2009-12-17 14:44:38 +0000 | [diff] [blame] | 5651 | ret = 0; |
| 5652 | |
KAMEZAWA Hiroyuki | 49ac825 | 2010-10-26 14:21:30 -0700 | [diff] [blame] | 5653 | /* |
| 5654 | * immobile means "not-on-lru" paes. If immobile is larger than |
| 5655 | * removable-by-driver pages reported by notifier, we'll fail. |
| 5656 | */ |
| 5657 | |
KAMEZAWA Hiroyuki | a5d76b54 | 2007-10-16 01:26:11 -0700 | [diff] [blame] | 5658 | out: |
Robert Jennings | 925cc71 | 2009-12-17 14:44:38 +0000 | [diff] [blame] | 5659 | if (!ret) { |
| 5660 | set_pageblock_migratetype(page, MIGRATE_ISOLATE); |
| 5661 | move_freepages_block(zone, page, MIGRATE_ISOLATE); |
| 5662 | } |
| 5663 | |
KAMEZAWA Hiroyuki | a5d76b54 | 2007-10-16 01:26:11 -0700 | [diff] [blame] | 5664 | spin_unlock_irqrestore(&zone->lock, flags); |
| 5665 | if (!ret) |
Christoph Lameter | 9f8f217 | 2008-02-04 22:29:11 -0800 | [diff] [blame] | 5666 | drain_all_pages(); |
KAMEZAWA Hiroyuki | a5d76b54 | 2007-10-16 01:26:11 -0700 | [diff] [blame] | 5667 | return ret; |
| 5668 | } |
| 5669 | |
| 5670 | void unset_migratetype_isolate(struct page *page) |
| 5671 | { |
| 5672 | struct zone *zone; |
| 5673 | unsigned long flags; |
| 5674 | zone = page_zone(page); |
| 5675 | spin_lock_irqsave(&zone->lock, flags); |
| 5676 | if (get_pageblock_migratetype(page) != MIGRATE_ISOLATE) |
| 5677 | goto out; |
| 5678 | set_pageblock_migratetype(page, MIGRATE_MOVABLE); |
| 5679 | move_freepages_block(zone, page, MIGRATE_MOVABLE); |
| 5680 | out: |
| 5681 | spin_unlock_irqrestore(&zone->lock, flags); |
| 5682 | } |
KAMEZAWA Hiroyuki | 0c0e619 | 2007-10-16 01:26:12 -0700 | [diff] [blame] | 5683 | |
| 5684 | #ifdef CONFIG_MEMORY_HOTREMOVE |
| 5685 | /* |
| 5686 | * All pages in the range must be isolated before calling this. |
| 5687 | */ |
| 5688 | void |
| 5689 | __offline_isolated_pages(unsigned long start_pfn, unsigned long end_pfn) |
| 5690 | { |
| 5691 | struct page *page; |
| 5692 | struct zone *zone; |
| 5693 | int order, i; |
| 5694 | unsigned long pfn; |
| 5695 | unsigned long flags; |
| 5696 | /* find the first valid pfn */ |
| 5697 | for (pfn = start_pfn; pfn < end_pfn; pfn++) |
| 5698 | if (pfn_valid(pfn)) |
| 5699 | break; |
| 5700 | if (pfn == end_pfn) |
| 5701 | return; |
| 5702 | zone = page_zone(pfn_to_page(pfn)); |
| 5703 | spin_lock_irqsave(&zone->lock, flags); |
| 5704 | pfn = start_pfn; |
| 5705 | while (pfn < end_pfn) { |
| 5706 | if (!pfn_valid(pfn)) { |
| 5707 | pfn++; |
| 5708 | continue; |
| 5709 | } |
| 5710 | page = pfn_to_page(pfn); |
| 5711 | BUG_ON(page_count(page)); |
| 5712 | BUG_ON(!PageBuddy(page)); |
| 5713 | order = page_order(page); |
| 5714 | #ifdef CONFIG_DEBUG_VM |
| 5715 | printk(KERN_INFO "remove from free list %lx %d %lx\n", |
| 5716 | pfn, 1 << order, end_pfn); |
| 5717 | #endif |
| 5718 | list_del(&page->lru); |
| 5719 | rmv_page_order(page); |
| 5720 | zone->free_area[order].nr_free--; |
| 5721 | __mod_zone_page_state(zone, NR_FREE_PAGES, |
| 5722 | - (1UL << order)); |
| 5723 | for (i = 0; i < (1 << order); i++) |
| 5724 | SetPageReserved((page+i)); |
| 5725 | pfn += (1 << order); |
| 5726 | } |
| 5727 | spin_unlock_irqrestore(&zone->lock, flags); |
| 5728 | } |
| 5729 | #endif |
Wu Fengguang | 8d22ba1 | 2009-12-16 12:19:58 +0100 | [diff] [blame] | 5730 | |
| 5731 | #ifdef CONFIG_MEMORY_FAILURE |
| 5732 | bool is_free_buddy_page(struct page *page) |
| 5733 | { |
| 5734 | struct zone *zone = page_zone(page); |
| 5735 | unsigned long pfn = page_to_pfn(page); |
| 5736 | unsigned long flags; |
| 5737 | int order; |
| 5738 | |
| 5739 | spin_lock_irqsave(&zone->lock, flags); |
| 5740 | for (order = 0; order < MAX_ORDER; order++) { |
| 5741 | struct page *page_head = page - (pfn & ((1 << order) - 1)); |
| 5742 | |
| 5743 | if (PageBuddy(page_head) && page_order(page_head) >= order) |
| 5744 | break; |
| 5745 | } |
| 5746 | spin_unlock_irqrestore(&zone->lock, flags); |
| 5747 | |
| 5748 | return order < MAX_ORDER; |
| 5749 | } |
| 5750 | #endif |
Wu Fengguang | 718a382 | 2010-03-10 15:20:43 -0800 | [diff] [blame] | 5751 | |
| 5752 | static struct trace_print_flags pageflag_names[] = { |
| 5753 | {1UL << PG_locked, "locked" }, |
| 5754 | {1UL << PG_error, "error" }, |
| 5755 | {1UL << PG_referenced, "referenced" }, |
| 5756 | {1UL << PG_uptodate, "uptodate" }, |
| 5757 | {1UL << PG_dirty, "dirty" }, |
| 5758 | {1UL << PG_lru, "lru" }, |
| 5759 | {1UL << PG_active, "active" }, |
| 5760 | {1UL << PG_slab, "slab" }, |
| 5761 | {1UL << PG_owner_priv_1, "owner_priv_1" }, |
| 5762 | {1UL << PG_arch_1, "arch_1" }, |
| 5763 | {1UL << PG_reserved, "reserved" }, |
| 5764 | {1UL << PG_private, "private" }, |
| 5765 | {1UL << PG_private_2, "private_2" }, |
| 5766 | {1UL << PG_writeback, "writeback" }, |
| 5767 | #ifdef CONFIG_PAGEFLAGS_EXTENDED |
| 5768 | {1UL << PG_head, "head" }, |
| 5769 | {1UL << PG_tail, "tail" }, |
| 5770 | #else |
| 5771 | {1UL << PG_compound, "compound" }, |
| 5772 | #endif |
| 5773 | {1UL << PG_swapcache, "swapcache" }, |
| 5774 | {1UL << PG_mappedtodisk, "mappedtodisk" }, |
| 5775 | {1UL << PG_reclaim, "reclaim" }, |
Wu Fengguang | 718a382 | 2010-03-10 15:20:43 -0800 | [diff] [blame] | 5776 | {1UL << PG_swapbacked, "swapbacked" }, |
| 5777 | {1UL << PG_unevictable, "unevictable" }, |
| 5778 | #ifdef CONFIG_MMU |
| 5779 | {1UL << PG_mlocked, "mlocked" }, |
| 5780 | #endif |
| 5781 | #ifdef CONFIG_ARCH_USES_PG_UNCACHED |
| 5782 | {1UL << PG_uncached, "uncached" }, |
| 5783 | #endif |
| 5784 | #ifdef CONFIG_MEMORY_FAILURE |
| 5785 | {1UL << PG_hwpoison, "hwpoison" }, |
| 5786 | #endif |
| 5787 | {-1UL, NULL }, |
| 5788 | }; |
| 5789 | |
| 5790 | static void dump_page_flags(unsigned long flags) |
| 5791 | { |
| 5792 | const char *delim = ""; |
| 5793 | unsigned long mask; |
| 5794 | int i; |
| 5795 | |
| 5796 | printk(KERN_ALERT "page flags: %#lx(", flags); |
| 5797 | |
| 5798 | /* remove zone id */ |
| 5799 | flags &= (1UL << NR_PAGEFLAGS) - 1; |
| 5800 | |
| 5801 | for (i = 0; pageflag_names[i].name && flags; i++) { |
| 5802 | |
| 5803 | mask = pageflag_names[i].mask; |
| 5804 | if ((flags & mask) != mask) |
| 5805 | continue; |
| 5806 | |
| 5807 | flags &= ~mask; |
| 5808 | printk("%s%s", delim, pageflag_names[i].name); |
| 5809 | delim = "|"; |
| 5810 | } |
| 5811 | |
| 5812 | /* check for left over flags */ |
| 5813 | if (flags) |
| 5814 | printk("%s%#lx", delim, flags); |
| 5815 | |
| 5816 | printk(")\n"); |
| 5817 | } |
| 5818 | |
| 5819 | void dump_page(struct page *page) |
| 5820 | { |
| 5821 | printk(KERN_ALERT |
| 5822 | "page:%p count:%d mapcount:%d mapping:%p index:%#lx\n", |
Andrea Arcangeli | 4e9f64c | 2011-01-13 15:46:29 -0800 | [diff] [blame] | 5823 | page, atomic_read(&page->_count), page_mapcount(page), |
Wu Fengguang | 718a382 | 2010-03-10 15:20:43 -0800 | [diff] [blame] | 5824 | page->mapping, page->index); |
| 5825 | dump_page_flags(page->flags); |
Daisuke Nishimura | f212ad7 | 2011-03-23 16:42:25 -0700 | [diff] [blame] | 5826 | mem_cgroup_print_bad_page(page); |
Wu Fengguang | 718a382 | 2010-03-10 15:20:43 -0800 | [diff] [blame] | 5827 | } |