blob: 580a5f075ed0ab6e3047351a8271b1f053e35774 [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>
Yinghai Luedbe7d22010-08-25 13:39:16 -070024#include <linux/memblock.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070025#include <linux/compiler.h>
Randy Dunlap9f158332005-09-13 01:25:16 -070026#include <linux/kernel.h>
Vegard Nossumb1eeab62008-11-25 16:55:53 +010027#include <linux/kmemcheck.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070028#include <linux/module.h>
29#include <linux/suspend.h>
30#include <linux/pagevec.h>
31#include <linux/blkdev.h>
32#include <linux/slab.h>
Dave Hansena238ab52011-05-24 17:12:16 -070033#include <linux/ratelimit.h>
David Rientjes5a3135c22007-10-16 23:25:53 -070034#include <linux/oom.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070035#include <linux/notifier.h>
36#include <linux/topology.h>
37#include <linux/sysctl.h>
38#include <linux/cpu.h>
39#include <linux/cpuset.h>
Dave Hansenbdc8cb92005-10-29 18:16:53 -070040#include <linux/memory_hotplug.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070041#include <linux/nodemask.h>
42#include <linux/vmalloc.h>
KOSAKI Motohiroa6cccdc2011-05-24 17:11:33 -070043#include <linux/vmstat.h>
Christoph Lameter4be38e32006-01-06 00:11:17 -080044#include <linux/mempolicy.h>
Yasunori Goto68113782006-06-23 02:03:11 -070045#include <linux/stop_machine.h>
Mel Gormanc7132162006-09-27 01:49:43 -070046#include <linux/sort.h>
47#include <linux/pfn.h>
Andrew Morton3fcfab12006-10-19 23:28:16 -070048#include <linux/backing-dev.h>
Akinobu Mita933e3122006-12-08 02:39:45 -080049#include <linux/fault-inject.h>
KAMEZAWA Hiroyukia5d76b52007-10-16 01:26:11 -070050#include <linux/page-isolation.h>
KAMEZAWA Hiroyuki52d4b9a2008-10-18 20:28:16 -070051#include <linux/page_cgroup.h>
Thomas Gleixner3ac7fe52008-04-30 00:55:01 -070052#include <linux/debugobjects.h>
Catalin Marinasdbb1f812009-06-11 13:23:19 +010053#include <linux/kmemleak.h>
Mel Gorman56de7262010-05-24 14:32:30 -070054#include <linux/compaction.h>
Mel Gorman0d3d0622009-09-21 17:02:44 -070055#include <trace/events/kmem.h>
Wu Fengguang718a3822010-03-10 15:20:43 -080056#include <linux/ftrace_event.h>
Daisuke Nishimuraf212ad72011-03-23 16:42:25 -070057#include <linux/memcontrol.h>
Linus Torvalds268bb0c2011-05-20 12:50:29 -070058#include <linux/prefetch.h>
Lisa Du6e543d52013-09-11 14:22:36 -070059#include <linux/mm_inline.h>
Michal Nazarewicz041d3a82011-12-29 13:09:50 +010060#include <linux/migrate.h>
Stanislaw Gruszkac0a32fc52012-01-10 15:07:28 -080061#include <linux/page-debug-flags.h>
David Rientjes949f7ec2013-04-29 15:07:48 -070062#include <linux/hugetlb.h>
Clark Williams8bd75c72013-02-07 09:47:07 -060063#include <linux/sched/rt.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070064
Jiang Liu7ee3d4e2013-07-03 15:03:41 -070065#include <asm/sections.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070066#include <asm/tlbflush.h>
Andrew Mortonac924c62006-05-15 09:43:59 -070067#include <asm/div64.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070068#include "internal.h"
69
Cody P Schaferc8e251f2013-07-03 15:01:29 -070070/* prevent >1 _updater_ of zone percpu pageset ->high and ->batch fields */
71static DEFINE_MUTEX(pcp_batch_high_lock);
72
Lee Schermerhorn72812012010-05-26 14:44:56 -070073#ifdef CONFIG_USE_PERCPU_NUMA_NODE_ID
74DEFINE_PER_CPU(int, numa_node);
75EXPORT_PER_CPU_SYMBOL(numa_node);
76#endif
77
Lee Schermerhorn7aac7892010-05-26 14:45:00 -070078#ifdef CONFIG_HAVE_MEMORYLESS_NODES
79/*
80 * N.B., Do NOT reference the '_numa_mem_' per cpu variable directly.
81 * It will not be defined when CONFIG_HAVE_MEMORYLESS_NODES is not defined.
82 * Use the accessor functions set_numa_mem(), numa_mem_id() and cpu_to_mem()
83 * defined in <linux/topology.h>.
84 */
85DEFINE_PER_CPU(int, _numa_mem_); /* Kernel "local memory" node */
86EXPORT_PER_CPU_SYMBOL(_numa_mem_);
87#endif
88
Linus Torvalds1da177e2005-04-16 15:20:36 -070089/*
Christoph Lameter13808912007-10-16 01:25:27 -070090 * Array of node states.
Linus Torvalds1da177e2005-04-16 15:20:36 -070091 */
Christoph Lameter13808912007-10-16 01:25:27 -070092nodemask_t node_states[NR_NODE_STATES] __read_mostly = {
93 [N_POSSIBLE] = NODE_MASK_ALL,
94 [N_ONLINE] = { { [0] = 1UL } },
95#ifndef CONFIG_NUMA
96 [N_NORMAL_MEMORY] = { { [0] = 1UL } },
97#ifdef CONFIG_HIGHMEM
98 [N_HIGH_MEMORY] = { { [0] = 1UL } },
99#endif
Lai Jiangshan20b2f522012-12-12 13:52:00 -0800100#ifdef CONFIG_MOVABLE_NODE
101 [N_MEMORY] = { { [0] = 1UL } },
102#endif
Christoph Lameter13808912007-10-16 01:25:27 -0700103 [N_CPU] = { { [0] = 1UL } },
104#endif /* NUMA */
105};
106EXPORT_SYMBOL(node_states);
107
Jiang Liuc3d5f5f2013-07-03 15:03:14 -0700108/* Protect totalram_pages and zone->managed_pages */
109static DEFINE_SPINLOCK(managed_page_count_lock);
110
Ravikiran G Thirumalai6c231b72005-09-06 15:17:45 -0700111unsigned long totalram_pages __read_mostly;
Hideo AOKIcb45b0e2006-04-10 22:52:59 -0700112unsigned long totalreserve_pages __read_mostly;
Johannes Weinerab8fabd2012-01-10 15:07:42 -0800113/*
114 * When calculating the number of globally allowed dirty pages, there
115 * is a certain number of per-zone reserves that should not be
116 * considered dirtyable memory. This is the sum of those reserves
117 * over all existing zones that contribute dirtyable memory.
118 */
119unsigned long dirty_balance_reserve __read_mostly;
120
Hugh Dickins1b76b022012-05-11 01:00:07 -0700121int percpu_pagelist_fraction;
Benjamin Herrenschmidtdcce2842009-06-18 13:24:12 +1000122gfp_t gfp_allowed_mask __read_mostly = GFP_BOOT_MASK;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700123
Rafael J. Wysocki452aa692010-03-05 13:42:13 -0800124#ifdef CONFIG_PM_SLEEP
125/*
126 * The following functions are used by the suspend/hibernate code to temporarily
127 * change gfp_allowed_mask in order to avoid using I/O during memory allocations
128 * while devices are suspended. To avoid races with the suspend/hibernate code,
129 * they should always be called with pm_mutex held (gfp_allowed_mask also should
130 * only be modified with pm_mutex held, unless the suspend/hibernate code is
131 * guaranteed not to run in parallel with that modification).
132 */
Rafael J. Wysockic9e664f2010-12-03 22:57:45 +0100133
134static gfp_t saved_gfp_mask;
135
136void pm_restore_gfp_mask(void)
Rafael J. Wysocki452aa692010-03-05 13:42:13 -0800137{
138 WARN_ON(!mutex_is_locked(&pm_mutex));
Rafael J. Wysockic9e664f2010-12-03 22:57:45 +0100139 if (saved_gfp_mask) {
140 gfp_allowed_mask = saved_gfp_mask;
141 saved_gfp_mask = 0;
142 }
Rafael J. Wysocki452aa692010-03-05 13:42:13 -0800143}
144
Rafael J. Wysockic9e664f2010-12-03 22:57:45 +0100145void pm_restrict_gfp_mask(void)
Rafael J. Wysocki452aa692010-03-05 13:42:13 -0800146{
Rafael J. Wysocki452aa692010-03-05 13:42:13 -0800147 WARN_ON(!mutex_is_locked(&pm_mutex));
Rafael J. Wysockic9e664f2010-12-03 22:57:45 +0100148 WARN_ON(saved_gfp_mask);
149 saved_gfp_mask = gfp_allowed_mask;
150 gfp_allowed_mask &= ~GFP_IOFS;
Rafael J. Wysocki452aa692010-03-05 13:42:13 -0800151}
Mel Gormanf90ac392012-01-10 15:07:15 -0800152
153bool pm_suspended_storage(void)
154{
155 if ((gfp_allowed_mask & GFP_IOFS) == GFP_IOFS)
156 return false;
157 return true;
158}
Rafael J. Wysocki452aa692010-03-05 13:42:13 -0800159#endif /* CONFIG_PM_SLEEP */
160
Mel Gormand9c23402007-10-16 01:26:01 -0700161#ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
162int pageblock_order __read_mostly;
163#endif
164
Hugh Dickinsd98c7a02006-02-14 13:52:59 -0800165static void __free_pages_ok(struct page *page, unsigned int order);
David Howellsa226f6c2006-01-06 00:11:08 -0800166
Linus Torvalds1da177e2005-04-16 15:20:36 -0700167/*
168 * results with 256, 32 in the lowmem_reserve sysctl:
169 * 1G machine -> (16M dma, 800M-16M normal, 1G-800M high)
170 * 1G machine -> (16M dma, 784M normal, 224M high)
171 * NORMAL allocation will leave 784M/256 of ram reserved in the ZONE_DMA
172 * HIGHMEM allocation will leave 224M/32 of ram reserved in ZONE_NORMAL
173 * HIGHMEM allocation will (224M+784M)/256 of ram reserved in ZONE_DMA
Andi Kleena2f1b422005-11-05 17:25:53 +0100174 *
175 * TBD: should special case ZONE_DMA32 machines here - in those we normally
176 * don't need any ZONE_NORMAL reservation
Linus Torvalds1da177e2005-04-16 15:20:36 -0700177 */
Christoph Lameter2f1b6242006-09-25 23:31:13 -0700178int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES-1] = {
Christoph Lameter4b51d662007-02-10 01:43:10 -0800179#ifdef CONFIG_ZONE_DMA
Christoph Lameter2f1b6242006-09-25 23:31:13 -0700180 256,
Christoph Lameter4b51d662007-02-10 01:43:10 -0800181#endif
Christoph Lameterfb0e7942006-09-25 23:31:13 -0700182#ifdef CONFIG_ZONE_DMA32
Christoph Lameter2f1b6242006-09-25 23:31:13 -0700183 256,
Christoph Lameterfb0e7942006-09-25 23:31:13 -0700184#endif
Christoph Lametere53ef382006-09-25 23:31:14 -0700185#ifdef CONFIG_HIGHMEM
Mel Gorman2a1e2742007-07-17 04:03:12 -0700186 32,
Christoph Lametere53ef382006-09-25 23:31:14 -0700187#endif
Mel Gorman2a1e2742007-07-17 04:03:12 -0700188 32,
Christoph Lameter2f1b6242006-09-25 23:31:13 -0700189};
Linus Torvalds1da177e2005-04-16 15:20:36 -0700190
191EXPORT_SYMBOL(totalram_pages);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700192
Helge Deller15ad7cd2006-12-06 20:40:36 -0800193static char * const zone_names[MAX_NR_ZONES] = {
Christoph Lameter4b51d662007-02-10 01:43:10 -0800194#ifdef CONFIG_ZONE_DMA
Christoph Lameter2f1b6242006-09-25 23:31:13 -0700195 "DMA",
Christoph Lameter4b51d662007-02-10 01:43:10 -0800196#endif
Christoph Lameterfb0e7942006-09-25 23:31:13 -0700197#ifdef CONFIG_ZONE_DMA32
Christoph Lameter2f1b6242006-09-25 23:31:13 -0700198 "DMA32",
Christoph Lameterfb0e7942006-09-25 23:31:13 -0700199#endif
Christoph Lameter2f1b6242006-09-25 23:31:13 -0700200 "Normal",
Christoph Lametere53ef382006-09-25 23:31:14 -0700201#ifdef CONFIG_HIGHMEM
Mel Gorman2a1e2742007-07-17 04:03:12 -0700202 "HighMem",
Christoph Lametere53ef382006-09-25 23:31:14 -0700203#endif
Mel Gorman2a1e2742007-07-17 04:03:12 -0700204 "Movable",
Christoph Lameter2f1b6242006-09-25 23:31:13 -0700205};
206
Linus Torvalds1da177e2005-04-16 15:20:36 -0700207int min_free_kbytes = 1024;
Michal Hocko5f127332013-07-08 16:00:40 -0700208int user_min_free_kbytes;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700209
Jan Beulich2c85f512009-09-21 17:03:07 -0700210static unsigned long __meminitdata nr_kernel_pages;
211static unsigned long __meminitdata nr_all_pages;
Yasunori Gotoa3142c82007-05-08 00:23:07 -0700212static unsigned long __meminitdata dma_reserve;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700213
Tejun Heo0ee332c2011-12-08 10:22:09 -0800214#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
215static unsigned long __meminitdata arch_zone_lowest_possible_pfn[MAX_NR_ZONES];
216static unsigned long __meminitdata arch_zone_highest_possible_pfn[MAX_NR_ZONES];
217static unsigned long __initdata required_kernelcore;
218static unsigned long __initdata required_movablecore;
219static unsigned long __meminitdata zone_movable_pfn[MAX_NUMNODES];
Mel Gormanc7132162006-09-27 01:49:43 -0700220
Tejun Heo0ee332c2011-12-08 10:22:09 -0800221/* movable_zone is the "real" zone pages in ZONE_MOVABLE are taken from */
222int movable_zone;
223EXPORT_SYMBOL(movable_zone);
224#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
Mel Gormanc7132162006-09-27 01:49:43 -0700225
Miklos Szeredi418508c2007-05-23 13:57:55 -0700226#if MAX_NUMNODES > 1
227int nr_node_ids __read_mostly = MAX_NUMNODES;
Christoph Lameter62bc62a2009-06-16 15:32:15 -0700228int nr_online_nodes __read_mostly = 1;
Miklos Szeredi418508c2007-05-23 13:57:55 -0700229EXPORT_SYMBOL(nr_node_ids);
Christoph Lameter62bc62a2009-06-16 15:32:15 -0700230EXPORT_SYMBOL(nr_online_nodes);
Miklos Szeredi418508c2007-05-23 13:57:55 -0700231#endif
232
Mel Gorman9ef9acb2007-10-16 01:25:54 -0700233int page_group_by_mobility_disabled __read_mostly;
234
Minchan Kimee6f5092012-07-31 16:43:50 -0700235void set_pageblock_migratetype(struct page *page, int migratetype)
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700236{
KOSAKI Motohiro5d0f3f72013-11-12 15:08:18 -0800237 if (unlikely(page_group_by_mobility_disabled &&
238 migratetype < MIGRATE_PCPTYPES))
Mel Gorman49255c62009-06-16 15:31:58 -0700239 migratetype = MIGRATE_UNMOVABLE;
240
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700241 set_pageblock_flags_group(page, (unsigned long)migratetype,
242 PB_migrate, PB_migrate_end);
243}
244
Rafael J. Wysocki7f33d492009-06-16 15:32:41 -0700245bool oom_killer_disabled __read_mostly;
246
Nick Piggin13e74442006-01-06 00:10:58 -0800247#ifdef CONFIG_DEBUG_VM
Dave Hansenc6a57e12005-10-29 18:16:52 -0700248static int page_outside_zone_boundaries(struct zone *zone, struct page *page)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700249{
Dave Hansenbdc8cb92005-10-29 18:16:53 -0700250 int ret = 0;
251 unsigned seq;
252 unsigned long pfn = page_to_pfn(page);
Cody P Schaferb5e6a5a2013-02-22 16:35:28 -0800253 unsigned long sp, start_pfn;
Dave Hansenc6a57e12005-10-29 18:16:52 -0700254
Dave Hansenbdc8cb92005-10-29 18:16:53 -0700255 do {
256 seq = zone_span_seqbegin(zone);
Cody P Schaferb5e6a5a2013-02-22 16:35:28 -0800257 start_pfn = zone->zone_start_pfn;
258 sp = zone->spanned_pages;
Cody P Schafer108bcc92013-02-22 16:35:23 -0800259 if (!zone_spans_pfn(zone, pfn))
Dave Hansenbdc8cb92005-10-29 18:16:53 -0700260 ret = 1;
261 } while (zone_span_seqretry(zone, seq));
262
Cody P Schaferb5e6a5a2013-02-22 16:35:28 -0800263 if (ret)
264 pr_err("page %lu outside zone [ %lu - %lu ]\n",
265 pfn, start_pfn, start_pfn + sp);
266
Dave Hansenbdc8cb92005-10-29 18:16:53 -0700267 return ret;
Dave Hansenc6a57e12005-10-29 18:16:52 -0700268}
269
270static int page_is_consistent(struct zone *zone, struct page *page)
271{
Andy Whitcroft14e07292007-05-06 14:49:14 -0700272 if (!pfn_valid_within(page_to_pfn(page)))
Dave Hansenc6a57e12005-10-29 18:16:52 -0700273 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700274 if (zone != page_zone(page))
Dave Hansenc6a57e12005-10-29 18:16:52 -0700275 return 0;
276
277 return 1;
278}
279/*
280 * Temporary debugging check for pages not lying within a given zone.
281 */
282static int bad_range(struct zone *zone, struct page *page)
283{
284 if (page_outside_zone_boundaries(zone, page))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700285 return 1;
Dave Hansenc6a57e12005-10-29 18:16:52 -0700286 if (!page_is_consistent(zone, page))
287 return 1;
288
Linus Torvalds1da177e2005-04-16 15:20:36 -0700289 return 0;
290}
Nick Piggin13e74442006-01-06 00:10:58 -0800291#else
292static inline int bad_range(struct zone *zone, struct page *page)
293{
294 return 0;
295}
296#endif
297
Nick Piggin224abf92006-01-06 00:11:11 -0800298static void bad_page(struct page *page)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700299{
Hugh Dickinsd936cf92009-01-06 14:40:12 -0800300 static unsigned long resume;
301 static unsigned long nr_shown;
302 static unsigned long nr_unshown;
303
Wu Fengguang2a7684a2009-09-16 11:50:12 +0200304 /* Don't complain about poisoned pages */
305 if (PageHWPoison(page)) {
Mel Gorman22b751c2013-02-22 16:34:59 -0800306 page_mapcount_reset(page); /* remove PageBuddy */
Wu Fengguang2a7684a2009-09-16 11:50:12 +0200307 return;
308 }
309
Hugh Dickinsd936cf92009-01-06 14:40:12 -0800310 /*
311 * Allow a burst of 60 reports, then keep quiet for that minute;
312 * or allow a steady drip of one report per second.
313 */
314 if (nr_shown == 60) {
315 if (time_before(jiffies, resume)) {
316 nr_unshown++;
317 goto out;
318 }
319 if (nr_unshown) {
Hugh Dickins1e9e6362009-01-06 14:40:13 -0800320 printk(KERN_ALERT
321 "BUG: Bad page state: %lu messages suppressed\n",
Hugh Dickinsd936cf92009-01-06 14:40:12 -0800322 nr_unshown);
323 nr_unshown = 0;
324 }
325 nr_shown = 0;
326 }
327 if (nr_shown++ == 0)
328 resume = jiffies + 60 * HZ;
329
Hugh Dickins1e9e6362009-01-06 14:40:13 -0800330 printk(KERN_ALERT "BUG: Bad page state in process %s pfn:%05lx\n",
Hugh Dickins3dc14742009-01-06 14:40:08 -0800331 current->comm, page_to_pfn(page));
Wu Fengguang718a3822010-03-10 15:20:43 -0800332 dump_page(page);
KAMEZAWA Hiroyuki52d4b9a2008-10-18 20:28:16 -0700333
Dave Jones4f318882011-10-31 17:07:24 -0700334 print_modules();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700335 dump_stack();
Hugh Dickinsd936cf92009-01-06 14:40:12 -0800336out:
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800337 /* Leave bad fields for debug, except PageBuddy could make trouble */
Mel Gorman22b751c2013-02-22 16:34:59 -0800338 page_mapcount_reset(page); /* remove PageBuddy */
Rusty Russell373d4d02013-01-21 17:17:39 +1030339 add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700340}
341
Linus Torvalds1da177e2005-04-16 15:20:36 -0700342/*
343 * Higher-order pages are called "compound pages". They are structured thusly:
344 *
345 * The first PAGE_SIZE page is called the "head page".
346 *
347 * The remaining PAGE_SIZE pages are called "tail pages".
348 *
Wang Sheng-Hui6416b9f2011-11-17 10:53:50 +0100349 * All pages have PG_compound set. All tail pages have their ->first_page
350 * pointing at the head page.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700351 *
Hugh Dickins41d78ba2006-02-14 13:52:58 -0800352 * The first tail page's ->lru.next holds the address of the compound page's
353 * put_page() function. Its ->lru.prev holds the order of allocation.
354 * This usage means that zero-order pages may not be compound.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700355 */
Hugh Dickinsd98c7a02006-02-14 13:52:59 -0800356
357static void free_compound_page(struct page *page)
358{
Christoph Lameterd85f3382007-05-06 14:49:39 -0700359 __free_pages_ok(page, compound_order(page));
Hugh Dickinsd98c7a02006-02-14 13:52:59 -0800360}
361
Andi Kleen01ad1c02008-07-23 21:27:46 -0700362void prep_compound_page(struct page *page, unsigned long order)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700363{
364 int i;
365 int nr_pages = 1 << order;
366
Andy Whitcroft33f2ef82006-12-06 20:33:32 -0800367 set_compound_page_dtor(page, free_compound_page);
Christoph Lameterd85f3382007-05-06 14:49:39 -0700368 set_compound_order(page, order);
Christoph Lameter6d777952007-05-06 14:49:40 -0700369 __SetPageHead(page);
Andy Whitcroft18229df2008-11-06 12:53:27 -0800370 for (i = 1; i < nr_pages; i++) {
371 struct page *p = page + i;
Christoph Lameterd85f3382007-05-06 14:49:39 -0700372 __SetPageTail(p);
Youquan Song58a84aa2011-12-08 14:34:18 -0800373 set_page_count(p, 0);
Christoph Lameterd85f3382007-05-06 14:49:39 -0700374 p->first_page = page;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700375 }
376}
377
Andrea Arcangeli59ff4212011-01-13 15:46:38 -0800378/* update __split_huge_page_refcount if you change this function */
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800379static int destroy_compound_page(struct page *page, unsigned long order)
Andy Whitcroft18229df2008-11-06 12:53:27 -0800380{
381 int i;
382 int nr_pages = 1 << order;
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800383 int bad = 0;
Andy Whitcroft18229df2008-11-06 12:53:27 -0800384
Gavin Shan0bb2c762012-12-18 14:21:32 -0800385 if (unlikely(compound_order(page) != order)) {
Nick Piggin224abf92006-01-06 00:11:11 -0800386 bad_page(page);
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800387 bad++;
388 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700389
Christoph Lameter6d777952007-05-06 14:49:40 -0700390 __ClearPageHead(page);
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800391
Andy Whitcroft18229df2008-11-06 12:53:27 -0800392 for (i = 1; i < nr_pages; i++) {
393 struct page *p = page + i;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700394
Alexey Zaytseve713a212009-01-10 02:47:57 +0300395 if (unlikely(!PageTail(p) || (p->first_page != page))) {
Nick Piggin224abf92006-01-06 00:11:11 -0800396 bad_page(page);
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800397 bad++;
398 }
Christoph Lameterd85f3382007-05-06 14:49:39 -0700399 __ClearPageTail(p);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700400 }
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800401
402 return bad;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700403}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700404
Nick Piggin17cf4402006-03-22 00:08:41 -0800405static inline void prep_zero_page(struct page *page, int order, gfp_t gfp_flags)
406{
407 int i;
408
Andrew Morton6626c5d2006-03-22 00:08:42 -0800409 /*
410 * clear_highpage() will use KM_USER0, so it's a bug to use __GFP_ZERO
411 * and __GFP_HIGHMEM from hard or soft interrupt context.
412 */
Nick Piggin725d7042006-09-25 23:30:55 -0700413 VM_BUG_ON((gfp_flags & __GFP_HIGHMEM) && in_interrupt());
Nick Piggin17cf4402006-03-22 00:08:41 -0800414 for (i = 0; i < (1 << order); i++)
415 clear_highpage(page + i);
416}
417
Stanislaw Gruszkac0a32fc52012-01-10 15:07:28 -0800418#ifdef CONFIG_DEBUG_PAGEALLOC
419unsigned int _debug_guardpage_minorder;
420
421static int __init debug_guardpage_minorder_setup(char *buf)
422{
423 unsigned long res;
424
425 if (kstrtoul(buf, 10, &res) < 0 || res > MAX_ORDER / 2) {
426 printk(KERN_ERR "Bad debug_guardpage_minorder value\n");
427 return 0;
428 }
429 _debug_guardpage_minorder = res;
430 printk(KERN_INFO "Setting debug_guardpage_minorder to %lu\n", res);
431 return 0;
432}
433__setup("debug_guardpage_minorder=", debug_guardpage_minorder_setup);
434
435static inline void set_page_guard_flag(struct page *page)
436{
437 __set_bit(PAGE_DEBUG_FLAG_GUARD, &page->debug_flags);
438}
439
440static inline void clear_page_guard_flag(struct page *page)
441{
442 __clear_bit(PAGE_DEBUG_FLAG_GUARD, &page->debug_flags);
443}
444#else
445static inline void set_page_guard_flag(struct page *page) { }
446static inline void clear_page_guard_flag(struct page *page) { }
447#endif
448
Andrew Morton6aa3001b22006-04-18 22:20:52 -0700449static inline void set_page_order(struct page *page, int order)
450{
Hugh Dickins4c21e2f2005-10-29 18:16:40 -0700451 set_page_private(page, order);
Nick Piggin676165a2006-04-10 11:21:48 +1000452 __SetPageBuddy(page);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700453}
454
455static inline void rmv_page_order(struct page *page)
456{
Nick Piggin676165a2006-04-10 11:21:48 +1000457 __ClearPageBuddy(page);
Hugh Dickins4c21e2f2005-10-29 18:16:40 -0700458 set_page_private(page, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700459}
460
461/*
462 * Locate the struct page for both the matching buddy in our
463 * pair (buddy1) and the combined O(n+1) page they form (page).
464 *
465 * 1) Any buddy B1 will have an order O twin B2 which satisfies
466 * the following equation:
467 * B2 = B1 ^ (1 << O)
468 * For example, if the starting buddy (buddy2) is #8 its order
469 * 1 buddy is #10:
470 * B2 = 8 ^ (1 << 1) = 8 ^ 2 = 10
471 *
472 * 2) Any buddy B will have an order O+1 parent P which
473 * satisfies the following equation:
474 * P = B & ~(1 << O)
475 *
Andreas Mohrd6e05ed2006-06-26 18:35:02 +0200476 * Assumption: *_mem_map is contiguous at least up to MAX_ORDER
Linus Torvalds1da177e2005-04-16 15:20:36 -0700477 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700478static inline unsigned long
KyongHo Cho43506fa2011-01-13 15:47:24 -0800479__find_buddy_index(unsigned long page_idx, unsigned int order)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700480{
KyongHo Cho43506fa2011-01-13 15:47:24 -0800481 return page_idx ^ (1 << order);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700482}
483
484/*
485 * This function checks whether a page is free && is the buddy
486 * we can do coalesce a page and its buddy if
Nick Piggin13e74442006-01-06 00:10:58 -0800487 * (a) the buddy is not in a hole &&
Nick Piggin676165a2006-04-10 11:21:48 +1000488 * (b) the buddy is in the buddy system &&
Andy Whitcroftcb2b95e2006-06-23 02:03:01 -0700489 * (c) a page and its buddy have the same order &&
490 * (d) a page and its buddy are in the same zone.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700491 *
Wang Sheng-Huicf6fe942013-09-11 14:22:48 -0700492 * For recording whether a page is in the buddy system, we set ->_mapcount
493 * PAGE_BUDDY_MAPCOUNT_VALUE.
494 * Setting, clearing, and testing _mapcount PAGE_BUDDY_MAPCOUNT_VALUE is
495 * serialized by zone->lock.
Nick Piggin676165a2006-04-10 11:21:48 +1000496 *
497 * For recording page's order, we use page_private(page).
Linus Torvalds1da177e2005-04-16 15:20:36 -0700498 */
Andy Whitcroftcb2b95e2006-06-23 02:03:01 -0700499static inline int page_is_buddy(struct page *page, struct page *buddy,
500 int order)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700501{
Andy Whitcroft14e07292007-05-06 14:49:14 -0700502 if (!pfn_valid_within(page_to_pfn(buddy)))
Nick Piggin13e74442006-01-06 00:10:58 -0800503 return 0;
Nick Piggin13e74442006-01-06 00:10:58 -0800504
Andy Whitcroftcb2b95e2006-06-23 02:03:01 -0700505 if (page_zone_id(page) != page_zone_id(buddy))
506 return 0;
507
Stanislaw Gruszkac0a32fc52012-01-10 15:07:28 -0800508 if (page_is_guard(buddy) && page_order(buddy) == order) {
509 VM_BUG_ON(page_count(buddy) != 0);
510 return 1;
511 }
512
Andy Whitcroftcb2b95e2006-06-23 02:03:01 -0700513 if (PageBuddy(buddy) && page_order(buddy) == order) {
Nick Piggina3af9c32009-06-16 15:32:10 -0700514 VM_BUG_ON(page_count(buddy) != 0);
Andrew Morton6aa3001b22006-04-18 22:20:52 -0700515 return 1;
Nick Piggin676165a2006-04-10 11:21:48 +1000516 }
Andrew Morton6aa3001b22006-04-18 22:20:52 -0700517 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700518}
519
520/*
521 * Freeing function for a buddy system allocator.
522 *
523 * The concept of a buddy system is to maintain direct-mapped table
524 * (containing bit values) for memory blocks of various "orders".
525 * The bottom level table contains the map for the smallest allocatable
526 * units of memory (here, pages), and each level above it describes
527 * pairs of units from the levels below, hence, "buddies".
528 * At a high level, all that happens here is marking the table entry
529 * at the bottom level available, and propagating the changes upward
530 * as necessary, plus some accounting needed to play nicely with other
531 * parts of the VM system.
532 * At each level, we keep a list of pages, which are heads of continuous
Wang Sheng-Huicf6fe942013-09-11 14:22:48 -0700533 * free pages of length of (1 << order) and marked with _mapcount
534 * PAGE_BUDDY_MAPCOUNT_VALUE. Page's order is recorded in page_private(page)
535 * field.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700536 * So when we are allocating or freeing one, we can derive the state of the
Michal Nazarewicz5f63b722012-01-11 15:16:11 +0100537 * other. That is, if we allocate a small block, and both were
538 * free, the remainder of the region must be split into blocks.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700539 * If a block is freed, and its buddy is also free, then this
Michal Nazarewicz5f63b722012-01-11 15:16:11 +0100540 * triggers coalescing into a block of larger size.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700541 *
Nadia Yvette Chambers6d49e352012-12-06 10:39:54 +0100542 * -- nyc
Linus Torvalds1da177e2005-04-16 15:20:36 -0700543 */
544
Nick Piggin48db57f2006-01-08 01:00:42 -0800545static inline void __free_one_page(struct page *page,
Mel Gormaned0ae212009-06-16 15:32:07 -0700546 struct zone *zone, unsigned int order,
547 int migratetype)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700548{
549 unsigned long page_idx;
Corrado Zoccolo6dda9d52010-05-24 14:31:54 -0700550 unsigned long combined_idx;
KyongHo Cho43506fa2011-01-13 15:47:24 -0800551 unsigned long uninitialized_var(buddy_idx);
Corrado Zoccolo6dda9d52010-05-24 14:31:54 -0700552 struct page *buddy;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700553
Cody P Schaferd29bb972013-02-22 16:35:25 -0800554 VM_BUG_ON(!zone_is_initialized(zone));
555
Nick Piggin224abf92006-01-06 00:11:11 -0800556 if (unlikely(PageCompound(page)))
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800557 if (unlikely(destroy_compound_page(page, order)))
558 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700559
Mel Gormaned0ae212009-06-16 15:32:07 -0700560 VM_BUG_ON(migratetype == -1);
561
Linus Torvalds1da177e2005-04-16 15:20:36 -0700562 page_idx = page_to_pfn(page) & ((1 << MAX_ORDER) - 1);
563
Mel Gormanf2260e62009-06-16 15:32:13 -0700564 VM_BUG_ON(page_idx & ((1 << order) - 1));
Nick Piggin725d7042006-09-25 23:30:55 -0700565 VM_BUG_ON(bad_range(zone, page));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700566
Linus Torvalds1da177e2005-04-16 15:20:36 -0700567 while (order < MAX_ORDER-1) {
KyongHo Cho43506fa2011-01-13 15:47:24 -0800568 buddy_idx = __find_buddy_index(page_idx, order);
569 buddy = page + (buddy_idx - page_idx);
Andy Whitcroftcb2b95e2006-06-23 02:03:01 -0700570 if (!page_is_buddy(page, buddy, order))
Andy Whitcroft3c82d0c2008-07-23 21:27:11 -0700571 break;
Stanislaw Gruszkac0a32fc52012-01-10 15:07:28 -0800572 /*
573 * Our buddy is free or it is CONFIG_DEBUG_PAGEALLOC guard page,
574 * merge with it and move up one order.
575 */
576 if (page_is_guard(buddy)) {
577 clear_page_guard_flag(buddy);
578 set_page_private(page, 0);
Bartlomiej Zolnierkiewiczd1ce7492012-10-08 16:32:02 -0700579 __mod_zone_freepage_state(zone, 1 << order,
580 migratetype);
Stanislaw Gruszkac0a32fc52012-01-10 15:07:28 -0800581 } else {
582 list_del(&buddy->lru);
583 zone->free_area[order].nr_free--;
584 rmv_page_order(buddy);
585 }
KyongHo Cho43506fa2011-01-13 15:47:24 -0800586 combined_idx = buddy_idx & page_idx;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700587 page = page + (combined_idx - page_idx);
588 page_idx = combined_idx;
589 order++;
590 }
591 set_page_order(page, order);
Corrado Zoccolo6dda9d52010-05-24 14:31:54 -0700592
593 /*
594 * If this is not the largest possible page, check if the buddy
595 * of the next-highest order is free. If it is, it's possible
596 * that pages are being freed that will coalesce soon. In case,
597 * that is happening, add the free page to the tail of the list
598 * so it's less likely to be used soon and more likely to be merged
599 * as a higher order page
600 */
Mel Gormanb7f50cf2010-10-26 14:21:11 -0700601 if ((order < MAX_ORDER-2) && pfn_valid_within(page_to_pfn(buddy))) {
Corrado Zoccolo6dda9d52010-05-24 14:31:54 -0700602 struct page *higher_page, *higher_buddy;
KyongHo Cho43506fa2011-01-13 15:47:24 -0800603 combined_idx = buddy_idx & page_idx;
604 higher_page = page + (combined_idx - page_idx);
605 buddy_idx = __find_buddy_index(combined_idx, order + 1);
Li Haifeng0ba8f2d2012-09-17 14:09:21 -0700606 higher_buddy = higher_page + (buddy_idx - combined_idx);
Corrado Zoccolo6dda9d52010-05-24 14:31:54 -0700607 if (page_is_buddy(higher_page, higher_buddy, order + 1)) {
608 list_add_tail(&page->lru,
609 &zone->free_area[order].free_list[migratetype]);
610 goto out;
611 }
612 }
613
614 list_add(&page->lru, &zone->free_area[order].free_list[migratetype]);
615out:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700616 zone->free_area[order].nr_free++;
617}
618
Nick Piggin224abf92006-01-06 00:11:11 -0800619static inline int free_pages_check(struct page *page)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700620{
Nick Piggin92be2e332006-01-06 00:10:57 -0800621 if (unlikely(page_mapcount(page) |
622 (page->mapping != NULL) |
Nick Piggina3af9c32009-06-16 15:32:10 -0700623 (atomic_read(&page->_count) != 0) |
Daisuke Nishimuraf212ad72011-03-23 16:42:25 -0700624 (page->flags & PAGE_FLAGS_CHECK_AT_FREE) |
625 (mem_cgroup_bad_page_check(page)))) {
Nick Piggin224abf92006-01-06 00:11:11 -0800626 bad_page(page);
Hugh Dickins79f4b7b2009-01-06 14:40:05 -0800627 return 1;
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800628 }
Peter Zijlstra90572892013-10-07 11:29:20 +0100629 page_cpupid_reset_last(page);
Hugh Dickins79f4b7b2009-01-06 14:40:05 -0800630 if (page->flags & PAGE_FLAGS_CHECK_AT_PREP)
631 page->flags &= ~PAGE_FLAGS_CHECK_AT_PREP;
632 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700633}
634
635/*
Mel Gorman5f8dcc22009-09-21 17:03:19 -0700636 * Frees a number of pages from the PCP lists
Linus Torvalds1da177e2005-04-16 15:20:36 -0700637 * Assumes all pages on list are in same zone, and of same order.
Renaud Lienhart207f36e2005-09-10 00:26:59 -0700638 * count is the number of pages to free.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700639 *
640 * If the zone was previously in an "all pages pinned" state then look to
641 * see if this freeing clears that state.
642 *
643 * And clear the zone's pages_scanned counter, to hold off the "all pages are
644 * pinned" detection logic.
645 */
Mel Gorman5f8dcc22009-09-21 17:03:19 -0700646static void free_pcppages_bulk(struct zone *zone, int count,
647 struct per_cpu_pages *pcp)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700648{
Mel Gorman5f8dcc22009-09-21 17:03:19 -0700649 int migratetype = 0;
Mel Gormana6f9edd2009-09-21 17:03:20 -0700650 int batch_free = 0;
Mel Gorman72853e22010-09-09 16:38:16 -0700651 int to_free = count;
Mel Gorman5f8dcc22009-09-21 17:03:19 -0700652
Nick Pigginc54ad302006-01-06 00:10:56 -0800653 spin_lock(&zone->lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700654 zone->pages_scanned = 0;
Mel Gormanf2260e62009-06-16 15:32:13 -0700655
Mel Gorman72853e22010-09-09 16:38:16 -0700656 while (to_free) {
Nick Piggin48db57f2006-01-08 01:00:42 -0800657 struct page *page;
Mel Gorman5f8dcc22009-09-21 17:03:19 -0700658 struct list_head *list;
Nick Piggin48db57f2006-01-08 01:00:42 -0800659
Mel Gorman5f8dcc22009-09-21 17:03:19 -0700660 /*
Mel Gormana6f9edd2009-09-21 17:03:20 -0700661 * Remove pages from lists in a round-robin fashion. A
662 * batch_free count is maintained that is incremented when an
663 * empty list is encountered. This is so more pages are freed
664 * off fuller lists instead of spinning excessively around empty
665 * lists
Mel Gorman5f8dcc22009-09-21 17:03:19 -0700666 */
667 do {
Mel Gormana6f9edd2009-09-21 17:03:20 -0700668 batch_free++;
Mel Gorman5f8dcc22009-09-21 17:03:19 -0700669 if (++migratetype == MIGRATE_PCPTYPES)
670 migratetype = 0;
671 list = &pcp->lists[migratetype];
672 } while (list_empty(list));
673
Namhyung Kim1d168712011-03-22 16:32:45 -0700674 /* This is the only non-empty list. Free them all. */
675 if (batch_free == MIGRATE_PCPTYPES)
676 batch_free = to_free;
677
Mel Gormana6f9edd2009-09-21 17:03:20 -0700678 do {
Bartlomiej Zolnierkiewicz770c8aa2012-10-08 16:31:57 -0700679 int mt; /* migratetype of the to-be-freed page */
680
Mel Gormana6f9edd2009-09-21 17:03:20 -0700681 page = list_entry(list->prev, struct page, lru);
682 /* must delete as __free_one_page list manipulates */
683 list_del(&page->lru);
Minchan Kimb12c4ad2012-10-08 16:32:08 -0700684 mt = get_freepage_migratetype(page);
Hugh Dickinsa7016232010-01-29 17:46:34 +0000685 /* MIGRATE_MOVABLE list may include MIGRATE_RESERVEs */
Bartlomiej Zolnierkiewicz770c8aa2012-10-08 16:31:57 -0700686 __free_one_page(page, zone, 0, mt);
687 trace_mm_page_pcpu_drain(page, 0, mt);
Minchan Kim194159f2013-02-22 16:33:58 -0800688 if (likely(!is_migrate_isolate_page(page))) {
Wen Congyang97d0da22012-12-11 16:00:52 -0800689 __mod_zone_page_state(zone, NR_FREE_PAGES, 1);
690 if (is_migrate_cma(mt))
691 __mod_zone_page_state(zone, NR_FREE_CMA_PAGES, 1);
692 }
Mel Gorman72853e22010-09-09 16:38:16 -0700693 } while (--to_free && --batch_free && !list_empty(list));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700694 }
Nick Pigginc54ad302006-01-06 00:10:56 -0800695 spin_unlock(&zone->lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700696}
697
Mel Gormaned0ae212009-06-16 15:32:07 -0700698static void free_one_page(struct zone *zone, struct page *page, int order,
699 int migratetype)
Nick Piggin48db57f2006-01-08 01:00:42 -0800700{
Christoph Lameter006d22d2006-09-25 23:31:48 -0700701 spin_lock(&zone->lock);
Christoph Lameter006d22d2006-09-25 23:31:48 -0700702 zone->pages_scanned = 0;
Mel Gormanf2260e62009-06-16 15:32:13 -0700703
Mel Gormaned0ae212009-06-16 15:32:07 -0700704 __free_one_page(page, zone, order, migratetype);
Minchan Kim194159f2013-02-22 16:33:58 -0800705 if (unlikely(!is_migrate_isolate(migratetype)))
Bartlomiej Zolnierkiewiczd1ce7492012-10-08 16:32:02 -0700706 __mod_zone_freepage_state(zone, 1 << order, migratetype);
Christoph Lameter006d22d2006-09-25 23:31:48 -0700707 spin_unlock(&zone->lock);
Nick Piggin48db57f2006-01-08 01:00:42 -0800708}
709
KOSAKI Motohiroec95f532010-05-24 14:32:38 -0700710static bool free_pages_prepare(struct page *page, unsigned int order)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700711{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700712 int i;
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800713 int bad = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700714
Konstantin Khlebnikovb413d482012-01-10 15:07:09 -0800715 trace_mm_page_free(page, order);
Vegard Nossumb1eeab62008-11-25 16:55:53 +0100716 kmemcheck_free_shadow(page, order);
717
Andrea Arcangeli8dd60a32011-01-13 15:46:34 -0800718 if (PageAnon(page))
719 page->mapping = NULL;
720 for (i = 0; i < (1 << order); i++)
721 bad += free_pages_check(page + i);
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800722 if (bad)
KOSAKI Motohiroec95f532010-05-24 14:32:38 -0700723 return false;
Hugh Dickins689bceb2005-11-21 21:32:20 -0800724
Thomas Gleixner3ac7fe52008-04-30 00:55:01 -0700725 if (!PageHighMem(page)) {
Pintu Kumarb8af2942013-09-11 14:20:34 -0700726 debug_check_no_locks_freed(page_address(page),
727 PAGE_SIZE << order);
Thomas Gleixner3ac7fe52008-04-30 00:55:01 -0700728 debug_check_no_obj_freed(page_address(page),
729 PAGE_SIZE << order);
730 }
Nick Piggindafb1362006-10-11 01:21:30 -0700731 arch_free_page(page, order);
Nick Piggin48db57f2006-01-08 01:00:42 -0800732 kernel_map_pages(page, 1 << order, 0);
Nick Piggindafb1362006-10-11 01:21:30 -0700733
KOSAKI Motohiroec95f532010-05-24 14:32:38 -0700734 return true;
735}
736
737static void __free_pages_ok(struct page *page, unsigned int order)
738{
739 unsigned long flags;
Minchan Kim95e34412012-10-08 16:32:11 -0700740 int migratetype;
KOSAKI Motohiroec95f532010-05-24 14:32:38 -0700741
742 if (!free_pages_prepare(page, order))
743 return;
744
Nick Pigginc54ad302006-01-06 00:10:56 -0800745 local_irq_save(flags);
Christoph Lameterf8891e52006-06-30 01:55:45 -0700746 __count_vm_events(PGFREE, 1 << order);
Minchan Kim95e34412012-10-08 16:32:11 -0700747 migratetype = get_pageblock_migratetype(page);
748 set_freepage_migratetype(page, migratetype);
749 free_one_page(page_zone(page), page, order, migratetype);
Nick Pigginc54ad302006-01-06 00:10:56 -0800750 local_irq_restore(flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700751}
752
Jiang Liu170a5a72013-07-03 15:03:17 -0700753void __init __free_pages_bootmem(struct page *page, unsigned int order)
David Howellsa226f6c2006-01-06 00:11:08 -0800754{
Johannes Weinerc3993072012-01-10 15:08:10 -0800755 unsigned int nr_pages = 1 << order;
Yinghai Lue2d0bd22013-09-11 14:20:37 -0700756 struct page *p = page;
Johannes Weinerc3993072012-01-10 15:08:10 -0800757 unsigned int loop;
David Howellsa226f6c2006-01-06 00:11:08 -0800758
Yinghai Lue2d0bd22013-09-11 14:20:37 -0700759 prefetchw(p);
760 for (loop = 0; loop < (nr_pages - 1); loop++, p++) {
761 prefetchw(p + 1);
Johannes Weinerc3993072012-01-10 15:08:10 -0800762 __ClearPageReserved(p);
763 set_page_count(p, 0);
David Howellsa226f6c2006-01-06 00:11:08 -0800764 }
Yinghai Lue2d0bd22013-09-11 14:20:37 -0700765 __ClearPageReserved(p);
766 set_page_count(p, 0);
Johannes Weinerc3993072012-01-10 15:08:10 -0800767
Yinghai Lue2d0bd22013-09-11 14:20:37 -0700768 page_zone(page)->managed_pages += nr_pages;
Johannes Weinerc3993072012-01-10 15:08:10 -0800769 set_page_refcounted(page);
770 __free_pages(page, order);
David Howellsa226f6c2006-01-06 00:11:08 -0800771}
772
Michal Nazarewicz47118af2011-12-29 13:09:50 +0100773#ifdef CONFIG_CMA
Li Zhong9cf510a2013-08-23 13:52:52 +0800774/* Free whole pageblock and set its migration type to MIGRATE_CMA. */
Michal Nazarewicz47118af2011-12-29 13:09:50 +0100775void __init init_cma_reserved_pageblock(struct page *page)
776{
777 unsigned i = pageblock_nr_pages;
778 struct page *p = page;
779
780 do {
781 __ClearPageReserved(p);
782 set_page_count(p, 0);
783 } while (++p, --i);
784
785 set_page_refcounted(page);
786 set_pageblock_migratetype(page, MIGRATE_CMA);
787 __free_pages(page, pageblock_order);
Jiang Liu3dcc0572013-07-03 15:03:21 -0700788 adjust_managed_page_count(page, pageblock_nr_pages);
Michal Nazarewicz47118af2011-12-29 13:09:50 +0100789}
790#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700791
792/*
793 * The order of subdivision here is critical for the IO subsystem.
794 * Please do not alter this order without good reasons and regression
795 * testing. Specifically, as large blocks of memory are subdivided,
796 * the order in which smaller blocks are delivered depends on the order
797 * they're subdivided in this function. This is the primary factor
798 * influencing the order in which pages are delivered to the IO
799 * subsystem according to empirical testing, and this is also justified
800 * by considering the behavior of a buddy system containing a single
801 * large block of memory acted on by a series of small allocations.
802 * This behavior is a critical factor in sglist merging's success.
803 *
Nadia Yvette Chambers6d49e352012-12-06 10:39:54 +0100804 * -- nyc
Linus Torvalds1da177e2005-04-16 15:20:36 -0700805 */
Nick Piggin085cc7d2006-01-06 00:11:01 -0800806static inline void expand(struct zone *zone, struct page *page,
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700807 int low, int high, struct free_area *area,
808 int migratetype)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700809{
810 unsigned long size = 1 << high;
811
812 while (high > low) {
813 area--;
814 high--;
815 size >>= 1;
Nick Piggin725d7042006-09-25 23:30:55 -0700816 VM_BUG_ON(bad_range(zone, &page[size]));
Stanislaw Gruszkac0a32fc52012-01-10 15:07:28 -0800817
818#ifdef CONFIG_DEBUG_PAGEALLOC
819 if (high < debug_guardpage_minorder()) {
820 /*
821 * Mark as guard pages (or page), that will allow to
822 * merge back to allocator when buddy will be freed.
823 * Corresponding page table entries will not be touched,
824 * pages will stay not present in virtual address space
825 */
826 INIT_LIST_HEAD(&page[size].lru);
827 set_page_guard_flag(&page[size]);
828 set_page_private(&page[size], high);
829 /* Guard pages are not available for any usage */
Bartlomiej Zolnierkiewiczd1ce7492012-10-08 16:32:02 -0700830 __mod_zone_freepage_state(zone, -(1 << high),
831 migratetype);
Stanislaw Gruszkac0a32fc52012-01-10 15:07:28 -0800832 continue;
833 }
834#endif
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700835 list_add(&page[size].lru, &area->free_list[migratetype]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700836 area->nr_free++;
837 set_page_order(&page[size], high);
838 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700839}
840
Linus Torvalds1da177e2005-04-16 15:20:36 -0700841/*
842 * This page is about to be returned from the page allocator
843 */
Wu Fengguang2a7684a2009-09-16 11:50:12 +0200844static inline int check_new_page(struct page *page)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700845{
Nick Piggin92be2e332006-01-06 00:10:57 -0800846 if (unlikely(page_mapcount(page) |
847 (page->mapping != NULL) |
Nick Piggina3af9c32009-06-16 15:32:10 -0700848 (atomic_read(&page->_count) != 0) |
Daisuke Nishimuraf212ad72011-03-23 16:42:25 -0700849 (page->flags & PAGE_FLAGS_CHECK_AT_PREP) |
850 (mem_cgroup_bad_page_check(page)))) {
Nick Piggin224abf92006-01-06 00:11:11 -0800851 bad_page(page);
Hugh Dickins689bceb2005-11-21 21:32:20 -0800852 return 1;
Hugh Dickins8cc3b392009-01-06 14:40:06 -0800853 }
Wu Fengguang2a7684a2009-09-16 11:50:12 +0200854 return 0;
855}
856
857static int prep_new_page(struct page *page, int order, gfp_t gfp_flags)
858{
859 int i;
860
861 for (i = 0; i < (1 << order); i++) {
862 struct page *p = page + i;
863 if (unlikely(check_new_page(p)))
864 return 1;
865 }
Hugh Dickins689bceb2005-11-21 21:32:20 -0800866
Hugh Dickins4c21e2f2005-10-29 18:16:40 -0700867 set_page_private(page, 0);
Nick Piggin7835e982006-03-22 00:08:40 -0800868 set_page_refcounted(page);
Nick Piggincc1025092006-12-06 20:32:00 -0800869
870 arch_alloc_page(page, order);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700871 kernel_map_pages(page, 1 << order, 1);
Nick Piggin17cf4402006-03-22 00:08:41 -0800872
873 if (gfp_flags & __GFP_ZERO)
874 prep_zero_page(page, order, gfp_flags);
875
876 if (order && (gfp_flags & __GFP_COMP))
877 prep_compound_page(page, order);
878
Hugh Dickins689bceb2005-11-21 21:32:20 -0800879 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700880}
881
Mel Gorman56fd56b2007-10-16 01:25:58 -0700882/*
883 * Go through the free lists for the given migratetype and remove
884 * the smallest available page from the freelists
885 */
Mel Gorman728ec982009-06-16 15:32:04 -0700886static inline
887struct page *__rmqueue_smallest(struct zone *zone, unsigned int order,
Mel Gorman56fd56b2007-10-16 01:25:58 -0700888 int migratetype)
889{
890 unsigned int current_order;
Pintu Kumarb8af2942013-09-11 14:20:34 -0700891 struct free_area *area;
Mel Gorman56fd56b2007-10-16 01:25:58 -0700892 struct page *page;
893
894 /* Find a page of the appropriate size in the preferred list */
895 for (current_order = order; current_order < MAX_ORDER; ++current_order) {
896 area = &(zone->free_area[current_order]);
897 if (list_empty(&area->free_list[migratetype]))
898 continue;
899
900 page = list_entry(area->free_list[migratetype].next,
901 struct page, lru);
902 list_del(&page->lru);
903 rmv_page_order(page);
904 area->nr_free--;
Mel Gorman56fd56b2007-10-16 01:25:58 -0700905 expand(zone, page, order, current_order, area, migratetype);
906 return page;
907 }
908
909 return NULL;
910}
911
912
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700913/*
914 * This array describes the order lists are fallen back to when
915 * the free lists for the desirable migrate type are depleted
916 */
Michal Nazarewicz47118af2011-12-29 13:09:50 +0100917static int fallbacks[MIGRATE_TYPES][4] = {
918 [MIGRATE_UNMOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_MOVABLE, MIGRATE_RESERVE },
919 [MIGRATE_RECLAIMABLE] = { MIGRATE_UNMOVABLE, MIGRATE_MOVABLE, MIGRATE_RESERVE },
920#ifdef CONFIG_CMA
921 [MIGRATE_MOVABLE] = { MIGRATE_CMA, MIGRATE_RECLAIMABLE, MIGRATE_UNMOVABLE, MIGRATE_RESERVE },
922 [MIGRATE_CMA] = { MIGRATE_RESERVE }, /* Never used */
923#else
924 [MIGRATE_MOVABLE] = { MIGRATE_RECLAIMABLE, MIGRATE_UNMOVABLE, MIGRATE_RESERVE },
925#endif
Michal Nazarewicz6d4a4912012-01-11 15:31:33 +0100926 [MIGRATE_RESERVE] = { MIGRATE_RESERVE }, /* Never used */
Minchan Kim194159f2013-02-22 16:33:58 -0800927#ifdef CONFIG_MEMORY_ISOLATION
Michal Nazarewicz6d4a4912012-01-11 15:31:33 +0100928 [MIGRATE_ISOLATE] = { MIGRATE_RESERVE }, /* Never used */
Minchan Kim194159f2013-02-22 16:33:58 -0800929#endif
Mel Gormanb2a0ac82007-10-16 01:25:48 -0700930};
931
Mel Gormanc361be52007-10-16 01:25:51 -0700932/*
933 * Move the free pages in a range to the free lists of the requested type.
Mel Gormand9c23402007-10-16 01:26:01 -0700934 * Note that start_page and end_pages are not aligned on a pageblock
Mel Gormanc361be52007-10-16 01:25:51 -0700935 * boundary. If alignment is required, use move_freepages_block()
936 */
Minchan Kim435b4052012-10-08 16:32:16 -0700937int move_freepages(struct zone *zone,
Adrian Bunkb69a7282008-07-23 21:28:12 -0700938 struct page *start_page, struct page *end_page,
939 int migratetype)
Mel Gormanc361be52007-10-16 01:25:51 -0700940{
941 struct page *page;
942 unsigned long order;
Mel Gormand1003132007-10-16 01:26:00 -0700943 int pages_moved = 0;
Mel Gormanc361be52007-10-16 01:25:51 -0700944
945#ifndef CONFIG_HOLES_IN_ZONE
946 /*
947 * page_zone is not safe to call in this context when
948 * CONFIG_HOLES_IN_ZONE is set. This bug check is probably redundant
949 * anyway as we check zone boundaries in move_freepages_block().
950 * Remove at a later date when no bug reports exist related to
Mel Gormanac0e5b72007-10-16 01:25:58 -0700951 * grouping pages by mobility
Mel Gormanc361be52007-10-16 01:25:51 -0700952 */
953 BUG_ON(page_zone(start_page) != page_zone(end_page));
954#endif
955
956 for (page = start_page; page <= end_page;) {
Adam Litke344c7902008-09-02 14:35:38 -0700957 /* Make sure we are not inadvertently changing nodes */
958 VM_BUG_ON(page_to_nid(page) != zone_to_nid(zone));
959
Mel Gormanc361be52007-10-16 01:25:51 -0700960 if (!pfn_valid_within(page_to_pfn(page))) {
961 page++;
962 continue;
963 }
964
965 if (!PageBuddy(page)) {
966 page++;
967 continue;
968 }
969
970 order = page_order(page);
Kirill A. Shutemov84be48d2011-03-22 16:33:41 -0700971 list_move(&page->lru,
972 &zone->free_area[order].free_list[migratetype]);
Minchan Kim95e34412012-10-08 16:32:11 -0700973 set_freepage_migratetype(page, migratetype);
Mel Gormanc361be52007-10-16 01:25:51 -0700974 page += 1 << order;
Mel Gormand1003132007-10-16 01:26:00 -0700975 pages_moved += 1 << order;
Mel Gormanc361be52007-10-16 01:25:51 -0700976 }
977
Mel Gormand1003132007-10-16 01:26:00 -0700978 return pages_moved;
Mel Gormanc361be52007-10-16 01:25:51 -0700979}
980
Minchan Kimee6f5092012-07-31 16:43:50 -0700981int move_freepages_block(struct zone *zone, struct page *page,
Linus Torvalds68e3e922012-06-03 20:05:57 -0700982 int migratetype)
Mel Gormanc361be52007-10-16 01:25:51 -0700983{
984 unsigned long start_pfn, end_pfn;
985 struct page *start_page, *end_page;
986
987 start_pfn = page_to_pfn(page);
Mel Gormand9c23402007-10-16 01:26:01 -0700988 start_pfn = start_pfn & ~(pageblock_nr_pages-1);
Mel Gormanc361be52007-10-16 01:25:51 -0700989 start_page = pfn_to_page(start_pfn);
Mel Gormand9c23402007-10-16 01:26:01 -0700990 end_page = start_page + pageblock_nr_pages - 1;
991 end_pfn = start_pfn + pageblock_nr_pages - 1;
Mel Gormanc361be52007-10-16 01:25:51 -0700992
993 /* Do not cross zone boundaries */
Cody P Schafer108bcc92013-02-22 16:35:23 -0800994 if (!zone_spans_pfn(zone, start_pfn))
Mel Gormanc361be52007-10-16 01:25:51 -0700995 start_page = page;
Cody P Schafer108bcc92013-02-22 16:35:23 -0800996 if (!zone_spans_pfn(zone, end_pfn))
Mel Gormanc361be52007-10-16 01:25:51 -0700997 return 0;
998
999 return move_freepages(zone, start_page, end_page, migratetype);
1000}
1001
Mel Gorman2f66a682009-09-21 17:02:31 -07001002static void change_pageblock_range(struct page *pageblock_page,
1003 int start_order, int migratetype)
1004{
1005 int nr_pageblocks = 1 << (start_order - pageblock_order);
1006
1007 while (nr_pageblocks--) {
1008 set_pageblock_migratetype(pageblock_page, migratetype);
1009 pageblock_page += pageblock_nr_pages;
1010 }
1011}
1012
Srivatsa S. Bhatfef903e2013-09-11 14:20:35 -07001013/*
1014 * If breaking a large block of pages, move all free pages to the preferred
1015 * allocation list. If falling back for a reclaimable kernel allocation, be
1016 * more aggressive about taking ownership of free pages.
1017 *
1018 * On the other hand, never change migration type of MIGRATE_CMA pageblocks
1019 * nor move CMA pages to different free lists. We don't want unmovable pages
1020 * to be allocated from MIGRATE_CMA areas.
1021 *
1022 * Returns the new migratetype of the pageblock (or the same old migratetype
1023 * if it was unchanged).
1024 */
1025static int try_to_steal_freepages(struct zone *zone, struct page *page,
1026 int start_type, int fallback_type)
1027{
1028 int current_order = page_order(page);
1029
KOSAKI Motohiro0cbef292013-11-12 15:08:20 -08001030 /*
1031 * When borrowing from MIGRATE_CMA, we need to release the excess
1032 * buddy pages to CMA itself.
1033 */
Srivatsa S. Bhatfef903e2013-09-11 14:20:35 -07001034 if (is_migrate_cma(fallback_type))
1035 return fallback_type;
1036
1037 /* Take ownership for orders >= pageblock_order */
1038 if (current_order >= pageblock_order) {
1039 change_pageblock_range(page, current_order, start_type);
1040 return start_type;
1041 }
1042
1043 if (current_order >= pageblock_order / 2 ||
1044 start_type == MIGRATE_RECLAIMABLE ||
1045 page_group_by_mobility_disabled) {
1046 int pages;
1047
1048 pages = move_freepages_block(zone, page, start_type);
1049
1050 /* Claim the whole block if over half of it is free */
1051 if (pages >= (1 << (pageblock_order-1)) ||
1052 page_group_by_mobility_disabled) {
1053
1054 set_pageblock_migratetype(page, start_type);
1055 return start_type;
1056 }
1057
1058 }
1059
1060 return fallback_type;
1061}
1062
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001063/* Remove an element from the buddy allocator from the fallback list */
Mel Gorman0ac3a402009-06-16 15:32:06 -07001064static inline struct page *
1065__rmqueue_fallback(struct zone *zone, int order, int start_migratetype)
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001066{
Pintu Kumarb8af2942013-09-11 14:20:34 -07001067 struct free_area *area;
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001068 int current_order;
1069 struct page *page;
Srivatsa S. Bhatfef903e2013-09-11 14:20:35 -07001070 int migratetype, new_type, i;
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001071
1072 /* Find the largest possible block of pages in the other list */
1073 for (current_order = MAX_ORDER-1; current_order >= order;
1074 --current_order) {
Michal Nazarewicz6d4a4912012-01-11 15:31:33 +01001075 for (i = 0;; i++) {
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001076 migratetype = fallbacks[start_migratetype][i];
1077
Mel Gorman56fd56b2007-10-16 01:25:58 -07001078 /* MIGRATE_RESERVE handled later if necessary */
1079 if (migratetype == MIGRATE_RESERVE)
Michal Nazarewicz6d4a4912012-01-11 15:31:33 +01001080 break;
Mel Gormane0104872007-10-16 01:25:53 -07001081
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001082 area = &(zone->free_area[current_order]);
1083 if (list_empty(&area->free_list[migratetype]))
1084 continue;
1085
1086 page = list_entry(area->free_list[migratetype].next,
1087 struct page, lru);
1088 area->nr_free--;
1089
Srivatsa S. Bhatfef903e2013-09-11 14:20:35 -07001090 new_type = try_to_steal_freepages(zone, page,
1091 start_migratetype,
1092 migratetype);
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001093
1094 /* Remove the page from the freelists */
1095 list_del(&page->lru);
1096 rmv_page_order(page);
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001097
Michal Nazarewicz47118af2011-12-29 13:09:50 +01001098 expand(zone, page, order, current_order, area,
KOSAKI Motohiro0cbef292013-11-12 15:08:20 -08001099 new_type);
Mel Gormane0fff1b2009-09-21 17:02:42 -07001100
KOSAKI Motohiro52c8f6a2013-11-12 15:08:19 -08001101 trace_mm_page_alloc_extfrag(page, order, current_order,
1102 start_migratetype, migratetype, new_type);
Mel Gormane0fff1b2009-09-21 17:02:42 -07001103
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001104 return page;
1105 }
1106 }
1107
Mel Gorman728ec982009-06-16 15:32:04 -07001108 return NULL;
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001109}
1110
Mel Gorman56fd56b2007-10-16 01:25:58 -07001111/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001112 * Do the hard work of removing an element from the buddy allocator.
1113 * Call me with the zone->lock already held.
1114 */
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001115static struct page *__rmqueue(struct zone *zone, unsigned int order,
1116 int migratetype)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001117{
Linus Torvalds1da177e2005-04-16 15:20:36 -07001118 struct page *page;
1119
Mel Gorman728ec982009-06-16 15:32:04 -07001120retry_reserve:
Mel Gorman56fd56b2007-10-16 01:25:58 -07001121 page = __rmqueue_smallest(zone, order, migratetype);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001122
Mel Gorman728ec982009-06-16 15:32:04 -07001123 if (unlikely(!page) && migratetype != MIGRATE_RESERVE) {
Mel Gorman56fd56b2007-10-16 01:25:58 -07001124 page = __rmqueue_fallback(zone, order, migratetype);
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001125
Mel Gorman728ec982009-06-16 15:32:04 -07001126 /*
1127 * Use MIGRATE_RESERVE rather than fail an allocation. goto
1128 * is used because __rmqueue_smallest is an inline function
1129 * and we want just one call site
1130 */
1131 if (!page) {
1132 migratetype = MIGRATE_RESERVE;
1133 goto retry_reserve;
1134 }
1135 }
1136
Mel Gorman0d3d0622009-09-21 17:02:44 -07001137 trace_mm_page_alloc_zone_locked(page, order, migratetype);
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001138 return page;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001139}
1140
Michal Nazarewicz5f63b722012-01-11 15:16:11 +01001141/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001142 * Obtain a specified number of elements from the buddy allocator, all under
1143 * a single hold of the lock, for efficiency. Add them to the supplied list.
1144 * Returns the number of new pages which were placed at *list.
1145 */
Michal Nazarewicz5f63b722012-01-11 15:16:11 +01001146static int rmqueue_bulk(struct zone *zone, unsigned int order,
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001147 unsigned long count, struct list_head *list,
Mel Gormane084b2d2009-07-29 15:02:04 -07001148 int migratetype, int cold)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001149{
Michal Nazarewicz47118af2011-12-29 13:09:50 +01001150 int mt = migratetype, i;
Michal Nazarewicz5f63b722012-01-11 15:16:11 +01001151
Nick Pigginc54ad302006-01-06 00:10:56 -08001152 spin_lock(&zone->lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001153 for (i = 0; i < count; ++i) {
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001154 struct page *page = __rmqueue(zone, order, migratetype);
Nick Piggin085cc7d2006-01-06 00:11:01 -08001155 if (unlikely(page == NULL))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001156 break;
Mel Gorman81eabcb2007-12-17 16:20:05 -08001157
1158 /*
1159 * Split buddy pages returned by expand() are received here
1160 * in physical page order. The page is added to the callers and
1161 * list and the list head then moves forward. From the callers
1162 * perspective, the linked list is ordered by page number in
1163 * some conditions. This is useful for IO devices that can
1164 * merge IO requests if the physical pages are ordered
1165 * properly.
1166 */
Mel Gormane084b2d2009-07-29 15:02:04 -07001167 if (likely(cold == 0))
1168 list_add(&page->lru, list);
1169 else
1170 list_add_tail(&page->lru, list);
Michal Nazarewicz47118af2011-12-29 13:09:50 +01001171 if (IS_ENABLED(CONFIG_CMA)) {
1172 mt = get_pageblock_migratetype(page);
Minchan Kim194159f2013-02-22 16:33:58 -08001173 if (!is_migrate_cma(mt) && !is_migrate_isolate(mt))
Michal Nazarewicz47118af2011-12-29 13:09:50 +01001174 mt = migratetype;
1175 }
Minchan Kimb12c4ad2012-10-08 16:32:08 -07001176 set_freepage_migratetype(page, mt);
Mel Gorman81eabcb2007-12-17 16:20:05 -08001177 list = &page->lru;
Bartlomiej Zolnierkiewiczd1ce7492012-10-08 16:32:02 -07001178 if (is_migrate_cma(mt))
1179 __mod_zone_page_state(zone, NR_FREE_CMA_PAGES,
1180 -(1 << order));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001181 }
Mel Gormanf2260e62009-06-16 15:32:13 -07001182 __mod_zone_page_state(zone, NR_FREE_PAGES, -(i << order));
Nick Pigginc54ad302006-01-06 00:10:56 -08001183 spin_unlock(&zone->lock);
Nick Piggin085cc7d2006-01-06 00:11:01 -08001184 return i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001185}
1186
Christoph Lameter4ae7c032005-06-21 17:14:57 -07001187#ifdef CONFIG_NUMA
Christoph Lameter8fce4d82006-03-09 17:33:54 -08001188/*
Christoph Lameter4037d452007-05-09 02:35:14 -07001189 * Called from the vmstat counter updater to drain pagesets of this
1190 * currently executing processor on remote nodes after they have
1191 * expired.
1192 *
Christoph Lameter879336c2006-03-22 00:09:08 -08001193 * Note that this function must be called with the thread pinned to
1194 * a single processor.
Christoph Lameter8fce4d82006-03-09 17:33:54 -08001195 */
Christoph Lameter4037d452007-05-09 02:35:14 -07001196void drain_zone_pages(struct zone *zone, struct per_cpu_pages *pcp)
Christoph Lameter4ae7c032005-06-21 17:14:57 -07001197{
Christoph Lameter4ae7c032005-06-21 17:14:57 -07001198 unsigned long flags;
Christoph Lameter4037d452007-05-09 02:35:14 -07001199 int to_drain;
Cody P Schafer998d39c2013-07-03 15:01:32 -07001200 unsigned long batch;
Christoph Lameter4ae7c032005-06-21 17:14:57 -07001201
Christoph Lameter4037d452007-05-09 02:35:14 -07001202 local_irq_save(flags);
Cody P Schafer998d39c2013-07-03 15:01:32 -07001203 batch = ACCESS_ONCE(pcp->batch);
1204 if (pcp->count >= batch)
1205 to_drain = batch;
Christoph Lameter4037d452007-05-09 02:35:14 -07001206 else
1207 to_drain = pcp->count;
KOSAKI Motohiro2a135152012-07-31 16:42:53 -07001208 if (to_drain > 0) {
1209 free_pcppages_bulk(zone, to_drain, pcp);
1210 pcp->count -= to_drain;
1211 }
Christoph Lameter4037d452007-05-09 02:35:14 -07001212 local_irq_restore(flags);
Christoph Lameter4ae7c032005-06-21 17:14:57 -07001213}
1214#endif
1215
Christoph Lameter9f8f2172008-02-04 22:29:11 -08001216/*
1217 * Drain pages of the indicated processor.
1218 *
1219 * The processor must either be the current processor and the
1220 * thread pinned to the current processor or a processor that
1221 * is not online.
1222 */
1223static void drain_pages(unsigned int cpu)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001224{
Nick Pigginc54ad302006-01-06 00:10:56 -08001225 unsigned long flags;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001226 struct zone *zone;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001227
KOSAKI Motohiroee99c712009-03-31 15:19:31 -07001228 for_each_populated_zone(zone) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001229 struct per_cpu_pageset *pset;
Christoph Lameter3dfa5722008-02-04 22:29:19 -08001230 struct per_cpu_pages *pcp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001231
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09001232 local_irq_save(flags);
1233 pset = per_cpu_ptr(zone->pageset, cpu);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001234
Christoph Lameter3dfa5722008-02-04 22:29:19 -08001235 pcp = &pset->pcp;
David Rientjes2ff754f2011-01-25 15:07:23 -08001236 if (pcp->count) {
1237 free_pcppages_bulk(zone, pcp->count, pcp);
1238 pcp->count = 0;
1239 }
Christoph Lameter3dfa5722008-02-04 22:29:19 -08001240 local_irq_restore(flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001241 }
1242}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001243
Christoph Lameter9f8f2172008-02-04 22:29:11 -08001244/*
1245 * Spill all of this CPU's per-cpu pages back into the buddy allocator.
1246 */
1247void drain_local_pages(void *arg)
1248{
1249 drain_pages(smp_processor_id());
1250}
1251
1252/*
Gilad Ben-Yossef74046492012-03-28 14:42:45 -07001253 * Spill all the per-cpu pages from all CPUs back into the buddy allocator.
1254 *
1255 * Note that this code is protected against sending an IPI to an offline
1256 * CPU but does not guarantee sending an IPI to newly hotplugged CPUs:
1257 * on_each_cpu_mask() blocks hotplug and won't talk to offlined CPUs but
1258 * nothing keeps CPUs from showing up after we populated the cpumask and
1259 * before the call to on_each_cpu_mask().
Christoph Lameter9f8f2172008-02-04 22:29:11 -08001260 */
1261void drain_all_pages(void)
1262{
Gilad Ben-Yossef74046492012-03-28 14:42:45 -07001263 int cpu;
1264 struct per_cpu_pageset *pcp;
1265 struct zone *zone;
1266
1267 /*
1268 * Allocate in the BSS so we wont require allocation in
1269 * direct reclaim path for CONFIG_CPUMASK_OFFSTACK=y
1270 */
1271 static cpumask_t cpus_with_pcps;
1272
1273 /*
1274 * We don't care about racing with CPU hotplug event
1275 * as offline notification will cause the notified
1276 * cpu to drain that CPU pcps and on_each_cpu_mask
1277 * disables preemption as part of its processing
1278 */
1279 for_each_online_cpu(cpu) {
1280 bool has_pcps = false;
1281 for_each_populated_zone(zone) {
1282 pcp = per_cpu_ptr(zone->pageset, cpu);
1283 if (pcp->pcp.count) {
1284 has_pcps = true;
1285 break;
1286 }
1287 }
1288 if (has_pcps)
1289 cpumask_set_cpu(cpu, &cpus_with_pcps);
1290 else
1291 cpumask_clear_cpu(cpu, &cpus_with_pcps);
1292 }
1293 on_each_cpu_mask(&cpus_with_pcps, drain_local_pages, NULL, 1);
Christoph Lameter9f8f2172008-02-04 22:29:11 -08001294}
1295
Rafael J. Wysocki296699d2007-07-29 23:27:18 +02001296#ifdef CONFIG_HIBERNATION
Linus Torvalds1da177e2005-04-16 15:20:36 -07001297
1298void mark_free_pages(struct zone *zone)
1299{
Rafael J. Wysockif623f0d2006-09-25 23:32:49 -07001300 unsigned long pfn, max_zone_pfn;
1301 unsigned long flags;
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001302 int order, t;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001303 struct list_head *curr;
1304
Xishi Qiu8080fc02013-09-11 14:21:45 -07001305 if (zone_is_empty(zone))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001306 return;
1307
1308 spin_lock_irqsave(&zone->lock, flags);
Rafael J. Wysockif623f0d2006-09-25 23:32:49 -07001309
Cody P Schafer108bcc92013-02-22 16:35:23 -08001310 max_zone_pfn = zone_end_pfn(zone);
Rafael J. Wysockif623f0d2006-09-25 23:32:49 -07001311 for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
1312 if (pfn_valid(pfn)) {
1313 struct page *page = pfn_to_page(pfn);
1314
Rafael J. Wysocki7be98232007-05-06 14:50:42 -07001315 if (!swsusp_page_is_forbidden(page))
1316 swsusp_unset_page_free(page);
Rafael J. Wysockif623f0d2006-09-25 23:32:49 -07001317 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001318
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001319 for_each_migratetype_order(order, t) {
1320 list_for_each(curr, &zone->free_area[order].free_list[t]) {
Rafael J. Wysockif623f0d2006-09-25 23:32:49 -07001321 unsigned long i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001322
Rafael J. Wysockif623f0d2006-09-25 23:32:49 -07001323 pfn = page_to_pfn(list_entry(curr, struct page, lru));
1324 for (i = 0; i < (1UL << order); i++)
Rafael J. Wysocki7be98232007-05-06 14:50:42 -07001325 swsusp_set_page_free(pfn_to_page(pfn + i));
Rafael J. Wysockif623f0d2006-09-25 23:32:49 -07001326 }
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001327 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001328 spin_unlock_irqrestore(&zone->lock, flags);
1329}
Mel Gormane2c55dc2007-10-16 01:25:50 -07001330#endif /* CONFIG_PM */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001331
1332/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001333 * Free a 0-order page
Li Hongfc916682010-03-05 13:41:54 -08001334 * cold == 1 ? free a cold page : free a hot page
Linus Torvalds1da177e2005-04-16 15:20:36 -07001335 */
Li Hongfc916682010-03-05 13:41:54 -08001336void free_hot_cold_page(struct page *page, int cold)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001337{
1338 struct zone *zone = page_zone(page);
1339 struct per_cpu_pages *pcp;
1340 unsigned long flags;
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001341 int migratetype;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001342
KOSAKI Motohiroec95f532010-05-24 14:32:38 -07001343 if (!free_pages_prepare(page, 0))
Hugh Dickins689bceb2005-11-21 21:32:20 -08001344 return;
1345
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001346 migratetype = get_pageblock_migratetype(page);
Minchan Kimb12c4ad2012-10-08 16:32:08 -07001347 set_freepage_migratetype(page, migratetype);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001348 local_irq_save(flags);
Christoph Lameterf8891e52006-06-30 01:55:45 -07001349 __count_vm_event(PGFREE);
Mel Gormanda456f12009-06-16 15:32:08 -07001350
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001351 /*
1352 * We only track unmovable, reclaimable and movable on pcp lists.
1353 * Free ISOLATE pages back to the allocator because they are being
1354 * offlined but treat RESERVE as movable pages so we can get those
1355 * areas back if necessary. Otherwise, we may have to free
1356 * excessively into the page allocator
1357 */
1358 if (migratetype >= MIGRATE_PCPTYPES) {
Minchan Kim194159f2013-02-22 16:33:58 -08001359 if (unlikely(is_migrate_isolate(migratetype))) {
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001360 free_one_page(zone, page, 0, migratetype);
1361 goto out;
1362 }
1363 migratetype = MIGRATE_MOVABLE;
1364 }
1365
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09001366 pcp = &this_cpu_ptr(zone->pageset)->pcp;
Christoph Lameter3dfa5722008-02-04 22:29:19 -08001367 if (cold)
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001368 list_add_tail(&page->lru, &pcp->lists[migratetype]);
Christoph Lameter3dfa5722008-02-04 22:29:19 -08001369 else
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001370 list_add(&page->lru, &pcp->lists[migratetype]);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001371 pcp->count++;
Nick Piggin48db57f2006-01-08 01:00:42 -08001372 if (pcp->count >= pcp->high) {
Cody P Schafer998d39c2013-07-03 15:01:32 -07001373 unsigned long batch = ACCESS_ONCE(pcp->batch);
1374 free_pcppages_bulk(zone, batch, pcp);
1375 pcp->count -= batch;
Nick Piggin48db57f2006-01-08 01:00:42 -08001376 }
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001377
1378out:
Linus Torvalds1da177e2005-04-16 15:20:36 -07001379 local_irq_restore(flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001380}
1381
Nick Piggin8dfcc9b2006-03-22 00:08:05 -08001382/*
Konstantin Khlebnikovcc598502012-01-10 15:07:04 -08001383 * Free a list of 0-order pages
1384 */
1385void free_hot_cold_page_list(struct list_head *list, int cold)
1386{
1387 struct page *page, *next;
1388
1389 list_for_each_entry_safe(page, next, list, lru) {
Konstantin Khlebnikovb413d482012-01-10 15:07:09 -08001390 trace_mm_page_free_batched(page, cold);
Konstantin Khlebnikovcc598502012-01-10 15:07:04 -08001391 free_hot_cold_page(page, cold);
1392 }
1393}
1394
1395/*
Nick Piggin8dfcc9b2006-03-22 00:08:05 -08001396 * split_page takes a non-compound higher-order page, and splits it into
1397 * n (1<<order) sub-pages: page[0..n]
1398 * Each sub-page must be freed individually.
1399 *
1400 * Note: this is probably too low level an operation for use in drivers.
1401 * Please consult with lkml before using this in your driver.
1402 */
1403void split_page(struct page *page, unsigned int order)
1404{
1405 int i;
1406
Nick Piggin725d7042006-09-25 23:30:55 -07001407 VM_BUG_ON(PageCompound(page));
1408 VM_BUG_ON(!page_count(page));
Vegard Nossumb1eeab62008-11-25 16:55:53 +01001409
1410#ifdef CONFIG_KMEMCHECK
1411 /*
1412 * Split shadow pages too, because free(page[0]) would
1413 * otherwise free the whole shadow.
1414 */
1415 if (kmemcheck_page_is_tracked(page))
1416 split_page(virt_to_page(page[0].shadow), order);
1417#endif
1418
Nick Piggin7835e982006-03-22 00:08:40 -08001419 for (i = 1; i < (1 << order); i++)
1420 set_page_refcounted(page + i);
Nick Piggin8dfcc9b2006-03-22 00:08:05 -08001421}
K. Y. Srinivasan5853ff22013-03-25 15:47:38 -07001422EXPORT_SYMBOL_GPL(split_page);
Nick Piggin8dfcc9b2006-03-22 00:08:05 -08001423
Mel Gorman8fb74b92013-01-11 14:32:16 -08001424static int __isolate_free_page(struct page *page, unsigned int order)
Mel Gorman748446b2010-05-24 14:32:27 -07001425{
Mel Gorman748446b2010-05-24 14:32:27 -07001426 unsigned long watermark;
1427 struct zone *zone;
Bartlomiej Zolnierkiewicz2139cbe2012-10-08 16:32:00 -07001428 int mt;
Mel Gorman748446b2010-05-24 14:32:27 -07001429
1430 BUG_ON(!PageBuddy(page));
1431
1432 zone = page_zone(page);
Marek Szyprowski2e30abd2012-12-11 16:02:57 -08001433 mt = get_pageblock_migratetype(page);
Mel Gorman748446b2010-05-24 14:32:27 -07001434
Minchan Kim194159f2013-02-22 16:33:58 -08001435 if (!is_migrate_isolate(mt)) {
Marek Szyprowski2e30abd2012-12-11 16:02:57 -08001436 /* Obey watermarks as if the page was being allocated */
1437 watermark = low_wmark_pages(zone) + (1 << order);
1438 if (!zone_watermark_ok(zone, 0, watermark, 0, 0))
1439 return 0;
1440
Mel Gorman8fb74b92013-01-11 14:32:16 -08001441 __mod_zone_freepage_state(zone, -(1UL << order), mt);
Marek Szyprowski2e30abd2012-12-11 16:02:57 -08001442 }
Mel Gorman748446b2010-05-24 14:32:27 -07001443
1444 /* Remove page from free list */
1445 list_del(&page->lru);
1446 zone->free_area[order].nr_free--;
1447 rmv_page_order(page);
Bartlomiej Zolnierkiewicz2139cbe2012-10-08 16:32:00 -07001448
Mel Gorman8fb74b92013-01-11 14:32:16 -08001449 /* Set the pageblock if the isolated page is at least a pageblock */
Mel Gorman748446b2010-05-24 14:32:27 -07001450 if (order >= pageblock_order - 1) {
1451 struct page *endpage = page + (1 << order) - 1;
Michal Nazarewicz47118af2011-12-29 13:09:50 +01001452 for (; page < endpage; page += pageblock_nr_pages) {
1453 int mt = get_pageblock_migratetype(page);
Minchan Kim194159f2013-02-22 16:33:58 -08001454 if (!is_migrate_isolate(mt) && !is_migrate_cma(mt))
Michal Nazarewicz47118af2011-12-29 13:09:50 +01001455 set_pageblock_migratetype(page,
1456 MIGRATE_MOVABLE);
1457 }
Mel Gorman748446b2010-05-24 14:32:27 -07001458 }
1459
Mel Gorman8fb74b92013-01-11 14:32:16 -08001460 return 1UL << order;
Mel Gorman1fb3f8c2012-10-08 16:29:12 -07001461}
1462
1463/*
1464 * Similar to split_page except the page is already free. As this is only
1465 * being used for migration, the migratetype of the block also changes.
1466 * As this is called with interrupts disabled, the caller is responsible
1467 * for calling arch_alloc_page() and kernel_map_page() after interrupts
1468 * are enabled.
1469 *
1470 * Note: this is probably too low level an operation for use in drivers.
1471 * Please consult with lkml before using this in your driver.
1472 */
1473int split_free_page(struct page *page)
1474{
1475 unsigned int order;
1476 int nr_pages;
1477
Mel Gorman1fb3f8c2012-10-08 16:29:12 -07001478 order = page_order(page);
1479
Mel Gorman8fb74b92013-01-11 14:32:16 -08001480 nr_pages = __isolate_free_page(page, order);
Mel Gorman1fb3f8c2012-10-08 16:29:12 -07001481 if (!nr_pages)
1482 return 0;
1483
1484 /* Split into individual pages */
1485 set_page_refcounted(page);
1486 split_page(page, order);
1487 return nr_pages;
Mel Gorman748446b2010-05-24 14:32:27 -07001488}
1489
1490/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001491 * Really, prep_compound_page() should be called from __rmqueue_bulk(). But
1492 * we cheat by calling it from here, in the order > 0 path. Saves a branch
1493 * or two.
1494 */
Mel Gorman0a15c3e2009-06-16 15:32:05 -07001495static inline
1496struct page *buffered_rmqueue(struct zone *preferred_zone,
Mel Gorman3dd28262009-06-16 15:32:00 -07001497 struct zone *zone, int order, gfp_t gfp_flags,
1498 int migratetype)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001499{
1500 unsigned long flags;
Hugh Dickins689bceb2005-11-21 21:32:20 -08001501 struct page *page;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001502 int cold = !!(gfp_flags & __GFP_COLD);
1503
Hugh Dickins689bceb2005-11-21 21:32:20 -08001504again:
Nick Piggin48db57f2006-01-08 01:00:42 -08001505 if (likely(order == 0)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001506 struct per_cpu_pages *pcp;
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001507 struct list_head *list;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001508
Linus Torvalds1da177e2005-04-16 15:20:36 -07001509 local_irq_save(flags);
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09001510 pcp = &this_cpu_ptr(zone->pageset)->pcp;
1511 list = &pcp->lists[migratetype];
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001512 if (list_empty(list)) {
Mel Gorman535131e62007-10-16 01:25:49 -07001513 pcp->count += rmqueue_bulk(zone, 0,
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001514 pcp->batch, list,
Mel Gormane084b2d2009-07-29 15:02:04 -07001515 migratetype, cold);
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001516 if (unlikely(list_empty(list)))
Shaohua Li6fb332f2009-09-21 17:01:17 -07001517 goto failed;
Mel Gorman535131e62007-10-16 01:25:49 -07001518 }
Mel Gormanb92a6ed2007-10-16 01:25:50 -07001519
Mel Gorman5f8dcc22009-09-21 17:03:19 -07001520 if (cold)
1521 page = list_entry(list->prev, struct page, lru);
1522 else
1523 page = list_entry(list->next, struct page, lru);
1524
Mel Gormanb92a6ed2007-10-16 01:25:50 -07001525 list_del(&page->lru);
1526 pcp->count--;
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001527 } else {
Andrew Mortondab48da2009-06-16 15:32:37 -07001528 if (unlikely(gfp_flags & __GFP_NOFAIL)) {
1529 /*
1530 * __GFP_NOFAIL is not to be used in new code.
1531 *
1532 * All __GFP_NOFAIL callers should be fixed so that they
1533 * properly detect and handle allocation failures.
1534 *
1535 * We most definitely don't want callers attempting to
Linus Torvalds4923abf2009-06-24 12:16:49 -07001536 * allocate greater than order-1 page units with
Andrew Mortondab48da2009-06-16 15:32:37 -07001537 * __GFP_NOFAIL.
1538 */
Linus Torvalds4923abf2009-06-24 12:16:49 -07001539 WARN_ON_ONCE(order > 1);
Andrew Mortondab48da2009-06-16 15:32:37 -07001540 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001541 spin_lock_irqsave(&zone->lock, flags);
Mel Gormanb2a0ac82007-10-16 01:25:48 -07001542 page = __rmqueue(zone, order, migratetype);
Nick Piggina74609f2006-01-06 00:11:20 -08001543 spin_unlock(&zone->lock);
1544 if (!page)
1545 goto failed;
Bartlomiej Zolnierkiewiczd1ce7492012-10-08 16:32:02 -07001546 __mod_zone_freepage_state(zone, -(1 << order),
1547 get_pageblock_migratetype(page));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001548 }
1549
Johannes Weiner81c0a2b2013-09-11 14:20:47 -07001550 __mod_zone_page_state(zone, NR_ALLOC_BATCH, -(1 << order));
Christoph Lameterf8891e52006-06-30 01:55:45 -07001551 __count_zone_vm_events(PGALLOC, zone, 1 << order);
Andi Kleen78afd562011-03-22 16:33:12 -07001552 zone_statistics(preferred_zone, zone, gfp_flags);
Nick Piggina74609f2006-01-06 00:11:20 -08001553 local_irq_restore(flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001554
Nick Piggin725d7042006-09-25 23:30:55 -07001555 VM_BUG_ON(bad_range(zone, page));
Nick Piggin17cf4402006-03-22 00:08:41 -08001556 if (prep_new_page(page, order, gfp_flags))
Nick Piggina74609f2006-01-06 00:11:20 -08001557 goto again;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001558 return page;
Nick Piggina74609f2006-01-06 00:11:20 -08001559
1560failed:
1561 local_irq_restore(flags);
Nick Piggina74609f2006-01-06 00:11:20 -08001562 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001563}
1564
Akinobu Mita933e3122006-12-08 02:39:45 -08001565#ifdef CONFIG_FAIL_PAGE_ALLOC
1566
Akinobu Mitab2588c42011-07-26 16:09:03 -07001567static struct {
Akinobu Mita933e3122006-12-08 02:39:45 -08001568 struct fault_attr attr;
1569
1570 u32 ignore_gfp_highmem;
1571 u32 ignore_gfp_wait;
Akinobu Mita54114992007-07-15 23:40:23 -07001572 u32 min_order;
Akinobu Mita933e3122006-12-08 02:39:45 -08001573} fail_page_alloc = {
1574 .attr = FAULT_ATTR_INITIALIZER,
Don Mullis6b1b60f2006-12-08 02:39:53 -08001575 .ignore_gfp_wait = 1,
1576 .ignore_gfp_highmem = 1,
Akinobu Mita54114992007-07-15 23:40:23 -07001577 .min_order = 1,
Akinobu Mita933e3122006-12-08 02:39:45 -08001578};
1579
1580static int __init setup_fail_page_alloc(char *str)
1581{
1582 return setup_fault_attr(&fail_page_alloc.attr, str);
1583}
1584__setup("fail_page_alloc=", setup_fail_page_alloc);
1585
Gavin Shandeaf3862012-07-31 16:41:51 -07001586static bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
Akinobu Mita933e3122006-12-08 02:39:45 -08001587{
Akinobu Mita54114992007-07-15 23:40:23 -07001588 if (order < fail_page_alloc.min_order)
Gavin Shandeaf3862012-07-31 16:41:51 -07001589 return false;
Akinobu Mita933e3122006-12-08 02:39:45 -08001590 if (gfp_mask & __GFP_NOFAIL)
Gavin Shandeaf3862012-07-31 16:41:51 -07001591 return false;
Akinobu Mita933e3122006-12-08 02:39:45 -08001592 if (fail_page_alloc.ignore_gfp_highmem && (gfp_mask & __GFP_HIGHMEM))
Gavin Shandeaf3862012-07-31 16:41:51 -07001593 return false;
Akinobu Mita933e3122006-12-08 02:39:45 -08001594 if (fail_page_alloc.ignore_gfp_wait && (gfp_mask & __GFP_WAIT))
Gavin Shandeaf3862012-07-31 16:41:51 -07001595 return false;
Akinobu Mita933e3122006-12-08 02:39:45 -08001596
1597 return should_fail(&fail_page_alloc.attr, 1 << order);
1598}
1599
1600#ifdef CONFIG_FAULT_INJECTION_DEBUG_FS
1601
1602static int __init fail_page_alloc_debugfs(void)
1603{
Al Virof4ae40a2011-07-24 04:33:43 -04001604 umode_t mode = S_IFREG | S_IRUSR | S_IWUSR;
Akinobu Mita933e3122006-12-08 02:39:45 -08001605 struct dentry *dir;
Akinobu Mita933e3122006-12-08 02:39:45 -08001606
Akinobu Mitadd48c082011-08-03 16:21:01 -07001607 dir = fault_create_debugfs_attr("fail_page_alloc", NULL,
1608 &fail_page_alloc.attr);
1609 if (IS_ERR(dir))
1610 return PTR_ERR(dir);
Akinobu Mita933e3122006-12-08 02:39:45 -08001611
Akinobu Mitab2588c42011-07-26 16:09:03 -07001612 if (!debugfs_create_bool("ignore-gfp-wait", mode, dir,
1613 &fail_page_alloc.ignore_gfp_wait))
1614 goto fail;
1615 if (!debugfs_create_bool("ignore-gfp-highmem", mode, dir,
1616 &fail_page_alloc.ignore_gfp_highmem))
1617 goto fail;
1618 if (!debugfs_create_u32("min-order", mode, dir,
1619 &fail_page_alloc.min_order))
1620 goto fail;
Akinobu Mita933e3122006-12-08 02:39:45 -08001621
Akinobu Mitab2588c42011-07-26 16:09:03 -07001622 return 0;
1623fail:
Akinobu Mitadd48c082011-08-03 16:21:01 -07001624 debugfs_remove_recursive(dir);
Akinobu Mita933e3122006-12-08 02:39:45 -08001625
Akinobu Mitab2588c42011-07-26 16:09:03 -07001626 return -ENOMEM;
Akinobu Mita933e3122006-12-08 02:39:45 -08001627}
1628
1629late_initcall(fail_page_alloc_debugfs);
1630
1631#endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */
1632
1633#else /* CONFIG_FAIL_PAGE_ALLOC */
1634
Gavin Shandeaf3862012-07-31 16:41:51 -07001635static inline bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
Akinobu Mita933e3122006-12-08 02:39:45 -08001636{
Gavin Shandeaf3862012-07-31 16:41:51 -07001637 return false;
Akinobu Mita933e3122006-12-08 02:39:45 -08001638}
1639
1640#endif /* CONFIG_FAIL_PAGE_ALLOC */
1641
Linus Torvalds1da177e2005-04-16 15:20:36 -07001642/*
Mel Gorman88f5acf2011-01-13 15:45:41 -08001643 * Return true if free pages are above 'mark'. This takes into account the order
Linus Torvalds1da177e2005-04-16 15:20:36 -07001644 * of the allocation.
1645 */
Mel Gorman88f5acf2011-01-13 15:45:41 -08001646static bool __zone_watermark_ok(struct zone *z, int order, unsigned long mark,
1647 int classzone_idx, int alloc_flags, long free_pages)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001648{
1649 /* free_pages my go negative - that's OK */
Christoph Lameterd23ad422007-02-10 01:43:02 -08001650 long min = mark;
Minchan Kim2cfed072012-07-31 16:43:53 -07001651 long lowmem_reserve = z->lowmem_reserve[classzone_idx];
Linus Torvalds1da177e2005-04-16 15:20:36 -07001652 int o;
Tomasz Stanislawski026b0812013-06-12 14:05:02 -07001653 long free_cma = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001654
Michal Hockodf0a6da2012-01-10 15:08:02 -08001655 free_pages -= (1 << order) - 1;
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001656 if (alloc_flags & ALLOC_HIGH)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001657 min -= min / 2;
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001658 if (alloc_flags & ALLOC_HARDER)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001659 min -= min / 4;
Bartlomiej Zolnierkiewiczd95ea5d2012-10-08 16:32:05 -07001660#ifdef CONFIG_CMA
1661 /* If allocation can't use CMA areas don't use free CMA pages */
1662 if (!(alloc_flags & ALLOC_CMA))
Tomasz Stanislawski026b0812013-06-12 14:05:02 -07001663 free_cma = zone_page_state(z, NR_FREE_CMA_PAGES);
Bartlomiej Zolnierkiewiczd95ea5d2012-10-08 16:32:05 -07001664#endif
Tomasz Stanislawski026b0812013-06-12 14:05:02 -07001665
1666 if (free_pages - free_cma <= min + lowmem_reserve)
Mel Gorman88f5acf2011-01-13 15:45:41 -08001667 return false;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001668 for (o = 0; o < order; o++) {
1669 /* At the next order, this order's pages become unavailable */
1670 free_pages -= z->free_area[o].nr_free << o;
1671
1672 /* Require fewer higher order pages to be free */
1673 min >>= 1;
1674
1675 if (free_pages <= min)
Mel Gorman88f5acf2011-01-13 15:45:41 -08001676 return false;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001677 }
Mel Gorman88f5acf2011-01-13 15:45:41 -08001678 return true;
1679}
1680
1681bool zone_watermark_ok(struct zone *z, int order, unsigned long mark,
1682 int classzone_idx, int alloc_flags)
1683{
1684 return __zone_watermark_ok(z, order, mark, classzone_idx, alloc_flags,
1685 zone_page_state(z, NR_FREE_PAGES));
1686}
1687
1688bool zone_watermark_ok_safe(struct zone *z, int order, unsigned long mark,
1689 int classzone_idx, int alloc_flags)
1690{
1691 long free_pages = zone_page_state(z, NR_FREE_PAGES);
1692
1693 if (z->percpu_drift_mark && free_pages < z->percpu_drift_mark)
1694 free_pages = zone_page_state_snapshot(z, NR_FREE_PAGES);
1695
1696 return __zone_watermark_ok(z, order, mark, classzone_idx, alloc_flags,
1697 free_pages);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001698}
1699
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001700#ifdef CONFIG_NUMA
1701/*
1702 * zlc_setup - Setup for "zonelist cache". Uses cached zone data to
1703 * skip over zones that are not allowed by the cpuset, or that have
1704 * been recently (in last second) found to be nearly full. See further
1705 * comments in mmzone.h. Reduces cache footprint of zonelist scans
Simon Arlott183ff222007-10-20 01:27:18 +02001706 * that have to skip over a lot of full or unallowed zones.
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001707 *
Zhi Yong Wua1aeb652013-11-12 15:08:29 -08001708 * If the zonelist cache is present in the passed zonelist, then
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001709 * returns a pointer to the allowed node mask (either the current
Lai Jiangshan4b0ef1fe2012-12-12 13:51:46 -08001710 * tasks mems_allowed, or node_states[N_MEMORY].)
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001711 *
1712 * If the zonelist cache is not available for this zonelist, does
1713 * nothing and returns NULL.
1714 *
1715 * If the fullzones BITMAP in the zonelist cache is stale (more than
1716 * a second since last zap'd) then we zap it out (clear its bits.)
1717 *
1718 * We hold off even calling zlc_setup, until after we've checked the
1719 * first zone in the zonelist, on the theory that most allocations will
1720 * be satisfied from that first zone, so best to examine that zone as
1721 * quickly as we can.
1722 */
1723static nodemask_t *zlc_setup(struct zonelist *zonelist, int alloc_flags)
1724{
1725 struct zonelist_cache *zlc; /* cached zonelist speedup info */
1726 nodemask_t *allowednodes; /* zonelist_cache approximation */
1727
1728 zlc = zonelist->zlcache_ptr;
1729 if (!zlc)
1730 return NULL;
1731
S.Caglar Onurf05111f2008-04-28 02:12:38 -07001732 if (time_after(jiffies, zlc->last_full_zap + HZ)) {
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001733 bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST);
1734 zlc->last_full_zap = jiffies;
1735 }
1736
1737 allowednodes = !in_interrupt() && (alloc_flags & ALLOC_CPUSET) ?
1738 &cpuset_current_mems_allowed :
Lai Jiangshan4b0ef1fe2012-12-12 13:51:46 -08001739 &node_states[N_MEMORY];
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001740 return allowednodes;
1741}
1742
1743/*
1744 * Given 'z' scanning a zonelist, run a couple of quick checks to see
1745 * if it is worth looking at further for free memory:
1746 * 1) Check that the zone isn't thought to be full (doesn't have its
1747 * bit set in the zonelist_cache fullzones BITMAP).
1748 * 2) Check that the zones node (obtained from the zonelist_cache
1749 * z_to_n[] mapping) is allowed in the passed in allowednodes mask.
1750 * Return true (non-zero) if zone is worth looking at further, or
1751 * else return false (zero) if it is not.
1752 *
1753 * This check -ignores- the distinction between various watermarks,
1754 * such as GFP_HIGH, GFP_ATOMIC, PF_MEMALLOC, ... If a zone is
1755 * found to be full for any variation of these watermarks, it will
1756 * be considered full for up to one second by all requests, unless
1757 * we are so low on memory on all allowed nodes that we are forced
1758 * into the second scan of the zonelist.
1759 *
1760 * In the second scan we ignore this zonelist cache and exactly
1761 * apply the watermarks to all zones, even it is slower to do so.
1762 * We are low on memory in the second scan, and should leave no stone
1763 * unturned looking for a free page.
1764 */
Mel Gormandd1a2392008-04-28 02:12:17 -07001765static int zlc_zone_worth_trying(struct zonelist *zonelist, struct zoneref *z,
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001766 nodemask_t *allowednodes)
1767{
1768 struct zonelist_cache *zlc; /* cached zonelist speedup info */
1769 int i; /* index of *z in zonelist zones */
1770 int n; /* node that zone *z is on */
1771
1772 zlc = zonelist->zlcache_ptr;
1773 if (!zlc)
1774 return 1;
1775
Mel Gormandd1a2392008-04-28 02:12:17 -07001776 i = z - zonelist->_zonerefs;
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001777 n = zlc->z_to_n[i];
1778
1779 /* This zone is worth trying if it is allowed but not full */
1780 return node_isset(n, *allowednodes) && !test_bit(i, zlc->fullzones);
1781}
1782
1783/*
1784 * Given 'z' scanning a zonelist, set the corresponding bit in
1785 * zlc->fullzones, so that subsequent attempts to allocate a page
1786 * from that zone don't waste time re-examining it.
1787 */
Mel Gormandd1a2392008-04-28 02:12:17 -07001788static void zlc_mark_zone_full(struct zonelist *zonelist, struct zoneref *z)
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001789{
1790 struct zonelist_cache *zlc; /* cached zonelist speedup info */
1791 int i; /* index of *z in zonelist zones */
1792
1793 zlc = zonelist->zlcache_ptr;
1794 if (!zlc)
1795 return;
1796
Mel Gormandd1a2392008-04-28 02:12:17 -07001797 i = z - zonelist->_zonerefs;
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001798
1799 set_bit(i, zlc->fullzones);
1800}
1801
Mel Gorman76d3fbf2011-07-25 17:12:30 -07001802/*
1803 * clear all zones full, called after direct reclaim makes progress so that
1804 * a zone that was recently full is not skipped over for up to a second
1805 */
1806static void zlc_clear_zones_full(struct zonelist *zonelist)
1807{
1808 struct zonelist_cache *zlc; /* cached zonelist speedup info */
1809
1810 zlc = zonelist->zlcache_ptr;
1811 if (!zlc)
1812 return;
1813
1814 bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST);
1815}
1816
Johannes Weiner81c0a2b2013-09-11 14:20:47 -07001817static bool zone_local(struct zone *local_zone, struct zone *zone)
1818{
1819 return node_distance(local_zone->node, zone->node) == LOCAL_DISTANCE;
1820}
1821
David Rientjes957f8222012-10-08 16:33:24 -07001822static bool zone_allows_reclaim(struct zone *local_zone, struct zone *zone)
1823{
1824 return node_isset(local_zone->node, zone->zone_pgdat->reclaim_nodes);
1825}
1826
1827static void __paginginit init_zone_allows_reclaim(int nid)
1828{
1829 int i;
1830
1831 for_each_online_node(i)
David Rientjes6b187d022012-10-25 13:38:08 -07001832 if (node_distance(nid, i) <= RECLAIM_DISTANCE)
David Rientjes957f8222012-10-08 16:33:24 -07001833 node_set(i, NODE_DATA(nid)->reclaim_nodes);
David Rientjes6b187d022012-10-25 13:38:08 -07001834 else
David Rientjes957f8222012-10-08 16:33:24 -07001835 zone_reclaim_mode = 1;
David Rientjes957f8222012-10-08 16:33:24 -07001836}
1837
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001838#else /* CONFIG_NUMA */
1839
1840static nodemask_t *zlc_setup(struct zonelist *zonelist, int alloc_flags)
1841{
1842 return NULL;
1843}
1844
Mel Gormandd1a2392008-04-28 02:12:17 -07001845static int zlc_zone_worth_trying(struct zonelist *zonelist, struct zoneref *z,
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001846 nodemask_t *allowednodes)
1847{
1848 return 1;
1849}
1850
Mel Gormandd1a2392008-04-28 02:12:17 -07001851static void zlc_mark_zone_full(struct zonelist *zonelist, struct zoneref *z)
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001852{
1853}
Mel Gorman76d3fbf2011-07-25 17:12:30 -07001854
1855static void zlc_clear_zones_full(struct zonelist *zonelist)
1856{
1857}
David Rientjes957f8222012-10-08 16:33:24 -07001858
Johannes Weiner81c0a2b2013-09-11 14:20:47 -07001859static bool zone_local(struct zone *local_zone, struct zone *zone)
1860{
1861 return true;
1862}
1863
David Rientjes957f8222012-10-08 16:33:24 -07001864static bool zone_allows_reclaim(struct zone *local_zone, struct zone *zone)
1865{
1866 return true;
1867}
1868
1869static inline void init_zone_allows_reclaim(int nid)
1870{
1871}
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001872#endif /* CONFIG_NUMA */
1873
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001874/*
Paul Jackson0798e512006-12-06 20:31:38 -08001875 * get_page_from_freelist goes through the zonelist trying to allocate
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001876 * a page.
1877 */
1878static struct page *
Mel Gorman19770b32008-04-28 02:12:18 -07001879get_page_from_freelist(gfp_t gfp_mask, nodemask_t *nodemask, unsigned int order,
Mel Gorman5117f452009-06-16 15:31:59 -07001880 struct zonelist *zonelist, int high_zoneidx, int alloc_flags,
Mel Gorman3dd28262009-06-16 15:32:00 -07001881 struct zone *preferred_zone, int migratetype)
Martin Hicks753ee722005-06-21 17:14:41 -07001882{
Mel Gormandd1a2392008-04-28 02:12:17 -07001883 struct zoneref *z;
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001884 struct page *page = NULL;
Mel Gorman54a6eb52008-04-28 02:12:16 -07001885 int classzone_idx;
Mel Gorman5117f452009-06-16 15:31:59 -07001886 struct zone *zone;
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001887 nodemask_t *allowednodes = NULL;/* zonelist_cache approximation */
1888 int zlc_active = 0; /* set if using zonelist_cache */
1889 int did_zlc_setup = 0; /* just call zlc_setup() one time */
Mel Gorman54a6eb52008-04-28 02:12:16 -07001890
Mel Gorman19770b32008-04-28 02:12:18 -07001891 classzone_idx = zone_idx(preferred_zone);
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001892zonelist_scan:
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001893 /*
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001894 * Scan zonelist, looking for a zone with enough free.
SeungHun Lee3b11f0a2013-09-11 14:22:23 -07001895 * See also __cpuset_node_allowed_softwall() comment in kernel/cpuset.c.
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001896 */
Mel Gorman19770b32008-04-28 02:12:18 -07001897 for_each_zone_zonelist_nodemask(zone, z, zonelist,
1898 high_zoneidx, nodemask) {
Johannes Weinere085dbc2013-09-11 14:20:46 -07001899 unsigned long mark;
1900
Kirill A. Shutemove5adfff2012-12-11 16:00:29 -08001901 if (IS_ENABLED(CONFIG_NUMA) && zlc_active &&
Paul Jackson9276b1bc2006-12-06 20:31:48 -08001902 !zlc_zone_worth_trying(zonelist, z, allowednodes))
1903 continue;
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001904 if ((alloc_flags & ALLOC_CPUSET) &&
Paul Jackson02a0e532006-12-13 00:34:25 -08001905 !cpuset_zone_allowed_softwall(zone, gfp_mask))
Mel Gormancd38b112011-07-25 17:12:29 -07001906 continue;
Johannes Weinere085dbc2013-09-11 14:20:46 -07001907 BUILD_BUG_ON(ALLOC_NO_WATERMARKS < NR_WMARK);
Joonsoo Kime66f0972013-09-11 14:21:26 -07001908 if (unlikely(alloc_flags & ALLOC_NO_WATERMARKS))
Johannes Weinere085dbc2013-09-11 14:20:46 -07001909 goto try_this_zone;
Johannes Weinera756cf52012-01-10 15:07:49 -08001910 /*
Johannes Weiner81c0a2b2013-09-11 14:20:47 -07001911 * Distribute pages in proportion to the individual
1912 * zone size to ensure fair page aging. The zone a
1913 * page was allocated in should have no effect on the
1914 * time the page has in memory before being reclaimed.
1915 *
1916 * When zone_reclaim_mode is enabled, try to stay in
1917 * local zones in the fastpath. If that fails, the
1918 * slowpath is entered, which will do another pass
1919 * starting with the local zones, but ultimately fall
1920 * back to remote zones that do not partake in the
1921 * fairness round-robin cycle of this zonelist.
1922 */
1923 if (alloc_flags & ALLOC_WMARK_LOW) {
1924 if (zone_page_state(zone, NR_ALLOC_BATCH) <= 0)
1925 continue;
1926 if (zone_reclaim_mode &&
1927 !zone_local(preferred_zone, zone))
1928 continue;
1929 }
1930 /*
Johannes Weinera756cf52012-01-10 15:07:49 -08001931 * When allocating a page cache page for writing, we
1932 * want to get it from a zone that is within its dirty
1933 * limit, such that no single zone holds more than its
1934 * proportional share of globally allowed dirty pages.
1935 * The dirty limits take into account the zone's
1936 * lowmem reserves and high watermark so that kswapd
1937 * should be able to balance it without having to
1938 * write pages from its LRU list.
1939 *
1940 * This may look like it could increase pressure on
1941 * lower zones by failing allocations in higher zones
1942 * before they are full. But the pages that do spill
1943 * over are limited as the lower zones are protected
1944 * by this very same mechanism. It should not become
1945 * a practical burden to them.
1946 *
1947 * XXX: For now, allow allocations to potentially
1948 * exceed the per-zone dirty limit in the slowpath
1949 * (ALLOC_WMARK_LOW unset) before going into reclaim,
1950 * which is important when on a NUMA setup the allowed
1951 * zones are together not big enough to reach the
1952 * global limit. The proper fix for these situations
1953 * will require awareness of zones in the
1954 * dirty-throttling and the flusher threads.
1955 */
1956 if ((alloc_flags & ALLOC_WMARK_LOW) &&
1957 (gfp_mask & __GFP_WRITE) && !zone_dirty_ok(zone))
1958 goto this_zone_full;
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08001959
Johannes Weinere085dbc2013-09-11 14:20:46 -07001960 mark = zone->watermark[alloc_flags & ALLOC_WMARK_MASK];
1961 if (!zone_watermark_ok(zone, order, mark,
1962 classzone_idx, alloc_flags)) {
Mel Gormanfa5e0842009-06-16 15:33:22 -07001963 int ret;
1964
Kirill A. Shutemove5adfff2012-12-11 16:00:29 -08001965 if (IS_ENABLED(CONFIG_NUMA) &&
1966 !did_zlc_setup && nr_online_nodes > 1) {
Mel Gormancd38b112011-07-25 17:12:29 -07001967 /*
1968 * we do zlc_setup if there are multiple nodes
1969 * and before considering the first zone allowed
1970 * by the cpuset.
1971 */
1972 allowednodes = zlc_setup(zonelist, alloc_flags);
1973 zlc_active = 1;
1974 did_zlc_setup = 1;
1975 }
1976
David Rientjes957f8222012-10-08 16:33:24 -07001977 if (zone_reclaim_mode == 0 ||
1978 !zone_allows_reclaim(preferred_zone, zone))
Mel Gormanfa5e0842009-06-16 15:33:22 -07001979 goto this_zone_full;
1980
Mel Gormancd38b112011-07-25 17:12:29 -07001981 /*
1982 * As we may have just activated ZLC, check if the first
1983 * eligible zone has failed zone_reclaim recently.
1984 */
Kirill A. Shutemove5adfff2012-12-11 16:00:29 -08001985 if (IS_ENABLED(CONFIG_NUMA) && zlc_active &&
Mel Gormancd38b112011-07-25 17:12:29 -07001986 !zlc_zone_worth_trying(zonelist, z, allowednodes))
1987 continue;
1988
Mel Gormanfa5e0842009-06-16 15:33:22 -07001989 ret = zone_reclaim(zone, gfp_mask, order);
1990 switch (ret) {
1991 case ZONE_RECLAIM_NOSCAN:
1992 /* did not scan */
Mel Gormancd38b112011-07-25 17:12:29 -07001993 continue;
Mel Gormanfa5e0842009-06-16 15:33:22 -07001994 case ZONE_RECLAIM_FULL:
1995 /* scanned but unreclaimable */
Mel Gormancd38b112011-07-25 17:12:29 -07001996 continue;
Mel Gormanfa5e0842009-06-16 15:33:22 -07001997 default:
1998 /* did we reclaim enough */
Mel Gormanfed27192013-04-29 15:07:57 -07001999 if (zone_watermark_ok(zone, order, mark,
Mel Gormanfa5e0842009-06-16 15:33:22 -07002000 classzone_idx, alloc_flags))
Mel Gormanfed27192013-04-29 15:07:57 -07002001 goto try_this_zone;
2002
2003 /*
2004 * Failed to reclaim enough to meet watermark.
2005 * Only mark the zone full if checking the min
2006 * watermark or if we failed to reclaim just
2007 * 1<<order pages or else the page allocator
2008 * fastpath will prematurely mark zones full
2009 * when the watermark is between the low and
2010 * min watermarks.
2011 */
2012 if (((alloc_flags & ALLOC_WMARK_MASK) == ALLOC_WMARK_MIN) ||
2013 ret == ZONE_RECLAIM_SOME)
Paul Jackson9276b1bc2006-12-06 20:31:48 -08002014 goto this_zone_full;
Mel Gormanfed27192013-04-29 15:07:57 -07002015
2016 continue;
Paul Jackson0798e512006-12-06 20:31:38 -08002017 }
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08002018 }
2019
Mel Gormanfa5e0842009-06-16 15:33:22 -07002020try_this_zone:
Mel Gorman3dd28262009-06-16 15:32:00 -07002021 page = buffered_rmqueue(preferred_zone, zone, order,
2022 gfp_mask, migratetype);
Paul Jackson0798e512006-12-06 20:31:38 -08002023 if (page)
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08002024 break;
Paul Jackson9276b1bc2006-12-06 20:31:48 -08002025this_zone_full:
Kirill A. Shutemove5adfff2012-12-11 16:00:29 -08002026 if (IS_ENABLED(CONFIG_NUMA))
Paul Jackson9276b1bc2006-12-06 20:31:48 -08002027 zlc_mark_zone_full(zonelist, z);
Mel Gorman54a6eb52008-04-28 02:12:16 -07002028 }
Paul Jackson9276b1bc2006-12-06 20:31:48 -08002029
Kirill A. Shutemove5adfff2012-12-11 16:00:29 -08002030 if (unlikely(IS_ENABLED(CONFIG_NUMA) && page == NULL && zlc_active)) {
Paul Jackson9276b1bc2006-12-06 20:31:48 -08002031 /* Disable zlc cache for second zonelist scan */
2032 zlc_active = 0;
2033 goto zonelist_scan;
2034 }
Alex Shib1211862012-08-21 16:16:08 -07002035
2036 if (page)
2037 /*
2038 * page->pfmemalloc is set when ALLOC_NO_WATERMARKS was
2039 * necessary to allocate the page. The expectation is
2040 * that the caller is taking steps that will free more
2041 * memory. The caller should avoid the page being used
2042 * for !PFMEMALLOC purposes.
2043 */
2044 page->pfmemalloc = !!(alloc_flags & ALLOC_NO_WATERMARKS);
2045
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08002046 return page;
Martin Hicks753ee722005-06-21 17:14:41 -07002047}
2048
David Rientjes29423e772011-03-22 16:30:47 -07002049/*
2050 * Large machines with many possible nodes should not always dump per-node
2051 * meminfo in irq context.
2052 */
2053static inline bool should_suppress_show_mem(void)
2054{
2055 bool ret = false;
2056
2057#if NODES_SHIFT > 8
2058 ret = in_interrupt();
2059#endif
2060 return ret;
2061}
2062
Dave Hansena238ab52011-05-24 17:12:16 -07002063static DEFINE_RATELIMIT_STATE(nopage_rs,
2064 DEFAULT_RATELIMIT_INTERVAL,
2065 DEFAULT_RATELIMIT_BURST);
2066
2067void warn_alloc_failed(gfp_t gfp_mask, int order, const char *fmt, ...)
2068{
Dave Hansena238ab52011-05-24 17:12:16 -07002069 unsigned int filter = SHOW_MEM_FILTER_NODES;
2070
Stanislaw Gruszkac0a32fc52012-01-10 15:07:28 -08002071 if ((gfp_mask & __GFP_NOWARN) || !__ratelimit(&nopage_rs) ||
2072 debug_guardpage_minorder() > 0)
Dave Hansena238ab52011-05-24 17:12:16 -07002073 return;
2074
2075 /*
David Rientjes4b59e6c2013-04-29 15:06:11 -07002076 * Walking all memory to count page types is very expensive and should
2077 * be inhibited in non-blockable contexts.
2078 */
2079 if (!(gfp_mask & __GFP_WAIT))
2080 filter |= SHOW_MEM_FILTER_PAGE_COUNT;
2081
2082 /*
Dave Hansena238ab52011-05-24 17:12:16 -07002083 * This documents exceptions given to allocations in certain
2084 * contexts that are allowed to allocate outside current's set
2085 * of allowed nodes.
2086 */
2087 if (!(gfp_mask & __GFP_NOMEMALLOC))
2088 if (test_thread_flag(TIF_MEMDIE) ||
2089 (current->flags & (PF_MEMALLOC | PF_EXITING)))
2090 filter &= ~SHOW_MEM_FILTER_NODES;
2091 if (in_interrupt() || !(gfp_mask & __GFP_WAIT))
2092 filter &= ~SHOW_MEM_FILTER_NODES;
2093
2094 if (fmt) {
Joe Perches3ee9a4f2011-10-31 17:08:35 -07002095 struct va_format vaf;
2096 va_list args;
2097
Dave Hansena238ab52011-05-24 17:12:16 -07002098 va_start(args, fmt);
Joe Perches3ee9a4f2011-10-31 17:08:35 -07002099
2100 vaf.fmt = fmt;
2101 vaf.va = &args;
2102
2103 pr_warn("%pV", &vaf);
2104
Dave Hansena238ab52011-05-24 17:12:16 -07002105 va_end(args);
2106 }
2107
Joe Perches3ee9a4f2011-10-31 17:08:35 -07002108 pr_warn("%s: page allocation failure: order:%d, mode:0x%x\n",
2109 current->comm, order, gfp_mask);
Dave Hansena238ab52011-05-24 17:12:16 -07002110
2111 dump_stack();
2112 if (!should_suppress_show_mem())
2113 show_mem(filter);
2114}
2115
Mel Gorman11e33f62009-06-16 15:31:57 -07002116static inline int
2117should_alloc_retry(gfp_t gfp_mask, unsigned int order,
Mel Gormanf90ac392012-01-10 15:07:15 -08002118 unsigned long did_some_progress,
Mel Gorman11e33f62009-06-16 15:31:57 -07002119 unsigned long pages_reclaimed)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002120{
Mel Gorman11e33f62009-06-16 15:31:57 -07002121 /* Do not loop if specifically requested */
2122 if (gfp_mask & __GFP_NORETRY)
2123 return 0;
2124
Mel Gormanf90ac392012-01-10 15:07:15 -08002125 /* Always retry if specifically requested */
2126 if (gfp_mask & __GFP_NOFAIL)
2127 return 1;
2128
2129 /*
2130 * Suspend converts GFP_KERNEL to __GFP_WAIT which can prevent reclaim
2131 * making forward progress without invoking OOM. Suspend also disables
2132 * storage devices so kswapd will not help. Bail if we are suspending.
2133 */
2134 if (!did_some_progress && pm_suspended_storage())
2135 return 0;
2136
Mel Gorman11e33f62009-06-16 15:31:57 -07002137 /*
2138 * In this implementation, order <= PAGE_ALLOC_COSTLY_ORDER
2139 * means __GFP_NOFAIL, but that may not be true in other
2140 * implementations.
2141 */
2142 if (order <= PAGE_ALLOC_COSTLY_ORDER)
2143 return 1;
2144
2145 /*
2146 * For order > PAGE_ALLOC_COSTLY_ORDER, if __GFP_REPEAT is
2147 * specified, then we retry until we no longer reclaim any pages
2148 * (above), or we've reclaimed an order of pages at least as
2149 * large as the allocation's order. In both cases, if the
2150 * allocation still fails, we stop retrying.
2151 */
2152 if (gfp_mask & __GFP_REPEAT && pages_reclaimed < (1 << order))
2153 return 1;
2154
Mel Gorman11e33f62009-06-16 15:31:57 -07002155 return 0;
2156}
2157
2158static inline struct page *
2159__alloc_pages_may_oom(gfp_t gfp_mask, unsigned int order,
2160 struct zonelist *zonelist, enum zone_type high_zoneidx,
Mel Gorman3dd28262009-06-16 15:32:00 -07002161 nodemask_t *nodemask, struct zone *preferred_zone,
2162 int migratetype)
Mel Gorman11e33f62009-06-16 15:31:57 -07002163{
Linus Torvalds1da177e2005-04-16 15:20:36 -07002164 struct page *page;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002165
Mel Gorman11e33f62009-06-16 15:31:57 -07002166 /* Acquire the OOM killer lock for the zones in zonelist */
Minchan Kimff321fe2010-08-09 17:18:57 -07002167 if (!try_set_zonelist_oom(zonelist, gfp_mask)) {
Mel Gorman11e33f62009-06-16 15:31:57 -07002168 schedule_timeout_uninterruptible(1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002169 return NULL;
2170 }
Jens Axboe6b1de912005-11-17 21:35:02 +01002171
Mel Gorman11e33f62009-06-16 15:31:57 -07002172 /*
2173 * Go through the zonelist yet one more time, keep very high watermark
2174 * here, this is only to catch a parallel oom killing, we must fail if
2175 * we're still under heavy pressure.
2176 */
2177 page = get_page_from_freelist(gfp_mask|__GFP_HARDWALL, nodemask,
2178 order, zonelist, high_zoneidx,
Mel Gorman5117f452009-06-16 15:31:59 -07002179 ALLOC_WMARK_HIGH|ALLOC_CPUSET,
Mel Gorman3dd28262009-06-16 15:32:00 -07002180 preferred_zone, migratetype);
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08002181 if (page)
Mel Gorman11e33f62009-06-16 15:31:57 -07002182 goto out;
2183
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -08002184 if (!(gfp_mask & __GFP_NOFAIL)) {
2185 /* The OOM killer will not help higher order allocs */
2186 if (order > PAGE_ALLOC_COSTLY_ORDER)
2187 goto out;
David Rientjes03668b32010-08-09 17:18:54 -07002188 /* The OOM killer does not needlessly kill tasks for lowmem */
2189 if (high_zoneidx < ZONE_NORMAL)
2190 goto out;
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -08002191 /*
2192 * GFP_THISNODE contains __GFP_NORETRY and we never hit this.
2193 * Sanity check for bare calls of __GFP_THISNODE, not real OOM.
2194 * The caller should handle page allocation failure by itself if
2195 * it specifies __GFP_THISNODE.
2196 * Note: Hugepage uses it but will hit PAGE_ALLOC_COSTLY_ORDER.
2197 */
2198 if (gfp_mask & __GFP_THISNODE)
2199 goto out;
2200 }
Mel Gorman11e33f62009-06-16 15:31:57 -07002201 /* Exhausted what can be done so it's blamo time */
David Rientjes08ab9b12012-03-21 16:34:04 -07002202 out_of_memory(zonelist, gfp_mask, order, nodemask, false);
Mel Gorman11e33f62009-06-16 15:31:57 -07002203
2204out:
2205 clear_zonelist_oom(zonelist, gfp_mask);
2206 return page;
2207}
2208
Mel Gorman56de7262010-05-24 14:32:30 -07002209#ifdef CONFIG_COMPACTION
2210/* Try memory compaction for high-order allocations before reclaim */
2211static struct page *
2212__alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
2213 struct zonelist *zonelist, enum zone_type high_zoneidx,
2214 nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone,
Mel Gorman66199712012-01-12 17:19:41 -08002215 int migratetype, bool sync_migration,
Mel Gormanc67fe372012-08-21 16:16:17 -07002216 bool *contended_compaction, bool *deferred_compaction,
Mel Gorman66199712012-01-12 17:19:41 -08002217 unsigned long *did_some_progress)
Mel Gorman56de7262010-05-24 14:32:30 -07002218{
Mel Gorman66199712012-01-12 17:19:41 -08002219 if (!order)
Mel Gorman56de7262010-05-24 14:32:30 -07002220 return NULL;
2221
Rik van Rielaff62242012-03-21 16:33:52 -07002222 if (compaction_deferred(preferred_zone, order)) {
Mel Gorman66199712012-01-12 17:19:41 -08002223 *deferred_compaction = true;
2224 return NULL;
2225 }
2226
Andrew Mortonc06b1fc2011-01-13 15:47:32 -08002227 current->flags |= PF_MEMALLOC;
Mel Gorman56de7262010-05-24 14:32:30 -07002228 *did_some_progress = try_to_compact_pages(zonelist, order, gfp_mask,
Mel Gormanc67fe372012-08-21 16:16:17 -07002229 nodemask, sync_migration,
Mel Gorman8fb74b92013-01-11 14:32:16 -08002230 contended_compaction);
Andrew Mortonc06b1fc2011-01-13 15:47:32 -08002231 current->flags &= ~PF_MEMALLOC;
Mel Gorman56de7262010-05-24 14:32:30 -07002232
Mel Gorman1fb3f8c2012-10-08 16:29:12 -07002233 if (*did_some_progress != COMPACT_SKIPPED) {
Mel Gorman8fb74b92013-01-11 14:32:16 -08002234 struct page *page;
2235
Mel Gorman56de7262010-05-24 14:32:30 -07002236 /* Page migration frees to the PCP lists but we want merging */
2237 drain_pages(get_cpu());
2238 put_cpu();
2239
2240 page = get_page_from_freelist(gfp_mask, nodemask,
2241 order, zonelist, high_zoneidx,
Mel Gormancfd19c52012-07-31 16:44:10 -07002242 alloc_flags & ~ALLOC_NO_WATERMARKS,
2243 preferred_zone, migratetype);
Mel Gorman56de7262010-05-24 14:32:30 -07002244 if (page) {
Mel Gorman62997022012-10-08 16:32:47 -07002245 preferred_zone->compact_blockskip_flush = false;
Mel Gorman4f92e252010-05-24 14:32:32 -07002246 preferred_zone->compact_considered = 0;
2247 preferred_zone->compact_defer_shift = 0;
Rik van Rielaff62242012-03-21 16:33:52 -07002248 if (order >= preferred_zone->compact_order_failed)
2249 preferred_zone->compact_order_failed = order + 1;
Mel Gorman56de7262010-05-24 14:32:30 -07002250 count_vm_event(COMPACTSUCCESS);
2251 return page;
2252 }
2253
2254 /*
2255 * It's bad if compaction run occurs and fails.
2256 * The most likely reason is that pages exist,
2257 * but not enough to satisfy watermarks.
2258 */
2259 count_vm_event(COMPACTFAIL);
Mel Gorman66199712012-01-12 17:19:41 -08002260
2261 /*
2262 * As async compaction considers a subset of pageblocks, only
2263 * defer if the failure was a sync compaction failure.
2264 */
2265 if (sync_migration)
Rik van Rielaff62242012-03-21 16:33:52 -07002266 defer_compaction(preferred_zone, order);
Mel Gorman56de7262010-05-24 14:32:30 -07002267
2268 cond_resched();
2269 }
2270
2271 return NULL;
2272}
2273#else
2274static inline struct page *
2275__alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
2276 struct zonelist *zonelist, enum zone_type high_zoneidx,
2277 nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone,
Mel Gorman66199712012-01-12 17:19:41 -08002278 int migratetype, bool sync_migration,
Mel Gormanc67fe372012-08-21 16:16:17 -07002279 bool *contended_compaction, bool *deferred_compaction,
Mel Gorman66199712012-01-12 17:19:41 -08002280 unsigned long *did_some_progress)
Mel Gorman56de7262010-05-24 14:32:30 -07002281{
2282 return NULL;
2283}
2284#endif /* CONFIG_COMPACTION */
2285
Marek Szyprowskibba90712012-01-25 12:09:52 +01002286/* Perform direct synchronous page reclaim */
2287static int
2288__perform_reclaim(gfp_t gfp_mask, unsigned int order, struct zonelist *zonelist,
2289 nodemask_t *nodemask)
Mel Gorman11e33f62009-06-16 15:31:57 -07002290{
Mel Gorman11e33f62009-06-16 15:31:57 -07002291 struct reclaim_state reclaim_state;
Marek Szyprowskibba90712012-01-25 12:09:52 +01002292 int progress;
Mel Gorman11e33f62009-06-16 15:31:57 -07002293
2294 cond_resched();
2295
2296 /* We now go into synchronous reclaim */
2297 cpuset_memory_pressure_bump();
Andrew Mortonc06b1fc2011-01-13 15:47:32 -08002298 current->flags |= PF_MEMALLOC;
Mel Gorman11e33f62009-06-16 15:31:57 -07002299 lockdep_set_current_reclaim_state(gfp_mask);
2300 reclaim_state.reclaimed_slab = 0;
Andrew Mortonc06b1fc2011-01-13 15:47:32 -08002301 current->reclaim_state = &reclaim_state;
Mel Gorman11e33f62009-06-16 15:31:57 -07002302
Marek Szyprowskibba90712012-01-25 12:09:52 +01002303 progress = try_to_free_pages(zonelist, order, gfp_mask, nodemask);
Mel Gorman11e33f62009-06-16 15:31:57 -07002304
Andrew Mortonc06b1fc2011-01-13 15:47:32 -08002305 current->reclaim_state = NULL;
Mel Gorman11e33f62009-06-16 15:31:57 -07002306 lockdep_clear_current_reclaim_state();
Andrew Mortonc06b1fc2011-01-13 15:47:32 -08002307 current->flags &= ~PF_MEMALLOC;
Mel Gorman11e33f62009-06-16 15:31:57 -07002308
2309 cond_resched();
2310
Marek Szyprowskibba90712012-01-25 12:09:52 +01002311 return progress;
2312}
2313
2314/* The really slow allocator path where we enter direct reclaim */
2315static inline struct page *
2316__alloc_pages_direct_reclaim(gfp_t gfp_mask, unsigned int order,
2317 struct zonelist *zonelist, enum zone_type high_zoneidx,
2318 nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone,
2319 int migratetype, unsigned long *did_some_progress)
2320{
2321 struct page *page = NULL;
2322 bool drained = false;
2323
2324 *did_some_progress = __perform_reclaim(gfp_mask, order, zonelist,
2325 nodemask);
Mel Gorman9ee493c2010-09-09 16:38:18 -07002326 if (unlikely(!(*did_some_progress)))
2327 return NULL;
Mel Gorman11e33f62009-06-16 15:31:57 -07002328
Mel Gorman76d3fbf2011-07-25 17:12:30 -07002329 /* After successful reclaim, reconsider all zones for allocation */
Kirill A. Shutemove5adfff2012-12-11 16:00:29 -08002330 if (IS_ENABLED(CONFIG_NUMA))
Mel Gorman76d3fbf2011-07-25 17:12:30 -07002331 zlc_clear_zones_full(zonelist);
2332
Mel Gorman9ee493c2010-09-09 16:38:18 -07002333retry:
2334 page = get_page_from_freelist(gfp_mask, nodemask, order,
Mel Gorman5117f452009-06-16 15:31:59 -07002335 zonelist, high_zoneidx,
Mel Gormancfd19c52012-07-31 16:44:10 -07002336 alloc_flags & ~ALLOC_NO_WATERMARKS,
2337 preferred_zone, migratetype);
Mel Gorman9ee493c2010-09-09 16:38:18 -07002338
2339 /*
2340 * If an allocation failed after direct reclaim, it could be because
2341 * pages are pinned on the per-cpu lists. Drain them and try again
2342 */
2343 if (!page && !drained) {
2344 drain_all_pages();
2345 drained = true;
2346 goto retry;
2347 }
2348
Mel Gorman11e33f62009-06-16 15:31:57 -07002349 return page;
2350}
2351
Mel Gorman11e33f62009-06-16 15:31:57 -07002352/*
2353 * This is called in the allocator slow-path if the allocation request is of
2354 * sufficient urgency to ignore watermarks and take other desperate measures
2355 */
2356static inline struct page *
2357__alloc_pages_high_priority(gfp_t gfp_mask, unsigned int order,
2358 struct zonelist *zonelist, enum zone_type high_zoneidx,
Mel Gorman3dd28262009-06-16 15:32:00 -07002359 nodemask_t *nodemask, struct zone *preferred_zone,
2360 int migratetype)
Mel Gorman11e33f62009-06-16 15:31:57 -07002361{
2362 struct page *page;
2363
2364 do {
2365 page = get_page_from_freelist(gfp_mask, nodemask, order,
Mel Gorman5117f452009-06-16 15:31:59 -07002366 zonelist, high_zoneidx, ALLOC_NO_WATERMARKS,
Mel Gorman3dd28262009-06-16 15:32:00 -07002367 preferred_zone, migratetype);
Mel Gorman11e33f62009-06-16 15:31:57 -07002368
2369 if (!page && gfp_mask & __GFP_NOFAIL)
Mel Gorman0e093d992010-10-26 14:21:45 -07002370 wait_iff_congested(preferred_zone, BLK_RW_ASYNC, HZ/50);
Mel Gorman11e33f62009-06-16 15:31:57 -07002371 } while (!page && (gfp_mask & __GFP_NOFAIL));
2372
2373 return page;
2374}
2375
Johannes Weiner81c0a2b2013-09-11 14:20:47 -07002376static void prepare_slowpath(gfp_t gfp_mask, unsigned int order,
2377 struct zonelist *zonelist,
2378 enum zone_type high_zoneidx,
2379 struct zone *preferred_zone)
Mel Gorman11e33f62009-06-16 15:31:57 -07002380{
2381 struct zoneref *z;
2382 struct zone *zone;
2383
Johannes Weiner81c0a2b2013-09-11 14:20:47 -07002384 for_each_zone_zonelist(zone, z, zonelist, high_zoneidx) {
2385 if (!(gfp_mask & __GFP_NO_KSWAPD))
2386 wakeup_kswapd(zone, order, zone_idx(preferred_zone));
2387 /*
2388 * Only reset the batches of zones that were actually
2389 * considered in the fast path, we don't want to
2390 * thrash fairness information for zones that are not
2391 * actually part of this zonelist's round-robin cycle.
2392 */
2393 if (zone_reclaim_mode && !zone_local(preferred_zone, zone))
2394 continue;
2395 mod_zone_page_state(zone, NR_ALLOC_BATCH,
2396 high_wmark_pages(zone) -
2397 low_wmark_pages(zone) -
2398 zone_page_state(zone, NR_ALLOC_BATCH));
2399 }
Mel Gorman11e33f62009-06-16 15:31:57 -07002400}
2401
Peter Zijlstra341ce062009-06-16 15:32:02 -07002402static inline int
2403gfp_to_alloc_flags(gfp_t gfp_mask)
2404{
Peter Zijlstra341ce062009-06-16 15:32:02 -07002405 int alloc_flags = ALLOC_WMARK_MIN | ALLOC_CPUSET;
2406 const gfp_t wait = gfp_mask & __GFP_WAIT;
2407
Mel Gormana56f57f2009-06-16 15:32:02 -07002408 /* __GFP_HIGH is assumed to be the same as ALLOC_HIGH to save a branch. */
Namhyung Kime6223a32010-10-26 14:21:59 -07002409 BUILD_BUG_ON(__GFP_HIGH != (__force gfp_t) ALLOC_HIGH);
Mel Gormana56f57f2009-06-16 15:32:02 -07002410
Peter Zijlstra341ce062009-06-16 15:32:02 -07002411 /*
2412 * The caller may dip into page reserves a bit more if the caller
2413 * cannot run direct reclaim, or if the caller has realtime scheduling
2414 * policy or is asking for __GFP_HIGH memory. GFP_ATOMIC requests will
2415 * set both ALLOC_HARDER (!wait) and ALLOC_HIGH (__GFP_HIGH).
2416 */
Namhyung Kime6223a32010-10-26 14:21:59 -07002417 alloc_flags |= (__force int) (gfp_mask & __GFP_HIGH);
Peter Zijlstra341ce062009-06-16 15:32:02 -07002418
2419 if (!wait) {
Andrea Arcangeli5c3240d2011-01-13 15:46:49 -08002420 /*
2421 * Not worth trying to allocate harder for
2422 * __GFP_NOMEMALLOC even if it can't schedule.
2423 */
2424 if (!(gfp_mask & __GFP_NOMEMALLOC))
2425 alloc_flags |= ALLOC_HARDER;
Peter Zijlstra341ce062009-06-16 15:32:02 -07002426 /*
2427 * Ignore cpuset if GFP_ATOMIC (!wait) rather than fail alloc.
2428 * See also cpuset_zone_allowed() comment in kernel/cpuset.c.
2429 */
2430 alloc_flags &= ~ALLOC_CPUSET;
Andrew Mortonc06b1fc2011-01-13 15:47:32 -08002431 } else if (unlikely(rt_task(current)) && !in_interrupt())
Peter Zijlstra341ce062009-06-16 15:32:02 -07002432 alloc_flags |= ALLOC_HARDER;
2433
Mel Gormanb37f1dd2012-07-31 16:44:03 -07002434 if (likely(!(gfp_mask & __GFP_NOMEMALLOC))) {
2435 if (gfp_mask & __GFP_MEMALLOC)
2436 alloc_flags |= ALLOC_NO_WATERMARKS;
Mel Gorman907aed42012-07-31 16:44:07 -07002437 else if (in_serving_softirq() && (current->flags & PF_MEMALLOC))
2438 alloc_flags |= ALLOC_NO_WATERMARKS;
2439 else if (!in_interrupt() &&
2440 ((current->flags & PF_MEMALLOC) ||
2441 unlikely(test_thread_flag(TIF_MEMDIE))))
Peter Zijlstra341ce062009-06-16 15:32:02 -07002442 alloc_flags |= ALLOC_NO_WATERMARKS;
2443 }
Bartlomiej Zolnierkiewiczd95ea5d2012-10-08 16:32:05 -07002444#ifdef CONFIG_CMA
2445 if (allocflags_to_migratetype(gfp_mask) == MIGRATE_MOVABLE)
2446 alloc_flags |= ALLOC_CMA;
2447#endif
Peter Zijlstra341ce062009-06-16 15:32:02 -07002448 return alloc_flags;
2449}
2450
Mel Gorman072bb0a2012-07-31 16:43:58 -07002451bool gfp_pfmemalloc_allowed(gfp_t gfp_mask)
2452{
Mel Gormanb37f1dd2012-07-31 16:44:03 -07002453 return !!(gfp_to_alloc_flags(gfp_mask) & ALLOC_NO_WATERMARKS);
Mel Gorman072bb0a2012-07-31 16:43:58 -07002454}
2455
Mel Gorman11e33f62009-06-16 15:31:57 -07002456static inline struct page *
2457__alloc_pages_slowpath(gfp_t gfp_mask, unsigned int order,
2458 struct zonelist *zonelist, enum zone_type high_zoneidx,
Mel Gorman3dd28262009-06-16 15:32:00 -07002459 nodemask_t *nodemask, struct zone *preferred_zone,
2460 int migratetype)
Mel Gorman11e33f62009-06-16 15:31:57 -07002461{
2462 const gfp_t wait = gfp_mask & __GFP_WAIT;
2463 struct page *page = NULL;
2464 int alloc_flags;
2465 unsigned long pages_reclaimed = 0;
2466 unsigned long did_some_progress;
Mel Gorman77f1fe62011-01-13 15:45:57 -08002467 bool sync_migration = false;
Mel Gorman66199712012-01-12 17:19:41 -08002468 bool deferred_compaction = false;
Mel Gormanc67fe372012-08-21 16:16:17 -07002469 bool contended_compaction = false;
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08002470
Christoph Lameter952f3b52006-12-06 20:33:26 -08002471 /*
Mel Gorman72807a72009-06-16 15:32:18 -07002472 * In the slowpath, we sanity check order to avoid ever trying to
2473 * reclaim >= MAX_ORDER areas which will never succeed. Callers may
2474 * be using allocators in order of preference for an area that is
2475 * too large.
2476 */
Mel Gorman1fc28b72009-07-29 15:04:08 -07002477 if (order >= MAX_ORDER) {
2478 WARN_ON_ONCE(!(gfp_mask & __GFP_NOWARN));
Mel Gorman72807a72009-06-16 15:32:18 -07002479 return NULL;
Mel Gorman1fc28b72009-07-29 15:04:08 -07002480 }
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08002481
Christoph Lameter952f3b52006-12-06 20:33:26 -08002482 /*
2483 * GFP_THISNODE (meaning __GFP_THISNODE, __GFP_NORETRY and
2484 * __GFP_NOWARN set) should not cause reclaim since the subsystem
2485 * (f.e. slab) using GFP_THISNODE may choose to trigger reclaim
2486 * using a larger set of nodes after it has established that the
2487 * allowed per node queues are empty and that nodes are
2488 * over allocated.
2489 */
Kirill A. Shutemove5adfff2012-12-11 16:00:29 -08002490 if (IS_ENABLED(CONFIG_NUMA) &&
2491 (gfp_mask & GFP_THISNODE) == GFP_THISNODE)
Christoph Lameter952f3b52006-12-06 20:33:26 -08002492 goto nopage;
2493
Mel Gormancc4a6852009-11-11 14:26:14 -08002494restart:
Johannes Weiner81c0a2b2013-09-11 14:20:47 -07002495 prepare_slowpath(gfp_mask, order, zonelist,
2496 high_zoneidx, preferred_zone);
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08002497
Paul Jackson9bf22292005-09-06 15:18:12 -07002498 /*
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08002499 * OK, we're below the kswapd watermark and have kicked background
2500 * reclaim. Now things get more complex, so set up alloc_flags according
2501 * to how we want to proceed.
Paul Jackson9bf22292005-09-06 15:18:12 -07002502 */
Peter Zijlstra341ce062009-06-16 15:32:02 -07002503 alloc_flags = gfp_to_alloc_flags(gfp_mask);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002504
David Rientjesf33261d2011-01-25 15:07:20 -08002505 /*
2506 * Find the true preferred zone if the allocation is unconstrained by
2507 * cpusets.
2508 */
2509 if (!(alloc_flags & ALLOC_CPUSET) && !nodemask)
2510 first_zones_zonelist(zonelist, high_zoneidx, NULL,
2511 &preferred_zone);
2512
Andrew Barrycfa54a02011-05-24 17:12:52 -07002513rebalance:
Peter Zijlstra341ce062009-06-16 15:32:02 -07002514 /* This is the last chance, in general, before the goto nopage. */
Mel Gorman19770b32008-04-28 02:12:18 -07002515 page = get_page_from_freelist(gfp_mask, nodemask, order, zonelist,
Peter Zijlstra341ce062009-06-16 15:32:02 -07002516 high_zoneidx, alloc_flags & ~ALLOC_NO_WATERMARKS,
2517 preferred_zone, migratetype);
Rohit Seth7fb1d9f2005-11-13 16:06:43 -08002518 if (page)
2519 goto got_pg;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002520
Mel Gorman11e33f62009-06-16 15:31:57 -07002521 /* Allocate without watermarks if the context allows */
Peter Zijlstra341ce062009-06-16 15:32:02 -07002522 if (alloc_flags & ALLOC_NO_WATERMARKS) {
Mel Gorman183f6372012-07-31 16:44:12 -07002523 /*
2524 * Ignore mempolicies if ALLOC_NO_WATERMARKS on the grounds
2525 * the allocation is high priority and these type of
2526 * allocations are system rather than user orientated
2527 */
2528 zonelist = node_zonelist(numa_node_id(), gfp_mask);
2529
Peter Zijlstra341ce062009-06-16 15:32:02 -07002530 page = __alloc_pages_high_priority(gfp_mask, order,
2531 zonelist, high_zoneidx, nodemask,
2532 preferred_zone, migratetype);
Mel Gormancfd19c52012-07-31 16:44:10 -07002533 if (page) {
Peter Zijlstra341ce062009-06-16 15:32:02 -07002534 goto got_pg;
Mel Gormancfd19c52012-07-31 16:44:10 -07002535 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002536 }
2537
2538 /* Atomic allocations - we can't balance anything */
2539 if (!wait)
2540 goto nopage;
2541
Peter Zijlstra341ce062009-06-16 15:32:02 -07002542 /* Avoid recursion of direct reclaim */
Andrew Mortonc06b1fc2011-01-13 15:47:32 -08002543 if (current->flags & PF_MEMALLOC)
Peter Zijlstra341ce062009-06-16 15:32:02 -07002544 goto nopage;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002545
David Rientjes6583bb62009-07-29 15:02:06 -07002546 /* Avoid allocations with no watermarks from looping endlessly */
2547 if (test_thread_flag(TIF_MEMDIE) && !(gfp_mask & __GFP_NOFAIL))
2548 goto nopage;
2549
Mel Gorman77f1fe62011-01-13 15:45:57 -08002550 /*
2551 * Try direct compaction. The first pass is asynchronous. Subsequent
2552 * attempts after direct reclaim are synchronous
2553 */
Mel Gorman56de7262010-05-24 14:32:30 -07002554 page = __alloc_pages_direct_compact(gfp_mask, order,
2555 zonelist, high_zoneidx,
2556 nodemask,
2557 alloc_flags, preferred_zone,
Mel Gorman66199712012-01-12 17:19:41 -08002558 migratetype, sync_migration,
Mel Gormanc67fe372012-08-21 16:16:17 -07002559 &contended_compaction,
Mel Gorman66199712012-01-12 17:19:41 -08002560 &deferred_compaction,
2561 &did_some_progress);
Mel Gorman56de7262010-05-24 14:32:30 -07002562 if (page)
2563 goto got_pg;
Andrea Arcangelic6a140b2011-05-24 17:11:38 -07002564 sync_migration = true;
Mel Gorman56de7262010-05-24 14:32:30 -07002565
Linus Torvalds31f8d422012-12-10 10:47:45 -08002566 /*
2567 * If compaction is deferred for high-order allocations, it is because
2568 * sync compaction recently failed. In this is the case and the caller
2569 * requested a movable allocation that does not heavily disrupt the
2570 * system then fail the allocation instead of entering direct reclaim.
2571 */
2572 if ((deferred_compaction || contended_compaction) &&
Linus Torvaldscaf49192012-12-10 10:51:16 -08002573 (gfp_mask & __GFP_NO_KSWAPD))
Linus Torvalds31f8d422012-12-10 10:47:45 -08002574 goto nopage;
Mel Gorman66199712012-01-12 17:19:41 -08002575
Mel Gorman11e33f62009-06-16 15:31:57 -07002576 /* Try direct reclaim and then allocating */
2577 page = __alloc_pages_direct_reclaim(gfp_mask, order,
2578 zonelist, high_zoneidx,
2579 nodemask,
Mel Gorman5117f452009-06-16 15:31:59 -07002580 alloc_flags, preferred_zone,
Mel Gorman3dd28262009-06-16 15:32:00 -07002581 migratetype, &did_some_progress);
Mel Gorman11e33f62009-06-16 15:31:57 -07002582 if (page)
2583 goto got_pg;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002584
Linus Torvalds1da177e2005-04-16 15:20:36 -07002585 /*
Mel Gorman11e33f62009-06-16 15:31:57 -07002586 * If we failed to make any progress reclaiming, then we are
2587 * running out of options and have to consider going OOM
Linus Torvalds1da177e2005-04-16 15:20:36 -07002588 */
Mel Gorman11e33f62009-06-16 15:31:57 -07002589 if (!did_some_progress) {
Qiang Huangb9921ec2013-11-12 15:07:22 -08002590 if (oom_gfp_allowed(gfp_mask)) {
Rafael J. Wysocki7f33d492009-06-16 15:32:41 -07002591 if (oom_killer_disabled)
2592 goto nopage;
David Rientjes29fd66d2012-03-28 14:42:41 -07002593 /* Coredumps can quickly deplete all memory reserves */
2594 if ((current->flags & PF_DUMPCORE) &&
2595 !(gfp_mask & __GFP_NOFAIL))
2596 goto nopage;
Mel Gorman11e33f62009-06-16 15:31:57 -07002597 page = __alloc_pages_may_oom(gfp_mask, order,
2598 zonelist, high_zoneidx,
Mel Gorman3dd28262009-06-16 15:32:00 -07002599 nodemask, preferred_zone,
2600 migratetype);
Mel Gorman11e33f62009-06-16 15:31:57 -07002601 if (page)
2602 goto got_pg;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002603
David Rientjes03668b32010-08-09 17:18:54 -07002604 if (!(gfp_mask & __GFP_NOFAIL)) {
2605 /*
2606 * The oom killer is not called for high-order
2607 * allocations that may fail, so if no progress
2608 * is being made, there are no other options and
2609 * retrying is unlikely to help.
2610 */
2611 if (order > PAGE_ALLOC_COSTLY_ORDER)
2612 goto nopage;
2613 /*
2614 * The oom killer is not called for lowmem
2615 * allocations to prevent needlessly killing
2616 * innocent tasks.
2617 */
2618 if (high_zoneidx < ZONE_NORMAL)
2619 goto nopage;
2620 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002621
Linus Torvalds1da177e2005-04-16 15:20:36 -07002622 goto restart;
2623 }
2624 }
2625
Mel Gorman11e33f62009-06-16 15:31:57 -07002626 /* Check if we should retry the allocation */
Nishanth Aravamudana41f24e2008-04-29 00:58:25 -07002627 pages_reclaimed += did_some_progress;
Mel Gormanf90ac392012-01-10 15:07:15 -08002628 if (should_alloc_retry(gfp_mask, order, did_some_progress,
2629 pages_reclaimed)) {
Mel Gorman11e33f62009-06-16 15:31:57 -07002630 /* Wait for some write requests to complete then retry */
Mel Gorman0e093d992010-10-26 14:21:45 -07002631 wait_iff_congested(preferred_zone, BLK_RW_ASYNC, HZ/50);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002632 goto rebalance;
Mel Gorman3e7d3442011-01-13 15:45:56 -08002633 } else {
2634 /*
2635 * High-order allocations do not necessarily loop after
2636 * direct reclaim and reclaim/compaction depends on compaction
2637 * being called after reclaim so call directly if necessary
2638 */
2639 page = __alloc_pages_direct_compact(gfp_mask, order,
2640 zonelist, high_zoneidx,
2641 nodemask,
2642 alloc_flags, preferred_zone,
Mel Gorman66199712012-01-12 17:19:41 -08002643 migratetype, sync_migration,
Mel Gormanc67fe372012-08-21 16:16:17 -07002644 &contended_compaction,
Mel Gorman66199712012-01-12 17:19:41 -08002645 &deferred_compaction,
2646 &did_some_progress);
Mel Gorman3e7d3442011-01-13 15:45:56 -08002647 if (page)
2648 goto got_pg;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002649 }
2650
2651nopage:
Dave Hansena238ab52011-05-24 17:12:16 -07002652 warn_alloc_failed(gfp_mask, order, NULL);
Vegard Nossumb1eeab62008-11-25 16:55:53 +01002653 return page;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002654got_pg:
Vegard Nossumb1eeab62008-11-25 16:55:53 +01002655 if (kmemcheck_enabled)
2656 kmemcheck_pagealloc_alloc(page, order, gfp_mask);
Mel Gorman11e33f62009-06-16 15:31:57 -07002657
Mel Gorman072bb0a2012-07-31 16:43:58 -07002658 return page;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002659}
Mel Gorman11e33f62009-06-16 15:31:57 -07002660
2661/*
2662 * This is the 'heart' of the zoned buddy allocator.
2663 */
2664struct page *
2665__alloc_pages_nodemask(gfp_t gfp_mask, unsigned int order,
2666 struct zonelist *zonelist, nodemask_t *nodemask)
2667{
2668 enum zone_type high_zoneidx = gfp_zone(gfp_mask);
Mel Gorman5117f452009-06-16 15:31:59 -07002669 struct zone *preferred_zone;
Mel Gormancc9a6c82012-03-21 16:34:11 -07002670 struct page *page = NULL;
Mel Gorman3dd28262009-06-16 15:32:00 -07002671 int migratetype = allocflags_to_migratetype(gfp_mask);
Mel Gormancc9a6c82012-03-21 16:34:11 -07002672 unsigned int cpuset_mems_cookie;
Bartlomiej Zolnierkiewiczd95ea5d2012-10-08 16:32:05 -07002673 int alloc_flags = ALLOC_WMARK_LOW|ALLOC_CPUSET;
Glauber Costa6a1a0d32012-12-18 14:22:00 -08002674 struct mem_cgroup *memcg = NULL;
Mel Gorman11e33f62009-06-16 15:31:57 -07002675
Benjamin Herrenschmidtdcce2842009-06-18 13:24:12 +10002676 gfp_mask &= gfp_allowed_mask;
2677
Mel Gorman11e33f62009-06-16 15:31:57 -07002678 lockdep_trace_alloc(gfp_mask);
2679
2680 might_sleep_if(gfp_mask & __GFP_WAIT);
2681
2682 if (should_fail_alloc_page(gfp_mask, order))
2683 return NULL;
2684
2685 /*
2686 * Check the zones suitable for the gfp_mask contain at least one
2687 * valid zone. It's possible to have an empty zonelist as a result
2688 * of GFP_THISNODE and a memoryless node
2689 */
2690 if (unlikely(!zonelist->_zonerefs->zone))
2691 return NULL;
2692
Glauber Costa6a1a0d32012-12-18 14:22:00 -08002693 /*
2694 * Will only have any effect when __GFP_KMEMCG is set. This is
2695 * verified in the (always inline) callee
2696 */
2697 if (!memcg_kmem_newpage_charge(gfp_mask, &memcg, order))
2698 return NULL;
2699
Mel Gormancc9a6c82012-03-21 16:34:11 -07002700retry_cpuset:
2701 cpuset_mems_cookie = get_mems_allowed();
2702
Mel Gorman5117f452009-06-16 15:31:59 -07002703 /* The preferred zone is used for statistics later */
David Rientjesf33261d2011-01-25 15:07:20 -08002704 first_zones_zonelist(zonelist, high_zoneidx,
2705 nodemask ? : &cpuset_current_mems_allowed,
2706 &preferred_zone);
Mel Gormancc9a6c82012-03-21 16:34:11 -07002707 if (!preferred_zone)
2708 goto out;
Mel Gorman5117f452009-06-16 15:31:59 -07002709
Bartlomiej Zolnierkiewiczd95ea5d2012-10-08 16:32:05 -07002710#ifdef CONFIG_CMA
2711 if (allocflags_to_migratetype(gfp_mask) == MIGRATE_MOVABLE)
2712 alloc_flags |= ALLOC_CMA;
2713#endif
Mel Gorman5117f452009-06-16 15:31:59 -07002714 /* First allocation attempt */
Mel Gorman11e33f62009-06-16 15:31:57 -07002715 page = get_page_from_freelist(gfp_mask|__GFP_HARDWALL, nodemask, order,
Bartlomiej Zolnierkiewiczd95ea5d2012-10-08 16:32:05 -07002716 zonelist, high_zoneidx, alloc_flags,
Mel Gorman3dd28262009-06-16 15:32:00 -07002717 preferred_zone, migratetype);
Ming Lei21caf2f2013-02-22 16:34:08 -08002718 if (unlikely(!page)) {
2719 /*
2720 * Runtime PM, block IO and its error handling path
2721 * can deadlock because I/O on the device might not
2722 * complete.
2723 */
2724 gfp_mask = memalloc_noio_flags(gfp_mask);
Mel Gorman11e33f62009-06-16 15:31:57 -07002725 page = __alloc_pages_slowpath(gfp_mask, order,
Mel Gorman5117f452009-06-16 15:31:59 -07002726 zonelist, high_zoneidx, nodemask,
Mel Gorman3dd28262009-06-16 15:32:00 -07002727 preferred_zone, migratetype);
Ming Lei21caf2f2013-02-22 16:34:08 -08002728 }
Mel Gorman11e33f62009-06-16 15:31:57 -07002729
Mel Gorman4b4f2782009-09-21 17:02:41 -07002730 trace_mm_page_alloc(page, order, gfp_mask, migratetype);
Mel Gormancc9a6c82012-03-21 16:34:11 -07002731
2732out:
2733 /*
2734 * When updating a task's mems_allowed, it is possible to race with
2735 * parallel threads in such a way that an allocation can fail while
2736 * the mask is being updated. If a page allocation is about to fail,
2737 * check if the cpuset changed during allocation and if so, retry.
2738 */
2739 if (unlikely(!put_mems_allowed(cpuset_mems_cookie) && !page))
2740 goto retry_cpuset;
2741
Glauber Costa6a1a0d32012-12-18 14:22:00 -08002742 memcg_kmem_commit_charge(page, memcg, order);
2743
Mel Gorman11e33f62009-06-16 15:31:57 -07002744 return page;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002745}
Mel Gormand2391712009-06-16 15:31:52 -07002746EXPORT_SYMBOL(__alloc_pages_nodemask);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002747
2748/*
2749 * Common helper functions.
2750 */
Harvey Harrison920c7a52008-02-04 22:29:26 -08002751unsigned long __get_free_pages(gfp_t gfp_mask, unsigned int order)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002752{
Akinobu Mita945a1112009-09-21 17:01:47 -07002753 struct page *page;
2754
2755 /*
2756 * __get_free_pages() returns a 32-bit address, which cannot represent
2757 * a highmem page
2758 */
2759 VM_BUG_ON((gfp_mask & __GFP_HIGHMEM) != 0);
2760
Linus Torvalds1da177e2005-04-16 15:20:36 -07002761 page = alloc_pages(gfp_mask, order);
2762 if (!page)
2763 return 0;
2764 return (unsigned long) page_address(page);
2765}
Linus Torvalds1da177e2005-04-16 15:20:36 -07002766EXPORT_SYMBOL(__get_free_pages);
2767
Harvey Harrison920c7a52008-02-04 22:29:26 -08002768unsigned long get_zeroed_page(gfp_t gfp_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002769{
Akinobu Mita945a1112009-09-21 17:01:47 -07002770 return __get_free_pages(gfp_mask | __GFP_ZERO, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002771}
Linus Torvalds1da177e2005-04-16 15:20:36 -07002772EXPORT_SYMBOL(get_zeroed_page);
2773
Harvey Harrison920c7a52008-02-04 22:29:26 -08002774void __free_pages(struct page *page, unsigned int order)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002775{
Nick Pigginb5810032005-10-29 18:16:12 -07002776 if (put_page_testzero(page)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002777 if (order == 0)
Li Hongfc916682010-03-05 13:41:54 -08002778 free_hot_cold_page(page, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002779 else
2780 __free_pages_ok(page, order);
2781 }
2782}
2783
2784EXPORT_SYMBOL(__free_pages);
2785
Harvey Harrison920c7a52008-02-04 22:29:26 -08002786void free_pages(unsigned long addr, unsigned int order)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002787{
2788 if (addr != 0) {
Nick Piggin725d7042006-09-25 23:30:55 -07002789 VM_BUG_ON(!virt_addr_valid((void *)addr));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002790 __free_pages(virt_to_page((void *)addr), order);
2791 }
2792}
2793
2794EXPORT_SYMBOL(free_pages);
2795
Glauber Costa6a1a0d32012-12-18 14:22:00 -08002796/*
2797 * __free_memcg_kmem_pages and free_memcg_kmem_pages will free
2798 * pages allocated with __GFP_KMEMCG.
2799 *
2800 * Those pages are accounted to a particular memcg, embedded in the
2801 * corresponding page_cgroup. To avoid adding a hit in the allocator to search
2802 * for that information only to find out that it is NULL for users who have no
2803 * interest in that whatsoever, we provide these functions.
2804 *
2805 * The caller knows better which flags it relies on.
2806 */
2807void __free_memcg_kmem_pages(struct page *page, unsigned int order)
2808{
2809 memcg_kmem_uncharge_pages(page, order);
2810 __free_pages(page, order);
2811}
2812
2813void free_memcg_kmem_pages(unsigned long addr, unsigned int order)
2814{
2815 if (addr != 0) {
2816 VM_BUG_ON(!virt_addr_valid((void *)addr));
2817 __free_memcg_kmem_pages(virt_to_page((void *)addr), order);
2818 }
2819}
2820
Andi Kleenee85c2e2011-05-11 15:13:34 -07002821static void *make_alloc_exact(unsigned long addr, unsigned order, size_t size)
2822{
2823 if (addr) {
2824 unsigned long alloc_end = addr + (PAGE_SIZE << order);
2825 unsigned long used = addr + PAGE_ALIGN(size);
2826
2827 split_page(virt_to_page((void *)addr), order);
2828 while (used < alloc_end) {
2829 free_page(used);
2830 used += PAGE_SIZE;
2831 }
2832 }
2833 return (void *)addr;
2834}
2835
Timur Tabi2be0ffe2008-07-23 21:28:11 -07002836/**
2837 * alloc_pages_exact - allocate an exact number physically-contiguous pages.
2838 * @size: the number of bytes to allocate
2839 * @gfp_mask: GFP flags for the allocation
2840 *
2841 * This function is similar to alloc_pages(), except that it allocates the
2842 * minimum number of pages to satisfy the request. alloc_pages() can only
2843 * allocate memory in power-of-two pages.
2844 *
2845 * This function is also limited by MAX_ORDER.
2846 *
2847 * Memory allocated by this function must be released by free_pages_exact().
2848 */
2849void *alloc_pages_exact(size_t size, gfp_t gfp_mask)
2850{
2851 unsigned int order = get_order(size);
2852 unsigned long addr;
2853
2854 addr = __get_free_pages(gfp_mask, order);
Andi Kleenee85c2e2011-05-11 15:13:34 -07002855 return make_alloc_exact(addr, order, size);
Timur Tabi2be0ffe2008-07-23 21:28:11 -07002856}
2857EXPORT_SYMBOL(alloc_pages_exact);
2858
2859/**
Andi Kleenee85c2e2011-05-11 15:13:34 -07002860 * alloc_pages_exact_nid - allocate an exact number of physically-contiguous
2861 * pages on a node.
Randy Dunlapb5e6ab52011-05-16 13:16:54 -07002862 * @nid: the preferred node ID where memory should be allocated
Andi Kleenee85c2e2011-05-11 15:13:34 -07002863 * @size: the number of bytes to allocate
2864 * @gfp_mask: GFP flags for the allocation
2865 *
2866 * Like alloc_pages_exact(), but try to allocate on node nid first before falling
2867 * back.
2868 * Note this is not alloc_pages_exact_node() which allocates on a specific node,
2869 * but is not exact.
2870 */
2871void *alloc_pages_exact_nid(int nid, size_t size, gfp_t gfp_mask)
2872{
2873 unsigned order = get_order(size);
2874 struct page *p = alloc_pages_node(nid, gfp_mask, order);
2875 if (!p)
2876 return NULL;
2877 return make_alloc_exact((unsigned long)page_address(p), order, size);
2878}
2879EXPORT_SYMBOL(alloc_pages_exact_nid);
2880
2881/**
Timur Tabi2be0ffe2008-07-23 21:28:11 -07002882 * free_pages_exact - release memory allocated via alloc_pages_exact()
2883 * @virt: the value returned by alloc_pages_exact.
2884 * @size: size of allocation, same value as passed to alloc_pages_exact().
2885 *
2886 * Release the memory allocated by a previous call to alloc_pages_exact.
2887 */
2888void free_pages_exact(void *virt, size_t size)
2889{
2890 unsigned long addr = (unsigned long)virt;
2891 unsigned long end = addr + PAGE_ALIGN(size);
2892
2893 while (addr < end) {
2894 free_page(addr);
2895 addr += PAGE_SIZE;
2896 }
2897}
2898EXPORT_SYMBOL(free_pages_exact);
2899
Zhang Yanfeie0fb5812013-02-22 16:35:54 -08002900/**
2901 * nr_free_zone_pages - count number of pages beyond high watermark
2902 * @offset: The zone index of the highest zone
2903 *
2904 * nr_free_zone_pages() counts the number of counts pages which are beyond the
2905 * high watermark within all zones at or below a given zone index. For each
2906 * zone, the number of pages is calculated as:
Jiang Liu834405c2013-07-03 15:03:04 -07002907 * managed_pages - high_pages
Zhang Yanfeie0fb5812013-02-22 16:35:54 -08002908 */
Zhang Yanfeiebec3862013-02-22 16:35:43 -08002909static unsigned long nr_free_zone_pages(int offset)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002910{
Mel Gormandd1a2392008-04-28 02:12:17 -07002911 struct zoneref *z;
Mel Gorman54a6eb52008-04-28 02:12:16 -07002912 struct zone *zone;
2913
Martin J. Blighe310fd42005-07-29 22:59:18 -07002914 /* Just pick one node, since fallback list is circular */
Zhang Yanfeiebec3862013-02-22 16:35:43 -08002915 unsigned long sum = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002916
Mel Gorman0e884602008-04-28 02:12:14 -07002917 struct zonelist *zonelist = node_zonelist(numa_node_id(), GFP_KERNEL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002918
Mel Gorman54a6eb52008-04-28 02:12:16 -07002919 for_each_zone_zonelist(zone, z, zonelist, offset) {
Jiang Liub40da042013-02-22 16:33:52 -08002920 unsigned long size = zone->managed_pages;
Mel Gorman41858962009-06-16 15:32:12 -07002921 unsigned long high = high_wmark_pages(zone);
Martin J. Blighe310fd42005-07-29 22:59:18 -07002922 if (size > high)
2923 sum += size - high;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002924 }
2925
2926 return sum;
2927}
2928
Zhang Yanfeie0fb5812013-02-22 16:35:54 -08002929/**
2930 * nr_free_buffer_pages - count number of pages beyond high watermark
2931 *
2932 * nr_free_buffer_pages() counts the number of pages which are beyond the high
2933 * watermark within ZONE_DMA and ZONE_NORMAL.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002934 */
Zhang Yanfeiebec3862013-02-22 16:35:43 -08002935unsigned long nr_free_buffer_pages(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002936{
Al Viroaf4ca452005-10-21 02:55:38 -04002937 return nr_free_zone_pages(gfp_zone(GFP_USER));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002938}
Meelap Shahc2f1a552007-07-17 04:04:39 -07002939EXPORT_SYMBOL_GPL(nr_free_buffer_pages);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002940
Zhang Yanfeie0fb5812013-02-22 16:35:54 -08002941/**
2942 * nr_free_pagecache_pages - count number of pages beyond high watermark
2943 *
2944 * nr_free_pagecache_pages() counts the number of pages which are beyond the
2945 * high watermark within all zones.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002946 */
Zhang Yanfeiebec3862013-02-22 16:35:43 -08002947unsigned long nr_free_pagecache_pages(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002948{
Mel Gorman2a1e2742007-07-17 04:03:12 -07002949 return nr_free_zone_pages(gfp_zone(GFP_HIGHUSER_MOVABLE));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002950}
Christoph Lameter08e0f6a2006-09-27 01:50:06 -07002951
2952static inline void show_node(struct zone *zone)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002953{
Kirill A. Shutemove5adfff2012-12-11 16:00:29 -08002954 if (IS_ENABLED(CONFIG_NUMA))
Andy Whitcroft25ba77c2006-12-06 20:33:03 -08002955 printk("Node %d ", zone_to_nid(zone));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002956}
Linus Torvalds1da177e2005-04-16 15:20:36 -07002957
Linus Torvalds1da177e2005-04-16 15:20:36 -07002958void si_meminfo(struct sysinfo *val)
2959{
2960 val->totalram = totalram_pages;
2961 val->sharedram = 0;
Christoph Lameterd23ad422007-02-10 01:43:02 -08002962 val->freeram = global_page_state(NR_FREE_PAGES);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002963 val->bufferram = nr_blockdev_pages();
Linus Torvalds1da177e2005-04-16 15:20:36 -07002964 val->totalhigh = totalhigh_pages;
2965 val->freehigh = nr_free_highpages();
Linus Torvalds1da177e2005-04-16 15:20:36 -07002966 val->mem_unit = PAGE_SIZE;
2967}
2968
2969EXPORT_SYMBOL(si_meminfo);
2970
2971#ifdef CONFIG_NUMA
2972void si_meminfo_node(struct sysinfo *val, int nid)
2973{
Jiang Liucdd91a72013-07-03 15:03:27 -07002974 int zone_type; /* needs to be signed */
2975 unsigned long managed_pages = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002976 pg_data_t *pgdat = NODE_DATA(nid);
2977
Jiang Liucdd91a72013-07-03 15:03:27 -07002978 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++)
2979 managed_pages += pgdat->node_zones[zone_type].managed_pages;
2980 val->totalram = managed_pages;
Christoph Lameterd23ad422007-02-10 01:43:02 -08002981 val->freeram = node_page_state(nid, NR_FREE_PAGES);
Christoph Lameter98d2b0e2006-09-25 23:31:12 -07002982#ifdef CONFIG_HIGHMEM
Jiang Liub40da042013-02-22 16:33:52 -08002983 val->totalhigh = pgdat->node_zones[ZONE_HIGHMEM].managed_pages;
Christoph Lameterd23ad422007-02-10 01:43:02 -08002984 val->freehigh = zone_page_state(&pgdat->node_zones[ZONE_HIGHMEM],
2985 NR_FREE_PAGES);
Christoph Lameter98d2b0e2006-09-25 23:31:12 -07002986#else
2987 val->totalhigh = 0;
2988 val->freehigh = 0;
2989#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07002990 val->mem_unit = PAGE_SIZE;
2991}
2992#endif
2993
David Rientjesddd588b2011-03-22 16:30:46 -07002994/*
David Rientjes7bf02ea2011-05-24 17:11:16 -07002995 * Determine whether the node should be displayed or not, depending on whether
2996 * SHOW_MEM_FILTER_NODES was passed to show_free_areas().
David Rientjesddd588b2011-03-22 16:30:46 -07002997 */
David Rientjes7bf02ea2011-05-24 17:11:16 -07002998bool skip_free_areas_node(unsigned int flags, int nid)
David Rientjesddd588b2011-03-22 16:30:46 -07002999{
3000 bool ret = false;
Mel Gormancc9a6c82012-03-21 16:34:11 -07003001 unsigned int cpuset_mems_cookie;
David Rientjesddd588b2011-03-22 16:30:46 -07003002
3003 if (!(flags & SHOW_MEM_FILTER_NODES))
3004 goto out;
3005
Mel Gormancc9a6c82012-03-21 16:34:11 -07003006 do {
3007 cpuset_mems_cookie = get_mems_allowed();
3008 ret = !node_isset(nid, cpuset_current_mems_allowed);
3009 } while (!put_mems_allowed(cpuset_mems_cookie));
David Rientjesddd588b2011-03-22 16:30:46 -07003010out:
3011 return ret;
3012}
3013
Linus Torvalds1da177e2005-04-16 15:20:36 -07003014#define K(x) ((x) << (PAGE_SHIFT-10))
3015
Rabin Vincent377e4f12012-12-11 16:00:24 -08003016static void show_migration_types(unsigned char type)
3017{
3018 static const char types[MIGRATE_TYPES] = {
3019 [MIGRATE_UNMOVABLE] = 'U',
3020 [MIGRATE_RECLAIMABLE] = 'E',
3021 [MIGRATE_MOVABLE] = 'M',
3022 [MIGRATE_RESERVE] = 'R',
3023#ifdef CONFIG_CMA
3024 [MIGRATE_CMA] = 'C',
3025#endif
Minchan Kim194159f2013-02-22 16:33:58 -08003026#ifdef CONFIG_MEMORY_ISOLATION
Rabin Vincent377e4f12012-12-11 16:00:24 -08003027 [MIGRATE_ISOLATE] = 'I',
Minchan Kim194159f2013-02-22 16:33:58 -08003028#endif
Rabin Vincent377e4f12012-12-11 16:00:24 -08003029 };
3030 char tmp[MIGRATE_TYPES + 1];
3031 char *p = tmp;
3032 int i;
3033
3034 for (i = 0; i < MIGRATE_TYPES; i++) {
3035 if (type & (1 << i))
3036 *p++ = types[i];
3037 }
3038
3039 *p = '\0';
3040 printk("(%s) ", tmp);
3041}
3042
Linus Torvalds1da177e2005-04-16 15:20:36 -07003043/*
3044 * Show free area list (used inside shift_scroll-lock stuff)
3045 * We also calculate the percentage fragmentation. We do this by counting the
3046 * memory on each free list with the exception of the first item on the list.
David Rientjesddd588b2011-03-22 16:30:46 -07003047 * Suppresses nodes that are not allowed by current's cpuset if
3048 * SHOW_MEM_FILTER_NODES is passed.
Linus Torvalds1da177e2005-04-16 15:20:36 -07003049 */
David Rientjes7bf02ea2011-05-24 17:11:16 -07003050void show_free_areas(unsigned int filter)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003051{
Jes Sorensenc7241912006-09-27 01:50:05 -07003052 int cpu;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003053 struct zone *zone;
3054
KOSAKI Motohiroee99c712009-03-31 15:19:31 -07003055 for_each_populated_zone(zone) {
David Rientjes7bf02ea2011-05-24 17:11:16 -07003056 if (skip_free_areas_node(filter, zone_to_nid(zone)))
David Rientjesddd588b2011-03-22 16:30:46 -07003057 continue;
Jes Sorensenc7241912006-09-27 01:50:05 -07003058 show_node(zone);
3059 printk("%s per-cpu:\n", zone->name);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003060
Dave Jones6b482c62005-11-10 15:45:56 -05003061 for_each_online_cpu(cpu) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07003062 struct per_cpu_pageset *pageset;
3063
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09003064 pageset = per_cpu_ptr(zone->pageset, cpu);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003065
Christoph Lameter3dfa5722008-02-04 22:29:19 -08003066 printk("CPU %4d: hi:%5d, btch:%4d usd:%4d\n",
3067 cpu, pageset->pcp.high,
3068 pageset->pcp.batch, pageset->pcp.count);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003069 }
3070 }
3071
KOSAKI Motohiroa7312862009-09-21 17:01:37 -07003072 printk("active_anon:%lu inactive_anon:%lu isolated_anon:%lu\n"
3073 " active_file:%lu inactive_file:%lu isolated_file:%lu\n"
Lee Schermerhorn7b854122008-10-18 20:26:40 -07003074 " unevictable:%lu"
Andrew Mortonb76146e2009-10-26 16:49:52 -07003075 " dirty:%lu writeback:%lu unstable:%lu\n"
KOSAKI Motohiro3701b032009-09-21 17:01:29 -07003076 " free:%lu slab_reclaimable:%lu slab_unreclaimable:%lu\n"
Bartlomiej Zolnierkiewiczd1ce7492012-10-08 16:32:02 -07003077 " mapped:%lu shmem:%lu pagetables:%lu bounce:%lu\n"
3078 " free_cma:%lu\n",
Rik van Riel4f98a2f2008-10-18 20:26:32 -07003079 global_page_state(NR_ACTIVE_ANON),
Rik van Riel4f98a2f2008-10-18 20:26:32 -07003080 global_page_state(NR_INACTIVE_ANON),
KOSAKI Motohiroa7312862009-09-21 17:01:37 -07003081 global_page_state(NR_ISOLATED_ANON),
3082 global_page_state(NR_ACTIVE_FILE),
Rik van Riel4f98a2f2008-10-18 20:26:32 -07003083 global_page_state(NR_INACTIVE_FILE),
KOSAKI Motohiroa7312862009-09-21 17:01:37 -07003084 global_page_state(NR_ISOLATED_FILE),
Lee Schermerhorn7b854122008-10-18 20:26:40 -07003085 global_page_state(NR_UNEVICTABLE),
Christoph Lameterb1e7a8f2006-06-30 01:55:39 -07003086 global_page_state(NR_FILE_DIRTY),
Christoph Lameterce866b32006-06-30 01:55:40 -07003087 global_page_state(NR_WRITEBACK),
Christoph Lameterfd39fc82006-06-30 01:55:40 -07003088 global_page_state(NR_UNSTABLE_NFS),
Christoph Lameterd23ad422007-02-10 01:43:02 -08003089 global_page_state(NR_FREE_PAGES),
KOSAKI Motohiro3701b032009-09-21 17:01:29 -07003090 global_page_state(NR_SLAB_RECLAIMABLE),
3091 global_page_state(NR_SLAB_UNRECLAIMABLE),
Christoph Lameter65ba55f2006-06-30 01:55:34 -07003092 global_page_state(NR_FILE_MAPPED),
KOSAKI Motohiro4b021082009-09-21 17:01:33 -07003093 global_page_state(NR_SHMEM),
Andrew Mortona25700a2007-02-08 14:20:40 -08003094 global_page_state(NR_PAGETABLE),
Bartlomiej Zolnierkiewiczd1ce7492012-10-08 16:32:02 -07003095 global_page_state(NR_BOUNCE),
3096 global_page_state(NR_FREE_CMA_PAGES));
Linus Torvalds1da177e2005-04-16 15:20:36 -07003097
KOSAKI Motohiroee99c712009-03-31 15:19:31 -07003098 for_each_populated_zone(zone) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07003099 int i;
3100
David Rientjes7bf02ea2011-05-24 17:11:16 -07003101 if (skip_free_areas_node(filter, zone_to_nid(zone)))
David Rientjesddd588b2011-03-22 16:30:46 -07003102 continue;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003103 show_node(zone);
3104 printk("%s"
3105 " free:%lukB"
3106 " min:%lukB"
3107 " low:%lukB"
3108 " high:%lukB"
Rik van Riel4f98a2f2008-10-18 20:26:32 -07003109 " active_anon:%lukB"
3110 " inactive_anon:%lukB"
3111 " active_file:%lukB"
3112 " inactive_file:%lukB"
Lee Schermerhorn7b854122008-10-18 20:26:40 -07003113 " unevictable:%lukB"
KOSAKI Motohiroa7312862009-09-21 17:01:37 -07003114 " isolated(anon):%lukB"
3115 " isolated(file):%lukB"
Linus Torvalds1da177e2005-04-16 15:20:36 -07003116 " present:%lukB"
Jiang Liu9feedc92012-12-12 13:52:12 -08003117 " managed:%lukB"
KOSAKI Motohiro4a0aa732009-09-21 17:01:30 -07003118 " mlocked:%lukB"
3119 " dirty:%lukB"
3120 " writeback:%lukB"
3121 " mapped:%lukB"
KOSAKI Motohiro4b021082009-09-21 17:01:33 -07003122 " shmem:%lukB"
KOSAKI Motohiro4a0aa732009-09-21 17:01:30 -07003123 " slab_reclaimable:%lukB"
3124 " slab_unreclaimable:%lukB"
KOSAKI Motohiroc6a7f572009-09-21 17:01:32 -07003125 " kernel_stack:%lukB"
KOSAKI Motohiro4a0aa732009-09-21 17:01:30 -07003126 " pagetables:%lukB"
3127 " unstable:%lukB"
3128 " bounce:%lukB"
Bartlomiej Zolnierkiewiczd1ce7492012-10-08 16:32:02 -07003129 " free_cma:%lukB"
KOSAKI Motohiro4a0aa732009-09-21 17:01:30 -07003130 " writeback_tmp:%lukB"
Linus Torvalds1da177e2005-04-16 15:20:36 -07003131 " pages_scanned:%lu"
3132 " all_unreclaimable? %s"
3133 "\n",
3134 zone->name,
Mel Gorman88f5acf2011-01-13 15:45:41 -08003135 K(zone_page_state(zone, NR_FREE_PAGES)),
Mel Gorman41858962009-06-16 15:32:12 -07003136 K(min_wmark_pages(zone)),
3137 K(low_wmark_pages(zone)),
3138 K(high_wmark_pages(zone)),
Rik van Riel4f98a2f2008-10-18 20:26:32 -07003139 K(zone_page_state(zone, NR_ACTIVE_ANON)),
3140 K(zone_page_state(zone, NR_INACTIVE_ANON)),
3141 K(zone_page_state(zone, NR_ACTIVE_FILE)),
3142 K(zone_page_state(zone, NR_INACTIVE_FILE)),
Lee Schermerhorn7b854122008-10-18 20:26:40 -07003143 K(zone_page_state(zone, NR_UNEVICTABLE)),
KOSAKI Motohiroa7312862009-09-21 17:01:37 -07003144 K(zone_page_state(zone, NR_ISOLATED_ANON)),
3145 K(zone_page_state(zone, NR_ISOLATED_FILE)),
Linus Torvalds1da177e2005-04-16 15:20:36 -07003146 K(zone->present_pages),
Jiang Liu9feedc92012-12-12 13:52:12 -08003147 K(zone->managed_pages),
KOSAKI Motohiro4a0aa732009-09-21 17:01:30 -07003148 K(zone_page_state(zone, NR_MLOCK)),
3149 K(zone_page_state(zone, NR_FILE_DIRTY)),
3150 K(zone_page_state(zone, NR_WRITEBACK)),
3151 K(zone_page_state(zone, NR_FILE_MAPPED)),
KOSAKI Motohiro4b021082009-09-21 17:01:33 -07003152 K(zone_page_state(zone, NR_SHMEM)),
KOSAKI Motohiro4a0aa732009-09-21 17:01:30 -07003153 K(zone_page_state(zone, NR_SLAB_RECLAIMABLE)),
3154 K(zone_page_state(zone, NR_SLAB_UNRECLAIMABLE)),
KOSAKI Motohiroc6a7f572009-09-21 17:01:32 -07003155 zone_page_state(zone, NR_KERNEL_STACK) *
3156 THREAD_SIZE / 1024,
KOSAKI Motohiro4a0aa732009-09-21 17:01:30 -07003157 K(zone_page_state(zone, NR_PAGETABLE)),
3158 K(zone_page_state(zone, NR_UNSTABLE_NFS)),
3159 K(zone_page_state(zone, NR_BOUNCE)),
Bartlomiej Zolnierkiewiczd1ce7492012-10-08 16:32:02 -07003160 K(zone_page_state(zone, NR_FREE_CMA_PAGES)),
KOSAKI Motohiro4a0aa732009-09-21 17:01:30 -07003161 K(zone_page_state(zone, NR_WRITEBACK_TEMP)),
Linus Torvalds1da177e2005-04-16 15:20:36 -07003162 zone->pages_scanned,
Lisa Du6e543d52013-09-11 14:22:36 -07003163 (!zone_reclaimable(zone) ? "yes" : "no")
Linus Torvalds1da177e2005-04-16 15:20:36 -07003164 );
3165 printk("lowmem_reserve[]:");
3166 for (i = 0; i < MAX_NR_ZONES; i++)
3167 printk(" %lu", zone->lowmem_reserve[i]);
3168 printk("\n");
3169 }
3170
KOSAKI Motohiroee99c712009-03-31 15:19:31 -07003171 for_each_populated_zone(zone) {
Pintu Kumarb8af2942013-09-11 14:20:34 -07003172 unsigned long nr[MAX_ORDER], flags, order, total = 0;
Rabin Vincent377e4f12012-12-11 16:00:24 -08003173 unsigned char types[MAX_ORDER];
Linus Torvalds1da177e2005-04-16 15:20:36 -07003174
David Rientjes7bf02ea2011-05-24 17:11:16 -07003175 if (skip_free_areas_node(filter, zone_to_nid(zone)))
David Rientjesddd588b2011-03-22 16:30:46 -07003176 continue;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003177 show_node(zone);
3178 printk("%s: ", zone->name);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003179
3180 spin_lock_irqsave(&zone->lock, flags);
3181 for (order = 0; order < MAX_ORDER; order++) {
Rabin Vincent377e4f12012-12-11 16:00:24 -08003182 struct free_area *area = &zone->free_area[order];
3183 int type;
3184
3185 nr[order] = area->nr_free;
Kirill Korotaev8f9de512006-06-23 02:03:50 -07003186 total += nr[order] << order;
Rabin Vincent377e4f12012-12-11 16:00:24 -08003187
3188 types[order] = 0;
3189 for (type = 0; type < MIGRATE_TYPES; type++) {
3190 if (!list_empty(&area->free_list[type]))
3191 types[order] |= 1 << type;
3192 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07003193 }
3194 spin_unlock_irqrestore(&zone->lock, flags);
Rabin Vincent377e4f12012-12-11 16:00:24 -08003195 for (order = 0; order < MAX_ORDER; order++) {
Kirill Korotaev8f9de512006-06-23 02:03:50 -07003196 printk("%lu*%lukB ", nr[order], K(1UL) << order);
Rabin Vincent377e4f12012-12-11 16:00:24 -08003197 if (nr[order])
3198 show_migration_types(types[order]);
3199 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07003200 printk("= %lukB\n", K(total));
3201 }
3202
David Rientjes949f7ec2013-04-29 15:07:48 -07003203 hugetlb_show_meminfo();
3204
Larry Woodmane6f36022008-02-04 22:29:30 -08003205 printk("%ld total pagecache pages\n", global_page_state(NR_FILE_PAGES));
3206
Linus Torvalds1da177e2005-04-16 15:20:36 -07003207 show_swap_cache_info();
3208}
3209
Mel Gorman19770b32008-04-28 02:12:18 -07003210static void zoneref_set_zone(struct zone *zone, struct zoneref *zoneref)
3211{
3212 zoneref->zone = zone;
3213 zoneref->zone_idx = zone_idx(zone);
3214}
3215
Linus Torvalds1da177e2005-04-16 15:20:36 -07003216/*
3217 * Builds allocation fallback zone lists.
Christoph Lameter1a932052006-01-06 00:11:16 -08003218 *
3219 * Add all populated zones of a node to the zonelist.
Linus Torvalds1da177e2005-04-16 15:20:36 -07003220 */
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003221static int build_zonelists_node(pg_data_t *pgdat, struct zonelist *zonelist,
Zhang Yanfeibc732f12013-07-08 16:00:06 -07003222 int nr_zones)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003223{
Christoph Lameter1a932052006-01-06 00:11:16 -08003224 struct zone *zone;
Zhang Yanfeibc732f12013-07-08 16:00:06 -07003225 enum zone_type zone_type = MAX_NR_ZONES;
Christoph Lameter02a68a52006-01-06 00:11:18 -08003226
3227 do {
Christoph Lameter2f6726e2006-09-25 23:31:18 -07003228 zone_type--;
Christoph Lameter070f8032006-01-06 00:11:19 -08003229 zone = pgdat->node_zones + zone_type;
Christoph Lameter1a932052006-01-06 00:11:16 -08003230 if (populated_zone(zone)) {
Mel Gormandd1a2392008-04-28 02:12:17 -07003231 zoneref_set_zone(zone,
3232 &zonelist->_zonerefs[nr_zones++]);
Christoph Lameter070f8032006-01-06 00:11:19 -08003233 check_highest_zone(zone_type);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003234 }
Christoph Lameter2f6726e2006-09-25 23:31:18 -07003235 } while (zone_type);
Zhang Yanfeibc732f12013-07-08 16:00:06 -07003236
Christoph Lameter070f8032006-01-06 00:11:19 -08003237 return nr_zones;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003238}
3239
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003240
3241/*
3242 * zonelist_order:
3243 * 0 = automatic detection of better ordering.
3244 * 1 = order by ([node] distance, -zonetype)
3245 * 2 = order by (-zonetype, [node] distance)
3246 *
3247 * If not NUMA, ZONELIST_ORDER_ZONE and ZONELIST_ORDER_NODE will create
3248 * the same zonelist. So only NUMA can configure this param.
3249 */
3250#define ZONELIST_ORDER_DEFAULT 0
3251#define ZONELIST_ORDER_NODE 1
3252#define ZONELIST_ORDER_ZONE 2
3253
3254/* zonelist order in the kernel.
3255 * set_zonelist_order() will set this to NODE or ZONE.
3256 */
3257static int current_zonelist_order = ZONELIST_ORDER_DEFAULT;
3258static char zonelist_order_name[3][8] = {"Default", "Node", "Zone"};
3259
3260
Linus Torvalds1da177e2005-04-16 15:20:36 -07003261#ifdef CONFIG_NUMA
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003262/* The value user specified ....changed by config */
3263static int user_zonelist_order = ZONELIST_ORDER_DEFAULT;
3264/* string for sysctl */
3265#define NUMA_ZONELIST_ORDER_LEN 16
3266char numa_zonelist_order[16] = "default";
3267
3268/*
3269 * interface for configure zonelist ordering.
3270 * command line option "numa_zonelist_order"
3271 * = "[dD]efault - default, automatic configuration.
3272 * = "[nN]ode - order by node locality, then by zone within node
3273 * = "[zZ]one - order by zone, then by locality within zone
3274 */
3275
3276static int __parse_numa_zonelist_order(char *s)
3277{
3278 if (*s == 'd' || *s == 'D') {
3279 user_zonelist_order = ZONELIST_ORDER_DEFAULT;
3280 } else if (*s == 'n' || *s == 'N') {
3281 user_zonelist_order = ZONELIST_ORDER_NODE;
3282 } else if (*s == 'z' || *s == 'Z') {
3283 user_zonelist_order = ZONELIST_ORDER_ZONE;
3284 } else {
3285 printk(KERN_WARNING
3286 "Ignoring invalid numa_zonelist_order value: "
3287 "%s\n", s);
3288 return -EINVAL;
3289 }
3290 return 0;
3291}
3292
3293static __init int setup_numa_zonelist_order(char *s)
3294{
Volodymyr G. Lukiianykecb256f2011-01-13 15:46:26 -08003295 int ret;
3296
3297 if (!s)
3298 return 0;
3299
3300 ret = __parse_numa_zonelist_order(s);
3301 if (ret == 0)
3302 strlcpy(numa_zonelist_order, s, NUMA_ZONELIST_ORDER_LEN);
3303
3304 return ret;
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003305}
3306early_param("numa_zonelist_order", setup_numa_zonelist_order);
3307
3308/*
3309 * sysctl handler for numa_zonelist_order
3310 */
3311int numa_zonelist_order_handler(ctl_table *table, int write,
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07003312 void __user *buffer, size_t *length,
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003313 loff_t *ppos)
3314{
3315 char saved_string[NUMA_ZONELIST_ORDER_LEN];
3316 int ret;
Andi Kleen443c6f12009-12-23 21:00:47 +01003317 static DEFINE_MUTEX(zl_order_mutex);
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003318
Andi Kleen443c6f12009-12-23 21:00:47 +01003319 mutex_lock(&zl_order_mutex);
Chen Gangdacbde02013-07-03 15:02:35 -07003320 if (write) {
3321 if (strlen((char *)table->data) >= NUMA_ZONELIST_ORDER_LEN) {
3322 ret = -EINVAL;
3323 goto out;
3324 }
3325 strcpy(saved_string, (char *)table->data);
3326 }
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07003327 ret = proc_dostring(table, write, buffer, length, ppos);
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003328 if (ret)
Andi Kleen443c6f12009-12-23 21:00:47 +01003329 goto out;
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003330 if (write) {
3331 int oldval = user_zonelist_order;
Chen Gangdacbde02013-07-03 15:02:35 -07003332
3333 ret = __parse_numa_zonelist_order((char *)table->data);
3334 if (ret) {
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003335 /*
3336 * bogus value. restore saved string
3337 */
Chen Gangdacbde02013-07-03 15:02:35 -07003338 strncpy((char *)table->data, saved_string,
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003339 NUMA_ZONELIST_ORDER_LEN);
3340 user_zonelist_order = oldval;
Haicheng Li4eaf3f62010-05-24 14:32:52 -07003341 } else if (oldval != user_zonelist_order) {
3342 mutex_lock(&zonelists_mutex);
Jiang Liu9adb62a2012-07-31 16:43:28 -07003343 build_all_zonelists(NULL, NULL);
Haicheng Li4eaf3f62010-05-24 14:32:52 -07003344 mutex_unlock(&zonelists_mutex);
3345 }
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003346 }
Andi Kleen443c6f12009-12-23 21:00:47 +01003347out:
3348 mutex_unlock(&zl_order_mutex);
3349 return ret;
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003350}
3351
3352
Christoph Lameter62bc62a2009-06-16 15:32:15 -07003353#define MAX_NODE_LOAD (nr_online_nodes)
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003354static int node_load[MAX_NUMNODES];
3355
Linus Torvalds1da177e2005-04-16 15:20:36 -07003356/**
Pavel Pisa4dc3b162005-05-01 08:59:25 -07003357 * 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 -07003358 * @node: node whose fallback list we're appending
3359 * @used_node_mask: nodemask_t of already used nodes
3360 *
3361 * We use a number of factors to determine which is the next node that should
3362 * appear on a given node's fallback list. The node should not have appeared
3363 * already in @node's fallback list, and it should be the next closest node
3364 * according to the distance array (which contains arbitrary distance values
3365 * from each node to each node in the system), and should also prefer nodes
3366 * with no CPUs, since presumably they'll have very little allocation pressure
3367 * on them otherwise.
3368 * It returns -1 if no node is found.
3369 */
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003370static int find_next_best_node(int node, nodemask_t *used_node_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003371{
Linus Torvalds4cf808e2006-02-17 20:38:21 +01003372 int n, val;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003373 int min_val = INT_MAX;
David Rientjes00ef2d22013-02-22 16:35:36 -08003374 int best_node = NUMA_NO_NODE;
Rusty Russella70f7302009-03-13 14:49:46 +10303375 const struct cpumask *tmp = cpumask_of_node(0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003376
Linus Torvalds4cf808e2006-02-17 20:38:21 +01003377 /* Use the local node if we haven't already */
3378 if (!node_isset(node, *used_node_mask)) {
3379 node_set(node, *used_node_mask);
3380 return node;
3381 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07003382
Lai Jiangshan4b0ef1fe2012-12-12 13:51:46 -08003383 for_each_node_state(n, N_MEMORY) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07003384
3385 /* Don't want a node to appear more than once */
3386 if (node_isset(n, *used_node_mask))
3387 continue;
3388
Linus Torvalds1da177e2005-04-16 15:20:36 -07003389 /* Use the distance array to find the distance */
3390 val = node_distance(node, n);
3391
Linus Torvalds4cf808e2006-02-17 20:38:21 +01003392 /* Penalize nodes under us ("prefer the next node") */
3393 val += (n < node);
3394
Linus Torvalds1da177e2005-04-16 15:20:36 -07003395 /* Give preference to headless and unused nodes */
Rusty Russella70f7302009-03-13 14:49:46 +10303396 tmp = cpumask_of_node(n);
3397 if (!cpumask_empty(tmp))
Linus Torvalds1da177e2005-04-16 15:20:36 -07003398 val += PENALTY_FOR_NODE_WITH_CPUS;
3399
3400 /* Slight preference for less loaded node */
3401 val *= (MAX_NODE_LOAD*MAX_NUMNODES);
3402 val += node_load[n];
3403
3404 if (val < min_val) {
3405 min_val = val;
3406 best_node = n;
3407 }
3408 }
3409
3410 if (best_node >= 0)
3411 node_set(best_node, *used_node_mask);
3412
3413 return best_node;
3414}
3415
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003416
3417/*
3418 * Build zonelists ordered by node and zones within node.
3419 * This results in maximum locality--normal zone overflows into local
3420 * DMA zone, if any--but risks exhausting DMA zone.
3421 */
3422static void build_zonelists_in_node_order(pg_data_t *pgdat, int node)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003423{
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003424 int j;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003425 struct zonelist *zonelist;
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003426
Mel Gorman54a6eb52008-04-28 02:12:16 -07003427 zonelist = &pgdat->node_zonelists[0];
Mel Gormandd1a2392008-04-28 02:12:17 -07003428 for (j = 0; zonelist->_zonerefs[j].zone != NULL; j++)
Mel Gorman54a6eb52008-04-28 02:12:16 -07003429 ;
Zhang Yanfeibc732f12013-07-08 16:00:06 -07003430 j = build_zonelists_node(NODE_DATA(node), zonelist, j);
Mel Gormandd1a2392008-04-28 02:12:17 -07003431 zonelist->_zonerefs[j].zone = NULL;
3432 zonelist->_zonerefs[j].zone_idx = 0;
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003433}
3434
3435/*
Christoph Lameter523b9452007-10-16 01:25:37 -07003436 * Build gfp_thisnode zonelists
3437 */
3438static void build_thisnode_zonelists(pg_data_t *pgdat)
3439{
Christoph Lameter523b9452007-10-16 01:25:37 -07003440 int j;
3441 struct zonelist *zonelist;
3442
Mel Gorman54a6eb52008-04-28 02:12:16 -07003443 zonelist = &pgdat->node_zonelists[1];
Zhang Yanfeibc732f12013-07-08 16:00:06 -07003444 j = build_zonelists_node(pgdat, zonelist, 0);
Mel Gormandd1a2392008-04-28 02:12:17 -07003445 zonelist->_zonerefs[j].zone = NULL;
3446 zonelist->_zonerefs[j].zone_idx = 0;
Christoph Lameter523b9452007-10-16 01:25:37 -07003447}
3448
3449/*
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003450 * Build zonelists ordered by zone and nodes within zones.
3451 * This results in conserving DMA zone[s] until all Normal memory is
3452 * exhausted, but results in overflowing to remote node while memory
3453 * may still exist in local DMA zone.
3454 */
3455static int node_order[MAX_NUMNODES];
3456
3457static void build_zonelists_in_zone_order(pg_data_t *pgdat, int nr_nodes)
3458{
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003459 int pos, j, node;
3460 int zone_type; /* needs to be signed */
3461 struct zone *z;
3462 struct zonelist *zonelist;
3463
Mel Gorman54a6eb52008-04-28 02:12:16 -07003464 zonelist = &pgdat->node_zonelists[0];
3465 pos = 0;
3466 for (zone_type = MAX_NR_ZONES - 1; zone_type >= 0; zone_type--) {
3467 for (j = 0; j < nr_nodes; j++) {
3468 node = node_order[j];
3469 z = &NODE_DATA(node)->node_zones[zone_type];
3470 if (populated_zone(z)) {
Mel Gormandd1a2392008-04-28 02:12:17 -07003471 zoneref_set_zone(z,
3472 &zonelist->_zonerefs[pos++]);
Mel Gorman54a6eb52008-04-28 02:12:16 -07003473 check_highest_zone(zone_type);
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003474 }
3475 }
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003476 }
Mel Gormandd1a2392008-04-28 02:12:17 -07003477 zonelist->_zonerefs[pos].zone = NULL;
3478 zonelist->_zonerefs[pos].zone_idx = 0;
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003479}
3480
3481static int default_zonelist_order(void)
3482{
3483 int nid, zone_type;
Pintu Kumarb8af2942013-09-11 14:20:34 -07003484 unsigned long low_kmem_size, total_size;
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003485 struct zone *z;
3486 int average_size;
3487 /*
Pintu Kumarb8af2942013-09-11 14:20:34 -07003488 * ZONE_DMA and ZONE_DMA32 can be very small area in the system.
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003489 * If they are really small and used heavily, the system can fall
3490 * into OOM very easily.
David Rientjese325c902010-05-24 14:32:13 -07003491 * This function detect ZONE_DMA/DMA32 size and configures zone order.
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003492 */
3493 /* Is there ZONE_NORMAL ? (ex. ppc has only DMA zone..) */
3494 low_kmem_size = 0;
3495 total_size = 0;
3496 for_each_online_node(nid) {
3497 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++) {
3498 z = &NODE_DATA(nid)->node_zones[zone_type];
3499 if (populated_zone(z)) {
3500 if (zone_type < ZONE_NORMAL)
Jiang Liu4f9f4772013-07-03 15:03:07 -07003501 low_kmem_size += z->managed_pages;
3502 total_size += z->managed_pages;
David Rientjese325c902010-05-24 14:32:13 -07003503 } else if (zone_type == ZONE_NORMAL) {
3504 /*
3505 * If any node has only lowmem, then node order
3506 * is preferred to allow kernel allocations
3507 * locally; otherwise, they can easily infringe
3508 * on other nodes when there is an abundance of
3509 * lowmem available to allocate from.
3510 */
3511 return ZONELIST_ORDER_NODE;
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003512 }
3513 }
3514 }
3515 if (!low_kmem_size || /* there are no DMA area. */
3516 low_kmem_size > total_size/2) /* DMA/DMA32 is big. */
3517 return ZONELIST_ORDER_NODE;
3518 /*
3519 * look into each node's config.
Pintu Kumarb8af2942013-09-11 14:20:34 -07003520 * If there is a node whose DMA/DMA32 memory is very big area on
3521 * local memory, NODE_ORDER may be suitable.
3522 */
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07003523 average_size = total_size /
Lai Jiangshan4b0ef1fe2012-12-12 13:51:46 -08003524 (nodes_weight(node_states[N_MEMORY]) + 1);
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003525 for_each_online_node(nid) {
3526 low_kmem_size = 0;
3527 total_size = 0;
3528 for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++) {
3529 z = &NODE_DATA(nid)->node_zones[zone_type];
3530 if (populated_zone(z)) {
3531 if (zone_type < ZONE_NORMAL)
3532 low_kmem_size += z->present_pages;
3533 total_size += z->present_pages;
3534 }
3535 }
3536 if (low_kmem_size &&
3537 total_size > average_size && /* ignore small node */
3538 low_kmem_size > total_size * 70/100)
3539 return ZONELIST_ORDER_NODE;
3540 }
3541 return ZONELIST_ORDER_ZONE;
3542}
3543
3544static void set_zonelist_order(void)
3545{
3546 if (user_zonelist_order == ZONELIST_ORDER_DEFAULT)
3547 current_zonelist_order = default_zonelist_order();
3548 else
3549 current_zonelist_order = user_zonelist_order;
3550}
3551
3552static void build_zonelists(pg_data_t *pgdat)
3553{
3554 int j, node, load;
3555 enum zone_type i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003556 nodemask_t used_mask;
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003557 int local_node, prev_node;
3558 struct zonelist *zonelist;
3559 int order = current_zonelist_order;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003560
3561 /* initialize zonelists */
Christoph Lameter523b9452007-10-16 01:25:37 -07003562 for (i = 0; i < MAX_ZONELISTS; i++) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07003563 zonelist = pgdat->node_zonelists + i;
Mel Gormandd1a2392008-04-28 02:12:17 -07003564 zonelist->_zonerefs[0].zone = NULL;
3565 zonelist->_zonerefs[0].zone_idx = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003566 }
3567
3568 /* NUMA-aware ordering of nodes */
3569 local_node = pgdat->node_id;
Christoph Lameter62bc62a2009-06-16 15:32:15 -07003570 load = nr_online_nodes;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003571 prev_node = local_node;
3572 nodes_clear(used_mask);
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003573
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003574 memset(node_order, 0, sizeof(node_order));
3575 j = 0;
3576
Linus Torvalds1da177e2005-04-16 15:20:36 -07003577 while ((node = find_next_best_node(local_node, &used_mask)) >= 0) {
3578 /*
3579 * We don't want to pressure a particular node.
3580 * So adding penalty to the first node in same
3581 * distance group to make it round-robin.
3582 */
David Rientjes957f8222012-10-08 16:33:24 -07003583 if (node_distance(local_node, node) !=
3584 node_distance(local_node, prev_node))
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003585 node_load[node] = load;
3586
Linus Torvalds1da177e2005-04-16 15:20:36 -07003587 prev_node = node;
3588 load--;
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003589 if (order == ZONELIST_ORDER_NODE)
3590 build_zonelists_in_node_order(pgdat, node);
3591 else
3592 node_order[j++] = node; /* remember order */
3593 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07003594
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003595 if (order == ZONELIST_ORDER_ZONE) {
3596 /* calculate node order -- i.e., DMA last! */
3597 build_zonelists_in_zone_order(pgdat, j);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003598 }
Christoph Lameter523b9452007-10-16 01:25:37 -07003599
3600 build_thisnode_zonelists(pgdat);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003601}
3602
Paul Jackson9276b1bc2006-12-06 20:31:48 -08003603/* Construct the zonelist performance cache - see further mmzone.h */
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003604static void build_zonelist_cache(pg_data_t *pgdat)
Paul Jackson9276b1bc2006-12-06 20:31:48 -08003605{
Mel Gorman54a6eb52008-04-28 02:12:16 -07003606 struct zonelist *zonelist;
3607 struct zonelist_cache *zlc;
Mel Gormandd1a2392008-04-28 02:12:17 -07003608 struct zoneref *z;
Paul Jackson9276b1bc2006-12-06 20:31:48 -08003609
Mel Gorman54a6eb52008-04-28 02:12:16 -07003610 zonelist = &pgdat->node_zonelists[0];
3611 zonelist->zlcache_ptr = zlc = &zonelist->zlcache;
3612 bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST);
Mel Gormandd1a2392008-04-28 02:12:17 -07003613 for (z = zonelist->_zonerefs; z->zone; z++)
3614 zlc->z_to_n[z - zonelist->_zonerefs] = zonelist_node_idx(z);
Paul Jackson9276b1bc2006-12-06 20:31:48 -08003615}
3616
Lee Schermerhorn7aac7892010-05-26 14:45:00 -07003617#ifdef CONFIG_HAVE_MEMORYLESS_NODES
3618/*
3619 * Return node id of node used for "local" allocations.
3620 * I.e., first node id of first zone in arg node's generic zonelist.
3621 * Used for initializing percpu 'numa_mem', which is used primarily
3622 * for kernel allocations, so use GFP_KERNEL flags to locate zonelist.
3623 */
3624int local_memory_node(int node)
3625{
3626 struct zone *zone;
3627
3628 (void)first_zones_zonelist(node_zonelist(node, GFP_KERNEL),
3629 gfp_zone(GFP_KERNEL),
3630 NULL,
3631 &zone);
3632 return zone->node;
3633}
3634#endif
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003635
Linus Torvalds1da177e2005-04-16 15:20:36 -07003636#else /* CONFIG_NUMA */
3637
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003638static void set_zonelist_order(void)
3639{
3640 current_zonelist_order = ZONELIST_ORDER_ZONE;
3641}
3642
3643static void build_zonelists(pg_data_t *pgdat)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003644{
Christoph Lameter19655d32006-09-25 23:31:19 -07003645 int node, local_node;
Mel Gorman54a6eb52008-04-28 02:12:16 -07003646 enum zone_type j;
3647 struct zonelist *zonelist;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003648
3649 local_node = pgdat->node_id;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003650
Mel Gorman54a6eb52008-04-28 02:12:16 -07003651 zonelist = &pgdat->node_zonelists[0];
Zhang Yanfeibc732f12013-07-08 16:00:06 -07003652 j = build_zonelists_node(pgdat, zonelist, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003653
Mel Gorman54a6eb52008-04-28 02:12:16 -07003654 /*
3655 * Now we build the zonelist so that it contains the zones
3656 * of all the other nodes.
3657 * We don't want to pressure a particular node, so when
3658 * building the zones for node N, we make sure that the
3659 * zones coming right after the local ones are those from
3660 * node N+1 (modulo N)
3661 */
3662 for (node = local_node + 1; node < MAX_NUMNODES; node++) {
3663 if (!node_online(node))
3664 continue;
Zhang Yanfeibc732f12013-07-08 16:00:06 -07003665 j = build_zonelists_node(NODE_DATA(node), zonelist, j);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003666 }
Mel Gorman54a6eb52008-04-28 02:12:16 -07003667 for (node = 0; node < local_node; node++) {
3668 if (!node_online(node))
3669 continue;
Zhang Yanfeibc732f12013-07-08 16:00:06 -07003670 j = build_zonelists_node(NODE_DATA(node), zonelist, j);
Mel Gorman54a6eb52008-04-28 02:12:16 -07003671 }
3672
Mel Gormandd1a2392008-04-28 02:12:17 -07003673 zonelist->_zonerefs[j].zone = NULL;
3674 zonelist->_zonerefs[j].zone_idx = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003675}
3676
Paul Jackson9276b1bc2006-12-06 20:31:48 -08003677/* non-NUMA variant of zonelist performance cache - just NULL zlcache_ptr */
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003678static void build_zonelist_cache(pg_data_t *pgdat)
Paul Jackson9276b1bc2006-12-06 20:31:48 -08003679{
Mel Gorman54a6eb52008-04-28 02:12:16 -07003680 pgdat->node_zonelists[0].zlcache_ptr = NULL;
Paul Jackson9276b1bc2006-12-06 20:31:48 -08003681}
3682
Linus Torvalds1da177e2005-04-16 15:20:36 -07003683#endif /* CONFIG_NUMA */
3684
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09003685/*
3686 * Boot pageset table. One per cpu which is going to be used for all
3687 * zones and all nodes. The parameters will be set in such a way
3688 * that an item put on a list will immediately be handed over to
3689 * the buddy list. This is safe since pageset manipulation is done
3690 * with interrupts disabled.
3691 *
3692 * The boot_pagesets must be kept even after bootup is complete for
3693 * unused processors and/or zones. They do play a role for bootstrapping
3694 * hotplugged processors.
3695 *
3696 * zoneinfo_show() and maybe other functions do
3697 * not check if the processor is online before following the pageset pointer.
3698 * Other parts of the kernel may not check if the zone is available.
3699 */
3700static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch);
3701static DEFINE_PER_CPU(struct per_cpu_pageset, boot_pageset);
Haicheng Li1f522502010-05-24 14:32:51 -07003702static void setup_zone_pageset(struct zone *zone);
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09003703
Haicheng Li4eaf3f62010-05-24 14:32:52 -07003704/*
3705 * Global mutex to protect against size modification of zonelists
3706 * as well as to serialize pageset setup for the new populated zone.
3707 */
3708DEFINE_MUTEX(zonelists_mutex);
3709
Rusty Russell9b1a4d32008-07-28 12:16:30 -05003710/* return values int ....just for stop_machine() */
Jiang Liu4ed7e022012-07-31 16:43:35 -07003711static int __build_all_zonelists(void *data)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003712{
Yasunori Goto68113782006-06-23 02:03:11 -07003713 int nid;
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09003714 int cpu;
Jiang Liu9adb62a2012-07-31 16:43:28 -07003715 pg_data_t *self = data;
Paul Jackson9276b1bc2006-12-06 20:31:48 -08003716
Bo Liu7f9cfb32009-08-18 14:11:19 -07003717#ifdef CONFIG_NUMA
3718 memset(node_load, 0, sizeof(node_load));
3719#endif
Jiang Liu9adb62a2012-07-31 16:43:28 -07003720
3721 if (self && !node_online(self->node_id)) {
3722 build_zonelists(self);
3723 build_zonelist_cache(self);
3724 }
3725
Paul Jackson9276b1bc2006-12-06 20:31:48 -08003726 for_each_online_node(nid) {
Christoph Lameter7ea15302007-10-16 01:25:29 -07003727 pg_data_t *pgdat = NODE_DATA(nid);
3728
3729 build_zonelists(pgdat);
3730 build_zonelist_cache(pgdat);
Paul Jackson9276b1bc2006-12-06 20:31:48 -08003731 }
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09003732
3733 /*
3734 * Initialize the boot_pagesets that are going to be used
3735 * for bootstrapping processors. The real pagesets for
3736 * each zone will be allocated later when the per cpu
3737 * allocator is available.
3738 *
3739 * boot_pagesets are used also for bootstrapping offline
3740 * cpus if the system is already booted because the pagesets
3741 * are needed to initialize allocators on a specific cpu too.
3742 * F.e. the percpu allocator needs the page allocator which
3743 * needs the percpu allocator in order to allocate its pagesets
3744 * (a chicken-egg dilemma).
3745 */
Lee Schermerhorn7aac7892010-05-26 14:45:00 -07003746 for_each_possible_cpu(cpu) {
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09003747 setup_pageset(&per_cpu(boot_pageset, cpu), 0);
3748
Lee Schermerhorn7aac7892010-05-26 14:45:00 -07003749#ifdef CONFIG_HAVE_MEMORYLESS_NODES
3750 /*
3751 * We now know the "local memory node" for each node--
3752 * i.e., the node of the first zone in the generic zonelist.
3753 * Set up numa_mem percpu variable for on-line cpus. During
3754 * boot, only the boot cpu should be on-line; we'll init the
3755 * secondary cpus' numa_mem as they come on-line. During
3756 * node/memory hotplug, we'll fixup all on-line cpus.
3757 */
3758 if (cpu_online(cpu))
3759 set_cpu_numa_mem(cpu, local_memory_node(cpu_to_node(cpu)));
3760#endif
3761 }
3762
Yasunori Goto68113782006-06-23 02:03:11 -07003763 return 0;
3764}
Linus Torvalds1da177e2005-04-16 15:20:36 -07003765
Haicheng Li4eaf3f62010-05-24 14:32:52 -07003766/*
3767 * Called with zonelists_mutex held always
3768 * unless system_state == SYSTEM_BOOTING.
3769 */
Jiang Liu9adb62a2012-07-31 16:43:28 -07003770void __ref build_all_zonelists(pg_data_t *pgdat, struct zone *zone)
Yasunori Goto68113782006-06-23 02:03:11 -07003771{
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003772 set_zonelist_order();
3773
Yasunori Goto68113782006-06-23 02:03:11 -07003774 if (system_state == SYSTEM_BOOTING) {
Randy Dunlap423b41d2006-09-27 01:50:12 -07003775 __build_all_zonelists(NULL);
Mel Gorman68ad8df2008-07-23 21:26:52 -07003776 mminit_verify_zonelist();
Yasunori Goto68113782006-06-23 02:03:11 -07003777 cpuset_init_current_mems_allowed();
3778 } else {
KAMEZAWA Hiroyukie9959f02010-11-24 12:57:09 -08003779#ifdef CONFIG_MEMORY_HOTPLUG
Jiang Liu9adb62a2012-07-31 16:43:28 -07003780 if (zone)
3781 setup_zone_pageset(zone);
KAMEZAWA Hiroyukie9959f02010-11-24 12:57:09 -08003782#endif
Cody P Schaferdd1895e2013-07-03 15:01:36 -07003783 /* we have to stop all cpus to guarantee there is no user
3784 of zonelist */
Jiang Liu9adb62a2012-07-31 16:43:28 -07003785 stop_machine(__build_all_zonelists, pgdat, NULL);
Yasunori Goto68113782006-06-23 02:03:11 -07003786 /* cpuset refresh routine should be here */
3787 }
Andrew Mortonbd1e22b2006-06-23 02:03:47 -07003788 vm_total_pages = nr_free_pagecache_pages();
Mel Gorman9ef9acb2007-10-16 01:25:54 -07003789 /*
3790 * Disable grouping by mobility if the number of pages in the
3791 * system is too low to allow the mechanism to work. It would be
3792 * more accurate, but expensive to check per-zone. This check is
3793 * made on memory-hotadd so a system can start with mobility
3794 * disabled and enable it later
3795 */
Mel Gormand9c23402007-10-16 01:26:01 -07003796 if (vm_total_pages < (pageblock_nr_pages * MIGRATE_TYPES))
Mel Gorman9ef9acb2007-10-16 01:25:54 -07003797 page_group_by_mobility_disabled = 1;
3798 else
3799 page_group_by_mobility_disabled = 0;
3800
3801 printk("Built %i zonelists in %s order, mobility grouping %s. "
3802 "Total pages: %ld\n",
Christoph Lameter62bc62a2009-06-16 15:32:15 -07003803 nr_online_nodes,
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003804 zonelist_order_name[current_zonelist_order],
Mel Gorman9ef9acb2007-10-16 01:25:54 -07003805 page_group_by_mobility_disabled ? "off" : "on",
KAMEZAWA Hiroyukif0c0b2b2007-07-15 23:38:01 -07003806 vm_total_pages);
3807#ifdef CONFIG_NUMA
3808 printk("Policy zone: %s\n", zone_names[policy_zone]);
3809#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07003810}
3811
3812/*
3813 * Helper functions to size the waitqueue hash table.
3814 * Essentially these want to choose hash table sizes sufficiently
3815 * large so that collisions trying to wait on pages are rare.
3816 * But in fact, the number of active page waitqueues on typical
3817 * systems is ridiculously low, less than 200. So this is even
3818 * conservative, even though it seems large.
3819 *
3820 * The constant PAGES_PER_WAITQUEUE specifies the ratio of pages to
3821 * waitqueues, i.e. the size of the waitq table given the number of pages.
3822 */
3823#define PAGES_PER_WAITQUEUE 256
3824
Yasunori Gotocca448f2006-06-23 02:03:10 -07003825#ifndef CONFIG_MEMORY_HOTPLUG
Yasunori Goto02b694d2006-06-23 02:03:08 -07003826static inline unsigned long wait_table_hash_nr_entries(unsigned long pages)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003827{
3828 unsigned long size = 1;
3829
3830 pages /= PAGES_PER_WAITQUEUE;
3831
3832 while (size < pages)
3833 size <<= 1;
3834
3835 /*
3836 * Once we have dozens or even hundreds of threads sleeping
3837 * on IO we've got bigger problems than wait queue collision.
3838 * Limit the size of the wait table to a reasonable size.
3839 */
3840 size = min(size, 4096UL);
3841
3842 return max(size, 4UL);
3843}
Yasunori Gotocca448f2006-06-23 02:03:10 -07003844#else
3845/*
3846 * A zone's size might be changed by hot-add, so it is not possible to determine
3847 * a suitable size for its wait_table. So we use the maximum size now.
3848 *
3849 * The max wait table size = 4096 x sizeof(wait_queue_head_t). ie:
3850 *
3851 * i386 (preemption config) : 4096 x 16 = 64Kbyte.
3852 * ia64, x86-64 (no preemption): 4096 x 20 = 80Kbyte.
3853 * ia64, x86-64 (preemption) : 4096 x 24 = 96Kbyte.
3854 *
3855 * The maximum entries are prepared when a zone's memory is (512K + 256) pages
3856 * or more by the traditional way. (See above). It equals:
3857 *
3858 * i386, x86-64, powerpc(4K page size) : = ( 2G + 1M)byte.
3859 * ia64(16K page size) : = ( 8G + 4M)byte.
3860 * powerpc (64K page size) : = (32G +16M)byte.
3861 */
3862static inline unsigned long wait_table_hash_nr_entries(unsigned long pages)
3863{
3864 return 4096UL;
3865}
3866#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07003867
3868/*
3869 * This is an integer logarithm so that shifts can be used later
3870 * to extract the more random high bits from the multiplicative
3871 * hash function before the remainder is taken.
3872 */
3873static inline unsigned long wait_table_bits(unsigned long size)
3874{
3875 return ffz(~size);
3876}
3877
Mel Gorman56fd56b2007-10-16 01:25:58 -07003878/*
Arve Hjønnevåg6d3163c2011-05-24 17:12:24 -07003879 * Check if a pageblock contains reserved pages
3880 */
3881static int pageblock_is_reserved(unsigned long start_pfn, unsigned long end_pfn)
3882{
3883 unsigned long pfn;
3884
3885 for (pfn = start_pfn; pfn < end_pfn; pfn++) {
3886 if (!pfn_valid_within(pfn) || PageReserved(pfn_to_page(pfn)))
3887 return 1;
3888 }
3889 return 0;
3890}
3891
3892/*
Mel Gormand9c23402007-10-16 01:26:01 -07003893 * Mark a number of pageblocks as MIGRATE_RESERVE. The number
Mel Gorman41858962009-06-16 15:32:12 -07003894 * of blocks reserved is based on min_wmark_pages(zone). The memory within
3895 * the reserve will tend to store contiguous free pages. Setting min_free_kbytes
Mel Gorman56fd56b2007-10-16 01:25:58 -07003896 * higher will lead to a bigger reserve which will get freed as contiguous
3897 * blocks as reclaim kicks in
3898 */
3899static void setup_zone_migrate_reserve(struct zone *zone)
3900{
Arve Hjønnevåg6d3163c2011-05-24 17:12:24 -07003901 unsigned long start_pfn, pfn, end_pfn, block_end_pfn;
Mel Gorman56fd56b2007-10-16 01:25:58 -07003902 struct page *page;
Mel Gorman78986a62009-09-21 17:03:02 -07003903 unsigned long block_migratetype;
3904 int reserve;
Mel Gorman56fd56b2007-10-16 01:25:58 -07003905
Michal Hockod02156382011-12-08 14:34:27 -08003906 /*
3907 * Get the start pfn, end pfn and the number of blocks to reserve
3908 * We have to be careful to be aligned to pageblock_nr_pages to
3909 * make sure that we always check pfn_valid for the first page in
3910 * the block.
3911 */
Mel Gorman56fd56b2007-10-16 01:25:58 -07003912 start_pfn = zone->zone_start_pfn;
Cody P Schafer108bcc92013-02-22 16:35:23 -08003913 end_pfn = zone_end_pfn(zone);
Michal Hockod02156382011-12-08 14:34:27 -08003914 start_pfn = roundup(start_pfn, pageblock_nr_pages);
Mel Gorman41858962009-06-16 15:32:12 -07003915 reserve = roundup(min_wmark_pages(zone), pageblock_nr_pages) >>
Mel Gormand9c23402007-10-16 01:26:01 -07003916 pageblock_order;
Mel Gorman56fd56b2007-10-16 01:25:58 -07003917
Mel Gorman78986a62009-09-21 17:03:02 -07003918 /*
3919 * Reserve blocks are generally in place to help high-order atomic
3920 * allocations that are short-lived. A min_free_kbytes value that
3921 * would result in more than 2 reserve blocks for atomic allocations
3922 * is assumed to be in place to help anti-fragmentation for the
3923 * future allocation of hugepages at runtime.
3924 */
3925 reserve = min(2, reserve);
3926
Mel Gormand9c23402007-10-16 01:26:01 -07003927 for (pfn = start_pfn; pfn < end_pfn; pfn += pageblock_nr_pages) {
Mel Gorman56fd56b2007-10-16 01:25:58 -07003928 if (!pfn_valid(pfn))
3929 continue;
3930 page = pfn_to_page(pfn);
3931
Adam Litke344c7902008-09-02 14:35:38 -07003932 /* Watch out for overlapping nodes */
3933 if (page_to_nid(page) != zone_to_nid(zone))
3934 continue;
3935
Mel Gorman56fd56b2007-10-16 01:25:58 -07003936 block_migratetype = get_pageblock_migratetype(page);
3937
Mel Gorman938929f2012-01-10 15:07:14 -08003938 /* Only test what is necessary when the reserves are not met */
3939 if (reserve > 0) {
3940 /*
3941 * Blocks with reserved pages will never free, skip
3942 * them.
3943 */
3944 block_end_pfn = min(pfn + pageblock_nr_pages, end_pfn);
3945 if (pageblock_is_reserved(pfn, block_end_pfn))
3946 continue;
Mel Gorman56fd56b2007-10-16 01:25:58 -07003947
Mel Gorman938929f2012-01-10 15:07:14 -08003948 /* If this block is reserved, account for it */
3949 if (block_migratetype == MIGRATE_RESERVE) {
3950 reserve--;
3951 continue;
3952 }
3953
3954 /* Suitable for reserving if this block is movable */
3955 if (block_migratetype == MIGRATE_MOVABLE) {
3956 set_pageblock_migratetype(page,
3957 MIGRATE_RESERVE);
3958 move_freepages_block(zone, page,
3959 MIGRATE_RESERVE);
3960 reserve--;
3961 continue;
3962 }
Mel Gorman56fd56b2007-10-16 01:25:58 -07003963 }
3964
3965 /*
3966 * If the reserve is met and this is a previous reserved block,
3967 * take it back
3968 */
3969 if (block_migratetype == MIGRATE_RESERVE) {
3970 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
3971 move_freepages_block(zone, page, MIGRATE_MOVABLE);
3972 }
3973 }
3974}
Mel Gormanac0e5b72007-10-16 01:25:58 -07003975
Linus Torvalds1da177e2005-04-16 15:20:36 -07003976/*
3977 * Initially all pages are reserved - free ones are freed
3978 * up by free_all_bootmem() once the early boot process is
3979 * done. Non-atomic initialization, single-pass.
3980 */
Matt Tolentinoc09b4242006-01-17 07:03:44 +01003981void __meminit memmap_init_zone(unsigned long size, int nid, unsigned long zone,
Dave Hansena2f3aa022007-01-10 23:15:30 -08003982 unsigned long start_pfn, enum memmap_context context)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003983{
Linus Torvalds1da177e2005-04-16 15:20:36 -07003984 struct page *page;
Andy Whitcroft29751f62005-06-23 00:08:00 -07003985 unsigned long end_pfn = start_pfn + size;
3986 unsigned long pfn;
KAMEZAWA Hiroyuki86051ca2008-04-29 00:58:21 -07003987 struct zone *z;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003988
Hugh Dickins22b31ee2009-01-06 14:40:09 -08003989 if (highest_memmap_pfn < end_pfn - 1)
3990 highest_memmap_pfn = end_pfn - 1;
3991
KAMEZAWA Hiroyuki86051ca2008-04-29 00:58:21 -07003992 z = &NODE_DATA(nid)->node_zones[zone];
Greg Ungerercbe8dd42006-01-12 01:05:24 -08003993 for (pfn = start_pfn; pfn < end_pfn; pfn++) {
Dave Hansena2f3aa022007-01-10 23:15:30 -08003994 /*
3995 * There can be holes in boot-time mem_map[]s
3996 * handed to this function. They do not
3997 * exist on hotplugged memory.
3998 */
3999 if (context == MEMMAP_EARLY) {
4000 if (!early_pfn_valid(pfn))
4001 continue;
4002 if (!early_pfn_in_nid(pfn, nid))
4003 continue;
4004 }
Andy Whitcroftd41dee32005-06-23 00:07:54 -07004005 page = pfn_to_page(pfn);
4006 set_page_links(page, zone, nid, pfn);
Mel Gorman708614e2008-07-23 21:26:51 -07004007 mminit_verify_page_links(page, zone, nid, pfn);
Nick Piggin7835e982006-03-22 00:08:40 -08004008 init_page_count(page);
Mel Gorman22b751c2013-02-22 16:34:59 -08004009 page_mapcount_reset(page);
Peter Zijlstra90572892013-10-07 11:29:20 +01004010 page_cpupid_reset_last(page);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004011 SetPageReserved(page);
Mel Gormanb2a0ac82007-10-16 01:25:48 -07004012 /*
4013 * Mark the block movable so that blocks are reserved for
4014 * movable at startup. This will force kernel allocations
4015 * to reserve their blocks rather than leaking throughout
4016 * the address space during boot when many long-lived
Mel Gorman56fd56b2007-10-16 01:25:58 -07004017 * kernel allocations are made. Later some blocks near
4018 * the start are marked MIGRATE_RESERVE by
4019 * setup_zone_migrate_reserve()
KAMEZAWA Hiroyuki86051ca2008-04-29 00:58:21 -07004020 *
4021 * bitmap is created for zone's valid pfn range. but memmap
4022 * can be created for invalid pages (for alignment)
4023 * check here not to call set_pageblock_migratetype() against
4024 * pfn out of zone.
Mel Gormanb2a0ac82007-10-16 01:25:48 -07004025 */
KAMEZAWA Hiroyuki86051ca2008-04-29 00:58:21 -07004026 if ((z->zone_start_pfn <= pfn)
Cody P Schafer108bcc92013-02-22 16:35:23 -08004027 && (pfn < zone_end_pfn(z))
KAMEZAWA Hiroyuki86051ca2008-04-29 00:58:21 -07004028 && !(pfn & (pageblock_nr_pages - 1)))
Mel Gorman56fd56b2007-10-16 01:25:58 -07004029 set_pageblock_migratetype(page, MIGRATE_MOVABLE);
Mel Gormanb2a0ac82007-10-16 01:25:48 -07004030
Linus Torvalds1da177e2005-04-16 15:20:36 -07004031 INIT_LIST_HEAD(&page->lru);
4032#ifdef WANT_PAGE_VIRTUAL
4033 /* The shift won't overflow because ZONE_NORMAL is below 4G. */
4034 if (!is_highmem_idx(zone))
Bob Picco3212c6b2005-06-27 14:36:28 -07004035 set_page_address(page, __va(pfn << PAGE_SHIFT));
Linus Torvalds1da177e2005-04-16 15:20:36 -07004036#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07004037 }
4038}
4039
Andi Kleen1e548de2008-02-04 22:29:26 -08004040static void __meminit zone_init_free_lists(struct zone *zone)
Linus Torvalds1da177e2005-04-16 15:20:36 -07004041{
Mel Gormanb2a0ac82007-10-16 01:25:48 -07004042 int order, t;
4043 for_each_migratetype_order(order, t) {
4044 INIT_LIST_HEAD(&zone->free_area[order].free_list[t]);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004045 zone->free_area[order].nr_free = 0;
4046 }
4047}
4048
4049#ifndef __HAVE_ARCH_MEMMAP_INIT
4050#define memmap_init(size, nid, zone, start_pfn) \
Dave Hansena2f3aa022007-01-10 23:15:30 -08004051 memmap_init_zone((size), (nid), (zone), (start_pfn), MEMMAP_EARLY)
Linus Torvalds1da177e2005-04-16 15:20:36 -07004052#endif
4053
Jiang Liu4ed7e022012-07-31 16:43:35 -07004054static int __meminit zone_batchsize(struct zone *zone)
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07004055{
David Howells3a6be872009-05-06 16:03:03 -07004056#ifdef CONFIG_MMU
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07004057 int batch;
4058
4059 /*
4060 * The per-cpu-pages pools are set to around 1000th of the
Seth, Rohitba56e912005-10-29 18:15:47 -07004061 * size of the zone. But no more than 1/2 of a meg.
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07004062 *
4063 * OK, so we don't know how big the cache is. So guess.
4064 */
Jiang Liub40da042013-02-22 16:33:52 -08004065 batch = zone->managed_pages / 1024;
Seth, Rohitba56e912005-10-29 18:15:47 -07004066 if (batch * PAGE_SIZE > 512 * 1024)
4067 batch = (512 * 1024) / PAGE_SIZE;
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07004068 batch /= 4; /* We effectively *= 4 below */
4069 if (batch < 1)
4070 batch = 1;
4071
4072 /*
Nick Piggin0ceaacc2005-12-04 13:55:25 +11004073 * Clamp the batch to a 2^n - 1 value. Having a power
4074 * of 2 value was found to be more likely to have
4075 * suboptimal cache aliasing properties in some cases.
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07004076 *
Nick Piggin0ceaacc2005-12-04 13:55:25 +11004077 * For example if 2 tasks are alternately allocating
4078 * batches of pages, one task can end up with a lot
4079 * of pages of one half of the possible page colors
4080 * and the other with pages of the other colors.
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07004081 */
David Howells91552032009-05-06 16:03:02 -07004082 batch = rounddown_pow_of_two(batch + batch/2) - 1;
Seth, Rohitba56e912005-10-29 18:15:47 -07004083
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07004084 return batch;
David Howells3a6be872009-05-06 16:03:03 -07004085
4086#else
4087 /* The deferral and batching of frees should be suppressed under NOMMU
4088 * conditions.
4089 *
4090 * The problem is that NOMMU needs to be able to allocate large chunks
4091 * of contiguous memory as there's no hardware page translation to
4092 * assemble apparent contiguous memory from discontiguous pages.
4093 *
4094 * Queueing large contiguous runs of pages for batching, however,
4095 * causes the pages to actually be freed in smaller chunks. As there
4096 * can be a significant delay between the individual batches being
4097 * recycled, this leads to the once large chunks of space being
4098 * fragmented and becoming unavailable for high-order allocations.
4099 */
4100 return 0;
4101#endif
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07004102}
4103
Cody P Schafer8d7a8fa2013-07-03 15:01:31 -07004104/*
4105 * pcp->high and pcp->batch values are related and dependent on one another:
4106 * ->batch must never be higher then ->high.
4107 * The following function updates them in a safe manner without read side
4108 * locking.
4109 *
4110 * Any new users of pcp->batch and pcp->high should ensure they can cope with
4111 * those fields changing asynchronously (acording the the above rule).
4112 *
4113 * mutex_is_locked(&pcp_batch_high_lock) required when calling this function
4114 * outside of boot time (or some other assurance that no concurrent updaters
4115 * exist).
4116 */
4117static void pageset_update(struct per_cpu_pages *pcp, unsigned long high,
4118 unsigned long batch)
4119{
4120 /* start with a fail safe value for batch */
4121 pcp->batch = 1;
4122 smp_wmb();
4123
4124 /* Update high, then batch, in order */
4125 pcp->high = high;
4126 smp_wmb();
4127
4128 pcp->batch = batch;
4129}
4130
Cody P Schafer36640332013-07-03 15:01:40 -07004131/* a companion to pageset_set_high() */
Cody P Schafer4008bab2013-07-03 15:01:28 -07004132static void pageset_set_batch(struct per_cpu_pageset *p, unsigned long batch)
4133{
Cody P Schafer8d7a8fa2013-07-03 15:01:31 -07004134 pageset_update(&p->pcp, 6 * batch, max(1UL, 1 * batch));
Cody P Schafer4008bab2013-07-03 15:01:28 -07004135}
4136
Cody P Schafer88c90db2013-07-03 15:01:35 -07004137static void pageset_init(struct per_cpu_pageset *p)
Christoph Lameter2caaad42005-06-21 17:15:00 -07004138{
4139 struct per_cpu_pages *pcp;
Mel Gorman5f8dcc22009-09-21 17:03:19 -07004140 int migratetype;
Christoph Lameter2caaad42005-06-21 17:15:00 -07004141
Magnus Damm1c6fe942005-10-26 01:58:59 -07004142 memset(p, 0, sizeof(*p));
4143
Christoph Lameter3dfa5722008-02-04 22:29:19 -08004144 pcp = &p->pcp;
Christoph Lameter2caaad42005-06-21 17:15:00 -07004145 pcp->count = 0;
Mel Gorman5f8dcc22009-09-21 17:03:19 -07004146 for (migratetype = 0; migratetype < MIGRATE_PCPTYPES; migratetype++)
4147 INIT_LIST_HEAD(&pcp->lists[migratetype]);
Christoph Lameter2caaad42005-06-21 17:15:00 -07004148}
4149
Cody P Schafer88c90db2013-07-03 15:01:35 -07004150static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch)
4151{
4152 pageset_init(p);
4153 pageset_set_batch(p, batch);
4154}
4155
Rohit Seth8ad4b1f2006-01-08 01:00:40 -08004156/*
Cody P Schafer36640332013-07-03 15:01:40 -07004157 * pageset_set_high() sets the high water mark for hot per_cpu_pagelist
Rohit Seth8ad4b1f2006-01-08 01:00:40 -08004158 * to the value high for the pageset p.
4159 */
Cody P Schafer36640332013-07-03 15:01:40 -07004160static void pageset_set_high(struct per_cpu_pageset *p,
Rohit Seth8ad4b1f2006-01-08 01:00:40 -08004161 unsigned long high)
4162{
Cody P Schafer8d7a8fa2013-07-03 15:01:31 -07004163 unsigned long batch = max(1UL, high / 4);
4164 if ((high / 4) > (PAGE_SHIFT * 8))
4165 batch = PAGE_SHIFT * 8;
Rohit Seth8ad4b1f2006-01-08 01:00:40 -08004166
Cody P Schafer8d7a8fa2013-07-03 15:01:31 -07004167 pageset_update(&p->pcp, high, batch);
Rohit Seth8ad4b1f2006-01-08 01:00:40 -08004168}
4169
Cody P Schafer169f6c12013-07-03 15:01:41 -07004170static void __meminit pageset_set_high_and_batch(struct zone *zone,
4171 struct per_cpu_pageset *pcp)
Cody P Schafer56cef2b2013-07-03 15:01:38 -07004172{
Cody P Schafer56cef2b2013-07-03 15:01:38 -07004173 if (percpu_pagelist_fraction)
Cody P Schafer36640332013-07-03 15:01:40 -07004174 pageset_set_high(pcp,
Cody P Schafer56cef2b2013-07-03 15:01:38 -07004175 (zone->managed_pages /
4176 percpu_pagelist_fraction));
4177 else
4178 pageset_set_batch(pcp, zone_batchsize(zone));
4179}
4180
Cody P Schafer169f6c12013-07-03 15:01:41 -07004181static void __meminit zone_pageset_init(struct zone *zone, int cpu)
4182{
4183 struct per_cpu_pageset *pcp = per_cpu_ptr(zone->pageset, cpu);
4184
4185 pageset_init(pcp);
4186 pageset_set_high_and_batch(zone, pcp);
4187}
4188
Jiang Liu4ed7e022012-07-31 16:43:35 -07004189static void __meminit setup_zone_pageset(struct zone *zone)
Wu Fengguang319774e2010-05-24 14:32:49 -07004190{
4191 int cpu;
Wu Fengguang319774e2010-05-24 14:32:49 -07004192 zone->pageset = alloc_percpu(struct per_cpu_pageset);
Cody P Schafer56cef2b2013-07-03 15:01:38 -07004193 for_each_possible_cpu(cpu)
4194 zone_pageset_init(zone, cpu);
Wu Fengguang319774e2010-05-24 14:32:49 -07004195}
4196
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07004197/*
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09004198 * Allocate per cpu pagesets and initialize them.
4199 * Before this call only boot pagesets were available.
Christoph Lameter2caaad42005-06-21 17:15:00 -07004200 */
Al Viro78d99552005-12-15 09:18:25 +00004201void __init setup_per_cpu_pageset(void)
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07004202{
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09004203 struct zone *zone;
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07004204
Wu Fengguang319774e2010-05-24 14:32:49 -07004205 for_each_populated_zone(zone)
4206 setup_zone_pageset(zone);
Christoph Lametere7c8d5c2005-06-21 17:14:47 -07004207}
4208
Sam Ravnborg577a32f2007-05-17 23:29:25 +02004209static noinline __init_refok
Yasunori Gotocca448f2006-06-23 02:03:10 -07004210int zone_wait_table_init(struct zone *zone, unsigned long zone_size_pages)
Dave Hansened8ece22005-10-29 18:16:50 -07004211{
4212 int i;
4213 struct pglist_data *pgdat = zone->zone_pgdat;
Yasunori Gotocca448f2006-06-23 02:03:10 -07004214 size_t alloc_size;
Dave Hansened8ece22005-10-29 18:16:50 -07004215
4216 /*
4217 * The per-page waitqueue mechanism uses hashed waitqueues
4218 * per zone.
4219 */
Yasunori Goto02b694d2006-06-23 02:03:08 -07004220 zone->wait_table_hash_nr_entries =
4221 wait_table_hash_nr_entries(zone_size_pages);
4222 zone->wait_table_bits =
4223 wait_table_bits(zone->wait_table_hash_nr_entries);
Yasunori Gotocca448f2006-06-23 02:03:10 -07004224 alloc_size = zone->wait_table_hash_nr_entries
4225 * sizeof(wait_queue_head_t);
4226
Heiko Carstenscd94b9d2008-05-23 13:04:52 -07004227 if (!slab_is_available()) {
Yasunori Gotocca448f2006-06-23 02:03:10 -07004228 zone->wait_table = (wait_queue_head_t *)
Yinghai Lu8f389a992011-05-11 15:13:32 -07004229 alloc_bootmem_node_nopanic(pgdat, alloc_size);
Yasunori Gotocca448f2006-06-23 02:03:10 -07004230 } else {
4231 /*
4232 * This case means that a zone whose size was 0 gets new memory
4233 * via memory hot-add.
4234 * But it may be the case that a new node was hot-added. In
4235 * this case vmalloc() will not be able to use this new node's
4236 * memory - this wait_table must be initialized to use this new
4237 * node itself as well.
4238 * To use this new node's memory, further consideration will be
4239 * necessary.
4240 */
Jesper Juhl8691f3a2007-10-16 01:24:49 -07004241 zone->wait_table = vmalloc(alloc_size);
Yasunori Gotocca448f2006-06-23 02:03:10 -07004242 }
4243 if (!zone->wait_table)
4244 return -ENOMEM;
Dave Hansened8ece22005-10-29 18:16:50 -07004245
Pintu Kumarb8af2942013-09-11 14:20:34 -07004246 for (i = 0; i < zone->wait_table_hash_nr_entries; ++i)
Dave Hansened8ece22005-10-29 18:16:50 -07004247 init_waitqueue_head(zone->wait_table + i);
Yasunori Gotocca448f2006-06-23 02:03:10 -07004248
4249 return 0;
Dave Hansened8ece22005-10-29 18:16:50 -07004250}
4251
Matt Tolentinoc09b4242006-01-17 07:03:44 +01004252static __meminit void zone_pcp_init(struct zone *zone)
Dave Hansened8ece22005-10-29 18:16:50 -07004253{
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09004254 /*
4255 * per cpu subsystem is not up at this point. The following code
4256 * relies on the ability of the linker to provide the
4257 * offset of a (static) per cpu variable into the per cpu area.
4258 */
4259 zone->pageset = &boot_pageset;
Dave Hansened8ece22005-10-29 18:16:50 -07004260
Xishi Qiub38a8722013-11-12 15:07:20 -08004261 if (populated_zone(zone))
Christoph Lameter99dcc3e2010-01-05 15:34:51 +09004262 printk(KERN_DEBUG " %s zone: %lu pages, LIFO batch:%u\n",
4263 zone->name, zone->present_pages,
4264 zone_batchsize(zone));
Dave Hansened8ece22005-10-29 18:16:50 -07004265}
4266
Jiang Liu4ed7e022012-07-31 16:43:35 -07004267int __meminit init_currently_empty_zone(struct zone *zone,
Yasunori Goto718127c2006-06-23 02:03:10 -07004268 unsigned long zone_start_pfn,
Dave Hansena2f3aa022007-01-10 23:15:30 -08004269 unsigned long size,
4270 enum memmap_context context)
Dave Hansened8ece22005-10-29 18:16:50 -07004271{
4272 struct pglist_data *pgdat = zone->zone_pgdat;
Yasunori Gotocca448f2006-06-23 02:03:10 -07004273 int ret;
4274 ret = zone_wait_table_init(zone, size);
4275 if (ret)
4276 return ret;
Dave Hansened8ece22005-10-29 18:16:50 -07004277 pgdat->nr_zones = zone_idx(zone) + 1;
4278
Dave Hansened8ece22005-10-29 18:16:50 -07004279 zone->zone_start_pfn = zone_start_pfn;
4280
Mel Gorman708614e2008-07-23 21:26:51 -07004281 mminit_dprintk(MMINIT_TRACE, "memmap_init",
4282 "Initialising map node %d zone %lu pfns %lu -> %lu\n",
4283 pgdat->node_id,
4284 (unsigned long)zone_idx(zone),
4285 zone_start_pfn, (zone_start_pfn + size));
4286
Andi Kleen1e548de2008-02-04 22:29:26 -08004287 zone_init_free_lists(zone);
Yasunori Goto718127c2006-06-23 02:03:10 -07004288
4289 return 0;
Dave Hansened8ece22005-10-29 18:16:50 -07004290}
4291
Tejun Heo0ee332c2011-12-08 10:22:09 -08004292#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
Mel Gormanc7132162006-09-27 01:49:43 -07004293#ifndef CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID
4294/*
4295 * Required by SPARSEMEM. Given a PFN, return what node the PFN is on.
4296 * Architectures may implement their own version but if add_active_range()
4297 * was used and there are no special requirements, this is a convenient
4298 * alternative
4299 */
KAMEZAWA Hiroyukif2dbcfa2009-02-18 14:48:32 -08004300int __meminit __early_pfn_to_nid(unsigned long pfn)
Mel Gormanc7132162006-09-27 01:49:43 -07004301{
Tejun Heoc13291a2011-07-12 10:46:30 +02004302 unsigned long start_pfn, end_pfn;
Yinghai Lue76b63f2013-09-11 14:22:17 -07004303 int nid;
Russ Anderson7c243c72013-04-29 15:07:59 -07004304 /*
4305 * NOTE: The following SMP-unsafe globals are only used early in boot
4306 * when the kernel is running single-threaded.
4307 */
4308 static unsigned long __meminitdata last_start_pfn, last_end_pfn;
4309 static int __meminitdata last_nid;
4310
4311 if (last_start_pfn <= pfn && pfn < last_end_pfn)
4312 return last_nid;
Mel Gormanc7132162006-09-27 01:49:43 -07004313
Yinghai Lue76b63f2013-09-11 14:22:17 -07004314 nid = memblock_search_pfn_nid(pfn, &start_pfn, &end_pfn);
4315 if (nid != -1) {
4316 last_start_pfn = start_pfn;
4317 last_end_pfn = end_pfn;
4318 last_nid = nid;
4319 }
4320
4321 return nid;
Mel Gormanc7132162006-09-27 01:49:43 -07004322}
4323#endif /* CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID */
4324
KAMEZAWA Hiroyukif2dbcfa2009-02-18 14:48:32 -08004325int __meminit early_pfn_to_nid(unsigned long pfn)
4326{
KAMEZAWA Hiroyukicc2559b2009-02-18 14:48:33 -08004327 int nid;
4328
4329 nid = __early_pfn_to_nid(pfn);
4330 if (nid >= 0)
4331 return nid;
4332 /* just returns 0 */
4333 return 0;
KAMEZAWA Hiroyukif2dbcfa2009-02-18 14:48:32 -08004334}
4335
KAMEZAWA Hiroyukicc2559b2009-02-18 14:48:33 -08004336#ifdef CONFIG_NODES_SPAN_OTHER_NODES
4337bool __meminit early_pfn_in_nid(unsigned long pfn, int node)
4338{
4339 int nid;
4340
4341 nid = __early_pfn_to_nid(pfn);
4342 if (nid >= 0 && nid != node)
4343 return false;
4344 return true;
4345}
4346#endif
KAMEZAWA Hiroyukif2dbcfa2009-02-18 14:48:32 -08004347
Mel Gormanc7132162006-09-27 01:49:43 -07004348/**
4349 * free_bootmem_with_active_regions - Call free_bootmem_node for each active range
Randy Dunlap88ca3b92006-10-04 02:15:25 -07004350 * @nid: The node to free memory on. If MAX_NUMNODES, all nodes are freed.
4351 * @max_low_pfn: The highest PFN that will be passed to free_bootmem_node
Mel Gormanc7132162006-09-27 01:49:43 -07004352 *
4353 * If an architecture guarantees that all ranges registered with
4354 * add_active_ranges() contain no holes and may be freed, this
4355 * this function may be used instead of calling free_bootmem() manually.
4356 */
Tejun Heoc13291a2011-07-12 10:46:30 +02004357void __init free_bootmem_with_active_regions(int nid, unsigned long max_low_pfn)
Mel Gormanc7132162006-09-27 01:49:43 -07004358{
Tejun Heoc13291a2011-07-12 10:46:30 +02004359 unsigned long start_pfn, end_pfn;
4360 int i, this_nid;
Mel Gormanc7132162006-09-27 01:49:43 -07004361
Tejun Heoc13291a2011-07-12 10:46:30 +02004362 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, &this_nid) {
4363 start_pfn = min(start_pfn, max_low_pfn);
4364 end_pfn = min(end_pfn, max_low_pfn);
Mel Gormanc7132162006-09-27 01:49:43 -07004365
Tejun Heoc13291a2011-07-12 10:46:30 +02004366 if (start_pfn < end_pfn)
4367 free_bootmem_node(NODE_DATA(this_nid),
4368 PFN_PHYS(start_pfn),
4369 (end_pfn - start_pfn) << PAGE_SHIFT);
Mel Gormanc7132162006-09-27 01:49:43 -07004370 }
4371}
4372
4373/**
4374 * sparse_memory_present_with_active_regions - Call memory_present for each active range
Randy Dunlap88ca3b92006-10-04 02:15:25 -07004375 * @nid: The node to call memory_present for. If MAX_NUMNODES, all nodes will be used.
Mel Gormanc7132162006-09-27 01:49:43 -07004376 *
4377 * If an architecture guarantees that all ranges registered with
4378 * add_active_ranges() contain no holes and may be freed, this
Randy Dunlap88ca3b92006-10-04 02:15:25 -07004379 * function may be used instead of calling memory_present() manually.
Mel Gormanc7132162006-09-27 01:49:43 -07004380 */
4381void __init sparse_memory_present_with_active_regions(int nid)
4382{
Tejun Heoc13291a2011-07-12 10:46:30 +02004383 unsigned long start_pfn, end_pfn;
4384 int i, this_nid;
Mel Gormanc7132162006-09-27 01:49:43 -07004385
Tejun Heoc13291a2011-07-12 10:46:30 +02004386 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, &this_nid)
4387 memory_present(this_nid, start_pfn, end_pfn);
Mel Gormanc7132162006-09-27 01:49:43 -07004388}
4389
4390/**
4391 * get_pfn_range_for_nid - Return the start and end page frames for a node
Randy Dunlap88ca3b92006-10-04 02:15:25 -07004392 * @nid: The nid to return the range for. If MAX_NUMNODES, the min and max PFN are returned.
4393 * @start_pfn: Passed by reference. On return, it will have the node start_pfn.
4394 * @end_pfn: Passed by reference. On return, it will have the node end_pfn.
Mel Gormanc7132162006-09-27 01:49:43 -07004395 *
4396 * It returns the start and end page frame of a node based on information
4397 * provided by an arch calling add_active_range(). If called for a node
4398 * with no available memory, a warning is printed and the start and end
Randy Dunlap88ca3b92006-10-04 02:15:25 -07004399 * PFNs will be 0.
Mel Gormanc7132162006-09-27 01:49:43 -07004400 */
Yasunori Gotoa3142c82007-05-08 00:23:07 -07004401void __meminit get_pfn_range_for_nid(unsigned int nid,
Mel Gormanc7132162006-09-27 01:49:43 -07004402 unsigned long *start_pfn, unsigned long *end_pfn)
4403{
Tejun Heoc13291a2011-07-12 10:46:30 +02004404 unsigned long this_start_pfn, this_end_pfn;
Mel Gormanc7132162006-09-27 01:49:43 -07004405 int i;
Tejun Heoc13291a2011-07-12 10:46:30 +02004406
Mel Gormanc7132162006-09-27 01:49:43 -07004407 *start_pfn = -1UL;
4408 *end_pfn = 0;
4409
Tejun Heoc13291a2011-07-12 10:46:30 +02004410 for_each_mem_pfn_range(i, nid, &this_start_pfn, &this_end_pfn, NULL) {
4411 *start_pfn = min(*start_pfn, this_start_pfn);
4412 *end_pfn = max(*end_pfn, this_end_pfn);
Mel Gormanc7132162006-09-27 01:49:43 -07004413 }
4414
Christoph Lameter633c0662007-10-16 01:25:37 -07004415 if (*start_pfn == -1UL)
Mel Gormanc7132162006-09-27 01:49:43 -07004416 *start_pfn = 0;
Mel Gormanc7132162006-09-27 01:49:43 -07004417}
4418
4419/*
Mel Gorman2a1e2742007-07-17 04:03:12 -07004420 * This finds a zone that can be used for ZONE_MOVABLE pages. The
4421 * assumption is made that zones within a node are ordered in monotonic
4422 * increasing memory addresses so that the "highest" populated zone is used
4423 */
Adrian Bunkb69a7282008-07-23 21:28:12 -07004424static void __init find_usable_zone_for_movable(void)
Mel Gorman2a1e2742007-07-17 04:03:12 -07004425{
4426 int zone_index;
4427 for (zone_index = MAX_NR_ZONES - 1; zone_index >= 0; zone_index--) {
4428 if (zone_index == ZONE_MOVABLE)
4429 continue;
4430
4431 if (arch_zone_highest_possible_pfn[zone_index] >
4432 arch_zone_lowest_possible_pfn[zone_index])
4433 break;
4434 }
4435
4436 VM_BUG_ON(zone_index == -1);
4437 movable_zone = zone_index;
4438}
4439
4440/*
4441 * The zone ranges provided by the architecture do not include ZONE_MOVABLE
Lucas De Marchi25985ed2011-03-30 22:57:33 -03004442 * because it is sized independent of architecture. Unlike the other zones,
Mel Gorman2a1e2742007-07-17 04:03:12 -07004443 * the starting point for ZONE_MOVABLE is not fixed. It may be different
4444 * in each node depending on the size of each node and how evenly kernelcore
4445 * is distributed. This helper function adjusts the zone ranges
4446 * provided by the architecture for a given node by using the end of the
4447 * highest usable zone for ZONE_MOVABLE. This preserves the assumption that
4448 * zones within a node are in order of monotonic increases memory addresses
4449 */
Adrian Bunkb69a7282008-07-23 21:28:12 -07004450static void __meminit adjust_zone_range_for_zone_movable(int nid,
Mel Gorman2a1e2742007-07-17 04:03:12 -07004451 unsigned long zone_type,
4452 unsigned long node_start_pfn,
4453 unsigned long node_end_pfn,
4454 unsigned long *zone_start_pfn,
4455 unsigned long *zone_end_pfn)
4456{
4457 /* Only adjust if ZONE_MOVABLE is on this node */
4458 if (zone_movable_pfn[nid]) {
4459 /* Size ZONE_MOVABLE */
4460 if (zone_type == ZONE_MOVABLE) {
4461 *zone_start_pfn = zone_movable_pfn[nid];
4462 *zone_end_pfn = min(node_end_pfn,
4463 arch_zone_highest_possible_pfn[movable_zone]);
4464
4465 /* Adjust for ZONE_MOVABLE starting within this range */
4466 } else if (*zone_start_pfn < zone_movable_pfn[nid] &&
4467 *zone_end_pfn > zone_movable_pfn[nid]) {
4468 *zone_end_pfn = zone_movable_pfn[nid];
4469
4470 /* Check if this whole range is within ZONE_MOVABLE */
4471 } else if (*zone_start_pfn >= zone_movable_pfn[nid])
4472 *zone_start_pfn = *zone_end_pfn;
4473 }
4474}
4475
4476/*
Mel Gormanc7132162006-09-27 01:49:43 -07004477 * Return the number of pages a zone spans in a node, including holes
4478 * present_pages = zone_spanned_pages_in_node() - zone_absent_pages_in_node()
4479 */
Paul Mundt6ea6e682007-07-15 23:38:20 -07004480static unsigned long __meminit zone_spanned_pages_in_node(int nid,
Mel Gormanc7132162006-09-27 01:49:43 -07004481 unsigned long zone_type,
Zhang Yanfei7960aed2013-07-08 15:59:52 -07004482 unsigned long node_start_pfn,
4483 unsigned long node_end_pfn,
Mel Gormanc7132162006-09-27 01:49:43 -07004484 unsigned long *ignored)
4485{
Mel Gormanc7132162006-09-27 01:49:43 -07004486 unsigned long zone_start_pfn, zone_end_pfn;
4487
Zhang Yanfei7960aed2013-07-08 15:59:52 -07004488 /* Get the start and end of the zone */
Mel Gormanc7132162006-09-27 01:49:43 -07004489 zone_start_pfn = arch_zone_lowest_possible_pfn[zone_type];
4490 zone_end_pfn = arch_zone_highest_possible_pfn[zone_type];
Mel Gorman2a1e2742007-07-17 04:03:12 -07004491 adjust_zone_range_for_zone_movable(nid, zone_type,
4492 node_start_pfn, node_end_pfn,
4493 &zone_start_pfn, &zone_end_pfn);
Mel Gormanc7132162006-09-27 01:49:43 -07004494
4495 /* Check that this node has pages within the zone's required range */
4496 if (zone_end_pfn < node_start_pfn || zone_start_pfn > node_end_pfn)
4497 return 0;
4498
4499 /* Move the zone boundaries inside the node if necessary */
4500 zone_end_pfn = min(zone_end_pfn, node_end_pfn);
4501 zone_start_pfn = max(zone_start_pfn, node_start_pfn);
4502
4503 /* Return the spanned pages */
4504 return zone_end_pfn - zone_start_pfn;
4505}
4506
4507/*
4508 * Return the number of holes in a range on a node. If nid is MAX_NUMNODES,
Randy Dunlap88ca3b92006-10-04 02:15:25 -07004509 * then all holes in the requested range will be accounted for.
Mel Gormanc7132162006-09-27 01:49:43 -07004510 */
Yinghai Lu32996252009-12-15 17:59:02 -08004511unsigned long __meminit __absent_pages_in_range(int nid,
Mel Gormanc7132162006-09-27 01:49:43 -07004512 unsigned long range_start_pfn,
4513 unsigned long range_end_pfn)
4514{
Tejun Heo96e907d2011-07-12 10:46:29 +02004515 unsigned long nr_absent = range_end_pfn - range_start_pfn;
4516 unsigned long start_pfn, end_pfn;
4517 int i;
Mel Gormanc7132162006-09-27 01:49:43 -07004518
Tejun Heo96e907d2011-07-12 10:46:29 +02004519 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
4520 start_pfn = clamp(start_pfn, range_start_pfn, range_end_pfn);
4521 end_pfn = clamp(end_pfn, range_start_pfn, range_end_pfn);
4522 nr_absent -= end_pfn - start_pfn;
Mel Gormanc7132162006-09-27 01:49:43 -07004523 }
Tejun Heo96e907d2011-07-12 10:46:29 +02004524 return nr_absent;
Mel Gormanc7132162006-09-27 01:49:43 -07004525}
4526
4527/**
4528 * absent_pages_in_range - Return number of page frames in holes within a range
4529 * @start_pfn: The start PFN to start searching for holes
4530 * @end_pfn: The end PFN to stop searching for holes
4531 *
Randy Dunlap88ca3b92006-10-04 02:15:25 -07004532 * It returns the number of pages frames in memory holes within a range.
Mel Gormanc7132162006-09-27 01:49:43 -07004533 */
4534unsigned long __init absent_pages_in_range(unsigned long start_pfn,
4535 unsigned long end_pfn)
4536{
4537 return __absent_pages_in_range(MAX_NUMNODES, start_pfn, end_pfn);
4538}
4539
4540/* Return the number of page frames in holes in a zone on a node */
Paul Mundt6ea6e682007-07-15 23:38:20 -07004541static unsigned long __meminit zone_absent_pages_in_node(int nid,
Mel Gormanc7132162006-09-27 01:49:43 -07004542 unsigned long zone_type,
Zhang Yanfei7960aed2013-07-08 15:59:52 -07004543 unsigned long node_start_pfn,
4544 unsigned long node_end_pfn,
Mel Gormanc7132162006-09-27 01:49:43 -07004545 unsigned long *ignored)
4546{
Tejun Heo96e907d2011-07-12 10:46:29 +02004547 unsigned long zone_low = arch_zone_lowest_possible_pfn[zone_type];
4548 unsigned long zone_high = arch_zone_highest_possible_pfn[zone_type];
Mel Gorman9c7cd682006-09-27 01:49:58 -07004549 unsigned long zone_start_pfn, zone_end_pfn;
4550
Tejun Heo96e907d2011-07-12 10:46:29 +02004551 zone_start_pfn = clamp(node_start_pfn, zone_low, zone_high);
4552 zone_end_pfn = clamp(node_end_pfn, zone_low, zone_high);
Mel Gorman9c7cd682006-09-27 01:49:58 -07004553
Mel Gorman2a1e2742007-07-17 04:03:12 -07004554 adjust_zone_range_for_zone_movable(nid, zone_type,
4555 node_start_pfn, node_end_pfn,
4556 &zone_start_pfn, &zone_end_pfn);
Mel Gorman9c7cd682006-09-27 01:49:58 -07004557 return __absent_pages_in_range(nid, zone_start_pfn, zone_end_pfn);
Mel Gormanc7132162006-09-27 01:49:43 -07004558}
Mel Gorman0e0b8642006-09-27 01:49:56 -07004559
Tejun Heo0ee332c2011-12-08 10:22:09 -08004560#else /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
Paul Mundt6ea6e682007-07-15 23:38:20 -07004561static inline unsigned long __meminit zone_spanned_pages_in_node(int nid,
Mel Gormanc7132162006-09-27 01:49:43 -07004562 unsigned long zone_type,
Zhang Yanfei7960aed2013-07-08 15:59:52 -07004563 unsigned long node_start_pfn,
4564 unsigned long node_end_pfn,
Mel Gormanc7132162006-09-27 01:49:43 -07004565 unsigned long *zones_size)
4566{
4567 return zones_size[zone_type];
4568}
4569
Paul Mundt6ea6e682007-07-15 23:38:20 -07004570static inline unsigned long __meminit zone_absent_pages_in_node(int nid,
Mel Gormanc7132162006-09-27 01:49:43 -07004571 unsigned long zone_type,
Zhang Yanfei7960aed2013-07-08 15:59:52 -07004572 unsigned long node_start_pfn,
4573 unsigned long node_end_pfn,
Mel Gormanc7132162006-09-27 01:49:43 -07004574 unsigned long *zholes_size)
4575{
4576 if (!zholes_size)
4577 return 0;
4578
4579 return zholes_size[zone_type];
4580}
Yinghai Lu20e69262013-03-01 14:51:27 -08004581
Tejun Heo0ee332c2011-12-08 10:22:09 -08004582#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
Mel Gormanc7132162006-09-27 01:49:43 -07004583
Yasunori Gotoa3142c82007-05-08 00:23:07 -07004584static void __meminit calculate_node_totalpages(struct pglist_data *pgdat,
Zhang Yanfei7960aed2013-07-08 15:59:52 -07004585 unsigned long node_start_pfn,
4586 unsigned long node_end_pfn,
4587 unsigned long *zones_size,
4588 unsigned long *zholes_size)
Mel Gormanc7132162006-09-27 01:49:43 -07004589{
4590 unsigned long realtotalpages, totalpages = 0;
4591 enum zone_type i;
4592
4593 for (i = 0; i < MAX_NR_ZONES; i++)
4594 totalpages += zone_spanned_pages_in_node(pgdat->node_id, i,
Zhang Yanfei7960aed2013-07-08 15:59:52 -07004595 node_start_pfn,
4596 node_end_pfn,
4597 zones_size);
Mel Gormanc7132162006-09-27 01:49:43 -07004598 pgdat->node_spanned_pages = totalpages;
4599
4600 realtotalpages = totalpages;
4601 for (i = 0; i < MAX_NR_ZONES; i++)
4602 realtotalpages -=
4603 zone_absent_pages_in_node(pgdat->node_id, i,
Zhang Yanfei7960aed2013-07-08 15:59:52 -07004604 node_start_pfn, node_end_pfn,
4605 zholes_size);
Mel Gormanc7132162006-09-27 01:49:43 -07004606 pgdat->node_present_pages = realtotalpages;
4607 printk(KERN_DEBUG "On node %d totalpages: %lu\n", pgdat->node_id,
4608 realtotalpages);
4609}
4610
Mel Gorman835c1342007-10-16 01:25:47 -07004611#ifndef CONFIG_SPARSEMEM
4612/*
4613 * Calculate the size of the zone->blockflags rounded to an unsigned long
Mel Gormand9c23402007-10-16 01:26:01 -07004614 * Start by making sure zonesize is a multiple of pageblock_order by rounding
4615 * up. Then use 1 NR_PAGEBLOCK_BITS worth of bits per pageblock, finally
Mel Gorman835c1342007-10-16 01:25:47 -07004616 * round what is now in bits to nearest long in bits, then return it in
4617 * bytes.
4618 */
Linus Torvalds7c455122013-02-18 09:58:02 -08004619static unsigned long __init usemap_size(unsigned long zone_start_pfn, unsigned long zonesize)
Mel Gorman835c1342007-10-16 01:25:47 -07004620{
4621 unsigned long usemapsize;
4622
Linus Torvalds7c455122013-02-18 09:58:02 -08004623 zonesize += zone_start_pfn & (pageblock_nr_pages-1);
Mel Gormand9c23402007-10-16 01:26:01 -07004624 usemapsize = roundup(zonesize, pageblock_nr_pages);
4625 usemapsize = usemapsize >> pageblock_order;
Mel Gorman835c1342007-10-16 01:25:47 -07004626 usemapsize *= NR_PAGEBLOCK_BITS;
4627 usemapsize = roundup(usemapsize, 8 * sizeof(unsigned long));
4628
4629 return usemapsize / 8;
4630}
4631
4632static void __init setup_usemap(struct pglist_data *pgdat,
Linus Torvalds7c455122013-02-18 09:58:02 -08004633 struct zone *zone,
4634 unsigned long zone_start_pfn,
4635 unsigned long zonesize)
Mel Gorman835c1342007-10-16 01:25:47 -07004636{
Linus Torvalds7c455122013-02-18 09:58:02 -08004637 unsigned long usemapsize = usemap_size(zone_start_pfn, zonesize);
Mel Gorman835c1342007-10-16 01:25:47 -07004638 zone->pageblock_flags = NULL;
Julia Lawall58a01a42009-01-06 14:39:28 -08004639 if (usemapsize)
Yinghai Lu8f389a992011-05-11 15:13:32 -07004640 zone->pageblock_flags = alloc_bootmem_node_nopanic(pgdat,
4641 usemapsize);
Mel Gorman835c1342007-10-16 01:25:47 -07004642}
4643#else
Linus Torvalds7c455122013-02-18 09:58:02 -08004644static inline void setup_usemap(struct pglist_data *pgdat, struct zone *zone,
4645 unsigned long zone_start_pfn, unsigned long zonesize) {}
Mel Gorman835c1342007-10-16 01:25:47 -07004646#endif /* CONFIG_SPARSEMEM */
4647
Mel Gormand9c23402007-10-16 01:26:01 -07004648#ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
Mel Gormanba72cb82007-11-28 16:21:13 -08004649
Mel Gormand9c23402007-10-16 01:26:01 -07004650/* Initialise the number of pages represented by NR_PAGEBLOCK_BITS */
Chen Gang15ca2202013-09-11 14:20:27 -07004651void __paginginit set_pageblock_order(void)
Mel Gormand9c23402007-10-16 01:26:01 -07004652{
Andrew Morton955c1cd2012-05-29 15:06:31 -07004653 unsigned int order;
4654
Mel Gormand9c23402007-10-16 01:26:01 -07004655 /* Check that pageblock_nr_pages has not already been setup */
4656 if (pageblock_order)
4657 return;
4658
Andrew Morton955c1cd2012-05-29 15:06:31 -07004659 if (HPAGE_SHIFT > PAGE_SHIFT)
4660 order = HUGETLB_PAGE_ORDER;
4661 else
4662 order = MAX_ORDER - 1;
4663
Mel Gormand9c23402007-10-16 01:26:01 -07004664 /*
4665 * Assume the largest contiguous order of interest is a huge page.
Andrew Morton955c1cd2012-05-29 15:06:31 -07004666 * This value may be variable depending on boot parameters on IA64 and
4667 * powerpc.
Mel Gormand9c23402007-10-16 01:26:01 -07004668 */
4669 pageblock_order = order;
4670}
4671#else /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
4672
Mel Gormanba72cb82007-11-28 16:21:13 -08004673/*
4674 * When CONFIG_HUGETLB_PAGE_SIZE_VARIABLE is not set, set_pageblock_order()
Andrew Morton955c1cd2012-05-29 15:06:31 -07004675 * is unused as pageblock_order is set at compile-time. See
4676 * include/linux/pageblock-flags.h for the values of pageblock_order based on
4677 * the kernel config
Mel Gormanba72cb82007-11-28 16:21:13 -08004678 */
Chen Gang15ca2202013-09-11 14:20:27 -07004679void __paginginit set_pageblock_order(void)
Mel Gormanba72cb82007-11-28 16:21:13 -08004680{
Mel Gormanba72cb82007-11-28 16:21:13 -08004681}
Mel Gormand9c23402007-10-16 01:26:01 -07004682
4683#endif /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */
4684
Jiang Liu01cefae2012-12-12 13:52:19 -08004685static unsigned long __paginginit calc_memmap_size(unsigned long spanned_pages,
4686 unsigned long present_pages)
4687{
4688 unsigned long pages = spanned_pages;
4689
4690 /*
4691 * Provide a more accurate estimation if there are holes within
4692 * the zone and SPARSEMEM is in use. If there are holes within the
4693 * zone, each populated memory region may cost us one or two extra
4694 * memmap pages due to alignment because memmap pages for each
4695 * populated regions may not naturally algined on page boundary.
4696 * So the (present_pages >> 4) heuristic is a tradeoff for that.
4697 */
4698 if (spanned_pages > present_pages + (present_pages >> 4) &&
4699 IS_ENABLED(CONFIG_SPARSEMEM))
4700 pages = present_pages;
4701
4702 return PAGE_ALIGN(pages * sizeof(struct page)) >> PAGE_SHIFT;
4703}
4704
Linus Torvalds1da177e2005-04-16 15:20:36 -07004705/*
4706 * Set up the zone data structures:
4707 * - mark all pages reserved
4708 * - mark all memory queues empty
4709 * - clear the memory bitmaps
Minchan Kim6527af52012-07-31 16:46:16 -07004710 *
4711 * NOTE: pgdat should get zeroed by caller.
Linus Torvalds1da177e2005-04-16 15:20:36 -07004712 */
Alexander van Heukelumb5a0e012008-02-23 15:24:06 -08004713static void __paginginit free_area_init_core(struct pglist_data *pgdat,
Zhang Yanfei7960aed2013-07-08 15:59:52 -07004714 unsigned long node_start_pfn, unsigned long node_end_pfn,
Linus Torvalds1da177e2005-04-16 15:20:36 -07004715 unsigned long *zones_size, unsigned long *zholes_size)
4716{
Christoph Lameter2f1b6242006-09-25 23:31:13 -07004717 enum zone_type j;
Dave Hansened8ece22005-10-29 18:16:50 -07004718 int nid = pgdat->node_id;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004719 unsigned long zone_start_pfn = pgdat->node_start_pfn;
Yasunori Goto718127c2006-06-23 02:03:10 -07004720 int ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004721
Dave Hansen208d54e2005-10-29 18:16:52 -07004722 pgdat_resize_init(pgdat);
Andrea Arcangeli8177a422012-03-23 20:56:34 +01004723#ifdef CONFIG_NUMA_BALANCING
4724 spin_lock_init(&pgdat->numabalancing_migrate_lock);
4725 pgdat->numabalancing_migrate_nr_pages = 0;
4726 pgdat->numabalancing_migrate_next_window = jiffies;
4727#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07004728 init_waitqueue_head(&pgdat->kswapd_wait);
Mel Gorman55150612012-07-31 16:44:35 -07004729 init_waitqueue_head(&pgdat->pfmemalloc_wait);
KAMEZAWA Hiroyuki52d4b9a2008-10-18 20:28:16 -07004730 pgdat_page_cgroup_init(pgdat);
Michal Nazarewicz5f63b722012-01-11 15:16:11 +01004731
Linus Torvalds1da177e2005-04-16 15:20:36 -07004732 for (j = 0; j < MAX_NR_ZONES; j++) {
4733 struct zone *zone = pgdat->node_zones + j;
Jiang Liu9feedc92012-12-12 13:52:12 -08004734 unsigned long size, realsize, freesize, memmap_pages;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004735
Zhang Yanfei7960aed2013-07-08 15:59:52 -07004736 size = zone_spanned_pages_in_node(nid, j, node_start_pfn,
4737 node_end_pfn, zones_size);
Jiang Liu9feedc92012-12-12 13:52:12 -08004738 realsize = freesize = size - zone_absent_pages_in_node(nid, j,
Zhang Yanfei7960aed2013-07-08 15:59:52 -07004739 node_start_pfn,
4740 node_end_pfn,
Mel Gormanc7132162006-09-27 01:49:43 -07004741 zholes_size);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004742
Mel Gorman0e0b8642006-09-27 01:49:56 -07004743 /*
Jiang Liu9feedc92012-12-12 13:52:12 -08004744 * Adjust freesize so that it accounts for how much memory
Mel Gorman0e0b8642006-09-27 01:49:56 -07004745 * is used by this zone for memmap. This affects the watermark
4746 * and per-cpu initialisations
4747 */
Jiang Liu01cefae2012-12-12 13:52:19 -08004748 memmap_pages = calc_memmap_size(size, realsize);
Jiang Liu9feedc92012-12-12 13:52:12 -08004749 if (freesize >= memmap_pages) {
4750 freesize -= memmap_pages;
Yinghai Lu5594c8c2009-01-06 14:39:14 -08004751 if (memmap_pages)
4752 printk(KERN_DEBUG
4753 " %s zone: %lu pages used for memmap\n",
4754 zone_names[j], memmap_pages);
Mel Gorman0e0b8642006-09-27 01:49:56 -07004755 } else
4756 printk(KERN_WARNING
Jiang Liu9feedc92012-12-12 13:52:12 -08004757 " %s zone: %lu pages exceeds freesize %lu\n",
4758 zone_names[j], memmap_pages, freesize);
Mel Gorman0e0b8642006-09-27 01:49:56 -07004759
Christoph Lameter62672762007-02-10 01:43:07 -08004760 /* Account for reserved pages */
Jiang Liu9feedc92012-12-12 13:52:12 -08004761 if (j == 0 && freesize > dma_reserve) {
4762 freesize -= dma_reserve;
Yinghai Lud903ef92008-10-18 20:27:06 -07004763 printk(KERN_DEBUG " %s zone: %lu pages reserved\n",
Christoph Lameter62672762007-02-10 01:43:07 -08004764 zone_names[0], dma_reserve);
Mel Gorman0e0b8642006-09-27 01:49:56 -07004765 }
4766
Christoph Lameter98d2b0e2006-09-25 23:31:12 -07004767 if (!is_highmem_idx(j))
Jiang Liu9feedc92012-12-12 13:52:12 -08004768 nr_kernel_pages += freesize;
Jiang Liu01cefae2012-12-12 13:52:19 -08004769 /* Charge for highmem memmap if there are enough kernel pages */
4770 else if (nr_kernel_pages > memmap_pages * 2)
4771 nr_kernel_pages -= memmap_pages;
Jiang Liu9feedc92012-12-12 13:52:12 -08004772 nr_all_pages += freesize;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004773
4774 zone->spanned_pages = size;
Jiang Liu306f2e92013-02-22 16:33:54 -08004775 zone->present_pages = realsize;
Jiang Liu9feedc92012-12-12 13:52:12 -08004776 /*
4777 * Set an approximate value for lowmem here, it will be adjusted
4778 * when the bootmem allocator frees pages into the buddy system.
4779 * And all highmem pages will be managed by the buddy system.
4780 */
4781 zone->managed_pages = is_highmem_idx(j) ? realsize : freesize;
Christoph Lameter96146342006-07-03 00:24:13 -07004782#ifdef CONFIG_NUMA
Christoph Lameterd5f541e2006-09-27 01:50:08 -07004783 zone->node = nid;
Jiang Liu9feedc92012-12-12 13:52:12 -08004784 zone->min_unmapped_pages = (freesize*sysctl_min_unmapped_ratio)
Christoph Lameter96146342006-07-03 00:24:13 -07004785 / 100;
Jiang Liu9feedc92012-12-12 13:52:12 -08004786 zone->min_slab_pages = (freesize * sysctl_min_slab_ratio) / 100;
Christoph Lameter96146342006-07-03 00:24:13 -07004787#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07004788 zone->name = zone_names[j];
4789 spin_lock_init(&zone->lock);
4790 spin_lock_init(&zone->lru_lock);
Dave Hansenbdc8cb92005-10-29 18:16:53 -07004791 zone_seqlock_init(zone);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004792 zone->zone_pgdat = pgdat;
Dave Hansened8ece22005-10-29 18:16:50 -07004793 zone_pcp_init(zone);
Johannes Weiner81c0a2b2013-09-11 14:20:47 -07004794
4795 /* For bootup, initialized properly in watermark setup */
4796 mod_zone_page_state(zone, NR_ALLOC_BATCH, zone->managed_pages);
4797
Hugh Dickinsbea8c152012-11-16 14:14:54 -08004798 lruvec_init(&zone->lruvec);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004799 if (!size)
4800 continue;
4801
Andrew Morton955c1cd2012-05-29 15:06:31 -07004802 set_pageblock_order();
Linus Torvalds7c455122013-02-18 09:58:02 -08004803 setup_usemap(pgdat, zone, zone_start_pfn, size);
Dave Hansena2f3aa022007-01-10 23:15:30 -08004804 ret = init_currently_empty_zone(zone, zone_start_pfn,
4805 size, MEMMAP_EARLY);
Yasunori Goto718127c2006-06-23 02:03:10 -07004806 BUG_ON(ret);
Heiko Carstens76cdd582008-05-14 16:05:52 -07004807 memmap_init(size, nid, j, zone_start_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004808 zone_start_pfn += size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004809 }
4810}
4811
Sam Ravnborg577a32f2007-05-17 23:29:25 +02004812static void __init_refok alloc_node_mem_map(struct pglist_data *pgdat)
Linus Torvalds1da177e2005-04-16 15:20:36 -07004813{
Linus Torvalds1da177e2005-04-16 15:20:36 -07004814 /* Skip empty nodes */
4815 if (!pgdat->node_spanned_pages)
4816 return;
4817
Andy Whitcroftd41dee32005-06-23 00:07:54 -07004818#ifdef CONFIG_FLAT_NODE_MEM_MAP
Linus Torvalds1da177e2005-04-16 15:20:36 -07004819 /* ia64 gets its own node_mem_map, before this, without bootmem */
4820 if (!pgdat->node_mem_map) {
Bob Piccoe984bb42006-05-20 15:00:31 -07004821 unsigned long size, start, end;
Andy Whitcroftd41dee32005-06-23 00:07:54 -07004822 struct page *map;
4823
Bob Piccoe984bb42006-05-20 15:00:31 -07004824 /*
4825 * The zone's endpoints aren't required to be MAX_ORDER
4826 * aligned but the node_mem_map endpoints must be in order
4827 * for the buddy allocator to function correctly.
4828 */
4829 start = pgdat->node_start_pfn & ~(MAX_ORDER_NR_PAGES - 1);
Cody P Schafer108bcc92013-02-22 16:35:23 -08004830 end = pgdat_end_pfn(pgdat);
Bob Piccoe984bb42006-05-20 15:00:31 -07004831 end = ALIGN(end, MAX_ORDER_NR_PAGES);
4832 size = (end - start) * sizeof(struct page);
Dave Hansen6f167ec2005-06-23 00:07:39 -07004833 map = alloc_remap(pgdat->node_id, size);
4834 if (!map)
Yinghai Lu8f389a992011-05-11 15:13:32 -07004835 map = alloc_bootmem_node_nopanic(pgdat, size);
Bob Piccoe984bb42006-05-20 15:00:31 -07004836 pgdat->node_mem_map = map + (pgdat->node_start_pfn - start);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004837 }
Roman Zippel12d810c2007-05-31 00:40:54 -07004838#ifndef CONFIG_NEED_MULTIPLE_NODES
Linus Torvalds1da177e2005-04-16 15:20:36 -07004839 /*
4840 * With no DISCONTIG, the global mem_map is just set as node 0's
4841 */
Mel Gormanc7132162006-09-27 01:49:43 -07004842 if (pgdat == NODE_DATA(0)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07004843 mem_map = NODE_DATA(0)->node_mem_map;
Tejun Heo0ee332c2011-12-08 10:22:09 -08004844#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
Mel Gormanc7132162006-09-27 01:49:43 -07004845 if (page_to_pfn(mem_map) != pgdat->node_start_pfn)
Thomas Bogendoerfer467bc462008-01-08 15:33:11 -08004846 mem_map -= (pgdat->node_start_pfn - ARCH_PFN_OFFSET);
Tejun Heo0ee332c2011-12-08 10:22:09 -08004847#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
Mel Gormanc7132162006-09-27 01:49:43 -07004848 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07004849#endif
Andy Whitcroftd41dee32005-06-23 00:07:54 -07004850#endif /* CONFIG_FLAT_NODE_MEM_MAP */
Linus Torvalds1da177e2005-04-16 15:20:36 -07004851}
4852
Johannes Weiner9109fb72008-07-23 21:27:20 -07004853void __paginginit free_area_init_node(int nid, unsigned long *zones_size,
4854 unsigned long node_start_pfn, unsigned long *zholes_size)
Linus Torvalds1da177e2005-04-16 15:20:36 -07004855{
Johannes Weiner9109fb72008-07-23 21:27:20 -07004856 pg_data_t *pgdat = NODE_DATA(nid);
Zhang Yanfei7960aed2013-07-08 15:59:52 -07004857 unsigned long start_pfn = 0;
4858 unsigned long end_pfn = 0;
Johannes Weiner9109fb72008-07-23 21:27:20 -07004859
Minchan Kim88fdf752012-07-31 16:46:14 -07004860 /* pg_data_t should be reset to zero when it's allocated */
Linus Torvalds8783b6e2012-08-02 10:37:03 -07004861 WARN_ON(pgdat->nr_zones || pgdat->classzone_idx);
Minchan Kim88fdf752012-07-31 16:46:14 -07004862
Linus Torvalds1da177e2005-04-16 15:20:36 -07004863 pgdat->node_id = nid;
4864 pgdat->node_start_pfn = node_start_pfn;
David Rientjes957f8222012-10-08 16:33:24 -07004865 init_zone_allows_reclaim(nid);
Zhang Yanfei7960aed2013-07-08 15:59:52 -07004866#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
4867 get_pfn_range_for_nid(nid, &start_pfn, &end_pfn);
4868#endif
4869 calculate_node_totalpages(pgdat, start_pfn, end_pfn,
4870 zones_size, zholes_size);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004871
4872 alloc_node_mem_map(pgdat);
Yinghai Lue8c27ac2008-06-01 13:15:22 -07004873#ifdef CONFIG_FLAT_NODE_MEM_MAP
4874 printk(KERN_DEBUG "free_area_init_node: node %d, pgdat %08lx, node_mem_map %08lx\n",
4875 nid, (unsigned long)pgdat,
4876 (unsigned long)pgdat->node_mem_map);
4877#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07004878
Zhang Yanfei7960aed2013-07-08 15:59:52 -07004879 free_area_init_core(pgdat, start_pfn, end_pfn,
4880 zones_size, zholes_size);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004881}
4882
Tejun Heo0ee332c2011-12-08 10:22:09 -08004883#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
Miklos Szeredi418508c2007-05-23 13:57:55 -07004884
4885#if MAX_NUMNODES > 1
4886/*
4887 * Figure out the number of possible node ids.
4888 */
Cody P Schaferf9872ca2013-04-29 15:08:01 -07004889void __init setup_nr_node_ids(void)
Miklos Szeredi418508c2007-05-23 13:57:55 -07004890{
4891 unsigned int node;
4892 unsigned int highest = 0;
4893
4894 for_each_node_mask(node, node_possible_map)
4895 highest = node;
4896 nr_node_ids = highest + 1;
4897}
Miklos Szeredi418508c2007-05-23 13:57:55 -07004898#endif
4899
Mel Gormanc7132162006-09-27 01:49:43 -07004900/**
Tejun Heo1e019792011-07-12 09:45:34 +02004901 * node_map_pfn_alignment - determine the maximum internode alignment
4902 *
4903 * This function should be called after node map is populated and sorted.
4904 * It calculates the maximum power of two alignment which can distinguish
4905 * all the nodes.
4906 *
4907 * For example, if all nodes are 1GiB and aligned to 1GiB, the return value
4908 * would indicate 1GiB alignment with (1 << (30 - PAGE_SHIFT)). If the
4909 * nodes are shifted by 256MiB, 256MiB. Note that if only the last node is
4910 * shifted, 1GiB is enough and this function will indicate so.
4911 *
4912 * This is used to test whether pfn -> nid mapping of the chosen memory
4913 * model has fine enough granularity to avoid incorrect mapping for the
4914 * populated node map.
4915 *
4916 * Returns the determined alignment in pfn's. 0 if there is no alignment
4917 * requirement (single node).
4918 */
4919unsigned long __init node_map_pfn_alignment(void)
4920{
4921 unsigned long accl_mask = 0, last_end = 0;
Tejun Heoc13291a2011-07-12 10:46:30 +02004922 unsigned long start, end, mask;
Tejun Heo1e019792011-07-12 09:45:34 +02004923 int last_nid = -1;
Tejun Heoc13291a2011-07-12 10:46:30 +02004924 int i, nid;
Tejun Heo1e019792011-07-12 09:45:34 +02004925
Tejun Heoc13291a2011-07-12 10:46:30 +02004926 for_each_mem_pfn_range(i, MAX_NUMNODES, &start, &end, &nid) {
Tejun Heo1e019792011-07-12 09:45:34 +02004927 if (!start || last_nid < 0 || last_nid == nid) {
4928 last_nid = nid;
4929 last_end = end;
4930 continue;
4931 }
4932
4933 /*
4934 * Start with a mask granular enough to pin-point to the
4935 * start pfn and tick off bits one-by-one until it becomes
4936 * too coarse to separate the current node from the last.
4937 */
4938 mask = ~((1 << __ffs(start)) - 1);
4939 while (mask && last_end <= (start & (mask << 1)))
4940 mask <<= 1;
4941
4942 /* accumulate all internode masks */
4943 accl_mask |= mask;
4944 }
4945
4946 /* convert mask to number of pages */
4947 return ~accl_mask + 1;
4948}
4949
Mel Gormana6af2bc2007-02-10 01:42:57 -08004950/* Find the lowest pfn for a node */
Adrian Bunkb69a7282008-07-23 21:28:12 -07004951static unsigned long __init find_min_pfn_for_node(int nid)
Mel Gormanc7132162006-09-27 01:49:43 -07004952{
Mel Gormana6af2bc2007-02-10 01:42:57 -08004953 unsigned long min_pfn = ULONG_MAX;
Tejun Heoc13291a2011-07-12 10:46:30 +02004954 unsigned long start_pfn;
4955 int i;
Mel Gorman1abbfb42006-11-23 12:01:41 +00004956
Tejun Heoc13291a2011-07-12 10:46:30 +02004957 for_each_mem_pfn_range(i, nid, &start_pfn, NULL, NULL)
4958 min_pfn = min(min_pfn, start_pfn);
Mel Gormanc7132162006-09-27 01:49:43 -07004959
Mel Gormana6af2bc2007-02-10 01:42:57 -08004960 if (min_pfn == ULONG_MAX) {
4961 printk(KERN_WARNING
Paul Jackson2bc0d262008-06-22 07:22:17 -07004962 "Could not find start_pfn for node %d\n", nid);
Mel Gormana6af2bc2007-02-10 01:42:57 -08004963 return 0;
4964 }
4965
4966 return min_pfn;
Mel Gormanc7132162006-09-27 01:49:43 -07004967}
4968
4969/**
4970 * find_min_pfn_with_active_regions - Find the minimum PFN registered
4971 *
4972 * It returns the minimum PFN based on information provided via
Randy Dunlap88ca3b92006-10-04 02:15:25 -07004973 * add_active_range().
Mel Gormanc7132162006-09-27 01:49:43 -07004974 */
4975unsigned long __init find_min_pfn_with_active_regions(void)
4976{
4977 return find_min_pfn_for_node(MAX_NUMNODES);
4978}
4979
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07004980/*
4981 * early_calculate_totalpages()
4982 * Sum pages in active regions for movable zone.
Lai Jiangshan4b0ef1fe2012-12-12 13:51:46 -08004983 * Populate N_MEMORY for calculating usable_nodes.
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07004984 */
Adrian Bunk484f51f2007-10-16 01:26:03 -07004985static unsigned long __init early_calculate_totalpages(void)
Mel Gorman7e63efe2007-07-17 04:03:15 -07004986{
Mel Gorman7e63efe2007-07-17 04:03:15 -07004987 unsigned long totalpages = 0;
Tejun Heoc13291a2011-07-12 10:46:30 +02004988 unsigned long start_pfn, end_pfn;
4989 int i, nid;
Mel Gorman7e63efe2007-07-17 04:03:15 -07004990
Tejun Heoc13291a2011-07-12 10:46:30 +02004991 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid) {
4992 unsigned long pages = end_pfn - start_pfn;
4993
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07004994 totalpages += pages;
4995 if (pages)
Lai Jiangshan4b0ef1fe2012-12-12 13:51:46 -08004996 node_set_state(nid, N_MEMORY);
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07004997 }
Pintu Kumarb8af2942013-09-11 14:20:34 -07004998 return totalpages;
Mel Gorman7e63efe2007-07-17 04:03:15 -07004999}
5000
Mel Gorman2a1e2742007-07-17 04:03:12 -07005001/*
5002 * Find the PFN the Movable zone begins in each node. Kernel memory
5003 * is spread evenly between nodes as long as the nodes have enough
5004 * memory. When they don't, some nodes will have more kernelcore than
5005 * others
5006 */
Kautuk Consulb224ef82012-03-21 16:34:15 -07005007static void __init find_zone_movable_pfns_for_nodes(void)
Mel Gorman2a1e2742007-07-17 04:03:12 -07005008{
5009 int i, nid;
5010 unsigned long usable_startpfn;
5011 unsigned long kernelcore_node, kernelcore_remaining;
Yinghai Lu66918dc2009-06-30 11:41:37 -07005012 /* save the state before borrow the nodemask */
Lai Jiangshan4b0ef1fe2012-12-12 13:51:46 -08005013 nodemask_t saved_node_state = node_states[N_MEMORY];
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07005014 unsigned long totalpages = early_calculate_totalpages();
Lai Jiangshan4b0ef1fe2012-12-12 13:51:46 -08005015 int usable_nodes = nodes_weight(node_states[N_MEMORY]);
Mel Gorman2a1e2742007-07-17 04:03:12 -07005016
Mel Gorman7e63efe2007-07-17 04:03:15 -07005017 /*
5018 * If movablecore was specified, calculate what size of
5019 * kernelcore that corresponds so that memory usable for
5020 * any allocation type is evenly spread. If both kernelcore
5021 * and movablecore are specified, then the value of kernelcore
5022 * will be used for required_kernelcore if it's greater than
5023 * what movablecore would have allowed.
5024 */
5025 if (required_movablecore) {
Mel Gorman7e63efe2007-07-17 04:03:15 -07005026 unsigned long corepages;
5027
5028 /*
5029 * Round-up so that ZONE_MOVABLE is at least as large as what
5030 * was requested by the user
5031 */
5032 required_movablecore =
5033 roundup(required_movablecore, MAX_ORDER_NR_PAGES);
5034 corepages = totalpages - required_movablecore;
5035
5036 required_kernelcore = max(required_kernelcore, corepages);
5037 }
5038
Yinghai Lu20e69262013-03-01 14:51:27 -08005039 /* If kernelcore was not specified, there is no ZONE_MOVABLE */
5040 if (!required_kernelcore)
Yinghai Lu66918dc2009-06-30 11:41:37 -07005041 goto out;
Mel Gorman2a1e2742007-07-17 04:03:12 -07005042
5043 /* usable_startpfn is the lowest possible pfn ZONE_MOVABLE can be at */
Yinghai Lu20e69262013-03-01 14:51:27 -08005044 find_usable_zone_for_movable();
Mel Gorman2a1e2742007-07-17 04:03:12 -07005045 usable_startpfn = arch_zone_lowest_possible_pfn[movable_zone];
5046
5047restart:
5048 /* Spread kernelcore memory as evenly as possible throughout nodes */
5049 kernelcore_node = required_kernelcore / usable_nodes;
Lai Jiangshan4b0ef1fe2012-12-12 13:51:46 -08005050 for_each_node_state(nid, N_MEMORY) {
Tejun Heoc13291a2011-07-12 10:46:30 +02005051 unsigned long start_pfn, end_pfn;
5052
Mel Gorman2a1e2742007-07-17 04:03:12 -07005053 /*
5054 * Recalculate kernelcore_node if the division per node
5055 * now exceeds what is necessary to satisfy the requested
5056 * amount of memory for the kernel
5057 */
5058 if (required_kernelcore < kernelcore_node)
5059 kernelcore_node = required_kernelcore / usable_nodes;
5060
5061 /*
5062 * As the map is walked, we track how much memory is usable
5063 * by the kernel using kernelcore_remaining. When it is
5064 * 0, the rest of the node is usable by ZONE_MOVABLE
5065 */
5066 kernelcore_remaining = kernelcore_node;
5067
5068 /* Go through each range of PFNs within this node */
Tejun Heoc13291a2011-07-12 10:46:30 +02005069 for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
Mel Gorman2a1e2742007-07-17 04:03:12 -07005070 unsigned long size_pages;
5071
Tejun Heoc13291a2011-07-12 10:46:30 +02005072 start_pfn = max(start_pfn, zone_movable_pfn[nid]);
Mel Gorman2a1e2742007-07-17 04:03:12 -07005073 if (start_pfn >= end_pfn)
5074 continue;
5075
5076 /* Account for what is only usable for kernelcore */
5077 if (start_pfn < usable_startpfn) {
5078 unsigned long kernel_pages;
5079 kernel_pages = min(end_pfn, usable_startpfn)
5080 - start_pfn;
5081
5082 kernelcore_remaining -= min(kernel_pages,
5083 kernelcore_remaining);
5084 required_kernelcore -= min(kernel_pages,
5085 required_kernelcore);
5086
5087 /* Continue if range is now fully accounted */
5088 if (end_pfn <= usable_startpfn) {
5089
5090 /*
5091 * Push zone_movable_pfn to the end so
5092 * that if we have to rebalance
5093 * kernelcore across nodes, we will
5094 * not double account here
5095 */
5096 zone_movable_pfn[nid] = end_pfn;
5097 continue;
5098 }
5099 start_pfn = usable_startpfn;
5100 }
5101
5102 /*
5103 * The usable PFN range for ZONE_MOVABLE is from
5104 * start_pfn->end_pfn. Calculate size_pages as the
5105 * number of pages used as kernelcore
5106 */
5107 size_pages = end_pfn - start_pfn;
5108 if (size_pages > kernelcore_remaining)
5109 size_pages = kernelcore_remaining;
5110 zone_movable_pfn[nid] = start_pfn + size_pages;
5111
5112 /*
5113 * Some kernelcore has been met, update counts and
5114 * break if the kernelcore for this node has been
Pintu Kumarb8af2942013-09-11 14:20:34 -07005115 * satisfied
Mel Gorman2a1e2742007-07-17 04:03:12 -07005116 */
5117 required_kernelcore -= min(required_kernelcore,
5118 size_pages);
5119 kernelcore_remaining -= size_pages;
5120 if (!kernelcore_remaining)
5121 break;
5122 }
5123 }
5124
5125 /*
5126 * If there is still required_kernelcore, we do another pass with one
5127 * less node in the count. This will push zone_movable_pfn[nid] further
5128 * along on the nodes that still have memory until kernelcore is
Pintu Kumarb8af2942013-09-11 14:20:34 -07005129 * satisfied
Mel Gorman2a1e2742007-07-17 04:03:12 -07005130 */
5131 usable_nodes--;
5132 if (usable_nodes && required_kernelcore > usable_nodes)
5133 goto restart;
5134
5135 /* Align start of ZONE_MOVABLE on all nids to MAX_ORDER_NR_PAGES */
5136 for (nid = 0; nid < MAX_NUMNODES; nid++)
5137 zone_movable_pfn[nid] =
5138 roundup(zone_movable_pfn[nid], MAX_ORDER_NR_PAGES);
Yinghai Lu66918dc2009-06-30 11:41:37 -07005139
Yinghai Lu20e69262013-03-01 14:51:27 -08005140out:
Yinghai Lu66918dc2009-06-30 11:41:37 -07005141 /* restore the node_state */
Lai Jiangshan4b0ef1fe2012-12-12 13:51:46 -08005142 node_states[N_MEMORY] = saved_node_state;
Mel Gorman2a1e2742007-07-17 04:03:12 -07005143}
5144
Lai Jiangshan4b0ef1fe2012-12-12 13:51:46 -08005145/* Any regular or high memory on that node ? */
5146static void check_for_memory(pg_data_t *pgdat, int nid)
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07005147{
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07005148 enum zone_type zone_type;
5149
Lai Jiangshan4b0ef1fe2012-12-12 13:51:46 -08005150 if (N_MEMORY == N_NORMAL_MEMORY)
5151 return;
5152
5153 for (zone_type = 0; zone_type <= ZONE_MOVABLE - 1; zone_type++) {
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07005154 struct zone *zone = &pgdat->node_zones[zone_type];
Xishi Qiub38a8722013-11-12 15:07:20 -08005155 if (populated_zone(zone)) {
Lai Jiangshan4b0ef1fe2012-12-12 13:51:46 -08005156 node_set_state(nid, N_HIGH_MEMORY);
5157 if (N_NORMAL_MEMORY != N_HIGH_MEMORY &&
5158 zone_type <= ZONE_NORMAL)
5159 node_set_state(nid, N_NORMAL_MEMORY);
Bob Liud0048b02012-01-12 17:19:07 -08005160 break;
5161 }
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07005162 }
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07005163}
5164
Mel Gormanc7132162006-09-27 01:49:43 -07005165/**
5166 * free_area_init_nodes - Initialise all pg_data_t and zone data
Randy Dunlap88ca3b92006-10-04 02:15:25 -07005167 * @max_zone_pfn: an array of max PFNs for each zone
Mel Gormanc7132162006-09-27 01:49:43 -07005168 *
5169 * This will call free_area_init_node() for each active node in the system.
5170 * Using the page ranges provided by add_active_range(), the size of each
5171 * zone in each node and their holes is calculated. If the maximum PFN
5172 * between two adjacent zones match, it is assumed that the zone is empty.
5173 * For example, if arch_max_dma_pfn == arch_max_dma32_pfn, it is assumed
5174 * that arch_max_dma32_pfn has no pages. It is also assumed that a zone
5175 * starts where the previous one ended. For example, ZONE_DMA32 starts
5176 * at arch_max_dma_pfn.
5177 */
5178void __init free_area_init_nodes(unsigned long *max_zone_pfn)
5179{
Tejun Heoc13291a2011-07-12 10:46:30 +02005180 unsigned long start_pfn, end_pfn;
5181 int i, nid;
Mel Gormana6af2bc2007-02-10 01:42:57 -08005182
Mel Gormanc7132162006-09-27 01:49:43 -07005183 /* Record where the zone boundaries are */
5184 memset(arch_zone_lowest_possible_pfn, 0,
5185 sizeof(arch_zone_lowest_possible_pfn));
5186 memset(arch_zone_highest_possible_pfn, 0,
5187 sizeof(arch_zone_highest_possible_pfn));
5188 arch_zone_lowest_possible_pfn[0] = find_min_pfn_with_active_regions();
5189 arch_zone_highest_possible_pfn[0] = max_zone_pfn[0];
5190 for (i = 1; i < MAX_NR_ZONES; i++) {
Mel Gorman2a1e2742007-07-17 04:03:12 -07005191 if (i == ZONE_MOVABLE)
5192 continue;
Mel Gormanc7132162006-09-27 01:49:43 -07005193 arch_zone_lowest_possible_pfn[i] =
5194 arch_zone_highest_possible_pfn[i-1];
5195 arch_zone_highest_possible_pfn[i] =
5196 max(max_zone_pfn[i], arch_zone_lowest_possible_pfn[i]);
5197 }
Mel Gorman2a1e2742007-07-17 04:03:12 -07005198 arch_zone_lowest_possible_pfn[ZONE_MOVABLE] = 0;
5199 arch_zone_highest_possible_pfn[ZONE_MOVABLE] = 0;
5200
5201 /* Find the PFNs that ZONE_MOVABLE begins at in each node */
5202 memset(zone_movable_pfn, 0, sizeof(zone_movable_pfn));
Kautuk Consulb224ef82012-03-21 16:34:15 -07005203 find_zone_movable_pfns_for_nodes();
Mel Gormanc7132162006-09-27 01:49:43 -07005204
Mel Gormanc7132162006-09-27 01:49:43 -07005205 /* Print out the zone ranges */
Bjorn Helgaasa62e2f42012-05-29 15:06:30 -07005206 printk("Zone ranges:\n");
Mel Gorman2a1e2742007-07-17 04:03:12 -07005207 for (i = 0; i < MAX_NR_ZONES; i++) {
5208 if (i == ZONE_MOVABLE)
5209 continue;
Kay Sievers155cbfc2012-05-08 17:24:14 +02005210 printk(KERN_CONT " %-8s ", zone_names[i]);
David Rientjes72f0ba02010-03-05 13:42:14 -08005211 if (arch_zone_lowest_possible_pfn[i] ==
5212 arch_zone_highest_possible_pfn[i])
Kay Sievers155cbfc2012-05-08 17:24:14 +02005213 printk(KERN_CONT "empty\n");
David Rientjes72f0ba02010-03-05 13:42:14 -08005214 else
Bjorn Helgaasa62e2f42012-05-29 15:06:30 -07005215 printk(KERN_CONT "[mem %0#10lx-%0#10lx]\n",
5216 arch_zone_lowest_possible_pfn[i] << PAGE_SHIFT,
5217 (arch_zone_highest_possible_pfn[i]
5218 << PAGE_SHIFT) - 1);
Mel Gorman2a1e2742007-07-17 04:03:12 -07005219 }
5220
5221 /* Print out the PFNs ZONE_MOVABLE begins at in each node */
Bjorn Helgaasa62e2f42012-05-29 15:06:30 -07005222 printk("Movable zone start for each node\n");
Mel Gorman2a1e2742007-07-17 04:03:12 -07005223 for (i = 0; i < MAX_NUMNODES; i++) {
5224 if (zone_movable_pfn[i])
Bjorn Helgaasa62e2f42012-05-29 15:06:30 -07005225 printk(" Node %d: %#010lx\n", i,
5226 zone_movable_pfn[i] << PAGE_SHIFT);
Mel Gorman2a1e2742007-07-17 04:03:12 -07005227 }
Mel Gormanc7132162006-09-27 01:49:43 -07005228
Wanpeng Lif2d52fe2012-10-08 16:32:24 -07005229 /* Print out the early node map */
Bjorn Helgaasa62e2f42012-05-29 15:06:30 -07005230 printk("Early memory node ranges\n");
Tejun Heoc13291a2011-07-12 10:46:30 +02005231 for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid)
Bjorn Helgaasa62e2f42012-05-29 15:06:30 -07005232 printk(" node %3d: [mem %#010lx-%#010lx]\n", nid,
5233 start_pfn << PAGE_SHIFT, (end_pfn << PAGE_SHIFT) - 1);
Mel Gormanc7132162006-09-27 01:49:43 -07005234
5235 /* Initialise every node */
Mel Gorman708614e2008-07-23 21:26:51 -07005236 mminit_verify_pageflags_layout();
Christoph Lameter8ef82862007-02-20 13:57:52 -08005237 setup_nr_node_ids();
Mel Gormanc7132162006-09-27 01:49:43 -07005238 for_each_online_node(nid) {
5239 pg_data_t *pgdat = NODE_DATA(nid);
Johannes Weiner9109fb72008-07-23 21:27:20 -07005240 free_area_init_node(nid, NULL,
Mel Gormanc7132162006-09-27 01:49:43 -07005241 find_min_pfn_for_node(nid), NULL);
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07005242
5243 /* Any memory on that node */
5244 if (pgdat->node_present_pages)
Lai Jiangshan4b0ef1fe2012-12-12 13:51:46 -08005245 node_set_state(nid, N_MEMORY);
5246 check_for_memory(pgdat, nid);
Mel Gormanc7132162006-09-27 01:49:43 -07005247 }
5248}
Mel Gorman2a1e2742007-07-17 04:03:12 -07005249
Mel Gorman7e63efe2007-07-17 04:03:15 -07005250static int __init cmdline_parse_core(char *p, unsigned long *core)
Mel Gorman2a1e2742007-07-17 04:03:12 -07005251{
5252 unsigned long long coremem;
5253 if (!p)
5254 return -EINVAL;
5255
5256 coremem = memparse(p, &p);
Mel Gorman7e63efe2007-07-17 04:03:15 -07005257 *core = coremem >> PAGE_SHIFT;
Mel Gorman2a1e2742007-07-17 04:03:12 -07005258
Mel Gorman7e63efe2007-07-17 04:03:15 -07005259 /* Paranoid check that UL is enough for the coremem value */
Mel Gorman2a1e2742007-07-17 04:03:12 -07005260 WARN_ON((coremem >> PAGE_SHIFT) > ULONG_MAX);
5261
5262 return 0;
5263}
Mel Gormaned7ed362007-07-17 04:03:14 -07005264
Mel Gorman7e63efe2007-07-17 04:03:15 -07005265/*
5266 * kernelcore=size sets the amount of memory for use for allocations that
5267 * cannot be reclaimed or migrated.
5268 */
5269static int __init cmdline_parse_kernelcore(char *p)
5270{
5271 return cmdline_parse_core(p, &required_kernelcore);
5272}
5273
5274/*
5275 * movablecore=size sets the amount of memory for use for allocations that
5276 * can be reclaimed or migrated.
5277 */
5278static int __init cmdline_parse_movablecore(char *p)
5279{
5280 return cmdline_parse_core(p, &required_movablecore);
5281}
5282
Mel Gormaned7ed362007-07-17 04:03:14 -07005283early_param("kernelcore", cmdline_parse_kernelcore);
Mel Gorman7e63efe2007-07-17 04:03:15 -07005284early_param("movablecore", cmdline_parse_movablecore);
Mel Gormaned7ed362007-07-17 04:03:14 -07005285
Tejun Heo0ee332c2011-12-08 10:22:09 -08005286#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
Mel Gormanc7132162006-09-27 01:49:43 -07005287
Jiang Liuc3d5f5f2013-07-03 15:03:14 -07005288void adjust_managed_page_count(struct page *page, long count)
5289{
5290 spin_lock(&managed_page_count_lock);
5291 page_zone(page)->managed_pages += count;
5292 totalram_pages += count;
Jiang Liu3dcc0572013-07-03 15:03:21 -07005293#ifdef CONFIG_HIGHMEM
5294 if (PageHighMem(page))
5295 totalhigh_pages += count;
5296#endif
Jiang Liuc3d5f5f2013-07-03 15:03:14 -07005297 spin_unlock(&managed_page_count_lock);
5298}
Jiang Liu3dcc0572013-07-03 15:03:21 -07005299EXPORT_SYMBOL(adjust_managed_page_count);
Jiang Liuc3d5f5f2013-07-03 15:03:14 -07005300
Jiang Liu11199692013-07-03 15:02:48 -07005301unsigned long free_reserved_area(void *start, void *end, int poison, char *s)
Jiang Liu69afade2013-04-29 15:06:21 -07005302{
Jiang Liu11199692013-07-03 15:02:48 -07005303 void *pos;
5304 unsigned long pages = 0;
Jiang Liu69afade2013-04-29 15:06:21 -07005305
Jiang Liu11199692013-07-03 15:02:48 -07005306 start = (void *)PAGE_ALIGN((unsigned long)start);
5307 end = (void *)((unsigned long)end & PAGE_MASK);
5308 for (pos = start; pos < end; pos += PAGE_SIZE, pages++) {
Jiang Liudbe67df2013-07-03 15:02:51 -07005309 if ((unsigned int)poison <= 0xFF)
Jiang Liu11199692013-07-03 15:02:48 -07005310 memset(pos, poison, PAGE_SIZE);
5311 free_reserved_page(virt_to_page(pos));
Jiang Liu69afade2013-04-29 15:06:21 -07005312 }
5313
5314 if (pages && s)
Jiang Liu11199692013-07-03 15:02:48 -07005315 pr_info("Freeing %s memory: %ldK (%p - %p)\n",
Jiang Liu69afade2013-04-29 15:06:21 -07005316 s, pages << (PAGE_SHIFT - 10), start, end);
5317
5318 return pages;
5319}
Jiang Liu11199692013-07-03 15:02:48 -07005320EXPORT_SYMBOL(free_reserved_area);
Jiang Liu69afade2013-04-29 15:06:21 -07005321
Jiang Liucfa11e02013-04-29 15:07:00 -07005322#ifdef CONFIG_HIGHMEM
5323void free_highmem_page(struct page *page)
5324{
5325 __free_reserved_page(page);
5326 totalram_pages++;
Jiang Liu7b4b2a02013-07-03 15:03:11 -07005327 page_zone(page)->managed_pages++;
Jiang Liucfa11e02013-04-29 15:07:00 -07005328 totalhigh_pages++;
5329}
5330#endif
5331
Jiang Liu7ee3d4e2013-07-03 15:03:41 -07005332
5333void __init mem_init_print_info(const char *str)
5334{
5335 unsigned long physpages, codesize, datasize, rosize, bss_size;
5336 unsigned long init_code_size, init_data_size;
5337
5338 physpages = get_num_physpages();
5339 codesize = _etext - _stext;
5340 datasize = _edata - _sdata;
5341 rosize = __end_rodata - __start_rodata;
5342 bss_size = __bss_stop - __bss_start;
5343 init_data_size = __init_end - __init_begin;
5344 init_code_size = _einittext - _sinittext;
5345
5346 /*
5347 * Detect special cases and adjust section sizes accordingly:
5348 * 1) .init.* may be embedded into .data sections
5349 * 2) .init.text.* may be out of [__init_begin, __init_end],
5350 * please refer to arch/tile/kernel/vmlinux.lds.S.
5351 * 3) .rodata.* may be embedded into .text or .data sections.
5352 */
5353#define adj_init_size(start, end, size, pos, adj) \
Pintu Kumarb8af2942013-09-11 14:20:34 -07005354 do { \
5355 if (start <= pos && pos < end && size > adj) \
5356 size -= adj; \
5357 } while (0)
Jiang Liu7ee3d4e2013-07-03 15:03:41 -07005358
5359 adj_init_size(__init_begin, __init_end, init_data_size,
5360 _sinittext, init_code_size);
5361 adj_init_size(_stext, _etext, codesize, _sinittext, init_code_size);
5362 adj_init_size(_sdata, _edata, datasize, __init_begin, init_data_size);
5363 adj_init_size(_stext, _etext, codesize, __start_rodata, rosize);
5364 adj_init_size(_sdata, _edata, datasize, __start_rodata, rosize);
5365
5366#undef adj_init_size
5367
5368 printk("Memory: %luK/%luK available "
5369 "(%luK kernel code, %luK rwdata, %luK rodata, "
5370 "%luK init, %luK bss, %luK reserved"
5371#ifdef CONFIG_HIGHMEM
5372 ", %luK highmem"
5373#endif
5374 "%s%s)\n",
5375 nr_free_pages() << (PAGE_SHIFT-10), physpages << (PAGE_SHIFT-10),
5376 codesize >> 10, datasize >> 10, rosize >> 10,
5377 (init_data_size + init_code_size) >> 10, bss_size >> 10,
5378 (physpages - totalram_pages) << (PAGE_SHIFT-10),
5379#ifdef CONFIG_HIGHMEM
5380 totalhigh_pages << (PAGE_SHIFT-10),
5381#endif
5382 str ? ", " : "", str ? str : "");
5383}
5384
Mel Gorman0e0b8642006-09-27 01:49:56 -07005385/**
Randy Dunlap88ca3b92006-10-04 02:15:25 -07005386 * set_dma_reserve - set the specified number of pages reserved in the first zone
5387 * @new_dma_reserve: The number of pages to mark reserved
Mel Gorman0e0b8642006-09-27 01:49:56 -07005388 *
5389 * The per-cpu batchsize and zone watermarks are determined by present_pages.
5390 * In the DMA zone, a significant percentage may be consumed by kernel image
5391 * and other unfreeable allocations which can skew the watermarks badly. This
Randy Dunlap88ca3b92006-10-04 02:15:25 -07005392 * function may optionally be used to account for unfreeable pages in the
5393 * first zone (e.g., ZONE_DMA). The effect will be lower watermarks and
5394 * smaller per-cpu batchsize.
Mel Gorman0e0b8642006-09-27 01:49:56 -07005395 */
5396void __init set_dma_reserve(unsigned long new_dma_reserve)
5397{
5398 dma_reserve = new_dma_reserve;
5399}
5400
Linus Torvalds1da177e2005-04-16 15:20:36 -07005401void __init free_area_init(unsigned long *zones_size)
5402{
Johannes Weiner9109fb72008-07-23 21:27:20 -07005403 free_area_init_node(0, zones_size,
Linus Torvalds1da177e2005-04-16 15:20:36 -07005404 __pa(PAGE_OFFSET) >> PAGE_SHIFT, NULL);
5405}
Linus Torvalds1da177e2005-04-16 15:20:36 -07005406
Linus Torvalds1da177e2005-04-16 15:20:36 -07005407static int page_alloc_cpu_notify(struct notifier_block *self,
5408 unsigned long action, void *hcpu)
5409{
5410 int cpu = (unsigned long)hcpu;
Linus Torvalds1da177e2005-04-16 15:20:36 -07005411
Rafael J. Wysocki8bb78442007-05-09 02:35:10 -07005412 if (action == CPU_DEAD || action == CPU_DEAD_FROZEN) {
Konstantin Khlebnikovf0cb3c72012-03-21 16:34:06 -07005413 lru_add_drain_cpu(cpu);
Christoph Lameter9f8f2172008-02-04 22:29:11 -08005414 drain_pages(cpu);
5415
5416 /*
5417 * Spill the event counters of the dead processor
5418 * into the current processors event counters.
5419 * This artificially elevates the count of the current
5420 * processor.
5421 */
Christoph Lameterf8891e52006-06-30 01:55:45 -07005422 vm_events_fold_cpu(cpu);
Christoph Lameter9f8f2172008-02-04 22:29:11 -08005423
5424 /*
5425 * Zero the differential counters of the dead processor
5426 * so that the vm statistics are consistent.
5427 *
5428 * This is only okay since the processor is dead and cannot
5429 * race with what we are doing.
5430 */
Christoph Lameter2bb921e2013-09-11 14:21:30 -07005431 cpu_vm_stats_fold(cpu);
Linus Torvalds1da177e2005-04-16 15:20:36 -07005432 }
5433 return NOTIFY_OK;
5434}
Linus Torvalds1da177e2005-04-16 15:20:36 -07005435
5436void __init page_alloc_init(void)
5437{
5438 hotcpu_notifier(page_alloc_cpu_notify, 0);
5439}
5440
5441/*
Hideo AOKIcb45b0e2006-04-10 22:52:59 -07005442 * calculate_totalreserve_pages - called when sysctl_lower_zone_reserve_ratio
5443 * or min_free_kbytes changes.
5444 */
5445static void calculate_totalreserve_pages(void)
5446{
5447 struct pglist_data *pgdat;
5448 unsigned long reserve_pages = 0;
Christoph Lameter2f6726e2006-09-25 23:31:18 -07005449 enum zone_type i, j;
Hideo AOKIcb45b0e2006-04-10 22:52:59 -07005450
5451 for_each_online_pgdat(pgdat) {
5452 for (i = 0; i < MAX_NR_ZONES; i++) {
5453 struct zone *zone = pgdat->node_zones + i;
5454 unsigned long max = 0;
5455
5456 /* Find valid and maximum lowmem_reserve in the zone */
5457 for (j = i; j < MAX_NR_ZONES; j++) {
5458 if (zone->lowmem_reserve[j] > max)
5459 max = zone->lowmem_reserve[j];
5460 }
5461
Mel Gorman41858962009-06-16 15:32:12 -07005462 /* we treat the high watermark as reserved pages. */
5463 max += high_wmark_pages(zone);
Hideo AOKIcb45b0e2006-04-10 22:52:59 -07005464
Jiang Liub40da042013-02-22 16:33:52 -08005465 if (max > zone->managed_pages)
5466 max = zone->managed_pages;
Hideo AOKIcb45b0e2006-04-10 22:52:59 -07005467 reserve_pages += max;
Johannes Weinerab8fabd2012-01-10 15:07:42 -08005468 /*
5469 * Lowmem reserves are not available to
5470 * GFP_HIGHUSER page cache allocations and
5471 * kswapd tries to balance zones to their high
5472 * watermark. As a result, neither should be
5473 * regarded as dirtyable memory, to prevent a
5474 * situation where reclaim has to clean pages
5475 * in order to balance the zones.
5476 */
5477 zone->dirty_balance_reserve = max;
Hideo AOKIcb45b0e2006-04-10 22:52:59 -07005478 }
5479 }
Johannes Weinerab8fabd2012-01-10 15:07:42 -08005480 dirty_balance_reserve = reserve_pages;
Hideo AOKIcb45b0e2006-04-10 22:52:59 -07005481 totalreserve_pages = reserve_pages;
5482}
5483
5484/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07005485 * setup_per_zone_lowmem_reserve - called whenever
5486 * sysctl_lower_zone_reserve_ratio changes. Ensures that each zone
5487 * has a correct pages reserved value, so an adequate number of
5488 * pages are left in the zone after a successful __alloc_pages().
5489 */
5490static void setup_per_zone_lowmem_reserve(void)
5491{
5492 struct pglist_data *pgdat;
Christoph Lameter2f6726e2006-09-25 23:31:18 -07005493 enum zone_type j, idx;
Linus Torvalds1da177e2005-04-16 15:20:36 -07005494
KAMEZAWA Hiroyukiec936fc2006-03-27 01:15:59 -08005495 for_each_online_pgdat(pgdat) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07005496 for (j = 0; j < MAX_NR_ZONES; j++) {
5497 struct zone *zone = pgdat->node_zones + j;
Jiang Liub40da042013-02-22 16:33:52 -08005498 unsigned long managed_pages = zone->managed_pages;
Linus Torvalds1da177e2005-04-16 15:20:36 -07005499
5500 zone->lowmem_reserve[j] = 0;
5501
Christoph Lameter2f6726e2006-09-25 23:31:18 -07005502 idx = j;
5503 while (idx) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07005504 struct zone *lower_zone;
5505
Christoph Lameter2f6726e2006-09-25 23:31:18 -07005506 idx--;
5507
Linus Torvalds1da177e2005-04-16 15:20:36 -07005508 if (sysctl_lowmem_reserve_ratio[idx] < 1)
5509 sysctl_lowmem_reserve_ratio[idx] = 1;
5510
5511 lower_zone = pgdat->node_zones + idx;
Jiang Liub40da042013-02-22 16:33:52 -08005512 lower_zone->lowmem_reserve[j] = managed_pages /
Linus Torvalds1da177e2005-04-16 15:20:36 -07005513 sysctl_lowmem_reserve_ratio[idx];
Jiang Liub40da042013-02-22 16:33:52 -08005514 managed_pages += lower_zone->managed_pages;
Linus Torvalds1da177e2005-04-16 15:20:36 -07005515 }
5516 }
5517 }
Hideo AOKIcb45b0e2006-04-10 22:52:59 -07005518
5519 /* update totalreserve_pages */
5520 calculate_totalreserve_pages();
Linus Torvalds1da177e2005-04-16 15:20:36 -07005521}
5522
Mel Gormancfd3da12011-04-25 21:36:42 +00005523static void __setup_per_zone_wmarks(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -07005524{
5525 unsigned long pages_min = min_free_kbytes >> (PAGE_SHIFT - 10);
5526 unsigned long lowmem_pages = 0;
5527 struct zone *zone;
5528 unsigned long flags;
5529
5530 /* Calculate total number of !ZONE_HIGHMEM pages */
5531 for_each_zone(zone) {
5532 if (!is_highmem(zone))
Jiang Liub40da042013-02-22 16:33:52 -08005533 lowmem_pages += zone->managed_pages;
Linus Torvalds1da177e2005-04-16 15:20:36 -07005534 }
5535
5536 for_each_zone(zone) {
Andrew Mortonac924c62006-05-15 09:43:59 -07005537 u64 tmp;
5538
Gerald Schaefer1125b4e2008-10-18 20:27:11 -07005539 spin_lock_irqsave(&zone->lock, flags);
Jiang Liub40da042013-02-22 16:33:52 -08005540 tmp = (u64)pages_min * zone->managed_pages;
Andrew Mortonac924c62006-05-15 09:43:59 -07005541 do_div(tmp, lowmem_pages);
Linus Torvalds1da177e2005-04-16 15:20:36 -07005542 if (is_highmem(zone)) {
5543 /*
Nick Piggin669ed172005-11-13 16:06:45 -08005544 * __GFP_HIGH and PF_MEMALLOC allocations usually don't
5545 * need highmem pages, so cap pages_min to a small
5546 * value here.
5547 *
Mel Gorman41858962009-06-16 15:32:12 -07005548 * The WMARK_HIGH-WMARK_LOW and (WMARK_LOW-WMARK_MIN)
Nick Piggin669ed172005-11-13 16:06:45 -08005549 * deltas controls asynch page reclaim, and so should
5550 * not be capped for highmem.
Linus Torvalds1da177e2005-04-16 15:20:36 -07005551 */
Andrew Morton90ae8d62013-02-22 16:32:22 -08005552 unsigned long min_pages;
Linus Torvalds1da177e2005-04-16 15:20:36 -07005553
Jiang Liub40da042013-02-22 16:33:52 -08005554 min_pages = zone->managed_pages / 1024;
Andrew Morton90ae8d62013-02-22 16:32:22 -08005555 min_pages = clamp(min_pages, SWAP_CLUSTER_MAX, 128UL);
Mel Gorman41858962009-06-16 15:32:12 -07005556 zone->watermark[WMARK_MIN] = min_pages;
Linus Torvalds1da177e2005-04-16 15:20:36 -07005557 } else {
Nick Piggin669ed172005-11-13 16:06:45 -08005558 /*
5559 * If it's a lowmem zone, reserve a number of pages
Linus Torvalds1da177e2005-04-16 15:20:36 -07005560 * proportionate to the zone's size.
5561 */
Mel Gorman41858962009-06-16 15:32:12 -07005562 zone->watermark[WMARK_MIN] = tmp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07005563 }
5564
Mel Gorman41858962009-06-16 15:32:12 -07005565 zone->watermark[WMARK_LOW] = min_wmark_pages(zone) + (tmp >> 2);
5566 zone->watermark[WMARK_HIGH] = min_wmark_pages(zone) + (tmp >> 1);
Marek Szyprowski49f223a2012-01-25 12:49:24 +01005567
Johannes Weiner81c0a2b2013-09-11 14:20:47 -07005568 __mod_zone_page_state(zone, NR_ALLOC_BATCH,
5569 high_wmark_pages(zone) -
5570 low_wmark_pages(zone) -
5571 zone_page_state(zone, NR_ALLOC_BATCH));
5572
Mel Gorman56fd56b2007-10-16 01:25:58 -07005573 setup_zone_migrate_reserve(zone);
Gerald Schaefer1125b4e2008-10-18 20:27:11 -07005574 spin_unlock_irqrestore(&zone->lock, flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -07005575 }
Hideo AOKIcb45b0e2006-04-10 22:52:59 -07005576
5577 /* update totalreserve_pages */
5578 calculate_totalreserve_pages();
Linus Torvalds1da177e2005-04-16 15:20:36 -07005579}
5580
Mel Gormancfd3da12011-04-25 21:36:42 +00005581/**
5582 * setup_per_zone_wmarks - called when min_free_kbytes changes
5583 * or when memory is hot-{added|removed}
5584 *
5585 * Ensures that the watermark[min,low,high] values for each zone are set
5586 * correctly with respect to min_free_kbytes.
5587 */
5588void setup_per_zone_wmarks(void)
5589{
5590 mutex_lock(&zonelists_mutex);
5591 __setup_per_zone_wmarks();
5592 mutex_unlock(&zonelists_mutex);
5593}
5594
Randy Dunlap55a44622009-09-21 17:01:20 -07005595/*
Rik van Riel556adec2008-10-18 20:26:34 -07005596 * The inactive anon list should be small enough that the VM never has to
5597 * do too much work, but large enough that each inactive page has a chance
5598 * to be referenced again before it is swapped out.
5599 *
5600 * The inactive_anon ratio is the target ratio of ACTIVE_ANON to
5601 * INACTIVE_ANON pages on this zone's LRU, maintained by the
5602 * pageout code. A zone->inactive_ratio of 3 means 3:1 or 25% of
5603 * the anonymous pages are kept on the inactive list.
5604 *
5605 * total target max
5606 * memory ratio inactive anon
5607 * -------------------------------------
5608 * 10MB 1 5MB
5609 * 100MB 1 50MB
5610 * 1GB 3 250MB
5611 * 10GB 10 0.9GB
5612 * 100GB 31 3GB
5613 * 1TB 101 10GB
5614 * 10TB 320 32GB
5615 */
KOSAKI Motohiro1b79acc2011-05-24 17:11:32 -07005616static void __meminit calculate_zone_inactive_ratio(struct zone *zone)
Minchan Kim96cb4df2009-06-16 15:32:49 -07005617{
5618 unsigned int gb, ratio;
5619
5620 /* Zone size in gigabytes */
Jiang Liub40da042013-02-22 16:33:52 -08005621 gb = zone->managed_pages >> (30 - PAGE_SHIFT);
Minchan Kim96cb4df2009-06-16 15:32:49 -07005622 if (gb)
5623 ratio = int_sqrt(10 * gb);
5624 else
5625 ratio = 1;
5626
5627 zone->inactive_ratio = ratio;
5628}
5629
KOSAKI Motohiro839a4fc2011-05-24 17:11:31 -07005630static void __meminit setup_per_zone_inactive_ratio(void)
Rik van Riel556adec2008-10-18 20:26:34 -07005631{
5632 struct zone *zone;
5633
Minchan Kim96cb4df2009-06-16 15:32:49 -07005634 for_each_zone(zone)
5635 calculate_zone_inactive_ratio(zone);
Rik van Riel556adec2008-10-18 20:26:34 -07005636}
5637
Linus Torvalds1da177e2005-04-16 15:20:36 -07005638/*
5639 * Initialise min_free_kbytes.
5640 *
5641 * For small machines we want it small (128k min). For large machines
5642 * we want it large (64MB max). But it is not linear, because network
5643 * bandwidth does not increase linearly with machine size. We use
5644 *
Pintu Kumarb8af2942013-09-11 14:20:34 -07005645 * min_free_kbytes = 4 * sqrt(lowmem_kbytes), for better accuracy:
Linus Torvalds1da177e2005-04-16 15:20:36 -07005646 * min_free_kbytes = sqrt(lowmem_kbytes * 16)
5647 *
5648 * which yields
5649 *
5650 * 16MB: 512k
5651 * 32MB: 724k
5652 * 64MB: 1024k
5653 * 128MB: 1448k
5654 * 256MB: 2048k
5655 * 512MB: 2896k
5656 * 1024MB: 4096k
5657 * 2048MB: 5792k
5658 * 4096MB: 8192k
5659 * 8192MB: 11584k
5660 * 16384MB: 16384k
5661 */
KOSAKI Motohiro1b79acc2011-05-24 17:11:32 -07005662int __meminit init_per_zone_wmark_min(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -07005663{
5664 unsigned long lowmem_kbytes;
Michal Hocko5f127332013-07-08 16:00:40 -07005665 int new_min_free_kbytes;
Linus Torvalds1da177e2005-04-16 15:20:36 -07005666
5667 lowmem_kbytes = nr_free_buffer_pages() * (PAGE_SIZE >> 10);
Michal Hocko5f127332013-07-08 16:00:40 -07005668 new_min_free_kbytes = int_sqrt(lowmem_kbytes * 16);
Linus Torvalds1da177e2005-04-16 15:20:36 -07005669
Michal Hocko5f127332013-07-08 16:00:40 -07005670 if (new_min_free_kbytes > user_min_free_kbytes) {
5671 min_free_kbytes = new_min_free_kbytes;
5672 if (min_free_kbytes < 128)
5673 min_free_kbytes = 128;
5674 if (min_free_kbytes > 65536)
5675 min_free_kbytes = 65536;
5676 } else {
5677 pr_warn("min_free_kbytes is not updated to %d because user defined value %d is preferred\n",
5678 new_min_free_kbytes, user_min_free_kbytes);
5679 }
Minchan Kimbc75d332009-06-16 15:32:48 -07005680 setup_per_zone_wmarks();
KOSAKI Motohiroa6cccdc2011-05-24 17:11:33 -07005681 refresh_zone_stat_thresholds();
Linus Torvalds1da177e2005-04-16 15:20:36 -07005682 setup_per_zone_lowmem_reserve();
Rik van Riel556adec2008-10-18 20:26:34 -07005683 setup_per_zone_inactive_ratio();
Linus Torvalds1da177e2005-04-16 15:20:36 -07005684 return 0;
5685}
Minchan Kimbc75d332009-06-16 15:32:48 -07005686module_init(init_per_zone_wmark_min)
Linus Torvalds1da177e2005-04-16 15:20:36 -07005687
5688/*
Pintu Kumarb8af2942013-09-11 14:20:34 -07005689 * min_free_kbytes_sysctl_handler - just a wrapper around proc_dointvec() so
Linus Torvalds1da177e2005-04-16 15:20:36 -07005690 * that we can call two helper functions whenever min_free_kbytes
5691 * changes.
5692 */
Pintu Kumarb8af2942013-09-11 14:20:34 -07005693int min_free_kbytes_sysctl_handler(ctl_table *table, int write,
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07005694 void __user *buffer, size_t *length, loff_t *ppos)
Linus Torvalds1da177e2005-04-16 15:20:36 -07005695{
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07005696 proc_dointvec(table, write, buffer, length, ppos);
Michal Hocko5f127332013-07-08 16:00:40 -07005697 if (write) {
5698 user_min_free_kbytes = min_free_kbytes;
Minchan Kimbc75d332009-06-16 15:32:48 -07005699 setup_per_zone_wmarks();
Michal Hocko5f127332013-07-08 16:00:40 -07005700 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07005701 return 0;
5702}
5703
Christoph Lameter96146342006-07-03 00:24:13 -07005704#ifdef CONFIG_NUMA
5705int sysctl_min_unmapped_ratio_sysctl_handler(ctl_table *table, int write,
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07005706 void __user *buffer, size_t *length, loff_t *ppos)
Christoph Lameter96146342006-07-03 00:24:13 -07005707{
5708 struct zone *zone;
5709 int rc;
5710
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07005711 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
Christoph Lameter96146342006-07-03 00:24:13 -07005712 if (rc)
5713 return rc;
5714
5715 for_each_zone(zone)
Jiang Liub40da042013-02-22 16:33:52 -08005716 zone->min_unmapped_pages = (zone->managed_pages *
Christoph Lameter96146342006-07-03 00:24:13 -07005717 sysctl_min_unmapped_ratio) / 100;
5718 return 0;
5719}
Christoph Lameter0ff38492006-09-25 23:31:52 -07005720
5721int sysctl_min_slab_ratio_sysctl_handler(ctl_table *table, int write,
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07005722 void __user *buffer, size_t *length, loff_t *ppos)
Christoph Lameter0ff38492006-09-25 23:31:52 -07005723{
5724 struct zone *zone;
5725 int rc;
5726
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07005727 rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
Christoph Lameter0ff38492006-09-25 23:31:52 -07005728 if (rc)
5729 return rc;
5730
5731 for_each_zone(zone)
Jiang Liub40da042013-02-22 16:33:52 -08005732 zone->min_slab_pages = (zone->managed_pages *
Christoph Lameter0ff38492006-09-25 23:31:52 -07005733 sysctl_min_slab_ratio) / 100;
5734 return 0;
5735}
Christoph Lameter96146342006-07-03 00:24:13 -07005736#endif
5737
Linus Torvalds1da177e2005-04-16 15:20:36 -07005738/*
5739 * lowmem_reserve_ratio_sysctl_handler - just a wrapper around
5740 * proc_dointvec() so that we can call setup_per_zone_lowmem_reserve()
5741 * whenever sysctl_lowmem_reserve_ratio changes.
5742 *
5743 * The reserve ratio obviously has absolutely no relation with the
Mel Gorman41858962009-06-16 15:32:12 -07005744 * minimum watermarks. The lowmem reserve ratio can only make sense
Linus Torvalds1da177e2005-04-16 15:20:36 -07005745 * if in function of the boot time zone sizes.
5746 */
5747int lowmem_reserve_ratio_sysctl_handler(ctl_table *table, int write,
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07005748 void __user *buffer, size_t *length, loff_t *ppos)
Linus Torvalds1da177e2005-04-16 15:20:36 -07005749{
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07005750 proc_dointvec_minmax(table, write, buffer, length, ppos);
Linus Torvalds1da177e2005-04-16 15:20:36 -07005751 setup_per_zone_lowmem_reserve();
5752 return 0;
5753}
5754
Rohit Seth8ad4b1f2006-01-08 01:00:40 -08005755/*
5756 * percpu_pagelist_fraction - changes the pcp->high for each zone on each
Pintu Kumarb8af2942013-09-11 14:20:34 -07005757 * cpu. It is the fraction of total pages in each zone that a hot per cpu
5758 * pagelist can have before it gets flushed back to buddy allocator.
Rohit Seth8ad4b1f2006-01-08 01:00:40 -08005759 */
Rohit Seth8ad4b1f2006-01-08 01:00:40 -08005760int percpu_pagelist_fraction_sysctl_handler(ctl_table *table, int write,
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07005761 void __user *buffer, size_t *length, loff_t *ppos)
Rohit Seth8ad4b1f2006-01-08 01:00:40 -08005762{
5763 struct zone *zone;
5764 unsigned int cpu;
5765 int ret;
5766
Alexey Dobriyan8d65af72009-09-23 15:57:19 -07005767 ret = proc_dointvec_minmax(table, write, buffer, length, ppos);
Sasha Levin93278812012-05-10 13:01:44 -07005768 if (!write || (ret < 0))
Rohit Seth8ad4b1f2006-01-08 01:00:40 -08005769 return ret;
Cody P Schaferc8e251f2013-07-03 15:01:29 -07005770
5771 mutex_lock(&pcp_batch_high_lock);
Dimitri Sivanich364df0e2009-06-23 12:37:04 -07005772 for_each_populated_zone(zone) {
Cody P Schafer22a7f122013-07-03 15:01:34 -07005773 unsigned long high;
5774 high = zone->managed_pages / percpu_pagelist_fraction;
5775 for_each_possible_cpu(cpu)
Cody P Schafer36640332013-07-03 15:01:40 -07005776 pageset_set_high(per_cpu_ptr(zone->pageset, cpu),
5777 high);
Rohit Seth8ad4b1f2006-01-08 01:00:40 -08005778 }
Cody P Schaferc8e251f2013-07-03 15:01:29 -07005779 mutex_unlock(&pcp_batch_high_lock);
Rohit Seth8ad4b1f2006-01-08 01:00:40 -08005780 return 0;
5781}
5782
David S. Millerf034b5d2006-08-24 03:08:07 -07005783int hashdist = HASHDIST_DEFAULT;
Linus Torvalds1da177e2005-04-16 15:20:36 -07005784
5785#ifdef CONFIG_NUMA
5786static int __init set_hashdist(char *str)
5787{
5788 if (!str)
5789 return 0;
5790 hashdist = simple_strtoul(str, &str, 0);
5791 return 1;
5792}
5793__setup("hashdist=", set_hashdist);
5794#endif
5795
5796/*
5797 * allocate a large system hash table from bootmem
5798 * - it is assumed that the hash table must contain an exact power-of-2
5799 * quantity of entries
5800 * - limit is the number of hash buckets, not the total allocation size
5801 */
5802void *__init alloc_large_system_hash(const char *tablename,
5803 unsigned long bucketsize,
5804 unsigned long numentries,
5805 int scale,
5806 int flags,
5807 unsigned int *_hash_shift,
5808 unsigned int *_hash_mask,
Tim Bird31fe62b2012-05-23 13:33:35 +00005809 unsigned long low_limit,
5810 unsigned long high_limit)
Linus Torvalds1da177e2005-04-16 15:20:36 -07005811{
Tim Bird31fe62b2012-05-23 13:33:35 +00005812 unsigned long long max = high_limit;
Linus Torvalds1da177e2005-04-16 15:20:36 -07005813 unsigned long log2qty, size;
5814 void *table = NULL;
5815
5816 /* allow the kernel cmdline to have a say */
5817 if (!numentries) {
5818 /* round applicable memory size up to nearest megabyte */
Andrew Morton04903662006-12-06 20:37:33 -08005819 numentries = nr_kernel_pages;
Jerry Zhoua7e83312013-09-11 14:20:26 -07005820
5821 /* It isn't necessary when PAGE_SIZE >= 1MB */
5822 if (PAGE_SHIFT < 20)
5823 numentries = round_up(numentries, (1<<20)/PAGE_SIZE);
Linus Torvalds1da177e2005-04-16 15:20:36 -07005824
5825 /* limit to 1 bucket per 2^scale bytes of low memory */
5826 if (scale > PAGE_SHIFT)
5827 numentries >>= (scale - PAGE_SHIFT);
5828 else
5829 numentries <<= (PAGE_SHIFT - scale);
Paul Mundt9ab37b82007-01-05 16:36:30 -08005830
5831 /* Make sure we've got at least a 0-order allocation.. */
Jan Beulich2c85f512009-09-21 17:03:07 -07005832 if (unlikely(flags & HASH_SMALL)) {
5833 /* Makes no sense without HASH_EARLY */
5834 WARN_ON(!(flags & HASH_EARLY));
5835 if (!(numentries >> *_hash_shift)) {
5836 numentries = 1UL << *_hash_shift;
5837 BUG_ON(!numentries);
5838 }
5839 } else if (unlikely((numentries * bucketsize) < PAGE_SIZE))
Paul Mundt9ab37b82007-01-05 16:36:30 -08005840 numentries = PAGE_SIZE / bucketsize;
Linus Torvalds1da177e2005-04-16 15:20:36 -07005841 }
John Hawkes6e692ed2006-03-25 03:08:02 -08005842 numentries = roundup_pow_of_two(numentries);
Linus Torvalds1da177e2005-04-16 15:20:36 -07005843
5844 /* limit allocation size to 1/16 total memory by default */
5845 if (max == 0) {
5846 max = ((unsigned long long)nr_all_pages << PAGE_SHIFT) >> 4;
5847 do_div(max, bucketsize);
5848 }
Dimitri Sivanich074b8512012-02-08 12:39:07 -08005849 max = min(max, 0x80000000ULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07005850
Tim Bird31fe62b2012-05-23 13:33:35 +00005851 if (numentries < low_limit)
5852 numentries = low_limit;
Linus Torvalds1da177e2005-04-16 15:20:36 -07005853 if (numentries > max)
5854 numentries = max;
5855
David Howellsf0d1b0b2006-12-08 02:37:49 -08005856 log2qty = ilog2(numentries);
Linus Torvalds1da177e2005-04-16 15:20:36 -07005857
5858 do {
5859 size = bucketsize << log2qty;
5860 if (flags & HASH_EARLY)
Jan Beulich74768ed2008-08-12 15:08:39 -07005861 table = alloc_bootmem_nopanic(size);
Linus Torvalds1da177e2005-04-16 15:20:36 -07005862 else if (hashdist)
5863 table = __vmalloc(size, GFP_ATOMIC, PAGE_KERNEL);
5864 else {
Eric Dumazet1037b832007-07-15 23:38:05 -07005865 /*
5866 * If bucketsize is not a power-of-two, we may free
Mel Gormana1dd2682009-06-16 15:32:19 -07005867 * some pages at the end of hash table which
5868 * alloc_pages_exact() automatically does
Eric Dumazet1037b832007-07-15 23:38:05 -07005869 */
Catalin Marinas264ef8a2009-07-07 10:33:01 +01005870 if (get_order(size) < MAX_ORDER) {
Mel Gormana1dd2682009-06-16 15:32:19 -07005871 table = alloc_pages_exact(size, GFP_ATOMIC);
Catalin Marinas264ef8a2009-07-07 10:33:01 +01005872 kmemleak_alloc(table, size, 1, GFP_ATOMIC);
5873 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07005874 }
5875 } while (!table && size > PAGE_SIZE && --log2qty);
5876
5877 if (!table)
5878 panic("Failed to allocate %s hash table\n", tablename);
5879
Robin Holtf241e6602010-10-07 12:59:26 -07005880 printk(KERN_INFO "%s hash table entries: %ld (order: %d, %lu bytes)\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -07005881 tablename,
Robin Holtf241e6602010-10-07 12:59:26 -07005882 (1UL << log2qty),
David Howellsf0d1b0b2006-12-08 02:37:49 -08005883 ilog2(size) - PAGE_SHIFT,
Linus Torvalds1da177e2005-04-16 15:20:36 -07005884 size);
5885
5886 if (_hash_shift)
5887 *_hash_shift = log2qty;
5888 if (_hash_mask)
5889 *_hash_mask = (1 << log2qty) - 1;
5890
5891 return table;
5892}
KAMEZAWA Hiroyukia117e662006-03-27 01:15:25 -08005893
Mel Gorman835c1342007-10-16 01:25:47 -07005894/* Return a pointer to the bitmap storing bits affecting a block of pages */
5895static inline unsigned long *get_pageblock_bitmap(struct zone *zone,
5896 unsigned long pfn)
5897{
5898#ifdef CONFIG_SPARSEMEM
5899 return __pfn_to_section(pfn)->pageblock_flags;
5900#else
5901 return zone->pageblock_flags;
5902#endif /* CONFIG_SPARSEMEM */
5903}
Andrew Morton6220ec72006-10-19 23:29:05 -07005904
Mel Gorman835c1342007-10-16 01:25:47 -07005905static inline int pfn_to_bitidx(struct zone *zone, unsigned long pfn)
5906{
5907#ifdef CONFIG_SPARSEMEM
5908 pfn &= (PAGES_PER_SECTION-1);
Mel Gormand9c23402007-10-16 01:26:01 -07005909 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
Mel Gorman835c1342007-10-16 01:25:47 -07005910#else
Laura Abbottc060f942013-01-11 14:31:51 -08005911 pfn = pfn - round_down(zone->zone_start_pfn, pageblock_nr_pages);
Mel Gormand9c23402007-10-16 01:26:01 -07005912 return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
Mel Gorman835c1342007-10-16 01:25:47 -07005913#endif /* CONFIG_SPARSEMEM */
5914}
5915
5916/**
Mel Gormand9c23402007-10-16 01:26:01 -07005917 * 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 -07005918 * @page: The page within the block of interest
5919 * @start_bitidx: The first bit of interest to retrieve
5920 * @end_bitidx: The last bit of interest
5921 * returns pageblock_bits flags
5922 */
5923unsigned long get_pageblock_flags_group(struct page *page,
5924 int start_bitidx, int end_bitidx)
5925{
5926 struct zone *zone;
5927 unsigned long *bitmap;
5928 unsigned long pfn, bitidx;
5929 unsigned long flags = 0;
5930 unsigned long value = 1;
5931
5932 zone = page_zone(page);
5933 pfn = page_to_pfn(page);
5934 bitmap = get_pageblock_bitmap(zone, pfn);
5935 bitidx = pfn_to_bitidx(zone, pfn);
5936
5937 for (; start_bitidx <= end_bitidx; start_bitidx++, value <<= 1)
5938 if (test_bit(bitidx + start_bitidx, bitmap))
5939 flags |= value;
5940
5941 return flags;
5942}
5943
5944/**
Mel Gormand9c23402007-10-16 01:26:01 -07005945 * 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 -07005946 * @page: The page within the block of interest
5947 * @start_bitidx: The first bit of interest
5948 * @end_bitidx: The last bit of interest
5949 * @flags: The flags to set
5950 */
5951void set_pageblock_flags_group(struct page *page, unsigned long flags,
5952 int start_bitidx, int end_bitidx)
5953{
5954 struct zone *zone;
5955 unsigned long *bitmap;
5956 unsigned long pfn, bitidx;
5957 unsigned long value = 1;
5958
5959 zone = page_zone(page);
5960 pfn = page_to_pfn(page);
5961 bitmap = get_pageblock_bitmap(zone, pfn);
5962 bitidx = pfn_to_bitidx(zone, pfn);
Cody P Schafer108bcc92013-02-22 16:35:23 -08005963 VM_BUG_ON(!zone_spans_pfn(zone, pfn));
Mel Gorman835c1342007-10-16 01:25:47 -07005964
5965 for (; start_bitidx <= end_bitidx; start_bitidx++, value <<= 1)
5966 if (flags & value)
5967 __set_bit(bitidx + start_bitidx, bitmap);
5968 else
5969 __clear_bit(bitidx + start_bitidx, bitmap);
5970}
KAMEZAWA Hiroyukia5d76b52007-10-16 01:26:11 -07005971
5972/*
Minchan Kim80934512012-07-31 16:43:01 -07005973 * This function checks whether pageblock includes unmovable pages or not.
5974 * If @count is not zero, it is okay to include less @count unmovable pages
5975 *
Pintu Kumarb8af2942013-09-11 14:20:34 -07005976 * PageLRU check without isolation or lru_lock could race so that
Minchan Kim80934512012-07-31 16:43:01 -07005977 * MIGRATE_MOVABLE block might include unmovable pages. It means you can't
5978 * expect this function should be exact.
KAMEZAWA Hiroyukia5d76b52007-10-16 01:26:11 -07005979 */
Wen Congyangb023f462012-12-11 16:00:45 -08005980bool has_unmovable_pages(struct zone *zone, struct page *page, int count,
5981 bool skip_hwpoisoned_pages)
KAMEZAWA Hiroyuki49ac8252010-10-26 14:21:30 -07005982{
5983 unsigned long pfn, iter, found;
Michal Nazarewicz47118af2011-12-29 13:09:50 +01005984 int mt;
5985
KAMEZAWA Hiroyuki49ac8252010-10-26 14:21:30 -07005986 /*
5987 * For avoiding noise data, lru_add_drain_all() should be called
Minchan Kim80934512012-07-31 16:43:01 -07005988 * If ZONE_MOVABLE, the zone never contains unmovable pages
KAMEZAWA Hiroyuki49ac8252010-10-26 14:21:30 -07005989 */
5990 if (zone_idx(zone) == ZONE_MOVABLE)
Minchan Kim80934512012-07-31 16:43:01 -07005991 return false;
Michal Nazarewicz47118af2011-12-29 13:09:50 +01005992 mt = get_pageblock_migratetype(page);
5993 if (mt == MIGRATE_MOVABLE || is_migrate_cma(mt))
Minchan Kim80934512012-07-31 16:43:01 -07005994 return false;
KAMEZAWA Hiroyuki49ac8252010-10-26 14:21:30 -07005995
5996 pfn = page_to_pfn(page);
5997 for (found = 0, iter = 0; iter < pageblock_nr_pages; iter++) {
5998 unsigned long check = pfn + iter;
5999
Namhyung Kim29723fc2011-02-25 14:44:25 -08006000 if (!pfn_valid_within(check))
KAMEZAWA Hiroyuki49ac8252010-10-26 14:21:30 -07006001 continue;
Namhyung Kim29723fc2011-02-25 14:44:25 -08006002
KAMEZAWA Hiroyuki49ac8252010-10-26 14:21:30 -07006003 page = pfn_to_page(check);
Naoya Horiguchic8721bb2013-09-11 14:22:09 -07006004
6005 /*
6006 * Hugepages are not in LRU lists, but they're movable.
6007 * We need not scan over tail pages bacause we don't
6008 * handle each tail page individually in migration.
6009 */
6010 if (PageHuge(page)) {
6011 iter = round_up(iter + 1, 1<<compound_order(page)) - 1;
6012 continue;
6013 }
6014
Minchan Kim97d255c2012-07-31 16:42:59 -07006015 /*
6016 * We can't use page_count without pin a page
6017 * because another CPU can free compound page.
6018 * This check already skips compound tails of THP
6019 * because their page->_count is zero at all time.
6020 */
6021 if (!atomic_read(&page->_count)) {
KAMEZAWA Hiroyuki49ac8252010-10-26 14:21:30 -07006022 if (PageBuddy(page))
6023 iter += (1 << page_order(page)) - 1;
6024 continue;
6025 }
Minchan Kim97d255c2012-07-31 16:42:59 -07006026
Wen Congyangb023f462012-12-11 16:00:45 -08006027 /*
6028 * The HWPoisoned page may be not in buddy system, and
6029 * page_count() is not 0.
6030 */
6031 if (skip_hwpoisoned_pages && PageHWPoison(page))
6032 continue;
6033
KAMEZAWA Hiroyuki49ac8252010-10-26 14:21:30 -07006034 if (!PageLRU(page))
6035 found++;
6036 /*
6037 * If there are RECLAIMABLE pages, we need to check it.
6038 * But now, memory offline itself doesn't call shrink_slab()
6039 * and it still to be fixed.
6040 */
6041 /*
6042 * If the page is not RAM, page_count()should be 0.
6043 * we don't need more check. This is an _used_ not-movable page.
6044 *
6045 * The problematic thing here is PG_reserved pages. PG_reserved
6046 * is set to both of a memory hole page and a _used_ kernel
6047 * page at boot.
6048 */
6049 if (found > count)
Minchan Kim80934512012-07-31 16:43:01 -07006050 return true;
KAMEZAWA Hiroyuki49ac8252010-10-26 14:21:30 -07006051 }
Minchan Kim80934512012-07-31 16:43:01 -07006052 return false;
KAMEZAWA Hiroyuki49ac8252010-10-26 14:21:30 -07006053}
6054
6055bool is_pageblock_removable_nolock(struct page *page)
6056{
Michal Hocko656a0702012-01-20 14:33:58 -08006057 struct zone *zone;
6058 unsigned long pfn;
Michal Hocko687875f2012-01-20 14:33:55 -08006059
6060 /*
6061 * We have to be careful here because we are iterating over memory
6062 * sections which are not zone aware so we might end up outside of
6063 * the zone but still within the section.
Michal Hocko656a0702012-01-20 14:33:58 -08006064 * We have to take care about the node as well. If the node is offline
6065 * its NODE_DATA will be NULL - see page_zone.
Michal Hocko687875f2012-01-20 14:33:55 -08006066 */
Michal Hocko656a0702012-01-20 14:33:58 -08006067 if (!node_online(page_to_nid(page)))
6068 return false;
6069
6070 zone = page_zone(page);
6071 pfn = page_to_pfn(page);
Cody P Schafer108bcc92013-02-22 16:35:23 -08006072 if (!zone_spans_pfn(zone, pfn))
Michal Hocko687875f2012-01-20 14:33:55 -08006073 return false;
6074
Wen Congyangb023f462012-12-11 16:00:45 -08006075 return !has_unmovable_pages(zone, page, 0, true);
KAMEZAWA Hiroyukia5d76b52007-10-16 01:26:11 -07006076}
KAMEZAWA Hiroyuki0c0e6192007-10-16 01:26:12 -07006077
Michal Nazarewicz041d3a82011-12-29 13:09:50 +01006078#ifdef CONFIG_CMA
6079
6080static unsigned long pfn_max_align_down(unsigned long pfn)
6081{
6082 return pfn & ~(max_t(unsigned long, MAX_ORDER_NR_PAGES,
6083 pageblock_nr_pages) - 1);
6084}
6085
6086static unsigned long pfn_max_align_up(unsigned long pfn)
6087{
6088 return ALIGN(pfn, max_t(unsigned long, MAX_ORDER_NR_PAGES,
6089 pageblock_nr_pages));
6090}
6091
Michal Nazarewicz041d3a82011-12-29 13:09:50 +01006092/* [start, end) must belong to a single zone. */
Mel Gormanbb13ffe2012-10-08 16:32:41 -07006093static int __alloc_contig_migrate_range(struct compact_control *cc,
6094 unsigned long start, unsigned long end)
Michal Nazarewicz041d3a82011-12-29 13:09:50 +01006095{
6096 /* This function is based on compact_zone() from compaction.c. */
Minchan Kimbeb51ea2012-10-08 16:33:51 -07006097 unsigned long nr_reclaimed;
Michal Nazarewicz041d3a82011-12-29 13:09:50 +01006098 unsigned long pfn = start;
6099 unsigned int tries = 0;
6100 int ret = 0;
6101
Marek Szyprowskibe49a6e2012-12-12 13:51:19 -08006102 migrate_prep();
Michal Nazarewicz041d3a82011-12-29 13:09:50 +01006103
Mel Gormanbb13ffe2012-10-08 16:32:41 -07006104 while (pfn < end || !list_empty(&cc->migratepages)) {
Michal Nazarewicz041d3a82011-12-29 13:09:50 +01006105 if (fatal_signal_pending(current)) {
6106 ret = -EINTR;
6107 break;
6108 }
6109
Mel Gormanbb13ffe2012-10-08 16:32:41 -07006110 if (list_empty(&cc->migratepages)) {
6111 cc->nr_migratepages = 0;
6112 pfn = isolate_migratepages_range(cc->zone, cc,
Minchan Kime46a2872012-10-08 16:33:48 -07006113 pfn, end, true);
Michal Nazarewicz041d3a82011-12-29 13:09:50 +01006114 if (!pfn) {
6115 ret = -EINTR;
6116 break;
6117 }
6118 tries = 0;
6119 } else if (++tries == 5) {
6120 ret = ret < 0 ? ret : -EBUSY;
6121 break;
6122 }
6123
Minchan Kimbeb51ea2012-10-08 16:33:51 -07006124 nr_reclaimed = reclaim_clean_pages_from_list(cc->zone,
6125 &cc->migratepages);
6126 cc->nr_migratepages -= nr_reclaimed;
Minchan Kim02c6de82012-10-08 16:31:55 -07006127
Hugh Dickins9c620e22013-02-22 16:35:14 -08006128 ret = migrate_pages(&cc->migratepages, alloc_migrate_target,
6129 0, MIGRATE_SYNC, MR_CMA);
Michal Nazarewicz041d3a82011-12-29 13:09:50 +01006130 }
Srinivas Pandruvada2a6f5122013-02-22 16:32:09 -08006131 if (ret < 0) {
6132 putback_movable_pages(&cc->migratepages);
6133 return ret;
6134 }
6135 return 0;
Michal Nazarewicz041d3a82011-12-29 13:09:50 +01006136}
6137
6138/**
6139 * alloc_contig_range() -- tries to allocate given range of pages
6140 * @start: start PFN to allocate
6141 * @end: one-past-the-last PFN to allocate
Michal Nazarewicz0815f3d2012-04-03 15:06:15 +02006142 * @migratetype: migratetype of the underlaying pageblocks (either
6143 * #MIGRATE_MOVABLE or #MIGRATE_CMA). All pageblocks
6144 * in range must have the same migratetype and it must
6145 * be either of the two.
Michal Nazarewicz041d3a82011-12-29 13:09:50 +01006146 *
6147 * The PFN range does not have to be pageblock or MAX_ORDER_NR_PAGES
6148 * aligned, however it's the caller's responsibility to guarantee that
6149 * we are the only thread that changes migrate type of pageblocks the
6150 * pages fall in.
6151 *
6152 * The PFN range must belong to a single zone.
6153 *
6154 * Returns zero on success or negative error code. On success all
6155 * pages which PFN is in [start, end) are allocated for the caller and
6156 * need to be freed with free_contig_range().
6157 */
Michal Nazarewicz0815f3d2012-04-03 15:06:15 +02006158int alloc_contig_range(unsigned long start, unsigned long end,
6159 unsigned migratetype)
Michal Nazarewicz041d3a82011-12-29 13:09:50 +01006160{
Michal Nazarewicz041d3a82011-12-29 13:09:50 +01006161 unsigned long outer_start, outer_end;
6162 int ret = 0, order;
6163
Mel Gormanbb13ffe2012-10-08 16:32:41 -07006164 struct compact_control cc = {
6165 .nr_migratepages = 0,
6166 .order = -1,
6167 .zone = page_zone(pfn_to_page(start)),
6168 .sync = true,
6169 .ignore_skip_hint = true,
6170 };
6171 INIT_LIST_HEAD(&cc.migratepages);
6172
Michal Nazarewicz041d3a82011-12-29 13:09:50 +01006173 /*
6174 * What we do here is we mark all pageblocks in range as
6175 * MIGRATE_ISOLATE. Because pageblock and max order pages may
6176 * have different sizes, and due to the way page allocator
6177 * work, we align the range to biggest of the two pages so
6178 * that page allocator won't try to merge buddies from
6179 * different pageblocks and change MIGRATE_ISOLATE to some
6180 * other migration type.
6181 *
6182 * Once the pageblocks are marked as MIGRATE_ISOLATE, we
6183 * migrate the pages from an unaligned range (ie. pages that
6184 * we are interested in). This will put all the pages in
6185 * range back to page allocator as MIGRATE_ISOLATE.
6186 *
6187 * When this is done, we take the pages in range from page
6188 * allocator removing them from the buddy system. This way
6189 * page allocator will never consider using them.
6190 *
6191 * This lets us mark the pageblocks back as
6192 * MIGRATE_CMA/MIGRATE_MOVABLE so that free pages in the
6193 * aligned range but not in the unaligned, original range are
6194 * put back to page allocator so that buddy can use them.
6195 */
6196
6197 ret = start_isolate_page_range(pfn_max_align_down(start),
Wen Congyangb023f462012-12-11 16:00:45 -08006198 pfn_max_align_up(end), migratetype,
6199 false);
Michal Nazarewicz041d3a82011-12-29 13:09:50 +01006200 if (ret)
Bob Liu86a595f2012-10-25 13:37:56 -07006201 return ret;
Michal Nazarewicz041d3a82011-12-29 13:09:50 +01006202
Mel Gormanbb13ffe2012-10-08 16:32:41 -07006203 ret = __alloc_contig_migrate_range(&cc, start, end);
Michal Nazarewicz041d3a82011-12-29 13:09:50 +01006204 if (ret)
6205 goto done;
6206
6207 /*
6208 * Pages from [start, end) are within a MAX_ORDER_NR_PAGES
6209 * aligned blocks that are marked as MIGRATE_ISOLATE. What's
6210 * more, all pages in [start, end) are free in page allocator.
6211 * What we are going to do is to allocate all pages from
6212 * [start, end) (that is remove them from page allocator).
6213 *
6214 * The only problem is that pages at the beginning and at the
6215 * end of interesting range may be not aligned with pages that
6216 * page allocator holds, ie. they can be part of higher order
6217 * pages. Because of this, we reserve the bigger range and
6218 * once this is done free the pages we are not interested in.
6219 *
6220 * We don't have to hold zone->lock here because the pages are
6221 * isolated thus they won't get removed from buddy.
6222 */
6223
6224 lru_add_drain_all();
6225 drain_all_pages();
6226
6227 order = 0;
6228 outer_start = start;
6229 while (!PageBuddy(pfn_to_page(outer_start))) {
6230 if (++order >= MAX_ORDER) {
6231 ret = -EBUSY;
6232 goto done;
6233 }
6234 outer_start &= ~0UL << order;
6235 }
6236
6237 /* Make sure the range is really isolated. */
Wen Congyangb023f462012-12-11 16:00:45 -08006238 if (test_pages_isolated(outer_start, end, false)) {
Michal Nazarewicz041d3a82011-12-29 13:09:50 +01006239 pr_warn("alloc_contig_range test_pages_isolated(%lx, %lx) failed\n",
6240 outer_start, end);
6241 ret = -EBUSY;
6242 goto done;
6243 }
6244
Marek Szyprowski49f223a2012-01-25 12:49:24 +01006245
6246 /* Grab isolated pages from freelists. */
Mel Gormanbb13ffe2012-10-08 16:32:41 -07006247 outer_end = isolate_freepages_range(&cc, outer_start, end);
Michal Nazarewicz041d3a82011-12-29 13:09:50 +01006248 if (!outer_end) {
6249 ret = -EBUSY;
6250 goto done;
6251 }
6252
6253 /* Free head and tail (if any) */
6254 if (start != outer_start)
6255 free_contig_range(outer_start, start - outer_start);
6256 if (end != outer_end)
6257 free_contig_range(end, outer_end - end);
6258
6259done:
6260 undo_isolate_page_range(pfn_max_align_down(start),
Michal Nazarewicz0815f3d2012-04-03 15:06:15 +02006261 pfn_max_align_up(end), migratetype);
Michal Nazarewicz041d3a82011-12-29 13:09:50 +01006262 return ret;
6263}
6264
6265void free_contig_range(unsigned long pfn, unsigned nr_pages)
6266{
Marek Szyprowskibcc2b022012-12-20 15:05:18 -08006267 unsigned int count = 0;
6268
6269 for (; nr_pages--; pfn++) {
6270 struct page *page = pfn_to_page(pfn);
6271
6272 count += page_count(page) != 1;
6273 __free_page(page);
6274 }
6275 WARN(count != 0, "%d pages are still in use!\n", count);
Michal Nazarewicz041d3a82011-12-29 13:09:50 +01006276}
6277#endif
6278
Jiang Liu4ed7e022012-07-31 16:43:35 -07006279#ifdef CONFIG_MEMORY_HOTPLUG
Cody P Schafer0a647f32013-07-03 15:01:33 -07006280/*
6281 * The zone indicated has a new number of managed_pages; batch sizes and percpu
6282 * page high values need to be recalulated.
6283 */
Jiang Liu4ed7e022012-07-31 16:43:35 -07006284void __meminit zone_pcp_update(struct zone *zone)
6285{
Cody P Schafer0a647f32013-07-03 15:01:33 -07006286 unsigned cpu;
Cody P Schaferc8e251f2013-07-03 15:01:29 -07006287 mutex_lock(&pcp_batch_high_lock);
Cody P Schafer0a647f32013-07-03 15:01:33 -07006288 for_each_possible_cpu(cpu)
Cody P Schafer169f6c12013-07-03 15:01:41 -07006289 pageset_set_high_and_batch(zone,
6290 per_cpu_ptr(zone->pageset, cpu));
Cody P Schaferc8e251f2013-07-03 15:01:29 -07006291 mutex_unlock(&pcp_batch_high_lock);
Jiang Liu4ed7e022012-07-31 16:43:35 -07006292}
6293#endif
6294
Jiang Liu340175b2012-07-31 16:43:32 -07006295void zone_pcp_reset(struct zone *zone)
6296{
6297 unsigned long flags;
Minchan Kim5a883812012-10-08 16:33:39 -07006298 int cpu;
6299 struct per_cpu_pageset *pset;
Jiang Liu340175b2012-07-31 16:43:32 -07006300
6301 /* avoid races with drain_pages() */
6302 local_irq_save(flags);
6303 if (zone->pageset != &boot_pageset) {
Minchan Kim5a883812012-10-08 16:33:39 -07006304 for_each_online_cpu(cpu) {
6305 pset = per_cpu_ptr(zone->pageset, cpu);
6306 drain_zonestat(zone, pset);
6307 }
Jiang Liu340175b2012-07-31 16:43:32 -07006308 free_percpu(zone->pageset);
6309 zone->pageset = &boot_pageset;
6310 }
6311 local_irq_restore(flags);
6312}
6313
Wen Congyang6dcd73d2012-12-11 16:01:01 -08006314#ifdef CONFIG_MEMORY_HOTREMOVE
KAMEZAWA Hiroyuki0c0e6192007-10-16 01:26:12 -07006315/*
6316 * All pages in the range must be isolated before calling this.
6317 */
6318void
6319__offline_isolated_pages(unsigned long start_pfn, unsigned long end_pfn)
6320{
6321 struct page *page;
6322 struct zone *zone;
6323 int order, i;
6324 unsigned long pfn;
6325 unsigned long flags;
6326 /* find the first valid pfn */
6327 for (pfn = start_pfn; pfn < end_pfn; pfn++)
6328 if (pfn_valid(pfn))
6329 break;
6330 if (pfn == end_pfn)
6331 return;
6332 zone = page_zone(pfn_to_page(pfn));
6333 spin_lock_irqsave(&zone->lock, flags);
6334 pfn = start_pfn;
6335 while (pfn < end_pfn) {
6336 if (!pfn_valid(pfn)) {
6337 pfn++;
6338 continue;
6339 }
6340 page = pfn_to_page(pfn);
Wen Congyangb023f462012-12-11 16:00:45 -08006341 /*
6342 * The HWPoisoned page may be not in buddy system, and
6343 * page_count() is not 0.
6344 */
6345 if (unlikely(!PageBuddy(page) && PageHWPoison(page))) {
6346 pfn++;
6347 SetPageReserved(page);
6348 continue;
6349 }
6350
KAMEZAWA Hiroyuki0c0e6192007-10-16 01:26:12 -07006351 BUG_ON(page_count(page));
6352 BUG_ON(!PageBuddy(page));
6353 order = page_order(page);
6354#ifdef CONFIG_DEBUG_VM
6355 printk(KERN_INFO "remove from free list %lx %d %lx\n",
6356 pfn, 1 << order, end_pfn);
6357#endif
6358 list_del(&page->lru);
6359 rmv_page_order(page);
6360 zone->free_area[order].nr_free--;
KAMEZAWA Hiroyuki0c0e6192007-10-16 01:26:12 -07006361 for (i = 0; i < (1 << order); i++)
6362 SetPageReserved((page+i));
6363 pfn += (1 << order);
6364 }
6365 spin_unlock_irqrestore(&zone->lock, flags);
6366}
6367#endif
Wu Fengguang8d22ba12009-12-16 12:19:58 +01006368
6369#ifdef CONFIG_MEMORY_FAILURE
6370bool is_free_buddy_page(struct page *page)
6371{
6372 struct zone *zone = page_zone(page);
6373 unsigned long pfn = page_to_pfn(page);
6374 unsigned long flags;
6375 int order;
6376
6377 spin_lock_irqsave(&zone->lock, flags);
6378 for (order = 0; order < MAX_ORDER; order++) {
6379 struct page *page_head = page - (pfn & ((1 << order) - 1));
6380
6381 if (PageBuddy(page_head) && page_order(page_head) >= order)
6382 break;
6383 }
6384 spin_unlock_irqrestore(&zone->lock, flags);
6385
6386 return order < MAX_ORDER;
6387}
6388#endif
Wu Fengguang718a3822010-03-10 15:20:43 -08006389
Andrew Morton51300ce2012-05-29 15:06:44 -07006390static const struct trace_print_flags pageflag_names[] = {
Wu Fengguang718a3822010-03-10 15:20:43 -08006391 {1UL << PG_locked, "locked" },
6392 {1UL << PG_error, "error" },
6393 {1UL << PG_referenced, "referenced" },
6394 {1UL << PG_uptodate, "uptodate" },
6395 {1UL << PG_dirty, "dirty" },
6396 {1UL << PG_lru, "lru" },
6397 {1UL << PG_active, "active" },
6398 {1UL << PG_slab, "slab" },
6399 {1UL << PG_owner_priv_1, "owner_priv_1" },
6400 {1UL << PG_arch_1, "arch_1" },
6401 {1UL << PG_reserved, "reserved" },
6402 {1UL << PG_private, "private" },
6403 {1UL << PG_private_2, "private_2" },
6404 {1UL << PG_writeback, "writeback" },
6405#ifdef CONFIG_PAGEFLAGS_EXTENDED
6406 {1UL << PG_head, "head" },
6407 {1UL << PG_tail, "tail" },
6408#else
6409 {1UL << PG_compound, "compound" },
6410#endif
6411 {1UL << PG_swapcache, "swapcache" },
6412 {1UL << PG_mappedtodisk, "mappedtodisk" },
6413 {1UL << PG_reclaim, "reclaim" },
Wu Fengguang718a3822010-03-10 15:20:43 -08006414 {1UL << PG_swapbacked, "swapbacked" },
6415 {1UL << PG_unevictable, "unevictable" },
6416#ifdef CONFIG_MMU
6417 {1UL << PG_mlocked, "mlocked" },
6418#endif
6419#ifdef CONFIG_ARCH_USES_PG_UNCACHED
6420 {1UL << PG_uncached, "uncached" },
6421#endif
6422#ifdef CONFIG_MEMORY_FAILURE
6423 {1UL << PG_hwpoison, "hwpoison" },
6424#endif
Gavin Shanbe9cd872012-05-29 15:06:44 -07006425#ifdef CONFIG_TRANSPARENT_HUGEPAGE
6426 {1UL << PG_compound_lock, "compound_lock" },
6427#endif
Wu Fengguang718a3822010-03-10 15:20:43 -08006428};
6429
6430static void dump_page_flags(unsigned long flags)
6431{
6432 const char *delim = "";
6433 unsigned long mask;
6434 int i;
6435
Andrew Morton51300ce2012-05-29 15:06:44 -07006436 BUILD_BUG_ON(ARRAY_SIZE(pageflag_names) != __NR_PAGEFLAGS);
Johannes Weineracc50c12012-05-29 15:06:44 -07006437
Wu Fengguang718a3822010-03-10 15:20:43 -08006438 printk(KERN_ALERT "page flags: %#lx(", flags);
6439
6440 /* remove zone id */
6441 flags &= (1UL << NR_PAGEFLAGS) - 1;
6442
Andrew Morton51300ce2012-05-29 15:06:44 -07006443 for (i = 0; i < ARRAY_SIZE(pageflag_names) && flags; i++) {
Wu Fengguang718a3822010-03-10 15:20:43 -08006444
6445 mask = pageflag_names[i].mask;
6446 if ((flags & mask) != mask)
6447 continue;
6448
6449 flags &= ~mask;
6450 printk("%s%s", delim, pageflag_names[i].name);
6451 delim = "|";
6452 }
6453
6454 /* check for left over flags */
6455 if (flags)
6456 printk("%s%#lx", delim, flags);
6457
6458 printk(")\n");
6459}
6460
6461void dump_page(struct page *page)
6462{
6463 printk(KERN_ALERT
6464 "page:%p count:%d mapcount:%d mapping:%p index:%#lx\n",
Andrea Arcangeli4e9f64c2011-01-13 15:46:29 -08006465 page, atomic_read(&page->_count), page_mapcount(page),
Wu Fengguang718a3822010-03-10 15:20:43 -08006466 page->mapping, page->index);
6467 dump_page_flags(page->flags);
Daisuke Nishimuraf212ad72011-03-23 16:42:25 -07006468 mem_cgroup_print_bad_page(page);
Wu Fengguang718a3822010-03-10 15:20:43 -08006469}