blob: 431214b941acec39f68e171e468a59f74b9b749e [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
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 Torvalds1da177e2005-04-16 15:20:36 -070017#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 Motohiro10ed2732008-03-04 14:28:32 -080022#include <linux/jiffies.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070023#include <linux/bootmem.h>
24#include <linux/compiler.h>
Randy Dunlap9f158332005-09-13 01:25:16 -070025#include <linux/kernel.h>
Vegard Nossumb1eeab62008-11-25 16:55:53 +010026#include <linux/kmemcheck.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070027#include <linux/module.h>
28#include <linux/suspend.h>
29#include <linux/pagevec.h>
30#include <linux/blkdev.h>
31#include <linux/slab.h>
David Rientjes5a3135c2007-10-16 23:25:53 -070032#include <linux/oom.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070033#include <linux/notifier.h>
34#include <linux/topology.h>
35#include <linux/sysctl.h>
36#include <linux/cpu.h>
37#include <linux/cpuset.h>
Dave Hansenbdc8cb92005-10-29 18:16:53 -070038#include <linux/memory_hotplug.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070039#include <linux/nodemask.h>
40#include <linux/vmalloc.h>
Christoph Lameter4be38e32006-01-06 00:11:17 -080041#include <linux/mempolicy.h>
Yasunori Goto68113782006-06-23 02:03:11 -070042#include <linux/stop_machine.h>
Mel Gormanc7132162006-09-27 01:49:43 -070043#include <linux/sort.h>
44#include <linux/pfn.h>
Andrew Morton3fcfab12006-10-19 23:28:16 -070045#include <linux/backing-dev.h>
Akinobu Mita933e3122006-12-08 02:39:45 -080046#include <linux/fault-inject.h>
KAMEZAWA Hiroyukia5d76b52007-10-16 01:26:11 -070047#include <linux/page-isolation.h>
KAMEZAWA Hiroyuki52d4b9a2008-10-18 20:28:16 -070048#include <linux/page_cgroup.h>
Thomas Gleixner3ac7fe52008-04-30 00:55:01 -070049#include <linux/debugobjects.h>
Catalin Marinasdbb1f812009-06-11 13:23:19 +010050#include <linux/kmemleak.h>
Robert Jennings925cc712009-12-17 14:44:38 +000051#include <linux/memory.h>
Mel Gorman56de7262010-05-24 14:32:30 -070052#include <linux/compaction.h>
Mel Gorman0d3d0622009-09-21 17:02:44 -070053#include <trace/events/kmem.h>
Wu Fengguang718a3822010-03-10 15:20:43 -080054#include <linux/ftrace_event.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070055
56#include <asm/tlbflush.h>
Andrew Mortonac924c62006-05-15 09:43:59 -070057#include <asm/div64.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070058#include "internal.h"
59
Lee Schermerhorn72812012010-05-26 14:44:56 -070060#ifdef CONFIG_USE_PERCPU_NUMA_NODE_ID
61DEFINE_PER_CPU(int, numa_node);
62EXPORT_PER_CPU_SYMBOL(numa_node);
63#endif
64
Lee Schermerhorn7aac7892010-05-26 14:45:00 -070065#ifdef CONFIG_HAVE_MEMORYLESS_NODES
66/*
67 * N.B., Do NOT reference the '_numa_mem_' per cpu variable directly.
68 * It will not be defined when CONFIG_HAVE_MEMORYLESS_NODES is not defined.
69 * Use the accessor functions set_numa_mem(), numa_mem_id() and cpu_to_mem()
70 * defined in <linux/topology.h>.
71 */
72DEFINE_PER_CPU(int, _numa_mem_); /* Kernel "local memory" node */
73EXPORT_PER_CPU_SYMBOL(_numa_mem_);
74#endif
75
Linus Torvalds1da177e2005-04-16 15:20:36 -070076/*
Christoph Lameter13808912007-10-16 01:25:27 -070077 * Array of node states.
Linus Torvalds1da177e2005-04-16 15:20:36 -070078 */
Christoph Lameter13808912007-10-16 01:25:27 -070079nodemask_t node_states[NR_NODE_STATES] __read_mostly = {
80 [N_POSSIBLE] = NODE_MASK_ALL,
81 [N_ONLINE] = { { [0] = 1UL } },
82#ifndef CONFIG_NUMA
83 [N_NORMAL_MEMORY] = { { [0] = 1UL } },
84#ifdef CONFIG_HIGHMEM
85 [N_HIGH_MEMORY] = { { [0] = 1UL } },
86#endif
87 [N_CPU] = { { [0] = 1UL } },
88#endif /* NUMA */
89};
90EXPORT_SYMBOL(node_states);
91
Ravikiran G Thirumalai6c231b72005-09-06 15:17:45 -070092unsigned long totalram_pages __read_mostly;
Hideo AOKIcb45b0e2006-04-10 22:52:59 -070093unsigned long totalreserve_pages __read_mostly;
Rohit Seth8ad4b1f2006-01-08 01:00:40 -080094int percpu_pagelist_fraction;
Benjamin Herrenschmidtdcce2842009-06-18 13:24:12 +100095gfp_t gfp_allowed_mask __read_mostly = GFP_BOOT_MASK;
Linus Torvalds1da177e2005-04-16 15:20:36 -070096
Rafael J. Wysocki452aa692010-03-05 13:42:13 -080097#ifdef CONFIG_PM_SLEEP
98/*
99 * The following functions are used by the suspend/hibernate code to temporarily
100 * change gfp_allowed_mask in order to avoid using I/O during memory allocations
101 * while devices are suspended. To avoid races with the suspend/hibernate code,
102 * they should always be called with pm_mutex held (gfp_allowed_mask also should
103 * only be modified with pm_mutex held, unless the suspend/hibernate code is
104 * guaranteed not to run in parallel with that modification).
105 */
106void set_gfp_allowed_mask(gfp_t mask)
107{
108 WARN_ON(!mutex_is_locked(&pm_mutex));
109 gfp_allowed_mask = mask;
110}
111
112gfp_t clear_gfp_allowed_mask(gfp_t mask)
113{
114 gfp_t ret = gfp_allowed_mask;
115
116 WARN_ON(!mutex_is_locked(&pm_mutex));
117 gfp_allowed_mask &= ~mask;
118 return ret;
119}
120#endif /* CONFIG_PM_SLEEP */
121
Mel Gormand9c23402007-10-16 01:26:01 -0700122#ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
123int pageblock_order __read_mostly;
124#endif
125
Hugh Dickinsd98c7a02006-02-14 13:52:59 -0800126static void __free_pages_ok(struct page *page, unsigned int order);
David Howellsa226f6c2006-01-06 00:11:08 -0800127
Linus Torvalds1da177e2005-04-16 15:20:36 -0700128/*
129 * results with 256, 32 in the lowmem_reserve sysctl:
130 * 1G machine -> (16M dma, 800M-16M normal, 1G-800M high)
131 * 1G machine -> (16M dma, 784M normal, 224M high)
132 * NORMAL allocation will leave 784M/256 of ram reserved in the ZONE_DMA
133 * HIGHMEM allocation will leave 224M/32 of ram reserved in ZONE_NORMAL
134 * HIGHMEM allocation will (224M+784M)/256 of ram reserved in ZONE_DMA
Andi Kleena2f1b422005-11-05 17:25:53 +0100135 *
136 * TBD: should special case ZONE_DMA32 machines here - in those we normally
137 * don't need any ZONE_NORMAL reservation
Linus Torvalds1da177e2005-04-16 15:20:36 -0700138 */
Christoph Lameter2f1b6242006-09-25 23:31:13 -0700139int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES-1] = {
Christoph Lameter4b51d662007-02-10 01:43:10 -0800140#ifdef CONFIG_ZONE_DMA
Christoph Lameter2f1b6242006-09-25 23:31:13 -0700141 256,
Christoph Lameter4b51d662007-02-10 01:43:10 -0800142#endif
Christoph Lameterfb0e7942006-09-25 23:31:13 -0700143#ifdef CONFIG_ZONE_DMA32
Christoph Lameter2f1b6242006-09-25 23:31:13 -0700144 256,
Christoph Lameterfb0e7942006-09-25 23:31:13 -0700145#endif
Christoph Lametere53ef382006-09-25 23:31:14 -0700146#ifdef CONFIG_HIGHMEM
Mel Gorman2a1e2742007-07-17 04:03:12 -0700147 32,
Christoph Lametere53ef382006-09-25 23:31:14 -0700148#endif
Mel Gorman2a1e2742007-07-17 04:03:12 -0700149 32,
Christoph Lameter2f1b6242006-09-25 23:31:13 -0700150};
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151
152EXPORT_SYMBOL(totalram_pages);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700153
Helge Deller15ad7cd2006-12-06 20:40:36 -0800154static char * const zone_names[MAX_NR_ZONES] = {
Christoph Lameter4b51d662007-02-10 01:43:10 -0800155#ifdef CONFIG_ZONE_DMA
Christoph Lameter2f1b6242006-09-25 23:31:13 -0700156 "DMA",
Christoph Lameter4b51d662007-02-10 01:43:10 -0800157#endif
Christoph Lameterfb0e7942006-09-25 23:31:13 -0700158#ifdef CONFIG_ZONE_DMA32
Christoph Lameter2f1b6242006-09-25 23:31:13 -0700159 "DMA32",
Christoph Lameterfb0e7942006-09-25 23:31:13 -0700160#endif
Christoph Lameter2f1b6242006-09-25 23:31:13 -0700161 "Normal",
Christoph Lametere53ef382006-09-25 23:31:14 -0700162#ifdef CONFIG_HIGHMEM
Mel Gorman2a1e2742007-07-17 04:03:12 -0700163 "HighMem",
Christoph Lametere53ef382006-09-25 23:31:14 -0700164#endif
Mel Gorman2a1e2742007-07-17 04:03:12 -0700165 "Movable",
Christoph Lameter2f1b6242006-09-25 23:31:13 -0700166};
167
Linus Torvalds1da177e2005-04-16 15:20:36 -0700168int min_free_kbytes = 1024;
169
Jan Beulich2c85f512009-09-21 17:03:07 -0700170static unsigned long __meminitdata nr_kernel_pages;
171static unsigned long __meminitdata nr_all_pages;
Yasunori Gotoa3142c82007-05-08 00:23:07 -0700172static unsigned long __meminitdata dma_reserve;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700173
Mel Gormanc7132162006-09-27 01:49:43 -0700174#ifdef CONFIG_ARCH_POPULATES_NODE_MAP
175 /*
Simon Arlott183ff222007-10-20 01:27:18 +0200176 * MAX_ACTIVE_REGIONS determines the maximum number of distinct
Mel Gormanc7132162006-09-27 01:49:43 -0700177 * ranges of memory (RAM) that may be registered with add_active_range().
178 * Ranges passed to add_active_range() will be merged if possible
179 * so the number of times add_active_range() can be called is
180 * related to the number of nodes and the number of holes
181 */
182 #ifdef CONFIG_MAX_ACTIVE_REGIONS
183 /* Allow an architecture to set MAX_ACTIVE_REGIONS to save memory */
184 #define MAX_ACTIVE_REGIONS CONFIG_MAX_ACTIVE_REGIONS
185 #else
186 #if MAX_NUMNODES >= 32
187 /* If there can be many nodes, allow up to 50 holes per node */
188 #define MAX_ACTIVE_REGIONS (MAX_NUMNODES*50)
189 #else
190 /* By default, allow up to 256 distinct regions */
191 #define MAX_ACTIVE_REGIONS 256
192 #endif
193 #endif
194
Jan Beulich98011f52007-07-15 23:38:17 -0700195 static struct node_active_region __meminitdata early_node_map[MAX_ACTIVE_REGIONS];
196 static int __meminitdata nr_nodemap_entries;
197 static unsigned long __meminitdata arch_zone_lowest_possible_pfn[MAX_NR_ZONES];
198 static unsigned long __meminitdata arch_zone_highest_possible_pfn[MAX_NR_ZONES];
Adrian Bunkb69a7282008-07-23 21:28:12 -0700199 static unsigned long __initdata required_kernelcore;
Adrian Bunk484f51f2007-10-16 01:26:03 -0700200 static unsigned long __initdata required_movablecore;
Adrian Bunkb69a7282008-07-23 21:28:12 -0700201 static unsigned long __meminitdata zone_movable_pfn[MAX_NUMNODES];
Mel Gorman2a1e2742007-07-17 04:03:12 -0700202
203 /* movable_zone is the "real" zone pages in ZONE_MOVABLE are taken from */
204 int movable_zone;
205 EXPORT_SYMBOL(movable_zone);
Mel Gormanc7132162006-09-27 01:49:43 -0700206#endif /* CONFIG_ARCH_POPULATES_NODE_MAP */
207
Miklos Szeredi418508c2007-05-23 13:57:55 -0700208#if MAX_NUMNODES > 1
209int nr_node_ids __read_mostly = MAX_NUMNODES;
Christoph Lameter62bc62a2009-06-16 15:32:15 -0700210int nr_online_nodes __read_mostly = 1;
Miklos Szeredi418508c2007-05-23 13:57:55 -0700211EXPORT_SYMBOL(nr_node_ids);
Christoph Lameter62bc62a2009-06-16 15:32:15 -0700212EXPORT_SYMBOL(nr_online_nodes);
Miklos Szeredi418508c2007-05-23 13:57:55 -0700213#endif
214
Mel Gorman9ef9acb2007-10-16 01:25:54 -0700215int page_group_by_mobility_disabled __read_mostly;
216
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700217static void set_pageblock_migratetype(struct page *page, int migratetype)
218{
Mel Gorman49255c62009-06-16 15:31:58 -0700219
220 if (unlikely(page_group_by_mobility_disabled))
221 migratetype = MIGRATE_UNMOVABLE;
222
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700223 set_pageblock_flags_group(page, (unsigned long)migratetype,
224 PB_migrate, PB_migrate_end);
225}
226
Rafael J. Wysocki7f33d492009-06-16 15:32:41 -0700227bool oom_killer_disabled __read_mostly;
228
Nick Piggin13e74442006-01-06 00:10:58 -0800229#ifdef CONFIG_DEBUG_VM
Dave Hansenc6a57e12005-10-29 18:16:52 -0700230static int page_outside_zone_boundaries(struct zone *zone, struct page *page)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700231{
Dave Hansenbdc8cb92005-10-29 18:16:53 -0700232 int ret = 0;
233 unsigned seq;
234 unsigned long pfn = page_to_pfn(page);
Dave Hansenc6a57e12005-10-29 18:16:52 -0700235
Dave Hansenbdc8cb92005-10-29 18:16:53 -0700236 do {
237 seq = zone_span_seqbegin(zone);
238 if (pfn >= zone->zone_start_pfn + zone->spanned_pages)
239 ret = 1;
240 else if (pfn < zone->zone_start_pfn)
241 ret = 1;
242 } while (zone_span_seqretry(zone, seq));
243
244 return ret;
Dave Hansenc6a57e12005-10-29 18:16:52 -0700245}
246
247static int page_is_consistent(struct zone *zone, struct page *page)
248{
Andy Whitcroft14e07292007-05-06 14:49:14 -0700249 if (!pfn_valid_within(page_to_pfn(page)))
Dave Hansenc6a57e12005-10-29 18:16:52 -0700250 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700251 if (zone != page_zone(page))
Dave Hansenc6a57e12005-10-29 18:16:52 -0700252 return 0;
253
254 return 1;
255}
256/*
257 * Temporary debugging check for pages not lying within a given zone.
258 */
259static int bad_range(struct zone *zone, struct page *page)
260{
261 if (page_outside_zone_boundaries(zone, page))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700262 return 1;
Dave Hansenc6a57e12005-10-29 18:16:52 -0700263 if (!page_is_consistent(zone, page))
264 return 1;
265
Linus Torvalds1da177e2005-04-16 15:20:36 -0700266 return 0;
267}
Nick Piggin13e74442006-01-06 00:10:58 -0800268#else
269static inline int bad_range(struct zone *zone, struct page *page)
270{
271 return 0;
272}
273#endif
274
Nick Piggin224abf92006-01-06 00:11:11 -0800275static void bad_page(struct page *page)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700276{
Hugh Dickinsd936cf92009-01-06 14:40:12 -0800277 static unsigned long resume;
278 static unsigned long nr_shown;
279 static unsigned long nr_unshown;
280
Wu Fengguang2a7684a2009-09-16 11:50:12 +0200281 /* Don't complain about poisoned pages */
282 if (PageHWPoison(page)) {
283 __ClearPageBuddy(page);
284 return;
285 }
286
Hugh Dickinsd936cf92009-01-06 14:40:12 -0800287 /*
288 * Allow a burst of 60 reports, then keep quiet for that minute;
289 * or allow a steady drip of one report per second.
290 */
291 if (nr_shown == 60) {
292 if (time_before(jiffies, resume)) {
293 nr_unshown++;
294 goto out;
295 }
296 if (nr_unshown) {
Hugh Dickins1e9e6362009-01-06 14:40:13 -0800297 printk(KERN_ALERT
298 "BUG: Bad page state: %lu messages suppressed\n",
Hugh Dickinsd936cf92009-01-06 14:40:12 -0800299 nr_unshown);
300 nr_unshown = 0;
301 }
302 nr_shown = 0;
303 }
304 if (nr_shown++ == 0)
305 resume = jiffies + 60 * HZ;
306
Hugh Dickins1e9e6362009-01-06 14:40:13 -0800307 printk(KERN_ALERT "BUG: Bad page state in process %s pfn:%05lx\n",
Hugh Dickins3dc14742009-01-06 14:40:08 -0800308 current->comm, page_to_pfn(page));
Wu Fengguang718a3822010-03-10 15:20:43 -0800309 dump_page(page);
KAMEZAWA Hiroyuki52d4b9a2008-10-18 20:28:16 -0700310
Linus Torvalds1da177e2005-04-16 15:20:36 -0700311 dump_stack();
Hugh Dickinsd936cf92009-01-06 14:40:12 -0800312out:
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800313 /* Leave bad fields for debug, except PageBuddy could make trouble */
314 __ClearPageBuddy(page);
Randy Dunlap9f158332005-09-13 01:25:16 -0700315 add_taint(TAINT_BAD_PAGE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700316}
317
Linus Torvalds1da177e2005-04-16 15:20:36 -0700318/*
319 * Higher-order pages are called "compound pages". They are structured thusly:
320 *
321 * The first PAGE_SIZE page is called the "head page".
322 *
323 * The remaining PAGE_SIZE pages are called "tail pages".
324 *
325 * All pages have PG_compound set. All pages have their ->private pointing at
326 * the head page (even the head page has this).
327 *
Hugh Dickins41d78ba2006-02-14 13:52:58 -0800328 * The first tail page's ->lru.next holds the address of the compound page's
329 * put_page() function. Its ->lru.prev holds the order of allocation.
330 * This usage means that zero-order pages may not be compound.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700331 */
Hugh Dickinsd98c7a02006-02-14 13:52:59 -0800332
333static void free_compound_page(struct page *page)
334{
Christoph Lameterd85f3382007-05-06 14:49:39 -0700335 __free_pages_ok(page, compound_order(page));
Hugh Dickinsd98c7a02006-02-14 13:52:59 -0800336}
337
Andi Kleen01ad1c02008-07-23 21:27:46 -0700338void prep_compound_page(struct page *page, unsigned long order)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700339{
340 int i;
341 int nr_pages = 1 << order;
342
Andy Whitcroft33f2ef82006-12-06 20:33:32 -0800343 set_compound_page_dtor(page, free_compound_page);
Christoph Lameterd85f3382007-05-06 14:49:39 -0700344 set_compound_order(page, order);
Christoph Lameter6d777952007-05-06 14:49:40 -0700345 __SetPageHead(page);
Andy Whitcroft18229df2008-11-06 12:53:27 -0800346 for (i = 1; i < nr_pages; i++) {
347 struct page *p = page + i;
348
Christoph Lameterd85f3382007-05-06 14:49:39 -0700349 __SetPageTail(p);
Christoph Lameterd85f3382007-05-06 14:49:39 -0700350 p->first_page = page;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700351 }
352}
353
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800354static int destroy_compound_page(struct page *page, unsigned long order)
Andy Whitcroft18229df2008-11-06 12:53:27 -0800355{
356 int i;
357 int nr_pages = 1 << order;
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800358 int bad = 0;
Andy Whitcroft18229df2008-11-06 12:53:27 -0800359
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800360 if (unlikely(compound_order(page) != order) ||
361 unlikely(!PageHead(page))) {
Nick Piggin224abf92006-01-06 00:11:11 -0800362 bad_page(page);
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800363 bad++;
364 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700365
Christoph Lameter6d777952007-05-06 14:49:40 -0700366 __ClearPageHead(page);
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800367
Andy Whitcroft18229df2008-11-06 12:53:27 -0800368 for (i = 1; i < nr_pages; i++) {
369 struct page *p = page + i;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700370
Alexey Zaytseve713a212009-01-10 02:47:57 +0300371 if (unlikely(!PageTail(p) || (p->first_page != page))) {
Nick Piggin224abf92006-01-06 00:11:11 -0800372 bad_page(page);
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800373 bad++;
374 }
Christoph Lameterd85f3382007-05-06 14:49:39 -0700375 __ClearPageTail(p);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700376 }
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800377
378 return bad;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700379}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700380
Nick Piggin17cf4402006-03-22 00:08:41 -0800381static inline void prep_zero_page(struct page *page, int order, gfp_t gfp_flags)
382{
383 int i;
384
Andrew Morton6626c5d2006-03-22 00:08:42 -0800385 /*
386 * clear_highpage() will use KM_USER0, so it's a bug to use __GFP_ZERO
387 * and __GFP_HIGHMEM from hard or soft interrupt context.
388 */
Nick Piggin725d7042006-09-25 23:30:55 -0700389 VM_BUG_ON((gfp_flags & __GFP_HIGHMEM) && in_interrupt());
Nick Piggin17cf4402006-03-22 00:08:41 -0800390 for (i = 0; i < (1 << order); i++)
391 clear_highpage(page + i);
392}
393
Andrew Morton6aa30012006-04-18 22:20:52 -0700394static inline void set_page_order(struct page *page, int order)
395{
Hugh Dickins4c21e2f2005-10-29 18:16:40 -0700396 set_page_private(page, order);
Nick Piggin676165a2006-04-10 11:21:48 +1000397 __SetPageBuddy(page);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700398}
399
400static inline void rmv_page_order(struct page *page)
401{
Nick Piggin676165a2006-04-10 11:21:48 +1000402 __ClearPageBuddy(page);
Hugh Dickins4c21e2f2005-10-29 18:16:40 -0700403 set_page_private(page, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700404}
405
406/*
407 * Locate the struct page for both the matching buddy in our
408 * pair (buddy1) and the combined O(n+1) page they form (page).
409 *
410 * 1) Any buddy B1 will have an order O twin B2 which satisfies
411 * the following equation:
412 * B2 = B1 ^ (1 << O)
413 * For example, if the starting buddy (buddy2) is #8 its order
414 * 1 buddy is #10:
415 * B2 = 8 ^ (1 << 1) = 8 ^ 2 = 10
416 *
417 * 2) Any buddy B will have an order O+1 parent P which
418 * satisfies the following equation:
419 * P = B & ~(1 << O)
420 *
Andreas Mohrd6e05ed2006-06-26 18:35:02 +0200421 * Assumption: *_mem_map is contiguous at least up to MAX_ORDER
Linus Torvalds1da177e2005-04-16 15:20:36 -0700422 */
423static inline struct page *
424__page_find_buddy(struct page *page, unsigned long page_idx, unsigned int order)
425{
426 unsigned long buddy_idx = page_idx ^ (1 << order);
427
428 return page + (buddy_idx - page_idx);
429}
430
431static inline unsigned long
432__find_combined_index(unsigned long page_idx, unsigned int order)
433{
434 return (page_idx & ~(1 << order));
435}
436
437/*
438 * This function checks whether a page is free && is the buddy
439 * we can do coalesce a page and its buddy if
Nick Piggin13e74442006-01-06 00:10:58 -0800440 * (a) the buddy is not in a hole &&
Nick Piggin676165a2006-04-10 11:21:48 +1000441 * (b) the buddy is in the buddy system &&
Andy Whitcroftcb2b95e2006-06-23 02:03:01 -0700442 * (c) a page and its buddy have the same order &&
443 * (d) a page and its buddy are in the same zone.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700444 *
Nick Piggin676165a2006-04-10 11:21:48 +1000445 * For recording whether a page is in the buddy system, we use PG_buddy.
446 * Setting, clearing, and testing PG_buddy is serialized by zone->lock.
447 *
448 * For recording page's order, we use page_private(page).
Linus Torvalds1da177e2005-04-16 15:20:36 -0700449 */
Andy Whitcroftcb2b95e2006-06-23 02:03:01 -0700450static inline int page_is_buddy(struct page *page, struct page *buddy,
451 int order)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700452{
Andy Whitcroft14e07292007-05-06 14:49:14 -0700453 if (!pfn_valid_within(page_to_pfn(buddy)))
Nick Piggin13e74442006-01-06 00:10:58 -0800454 return 0;
Nick Piggin13e74442006-01-06 00:10:58 -0800455
Andy Whitcroftcb2b95e2006-06-23 02:03:01 -0700456 if (page_zone_id(page) != page_zone_id(buddy))
457 return 0;
458
459 if (PageBuddy(buddy) && page_order(buddy) == order) {
Nick Piggina3af9c32009-06-16 15:32:10 -0700460 VM_BUG_ON(page_count(buddy) != 0);
Andrew Morton6aa30012006-04-18 22:20:52 -0700461 return 1;
Nick Piggin676165a2006-04-10 11:21:48 +1000462 }
Andrew Morton6aa30012006-04-18 22:20:52 -0700463 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700464}
465
466/*
467 * Freeing function for a buddy system allocator.
468 *
469 * The concept of a buddy system is to maintain direct-mapped table
470 * (containing bit values) for memory blocks of various "orders".
471 * The bottom level table contains the map for the smallest allocatable
472 * units of memory (here, pages), and each level above it describes
473 * pairs of units from the levels below, hence, "buddies".
474 * At a high level, all that happens here is marking the table entry
475 * at the bottom level available, and propagating the changes upward
476 * as necessary, plus some accounting needed to play nicely with other
477 * parts of the VM system.
478 * At each level, we keep a list of pages, which are heads of continuous
Nick Piggin676165a2006-04-10 11:21:48 +1000479 * free pages of length of (1 << order) and marked with PG_buddy. Page's
Hugh Dickins4c21e2f2005-10-29 18:16:40 -0700480 * order is recorded in page_private(page) field.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700481 * So when we are allocating or freeing one, we can derive the state of the
482 * other. That is, if we allocate a small block, and both were
483 * free, the remainder of the region must be split into blocks.
484 * If a block is freed, and its buddy is also free, then this
485 * triggers coalescing into a block of larger size.
486 *
487 * -- wli
488 */
489
Nick Piggin48db57f2006-01-08 01:00:42 -0800490static inline void __free_one_page(struct page *page,
Mel Gormaned0ae212009-06-16 15:32:07 -0700491 struct zone *zone, unsigned int order,
492 int migratetype)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700493{
494 unsigned long page_idx;
Corrado Zoccolo6dda9d52010-05-24 14:31:54 -0700495 unsigned long combined_idx;
496 struct page *buddy;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700497
Nick Piggin224abf92006-01-06 00:11:11 -0800498 if (unlikely(PageCompound(page)))
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800499 if (unlikely(destroy_compound_page(page, order)))
500 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700501
Mel Gormaned0ae212009-06-16 15:32:07 -0700502 VM_BUG_ON(migratetype == -1);
503
Linus Torvalds1da177e2005-04-16 15:20:36 -0700504 page_idx = page_to_pfn(page) & ((1 << MAX_ORDER) - 1);
505
Mel Gormanf2260e62009-06-16 15:32:13 -0700506 VM_BUG_ON(page_idx & ((1 << order) - 1));
Nick Piggin725d7042006-09-25 23:30:55 -0700507 VM_BUG_ON(bad_range(zone, page));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700508
Linus Torvalds1da177e2005-04-16 15:20:36 -0700509 while (order < MAX_ORDER-1) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700510 buddy = __page_find_buddy(page, page_idx, order);
Andy Whitcroftcb2b95e2006-06-23 02:03:01 -0700511 if (!page_is_buddy(page, buddy, order))
Andy Whitcroft3c82d0c2008-07-23 21:27:11 -0700512 break;
Nick Piggin13e74442006-01-06 00:10:58 -0800513
Andy Whitcroft3c82d0c2008-07-23 21:27:11 -0700514 /* Our buddy is free, merge with it and move up one order. */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700515 list_del(&buddy->lru);
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700516 zone->free_area[order].nr_free--;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700517 rmv_page_order(buddy);
Nick Piggin13e74442006-01-06 00:10:58 -0800518 combined_idx = __find_combined_index(page_idx, order);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700519 page = page + (combined_idx - page_idx);
520 page_idx = combined_idx;
521 order++;
522 }
523 set_page_order(page, order);
Corrado Zoccolo6dda9d52010-05-24 14:31:54 -0700524
525 /*
526 * If this is not the largest possible page, check if the buddy
527 * of the next-highest order is free. If it is, it's possible
528 * that pages are being freed that will coalesce soon. In case,
529 * that is happening, add the free page to the tail of the list
530 * so it's less likely to be used soon and more likely to be merged
531 * as a higher order page
532 */
533 if ((order < MAX_ORDER-1) && pfn_valid_within(page_to_pfn(buddy))) {
534 struct page *higher_page, *higher_buddy;
535 combined_idx = __find_combined_index(page_idx, order);
536 higher_page = page + combined_idx - page_idx;
537 higher_buddy = __page_find_buddy(higher_page, combined_idx, order + 1);
538 if (page_is_buddy(higher_page, higher_buddy, order + 1)) {
539 list_add_tail(&page->lru,
540 &zone->free_area[order].free_list[migratetype]);
541 goto out;
542 }
543 }
544
545 list_add(&page->lru, &zone->free_area[order].free_list[migratetype]);
546out:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700547 zone->free_area[order].nr_free++;
548}
549
KOSAKI Motohiro092cead2009-06-16 15:32:17 -0700550/*
551 * free_page_mlock() -- clean up attempts to free and mlocked() page.
552 * Page should not be on lru, so no need to fix that up.
553 * free_pages_check() will verify...
554 */
555static inline void free_page_mlock(struct page *page)
556{
KOSAKI Motohiro092cead2009-06-16 15:32:17 -0700557 __dec_zone_page_state(page, NR_MLOCK);
558 __count_vm_event(UNEVICTABLE_MLOCKFREED);
559}
KOSAKI Motohiro092cead2009-06-16 15:32:17 -0700560
Nick Piggin224abf92006-01-06 00:11:11 -0800561static inline int free_pages_check(struct page *page)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700562{
Nick Piggin92be2e32006-01-06 00:10:57 -0800563 if (unlikely(page_mapcount(page) |
564 (page->mapping != NULL) |
Nick Piggina3af9c32009-06-16 15:32:10 -0700565 (atomic_read(&page->_count) != 0) |
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800566 (page->flags & PAGE_FLAGS_CHECK_AT_FREE))) {
Nick Piggin224abf92006-01-06 00:11:11 -0800567 bad_page(page);
Hugh Dickins79f4b7b2009-01-06 14:40:05 -0800568 return 1;
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800569 }
Hugh Dickins79f4b7b2009-01-06 14:40:05 -0800570 if (page->flags & PAGE_FLAGS_CHECK_AT_PREP)
571 page->flags &= ~PAGE_FLAGS_CHECK_AT_PREP;
572 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700573}
574
575/*
Mel Gorman5f8dcc22009-09-21 17:03:19 -0700576 * Frees a number of pages from the PCP lists
Linus Torvalds1da177e2005-04-16 15:20:36 -0700577 * Assumes all pages on list are in same zone, and of same order.
Renaud Lienhart207f36e2005-09-10 00:26:59 -0700578 * count is the number of pages to free.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700579 *
580 * If the zone was previously in an "all pages pinned" state then look to
581 * see if this freeing clears that state.
582 *
583 * And clear the zone's pages_scanned counter, to hold off the "all pages are
584 * pinned" detection logic.
585 */
Mel Gorman5f8dcc22009-09-21 17:03:19 -0700586static void free_pcppages_bulk(struct zone *zone, int count,
587 struct per_cpu_pages *pcp)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700588{
Mel Gorman5f8dcc22009-09-21 17:03:19 -0700589 int migratetype = 0;
Mel Gormana6f9edd2009-09-21 17:03:20 -0700590 int batch_free = 0;
Mel Gorman5f8dcc22009-09-21 17:03:19 -0700591
Nick Pigginc54ad302006-01-06 00:10:56 -0800592 spin_lock(&zone->lock);
KOSAKI Motohiro93e4a892010-03-05 13:41:55 -0800593 zone->all_unreclaimable = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700594 zone->pages_scanned = 0;
Mel Gormanf2260e62009-06-16 15:32:13 -0700595
Mel Gorman5f8dcc22009-09-21 17:03:19 -0700596 __mod_zone_page_state(zone, NR_FREE_PAGES, count);
Mel Gormana6f9edd2009-09-21 17:03:20 -0700597 while (count) {
Nick Piggin48db57f2006-01-08 01:00:42 -0800598 struct page *page;
Mel Gorman5f8dcc22009-09-21 17:03:19 -0700599 struct list_head *list;
Nick Piggin48db57f2006-01-08 01:00:42 -0800600
Mel Gorman5f8dcc22009-09-21 17:03:19 -0700601 /*
Mel Gormana6f9edd2009-09-21 17:03:20 -0700602 * Remove pages from lists in a round-robin fashion. A
603 * batch_free count is maintained that is incremented when an
604 * empty list is encountered. This is so more pages are freed
605 * off fuller lists instead of spinning excessively around empty
606 * lists
Mel Gorman5f8dcc22009-09-21 17:03:19 -0700607 */
608 do {
Mel Gormana6f9edd2009-09-21 17:03:20 -0700609 batch_free++;
Mel Gorman5f8dcc22009-09-21 17:03:19 -0700610 if (++migratetype == MIGRATE_PCPTYPES)
611 migratetype = 0;
612 list = &pcp->lists[migratetype];
613 } while (list_empty(list));
614
Mel Gormana6f9edd2009-09-21 17:03:20 -0700615 do {
616 page = list_entry(list->prev, struct page, lru);
617 /* must delete as __free_one_page list manipulates */
618 list_del(&page->lru);
Hugh Dickinsa7016232010-01-29 17:46:34 +0000619 /* MIGRATE_MOVABLE list may include MIGRATE_RESERVEs */
620 __free_one_page(page, zone, 0, page_private(page));
621 trace_mm_page_pcpu_drain(page, 0, page_private(page));
Mel Gormana6f9edd2009-09-21 17:03:20 -0700622 } while (--count && --batch_free && !list_empty(list));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700623 }
Nick Pigginc54ad302006-01-06 00:10:56 -0800624 spin_unlock(&zone->lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700625}
626
Mel Gormaned0ae212009-06-16 15:32:07 -0700627static void free_one_page(struct zone *zone, struct page *page, int order,
628 int migratetype)
Nick Piggin48db57f2006-01-08 01:00:42 -0800629{
Christoph Lameter006d22d2006-09-25 23:31:48 -0700630 spin_lock(&zone->lock);
KOSAKI Motohiro93e4a892010-03-05 13:41:55 -0800631 zone->all_unreclaimable = 0;
Christoph Lameter006d22d2006-09-25 23:31:48 -0700632 zone->pages_scanned = 0;
Mel Gormanf2260e62009-06-16 15:32:13 -0700633
634 __mod_zone_page_state(zone, NR_FREE_PAGES, 1 << order);
Mel Gormaned0ae212009-06-16 15:32:07 -0700635 __free_one_page(page, zone, order, migratetype);
Christoph Lameter006d22d2006-09-25 23:31:48 -0700636 spin_unlock(&zone->lock);
Nick Piggin48db57f2006-01-08 01:00:42 -0800637}
638
KOSAKI Motohiroec95f532010-05-24 14:32:38 -0700639static bool free_pages_prepare(struct page *page, unsigned int order)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700640{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700641 int i;
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800642 int bad = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700643
Li Hongf6503162010-03-05 13:41:52 -0800644 trace_mm_page_free_direct(page, order);
Vegard Nossumb1eeab62008-11-25 16:55:53 +0100645 kmemcheck_free_shadow(page, order);
646
KOSAKI Motohiroec95f532010-05-24 14:32:38 -0700647 for (i = 0; i < (1 << order); i++) {
648 struct page *pg = page + i;
649
650 if (PageAnon(pg))
651 pg->mapping = NULL;
652 bad += free_pages_check(pg);
653 }
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800654 if (bad)
KOSAKI Motohiroec95f532010-05-24 14:32:38 -0700655 return false;
Hugh Dickins689bceb2005-11-21 21:32:20 -0800656
Thomas Gleixner3ac7fe52008-04-30 00:55:01 -0700657 if (!PageHighMem(page)) {
Nick Piggin9858db52006-10-11 01:21:30 -0700658 debug_check_no_locks_freed(page_address(page),PAGE_SIZE<<order);
Thomas Gleixner3ac7fe52008-04-30 00:55:01 -0700659 debug_check_no_obj_freed(page_address(page),
660 PAGE_SIZE << order);
661 }
Nick Piggindafb1362006-10-11 01:21:30 -0700662 arch_free_page(page, order);
Nick Piggin48db57f2006-01-08 01:00:42 -0800663 kernel_map_pages(page, 1 << order, 0);
Nick Piggindafb1362006-10-11 01:21:30 -0700664
KOSAKI Motohiroec95f532010-05-24 14:32:38 -0700665 return true;
666}
667
668static void __free_pages_ok(struct page *page, unsigned int order)
669{
670 unsigned long flags;
671 int wasMlocked = __TestClearPageMlocked(page);
672
673 if (!free_pages_prepare(page, order))
674 return;
675
Nick Pigginc54ad302006-01-06 00:10:56 -0800676 local_irq_save(flags);
Johannes Weinerc2773312009-06-19 19:30:56 +0200677 if (unlikely(wasMlocked))
Mel Gormanda456f12009-06-16 15:32:08 -0700678 free_page_mlock(page);
Christoph Lameterf8891e52006-06-30 01:55:45 -0700679 __count_vm_events(PGFREE, 1 << order);
Mel Gormaned0ae212009-06-16 15:32:07 -0700680 free_one_page(page_zone(page), page, order,
681 get_pageblock_migratetype(page));
Nick Pigginc54ad302006-01-06 00:10:56 -0800682 local_irq_restore(flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700683}
684
David Howellsa226f6c2006-01-06 00:11:08 -0800685/*
686 * permit the bootmem allocator to evade page validation on high-order frees
687 */
Yasunori Gotoaf370fb2008-07-23 21:28:17 -0700688void __meminit __free_pages_bootmem(struct page *page, unsigned int order)
David Howellsa226f6c2006-01-06 00:11:08 -0800689{
690 if (order == 0) {
691 __ClearPageReserved(page);
692 set_page_count(page, 0);
Nick Piggin7835e982006-03-22 00:08:40 -0800693 set_page_refcounted(page);
Nick Piggin545b1ea2006-03-22 00:08:07 -0800694 __free_page(page);
David Howellsa226f6c2006-01-06 00:11:08 -0800695 } else {
David Howellsa226f6c2006-01-06 00:11:08 -0800696 int loop;
697
Nick Piggin545b1ea2006-03-22 00:08:07 -0800698 prefetchw(page);
David Howellsa226f6c2006-01-06 00:11:08 -0800699 for (loop = 0; loop < BITS_PER_LONG; loop++) {
700 struct page *p = &page[loop];
701
Nick Piggin545b1ea2006-03-22 00:08:07 -0800702 if (loop + 1 < BITS_PER_LONG)
703 prefetchw(p + 1);
David Howellsa226f6c2006-01-06 00:11:08 -0800704 __ClearPageReserved(p);
705 set_page_count(p, 0);
706 }
707
Nick Piggin7835e982006-03-22 00:08:40 -0800708 set_page_refcounted(page);
Nick Piggin545b1ea2006-03-22 00:08:07 -0800709 __free_pages(page, order);
David Howellsa226f6c2006-01-06 00:11:08 -0800710 }
711}
712
Linus Torvalds1da177e2005-04-16 15:20:36 -0700713
714/*
715 * The order of subdivision here is critical for the IO subsystem.
716 * Please do not alter this order without good reasons and regression
717 * testing. Specifically, as large blocks of memory are subdivided,
718 * the order in which smaller blocks are delivered depends on the order
719 * they're subdivided in this function. This is the primary factor
720 * influencing the order in which pages are delivered to the IO
721 * subsystem according to empirical testing, and this is also justified
722 * by considering the behavior of a buddy system containing a single
723 * large block of memory acted on by a series of small allocations.
724 * This behavior is a critical factor in sglist merging's success.
725 *
726 * -- wli
727 */
Nick Piggin085cc7d2006-01-06 00:11:01 -0800728static inline void expand(struct zone *zone, struct page *page,
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700729 int low, int high, struct free_area *area,
730 int migratetype)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700731{
732 unsigned long size = 1 << high;
733
734 while (high > low) {
735 area--;
736 high--;
737 size >>= 1;
Nick Piggin725d7042006-09-25 23:30:55 -0700738 VM_BUG_ON(bad_range(zone, &page[size]));
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700739 list_add(&page[size].lru, &area->free_list[migratetype]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700740 area->nr_free++;
741 set_page_order(&page[size], high);
742 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700743}
744
Linus Torvalds1da177e2005-04-16 15:20:36 -0700745/*
746 * This page is about to be returned from the page allocator
747 */
Wu Fengguang2a7684a2009-09-16 11:50:12 +0200748static inline int check_new_page(struct page *page)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700749{
Nick Piggin92be2e32006-01-06 00:10:57 -0800750 if (unlikely(page_mapcount(page) |
751 (page->mapping != NULL) |
Nick Piggina3af9c32009-06-16 15:32:10 -0700752 (atomic_read(&page->_count) != 0) |
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800753 (page->flags & PAGE_FLAGS_CHECK_AT_PREP))) {
Nick Piggin224abf92006-01-06 00:11:11 -0800754 bad_page(page);
Hugh Dickins689bceb2005-11-21 21:32:20 -0800755 return 1;
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800756 }
Wu Fengguang2a7684a2009-09-16 11:50:12 +0200757 return 0;
758}
759
760static int prep_new_page(struct page *page, int order, gfp_t gfp_flags)
761{
762 int i;
763
764 for (i = 0; i < (1 << order); i++) {
765 struct page *p = page + i;
766 if (unlikely(check_new_page(p)))
767 return 1;
768 }
Hugh Dickins689bceb2005-11-21 21:32:20 -0800769
Hugh Dickins4c21e2f2005-10-29 18:16:40 -0700770 set_page_private(page, 0);
Nick Piggin7835e982006-03-22 00:08:40 -0800771 set_page_refcounted(page);
Nick Piggincc102502006-12-06 20:32:00 -0800772
773 arch_alloc_page(page, order);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700774 kernel_map_pages(page, 1 << order, 1);
Nick Piggin17cf4402006-03-22 00:08:41 -0800775
776 if (gfp_flags & __GFP_ZERO)
777 prep_zero_page(page, order, gfp_flags);
778
779 if (order && (gfp_flags & __GFP_COMP))
780 prep_compound_page(page, order);
781
Hugh Dickins689bceb2005-11-21 21:32:20 -0800782 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700783}
784
Mel Gorman56fd56b2007-10-16 01:25:58 -0700785/*
786 * Go through the free lists for the given migratetype and remove
787 * the smallest available page from the freelists
788 */
Mel Gorman728ec982009-06-16 15:32:04 -0700789static inline
790struct page *__rmqueue_smallest(struct zone *zone, unsigned int order,
Mel Gorman56fd56b2007-10-16 01:25:58 -0700791 int migratetype)
792{
793 unsigned int current_order;
794 struct free_area * area;
795 struct page *page;
796
797 /* Find a page of the appropriate size in the preferred list */
798 for (current_order = order; current_order < MAX_ORDER; ++current_order) {
799 area = &(zone->free_area[current_order]);
800 if (list_empty(&area->free_list[migratetype]))
801 continue;
802
803 page = list_entry(area->free_list[migratetype].next,
804 struct page, lru);
805 list_del(&page->lru);
806 rmv_page_order(page);
807 area->nr_free--;
Mel Gorman56fd56b2007-10-16 01:25:58 -0700808 expand(zone, page, order, current_order, area, migratetype);
809 return page;
810 }
811
812 return NULL;
813}
814
815
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700816/*
817 * This array describes the order lists are fallen back to when
818 * the free lists for the desirable migrate type are depleted
819 */
820static int fallbacks[MIGRATE_TYPES][MIGRATE_TYPES-1] = {
Mel Gorman64c5e132007-10-16 01:25:59 -0700821 [MIGRATE_UNMOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_MOVABLE, MIGRATE_RESERVE },
822 [MIGRATE_RECLAIMABLE] = { MIGRATE_UNMOVABLE, MIGRATE_MOVABLE, MIGRATE_RESERVE },
823 [MIGRATE_MOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_UNMOVABLE, MIGRATE_RESERVE },
824 [MIGRATE_RESERVE] = { MIGRATE_RESERVE, MIGRATE_RESERVE, MIGRATE_RESERVE }, /* Never used */
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700825};
826
Mel Gormanc361be52007-10-16 01:25:51 -0700827/*
828 * Move the free pages in a range to the free lists of the requested type.
Mel Gormand9c23402007-10-16 01:26:01 -0700829 * Note that start_page and end_pages are not aligned on a pageblock
Mel Gormanc361be52007-10-16 01:25:51 -0700830 * boundary. If alignment is required, use move_freepages_block()
831 */
Adrian Bunkb69a7282008-07-23 21:28:12 -0700832static int move_freepages(struct zone *zone,
833 struct page *start_page, struct page *end_page,
834 int migratetype)
Mel Gormanc361be52007-10-16 01:25:51 -0700835{
836 struct page *page;
837 unsigned long order;
Mel Gormand1003132007-10-16 01:26:00 -0700838 int pages_moved = 0;
Mel Gormanc361be52007-10-16 01:25:51 -0700839
840#ifndef CONFIG_HOLES_IN_ZONE
841 /*
842 * page_zone is not safe to call in this context when
843 * CONFIG_HOLES_IN_ZONE is set. This bug check is probably redundant
844 * anyway as we check zone boundaries in move_freepages_block().
845 * Remove at a later date when no bug reports exist related to
Mel Gormanac0e5b72007-10-16 01:25:58 -0700846 * grouping pages by mobility
Mel Gormanc361be52007-10-16 01:25:51 -0700847 */
848 BUG_ON(page_zone(start_page) != page_zone(end_page));
849#endif
850
851 for (page = start_page; page <= end_page;) {
Adam Litke344c7902008-09-02 14:35:38 -0700852 /* Make sure we are not inadvertently changing nodes */
853 VM_BUG_ON(page_to_nid(page) != zone_to_nid(zone));
854
Mel Gormanc361be52007-10-16 01:25:51 -0700855 if (!pfn_valid_within(page_to_pfn(page))) {
856 page++;
857 continue;
858 }
859
860 if (!PageBuddy(page)) {
861 page++;
862 continue;
863 }
864
865 order = page_order(page);
866 list_del(&page->lru);
867 list_add(&page->lru,
868 &zone->free_area[order].free_list[migratetype]);
869 page += 1 << order;
Mel Gormand1003132007-10-16 01:26:00 -0700870 pages_moved += 1 << order;
Mel Gormanc361be52007-10-16 01:25:51 -0700871 }
872
Mel Gormand1003132007-10-16 01:26:00 -0700873 return pages_moved;
Mel Gormanc361be52007-10-16 01:25:51 -0700874}
875
Adrian Bunkb69a7282008-07-23 21:28:12 -0700876static int move_freepages_block(struct zone *zone, struct page *page,
877 int migratetype)
Mel Gormanc361be52007-10-16 01:25:51 -0700878{
879 unsigned long start_pfn, end_pfn;
880 struct page *start_page, *end_page;
881
882 start_pfn = page_to_pfn(page);
Mel Gormand9c23402007-10-16 01:26:01 -0700883 start_pfn = start_pfn & ~(pageblock_nr_pages-1);
Mel Gormanc361be52007-10-16 01:25:51 -0700884 start_page = pfn_to_page(start_pfn);
Mel Gormand9c23402007-10-16 01:26:01 -0700885 end_page = start_page + pageblock_nr_pages - 1;
886 end_pfn = start_pfn + pageblock_nr_pages - 1;
Mel Gormanc361be52007-10-16 01:25:51 -0700887
888 /* Do not cross zone boundaries */
889 if (start_pfn < zone->zone_start_pfn)
890 start_page = page;
891 if (end_pfn >= zone->zone_start_pfn + zone->spanned_pages)
892 return 0;
893
894 return move_freepages(zone, start_page, end_page, migratetype);
895}
896
Mel Gorman2f66a682009-09-21 17:02:31 -0700897static void change_pageblock_range(struct page *pageblock_page,
898 int start_order, int migratetype)
899{
900 int nr_pageblocks = 1 << (start_order - pageblock_order);
901
902 while (nr_pageblocks--) {
903 set_pageblock_migratetype(pageblock_page, migratetype);
904 pageblock_page += pageblock_nr_pages;
905 }
906}
907
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700908/* Remove an element from the buddy allocator from the fallback list */
Mel Gorman0ac3a402009-06-16 15:32:06 -0700909static inline struct page *
910__rmqueue_fallback(struct zone *zone, int order, int start_migratetype)
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700911{
912 struct free_area * area;
913 int current_order;
914 struct page *page;
915 int migratetype, i;
916
917 /* Find the largest possible block of pages in the other list */
918 for (current_order = MAX_ORDER-1; current_order >= order;
919 --current_order) {
920 for (i = 0; i < MIGRATE_TYPES - 1; i++) {
921 migratetype = fallbacks[start_migratetype][i];
922
Mel Gorman56fd56b2007-10-16 01:25:58 -0700923 /* MIGRATE_RESERVE handled later if necessary */
924 if (migratetype == MIGRATE_RESERVE)
925 continue;
Mel Gormane0104872007-10-16 01:25:53 -0700926
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700927 area = &(zone->free_area[current_order]);
928 if (list_empty(&area->free_list[migratetype]))
929 continue;
930
931 page = list_entry(area->free_list[migratetype].next,
932 struct page, lru);
933 area->nr_free--;
934
935 /*
Mel Gormanc361be52007-10-16 01:25:51 -0700936 * If breaking a large block of pages, move all free
Mel Gorman46dafbc2007-10-16 01:25:55 -0700937 * pages to the preferred allocation list. If falling
938 * back for a reclaimable kernel allocation, be more
939 * agressive about taking ownership of free pages
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700940 */
Mel Gormand9c23402007-10-16 01:26:01 -0700941 if (unlikely(current_order >= (pageblock_order >> 1)) ||
Mel Gormandd5d2412009-09-05 11:17:11 -0700942 start_migratetype == MIGRATE_RECLAIMABLE ||
943 page_group_by_mobility_disabled) {
Mel Gorman46dafbc2007-10-16 01:25:55 -0700944 unsigned long pages;
945 pages = move_freepages_block(zone, page,
946 start_migratetype);
947
948 /* Claim the whole block if over half of it is free */
Mel Gormandd5d2412009-09-05 11:17:11 -0700949 if (pages >= (1 << (pageblock_order-1)) ||
950 page_group_by_mobility_disabled)
Mel Gorman46dafbc2007-10-16 01:25:55 -0700951 set_pageblock_migratetype(page,
952 start_migratetype);
953
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700954 migratetype = start_migratetype;
Mel Gormanc361be52007-10-16 01:25:51 -0700955 }
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700956
957 /* Remove the page from the freelists */
958 list_del(&page->lru);
959 rmv_page_order(page);
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700960
Mel Gorman2f66a682009-09-21 17:02:31 -0700961 /* Take ownership for orders >= pageblock_order */
962 if (current_order >= pageblock_order)
963 change_pageblock_range(page, current_order,
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700964 start_migratetype);
965
966 expand(zone, page, order, current_order, area, migratetype);
Mel Gormane0fff1b2009-09-21 17:02:42 -0700967
968 trace_mm_page_alloc_extfrag(page, order, current_order,
969 start_migratetype, migratetype);
970
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700971 return page;
972 }
973 }
974
Mel Gorman728ec982009-06-16 15:32:04 -0700975 return NULL;
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700976}
977
Mel Gorman56fd56b2007-10-16 01:25:58 -0700978/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700979 * Do the hard work of removing an element from the buddy allocator.
980 * Call me with the zone->lock already held.
981 */
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700982static struct page *__rmqueue(struct zone *zone, unsigned int order,
983 int migratetype)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700984{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700985 struct page *page;
986
Mel Gorman728ec982009-06-16 15:32:04 -0700987retry_reserve:
Mel Gorman56fd56b2007-10-16 01:25:58 -0700988 page = __rmqueue_smallest(zone, order, migratetype);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700989
Mel Gorman728ec982009-06-16 15:32:04 -0700990 if (unlikely(!page) && migratetype != MIGRATE_RESERVE) {
Mel Gorman56fd56b2007-10-16 01:25:58 -0700991 page = __rmqueue_fallback(zone, order, migratetype);
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700992
Mel Gorman728ec982009-06-16 15:32:04 -0700993 /*
994 * Use MIGRATE_RESERVE rather than fail an allocation. goto
995 * is used because __rmqueue_smallest is an inline function
996 * and we want just one call site
997 */
998 if (!page) {
999 migratetype = MIGRATE_RESERVE;
1000 goto retry_reserve;
1001 }
1002 }
1003
Mel Gorman0d3d0622009-09-21 17:02:44 -07001004 trace_mm_page_alloc_zone_locked(page, order, migratetype);
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001005 return page;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001006}
1007
1008/*
1009 * Obtain a specified number of elements from the buddy allocator, all under
1010 * a single hold of the lock, for efficiency. Add them to the supplied list.
1011 * Returns the number of new pages which were placed at *list.
1012 */
1013static int rmqueue_bulk(struct zone *zone, unsigned int order,
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001014 unsigned long count, struct list_head *list,
Mel Gormane084b2d2009-07-29 15:02:04 -07001015 int migratetype, int cold)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001016{
Linus Torvalds1da177e2005-04-16 15:20:36 -07001017 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001018
Nick Pigginc54ad302006-01-06 00:10:56 -08001019 spin_lock(&zone->lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001020 for (i = 0; i < count; ++i) {
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001021 struct page *page = __rmqueue(zone, order, migratetype);
Nick Piggin085cc7d2006-01-06 00:11:01 -08001022 if (unlikely(page == NULL))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001023 break;
Mel Gorman81eabcb2007-12-17 16:20:05 -08001024
1025 /*
1026 * Split buddy pages returned by expand() are received here
1027 * in physical page order. The page is added to the callers and
1028 * list and the list head then moves forward. From the callers
1029 * perspective, the linked list is ordered by page number in
1030 * some conditions. This is useful for IO devices that can
1031 * merge IO requests if the physical pages are ordered
1032 * properly.
1033 */
Mel Gormane084b2d2009-07-29 15:02:04 -07001034 if (likely(cold == 0))
1035 list_add(&page->lru, list);
1036 else
1037 list_add_tail(&page->lru, list);
Mel Gorman535131e2007-10-16 01:25:49 -07001038 set_page_private(page, migratetype);
Mel Gorman81eabcb2007-12-17 16:20:05 -08001039 list = &page->lru;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001040 }
Mel Gormanf2260e62009-06-16 15:32:13 -07001041 __mod_zone_page_state(zone, NR_FREE_PAGES, -(i << order));
Nick Pigginc54ad302006-01-06 00:10:56 -08001042 spin_unlock(&zone->lock);
Nick Piggin085cc7d2006-01-06 00:11:01 -08001043 return i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001044}
1045
Christoph Lameter4ae7c032005-06-21 17:14:57 -07001046#ifdef CONFIG_NUMA
Christoph Lameter8fce4d82006-03-09 17:33:54 -08001047/*
Christoph Lameter4037d452007-05-09 02:35:14 -07001048 * Called from the vmstat counter updater to drain pagesets of this
1049 * currently executing processor on remote nodes after they have
1050 * expired.
1051 *
Christoph Lameter879336c2006-03-22 00:09:08 -08001052 * Note that this function must be called with the thread pinned to
1053 * a single processor.
Christoph Lameter8fce4d82006-03-09 17:33:54 -08001054 */
Christoph Lameter4037d452007-05-09 02:35:14 -07001055void drain_zone_pages(struct zone *zone, struct per_cpu_pages *pcp)
Christoph Lameter4ae7c032005-06-21 17:14:57 -07001056{
Christoph Lameter4ae7c032005-06-21 17:14:57 -07001057 unsigned long flags;
Christoph Lameter4037d452007-05-09 02:35:14 -07001058 int to_drain;
Christoph Lameter4ae7c032005-06-21 17:14:57 -07001059
Christoph Lameter4037d452007-05-09 02:35:14 -07001060 local_irq_save(flags);
1061 if (pcp->count >= pcp->batch)
1062 to_drain = pcp->batch;
1063 else
1064 to_drain = pcp->count;
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001065 free_pcppages_bulk(zone, to_drain, pcp);
Christoph Lameter4037d452007-05-09 02:35:14 -07001066 pcp->count -= to_drain;
1067 local_irq_restore(flags);
Christoph Lameter4ae7c032005-06-21 17:14:57 -07001068}
1069#endif
1070
Christoph Lameter9f8f2172008-02-04 22:29:11 -08001071/*
1072 * Drain pages of the indicated processor.
1073 *
1074 * The processor must either be the current processor and the
1075 * thread pinned to the current processor or a processor that
1076 * is not online.
1077 */
1078static void drain_pages(unsigned int cpu)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001079{
Nick Pigginc54ad302006-01-06 00:10:56 -08001080 unsigned long flags;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001081 struct zone *zone;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001082
KOSAKI Motohiroee99c712009-03-31 15:19:31 -07001083 for_each_populated_zone(zone) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001084 struct per_cpu_pageset *pset;
Christoph Lameter3dfa5722008-02-04 22:29:19 -08001085 struct per_cpu_pages *pcp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001086
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09001087 local_irq_save(flags);
1088 pset = per_cpu_ptr(zone->pageset, cpu);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001089
Christoph Lameter3dfa5722008-02-04 22:29:19 -08001090 pcp = &pset->pcp;
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001091 free_pcppages_bulk(zone, pcp->count, pcp);
Christoph Lameter3dfa5722008-02-04 22:29:19 -08001092 pcp->count = 0;
1093 local_irq_restore(flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001094 }
1095}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001096
Christoph Lameter9f8f2172008-02-04 22:29:11 -08001097/*
1098 * Spill all of this CPU's per-cpu pages back into the buddy allocator.
1099 */
1100void drain_local_pages(void *arg)
1101{
1102 drain_pages(smp_processor_id());
1103}
1104
1105/*
1106 * Spill all the per-cpu pages from all CPUs back into the buddy allocator
1107 */
1108void drain_all_pages(void)
1109{
Jens Axboe15c8b6c2008-05-09 09:39:44 +02001110 on_each_cpu(drain_local_pages, NULL, 1);
Christoph Lameter9f8f2172008-02-04 22:29:11 -08001111}
1112
Rafael J. Wysocki296699d2007-07-29 23:27:18 +02001113#ifdef CONFIG_HIBERNATION
Linus Torvalds1da177e2005-04-16 15:20:36 -07001114
1115void mark_free_pages(struct zone *zone)
1116{
Rafael J. Wysockif623f0d2006-09-25 23:32:49 -07001117 unsigned long pfn, max_zone_pfn;
1118 unsigned long flags;
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001119 int order, t;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001120 struct list_head *curr;
1121
1122 if (!zone->spanned_pages)
1123 return;
1124
1125 spin_lock_irqsave(&zone->lock, flags);
Rafael J. Wysockif623f0d2006-09-25 23:32:49 -07001126
1127 max_zone_pfn = zone->zone_start_pfn + zone->spanned_pages;
1128 for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
1129 if (pfn_valid(pfn)) {
1130 struct page *page = pfn_to_page(pfn);
1131
Rafael J. Wysocki7be98232007-05-06 14:50:42 -07001132 if (!swsusp_page_is_forbidden(page))
1133 swsusp_unset_page_free(page);
Rafael J. Wysockif623f0d2006-09-25 23:32:49 -07001134 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001135
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001136 for_each_migratetype_order(order, t) {
1137 list_for_each(curr, &zone->free_area[order].free_list[t]) {
Rafael J. Wysockif623f0d2006-09-25 23:32:49 -07001138 unsigned long i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001139
Rafael J. Wysockif623f0d2006-09-25 23:32:49 -07001140 pfn = page_to_pfn(list_entry(curr, struct page, lru));
1141 for (i = 0; i < (1UL << order); i++)
Rafael J. Wysocki7be98232007-05-06 14:50:42 -07001142 swsusp_set_page_free(pfn_to_page(pfn + i));
Rafael J. Wysockif623f0d2006-09-25 23:32:49 -07001143 }
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001144 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001145 spin_unlock_irqrestore(&zone->lock, flags);
1146}
Mel Gormane2c55dc2007-10-16 01:25:50 -07001147#endif /* CONFIG_PM */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001148
1149/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001150 * Free a 0-order page
Li Hongfc916682010-03-05 13:41:54 -08001151 * cold == 1 ? free a cold page : free a hot page
Linus Torvalds1da177e2005-04-16 15:20:36 -07001152 */
Li Hongfc916682010-03-05 13:41:54 -08001153void free_hot_cold_page(struct page *page, int cold)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001154{
1155 struct zone *zone = page_zone(page);
1156 struct per_cpu_pages *pcp;
1157 unsigned long flags;
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001158 int migratetype;
Johannes Weiner451ea252009-09-21 17:01:48 -07001159 int wasMlocked = __TestClearPageMlocked(page);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001160
KOSAKI Motohiroec95f532010-05-24 14:32:38 -07001161 if (!free_pages_prepare(page, 0))
Hugh Dickins689bceb2005-11-21 21:32:20 -08001162 return;
1163
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001164 migratetype = get_pageblock_migratetype(page);
1165 set_page_private(page, migratetype);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001166 local_irq_save(flags);
Johannes Weinerc2773312009-06-19 19:30:56 +02001167 if (unlikely(wasMlocked))
Mel Gormanda456f12009-06-16 15:32:08 -07001168 free_page_mlock(page);
Christoph Lameterf8891e52006-06-30 01:55:45 -07001169 __count_vm_event(PGFREE);
Mel Gormanda456f12009-06-16 15:32:08 -07001170
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001171 /*
1172 * We only track unmovable, reclaimable and movable on pcp lists.
1173 * Free ISOLATE pages back to the allocator because they are being
1174 * offlined but treat RESERVE as movable pages so we can get those
1175 * areas back if necessary. Otherwise, we may have to free
1176 * excessively into the page allocator
1177 */
1178 if (migratetype >= MIGRATE_PCPTYPES) {
1179 if (unlikely(migratetype == MIGRATE_ISOLATE)) {
1180 free_one_page(zone, page, 0, migratetype);
1181 goto out;
1182 }
1183 migratetype = MIGRATE_MOVABLE;
1184 }
1185
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09001186 pcp = &this_cpu_ptr(zone->pageset)->pcp;
Christoph Lameter3dfa5722008-02-04 22:29:19 -08001187 if (cold)
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001188 list_add_tail(&page->lru, &pcp->lists[migratetype]);
Christoph Lameter3dfa5722008-02-04 22:29:19 -08001189 else
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001190 list_add(&page->lru, &pcp->lists[migratetype]);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001191 pcp->count++;
Nick Piggin48db57f2006-01-08 01:00:42 -08001192 if (pcp->count >= pcp->high) {
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001193 free_pcppages_bulk(zone, pcp->batch, pcp);
Nick Piggin48db57f2006-01-08 01:00:42 -08001194 pcp->count -= pcp->batch;
1195 }
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001196
1197out:
Linus Torvalds1da177e2005-04-16 15:20:36 -07001198 local_irq_restore(flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001199}
1200
Nick Piggin8dfcc9b2006-03-22 00:08:05 -08001201/*
1202 * split_page takes a non-compound higher-order page, and splits it into
1203 * n (1<<order) sub-pages: page[0..n]
1204 * Each sub-page must be freed individually.
1205 *
1206 * Note: this is probably too low level an operation for use in drivers.
1207 * Please consult with lkml before using this in your driver.
1208 */
1209void split_page(struct page *page, unsigned int order)
1210{
1211 int i;
1212
Nick Piggin725d7042006-09-25 23:30:55 -07001213 VM_BUG_ON(PageCompound(page));
1214 VM_BUG_ON(!page_count(page));
Vegard Nossumb1eeab62008-11-25 16:55:53 +01001215
1216#ifdef CONFIG_KMEMCHECK
1217 /*
1218 * Split shadow pages too, because free(page[0]) would
1219 * otherwise free the whole shadow.
1220 */
1221 if (kmemcheck_page_is_tracked(page))
1222 split_page(virt_to_page(page[0].shadow), order);
1223#endif
1224
Nick Piggin7835e982006-03-22 00:08:40 -08001225 for (i = 1; i < (1 << order); i++)
1226 set_page_refcounted(page + i);
Nick Piggin8dfcc9b2006-03-22 00:08:05 -08001227}
Nick Piggin8dfcc9b2006-03-22 00:08:05 -08001228
Linus Torvalds1da177e2005-04-16 15:20:36 -07001229/*
Mel Gorman748446b2010-05-24 14:32:27 -07001230 * Similar to split_page except the page is already free. As this is only
1231 * being used for migration, the migratetype of the block also changes.
1232 * As this is called with interrupts disabled, the caller is responsible
1233 * for calling arch_alloc_page() and kernel_map_page() after interrupts
1234 * are enabled.
1235 *
1236 * Note: this is probably too low level an operation for use in drivers.
1237 * Please consult with lkml before using this in your driver.
1238 */
1239int split_free_page(struct page *page)
1240{
1241 unsigned int order;
1242 unsigned long watermark;
1243 struct zone *zone;
1244
1245 BUG_ON(!PageBuddy(page));
1246
1247 zone = page_zone(page);
1248 order = page_order(page);
1249
1250 /* Obey watermarks as if the page was being allocated */
1251 watermark = low_wmark_pages(zone) + (1 << order);
1252 if (!zone_watermark_ok(zone, 0, watermark, 0, 0))
1253 return 0;
1254
1255 /* Remove page from free list */
1256 list_del(&page->lru);
1257 zone->free_area[order].nr_free--;
1258 rmv_page_order(page);
1259 __mod_zone_page_state(zone, NR_FREE_PAGES, -(1UL << order));
1260
1261 /* Split into individual pages */
1262 set_page_refcounted(page);
1263 split_page(page, order);
1264
1265 if (order >= pageblock_order - 1) {
1266 struct page *endpage = page + (1 << order) - 1;
1267 for (; page < endpage; page += pageblock_nr_pages)
1268 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
1269 }
1270
1271 return 1 << order;
1272}
1273
1274/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001275 * Really, prep_compound_page() should be called from __rmqueue_bulk(). But
1276 * we cheat by calling it from here, in the order > 0 path. Saves a branch
1277 * or two.
1278 */
Mel Gorman0a15c3e2009-06-16 15:32:05 -07001279static inline
1280struct page *buffered_rmqueue(struct zone *preferred_zone,
Mel Gorman3dd28262009-06-16 15:32:00 -07001281 struct zone *zone, int order, gfp_t gfp_flags,
1282 int migratetype)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001283{
1284 unsigned long flags;
Hugh Dickins689bceb2005-11-21 21:32:20 -08001285 struct page *page;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001286 int cold = !!(gfp_flags & __GFP_COLD);
1287
Hugh Dickins689bceb2005-11-21 21:32:20 -08001288again:
Nick Piggin48db57f2006-01-08 01:00:42 -08001289 if (likely(order == 0)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001290 struct per_cpu_pages *pcp;
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001291 struct list_head *list;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001292
Linus Torvalds1da177e2005-04-16 15:20:36 -07001293 local_irq_save(flags);
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09001294 pcp = &this_cpu_ptr(zone->pageset)->pcp;
1295 list = &pcp->lists[migratetype];
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001296 if (list_empty(list)) {
Mel Gorman535131e2007-10-16 01:25:49 -07001297 pcp->count += rmqueue_bulk(zone, 0,
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001298 pcp->batch, list,
Mel Gormane084b2d2009-07-29 15:02:04 -07001299 migratetype, cold);
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001300 if (unlikely(list_empty(list)))
Shaohua Li6fb332f2009-09-21 17:01:17 -07001301 goto failed;
Mel Gorman535131e2007-10-16 01:25:49 -07001302 }
Mel Gormanb92a6ed2007-10-16 01:25:50 -07001303
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001304 if (cold)
1305 page = list_entry(list->prev, struct page, lru);
1306 else
1307 page = list_entry(list->next, struct page, lru);
1308
Mel Gormanb92a6ed2007-10-16 01:25:50 -07001309 list_del(&page->lru);
1310 pcp->count--;
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001311 } else {
Andrew Mortondab48da2009-06-16 15:32:37 -07001312 if (unlikely(gfp_flags & __GFP_NOFAIL)) {
1313 /*
1314 * __GFP_NOFAIL is not to be used in new code.
1315 *
1316 * All __GFP_NOFAIL callers should be fixed so that they
1317 * properly detect and handle allocation failures.
1318 *
1319 * We most definitely don't want callers attempting to
Linus Torvalds4923abf2009-06-24 12:16:49 -07001320 * allocate greater than order-1 page units with
Andrew Mortondab48da2009-06-16 15:32:37 -07001321 * __GFP_NOFAIL.
1322 */
Linus Torvalds4923abf2009-06-24 12:16:49 -07001323 WARN_ON_ONCE(order > 1);
Andrew Mortondab48da2009-06-16 15:32:37 -07001324 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001325 spin_lock_irqsave(&zone->lock, flags);
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001326 page = __rmqueue(zone, order, migratetype);
Nick Piggina74609f2006-01-06 00:11:20 -08001327 spin_unlock(&zone->lock);
1328 if (!page)
1329 goto failed;
KOSAKI Motohiro6ccf80e2010-01-15 17:01:18 -08001330 __mod_zone_page_state(zone, NR_FREE_PAGES, -(1 << order));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001331 }
1332
Christoph Lameterf8891e52006-06-30 01:55:45 -07001333 __count_zone_vm_events(PGALLOC, zone, 1 << order);
Mel Gorman18ea7e72008-04-28 02:12:14 -07001334 zone_statistics(preferred_zone, zone);
Nick Piggina74609f2006-01-06 00:11:20 -08001335 local_irq_restore(flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001336
Nick Piggin725d7042006-09-25 23:30:55 -07001337 VM_BUG_ON(bad_range(zone, page));
Nick Piggin17cf4402006-03-22 00:08:41 -08001338 if (prep_new_page(page, order, gfp_flags))
Nick Piggina74609f2006-01-06 00:11:20 -08001339 goto again;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001340 return page;
Nick Piggina74609f2006-01-06 00:11:20 -08001341
1342failed:
1343 local_irq_restore(flags);
Nick Piggina74609f2006-01-06 00:11:20 -08001344 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001345}
1346
Mel Gorman41858962009-06-16 15:32:12 -07001347/* The ALLOC_WMARK bits are used as an index to zone->watermark */
1348#define ALLOC_WMARK_MIN WMARK_MIN
1349#define ALLOC_WMARK_LOW WMARK_LOW
1350#define ALLOC_WMARK_HIGH WMARK_HIGH
1351#define ALLOC_NO_WATERMARKS 0x04 /* don't check watermarks at all */
1352
1353/* Mask to get the watermark bits */
1354#define ALLOC_WMARK_MASK (ALLOC_NO_WATERMARKS-1)
1355
Nick Piggin31488902005-11-28 13:44:03 -08001356#define ALLOC_HARDER 0x10 /* try to alloc harder */
1357#define ALLOC_HIGH 0x20 /* __GFP_HIGH set */
1358#define ALLOC_CPUSET 0x40 /* check for correct cpuset */
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001359
Akinobu Mita933e3122006-12-08 02:39:45 -08001360#ifdef CONFIG_FAIL_PAGE_ALLOC
1361
1362static struct fail_page_alloc_attr {
1363 struct fault_attr attr;
1364
1365 u32 ignore_gfp_highmem;
1366 u32 ignore_gfp_wait;
Akinobu Mita54114992007-07-15 23:40:23 -07001367 u32 min_order;
Akinobu Mita933e3122006-12-08 02:39:45 -08001368
1369#ifdef CONFIG_FAULT_INJECTION_DEBUG_FS
1370
1371 struct dentry *ignore_gfp_highmem_file;
1372 struct dentry *ignore_gfp_wait_file;
Akinobu Mita54114992007-07-15 23:40:23 -07001373 struct dentry *min_order_file;
Akinobu Mita933e3122006-12-08 02:39:45 -08001374
1375#endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */
1376
1377} fail_page_alloc = {
1378 .attr = FAULT_ATTR_INITIALIZER,
Don Mullis6b1b60f2006-12-08 02:39:53 -08001379 .ignore_gfp_wait = 1,
1380 .ignore_gfp_highmem = 1,
Akinobu Mita54114992007-07-15 23:40:23 -07001381 .min_order = 1,
Akinobu Mita933e3122006-12-08 02:39:45 -08001382};
1383
1384static int __init setup_fail_page_alloc(char *str)
1385{
1386 return setup_fault_attr(&fail_page_alloc.attr, str);
1387}
1388__setup("fail_page_alloc=", setup_fail_page_alloc);
1389
1390static int should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
1391{
Akinobu Mita54114992007-07-15 23:40:23 -07001392 if (order < fail_page_alloc.min_order)
1393 return 0;
Akinobu Mita933e3122006-12-08 02:39:45 -08001394 if (gfp_mask & __GFP_NOFAIL)
1395 return 0;
1396 if (fail_page_alloc.ignore_gfp_highmem && (gfp_mask & __GFP_HIGHMEM))
1397 return 0;
1398 if (fail_page_alloc.ignore_gfp_wait && (gfp_mask & __GFP_WAIT))
1399 return 0;
1400
1401 return should_fail(&fail_page_alloc.attr, 1 << order);
1402}
1403
1404#ifdef CONFIG_FAULT_INJECTION_DEBUG_FS
1405
1406static int __init fail_page_alloc_debugfs(void)
1407{
1408 mode_t mode = S_IFREG | S_IRUSR | S_IWUSR;
1409 struct dentry *dir;
1410 int err;
1411
1412 err = init_fault_attr_dentries(&fail_page_alloc.attr,
1413 "fail_page_alloc");
1414 if (err)
1415 return err;
1416 dir = fail_page_alloc.attr.dentries.dir;
1417
1418 fail_page_alloc.ignore_gfp_wait_file =
1419 debugfs_create_bool("ignore-gfp-wait", mode, dir,
1420 &fail_page_alloc.ignore_gfp_wait);
1421
1422 fail_page_alloc.ignore_gfp_highmem_file =
1423 debugfs_create_bool("ignore-gfp-highmem", mode, dir,
1424 &fail_page_alloc.ignore_gfp_highmem);
Akinobu Mita54114992007-07-15 23:40:23 -07001425 fail_page_alloc.min_order_file =
1426 debugfs_create_u32("min-order", mode, dir,
1427 &fail_page_alloc.min_order);
Akinobu Mita933e3122006-12-08 02:39:45 -08001428
1429 if (!fail_page_alloc.ignore_gfp_wait_file ||
Akinobu Mita54114992007-07-15 23:40:23 -07001430 !fail_page_alloc.ignore_gfp_highmem_file ||
1431 !fail_page_alloc.min_order_file) {
Akinobu Mita933e3122006-12-08 02:39:45 -08001432 err = -ENOMEM;
1433 debugfs_remove(fail_page_alloc.ignore_gfp_wait_file);
1434 debugfs_remove(fail_page_alloc.ignore_gfp_highmem_file);
Akinobu Mita54114992007-07-15 23:40:23 -07001435 debugfs_remove(fail_page_alloc.min_order_file);
Akinobu Mita933e3122006-12-08 02:39:45 -08001436 cleanup_fault_attr_dentries(&fail_page_alloc.attr);
1437 }
1438
1439 return err;
1440}
1441
1442late_initcall(fail_page_alloc_debugfs);
1443
1444#endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */
1445
1446#else /* CONFIG_FAIL_PAGE_ALLOC */
1447
1448static inline int should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
1449{
1450 return 0;
1451}
1452
1453#endif /* CONFIG_FAIL_PAGE_ALLOC */
1454
Linus Torvalds1da177e2005-04-16 15:20:36 -07001455/*
1456 * Return 1 if free pages are above 'mark'. This takes into account the order
1457 * of the allocation.
1458 */
1459int zone_watermark_ok(struct zone *z, int order, unsigned long mark,
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001460 int classzone_idx, int alloc_flags)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001461{
1462 /* free_pages my go negative - that's OK */
Christoph Lameterd23ad422007-02-10 01:43:02 -08001463 long min = mark;
1464 long free_pages = zone_page_state(z, NR_FREE_PAGES) - (1 << order) + 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001465 int o;
1466
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001467 if (alloc_flags & ALLOC_HIGH)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001468 min -= min / 2;
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001469 if (alloc_flags & ALLOC_HARDER)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001470 min -= min / 4;
1471
1472 if (free_pages <= min + z->lowmem_reserve[classzone_idx])
1473 return 0;
1474 for (o = 0; o < order; o++) {
1475 /* At the next order, this order's pages become unavailable */
1476 free_pages -= z->free_area[o].nr_free << o;
1477
1478 /* Require fewer higher order pages to be free */
1479 min >>= 1;
1480
1481 if (free_pages <= min)
1482 return 0;
1483 }
1484 return 1;
1485}
1486
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001487#ifdef CONFIG_NUMA
1488/*
1489 * zlc_setup - Setup for "zonelist cache". Uses cached zone data to
1490 * skip over zones that are not allowed by the cpuset, or that have
1491 * been recently (in last second) found to be nearly full. See further
1492 * comments in mmzone.h. Reduces cache footprint of zonelist scans
Simon Arlott183ff222007-10-20 01:27:18 +02001493 * that have to skip over a lot of full or unallowed zones.
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001494 *
1495 * If the zonelist cache is present in the passed in zonelist, then
1496 * returns a pointer to the allowed node mask (either the current
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07001497 * tasks mems_allowed, or node_states[N_HIGH_MEMORY].)
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001498 *
1499 * If the zonelist cache is not available for this zonelist, does
1500 * nothing and returns NULL.
1501 *
1502 * If the fullzones BITMAP in the zonelist cache is stale (more than
1503 * a second since last zap'd) then we zap it out (clear its bits.)
1504 *
1505 * We hold off even calling zlc_setup, until after we've checked the
1506 * first zone in the zonelist, on the theory that most allocations will
1507 * be satisfied from that first zone, so best to examine that zone as
1508 * quickly as we can.
1509 */
1510static nodemask_t *zlc_setup(struct zonelist *zonelist, int alloc_flags)
1511{
1512 struct zonelist_cache *zlc; /* cached zonelist speedup info */
1513 nodemask_t *allowednodes; /* zonelist_cache approximation */
1514
1515 zlc = zonelist->zlcache_ptr;
1516 if (!zlc)
1517 return NULL;
1518
S.Caglar Onurf05111f2008-04-28 02:12:38 -07001519 if (time_after(jiffies, zlc->last_full_zap + HZ)) {
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001520 bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST);
1521 zlc->last_full_zap = jiffies;
1522 }
1523
1524 allowednodes = !in_interrupt() && (alloc_flags & ALLOC_CPUSET) ?
1525 &cpuset_current_mems_allowed :
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07001526 &node_states[N_HIGH_MEMORY];
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001527 return allowednodes;
1528}
1529
1530/*
1531 * Given 'z' scanning a zonelist, run a couple of quick checks to see
1532 * if it is worth looking at further for free memory:
1533 * 1) Check that the zone isn't thought to be full (doesn't have its
1534 * bit set in the zonelist_cache fullzones BITMAP).
1535 * 2) Check that the zones node (obtained from the zonelist_cache
1536 * z_to_n[] mapping) is allowed in the passed in allowednodes mask.
1537 * Return true (non-zero) if zone is worth looking at further, or
1538 * else return false (zero) if it is not.
1539 *
1540 * This check -ignores- the distinction between various watermarks,
1541 * such as GFP_HIGH, GFP_ATOMIC, PF_MEMALLOC, ... If a zone is
1542 * found to be full for any variation of these watermarks, it will
1543 * be considered full for up to one second by all requests, unless
1544 * we are so low on memory on all allowed nodes that we are forced
1545 * into the second scan of the zonelist.
1546 *
1547 * In the second scan we ignore this zonelist cache and exactly
1548 * apply the watermarks to all zones, even it is slower to do so.
1549 * We are low on memory in the second scan, and should leave no stone
1550 * unturned looking for a free page.
1551 */
Mel Gormandd1a2392008-04-28 02:12:17 -07001552static int zlc_zone_worth_trying(struct zonelist *zonelist, struct zoneref *z,
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001553 nodemask_t *allowednodes)
1554{
1555 struct zonelist_cache *zlc; /* cached zonelist speedup info */
1556 int i; /* index of *z in zonelist zones */
1557 int n; /* node that zone *z is on */
1558
1559 zlc = zonelist->zlcache_ptr;
1560 if (!zlc)
1561 return 1;
1562
Mel Gormandd1a2392008-04-28 02:12:17 -07001563 i = z - zonelist->_zonerefs;
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001564 n = zlc->z_to_n[i];
1565
1566 /* This zone is worth trying if it is allowed but not full */
1567 return node_isset(n, *allowednodes) && !test_bit(i, zlc->fullzones);
1568}
1569
1570/*
1571 * Given 'z' scanning a zonelist, set the corresponding bit in
1572 * zlc->fullzones, so that subsequent attempts to allocate a page
1573 * from that zone don't waste time re-examining it.
1574 */
Mel Gormandd1a2392008-04-28 02:12:17 -07001575static void zlc_mark_zone_full(struct zonelist *zonelist, struct zoneref *z)
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001576{
1577 struct zonelist_cache *zlc; /* cached zonelist speedup info */
1578 int i; /* index of *z in zonelist zones */
1579
1580 zlc = zonelist->zlcache_ptr;
1581 if (!zlc)
1582 return;
1583
Mel Gormandd1a2392008-04-28 02:12:17 -07001584 i = z - zonelist->_zonerefs;
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001585
1586 set_bit(i, zlc->fullzones);
1587}
1588
1589#else /* CONFIG_NUMA */
1590
1591static nodemask_t *zlc_setup(struct zonelist *zonelist, int alloc_flags)
1592{
1593 return NULL;
1594}
1595
Mel Gormandd1a2392008-04-28 02:12:17 -07001596static int zlc_zone_worth_trying(struct zonelist *zonelist, struct zoneref *z,
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001597 nodemask_t *allowednodes)
1598{
1599 return 1;
1600}
1601
Mel Gormandd1a2392008-04-28 02:12:17 -07001602static void zlc_mark_zone_full(struct zonelist *zonelist, struct zoneref *z)
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001603{
1604}
1605#endif /* CONFIG_NUMA */
1606
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001607/*
Paul Jackson0798e512006-12-06 20:31:38 -08001608 * get_page_from_freelist goes through the zonelist trying to allocate
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001609 * a page.
1610 */
1611static struct page *
Mel Gorman19770b32008-04-28 02:12:18 -07001612get_page_from_freelist(gfp_t gfp_mask, nodemask_t *nodemask, unsigned int order,
Mel Gorman5117f452009-06-16 15:31:59 -07001613 struct zonelist *zonelist, int high_zoneidx, int alloc_flags,
Mel Gorman3dd28262009-06-16 15:32:00 -07001614 struct zone *preferred_zone, int migratetype)
Martin Hicks753ee722005-06-21 17:14:41 -07001615{
Mel Gormandd1a2392008-04-28 02:12:17 -07001616 struct zoneref *z;
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001617 struct page *page = NULL;
Mel Gorman54a6eb52008-04-28 02:12:16 -07001618 int classzone_idx;
Mel Gorman5117f452009-06-16 15:31:59 -07001619 struct zone *zone;
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001620 nodemask_t *allowednodes = NULL;/* zonelist_cache approximation */
1621 int zlc_active = 0; /* set if using zonelist_cache */
1622 int did_zlc_setup = 0; /* just call zlc_setup() one time */
Mel Gorman54a6eb52008-04-28 02:12:16 -07001623
Mel Gorman19770b32008-04-28 02:12:18 -07001624 classzone_idx = zone_idx(preferred_zone);
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001625zonelist_scan:
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001626 /*
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001627 * Scan zonelist, looking for a zone with enough free.
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001628 * See also cpuset_zone_allowed() comment in kernel/cpuset.c.
1629 */
Mel Gorman19770b32008-04-28 02:12:18 -07001630 for_each_zone_zonelist_nodemask(zone, z, zonelist,
1631 high_zoneidx, nodemask) {
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001632 if (NUMA_BUILD && zlc_active &&
1633 !zlc_zone_worth_trying(zonelist, z, allowednodes))
1634 continue;
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001635 if ((alloc_flags & ALLOC_CPUSET) &&
Paul Jackson02a0e532006-12-13 00:34:25 -08001636 !cpuset_zone_allowed_softwall(zone, gfp_mask))
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001637 goto try_next_zone;
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001638
Mel Gorman41858962009-06-16 15:32:12 -07001639 BUILD_BUG_ON(ALLOC_NO_WATERMARKS < NR_WMARK);
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001640 if (!(alloc_flags & ALLOC_NO_WATERMARKS)) {
Nick Piggin31488902005-11-28 13:44:03 -08001641 unsigned long mark;
Mel Gormanfa5e0842009-06-16 15:33:22 -07001642 int ret;
1643
Mel Gorman41858962009-06-16 15:32:12 -07001644 mark = zone->watermark[alloc_flags & ALLOC_WMARK_MASK];
Mel Gormanfa5e0842009-06-16 15:33:22 -07001645 if (zone_watermark_ok(zone, order, mark,
1646 classzone_idx, alloc_flags))
1647 goto try_this_zone;
1648
1649 if (zone_reclaim_mode == 0)
1650 goto this_zone_full;
1651
1652 ret = zone_reclaim(zone, gfp_mask, order);
1653 switch (ret) {
1654 case ZONE_RECLAIM_NOSCAN:
1655 /* did not scan */
1656 goto try_next_zone;
1657 case ZONE_RECLAIM_FULL:
1658 /* scanned but unreclaimable */
1659 goto this_zone_full;
1660 default:
1661 /* did we reclaim enough */
1662 if (!zone_watermark_ok(zone, order, mark,
1663 classzone_idx, alloc_flags))
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001664 goto this_zone_full;
Paul Jackson0798e512006-12-06 20:31:38 -08001665 }
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001666 }
1667
Mel Gormanfa5e0842009-06-16 15:33:22 -07001668try_this_zone:
Mel Gorman3dd28262009-06-16 15:32:00 -07001669 page = buffered_rmqueue(preferred_zone, zone, order,
1670 gfp_mask, migratetype);
Paul Jackson0798e512006-12-06 20:31:38 -08001671 if (page)
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001672 break;
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001673this_zone_full:
1674 if (NUMA_BUILD)
1675 zlc_mark_zone_full(zonelist, z);
1676try_next_zone:
Christoph Lameter62bc62a2009-06-16 15:32:15 -07001677 if (NUMA_BUILD && !did_zlc_setup && nr_online_nodes > 1) {
Mel Gormand395b732009-06-16 15:32:09 -07001678 /*
1679 * we do zlc_setup after the first zone is tried but only
1680 * if there are multiple nodes make it worthwhile
1681 */
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001682 allowednodes = zlc_setup(zonelist, alloc_flags);
1683 zlc_active = 1;
1684 did_zlc_setup = 1;
1685 }
Mel Gorman54a6eb52008-04-28 02:12:16 -07001686 }
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001687
1688 if (unlikely(NUMA_BUILD && page == NULL && zlc_active)) {
1689 /* Disable zlc cache for second zonelist scan */
1690 zlc_active = 0;
1691 goto zonelist_scan;
1692 }
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001693 return page;
Martin Hicks753ee722005-06-21 17:14:41 -07001694}
1695
Mel Gorman11e33f62009-06-16 15:31:57 -07001696static inline int
1697should_alloc_retry(gfp_t gfp_mask, unsigned int order,
1698 unsigned long pages_reclaimed)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001699{
Mel Gorman11e33f62009-06-16 15:31:57 -07001700 /* Do not loop if specifically requested */
1701 if (gfp_mask & __GFP_NORETRY)
1702 return 0;
1703
1704 /*
1705 * In this implementation, order <= PAGE_ALLOC_COSTLY_ORDER
1706 * means __GFP_NOFAIL, but that may not be true in other
1707 * implementations.
1708 */
1709 if (order <= PAGE_ALLOC_COSTLY_ORDER)
1710 return 1;
1711
1712 /*
1713 * For order > PAGE_ALLOC_COSTLY_ORDER, if __GFP_REPEAT is
1714 * specified, then we retry until we no longer reclaim any pages
1715 * (above), or we've reclaimed an order of pages at least as
1716 * large as the allocation's order. In both cases, if the
1717 * allocation still fails, we stop retrying.
1718 */
1719 if (gfp_mask & __GFP_REPEAT && pages_reclaimed < (1 << order))
1720 return 1;
1721
1722 /*
1723 * Don't let big-order allocations loop unless the caller
1724 * explicitly requests that.
1725 */
1726 if (gfp_mask & __GFP_NOFAIL)
1727 return 1;
1728
1729 return 0;
1730}
1731
1732static inline struct page *
1733__alloc_pages_may_oom(gfp_t gfp_mask, unsigned int order,
1734 struct zonelist *zonelist, enum zone_type high_zoneidx,
Mel Gorman3dd28262009-06-16 15:32:00 -07001735 nodemask_t *nodemask, struct zone *preferred_zone,
1736 int migratetype)
Mel Gorman11e33f62009-06-16 15:31:57 -07001737{
Linus Torvalds1da177e2005-04-16 15:20:36 -07001738 struct page *page;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001739
Mel Gorman11e33f62009-06-16 15:31:57 -07001740 /* Acquire the OOM killer lock for the zones in zonelist */
1741 if (!try_set_zone_oom(zonelist, gfp_mask)) {
1742 schedule_timeout_uninterruptible(1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001743 return NULL;
1744 }
Jens Axboe6b1de912005-11-17 21:35:02 +01001745
Mel Gorman11e33f62009-06-16 15:31:57 -07001746 /*
1747 * Go through the zonelist yet one more time, keep very high watermark
1748 * here, this is only to catch a parallel oom killing, we must fail if
1749 * we're still under heavy pressure.
1750 */
1751 page = get_page_from_freelist(gfp_mask|__GFP_HARDWALL, nodemask,
1752 order, zonelist, high_zoneidx,
Mel Gorman5117f452009-06-16 15:31:59 -07001753 ALLOC_WMARK_HIGH|ALLOC_CPUSET,
Mel Gorman3dd28262009-06-16 15:32:00 -07001754 preferred_zone, migratetype);
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001755 if (page)
Mel Gorman11e33f62009-06-16 15:31:57 -07001756 goto out;
1757
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -08001758 if (!(gfp_mask & __GFP_NOFAIL)) {
1759 /* The OOM killer will not help higher order allocs */
1760 if (order > PAGE_ALLOC_COSTLY_ORDER)
1761 goto out;
1762 /*
1763 * GFP_THISNODE contains __GFP_NORETRY and we never hit this.
1764 * Sanity check for bare calls of __GFP_THISNODE, not real OOM.
1765 * The caller should handle page allocation failure by itself if
1766 * it specifies __GFP_THISNODE.
1767 * Note: Hugepage uses it but will hit PAGE_ALLOC_COSTLY_ORDER.
1768 */
1769 if (gfp_mask & __GFP_THISNODE)
1770 goto out;
1771 }
Mel Gorman11e33f62009-06-16 15:31:57 -07001772 /* Exhausted what can be done so it's blamo time */
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -08001773 out_of_memory(zonelist, gfp_mask, order, nodemask);
Mel Gorman11e33f62009-06-16 15:31:57 -07001774
1775out:
1776 clear_zonelist_oom(zonelist, gfp_mask);
1777 return page;
1778}
1779
Mel Gorman56de7262010-05-24 14:32:30 -07001780#ifdef CONFIG_COMPACTION
1781/* Try memory compaction for high-order allocations before reclaim */
1782static struct page *
1783__alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
1784 struct zonelist *zonelist, enum zone_type high_zoneidx,
1785 nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone,
1786 int migratetype, unsigned long *did_some_progress)
1787{
1788 struct page *page;
1789
Mel Gorman4f92e252010-05-24 14:32:32 -07001790 if (!order || compaction_deferred(preferred_zone))
Mel Gorman56de7262010-05-24 14:32:30 -07001791 return NULL;
1792
1793 *did_some_progress = try_to_compact_pages(zonelist, order, gfp_mask,
1794 nodemask);
1795 if (*did_some_progress != COMPACT_SKIPPED) {
1796
1797 /* Page migration frees to the PCP lists but we want merging */
1798 drain_pages(get_cpu());
1799 put_cpu();
1800
1801 page = get_page_from_freelist(gfp_mask, nodemask,
1802 order, zonelist, high_zoneidx,
1803 alloc_flags, preferred_zone,
1804 migratetype);
1805 if (page) {
Mel Gorman4f92e252010-05-24 14:32:32 -07001806 preferred_zone->compact_considered = 0;
1807 preferred_zone->compact_defer_shift = 0;
Mel Gorman56de7262010-05-24 14:32:30 -07001808 count_vm_event(COMPACTSUCCESS);
1809 return page;
1810 }
1811
1812 /*
1813 * It's bad if compaction run occurs and fails.
1814 * The most likely reason is that pages exist,
1815 * but not enough to satisfy watermarks.
1816 */
1817 count_vm_event(COMPACTFAIL);
Mel Gorman4f92e252010-05-24 14:32:32 -07001818 defer_compaction(preferred_zone);
Mel Gorman56de7262010-05-24 14:32:30 -07001819
1820 cond_resched();
1821 }
1822
1823 return NULL;
1824}
1825#else
1826static inline struct page *
1827__alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
1828 struct zonelist *zonelist, enum zone_type high_zoneidx,
1829 nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone,
1830 int migratetype, unsigned long *did_some_progress)
1831{
1832 return NULL;
1833}
1834#endif /* CONFIG_COMPACTION */
1835
Mel Gorman11e33f62009-06-16 15:31:57 -07001836/* The really slow allocator path where we enter direct reclaim */
1837static inline struct page *
1838__alloc_pages_direct_reclaim(gfp_t gfp_mask, unsigned int order,
1839 struct zonelist *zonelist, enum zone_type high_zoneidx,
Mel Gorman5117f452009-06-16 15:31:59 -07001840 nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone,
Mel Gorman3dd28262009-06-16 15:32:00 -07001841 int migratetype, unsigned long *did_some_progress)
Mel Gorman11e33f62009-06-16 15:31:57 -07001842{
1843 struct page *page = NULL;
1844 struct reclaim_state reclaim_state;
1845 struct task_struct *p = current;
1846
1847 cond_resched();
1848
1849 /* We now go into synchronous reclaim */
1850 cpuset_memory_pressure_bump();
Mel Gorman11e33f62009-06-16 15:31:57 -07001851 p->flags |= PF_MEMALLOC;
1852 lockdep_set_current_reclaim_state(gfp_mask);
1853 reclaim_state.reclaimed_slab = 0;
1854 p->reclaim_state = &reclaim_state;
1855
1856 *did_some_progress = try_to_free_pages(zonelist, order, gfp_mask, nodemask);
1857
1858 p->reclaim_state = NULL;
1859 lockdep_clear_current_reclaim_state();
1860 p->flags &= ~PF_MEMALLOC;
1861
1862 cond_resched();
1863
1864 if (order != 0)
1865 drain_all_pages();
1866
1867 if (likely(*did_some_progress))
1868 page = get_page_from_freelist(gfp_mask, nodemask, order,
Mel Gorman5117f452009-06-16 15:31:59 -07001869 zonelist, high_zoneidx,
Mel Gorman3dd28262009-06-16 15:32:00 -07001870 alloc_flags, preferred_zone,
1871 migratetype);
Mel Gorman11e33f62009-06-16 15:31:57 -07001872 return page;
1873}
1874
Mel Gorman11e33f62009-06-16 15:31:57 -07001875/*
1876 * This is called in the allocator slow-path if the allocation request is of
1877 * sufficient urgency to ignore watermarks and take other desperate measures
1878 */
1879static inline struct page *
1880__alloc_pages_high_priority(gfp_t gfp_mask, unsigned int order,
1881 struct zonelist *zonelist, enum zone_type high_zoneidx,
Mel Gorman3dd28262009-06-16 15:32:00 -07001882 nodemask_t *nodemask, struct zone *preferred_zone,
1883 int migratetype)
Mel Gorman11e33f62009-06-16 15:31:57 -07001884{
1885 struct page *page;
1886
1887 do {
1888 page = get_page_from_freelist(gfp_mask, nodemask, order,
Mel Gorman5117f452009-06-16 15:31:59 -07001889 zonelist, high_zoneidx, ALLOC_NO_WATERMARKS,
Mel Gorman3dd28262009-06-16 15:32:00 -07001890 preferred_zone, migratetype);
Mel Gorman11e33f62009-06-16 15:31:57 -07001891
1892 if (!page && gfp_mask & __GFP_NOFAIL)
Jens Axboe8aa7e842009-07-09 14:52:32 +02001893 congestion_wait(BLK_RW_ASYNC, HZ/50);
Mel Gorman11e33f62009-06-16 15:31:57 -07001894 } while (!page && (gfp_mask & __GFP_NOFAIL));
1895
1896 return page;
1897}
1898
1899static inline
1900void wake_all_kswapd(unsigned int order, struct zonelist *zonelist,
1901 enum zone_type high_zoneidx)
1902{
1903 struct zoneref *z;
1904 struct zone *zone;
1905
1906 for_each_zone_zonelist(zone, z, zonelist, high_zoneidx)
1907 wakeup_kswapd(zone, order);
1908}
1909
Peter Zijlstra341ce062009-06-16 15:32:02 -07001910static inline int
1911gfp_to_alloc_flags(gfp_t gfp_mask)
1912{
1913 struct task_struct *p = current;
1914 int alloc_flags = ALLOC_WMARK_MIN | ALLOC_CPUSET;
1915 const gfp_t wait = gfp_mask & __GFP_WAIT;
1916
Mel Gormana56f57f2009-06-16 15:32:02 -07001917 /* __GFP_HIGH is assumed to be the same as ALLOC_HIGH to save a branch. */
1918 BUILD_BUG_ON(__GFP_HIGH != ALLOC_HIGH);
1919
Peter Zijlstra341ce062009-06-16 15:32:02 -07001920 /*
1921 * The caller may dip into page reserves a bit more if the caller
1922 * cannot run direct reclaim, or if the caller has realtime scheduling
1923 * policy or is asking for __GFP_HIGH memory. GFP_ATOMIC requests will
1924 * set both ALLOC_HARDER (!wait) and ALLOC_HIGH (__GFP_HIGH).
1925 */
Mel Gormana56f57f2009-06-16 15:32:02 -07001926 alloc_flags |= (gfp_mask & __GFP_HIGH);
Peter Zijlstra341ce062009-06-16 15:32:02 -07001927
1928 if (!wait) {
1929 alloc_flags |= ALLOC_HARDER;
1930 /*
1931 * Ignore cpuset if GFP_ATOMIC (!wait) rather than fail alloc.
1932 * See also cpuset_zone_allowed() comment in kernel/cpuset.c.
1933 */
1934 alloc_flags &= ~ALLOC_CPUSET;
Mel Gorman9d0ed602009-11-11 14:26:17 -08001935 } else if (unlikely(rt_task(p)) && !in_interrupt())
Peter Zijlstra341ce062009-06-16 15:32:02 -07001936 alloc_flags |= ALLOC_HARDER;
1937
1938 if (likely(!(gfp_mask & __GFP_NOMEMALLOC))) {
1939 if (!in_interrupt() &&
1940 ((p->flags & PF_MEMALLOC) ||
1941 unlikely(test_thread_flag(TIF_MEMDIE))))
1942 alloc_flags |= ALLOC_NO_WATERMARKS;
1943 }
1944
1945 return alloc_flags;
1946}
1947
Mel Gorman11e33f62009-06-16 15:31:57 -07001948static inline struct page *
1949__alloc_pages_slowpath(gfp_t gfp_mask, unsigned int order,
1950 struct zonelist *zonelist, enum zone_type high_zoneidx,
Mel Gorman3dd28262009-06-16 15:32:00 -07001951 nodemask_t *nodemask, struct zone *preferred_zone,
1952 int migratetype)
Mel Gorman11e33f62009-06-16 15:31:57 -07001953{
1954 const gfp_t wait = gfp_mask & __GFP_WAIT;
1955 struct page *page = NULL;
1956 int alloc_flags;
1957 unsigned long pages_reclaimed = 0;
1958 unsigned long did_some_progress;
1959 struct task_struct *p = current;
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001960
Christoph Lameter952f3b52006-12-06 20:33:26 -08001961 /*
Mel Gorman72807a72009-06-16 15:32:18 -07001962 * In the slowpath, we sanity check order to avoid ever trying to
1963 * reclaim >= MAX_ORDER areas which will never succeed. Callers may
1964 * be using allocators in order of preference for an area that is
1965 * too large.
1966 */
Mel Gorman1fc28b72009-07-29 15:04:08 -07001967 if (order >= MAX_ORDER) {
1968 WARN_ON_ONCE(!(gfp_mask & __GFP_NOWARN));
Mel Gorman72807a72009-06-16 15:32:18 -07001969 return NULL;
Mel Gorman1fc28b72009-07-29 15:04:08 -07001970 }
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001971
Christoph Lameter952f3b52006-12-06 20:33:26 -08001972 /*
1973 * GFP_THISNODE (meaning __GFP_THISNODE, __GFP_NORETRY and
1974 * __GFP_NOWARN set) should not cause reclaim since the subsystem
1975 * (f.e. slab) using GFP_THISNODE may choose to trigger reclaim
1976 * using a larger set of nodes after it has established that the
1977 * allowed per node queues are empty and that nodes are
1978 * over allocated.
1979 */
1980 if (NUMA_BUILD && (gfp_mask & GFP_THISNODE) == GFP_THISNODE)
1981 goto nopage;
1982
Mel Gormancc4a6852009-11-11 14:26:14 -08001983restart:
Mel Gorman11e33f62009-06-16 15:31:57 -07001984 wake_all_kswapd(order, zonelist, high_zoneidx);
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001985
Paul Jackson9bf22292005-09-06 15:18:12 -07001986 /*
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001987 * OK, we're below the kswapd watermark and have kicked background
1988 * reclaim. Now things get more complex, so set up alloc_flags according
1989 * to how we want to proceed.
Paul Jackson9bf22292005-09-06 15:18:12 -07001990 */
Peter Zijlstra341ce062009-06-16 15:32:02 -07001991 alloc_flags = gfp_to_alloc_flags(gfp_mask);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001992
Peter Zijlstra341ce062009-06-16 15:32:02 -07001993 /* This is the last chance, in general, before the goto nopage. */
Mel Gorman19770b32008-04-28 02:12:18 -07001994 page = get_page_from_freelist(gfp_mask, nodemask, order, zonelist,
Peter Zijlstra341ce062009-06-16 15:32:02 -07001995 high_zoneidx, alloc_flags & ~ALLOC_NO_WATERMARKS,
1996 preferred_zone, migratetype);
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001997 if (page)
1998 goto got_pg;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001999
Kirill Korotaevb43a57b2006-12-06 20:32:27 -08002000rebalance:
Mel Gorman11e33f62009-06-16 15:31:57 -07002001 /* Allocate without watermarks if the context allows */
Peter Zijlstra341ce062009-06-16 15:32:02 -07002002 if (alloc_flags & ALLOC_NO_WATERMARKS) {
2003 page = __alloc_pages_high_priority(gfp_mask, order,
2004 zonelist, high_zoneidx, nodemask,
2005 preferred_zone, migratetype);
2006 if (page)
2007 goto got_pg;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002008 }
2009
2010 /* Atomic allocations - we can't balance anything */
2011 if (!wait)
2012 goto nopage;
2013
Peter Zijlstra341ce062009-06-16 15:32:02 -07002014 /* Avoid recursion of direct reclaim */
2015 if (p->flags & PF_MEMALLOC)
2016 goto nopage;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002017
David Rientjes6583bb62009-07-29 15:02:06 -07002018 /* Avoid allocations with no watermarks from looping endlessly */
2019 if (test_thread_flag(TIF_MEMDIE) && !(gfp_mask & __GFP_NOFAIL))
2020 goto nopage;
2021
Mel Gorman56de7262010-05-24 14:32:30 -07002022 /* Try direct compaction */
2023 page = __alloc_pages_direct_compact(gfp_mask, order,
2024 zonelist, high_zoneidx,
2025 nodemask,
2026 alloc_flags, preferred_zone,
2027 migratetype, &did_some_progress);
2028 if (page)
2029 goto got_pg;
2030
Mel Gorman11e33f62009-06-16 15:31:57 -07002031 /* Try direct reclaim and then allocating */
2032 page = __alloc_pages_direct_reclaim(gfp_mask, order,
2033 zonelist, high_zoneidx,
2034 nodemask,
Mel Gorman5117f452009-06-16 15:31:59 -07002035 alloc_flags, preferred_zone,
Mel Gorman3dd28262009-06-16 15:32:00 -07002036 migratetype, &did_some_progress);
Mel Gorman11e33f62009-06-16 15:31:57 -07002037 if (page)
2038 goto got_pg;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002039
Linus Torvalds1da177e2005-04-16 15:20:36 -07002040 /*
Mel Gorman11e33f62009-06-16 15:31:57 -07002041 * If we failed to make any progress reclaiming, then we are
2042 * running out of options and have to consider going OOM
Linus Torvalds1da177e2005-04-16 15:20:36 -07002043 */
Mel Gorman11e33f62009-06-16 15:31:57 -07002044 if (!did_some_progress) {
2045 if ((gfp_mask & __GFP_FS) && !(gfp_mask & __GFP_NORETRY)) {
Rafael J. Wysocki7f33d492009-06-16 15:32:41 -07002046 if (oom_killer_disabled)
2047 goto nopage;
Mel Gorman11e33f62009-06-16 15:31:57 -07002048 page = __alloc_pages_may_oom(gfp_mask, order,
2049 zonelist, high_zoneidx,
Mel Gorman3dd28262009-06-16 15:32:00 -07002050 nodemask, preferred_zone,
2051 migratetype);
Mel Gorman11e33f62009-06-16 15:31:57 -07002052 if (page)
2053 goto got_pg;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002054
Mel Gorman11e33f62009-06-16 15:31:57 -07002055 /*
David Rientjes82553a92009-06-16 15:32:58 -07002056 * The OOM killer does not trigger for high-order
2057 * ~__GFP_NOFAIL allocations so if no progress is being
2058 * made, there are no other options and retrying is
2059 * unlikely to help.
Mel Gorman11e33f62009-06-16 15:31:57 -07002060 */
David Rientjes82553a92009-06-16 15:32:58 -07002061 if (order > PAGE_ALLOC_COSTLY_ORDER &&
2062 !(gfp_mask & __GFP_NOFAIL))
Mel Gorman11e33f62009-06-16 15:31:57 -07002063 goto nopage;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002064
Linus Torvalds1da177e2005-04-16 15:20:36 -07002065 goto restart;
2066 }
2067 }
2068
Mel Gorman11e33f62009-06-16 15:31:57 -07002069 /* Check if we should retry the allocation */
Nishanth Aravamudana41f24e2008-04-29 00:58:25 -07002070 pages_reclaimed += did_some_progress;
Mel Gorman11e33f62009-06-16 15:31:57 -07002071 if (should_alloc_retry(gfp_mask, order, pages_reclaimed)) {
2072 /* Wait for some write requests to complete then retry */
Jens Axboe8aa7e842009-07-09 14:52:32 +02002073 congestion_wait(BLK_RW_ASYNC, HZ/50);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002074 goto rebalance;
2075 }
2076
2077nopage:
2078 if (!(gfp_mask & __GFP_NOWARN) && printk_ratelimit()) {
2079 printk(KERN_WARNING "%s: page allocation failure."
2080 " order:%d, mode:0x%x\n",
2081 p->comm, order, gfp_mask);
2082 dump_stack();
Janet Morgan578c2fd2005-06-21 17:14:56 -07002083 show_mem();
Linus Torvalds1da177e2005-04-16 15:20:36 -07002084 }
Vegard Nossumb1eeab62008-11-25 16:55:53 +01002085 return page;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002086got_pg:
Vegard Nossumb1eeab62008-11-25 16:55:53 +01002087 if (kmemcheck_enabled)
2088 kmemcheck_pagealloc_alloc(page, order, gfp_mask);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002089 return page;
Mel Gorman11e33f62009-06-16 15:31:57 -07002090
Linus Torvalds1da177e2005-04-16 15:20:36 -07002091}
Mel Gorman11e33f62009-06-16 15:31:57 -07002092
2093/*
2094 * This is the 'heart' of the zoned buddy allocator.
2095 */
2096struct page *
2097__alloc_pages_nodemask(gfp_t gfp_mask, unsigned int order,
2098 struct zonelist *zonelist, nodemask_t *nodemask)
2099{
2100 enum zone_type high_zoneidx = gfp_zone(gfp_mask);
Mel Gorman5117f452009-06-16 15:31:59 -07002101 struct zone *preferred_zone;
Mel Gorman11e33f62009-06-16 15:31:57 -07002102 struct page *page;
Mel Gorman3dd28262009-06-16 15:32:00 -07002103 int migratetype = allocflags_to_migratetype(gfp_mask);
Mel Gorman11e33f62009-06-16 15:31:57 -07002104
Benjamin Herrenschmidtdcce2842009-06-18 13:24:12 +10002105 gfp_mask &= gfp_allowed_mask;
2106
Mel Gorman11e33f62009-06-16 15:31:57 -07002107 lockdep_trace_alloc(gfp_mask);
2108
2109 might_sleep_if(gfp_mask & __GFP_WAIT);
2110
2111 if (should_fail_alloc_page(gfp_mask, order))
2112 return NULL;
2113
2114 /*
2115 * Check the zones suitable for the gfp_mask contain at least one
2116 * valid zone. It's possible to have an empty zonelist as a result
2117 * of GFP_THISNODE and a memoryless node
2118 */
2119 if (unlikely(!zonelist->_zonerefs->zone))
2120 return NULL;
2121
Miao Xiec0ff7452010-05-24 14:32:08 -07002122 get_mems_allowed();
Mel Gorman5117f452009-06-16 15:31:59 -07002123 /* The preferred zone is used for statistics later */
2124 first_zones_zonelist(zonelist, high_zoneidx, nodemask, &preferred_zone);
Miao Xiec0ff7452010-05-24 14:32:08 -07002125 if (!preferred_zone) {
2126 put_mems_allowed();
Mel Gorman5117f452009-06-16 15:31:59 -07002127 return NULL;
Miao Xiec0ff7452010-05-24 14:32:08 -07002128 }
Mel Gorman5117f452009-06-16 15:31:59 -07002129
2130 /* First allocation attempt */
Mel Gorman11e33f62009-06-16 15:31:57 -07002131 page = get_page_from_freelist(gfp_mask|__GFP_HARDWALL, nodemask, order,
Mel Gorman5117f452009-06-16 15:31:59 -07002132 zonelist, high_zoneidx, ALLOC_WMARK_LOW|ALLOC_CPUSET,
Mel Gorman3dd28262009-06-16 15:32:00 -07002133 preferred_zone, migratetype);
Mel Gorman11e33f62009-06-16 15:31:57 -07002134 if (unlikely(!page))
2135 page = __alloc_pages_slowpath(gfp_mask, order,
Mel Gorman5117f452009-06-16 15:31:59 -07002136 zonelist, high_zoneidx, nodemask,
Mel Gorman3dd28262009-06-16 15:32:00 -07002137 preferred_zone, migratetype);
Miao Xiec0ff7452010-05-24 14:32:08 -07002138 put_mems_allowed();
Mel Gorman11e33f62009-06-16 15:31:57 -07002139
Mel Gorman4b4f2782009-09-21 17:02:41 -07002140 trace_mm_page_alloc(page, order, gfp_mask, migratetype);
Mel Gorman11e33f62009-06-16 15:31:57 -07002141 return page;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002142}
Mel Gormand2391712009-06-16 15:31:52 -07002143EXPORT_SYMBOL(__alloc_pages_nodemask);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002144
2145/*
2146 * Common helper functions.
2147 */
Harvey Harrison920c7a52008-02-04 22:29:26 -08002148unsigned long __get_free_pages(gfp_t gfp_mask, unsigned int order)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002149{
Akinobu Mita945a1112009-09-21 17:01:47 -07002150 struct page *page;
2151
2152 /*
2153 * __get_free_pages() returns a 32-bit address, which cannot represent
2154 * a highmem page
2155 */
2156 VM_BUG_ON((gfp_mask & __GFP_HIGHMEM) != 0);
2157
Linus Torvalds1da177e2005-04-16 15:20:36 -07002158 page = alloc_pages(gfp_mask, order);
2159 if (!page)
2160 return 0;
2161 return (unsigned long) page_address(page);
2162}
Linus Torvalds1da177e2005-04-16 15:20:36 -07002163EXPORT_SYMBOL(__get_free_pages);
2164
Harvey Harrison920c7a52008-02-04 22:29:26 -08002165unsigned long get_zeroed_page(gfp_t gfp_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002166{
Akinobu Mita945a1112009-09-21 17:01:47 -07002167 return __get_free_pages(gfp_mask | __GFP_ZERO, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002168}
Linus Torvalds1da177e2005-04-16 15:20:36 -07002169EXPORT_SYMBOL(get_zeroed_page);
2170
2171void __pagevec_free(struct pagevec *pvec)
2172{
2173 int i = pagevec_count(pvec);
2174
Mel Gorman4b4f2782009-09-21 17:02:41 -07002175 while (--i >= 0) {
2176 trace_mm_pagevec_free(pvec->pages[i], pvec->cold);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002177 free_hot_cold_page(pvec->pages[i], pvec->cold);
Mel Gorman4b4f2782009-09-21 17:02:41 -07002178 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002179}
2180
Harvey Harrison920c7a52008-02-04 22:29:26 -08002181void __free_pages(struct page *page, unsigned int order)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002182{
Nick Pigginb5810032005-10-29 18:16:12 -07002183 if (put_page_testzero(page)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002184 if (order == 0)
Li Hongfc916682010-03-05 13:41:54 -08002185 free_hot_cold_page(page, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002186 else
2187 __free_pages_ok(page, order);
2188 }
2189}
2190
2191EXPORT_SYMBOL(__free_pages);
2192
Harvey Harrison920c7a52008-02-04 22:29:26 -08002193void free_pages(unsigned long addr, unsigned int order)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002194{
2195 if (addr != 0) {
Nick Piggin725d7042006-09-25 23:30:55 -07002196 VM_BUG_ON(!virt_addr_valid((void *)addr));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002197 __free_pages(virt_to_page((void *)addr), order);
2198 }
2199}
2200
2201EXPORT_SYMBOL(free_pages);
2202
Timur Tabi2be0ffe2008-07-23 21:28:11 -07002203/**
2204 * alloc_pages_exact - allocate an exact number physically-contiguous pages.
2205 * @size: the number of bytes to allocate
2206 * @gfp_mask: GFP flags for the allocation
2207 *
2208 * This function is similar to alloc_pages(), except that it allocates the
2209 * minimum number of pages to satisfy the request. alloc_pages() can only
2210 * allocate memory in power-of-two pages.
2211 *
2212 * This function is also limited by MAX_ORDER.
2213 *
2214 * Memory allocated by this function must be released by free_pages_exact().
2215 */
2216void *alloc_pages_exact(size_t size, gfp_t gfp_mask)
2217{
2218 unsigned int order = get_order(size);
2219 unsigned long addr;
2220
2221 addr = __get_free_pages(gfp_mask, order);
2222 if (addr) {
2223 unsigned long alloc_end = addr + (PAGE_SIZE << order);
2224 unsigned long used = addr + PAGE_ALIGN(size);
2225
Kevin Cernekee5bfd7562009-07-05 12:08:19 -07002226 split_page(virt_to_page((void *)addr), order);
Timur Tabi2be0ffe2008-07-23 21:28:11 -07002227 while (used < alloc_end) {
2228 free_page(used);
2229 used += PAGE_SIZE;
2230 }
2231 }
2232
2233 return (void *)addr;
2234}
2235EXPORT_SYMBOL(alloc_pages_exact);
2236
2237/**
2238 * free_pages_exact - release memory allocated via alloc_pages_exact()
2239 * @virt: the value returned by alloc_pages_exact.
2240 * @size: size of allocation, same value as passed to alloc_pages_exact().
2241 *
2242 * Release the memory allocated by a previous call to alloc_pages_exact.
2243 */
2244void free_pages_exact(void *virt, size_t size)
2245{
2246 unsigned long addr = (unsigned long)virt;
2247 unsigned long end = addr + PAGE_ALIGN(size);
2248
2249 while (addr < end) {
2250 free_page(addr);
2251 addr += PAGE_SIZE;
2252 }
2253}
2254EXPORT_SYMBOL(free_pages_exact);
2255
Linus Torvalds1da177e2005-04-16 15:20:36 -07002256static unsigned int nr_free_zone_pages(int offset)
2257{
Mel Gormandd1a2392008-04-28 02:12:17 -07002258 struct zoneref *z;
Mel Gorman54a6eb52008-04-28 02:12:16 -07002259 struct zone *zone;
2260
Martin J. Blighe310fd42005-07-29 22:59:18 -07002261 /* Just pick one node, since fallback list is circular */
Linus Torvalds1da177e2005-04-16 15:20:36 -07002262 unsigned int sum = 0;
2263
Mel Gorman0e884602008-04-28 02:12:14 -07002264 struct zonelist *zonelist = node_zonelist(numa_node_id(), GFP_KERNEL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002265
Mel Gorman54a6eb52008-04-28 02:12:16 -07002266 for_each_zone_zonelist(zone, z, zonelist, offset) {
Martin J. Blighe310fd42005-07-29 22:59:18 -07002267 unsigned long size = zone->present_pages;
Mel Gorman41858962009-06-16 15:32:12 -07002268 unsigned long high = high_wmark_pages(zone);
Martin J. Blighe310fd42005-07-29 22:59:18 -07002269 if (size > high)
2270 sum += size - high;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002271 }
2272
2273 return sum;
2274}
2275
2276/*
2277 * Amount of free RAM allocatable within ZONE_DMA and ZONE_NORMAL
2278 */
2279unsigned int nr_free_buffer_pages(void)
2280{
Al Viroaf4ca452005-10-21 02:55:38 -04002281 return nr_free_zone_pages(gfp_zone(GFP_USER));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002282}
Meelap Shahc2f1a552007-07-17 04:04:39 -07002283EXPORT_SYMBOL_GPL(nr_free_buffer_pages);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002284
2285/*
2286 * Amount of free RAM allocatable within all zones
2287 */
2288unsigned int nr_free_pagecache_pages(void)
2289{
Mel Gorman2a1e2742007-07-17 04:03:12 -07002290 return nr_free_zone_pages(gfp_zone(GFP_HIGHUSER_MOVABLE));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002291}
Christoph Lameter08e0f6a2006-09-27 01:50:06 -07002292
2293static inline void show_node(struct zone *zone)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002294{
Christoph Lameter08e0f6a2006-09-27 01:50:06 -07002295 if (NUMA_BUILD)
Andy Whitcroft25ba77c2006-12-06 20:33:03 -08002296 printk("Node %d ", zone_to_nid(zone));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002297}
Linus Torvalds1da177e2005-04-16 15:20:36 -07002298
Linus Torvalds1da177e2005-04-16 15:20:36 -07002299void si_meminfo(struct sysinfo *val)
2300{
2301 val->totalram = totalram_pages;
2302 val->sharedram = 0;
Christoph Lameterd23ad422007-02-10 01:43:02 -08002303 val->freeram = global_page_state(NR_FREE_PAGES);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002304 val->bufferram = nr_blockdev_pages();
Linus Torvalds1da177e2005-04-16 15:20:36 -07002305 val->totalhigh = totalhigh_pages;
2306 val->freehigh = nr_free_highpages();
Linus Torvalds1da177e2005-04-16 15:20:36 -07002307 val->mem_unit = PAGE_SIZE;
2308}
2309
2310EXPORT_SYMBOL(si_meminfo);
2311
2312#ifdef CONFIG_NUMA
2313void si_meminfo_node(struct sysinfo *val, int nid)
2314{
2315 pg_data_t *pgdat = NODE_DATA(nid);
2316
2317 val->totalram = pgdat->node_present_pages;
Christoph Lameterd23ad422007-02-10 01:43:02 -08002318 val->freeram = node_page_state(nid, NR_FREE_PAGES);
Christoph Lameter98d2b0e2006-09-25 23:31:12 -07002319#ifdef CONFIG_HIGHMEM
Linus Torvalds1da177e2005-04-16 15:20:36 -07002320 val->totalhigh = pgdat->node_zones[ZONE_HIGHMEM].present_pages;
Christoph Lameterd23ad422007-02-10 01:43:02 -08002321 val->freehigh = zone_page_state(&pgdat->node_zones[ZONE_HIGHMEM],
2322 NR_FREE_PAGES);
Christoph Lameter98d2b0e2006-09-25 23:31:12 -07002323#else
2324 val->totalhigh = 0;
2325 val->freehigh = 0;
2326#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07002327 val->mem_unit = PAGE_SIZE;
2328}
2329#endif
2330
2331#define K(x) ((x) << (PAGE_SHIFT-10))
2332
2333/*
2334 * Show free area list (used inside shift_scroll-lock stuff)
2335 * We also calculate the percentage fragmentation. We do this by counting the
2336 * memory on each free list with the exception of the first item on the list.
2337 */
2338void show_free_areas(void)
2339{
Jes Sorensenc7241912006-09-27 01:50:05 -07002340 int cpu;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002341 struct zone *zone;
2342
KOSAKI Motohiroee99c712009-03-31 15:19:31 -07002343 for_each_populated_zone(zone) {
Jes Sorensenc7241912006-09-27 01:50:05 -07002344 show_node(zone);
2345 printk("%s per-cpu:\n", zone->name);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002346
Dave Jones6b482c62005-11-10 15:45:56 -05002347 for_each_online_cpu(cpu) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002348 struct per_cpu_pageset *pageset;
2349
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09002350 pageset = per_cpu_ptr(zone->pageset, cpu);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002351
Christoph Lameter3dfa5722008-02-04 22:29:19 -08002352 printk("CPU %4d: hi:%5d, btch:%4d usd:%4d\n",
2353 cpu, pageset->pcp.high,
2354 pageset->pcp.batch, pageset->pcp.count);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002355 }
2356 }
2357
KOSAKI Motohiroa7312862009-09-21 17:01:37 -07002358 printk("active_anon:%lu inactive_anon:%lu isolated_anon:%lu\n"
2359 " active_file:%lu inactive_file:%lu isolated_file:%lu\n"
Lee Schermerhorn7b854122008-10-18 20:26:40 -07002360 " unevictable:%lu"
Andrew Mortonb76146e2009-10-26 16:49:52 -07002361 " dirty:%lu writeback:%lu unstable:%lu\n"
KOSAKI Motohiro3701b032009-09-21 17:01:29 -07002362 " free:%lu slab_reclaimable:%lu slab_unreclaimable:%lu\n"
KOSAKI Motohiro4b021082009-09-21 17:01:33 -07002363 " mapped:%lu shmem:%lu pagetables:%lu bounce:%lu\n",
Rik van Riel4f98a2f2008-10-18 20:26:32 -07002364 global_page_state(NR_ACTIVE_ANON),
Rik van Riel4f98a2f2008-10-18 20:26:32 -07002365 global_page_state(NR_INACTIVE_ANON),
KOSAKI Motohiroa7312862009-09-21 17:01:37 -07002366 global_page_state(NR_ISOLATED_ANON),
2367 global_page_state(NR_ACTIVE_FILE),
Rik van Riel4f98a2f2008-10-18 20:26:32 -07002368 global_page_state(NR_INACTIVE_FILE),
KOSAKI Motohiroa7312862009-09-21 17:01:37 -07002369 global_page_state(NR_ISOLATED_FILE),
Lee Schermerhorn7b854122008-10-18 20:26:40 -07002370 global_page_state(NR_UNEVICTABLE),
Christoph Lameterb1e7a8f2006-06-30 01:55:39 -07002371 global_page_state(NR_FILE_DIRTY),
Christoph Lameterce866b32006-06-30 01:55:40 -07002372 global_page_state(NR_WRITEBACK),
Christoph Lameterfd39fc82006-06-30 01:55:40 -07002373 global_page_state(NR_UNSTABLE_NFS),
Christoph Lameterd23ad422007-02-10 01:43:02 -08002374 global_page_state(NR_FREE_PAGES),
KOSAKI Motohiro3701b032009-09-21 17:01:29 -07002375 global_page_state(NR_SLAB_RECLAIMABLE),
2376 global_page_state(NR_SLAB_UNRECLAIMABLE),
Christoph Lameter65ba55f2006-06-30 01:55:34 -07002377 global_page_state(NR_FILE_MAPPED),
KOSAKI Motohiro4b021082009-09-21 17:01:33 -07002378 global_page_state(NR_SHMEM),
Andrew Mortona25700a2007-02-08 14:20:40 -08002379 global_page_state(NR_PAGETABLE),
2380 global_page_state(NR_BOUNCE));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002381
KOSAKI Motohiroee99c712009-03-31 15:19:31 -07002382 for_each_populated_zone(zone) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002383 int i;
2384
2385 show_node(zone);
2386 printk("%s"
2387 " free:%lukB"
2388 " min:%lukB"
2389 " low:%lukB"
2390 " high:%lukB"
Rik van Riel4f98a2f2008-10-18 20:26:32 -07002391 " active_anon:%lukB"
2392 " inactive_anon:%lukB"
2393 " active_file:%lukB"
2394 " inactive_file:%lukB"
Lee Schermerhorn7b854122008-10-18 20:26:40 -07002395 " unevictable:%lukB"
KOSAKI Motohiroa7312862009-09-21 17:01:37 -07002396 " isolated(anon):%lukB"
2397 " isolated(file):%lukB"
Linus Torvalds1da177e2005-04-16 15:20:36 -07002398 " present:%lukB"
KOSAKI Motohiro4a0aa732009-09-21 17:01:30 -07002399 " mlocked:%lukB"
2400 " dirty:%lukB"
2401 " writeback:%lukB"
2402 " mapped:%lukB"
KOSAKI Motohiro4b021082009-09-21 17:01:33 -07002403 " shmem:%lukB"
KOSAKI Motohiro4a0aa732009-09-21 17:01:30 -07002404 " slab_reclaimable:%lukB"
2405 " slab_unreclaimable:%lukB"
KOSAKI Motohiroc6a7f572009-09-21 17:01:32 -07002406 " kernel_stack:%lukB"
KOSAKI Motohiro4a0aa732009-09-21 17:01:30 -07002407 " pagetables:%lukB"
2408 " unstable:%lukB"
2409 " bounce:%lukB"
2410 " writeback_tmp:%lukB"
Linus Torvalds1da177e2005-04-16 15:20:36 -07002411 " pages_scanned:%lu"
2412 " all_unreclaimable? %s"
2413 "\n",
2414 zone->name,
Christoph Lameterd23ad422007-02-10 01:43:02 -08002415 K(zone_page_state(zone, NR_FREE_PAGES)),
Mel Gorman41858962009-06-16 15:32:12 -07002416 K(min_wmark_pages(zone)),
2417 K(low_wmark_pages(zone)),
2418 K(high_wmark_pages(zone)),
Rik van Riel4f98a2f2008-10-18 20:26:32 -07002419 K(zone_page_state(zone, NR_ACTIVE_ANON)),
2420 K(zone_page_state(zone, NR_INACTIVE_ANON)),
2421 K(zone_page_state(zone, NR_ACTIVE_FILE)),
2422 K(zone_page_state(zone, NR_INACTIVE_FILE)),
Lee Schermerhorn7b854122008-10-18 20:26:40 -07002423 K(zone_page_state(zone, NR_UNEVICTABLE)),
KOSAKI Motohiroa7312862009-09-21 17:01:37 -07002424 K(zone_page_state(zone, NR_ISOLATED_ANON)),
2425 K(zone_page_state(zone, NR_ISOLATED_FILE)),
Linus Torvalds1da177e2005-04-16 15:20:36 -07002426 K(zone->present_pages),
KOSAKI Motohiro4a0aa732009-09-21 17:01:30 -07002427 K(zone_page_state(zone, NR_MLOCK)),
2428 K(zone_page_state(zone, NR_FILE_DIRTY)),
2429 K(zone_page_state(zone, NR_WRITEBACK)),
2430 K(zone_page_state(zone, NR_FILE_MAPPED)),
KOSAKI Motohiro4b021082009-09-21 17:01:33 -07002431 K(zone_page_state(zone, NR_SHMEM)),
KOSAKI Motohiro4a0aa732009-09-21 17:01:30 -07002432 K(zone_page_state(zone, NR_SLAB_RECLAIMABLE)),
2433 K(zone_page_state(zone, NR_SLAB_UNRECLAIMABLE)),
KOSAKI Motohiroc6a7f572009-09-21 17:01:32 -07002434 zone_page_state(zone, NR_KERNEL_STACK) *
2435 THREAD_SIZE / 1024,
KOSAKI Motohiro4a0aa732009-09-21 17:01:30 -07002436 K(zone_page_state(zone, NR_PAGETABLE)),
2437 K(zone_page_state(zone, NR_UNSTABLE_NFS)),
2438 K(zone_page_state(zone, NR_BOUNCE)),
2439 K(zone_page_state(zone, NR_WRITEBACK_TEMP)),
Linus Torvalds1da177e2005-04-16 15:20:36 -07002440 zone->pages_scanned,
KOSAKI Motohiro93e4a892010-03-05 13:41:55 -08002441 (zone->all_unreclaimable ? "yes" : "no")
Linus Torvalds1da177e2005-04-16 15:20:36 -07002442 );
2443 printk("lowmem_reserve[]:");
2444 for (i = 0; i < MAX_NR_ZONES; i++)
2445 printk(" %lu", zone->lowmem_reserve[i]);
2446 printk("\n");
2447 }
2448
KOSAKI Motohiroee99c712009-03-31 15:19:31 -07002449 for_each_populated_zone(zone) {
Kirill Korotaev8f9de512006-06-23 02:03:50 -07002450 unsigned long nr[MAX_ORDER], flags, order, total = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002451
2452 show_node(zone);
2453 printk("%s: ", zone->name);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002454
2455 spin_lock_irqsave(&zone->lock, flags);
2456 for (order = 0; order < MAX_ORDER; order++) {
Kirill Korotaev8f9de512006-06-23 02:03:50 -07002457 nr[order] = zone->free_area[order].nr_free;
2458 total += nr[order] << order;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002459 }
2460 spin_unlock_irqrestore(&zone->lock, flags);
Kirill Korotaev8f9de512006-06-23 02:03:50 -07002461 for (order = 0; order < MAX_ORDER; order++)
2462 printk("%lu*%lukB ", nr[order], K(1UL) << order);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002463 printk("= %lukB\n", K(total));
2464 }
2465
Larry Woodmane6f36022008-02-04 22:29:30 -08002466 printk("%ld total pagecache pages\n", global_page_state(NR_FILE_PAGES));
2467
Linus Torvalds1da177e2005-04-16 15:20:36 -07002468 show_swap_cache_info();
2469}
2470
Mel Gorman19770b32008-04-28 02:12:18 -07002471static void zoneref_set_zone(struct zone *zone, struct zoneref *zoneref)
2472{
2473 zoneref->zone = zone;
2474 zoneref->zone_idx = zone_idx(zone);
2475}
2476
Linus Torvalds1da177e2005-04-16 15:20:36 -07002477/*
2478 * Builds allocation fallback zone lists.
Christoph Lameter1a932052006-01-06 00:11:16 -08002479 *
2480 * Add all populated zones of a node to the zonelist.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002481 */
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002482static int build_zonelists_node(pg_data_t *pgdat, struct zonelist *zonelist,
2483 int nr_zones, enum zone_type zone_type)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002484{
Christoph Lameter1a932052006-01-06 00:11:16 -08002485 struct zone *zone;
2486
Christoph Lameter98d2b0e2006-09-25 23:31:12 -07002487 BUG_ON(zone_type >= MAX_NR_ZONES);
Christoph Lameter2f6726e2006-09-25 23:31:18 -07002488 zone_type++;
Christoph Lameter02a68a52006-01-06 00:11:18 -08002489
2490 do {
Christoph Lameter2f6726e2006-09-25 23:31:18 -07002491 zone_type--;
Christoph Lameter070f8032006-01-06 00:11:19 -08002492 zone = pgdat->node_zones + zone_type;
Christoph Lameter1a932052006-01-06 00:11:16 -08002493 if (populated_zone(zone)) {
Mel Gormandd1a2392008-04-28 02:12:17 -07002494 zoneref_set_zone(zone,
2495 &zonelist->_zonerefs[nr_zones++]);
Christoph Lameter070f8032006-01-06 00:11:19 -08002496 check_highest_zone(zone_type);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002497 }
Christoph Lameter02a68a52006-01-06 00:11:18 -08002498
Christoph Lameter2f6726e2006-09-25 23:31:18 -07002499 } while (zone_type);
Christoph Lameter070f8032006-01-06 00:11:19 -08002500 return nr_zones;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002501}
2502
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002503
2504/*
2505 * zonelist_order:
2506 * 0 = automatic detection of better ordering.
2507 * 1 = order by ([node] distance, -zonetype)
2508 * 2 = order by (-zonetype, [node] distance)
2509 *
2510 * If not NUMA, ZONELIST_ORDER_ZONE and ZONELIST_ORDER_NODE will create
2511 * the same zonelist. So only NUMA can configure this param.
2512 */
2513#define ZONELIST_ORDER_DEFAULT 0
2514#define ZONELIST_ORDER_NODE 1
2515#define ZONELIST_ORDER_ZONE 2
2516
2517/* zonelist order in the kernel.
2518 * set_zonelist_order() will set this to NODE or ZONE.
2519 */
2520static int current_zonelist_order = ZONELIST_ORDER_DEFAULT;
2521static char zonelist_order_name[3][8] = {"Default", "Node", "Zone"};
2522
2523
Linus Torvalds1da177e2005-04-16 15:20:36 -07002524#ifdef CONFIG_NUMA
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002525/* The value user specified ....changed by config */
2526static int user_zonelist_order = ZONELIST_ORDER_DEFAULT;
2527/* string for sysctl */
2528#define NUMA_ZONELIST_ORDER_LEN 16
2529char numa_zonelist_order[16] = "default";
2530
2531/*
2532 * interface for configure zonelist ordering.
2533 * command line option "numa_zonelist_order"
2534 * = "[dD]efault - default, automatic configuration.
2535 * = "[nN]ode - order by node locality, then by zone within node
2536 * = "[zZ]one - order by zone, then by locality within zone
2537 */
2538
2539static int __parse_numa_zonelist_order(char *s)
2540{
2541 if (*s == 'd' || *s == 'D') {
2542 user_zonelist_order = ZONELIST_ORDER_DEFAULT;
2543 } else if (*s == 'n' || *s == 'N') {
2544 user_zonelist_order = ZONELIST_ORDER_NODE;
2545 } else if (*s == 'z' || *s == 'Z') {
2546 user_zonelist_order = ZONELIST_ORDER_ZONE;
2547 } else {
2548 printk(KERN_WARNING
2549 "Ignoring invalid numa_zonelist_order value: "
2550 "%s\n", s);
2551 return -EINVAL;
2552 }
2553 return 0;
2554}
2555
2556static __init int setup_numa_zonelist_order(char *s)
2557{
2558 if (s)
2559 return __parse_numa_zonelist_order(s);
2560 return 0;
2561}
2562early_param("numa_zonelist_order", setup_numa_zonelist_order);
2563
2564/*
2565 * sysctl handler for numa_zonelist_order
2566 */
2567int numa_zonelist_order_handler(ctl_table *table, int write,
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07002568 void __user *buffer, size_t *length,
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002569 loff_t *ppos)
2570{
2571 char saved_string[NUMA_ZONELIST_ORDER_LEN];
2572 int ret;
Andi Kleen443c6f12009-12-23 21:00:47 +01002573 static DEFINE_MUTEX(zl_order_mutex);
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002574
Andi Kleen443c6f12009-12-23 21:00:47 +01002575 mutex_lock(&zl_order_mutex);
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002576 if (write)
Andi Kleen443c6f12009-12-23 21:00:47 +01002577 strcpy(saved_string, (char*)table->data);
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07002578 ret = proc_dostring(table, write, buffer, length, ppos);
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002579 if (ret)
Andi Kleen443c6f12009-12-23 21:00:47 +01002580 goto out;
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002581 if (write) {
2582 int oldval = user_zonelist_order;
2583 if (__parse_numa_zonelist_order((char*)table->data)) {
2584 /*
2585 * bogus value. restore saved string
2586 */
2587 strncpy((char*)table->data, saved_string,
2588 NUMA_ZONELIST_ORDER_LEN);
2589 user_zonelist_order = oldval;
Haicheng Li4eaf3f62010-05-24 14:32:52 -07002590 } else if (oldval != user_zonelist_order) {
2591 mutex_lock(&zonelists_mutex);
Haicheng Li1f522502010-05-24 14:32:51 -07002592 build_all_zonelists(NULL);
Haicheng Li4eaf3f62010-05-24 14:32:52 -07002593 mutex_unlock(&zonelists_mutex);
2594 }
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002595 }
Andi Kleen443c6f12009-12-23 21:00:47 +01002596out:
2597 mutex_unlock(&zl_order_mutex);
2598 return ret;
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002599}
2600
2601
Christoph Lameter62bc62a2009-06-16 15:32:15 -07002602#define MAX_NODE_LOAD (nr_online_nodes)
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002603static int node_load[MAX_NUMNODES];
2604
Linus Torvalds1da177e2005-04-16 15:20:36 -07002605/**
Pavel Pisa4dc3b162005-05-01 08:59:25 -07002606 * find_next_best_node - find the next node that should appear in a given node's fallback list
Linus Torvalds1da177e2005-04-16 15:20:36 -07002607 * @node: node whose fallback list we're appending
2608 * @used_node_mask: nodemask_t of already used nodes
2609 *
2610 * We use a number of factors to determine which is the next node that should
2611 * appear on a given node's fallback list. The node should not have appeared
2612 * already in @node's fallback list, and it should be the next closest node
2613 * according to the distance array (which contains arbitrary distance values
2614 * from each node to each node in the system), and should also prefer nodes
2615 * with no CPUs, since presumably they'll have very little allocation pressure
2616 * on them otherwise.
2617 * It returns -1 if no node is found.
2618 */
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002619static int find_next_best_node(int node, nodemask_t *used_node_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002620{
Linus Torvalds4cf808e2006-02-17 20:38:21 +01002621 int n, val;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002622 int min_val = INT_MAX;
2623 int best_node = -1;
Rusty Russella70f7302009-03-13 14:49:46 +10302624 const struct cpumask *tmp = cpumask_of_node(0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002625
Linus Torvalds4cf808e2006-02-17 20:38:21 +01002626 /* Use the local node if we haven't already */
2627 if (!node_isset(node, *used_node_mask)) {
2628 node_set(node, *used_node_mask);
2629 return node;
2630 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002631
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07002632 for_each_node_state(n, N_HIGH_MEMORY) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002633
2634 /* Don't want a node to appear more than once */
2635 if (node_isset(n, *used_node_mask))
2636 continue;
2637
Linus Torvalds1da177e2005-04-16 15:20:36 -07002638 /* Use the distance array to find the distance */
2639 val = node_distance(node, n);
2640
Linus Torvalds4cf808e2006-02-17 20:38:21 +01002641 /* Penalize nodes under us ("prefer the next node") */
2642 val += (n < node);
2643
Linus Torvalds1da177e2005-04-16 15:20:36 -07002644 /* Give preference to headless and unused nodes */
Rusty Russella70f7302009-03-13 14:49:46 +10302645 tmp = cpumask_of_node(n);
2646 if (!cpumask_empty(tmp))
Linus Torvalds1da177e2005-04-16 15:20:36 -07002647 val += PENALTY_FOR_NODE_WITH_CPUS;
2648
2649 /* Slight preference for less loaded node */
2650 val *= (MAX_NODE_LOAD*MAX_NUMNODES);
2651 val += node_load[n];
2652
2653 if (val < min_val) {
2654 min_val = val;
2655 best_node = n;
2656 }
2657 }
2658
2659 if (best_node >= 0)
2660 node_set(best_node, *used_node_mask);
2661
2662 return best_node;
2663}
2664
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002665
2666/*
2667 * Build zonelists ordered by node and zones within node.
2668 * This results in maximum locality--normal zone overflows into local
2669 * DMA zone, if any--but risks exhausting DMA zone.
2670 */
2671static void build_zonelists_in_node_order(pg_data_t *pgdat, int node)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002672{
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002673 int j;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002674 struct zonelist *zonelist;
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002675
Mel Gorman54a6eb52008-04-28 02:12:16 -07002676 zonelist = &pgdat->node_zonelists[0];
Mel Gormandd1a2392008-04-28 02:12:17 -07002677 for (j = 0; zonelist->_zonerefs[j].zone != NULL; j++)
Mel Gorman54a6eb52008-04-28 02:12:16 -07002678 ;
2679 j = build_zonelists_node(NODE_DATA(node), zonelist, j,
2680 MAX_NR_ZONES - 1);
Mel Gormandd1a2392008-04-28 02:12:17 -07002681 zonelist->_zonerefs[j].zone = NULL;
2682 zonelist->_zonerefs[j].zone_idx = 0;
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002683}
2684
2685/*
Christoph Lameter523b9452007-10-16 01:25:37 -07002686 * Build gfp_thisnode zonelists
2687 */
2688static void build_thisnode_zonelists(pg_data_t *pgdat)
2689{
Christoph Lameter523b9452007-10-16 01:25:37 -07002690 int j;
2691 struct zonelist *zonelist;
2692
Mel Gorman54a6eb52008-04-28 02:12:16 -07002693 zonelist = &pgdat->node_zonelists[1];
2694 j = build_zonelists_node(pgdat, zonelist, 0, MAX_NR_ZONES - 1);
Mel Gormandd1a2392008-04-28 02:12:17 -07002695 zonelist->_zonerefs[j].zone = NULL;
2696 zonelist->_zonerefs[j].zone_idx = 0;
Christoph Lameter523b9452007-10-16 01:25:37 -07002697}
2698
2699/*
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002700 * Build zonelists ordered by zone and nodes within zones.
2701 * This results in conserving DMA zone[s] until all Normal memory is
2702 * exhausted, but results in overflowing to remote node while memory
2703 * may still exist in local DMA zone.
2704 */
2705static int node_order[MAX_NUMNODES];
2706
2707static void build_zonelists_in_zone_order(pg_data_t *pgdat, int nr_nodes)
2708{
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002709 int pos, j, node;
2710 int zone_type; /* needs to be signed */
2711 struct zone *z;
2712 struct zonelist *zonelist;
2713
Mel Gorman54a6eb52008-04-28 02:12:16 -07002714 zonelist = &pgdat->node_zonelists[0];
2715 pos = 0;
2716 for (zone_type = MAX_NR_ZONES - 1; zone_type >= 0; zone_type--) {
2717 for (j = 0; j < nr_nodes; j++) {
2718 node = node_order[j];
2719 z = &NODE_DATA(node)->node_zones[zone_type];
2720 if (populated_zone(z)) {
Mel Gormandd1a2392008-04-28 02:12:17 -07002721 zoneref_set_zone(z,
2722 &zonelist->_zonerefs[pos++]);
Mel Gorman54a6eb52008-04-28 02:12:16 -07002723 check_highest_zone(zone_type);
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002724 }
2725 }
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002726 }
Mel Gormandd1a2392008-04-28 02:12:17 -07002727 zonelist->_zonerefs[pos].zone = NULL;
2728 zonelist->_zonerefs[pos].zone_idx = 0;
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002729}
2730
2731static int default_zonelist_order(void)
2732{
2733 int nid, zone_type;
2734 unsigned long low_kmem_size,total_size;
2735 struct zone *z;
2736 int average_size;
2737 /*
Thomas Weber88393162010-03-16 11:47:56 +01002738 * ZONE_DMA and ZONE_DMA32 can be very small area in the system.
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002739 * If they are really small and used heavily, the system can fall
2740 * into OOM very easily.
David Rientjese325c902010-05-24 14:32:13 -07002741 * This function detect ZONE_DMA/DMA32 size and configures zone order.
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002742 */
2743 /* Is there ZONE_NORMAL ? (ex. ppc has only DMA zone..) */
2744 low_kmem_size = 0;
2745 total_size = 0;
2746 for_each_online_node(nid) {
2747 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++) {
2748 z = &NODE_DATA(nid)->node_zones[zone_type];
2749 if (populated_zone(z)) {
2750 if (zone_type < ZONE_NORMAL)
2751 low_kmem_size += z->present_pages;
2752 total_size += z->present_pages;
David Rientjese325c902010-05-24 14:32:13 -07002753 } else if (zone_type == ZONE_NORMAL) {
2754 /*
2755 * If any node has only lowmem, then node order
2756 * is preferred to allow kernel allocations
2757 * locally; otherwise, they can easily infringe
2758 * on other nodes when there is an abundance of
2759 * lowmem available to allocate from.
2760 */
2761 return ZONELIST_ORDER_NODE;
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002762 }
2763 }
2764 }
2765 if (!low_kmem_size || /* there are no DMA area. */
2766 low_kmem_size > total_size/2) /* DMA/DMA32 is big. */
2767 return ZONELIST_ORDER_NODE;
2768 /*
2769 * look into each node's config.
2770 * If there is a node whose DMA/DMA32 memory is very big area on
2771 * local memory, NODE_ORDER may be suitable.
2772 */
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07002773 average_size = total_size /
2774 (nodes_weight(node_states[N_HIGH_MEMORY]) + 1);
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002775 for_each_online_node(nid) {
2776 low_kmem_size = 0;
2777 total_size = 0;
2778 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++) {
2779 z = &NODE_DATA(nid)->node_zones[zone_type];
2780 if (populated_zone(z)) {
2781 if (zone_type < ZONE_NORMAL)
2782 low_kmem_size += z->present_pages;
2783 total_size += z->present_pages;
2784 }
2785 }
2786 if (low_kmem_size &&
2787 total_size > average_size && /* ignore small node */
2788 low_kmem_size > total_size * 70/100)
2789 return ZONELIST_ORDER_NODE;
2790 }
2791 return ZONELIST_ORDER_ZONE;
2792}
2793
2794static void set_zonelist_order(void)
2795{
2796 if (user_zonelist_order == ZONELIST_ORDER_DEFAULT)
2797 current_zonelist_order = default_zonelist_order();
2798 else
2799 current_zonelist_order = user_zonelist_order;
2800}
2801
2802static void build_zonelists(pg_data_t *pgdat)
2803{
2804 int j, node, load;
2805 enum zone_type i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002806 nodemask_t used_mask;
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002807 int local_node, prev_node;
2808 struct zonelist *zonelist;
2809 int order = current_zonelist_order;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002810
2811 /* initialize zonelists */
Christoph Lameter523b9452007-10-16 01:25:37 -07002812 for (i = 0; i < MAX_ZONELISTS; i++) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002813 zonelist = pgdat->node_zonelists + i;
Mel Gormandd1a2392008-04-28 02:12:17 -07002814 zonelist->_zonerefs[0].zone = NULL;
2815 zonelist->_zonerefs[0].zone_idx = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002816 }
2817
2818 /* NUMA-aware ordering of nodes */
2819 local_node = pgdat->node_id;
Christoph Lameter62bc62a2009-06-16 15:32:15 -07002820 load = nr_online_nodes;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002821 prev_node = local_node;
2822 nodes_clear(used_mask);
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002823
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002824 memset(node_order, 0, sizeof(node_order));
2825 j = 0;
2826
Linus Torvalds1da177e2005-04-16 15:20:36 -07002827 while ((node = find_next_best_node(local_node, &used_mask)) >= 0) {
Christoph Lameter9eeff232006-01-18 17:42:31 -08002828 int distance = node_distance(local_node, node);
2829
2830 /*
2831 * If another node is sufficiently far away then it is better
2832 * to reclaim pages in a zone before going off node.
2833 */
2834 if (distance > RECLAIM_DISTANCE)
2835 zone_reclaim_mode = 1;
2836
Linus Torvalds1da177e2005-04-16 15:20:36 -07002837 /*
2838 * We don't want to pressure a particular node.
2839 * So adding penalty to the first node in same
2840 * distance group to make it round-robin.
2841 */
Christoph Lameter9eeff232006-01-18 17:42:31 -08002842 if (distance != node_distance(local_node, prev_node))
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002843 node_load[node] = load;
2844
Linus Torvalds1da177e2005-04-16 15:20:36 -07002845 prev_node = node;
2846 load--;
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002847 if (order == ZONELIST_ORDER_NODE)
2848 build_zonelists_in_node_order(pgdat, node);
2849 else
2850 node_order[j++] = node; /* remember order */
2851 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002852
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002853 if (order == ZONELIST_ORDER_ZONE) {
2854 /* calculate node order -- i.e., DMA last! */
2855 build_zonelists_in_zone_order(pgdat, j);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002856 }
Christoph Lameter523b9452007-10-16 01:25:37 -07002857
2858 build_thisnode_zonelists(pgdat);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002859}
2860
Paul Jackson9276b1bc2006-12-06 20:31:48 -08002861/* Construct the zonelist performance cache - see further mmzone.h */
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002862static void build_zonelist_cache(pg_data_t *pgdat)
Paul Jackson9276b1bc2006-12-06 20:31:48 -08002863{
Mel Gorman54a6eb52008-04-28 02:12:16 -07002864 struct zonelist *zonelist;
2865 struct zonelist_cache *zlc;
Mel Gormandd1a2392008-04-28 02:12:17 -07002866 struct zoneref *z;
Paul Jackson9276b1bc2006-12-06 20:31:48 -08002867
Mel Gorman54a6eb52008-04-28 02:12:16 -07002868 zonelist = &pgdat->node_zonelists[0];
2869 zonelist->zlcache_ptr = zlc = &zonelist->zlcache;
2870 bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST);
Mel Gormandd1a2392008-04-28 02:12:17 -07002871 for (z = zonelist->_zonerefs; z->zone; z++)
2872 zlc->z_to_n[z - zonelist->_zonerefs] = zonelist_node_idx(z);
Paul Jackson9276b1bc2006-12-06 20:31:48 -08002873}
2874
Lee Schermerhorn7aac7892010-05-26 14:45:00 -07002875#ifdef CONFIG_HAVE_MEMORYLESS_NODES
2876/*
2877 * Return node id of node used for "local" allocations.
2878 * I.e., first node id of first zone in arg node's generic zonelist.
2879 * Used for initializing percpu 'numa_mem', which is used primarily
2880 * for kernel allocations, so use GFP_KERNEL flags to locate zonelist.
2881 */
2882int local_memory_node(int node)
2883{
2884 struct zone *zone;
2885
2886 (void)first_zones_zonelist(node_zonelist(node, GFP_KERNEL),
2887 gfp_zone(GFP_KERNEL),
2888 NULL,
2889 &zone);
2890 return zone->node;
2891}
2892#endif
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002893
Linus Torvalds1da177e2005-04-16 15:20:36 -07002894#else /* CONFIG_NUMA */
2895
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002896static void set_zonelist_order(void)
2897{
2898 current_zonelist_order = ZONELIST_ORDER_ZONE;
2899}
2900
2901static void build_zonelists(pg_data_t *pgdat)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002902{
Christoph Lameter19655d32006-09-25 23:31:19 -07002903 int node, local_node;
Mel Gorman54a6eb52008-04-28 02:12:16 -07002904 enum zone_type j;
2905 struct zonelist *zonelist;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002906
2907 local_node = pgdat->node_id;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002908
Mel Gorman54a6eb52008-04-28 02:12:16 -07002909 zonelist = &pgdat->node_zonelists[0];
2910 j = build_zonelists_node(pgdat, zonelist, 0, MAX_NR_ZONES - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002911
Mel Gorman54a6eb52008-04-28 02:12:16 -07002912 /*
2913 * Now we build the zonelist so that it contains the zones
2914 * of all the other nodes.
2915 * We don't want to pressure a particular node, so when
2916 * building the zones for node N, we make sure that the
2917 * zones coming right after the local ones are those from
2918 * node N+1 (modulo N)
2919 */
2920 for (node = local_node + 1; node < MAX_NUMNODES; node++) {
2921 if (!node_online(node))
2922 continue;
2923 j = build_zonelists_node(NODE_DATA(node), zonelist, j,
2924 MAX_NR_ZONES - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002925 }
Mel Gorman54a6eb52008-04-28 02:12:16 -07002926 for (node = 0; node < local_node; node++) {
2927 if (!node_online(node))
2928 continue;
2929 j = build_zonelists_node(NODE_DATA(node), zonelist, j,
2930 MAX_NR_ZONES - 1);
2931 }
2932
Mel Gormandd1a2392008-04-28 02:12:17 -07002933 zonelist->_zonerefs[j].zone = NULL;
2934 zonelist->_zonerefs[j].zone_idx = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002935}
2936
Paul Jackson9276b1bc2006-12-06 20:31:48 -08002937/* non-NUMA variant of zonelist performance cache - just NULL zlcache_ptr */
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07002938static void build_zonelist_cache(pg_data_t *pgdat)
Paul Jackson9276b1bc2006-12-06 20:31:48 -08002939{
Mel Gorman54a6eb52008-04-28 02:12:16 -07002940 pgdat->node_zonelists[0].zlcache_ptr = NULL;
Paul Jackson9276b1bc2006-12-06 20:31:48 -08002941}
2942
Linus Torvalds1da177e2005-04-16 15:20:36 -07002943#endif /* CONFIG_NUMA */
2944
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09002945/*
2946 * Boot pageset table. One per cpu which is going to be used for all
2947 * zones and all nodes. The parameters will be set in such a way
2948 * that an item put on a list will immediately be handed over to
2949 * the buddy list. This is safe since pageset manipulation is done
2950 * with interrupts disabled.
2951 *
2952 * The boot_pagesets must be kept even after bootup is complete for
2953 * unused processors and/or zones. They do play a role for bootstrapping
2954 * hotplugged processors.
2955 *
2956 * zoneinfo_show() and maybe other functions do
2957 * not check if the processor is online before following the pageset pointer.
2958 * Other parts of the kernel may not check if the zone is available.
2959 */
2960static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch);
2961static DEFINE_PER_CPU(struct per_cpu_pageset, boot_pageset);
Haicheng Li1f522502010-05-24 14:32:51 -07002962static void setup_zone_pageset(struct zone *zone);
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09002963
Haicheng Li4eaf3f62010-05-24 14:32:52 -07002964/*
2965 * Global mutex to protect against size modification of zonelists
2966 * as well as to serialize pageset setup for the new populated zone.
2967 */
2968DEFINE_MUTEX(zonelists_mutex);
2969
Rusty Russell9b1a4d32008-07-28 12:16:30 -05002970/* return values int ....just for stop_machine() */
Haicheng Li1f522502010-05-24 14:32:51 -07002971static __init_refok int __build_all_zonelists(void *data)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002972{
Yasunori Goto68113782006-06-23 02:03:11 -07002973 int nid;
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09002974 int cpu;
Paul Jackson9276b1bc2006-12-06 20:31:48 -08002975
Bo Liu7f9cfb32009-08-18 14:11:19 -07002976#ifdef CONFIG_NUMA
2977 memset(node_load, 0, sizeof(node_load));
2978#endif
Paul Jackson9276b1bc2006-12-06 20:31:48 -08002979 for_each_online_node(nid) {
Christoph Lameter7ea15302007-10-16 01:25:29 -07002980 pg_data_t *pgdat = NODE_DATA(nid);
2981
2982 build_zonelists(pgdat);
2983 build_zonelist_cache(pgdat);
Paul Jackson9276b1bc2006-12-06 20:31:48 -08002984 }
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09002985
Haicheng Li1f522502010-05-24 14:32:51 -07002986#ifdef CONFIG_MEMORY_HOTPLUG
2987 /* Setup real pagesets for the new zone */
2988 if (data) {
2989 struct zone *zone = data;
2990 setup_zone_pageset(zone);
2991 }
2992#endif
2993
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09002994 /*
2995 * Initialize the boot_pagesets that are going to be used
2996 * for bootstrapping processors. The real pagesets for
2997 * each zone will be allocated later when the per cpu
2998 * allocator is available.
2999 *
3000 * boot_pagesets are used also for bootstrapping offline
3001 * cpus if the system is already booted because the pagesets
3002 * are needed to initialize allocators on a specific cpu too.
3003 * F.e. the percpu allocator needs the page allocator which
3004 * needs the percpu allocator in order to allocate its pagesets
3005 * (a chicken-egg dilemma).
3006 */
Lee Schermerhorn7aac7892010-05-26 14:45:00 -07003007 for_each_possible_cpu(cpu) {
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09003008 setup_pageset(&per_cpu(boot_pageset, cpu), 0);
3009
Lee Schermerhorn7aac7892010-05-26 14:45:00 -07003010#ifdef CONFIG_HAVE_MEMORYLESS_NODES
3011 /*
3012 * We now know the "local memory node" for each node--
3013 * i.e., the node of the first zone in the generic zonelist.
3014 * Set up numa_mem percpu variable for on-line cpus. During
3015 * boot, only the boot cpu should be on-line; we'll init the
3016 * secondary cpus' numa_mem as they come on-line. During
3017 * node/memory hotplug, we'll fixup all on-line cpus.
3018 */
3019 if (cpu_online(cpu))
3020 set_cpu_numa_mem(cpu, local_memory_node(cpu_to_node(cpu)));
3021#endif
3022 }
3023
Yasunori Goto68113782006-06-23 02:03:11 -07003024 return 0;
3025}
Linus Torvalds1da177e2005-04-16 15:20:36 -07003026
Haicheng Li4eaf3f62010-05-24 14:32:52 -07003027/*
3028 * Called with zonelists_mutex held always
3029 * unless system_state == SYSTEM_BOOTING.
3030 */
Haicheng Li1f522502010-05-24 14:32:51 -07003031void build_all_zonelists(void *data)
Yasunori Goto68113782006-06-23 02:03:11 -07003032{
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003033 set_zonelist_order();
3034
Yasunori Goto68113782006-06-23 02:03:11 -07003035 if (system_state == SYSTEM_BOOTING) {
Randy Dunlap423b41d2006-09-27 01:50:12 -07003036 __build_all_zonelists(NULL);
Mel Gorman68ad8df2008-07-23 21:26:52 -07003037 mminit_verify_zonelist();
Yasunori Goto68113782006-06-23 02:03:11 -07003038 cpuset_init_current_mems_allowed();
3039 } else {
Simon Arlott183ff222007-10-20 01:27:18 +02003040 /* we have to stop all cpus to guarantee there is no user
Yasunori Goto68113782006-06-23 02:03:11 -07003041 of zonelist */
Haicheng Li1f522502010-05-24 14:32:51 -07003042 stop_machine(__build_all_zonelists, data, NULL);
Yasunori Goto68113782006-06-23 02:03:11 -07003043 /* cpuset refresh routine should be here */
3044 }
Andrew Mortonbd1e22b2006-06-23 02:03:47 -07003045 vm_total_pages = nr_free_pagecache_pages();
Mel Gorman9ef9acb2007-10-16 01:25:54 -07003046 /*
3047 * Disable grouping by mobility if the number of pages in the
3048 * system is too low to allow the mechanism to work. It would be
3049 * more accurate, but expensive to check per-zone. This check is
3050 * made on memory-hotadd so a system can start with mobility
3051 * disabled and enable it later
3052 */
Mel Gormand9c23402007-10-16 01:26:01 -07003053 if (vm_total_pages < (pageblock_nr_pages * MIGRATE_TYPES))
Mel Gorman9ef9acb2007-10-16 01:25:54 -07003054 page_group_by_mobility_disabled = 1;
3055 else
3056 page_group_by_mobility_disabled = 0;
3057
3058 printk("Built %i zonelists in %s order, mobility grouping %s. "
3059 "Total pages: %ld\n",
Christoph Lameter62bc62a2009-06-16 15:32:15 -07003060 nr_online_nodes,
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003061 zonelist_order_name[current_zonelist_order],
Mel Gorman9ef9acb2007-10-16 01:25:54 -07003062 page_group_by_mobility_disabled ? "off" : "on",
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003063 vm_total_pages);
3064#ifdef CONFIG_NUMA
3065 printk("Policy zone: %s\n", zone_names[policy_zone]);
3066#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07003067}
3068
3069/*
3070 * Helper functions to size the waitqueue hash table.
3071 * Essentially these want to choose hash table sizes sufficiently
3072 * large so that collisions trying to wait on pages are rare.
3073 * But in fact, the number of active page waitqueues on typical
3074 * systems is ridiculously low, less than 200. So this is even
3075 * conservative, even though it seems large.
3076 *
3077 * The constant PAGES_PER_WAITQUEUE specifies the ratio of pages to
3078 * waitqueues, i.e. the size of the waitq table given the number of pages.
3079 */
3080#define PAGES_PER_WAITQUEUE 256
3081
Yasunori Gotocca448f2006-06-23 02:03:10 -07003082#ifndef CONFIG_MEMORY_HOTPLUG
Yasunori Goto02b694d2006-06-23 02:03:08 -07003083static inline unsigned long wait_table_hash_nr_entries(unsigned long pages)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003084{
3085 unsigned long size = 1;
3086
3087 pages /= PAGES_PER_WAITQUEUE;
3088
3089 while (size < pages)
3090 size <<= 1;
3091
3092 /*
3093 * Once we have dozens or even hundreds of threads sleeping
3094 * on IO we've got bigger problems than wait queue collision.
3095 * Limit the size of the wait table to a reasonable size.
3096 */
3097 size = min(size, 4096UL);
3098
3099 return max(size, 4UL);
3100}
Yasunori Gotocca448f2006-06-23 02:03:10 -07003101#else
3102/*
3103 * A zone's size might be changed by hot-add, so it is not possible to determine
3104 * a suitable size for its wait_table. So we use the maximum size now.
3105 *
3106 * The max wait table size = 4096 x sizeof(wait_queue_head_t). ie:
3107 *
3108 * i386 (preemption config) : 4096 x 16 = 64Kbyte.
3109 * ia64, x86-64 (no preemption): 4096 x 20 = 80Kbyte.
3110 * ia64, x86-64 (preemption) : 4096 x 24 = 96Kbyte.
3111 *
3112 * The maximum entries are prepared when a zone's memory is (512K + 256) pages
3113 * or more by the traditional way. (See above). It equals:
3114 *
3115 * i386, x86-64, powerpc(4K page size) : = ( 2G + 1M)byte.
3116 * ia64(16K page size) : = ( 8G + 4M)byte.
3117 * powerpc (64K page size) : = (32G +16M)byte.
3118 */
3119static inline unsigned long wait_table_hash_nr_entries(unsigned long pages)
3120{
3121 return 4096UL;
3122}
3123#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07003124
3125/*
3126 * This is an integer logarithm so that shifts can be used later
3127 * to extract the more random high bits from the multiplicative
3128 * hash function before the remainder is taken.
3129 */
3130static inline unsigned long wait_table_bits(unsigned long size)
3131{
3132 return ffz(~size);
3133}
3134
3135#define LONG_ALIGN(x) (((x)+(sizeof(long))-1)&~((sizeof(long))-1))
3136
Mel Gorman56fd56b2007-10-16 01:25:58 -07003137/*
Mel Gormand9c23402007-10-16 01:26:01 -07003138 * Mark a number of pageblocks as MIGRATE_RESERVE. The number
Mel Gorman41858962009-06-16 15:32:12 -07003139 * of blocks reserved is based on min_wmark_pages(zone). The memory within
3140 * the reserve will tend to store contiguous free pages. Setting min_free_kbytes
Mel Gorman56fd56b2007-10-16 01:25:58 -07003141 * higher will lead to a bigger reserve which will get freed as contiguous
3142 * blocks as reclaim kicks in
3143 */
3144static void setup_zone_migrate_reserve(struct zone *zone)
3145{
3146 unsigned long start_pfn, pfn, end_pfn;
3147 struct page *page;
Mel Gorman78986a62009-09-21 17:03:02 -07003148 unsigned long block_migratetype;
3149 int reserve;
Mel Gorman56fd56b2007-10-16 01:25:58 -07003150
3151 /* Get the start pfn, end pfn and the number of blocks to reserve */
3152 start_pfn = zone->zone_start_pfn;
3153 end_pfn = start_pfn + zone->spanned_pages;
Mel Gorman41858962009-06-16 15:32:12 -07003154 reserve = roundup(min_wmark_pages(zone), pageblock_nr_pages) >>
Mel Gormand9c23402007-10-16 01:26:01 -07003155 pageblock_order;
Mel Gorman56fd56b2007-10-16 01:25:58 -07003156
Mel Gorman78986a62009-09-21 17:03:02 -07003157 /*
3158 * Reserve blocks are generally in place to help high-order atomic
3159 * allocations that are short-lived. A min_free_kbytes value that
3160 * would result in more than 2 reserve blocks for atomic allocations
3161 * is assumed to be in place to help anti-fragmentation for the
3162 * future allocation of hugepages at runtime.
3163 */
3164 reserve = min(2, reserve);
3165
Mel Gormand9c23402007-10-16 01:26:01 -07003166 for (pfn = start_pfn; pfn < end_pfn; pfn += pageblock_nr_pages) {
Mel Gorman56fd56b2007-10-16 01:25:58 -07003167 if (!pfn_valid(pfn))
3168 continue;
3169 page = pfn_to_page(pfn);
3170
Adam Litke344c7902008-09-02 14:35:38 -07003171 /* Watch out for overlapping nodes */
3172 if (page_to_nid(page) != zone_to_nid(zone))
3173 continue;
3174
Mel Gorman56fd56b2007-10-16 01:25:58 -07003175 /* Blocks with reserved pages will never free, skip them. */
3176 if (PageReserved(page))
3177 continue;
3178
3179 block_migratetype = get_pageblock_migratetype(page);
3180
3181 /* If this block is reserved, account for it */
3182 if (reserve > 0 && block_migratetype == MIGRATE_RESERVE) {
3183 reserve--;
3184 continue;
3185 }
3186
3187 /* Suitable for reserving if this block is movable */
3188 if (reserve > 0 && block_migratetype == MIGRATE_MOVABLE) {
3189 set_pageblock_migratetype(page, MIGRATE_RESERVE);
3190 move_freepages_block(zone, page, MIGRATE_RESERVE);
3191 reserve--;
3192 continue;
3193 }
3194
3195 /*
3196 * If the reserve is met and this is a previous reserved block,
3197 * take it back
3198 */
3199 if (block_migratetype == MIGRATE_RESERVE) {
3200 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
3201 move_freepages_block(zone, page, MIGRATE_MOVABLE);
3202 }
3203 }
3204}
Mel Gormanac0e5b72007-10-16 01:25:58 -07003205
Linus Torvalds1da177e2005-04-16 15:20:36 -07003206/*
3207 * Initially all pages are reserved - free ones are freed
3208 * up by free_all_bootmem() once the early boot process is
3209 * done. Non-atomic initialization, single-pass.
3210 */
Matt Tolentinoc09b4242006-01-17 07:03:44 +01003211void __meminit memmap_init_zone(unsigned long size, int nid, unsigned long zone,
Dave Hansena2f3aa02007-01-10 23:15:30 -08003212 unsigned long start_pfn, enum memmap_context context)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003213{
Linus Torvalds1da177e2005-04-16 15:20:36 -07003214 struct page *page;
Andy Whitcroft29751f62005-06-23 00:08:00 -07003215 unsigned long end_pfn = start_pfn + size;
3216 unsigned long pfn;
KAMEZAWA Hiroyuki86051ca2008-04-29 00:58:21 -07003217 struct zone *z;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003218
Hugh Dickins22b31ee2009-01-06 14:40:09 -08003219 if (highest_memmap_pfn < end_pfn - 1)
3220 highest_memmap_pfn = end_pfn - 1;
3221
KAMEZAWA Hiroyuki86051ca2008-04-29 00:58:21 -07003222 z = &NODE_DATA(nid)->node_zones[zone];
Greg Ungerercbe8dd42006-01-12 01:05:24 -08003223 for (pfn = start_pfn; pfn < end_pfn; pfn++) {
Dave Hansena2f3aa02007-01-10 23:15:30 -08003224 /*
3225 * There can be holes in boot-time mem_map[]s
3226 * handed to this function. They do not
3227 * exist on hotplugged memory.
3228 */
3229 if (context == MEMMAP_EARLY) {
3230 if (!early_pfn_valid(pfn))
3231 continue;
3232 if (!early_pfn_in_nid(pfn, nid))
3233 continue;
3234 }
Andy Whitcroftd41dee32005-06-23 00:07:54 -07003235 page = pfn_to_page(pfn);
3236 set_page_links(page, zone, nid, pfn);
Mel Gorman708614e2008-07-23 21:26:51 -07003237 mminit_verify_page_links(page, zone, nid, pfn);
Nick Piggin7835e982006-03-22 00:08:40 -08003238 init_page_count(page);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003239 reset_page_mapcount(page);
3240 SetPageReserved(page);
Mel Gormanb2a0ac82007-10-16 01:25:48 -07003241 /*
3242 * Mark the block movable so that blocks are reserved for
3243 * movable at startup. This will force kernel allocations
3244 * to reserve their blocks rather than leaking throughout
3245 * the address space during boot when many long-lived
Mel Gorman56fd56b2007-10-16 01:25:58 -07003246 * kernel allocations are made. Later some blocks near
3247 * the start are marked MIGRATE_RESERVE by
3248 * setup_zone_migrate_reserve()
KAMEZAWA Hiroyuki86051ca2008-04-29 00:58:21 -07003249 *
3250 * bitmap is created for zone's valid pfn range. but memmap
3251 * can be created for invalid pages (for alignment)
3252 * check here not to call set_pageblock_migratetype() against
3253 * pfn out of zone.
Mel Gormanb2a0ac82007-10-16 01:25:48 -07003254 */
KAMEZAWA Hiroyuki86051ca2008-04-29 00:58:21 -07003255 if ((z->zone_start_pfn <= pfn)
3256 && (pfn < z->zone_start_pfn + z->spanned_pages)
3257 && !(pfn & (pageblock_nr_pages - 1)))
Mel Gorman56fd56b2007-10-16 01:25:58 -07003258 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
Mel Gormanb2a0ac82007-10-16 01:25:48 -07003259
Linus Torvalds1da177e2005-04-16 15:20:36 -07003260 INIT_LIST_HEAD(&page->lru);
3261#ifdef WANT_PAGE_VIRTUAL
3262 /* The shift won't overflow because ZONE_NORMAL is below 4G. */
3263 if (!is_highmem_idx(zone))
Bob Picco3212c6b2005-06-27 14:36:28 -07003264 set_page_address(page, __va(pfn << PAGE_SHIFT));
Linus Torvalds1da177e2005-04-16 15:20:36 -07003265#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07003266 }
3267}
3268
Andi Kleen1e548de2008-02-04 22:29:26 -08003269static void __meminit zone_init_free_lists(struct zone *zone)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003270{
Mel Gormanb2a0ac82007-10-16 01:25:48 -07003271 int order, t;
3272 for_each_migratetype_order(order, t) {
3273 INIT_LIST_HEAD(&zone->free_area[order].free_list[t]);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003274 zone->free_area[order].nr_free = 0;
3275 }
3276}
3277
3278#ifndef __HAVE_ARCH_MEMMAP_INIT
3279#define memmap_init(size, nid, zone, start_pfn) \
Dave Hansena2f3aa02007-01-10 23:15:30 -08003280 memmap_init_zone((size), (nid), (zone), (start_pfn), MEMMAP_EARLY)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003281#endif
3282
Sam Ravnborg1d6f4e62008-01-17 15:21:12 -08003283static int zone_batchsize(struct zone *zone)
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07003284{
David Howells3a6be872009-05-06 16:03:03 -07003285#ifdef CONFIG_MMU
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07003286 int batch;
3287
3288 /*
3289 * The per-cpu-pages pools are set to around 1000th of the
Seth, Rohitba56e912005-10-29 18:15:47 -07003290 * size of the zone. But no more than 1/2 of a meg.
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07003291 *
3292 * OK, so we don't know how big the cache is. So guess.
3293 */
3294 batch = zone->present_pages / 1024;
Seth, Rohitba56e912005-10-29 18:15:47 -07003295 if (batch * PAGE_SIZE > 512 * 1024)
3296 batch = (512 * 1024) / PAGE_SIZE;
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07003297 batch /= 4; /* We effectively *= 4 below */
3298 if (batch < 1)
3299 batch = 1;
3300
3301 /*
Nick Piggin0ceaacc2005-12-04 13:55:25 +11003302 * Clamp the batch to a 2^n - 1 value. Having a power
3303 * of 2 value was found to be more likely to have
3304 * suboptimal cache aliasing properties in some cases.
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07003305 *
Nick Piggin0ceaacc2005-12-04 13:55:25 +11003306 * For example if 2 tasks are alternately allocating
3307 * batches of pages, one task can end up with a lot
3308 * of pages of one half of the possible page colors
3309 * and the other with pages of the other colors.
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07003310 */
David Howells91552032009-05-06 16:03:02 -07003311 batch = rounddown_pow_of_two(batch + batch/2) - 1;
Seth, Rohitba56e912005-10-29 18:15:47 -07003312
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07003313 return batch;
David Howells3a6be872009-05-06 16:03:03 -07003314
3315#else
3316 /* The deferral and batching of frees should be suppressed under NOMMU
3317 * conditions.
3318 *
3319 * The problem is that NOMMU needs to be able to allocate large chunks
3320 * of contiguous memory as there's no hardware page translation to
3321 * assemble apparent contiguous memory from discontiguous pages.
3322 *
3323 * Queueing large contiguous runs of pages for batching, however,
3324 * causes the pages to actually be freed in smaller chunks. As there
3325 * can be a significant delay between the individual batches being
3326 * recycled, this leads to the once large chunks of space being
3327 * fragmented and becoming unavailable for high-order allocations.
3328 */
3329 return 0;
3330#endif
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07003331}
3332
Adrian Bunkb69a7282008-07-23 21:28:12 -07003333static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch)
Christoph Lameter2caaad42005-06-21 17:15:00 -07003334{
3335 struct per_cpu_pages *pcp;
Mel Gorman5f8dcc22009-09-21 17:03:19 -07003336 int migratetype;
Christoph Lameter2caaad42005-06-21 17:15:00 -07003337
Magnus Damm1c6fe942005-10-26 01:58:59 -07003338 memset(p, 0, sizeof(*p));
3339
Christoph Lameter3dfa5722008-02-04 22:29:19 -08003340 pcp = &p->pcp;
Christoph Lameter2caaad42005-06-21 17:15:00 -07003341 pcp->count = 0;
Christoph Lameter2caaad42005-06-21 17:15:00 -07003342 pcp->high = 6 * batch;
3343 pcp->batch = max(1UL, 1 * batch);
Mel Gorman5f8dcc22009-09-21 17:03:19 -07003344 for (migratetype = 0; migratetype < MIGRATE_PCPTYPES; migratetype++)
3345 INIT_LIST_HEAD(&pcp->lists[migratetype]);
Christoph Lameter2caaad42005-06-21 17:15:00 -07003346}
3347
Rohit Seth8ad4b1f2006-01-08 01:00:40 -08003348/*
3349 * setup_pagelist_highmark() sets the high water mark for hot per_cpu_pagelist
3350 * to the value high for the pageset p.
3351 */
3352
3353static void setup_pagelist_highmark(struct per_cpu_pageset *p,
3354 unsigned long high)
3355{
3356 struct per_cpu_pages *pcp;
3357
Christoph Lameter3dfa5722008-02-04 22:29:19 -08003358 pcp = &p->pcp;
Rohit Seth8ad4b1f2006-01-08 01:00:40 -08003359 pcp->high = high;
3360 pcp->batch = max(1UL, high/4);
3361 if ((high/4) > (PAGE_SHIFT * 8))
3362 pcp->batch = PAGE_SHIFT * 8;
3363}
3364
Wu Fengguang319774e2010-05-24 14:32:49 -07003365static __meminit void setup_zone_pageset(struct zone *zone)
3366{
3367 int cpu;
3368
3369 zone->pageset = alloc_percpu(struct per_cpu_pageset);
3370
3371 for_each_possible_cpu(cpu) {
3372 struct per_cpu_pageset *pcp = per_cpu_ptr(zone->pageset, cpu);
3373
3374 setup_pageset(pcp, zone_batchsize(zone));
3375
3376 if (percpu_pagelist_fraction)
3377 setup_pagelist_highmark(pcp,
3378 (zone->present_pages /
3379 percpu_pagelist_fraction));
3380 }
3381}
3382
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07003383/*
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09003384 * Allocate per cpu pagesets and initialize them.
3385 * Before this call only boot pagesets were available.
Christoph Lameter2caaad42005-06-21 17:15:00 -07003386 */
Al Viro78d99552005-12-15 09:18:25 +00003387void __init setup_per_cpu_pageset(void)
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07003388{
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09003389 struct zone *zone;
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07003390
Wu Fengguang319774e2010-05-24 14:32:49 -07003391 for_each_populated_zone(zone)
3392 setup_zone_pageset(zone);
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07003393}
3394
Sam Ravnborg577a32f2007-05-17 23:29:25 +02003395static noinline __init_refok
Yasunori Gotocca448f2006-06-23 02:03:10 -07003396int zone_wait_table_init(struct zone *zone, unsigned long zone_size_pages)
Dave Hansened8ece22005-10-29 18:16:50 -07003397{
3398 int i;
3399 struct pglist_data *pgdat = zone->zone_pgdat;
Yasunori Gotocca448f2006-06-23 02:03:10 -07003400 size_t alloc_size;
Dave Hansened8ece22005-10-29 18:16:50 -07003401
3402 /*
3403 * The per-page waitqueue mechanism uses hashed waitqueues
3404 * per zone.
3405 */
Yasunori Goto02b694d2006-06-23 02:03:08 -07003406 zone->wait_table_hash_nr_entries =
3407 wait_table_hash_nr_entries(zone_size_pages);
3408 zone->wait_table_bits =
3409 wait_table_bits(zone->wait_table_hash_nr_entries);
Yasunori Gotocca448f2006-06-23 02:03:10 -07003410 alloc_size = zone->wait_table_hash_nr_entries
3411 * sizeof(wait_queue_head_t);
3412
Heiko Carstenscd94b9d2008-05-23 13:04:52 -07003413 if (!slab_is_available()) {
Yasunori Gotocca448f2006-06-23 02:03:10 -07003414 zone->wait_table = (wait_queue_head_t *)
3415 alloc_bootmem_node(pgdat, alloc_size);
3416 } else {
3417 /*
3418 * This case means that a zone whose size was 0 gets new memory
3419 * via memory hot-add.
3420 * But it may be the case that a new node was hot-added. In
3421 * this case vmalloc() will not be able to use this new node's
3422 * memory - this wait_table must be initialized to use this new
3423 * node itself as well.
3424 * To use this new node's memory, further consideration will be
3425 * necessary.
3426 */
Jesper Juhl8691f3a2007-10-16 01:24:49 -07003427 zone->wait_table = vmalloc(alloc_size);
Yasunori Gotocca448f2006-06-23 02:03:10 -07003428 }
3429 if (!zone->wait_table)
3430 return -ENOMEM;
Dave Hansened8ece22005-10-29 18:16:50 -07003431
Yasunori Goto02b694d2006-06-23 02:03:08 -07003432 for(i = 0; i < zone->wait_table_hash_nr_entries; ++i)
Dave Hansened8ece22005-10-29 18:16:50 -07003433 init_waitqueue_head(zone->wait_table + i);
Yasunori Gotocca448f2006-06-23 02:03:10 -07003434
3435 return 0;
Dave Hansened8ece22005-10-29 18:16:50 -07003436}
3437
Shaohua Li112067f2009-09-21 17:01:16 -07003438static int __zone_pcp_update(void *data)
3439{
3440 struct zone *zone = data;
3441 int cpu;
3442 unsigned long batch = zone_batchsize(zone), flags;
3443
Thomas Gleixner2d30a1f2010-03-10 15:20:40 -08003444 for_each_possible_cpu(cpu) {
Shaohua Li112067f2009-09-21 17:01:16 -07003445 struct per_cpu_pageset *pset;
3446 struct per_cpu_pages *pcp;
3447
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09003448 pset = per_cpu_ptr(zone->pageset, cpu);
Shaohua Li112067f2009-09-21 17:01:16 -07003449 pcp = &pset->pcp;
3450
3451 local_irq_save(flags);
Mel Gorman5f8dcc22009-09-21 17:03:19 -07003452 free_pcppages_bulk(zone, pcp->count, pcp);
Shaohua Li112067f2009-09-21 17:01:16 -07003453 setup_pageset(pset, batch);
3454 local_irq_restore(flags);
3455 }
3456 return 0;
3457}
3458
3459void zone_pcp_update(struct zone *zone)
3460{
3461 stop_machine(__zone_pcp_update, zone, NULL);
3462}
3463
Matt Tolentinoc09b4242006-01-17 07:03:44 +01003464static __meminit void zone_pcp_init(struct zone *zone)
Dave Hansened8ece22005-10-29 18:16:50 -07003465{
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09003466 /*
3467 * per cpu subsystem is not up at this point. The following code
3468 * relies on the ability of the linker to provide the
3469 * offset of a (static) per cpu variable into the per cpu area.
3470 */
3471 zone->pageset = &boot_pageset;
Dave Hansened8ece22005-10-29 18:16:50 -07003472
Anton Blanchardf5335c02006-03-25 03:06:49 -08003473 if (zone->present_pages)
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09003474 printk(KERN_DEBUG " %s zone: %lu pages, LIFO batch:%u\n",
3475 zone->name, zone->present_pages,
3476 zone_batchsize(zone));
Dave Hansened8ece22005-10-29 18:16:50 -07003477}
3478
Yasunori Goto718127c2006-06-23 02:03:10 -07003479__meminit int init_currently_empty_zone(struct zone *zone,
3480 unsigned long zone_start_pfn,
Dave Hansena2f3aa02007-01-10 23:15:30 -08003481 unsigned long size,
3482 enum memmap_context context)
Dave Hansened8ece22005-10-29 18:16:50 -07003483{
3484 struct pglist_data *pgdat = zone->zone_pgdat;
Yasunori Gotocca448f2006-06-23 02:03:10 -07003485 int ret;
3486 ret = zone_wait_table_init(zone, size);
3487 if (ret)
3488 return ret;
Dave Hansened8ece22005-10-29 18:16:50 -07003489 pgdat->nr_zones = zone_idx(zone) + 1;
3490
Dave Hansened8ece22005-10-29 18:16:50 -07003491 zone->zone_start_pfn = zone_start_pfn;
3492
Mel Gorman708614e2008-07-23 21:26:51 -07003493 mminit_dprintk(MMINIT_TRACE, "memmap_init",
3494 "Initialising map node %d zone %lu pfns %lu -> %lu\n",
3495 pgdat->node_id,
3496 (unsigned long)zone_idx(zone),
3497 zone_start_pfn, (zone_start_pfn + size));
3498
Andi Kleen1e548de2008-02-04 22:29:26 -08003499 zone_init_free_lists(zone);
Yasunori Goto718127c2006-06-23 02:03:10 -07003500
3501 return 0;
Dave Hansened8ece22005-10-29 18:16:50 -07003502}
3503
Mel Gormanc7132162006-09-27 01:49:43 -07003504#ifdef CONFIG_ARCH_POPULATES_NODE_MAP
3505/*
3506 * Basic iterator support. Return the first range of PFNs for a node
3507 * Note: nid == MAX_NUMNODES returns first region regardless of node
3508 */
Yasunori Gotoa3142c82007-05-08 00:23:07 -07003509static int __meminit first_active_region_index_in_nid(int nid)
Mel Gormanc7132162006-09-27 01:49:43 -07003510{
3511 int i;
3512
3513 for (i = 0; i < nr_nodemap_entries; i++)
3514 if (nid == MAX_NUMNODES || early_node_map[i].nid == nid)
3515 return i;
3516
3517 return -1;
3518}
3519
3520/*
3521 * Basic iterator support. Return the next active range of PFNs for a node
Simon Arlott183ff222007-10-20 01:27:18 +02003522 * Note: nid == MAX_NUMNODES returns next region regardless of node
Mel Gormanc7132162006-09-27 01:49:43 -07003523 */
Yasunori Gotoa3142c82007-05-08 00:23:07 -07003524static int __meminit next_active_region_index_in_nid(int index, int nid)
Mel Gormanc7132162006-09-27 01:49:43 -07003525{
3526 for (index = index + 1; index < nr_nodemap_entries; index++)
3527 if (nid == MAX_NUMNODES || early_node_map[index].nid == nid)
3528 return index;
3529
3530 return -1;
3531}
3532
3533#ifndef CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID
3534/*
3535 * Required by SPARSEMEM. Given a PFN, return what node the PFN is on.
3536 * Architectures may implement their own version but if add_active_range()
3537 * was used and there are no special requirements, this is a convenient
3538 * alternative
3539 */
KAMEZAWA Hiroyukif2dbcfa2009-02-18 14:48:32 -08003540int __meminit __early_pfn_to_nid(unsigned long pfn)
Mel Gormanc7132162006-09-27 01:49:43 -07003541{
3542 int i;
3543
3544 for (i = 0; i < nr_nodemap_entries; i++) {
3545 unsigned long start_pfn = early_node_map[i].start_pfn;
3546 unsigned long end_pfn = early_node_map[i].end_pfn;
3547
3548 if (start_pfn <= pfn && pfn < end_pfn)
3549 return early_node_map[i].nid;
3550 }
KAMEZAWA Hiroyukicc2559b2009-02-18 14:48:33 -08003551 /* This is a memory hole */
3552 return -1;
Mel Gormanc7132162006-09-27 01:49:43 -07003553}
3554#endif /* CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID */
3555
KAMEZAWA Hiroyukif2dbcfa2009-02-18 14:48:32 -08003556int __meminit early_pfn_to_nid(unsigned long pfn)
3557{
KAMEZAWA Hiroyukicc2559b2009-02-18 14:48:33 -08003558 int nid;
3559
3560 nid = __early_pfn_to_nid(pfn);
3561 if (nid >= 0)
3562 return nid;
3563 /* just returns 0 */
3564 return 0;
KAMEZAWA Hiroyukif2dbcfa2009-02-18 14:48:32 -08003565}
3566
KAMEZAWA Hiroyukicc2559b2009-02-18 14:48:33 -08003567#ifdef CONFIG_NODES_SPAN_OTHER_NODES
3568bool __meminit early_pfn_in_nid(unsigned long pfn, int node)
3569{
3570 int nid;
3571
3572 nid = __early_pfn_to_nid(pfn);
3573 if (nid >= 0 && nid != node)
3574 return false;
3575 return true;
3576}
3577#endif
KAMEZAWA Hiroyukif2dbcfa2009-02-18 14:48:32 -08003578
Mel Gormanc7132162006-09-27 01:49:43 -07003579/* Basic iterator support to walk early_node_map[] */
3580#define for_each_active_range_index_in_nid(i, nid) \
3581 for (i = first_active_region_index_in_nid(nid); i != -1; \
3582 i = next_active_region_index_in_nid(i, nid))
3583
3584/**
3585 * free_bootmem_with_active_regions - Call free_bootmem_node for each active range
Randy Dunlap88ca3b92006-10-04 02:15:25 -07003586 * @nid: The node to free memory on. If MAX_NUMNODES, all nodes are freed.
3587 * @max_low_pfn: The highest PFN that will be passed to free_bootmem_node
Mel Gormanc7132162006-09-27 01:49:43 -07003588 *
3589 * If an architecture guarantees that all ranges registered with
3590 * add_active_ranges() contain no holes and may be freed, this
3591 * this function may be used instead of calling free_bootmem() manually.
3592 */
3593void __init free_bootmem_with_active_regions(int nid,
3594 unsigned long max_low_pfn)
3595{
3596 int i;
3597
3598 for_each_active_range_index_in_nid(i, nid) {
3599 unsigned long size_pages = 0;
3600 unsigned long end_pfn = early_node_map[i].end_pfn;
3601
3602 if (early_node_map[i].start_pfn >= max_low_pfn)
3603 continue;
3604
3605 if (end_pfn > max_low_pfn)
3606 end_pfn = max_low_pfn;
3607
3608 size_pages = end_pfn - early_node_map[i].start_pfn;
3609 free_bootmem_node(NODE_DATA(early_node_map[i].nid),
3610 PFN_PHYS(early_node_map[i].start_pfn),
3611 size_pages << PAGE_SHIFT);
3612 }
3613}
3614
Yinghai Lu08677212010-02-10 01:20:20 -08003615int __init add_from_early_node_map(struct range *range, int az,
3616 int nr_range, int nid)
3617{
3618 int i;
3619 u64 start, end;
3620
3621 /* need to go over early_node_map to find out good range for node */
3622 for_each_active_range_index_in_nid(i, nid) {
3623 start = early_node_map[i].start_pfn;
3624 end = early_node_map[i].end_pfn;
3625 nr_range = add_range(range, az, nr_range, start, end);
3626 }
3627 return nr_range;
3628}
3629
Yinghai Lu2ee78f72010-02-17 11:29:49 -08003630#ifdef CONFIG_NO_BOOTMEM
Yinghai Lu08677212010-02-10 01:20:20 -08003631void * __init __alloc_memory_core_early(int nid, u64 size, u64 align,
3632 u64 goal, u64 limit)
3633{
3634 int i;
3635 void *ptr;
3636
3637 /* need to go over early_node_map to find out good range for node */
3638 for_each_active_range_index_in_nid(i, nid) {
3639 u64 addr;
3640 u64 ei_start, ei_last;
3641
3642 ei_last = early_node_map[i].end_pfn;
3643 ei_last <<= PAGE_SHIFT;
3644 ei_start = early_node_map[i].start_pfn;
3645 ei_start <<= PAGE_SHIFT;
3646 addr = find_early_area(ei_start, ei_last,
3647 goal, limit, size, align);
3648
3649 if (addr == -1ULL)
3650 continue;
3651
3652#if 0
3653 printk(KERN_DEBUG "alloc (nid=%d %llx - %llx) (%llx - %llx) %llx %llx => %llx\n",
3654 nid,
3655 ei_start, ei_last, goal, limit, size,
3656 align, addr);
3657#endif
3658
3659 ptr = phys_to_virt(addr);
3660 memset(ptr, 0, size);
3661 reserve_early_without_check(addr, addr + size, "BOOTMEM");
3662 return ptr;
3663 }
3664
3665 return NULL;
3666}
Yinghai Lu2ee78f72010-02-17 11:29:49 -08003667#endif
Yinghai Lu08677212010-02-10 01:20:20 -08003668
3669
Yinghai Lub5bc6c02008-06-14 18:32:52 -07003670void __init work_with_active_regions(int nid, work_fn_t work_fn, void *data)
3671{
3672 int i;
Yinghai Lud52d53b2008-06-16 20:10:55 -07003673 int ret;
Yinghai Lub5bc6c02008-06-14 18:32:52 -07003674
Yinghai Lud52d53b2008-06-16 20:10:55 -07003675 for_each_active_range_index_in_nid(i, nid) {
3676 ret = work_fn(early_node_map[i].start_pfn,
3677 early_node_map[i].end_pfn, data);
3678 if (ret)
3679 break;
3680 }
Yinghai Lub5bc6c02008-06-14 18:32:52 -07003681}
Mel Gormanc7132162006-09-27 01:49:43 -07003682/**
3683 * sparse_memory_present_with_active_regions - Call memory_present for each active range
Randy Dunlap88ca3b92006-10-04 02:15:25 -07003684 * @nid: The node to call memory_present for. If MAX_NUMNODES, all nodes will be used.
Mel Gormanc7132162006-09-27 01:49:43 -07003685 *
3686 * If an architecture guarantees that all ranges registered with
3687 * add_active_ranges() contain no holes and may be freed, this
Randy Dunlap88ca3b92006-10-04 02:15:25 -07003688 * function may be used instead of calling memory_present() manually.
Mel Gormanc7132162006-09-27 01:49:43 -07003689 */
3690void __init sparse_memory_present_with_active_regions(int nid)
3691{
3692 int i;
3693
3694 for_each_active_range_index_in_nid(i, nid)
3695 memory_present(early_node_map[i].nid,
3696 early_node_map[i].start_pfn,
3697 early_node_map[i].end_pfn);
3698}
3699
3700/**
3701 * get_pfn_range_for_nid - Return the start and end page frames for a node
Randy Dunlap88ca3b92006-10-04 02:15:25 -07003702 * @nid: The nid to return the range for. If MAX_NUMNODES, the min and max PFN are returned.
3703 * @start_pfn: Passed by reference. On return, it will have the node start_pfn.
3704 * @end_pfn: Passed by reference. On return, it will have the node end_pfn.
Mel Gormanc7132162006-09-27 01:49:43 -07003705 *
3706 * It returns the start and end page frame of a node based on information
3707 * provided by an arch calling add_active_range(). If called for a node
3708 * with no available memory, a warning is printed and the start and end
Randy Dunlap88ca3b92006-10-04 02:15:25 -07003709 * PFNs will be 0.
Mel Gormanc7132162006-09-27 01:49:43 -07003710 */
Yasunori Gotoa3142c82007-05-08 00:23:07 -07003711void __meminit get_pfn_range_for_nid(unsigned int nid,
Mel Gormanc7132162006-09-27 01:49:43 -07003712 unsigned long *start_pfn, unsigned long *end_pfn)
3713{
3714 int i;
3715 *start_pfn = -1UL;
3716 *end_pfn = 0;
3717
3718 for_each_active_range_index_in_nid(i, nid) {
3719 *start_pfn = min(*start_pfn, early_node_map[i].start_pfn);
3720 *end_pfn = max(*end_pfn, early_node_map[i].end_pfn);
3721 }
3722
Christoph Lameter633c0662007-10-16 01:25:37 -07003723 if (*start_pfn == -1UL)
Mel Gormanc7132162006-09-27 01:49:43 -07003724 *start_pfn = 0;
Mel Gormanc7132162006-09-27 01:49:43 -07003725}
3726
3727/*
Mel Gorman2a1e2742007-07-17 04:03:12 -07003728 * This finds a zone that can be used for ZONE_MOVABLE pages. The
3729 * assumption is made that zones within a node are ordered in monotonic
3730 * increasing memory addresses so that the "highest" populated zone is used
3731 */
Adrian Bunkb69a7282008-07-23 21:28:12 -07003732static void __init find_usable_zone_for_movable(void)
Mel Gorman2a1e2742007-07-17 04:03:12 -07003733{
3734 int zone_index;
3735 for (zone_index = MAX_NR_ZONES - 1; zone_index >= 0; zone_index--) {
3736 if (zone_index == ZONE_MOVABLE)
3737 continue;
3738
3739 if (arch_zone_highest_possible_pfn[zone_index] >
3740 arch_zone_lowest_possible_pfn[zone_index])
3741 break;
3742 }
3743
3744 VM_BUG_ON(zone_index == -1);
3745 movable_zone = zone_index;
3746}
3747
3748/*
3749 * The zone ranges provided by the architecture do not include ZONE_MOVABLE
3750 * because it is sized independant of architecture. Unlike the other zones,
3751 * the starting point for ZONE_MOVABLE is not fixed. It may be different
3752 * in each node depending on the size of each node and how evenly kernelcore
3753 * is distributed. This helper function adjusts the zone ranges
3754 * provided by the architecture for a given node by using the end of the
3755 * highest usable zone for ZONE_MOVABLE. This preserves the assumption that
3756 * zones within a node are in order of monotonic increases memory addresses
3757 */
Adrian Bunkb69a7282008-07-23 21:28:12 -07003758static void __meminit adjust_zone_range_for_zone_movable(int nid,
Mel Gorman2a1e2742007-07-17 04:03:12 -07003759 unsigned long zone_type,
3760 unsigned long node_start_pfn,
3761 unsigned long node_end_pfn,
3762 unsigned long *zone_start_pfn,
3763 unsigned long *zone_end_pfn)
3764{
3765 /* Only adjust if ZONE_MOVABLE is on this node */
3766 if (zone_movable_pfn[nid]) {
3767 /* Size ZONE_MOVABLE */
3768 if (zone_type == ZONE_MOVABLE) {
3769 *zone_start_pfn = zone_movable_pfn[nid];
3770 *zone_end_pfn = min(node_end_pfn,
3771 arch_zone_highest_possible_pfn[movable_zone]);
3772
3773 /* Adjust for ZONE_MOVABLE starting within this range */
3774 } else if (*zone_start_pfn < zone_movable_pfn[nid] &&
3775 *zone_end_pfn > zone_movable_pfn[nid]) {
3776 *zone_end_pfn = zone_movable_pfn[nid];
3777
3778 /* Check if this whole range is within ZONE_MOVABLE */
3779 } else if (*zone_start_pfn >= zone_movable_pfn[nid])
3780 *zone_start_pfn = *zone_end_pfn;
3781 }
3782}
3783
3784/*
Mel Gormanc7132162006-09-27 01:49:43 -07003785 * Return the number of pages a zone spans in a node, including holes
3786 * present_pages = zone_spanned_pages_in_node() - zone_absent_pages_in_node()
3787 */
Paul Mundt6ea6e682007-07-15 23:38:20 -07003788static unsigned long __meminit zone_spanned_pages_in_node(int nid,
Mel Gormanc7132162006-09-27 01:49:43 -07003789 unsigned long zone_type,
3790 unsigned long *ignored)
3791{
3792 unsigned long node_start_pfn, node_end_pfn;
3793 unsigned long zone_start_pfn, zone_end_pfn;
3794
3795 /* Get the start and end of the node and zone */
3796 get_pfn_range_for_nid(nid, &node_start_pfn, &node_end_pfn);
3797 zone_start_pfn = arch_zone_lowest_possible_pfn[zone_type];
3798 zone_end_pfn = arch_zone_highest_possible_pfn[zone_type];
Mel Gorman2a1e2742007-07-17 04:03:12 -07003799 adjust_zone_range_for_zone_movable(nid, zone_type,
3800 node_start_pfn, node_end_pfn,
3801 &zone_start_pfn, &zone_end_pfn);
Mel Gormanc7132162006-09-27 01:49:43 -07003802
3803 /* Check that this node has pages within the zone's required range */
3804 if (zone_end_pfn < node_start_pfn || zone_start_pfn > node_end_pfn)
3805 return 0;
3806
3807 /* Move the zone boundaries inside the node if necessary */
3808 zone_end_pfn = min(zone_end_pfn, node_end_pfn);
3809 zone_start_pfn = max(zone_start_pfn, node_start_pfn);
3810
3811 /* Return the spanned pages */
3812 return zone_end_pfn - zone_start_pfn;
3813}
3814
3815/*
3816 * Return the number of holes in a range on a node. If nid is MAX_NUMNODES,
Randy Dunlap88ca3b92006-10-04 02:15:25 -07003817 * then all holes in the requested range will be accounted for.
Mel Gormanc7132162006-09-27 01:49:43 -07003818 */
Yinghai Lu32996252009-12-15 17:59:02 -08003819unsigned long __meminit __absent_pages_in_range(int nid,
Mel Gormanc7132162006-09-27 01:49:43 -07003820 unsigned long range_start_pfn,
3821 unsigned long range_end_pfn)
3822{
3823 int i = 0;
3824 unsigned long prev_end_pfn = 0, hole_pages = 0;
3825 unsigned long start_pfn;
3826
3827 /* Find the end_pfn of the first active range of pfns in the node */
3828 i = first_active_region_index_in_nid(nid);
3829 if (i == -1)
3830 return 0;
3831
Mel Gormanb5445f92007-07-26 10:41:18 -07003832 prev_end_pfn = min(early_node_map[i].start_pfn, range_end_pfn);
3833
Mel Gorman9c7cd682006-09-27 01:49:58 -07003834 /* Account for ranges before physical memory on this node */
3835 if (early_node_map[i].start_pfn > range_start_pfn)
Mel Gormanb5445f92007-07-26 10:41:18 -07003836 hole_pages = prev_end_pfn - range_start_pfn;
Mel Gormanc7132162006-09-27 01:49:43 -07003837
3838 /* Find all holes for the zone within the node */
3839 for (; i != -1; i = next_active_region_index_in_nid(i, nid)) {
3840
3841 /* No need to continue if prev_end_pfn is outside the zone */
3842 if (prev_end_pfn >= range_end_pfn)
3843 break;
3844
3845 /* Make sure the end of the zone is not within the hole */
3846 start_pfn = min(early_node_map[i].start_pfn, range_end_pfn);
3847 prev_end_pfn = max(prev_end_pfn, range_start_pfn);
3848
3849 /* Update the hole size cound and move on */
3850 if (start_pfn > range_start_pfn) {
3851 BUG_ON(prev_end_pfn > start_pfn);
3852 hole_pages += start_pfn - prev_end_pfn;
3853 }
3854 prev_end_pfn = early_node_map[i].end_pfn;
3855 }
3856
Mel Gorman9c7cd682006-09-27 01:49:58 -07003857 /* Account for ranges past physical memory on this node */
3858 if (range_end_pfn > prev_end_pfn)
Mel Gorman0c6cb972006-10-28 10:38:59 -07003859 hole_pages += range_end_pfn -
Mel Gorman9c7cd682006-09-27 01:49:58 -07003860 max(range_start_pfn, prev_end_pfn);
3861
Mel Gormanc7132162006-09-27 01:49:43 -07003862 return hole_pages;
3863}
3864
3865/**
3866 * absent_pages_in_range - Return number of page frames in holes within a range
3867 * @start_pfn: The start PFN to start searching for holes
3868 * @end_pfn: The end PFN to stop searching for holes
3869 *
Randy Dunlap88ca3b92006-10-04 02:15:25 -07003870 * It returns the number of pages frames in memory holes within a range.
Mel Gormanc7132162006-09-27 01:49:43 -07003871 */
3872unsigned long __init absent_pages_in_range(unsigned long start_pfn,
3873 unsigned long end_pfn)
3874{
3875 return __absent_pages_in_range(MAX_NUMNODES, start_pfn, end_pfn);
3876}
3877
3878/* Return the number of page frames in holes in a zone on a node */
Paul Mundt6ea6e682007-07-15 23:38:20 -07003879static unsigned long __meminit zone_absent_pages_in_node(int nid,
Mel Gormanc7132162006-09-27 01:49:43 -07003880 unsigned long zone_type,
3881 unsigned long *ignored)
3882{
Mel Gorman9c7cd682006-09-27 01:49:58 -07003883 unsigned long node_start_pfn, node_end_pfn;
3884 unsigned long zone_start_pfn, zone_end_pfn;
3885
3886 get_pfn_range_for_nid(nid, &node_start_pfn, &node_end_pfn);
3887 zone_start_pfn = max(arch_zone_lowest_possible_pfn[zone_type],
3888 node_start_pfn);
3889 zone_end_pfn = min(arch_zone_highest_possible_pfn[zone_type],
3890 node_end_pfn);
3891
Mel Gorman2a1e2742007-07-17 04:03:12 -07003892 adjust_zone_range_for_zone_movable(nid, zone_type,
3893 node_start_pfn, node_end_pfn,
3894 &zone_start_pfn, &zone_end_pfn);
Mel Gorman9c7cd682006-09-27 01:49:58 -07003895 return __absent_pages_in_range(nid, zone_start_pfn, zone_end_pfn);
Mel Gormanc7132162006-09-27 01:49:43 -07003896}
Mel Gorman0e0b8642006-09-27 01:49:56 -07003897
Mel Gormanc7132162006-09-27 01:49:43 -07003898#else
Paul Mundt6ea6e682007-07-15 23:38:20 -07003899static inline unsigned long __meminit zone_spanned_pages_in_node(int nid,
Mel Gormanc7132162006-09-27 01:49:43 -07003900 unsigned long zone_type,
3901 unsigned long *zones_size)
3902{
3903 return zones_size[zone_type];
3904}
3905
Paul Mundt6ea6e682007-07-15 23:38:20 -07003906static inline unsigned long __meminit zone_absent_pages_in_node(int nid,
Mel Gormanc7132162006-09-27 01:49:43 -07003907 unsigned long zone_type,
3908 unsigned long *zholes_size)
3909{
3910 if (!zholes_size)
3911 return 0;
3912
3913 return zholes_size[zone_type];
3914}
Mel Gorman0e0b8642006-09-27 01:49:56 -07003915
Mel Gormanc7132162006-09-27 01:49:43 -07003916#endif
3917
Yasunori Gotoa3142c82007-05-08 00:23:07 -07003918static void __meminit calculate_node_totalpages(struct pglist_data *pgdat,
Mel Gormanc7132162006-09-27 01:49:43 -07003919 unsigned long *zones_size, unsigned long *zholes_size)
3920{
3921 unsigned long realtotalpages, totalpages = 0;
3922 enum zone_type i;
3923
3924 for (i = 0; i < MAX_NR_ZONES; i++)
3925 totalpages += zone_spanned_pages_in_node(pgdat->node_id, i,
3926 zones_size);
3927 pgdat->node_spanned_pages = totalpages;
3928
3929 realtotalpages = totalpages;
3930 for (i = 0; i < MAX_NR_ZONES; i++)
3931 realtotalpages -=
3932 zone_absent_pages_in_node(pgdat->node_id, i,
3933 zholes_size);
3934 pgdat->node_present_pages = realtotalpages;
3935 printk(KERN_DEBUG "On node %d totalpages: %lu\n", pgdat->node_id,
3936 realtotalpages);
3937}
3938
Mel Gorman835c1342007-10-16 01:25:47 -07003939#ifndef CONFIG_SPARSEMEM
3940/*
3941 * Calculate the size of the zone->blockflags rounded to an unsigned long
Mel Gormand9c23402007-10-16 01:26:01 -07003942 * Start by making sure zonesize is a multiple of pageblock_order by rounding
3943 * up. Then use 1 NR_PAGEBLOCK_BITS worth of bits per pageblock, finally
Mel Gorman835c1342007-10-16 01:25:47 -07003944 * round what is now in bits to nearest long in bits, then return it in
3945 * bytes.
3946 */
3947static unsigned long __init usemap_size(unsigned long zonesize)
3948{
3949 unsigned long usemapsize;
3950
Mel Gormand9c23402007-10-16 01:26:01 -07003951 usemapsize = roundup(zonesize, pageblock_nr_pages);
3952 usemapsize = usemapsize >> pageblock_order;
Mel Gorman835c1342007-10-16 01:25:47 -07003953 usemapsize *= NR_PAGEBLOCK_BITS;
3954 usemapsize = roundup(usemapsize, 8 * sizeof(unsigned long));
3955
3956 return usemapsize / 8;
3957}
3958
3959static void __init setup_usemap(struct pglist_data *pgdat,
3960 struct zone *zone, unsigned long zonesize)
3961{
3962 unsigned long usemapsize = usemap_size(zonesize);
3963 zone->pageblock_flags = NULL;
Julia Lawall58a01a42009-01-06 14:39:28 -08003964 if (usemapsize)
Mel Gorman835c1342007-10-16 01:25:47 -07003965 zone->pageblock_flags = alloc_bootmem_node(pgdat, usemapsize);
Mel Gorman835c1342007-10-16 01:25:47 -07003966}
3967#else
3968static void inline setup_usemap(struct pglist_data *pgdat,
3969 struct zone *zone, unsigned long zonesize) {}
3970#endif /* CONFIG_SPARSEMEM */
3971
Mel Gormand9c23402007-10-16 01:26:01 -07003972#ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
Mel Gormanba72cb82007-11-28 16:21:13 -08003973
3974/* Return a sensible default order for the pageblock size. */
3975static inline int pageblock_default_order(void)
3976{
3977 if (HPAGE_SHIFT > PAGE_SHIFT)
3978 return HUGETLB_PAGE_ORDER;
3979
3980 return MAX_ORDER-1;
3981}
3982
Mel Gormand9c23402007-10-16 01:26:01 -07003983/* Initialise the number of pages represented by NR_PAGEBLOCK_BITS */
3984static inline void __init set_pageblock_order(unsigned int order)
3985{
3986 /* Check that pageblock_nr_pages has not already been setup */
3987 if (pageblock_order)
3988 return;
3989
3990 /*
3991 * Assume the largest contiguous order of interest is a huge page.
3992 * This value may be variable depending on boot parameters on IA64
3993 */
3994 pageblock_order = order;
3995}
3996#else /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
3997
Mel Gormanba72cb82007-11-28 16:21:13 -08003998/*
3999 * When CONFIG_HUGETLB_PAGE_SIZE_VARIABLE is not set, set_pageblock_order()
4000 * and pageblock_default_order() are unused as pageblock_order is set
4001 * at compile-time. See include/linux/pageblock-flags.h for the values of
4002 * pageblock_order based on the kernel config
4003 */
4004static inline int pageblock_default_order(unsigned int order)
4005{
4006 return MAX_ORDER-1;
4007}
Mel Gormand9c23402007-10-16 01:26:01 -07004008#define set_pageblock_order(x) do {} while (0)
4009
4010#endif /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
4011
Linus Torvalds1da177e2005-04-16 15:20:36 -07004012/*
4013 * Set up the zone data structures:
4014 * - mark all pages reserved
4015 * - mark all memory queues empty
4016 * - clear the memory bitmaps
4017 */
Alexander van Heukelumb5a0e012008-02-23 15:24:06 -08004018static void __paginginit free_area_init_core(struct pglist_data *pgdat,
Linus Torvalds1da177e2005-04-16 15:20:36 -07004019 unsigned long *zones_size, unsigned long *zholes_size)
4020{
Christoph Lameter2f1b6242006-09-25 23:31:13 -07004021 enum zone_type j;
Dave Hansened8ece22005-10-29 18:16:50 -07004022 int nid = pgdat->node_id;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004023 unsigned long zone_start_pfn = pgdat->node_start_pfn;
Yasunori Goto718127c2006-06-23 02:03:10 -07004024 int ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004025
Dave Hansen208d54e2005-10-29 18:16:52 -07004026 pgdat_resize_init(pgdat);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004027 pgdat->nr_zones = 0;
4028 init_waitqueue_head(&pgdat->kswapd_wait);
4029 pgdat->kswapd_max_order = 0;
KAMEZAWA Hiroyuki52d4b9a2008-10-18 20:28:16 -07004030 pgdat_page_cgroup_init(pgdat);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004031
4032 for (j = 0; j < MAX_NR_ZONES; j++) {
4033 struct zone *zone = pgdat->node_zones + j;
Mel Gorman0e0b8642006-09-27 01:49:56 -07004034 unsigned long size, realsize, memmap_pages;
Christoph Lameterb69408e2008-10-18 20:26:14 -07004035 enum lru_list l;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004036
Mel Gormanc7132162006-09-27 01:49:43 -07004037 size = zone_spanned_pages_in_node(nid, j, zones_size);
4038 realsize = size - zone_absent_pages_in_node(nid, j,
4039 zholes_size);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004040
Mel Gorman0e0b8642006-09-27 01:49:56 -07004041 /*
4042 * Adjust realsize so that it accounts for how much memory
4043 * is used by this zone for memmap. This affects the watermark
4044 * and per-cpu initialisations
4045 */
Johannes Weinerf7232152008-05-23 13:04:21 -07004046 memmap_pages =
4047 PAGE_ALIGN(size * sizeof(struct page)) >> PAGE_SHIFT;
Mel Gorman0e0b8642006-09-27 01:49:56 -07004048 if (realsize >= memmap_pages) {
4049 realsize -= memmap_pages;
Yinghai Lu5594c8c2009-01-06 14:39:14 -08004050 if (memmap_pages)
4051 printk(KERN_DEBUG
4052 " %s zone: %lu pages used for memmap\n",
4053 zone_names[j], memmap_pages);
Mel Gorman0e0b8642006-09-27 01:49:56 -07004054 } else
4055 printk(KERN_WARNING
4056 " %s zone: %lu pages exceeds realsize %lu\n",
4057 zone_names[j], memmap_pages, realsize);
4058
Christoph Lameter62672762007-02-10 01:43:07 -08004059 /* Account for reserved pages */
4060 if (j == 0 && realsize > dma_reserve) {
Mel Gorman0e0b8642006-09-27 01:49:56 -07004061 realsize -= dma_reserve;
Yinghai Lud903ef92008-10-18 20:27:06 -07004062 printk(KERN_DEBUG " %s zone: %lu pages reserved\n",
Christoph Lameter62672762007-02-10 01:43:07 -08004063 zone_names[0], dma_reserve);
Mel Gorman0e0b8642006-09-27 01:49:56 -07004064 }
4065
Christoph Lameter98d2b0e2006-09-25 23:31:12 -07004066 if (!is_highmem_idx(j))
Linus Torvalds1da177e2005-04-16 15:20:36 -07004067 nr_kernel_pages += realsize;
4068 nr_all_pages += realsize;
4069
4070 zone->spanned_pages = size;
4071 zone->present_pages = realsize;
Christoph Lameter96146342006-07-03 00:24:13 -07004072#ifdef CONFIG_NUMA
Christoph Lameterd5f541e2006-09-27 01:50:08 -07004073 zone->node = nid;
Christoph Lameter8417bba2006-09-25 23:31:51 -07004074 zone->min_unmapped_pages = (realsize*sysctl_min_unmapped_ratio)
Christoph Lameter96146342006-07-03 00:24:13 -07004075 / 100;
Christoph Lameter0ff38492006-09-25 23:31:52 -07004076 zone->min_slab_pages = (realsize * sysctl_min_slab_ratio) / 100;
Christoph Lameter96146342006-07-03 00:24:13 -07004077#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07004078 zone->name = zone_names[j];
4079 spin_lock_init(&zone->lock);
4080 spin_lock_init(&zone->lru_lock);
Dave Hansenbdc8cb92005-10-29 18:16:53 -07004081 zone_seqlock_init(zone);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004082 zone->zone_pgdat = pgdat;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004083
Martin Bligh3bb1a852006-10-28 10:38:24 -07004084 zone->prev_priority = DEF_PRIORITY;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004085
Dave Hansened8ece22005-10-29 18:16:50 -07004086 zone_pcp_init(zone);
Christoph Lameterb69408e2008-10-18 20:26:14 -07004087 for_each_lru(l) {
4088 INIT_LIST_HEAD(&zone->lru[l].list);
Wu Fengguangf8629632009-09-21 17:03:11 -07004089 zone->reclaim_stat.nr_saved_scan[l] = 0;
Christoph Lameterb69408e2008-10-18 20:26:14 -07004090 }
KOSAKI Motohiro6e901572009-01-07 18:08:15 -08004091 zone->reclaim_stat.recent_rotated[0] = 0;
4092 zone->reclaim_stat.recent_rotated[1] = 0;
4093 zone->reclaim_stat.recent_scanned[0] = 0;
4094 zone->reclaim_stat.recent_scanned[1] = 0;
Christoph Lameter2244b952006-06-30 01:55:33 -07004095 zap_zone_vm_stats(zone);
David Rientjese815af92007-10-16 23:25:54 -07004096 zone->flags = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004097 if (!size)
4098 continue;
4099
Mel Gormanba72cb82007-11-28 16:21:13 -08004100 set_pageblock_order(pageblock_default_order());
Mel Gorman835c1342007-10-16 01:25:47 -07004101 setup_usemap(pgdat, zone, size);
Dave Hansena2f3aa02007-01-10 23:15:30 -08004102 ret = init_currently_empty_zone(zone, zone_start_pfn,
4103 size, MEMMAP_EARLY);
Yasunori Goto718127c2006-06-23 02:03:10 -07004104 BUG_ON(ret);
Heiko Carstens76cdd582008-05-14 16:05:52 -07004105 memmap_init(size, nid, j, zone_start_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004106 zone_start_pfn += size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004107 }
4108}
4109
Sam Ravnborg577a32f2007-05-17 23:29:25 +02004110static void __init_refok alloc_node_mem_map(struct pglist_data *pgdat)
Linus Torvalds1da177e2005-04-16 15:20:36 -07004111{
Linus Torvalds1da177e2005-04-16 15:20:36 -07004112 /* Skip empty nodes */
4113 if (!pgdat->node_spanned_pages)
4114 return;
4115
Andy Whitcroftd41dee32005-06-23 00:07:54 -07004116#ifdef CONFIG_FLAT_NODE_MEM_MAP
Linus Torvalds1da177e2005-04-16 15:20:36 -07004117 /* ia64 gets its own node_mem_map, before this, without bootmem */
4118 if (!pgdat->node_mem_map) {
Bob Piccoe984bb42006-05-20 15:00:31 -07004119 unsigned long size, start, end;
Andy Whitcroftd41dee32005-06-23 00:07:54 -07004120 struct page *map;
4121
Bob Piccoe984bb42006-05-20 15:00:31 -07004122 /*
4123 * The zone's endpoints aren't required to be MAX_ORDER
4124 * aligned but the node_mem_map endpoints must be in order
4125 * for the buddy allocator to function correctly.
4126 */
4127 start = pgdat->node_start_pfn & ~(MAX_ORDER_NR_PAGES - 1);
4128 end = pgdat->node_start_pfn + pgdat->node_spanned_pages;
4129 end = ALIGN(end, MAX_ORDER_NR_PAGES);
4130 size = (end - start) * sizeof(struct page);
Dave Hansen6f167ec2005-06-23 00:07:39 -07004131 map = alloc_remap(pgdat->node_id, size);
4132 if (!map)
4133 map = alloc_bootmem_node(pgdat, size);
Bob Piccoe984bb42006-05-20 15:00:31 -07004134 pgdat->node_mem_map = map + (pgdat->node_start_pfn - start);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004135 }
Roman Zippel12d810c2007-05-31 00:40:54 -07004136#ifndef CONFIG_NEED_MULTIPLE_NODES
Linus Torvalds1da177e2005-04-16 15:20:36 -07004137 /*
4138 * With no DISCONTIG, the global mem_map is just set as node 0's
4139 */
Mel Gormanc7132162006-09-27 01:49:43 -07004140 if (pgdat == NODE_DATA(0)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07004141 mem_map = NODE_DATA(0)->node_mem_map;
Mel Gormanc7132162006-09-27 01:49:43 -07004142#ifdef CONFIG_ARCH_POPULATES_NODE_MAP
4143 if (page_to_pfn(mem_map) != pgdat->node_start_pfn)
Thomas Bogendoerfer467bc462008-01-08 15:33:11 -08004144 mem_map -= (pgdat->node_start_pfn - ARCH_PFN_OFFSET);
Mel Gormanc7132162006-09-27 01:49:43 -07004145#endif /* CONFIG_ARCH_POPULATES_NODE_MAP */
4146 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07004147#endif
Andy Whitcroftd41dee32005-06-23 00:07:54 -07004148#endif /* CONFIG_FLAT_NODE_MEM_MAP */
Linus Torvalds1da177e2005-04-16 15:20:36 -07004149}
4150
Johannes Weiner9109fb72008-07-23 21:27:20 -07004151void __paginginit free_area_init_node(int nid, unsigned long *zones_size,
4152 unsigned long node_start_pfn, unsigned long *zholes_size)
Linus Torvalds1da177e2005-04-16 15:20:36 -07004153{
Johannes Weiner9109fb72008-07-23 21:27:20 -07004154 pg_data_t *pgdat = NODE_DATA(nid);
4155
Linus Torvalds1da177e2005-04-16 15:20:36 -07004156 pgdat->node_id = nid;
4157 pgdat->node_start_pfn = node_start_pfn;
Mel Gormanc7132162006-09-27 01:49:43 -07004158 calculate_node_totalpages(pgdat, zones_size, zholes_size);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004159
4160 alloc_node_mem_map(pgdat);
Yinghai Lue8c27ac2008-06-01 13:15:22 -07004161#ifdef CONFIG_FLAT_NODE_MEM_MAP
4162 printk(KERN_DEBUG "free_area_init_node: node %d, pgdat %08lx, node_mem_map %08lx\n",
4163 nid, (unsigned long)pgdat,
4164 (unsigned long)pgdat->node_mem_map);
4165#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07004166
4167 free_area_init_core(pgdat, zones_size, zholes_size);
4168}
4169
Mel Gormanc7132162006-09-27 01:49:43 -07004170#ifdef CONFIG_ARCH_POPULATES_NODE_MAP
Miklos Szeredi418508c2007-05-23 13:57:55 -07004171
4172#if MAX_NUMNODES > 1
4173/*
4174 * Figure out the number of possible node ids.
4175 */
4176static void __init setup_nr_node_ids(void)
4177{
4178 unsigned int node;
4179 unsigned int highest = 0;
4180
4181 for_each_node_mask(node, node_possible_map)
4182 highest = node;
4183 nr_node_ids = highest + 1;
4184}
4185#else
4186static inline void setup_nr_node_ids(void)
4187{
4188}
4189#endif
4190
Mel Gormanc7132162006-09-27 01:49:43 -07004191/**
4192 * add_active_range - Register a range of PFNs backed by physical memory
4193 * @nid: The node ID the range resides on
4194 * @start_pfn: The start PFN of the available physical memory
4195 * @end_pfn: The end PFN of the available physical memory
4196 *
4197 * These ranges are stored in an early_node_map[] and later used by
4198 * free_area_init_nodes() to calculate zone sizes and holes. If the
4199 * range spans a memory hole, it is up to the architecture to ensure
4200 * the memory is not freed by the bootmem allocator. If possible
4201 * the range being registered will be merged with existing ranges.
4202 */
4203void __init add_active_range(unsigned int nid, unsigned long start_pfn,
4204 unsigned long end_pfn)
4205{
4206 int i;
4207
Mel Gorman6b74ab92008-07-23 21:26:49 -07004208 mminit_dprintk(MMINIT_TRACE, "memory_register",
4209 "Entering add_active_range(%d, %#lx, %#lx) "
4210 "%d entries of %d used\n",
4211 nid, start_pfn, end_pfn,
4212 nr_nodemap_entries, MAX_ACTIVE_REGIONS);
Mel Gormanc7132162006-09-27 01:49:43 -07004213
Mel Gorman2dbb51c2008-07-23 21:26:52 -07004214 mminit_validate_memmodel_limits(&start_pfn, &end_pfn);
4215
Mel Gormanc7132162006-09-27 01:49:43 -07004216 /* Merge with existing active regions if possible */
4217 for (i = 0; i < nr_nodemap_entries; i++) {
4218 if (early_node_map[i].nid != nid)
4219 continue;
4220
4221 /* Skip if an existing region covers this new one */
4222 if (start_pfn >= early_node_map[i].start_pfn &&
4223 end_pfn <= early_node_map[i].end_pfn)
4224 return;
4225
4226 /* Merge forward if suitable */
4227 if (start_pfn <= early_node_map[i].end_pfn &&
4228 end_pfn > early_node_map[i].end_pfn) {
4229 early_node_map[i].end_pfn = end_pfn;
4230 return;
4231 }
4232
4233 /* Merge backward if suitable */
Kazuhisa Ichikawad2dbe082010-01-15 17:01:20 -08004234 if (start_pfn < early_node_map[i].start_pfn &&
Mel Gormanc7132162006-09-27 01:49:43 -07004235 end_pfn >= early_node_map[i].start_pfn) {
4236 early_node_map[i].start_pfn = start_pfn;
4237 return;
4238 }
4239 }
4240
4241 /* Check that early_node_map is large enough */
4242 if (i >= MAX_ACTIVE_REGIONS) {
4243 printk(KERN_CRIT "More than %d memory regions, truncating\n",
4244 MAX_ACTIVE_REGIONS);
4245 return;
4246 }
4247
4248 early_node_map[i].nid = nid;
4249 early_node_map[i].start_pfn = start_pfn;
4250 early_node_map[i].end_pfn = end_pfn;
4251 nr_nodemap_entries = i + 1;
4252}
4253
4254/**
Yinghai Lucc1050b2008-06-13 19:08:52 -07004255 * remove_active_range - Shrink an existing registered range of PFNs
Mel Gormanc7132162006-09-27 01:49:43 -07004256 * @nid: The node id the range is on that should be shrunk
Yinghai Lucc1050b2008-06-13 19:08:52 -07004257 * @start_pfn: The new PFN of the range
4258 * @end_pfn: The new PFN of the range
Mel Gormanc7132162006-09-27 01:49:43 -07004259 *
4260 * i386 with NUMA use alloc_remap() to store a node_mem_map on a local node.
Yinghai Lucc1a9d82008-06-08 19:39:16 -07004261 * The map is kept near the end physical page range that has already been
4262 * registered. This function allows an arch to shrink an existing registered
4263 * range.
Mel Gormanc7132162006-09-27 01:49:43 -07004264 */
Yinghai Lucc1050b2008-06-13 19:08:52 -07004265void __init remove_active_range(unsigned int nid, unsigned long start_pfn,
4266 unsigned long end_pfn)
Mel Gormanc7132162006-09-27 01:49:43 -07004267{
Yinghai Lucc1a9d82008-06-08 19:39:16 -07004268 int i, j;
4269 int removed = 0;
Mel Gormanc7132162006-09-27 01:49:43 -07004270
Yinghai Lucc1050b2008-06-13 19:08:52 -07004271 printk(KERN_DEBUG "remove_active_range (%d, %lu, %lu)\n",
4272 nid, start_pfn, end_pfn);
4273
Mel Gormanc7132162006-09-27 01:49:43 -07004274 /* Find the old active region end and shrink */
Yinghai Lucc1a9d82008-06-08 19:39:16 -07004275 for_each_active_range_index_in_nid(i, nid) {
Yinghai Lucc1050b2008-06-13 19:08:52 -07004276 if (early_node_map[i].start_pfn >= start_pfn &&
4277 early_node_map[i].end_pfn <= end_pfn) {
Yinghai Lucc1a9d82008-06-08 19:39:16 -07004278 /* clear it */
Yinghai Lucc1050b2008-06-13 19:08:52 -07004279 early_node_map[i].start_pfn = 0;
Yinghai Lucc1a9d82008-06-08 19:39:16 -07004280 early_node_map[i].end_pfn = 0;
4281 removed = 1;
4282 continue;
Mel Gormanc7132162006-09-27 01:49:43 -07004283 }
Yinghai Lucc1050b2008-06-13 19:08:52 -07004284 if (early_node_map[i].start_pfn < start_pfn &&
4285 early_node_map[i].end_pfn > start_pfn) {
4286 unsigned long temp_end_pfn = early_node_map[i].end_pfn;
4287 early_node_map[i].end_pfn = start_pfn;
4288 if (temp_end_pfn > end_pfn)
4289 add_active_range(nid, end_pfn, temp_end_pfn);
4290 continue;
4291 }
4292 if (early_node_map[i].start_pfn >= start_pfn &&
4293 early_node_map[i].end_pfn > end_pfn &&
4294 early_node_map[i].start_pfn < end_pfn) {
4295 early_node_map[i].start_pfn = end_pfn;
Yinghai Lucc1a9d82008-06-08 19:39:16 -07004296 continue;
4297 }
4298 }
4299
4300 if (!removed)
4301 return;
4302
4303 /* remove the blank ones */
4304 for (i = nr_nodemap_entries - 1; i > 0; i--) {
4305 if (early_node_map[i].nid != nid)
4306 continue;
4307 if (early_node_map[i].end_pfn)
4308 continue;
4309 /* we found it, get rid of it */
4310 for (j = i; j < nr_nodemap_entries - 1; j++)
4311 memcpy(&early_node_map[j], &early_node_map[j+1],
4312 sizeof(early_node_map[j]));
4313 j = nr_nodemap_entries - 1;
4314 memset(&early_node_map[j], 0, sizeof(early_node_map[j]));
4315 nr_nodemap_entries--;
4316 }
Mel Gormanc7132162006-09-27 01:49:43 -07004317}
4318
4319/**
4320 * remove_all_active_ranges - Remove all currently registered regions
Randy Dunlap88ca3b92006-10-04 02:15:25 -07004321 *
Mel Gormanc7132162006-09-27 01:49:43 -07004322 * During discovery, it may be found that a table like SRAT is invalid
4323 * and an alternative discovery method must be used. This function removes
4324 * all currently registered regions.
4325 */
Randy Dunlap88ca3b92006-10-04 02:15:25 -07004326void __init remove_all_active_ranges(void)
Mel Gormanc7132162006-09-27 01:49:43 -07004327{
4328 memset(early_node_map, 0, sizeof(early_node_map));
4329 nr_nodemap_entries = 0;
4330}
4331
4332/* Compare two active node_active_regions */
4333static int __init cmp_node_active_region(const void *a, const void *b)
4334{
4335 struct node_active_region *arange = (struct node_active_region *)a;
4336 struct node_active_region *brange = (struct node_active_region *)b;
4337
4338 /* Done this way to avoid overflows */
4339 if (arange->start_pfn > brange->start_pfn)
4340 return 1;
4341 if (arange->start_pfn < brange->start_pfn)
4342 return -1;
4343
4344 return 0;
4345}
4346
4347/* sort the node_map by start_pfn */
Yinghai Lu32996252009-12-15 17:59:02 -08004348void __init sort_node_map(void)
Mel Gormanc7132162006-09-27 01:49:43 -07004349{
4350 sort(early_node_map, (size_t)nr_nodemap_entries,
4351 sizeof(struct node_active_region),
4352 cmp_node_active_region, NULL);
4353}
4354
Mel Gormana6af2bc2007-02-10 01:42:57 -08004355/* Find the lowest pfn for a node */
Adrian Bunkb69a7282008-07-23 21:28:12 -07004356static unsigned long __init find_min_pfn_for_node(int nid)
Mel Gormanc7132162006-09-27 01:49:43 -07004357{
4358 int i;
Mel Gormana6af2bc2007-02-10 01:42:57 -08004359 unsigned long min_pfn = ULONG_MAX;
Mel Gorman1abbfb42006-11-23 12:01:41 +00004360
Mel Gormanc7132162006-09-27 01:49:43 -07004361 /* Assuming a sorted map, the first range found has the starting pfn */
4362 for_each_active_range_index_in_nid(i, nid)
Mel Gormana6af2bc2007-02-10 01:42:57 -08004363 min_pfn = min(min_pfn, early_node_map[i].start_pfn);
Mel Gormanc7132162006-09-27 01:49:43 -07004364
Mel Gormana6af2bc2007-02-10 01:42:57 -08004365 if (min_pfn == ULONG_MAX) {
4366 printk(KERN_WARNING
Paul Jackson2bc0d262008-06-22 07:22:17 -07004367 "Could not find start_pfn for node %d\n", nid);
Mel Gormana6af2bc2007-02-10 01:42:57 -08004368 return 0;
4369 }
4370
4371 return min_pfn;
Mel Gormanc7132162006-09-27 01:49:43 -07004372}
4373
4374/**
4375 * find_min_pfn_with_active_regions - Find the minimum PFN registered
4376 *
4377 * It returns the minimum PFN based on information provided via
Randy Dunlap88ca3b92006-10-04 02:15:25 -07004378 * add_active_range().
Mel Gormanc7132162006-09-27 01:49:43 -07004379 */
4380unsigned long __init find_min_pfn_with_active_regions(void)
4381{
4382 return find_min_pfn_for_node(MAX_NUMNODES);
4383}
4384
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07004385/*
4386 * early_calculate_totalpages()
4387 * Sum pages in active regions for movable zone.
4388 * Populate N_HIGH_MEMORY for calculating usable_nodes.
4389 */
Adrian Bunk484f51f2007-10-16 01:26:03 -07004390static unsigned long __init early_calculate_totalpages(void)
Mel Gorman7e63efe2007-07-17 04:03:15 -07004391{
4392 int i;
4393 unsigned long totalpages = 0;
4394
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07004395 for (i = 0; i < nr_nodemap_entries; i++) {
4396 unsigned long pages = early_node_map[i].end_pfn -
Mel Gorman7e63efe2007-07-17 04:03:15 -07004397 early_node_map[i].start_pfn;
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07004398 totalpages += pages;
4399 if (pages)
4400 node_set_state(early_node_map[i].nid, N_HIGH_MEMORY);
4401 }
4402 return totalpages;
Mel Gorman7e63efe2007-07-17 04:03:15 -07004403}
4404
Mel Gorman2a1e2742007-07-17 04:03:12 -07004405/*
4406 * Find the PFN the Movable zone begins in each node. Kernel memory
4407 * is spread evenly between nodes as long as the nodes have enough
4408 * memory. When they don't, some nodes will have more kernelcore than
4409 * others
4410 */
Adrian Bunkb69a7282008-07-23 21:28:12 -07004411static void __init find_zone_movable_pfns_for_nodes(unsigned long *movable_pfn)
Mel Gorman2a1e2742007-07-17 04:03:12 -07004412{
4413 int i, nid;
4414 unsigned long usable_startpfn;
4415 unsigned long kernelcore_node, kernelcore_remaining;
Yinghai Lu66918dc2009-06-30 11:41:37 -07004416 /* save the state before borrow the nodemask */
4417 nodemask_t saved_node_state = node_states[N_HIGH_MEMORY];
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07004418 unsigned long totalpages = early_calculate_totalpages();
4419 int usable_nodes = nodes_weight(node_states[N_HIGH_MEMORY]);
Mel Gorman2a1e2742007-07-17 04:03:12 -07004420
Mel Gorman7e63efe2007-07-17 04:03:15 -07004421 /*
4422 * If movablecore was specified, calculate what size of
4423 * kernelcore that corresponds so that memory usable for
4424 * any allocation type is evenly spread. If both kernelcore
4425 * and movablecore are specified, then the value of kernelcore
4426 * will be used for required_kernelcore if it's greater than
4427 * what movablecore would have allowed.
4428 */
4429 if (required_movablecore) {
Mel Gorman7e63efe2007-07-17 04:03:15 -07004430 unsigned long corepages;
4431
4432 /*
4433 * Round-up so that ZONE_MOVABLE is at least as large as what
4434 * was requested by the user
4435 */
4436 required_movablecore =
4437 roundup(required_movablecore, MAX_ORDER_NR_PAGES);
4438 corepages = totalpages - required_movablecore;
4439
4440 required_kernelcore = max(required_kernelcore, corepages);
4441 }
4442
Mel Gorman2a1e2742007-07-17 04:03:12 -07004443 /* If kernelcore was not specified, there is no ZONE_MOVABLE */
4444 if (!required_kernelcore)
Yinghai Lu66918dc2009-06-30 11:41:37 -07004445 goto out;
Mel Gorman2a1e2742007-07-17 04:03:12 -07004446
4447 /* usable_startpfn is the lowest possible pfn ZONE_MOVABLE can be at */
4448 find_usable_zone_for_movable();
4449 usable_startpfn = arch_zone_lowest_possible_pfn[movable_zone];
4450
4451restart:
4452 /* Spread kernelcore memory as evenly as possible throughout nodes */
4453 kernelcore_node = required_kernelcore / usable_nodes;
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07004454 for_each_node_state(nid, N_HIGH_MEMORY) {
Mel Gorman2a1e2742007-07-17 04:03:12 -07004455 /*
4456 * Recalculate kernelcore_node if the division per node
4457 * now exceeds what is necessary to satisfy the requested
4458 * amount of memory for the kernel
4459 */
4460 if (required_kernelcore < kernelcore_node)
4461 kernelcore_node = required_kernelcore / usable_nodes;
4462
4463 /*
4464 * As the map is walked, we track how much memory is usable
4465 * by the kernel using kernelcore_remaining. When it is
4466 * 0, the rest of the node is usable by ZONE_MOVABLE
4467 */
4468 kernelcore_remaining = kernelcore_node;
4469
4470 /* Go through each range of PFNs within this node */
4471 for_each_active_range_index_in_nid(i, nid) {
4472 unsigned long start_pfn, end_pfn;
4473 unsigned long size_pages;
4474
4475 start_pfn = max(early_node_map[i].start_pfn,
4476 zone_movable_pfn[nid]);
4477 end_pfn = early_node_map[i].end_pfn;
4478 if (start_pfn >= end_pfn)
4479 continue;
4480
4481 /* Account for what is only usable for kernelcore */
4482 if (start_pfn < usable_startpfn) {
4483 unsigned long kernel_pages;
4484 kernel_pages = min(end_pfn, usable_startpfn)
4485 - start_pfn;
4486
4487 kernelcore_remaining -= min(kernel_pages,
4488 kernelcore_remaining);
4489 required_kernelcore -= min(kernel_pages,
4490 required_kernelcore);
4491
4492 /* Continue if range is now fully accounted */
4493 if (end_pfn <= usable_startpfn) {
4494
4495 /*
4496 * Push zone_movable_pfn to the end so
4497 * that if we have to rebalance
4498 * kernelcore across nodes, we will
4499 * not double account here
4500 */
4501 zone_movable_pfn[nid] = end_pfn;
4502 continue;
4503 }
4504 start_pfn = usable_startpfn;
4505 }
4506
4507 /*
4508 * The usable PFN range for ZONE_MOVABLE is from
4509 * start_pfn->end_pfn. Calculate size_pages as the
4510 * number of pages used as kernelcore
4511 */
4512 size_pages = end_pfn - start_pfn;
4513 if (size_pages > kernelcore_remaining)
4514 size_pages = kernelcore_remaining;
4515 zone_movable_pfn[nid] = start_pfn + size_pages;
4516
4517 /*
4518 * Some kernelcore has been met, update counts and
4519 * break if the kernelcore for this node has been
4520 * satisified
4521 */
4522 required_kernelcore -= min(required_kernelcore,
4523 size_pages);
4524 kernelcore_remaining -= size_pages;
4525 if (!kernelcore_remaining)
4526 break;
4527 }
4528 }
4529
4530 /*
4531 * If there is still required_kernelcore, we do another pass with one
4532 * less node in the count. This will push zone_movable_pfn[nid] further
4533 * along on the nodes that still have memory until kernelcore is
4534 * satisified
4535 */
4536 usable_nodes--;
4537 if (usable_nodes && required_kernelcore > usable_nodes)
4538 goto restart;
4539
4540 /* Align start of ZONE_MOVABLE on all nids to MAX_ORDER_NR_PAGES */
4541 for (nid = 0; nid < MAX_NUMNODES; nid++)
4542 zone_movable_pfn[nid] =
4543 roundup(zone_movable_pfn[nid], MAX_ORDER_NR_PAGES);
Yinghai Lu66918dc2009-06-30 11:41:37 -07004544
4545out:
4546 /* restore the node_state */
4547 node_states[N_HIGH_MEMORY] = saved_node_state;
Mel Gorman2a1e2742007-07-17 04:03:12 -07004548}
4549
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07004550/* Any regular memory on that node ? */
4551static void check_for_regular_memory(pg_data_t *pgdat)
4552{
4553#ifdef CONFIG_HIGHMEM
4554 enum zone_type zone_type;
4555
4556 for (zone_type = 0; zone_type <= ZONE_NORMAL; zone_type++) {
4557 struct zone *zone = &pgdat->node_zones[zone_type];
4558 if (zone->present_pages)
4559 node_set_state(zone_to_nid(zone), N_NORMAL_MEMORY);
4560 }
4561#endif
4562}
4563
Mel Gormanc7132162006-09-27 01:49:43 -07004564/**
4565 * free_area_init_nodes - Initialise all pg_data_t and zone data
Randy Dunlap88ca3b92006-10-04 02:15:25 -07004566 * @max_zone_pfn: an array of max PFNs for each zone
Mel Gormanc7132162006-09-27 01:49:43 -07004567 *
4568 * This will call free_area_init_node() for each active node in the system.
4569 * Using the page ranges provided by add_active_range(), the size of each
4570 * zone in each node and their holes is calculated. If the maximum PFN
4571 * between two adjacent zones match, it is assumed that the zone is empty.
4572 * For example, if arch_max_dma_pfn == arch_max_dma32_pfn, it is assumed
4573 * that arch_max_dma32_pfn has no pages. It is also assumed that a zone
4574 * starts where the previous one ended. For example, ZONE_DMA32 starts
4575 * at arch_max_dma_pfn.
4576 */
4577void __init free_area_init_nodes(unsigned long *max_zone_pfn)
4578{
4579 unsigned long nid;
Andrew Mortondb991002008-10-15 22:01:07 -07004580 int i;
Mel Gormanc7132162006-09-27 01:49:43 -07004581
Mel Gormana6af2bc2007-02-10 01:42:57 -08004582 /* Sort early_node_map as initialisation assumes it is sorted */
4583 sort_node_map();
4584
Mel Gormanc7132162006-09-27 01:49:43 -07004585 /* Record where the zone boundaries are */
4586 memset(arch_zone_lowest_possible_pfn, 0,
4587 sizeof(arch_zone_lowest_possible_pfn));
4588 memset(arch_zone_highest_possible_pfn, 0,
4589 sizeof(arch_zone_highest_possible_pfn));
4590 arch_zone_lowest_possible_pfn[0] = find_min_pfn_with_active_regions();
4591 arch_zone_highest_possible_pfn[0] = max_zone_pfn[0];
4592 for (i = 1; i < MAX_NR_ZONES; i++) {
Mel Gorman2a1e2742007-07-17 04:03:12 -07004593 if (i == ZONE_MOVABLE)
4594 continue;
Mel Gormanc7132162006-09-27 01:49:43 -07004595 arch_zone_lowest_possible_pfn[i] =
4596 arch_zone_highest_possible_pfn[i-1];
4597 arch_zone_highest_possible_pfn[i] =
4598 max(max_zone_pfn[i], arch_zone_lowest_possible_pfn[i]);
4599 }
Mel Gorman2a1e2742007-07-17 04:03:12 -07004600 arch_zone_lowest_possible_pfn[ZONE_MOVABLE] = 0;
4601 arch_zone_highest_possible_pfn[ZONE_MOVABLE] = 0;
4602
4603 /* Find the PFNs that ZONE_MOVABLE begins at in each node */
4604 memset(zone_movable_pfn, 0, sizeof(zone_movable_pfn));
4605 find_zone_movable_pfns_for_nodes(zone_movable_pfn);
Mel Gormanc7132162006-09-27 01:49:43 -07004606
Mel Gormanc7132162006-09-27 01:49:43 -07004607 /* Print out the zone ranges */
4608 printk("Zone PFN ranges:\n");
Mel Gorman2a1e2742007-07-17 04:03:12 -07004609 for (i = 0; i < MAX_NR_ZONES; i++) {
4610 if (i == ZONE_MOVABLE)
4611 continue;
David Rientjes72f0ba02010-03-05 13:42:14 -08004612 printk(" %-8s ", zone_names[i]);
4613 if (arch_zone_lowest_possible_pfn[i] ==
4614 arch_zone_highest_possible_pfn[i])
4615 printk("empty\n");
4616 else
4617 printk("%0#10lx -> %0#10lx\n",
Mel Gormanc7132162006-09-27 01:49:43 -07004618 arch_zone_lowest_possible_pfn[i],
4619 arch_zone_highest_possible_pfn[i]);
Mel Gorman2a1e2742007-07-17 04:03:12 -07004620 }
4621
4622 /* Print out the PFNs ZONE_MOVABLE begins at in each node */
4623 printk("Movable zone start PFN for each node\n");
4624 for (i = 0; i < MAX_NUMNODES; i++) {
4625 if (zone_movable_pfn[i])
4626 printk(" Node %d: %lu\n", i, zone_movable_pfn[i]);
4627 }
Mel Gormanc7132162006-09-27 01:49:43 -07004628
4629 /* Print out the early_node_map[] */
4630 printk("early_node_map[%d] active PFN ranges\n", nr_nodemap_entries);
4631 for (i = 0; i < nr_nodemap_entries; i++)
Paul Jackson5dab8ec2008-06-25 05:44:40 -07004632 printk(" %3d: %0#10lx -> %0#10lx\n", early_node_map[i].nid,
Mel Gormanc7132162006-09-27 01:49:43 -07004633 early_node_map[i].start_pfn,
4634 early_node_map[i].end_pfn);
4635
4636 /* Initialise every node */
Mel Gorman708614e2008-07-23 21:26:51 -07004637 mminit_verify_pageflags_layout();
Christoph Lameter8ef82862007-02-20 13:57:52 -08004638 setup_nr_node_ids();
Mel Gormanc7132162006-09-27 01:49:43 -07004639 for_each_online_node(nid) {
4640 pg_data_t *pgdat = NODE_DATA(nid);
Johannes Weiner9109fb72008-07-23 21:27:20 -07004641 free_area_init_node(nid, NULL,
Mel Gormanc7132162006-09-27 01:49:43 -07004642 find_min_pfn_for_node(nid), NULL);
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07004643
4644 /* Any memory on that node */
4645 if (pgdat->node_present_pages)
4646 node_set_state(nid, N_HIGH_MEMORY);
4647 check_for_regular_memory(pgdat);
Mel Gormanc7132162006-09-27 01:49:43 -07004648 }
4649}
Mel Gorman2a1e2742007-07-17 04:03:12 -07004650
Mel Gorman7e63efe2007-07-17 04:03:15 -07004651static int __init cmdline_parse_core(char *p, unsigned long *core)
Mel Gorman2a1e2742007-07-17 04:03:12 -07004652{
4653 unsigned long long coremem;
4654 if (!p)
4655 return -EINVAL;
4656
4657 coremem = memparse(p, &p);
Mel Gorman7e63efe2007-07-17 04:03:15 -07004658 *core = coremem >> PAGE_SHIFT;
Mel Gorman2a1e2742007-07-17 04:03:12 -07004659
Mel Gorman7e63efe2007-07-17 04:03:15 -07004660 /* Paranoid check that UL is enough for the coremem value */
Mel Gorman2a1e2742007-07-17 04:03:12 -07004661 WARN_ON((coremem >> PAGE_SHIFT) > ULONG_MAX);
4662
4663 return 0;
4664}
Mel Gormaned7ed362007-07-17 04:03:14 -07004665
Mel Gorman7e63efe2007-07-17 04:03:15 -07004666/*
4667 * kernelcore=size sets the amount of memory for use for allocations that
4668 * cannot be reclaimed or migrated.
4669 */
4670static int __init cmdline_parse_kernelcore(char *p)
4671{
4672 return cmdline_parse_core(p, &required_kernelcore);
4673}
4674
4675/*
4676 * movablecore=size sets the amount of memory for use for allocations that
4677 * can be reclaimed or migrated.
4678 */
4679static int __init cmdline_parse_movablecore(char *p)
4680{
4681 return cmdline_parse_core(p, &required_movablecore);
4682}
4683
Mel Gormaned7ed362007-07-17 04:03:14 -07004684early_param("kernelcore", cmdline_parse_kernelcore);
Mel Gorman7e63efe2007-07-17 04:03:15 -07004685early_param("movablecore", cmdline_parse_movablecore);
Mel Gormaned7ed362007-07-17 04:03:14 -07004686
Mel Gormanc7132162006-09-27 01:49:43 -07004687#endif /* CONFIG_ARCH_POPULATES_NODE_MAP */
4688
Mel Gorman0e0b8642006-09-27 01:49:56 -07004689/**
Randy Dunlap88ca3b92006-10-04 02:15:25 -07004690 * set_dma_reserve - set the specified number of pages reserved in the first zone
4691 * @new_dma_reserve: The number of pages to mark reserved
Mel Gorman0e0b8642006-09-27 01:49:56 -07004692 *
4693 * The per-cpu batchsize and zone watermarks are determined by present_pages.
4694 * In the DMA zone, a significant percentage may be consumed by kernel image
4695 * and other unfreeable allocations which can skew the watermarks badly. This
Randy Dunlap88ca3b92006-10-04 02:15:25 -07004696 * function may optionally be used to account for unfreeable pages in the
4697 * first zone (e.g., ZONE_DMA). The effect will be lower watermarks and
4698 * smaller per-cpu batchsize.
Mel Gorman0e0b8642006-09-27 01:49:56 -07004699 */
4700void __init set_dma_reserve(unsigned long new_dma_reserve)
4701{
4702 dma_reserve = new_dma_reserve;
4703}
4704
Dave Hansen93b75042005-06-23 00:07:47 -07004705#ifndef CONFIG_NEED_MULTIPLE_NODES
Yinghai Lu08677212010-02-10 01:20:20 -08004706struct pglist_data __refdata contig_page_data = {
4707#ifndef CONFIG_NO_BOOTMEM
4708 .bdata = &bootmem_node_data[0]
4709#endif
4710 };
Linus Torvalds1da177e2005-04-16 15:20:36 -07004711EXPORT_SYMBOL(contig_page_data);
Dave Hansen93b75042005-06-23 00:07:47 -07004712#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07004713
4714void __init free_area_init(unsigned long *zones_size)
4715{
Johannes Weiner9109fb72008-07-23 21:27:20 -07004716 free_area_init_node(0, zones_size,
Linus Torvalds1da177e2005-04-16 15:20:36 -07004717 __pa(PAGE_OFFSET) >> PAGE_SHIFT, NULL);
4718}
Linus Torvalds1da177e2005-04-16 15:20:36 -07004719
Linus Torvalds1da177e2005-04-16 15:20:36 -07004720static int page_alloc_cpu_notify(struct notifier_block *self,
4721 unsigned long action, void *hcpu)
4722{
4723 int cpu = (unsigned long)hcpu;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004724
Rafael J. Wysocki8bb78442007-05-09 02:35:10 -07004725 if (action == CPU_DEAD || action == CPU_DEAD_FROZEN) {
Christoph Lameter9f8f2172008-02-04 22:29:11 -08004726 drain_pages(cpu);
4727
4728 /*
4729 * Spill the event counters of the dead processor
4730 * into the current processors event counters.
4731 * This artificially elevates the count of the current
4732 * processor.
4733 */
Christoph Lameterf8891e52006-06-30 01:55:45 -07004734 vm_events_fold_cpu(cpu);
Christoph Lameter9f8f2172008-02-04 22:29:11 -08004735
4736 /*
4737 * Zero the differential counters of the dead processor
4738 * so that the vm statistics are consistent.
4739 *
4740 * This is only okay since the processor is dead and cannot
4741 * race with what we are doing.
4742 */
Christoph Lameter2244b952006-06-30 01:55:33 -07004743 refresh_cpu_vm_stats(cpu);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004744 }
4745 return NOTIFY_OK;
4746}
Linus Torvalds1da177e2005-04-16 15:20:36 -07004747
4748void __init page_alloc_init(void)
4749{
4750 hotcpu_notifier(page_alloc_cpu_notify, 0);
4751}
4752
4753/*
Hideo AOKIcb45b0e2006-04-10 22:52:59 -07004754 * calculate_totalreserve_pages - called when sysctl_lower_zone_reserve_ratio
4755 * or min_free_kbytes changes.
4756 */
4757static void calculate_totalreserve_pages(void)
4758{
4759 struct pglist_data *pgdat;
4760 unsigned long reserve_pages = 0;
Christoph Lameter2f6726e2006-09-25 23:31:18 -07004761 enum zone_type i, j;
Hideo AOKIcb45b0e2006-04-10 22:52:59 -07004762
4763 for_each_online_pgdat(pgdat) {
4764 for (i = 0; i < MAX_NR_ZONES; i++) {
4765 struct zone *zone = pgdat->node_zones + i;
4766 unsigned long max = 0;
4767
4768 /* Find valid and maximum lowmem_reserve in the zone */
4769 for (j = i; j < MAX_NR_ZONES; j++) {
4770 if (zone->lowmem_reserve[j] > max)
4771 max = zone->lowmem_reserve[j];
4772 }
4773
Mel Gorman41858962009-06-16 15:32:12 -07004774 /* we treat the high watermark as reserved pages. */
4775 max += high_wmark_pages(zone);
Hideo AOKIcb45b0e2006-04-10 22:52:59 -07004776
4777 if (max > zone->present_pages)
4778 max = zone->present_pages;
4779 reserve_pages += max;
4780 }
4781 }
4782 totalreserve_pages = reserve_pages;
4783}
4784
4785/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07004786 * setup_per_zone_lowmem_reserve - called whenever
4787 * sysctl_lower_zone_reserve_ratio changes. Ensures that each zone
4788 * has a correct pages reserved value, so an adequate number of
4789 * pages are left in the zone after a successful __alloc_pages().
4790 */
4791static void setup_per_zone_lowmem_reserve(void)
4792{
4793 struct pglist_data *pgdat;
Christoph Lameter2f6726e2006-09-25 23:31:18 -07004794 enum zone_type j, idx;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004795
KAMEZAWA Hiroyukiec936fc2006-03-27 01:15:59 -08004796 for_each_online_pgdat(pgdat) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07004797 for (j = 0; j < MAX_NR_ZONES; j++) {
4798 struct zone *zone = pgdat->node_zones + j;
4799 unsigned long present_pages = zone->present_pages;
4800
4801 zone->lowmem_reserve[j] = 0;
4802
Christoph Lameter2f6726e2006-09-25 23:31:18 -07004803 idx = j;
4804 while (idx) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07004805 struct zone *lower_zone;
4806
Christoph Lameter2f6726e2006-09-25 23:31:18 -07004807 idx--;
4808
Linus Torvalds1da177e2005-04-16 15:20:36 -07004809 if (sysctl_lowmem_reserve_ratio[idx] < 1)
4810 sysctl_lowmem_reserve_ratio[idx] = 1;
4811
4812 lower_zone = pgdat->node_zones + idx;
4813 lower_zone->lowmem_reserve[j] = present_pages /
4814 sysctl_lowmem_reserve_ratio[idx];
4815 present_pages += lower_zone->present_pages;
4816 }
4817 }
4818 }
Hideo AOKIcb45b0e2006-04-10 22:52:59 -07004819
4820 /* update totalreserve_pages */
4821 calculate_totalreserve_pages();
Linus Torvalds1da177e2005-04-16 15:20:36 -07004822}
4823
Randy Dunlap88ca3b92006-10-04 02:15:25 -07004824/**
Minchan Kimbc75d332009-06-16 15:32:48 -07004825 * setup_per_zone_wmarks - called when min_free_kbytes changes
Minchan Kimbce73942009-06-16 15:32:50 -07004826 * or when memory is hot-{added|removed}
Randy Dunlap88ca3b92006-10-04 02:15:25 -07004827 *
Minchan Kimbc75d332009-06-16 15:32:48 -07004828 * Ensures that the watermark[min,low,high] values for each zone are set
4829 * correctly with respect to min_free_kbytes.
Linus Torvalds1da177e2005-04-16 15:20:36 -07004830 */
Minchan Kimbc75d332009-06-16 15:32:48 -07004831void setup_per_zone_wmarks(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -07004832{
4833 unsigned long pages_min = min_free_kbytes >> (PAGE_SHIFT - 10);
4834 unsigned long lowmem_pages = 0;
4835 struct zone *zone;
4836 unsigned long flags;
4837
4838 /* Calculate total number of !ZONE_HIGHMEM pages */
4839 for_each_zone(zone) {
4840 if (!is_highmem(zone))
4841 lowmem_pages += zone->present_pages;
4842 }
4843
4844 for_each_zone(zone) {
Andrew Mortonac924c62006-05-15 09:43:59 -07004845 u64 tmp;
4846
Gerald Schaefer1125b4e2008-10-18 20:27:11 -07004847 spin_lock_irqsave(&zone->lock, flags);
Andrew Mortonac924c62006-05-15 09:43:59 -07004848 tmp = (u64)pages_min * zone->present_pages;
4849 do_div(tmp, lowmem_pages);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004850 if (is_highmem(zone)) {
4851 /*
Nick Piggin669ed172005-11-13 16:06:45 -08004852 * __GFP_HIGH and PF_MEMALLOC allocations usually don't
4853 * need highmem pages, so cap pages_min to a small
4854 * value here.
4855 *
Mel Gorman41858962009-06-16 15:32:12 -07004856 * The WMARK_HIGH-WMARK_LOW and (WMARK_LOW-WMARK_MIN)
Nick Piggin669ed172005-11-13 16:06:45 -08004857 * deltas controls asynch page reclaim, and so should
4858 * not be capped for highmem.
Linus Torvalds1da177e2005-04-16 15:20:36 -07004859 */
4860 int min_pages;
4861
4862 min_pages = zone->present_pages / 1024;
4863 if (min_pages < SWAP_CLUSTER_MAX)
4864 min_pages = SWAP_CLUSTER_MAX;
4865 if (min_pages > 128)
4866 min_pages = 128;
Mel Gorman41858962009-06-16 15:32:12 -07004867 zone->watermark[WMARK_MIN] = min_pages;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004868 } else {
Nick Piggin669ed172005-11-13 16:06:45 -08004869 /*
4870 * If it's a lowmem zone, reserve a number of pages
Linus Torvalds1da177e2005-04-16 15:20:36 -07004871 * proportionate to the zone's size.
4872 */
Mel Gorman41858962009-06-16 15:32:12 -07004873 zone->watermark[WMARK_MIN] = tmp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004874 }
4875
Mel Gorman41858962009-06-16 15:32:12 -07004876 zone->watermark[WMARK_LOW] = min_wmark_pages(zone) + (tmp >> 2);
4877 zone->watermark[WMARK_HIGH] = min_wmark_pages(zone) + (tmp >> 1);
Mel Gorman56fd56b2007-10-16 01:25:58 -07004878 setup_zone_migrate_reserve(zone);
Gerald Schaefer1125b4e2008-10-18 20:27:11 -07004879 spin_unlock_irqrestore(&zone->lock, flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004880 }
Hideo AOKIcb45b0e2006-04-10 22:52:59 -07004881
4882 /* update totalreserve_pages */
4883 calculate_totalreserve_pages();
Linus Torvalds1da177e2005-04-16 15:20:36 -07004884}
4885
Randy Dunlap55a44622009-09-21 17:01:20 -07004886/*
Rik van Riel556adec2008-10-18 20:26:34 -07004887 * The inactive anon list should be small enough that the VM never has to
4888 * do too much work, but large enough that each inactive page has a chance
4889 * to be referenced again before it is swapped out.
4890 *
4891 * The inactive_anon ratio is the target ratio of ACTIVE_ANON to
4892 * INACTIVE_ANON pages on this zone's LRU, maintained by the
4893 * pageout code. A zone->inactive_ratio of 3 means 3:1 or 25% of
4894 * the anonymous pages are kept on the inactive list.
4895 *
4896 * total target max
4897 * memory ratio inactive anon
4898 * -------------------------------------
4899 * 10MB 1 5MB
4900 * 100MB 1 50MB
4901 * 1GB 3 250MB
4902 * 10GB 10 0.9GB
4903 * 100GB 31 3GB
4904 * 1TB 101 10GB
4905 * 10TB 320 32GB
4906 */
Minchan Kim96cb4df2009-06-16 15:32:49 -07004907void calculate_zone_inactive_ratio(struct zone *zone)
4908{
4909 unsigned int gb, ratio;
4910
4911 /* Zone size in gigabytes */
4912 gb = zone->present_pages >> (30 - PAGE_SHIFT);
4913 if (gb)
4914 ratio = int_sqrt(10 * gb);
4915 else
4916 ratio = 1;
4917
4918 zone->inactive_ratio = ratio;
4919}
4920
Cyrill Gorcunove9bb35d2009-06-16 15:32:32 -07004921static void __init setup_per_zone_inactive_ratio(void)
Rik van Riel556adec2008-10-18 20:26:34 -07004922{
4923 struct zone *zone;
4924
Minchan Kim96cb4df2009-06-16 15:32:49 -07004925 for_each_zone(zone)
4926 calculate_zone_inactive_ratio(zone);
Rik van Riel556adec2008-10-18 20:26:34 -07004927}
4928
Linus Torvalds1da177e2005-04-16 15:20:36 -07004929/*
4930 * Initialise min_free_kbytes.
4931 *
4932 * For small machines we want it small (128k min). For large machines
4933 * we want it large (64MB max). But it is not linear, because network
4934 * bandwidth does not increase linearly with machine size. We use
4935 *
4936 * min_free_kbytes = 4 * sqrt(lowmem_kbytes), for better accuracy:
4937 * min_free_kbytes = sqrt(lowmem_kbytes * 16)
4938 *
4939 * which yields
4940 *
4941 * 16MB: 512k
4942 * 32MB: 724k
4943 * 64MB: 1024k
4944 * 128MB: 1448k
4945 * 256MB: 2048k
4946 * 512MB: 2896k
4947 * 1024MB: 4096k
4948 * 2048MB: 5792k
4949 * 4096MB: 8192k
4950 * 8192MB: 11584k
4951 * 16384MB: 16384k
4952 */
Minchan Kimbc75d332009-06-16 15:32:48 -07004953static int __init init_per_zone_wmark_min(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -07004954{
4955 unsigned long lowmem_kbytes;
4956
4957 lowmem_kbytes = nr_free_buffer_pages() * (PAGE_SIZE >> 10);
4958
4959 min_free_kbytes = int_sqrt(lowmem_kbytes * 16);
4960 if (min_free_kbytes < 128)
4961 min_free_kbytes = 128;
4962 if (min_free_kbytes > 65536)
4963 min_free_kbytes = 65536;
Minchan Kimbc75d332009-06-16 15:32:48 -07004964 setup_per_zone_wmarks();
Linus Torvalds1da177e2005-04-16 15:20:36 -07004965 setup_per_zone_lowmem_reserve();
Rik van Riel556adec2008-10-18 20:26:34 -07004966 setup_per_zone_inactive_ratio();
Linus Torvalds1da177e2005-04-16 15:20:36 -07004967 return 0;
4968}
Minchan Kimbc75d332009-06-16 15:32:48 -07004969module_init(init_per_zone_wmark_min)
Linus Torvalds1da177e2005-04-16 15:20:36 -07004970
4971/*
4972 * min_free_kbytes_sysctl_handler - just a wrapper around proc_dointvec() so
4973 * that we can call two helper functions whenever min_free_kbytes
4974 * changes.
4975 */
4976int min_free_kbytes_sysctl_handler(ctl_table *table, int write,
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07004977 void __user *buffer, size_t *length, loff_t *ppos)
Linus Torvalds1da177e2005-04-16 15:20:36 -07004978{
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07004979 proc_dointvec(table, write, buffer, length, ppos);
Mel Gorman3b1d92c2007-05-06 14:49:30 -07004980 if (write)
Minchan Kimbc75d332009-06-16 15:32:48 -07004981 setup_per_zone_wmarks();
Linus Torvalds1da177e2005-04-16 15:20:36 -07004982 return 0;
4983}
4984
Christoph Lameter96146342006-07-03 00:24:13 -07004985#ifdef CONFIG_NUMA
4986int sysctl_min_unmapped_ratio_sysctl_handler(ctl_table *table, int write,
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07004987 void __user *buffer, size_t *length, loff_t *ppos)
Christoph Lameter96146342006-07-03 00:24:13 -07004988{
4989 struct zone *zone;
4990 int rc;
4991
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07004992 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
Christoph Lameter96146342006-07-03 00:24:13 -07004993 if (rc)
4994 return rc;
4995
4996 for_each_zone(zone)
Christoph Lameter8417bba2006-09-25 23:31:51 -07004997 zone->min_unmapped_pages = (zone->present_pages *
Christoph Lameter96146342006-07-03 00:24:13 -07004998 sysctl_min_unmapped_ratio) / 100;
4999 return 0;
5000}
Christoph Lameter0ff38492006-09-25 23:31:52 -07005001
5002int sysctl_min_slab_ratio_sysctl_handler(ctl_table *table, int write,
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07005003 void __user *buffer, size_t *length, loff_t *ppos)
Christoph Lameter0ff38492006-09-25 23:31:52 -07005004{
5005 struct zone *zone;
5006 int rc;
5007
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07005008 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
Christoph Lameter0ff38492006-09-25 23:31:52 -07005009 if (rc)
5010 return rc;
5011
5012 for_each_zone(zone)
5013 zone->min_slab_pages = (zone->present_pages *
5014 sysctl_min_slab_ratio) / 100;
5015 return 0;
5016}
Christoph Lameter96146342006-07-03 00:24:13 -07005017#endif
5018
Linus Torvalds1da177e2005-04-16 15:20:36 -07005019/*
5020 * lowmem_reserve_ratio_sysctl_handler - just a wrapper around
5021 * proc_dointvec() so that we can call setup_per_zone_lowmem_reserve()
5022 * whenever sysctl_lowmem_reserve_ratio changes.
5023 *
5024 * The reserve ratio obviously has absolutely no relation with the
Mel Gorman41858962009-06-16 15:32:12 -07005025 * minimum watermarks. The lowmem reserve ratio can only make sense
Linus Torvalds1da177e2005-04-16 15:20:36 -07005026 * if in function of the boot time zone sizes.
5027 */
5028int lowmem_reserve_ratio_sysctl_handler(ctl_table *table, int write,
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07005029 void __user *buffer, size_t *length, loff_t *ppos)
Linus Torvalds1da177e2005-04-16 15:20:36 -07005030{
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07005031 proc_dointvec_minmax(table, write, buffer, length, ppos);
Linus Torvalds1da177e2005-04-16 15:20:36 -07005032 setup_per_zone_lowmem_reserve();
5033 return 0;
5034}
5035
Rohit Seth8ad4b1f2006-01-08 01:00:40 -08005036/*
5037 * percpu_pagelist_fraction - changes the pcp->high for each zone on each
5038 * cpu. It is the fraction of total pages in each zone that a hot per cpu pagelist
5039 * can have before it gets flushed back to buddy allocator.
5040 */
5041
5042int percpu_pagelist_fraction_sysctl_handler(ctl_table *table, int write,
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07005043 void __user *buffer, size_t *length, loff_t *ppos)
Rohit Seth8ad4b1f2006-01-08 01:00:40 -08005044{
5045 struct zone *zone;
5046 unsigned int cpu;
5047 int ret;
5048
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07005049 ret = proc_dointvec_minmax(table, write, buffer, length, ppos);
Rohit Seth8ad4b1f2006-01-08 01:00:40 -08005050 if (!write || (ret == -EINVAL))
5051 return ret;
Dimitri Sivanich364df0e2009-06-23 12:37:04 -07005052 for_each_populated_zone(zone) {
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09005053 for_each_possible_cpu(cpu) {
Rohit Seth8ad4b1f2006-01-08 01:00:40 -08005054 unsigned long high;
5055 high = zone->present_pages / percpu_pagelist_fraction;
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09005056 setup_pagelist_highmark(
5057 per_cpu_ptr(zone->pageset, cpu), high);
Rohit Seth8ad4b1f2006-01-08 01:00:40 -08005058 }
5059 }
5060 return 0;
5061}
5062
David S. Millerf034b5d2006-08-24 03:08:07 -07005063int hashdist = HASHDIST_DEFAULT;
Linus Torvalds1da177e2005-04-16 15:20:36 -07005064
5065#ifdef CONFIG_NUMA
5066static int __init set_hashdist(char *str)
5067{
5068 if (!str)
5069 return 0;
5070 hashdist = simple_strtoul(str, &str, 0);
5071 return 1;
5072}
5073__setup("hashdist=", set_hashdist);
5074#endif
5075
5076/*
5077 * allocate a large system hash table from bootmem
5078 * - it is assumed that the hash table must contain an exact power-of-2
5079 * quantity of entries
5080 * - limit is the number of hash buckets, not the total allocation size
5081 */
5082void *__init alloc_large_system_hash(const char *tablename,
5083 unsigned long bucketsize,
5084 unsigned long numentries,
5085 int scale,
5086 int flags,
5087 unsigned int *_hash_shift,
5088 unsigned int *_hash_mask,
5089 unsigned long limit)
5090{
5091 unsigned long long max = limit;
5092 unsigned long log2qty, size;
5093 void *table = NULL;
5094
5095 /* allow the kernel cmdline to have a say */
5096 if (!numentries) {
5097 /* round applicable memory size up to nearest megabyte */
Andrew Morton04903662006-12-06 20:37:33 -08005098 numentries = nr_kernel_pages;
Linus Torvalds1da177e2005-04-16 15:20:36 -07005099 numentries += (1UL << (20 - PAGE_SHIFT)) - 1;
5100 numentries >>= 20 - PAGE_SHIFT;
5101 numentries <<= 20 - PAGE_SHIFT;
5102
5103 /* limit to 1 bucket per 2^scale bytes of low memory */
5104 if (scale > PAGE_SHIFT)
5105 numentries >>= (scale - PAGE_SHIFT);
5106 else
5107 numentries <<= (PAGE_SHIFT - scale);
Paul Mundt9ab37b82007-01-05 16:36:30 -08005108
5109 /* Make sure we've got at least a 0-order allocation.. */
Jan Beulich2c85f512009-09-21 17:03:07 -07005110 if (unlikely(flags & HASH_SMALL)) {
5111 /* Makes no sense without HASH_EARLY */
5112 WARN_ON(!(flags & HASH_EARLY));
5113 if (!(numentries >> *_hash_shift)) {
5114 numentries = 1UL << *_hash_shift;
5115 BUG_ON(!numentries);
5116 }
5117 } else if (unlikely((numentries * bucketsize) < PAGE_SIZE))
Paul Mundt9ab37b82007-01-05 16:36:30 -08005118 numentries = PAGE_SIZE / bucketsize;
Linus Torvalds1da177e2005-04-16 15:20:36 -07005119 }
John Hawkes6e692ed2006-03-25 03:08:02 -08005120 numentries = roundup_pow_of_two(numentries);
Linus Torvalds1da177e2005-04-16 15:20:36 -07005121
5122 /* limit allocation size to 1/16 total memory by default */
5123 if (max == 0) {
5124 max = ((unsigned long long)nr_all_pages << PAGE_SHIFT) >> 4;
5125 do_div(max, bucketsize);
5126 }
5127
5128 if (numentries > max)
5129 numentries = max;
5130
David Howellsf0d1b0b2006-12-08 02:37:49 -08005131 log2qty = ilog2(numentries);
Linus Torvalds1da177e2005-04-16 15:20:36 -07005132
5133 do {
5134 size = bucketsize << log2qty;
5135 if (flags & HASH_EARLY)
Jan Beulich74768ed2008-08-12 15:08:39 -07005136 table = alloc_bootmem_nopanic(size);
Linus Torvalds1da177e2005-04-16 15:20:36 -07005137 else if (hashdist)
5138 table = __vmalloc(size, GFP_ATOMIC, PAGE_KERNEL);
5139 else {
Eric Dumazet1037b832007-07-15 23:38:05 -07005140 /*
5141 * If bucketsize is not a power-of-two, we may free
Mel Gormana1dd2682009-06-16 15:32:19 -07005142 * some pages at the end of hash table which
5143 * alloc_pages_exact() automatically does
Eric Dumazet1037b832007-07-15 23:38:05 -07005144 */
Catalin Marinas264ef8a2009-07-07 10:33:01 +01005145 if (get_order(size) < MAX_ORDER) {
Mel Gormana1dd2682009-06-16 15:32:19 -07005146 table = alloc_pages_exact(size, GFP_ATOMIC);
Catalin Marinas264ef8a2009-07-07 10:33:01 +01005147 kmemleak_alloc(table, size, 1, GFP_ATOMIC);
5148 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07005149 }
5150 } while (!table && size > PAGE_SIZE && --log2qty);
5151
5152 if (!table)
5153 panic("Failed to allocate %s hash table\n", tablename);
5154
Dan Alonib49ad482007-07-15 23:38:23 -07005155 printk(KERN_INFO "%s hash table entries: %d (order: %d, %lu bytes)\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -07005156 tablename,
5157 (1U << log2qty),
David Howellsf0d1b0b2006-12-08 02:37:49 -08005158 ilog2(size) - PAGE_SHIFT,
Linus Torvalds1da177e2005-04-16 15:20:36 -07005159 size);
5160
5161 if (_hash_shift)
5162 *_hash_shift = log2qty;
5163 if (_hash_mask)
5164 *_hash_mask = (1 << log2qty) - 1;
5165
5166 return table;
5167}
KAMEZAWA Hiroyukia117e662006-03-27 01:15:25 -08005168
Mel Gorman835c1342007-10-16 01:25:47 -07005169/* Return a pointer to the bitmap storing bits affecting a block of pages */
5170static inline unsigned long *get_pageblock_bitmap(struct zone *zone,
5171 unsigned long pfn)
5172{
5173#ifdef CONFIG_SPARSEMEM
5174 return __pfn_to_section(pfn)->pageblock_flags;
5175#else
5176 return zone->pageblock_flags;
5177#endif /* CONFIG_SPARSEMEM */
5178}
Andrew Morton6220ec72006-10-19 23:29:05 -07005179
Mel Gorman835c1342007-10-16 01:25:47 -07005180static inline int pfn_to_bitidx(struct zone *zone, unsigned long pfn)
5181{
5182#ifdef CONFIG_SPARSEMEM
5183 pfn &= (PAGES_PER_SECTION-1);
Mel Gormand9c23402007-10-16 01:26:01 -07005184 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
Mel Gorman835c1342007-10-16 01:25:47 -07005185#else
5186 pfn = pfn - zone->zone_start_pfn;
Mel Gormand9c23402007-10-16 01:26:01 -07005187 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
Mel Gorman835c1342007-10-16 01:25:47 -07005188#endif /* CONFIG_SPARSEMEM */
5189}
5190
5191/**
Mel Gormand9c23402007-10-16 01:26:01 -07005192 * get_pageblock_flags_group - Return the requested group of flags for the pageblock_nr_pages block of pages
Mel Gorman835c1342007-10-16 01:25:47 -07005193 * @page: The page within the block of interest
5194 * @start_bitidx: The first bit of interest to retrieve
5195 * @end_bitidx: The last bit of interest
5196 * returns pageblock_bits flags
5197 */
5198unsigned long get_pageblock_flags_group(struct page *page,
5199 int start_bitidx, int end_bitidx)
5200{
5201 struct zone *zone;
5202 unsigned long *bitmap;
5203 unsigned long pfn, bitidx;
5204 unsigned long flags = 0;
5205 unsigned long value = 1;
5206
5207 zone = page_zone(page);
5208 pfn = page_to_pfn(page);
5209 bitmap = get_pageblock_bitmap(zone, pfn);
5210 bitidx = pfn_to_bitidx(zone, pfn);
5211
5212 for (; start_bitidx <= end_bitidx; start_bitidx++, value <<= 1)
5213 if (test_bit(bitidx + start_bitidx, bitmap))
5214 flags |= value;
5215
5216 return flags;
5217}
5218
5219/**
Mel Gormand9c23402007-10-16 01:26:01 -07005220 * set_pageblock_flags_group - Set the requested group of flags for a pageblock_nr_pages block of pages
Mel Gorman835c1342007-10-16 01:25:47 -07005221 * @page: The page within the block of interest
5222 * @start_bitidx: The first bit of interest
5223 * @end_bitidx: The last bit of interest
5224 * @flags: The flags to set
5225 */
5226void set_pageblock_flags_group(struct page *page, unsigned long flags,
5227 int start_bitidx, int end_bitidx)
5228{
5229 struct zone *zone;
5230 unsigned long *bitmap;
5231 unsigned long pfn, bitidx;
5232 unsigned long value = 1;
5233
5234 zone = page_zone(page);
5235 pfn = page_to_pfn(page);
5236 bitmap = get_pageblock_bitmap(zone, pfn);
5237 bitidx = pfn_to_bitidx(zone, pfn);
KAMEZAWA Hiroyuki86051ca2008-04-29 00:58:21 -07005238 VM_BUG_ON(pfn < zone->zone_start_pfn);
5239 VM_BUG_ON(pfn >= zone->zone_start_pfn + zone->spanned_pages);
Mel Gorman835c1342007-10-16 01:25:47 -07005240
5241 for (; start_bitidx <= end_bitidx; start_bitidx++, value <<= 1)
5242 if (flags & value)
5243 __set_bit(bitidx + start_bitidx, bitmap);
5244 else
5245 __clear_bit(bitidx + start_bitidx, bitmap);
5246}
KAMEZAWA Hiroyukia5d76b52007-10-16 01:26:11 -07005247
5248/*
5249 * This is designed as sub function...plz see page_isolation.c also.
5250 * set/clear page block's type to be ISOLATE.
5251 * page allocater never alloc memory from ISOLATE block.
5252 */
5253
5254int set_migratetype_isolate(struct page *page)
5255{
5256 struct zone *zone;
Robert Jennings925cc712009-12-17 14:44:38 +00005257 struct page *curr_page;
5258 unsigned long flags, pfn, iter;
5259 unsigned long immobile = 0;
5260 struct memory_isolate_notify arg;
5261 int notifier_ret;
KAMEZAWA Hiroyukia5d76b52007-10-16 01:26:11 -07005262 int ret = -EBUSY;
Shaohua Li8e7e40d2009-09-21 17:01:18 -07005263 int zone_idx;
KAMEZAWA Hiroyukia5d76b52007-10-16 01:26:11 -07005264
5265 zone = page_zone(page);
Shaohua Li8e7e40d2009-09-21 17:01:18 -07005266 zone_idx = zone_idx(zone);
Robert Jennings925cc712009-12-17 14:44:38 +00005267
KAMEZAWA Hiroyukia5d76b52007-10-16 01:26:11 -07005268 spin_lock_irqsave(&zone->lock, flags);
Robert Jennings925cc712009-12-17 14:44:38 +00005269 if (get_pageblock_migratetype(page) == MIGRATE_MOVABLE ||
5270 zone_idx == ZONE_MOVABLE) {
5271 ret = 0;
KAMEZAWA Hiroyukia5d76b52007-10-16 01:26:11 -07005272 goto out;
Robert Jennings925cc712009-12-17 14:44:38 +00005273 }
5274
5275 pfn = page_to_pfn(page);
5276 arg.start_pfn = pfn;
5277 arg.nr_pages = pageblock_nr_pages;
5278 arg.pages_found = 0;
5279
5280 /*
5281 * It may be possible to isolate a pageblock even if the
5282 * migratetype is not MIGRATE_MOVABLE. The memory isolation
5283 * notifier chain is used by balloon drivers to return the
5284 * number of pages in a range that are held by the balloon
5285 * driver to shrink memory. If all the pages are accounted for
5286 * by balloons, are free, or on the LRU, isolation can continue.
5287 * Later, for example, when memory hotplug notifier runs, these
5288 * pages reported as "can be isolated" should be isolated(freed)
5289 * by the balloon driver through the memory notifier chain.
5290 */
5291 notifier_ret = memory_isolate_notify(MEM_ISOLATE_COUNT, &arg);
5292 notifier_ret = notifier_to_errno(notifier_ret);
5293 if (notifier_ret || !arg.pages_found)
5294 goto out;
5295
5296 for (iter = pfn; iter < (pfn + pageblock_nr_pages); iter++) {
5297 if (!pfn_valid_within(pfn))
5298 continue;
5299
5300 curr_page = pfn_to_page(iter);
5301 if (!page_count(curr_page) || PageLRU(curr_page))
5302 continue;
5303
5304 immobile++;
5305 }
5306
5307 if (arg.pages_found == immobile)
5308 ret = 0;
5309
KAMEZAWA Hiroyukia5d76b52007-10-16 01:26:11 -07005310out:
Robert Jennings925cc712009-12-17 14:44:38 +00005311 if (!ret) {
5312 set_pageblock_migratetype(page, MIGRATE_ISOLATE);
5313 move_freepages_block(zone, page, MIGRATE_ISOLATE);
5314 }
5315
KAMEZAWA Hiroyukia5d76b52007-10-16 01:26:11 -07005316 spin_unlock_irqrestore(&zone->lock, flags);
5317 if (!ret)
Christoph Lameter9f8f2172008-02-04 22:29:11 -08005318 drain_all_pages();
KAMEZAWA Hiroyukia5d76b52007-10-16 01:26:11 -07005319 return ret;
5320}
5321
5322void unset_migratetype_isolate(struct page *page)
5323{
5324 struct zone *zone;
5325 unsigned long flags;
5326 zone = page_zone(page);
5327 spin_lock_irqsave(&zone->lock, flags);
5328 if (get_pageblock_migratetype(page) != MIGRATE_ISOLATE)
5329 goto out;
5330 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
5331 move_freepages_block(zone, page, MIGRATE_MOVABLE);
5332out:
5333 spin_unlock_irqrestore(&zone->lock, flags);
5334}
KAMEZAWA Hiroyuki0c0e6192007-10-16 01:26:12 -07005335
5336#ifdef CONFIG_MEMORY_HOTREMOVE
5337/*
5338 * All pages in the range must be isolated before calling this.
5339 */
5340void
5341__offline_isolated_pages(unsigned long start_pfn, unsigned long end_pfn)
5342{
5343 struct page *page;
5344 struct zone *zone;
5345 int order, i;
5346 unsigned long pfn;
5347 unsigned long flags;
5348 /* find the first valid pfn */
5349 for (pfn = start_pfn; pfn < end_pfn; pfn++)
5350 if (pfn_valid(pfn))
5351 break;
5352 if (pfn == end_pfn)
5353 return;
5354 zone = page_zone(pfn_to_page(pfn));
5355 spin_lock_irqsave(&zone->lock, flags);
5356 pfn = start_pfn;
5357 while (pfn < end_pfn) {
5358 if (!pfn_valid(pfn)) {
5359 pfn++;
5360 continue;
5361 }
5362 page = pfn_to_page(pfn);
5363 BUG_ON(page_count(page));
5364 BUG_ON(!PageBuddy(page));
5365 order = page_order(page);
5366#ifdef CONFIG_DEBUG_VM
5367 printk(KERN_INFO "remove from free list %lx %d %lx\n",
5368 pfn, 1 << order, end_pfn);
5369#endif
5370 list_del(&page->lru);
5371 rmv_page_order(page);
5372 zone->free_area[order].nr_free--;
5373 __mod_zone_page_state(zone, NR_FREE_PAGES,
5374 - (1UL << order));
5375 for (i = 0; i < (1 << order); i++)
5376 SetPageReserved((page+i));
5377 pfn += (1 << order);
5378 }
5379 spin_unlock_irqrestore(&zone->lock, flags);
5380}
5381#endif
Wu Fengguang8d22ba12009-12-16 12:19:58 +01005382
5383#ifdef CONFIG_MEMORY_FAILURE
5384bool is_free_buddy_page(struct page *page)
5385{
5386 struct zone *zone = page_zone(page);
5387 unsigned long pfn = page_to_pfn(page);
5388 unsigned long flags;
5389 int order;
5390
5391 spin_lock_irqsave(&zone->lock, flags);
5392 for (order = 0; order < MAX_ORDER; order++) {
5393 struct page *page_head = page - (pfn & ((1 << order) - 1));
5394
5395 if (PageBuddy(page_head) && page_order(page_head) >= order)
5396 break;
5397 }
5398 spin_unlock_irqrestore(&zone->lock, flags);
5399
5400 return order < MAX_ORDER;
5401}
5402#endif
Wu Fengguang718a3822010-03-10 15:20:43 -08005403
5404static struct trace_print_flags pageflag_names[] = {
5405 {1UL << PG_locked, "locked" },
5406 {1UL << PG_error, "error" },
5407 {1UL << PG_referenced, "referenced" },
5408 {1UL << PG_uptodate, "uptodate" },
5409 {1UL << PG_dirty, "dirty" },
5410 {1UL << PG_lru, "lru" },
5411 {1UL << PG_active, "active" },
5412 {1UL << PG_slab, "slab" },
5413 {1UL << PG_owner_priv_1, "owner_priv_1" },
5414 {1UL << PG_arch_1, "arch_1" },
5415 {1UL << PG_reserved, "reserved" },
5416 {1UL << PG_private, "private" },
5417 {1UL << PG_private_2, "private_2" },
5418 {1UL << PG_writeback, "writeback" },
5419#ifdef CONFIG_PAGEFLAGS_EXTENDED
5420 {1UL << PG_head, "head" },
5421 {1UL << PG_tail, "tail" },
5422#else
5423 {1UL << PG_compound, "compound" },
5424#endif
5425 {1UL << PG_swapcache, "swapcache" },
5426 {1UL << PG_mappedtodisk, "mappedtodisk" },
5427 {1UL << PG_reclaim, "reclaim" },
5428 {1UL << PG_buddy, "buddy" },
5429 {1UL << PG_swapbacked, "swapbacked" },
5430 {1UL << PG_unevictable, "unevictable" },
5431#ifdef CONFIG_MMU
5432 {1UL << PG_mlocked, "mlocked" },
5433#endif
5434#ifdef CONFIG_ARCH_USES_PG_UNCACHED
5435 {1UL << PG_uncached, "uncached" },
5436#endif
5437#ifdef CONFIG_MEMORY_FAILURE
5438 {1UL << PG_hwpoison, "hwpoison" },
5439#endif
5440 {-1UL, NULL },
5441};
5442
5443static void dump_page_flags(unsigned long flags)
5444{
5445 const char *delim = "";
5446 unsigned long mask;
5447 int i;
5448
5449 printk(KERN_ALERT "page flags: %#lx(", flags);
5450
5451 /* remove zone id */
5452 flags &= (1UL << NR_PAGEFLAGS) - 1;
5453
5454 for (i = 0; pageflag_names[i].name && flags; i++) {
5455
5456 mask = pageflag_names[i].mask;
5457 if ((flags & mask) != mask)
5458 continue;
5459
5460 flags &= ~mask;
5461 printk("%s%s", delim, pageflag_names[i].name);
5462 delim = "|";
5463 }
5464
5465 /* check for left over flags */
5466 if (flags)
5467 printk("%s%#lx", delim, flags);
5468
5469 printk(")\n");
5470}
5471
5472void dump_page(struct page *page)
5473{
5474 printk(KERN_ALERT
5475 "page:%p count:%d mapcount:%d mapping:%p index:%#lx\n",
5476 page, page_count(page), page_mapcount(page),
5477 page->mapping, page->index);
5478 dump_page_flags(page->flags);
5479}