page_alloc.c 169.6 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
/*
 *  linux/mm/page_alloc.c
 *
 *  Manages the free list, the system allocates free pages here.
 *  Note that kmalloc() lives in slab.c
 *
 *  Copyright (C) 1991, 1992, 1993, 1994  Linus Torvalds
 *  Swap reorganised 29.12.95, Stephen Tweedie
 *  Support of BIGMEM added by Gerhard Wichert, Siemens AG, July 1999
 *  Reshaped it to be a zoned allocator, Ingo Molnar, Red Hat, 1999
 *  Discontiguous memory support, Kanoj Sarcar, SGI, Nov 1999
 *  Zone balancing, Kanoj Sarcar, SGI, Jan 2000
 *  Per cpu hot/cold page lists, bulk allocation, Martin J. Bligh, Sept 2002
 *          (lots of bits borrowed from Ingo Molnar & Andrew Morton)
 */

#include <linux/stddef.h>
#include <linux/mm.h>
#include <linux/swap.h>
#include <linux/interrupt.h>
#include <linux/pagemap.h>
22
#include <linux/jiffies.h>
L
Linus Torvalds 已提交
23
#include <linux/bootmem.h>
24
#include <linux/memblock.h>
L
Linus Torvalds 已提交
25
#include <linux/compiler.h>
26
#include <linux/kernel.h>
27
#include <linux/kmemcheck.h>
L
Linus Torvalds 已提交
28 29 30 31 32
#include <linux/module.h>
#include <linux/suspend.h>
#include <linux/pagevec.h>
#include <linux/blkdev.h>
#include <linux/slab.h>
33
#include <linux/ratelimit.h>
34
#include <linux/oom.h>
L
Linus Torvalds 已提交
35 36 37 38 39
#include <linux/notifier.h>
#include <linux/topology.h>
#include <linux/sysctl.h>
#include <linux/cpu.h>
#include <linux/cpuset.h>
40
#include <linux/memory_hotplug.h>
L
Linus Torvalds 已提交
41 42
#include <linux/nodemask.h>
#include <linux/vmalloc.h>
43
#include <linux/vmstat.h>
44
#include <linux/mempolicy.h>
45
#include <linux/stop_machine.h>
46 47
#include <linux/sort.h>
#include <linux/pfn.h>
48
#include <linux/backing-dev.h>
49
#include <linux/fault-inject.h>
K
KAMEZAWA Hiroyuki 已提交
50
#include <linux/page-isolation.h>
51
#include <linux/page_cgroup.h>
52
#include <linux/debugobjects.h>
53
#include <linux/kmemleak.h>
54
#include <linux/compaction.h>
55
#include <trace/events/kmem.h>
56
#include <linux/ftrace_event.h>
57
#include <linux/memcontrol.h>
58
#include <linux/prefetch.h>
59
#include <linux/migrate.h>
60
#include <linux/page-debug-flags.h>
L
Linus Torvalds 已提交
61 62

#include <asm/tlbflush.h>
63
#include <asm/div64.h>
L
Linus Torvalds 已提交
64 65
#include "internal.h"

66 67 68 69 70
#ifdef CONFIG_USE_PERCPU_NUMA_NODE_ID
DEFINE_PER_CPU(int, numa_node);
EXPORT_PER_CPU_SYMBOL(numa_node);
#endif

71 72 73 74 75 76 77 78 79 80 81
#ifdef CONFIG_HAVE_MEMORYLESS_NODES
/*
 * N.B., Do NOT reference the '_numa_mem_' per cpu variable directly.
 * It will not be defined when CONFIG_HAVE_MEMORYLESS_NODES is not defined.
 * Use the accessor functions set_numa_mem(), numa_mem_id() and cpu_to_mem()
 * defined in <linux/topology.h>.
 */
DEFINE_PER_CPU(int, _numa_mem_);		/* Kernel "local memory" node */
EXPORT_PER_CPU_SYMBOL(_numa_mem_);
#endif

L
Linus Torvalds 已提交
82
/*
83
 * Array of node states.
L
Linus Torvalds 已提交
84
 */
85 86 87 88 89 90 91
nodemask_t node_states[NR_NODE_STATES] __read_mostly = {
	[N_POSSIBLE] = NODE_MASK_ALL,
	[N_ONLINE] = { { [0] = 1UL } },
#ifndef CONFIG_NUMA
	[N_NORMAL_MEMORY] = { { [0] = 1UL } },
#ifdef CONFIG_HIGHMEM
	[N_HIGH_MEMORY] = { { [0] = 1UL } },
92 93 94
#endif
#ifdef CONFIG_MOVABLE_NODE
	[N_MEMORY] = { { [0] = 1UL } },
95 96 97 98 99 100
#endif
	[N_CPU] = { { [0] = 1UL } },
#endif	/* NUMA */
};
EXPORT_SYMBOL(node_states);

101
unsigned long totalram_pages __read_mostly;
102
unsigned long totalreserve_pages __read_mostly;
103 104 105 106 107 108 109 110
/*
 * When calculating the number of globally allowed dirty pages, there
 * is a certain number of per-zone reserves that should not be
 * considered dirtyable memory.  This is the sum of those reserves
 * over all existing zones that contribute dirtyable memory.
 */
unsigned long dirty_balance_reserve __read_mostly;

111
int percpu_pagelist_fraction;
112
gfp_t gfp_allowed_mask __read_mostly = GFP_BOOT_MASK;
L
Linus Torvalds 已提交
113

114 115 116 117 118 119 120 121 122
#ifdef CONFIG_PM_SLEEP
/*
 * The following functions are used by the suspend/hibernate code to temporarily
 * change gfp_allowed_mask in order to avoid using I/O during memory allocations
 * while devices are suspended.  To avoid races with the suspend/hibernate code,
 * they should always be called with pm_mutex held (gfp_allowed_mask also should
 * only be modified with pm_mutex held, unless the suspend/hibernate code is
 * guaranteed not to run in parallel with that modification).
 */
123 124 125 126

static gfp_t saved_gfp_mask;

void pm_restore_gfp_mask(void)
127 128
{
	WARN_ON(!mutex_is_locked(&pm_mutex));
129 130 131 132
	if (saved_gfp_mask) {
		gfp_allowed_mask = saved_gfp_mask;
		saved_gfp_mask = 0;
	}
133 134
}

135
void pm_restrict_gfp_mask(void)
136 137
{
	WARN_ON(!mutex_is_locked(&pm_mutex));
138 139 140
	WARN_ON(saved_gfp_mask);
	saved_gfp_mask = gfp_allowed_mask;
	gfp_allowed_mask &= ~GFP_IOFS;
141
}
142 143 144 145 146 147 148

bool pm_suspended_storage(void)
{
	if ((gfp_allowed_mask & GFP_IOFS) == GFP_IOFS)
		return false;
	return true;
}
149 150
#endif /* CONFIG_PM_SLEEP */

151 152 153 154
#ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
int pageblock_order __read_mostly;
#endif

155
static void __free_pages_ok(struct page *page, unsigned int order);
156

L
Linus Torvalds 已提交
157 158 159 160 161 162 163
/*
 * results with 256, 32 in the lowmem_reserve sysctl:
 *	1G machine -> (16M dma, 800M-16M normal, 1G-800M high)
 *	1G machine -> (16M dma, 784M normal, 224M high)
 *	NORMAL allocation will leave 784M/256 of ram reserved in the ZONE_DMA
 *	HIGHMEM allocation will leave 224M/32 of ram reserved in ZONE_NORMAL
 *	HIGHMEM allocation will (224M+784M)/256 of ram reserved in ZONE_DMA
A
Andi Kleen 已提交
164 165 166
 *
 * TBD: should special case ZONE_DMA32 machines here - in those we normally
 * don't need any ZONE_NORMAL reservation
L
Linus Torvalds 已提交
167
 */
168
int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES-1] = {
169
#ifdef CONFIG_ZONE_DMA
170
	 256,
171
#endif
172
#ifdef CONFIG_ZONE_DMA32
173
	 256,
174
#endif
175
#ifdef CONFIG_HIGHMEM
M
Mel Gorman 已提交
176
	 32,
177
#endif
M
Mel Gorman 已提交
178
	 32,
179
};
L
Linus Torvalds 已提交
180 181 182

EXPORT_SYMBOL(totalram_pages);

183
static char * const zone_names[MAX_NR_ZONES] = {
184
#ifdef CONFIG_ZONE_DMA
185
	 "DMA",
186
#endif
187
#ifdef CONFIG_ZONE_DMA32
188
	 "DMA32",
189
#endif
190
	 "Normal",
191
#ifdef CONFIG_HIGHMEM
M
Mel Gorman 已提交
192
	 "HighMem",
193
#endif
M
Mel Gorman 已提交
194
	 "Movable",
195 196
};

L
Linus Torvalds 已提交
197 198
int min_free_kbytes = 1024;

199 200
static unsigned long __meminitdata nr_kernel_pages;
static unsigned long __meminitdata nr_all_pages;
201
static unsigned long __meminitdata dma_reserve;
L
Linus Torvalds 已提交
202

T
Tejun Heo 已提交
203 204 205 206 207 208 209 210 211 212 213
#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
static unsigned long __meminitdata arch_zone_lowest_possible_pfn[MAX_NR_ZONES];
static unsigned long __meminitdata arch_zone_highest_possible_pfn[MAX_NR_ZONES];
static unsigned long __initdata required_kernelcore;
static unsigned long __initdata required_movablecore;
static unsigned long __meminitdata zone_movable_pfn[MAX_NUMNODES];

/* movable_zone is the "real" zone pages in ZONE_MOVABLE are taken from */
int movable_zone;
EXPORT_SYMBOL(movable_zone);
#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
214

M
Miklos Szeredi 已提交
215 216
#if MAX_NUMNODES > 1
int nr_node_ids __read_mostly = MAX_NUMNODES;
217
int nr_online_nodes __read_mostly = 1;
M
Miklos Szeredi 已提交
218
EXPORT_SYMBOL(nr_node_ids);
219
EXPORT_SYMBOL(nr_online_nodes);
M
Miklos Szeredi 已提交
220 221
#endif

222 223
int page_group_by_mobility_disabled __read_mostly;

224 225 226 227 228
/*
 * NOTE:
 * Don't use set_pageblock_migratetype(page, MIGRATE_ISOLATE) directly.
 * Instead, use {un}set_pageblock_isolate.
 */
229
void set_pageblock_migratetype(struct page *page, int migratetype)
230
{
231 232 233 234

	if (unlikely(page_group_by_mobility_disabled))
		migratetype = MIGRATE_UNMOVABLE;

235 236 237 238
	set_pageblock_flags_group(page, (unsigned long)migratetype,
					PB_migrate, PB_migrate_end);
}

239 240
bool oom_killer_disabled __read_mostly;

N
Nick Piggin 已提交
241
#ifdef CONFIG_DEBUG_VM
242
static int page_outside_zone_boundaries(struct zone *zone, struct page *page)
L
Linus Torvalds 已提交
243
{
244 245 246
	int ret = 0;
	unsigned seq;
	unsigned long pfn = page_to_pfn(page);
247

248 249 250 251 252 253 254 255 256
	do {
		seq = zone_span_seqbegin(zone);
		if (pfn >= zone->zone_start_pfn + zone->spanned_pages)
			ret = 1;
		else if (pfn < zone->zone_start_pfn)
			ret = 1;
	} while (zone_span_seqretry(zone, seq));

	return ret;
257 258 259 260
}

static int page_is_consistent(struct zone *zone, struct page *page)
{
261
	if (!pfn_valid_within(page_to_pfn(page)))
262
		return 0;
L
Linus Torvalds 已提交
263
	if (zone != page_zone(page))
264 265 266 267 268 269 270 271 272 273
		return 0;

	return 1;
}
/*
 * Temporary debugging check for pages not lying within a given zone.
 */
static int bad_range(struct zone *zone, struct page *page)
{
	if (page_outside_zone_boundaries(zone, page))
L
Linus Torvalds 已提交
274
		return 1;
275 276 277
	if (!page_is_consistent(zone, page))
		return 1;

L
Linus Torvalds 已提交
278 279
	return 0;
}
N
Nick Piggin 已提交
280 281 282 283 284 285 286
#else
static inline int bad_range(struct zone *zone, struct page *page)
{
	return 0;
}
#endif

N
Nick Piggin 已提交
287
static void bad_page(struct page *page)
L
Linus Torvalds 已提交
288
{
289 290 291 292
	static unsigned long resume;
	static unsigned long nr_shown;
	static unsigned long nr_unshown;

293 294
	/* Don't complain about poisoned pages */
	if (PageHWPoison(page)) {
295
		reset_page_mapcount(page); /* remove PageBuddy */
296 297 298
		return;
	}

299 300 301 302 303 304 305 306 307 308
	/*
	 * Allow a burst of 60 reports, then keep quiet for that minute;
	 * or allow a steady drip of one report per second.
	 */
	if (nr_shown == 60) {
		if (time_before(jiffies, resume)) {
			nr_unshown++;
			goto out;
		}
		if (nr_unshown) {
309 310
			printk(KERN_ALERT
			      "BUG: Bad page state: %lu messages suppressed\n",
311 312 313 314 315 316 317 318
				nr_unshown);
			nr_unshown = 0;
		}
		nr_shown = 0;
	}
	if (nr_shown++ == 0)
		resume = jiffies + 60 * HZ;

319
	printk(KERN_ALERT "BUG: Bad page state in process %s  pfn:%05lx\n",
320
		current->comm, page_to_pfn(page));
321
	dump_page(page);
322

323
	print_modules();
L
Linus Torvalds 已提交
324
	dump_stack();
325
out:
326
	/* Leave bad fields for debug, except PageBuddy could make trouble */
327
	reset_page_mapcount(page); /* remove PageBuddy */
328
	add_taint(TAINT_BAD_PAGE);
L
Linus Torvalds 已提交
329 330 331 332 333 334 335 336 337
}

/*
 * Higher-order pages are called "compound pages".  They are structured thusly:
 *
 * The first PAGE_SIZE page is called the "head page".
 *
 * The remaining PAGE_SIZE pages are called "tail pages".
 *
338 339
 * All pages have PG_compound set.  All tail pages have their ->first_page
 * pointing at the head page.
L
Linus Torvalds 已提交
340
 *
341 342 343
 * The first tail page's ->lru.next holds the address of the compound page's
 * put_page() function.  Its ->lru.prev holds the order of allocation.
 * This usage means that zero-order pages may not be compound.
L
Linus Torvalds 已提交
344
 */
345 346 347

static void free_compound_page(struct page *page)
{
348
	__free_pages_ok(page, compound_order(page));
349 350
}

A
Andi Kleen 已提交
351
void prep_compound_page(struct page *page, unsigned long order)
352 353 354 355 356 357 358 359 360 361
{
	int i;
	int nr_pages = 1 << order;

	set_compound_page_dtor(page, free_compound_page);
	set_compound_order(page, order);
	__SetPageHead(page);
	for (i = 1; i < nr_pages; i++) {
		struct page *p = page + i;
		__SetPageTail(p);
362
		set_page_count(p, 0);
363 364 365 366
		p->first_page = page;
	}
}

367
/* update __split_huge_page_refcount if you change this function */
368
static int destroy_compound_page(struct page *page, unsigned long order)
L
Linus Torvalds 已提交
369 370 371
{
	int i;
	int nr_pages = 1 << order;
372
	int bad = 0;
L
Linus Torvalds 已提交
373

374 375
	if (unlikely(compound_order(page) != order) ||
	    unlikely(!PageHead(page))) {
N
Nick Piggin 已提交
376
		bad_page(page);
377 378
		bad++;
	}
L
Linus Torvalds 已提交
379

380
	__ClearPageHead(page);
381

382 383
	for (i = 1; i < nr_pages; i++) {
		struct page *p = page + i;
L
Linus Torvalds 已提交
384

385
		if (unlikely(!PageTail(p) || (p->first_page != page))) {
N
Nick Piggin 已提交
386
			bad_page(page);
387 388
			bad++;
		}
389
		__ClearPageTail(p);
L
Linus Torvalds 已提交
390
	}
391 392

	return bad;
L
Linus Torvalds 已提交
393 394
}

N
Nick Piggin 已提交
395 396 397 398
static inline void prep_zero_page(struct page *page, int order, gfp_t gfp_flags)
{
	int i;

399 400 401 402
	/*
	 * clear_highpage() will use KM_USER0, so it's a bug to use __GFP_ZERO
	 * and __GFP_HIGHMEM from hard or soft interrupt context.
	 */
N
Nick Piggin 已提交
403
	VM_BUG_ON((gfp_flags & __GFP_HIGHMEM) && in_interrupt());
N
Nick Piggin 已提交
404 405 406 407
	for (i = 0; i < (1 << order); i++)
		clear_highpage(page + i);
}

408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438
#ifdef CONFIG_DEBUG_PAGEALLOC
unsigned int _debug_guardpage_minorder;

static int __init debug_guardpage_minorder_setup(char *buf)
{
	unsigned long res;

	if (kstrtoul(buf, 10, &res) < 0 ||  res > MAX_ORDER / 2) {
		printk(KERN_ERR "Bad debug_guardpage_minorder value\n");
		return 0;
	}
	_debug_guardpage_minorder = res;
	printk(KERN_INFO "Setting debug_guardpage_minorder to %lu\n", res);
	return 0;
}
__setup("debug_guardpage_minorder=", debug_guardpage_minorder_setup);

static inline void set_page_guard_flag(struct page *page)
{
	__set_bit(PAGE_DEBUG_FLAG_GUARD, &page->debug_flags);
}

static inline void clear_page_guard_flag(struct page *page)
{
	__clear_bit(PAGE_DEBUG_FLAG_GUARD, &page->debug_flags);
}
#else
static inline void set_page_guard_flag(struct page *page) { }
static inline void clear_page_guard_flag(struct page *page) { }
#endif

439 440
static inline void set_page_order(struct page *page, int order)
{
H
Hugh Dickins 已提交
441
	set_page_private(page, order);
442
	__SetPageBuddy(page);
L
Linus Torvalds 已提交
443 444 445 446
}

static inline void rmv_page_order(struct page *page)
{
447
	__ClearPageBuddy(page);
H
Hugh Dickins 已提交
448
	set_page_private(page, 0);
L
Linus Torvalds 已提交
449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465
}

/*
 * Locate the struct page for both the matching buddy in our
 * pair (buddy1) and the combined O(n+1) page they form (page).
 *
 * 1) Any buddy B1 will have an order O twin B2 which satisfies
 * the following equation:
 *     B2 = B1 ^ (1 << O)
 * For example, if the starting buddy (buddy2) is #8 its order
 * 1 buddy is #10:
 *     B2 = 8 ^ (1 << 1) = 8 ^ 2 = 10
 *
 * 2) Any buddy B will have an order O+1 parent P which
 * satisfies the following equation:
 *     P = B & ~(1 << O)
 *
A
Andreas Mohr 已提交
466
 * Assumption: *_mem_map is contiguous at least up to MAX_ORDER
L
Linus Torvalds 已提交
467 468
 */
static inline unsigned long
469
__find_buddy_index(unsigned long page_idx, unsigned int order)
L
Linus Torvalds 已提交
470
{
471
	return page_idx ^ (1 << order);
L
Linus Torvalds 已提交
472 473 474 475 476
}

/*
 * This function checks whether a page is free && is the buddy
 * we can do coalesce a page and its buddy if
N
Nick Piggin 已提交
477
 * (a) the buddy is not in a hole &&
478
 * (b) the buddy is in the buddy system &&
479 480
 * (c) a page and its buddy have the same order &&
 * (d) a page and its buddy are in the same zone.
481
 *
A
Andrea Arcangeli 已提交
482 483
 * For recording whether a page is in the buddy system, we set ->_mapcount -2.
 * Setting, clearing, and testing _mapcount -2 is serialized by zone->lock.
L
Linus Torvalds 已提交
484
 *
485
 * For recording page's order, we use page_private(page).
L
Linus Torvalds 已提交
486
 */
487 488
static inline int page_is_buddy(struct page *page, struct page *buddy,
								int order)
L
Linus Torvalds 已提交
489
{
490
	if (!pfn_valid_within(page_to_pfn(buddy)))
N
Nick Piggin 已提交
491 492
		return 0;

493 494 495
	if (page_zone_id(page) != page_zone_id(buddy))
		return 0;

496 497 498 499 500
	if (page_is_guard(buddy) && page_order(buddy) == order) {
		VM_BUG_ON(page_count(buddy) != 0);
		return 1;
	}

501
	if (PageBuddy(buddy) && page_order(buddy) == order) {
502
		VM_BUG_ON(page_count(buddy) != 0);
503
		return 1;
504
	}
505
	return 0;
L
Linus Torvalds 已提交
506 507 508 509 510 511 512 513 514 515 516 517 518 519 520
}

/*
 * Freeing function for a buddy system allocator.
 *
 * The concept of a buddy system is to maintain direct-mapped table
 * (containing bit values) for memory blocks of various "orders".
 * The bottom level table contains the map for the smallest allocatable
 * units of memory (here, pages), and each level above it describes
 * pairs of units from the levels below, hence, "buddies".
 * At a high level, all that happens here is marking the table entry
 * at the bottom level available, and propagating the changes upward
 * as necessary, plus some accounting needed to play nicely with other
 * parts of the VM system.
 * At each level, we keep a list of pages, which are heads of continuous
A
Andrea Arcangeli 已提交
521
 * free pages of length of (1 << order) and marked with _mapcount -2. Page's
H
Hugh Dickins 已提交
522
 * order is recorded in page_private(page) field.
L
Linus Torvalds 已提交
523
 * So when we are allocating or freeing one, we can derive the state of the
524 525
 * other.  That is, if we allocate a small block, and both were
 * free, the remainder of the region must be split into blocks.
L
Linus Torvalds 已提交
526
 * If a block is freed, and its buddy is also free, then this
527
 * triggers coalescing into a block of larger size.
L
Linus Torvalds 已提交
528
 *
529
 * -- nyc
L
Linus Torvalds 已提交
530 531
 */

N
Nick Piggin 已提交
532
static inline void __free_one_page(struct page *page,
533 534
		struct zone *zone, unsigned int order,
		int migratetype)
L
Linus Torvalds 已提交
535 536
{
	unsigned long page_idx;
537
	unsigned long combined_idx;
538
	unsigned long uninitialized_var(buddy_idx);
539
	struct page *buddy;
L
Linus Torvalds 已提交
540

N
Nick Piggin 已提交
541
	if (unlikely(PageCompound(page)))
542 543
		if (unlikely(destroy_compound_page(page, order)))
			return;
L
Linus Torvalds 已提交
544

545 546
	VM_BUG_ON(migratetype == -1);

L
Linus Torvalds 已提交
547 548
	page_idx = page_to_pfn(page) & ((1 << MAX_ORDER) - 1);

549
	VM_BUG_ON(page_idx & ((1 << order) - 1));
N
Nick Piggin 已提交
550
	VM_BUG_ON(bad_range(zone, page));
L
Linus Torvalds 已提交
551 552

	while (order < MAX_ORDER-1) {
553 554
		buddy_idx = __find_buddy_index(page_idx, order);
		buddy = page + (buddy_idx - page_idx);
555
		if (!page_is_buddy(page, buddy, order))
556
			break;
557 558 559 560 561 562 563
		/*
		 * Our buddy is free or it is CONFIG_DEBUG_PAGEALLOC guard page,
		 * merge with it and move up one order.
		 */
		if (page_is_guard(buddy)) {
			clear_page_guard_flag(buddy);
			set_page_private(page, 0);
564 565
			__mod_zone_freepage_state(zone, 1 << order,
						  migratetype);
566 567 568 569 570
		} else {
			list_del(&buddy->lru);
			zone->free_area[order].nr_free--;
			rmv_page_order(buddy);
		}
571
		combined_idx = buddy_idx & page_idx;
L
Linus Torvalds 已提交
572 573 574 575 576
		page = page + (combined_idx - page_idx);
		page_idx = combined_idx;
		order++;
	}
	set_page_order(page, order);
577 578 579 580 581 582 583 584 585

	/*
	 * If this is not the largest possible page, check if the buddy
	 * of the next-highest order is free. If it is, it's possible
	 * that pages are being freed that will coalesce soon. In case,
	 * that is happening, add the free page to the tail of the list
	 * so it's less likely to be used soon and more likely to be merged
	 * as a higher order page
	 */
586
	if ((order < MAX_ORDER-2) && pfn_valid_within(page_to_pfn(buddy))) {
587
		struct page *higher_page, *higher_buddy;
588 589 590
		combined_idx = buddy_idx & page_idx;
		higher_page = page + (combined_idx - page_idx);
		buddy_idx = __find_buddy_index(combined_idx, order + 1);
591
		higher_buddy = higher_page + (buddy_idx - combined_idx);
592 593 594 595 596 597 598 599 600
		if (page_is_buddy(higher_page, higher_buddy, order + 1)) {
			list_add_tail(&page->lru,
				&zone->free_area[order].free_list[migratetype]);
			goto out;
		}
	}

	list_add(&page->lru, &zone->free_area[order].free_list[migratetype]);
out:
L
Linus Torvalds 已提交
601 602 603
	zone->free_area[order].nr_free++;
}

N
Nick Piggin 已提交
604
static inline int free_pages_check(struct page *page)
L
Linus Torvalds 已提交
605
{
N
Nick Piggin 已提交
606 607
	if (unlikely(page_mapcount(page) |
		(page->mapping != NULL)  |
608
		(atomic_read(&page->_count) != 0) |
609 610
		(page->flags & PAGE_FLAGS_CHECK_AT_FREE) |
		(mem_cgroup_bad_page_check(page)))) {
N
Nick Piggin 已提交
611
		bad_page(page);
612
		return 1;
613
	}
614
	reset_page_last_nid(page);
615 616 617
	if (page->flags & PAGE_FLAGS_CHECK_AT_PREP)
		page->flags &= ~PAGE_FLAGS_CHECK_AT_PREP;
	return 0;
L
Linus Torvalds 已提交
618 619 620
}

/*
621
 * Frees a number of pages from the PCP lists
L
Linus Torvalds 已提交
622
 * Assumes all pages on list are in same zone, and of same order.
623
 * count is the number of pages to free.
L
Linus Torvalds 已提交
624 625 626 627 628 629 630
 *
 * If the zone was previously in an "all pages pinned" state then look to
 * see if this freeing clears that state.
 *
 * And clear the zone's pages_scanned counter, to hold off the "all pages are
 * pinned" detection logic.
 */
631 632
static void free_pcppages_bulk(struct zone *zone, int count,
					struct per_cpu_pages *pcp)
L
Linus Torvalds 已提交
633
{
634
	int migratetype = 0;
635
	int batch_free = 0;
636
	int to_free = count;
637

N
Nick Piggin 已提交
638
	spin_lock(&zone->lock);
639
	zone->all_unreclaimable = 0;
L
Linus Torvalds 已提交
640
	zone->pages_scanned = 0;
641

642
	while (to_free) {
N
Nick Piggin 已提交
643
		struct page *page;
644 645 646
		struct list_head *list;

		/*
647 648 649 650 651
		 * Remove pages from lists in a round-robin fashion. A
		 * batch_free count is maintained that is incremented when an
		 * empty list is encountered.  This is so more pages are freed
		 * off fuller lists instead of spinning excessively around empty
		 * lists
652 653
		 */
		do {
654
			batch_free++;
655 656 657 658
			if (++migratetype == MIGRATE_PCPTYPES)
				migratetype = 0;
			list = &pcp->lists[migratetype];
		} while (list_empty(list));
N
Nick Piggin 已提交
659

660 661 662 663
		/* This is the only non-empty list. Free them all. */
		if (batch_free == MIGRATE_PCPTYPES)
			batch_free = to_free;

664
		do {
665 666
			int mt;	/* migratetype of the to-be-freed page */

667 668 669
			page = list_entry(list->prev, struct page, lru);
			/* must delete as __free_one_page list manipulates */
			list_del(&page->lru);
670
			mt = get_freepage_migratetype(page);
671
			/* MIGRATE_MOVABLE list may include MIGRATE_RESERVEs */
672 673
			__free_one_page(page, zone, 0, mt);
			trace_mm_page_pcpu_drain(page, 0, mt);
674 675 676 677 678
			if (likely(get_pageblock_migratetype(page) != MIGRATE_ISOLATE)) {
				__mod_zone_page_state(zone, NR_FREE_PAGES, 1);
				if (is_migrate_cma(mt))
					__mod_zone_page_state(zone, NR_FREE_CMA_PAGES, 1);
			}
679
		} while (--to_free && --batch_free && !list_empty(list));
L
Linus Torvalds 已提交
680
	}
N
Nick Piggin 已提交
681
	spin_unlock(&zone->lock);
L
Linus Torvalds 已提交
682 683
}

684 685
static void free_one_page(struct zone *zone, struct page *page, int order,
				int migratetype)
L
Linus Torvalds 已提交
686
{
687
	spin_lock(&zone->lock);
688
	zone->all_unreclaimable = 0;
689
	zone->pages_scanned = 0;
690

691
	__free_one_page(page, zone, order, migratetype);
692
	if (unlikely(migratetype != MIGRATE_ISOLATE))
693
		__mod_zone_freepage_state(zone, 1 << order, migratetype);
694
	spin_unlock(&zone->lock);
N
Nick Piggin 已提交
695 696
}

697
static bool free_pages_prepare(struct page *page, unsigned int order)
N
Nick Piggin 已提交
698
{
L
Linus Torvalds 已提交
699
	int i;
700
	int bad = 0;
L
Linus Torvalds 已提交
701

702
	trace_mm_page_free(page, order);
703 704
	kmemcheck_free_shadow(page, order);

A
Andrea Arcangeli 已提交
705 706 707 708
	if (PageAnon(page))
		page->mapping = NULL;
	for (i = 0; i < (1 << order); i++)
		bad += free_pages_check(page + i);
709
	if (bad)
710
		return false;
711

712
	if (!PageHighMem(page)) {
N
Nick Piggin 已提交
713
		debug_check_no_locks_freed(page_address(page),PAGE_SIZE<<order);
714 715 716
		debug_check_no_obj_freed(page_address(page),
					   PAGE_SIZE << order);
	}
N
Nick Piggin 已提交
717
	arch_free_page(page, order);
N
Nick Piggin 已提交
718
	kernel_map_pages(page, 1 << order, 0);
N
Nick Piggin 已提交
719

720 721 722 723 724 725
	return true;
}

static void __free_pages_ok(struct page *page, unsigned int order)
{
	unsigned long flags;
M
Minchan Kim 已提交
726
	int migratetype;
727 728 729 730

	if (!free_pages_prepare(page, order))
		return;

N
Nick Piggin 已提交
731
	local_irq_save(flags);
732
	__count_vm_events(PGFREE, 1 << order);
M
Minchan Kim 已提交
733 734 735
	migratetype = get_pageblock_migratetype(page);
	set_freepage_migratetype(page, migratetype);
	free_one_page(page_zone(page), page, order, migratetype);
N
Nick Piggin 已提交
736
	local_irq_restore(flags);
L
Linus Torvalds 已提交
737 738
}

739 740 741 742 743 744 745
/*
 * Read access to zone->managed_pages is safe because it's unsigned long,
 * but we still need to serialize writers. Currently all callers of
 * __free_pages_bootmem() except put_page_bootmem() should only be used
 * at boot time. So for shorter boot time, we shift the burden to
 * put_page_bootmem() to serialize writers.
 */
746
void __meminit __free_pages_bootmem(struct page *page, unsigned int order)
747
{
748 749
	unsigned int nr_pages = 1 << order;
	unsigned int loop;
750

751 752 753 754 755 756 757 758
	prefetchw(page);
	for (loop = 0; loop < nr_pages; loop++) {
		struct page *p = &page[loop];

		if (loop + 1 < nr_pages)
			prefetchw(p + 1);
		__ClearPageReserved(p);
		set_page_count(p, 0);
759
	}
760

761
	page_zone(page)->managed_pages += 1 << order;
762 763
	set_page_refcounted(page);
	__free_pages(page, order);
764 765
}

766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783
#ifdef CONFIG_CMA
/* Free whole pageblock and set it's migration type to MIGRATE_CMA. */
void __init init_cma_reserved_pageblock(struct page *page)
{
	unsigned i = pageblock_nr_pages;
	struct page *p = page;

	do {
		__ClearPageReserved(p);
		set_page_count(p, 0);
	} while (++p, --i);

	set_page_refcounted(page);
	set_pageblock_migratetype(page, MIGRATE_CMA);
	__free_pages(page, pageblock_order);
	totalram_pages += pageblock_nr_pages;
}
#endif
L
Linus Torvalds 已提交
784 785 786 787 788 789 790 791 792 793 794 795 796

/*
 * The order of subdivision here is critical for the IO subsystem.
 * Please do not alter this order without good reasons and regression
 * testing. Specifically, as large blocks of memory are subdivided,
 * the order in which smaller blocks are delivered depends on the order
 * they're subdivided in this function. This is the primary factor
 * influencing the order in which pages are delivered to the IO
 * subsystem according to empirical testing, and this is also justified
 * by considering the behavior of a buddy system containing a single
 * large block of memory acted on by a series of small allocations.
 * This behavior is a critical factor in sglist merging's success.
 *
797
 * -- nyc
L
Linus Torvalds 已提交
798
 */
N
Nick Piggin 已提交
799
static inline void expand(struct zone *zone, struct page *page,
800 801
	int low, int high, struct free_area *area,
	int migratetype)
L
Linus Torvalds 已提交
802 803 804 805 806 807 808
{
	unsigned long size = 1 << high;

	while (high > low) {
		area--;
		high--;
		size >>= 1;
N
Nick Piggin 已提交
809
		VM_BUG_ON(bad_range(zone, &page[size]));
810 811 812 813 814 815 816 817 818 819 820 821 822

#ifdef CONFIG_DEBUG_PAGEALLOC
		if (high < debug_guardpage_minorder()) {
			/*
			 * Mark as guard pages (or page), that will allow to
			 * merge back to allocator when buddy will be freed.
			 * Corresponding page table entries will not be touched,
			 * pages will stay not present in virtual address space
			 */
			INIT_LIST_HEAD(&page[size].lru);
			set_page_guard_flag(&page[size]);
			set_page_private(&page[size], high);
			/* Guard pages are not available for any usage */
823 824
			__mod_zone_freepage_state(zone, -(1 << high),
						  migratetype);
825 826 827
			continue;
		}
#endif
828
		list_add(&page[size].lru, &area->free_list[migratetype]);
L
Linus Torvalds 已提交
829 830 831 832 833 834 835 836
		area->nr_free++;
		set_page_order(&page[size], high);
	}
}

/*
 * This page is about to be returned from the page allocator
 */
837
static inline int check_new_page(struct page *page)
L
Linus Torvalds 已提交
838
{
N
Nick Piggin 已提交
839 840
	if (unlikely(page_mapcount(page) |
		(page->mapping != NULL)  |
841
		(atomic_read(&page->_count) != 0)  |
842 843
		(page->flags & PAGE_FLAGS_CHECK_AT_PREP) |
		(mem_cgroup_bad_page_check(page)))) {
N
Nick Piggin 已提交
844
		bad_page(page);
845
		return 1;
846
	}
847 848 849 850 851 852 853 854 855 856 857 858
	return 0;
}

static int prep_new_page(struct page *page, int order, gfp_t gfp_flags)
{
	int i;

	for (i = 0; i < (1 << order); i++) {
		struct page *p = page + i;
		if (unlikely(check_new_page(p)))
			return 1;
	}
859

H
Hugh Dickins 已提交
860
	set_page_private(page, 0);
861
	set_page_refcounted(page);
N
Nick Piggin 已提交
862 863

	arch_alloc_page(page, order);
L
Linus Torvalds 已提交
864
	kernel_map_pages(page, 1 << order, 1);
N
Nick Piggin 已提交
865 866 867 868 869 870 871

	if (gfp_flags & __GFP_ZERO)
		prep_zero_page(page, order, gfp_flags);

	if (order && (gfp_flags & __GFP_COMP))
		prep_compound_page(page, order);

872
	return 0;
L
Linus Torvalds 已提交
873 874
}

875 876 877 878
/*
 * Go through the free lists for the given migratetype and remove
 * the smallest available page from the freelists
 */
879 880
static inline
struct page *__rmqueue_smallest(struct zone *zone, unsigned int order,
881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905
						int migratetype)
{
	unsigned int current_order;
	struct free_area * area;
	struct page *page;

	/* Find a page of the appropriate size in the preferred list */
	for (current_order = order; current_order < MAX_ORDER; ++current_order) {
		area = &(zone->free_area[current_order]);
		if (list_empty(&area->free_list[migratetype]))
			continue;

		page = list_entry(area->free_list[migratetype].next,
							struct page, lru);
		list_del(&page->lru);
		rmv_page_order(page);
		area->nr_free--;
		expand(zone, page, order, current_order, area, migratetype);
		return page;
	}

	return NULL;
}


906 907 908 909
/*
 * This array describes the order lists are fallen back to when
 * the free lists for the desirable migrate type are depleted
 */
910 911 912 913 914 915 916 917 918
static int fallbacks[MIGRATE_TYPES][4] = {
	[MIGRATE_UNMOVABLE]   = { MIGRATE_RECLAIMABLE, MIGRATE_MOVABLE,     MIGRATE_RESERVE },
	[MIGRATE_RECLAIMABLE] = { MIGRATE_UNMOVABLE,   MIGRATE_MOVABLE,     MIGRATE_RESERVE },
#ifdef CONFIG_CMA
	[MIGRATE_MOVABLE]     = { MIGRATE_CMA,         MIGRATE_RECLAIMABLE, MIGRATE_UNMOVABLE, MIGRATE_RESERVE },
	[MIGRATE_CMA]         = { MIGRATE_RESERVE }, /* Never used */
#else
	[MIGRATE_MOVABLE]     = { MIGRATE_RECLAIMABLE, MIGRATE_UNMOVABLE,   MIGRATE_RESERVE },
#endif
919 920
	[MIGRATE_RESERVE]     = { MIGRATE_RESERVE }, /* Never used */
	[MIGRATE_ISOLATE]     = { MIGRATE_RESERVE }, /* Never used */
921 922
};

923 924
/*
 * Move the free pages in a range to the free lists of the requested type.
925
 * Note that start_page and end_pages are not aligned on a pageblock
926 927
 * boundary. If alignment is required, use move_freepages_block()
 */
928
int move_freepages(struct zone *zone,
A
Adrian Bunk 已提交
929 930
			  struct page *start_page, struct page *end_page,
			  int migratetype)
931 932 933
{
	struct page *page;
	unsigned long order;
934
	int pages_moved = 0;
935 936 937 938 939 940 941

#ifndef CONFIG_HOLES_IN_ZONE
	/*
	 * page_zone is not safe to call in this context when
	 * CONFIG_HOLES_IN_ZONE is set. This bug check is probably redundant
	 * anyway as we check zone boundaries in move_freepages_block().
	 * Remove at a later date when no bug reports exist related to
M
Mel Gorman 已提交
942
	 * grouping pages by mobility
943 944 945 946 947
	 */
	BUG_ON(page_zone(start_page) != page_zone(end_page));
#endif

	for (page = start_page; page <= end_page;) {
948 949 950
		/* Make sure we are not inadvertently changing nodes */
		VM_BUG_ON(page_to_nid(page) != zone_to_nid(zone));

951 952 953 954 955 956 957 958 959 960 961
		if (!pfn_valid_within(page_to_pfn(page))) {
			page++;
			continue;
		}

		if (!PageBuddy(page)) {
			page++;
			continue;
		}

		order = page_order(page);
962 963
		list_move(&page->lru,
			  &zone->free_area[order].free_list[migratetype]);
M
Minchan Kim 已提交
964
		set_freepage_migratetype(page, migratetype);
965
		page += 1 << order;
966
		pages_moved += 1 << order;
967 968
	}

969
	return pages_moved;
970 971
}

972
int move_freepages_block(struct zone *zone, struct page *page,
973
				int migratetype)
974 975 976 977 978
{
	unsigned long start_pfn, end_pfn;
	struct page *start_page, *end_page;

	start_pfn = page_to_pfn(page);
979
	start_pfn = start_pfn & ~(pageblock_nr_pages-1);
980
	start_page = pfn_to_page(start_pfn);
981 982
	end_page = start_page + pageblock_nr_pages - 1;
	end_pfn = start_pfn + pageblock_nr_pages - 1;
983 984 985 986 987 988 989 990 991 992

	/* Do not cross zone boundaries */
	if (start_pfn < zone->zone_start_pfn)
		start_page = page;
	if (end_pfn >= zone->zone_start_pfn + zone->spanned_pages)
		return 0;

	return move_freepages(zone, start_page, end_page, migratetype);
}

993 994 995 996 997 998 999 1000 1001 1002 1003
static void change_pageblock_range(struct page *pageblock_page,
					int start_order, int migratetype)
{
	int nr_pageblocks = 1 << (start_order - pageblock_order);

	while (nr_pageblocks--) {
		set_pageblock_migratetype(pageblock_page, migratetype);
		pageblock_page += pageblock_nr_pages;
	}
}

1004
/* Remove an element from the buddy allocator from the fallback list */
1005 1006
static inline struct page *
__rmqueue_fallback(struct zone *zone, int order, int start_migratetype)
1007 1008 1009 1010 1011 1012 1013 1014 1015
{
	struct free_area * area;
	int current_order;
	struct page *page;
	int migratetype, i;

	/* Find the largest possible block of pages in the other list */
	for (current_order = MAX_ORDER-1; current_order >= order;
						--current_order) {
1016
		for (i = 0;; i++) {
1017 1018
			migratetype = fallbacks[start_migratetype][i];

1019 1020
			/* MIGRATE_RESERVE handled later if necessary */
			if (migratetype == MIGRATE_RESERVE)
1021
				break;
M
Mel Gorman 已提交
1022

1023 1024 1025 1026 1027 1028 1029 1030 1031
			area = &(zone->free_area[current_order]);
			if (list_empty(&area->free_list[migratetype]))
				continue;

			page = list_entry(area->free_list[migratetype].next,
					struct page, lru);
			area->nr_free--;

			/*
1032
			 * If breaking a large block of pages, move all free
1033 1034
			 * pages to the preferred allocation list. If falling
			 * back for a reclaimable kernel allocation, be more
L
Lucas De Marchi 已提交
1035
			 * aggressive about taking ownership of free pages
1036 1037 1038 1039 1040 1041
			 *
			 * On the other hand, never change migration
			 * type of MIGRATE_CMA pageblocks nor move CMA
			 * pages on different free lists. We don't
			 * want unmovable pages to be allocated from
			 * MIGRATE_CMA areas.
1042
			 */
1043 1044 1045 1046 1047
			if (!is_migrate_cma(migratetype) &&
			    (unlikely(current_order >= pageblock_order / 2) ||
			     start_migratetype == MIGRATE_RECLAIMABLE ||
			     page_group_by_mobility_disabled)) {
				int pages;
1048 1049 1050 1051
				pages = move_freepages_block(zone, page,
								start_migratetype);

				/* Claim the whole block if over half of it is free */
1052 1053
				if (pages >= (1 << (pageblock_order-1)) ||
						page_group_by_mobility_disabled)
1054 1055 1056
					set_pageblock_migratetype(page,
								start_migratetype);

1057
				migratetype = start_migratetype;
1058
			}
1059 1060 1061 1062 1063

			/* Remove the page from the freelists */
			list_del(&page->lru);
			rmv_page_order(page);

1064
			/* Take ownership for orders >= pageblock_order */
1065 1066
			if (current_order >= pageblock_order &&
			    !is_migrate_cma(migratetype))
1067
				change_pageblock_range(page, current_order,
1068 1069
							start_migratetype);

1070 1071 1072
			expand(zone, page, order, current_order, area,
			       is_migrate_cma(migratetype)
			     ? migratetype : start_migratetype);
1073 1074 1075 1076

			trace_mm_page_alloc_extfrag(page, order, current_order,
				start_migratetype, migratetype);

1077 1078 1079 1080
			return page;
		}
	}

1081
	return NULL;
1082 1083
}

1084
/*
L
Linus Torvalds 已提交
1085 1086 1087
 * Do the hard work of removing an element from the buddy allocator.
 * Call me with the zone->lock already held.
 */
1088 1089
static struct page *__rmqueue(struct zone *zone, unsigned int order,
						int migratetype)
L
Linus Torvalds 已提交
1090 1091 1092
{
	struct page *page;

1093
retry_reserve:
1094
	page = __rmqueue_smallest(zone, order, migratetype);
1095

1096
	if (unlikely(!page) && migratetype != MIGRATE_RESERVE) {
1097
		page = __rmqueue_fallback(zone, order, migratetype);
1098

1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109
		/*
		 * Use MIGRATE_RESERVE rather than fail an allocation. goto
		 * is used because __rmqueue_smallest is an inline function
		 * and we want just one call site
		 */
		if (!page) {
			migratetype = MIGRATE_RESERVE;
			goto retry_reserve;
		}
	}

1110
	trace_mm_page_alloc_zone_locked(page, order, migratetype);
1111
	return page;
L
Linus Torvalds 已提交
1112 1113
}

1114
/*
L
Linus Torvalds 已提交
1115 1116 1117 1118
 * Obtain a specified number of elements from the buddy allocator, all under
 * a single hold of the lock, for efficiency.  Add them to the supplied list.
 * Returns the number of new pages which were placed at *list.
 */
1119
static int rmqueue_bulk(struct zone *zone, unsigned int order,
1120
			unsigned long count, struct list_head *list,
1121
			int migratetype, int cold)
L
Linus Torvalds 已提交
1122
{
1123
	int mt = migratetype, i;
1124

N
Nick Piggin 已提交
1125
	spin_lock(&zone->lock);
L
Linus Torvalds 已提交
1126
	for (i = 0; i < count; ++i) {
1127
		struct page *page = __rmqueue(zone, order, migratetype);
N
Nick Piggin 已提交
1128
		if (unlikely(page == NULL))
L
Linus Torvalds 已提交
1129
			break;
1130 1131 1132 1133 1134 1135 1136 1137 1138 1139

		/*
		 * Split buddy pages returned by expand() are received here
		 * in physical page order. The page is added to the callers and
		 * list and the list head then moves forward. From the callers
		 * perspective, the linked list is ordered by page number in
		 * some conditions. This is useful for IO devices that can
		 * merge IO requests if the physical pages are ordered
		 * properly.
		 */
1140 1141 1142 1143
		if (likely(cold == 0))
			list_add(&page->lru, list);
		else
			list_add_tail(&page->lru, list);
1144 1145 1146 1147 1148
		if (IS_ENABLED(CONFIG_CMA)) {
			mt = get_pageblock_migratetype(page);
			if (!is_migrate_cma(mt) && mt != MIGRATE_ISOLATE)
				mt = migratetype;
		}
1149
		set_freepage_migratetype(page, mt);
1150
		list = &page->lru;
1151 1152 1153
		if (is_migrate_cma(mt))
			__mod_zone_page_state(zone, NR_FREE_CMA_PAGES,
					      -(1 << order));
L
Linus Torvalds 已提交
1154
	}
1155
	__mod_zone_page_state(zone, NR_FREE_PAGES, -(i << order));
N
Nick Piggin 已提交
1156
	spin_unlock(&zone->lock);
N
Nick Piggin 已提交
1157
	return i;
L
Linus Torvalds 已提交
1158 1159
}

1160
#ifdef CONFIG_NUMA
1161
/*
1162 1163 1164 1165
 * Called from the vmstat counter updater to drain pagesets of this
 * currently executing processor on remote nodes after they have
 * expired.
 *
1166 1167
 * Note that this function must be called with the thread pinned to
 * a single processor.
1168
 */
1169
void drain_zone_pages(struct zone *zone, struct per_cpu_pages *pcp)
1170 1171
{
	unsigned long flags;
1172
	int to_drain;
1173

1174 1175 1176 1177 1178
	local_irq_save(flags);
	if (pcp->count >= pcp->batch)
		to_drain = pcp->batch;
	else
		to_drain = pcp->count;
1179 1180 1181 1182
	if (to_drain > 0) {
		free_pcppages_bulk(zone, to_drain, pcp);
		pcp->count -= to_drain;
	}
1183
	local_irq_restore(flags);
1184 1185 1186
}
#endif

1187 1188 1189 1190 1191 1192 1193 1194
/*
 * Drain pages of the indicated processor.
 *
 * The processor must either be the current processor and the
 * thread pinned to the current processor or a processor that
 * is not online.
 */
static void drain_pages(unsigned int cpu)
L
Linus Torvalds 已提交
1195
{
N
Nick Piggin 已提交
1196
	unsigned long flags;
L
Linus Torvalds 已提交
1197 1198
	struct zone *zone;

1199
	for_each_populated_zone(zone) {
L
Linus Torvalds 已提交
1200
		struct per_cpu_pageset *pset;
1201
		struct per_cpu_pages *pcp;
L
Linus Torvalds 已提交
1202

1203 1204
		local_irq_save(flags);
		pset = per_cpu_ptr(zone->pageset, cpu);
1205 1206

		pcp = &pset->pcp;
1207 1208 1209 1210
		if (pcp->count) {
			free_pcppages_bulk(zone, pcp->count, pcp);
			pcp->count = 0;
		}
1211
		local_irq_restore(flags);
L
Linus Torvalds 已提交
1212 1213 1214
	}
}

1215 1216 1217 1218 1219 1220 1221 1222 1223
/*
 * Spill all of this CPU's per-cpu pages back into the buddy allocator.
 */
void drain_local_pages(void *arg)
{
	drain_pages(smp_processor_id());
}

/*
1224 1225 1226 1227 1228 1229 1230
 * Spill all the per-cpu pages from all CPUs back into the buddy allocator.
 *
 * Note that this code is protected against sending an IPI to an offline
 * CPU but does not guarantee sending an IPI to newly hotplugged CPUs:
 * on_each_cpu_mask() blocks hotplug and won't talk to offlined CPUs but
 * nothing keeps CPUs from showing up after we populated the cpumask and
 * before the call to on_each_cpu_mask().
1231 1232 1233
 */
void drain_all_pages(void)
{
1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264
	int cpu;
	struct per_cpu_pageset *pcp;
	struct zone *zone;

	/*
	 * Allocate in the BSS so we wont require allocation in
	 * direct reclaim path for CONFIG_CPUMASK_OFFSTACK=y
	 */
	static cpumask_t cpus_with_pcps;

	/*
	 * We don't care about racing with CPU hotplug event
	 * as offline notification will cause the notified
	 * cpu to drain that CPU pcps and on_each_cpu_mask
	 * disables preemption as part of its processing
	 */
	for_each_online_cpu(cpu) {
		bool has_pcps = false;
		for_each_populated_zone(zone) {
			pcp = per_cpu_ptr(zone->pageset, cpu);
			if (pcp->pcp.count) {
				has_pcps = true;
				break;
			}
		}
		if (has_pcps)
			cpumask_set_cpu(cpu, &cpus_with_pcps);
		else
			cpumask_clear_cpu(cpu, &cpus_with_pcps);
	}
	on_each_cpu_mask(&cpus_with_pcps, drain_local_pages, NULL, 1);
1265 1266
}

1267
#ifdef CONFIG_HIBERNATION
L
Linus Torvalds 已提交
1268 1269 1270

void mark_free_pages(struct zone *zone)
{
1271 1272
	unsigned long pfn, max_zone_pfn;
	unsigned long flags;
1273
	int order, t;
L
Linus Torvalds 已提交
1274 1275 1276 1277 1278 1279
	struct list_head *curr;

	if (!zone->spanned_pages)
		return;

	spin_lock_irqsave(&zone->lock, flags);
1280 1281 1282 1283 1284 1285

	max_zone_pfn = zone->zone_start_pfn + zone->spanned_pages;
	for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
		if (pfn_valid(pfn)) {
			struct page *page = pfn_to_page(pfn);

1286 1287
			if (!swsusp_page_is_forbidden(page))
				swsusp_unset_page_free(page);
1288
		}
L
Linus Torvalds 已提交
1289

1290 1291
	for_each_migratetype_order(order, t) {
		list_for_each(curr, &zone->free_area[order].free_list[t]) {
1292
			unsigned long i;
L
Linus Torvalds 已提交
1293

1294 1295
			pfn = page_to_pfn(list_entry(curr, struct page, lru));
			for (i = 0; i < (1UL << order); i++)
1296
				swsusp_set_page_free(pfn_to_page(pfn + i));
1297
		}
1298
	}
L
Linus Torvalds 已提交
1299 1300
	spin_unlock_irqrestore(&zone->lock, flags);
}
1301
#endif /* CONFIG_PM */
L
Linus Torvalds 已提交
1302 1303 1304

/*
 * Free a 0-order page
L
Li Hong 已提交
1305
 * cold == 1 ? free a cold page : free a hot page
L
Linus Torvalds 已提交
1306
 */
L
Li Hong 已提交
1307
void free_hot_cold_page(struct page *page, int cold)
L
Linus Torvalds 已提交
1308 1309 1310 1311
{
	struct zone *zone = page_zone(page);
	struct per_cpu_pages *pcp;
	unsigned long flags;
1312
	int migratetype;
L
Linus Torvalds 已提交
1313

1314
	if (!free_pages_prepare(page, 0))
1315 1316
		return;

1317
	migratetype = get_pageblock_migratetype(page);
1318
	set_freepage_migratetype(page, migratetype);
L
Linus Torvalds 已提交
1319
	local_irq_save(flags);
1320
	__count_vm_event(PGFREE);
1321

1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336
	/*
	 * We only track unmovable, reclaimable and movable on pcp lists.
	 * Free ISOLATE pages back to the allocator because they are being
	 * offlined but treat RESERVE as movable pages so we can get those
	 * areas back if necessary. Otherwise, we may have to free
	 * excessively into the page allocator
	 */
	if (migratetype >= MIGRATE_PCPTYPES) {
		if (unlikely(migratetype == MIGRATE_ISOLATE)) {
			free_one_page(zone, page, 0, migratetype);
			goto out;
		}
		migratetype = MIGRATE_MOVABLE;
	}

1337
	pcp = &this_cpu_ptr(zone->pageset)->pcp;
1338
	if (cold)
1339
		list_add_tail(&page->lru, &pcp->lists[migratetype]);
1340
	else
1341
		list_add(&page->lru, &pcp->lists[migratetype]);
L
Linus Torvalds 已提交
1342
	pcp->count++;
N
Nick Piggin 已提交
1343
	if (pcp->count >= pcp->high) {
1344
		free_pcppages_bulk(zone, pcp->batch, pcp);
N
Nick Piggin 已提交
1345 1346
		pcp->count -= pcp->batch;
	}
1347 1348

out:
L
Linus Torvalds 已提交
1349 1350 1351
	local_irq_restore(flags);
}

1352 1353 1354 1355 1356 1357 1358 1359
/*
 * Free a list of 0-order pages
 */
void free_hot_cold_page_list(struct list_head *list, int cold)
{
	struct page *page, *next;

	list_for_each_entry_safe(page, next, list, lru) {
1360
		trace_mm_page_free_batched(page, cold);
1361 1362 1363 1364
		free_hot_cold_page(page, cold);
	}
}

N
Nick Piggin 已提交
1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376
/*
 * split_page takes a non-compound higher-order page, and splits it into
 * n (1<<order) sub-pages: page[0..n]
 * Each sub-page must be freed individually.
 *
 * Note: this is probably too low level an operation for use in drivers.
 * Please consult with lkml before using this in your driver.
 */
void split_page(struct page *page, unsigned int order)
{
	int i;

N
Nick Piggin 已提交
1377 1378
	VM_BUG_ON(PageCompound(page));
	VM_BUG_ON(!page_count(page));
1379 1380 1381 1382 1383 1384 1385 1386 1387 1388

#ifdef CONFIG_KMEMCHECK
	/*
	 * Split shadow pages too, because free(page[0]) would
	 * otherwise free the whole shadow.
	 */
	if (kmemcheck_page_is_tracked(page))
		split_page(virt_to_page(page[0].shadow), order);
#endif

1389 1390
	for (i = 1; i < (1 << order); i++)
		set_page_refcounted(page + i);
N
Nick Piggin 已提交
1391 1392
}

1393
/*
1394 1395 1396
 * Similar to the split_page family of functions except that the page
 * required at the given order and being isolated now to prevent races
 * with parallel allocators
1397
 */
1398
int capture_free_page(struct page *page, int alloc_order, int migratetype)
1399 1400 1401 1402
{
	unsigned int order;
	unsigned long watermark;
	struct zone *zone;
1403
	int mt;
1404 1405 1406 1407 1408

	BUG_ON(!PageBuddy(page));

	zone = page_zone(page);
	order = page_order(page);
1409
	mt = get_pageblock_migratetype(page);
1410

1411 1412 1413 1414 1415 1416 1417 1418
	if (mt != MIGRATE_ISOLATE) {
		/* Obey watermarks as if the page was being allocated */
		watermark = low_wmark_pages(zone) + (1 << order);
		if (!zone_watermark_ok(zone, 0, watermark, 0, 0))
			return 0;

		__mod_zone_freepage_state(zone, -(1UL << alloc_order), mt);
	}
1419 1420 1421 1422 1423

	/* Remove page from free list */
	list_del(&page->lru);
	zone->free_area[order].nr_free--;
	rmv_page_order(page);
1424

1425 1426 1427
	if (alloc_order != order)
		expand(zone, page, alloc_order, order,
			&zone->free_area[order], migratetype);
1428

1429
	/* Set the pageblock if the captured page is at least a pageblock */
1430 1431
	if (order >= pageblock_order - 1) {
		struct page *endpage = page + (1 << order) - 1;
1432 1433 1434 1435 1436 1437
		for (; page < endpage; page += pageblock_nr_pages) {
			int mt = get_pageblock_migratetype(page);
			if (mt != MIGRATE_ISOLATE && !is_migrate_cma(mt))
				set_pageblock_migratetype(page,
							  MIGRATE_MOVABLE);
		}
1438 1439
	}

1440
	return 1UL << alloc_order;
1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468
}

/*
 * Similar to split_page except the page is already free. As this is only
 * being used for migration, the migratetype of the block also changes.
 * As this is called with interrupts disabled, the caller is responsible
 * for calling arch_alloc_page() and kernel_map_page() after interrupts
 * are enabled.
 *
 * Note: this is probably too low level an operation for use in drivers.
 * Please consult with lkml before using this in your driver.
 */
int split_free_page(struct page *page)
{
	unsigned int order;
	int nr_pages;

	BUG_ON(!PageBuddy(page));
	order = page_order(page);

	nr_pages = capture_free_page(page, order, 0);
	if (!nr_pages)
		return 0;

	/* Split into individual pages */
	set_page_refcounted(page);
	split_page(page, order);
	return nr_pages;
1469 1470
}

L
Linus Torvalds 已提交
1471 1472 1473 1474 1475
/*
 * Really, prep_compound_page() should be called from __rmqueue_bulk().  But
 * we cheat by calling it from here, in the order > 0 path.  Saves a branch
 * or two.
 */
1476 1477
static inline
struct page *buffered_rmqueue(struct zone *preferred_zone,
1478 1479
			struct zone *zone, int order, gfp_t gfp_flags,
			int migratetype)
L
Linus Torvalds 已提交
1480 1481
{
	unsigned long flags;
1482
	struct page *page;
L
Linus Torvalds 已提交
1483 1484
	int cold = !!(gfp_flags & __GFP_COLD);

1485
again:
N
Nick Piggin 已提交
1486
	if (likely(order == 0)) {
L
Linus Torvalds 已提交
1487
		struct per_cpu_pages *pcp;
1488
		struct list_head *list;
L
Linus Torvalds 已提交
1489 1490

		local_irq_save(flags);
1491 1492
		pcp = &this_cpu_ptr(zone->pageset)->pcp;
		list = &pcp->lists[migratetype];
1493
		if (list_empty(list)) {
1494
			pcp->count += rmqueue_bulk(zone, 0,
1495
					pcp->batch, list,
1496
					migratetype, cold);
1497
			if (unlikely(list_empty(list)))
1498
				goto failed;
1499
		}
1500

1501 1502 1503 1504 1505
		if (cold)
			page = list_entry(list->prev, struct page, lru);
		else
			page = list_entry(list->next, struct page, lru);

1506 1507
		list_del(&page->lru);
		pcp->count--;
R
Rohit Seth 已提交
1508
	} else {
1509 1510 1511 1512 1513 1514 1515 1516
		if (unlikely(gfp_flags & __GFP_NOFAIL)) {
			/*
			 * __GFP_NOFAIL is not to be used in new code.
			 *
			 * All __GFP_NOFAIL callers should be fixed so that they
			 * properly detect and handle allocation failures.
			 *
			 * We most definitely don't want callers attempting to
1517
			 * allocate greater than order-1 page units with
1518 1519
			 * __GFP_NOFAIL.
			 */
1520
			WARN_ON_ONCE(order > 1);
1521
		}
L
Linus Torvalds 已提交
1522
		spin_lock_irqsave(&zone->lock, flags);
1523
		page = __rmqueue(zone, order, migratetype);
N
Nick Piggin 已提交
1524 1525 1526
		spin_unlock(&zone->lock);
		if (!page)
			goto failed;
1527 1528
		__mod_zone_freepage_state(zone, -(1 << order),
					  get_pageblock_migratetype(page));
L
Linus Torvalds 已提交
1529 1530
	}

1531
	__count_zone_vm_events(PGALLOC, zone, 1 << order);
A
Andi Kleen 已提交
1532
	zone_statistics(preferred_zone, zone, gfp_flags);
N
Nick Piggin 已提交
1533
	local_irq_restore(flags);
L
Linus Torvalds 已提交
1534

N
Nick Piggin 已提交
1535
	VM_BUG_ON(bad_range(zone, page));
N
Nick Piggin 已提交
1536
	if (prep_new_page(page, order, gfp_flags))
N
Nick Piggin 已提交
1537
		goto again;
L
Linus Torvalds 已提交
1538
	return page;
N
Nick Piggin 已提交
1539 1540 1541 1542

failed:
	local_irq_restore(flags);
	return NULL;
L
Linus Torvalds 已提交
1543 1544
}

1545 1546
#ifdef CONFIG_FAIL_PAGE_ALLOC

1547
static struct {
1548 1549 1550 1551
	struct fault_attr attr;

	u32 ignore_gfp_highmem;
	u32 ignore_gfp_wait;
1552
	u32 min_order;
1553 1554
} fail_page_alloc = {
	.attr = FAULT_ATTR_INITIALIZER,
1555 1556
	.ignore_gfp_wait = 1,
	.ignore_gfp_highmem = 1,
1557
	.min_order = 1,
1558 1559 1560 1561 1562 1563 1564 1565
};

static int __init setup_fail_page_alloc(char *str)
{
	return setup_fault_attr(&fail_page_alloc.attr, str);
}
__setup("fail_page_alloc=", setup_fail_page_alloc);

1566
static bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
1567
{
1568
	if (order < fail_page_alloc.min_order)
1569
		return false;
1570
	if (gfp_mask & __GFP_NOFAIL)
1571
		return false;
1572
	if (fail_page_alloc.ignore_gfp_highmem && (gfp_mask & __GFP_HIGHMEM))
1573
		return false;
1574
	if (fail_page_alloc.ignore_gfp_wait && (gfp_mask & __GFP_WAIT))
1575
		return false;
1576 1577 1578 1579 1580 1581 1582 1583

	return should_fail(&fail_page_alloc.attr, 1 << order);
}

#ifdef CONFIG_FAULT_INJECTION_DEBUG_FS

static int __init fail_page_alloc_debugfs(void)
{
A
Al Viro 已提交
1584
	umode_t mode = S_IFREG | S_IRUSR | S_IWUSR;
1585 1586
	struct dentry *dir;

1587 1588 1589 1590
	dir = fault_create_debugfs_attr("fail_page_alloc", NULL,
					&fail_page_alloc.attr);
	if (IS_ERR(dir))
		return PTR_ERR(dir);
1591

1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603
	if (!debugfs_create_bool("ignore-gfp-wait", mode, dir,
				&fail_page_alloc.ignore_gfp_wait))
		goto fail;
	if (!debugfs_create_bool("ignore-gfp-highmem", mode, dir,
				&fail_page_alloc.ignore_gfp_highmem))
		goto fail;
	if (!debugfs_create_u32("min-order", mode, dir,
				&fail_page_alloc.min_order))
		goto fail;

	return 0;
fail:
1604
	debugfs_remove_recursive(dir);
1605

1606
	return -ENOMEM;
1607 1608 1609 1610 1611 1612 1613 1614
}

late_initcall(fail_page_alloc_debugfs);

#endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */

#else /* CONFIG_FAIL_PAGE_ALLOC */

1615
static inline bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order)
1616
{
1617
	return false;
1618 1619 1620 1621
}

#endif /* CONFIG_FAIL_PAGE_ALLOC */

L
Linus Torvalds 已提交
1622
/*
1623
 * Return true if free pages are above 'mark'. This takes into account the order
L
Linus Torvalds 已提交
1624 1625
 * of the allocation.
 */
1626 1627
static bool __zone_watermark_ok(struct zone *z, int order, unsigned long mark,
		      int classzone_idx, int alloc_flags, long free_pages)
L
Linus Torvalds 已提交
1628 1629
{
	/* free_pages my go negative - that's OK */
1630
	long min = mark;
1631
	long lowmem_reserve = z->lowmem_reserve[classzone_idx];
L
Linus Torvalds 已提交
1632 1633
	int o;

1634
	free_pages -= (1 << order) - 1;
R
Rohit Seth 已提交
1635
	if (alloc_flags & ALLOC_HIGH)
L
Linus Torvalds 已提交
1636
		min -= min / 2;
R
Rohit Seth 已提交
1637
	if (alloc_flags & ALLOC_HARDER)
L
Linus Torvalds 已提交
1638
		min -= min / 4;
1639 1640 1641 1642 1643
#ifdef CONFIG_CMA
	/* If allocation can't use CMA areas don't use free CMA pages */
	if (!(alloc_flags & ALLOC_CMA))
		free_pages -= zone_page_state(z, NR_FREE_CMA_PAGES);
#endif
1644
	if (free_pages <= min + lowmem_reserve)
1645
		return false;
L
Linus Torvalds 已提交
1646 1647 1648 1649 1650 1651 1652 1653
	for (o = 0; o < order; o++) {
		/* At the next order, this order's pages become unavailable */
		free_pages -= z->free_area[o].nr_free << o;

		/* Require fewer higher order pages to be free */
		min >>= 1;

		if (free_pages <= min)
1654
			return false;
L
Linus Torvalds 已提交
1655
	}
1656 1657 1658
	return true;
}

1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672
#ifdef CONFIG_MEMORY_ISOLATION
static inline unsigned long nr_zone_isolate_freepages(struct zone *zone)
{
	if (unlikely(zone->nr_pageblock_isolate))
		return zone->nr_pageblock_isolate * pageblock_nr_pages;
	return 0;
}
#else
static inline unsigned long nr_zone_isolate_freepages(struct zone *zone)
{
	return 0;
}
#endif

1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687
bool zone_watermark_ok(struct zone *z, int order, unsigned long mark,
		      int classzone_idx, int alloc_flags)
{
	return __zone_watermark_ok(z, order, mark, classzone_idx, alloc_flags,
					zone_page_state(z, NR_FREE_PAGES));
}

bool zone_watermark_ok_safe(struct zone *z, int order, unsigned long mark,
		      int classzone_idx, int alloc_flags)
{
	long free_pages = zone_page_state(z, NR_FREE_PAGES);

	if (z->percpu_drift_mark && free_pages < z->percpu_drift_mark)
		free_pages = zone_page_state_snapshot(z, NR_FREE_PAGES);

1688 1689 1690 1691 1692 1693 1694 1695
	/*
	 * If the zone has MIGRATE_ISOLATE type free pages, we should consider
	 * it.  nr_zone_isolate_freepages is never accurate so kswapd might not
	 * sleep although it could do so.  But this is more desirable for memory
	 * hotplug than sleeping which can cause a livelock in the direct
	 * reclaim path.
	 */
	free_pages -= nr_zone_isolate_freepages(z);
1696 1697
	return __zone_watermark_ok(z, order, mark, classzone_idx, alloc_flags,
								free_pages);
L
Linus Torvalds 已提交
1698 1699
}

1700 1701 1702 1703 1704 1705
#ifdef CONFIG_NUMA
/*
 * zlc_setup - Setup for "zonelist cache".  Uses cached zone data to
 * skip over zones that are not allowed by the cpuset, or that have
 * been recently (in last second) found to be nearly full.  See further
 * comments in mmzone.h.  Reduces cache footprint of zonelist scans
S
Simon Arlott 已提交
1706
 * that have to skip over a lot of full or unallowed zones.
1707 1708 1709
 *
 * If the zonelist cache is present in the passed in zonelist, then
 * returns a pointer to the allowed node mask (either the current
1710
 * tasks mems_allowed, or node_states[N_MEMORY].)
1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731
 *
 * If the zonelist cache is not available for this zonelist, does
 * nothing and returns NULL.
 *
 * If the fullzones BITMAP in the zonelist cache is stale (more than
 * a second since last zap'd) then we zap it out (clear its bits.)
 *
 * We hold off even calling zlc_setup, until after we've checked the
 * first zone in the zonelist, on the theory that most allocations will
 * be satisfied from that first zone, so best to examine that zone as
 * quickly as we can.
 */
static nodemask_t *zlc_setup(struct zonelist *zonelist, int alloc_flags)
{
	struct zonelist_cache *zlc;	/* cached zonelist speedup info */
	nodemask_t *allowednodes;	/* zonelist_cache approximation */

	zlc = zonelist->zlcache_ptr;
	if (!zlc)
		return NULL;

S
S.Caglar Onur 已提交
1732
	if (time_after(jiffies, zlc->last_full_zap + HZ)) {
1733 1734 1735 1736 1737 1738
		bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST);
		zlc->last_full_zap = jiffies;
	}

	allowednodes = !in_interrupt() && (alloc_flags & ALLOC_CPUSET) ?
					&cpuset_current_mems_allowed :
1739
					&node_states[N_MEMORY];
1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764
	return allowednodes;
}

/*
 * Given 'z' scanning a zonelist, run a couple of quick checks to see
 * if it is worth looking at further for free memory:
 *  1) Check that the zone isn't thought to be full (doesn't have its
 *     bit set in the zonelist_cache fullzones BITMAP).
 *  2) Check that the zones node (obtained from the zonelist_cache
 *     z_to_n[] mapping) is allowed in the passed in allowednodes mask.
 * Return true (non-zero) if zone is worth looking at further, or
 * else return false (zero) if it is not.
 *
 * This check -ignores- the distinction between various watermarks,
 * such as GFP_HIGH, GFP_ATOMIC, PF_MEMALLOC, ...  If a zone is
 * found to be full for any variation of these watermarks, it will
 * be considered full for up to one second by all requests, unless
 * we are so low on memory on all allowed nodes that we are forced
 * into the second scan of the zonelist.
 *
 * In the second scan we ignore this zonelist cache and exactly
 * apply the watermarks to all zones, even it is slower to do so.
 * We are low on memory in the second scan, and should leave no stone
 * unturned looking for a free page.
 */
1765
static int zlc_zone_worth_trying(struct zonelist *zonelist, struct zoneref *z,
1766 1767 1768 1769 1770 1771 1772 1773 1774 1775
						nodemask_t *allowednodes)
{
	struct zonelist_cache *zlc;	/* cached zonelist speedup info */
	int i;				/* index of *z in zonelist zones */
	int n;				/* node that zone *z is on */

	zlc = zonelist->zlcache_ptr;
	if (!zlc)
		return 1;

1776
	i = z - zonelist->_zonerefs;
1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787
	n = zlc->z_to_n[i];

	/* This zone is worth trying if it is allowed but not full */
	return node_isset(n, *allowednodes) && !test_bit(i, zlc->fullzones);
}

/*
 * Given 'z' scanning a zonelist, set the corresponding bit in
 * zlc->fullzones, so that subsequent attempts to allocate a page
 * from that zone don't waste time re-examining it.
 */
1788
static void zlc_mark_zone_full(struct zonelist *zonelist, struct zoneref *z)
1789 1790 1791 1792 1793 1794 1795 1796
{
	struct zonelist_cache *zlc;	/* cached zonelist speedup info */
	int i;				/* index of *z in zonelist zones */

	zlc = zonelist->zlcache_ptr;
	if (!zlc)
		return;

1797
	i = z - zonelist->_zonerefs;
1798 1799 1800 1801

	set_bit(i, zlc->fullzones);
}

1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816
/*
 * clear all zones full, called after direct reclaim makes progress so that
 * a zone that was recently full is not skipped over for up to a second
 */
static void zlc_clear_zones_full(struct zonelist *zonelist)
{
	struct zonelist_cache *zlc;	/* cached zonelist speedup info */

	zlc = zonelist->zlcache_ptr;
	if (!zlc)
		return;

	bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST);
}

1817 1818 1819 1820 1821 1822 1823 1824 1825 1826
static bool zone_allows_reclaim(struct zone *local_zone, struct zone *zone)
{
	return node_isset(local_zone->node, zone->zone_pgdat->reclaim_nodes);
}

static void __paginginit init_zone_allows_reclaim(int nid)
{
	int i;

	for_each_online_node(i)
1827
		if (node_distance(nid, i) <= RECLAIM_DISTANCE)
1828
			node_set(i, NODE_DATA(nid)->reclaim_nodes);
1829
		else
1830 1831 1832
			zone_reclaim_mode = 1;
}

1833 1834 1835 1836 1837 1838 1839
#else	/* CONFIG_NUMA */

static nodemask_t *zlc_setup(struct zonelist *zonelist, int alloc_flags)
{
	return NULL;
}

1840
static int zlc_zone_worth_trying(struct zonelist *zonelist, struct zoneref *z,
1841 1842 1843 1844 1845
				nodemask_t *allowednodes)
{
	return 1;
}

1846
static void zlc_mark_zone_full(struct zonelist *zonelist, struct zoneref *z)
1847 1848
{
}
1849 1850 1851 1852

static void zlc_clear_zones_full(struct zonelist *zonelist)
{
}
1853 1854 1855 1856 1857 1858 1859 1860 1861

static bool zone_allows_reclaim(struct zone *local_zone, struct zone *zone)
{
	return true;
}

static inline void init_zone_allows_reclaim(int nid)
{
}
1862 1863
#endif	/* CONFIG_NUMA */

R
Rohit Seth 已提交
1864
/*
1865
 * get_page_from_freelist goes through the zonelist trying to allocate
R
Rohit Seth 已提交
1866 1867 1868
 * a page.
 */
static struct page *
1869
get_page_from_freelist(gfp_t gfp_mask, nodemask_t *nodemask, unsigned int order,
1870
		struct zonelist *zonelist, int high_zoneidx, int alloc_flags,
1871
		struct zone *preferred_zone, int migratetype)
M
Martin Hicks 已提交
1872
{
1873
	struct zoneref *z;
R
Rohit Seth 已提交
1874
	struct page *page = NULL;
1875
	int classzone_idx;
1876
	struct zone *zone;
1877 1878 1879
	nodemask_t *allowednodes = NULL;/* zonelist_cache approximation */
	int zlc_active = 0;		/* set if using zonelist_cache */
	int did_zlc_setup = 0;		/* just call zlc_setup() one time */
1880

1881
	classzone_idx = zone_idx(preferred_zone);
1882
zonelist_scan:
R
Rohit Seth 已提交
1883
	/*
1884
	 * Scan zonelist, looking for a zone with enough free.
R
Rohit Seth 已提交
1885 1886
	 * See also cpuset_zone_allowed() comment in kernel/cpuset.c.
	 */
1887 1888
	for_each_zone_zonelist_nodemask(zone, z, zonelist,
						high_zoneidx, nodemask) {
1889
		if (IS_ENABLED(CONFIG_NUMA) && zlc_active &&
1890 1891
			!zlc_zone_worth_trying(zonelist, z, allowednodes))
				continue;
R
Rohit Seth 已提交
1892
		if ((alloc_flags & ALLOC_CPUSET) &&
1893
			!cpuset_zone_allowed_softwall(zone, gfp_mask))
1894
				continue;
1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923
		/*
		 * When allocating a page cache page for writing, we
		 * want to get it from a zone that is within its dirty
		 * limit, such that no single zone holds more than its
		 * proportional share of globally allowed dirty pages.
		 * The dirty limits take into account the zone's
		 * lowmem reserves and high watermark so that kswapd
		 * should be able to balance it without having to
		 * write pages from its LRU list.
		 *
		 * This may look like it could increase pressure on
		 * lower zones by failing allocations in higher zones
		 * before they are full.  But the pages that do spill
		 * over are limited as the lower zones are protected
		 * by this very same mechanism.  It should not become
		 * a practical burden to them.
		 *
		 * XXX: For now, allow allocations to potentially
		 * exceed the per-zone dirty limit in the slowpath
		 * (ALLOC_WMARK_LOW unset) before going into reclaim,
		 * which is important when on a NUMA setup the allowed
		 * zones are together not big enough to reach the
		 * global limit.  The proper fix for these situations
		 * will require awareness of zones in the
		 * dirty-throttling and the flusher threads.
		 */
		if ((alloc_flags & ALLOC_WMARK_LOW) &&
		    (gfp_mask & __GFP_WRITE) && !zone_dirty_ok(zone))
			goto this_zone_full;
R
Rohit Seth 已提交
1924

1925
		BUILD_BUG_ON(ALLOC_NO_WATERMARKS < NR_WMARK);
R
Rohit Seth 已提交
1926
		if (!(alloc_flags & ALLOC_NO_WATERMARKS)) {
1927
			unsigned long mark;
1928 1929
			int ret;

1930
			mark = zone->watermark[alloc_flags & ALLOC_WMARK_MASK];
1931 1932 1933 1934
			if (zone_watermark_ok(zone, order, mark,
				    classzone_idx, alloc_flags))
				goto try_this_zone;

1935 1936
			if (IS_ENABLED(CONFIG_NUMA) &&
					!did_zlc_setup && nr_online_nodes > 1) {
1937 1938 1939 1940 1941 1942 1943 1944 1945 1946
				/*
				 * we do zlc_setup if there are multiple nodes
				 * and before considering the first zone allowed
				 * by the cpuset.
				 */
				allowednodes = zlc_setup(zonelist, alloc_flags);
				zlc_active = 1;
				did_zlc_setup = 1;
			}

1947 1948
			if (zone_reclaim_mode == 0 ||
			    !zone_allows_reclaim(preferred_zone, zone))
1949 1950
				goto this_zone_full;

1951 1952 1953 1954
			/*
			 * As we may have just activated ZLC, check if the first
			 * eligible zone has failed zone_reclaim recently.
			 */
1955
			if (IS_ENABLED(CONFIG_NUMA) && zlc_active &&
1956 1957 1958
				!zlc_zone_worth_trying(zonelist, z, allowednodes))
				continue;

1959 1960 1961 1962
			ret = zone_reclaim(zone, gfp_mask, order);
			switch (ret) {
			case ZONE_RECLAIM_NOSCAN:
				/* did not scan */
1963
				continue;
1964 1965
			case ZONE_RECLAIM_FULL:
				/* scanned but unreclaimable */
1966
				continue;
1967 1968 1969 1970
			default:
				/* did we reclaim enough */
				if (!zone_watermark_ok(zone, order, mark,
						classzone_idx, alloc_flags))
1971
					goto this_zone_full;
1972
			}
R
Rohit Seth 已提交
1973 1974
		}

1975
try_this_zone:
1976 1977
		page = buffered_rmqueue(preferred_zone, zone, order,
						gfp_mask, migratetype);
1978
		if (page)
R
Rohit Seth 已提交
1979
			break;
1980
this_zone_full:
1981
		if (IS_ENABLED(CONFIG_NUMA))
1982
			zlc_mark_zone_full(zonelist, z);
1983
	}
1984

1985
	if (unlikely(IS_ENABLED(CONFIG_NUMA) && page == NULL && zlc_active)) {
1986 1987 1988 1989
		/* Disable zlc cache for second zonelist scan */
		zlc_active = 0;
		goto zonelist_scan;
	}
1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000

	if (page)
		/*
		 * page->pfmemalloc is set when ALLOC_NO_WATERMARKS was
		 * necessary to allocate the page. The expectation is
		 * that the caller is taking steps that will free more
		 * memory. The caller should avoid the page being used
		 * for !PFMEMALLOC purposes.
		 */
		page->pfmemalloc = !!(alloc_flags & ALLOC_NO_WATERMARKS);

R
Rohit Seth 已提交
2001
	return page;
M
Martin Hicks 已提交
2002 2003
}

2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017
/*
 * Large machines with many possible nodes should not always dump per-node
 * meminfo in irq context.
 */
static inline bool should_suppress_show_mem(void)
{
	bool ret = false;

#if NODES_SHIFT > 8
	ret = in_interrupt();
#endif
	return ret;
}

2018 2019 2020 2021 2022 2023 2024 2025
static DEFINE_RATELIMIT_STATE(nopage_rs,
		DEFAULT_RATELIMIT_INTERVAL,
		DEFAULT_RATELIMIT_BURST);

void warn_alloc_failed(gfp_t gfp_mask, int order, const char *fmt, ...)
{
	unsigned int filter = SHOW_MEM_FILTER_NODES;

2026 2027
	if ((gfp_mask & __GFP_NOWARN) || !__ratelimit(&nopage_rs) ||
	    debug_guardpage_minorder() > 0)
2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042
		return;

	/*
	 * This documents exceptions given to allocations in certain
	 * contexts that are allowed to allocate outside current's set
	 * of allowed nodes.
	 */
	if (!(gfp_mask & __GFP_NOMEMALLOC))
		if (test_thread_flag(TIF_MEMDIE) ||
		    (current->flags & (PF_MEMALLOC | PF_EXITING)))
			filter &= ~SHOW_MEM_FILTER_NODES;
	if (in_interrupt() || !(gfp_mask & __GFP_WAIT))
		filter &= ~SHOW_MEM_FILTER_NODES;

	if (fmt) {
J
Joe Perches 已提交
2043 2044 2045
		struct va_format vaf;
		va_list args;

2046
		va_start(args, fmt);
J
Joe Perches 已提交
2047 2048 2049 2050 2051 2052

		vaf.fmt = fmt;
		vaf.va = &args;

		pr_warn("%pV", &vaf);

2053 2054 2055
		va_end(args);
	}

J
Joe Perches 已提交
2056 2057
	pr_warn("%s: page allocation failure: order:%d, mode:0x%x\n",
		current->comm, order, gfp_mask);
2058 2059 2060 2061 2062 2063

	dump_stack();
	if (!should_suppress_show_mem())
		show_mem(filter);
}

2064 2065
static inline int
should_alloc_retry(gfp_t gfp_mask, unsigned int order,
2066
				unsigned long did_some_progress,
2067
				unsigned long pages_reclaimed)
L
Linus Torvalds 已提交
2068
{
2069 2070 2071
	/* Do not loop if specifically requested */
	if (gfp_mask & __GFP_NORETRY)
		return 0;
L
Linus Torvalds 已提交
2072

2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084
	/* Always retry if specifically requested */
	if (gfp_mask & __GFP_NOFAIL)
		return 1;

	/*
	 * Suspend converts GFP_KERNEL to __GFP_WAIT which can prevent reclaim
	 * making forward progress without invoking OOM. Suspend also disables
	 * storage devices so kswapd will not help. Bail if we are suspending.
	 */
	if (!did_some_progress && pm_suspended_storage())
		return 0;

2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101
	/*
	 * In this implementation, order <= PAGE_ALLOC_COSTLY_ORDER
	 * means __GFP_NOFAIL, but that may not be true in other
	 * implementations.
	 */
	if (order <= PAGE_ALLOC_COSTLY_ORDER)
		return 1;

	/*
	 * For order > PAGE_ALLOC_COSTLY_ORDER, if __GFP_REPEAT is
	 * specified, then we retry until we no longer reclaim any pages
	 * (above), or we've reclaimed an order of pages at least as
	 * large as the allocation's order. In both cases, if the
	 * allocation still fails, we stop retrying.
	 */
	if (gfp_mask & __GFP_REPEAT && pages_reclaimed < (1 << order))
		return 1;
2102

2103 2104
	return 0;
}
2105

2106 2107 2108
static inline struct page *
__alloc_pages_may_oom(gfp_t gfp_mask, unsigned int order,
	struct zonelist *zonelist, enum zone_type high_zoneidx,
2109 2110
	nodemask_t *nodemask, struct zone *preferred_zone,
	int migratetype)
2111 2112 2113 2114
{
	struct page *page;

	/* Acquire the OOM killer lock for the zones in zonelist */
2115
	if (!try_set_zonelist_oom(zonelist, gfp_mask)) {
2116
		schedule_timeout_uninterruptible(1);
L
Linus Torvalds 已提交
2117 2118
		return NULL;
	}
2119

2120 2121 2122 2123 2124 2125 2126
	/*
	 * Go through the zonelist yet one more time, keep very high watermark
	 * here, this is only to catch a parallel oom killing, we must fail if
	 * we're still under heavy pressure.
	 */
	page = get_page_from_freelist(gfp_mask|__GFP_HARDWALL, nodemask,
		order, zonelist, high_zoneidx,
2127
		ALLOC_WMARK_HIGH|ALLOC_CPUSET,
2128
		preferred_zone, migratetype);
R
Rohit Seth 已提交
2129
	if (page)
2130 2131
		goto out;

2132 2133 2134 2135
	if (!(gfp_mask & __GFP_NOFAIL)) {
		/* The OOM killer will not help higher order allocs */
		if (order > PAGE_ALLOC_COSTLY_ORDER)
			goto out;
2136 2137 2138
		/* The OOM killer does not needlessly kill tasks for lowmem */
		if (high_zoneidx < ZONE_NORMAL)
			goto out;
2139 2140 2141 2142 2143 2144 2145 2146 2147 2148
		/*
		 * GFP_THISNODE contains __GFP_NORETRY and we never hit this.
		 * Sanity check for bare calls of __GFP_THISNODE, not real OOM.
		 * The caller should handle page allocation failure by itself if
		 * it specifies __GFP_THISNODE.
		 * Note: Hugepage uses it but will hit PAGE_ALLOC_COSTLY_ORDER.
		 */
		if (gfp_mask & __GFP_THISNODE)
			goto out;
	}
2149
	/* Exhausted what can be done so it's blamo time */
2150
	out_of_memory(zonelist, gfp_mask, order, nodemask, false);
2151 2152 2153 2154 2155 2156

out:
	clear_zonelist_oom(zonelist, gfp_mask);
	return page;
}

2157 2158 2159 2160 2161 2162
#ifdef CONFIG_COMPACTION
/* Try memory compaction for high-order allocations before reclaim */
static struct page *
__alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
	struct zonelist *zonelist, enum zone_type high_zoneidx,
	nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone,
2163
	int migratetype, bool sync_migration,
2164
	bool *contended_compaction, bool *deferred_compaction,
2165
	unsigned long *did_some_progress)
2166
{
2167
	struct page *page = NULL;
2168

2169
	if (!order)
2170 2171
		return NULL;

2172
	if (compaction_deferred(preferred_zone, order)) {
2173 2174 2175 2176
		*deferred_compaction = true;
		return NULL;
	}

2177
	current->flags |= PF_MEMALLOC;
2178
	*did_some_progress = try_to_compact_pages(zonelist, order, gfp_mask,
2179
						nodemask, sync_migration,
2180
						contended_compaction, &page);
2181
	current->flags &= ~PF_MEMALLOC;
2182

2183 2184 2185 2186 2187 2188 2189
	/* If compaction captured a page, prep and use it */
	if (page) {
		prep_new_page(page, order, gfp_mask);
		goto got_page;
	}

	if (*did_some_progress != COMPACT_SKIPPED) {
2190 2191 2192 2193 2194 2195
		/* Page migration frees to the PCP lists but we want merging */
		drain_pages(get_cpu());
		put_cpu();

		page = get_page_from_freelist(gfp_mask, nodemask,
				order, zonelist, high_zoneidx,
2196 2197
				alloc_flags & ~ALLOC_NO_WATERMARKS,
				preferred_zone, migratetype);
2198
		if (page) {
2199
got_page:
2200
			preferred_zone->compact_blockskip_flush = false;
2201 2202
			preferred_zone->compact_considered = 0;
			preferred_zone->compact_defer_shift = 0;
2203 2204
			if (order >= preferred_zone->compact_order_failed)
				preferred_zone->compact_order_failed = order + 1;
2205 2206 2207 2208 2209 2210 2211 2212 2213 2214
			count_vm_event(COMPACTSUCCESS);
			return page;
		}

		/*
		 * It's bad if compaction run occurs and fails.
		 * The most likely reason is that pages exist,
		 * but not enough to satisfy watermarks.
		 */
		count_vm_event(COMPACTFAIL);
2215 2216 2217 2218 2219 2220

		/*
		 * As async compaction considers a subset of pageblocks, only
		 * defer if the failure was a sync compaction failure.
		 */
		if (sync_migration)
2221
			defer_compaction(preferred_zone, order);
2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232

		cond_resched();
	}

	return NULL;
}
#else
static inline struct page *
__alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order,
	struct zonelist *zonelist, enum zone_type high_zoneidx,
	nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone,
2233
	int migratetype, bool sync_migration,
2234
	bool *contended_compaction, bool *deferred_compaction,
2235
	unsigned long *did_some_progress)
2236 2237 2238 2239 2240
{
	return NULL;
}
#endif /* CONFIG_COMPACTION */

2241 2242 2243 2244
/* Perform direct synchronous page reclaim */
static int
__perform_reclaim(gfp_t gfp_mask, unsigned int order, struct zonelist *zonelist,
		  nodemask_t *nodemask)
2245 2246
{
	struct reclaim_state reclaim_state;
2247
	int progress;
2248 2249 2250 2251 2252

	cond_resched();

	/* We now go into synchronous reclaim */
	cpuset_memory_pressure_bump();
2253
	current->flags |= PF_MEMALLOC;
2254 2255
	lockdep_set_current_reclaim_state(gfp_mask);
	reclaim_state.reclaimed_slab = 0;
2256
	current->reclaim_state = &reclaim_state;
2257

2258
	progress = try_to_free_pages(zonelist, order, gfp_mask, nodemask);
2259

2260
	current->reclaim_state = NULL;
2261
	lockdep_clear_current_reclaim_state();
2262
	current->flags &= ~PF_MEMALLOC;
2263 2264 2265

	cond_resched();

2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280
	return progress;
}

/* The really slow allocator path where we enter direct reclaim */
static inline struct page *
__alloc_pages_direct_reclaim(gfp_t gfp_mask, unsigned int order,
	struct zonelist *zonelist, enum zone_type high_zoneidx,
	nodemask_t *nodemask, int alloc_flags, struct zone *preferred_zone,
	int migratetype, unsigned long *did_some_progress)
{
	struct page *page = NULL;
	bool drained = false;

	*did_some_progress = __perform_reclaim(gfp_mask, order, zonelist,
					       nodemask);
2281 2282
	if (unlikely(!(*did_some_progress)))
		return NULL;
2283

2284
	/* After successful reclaim, reconsider all zones for allocation */
2285
	if (IS_ENABLED(CONFIG_NUMA))
2286 2287
		zlc_clear_zones_full(zonelist);

2288 2289
retry:
	page = get_page_from_freelist(gfp_mask, nodemask, order,
2290
					zonelist, high_zoneidx,
2291 2292
					alloc_flags & ~ALLOC_NO_WATERMARKS,
					preferred_zone, migratetype);
2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303

	/*
	 * If an allocation failed after direct reclaim, it could be because
	 * pages are pinned on the per-cpu lists. Drain them and try again
	 */
	if (!page && !drained) {
		drain_all_pages();
		drained = true;
		goto retry;
	}

2304 2305 2306
	return page;
}

L
Linus Torvalds 已提交
2307
/*
2308 2309
 * This is called in the allocator slow-path if the allocation request is of
 * sufficient urgency to ignore watermarks and take other desperate measures
L
Linus Torvalds 已提交
2310
 */
2311 2312 2313
static inline struct page *
__alloc_pages_high_priority(gfp_t gfp_mask, unsigned int order,
	struct zonelist *zonelist, enum zone_type high_zoneidx,
2314 2315
	nodemask_t *nodemask, struct zone *preferred_zone,
	int migratetype)
2316 2317 2318 2319 2320
{
	struct page *page;

	do {
		page = get_page_from_freelist(gfp_mask, nodemask, order,
2321
			zonelist, high_zoneidx, ALLOC_NO_WATERMARKS,
2322
			preferred_zone, migratetype);
2323 2324

		if (!page && gfp_mask & __GFP_NOFAIL)
2325
			wait_iff_congested(preferred_zone, BLK_RW_ASYNC, HZ/50);
2326 2327 2328 2329 2330 2331 2332
	} while (!page && (gfp_mask & __GFP_NOFAIL));

	return page;
}

static inline
void wake_all_kswapd(unsigned int order, struct zonelist *zonelist,
2333 2334
						enum zone_type high_zoneidx,
						enum zone_type classzone_idx)
L
Linus Torvalds 已提交
2335
{
2336 2337
	struct zoneref *z;
	struct zone *zone;
L
Linus Torvalds 已提交
2338

2339
	for_each_zone_zonelist(zone, z, zonelist, high_zoneidx)
2340
		wakeup_kswapd(zone, order, classzone_idx);
2341
}
2342

2343 2344 2345 2346 2347
static inline int
gfp_to_alloc_flags(gfp_t gfp_mask)
{
	int alloc_flags = ALLOC_WMARK_MIN | ALLOC_CPUSET;
	const gfp_t wait = gfp_mask & __GFP_WAIT;
L
Linus Torvalds 已提交
2348

2349
	/* __GFP_HIGH is assumed to be the same as ALLOC_HIGH to save a branch. */
2350
	BUILD_BUG_ON(__GFP_HIGH != (__force gfp_t) ALLOC_HIGH);
2351

2352 2353 2354 2355 2356 2357
	/*
	 * The caller may dip into page reserves a bit more if the caller
	 * cannot run direct reclaim, or if the caller has realtime scheduling
	 * policy or is asking for __GFP_HIGH memory.  GFP_ATOMIC requests will
	 * set both ALLOC_HARDER (!wait) and ALLOC_HIGH (__GFP_HIGH).
	 */
2358
	alloc_flags |= (__force int) (gfp_mask & __GFP_HIGH);
L
Linus Torvalds 已提交
2359

2360
	if (!wait) {
2361 2362 2363 2364 2365 2366
		/*
		 * Not worth trying to allocate harder for
		 * __GFP_NOMEMALLOC even if it can't schedule.
		 */
		if  (!(gfp_mask & __GFP_NOMEMALLOC))
			alloc_flags |= ALLOC_HARDER;
2367
		/*
2368 2369
		 * Ignore cpuset if GFP_ATOMIC (!wait) rather than fail alloc.
		 * See also cpuset_zone_allowed() comment in kernel/cpuset.c.
2370
		 */
2371
		alloc_flags &= ~ALLOC_CPUSET;
2372
	} else if (unlikely(rt_task(current)) && !in_interrupt())
2373 2374
		alloc_flags |= ALLOC_HARDER;

2375 2376 2377
	if (likely(!(gfp_mask & __GFP_NOMEMALLOC))) {
		if (gfp_mask & __GFP_MEMALLOC)
			alloc_flags |= ALLOC_NO_WATERMARKS;
2378 2379 2380 2381 2382
		else if (in_serving_softirq() && (current->flags & PF_MEMALLOC))
			alloc_flags |= ALLOC_NO_WATERMARKS;
		else if (!in_interrupt() &&
				((current->flags & PF_MEMALLOC) ||
				 unlikely(test_thread_flag(TIF_MEMDIE))))
2383
			alloc_flags |= ALLOC_NO_WATERMARKS;
L
Linus Torvalds 已提交
2384
	}
2385 2386 2387 2388
#ifdef CONFIG_CMA
	if (allocflags_to_migratetype(gfp_mask) == MIGRATE_MOVABLE)
		alloc_flags |= ALLOC_CMA;
#endif
2389 2390 2391
	return alloc_flags;
}

2392 2393
bool gfp_pfmemalloc_allowed(gfp_t gfp_mask)
{
2394
	return !!(gfp_to_alloc_flags(gfp_mask) & ALLOC_NO_WATERMARKS);
2395 2396
}

2397 2398 2399
static inline struct page *
__alloc_pages_slowpath(gfp_t gfp_mask, unsigned int order,
	struct zonelist *zonelist, enum zone_type high_zoneidx,
2400 2401
	nodemask_t *nodemask, struct zone *preferred_zone,
	int migratetype)
2402 2403 2404 2405 2406 2407
{
	const gfp_t wait = gfp_mask & __GFP_WAIT;
	struct page *page = NULL;
	int alloc_flags;
	unsigned long pages_reclaimed = 0;
	unsigned long did_some_progress;
2408
	bool sync_migration = false;
2409
	bool deferred_compaction = false;
2410
	bool contended_compaction = false;
L
Linus Torvalds 已提交
2411

2412 2413 2414 2415 2416 2417
	/*
	 * In the slowpath, we sanity check order to avoid ever trying to
	 * reclaim >= MAX_ORDER areas which will never succeed. Callers may
	 * be using allocators in order of preference for an area that is
	 * too large.
	 */
2418 2419
	if (order >= MAX_ORDER) {
		WARN_ON_ONCE(!(gfp_mask & __GFP_NOWARN));
2420
		return NULL;
2421
	}
L
Linus Torvalds 已提交
2422

2423 2424 2425 2426 2427 2428 2429 2430
	/*
	 * GFP_THISNODE (meaning __GFP_THISNODE, __GFP_NORETRY and
	 * __GFP_NOWARN set) should not cause reclaim since the subsystem
	 * (f.e. slab) using GFP_THISNODE may choose to trigger reclaim
	 * using a larger set of nodes after it has established that the
	 * allowed per node queues are empty and that nodes are
	 * over allocated.
	 */
2431 2432
	if (IS_ENABLED(CONFIG_NUMA) &&
			(gfp_mask & GFP_THISNODE) == GFP_THISNODE)
2433 2434
		goto nopage;

2435
restart:
2436 2437 2438
	if (!(gfp_mask & __GFP_NO_KSWAPD))
		wake_all_kswapd(order, zonelist, high_zoneidx,
						zone_idx(preferred_zone));
L
Linus Torvalds 已提交
2439

2440
	/*
R
Rohit Seth 已提交
2441 2442 2443
	 * OK, we're below the kswapd watermark and have kicked background
	 * reclaim. Now things get more complex, so set up alloc_flags according
	 * to how we want to proceed.
2444
	 */
2445
	alloc_flags = gfp_to_alloc_flags(gfp_mask);
L
Linus Torvalds 已提交
2446

2447 2448 2449 2450 2451 2452 2453 2454
	/*
	 * Find the true preferred zone if the allocation is unconstrained by
	 * cpusets.
	 */
	if (!(alloc_flags & ALLOC_CPUSET) && !nodemask)
		first_zones_zonelist(zonelist, high_zoneidx, NULL,
					&preferred_zone);

2455
rebalance:
2456
	/* This is the last chance, in general, before the goto nopage. */
2457
	page = get_page_from_freelist(gfp_mask, nodemask, order, zonelist,
2458 2459
			high_zoneidx, alloc_flags & ~ALLOC_NO_WATERMARKS,
			preferred_zone, migratetype);
R
Rohit Seth 已提交
2460 2461
	if (page)
		goto got_pg;
L
Linus Torvalds 已提交
2462

2463
	/* Allocate without watermarks if the context allows */
2464
	if (alloc_flags & ALLOC_NO_WATERMARKS) {
2465 2466 2467 2468 2469 2470 2471
		/*
		 * Ignore mempolicies if ALLOC_NO_WATERMARKS on the grounds
		 * the allocation is high priority and these type of
		 * allocations are system rather than user orientated
		 */
		zonelist = node_zonelist(numa_node_id(), gfp_mask);

2472 2473 2474
		page = __alloc_pages_high_priority(gfp_mask, order,
				zonelist, high_zoneidx, nodemask,
				preferred_zone, migratetype);
2475
		if (page) {
2476
			goto got_pg;
2477
		}
L
Linus Torvalds 已提交
2478 2479 2480 2481 2482 2483
	}

	/* Atomic allocations - we can't balance anything */
	if (!wait)
		goto nopage;

2484
	/* Avoid recursion of direct reclaim */
2485
	if (current->flags & PF_MEMALLOC)
2486 2487
		goto nopage;

2488 2489 2490 2491
	/* Avoid allocations with no watermarks from looping endlessly */
	if (test_thread_flag(TIF_MEMDIE) && !(gfp_mask & __GFP_NOFAIL))
		goto nopage;

2492 2493 2494 2495
	/*
	 * Try direct compaction. The first pass is asynchronous. Subsequent
	 * attempts after direct reclaim are synchronous
	 */
2496 2497 2498 2499
	page = __alloc_pages_direct_compact(gfp_mask, order,
					zonelist, high_zoneidx,
					nodemask,
					alloc_flags, preferred_zone,
2500
					migratetype, sync_migration,
2501
					&contended_compaction,
2502 2503
					&deferred_compaction,
					&did_some_progress);
2504 2505
	if (page)
		goto got_pg;
2506
	sync_migration = true;
2507

2508 2509 2510 2511 2512 2513 2514
	/*
	 * If compaction is deferred for high-order allocations, it is because
	 * sync compaction recently failed. In this is the case and the caller
	 * requested a movable allocation that does not heavily disrupt the
	 * system then fail the allocation instead of entering direct reclaim.
	 */
	if ((deferred_compaction || contended_compaction) &&
2515
						(gfp_mask & __GFP_NO_KSWAPD))
2516
		goto nopage;
2517

2518 2519 2520 2521
	/* Try direct reclaim and then allocating */
	page = __alloc_pages_direct_reclaim(gfp_mask, order,
					zonelist, high_zoneidx,
					nodemask,
2522
					alloc_flags, preferred_zone,
2523
					migratetype, &did_some_progress);
2524 2525
	if (page)
		goto got_pg;
L
Linus Torvalds 已提交
2526

2527
	/*
2528 2529
	 * If we failed to make any progress reclaiming, then we are
	 * running out of options and have to consider going OOM
2530
	 */
2531 2532
	if (!did_some_progress) {
		if ((gfp_mask & __GFP_FS) && !(gfp_mask & __GFP_NORETRY)) {
2533 2534
			if (oom_killer_disabled)
				goto nopage;
2535 2536 2537 2538
			/* Coredumps can quickly deplete all memory reserves */
			if ((current->flags & PF_DUMPCORE) &&
			    !(gfp_mask & __GFP_NOFAIL))
				goto nopage;
2539 2540
			page = __alloc_pages_may_oom(gfp_mask, order,
					zonelist, high_zoneidx,
2541 2542
					nodemask, preferred_zone,
					migratetype);
2543 2544
			if (page)
				goto got_pg;
L
Linus Torvalds 已提交
2545

2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562
			if (!(gfp_mask & __GFP_NOFAIL)) {
				/*
				 * The oom killer is not called for high-order
				 * allocations that may fail, so if no progress
				 * is being made, there are no other options and
				 * retrying is unlikely to help.
				 */
				if (order > PAGE_ALLOC_COSTLY_ORDER)
					goto nopage;
				/*
				 * The oom killer is not called for lowmem
				 * allocations to prevent needlessly killing
				 * innocent tasks.
				 */
				if (high_zoneidx < ZONE_NORMAL)
					goto nopage;
			}
2563

2564 2565
			goto restart;
		}
L
Linus Torvalds 已提交
2566 2567
	}

2568
	/* Check if we should retry the allocation */
2569
	pages_reclaimed += did_some_progress;
2570 2571
	if (should_alloc_retry(gfp_mask, order, did_some_progress,
						pages_reclaimed)) {
2572
		/* Wait for some write requests to complete then retry */
2573
		wait_iff_congested(preferred_zone, BLK_RW_ASYNC, HZ/50);
L
Linus Torvalds 已提交
2574
		goto rebalance;
2575 2576 2577 2578 2579 2580 2581 2582 2583 2584
	} else {
		/*
		 * High-order allocations do not necessarily loop after
		 * direct reclaim and reclaim/compaction depends on compaction
		 * being called after reclaim so call directly if necessary
		 */
		page = __alloc_pages_direct_compact(gfp_mask, order,
					zonelist, high_zoneidx,
					nodemask,
					alloc_flags, preferred_zone,
2585
					migratetype, sync_migration,
2586
					&contended_compaction,
2587 2588
					&deferred_compaction,
					&did_some_progress);
2589 2590
		if (page)
			goto got_pg;
L
Linus Torvalds 已提交
2591 2592 2593
	}

nopage:
2594
	warn_alloc_failed(gfp_mask, order, NULL);
2595
	return page;
L
Linus Torvalds 已提交
2596
got_pg:
2597 2598
	if (kmemcheck_enabled)
		kmemcheck_pagealloc_alloc(page, order, gfp_mask);
2599

2600
	return page;
L
Linus Torvalds 已提交
2601
}
2602 2603 2604 2605 2606 2607 2608 2609 2610

/*
 * This is the 'heart' of the zoned buddy allocator.
 */
struct page *
__alloc_pages_nodemask(gfp_t gfp_mask, unsigned int order,
			struct zonelist *zonelist, nodemask_t *nodemask)
{
	enum zone_type high_zoneidx = gfp_zone(gfp_mask);
2611
	struct zone *preferred_zone;
2612
	struct page *page = NULL;
2613
	int migratetype = allocflags_to_migratetype(gfp_mask);
2614
	unsigned int cpuset_mems_cookie;
2615
	int alloc_flags = ALLOC_WMARK_LOW|ALLOC_CPUSET;
2616

2617 2618
	gfp_mask &= gfp_allowed_mask;

2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633
	lockdep_trace_alloc(gfp_mask);

	might_sleep_if(gfp_mask & __GFP_WAIT);

	if (should_fail_alloc_page(gfp_mask, order))
		return NULL;

	/*
	 * Check the zones suitable for the gfp_mask contain at least one
	 * valid zone. It's possible to have an empty zonelist as a result
	 * of GFP_THISNODE and a memoryless node
	 */
	if (unlikely(!zonelist->_zonerefs->zone))
		return NULL;

2634 2635 2636
retry_cpuset:
	cpuset_mems_cookie = get_mems_allowed();

2637
	/* The preferred zone is used for statistics later */
2638 2639 2640
	first_zones_zonelist(zonelist, high_zoneidx,
				nodemask ? : &cpuset_current_mems_allowed,
				&preferred_zone);
2641 2642
	if (!preferred_zone)
		goto out;
2643

2644 2645 2646 2647
#ifdef CONFIG_CMA
	if (allocflags_to_migratetype(gfp_mask) == MIGRATE_MOVABLE)
		alloc_flags |= ALLOC_CMA;
#endif
2648
	/* First allocation attempt */
2649
	page = get_page_from_freelist(gfp_mask|__GFP_HARDWALL, nodemask, order,
2650
			zonelist, high_zoneidx, alloc_flags,
2651
			preferred_zone, migratetype);
2652 2653
	if (unlikely(!page))
		page = __alloc_pages_slowpath(gfp_mask, order,
2654
				zonelist, high_zoneidx, nodemask,
2655
				preferred_zone, migratetype);
2656

2657
	trace_mm_page_alloc(page, order, gfp_mask, migratetype);
2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668

out:
	/*
	 * When updating a task's mems_allowed, it is possible to race with
	 * parallel threads in such a way that an allocation can fail while
	 * the mask is being updated. If a page allocation is about to fail,
	 * check if the cpuset changed during allocation and if so, retry.
	 */
	if (unlikely(!put_mems_allowed(cpuset_mems_cookie) && !page))
		goto retry_cpuset;

2669
	return page;
L
Linus Torvalds 已提交
2670
}
2671
EXPORT_SYMBOL(__alloc_pages_nodemask);
L
Linus Torvalds 已提交
2672 2673 2674 2675

/*
 * Common helper functions.
 */
H
Harvey Harrison 已提交
2676
unsigned long __get_free_pages(gfp_t gfp_mask, unsigned int order)
L
Linus Torvalds 已提交
2677
{
2678 2679 2680 2681 2682 2683 2684 2685
	struct page *page;

	/*
	 * __get_free_pages() returns a 32-bit address, which cannot represent
	 * a highmem page
	 */
	VM_BUG_ON((gfp_mask & __GFP_HIGHMEM) != 0);

L
Linus Torvalds 已提交
2686 2687 2688 2689 2690 2691 2692
	page = alloc_pages(gfp_mask, order);
	if (!page)
		return 0;
	return (unsigned long) page_address(page);
}
EXPORT_SYMBOL(__get_free_pages);

H
Harvey Harrison 已提交
2693
unsigned long get_zeroed_page(gfp_t gfp_mask)
L
Linus Torvalds 已提交
2694
{
2695
	return __get_free_pages(gfp_mask | __GFP_ZERO, 0);
L
Linus Torvalds 已提交
2696 2697 2698
}
EXPORT_SYMBOL(get_zeroed_page);

H
Harvey Harrison 已提交
2699
void __free_pages(struct page *page, unsigned int order)
L
Linus Torvalds 已提交
2700
{
N
Nick Piggin 已提交
2701
	if (put_page_testzero(page)) {
L
Linus Torvalds 已提交
2702
		if (order == 0)
L
Li Hong 已提交
2703
			free_hot_cold_page(page, 0);
L
Linus Torvalds 已提交
2704 2705 2706 2707 2708 2709 2710
		else
			__free_pages_ok(page, order);
	}
}

EXPORT_SYMBOL(__free_pages);

H
Harvey Harrison 已提交
2711
void free_pages(unsigned long addr, unsigned int order)
L
Linus Torvalds 已提交
2712 2713
{
	if (addr != 0) {
N
Nick Piggin 已提交
2714
		VM_BUG_ON(!virt_addr_valid((void *)addr));
L
Linus Torvalds 已提交
2715 2716 2717 2718 2719 2720
		__free_pages(virt_to_page((void *)addr), order);
	}
}

EXPORT_SYMBOL(free_pages);

A
Andi Kleen 已提交
2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735
static void *make_alloc_exact(unsigned long addr, unsigned order, size_t size)
{
	if (addr) {
		unsigned long alloc_end = addr + (PAGE_SIZE << order);
		unsigned long used = addr + PAGE_ALIGN(size);

		split_page(virt_to_page((void *)addr), order);
		while (used < alloc_end) {
			free_page(used);
			used += PAGE_SIZE;
		}
	}
	return (void *)addr;
}

2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754
/**
 * alloc_pages_exact - allocate an exact number physically-contiguous pages.
 * @size: the number of bytes to allocate
 * @gfp_mask: GFP flags for the allocation
 *
 * This function is similar to alloc_pages(), except that it allocates the
 * minimum number of pages to satisfy the request.  alloc_pages() can only
 * allocate memory in power-of-two pages.
 *
 * This function is also limited by MAX_ORDER.
 *
 * Memory allocated by this function must be released by free_pages_exact().
 */
void *alloc_pages_exact(size_t size, gfp_t gfp_mask)
{
	unsigned int order = get_order(size);
	unsigned long addr;

	addr = __get_free_pages(gfp_mask, order);
A
Andi Kleen 已提交
2755
	return make_alloc_exact(addr, order, size);
2756 2757 2758
}
EXPORT_SYMBOL(alloc_pages_exact);

A
Andi Kleen 已提交
2759 2760 2761
/**
 * alloc_pages_exact_nid - allocate an exact number of physically-contiguous
 *			   pages on a node.
2762
 * @nid: the preferred node ID where memory should be allocated
A
Andi Kleen 已提交
2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780
 * @size: the number of bytes to allocate
 * @gfp_mask: GFP flags for the allocation
 *
 * Like alloc_pages_exact(), but try to allocate on node nid first before falling
 * back.
 * Note this is not alloc_pages_exact_node() which allocates on a specific node,
 * but is not exact.
 */
void *alloc_pages_exact_nid(int nid, size_t size, gfp_t gfp_mask)
{
	unsigned order = get_order(size);
	struct page *p = alloc_pages_node(nid, gfp_mask, order);
	if (!p)
		return NULL;
	return make_alloc_exact((unsigned long)page_address(p), order, size);
}
EXPORT_SYMBOL(alloc_pages_exact_nid);

2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799
/**
 * free_pages_exact - release memory allocated via alloc_pages_exact()
 * @virt: the value returned by alloc_pages_exact.
 * @size: size of allocation, same value as passed to alloc_pages_exact().
 *
 * Release the memory allocated by a previous call to alloc_pages_exact.
 */
void free_pages_exact(void *virt, size_t size)
{
	unsigned long addr = (unsigned long)virt;
	unsigned long end = addr + PAGE_ALIGN(size);

	while (addr < end) {
		free_page(addr);
		addr += PAGE_SIZE;
	}
}
EXPORT_SYMBOL(free_pages_exact);

L
Linus Torvalds 已提交
2800 2801
static unsigned int nr_free_zone_pages(int offset)
{
2802
	struct zoneref *z;
2803 2804
	struct zone *zone;

2805
	/* Just pick one node, since fallback list is circular */
L
Linus Torvalds 已提交
2806 2807
	unsigned int sum = 0;

2808
	struct zonelist *zonelist = node_zonelist(numa_node_id(), GFP_KERNEL);
L
Linus Torvalds 已提交
2809

2810
	for_each_zone_zonelist(zone, z, zonelist, offset) {
2811
		unsigned long size = zone->present_pages;
2812
		unsigned long high = high_wmark_pages(zone);
2813 2814
		if (size > high)
			sum += size - high;
L
Linus Torvalds 已提交
2815 2816 2817 2818 2819 2820 2821 2822 2823 2824
	}

	return sum;
}

/*
 * Amount of free RAM allocatable within ZONE_DMA and ZONE_NORMAL
 */
unsigned int nr_free_buffer_pages(void)
{
A
Al Viro 已提交
2825
	return nr_free_zone_pages(gfp_zone(GFP_USER));
L
Linus Torvalds 已提交
2826
}
2827
EXPORT_SYMBOL_GPL(nr_free_buffer_pages);
L
Linus Torvalds 已提交
2828 2829 2830 2831 2832 2833

/*
 * Amount of free RAM allocatable within all zones
 */
unsigned int nr_free_pagecache_pages(void)
{
M
Mel Gorman 已提交
2834
	return nr_free_zone_pages(gfp_zone(GFP_HIGHUSER_MOVABLE));
L
Linus Torvalds 已提交
2835
}
2836 2837

static inline void show_node(struct zone *zone)
L
Linus Torvalds 已提交
2838
{
2839
	if (IS_ENABLED(CONFIG_NUMA))
2840
		printk("Node %d ", zone_to_nid(zone));
L
Linus Torvalds 已提交
2841 2842 2843 2844 2845 2846
}

void si_meminfo(struct sysinfo *val)
{
	val->totalram = totalram_pages;
	val->sharedram = 0;
2847
	val->freeram = global_page_state(NR_FREE_PAGES);
L
Linus Torvalds 已提交
2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861
	val->bufferram = nr_blockdev_pages();
	val->totalhigh = totalhigh_pages;
	val->freehigh = nr_free_highpages();
	val->mem_unit = PAGE_SIZE;
}

EXPORT_SYMBOL(si_meminfo);

#ifdef CONFIG_NUMA
void si_meminfo_node(struct sysinfo *val, int nid)
{
	pg_data_t *pgdat = NODE_DATA(nid);

	val->totalram = pgdat->node_present_pages;
2862
	val->freeram = node_page_state(nid, NR_FREE_PAGES);
2863
#ifdef CONFIG_HIGHMEM
L
Linus Torvalds 已提交
2864
	val->totalhigh = pgdat->node_zones[ZONE_HIGHMEM].present_pages;
2865 2866
	val->freehigh = zone_page_state(&pgdat->node_zones[ZONE_HIGHMEM],
			NR_FREE_PAGES);
2867 2868 2869 2870
#else
	val->totalhigh = 0;
	val->freehigh = 0;
#endif
L
Linus Torvalds 已提交
2871 2872 2873 2874
	val->mem_unit = PAGE_SIZE;
}
#endif

2875
/*
2876 2877
 * Determine whether the node should be displayed or not, depending on whether
 * SHOW_MEM_FILTER_NODES was passed to show_free_areas().
2878
 */
2879
bool skip_free_areas_node(unsigned int flags, int nid)
2880 2881
{
	bool ret = false;
2882
	unsigned int cpuset_mems_cookie;
2883 2884 2885 2886

	if (!(flags & SHOW_MEM_FILTER_NODES))
		goto out;

2887 2888 2889 2890
	do {
		cpuset_mems_cookie = get_mems_allowed();
		ret = !node_isset(nid, cpuset_current_mems_allowed);
	} while (!put_mems_allowed(cpuset_mems_cookie));
2891 2892 2893 2894
out:
	return ret;
}

L
Linus Torvalds 已提交
2895 2896
#define K(x) ((x) << (PAGE_SHIFT-10))

2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921
static void show_migration_types(unsigned char type)
{
	static const char types[MIGRATE_TYPES] = {
		[MIGRATE_UNMOVABLE]	= 'U',
		[MIGRATE_RECLAIMABLE]	= 'E',
		[MIGRATE_MOVABLE]	= 'M',
		[MIGRATE_RESERVE]	= 'R',
#ifdef CONFIG_CMA
		[MIGRATE_CMA]		= 'C',
#endif
		[MIGRATE_ISOLATE]	= 'I',
	};
	char tmp[MIGRATE_TYPES + 1];
	char *p = tmp;
	int i;

	for (i = 0; i < MIGRATE_TYPES; i++) {
		if (type & (1 << i))
			*p++ = types[i];
	}

	*p = '\0';
	printk("(%s) ", tmp);
}

L
Linus Torvalds 已提交
2922 2923 2924 2925
/*
 * Show free area list (used inside shift_scroll-lock stuff)
 * We also calculate the percentage fragmentation. We do this by counting the
 * memory on each free list with the exception of the first item on the list.
2926 2927
 * Suppresses nodes that are not allowed by current's cpuset if
 * SHOW_MEM_FILTER_NODES is passed.
L
Linus Torvalds 已提交
2928
 */
2929
void show_free_areas(unsigned int filter)
L
Linus Torvalds 已提交
2930
{
2931
	int cpu;
L
Linus Torvalds 已提交
2932 2933
	struct zone *zone;

2934
	for_each_populated_zone(zone) {
2935
		if (skip_free_areas_node(filter, zone_to_nid(zone)))
2936
			continue;
2937 2938
		show_node(zone);
		printk("%s per-cpu:\n", zone->name);
L
Linus Torvalds 已提交
2939

2940
		for_each_online_cpu(cpu) {
L
Linus Torvalds 已提交
2941 2942
			struct per_cpu_pageset *pageset;

2943
			pageset = per_cpu_ptr(zone->pageset, cpu);
L
Linus Torvalds 已提交
2944

2945 2946 2947
			printk("CPU %4d: hi:%5d, btch:%4d usd:%4d\n",
			       cpu, pageset->pcp.high,
			       pageset->pcp.batch, pageset->pcp.count);
L
Linus Torvalds 已提交
2948 2949 2950
		}
	}

K
KOSAKI Motohiro 已提交
2951 2952
	printk("active_anon:%lu inactive_anon:%lu isolated_anon:%lu\n"
		" active_file:%lu inactive_file:%lu isolated_file:%lu\n"
L
Lee Schermerhorn 已提交
2953
		" unevictable:%lu"
2954
		" dirty:%lu writeback:%lu unstable:%lu\n"
2955
		" free:%lu slab_reclaimable:%lu slab_unreclaimable:%lu\n"
2956 2957
		" mapped:%lu shmem:%lu pagetables:%lu bounce:%lu\n"
		" free_cma:%lu\n",
2958 2959
		global_page_state(NR_ACTIVE_ANON),
		global_page_state(NR_INACTIVE_ANON),
K
KOSAKI Motohiro 已提交
2960 2961
		global_page_state(NR_ISOLATED_ANON),
		global_page_state(NR_ACTIVE_FILE),
2962
		global_page_state(NR_INACTIVE_FILE),
K
KOSAKI Motohiro 已提交
2963
		global_page_state(NR_ISOLATED_FILE),
L
Lee Schermerhorn 已提交
2964
		global_page_state(NR_UNEVICTABLE),
2965
		global_page_state(NR_FILE_DIRTY),
2966
		global_page_state(NR_WRITEBACK),
2967
		global_page_state(NR_UNSTABLE_NFS),
2968
		global_page_state(NR_FREE_PAGES),
2969 2970
		global_page_state(NR_SLAB_RECLAIMABLE),
		global_page_state(NR_SLAB_UNRECLAIMABLE),
2971
		global_page_state(NR_FILE_MAPPED),
2972
		global_page_state(NR_SHMEM),
2973
		global_page_state(NR_PAGETABLE),
2974 2975
		global_page_state(NR_BOUNCE),
		global_page_state(NR_FREE_CMA_PAGES));
L
Linus Torvalds 已提交
2976

2977
	for_each_populated_zone(zone) {
L
Linus Torvalds 已提交
2978 2979
		int i;

2980
		if (skip_free_areas_node(filter, zone_to_nid(zone)))
2981
			continue;
L
Linus Torvalds 已提交
2982 2983 2984 2985 2986 2987
		show_node(zone);
		printk("%s"
			" free:%lukB"
			" min:%lukB"
			" low:%lukB"
			" high:%lukB"
2988 2989 2990 2991
			" active_anon:%lukB"
			" inactive_anon:%lukB"
			" active_file:%lukB"
			" inactive_file:%lukB"
L
Lee Schermerhorn 已提交
2992
			" unevictable:%lukB"
K
KOSAKI Motohiro 已提交
2993 2994
			" isolated(anon):%lukB"
			" isolated(file):%lukB"
L
Linus Torvalds 已提交
2995
			" present:%lukB"
2996
			" managed:%lukB"
2997 2998 2999 3000
			" mlocked:%lukB"
			" dirty:%lukB"
			" writeback:%lukB"
			" mapped:%lukB"
3001
			" shmem:%lukB"
3002 3003
			" slab_reclaimable:%lukB"
			" slab_unreclaimable:%lukB"
3004
			" kernel_stack:%lukB"
3005 3006 3007
			" pagetables:%lukB"
			" unstable:%lukB"
			" bounce:%lukB"
3008
			" free_cma:%lukB"
3009
			" writeback_tmp:%lukB"
L
Linus Torvalds 已提交
3010 3011 3012 3013
			" pages_scanned:%lu"
			" all_unreclaimable? %s"
			"\n",
			zone->name,
3014
			K(zone_page_state(zone, NR_FREE_PAGES)),
3015 3016 3017
			K(min_wmark_pages(zone)),
			K(low_wmark_pages(zone)),
			K(high_wmark_pages(zone)),
3018 3019 3020 3021
			K(zone_page_state(zone, NR_ACTIVE_ANON)),
			K(zone_page_state(zone, NR_INACTIVE_ANON)),
			K(zone_page_state(zone, NR_ACTIVE_FILE)),
			K(zone_page_state(zone, NR_INACTIVE_FILE)),
L
Lee Schermerhorn 已提交
3022
			K(zone_page_state(zone, NR_UNEVICTABLE)),
K
KOSAKI Motohiro 已提交
3023 3024
			K(zone_page_state(zone, NR_ISOLATED_ANON)),
			K(zone_page_state(zone, NR_ISOLATED_FILE)),
L
Linus Torvalds 已提交
3025
			K(zone->present_pages),
3026
			K(zone->managed_pages),
3027 3028 3029 3030
			K(zone_page_state(zone, NR_MLOCK)),
			K(zone_page_state(zone, NR_FILE_DIRTY)),
			K(zone_page_state(zone, NR_WRITEBACK)),
			K(zone_page_state(zone, NR_FILE_MAPPED)),
3031
			K(zone_page_state(zone, NR_SHMEM)),
3032 3033
			K(zone_page_state(zone, NR_SLAB_RECLAIMABLE)),
			K(zone_page_state(zone, NR_SLAB_UNRECLAIMABLE)),
3034 3035
			zone_page_state(zone, NR_KERNEL_STACK) *
				THREAD_SIZE / 1024,
3036 3037 3038
			K(zone_page_state(zone, NR_PAGETABLE)),
			K(zone_page_state(zone, NR_UNSTABLE_NFS)),
			K(zone_page_state(zone, NR_BOUNCE)),
3039
			K(zone_page_state(zone, NR_FREE_CMA_PAGES)),
3040
			K(zone_page_state(zone, NR_WRITEBACK_TEMP)),
L
Linus Torvalds 已提交
3041
			zone->pages_scanned,
3042
			(zone->all_unreclaimable ? "yes" : "no")
L
Linus Torvalds 已提交
3043 3044 3045 3046 3047 3048 3049
			);
		printk("lowmem_reserve[]:");
		for (i = 0; i < MAX_NR_ZONES; i++)
			printk(" %lu", zone->lowmem_reserve[i]);
		printk("\n");
	}

3050
	for_each_populated_zone(zone) {
3051
 		unsigned long nr[MAX_ORDER], flags, order, total = 0;
3052
		unsigned char types[MAX_ORDER];
L
Linus Torvalds 已提交
3053

3054
		if (skip_free_areas_node(filter, zone_to_nid(zone)))
3055
			continue;
L
Linus Torvalds 已提交
3056 3057 3058 3059 3060
		show_node(zone);
		printk("%s: ", zone->name);

		spin_lock_irqsave(&zone->lock, flags);
		for (order = 0; order < MAX_ORDER; order++) {
3061 3062 3063 3064
			struct free_area *area = &zone->free_area[order];
			int type;

			nr[order] = area->nr_free;
3065
			total += nr[order] << order;
3066 3067 3068 3069 3070 3071

			types[order] = 0;
			for (type = 0; type < MIGRATE_TYPES; type++) {
				if (!list_empty(&area->free_list[type]))
					types[order] |= 1 << type;
			}
L
Linus Torvalds 已提交
3072 3073
		}
		spin_unlock_irqrestore(&zone->lock, flags);
3074
		for (order = 0; order < MAX_ORDER; order++) {
3075
			printk("%lu*%lukB ", nr[order], K(1UL) << order);
3076 3077 3078
			if (nr[order])
				show_migration_types(types[order]);
		}
L
Linus Torvalds 已提交
3079 3080 3081
		printk("= %lukB\n", K(total));
	}

3082 3083
	printk("%ld total pagecache pages\n", global_page_state(NR_FILE_PAGES));

L
Linus Torvalds 已提交
3084 3085 3086
	show_swap_cache_info();
}

3087 3088 3089 3090 3091 3092
static void zoneref_set_zone(struct zone *zone, struct zoneref *zoneref)
{
	zoneref->zone = zone;
	zoneref->zone_idx = zone_idx(zone);
}

L
Linus Torvalds 已提交
3093 3094
/*
 * Builds allocation fallback zone lists.
3095 3096
 *
 * Add all populated zones of a node to the zonelist.
L
Linus Torvalds 已提交
3097
 */
3098 3099
static int build_zonelists_node(pg_data_t *pgdat, struct zonelist *zonelist,
				int nr_zones, enum zone_type zone_type)
L
Linus Torvalds 已提交
3100
{
3101 3102
	struct zone *zone;

3103
	BUG_ON(zone_type >= MAX_NR_ZONES);
3104
	zone_type++;
3105 3106

	do {
3107
		zone_type--;
3108
		zone = pgdat->node_zones + zone_type;
3109
		if (populated_zone(zone)) {
3110 3111
			zoneref_set_zone(zone,
				&zonelist->_zonerefs[nr_zones++]);
3112
			check_highest_zone(zone_type);
L
Linus Torvalds 已提交
3113
		}
3114

3115
	} while (zone_type);
3116
	return nr_zones;
L
Linus Torvalds 已提交
3117 3118
}

3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139

/*
 *  zonelist_order:
 *  0 = automatic detection of better ordering.
 *  1 = order by ([node] distance, -zonetype)
 *  2 = order by (-zonetype, [node] distance)
 *
 *  If not NUMA, ZONELIST_ORDER_ZONE and ZONELIST_ORDER_NODE will create
 *  the same zonelist. So only NUMA can configure this param.
 */
#define ZONELIST_ORDER_DEFAULT  0
#define ZONELIST_ORDER_NODE     1
#define ZONELIST_ORDER_ZONE     2

/* zonelist order in the kernel.
 * set_zonelist_order() will set this to NODE or ZONE.
 */
static int current_zonelist_order = ZONELIST_ORDER_DEFAULT;
static char zonelist_order_name[3][8] = {"Default", "Node", "Zone"};


L
Linus Torvalds 已提交
3140
#ifdef CONFIG_NUMA
3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173
/* The value user specified ....changed by config */
static int user_zonelist_order = ZONELIST_ORDER_DEFAULT;
/* string for sysctl */
#define NUMA_ZONELIST_ORDER_LEN	16
char numa_zonelist_order[16] = "default";

/*
 * interface for configure zonelist ordering.
 * command line option "numa_zonelist_order"
 *	= "[dD]efault	- default, automatic configuration.
 *	= "[nN]ode 	- order by node locality, then by zone within node
 *	= "[zZ]one      - order by zone, then by locality within zone
 */

static int __parse_numa_zonelist_order(char *s)
{
	if (*s == 'd' || *s == 'D') {
		user_zonelist_order = ZONELIST_ORDER_DEFAULT;
	} else if (*s == 'n' || *s == 'N') {
		user_zonelist_order = ZONELIST_ORDER_NODE;
	} else if (*s == 'z' || *s == 'Z') {
		user_zonelist_order = ZONELIST_ORDER_ZONE;
	} else {
		printk(KERN_WARNING
			"Ignoring invalid numa_zonelist_order value:  "
			"%s\n", s);
		return -EINVAL;
	}
	return 0;
}

static __init int setup_numa_zonelist_order(char *s)
{
3174 3175 3176 3177 3178 3179 3180 3181 3182 3183
	int ret;

	if (!s)
		return 0;

	ret = __parse_numa_zonelist_order(s);
	if (ret == 0)
		strlcpy(numa_zonelist_order, s, NUMA_ZONELIST_ORDER_LEN);

	return ret;
3184 3185 3186 3187 3188 3189 3190
}
early_param("numa_zonelist_order", setup_numa_zonelist_order);

/*
 * sysctl handler for numa_zonelist_order
 */
int numa_zonelist_order_handler(ctl_table *table, int write,
3191
		void __user *buffer, size_t *length,
3192 3193 3194 3195
		loff_t *ppos)
{
	char saved_string[NUMA_ZONELIST_ORDER_LEN];
	int ret;
3196
	static DEFINE_MUTEX(zl_order_mutex);
3197

3198
	mutex_lock(&zl_order_mutex);
3199
	if (write)
3200
		strcpy(saved_string, (char*)table->data);
3201
	ret = proc_dostring(table, write, buffer, length, ppos);
3202
	if (ret)
3203
		goto out;
3204 3205 3206 3207 3208 3209 3210 3211 3212
	if (write) {
		int oldval = user_zonelist_order;
		if (__parse_numa_zonelist_order((char*)table->data)) {
			/*
			 * bogus value.  restore saved string
			 */
			strncpy((char*)table->data, saved_string,
				NUMA_ZONELIST_ORDER_LEN);
			user_zonelist_order = oldval;
3213 3214
		} else if (oldval != user_zonelist_order) {
			mutex_lock(&zonelists_mutex);
3215
			build_all_zonelists(NULL, NULL);
3216 3217
			mutex_unlock(&zonelists_mutex);
		}
3218
	}
3219 3220 3221
out:
	mutex_unlock(&zl_order_mutex);
	return ret;
3222 3223 3224
}


3225
#define MAX_NODE_LOAD (nr_online_nodes)
3226 3227
static int node_load[MAX_NUMNODES];

L
Linus Torvalds 已提交
3228
/**
3229
 * find_next_best_node - find the next node that should appear in a given node's fallback list
L
Linus Torvalds 已提交
3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241
 * @node: node whose fallback list we're appending
 * @used_node_mask: nodemask_t of already used nodes
 *
 * We use a number of factors to determine which is the next node that should
 * appear on a given node's fallback list.  The node should not have appeared
 * already in @node's fallback list, and it should be the next closest node
 * according to the distance array (which contains arbitrary distance values
 * from each node to each node in the system), and should also prefer nodes
 * with no CPUs, since presumably they'll have very little allocation pressure
 * on them otherwise.
 * It returns -1 if no node is found.
 */
3242
static int find_next_best_node(int node, nodemask_t *used_node_mask)
L
Linus Torvalds 已提交
3243
{
3244
	int n, val;
L
Linus Torvalds 已提交
3245 3246
	int min_val = INT_MAX;
	int best_node = -1;
3247
	const struct cpumask *tmp = cpumask_of_node(0);
L
Linus Torvalds 已提交
3248

3249 3250 3251 3252 3253
	/* Use the local node if we haven't already */
	if (!node_isset(node, *used_node_mask)) {
		node_set(node, *used_node_mask);
		return node;
	}
L
Linus Torvalds 已提交
3254

3255
	for_each_node_state(n, N_MEMORY) {
L
Linus Torvalds 已提交
3256 3257 3258 3259 3260 3261 3262 3263

		/* Don't want a node to appear more than once */
		if (node_isset(n, *used_node_mask))
			continue;

		/* Use the distance array to find the distance */
		val = node_distance(node, n);

3264 3265 3266
		/* Penalize nodes under us ("prefer the next node") */
		val += (n < node);

L
Linus Torvalds 已提交
3267
		/* Give preference to headless and unused nodes */
3268 3269
		tmp = cpumask_of_node(n);
		if (!cpumask_empty(tmp))
L
Linus Torvalds 已提交
3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285 3286 3287
			val += PENALTY_FOR_NODE_WITH_CPUS;

		/* Slight preference for less loaded node */
		val *= (MAX_NODE_LOAD*MAX_NUMNODES);
		val += node_load[n];

		if (val < min_val) {
			min_val = val;
			best_node = n;
		}
	}

	if (best_node >= 0)
		node_set(best_node, *used_node_mask);

	return best_node;
}

3288 3289 3290 3291 3292 3293 3294

/*
 * Build zonelists ordered by node and zones within node.
 * This results in maximum locality--normal zone overflows into local
 * DMA zone, if any--but risks exhausting DMA zone.
 */
static void build_zonelists_in_node_order(pg_data_t *pgdat, int node)
L
Linus Torvalds 已提交
3295
{
3296
	int j;
L
Linus Torvalds 已提交
3297
	struct zonelist *zonelist;
3298

3299
	zonelist = &pgdat->node_zonelists[0];
3300
	for (j = 0; zonelist->_zonerefs[j].zone != NULL; j++)
3301 3302 3303
		;
	j = build_zonelists_node(NODE_DATA(node), zonelist, j,
							MAX_NR_ZONES - 1);
3304 3305
	zonelist->_zonerefs[j].zone = NULL;
	zonelist->_zonerefs[j].zone_idx = 0;
3306 3307
}

3308 3309 3310 3311 3312 3313 3314 3315
/*
 * Build gfp_thisnode zonelists
 */
static void build_thisnode_zonelists(pg_data_t *pgdat)
{
	int j;
	struct zonelist *zonelist;

3316 3317
	zonelist = &pgdat->node_zonelists[1];
	j = build_zonelists_node(pgdat, zonelist, 0, MAX_NR_ZONES - 1);
3318 3319
	zonelist->_zonerefs[j].zone = NULL;
	zonelist->_zonerefs[j].zone_idx = 0;
3320 3321
}

3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336
/*
 * Build zonelists ordered by zone and nodes within zones.
 * This results in conserving DMA zone[s] until all Normal memory is
 * exhausted, but results in overflowing to remote node while memory
 * may still exist in local DMA zone.
 */
static int node_order[MAX_NUMNODES];

static void build_zonelists_in_zone_order(pg_data_t *pgdat, int nr_nodes)
{
	int pos, j, node;
	int zone_type;		/* needs to be signed */
	struct zone *z;
	struct zonelist *zonelist;

3337 3338 3339 3340 3341 3342 3343
	zonelist = &pgdat->node_zonelists[0];
	pos = 0;
	for (zone_type = MAX_NR_ZONES - 1; zone_type >= 0; zone_type--) {
		for (j = 0; j < nr_nodes; j++) {
			node = node_order[j];
			z = &NODE_DATA(node)->node_zones[zone_type];
			if (populated_zone(z)) {
3344 3345
				zoneref_set_zone(z,
					&zonelist->_zonerefs[pos++]);
3346
				check_highest_zone(zone_type);
3347 3348 3349
			}
		}
	}
3350 3351
	zonelist->_zonerefs[pos].zone = NULL;
	zonelist->_zonerefs[pos].zone_idx = 0;
3352 3353 3354 3355 3356 3357 3358 3359 3360
}

static int default_zonelist_order(void)
{
	int nid, zone_type;
	unsigned long low_kmem_size,total_size;
	struct zone *z;
	int average_size;
	/*
T
Thomas Weber 已提交
3361
         * ZONE_DMA and ZONE_DMA32 can be very small area in the system.
3362 3363
	 * If they are really small and used heavily, the system can fall
	 * into OOM very easily.
3364
	 * This function detect ZONE_DMA/DMA32 size and configures zone order.
3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375
	 */
	/* Is there ZONE_NORMAL ? (ex. ppc has only DMA zone..) */
	low_kmem_size = 0;
	total_size = 0;
	for_each_online_node(nid) {
		for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++) {
			z = &NODE_DATA(nid)->node_zones[zone_type];
			if (populated_zone(z)) {
				if (zone_type < ZONE_NORMAL)
					low_kmem_size += z->present_pages;
				total_size += z->present_pages;
3376 3377 3378 3379 3380 3381 3382 3383 3384
			} else if (zone_type == ZONE_NORMAL) {
				/*
				 * If any node has only lowmem, then node order
				 * is preferred to allow kernel allocations
				 * locally; otherwise, they can easily infringe
				 * on other nodes when there is an abundance of
				 * lowmem available to allocate from.
				 */
				return ZONELIST_ORDER_NODE;
3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395
			}
		}
	}
	if (!low_kmem_size ||  /* there are no DMA area. */
	    low_kmem_size > total_size/2) /* DMA/DMA32 is big. */
		return ZONELIST_ORDER_NODE;
	/*
	 * look into each node's config.
  	 * If there is a node whose DMA/DMA32 memory is very big area on
 	 * local memory, NODE_ORDER may be suitable.
         */
3396
	average_size = total_size /
3397
				(nodes_weight(node_states[N_MEMORY]) + 1);
3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428
	for_each_online_node(nid) {
		low_kmem_size = 0;
		total_size = 0;
		for (zone_type = 0; zone_type < MAX_NR_ZONES; zone_type++) {
			z = &NODE_DATA(nid)->node_zones[zone_type];
			if (populated_zone(z)) {
				if (zone_type < ZONE_NORMAL)
					low_kmem_size += z->present_pages;
				total_size += z->present_pages;
			}
		}
		if (low_kmem_size &&
		    total_size > average_size && /* ignore small node */
		    low_kmem_size > total_size * 70/100)
			return ZONELIST_ORDER_NODE;
	}
	return ZONELIST_ORDER_ZONE;
}

static void set_zonelist_order(void)
{
	if (user_zonelist_order == ZONELIST_ORDER_DEFAULT)
		current_zonelist_order = default_zonelist_order();
	else
		current_zonelist_order = user_zonelist_order;
}

static void build_zonelists(pg_data_t *pgdat)
{
	int j, node, load;
	enum zone_type i;
L
Linus Torvalds 已提交
3429
	nodemask_t used_mask;
3430 3431 3432
	int local_node, prev_node;
	struct zonelist *zonelist;
	int order = current_zonelist_order;
L
Linus Torvalds 已提交
3433 3434

	/* initialize zonelists */
3435
	for (i = 0; i < MAX_ZONELISTS; i++) {
L
Linus Torvalds 已提交
3436
		zonelist = pgdat->node_zonelists + i;
3437 3438
		zonelist->_zonerefs[0].zone = NULL;
		zonelist->_zonerefs[0].zone_idx = 0;
L
Linus Torvalds 已提交
3439 3440 3441 3442
	}

	/* NUMA-aware ordering of nodes */
	local_node = pgdat->node_id;
3443
	load = nr_online_nodes;
L
Linus Torvalds 已提交
3444 3445
	prev_node = local_node;
	nodes_clear(used_mask);
3446 3447 3448 3449

	memset(node_order, 0, sizeof(node_order));
	j = 0;

L
Linus Torvalds 已提交
3450 3451 3452 3453 3454 3455
	while ((node = find_next_best_node(local_node, &used_mask)) >= 0) {
		/*
		 * We don't want to pressure a particular node.
		 * So adding penalty to the first node in same
		 * distance group to make it round-robin.
		 */
3456 3457
		if (node_distance(local_node, node) !=
		    node_distance(local_node, prev_node))
3458 3459
			node_load[node] = load;

L
Linus Torvalds 已提交
3460 3461
		prev_node = node;
		load--;
3462 3463 3464 3465 3466
		if (order == ZONELIST_ORDER_NODE)
			build_zonelists_in_node_order(pgdat, node);
		else
			node_order[j++] = node;	/* remember order */
	}
L
Linus Torvalds 已提交
3467

3468 3469 3470
	if (order == ZONELIST_ORDER_ZONE) {
		/* calculate node order -- i.e., DMA last! */
		build_zonelists_in_zone_order(pgdat, j);
L
Linus Torvalds 已提交
3471
	}
3472 3473

	build_thisnode_zonelists(pgdat);
L
Linus Torvalds 已提交
3474 3475
}

3476
/* Construct the zonelist performance cache - see further mmzone.h */
3477
static void build_zonelist_cache(pg_data_t *pgdat)
3478
{
3479 3480
	struct zonelist *zonelist;
	struct zonelist_cache *zlc;
3481
	struct zoneref *z;
3482

3483 3484 3485
	zonelist = &pgdat->node_zonelists[0];
	zonelist->zlcache_ptr = zlc = &zonelist->zlcache;
	bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST);
3486 3487
	for (z = zonelist->_zonerefs; z->zone; z++)
		zlc->z_to_n[z - zonelist->_zonerefs] = zonelist_node_idx(z);
3488 3489
}

3490 3491 3492 3493 3494 3495 3496 3497 3498 3499 3500 3501 3502 3503 3504 3505 3506 3507
#ifdef CONFIG_HAVE_MEMORYLESS_NODES
/*
 * Return node id of node used for "local" allocations.
 * I.e., first node id of first zone in arg node's generic zonelist.
 * Used for initializing percpu 'numa_mem', which is used primarily
 * for kernel allocations, so use GFP_KERNEL flags to locate zonelist.
 */
int local_memory_node(int node)
{
	struct zone *zone;

	(void)first_zones_zonelist(node_zonelist(node, GFP_KERNEL),
				   gfp_zone(GFP_KERNEL),
				   NULL,
				   &zone);
	return zone->node;
}
#endif
3508

L
Linus Torvalds 已提交
3509 3510
#else	/* CONFIG_NUMA */

3511 3512 3513 3514 3515 3516
static void set_zonelist_order(void)
{
	current_zonelist_order = ZONELIST_ORDER_ZONE;
}

static void build_zonelists(pg_data_t *pgdat)
L
Linus Torvalds 已提交
3517
{
3518
	int node, local_node;
3519 3520
	enum zone_type j;
	struct zonelist *zonelist;
L
Linus Torvalds 已提交
3521 3522 3523

	local_node = pgdat->node_id;

3524 3525
	zonelist = &pgdat->node_zonelists[0];
	j = build_zonelists_node(pgdat, zonelist, 0, MAX_NR_ZONES - 1);
L
Linus Torvalds 已提交
3526

3527 3528 3529 3530 3531 3532 3533 3534 3535 3536 3537 3538 3539
	/*
	 * Now we build the zonelist so that it contains the zones
	 * of all the other nodes.
	 * We don't want to pressure a particular node, so when
	 * building the zones for node N, we make sure that the
	 * zones coming right after the local ones are those from
	 * node N+1 (modulo N)
	 */
	for (node = local_node + 1; node < MAX_NUMNODES; node++) {
		if (!node_online(node))
			continue;
		j = build_zonelists_node(NODE_DATA(node), zonelist, j,
							MAX_NR_ZONES - 1);
L
Linus Torvalds 已提交
3540
	}
3541 3542 3543 3544 3545 3546 3547
	for (node = 0; node < local_node; node++) {
		if (!node_online(node))
			continue;
		j = build_zonelists_node(NODE_DATA(node), zonelist, j,
							MAX_NR_ZONES - 1);
	}

3548 3549
	zonelist->_zonerefs[j].zone = NULL;
	zonelist->_zonerefs[j].zone_idx = 0;
L
Linus Torvalds 已提交
3550 3551
}

3552
/* non-NUMA variant of zonelist performance cache - just NULL zlcache_ptr */
3553
static void build_zonelist_cache(pg_data_t *pgdat)
3554
{
3555
	pgdat->node_zonelists[0].zlcache_ptr = NULL;
3556 3557
}

L
Linus Torvalds 已提交
3558 3559
#endif	/* CONFIG_NUMA */

3560 3561 3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576
/*
 * Boot pageset table. One per cpu which is going to be used for all
 * zones and all nodes. The parameters will be set in such a way
 * that an item put on a list will immediately be handed over to
 * the buddy list. This is safe since pageset manipulation is done
 * with interrupts disabled.
 *
 * The boot_pagesets must be kept even after bootup is complete for
 * unused processors and/or zones. They do play a role for bootstrapping
 * hotplugged processors.
 *
 * zoneinfo_show() and maybe other functions do
 * not check if the processor is online before following the pageset pointer.
 * Other parts of the kernel may not check if the zone is available.
 */
static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch);
static DEFINE_PER_CPU(struct per_cpu_pageset, boot_pageset);
3577
static void setup_zone_pageset(struct zone *zone);
3578

3579 3580 3581 3582 3583 3584
/*
 * Global mutex to protect against size modification of zonelists
 * as well as to serialize pageset setup for the new populated zone.
 */
DEFINE_MUTEX(zonelists_mutex);

3585
/* return values int ....just for stop_machine() */
3586
static int __build_all_zonelists(void *data)
L
Linus Torvalds 已提交
3587
{
3588
	int nid;
3589
	int cpu;
3590
	pg_data_t *self = data;
3591

3592 3593 3594
#ifdef CONFIG_NUMA
	memset(node_load, 0, sizeof(node_load));
#endif
3595 3596 3597 3598 3599 3600

	if (self && !node_online(self->node_id)) {
		build_zonelists(self);
		build_zonelist_cache(self);
	}

3601
	for_each_online_node(nid) {
3602 3603 3604 3605
		pg_data_t *pgdat = NODE_DATA(nid);

		build_zonelists(pgdat);
		build_zonelist_cache(pgdat);
3606
	}
3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620

	/*
	 * Initialize the boot_pagesets that are going to be used
	 * for bootstrapping processors. The real pagesets for
	 * each zone will be allocated later when the per cpu
	 * allocator is available.
	 *
	 * boot_pagesets are used also for bootstrapping offline
	 * cpus if the system is already booted because the pagesets
	 * are needed to initialize allocators on a specific cpu too.
	 * F.e. the percpu allocator needs the page allocator which
	 * needs the percpu allocator in order to allocate its pagesets
	 * (a chicken-egg dilemma).
	 */
3621
	for_each_possible_cpu(cpu) {
3622 3623
		setup_pageset(&per_cpu(boot_pageset, cpu), 0);

3624 3625 3626 3627 3628 3629 3630 3631 3632 3633 3634 3635 3636 3637
#ifdef CONFIG_HAVE_MEMORYLESS_NODES
		/*
		 * We now know the "local memory node" for each node--
		 * i.e., the node of the first zone in the generic zonelist.
		 * Set up numa_mem percpu variable for on-line cpus.  During
		 * boot, only the boot cpu should be on-line;  we'll init the
		 * secondary cpus' numa_mem as they come on-line.  During
		 * node/memory hotplug, we'll fixup all on-line cpus.
		 */
		if (cpu_online(cpu))
			set_cpu_numa_mem(cpu, local_memory_node(cpu_to_node(cpu)));
#endif
	}

3638 3639 3640
	return 0;
}

3641 3642 3643 3644
/*
 * Called with zonelists_mutex held always
 * unless system_state == SYSTEM_BOOTING.
 */
3645
void __ref build_all_zonelists(pg_data_t *pgdat, struct zone *zone)
3646
{
3647 3648
	set_zonelist_order();

3649
	if (system_state == SYSTEM_BOOTING) {
3650
		__build_all_zonelists(NULL);
3651
		mminit_verify_zonelist();
3652 3653
		cpuset_init_current_mems_allowed();
	} else {
S
Simon Arlott 已提交
3654
		/* we have to stop all cpus to guarantee there is no user
3655
		   of zonelist */
3656
#ifdef CONFIG_MEMORY_HOTPLUG
3657 3658
		if (zone)
			setup_zone_pageset(zone);
3659
#endif
3660
		stop_machine(__build_all_zonelists, pgdat, NULL);
3661 3662
		/* cpuset refresh routine should be here */
	}
3663
	vm_total_pages = nr_free_pagecache_pages();
3664 3665 3666 3667 3668 3669 3670
	/*
	 * Disable grouping by mobility if the number of pages in the
	 * system is too low to allow the mechanism to work. It would be
	 * more accurate, but expensive to check per-zone. This check is
	 * made on memory-hotadd so a system can start with mobility
	 * disabled and enable it later
	 */
3671
	if (vm_total_pages < (pageblock_nr_pages * MIGRATE_TYPES))
3672 3673 3674 3675 3676 3677
		page_group_by_mobility_disabled = 1;
	else
		page_group_by_mobility_disabled = 0;

	printk("Built %i zonelists in %s order, mobility grouping %s.  "
		"Total pages: %ld\n",
3678
			nr_online_nodes,
3679
			zonelist_order_name[current_zonelist_order],
3680
			page_group_by_mobility_disabled ? "off" : "on",
3681 3682 3683 3684
			vm_total_pages);
#ifdef CONFIG_NUMA
	printk("Policy zone: %s\n", zone_names[policy_zone]);
#endif
L
Linus Torvalds 已提交
3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697 3698 3699
}

/*
 * Helper functions to size the waitqueue hash table.
 * Essentially these want to choose hash table sizes sufficiently
 * large so that collisions trying to wait on pages are rare.
 * But in fact, the number of active page waitqueues on typical
 * systems is ridiculously low, less than 200. So this is even
 * conservative, even though it seems large.
 *
 * The constant PAGES_PER_WAITQUEUE specifies the ratio of pages to
 * waitqueues, i.e. the size of the waitq table given the number of pages.
 */
#define PAGES_PER_WAITQUEUE	256

3700
#ifndef CONFIG_MEMORY_HOTPLUG
3701
static inline unsigned long wait_table_hash_nr_entries(unsigned long pages)
L
Linus Torvalds 已提交
3702 3703 3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 3714 3715 3716 3717 3718
{
	unsigned long size = 1;

	pages /= PAGES_PER_WAITQUEUE;

	while (size < pages)
		size <<= 1;

	/*
	 * Once we have dozens or even hundreds of threads sleeping
	 * on IO we've got bigger problems than wait queue collision.
	 * Limit the size of the wait table to a reasonable size.
	 */
	size = min(size, 4096UL);

	return max(size, 4UL);
}
3719 3720 3721 3722 3723 3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735 3736 3737 3738 3739 3740 3741
#else
/*
 * A zone's size might be changed by hot-add, so it is not possible to determine
 * a suitable size for its wait_table.  So we use the maximum size now.
 *
 * The max wait table size = 4096 x sizeof(wait_queue_head_t).   ie:
 *
 *    i386 (preemption config)    : 4096 x 16 = 64Kbyte.
 *    ia64, x86-64 (no preemption): 4096 x 20 = 80Kbyte.
 *    ia64, x86-64 (preemption)   : 4096 x 24 = 96Kbyte.
 *
 * The maximum entries are prepared when a zone's memory is (512K + 256) pages
 * or more by the traditional way. (See above).  It equals:
 *
 *    i386, x86-64, powerpc(4K page size) : =  ( 2G + 1M)byte.
 *    ia64(16K page size)                 : =  ( 8G + 4M)byte.
 *    powerpc (64K page size)             : =  (32G +16M)byte.
 */
static inline unsigned long wait_table_hash_nr_entries(unsigned long pages)
{
	return 4096UL;
}
#endif
L
Linus Torvalds 已提交
3742 3743 3744 3745 3746 3747 3748 3749 3750 3751 3752 3753 3754

/*
 * This is an integer logarithm so that shifts can be used later
 * to extract the more random high bits from the multiplicative
 * hash function before the remainder is taken.
 */
static inline unsigned long wait_table_bits(unsigned long size)
{
	return ffz(~size);
}

#define LONG_ALIGN(x) (((x)+(sizeof(long))-1)&~((sizeof(long))-1))

3755 3756 3757 3758 3759 3760 3761 3762 3763 3764 3765 3766 3767 3768
/*
 * Check if a pageblock contains reserved pages
 */
static int pageblock_is_reserved(unsigned long start_pfn, unsigned long end_pfn)
{
	unsigned long pfn;

	for (pfn = start_pfn; pfn < end_pfn; pfn++) {
		if (!pfn_valid_within(pfn) || PageReserved(pfn_to_page(pfn)))
			return 1;
	}
	return 0;
}

3769
/*
3770
 * Mark a number of pageblocks as MIGRATE_RESERVE. The number
3771 3772
 * of blocks reserved is based on min_wmark_pages(zone). The memory within
 * the reserve will tend to store contiguous free pages. Setting min_free_kbytes
3773 3774 3775 3776 3777
 * higher will lead to a bigger reserve which will get freed as contiguous
 * blocks as reclaim kicks in
 */
static void setup_zone_migrate_reserve(struct zone *zone)
{
3778
	unsigned long start_pfn, pfn, end_pfn, block_end_pfn;
3779
	struct page *page;
3780 3781
	unsigned long block_migratetype;
	int reserve;
3782

3783 3784 3785 3786 3787 3788
	/*
	 * Get the start pfn, end pfn and the number of blocks to reserve
	 * We have to be careful to be aligned to pageblock_nr_pages to
	 * make sure that we always check pfn_valid for the first page in
	 * the block.
	 */
3789 3790
	start_pfn = zone->zone_start_pfn;
	end_pfn = start_pfn + zone->spanned_pages;
3791
	start_pfn = roundup(start_pfn, pageblock_nr_pages);
3792
	reserve = roundup(min_wmark_pages(zone), pageblock_nr_pages) >>
3793
							pageblock_order;
3794

3795 3796 3797 3798 3799 3800 3801 3802 3803
	/*
	 * Reserve blocks are generally in place to help high-order atomic
	 * allocations that are short-lived. A min_free_kbytes value that
	 * would result in more than 2 reserve blocks for atomic allocations
	 * is assumed to be in place to help anti-fragmentation for the
	 * future allocation of hugepages at runtime.
	 */
	reserve = min(2, reserve);

3804
	for (pfn = start_pfn; pfn < end_pfn; pfn += pageblock_nr_pages) {
3805 3806 3807 3808
		if (!pfn_valid(pfn))
			continue;
		page = pfn_to_page(pfn);

3809 3810 3811 3812
		/* Watch out for overlapping nodes */
		if (page_to_nid(page) != zone_to_nid(zone))
			continue;

3813 3814
		block_migratetype = get_pageblock_migratetype(page);

3815 3816 3817 3818 3819 3820 3821 3822 3823
		/* Only test what is necessary when the reserves are not met */
		if (reserve > 0) {
			/*
			 * Blocks with reserved pages will never free, skip
			 * them.
			 */
			block_end_pfn = min(pfn + pageblock_nr_pages, end_pfn);
			if (pageblock_is_reserved(pfn, block_end_pfn))
				continue;
3824

3825 3826 3827 3828 3829 3830 3831 3832 3833 3834 3835 3836 3837 3838 3839
			/* If this block is reserved, account for it */
			if (block_migratetype == MIGRATE_RESERVE) {
				reserve--;
				continue;
			}

			/* Suitable for reserving if this block is movable */
			if (block_migratetype == MIGRATE_MOVABLE) {
				set_pageblock_migratetype(page,
							MIGRATE_RESERVE);
				move_freepages_block(zone, page,
							MIGRATE_RESERVE);
				reserve--;
				continue;
			}
3840 3841 3842 3843 3844 3845 3846 3847 3848 3849 3850 3851
		}

		/*
		 * If the reserve is met and this is a previous reserved block,
		 * take it back
		 */
		if (block_migratetype == MIGRATE_RESERVE) {
			set_pageblock_migratetype(page, MIGRATE_MOVABLE);
			move_freepages_block(zone, page, MIGRATE_MOVABLE);
		}
	}
}
M
Mel Gorman 已提交
3852

L
Linus Torvalds 已提交
3853 3854 3855 3856 3857
/*
 * Initially all pages are reserved - free ones are freed
 * up by free_all_bootmem() once the early boot process is
 * done. Non-atomic initialization, single-pass.
 */
3858
void __meminit memmap_init_zone(unsigned long size, int nid, unsigned long zone,
D
Dave Hansen 已提交
3859
		unsigned long start_pfn, enum memmap_context context)
L
Linus Torvalds 已提交
3860 3861
{
	struct page *page;
A
Andy Whitcroft 已提交
3862 3863
	unsigned long end_pfn = start_pfn + size;
	unsigned long pfn;
3864
	struct zone *z;
L
Linus Torvalds 已提交
3865

3866 3867 3868
	if (highest_memmap_pfn < end_pfn - 1)
		highest_memmap_pfn = end_pfn - 1;

3869
	z = &NODE_DATA(nid)->node_zones[zone];
3870
	for (pfn = start_pfn; pfn < end_pfn; pfn++) {
D
Dave Hansen 已提交
3871 3872 3873 3874 3875 3876 3877 3878 3879 3880 3881
		/*
		 * There can be holes in boot-time mem_map[]s
		 * handed to this function.  They do not
		 * exist on hotplugged memory.
		 */
		if (context == MEMMAP_EARLY) {
			if (!early_pfn_valid(pfn))
				continue;
			if (!early_pfn_in_nid(pfn, nid))
				continue;
		}
A
Andy Whitcroft 已提交
3882 3883
		page = pfn_to_page(pfn);
		set_page_links(page, zone, nid, pfn);
3884
		mminit_verify_page_links(page, zone, nid, pfn);
3885
		init_page_count(page);
L
Linus Torvalds 已提交
3886
		reset_page_mapcount(page);
3887
		reset_page_last_nid(page);
L
Linus Torvalds 已提交
3888
		SetPageReserved(page);
3889 3890 3891 3892 3893
		/*
		 * Mark the block movable so that blocks are reserved for
		 * movable at startup. This will force kernel allocations
		 * to reserve their blocks rather than leaking throughout
		 * the address space during boot when many long-lived
3894 3895 3896
		 * kernel allocations are made. Later some blocks near
		 * the start are marked MIGRATE_RESERVE by
		 * setup_zone_migrate_reserve()
3897 3898 3899 3900 3901
		 *
		 * bitmap is created for zone's valid pfn range. but memmap
		 * can be created for invalid pages (for alignment)
		 * check here not to call set_pageblock_migratetype() against
		 * pfn out of zone.
3902
		 */
3903 3904 3905
		if ((z->zone_start_pfn <= pfn)
		    && (pfn < z->zone_start_pfn + z->spanned_pages)
		    && !(pfn & (pageblock_nr_pages - 1)))
3906
			set_pageblock_migratetype(page, MIGRATE_MOVABLE);
3907

L
Linus Torvalds 已提交
3908 3909 3910 3911
		INIT_LIST_HEAD(&page->lru);
#ifdef WANT_PAGE_VIRTUAL
		/* The shift won't overflow because ZONE_NORMAL is below 4G. */
		if (!is_highmem_idx(zone))
3912
			set_page_address(page, __va(pfn << PAGE_SHIFT));
L
Linus Torvalds 已提交
3913 3914 3915 3916
#endif
	}
}

3917
static void __meminit zone_init_free_lists(struct zone *zone)
L
Linus Torvalds 已提交
3918
{
3919 3920 3921
	int order, t;
	for_each_migratetype_order(order, t) {
		INIT_LIST_HEAD(&zone->free_area[order].free_list[t]);
L
Linus Torvalds 已提交
3922 3923 3924 3925 3926 3927
		zone->free_area[order].nr_free = 0;
	}
}

#ifndef __HAVE_ARCH_MEMMAP_INIT
#define memmap_init(size, nid, zone, start_pfn) \
D
Dave Hansen 已提交
3928
	memmap_init_zone((size), (nid), (zone), (start_pfn), MEMMAP_EARLY)
L
Linus Torvalds 已提交
3929 3930
#endif

3931
static int __meminit zone_batchsize(struct zone *zone)
3932
{
3933
#ifdef CONFIG_MMU
3934 3935 3936 3937
	int batch;

	/*
	 * The per-cpu-pages pools are set to around 1000th of the
3938
	 * size of the zone.  But no more than 1/2 of a meg.
3939 3940 3941 3942
	 *
	 * OK, so we don't know how big the cache is.  So guess.
	 */
	batch = zone->present_pages / 1024;
3943 3944
	if (batch * PAGE_SIZE > 512 * 1024)
		batch = (512 * 1024) / PAGE_SIZE;
3945 3946 3947 3948 3949
	batch /= 4;		/* We effectively *= 4 below */
	if (batch < 1)
		batch = 1;

	/*
3950 3951 3952
	 * Clamp the batch to a 2^n - 1 value. Having a power
	 * of 2 value was found to be more likely to have
	 * suboptimal cache aliasing properties in some cases.
3953
	 *
3954 3955 3956 3957
	 * For example if 2 tasks are alternately allocating
	 * batches of pages, one task can end up with a lot
	 * of pages of one half of the possible page colors
	 * and the other with pages of the other colors.
3958
	 */
3959
	batch = rounddown_pow_of_two(batch + batch/2) - 1;
3960

3961
	return batch;
3962 3963 3964 3965 3966 3967 3968 3969 3970 3971 3972 3973 3974 3975 3976 3977 3978

#else
	/* The deferral and batching of frees should be suppressed under NOMMU
	 * conditions.
	 *
	 * The problem is that NOMMU needs to be able to allocate large chunks
	 * of contiguous memory as there's no hardware page translation to
	 * assemble apparent contiguous memory from discontiguous pages.
	 *
	 * Queueing large contiguous runs of pages for batching, however,
	 * causes the pages to actually be freed in smaller chunks.  As there
	 * can be a significant delay between the individual batches being
	 * recycled, this leads to the once large chunks of space being
	 * fragmented and becoming unavailable for high-order allocations.
	 */
	return 0;
#endif
3979 3980
}

A
Adrian Bunk 已提交
3981
static void setup_pageset(struct per_cpu_pageset *p, unsigned long batch)
3982 3983
{
	struct per_cpu_pages *pcp;
3984
	int migratetype;
3985

3986 3987
	memset(p, 0, sizeof(*p));

3988
	pcp = &p->pcp;
3989 3990 3991
	pcp->count = 0;
	pcp->high = 6 * batch;
	pcp->batch = max(1UL, 1 * batch);
3992 3993
	for (migratetype = 0; migratetype < MIGRATE_PCPTYPES; migratetype++)
		INIT_LIST_HEAD(&pcp->lists[migratetype]);
3994 3995
}

3996 3997 3998 3999 4000 4001 4002 4003 4004 4005
/*
 * setup_pagelist_highmark() sets the high water mark for hot per_cpu_pagelist
 * to the value high for the pageset p.
 */

static void setup_pagelist_highmark(struct per_cpu_pageset *p,
				unsigned long high)
{
	struct per_cpu_pages *pcp;

4006
	pcp = &p->pcp;
4007 4008 4009 4010 4011 4012
	pcp->high = high;
	pcp->batch = max(1UL, high/4);
	if ((high/4) > (PAGE_SHIFT * 8))
		pcp->batch = PAGE_SHIFT * 8;
}

4013
static void __meminit setup_zone_pageset(struct zone *zone)
4014 4015 4016 4017 4018 4019 4020 4021 4022 4023 4024 4025 4026 4027 4028 4029 4030
{
	int cpu;

	zone->pageset = alloc_percpu(struct per_cpu_pageset);

	for_each_possible_cpu(cpu) {
		struct per_cpu_pageset *pcp = per_cpu_ptr(zone->pageset, cpu);

		setup_pageset(pcp, zone_batchsize(zone));

		if (percpu_pagelist_fraction)
			setup_pagelist_highmark(pcp,
				(zone->present_pages /
					percpu_pagelist_fraction));
	}
}

4031
/*
4032 4033
 * Allocate per cpu pagesets and initialize them.
 * Before this call only boot pagesets were available.
4034
 */
4035
void __init setup_per_cpu_pageset(void)
4036
{
4037
	struct zone *zone;
4038

4039 4040
	for_each_populated_zone(zone)
		setup_zone_pageset(zone);
4041 4042
}

S
Sam Ravnborg 已提交
4043
static noinline __init_refok
4044
int zone_wait_table_init(struct zone *zone, unsigned long zone_size_pages)
4045 4046 4047
{
	int i;
	struct pglist_data *pgdat = zone->zone_pgdat;
4048
	size_t alloc_size;
4049 4050 4051 4052 4053

	/*
	 * The per-page waitqueue mechanism uses hashed waitqueues
	 * per zone.
	 */
4054 4055 4056 4057
	zone->wait_table_hash_nr_entries =
		 wait_table_hash_nr_entries(zone_size_pages);
	zone->wait_table_bits =
		wait_table_bits(zone->wait_table_hash_nr_entries);
4058 4059 4060
	alloc_size = zone->wait_table_hash_nr_entries
					* sizeof(wait_queue_head_t);

4061
	if (!slab_is_available()) {
4062
		zone->wait_table = (wait_queue_head_t *)
4063
			alloc_bootmem_node_nopanic(pgdat, alloc_size);
4064 4065 4066 4067 4068 4069 4070 4071 4072 4073 4074
	} else {
		/*
		 * This case means that a zone whose size was 0 gets new memory
		 * via memory hot-add.
		 * But it may be the case that a new node was hot-added.  In
		 * this case vmalloc() will not be able to use this new node's
		 * memory - this wait_table must be initialized to use this new
		 * node itself as well.
		 * To use this new node's memory, further consideration will be
		 * necessary.
		 */
4075
		zone->wait_table = vmalloc(alloc_size);
4076 4077 4078
	}
	if (!zone->wait_table)
		return -ENOMEM;
4079

4080
	for(i = 0; i < zone->wait_table_hash_nr_entries; ++i)
4081
		init_waitqueue_head(zone->wait_table + i);
4082 4083

	return 0;
4084 4085
}

4086
static __meminit void zone_pcp_init(struct zone *zone)
4087
{
4088 4089 4090 4091 4092 4093
	/*
	 * per cpu subsystem is not up at this point. The following code
	 * relies on the ability of the linker to provide the
	 * offset of a (static) per cpu variable into the per cpu area.
	 */
	zone->pageset = &boot_pageset;
4094

A
Anton Blanchard 已提交
4095
	if (zone->present_pages)
4096 4097 4098
		printk(KERN_DEBUG "  %s zone: %lu pages, LIFO batch:%u\n",
			zone->name, zone->present_pages,
					 zone_batchsize(zone));
4099 4100
}

4101
int __meminit init_currently_empty_zone(struct zone *zone,
4102
					unsigned long zone_start_pfn,
D
Dave Hansen 已提交
4103 4104
					unsigned long size,
					enum memmap_context context)
4105 4106
{
	struct pglist_data *pgdat = zone->zone_pgdat;
4107 4108 4109 4110
	int ret;
	ret = zone_wait_table_init(zone, size);
	if (ret)
		return ret;
4111 4112 4113 4114
	pgdat->nr_zones = zone_idx(zone) + 1;

	zone->zone_start_pfn = zone_start_pfn;

4115 4116 4117 4118 4119 4120
	mminit_dprintk(MMINIT_TRACE, "memmap_init",
			"Initialising map node %d zone %lu pfns %lu -> %lu\n",
			pgdat->node_id,
			(unsigned long)zone_idx(zone),
			zone_start_pfn, (zone_start_pfn + size));

4121
	zone_init_free_lists(zone);
4122 4123

	return 0;
4124 4125
}

T
Tejun Heo 已提交
4126
#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
4127 4128 4129 4130 4131 4132 4133
#ifndef CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID
/*
 * Required by SPARSEMEM. Given a PFN, return what node the PFN is on.
 * Architectures may implement their own version but if add_active_range()
 * was used and there are no special requirements, this is a convenient
 * alternative
 */
4134
int __meminit __early_pfn_to_nid(unsigned long pfn)
4135
{
4136 4137
	unsigned long start_pfn, end_pfn;
	int i, nid;
4138

4139
	for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid)
4140
		if (start_pfn <= pfn && pfn < end_pfn)
4141
			return nid;
4142 4143
	/* This is a memory hole */
	return -1;
4144 4145 4146
}
#endif /* CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID */

4147 4148
int __meminit early_pfn_to_nid(unsigned long pfn)
{
4149 4150 4151 4152 4153 4154 4155
	int nid;

	nid = __early_pfn_to_nid(pfn);
	if (nid >= 0)
		return nid;
	/* just returns 0 */
	return 0;
4156 4157
}

4158 4159 4160 4161 4162 4163 4164 4165 4166 4167 4168
#ifdef CONFIG_NODES_SPAN_OTHER_NODES
bool __meminit early_pfn_in_nid(unsigned long pfn, int node)
{
	int nid;

	nid = __early_pfn_to_nid(pfn);
	if (nid >= 0 && nid != node)
		return false;
	return true;
}
#endif
4169

4170 4171
/**
 * free_bootmem_with_active_regions - Call free_bootmem_node for each active range
4172 4173
 * @nid: The node to free memory on. If MAX_NUMNODES, all nodes are freed.
 * @max_low_pfn: The highest PFN that will be passed to free_bootmem_node
4174 4175 4176 4177 4178
 *
 * If an architecture guarantees that all ranges registered with
 * add_active_ranges() contain no holes and may be freed, this
 * this function may be used instead of calling free_bootmem() manually.
 */
4179
void __init free_bootmem_with_active_regions(int nid, unsigned long max_low_pfn)
4180
{
4181 4182
	unsigned long start_pfn, end_pfn;
	int i, this_nid;
4183

4184 4185 4186
	for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, &this_nid) {
		start_pfn = min(start_pfn, max_low_pfn);
		end_pfn = min(end_pfn, max_low_pfn);
4187

4188 4189 4190 4191
		if (start_pfn < end_pfn)
			free_bootmem_node(NODE_DATA(this_nid),
					  PFN_PHYS(start_pfn),
					  (end_pfn - start_pfn) << PAGE_SHIFT);
4192 4193 4194
	}
}

4195 4196
/**
 * sparse_memory_present_with_active_regions - Call memory_present for each active range
4197
 * @nid: The node to call memory_present for. If MAX_NUMNODES, all nodes will be used.
4198 4199 4200
 *
 * If an architecture guarantees that all ranges registered with
 * add_active_ranges() contain no holes and may be freed, this
4201
 * function may be used instead of calling memory_present() manually.
4202 4203 4204
 */
void __init sparse_memory_present_with_active_regions(int nid)
{
4205 4206
	unsigned long start_pfn, end_pfn;
	int i, this_nid;
4207

4208 4209
	for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, &this_nid)
		memory_present(this_nid, start_pfn, end_pfn);
4210 4211 4212 4213
}

/**
 * get_pfn_range_for_nid - Return the start and end page frames for a node
4214 4215 4216
 * @nid: The nid to return the range for. If MAX_NUMNODES, the min and max PFN are returned.
 * @start_pfn: Passed by reference. On return, it will have the node start_pfn.
 * @end_pfn: Passed by reference. On return, it will have the node end_pfn.
4217 4218 4219 4220
 *
 * It returns the start and end page frame of a node based on information
 * provided by an arch calling add_active_range(). If called for a node
 * with no available memory, a warning is printed and the start and end
4221
 * PFNs will be 0.
4222
 */
4223
void __meminit get_pfn_range_for_nid(unsigned int nid,
4224 4225
			unsigned long *start_pfn, unsigned long *end_pfn)
{
4226
	unsigned long this_start_pfn, this_end_pfn;
4227
	int i;
4228

4229 4230 4231
	*start_pfn = -1UL;
	*end_pfn = 0;

4232 4233 4234
	for_each_mem_pfn_range(i, nid, &this_start_pfn, &this_end_pfn, NULL) {
		*start_pfn = min(*start_pfn, this_start_pfn);
		*end_pfn = max(*end_pfn, this_end_pfn);
4235 4236
	}

4237
	if (*start_pfn == -1UL)
4238 4239 4240
		*start_pfn = 0;
}

M
Mel Gorman 已提交
4241 4242 4243 4244 4245
/*
 * This finds a zone that can be used for ZONE_MOVABLE pages. The
 * assumption is made that zones within a node are ordered in monotonic
 * increasing memory addresses so that the "highest" populated zone is used
 */
A
Adrian Bunk 已提交
4246
static void __init find_usable_zone_for_movable(void)
M
Mel Gorman 已提交
4247 4248 4249 4250 4251 4252 4253 4254 4255 4256 4257 4258 4259 4260 4261 4262 4263
{
	int zone_index;
	for (zone_index = MAX_NR_ZONES - 1; zone_index >= 0; zone_index--) {
		if (zone_index == ZONE_MOVABLE)
			continue;

		if (arch_zone_highest_possible_pfn[zone_index] >
				arch_zone_lowest_possible_pfn[zone_index])
			break;
	}

	VM_BUG_ON(zone_index == -1);
	movable_zone = zone_index;
}

/*
 * The zone ranges provided by the architecture do not include ZONE_MOVABLE
L
Lucas De Marchi 已提交
4264
 * because it is sized independent of architecture. Unlike the other zones,
M
Mel Gorman 已提交
4265 4266 4267 4268 4269 4270 4271
 * the starting point for ZONE_MOVABLE is not fixed. It may be different
 * in each node depending on the size of each node and how evenly kernelcore
 * is distributed. This helper function adjusts the zone ranges
 * provided by the architecture for a given node by using the end of the
 * highest usable zone for ZONE_MOVABLE. This preserves the assumption that
 * zones within a node are in order of monotonic increases memory addresses
 */
A
Adrian Bunk 已提交
4272
static void __meminit adjust_zone_range_for_zone_movable(int nid,
M
Mel Gorman 已提交
4273 4274 4275 4276 4277 4278 4279 4280 4281 4282 4283 4284 4285 4286 4287 4288 4289 4290 4291 4292 4293 4294 4295 4296 4297
					unsigned long zone_type,
					unsigned long node_start_pfn,
					unsigned long node_end_pfn,
					unsigned long *zone_start_pfn,
					unsigned long *zone_end_pfn)
{
	/* Only adjust if ZONE_MOVABLE is on this node */
	if (zone_movable_pfn[nid]) {
		/* Size ZONE_MOVABLE */
		if (zone_type == ZONE_MOVABLE) {
			*zone_start_pfn = zone_movable_pfn[nid];
			*zone_end_pfn = min(node_end_pfn,
				arch_zone_highest_possible_pfn[movable_zone]);

		/* Adjust for ZONE_MOVABLE starting within this range */
		} else if (*zone_start_pfn < zone_movable_pfn[nid] &&
				*zone_end_pfn > zone_movable_pfn[nid]) {
			*zone_end_pfn = zone_movable_pfn[nid];

		/* Check if this whole range is within ZONE_MOVABLE */
		} else if (*zone_start_pfn >= zone_movable_pfn[nid])
			*zone_start_pfn = *zone_end_pfn;
	}
}

4298 4299 4300 4301
/*
 * Return the number of pages a zone spans in a node, including holes
 * present_pages = zone_spanned_pages_in_node() - zone_absent_pages_in_node()
 */
P
Paul Mundt 已提交
4302
static unsigned long __meminit zone_spanned_pages_in_node(int nid,
4303 4304 4305 4306 4307 4308 4309 4310 4311 4312
					unsigned long zone_type,
					unsigned long *ignored)
{
	unsigned long node_start_pfn, node_end_pfn;
	unsigned long zone_start_pfn, zone_end_pfn;

	/* Get the start and end of the node and zone */
	get_pfn_range_for_nid(nid, &node_start_pfn, &node_end_pfn);
	zone_start_pfn = arch_zone_lowest_possible_pfn[zone_type];
	zone_end_pfn = arch_zone_highest_possible_pfn[zone_type];
M
Mel Gorman 已提交
4313 4314 4315
	adjust_zone_range_for_zone_movable(nid, zone_type,
				node_start_pfn, node_end_pfn,
				&zone_start_pfn, &zone_end_pfn);
4316 4317 4318 4319 4320 4321 4322 4323 4324 4325 4326 4327 4328 4329 4330

	/* Check that this node has pages within the zone's required range */
	if (zone_end_pfn < node_start_pfn || zone_start_pfn > node_end_pfn)
		return 0;

	/* Move the zone boundaries inside the node if necessary */
	zone_end_pfn = min(zone_end_pfn, node_end_pfn);
	zone_start_pfn = max(zone_start_pfn, node_start_pfn);

	/* Return the spanned pages */
	return zone_end_pfn - zone_start_pfn;
}

/*
 * Return the number of holes in a range on a node. If nid is MAX_NUMNODES,
4331
 * then all holes in the requested range will be accounted for.
4332
 */
4333
unsigned long __meminit __absent_pages_in_range(int nid,
4334 4335 4336
				unsigned long range_start_pfn,
				unsigned long range_end_pfn)
{
4337 4338 4339
	unsigned long nr_absent = range_end_pfn - range_start_pfn;
	unsigned long start_pfn, end_pfn;
	int i;
4340

4341 4342 4343 4344
	for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
		start_pfn = clamp(start_pfn, range_start_pfn, range_end_pfn);
		end_pfn = clamp(end_pfn, range_start_pfn, range_end_pfn);
		nr_absent -= end_pfn - start_pfn;
4345
	}
4346
	return nr_absent;
4347 4348 4349 4350 4351 4352 4353
}

/**
 * absent_pages_in_range - Return number of page frames in holes within a range
 * @start_pfn: The start PFN to start searching for holes
 * @end_pfn: The end PFN to stop searching for holes
 *
4354
 * It returns the number of pages frames in memory holes within a range.
4355 4356 4357 4358 4359 4360 4361 4362
 */
unsigned long __init absent_pages_in_range(unsigned long start_pfn,
							unsigned long end_pfn)
{
	return __absent_pages_in_range(MAX_NUMNODES, start_pfn, end_pfn);
}

/* Return the number of page frames in holes in a zone on a node */
P
Paul Mundt 已提交
4363
static unsigned long __meminit zone_absent_pages_in_node(int nid,
4364 4365 4366
					unsigned long zone_type,
					unsigned long *ignored)
{
4367 4368
	unsigned long zone_low = arch_zone_lowest_possible_pfn[zone_type];
	unsigned long zone_high = arch_zone_highest_possible_pfn[zone_type];
4369 4370 4371 4372
	unsigned long node_start_pfn, node_end_pfn;
	unsigned long zone_start_pfn, zone_end_pfn;

	get_pfn_range_for_nid(nid, &node_start_pfn, &node_end_pfn);
4373 4374
	zone_start_pfn = clamp(node_start_pfn, zone_low, zone_high);
	zone_end_pfn = clamp(node_end_pfn, zone_low, zone_high);
4375

M
Mel Gorman 已提交
4376 4377 4378
	adjust_zone_range_for_zone_movable(nid, zone_type,
			node_start_pfn, node_end_pfn,
			&zone_start_pfn, &zone_end_pfn);
4379
	return __absent_pages_in_range(nid, zone_start_pfn, zone_end_pfn);
4380
}
4381

T
Tejun Heo 已提交
4382
#else /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
P
Paul Mundt 已提交
4383
static inline unsigned long __meminit zone_spanned_pages_in_node(int nid,
4384 4385 4386 4387 4388 4389
					unsigned long zone_type,
					unsigned long *zones_size)
{
	return zones_size[zone_type];
}

P
Paul Mundt 已提交
4390
static inline unsigned long __meminit zone_absent_pages_in_node(int nid,
4391 4392 4393 4394 4395 4396 4397 4398
						unsigned long zone_type,
						unsigned long *zholes_size)
{
	if (!zholes_size)
		return 0;

	return zholes_size[zone_type];
}
4399

T
Tejun Heo 已提交
4400
#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
4401

4402
static void __meminit calculate_node_totalpages(struct pglist_data *pgdat,
4403 4404 4405 4406 4407 4408 4409 4410 4411 4412 4413 4414 4415 4416 4417 4418 4419 4420 4421 4422
		unsigned long *zones_size, unsigned long *zholes_size)
{
	unsigned long realtotalpages, totalpages = 0;
	enum zone_type i;

	for (i = 0; i < MAX_NR_ZONES; i++)
		totalpages += zone_spanned_pages_in_node(pgdat->node_id, i,
								zones_size);
	pgdat->node_spanned_pages = totalpages;

	realtotalpages = totalpages;
	for (i = 0; i < MAX_NR_ZONES; i++)
		realtotalpages -=
			zone_absent_pages_in_node(pgdat->node_id, i,
								zholes_size);
	pgdat->node_present_pages = realtotalpages;
	printk(KERN_DEBUG "On node %d totalpages: %lu\n", pgdat->node_id,
							realtotalpages);
}

4423 4424 4425
#ifndef CONFIG_SPARSEMEM
/*
 * Calculate the size of the zone->blockflags rounded to an unsigned long
4426 4427
 * Start by making sure zonesize is a multiple of pageblock_order by rounding
 * up. Then use 1 NR_PAGEBLOCK_BITS worth of bits per pageblock, finally
4428 4429 4430 4431 4432 4433 4434
 * round what is now in bits to nearest long in bits, then return it in
 * bytes.
 */
static unsigned long __init usemap_size(unsigned long zonesize)
{
	unsigned long usemapsize;

4435 4436
	usemapsize = roundup(zonesize, pageblock_nr_pages);
	usemapsize = usemapsize >> pageblock_order;
4437 4438 4439 4440 4441 4442 4443 4444 4445 4446 4447
	usemapsize *= NR_PAGEBLOCK_BITS;
	usemapsize = roundup(usemapsize, 8 * sizeof(unsigned long));

	return usemapsize / 8;
}

static void __init setup_usemap(struct pglist_data *pgdat,
				struct zone *zone, unsigned long zonesize)
{
	unsigned long usemapsize = usemap_size(zonesize);
	zone->pageblock_flags = NULL;
4448
	if (usemapsize)
4449 4450
		zone->pageblock_flags = alloc_bootmem_node_nopanic(pgdat,
								   usemapsize);
4451 4452
}
#else
4453
static inline void setup_usemap(struct pglist_data *pgdat,
4454 4455 4456
				struct zone *zone, unsigned long zonesize) {}
#endif /* CONFIG_SPARSEMEM */

4457
#ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
4458

4459
/* Initialise the number of pages represented by NR_PAGEBLOCK_BITS */
4460
void __init set_pageblock_order(void)
4461
{
4462 4463
	unsigned int order;

4464 4465 4466 4467
	/* Check that pageblock_nr_pages has not already been setup */
	if (pageblock_order)
		return;

4468 4469 4470 4471 4472
	if (HPAGE_SHIFT > PAGE_SHIFT)
		order = HUGETLB_PAGE_ORDER;
	else
		order = MAX_ORDER - 1;

4473 4474
	/*
	 * Assume the largest contiguous order of interest is a huge page.
4475 4476
	 * This value may be variable depending on boot parameters on IA64 and
	 * powerpc.
4477 4478 4479 4480 4481
	 */
	pageblock_order = order;
}
#else /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */

4482 4483
/*
 * When CONFIG_HUGETLB_PAGE_SIZE_VARIABLE is not set, set_pageblock_order()
4484 4485 4486
 * is unused as pageblock_order is set at compile-time. See
 * include/linux/pageblock-flags.h for the values of pageblock_order based on
 * the kernel config
4487
 */
4488
void __init set_pageblock_order(void)
4489 4490
{
}
4491 4492 4493

#endif /* CONFIG_HUGETLB_PAGE_SIZE_VARIABLE */

4494 4495 4496 4497 4498 4499 4500 4501 4502 4503 4504 4505 4506 4507 4508 4509 4510 4511 4512 4513
static unsigned long __paginginit calc_memmap_size(unsigned long spanned_pages,
						   unsigned long present_pages)
{
	unsigned long pages = spanned_pages;

	/*
	 * Provide a more accurate estimation if there are holes within
	 * the zone and SPARSEMEM is in use. If there are holes within the
	 * zone, each populated memory region may cost us one or two extra
	 * memmap pages due to alignment because memmap pages for each
	 * populated regions may not naturally algined on page boundary.
	 * So the (present_pages >> 4) heuristic is a tradeoff for that.
	 */
	if (spanned_pages > present_pages + (present_pages >> 4) &&
	    IS_ENABLED(CONFIG_SPARSEMEM))
		pages = present_pages;

	return PAGE_ALIGN(pages * sizeof(struct page)) >> PAGE_SHIFT;
}

L
Linus Torvalds 已提交
4514 4515 4516 4517 4518
/*
 * Set up the zone data structures:
 *   - mark all pages reserved
 *   - mark all memory queues empty
 *   - clear the memory bitmaps
4519 4520
 *
 * NOTE: pgdat should get zeroed by caller.
L
Linus Torvalds 已提交
4521
 */
4522
static void __paginginit free_area_init_core(struct pglist_data *pgdat,
L
Linus Torvalds 已提交
4523 4524
		unsigned long *zones_size, unsigned long *zholes_size)
{
4525
	enum zone_type j;
4526
	int nid = pgdat->node_id;
L
Linus Torvalds 已提交
4527
	unsigned long zone_start_pfn = pgdat->node_start_pfn;
4528
	int ret;
L
Linus Torvalds 已提交
4529

4530
	pgdat_resize_init(pgdat);
4531 4532 4533 4534 4535
#ifdef CONFIG_NUMA_BALANCING
	spin_lock_init(&pgdat->numabalancing_migrate_lock);
	pgdat->numabalancing_migrate_nr_pages = 0;
	pgdat->numabalancing_migrate_next_window = jiffies;
#endif
L
Linus Torvalds 已提交
4536
	init_waitqueue_head(&pgdat->kswapd_wait);
4537
	init_waitqueue_head(&pgdat->pfmemalloc_wait);
4538
	pgdat_page_cgroup_init(pgdat);
4539

L
Linus Torvalds 已提交
4540 4541
	for (j = 0; j < MAX_NR_ZONES; j++) {
		struct zone *zone = pgdat->node_zones + j;
4542
		unsigned long size, realsize, freesize, memmap_pages;
L
Linus Torvalds 已提交
4543

4544
		size = zone_spanned_pages_in_node(nid, j, zones_size);
4545
		realsize = freesize = size - zone_absent_pages_in_node(nid, j,
4546
								zholes_size);
L
Linus Torvalds 已提交
4547

4548
		/*
4549
		 * Adjust freesize so that it accounts for how much memory
4550 4551 4552
		 * is used by this zone for memmap. This affects the watermark
		 * and per-cpu initialisations
		 */
4553
		memmap_pages = calc_memmap_size(size, realsize);
4554 4555
		if (freesize >= memmap_pages) {
			freesize -= memmap_pages;
4556 4557 4558 4559
			if (memmap_pages)
				printk(KERN_DEBUG
				       "  %s zone: %lu pages used for memmap\n",
				       zone_names[j], memmap_pages);
4560 4561
		} else
			printk(KERN_WARNING
4562 4563
				"  %s zone: %lu pages exceeds freesize %lu\n",
				zone_names[j], memmap_pages, freesize);
4564

4565
		/* Account for reserved pages */
4566 4567
		if (j == 0 && freesize > dma_reserve) {
			freesize -= dma_reserve;
Y
Yinghai Lu 已提交
4568
			printk(KERN_DEBUG "  %s zone: %lu pages reserved\n",
4569
					zone_names[0], dma_reserve);
4570 4571
		}

4572
		if (!is_highmem_idx(j))
4573
			nr_kernel_pages += freesize;
4574 4575 4576
		/* Charge for highmem memmap if there are enough kernel pages */
		else if (nr_kernel_pages > memmap_pages * 2)
			nr_kernel_pages -= memmap_pages;
4577
		nr_all_pages += freesize;
L
Linus Torvalds 已提交
4578 4579

		zone->spanned_pages = size;
4580 4581 4582 4583 4584 4585 4586
		zone->present_pages = freesize;
		/*
		 * Set an approximate value for lowmem here, it will be adjusted
		 * when the bootmem allocator frees pages into the buddy system.
		 * And all highmem pages will be managed by the buddy system.
		 */
		zone->managed_pages = is_highmem_idx(j) ? realsize : freesize;
4587
#ifdef CONFIG_NUMA
4588
		zone->node = nid;
4589
		zone->min_unmapped_pages = (freesize*sysctl_min_unmapped_ratio)
4590
						/ 100;
4591
		zone->min_slab_pages = (freesize * sysctl_min_slab_ratio) / 100;
4592
#endif
L
Linus Torvalds 已提交
4593 4594 4595
		zone->name = zone_names[j];
		spin_lock_init(&zone->lock);
		spin_lock_init(&zone->lru_lock);
4596
		zone_seqlock_init(zone);
L
Linus Torvalds 已提交
4597 4598
		zone->zone_pgdat = pgdat;

4599
		zone_pcp_init(zone);
4600
		lruvec_init(&zone->lruvec);
L
Linus Torvalds 已提交
4601 4602 4603
		if (!size)
			continue;

4604
		set_pageblock_order();
4605
		setup_usemap(pgdat, zone, size);
D
Dave Hansen 已提交
4606 4607
		ret = init_currently_empty_zone(zone, zone_start_pfn,
						size, MEMMAP_EARLY);
4608
		BUG_ON(ret);
4609
		memmap_init(size, nid, j, zone_start_pfn);
L
Linus Torvalds 已提交
4610 4611 4612 4613
		zone_start_pfn += size;
	}
}

S
Sam Ravnborg 已提交
4614
static void __init_refok alloc_node_mem_map(struct pglist_data *pgdat)
L
Linus Torvalds 已提交
4615 4616 4617 4618 4619
{
	/* Skip empty nodes */
	if (!pgdat->node_spanned_pages)
		return;

A
Andy Whitcroft 已提交
4620
#ifdef CONFIG_FLAT_NODE_MEM_MAP
L
Linus Torvalds 已提交
4621 4622
	/* ia64 gets its own node_mem_map, before this, without bootmem */
	if (!pgdat->node_mem_map) {
4623
		unsigned long size, start, end;
A
Andy Whitcroft 已提交
4624 4625
		struct page *map;

4626 4627 4628 4629 4630 4631 4632 4633 4634
		/*
		 * The zone's endpoints aren't required to be MAX_ORDER
		 * aligned but the node_mem_map endpoints must be in order
		 * for the buddy allocator to function correctly.
		 */
		start = pgdat->node_start_pfn & ~(MAX_ORDER_NR_PAGES - 1);
		end = pgdat->node_start_pfn + pgdat->node_spanned_pages;
		end = ALIGN(end, MAX_ORDER_NR_PAGES);
		size =  (end - start) * sizeof(struct page);
4635 4636
		map = alloc_remap(pgdat->node_id, size);
		if (!map)
4637
			map = alloc_bootmem_node_nopanic(pgdat, size);
4638
		pgdat->node_mem_map = map + (pgdat->node_start_pfn - start);
L
Linus Torvalds 已提交
4639
	}
4640
#ifndef CONFIG_NEED_MULTIPLE_NODES
L
Linus Torvalds 已提交
4641 4642 4643
	/*
	 * With no DISCONTIG, the global mem_map is just set as node 0's
	 */
4644
	if (pgdat == NODE_DATA(0)) {
L
Linus Torvalds 已提交
4645
		mem_map = NODE_DATA(0)->node_mem_map;
T
Tejun Heo 已提交
4646
#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
4647
		if (page_to_pfn(mem_map) != pgdat->node_start_pfn)
4648
			mem_map -= (pgdat->node_start_pfn - ARCH_PFN_OFFSET);
T
Tejun Heo 已提交
4649
#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
4650
	}
L
Linus Torvalds 已提交
4651
#endif
A
Andy Whitcroft 已提交
4652
#endif /* CONFIG_FLAT_NODE_MEM_MAP */
L
Linus Torvalds 已提交
4653 4654
}

4655 4656
void __paginginit free_area_init_node(int nid, unsigned long *zones_size,
		unsigned long node_start_pfn, unsigned long *zholes_size)
L
Linus Torvalds 已提交
4657
{
4658 4659
	pg_data_t *pgdat = NODE_DATA(nid);

4660
	/* pg_data_t should be reset to zero when it's allocated */
4661
	WARN_ON(pgdat->nr_zones || pgdat->classzone_idx);
4662

L
Linus Torvalds 已提交
4663 4664
	pgdat->node_id = nid;
	pgdat->node_start_pfn = node_start_pfn;
4665
	init_zone_allows_reclaim(nid);
4666
	calculate_node_totalpages(pgdat, zones_size, zholes_size);
L
Linus Torvalds 已提交
4667 4668

	alloc_node_mem_map(pgdat);
4669 4670 4671 4672 4673
#ifdef CONFIG_FLAT_NODE_MEM_MAP
	printk(KERN_DEBUG "free_area_init_node: node %d, pgdat %08lx, node_mem_map %08lx\n",
		nid, (unsigned long)pgdat,
		(unsigned long)pgdat->node_mem_map);
#endif
L
Linus Torvalds 已提交
4674 4675 4676 4677

	free_area_init_core(pgdat, zones_size, zholes_size);
}

T
Tejun Heo 已提交
4678
#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
M
Miklos Szeredi 已提交
4679 4680 4681 4682 4683 4684 4685 4686 4687 4688 4689 4690 4691 4692 4693 4694 4695 4696 4697 4698

#if MAX_NUMNODES > 1
/*
 * Figure out the number of possible node ids.
 */
static void __init setup_nr_node_ids(void)
{
	unsigned int node;
	unsigned int highest = 0;

	for_each_node_mask(node, node_possible_map)
		highest = node;
	nr_node_ids = highest + 1;
}
#else
static inline void setup_nr_node_ids(void)
{
}
#endif

4699 4700 4701 4702 4703 4704 4705 4706 4707 4708 4709 4710 4711 4712 4713 4714 4715 4716 4717 4718 4719 4720
/**
 * node_map_pfn_alignment - determine the maximum internode alignment
 *
 * This function should be called after node map is populated and sorted.
 * It calculates the maximum power of two alignment which can distinguish
 * all the nodes.
 *
 * For example, if all nodes are 1GiB and aligned to 1GiB, the return value
 * would indicate 1GiB alignment with (1 << (30 - PAGE_SHIFT)).  If the
 * nodes are shifted by 256MiB, 256MiB.  Note that if only the last node is
 * shifted, 1GiB is enough and this function will indicate so.
 *
 * This is used to test whether pfn -> nid mapping of the chosen memory
 * model has fine enough granularity to avoid incorrect mapping for the
 * populated node map.
 *
 * Returns the determined alignment in pfn's.  0 if there is no alignment
 * requirement (single node).
 */
unsigned long __init node_map_pfn_alignment(void)
{
	unsigned long accl_mask = 0, last_end = 0;
4721
	unsigned long start, end, mask;
4722
	int last_nid = -1;
4723
	int i, nid;
4724

4725
	for_each_mem_pfn_range(i, MAX_NUMNODES, &start, &end, &nid) {
4726 4727 4728 4729 4730 4731 4732 4733 4734 4735 4736 4737 4738 4739 4740 4741 4742 4743 4744 4745 4746 4747 4748
		if (!start || last_nid < 0 || last_nid == nid) {
			last_nid = nid;
			last_end = end;
			continue;
		}

		/*
		 * Start with a mask granular enough to pin-point to the
		 * start pfn and tick off bits one-by-one until it becomes
		 * too coarse to separate the current node from the last.
		 */
		mask = ~((1 << __ffs(start)) - 1);
		while (mask && last_end <= (start & (mask << 1)))
			mask <<= 1;

		/* accumulate all internode masks */
		accl_mask |= mask;
	}

	/* convert mask to number of pages */
	return ~accl_mask + 1;
}

4749
/* Find the lowest pfn for a node */
A
Adrian Bunk 已提交
4750
static unsigned long __init find_min_pfn_for_node(int nid)
4751
{
4752
	unsigned long min_pfn = ULONG_MAX;
4753 4754
	unsigned long start_pfn;
	int i;
4755

4756 4757
	for_each_mem_pfn_range(i, nid, &start_pfn, NULL, NULL)
		min_pfn = min(min_pfn, start_pfn);
4758

4759 4760
	if (min_pfn == ULONG_MAX) {
		printk(KERN_WARNING
4761
			"Could not find start_pfn for node %d\n", nid);
4762 4763 4764 4765
		return 0;
	}

	return min_pfn;
4766 4767 4768 4769 4770 4771
}

/**
 * find_min_pfn_with_active_regions - Find the minimum PFN registered
 *
 * It returns the minimum PFN based on information provided via
4772
 * add_active_range().
4773 4774 4775 4776 4777 4778
 */
unsigned long __init find_min_pfn_with_active_regions(void)
{
	return find_min_pfn_for_node(MAX_NUMNODES);
}

4779 4780 4781
/*
 * early_calculate_totalpages()
 * Sum pages in active regions for movable zone.
4782
 * Populate N_MEMORY for calculating usable_nodes.
4783
 */
A
Adrian Bunk 已提交
4784
static unsigned long __init early_calculate_totalpages(void)
4785 4786
{
	unsigned long totalpages = 0;
4787 4788 4789 4790 4791
	unsigned long start_pfn, end_pfn;
	int i, nid;

	for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid) {
		unsigned long pages = end_pfn - start_pfn;
4792

4793 4794
		totalpages += pages;
		if (pages)
4795
			node_set_state(nid, N_MEMORY);
4796 4797
	}
  	return totalpages;
4798 4799
}

M
Mel Gorman 已提交
4800 4801 4802 4803 4804 4805
/*
 * Find the PFN the Movable zone begins in each node. Kernel memory
 * is spread evenly between nodes as long as the nodes have enough
 * memory. When they don't, some nodes will have more kernelcore than
 * others
 */
4806
static void __init find_zone_movable_pfns_for_nodes(void)
M
Mel Gorman 已提交
4807 4808 4809 4810
{
	int i, nid;
	unsigned long usable_startpfn;
	unsigned long kernelcore_node, kernelcore_remaining;
4811
	/* save the state before borrow the nodemask */
4812
	nodemask_t saved_node_state = node_states[N_MEMORY];
4813
	unsigned long totalpages = early_calculate_totalpages();
4814
	int usable_nodes = nodes_weight(node_states[N_MEMORY]);
M
Mel Gorman 已提交
4815

4816 4817 4818 4819 4820 4821 4822 4823 4824 4825 4826 4827 4828 4829 4830 4831 4832 4833 4834 4835 4836 4837
	/*
	 * If movablecore was specified, calculate what size of
	 * kernelcore that corresponds so that memory usable for
	 * any allocation type is evenly spread. If both kernelcore
	 * and movablecore are specified, then the value of kernelcore
	 * will be used for required_kernelcore if it's greater than
	 * what movablecore would have allowed.
	 */
	if (required_movablecore) {
		unsigned long corepages;

		/*
		 * Round-up so that ZONE_MOVABLE is at least as large as what
		 * was requested by the user
		 */
		required_movablecore =
			roundup(required_movablecore, MAX_ORDER_NR_PAGES);
		corepages = totalpages - required_movablecore;

		required_kernelcore = max(required_kernelcore, corepages);
	}

M
Mel Gorman 已提交
4838 4839
	/* If kernelcore was not specified, there is no ZONE_MOVABLE */
	if (!required_kernelcore)
4840
		goto out;
M
Mel Gorman 已提交
4841 4842 4843 4844 4845 4846 4847 4848

	/* usable_startpfn is the lowest possible pfn ZONE_MOVABLE can be at */
	find_usable_zone_for_movable();
	usable_startpfn = arch_zone_lowest_possible_pfn[movable_zone];

restart:
	/* Spread kernelcore memory as evenly as possible throughout nodes */
	kernelcore_node = required_kernelcore / usable_nodes;
4849
	for_each_node_state(nid, N_MEMORY) {
4850 4851
		unsigned long start_pfn, end_pfn;

M
Mel Gorman 已提交
4852 4853 4854 4855 4856 4857 4858 4859 4860 4861 4862 4863 4864 4865 4866 4867
		/*
		 * Recalculate kernelcore_node if the division per node
		 * now exceeds what is necessary to satisfy the requested
		 * amount of memory for the kernel
		 */
		if (required_kernelcore < kernelcore_node)
			kernelcore_node = required_kernelcore / usable_nodes;

		/*
		 * As the map is walked, we track how much memory is usable
		 * by the kernel using kernelcore_remaining. When it is
		 * 0, the rest of the node is usable by ZONE_MOVABLE
		 */
		kernelcore_remaining = kernelcore_node;

		/* Go through each range of PFNs within this node */
4868
		for_each_mem_pfn_range(i, nid, &start_pfn, &end_pfn, NULL) {
M
Mel Gorman 已提交
4869 4870
			unsigned long size_pages;

4871
			start_pfn = max(start_pfn, zone_movable_pfn[nid]);
M
Mel Gorman 已提交
4872 4873 4874 4875 4876 4877 4878 4879 4880 4881 4882 4883 4884 4885 4886 4887 4888 4889 4890 4891 4892 4893 4894 4895 4896 4897 4898 4899 4900 4901 4902 4903 4904 4905 4906 4907 4908 4909 4910 4911 4912 4913 4914 4915 4916 4917 4918 4919 4920 4921 4922 4923 4924 4925 4926 4927 4928 4929 4930 4931 4932 4933 4934 4935 4936 4937
			if (start_pfn >= end_pfn)
				continue;

			/* Account for what is only usable for kernelcore */
			if (start_pfn < usable_startpfn) {
				unsigned long kernel_pages;
				kernel_pages = min(end_pfn, usable_startpfn)
								- start_pfn;

				kernelcore_remaining -= min(kernel_pages,
							kernelcore_remaining);
				required_kernelcore -= min(kernel_pages,
							required_kernelcore);

				/* Continue if range is now fully accounted */
				if (end_pfn <= usable_startpfn) {

					/*
					 * Push zone_movable_pfn to the end so
					 * that if we have to rebalance
					 * kernelcore across nodes, we will
					 * not double account here
					 */
					zone_movable_pfn[nid] = end_pfn;
					continue;
				}
				start_pfn = usable_startpfn;
			}

			/*
			 * The usable PFN range for ZONE_MOVABLE is from
			 * start_pfn->end_pfn. Calculate size_pages as the
			 * number of pages used as kernelcore
			 */
			size_pages = end_pfn - start_pfn;
			if (size_pages > kernelcore_remaining)
				size_pages = kernelcore_remaining;
			zone_movable_pfn[nid] = start_pfn + size_pages;

			/*
			 * Some kernelcore has been met, update counts and
			 * break if the kernelcore for this node has been
			 * satisified
			 */
			required_kernelcore -= min(required_kernelcore,
								size_pages);
			kernelcore_remaining -= size_pages;
			if (!kernelcore_remaining)
				break;
		}
	}

	/*
	 * If there is still required_kernelcore, we do another pass with one
	 * less node in the count. This will push zone_movable_pfn[nid] further
	 * along on the nodes that still have memory until kernelcore is
	 * satisified
	 */
	usable_nodes--;
	if (usable_nodes && required_kernelcore > usable_nodes)
		goto restart;

	/* Align start of ZONE_MOVABLE on all nids to MAX_ORDER_NR_PAGES */
	for (nid = 0; nid < MAX_NUMNODES; nid++)
		zone_movable_pfn[nid] =
			roundup(zone_movable_pfn[nid], MAX_ORDER_NR_PAGES);
4938 4939 4940

out:
	/* restore the node_state */
4941
	node_states[N_MEMORY] = saved_node_state;
M
Mel Gorman 已提交
4942 4943
}

4944 4945
/* Any regular or high memory on that node ? */
static void check_for_memory(pg_data_t *pgdat, int nid)
4946 4947 4948
{
	enum zone_type zone_type;

4949 4950 4951 4952
	if (N_MEMORY == N_NORMAL_MEMORY)
		return;

	for (zone_type = 0; zone_type <= ZONE_MOVABLE - 1; zone_type++) {
4953
		struct zone *zone = &pgdat->node_zones[zone_type];
4954
		if (zone->present_pages) {
4955 4956 4957 4958
			node_set_state(nid, N_HIGH_MEMORY);
			if (N_NORMAL_MEMORY != N_HIGH_MEMORY &&
			    zone_type <= ZONE_NORMAL)
				node_set_state(nid, N_NORMAL_MEMORY);
4959 4960
			break;
		}
4961 4962 4963
	}
}

4964 4965
/**
 * free_area_init_nodes - Initialise all pg_data_t and zone data
4966
 * @max_zone_pfn: an array of max PFNs for each zone
4967 4968 4969 4970 4971 4972 4973 4974 4975 4976 4977 4978
 *
 * This will call free_area_init_node() for each active node in the system.
 * Using the page ranges provided by add_active_range(), the size of each
 * zone in each node and their holes is calculated. If the maximum PFN
 * between two adjacent zones match, it is assumed that the zone is empty.
 * For example, if arch_max_dma_pfn == arch_max_dma32_pfn, it is assumed
 * that arch_max_dma32_pfn has no pages. It is also assumed that a zone
 * starts where the previous one ended. For example, ZONE_DMA32 starts
 * at arch_max_dma_pfn.
 */
void __init free_area_init_nodes(unsigned long *max_zone_pfn)
{
4979 4980
	unsigned long start_pfn, end_pfn;
	int i, nid;
4981

4982 4983 4984 4985 4986 4987 4988 4989
	/* Record where the zone boundaries are */
	memset(arch_zone_lowest_possible_pfn, 0,
				sizeof(arch_zone_lowest_possible_pfn));
	memset(arch_zone_highest_possible_pfn, 0,
				sizeof(arch_zone_highest_possible_pfn));
	arch_zone_lowest_possible_pfn[0] = find_min_pfn_with_active_regions();
	arch_zone_highest_possible_pfn[0] = max_zone_pfn[0];
	for (i = 1; i < MAX_NR_ZONES; i++) {
M
Mel Gorman 已提交
4990 4991
		if (i == ZONE_MOVABLE)
			continue;
4992 4993 4994 4995 4996
		arch_zone_lowest_possible_pfn[i] =
			arch_zone_highest_possible_pfn[i-1];
		arch_zone_highest_possible_pfn[i] =
			max(max_zone_pfn[i], arch_zone_lowest_possible_pfn[i]);
	}
M
Mel Gorman 已提交
4997 4998 4999 5000 5001
	arch_zone_lowest_possible_pfn[ZONE_MOVABLE] = 0;
	arch_zone_highest_possible_pfn[ZONE_MOVABLE] = 0;

	/* Find the PFNs that ZONE_MOVABLE begins at in each node */
	memset(zone_movable_pfn, 0, sizeof(zone_movable_pfn));
5002
	find_zone_movable_pfns_for_nodes();
5003 5004

	/* Print out the zone ranges */
5005
	printk("Zone ranges:\n");
M
Mel Gorman 已提交
5006 5007 5008
	for (i = 0; i < MAX_NR_ZONES; i++) {
		if (i == ZONE_MOVABLE)
			continue;
5009
		printk(KERN_CONT "  %-8s ", zone_names[i]);
5010 5011
		if (arch_zone_lowest_possible_pfn[i] ==
				arch_zone_highest_possible_pfn[i])
5012
			printk(KERN_CONT "empty\n");
5013
		else
5014 5015 5016 5017
			printk(KERN_CONT "[mem %0#10lx-%0#10lx]\n",
				arch_zone_lowest_possible_pfn[i] << PAGE_SHIFT,
				(arch_zone_highest_possible_pfn[i]
					<< PAGE_SHIFT) - 1);
M
Mel Gorman 已提交
5018 5019 5020
	}

	/* Print out the PFNs ZONE_MOVABLE begins at in each node */
5021
	printk("Movable zone start for each node\n");
M
Mel Gorman 已提交
5022 5023
	for (i = 0; i < MAX_NUMNODES; i++) {
		if (zone_movable_pfn[i])
5024 5025
			printk("  Node %d: %#010lx\n", i,
			       zone_movable_pfn[i] << PAGE_SHIFT);
M
Mel Gorman 已提交
5026
	}
5027

5028
	/* Print out the early node map */
5029
	printk("Early memory node ranges\n");
5030
	for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, &nid)
5031 5032
		printk("  node %3d: [mem %#010lx-%#010lx]\n", nid,
		       start_pfn << PAGE_SHIFT, (end_pfn << PAGE_SHIFT) - 1);
5033 5034

	/* Initialise every node */
5035
	mminit_verify_pageflags_layout();
5036
	setup_nr_node_ids();
5037 5038
	for_each_online_node(nid) {
		pg_data_t *pgdat = NODE_DATA(nid);
5039
		free_area_init_node(nid, NULL,
5040
				find_min_pfn_for_node(nid), NULL);
5041 5042 5043

		/* Any memory on that node */
		if (pgdat->node_present_pages)
5044 5045
			node_set_state(nid, N_MEMORY);
		check_for_memory(pgdat, nid);
5046 5047
	}
}
M
Mel Gorman 已提交
5048

5049
static int __init cmdline_parse_core(char *p, unsigned long *core)
M
Mel Gorman 已提交
5050 5051 5052 5053 5054 5055
{
	unsigned long long coremem;
	if (!p)
		return -EINVAL;

	coremem = memparse(p, &p);
5056
	*core = coremem >> PAGE_SHIFT;
M
Mel Gorman 已提交
5057

5058
	/* Paranoid check that UL is enough for the coremem value */
M
Mel Gorman 已提交
5059 5060 5061 5062
	WARN_ON((coremem >> PAGE_SHIFT) > ULONG_MAX);

	return 0;
}
M
Mel Gorman 已提交
5063

5064 5065 5066 5067 5068 5069 5070 5071 5072 5073 5074 5075 5076 5077 5078 5079 5080 5081
/*
 * kernelcore=size sets the amount of memory for use for allocations that
 * cannot be reclaimed or migrated.
 */
static int __init cmdline_parse_kernelcore(char *p)
{
	return cmdline_parse_core(p, &required_kernelcore);
}

/*
 * movablecore=size sets the amount of memory for use for allocations that
 * can be reclaimed or migrated.
 */
static int __init cmdline_parse_movablecore(char *p)
{
	return cmdline_parse_core(p, &required_movablecore);
}

M
Mel Gorman 已提交
5082
early_param("kernelcore", cmdline_parse_kernelcore);
5083
early_param("movablecore", cmdline_parse_movablecore);
M
Mel Gorman 已提交
5084

T
Tejun Heo 已提交
5085
#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
5086

5087
/**
5088 5089
 * set_dma_reserve - set the specified number of pages reserved in the first zone
 * @new_dma_reserve: The number of pages to mark reserved
5090 5091 5092 5093
 *
 * The per-cpu batchsize and zone watermarks are determined by present_pages.
 * In the DMA zone, a significant percentage may be consumed by kernel image
 * and other unfreeable allocations which can skew the watermarks badly. This
5094 5095 5096
 * function may optionally be used to account for unfreeable pages in the
 * first zone (e.g., ZONE_DMA). The effect will be lower watermarks and
 * smaller per-cpu batchsize.
5097 5098 5099 5100 5101 5102
 */
void __init set_dma_reserve(unsigned long new_dma_reserve)
{
	dma_reserve = new_dma_reserve;
}

L
Linus Torvalds 已提交
5103 5104
void __init free_area_init(unsigned long *zones_size)
{
5105
	free_area_init_node(0, zones_size,
L
Linus Torvalds 已提交
5106 5107 5108 5109 5110 5111 5112 5113
			__pa(PAGE_OFFSET) >> PAGE_SHIFT, NULL);
}

static int page_alloc_cpu_notify(struct notifier_block *self,
				 unsigned long action, void *hcpu)
{
	int cpu = (unsigned long)hcpu;

5114
	if (action == CPU_DEAD || action == CPU_DEAD_FROZEN) {
5115
		lru_add_drain_cpu(cpu);
5116 5117 5118 5119 5120 5121 5122 5123
		drain_pages(cpu);

		/*
		 * Spill the event counters of the dead processor
		 * into the current processors event counters.
		 * This artificially elevates the count of the current
		 * processor.
		 */
5124
		vm_events_fold_cpu(cpu);
5125 5126 5127 5128 5129 5130 5131 5132

		/*
		 * Zero the differential counters of the dead processor
		 * so that the vm statistics are consistent.
		 *
		 * This is only okay since the processor is dead and cannot
		 * race with what we are doing.
		 */
5133
		refresh_cpu_vm_stats(cpu);
L
Linus Torvalds 已提交
5134 5135 5136 5137 5138 5139 5140 5141 5142
	}
	return NOTIFY_OK;
}

void __init page_alloc_init(void)
{
	hotcpu_notifier(page_alloc_cpu_notify, 0);
}

5143 5144 5145 5146 5147 5148 5149 5150
/*
 * calculate_totalreserve_pages - called when sysctl_lower_zone_reserve_ratio
 *	or min_free_kbytes changes.
 */
static void calculate_totalreserve_pages(void)
{
	struct pglist_data *pgdat;
	unsigned long reserve_pages = 0;
5151
	enum zone_type i, j;
5152 5153 5154 5155 5156 5157 5158 5159 5160 5161 5162 5163

	for_each_online_pgdat(pgdat) {
		for (i = 0; i < MAX_NR_ZONES; i++) {
			struct zone *zone = pgdat->node_zones + i;
			unsigned long max = 0;

			/* Find valid and maximum lowmem_reserve in the zone */
			for (j = i; j < MAX_NR_ZONES; j++) {
				if (zone->lowmem_reserve[j] > max)
					max = zone->lowmem_reserve[j];
			}

5164 5165
			/* we treat the high watermark as reserved pages. */
			max += high_wmark_pages(zone);
5166 5167 5168 5169

			if (max > zone->present_pages)
				max = zone->present_pages;
			reserve_pages += max;
5170 5171 5172 5173 5174 5175 5176 5177 5178 5179
			/*
			 * Lowmem reserves are not available to
			 * GFP_HIGHUSER page cache allocations and
			 * kswapd tries to balance zones to their high
			 * watermark.  As a result, neither should be
			 * regarded as dirtyable memory, to prevent a
			 * situation where reclaim has to clean pages
			 * in order to balance the zones.
			 */
			zone->dirty_balance_reserve = max;
5180 5181
		}
	}
5182
	dirty_balance_reserve = reserve_pages;
5183 5184 5185
	totalreserve_pages = reserve_pages;
}

L
Linus Torvalds 已提交
5186 5187 5188 5189 5190 5191 5192 5193 5194
/*
 * setup_per_zone_lowmem_reserve - called whenever
 *	sysctl_lower_zone_reserve_ratio changes.  Ensures that each zone
 *	has a correct pages reserved value, so an adequate number of
 *	pages are left in the zone after a successful __alloc_pages().
 */
static void setup_per_zone_lowmem_reserve(void)
{
	struct pglist_data *pgdat;
5195
	enum zone_type j, idx;
L
Linus Torvalds 已提交
5196

5197
	for_each_online_pgdat(pgdat) {
L
Linus Torvalds 已提交
5198 5199 5200 5201 5202 5203
		for (j = 0; j < MAX_NR_ZONES; j++) {
			struct zone *zone = pgdat->node_zones + j;
			unsigned long present_pages = zone->present_pages;

			zone->lowmem_reserve[j] = 0;

5204 5205
			idx = j;
			while (idx) {
L
Linus Torvalds 已提交
5206 5207
				struct zone *lower_zone;

5208 5209
				idx--;

L
Linus Torvalds 已提交
5210 5211 5212 5213 5214 5215 5216 5217 5218 5219
				if (sysctl_lowmem_reserve_ratio[idx] < 1)
					sysctl_lowmem_reserve_ratio[idx] = 1;

				lower_zone = pgdat->node_zones + idx;
				lower_zone->lowmem_reserve[j] = present_pages /
					sysctl_lowmem_reserve_ratio[idx];
				present_pages += lower_zone->present_pages;
			}
		}
	}
5220 5221 5222

	/* update totalreserve_pages */
	calculate_totalreserve_pages();
L
Linus Torvalds 已提交
5223 5224
}

5225
static void __setup_per_zone_wmarks(void)
L
Linus Torvalds 已提交
5226 5227 5228 5229 5230 5231 5232 5233 5234 5235 5236 5237 5238
{
	unsigned long pages_min = min_free_kbytes >> (PAGE_SHIFT - 10);
	unsigned long lowmem_pages = 0;
	struct zone *zone;
	unsigned long flags;

	/* Calculate total number of !ZONE_HIGHMEM pages */
	for_each_zone(zone) {
		if (!is_highmem(zone))
			lowmem_pages += zone->present_pages;
	}

	for_each_zone(zone) {
5239 5240
		u64 tmp;

5241
		spin_lock_irqsave(&zone->lock, flags);
5242 5243
		tmp = (u64)pages_min * zone->present_pages;
		do_div(tmp, lowmem_pages);
L
Linus Torvalds 已提交
5244 5245
		if (is_highmem(zone)) {
			/*
N
Nick Piggin 已提交
5246 5247 5248 5249
			 * __GFP_HIGH and PF_MEMALLOC allocations usually don't
			 * need highmem pages, so cap pages_min to a small
			 * value here.
			 *
5250
			 * The WMARK_HIGH-WMARK_LOW and (WMARK_LOW-WMARK_MIN)
N
Nick Piggin 已提交
5251 5252
			 * deltas controls asynch page reclaim, and so should
			 * not be capped for highmem.
L
Linus Torvalds 已提交
5253 5254 5255 5256 5257 5258 5259 5260
			 */
			int min_pages;

			min_pages = zone->present_pages / 1024;
			if (min_pages < SWAP_CLUSTER_MAX)
				min_pages = SWAP_CLUSTER_MAX;
			if (min_pages > 128)
				min_pages = 128;
5261
			zone->watermark[WMARK_MIN] = min_pages;
L
Linus Torvalds 已提交
5262
		} else {
N
Nick Piggin 已提交
5263 5264
			/*
			 * If it's a lowmem zone, reserve a number of pages
L
Linus Torvalds 已提交
5265 5266
			 * proportionate to the zone's size.
			 */
5267
			zone->watermark[WMARK_MIN] = tmp;
L
Linus Torvalds 已提交
5268 5269
		}

5270 5271
		zone->watermark[WMARK_LOW]  = min_wmark_pages(zone) + (tmp >> 2);
		zone->watermark[WMARK_HIGH] = min_wmark_pages(zone) + (tmp >> 1);
5272

5273
		setup_zone_migrate_reserve(zone);
5274
		spin_unlock_irqrestore(&zone->lock, flags);
L
Linus Torvalds 已提交
5275
	}
5276 5277 5278

	/* update totalreserve_pages */
	calculate_totalreserve_pages();
L
Linus Torvalds 已提交
5279 5280
}

5281 5282 5283 5284 5285 5286 5287 5288 5289 5290 5291 5292 5293 5294
/**
 * setup_per_zone_wmarks - called when min_free_kbytes changes
 * or when memory is hot-{added|removed}
 *
 * Ensures that the watermark[min,low,high] values for each zone are set
 * correctly with respect to min_free_kbytes.
 */
void setup_per_zone_wmarks(void)
{
	mutex_lock(&zonelists_mutex);
	__setup_per_zone_wmarks();
	mutex_unlock(&zonelists_mutex);
}

5295
/*
5296 5297 5298 5299 5300 5301 5302 5303 5304 5305 5306 5307 5308 5309 5310 5311 5312 5313 5314 5315
 * The inactive anon list should be small enough that the VM never has to
 * do too much work, but large enough that each inactive page has a chance
 * to be referenced again before it is swapped out.
 *
 * The inactive_anon ratio is the target ratio of ACTIVE_ANON to
 * INACTIVE_ANON pages on this zone's LRU, maintained by the
 * pageout code. A zone->inactive_ratio of 3 means 3:1 or 25% of
 * the anonymous pages are kept on the inactive list.
 *
 * total     target    max
 * memory    ratio     inactive anon
 * -------------------------------------
 *   10MB       1         5MB
 *  100MB       1        50MB
 *    1GB       3       250MB
 *   10GB      10       0.9GB
 *  100GB      31         3GB
 *    1TB     101        10GB
 *   10TB     320        32GB
 */
5316
static void __meminit calculate_zone_inactive_ratio(struct zone *zone)
5317
{
5318
	unsigned int gb, ratio;
5319

5320 5321 5322
	/* Zone size in gigabytes */
	gb = zone->present_pages >> (30 - PAGE_SHIFT);
	if (gb)
5323
		ratio = int_sqrt(10 * gb);
5324 5325
	else
		ratio = 1;
5326

5327 5328
	zone->inactive_ratio = ratio;
}
5329

5330
static void __meminit setup_per_zone_inactive_ratio(void)
5331 5332 5333 5334 5335
{
	struct zone *zone;

	for_each_zone(zone)
		calculate_zone_inactive_ratio(zone);
5336 5337
}

L
Linus Torvalds 已提交
5338 5339 5340 5341 5342 5343 5344 5345 5346 5347 5348 5349 5350 5351 5352 5353 5354 5355 5356 5357 5358 5359 5360 5361
/*
 * Initialise min_free_kbytes.
 *
 * For small machines we want it small (128k min).  For large machines
 * we want it large (64MB max).  But it is not linear, because network
 * bandwidth does not increase linearly with machine size.  We use
 *
 * 	min_free_kbytes = 4 * sqrt(lowmem_kbytes), for better accuracy:
 *	min_free_kbytes = sqrt(lowmem_kbytes * 16)
 *
 * which yields
 *
 * 16MB:	512k
 * 32MB:	724k
 * 64MB:	1024k
 * 128MB:	1448k
 * 256MB:	2048k
 * 512MB:	2896k
 * 1024MB:	4096k
 * 2048MB:	5792k
 * 4096MB:	8192k
 * 8192MB:	11584k
 * 16384MB:	16384k
 */
5362
int __meminit init_per_zone_wmark_min(void)
L
Linus Torvalds 已提交
5363 5364 5365 5366 5367 5368 5369 5370 5371 5372
{
	unsigned long lowmem_kbytes;

	lowmem_kbytes = nr_free_buffer_pages() * (PAGE_SIZE >> 10);

	min_free_kbytes = int_sqrt(lowmem_kbytes * 16);
	if (min_free_kbytes < 128)
		min_free_kbytes = 128;
	if (min_free_kbytes > 65536)
		min_free_kbytes = 65536;
5373
	setup_per_zone_wmarks();
5374
	refresh_zone_stat_thresholds();
L
Linus Torvalds 已提交
5375
	setup_per_zone_lowmem_reserve();
5376
	setup_per_zone_inactive_ratio();
L
Linus Torvalds 已提交
5377 5378
	return 0;
}
5379
module_init(init_per_zone_wmark_min)
L
Linus Torvalds 已提交
5380 5381 5382 5383 5384 5385 5386

/*
 * min_free_kbytes_sysctl_handler - just a wrapper around proc_dointvec() so 
 *	that we can call two helper functions whenever min_free_kbytes
 *	changes.
 */
int min_free_kbytes_sysctl_handler(ctl_table *table, int write, 
5387
	void __user *buffer, size_t *length, loff_t *ppos)
L
Linus Torvalds 已提交
5388
{
5389
	proc_dointvec(table, write, buffer, length, ppos);
5390
	if (write)
5391
		setup_per_zone_wmarks();
L
Linus Torvalds 已提交
5392 5393 5394
	return 0;
}

5395 5396
#ifdef CONFIG_NUMA
int sysctl_min_unmapped_ratio_sysctl_handler(ctl_table *table, int write,
5397
	void __user *buffer, size_t *length, loff_t *ppos)
5398 5399 5400 5401
{
	struct zone *zone;
	int rc;

5402
	rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
5403 5404 5405 5406
	if (rc)
		return rc;

	for_each_zone(zone)
5407
		zone->min_unmapped_pages = (zone->present_pages *
5408 5409 5410
				sysctl_min_unmapped_ratio) / 100;
	return 0;
}
5411 5412

int sysctl_min_slab_ratio_sysctl_handler(ctl_table *table, int write,
5413
	void __user *buffer, size_t *length, loff_t *ppos)
5414 5415 5416 5417
{
	struct zone *zone;
	int rc;

5418
	rc = proc_dointvec_minmax(table, write, buffer, length, ppos);
5419 5420 5421 5422 5423 5424 5425 5426
	if (rc)
		return rc;

	for_each_zone(zone)
		zone->min_slab_pages = (zone->present_pages *
				sysctl_min_slab_ratio) / 100;
	return 0;
}
5427 5428
#endif

L
Linus Torvalds 已提交
5429 5430 5431 5432 5433 5434
/*
 * lowmem_reserve_ratio_sysctl_handler - just a wrapper around
 *	proc_dointvec() so that we can call setup_per_zone_lowmem_reserve()
 *	whenever sysctl_lowmem_reserve_ratio changes.
 *
 * The reserve ratio obviously has absolutely no relation with the
5435
 * minimum watermarks. The lowmem reserve ratio can only make sense
L
Linus Torvalds 已提交
5436 5437 5438
 * if in function of the boot time zone sizes.
 */
int lowmem_reserve_ratio_sysctl_handler(ctl_table *table, int write,
5439
	void __user *buffer, size_t *length, loff_t *ppos)
L
Linus Torvalds 已提交
5440
{
5441
	proc_dointvec_minmax(table, write, buffer, length, ppos);
L
Linus Torvalds 已提交
5442 5443 5444 5445
	setup_per_zone_lowmem_reserve();
	return 0;
}

5446 5447 5448 5449 5450 5451 5452
/*
 * percpu_pagelist_fraction - changes the pcp->high for each zone on each
 * cpu.  It is the fraction of total pages in each zone that a hot per cpu pagelist
 * can have before it gets flushed back to buddy allocator.
 */

int percpu_pagelist_fraction_sysctl_handler(ctl_table *table, int write,
5453
	void __user *buffer, size_t *length, loff_t *ppos)
5454 5455 5456 5457 5458
{
	struct zone *zone;
	unsigned int cpu;
	int ret;

5459
	ret = proc_dointvec_minmax(table, write, buffer, length, ppos);
5460
	if (!write || (ret < 0))
5461
		return ret;
5462
	for_each_populated_zone(zone) {
5463
		for_each_possible_cpu(cpu) {
5464 5465
			unsigned long  high;
			high = zone->present_pages / percpu_pagelist_fraction;
5466 5467
			setup_pagelist_highmark(
				per_cpu_ptr(zone->pageset, cpu), high);
5468 5469 5470 5471 5472
		}
	}
	return 0;
}

5473
int hashdist = HASHDIST_DEFAULT;
L
Linus Torvalds 已提交
5474 5475 5476 5477 5478 5479 5480 5481 5482 5483 5484 5485 5486 5487 5488 5489 5490 5491 5492 5493 5494 5495 5496 5497 5498

#ifdef CONFIG_NUMA
static int __init set_hashdist(char *str)
{
	if (!str)
		return 0;
	hashdist = simple_strtoul(str, &str, 0);
	return 1;
}
__setup("hashdist=", set_hashdist);
#endif

/*
 * allocate a large system hash table from bootmem
 * - it is assumed that the hash table must contain an exact power-of-2
 *   quantity of entries
 * - limit is the number of hash buckets, not the total allocation size
 */
void *__init alloc_large_system_hash(const char *tablename,
				     unsigned long bucketsize,
				     unsigned long numentries,
				     int scale,
				     int flags,
				     unsigned int *_hash_shift,
				     unsigned int *_hash_mask,
5499 5500
				     unsigned long low_limit,
				     unsigned long high_limit)
L
Linus Torvalds 已提交
5501
{
5502
	unsigned long long max = high_limit;
L
Linus Torvalds 已提交
5503 5504 5505 5506 5507 5508
	unsigned long log2qty, size;
	void *table = NULL;

	/* allow the kernel cmdline to have a say */
	if (!numentries) {
		/* round applicable memory size up to nearest megabyte */
A
Andrew Morton 已提交
5509
		numentries = nr_kernel_pages;
L
Linus Torvalds 已提交
5510 5511 5512 5513 5514 5515 5516 5517 5518
		numentries += (1UL << (20 - PAGE_SHIFT)) - 1;
		numentries >>= 20 - PAGE_SHIFT;
		numentries <<= 20 - PAGE_SHIFT;

		/* limit to 1 bucket per 2^scale bytes of low memory */
		if (scale > PAGE_SHIFT)
			numentries >>= (scale - PAGE_SHIFT);
		else
			numentries <<= (PAGE_SHIFT - scale);
5519 5520

		/* Make sure we've got at least a 0-order allocation.. */
5521 5522 5523 5524 5525 5526 5527 5528
		if (unlikely(flags & HASH_SMALL)) {
			/* Makes no sense without HASH_EARLY */
			WARN_ON(!(flags & HASH_EARLY));
			if (!(numentries >> *_hash_shift)) {
				numentries = 1UL << *_hash_shift;
				BUG_ON(!numentries);
			}
		} else if (unlikely((numentries * bucketsize) < PAGE_SIZE))
5529
			numentries = PAGE_SIZE / bucketsize;
L
Linus Torvalds 已提交
5530
	}
5531
	numentries = roundup_pow_of_two(numentries);
L
Linus Torvalds 已提交
5532 5533 5534 5535 5536 5537

	/* limit allocation size to 1/16 total memory by default */
	if (max == 0) {
		max = ((unsigned long long)nr_all_pages << PAGE_SHIFT) >> 4;
		do_div(max, bucketsize);
	}
5538
	max = min(max, 0x80000000ULL);
L
Linus Torvalds 已提交
5539

5540 5541
	if (numentries < low_limit)
		numentries = low_limit;
L
Linus Torvalds 已提交
5542 5543 5544
	if (numentries > max)
		numentries = max;

5545
	log2qty = ilog2(numentries);
L
Linus Torvalds 已提交
5546 5547 5548 5549

	do {
		size = bucketsize << log2qty;
		if (flags & HASH_EARLY)
5550
			table = alloc_bootmem_nopanic(size);
L
Linus Torvalds 已提交
5551 5552 5553
		else if (hashdist)
			table = __vmalloc(size, GFP_ATOMIC, PAGE_KERNEL);
		else {
5554 5555
			/*
			 * If bucketsize is not a power-of-two, we may free
5556 5557
			 * some pages at the end of hash table which
			 * alloc_pages_exact() automatically does
5558
			 */
5559
			if (get_order(size) < MAX_ORDER) {
5560
				table = alloc_pages_exact(size, GFP_ATOMIC);
5561 5562
				kmemleak_alloc(table, size, 1, GFP_ATOMIC);
			}
L
Linus Torvalds 已提交
5563 5564 5565 5566 5567 5568
		}
	} while (!table && size > PAGE_SIZE && --log2qty);

	if (!table)
		panic("Failed to allocate %s hash table\n", tablename);

5569
	printk(KERN_INFO "%s hash table entries: %ld (order: %d, %lu bytes)\n",
L
Linus Torvalds 已提交
5570
	       tablename,
5571
	       (1UL << log2qty),
5572
	       ilog2(size) - PAGE_SHIFT,
L
Linus Torvalds 已提交
5573 5574 5575 5576 5577 5578 5579 5580 5581
	       size);

	if (_hash_shift)
		*_hash_shift = log2qty;
	if (_hash_mask)
		*_hash_mask = (1 << log2qty) - 1;

	return table;
}
5582

5583 5584 5585 5586 5587 5588 5589 5590 5591 5592 5593 5594 5595 5596 5597
/* Return a pointer to the bitmap storing bits affecting a block of pages */
static inline unsigned long *get_pageblock_bitmap(struct zone *zone,
							unsigned long pfn)
{
#ifdef CONFIG_SPARSEMEM
	return __pfn_to_section(pfn)->pageblock_flags;
#else
	return zone->pageblock_flags;
#endif /* CONFIG_SPARSEMEM */
}

static inline int pfn_to_bitidx(struct zone *zone, unsigned long pfn)
{
#ifdef CONFIG_SPARSEMEM
	pfn &= (PAGES_PER_SECTION-1);
5598
	return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
5599 5600
#else
	pfn = pfn - zone->zone_start_pfn;
5601
	return (pfn >> pageblock_order) * NR_PAGEBLOCK_BITS;
5602 5603 5604 5605
#endif /* CONFIG_SPARSEMEM */
}

/**
5606
 * get_pageblock_flags_group - Return the requested group of flags for the pageblock_nr_pages block of pages
5607 5608 5609 5610 5611 5612 5613 5614 5615 5616 5617 5618 5619 5620 5621 5622 5623 5624 5625 5626 5627 5628
 * @page: The page within the block of interest
 * @start_bitidx: The first bit of interest to retrieve
 * @end_bitidx: The last bit of interest
 * returns pageblock_bits flags
 */
unsigned long get_pageblock_flags_group(struct page *page,
					int start_bitidx, int end_bitidx)
{
	struct zone *zone;
	unsigned long *bitmap;
	unsigned long pfn, bitidx;
	unsigned long flags = 0;
	unsigned long value = 1;

	zone = page_zone(page);
	pfn = page_to_pfn(page);
	bitmap = get_pageblock_bitmap(zone, pfn);
	bitidx = pfn_to_bitidx(zone, pfn);

	for (; start_bitidx <= end_bitidx; start_bitidx++, value <<= 1)
		if (test_bit(bitidx + start_bitidx, bitmap))
			flags |= value;
5629

5630 5631 5632 5633
	return flags;
}

/**
5634
 * set_pageblock_flags_group - Set the requested group of flags for a pageblock_nr_pages block of pages
5635 5636 5637 5638 5639 5640 5641 5642 5643 5644 5645 5646 5647 5648 5649 5650 5651
 * @page: The page within the block of interest
 * @start_bitidx: The first bit of interest
 * @end_bitidx: The last bit of interest
 * @flags: The flags to set
 */
void set_pageblock_flags_group(struct page *page, unsigned long flags,
					int start_bitidx, int end_bitidx)
{
	struct zone *zone;
	unsigned long *bitmap;
	unsigned long pfn, bitidx;
	unsigned long value = 1;

	zone = page_zone(page);
	pfn = page_to_pfn(page);
	bitmap = get_pageblock_bitmap(zone, pfn);
	bitidx = pfn_to_bitidx(zone, pfn);
5652 5653
	VM_BUG_ON(pfn < zone->zone_start_pfn);
	VM_BUG_ON(pfn >= zone->zone_start_pfn + zone->spanned_pages);
5654 5655 5656 5657 5658 5659 5660

	for (; start_bitidx <= end_bitidx; start_bitidx++, value <<= 1)
		if (flags & value)
			__set_bit(bitidx + start_bitidx, bitmap);
		else
			__clear_bit(bitidx + start_bitidx, bitmap);
}
K
KAMEZAWA Hiroyuki 已提交
5661 5662

/*
5663 5664 5665 5666 5667 5668
 * This function checks whether pageblock includes unmovable pages or not.
 * If @count is not zero, it is okay to include less @count unmovable pages
 *
 * PageLRU check wihtout isolation or lru_lock could race so that
 * MIGRATE_MOVABLE block might include unmovable pages. It means you can't
 * expect this function should be exact.
K
KAMEZAWA Hiroyuki 已提交
5669
 */
5670 5671
bool has_unmovable_pages(struct zone *zone, struct page *page, int count,
			 bool skip_hwpoisoned_pages)
5672 5673
{
	unsigned long pfn, iter, found;
5674 5675
	int mt;

5676 5677
	/*
	 * For avoiding noise data, lru_add_drain_all() should be called
5678
	 * If ZONE_MOVABLE, the zone never contains unmovable pages
5679 5680
	 */
	if (zone_idx(zone) == ZONE_MOVABLE)
5681
		return false;
5682 5683
	mt = get_pageblock_migratetype(page);
	if (mt == MIGRATE_MOVABLE || is_migrate_cma(mt))
5684
		return false;
5685 5686 5687 5688 5689

	pfn = page_to_pfn(page);
	for (found = 0, iter = 0; iter < pageblock_nr_pages; iter++) {
		unsigned long check = pfn + iter;

5690
		if (!pfn_valid_within(check))
5691
			continue;
5692

5693
		page = pfn_to_page(check);
5694 5695 5696 5697 5698 5699 5700
		/*
		 * We can't use page_count without pin a page
		 * because another CPU can free compound page.
		 * This check already skips compound tails of THP
		 * because their page->_count is zero at all time.
		 */
		if (!atomic_read(&page->_count)) {
5701 5702 5703 5704
			if (PageBuddy(page))
				iter += (1 << page_order(page)) - 1;
			continue;
		}
5705

5706 5707 5708 5709 5710 5711 5712
		/*
		 * The HWPoisoned page may be not in buddy system, and
		 * page_count() is not 0.
		 */
		if (skip_hwpoisoned_pages && PageHWPoison(page))
			continue;

5713 5714 5715 5716 5717 5718 5719 5720 5721 5722 5723 5724 5725 5726 5727 5728
		if (!PageLRU(page))
			found++;
		/*
		 * If there are RECLAIMABLE pages, we need to check it.
		 * But now, memory offline itself doesn't call shrink_slab()
		 * and it still to be fixed.
		 */
		/*
		 * If the page is not RAM, page_count()should be 0.
		 * we don't need more check. This is an _used_ not-movable page.
		 *
		 * The problematic thing here is PG_reserved pages. PG_reserved
		 * is set to both of a memory hole page and a _used_ kernel
		 * page at boot.
		 */
		if (found > count)
5729
			return true;
5730
	}
5731
	return false;
5732 5733 5734 5735
}

bool is_pageblock_removable_nolock(struct page *page)
{
5736 5737
	struct zone *zone;
	unsigned long pfn;
5738 5739 5740 5741 5742

	/*
	 * We have to be careful here because we are iterating over memory
	 * sections which are not zone aware so we might end up outside of
	 * the zone but still within the section.
5743 5744
	 * We have to take care about the node as well. If the node is offline
	 * its NODE_DATA will be NULL - see page_zone.
5745
	 */
5746 5747 5748 5749 5750 5751
	if (!node_online(page_to_nid(page)))
		return false;

	zone = page_zone(page);
	pfn = page_to_pfn(page);
	if (zone->zone_start_pfn > pfn ||
5752 5753 5754
			zone->zone_start_pfn + zone->spanned_pages <= pfn)
		return false;

5755
	return !has_unmovable_pages(zone, page, 0, true);
K
KAMEZAWA Hiroyuki 已提交
5756
}
K
KAMEZAWA Hiroyuki 已提交
5757

5758 5759 5760 5761 5762 5763 5764 5765 5766 5767 5768 5769 5770 5771 5772
#ifdef CONFIG_CMA

static unsigned long pfn_max_align_down(unsigned long pfn)
{
	return pfn & ~(max_t(unsigned long, MAX_ORDER_NR_PAGES,
			     pageblock_nr_pages) - 1);
}

static unsigned long pfn_max_align_up(unsigned long pfn)
{
	return ALIGN(pfn, max_t(unsigned long, MAX_ORDER_NR_PAGES,
				pageblock_nr_pages));
}

/* [start, end) must belong to a single zone. */
5773 5774
static int __alloc_contig_migrate_range(struct compact_control *cc,
					unsigned long start, unsigned long end)
5775 5776
{
	/* This function is based on compact_zone() from compaction.c. */
5777
	unsigned long nr_reclaimed;
5778 5779 5780 5781
	unsigned long pfn = start;
	unsigned int tries = 0;
	int ret = 0;

5782
	migrate_prep();
5783

5784
	while (pfn < end || !list_empty(&cc->migratepages)) {
5785 5786 5787 5788 5789
		if (fatal_signal_pending(current)) {
			ret = -EINTR;
			break;
		}

5790 5791 5792
		if (list_empty(&cc->migratepages)) {
			cc->nr_migratepages = 0;
			pfn = isolate_migratepages_range(cc->zone, cc,
M
Minchan Kim 已提交
5793
							 pfn, end, true);
5794 5795 5796 5797 5798 5799 5800 5801 5802 5803
			if (!pfn) {
				ret = -EINTR;
				break;
			}
			tries = 0;
		} else if (++tries == 5) {
			ret = ret < 0 ? ret : -EBUSY;
			break;
		}

5804 5805 5806
		nr_reclaimed = reclaim_clean_pages_from_list(cc->zone,
							&cc->migratepages);
		cc->nr_migratepages -= nr_reclaimed;
5807

5808
		ret = migrate_pages(&cc->migratepages,
5809
				    alloc_migrate_target,
5810 5811
				    0, false, MIGRATE_SYNC,
				    MR_CMA);
5812 5813
	}

5814
	putback_movable_pages(&cc->migratepages);
5815 5816 5817 5818 5819 5820 5821
	return ret > 0 ? 0 : ret;
}

/**
 * alloc_contig_range() -- tries to allocate given range of pages
 * @start:	start PFN to allocate
 * @end:	one-past-the-last PFN to allocate
5822 5823 5824 5825
 * @migratetype:	migratetype of the underlaying pageblocks (either
 *			#MIGRATE_MOVABLE or #MIGRATE_CMA).  All pageblocks
 *			in range must have the same migratetype and it must
 *			be either of the two.
5826 5827 5828 5829 5830 5831 5832 5833 5834 5835 5836 5837
 *
 * The PFN range does not have to be pageblock or MAX_ORDER_NR_PAGES
 * aligned, however it's the caller's responsibility to guarantee that
 * we are the only thread that changes migrate type of pageblocks the
 * pages fall in.
 *
 * The PFN range must belong to a single zone.
 *
 * Returns zero on success or negative error code.  On success all
 * pages which PFN is in [start, end) are allocated for the caller and
 * need to be freed with free_contig_range().
 */
5838 5839
int alloc_contig_range(unsigned long start, unsigned long end,
		       unsigned migratetype)
5840 5841 5842 5843
{
	unsigned long outer_start, outer_end;
	int ret = 0, order;

5844 5845 5846 5847 5848 5849 5850 5851 5852
	struct compact_control cc = {
		.nr_migratepages = 0,
		.order = -1,
		.zone = page_zone(pfn_to_page(start)),
		.sync = true,
		.ignore_skip_hint = true,
	};
	INIT_LIST_HEAD(&cc.migratepages);

5853 5854 5855 5856 5857 5858 5859 5860 5861 5862 5863 5864 5865 5866 5867 5868 5869 5870 5871 5872 5873 5874 5875 5876 5877
	/*
	 * What we do here is we mark all pageblocks in range as
	 * MIGRATE_ISOLATE.  Because pageblock and max order pages may
	 * have different sizes, and due to the way page allocator
	 * work, we align the range to biggest of the two pages so
	 * that page allocator won't try to merge buddies from
	 * different pageblocks and change MIGRATE_ISOLATE to some
	 * other migration type.
	 *
	 * Once the pageblocks are marked as MIGRATE_ISOLATE, we
	 * migrate the pages from an unaligned range (ie. pages that
	 * we are interested in).  This will put all the pages in
	 * range back to page allocator as MIGRATE_ISOLATE.
	 *
	 * When this is done, we take the pages in range from page
	 * allocator removing them from the buddy system.  This way
	 * page allocator will never consider using them.
	 *
	 * This lets us mark the pageblocks back as
	 * MIGRATE_CMA/MIGRATE_MOVABLE so that free pages in the
	 * aligned range but not in the unaligned, original range are
	 * put back to page allocator so that buddy can use them.
	 */

	ret = start_isolate_page_range(pfn_max_align_down(start),
5878 5879
				       pfn_max_align_up(end), migratetype,
				       false);
5880
	if (ret)
5881
		return ret;
5882

5883
	ret = __alloc_contig_migrate_range(&cc, start, end);
5884 5885 5886 5887 5888 5889 5890 5891 5892 5893 5894 5895 5896 5897 5898 5899 5900 5901 5902 5903 5904 5905 5906 5907 5908 5909 5910 5911 5912 5913 5914 5915 5916 5917
	if (ret)
		goto done;

	/*
	 * Pages from [start, end) are within a MAX_ORDER_NR_PAGES
	 * aligned blocks that are marked as MIGRATE_ISOLATE.  What's
	 * more, all pages in [start, end) are free in page allocator.
	 * What we are going to do is to allocate all pages from
	 * [start, end) (that is remove them from page allocator).
	 *
	 * The only problem is that pages at the beginning and at the
	 * end of interesting range may be not aligned with pages that
	 * page allocator holds, ie. they can be part of higher order
	 * pages.  Because of this, we reserve the bigger range and
	 * once this is done free the pages we are not interested in.
	 *
	 * We don't have to hold zone->lock here because the pages are
	 * isolated thus they won't get removed from buddy.
	 */

	lru_add_drain_all();
	drain_all_pages();

	order = 0;
	outer_start = start;
	while (!PageBuddy(pfn_to_page(outer_start))) {
		if (++order >= MAX_ORDER) {
			ret = -EBUSY;
			goto done;
		}
		outer_start &= ~0UL << order;
	}

	/* Make sure the range is really isolated. */
5918
	if (test_pages_isolated(outer_start, end, false)) {
5919 5920 5921 5922 5923 5924
		pr_warn("alloc_contig_range test_pages_isolated(%lx, %lx) failed\n",
		       outer_start, end);
		ret = -EBUSY;
		goto done;
	}

5925 5926

	/* Grab isolated pages from freelists. */
5927
	outer_end = isolate_freepages_range(&cc, outer_start, end);
5928 5929 5930 5931 5932 5933 5934 5935 5936 5937 5938 5939 5940
	if (!outer_end) {
		ret = -EBUSY;
		goto done;
	}

	/* Free head and tail (if any) */
	if (start != outer_start)
		free_contig_range(outer_start, start - outer_start);
	if (end != outer_end)
		free_contig_range(end, outer_end - end);

done:
	undo_isolate_page_range(pfn_max_align_down(start),
5941
				pfn_max_align_up(end), migratetype);
5942 5943 5944 5945 5946 5947 5948 5949 5950 5951
	return ret;
}

void free_contig_range(unsigned long pfn, unsigned nr_pages)
{
	for (; nr_pages--; ++pfn)
		__free_page(pfn_to_page(pfn));
}
#endif

5952 5953 5954 5955 5956 5957 5958 5959 5960 5961 5962 5963 5964 5965 5966 5967 5968
#ifdef CONFIG_MEMORY_HOTPLUG
static int __meminit __zone_pcp_update(void *data)
{
	struct zone *zone = data;
	int cpu;
	unsigned long batch = zone_batchsize(zone), flags;

	for_each_possible_cpu(cpu) {
		struct per_cpu_pageset *pset;
		struct per_cpu_pages *pcp;

		pset = per_cpu_ptr(zone->pageset, cpu);
		pcp = &pset->pcp;

		local_irq_save(flags);
		if (pcp->count > 0)
			free_pcppages_bulk(zone, pcp->count, pcp);
5969
		drain_zonestat(zone, pset);
5970 5971 5972 5973 5974 5975 5976 5977 5978 5979 5980 5981
		setup_pageset(pset, batch);
		local_irq_restore(flags);
	}
	return 0;
}

void __meminit zone_pcp_update(struct zone *zone)
{
	stop_machine(__zone_pcp_update, zone, NULL);
}
#endif

5982 5983 5984
void zone_pcp_reset(struct zone *zone)
{
	unsigned long flags;
5985 5986
	int cpu;
	struct per_cpu_pageset *pset;
5987 5988 5989 5990

	/* avoid races with drain_pages()  */
	local_irq_save(flags);
	if (zone->pageset != &boot_pageset) {
5991 5992 5993 5994
		for_each_online_cpu(cpu) {
			pset = per_cpu_ptr(zone->pageset, cpu);
			drain_zonestat(zone, pset);
		}
5995 5996 5997 5998 5999 6000
		free_percpu(zone->pageset);
		zone->pageset = &boot_pageset;
	}
	local_irq_restore(flags);
}

6001
#ifdef CONFIG_MEMORY_HOTREMOVE
K
KAMEZAWA Hiroyuki 已提交
6002 6003 6004 6005 6006 6007 6008 6009 6010 6011 6012 6013 6014 6015 6016 6017 6018 6019 6020 6021 6022 6023 6024 6025 6026 6027
/*
 * All pages in the range must be isolated before calling this.
 */
void
__offline_isolated_pages(unsigned long start_pfn, unsigned long end_pfn)
{
	struct page *page;
	struct zone *zone;
	int order, i;
	unsigned long pfn;
	unsigned long flags;
	/* find the first valid pfn */
	for (pfn = start_pfn; pfn < end_pfn; pfn++)
		if (pfn_valid(pfn))
			break;
	if (pfn == end_pfn)
		return;
	zone = page_zone(pfn_to_page(pfn));
	spin_lock_irqsave(&zone->lock, flags);
	pfn = start_pfn;
	while (pfn < end_pfn) {
		if (!pfn_valid(pfn)) {
			pfn++;
			continue;
		}
		page = pfn_to_page(pfn);
6028 6029 6030 6031 6032 6033 6034 6035 6036 6037
		/*
		 * The HWPoisoned page may be not in buddy system, and
		 * page_count() is not 0.
		 */
		if (unlikely(!PageBuddy(page) && PageHWPoison(page))) {
			pfn++;
			SetPageReserved(page);
			continue;
		}

K
KAMEZAWA Hiroyuki 已提交
6038 6039 6040 6041 6042 6043 6044 6045 6046 6047 6048 6049 6050 6051 6052 6053 6054
		BUG_ON(page_count(page));
		BUG_ON(!PageBuddy(page));
		order = page_order(page);
#ifdef CONFIG_DEBUG_VM
		printk(KERN_INFO "remove from free list %lx %d %lx\n",
		       pfn, 1 << order, end_pfn);
#endif
		list_del(&page->lru);
		rmv_page_order(page);
		zone->free_area[order].nr_free--;
		for (i = 0; i < (1 << order); i++)
			SetPageReserved((page+i));
		pfn += (1 << order);
	}
	spin_unlock_irqrestore(&zone->lock, flags);
}
#endif
6055 6056 6057 6058 6059 6060 6061 6062 6063 6064 6065 6066 6067 6068 6069 6070 6071 6072 6073 6074 6075

#ifdef CONFIG_MEMORY_FAILURE
bool is_free_buddy_page(struct page *page)
{
	struct zone *zone = page_zone(page);
	unsigned long pfn = page_to_pfn(page);
	unsigned long flags;
	int order;

	spin_lock_irqsave(&zone->lock, flags);
	for (order = 0; order < MAX_ORDER; order++) {
		struct page *page_head = page - (pfn & ((1 << order) - 1));

		if (PageBuddy(page_head) && page_order(page_head) >= order)
			break;
	}
	spin_unlock_irqrestore(&zone->lock, flags);

	return order < MAX_ORDER;
}
#endif
6076

A
Andrew Morton 已提交
6077
static const struct trace_print_flags pageflag_names[] = {
6078 6079 6080 6081 6082 6083 6084 6085 6086 6087 6088 6089 6090 6091 6092 6093 6094 6095 6096 6097 6098 6099 6100 6101 6102 6103 6104 6105 6106 6107 6108 6109 6110
	{1UL << PG_locked,		"locked"	},
	{1UL << PG_error,		"error"		},
	{1UL << PG_referenced,		"referenced"	},
	{1UL << PG_uptodate,		"uptodate"	},
	{1UL << PG_dirty,		"dirty"		},
	{1UL << PG_lru,			"lru"		},
	{1UL << PG_active,		"active"	},
	{1UL << PG_slab,		"slab"		},
	{1UL << PG_owner_priv_1,	"owner_priv_1"	},
	{1UL << PG_arch_1,		"arch_1"	},
	{1UL << PG_reserved,		"reserved"	},
	{1UL << PG_private,		"private"	},
	{1UL << PG_private_2,		"private_2"	},
	{1UL << PG_writeback,		"writeback"	},
#ifdef CONFIG_PAGEFLAGS_EXTENDED
	{1UL << PG_head,		"head"		},
	{1UL << PG_tail,		"tail"		},
#else
	{1UL << PG_compound,		"compound"	},
#endif
	{1UL << PG_swapcache,		"swapcache"	},
	{1UL << PG_mappedtodisk,	"mappedtodisk"	},
	{1UL << PG_reclaim,		"reclaim"	},
	{1UL << PG_swapbacked,		"swapbacked"	},
	{1UL << PG_unevictable,		"unevictable"	},
#ifdef CONFIG_MMU
	{1UL << PG_mlocked,		"mlocked"	},
#endif
#ifdef CONFIG_ARCH_USES_PG_UNCACHED
	{1UL << PG_uncached,		"uncached"	},
#endif
#ifdef CONFIG_MEMORY_FAILURE
	{1UL << PG_hwpoison,		"hwpoison"	},
6111 6112 6113
#endif
#ifdef CONFIG_TRANSPARENT_HUGEPAGE
	{1UL << PG_compound_lock,	"compound_lock"	},
6114 6115 6116 6117 6118 6119 6120 6121 6122
#endif
};

static void dump_page_flags(unsigned long flags)
{
	const char *delim = "";
	unsigned long mask;
	int i;

A
Andrew Morton 已提交
6123
	BUILD_BUG_ON(ARRAY_SIZE(pageflag_names) != __NR_PAGEFLAGS);
6124

6125 6126 6127 6128 6129
	printk(KERN_ALERT "page flags: %#lx(", flags);

	/* remove zone id */
	flags &= (1UL << NR_PAGEFLAGS) - 1;

A
Andrew Morton 已提交
6130
	for (i = 0; i < ARRAY_SIZE(pageflag_names) && flags; i++) {
6131 6132 6133 6134 6135 6136 6137 6138 6139 6140 6141 6142 6143 6144 6145 6146 6147 6148 6149 6150 6151

		mask = pageflag_names[i].mask;
		if ((flags & mask) != mask)
			continue;

		flags &= ~mask;
		printk("%s%s", delim, pageflag_names[i].name);
		delim = "|";
	}

	/* check for left over flags */
	if (flags)
		printk("%s%#lx", delim, flags);

	printk(")\n");
}

void dump_page(struct page *page)
{
	printk(KERN_ALERT
	       "page:%p count:%d mapcount:%d mapping:%p index:%#lx\n",
6152
		page, atomic_read(&page->_count), page_mapcount(page),
6153 6154
		page->mapping, page->index);
	dump_page_flags(page->flags);
6155
	mem_cgroup_print_bad_page(page);
6156
}