page_alloc.c 177 KB
Newer Older
Linus Torvalds's avatar
Linus Torvalds committed
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>
Linus Torvalds's avatar
Linus Torvalds committed
23
#include <linux/bootmem.h>
24
#include <linux/memblock.h>
Linus Torvalds's avatar
Linus Torvalds committed
25
#include <linux/compiler.h>
26
#include <linux/kernel.h>
27
#include <linux/kmemcheck.h>
Linus Torvalds's avatar
Linus Torvalds committed
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>
Linus Torvalds's avatar
Linus Torvalds committed
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>
Linus Torvalds's avatar
Linus Torvalds committed
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>
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>
61
#include <linux/hugetlb.h>
62
#include <linux/sched/rt.h>
Linus Torvalds's avatar
Linus Torvalds committed
63

64
#include <asm/sections.h>
Linus Torvalds's avatar
Linus Torvalds committed
65
#include <asm/tlbflush.h>
66
#include <asm/div64.h>
Linus Torvalds's avatar
Linus Torvalds committed
67
68
#include "internal.h"

69
70
71
/* prevent >1 _updater_ of zone percpu pageset ->high and ->batch fields */
static DEFINE_MUTEX(pcp_batch_high_lock);

72
73
74
75
76
#ifdef CONFIG_USE_PERCPU_NUMA_NODE_ID
DEFINE_PER_CPU(int, numa_node);
EXPORT_PER_CPU_SYMBOL(numa_node);
#endif

77
78
79
80
81
82
83
84
85
86
87
#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

Linus Torvalds's avatar
Linus Torvalds committed
88
/*
89
 * Array of node states.
Linus Torvalds's avatar
Linus Torvalds committed
90
 */
91
92
93
94
95
96
97
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 } },
98
99
100
#endif
#ifdef CONFIG_MOVABLE_NODE
	[N_MEMORY] = { { [0] = 1UL } },
101
102
103
104
105
106
#endif
	[N_CPU] = { { [0] = 1UL } },
#endif	/* NUMA */
};
EXPORT_SYMBOL(node_states);

107
108
109
/* Protect totalram_pages and zone->managed_pages */
static DEFINE_SPINLOCK(managed_page_count_lock);

110
unsigned long totalram_pages __read_mostly;
111
unsigned long totalreserve_pages __read_mostly;
112
113
114
115
116
117
118
119
/*
 * 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;

120
int percpu_pagelist_fraction;
121
gfp_t gfp_allowed_mask __read_mostly = GFP_BOOT_MASK;
Linus Torvalds's avatar
Linus Torvalds committed
122

123
124
125
126
127
128
129
130
131
#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).
 */
132
133
134
135

static gfp_t saved_gfp_mask;

void pm_restore_gfp_mask(void)
136
137
{
	WARN_ON(!mutex_is_locked(&pm_mutex));
138
139
140
141
	if (saved_gfp_mask) {
		gfp_allowed_mask = saved_gfp_mask;
		saved_gfp_mask = 0;
	}
142
143
}

144
void pm_restrict_gfp_mask(void)
145
146
{
	WARN_ON(!mutex_is_locked(&pm_mutex));
147
148
149
	WARN_ON(saved_gfp_mask);
	saved_gfp_mask = gfp_allowed_mask;
	gfp_allowed_mask &= ~GFP_IOFS;
150
}
151
152
153
154
155
156
157

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

160
161
162
163
#ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
int pageblock_order __read_mostly;
#endif

164
static void __free_pages_ok(struct page *page, unsigned int order);
165

Linus Torvalds's avatar
Linus Torvalds committed
166
167
168
169
170
171
172
/*
 * 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
173
174
175
 *
 * TBD: should special case ZONE_DMA32 machines here - in those we normally
 * don't need any ZONE_NORMAL reservation
Linus Torvalds's avatar
Linus Torvalds committed
176
 */
177
int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES-1] = {
178
#ifdef CONFIG_ZONE_DMA
179
	 256,
180
#endif
181
#ifdef CONFIG_ZONE_DMA32
182
	 256,
183
#endif
184
#ifdef CONFIG_HIGHMEM
Mel Gorman's avatar
Mel Gorman committed
185
	 32,
186
#endif
Mel Gorman's avatar
Mel Gorman committed
187
	 32,
188
};
Linus Torvalds's avatar
Linus Torvalds committed
189
190
191

EXPORT_SYMBOL(totalram_pages);

192
static char * const zone_names[MAX_NR_ZONES] = {
193
#ifdef CONFIG_ZONE_DMA
194
	 "DMA",
195
#endif
196
#ifdef CONFIG_ZONE_DMA32
197
	 "DMA32",
198
#endif
199
	 "Normal",
200
#ifdef CONFIG_HIGHMEM
Mel Gorman's avatar
Mel Gorman committed
201
	 "HighMem",
202
#endif
Mel Gorman's avatar
Mel Gorman committed
203
	 "Movable",
204
205
};

Linus Torvalds's avatar
Linus Torvalds committed
206
int min_free_kbytes = 1024;
207
int user_min_free_kbytes;
Linus Torvalds's avatar
Linus Torvalds committed
208

209
210
static unsigned long __meminitdata nr_kernel_pages;
static unsigned long __meminitdata nr_all_pages;
211
static unsigned long __meminitdata dma_reserve;
Linus Torvalds's avatar
Linus Torvalds committed
212

Tejun Heo's avatar
Tejun Heo committed
213
214
215
216
217
218
219
220
221
222
223
#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 */
224

Miklos Szeredi's avatar
Miklos Szeredi committed
225
226
#if MAX_NUMNODES > 1
int nr_node_ids __read_mostly = MAX_NUMNODES;
227
int nr_online_nodes __read_mostly = 1;
Miklos Szeredi's avatar
Miklos Szeredi committed
228
EXPORT_SYMBOL(nr_node_ids);
229
EXPORT_SYMBOL(nr_online_nodes);
Miklos Szeredi's avatar
Miklos Szeredi committed
230
231
#endif

232
233
int page_group_by_mobility_disabled __read_mostly;

234
void set_pageblock_migratetype(struct page *page, int migratetype)
235
{
236
237
238
239

	if (unlikely(page_group_by_mobility_disabled))
		migratetype = MIGRATE_UNMOVABLE;

240
241
242
243
	set_pageblock_flags_group(page, (unsigned long)migratetype,
					PB_migrate, PB_migrate_end);
}

244
245
bool oom_killer_disabled __read_mostly;

Nick Piggin's avatar
Nick Piggin committed
246
#ifdef CONFIG_DEBUG_VM
247
static int page_outside_zone_boundaries(struct zone *zone, struct page *page)
Linus Torvalds's avatar
Linus Torvalds committed
248
{
249
250
251
	int ret = 0;
	unsigned seq;
	unsigned long pfn = page_to_pfn(page);
252
	unsigned long sp, start_pfn;
253

254
255
	do {
		seq = zone_span_seqbegin(zone);
256
257
		start_pfn = zone->zone_start_pfn;
		sp = zone->spanned_pages;
258
		if (!zone_spans_pfn(zone, pfn))
259
260
261
			ret = 1;
	} while (zone_span_seqretry(zone, seq));

262
263
264
265
	if (ret)
		pr_err("page %lu outside zone [ %lu - %lu ]\n",
			pfn, start_pfn, start_pfn + sp);

266
	return ret;
267
268
269
270
}

static int page_is_consistent(struct zone *zone, struct page *page)
{
271
	if (!pfn_valid_within(page_to_pfn(page)))
272
		return 0;
Linus Torvalds's avatar
Linus Torvalds committed
273
	if (zone != page_zone(page))
274
275
276
277
278
279
280
281
282
283
		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))
Linus Torvalds's avatar
Linus Torvalds committed
284
		return 1;
285
286
287
	if (!page_is_consistent(zone, page))
		return 1;

Linus Torvalds's avatar
Linus Torvalds committed
288
289
	return 0;
}
Nick Piggin's avatar
Nick Piggin committed
290
291
292
293
294
295
296
#else
static inline int bad_range(struct zone *zone, struct page *page)
{
	return 0;
}
#endif

297
static void bad_page(struct page *page)
Linus Torvalds's avatar
Linus Torvalds committed
298
{
299
300
301
302
	static unsigned long resume;
	static unsigned long nr_shown;
	static unsigned long nr_unshown;

303
304
	/* Don't complain about poisoned pages */
	if (PageHWPoison(page)) {
305
		page_mapcount_reset(page); /* remove PageBuddy */
306
307
308
		return;
	}

309
310
311
312
313
314
315
316
317
318
	/*
	 * 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) {
319
320
			printk(KERN_ALERT
			      "BUG: Bad page state: %lu messages suppressed\n",
321
322
323
324
325
326
327
328
				nr_unshown);
			nr_unshown = 0;
		}
		nr_shown = 0;
	}
	if (nr_shown++ == 0)
		resume = jiffies + 60 * HZ;

329
	printk(KERN_ALERT "BUG: Bad page state in process %s  pfn:%05lx\n",
330
		current->comm, page_to_pfn(page));
331
	dump_page(page);
332

333
	print_modules();
Linus Torvalds's avatar
Linus Torvalds committed
334
	dump_stack();
335
out:
336
	/* Leave bad fields for debug, except PageBuddy could make trouble */
337
	page_mapcount_reset(page); /* remove PageBuddy */
338
	add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE);
Linus Torvalds's avatar
Linus Torvalds committed
339
340
341
342
343
344
345
346
347
}

/*
 * 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".
 *
348
349
 * All pages have PG_compound set.  All tail pages have their ->first_page
 * pointing at the head page.
Linus Torvalds's avatar
Linus Torvalds committed
350
 *
351
352
353
 * 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.
Linus Torvalds's avatar
Linus Torvalds committed
354
 */
355
356
357

static void free_compound_page(struct page *page)
{
358
	__free_pages_ok(page, compound_order(page));
359
360
}

361
void prep_compound_page(struct page *page, unsigned long order)
362
363
364
365
366
367
368
369
370
371
{
	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);
372
		set_page_count(p, 0);
373
374
375
376
		p->first_page = page;
	}
}

377
/* update __split_huge_page_refcount if you change this function */
378
static int destroy_compound_page(struct page *page, unsigned long order)
Linus Torvalds's avatar
Linus Torvalds committed
379
380
381
{
	int i;
	int nr_pages = 1 << order;
382
	int bad = 0;
Linus Torvalds's avatar
Linus Torvalds committed
383

384
	if (unlikely(compound_order(page) != order)) {
385
		bad_page(page);
386
387
		bad++;
	}
Linus Torvalds's avatar
Linus Torvalds committed
388

389
	__ClearPageHead(page);
390

391
392
	for (i = 1; i < nr_pages; i++) {
		struct page *p = page + i;
Linus Torvalds's avatar
Linus Torvalds committed
393

394
		if (unlikely(!PageTail(p) || (p->first_page != page))) {
395
			bad_page(page);
396
397
			bad++;
		}
398
		__ClearPageTail(p);
Linus Torvalds's avatar
Linus Torvalds committed
399
	}
400
401

	return bad;
Linus Torvalds's avatar
Linus Torvalds committed
402
403
}

Nick Piggin's avatar
Nick Piggin committed
404
405
406
407
static inline void prep_zero_page(struct page *page, int order, gfp_t gfp_flags)
{
	int i;

408
409
410
411
	/*
	 * clear_highpage() will use KM_USER0, so it's a bug to use __GFP_ZERO
	 * and __GFP_HIGHMEM from hard or soft interrupt context.
	 */
Nick Piggin's avatar
Nick Piggin committed
412
	VM_BUG_ON((gfp_flags & __GFP_HIGHMEM) && in_interrupt());
Nick Piggin's avatar
Nick Piggin committed
413
414
415
416
	for (i = 0; i < (1 << order); i++)
		clear_highpage(page + i);
}

417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
#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

448
449
static inline void set_page_order(struct page *page, int order)
{
450
	set_page_private(page, order);
451
	__SetPageBuddy(page);
Linus Torvalds's avatar
Linus Torvalds committed
452
453
454
455
}

static inline void rmv_page_order(struct page *page)
{
456
	__ClearPageBuddy(page);
457
	set_page_private(page, 0);
Linus Torvalds's avatar
Linus Torvalds committed
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
}

/*
 * 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)
 *
Andreas Mohr's avatar
Andreas Mohr committed
475
 * Assumption: *_mem_map is contiguous at least up to MAX_ORDER
Linus Torvalds's avatar
Linus Torvalds committed
476
477
 */
static inline unsigned long
478
__find_buddy_index(unsigned long page_idx, unsigned int order)
Linus Torvalds's avatar
Linus Torvalds committed
479
{
480
	return page_idx ^ (1 << order);
Linus Torvalds's avatar
Linus Torvalds committed
481
482
483
484
485
}

/*
 * This function checks whether a page is free && is the buddy
 * we can do coalesce a page and its buddy if
Nick Piggin's avatar
Nick Piggin committed
486
 * (a) the buddy is not in a hole &&
487
 * (b) the buddy is in the buddy system &&
488
489
 * (c) a page and its buddy have the same order &&
 * (d) a page and its buddy are in the same zone.
490
 *
Andrea Arcangeli's avatar
Andrea Arcangeli committed
491
492
 * 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.
Linus Torvalds's avatar
Linus Torvalds committed
493
 *
494
 * For recording page's order, we use page_private(page).
Linus Torvalds's avatar
Linus Torvalds committed
495
 */
496
497
static inline int page_is_buddy(struct page *page, struct page *buddy,
								int order)
Linus Torvalds's avatar
Linus Torvalds committed
498
{
499
	if (!pfn_valid_within(page_to_pfn(buddy)))
Nick Piggin's avatar
Nick Piggin committed
500
501
		return 0;

502
503
504
	if (page_zone_id(page) != page_zone_id(buddy))
		return 0;

505
506
507
508
509
	if (page_is_guard(buddy) && page_order(buddy) == order) {
		VM_BUG_ON(page_count(buddy) != 0);
		return 1;
	}

510
	if (PageBuddy(buddy) && page_order(buddy) == order) {
511
		VM_BUG_ON(page_count(buddy) != 0);
512
		return 1;
513
	}
514
	return 0;
Linus Torvalds's avatar
Linus Torvalds committed
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
}

/*
 * 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
Andrea Arcangeli's avatar
Andrea Arcangeli committed
530
 * free pages of length of (1 << order) and marked with _mapcount -2. Page's
531
 * order is recorded in page_private(page) field.
Linus Torvalds's avatar
Linus Torvalds committed
532
 * So when we are allocating or freeing one, we can derive the state of the
533
534
 * other.  That is, if we allocate a small block, and both were
 * free, the remainder of the region must be split into blocks.
Linus Torvalds's avatar
Linus Torvalds committed
535
 * If a block is freed, and its buddy is also free, then this
536
 * triggers coalescing into a block of larger size.
Linus Torvalds's avatar
Linus Torvalds committed
537
 *
538
 * -- nyc
Linus Torvalds's avatar
Linus Torvalds committed
539
540
 */

Nick Piggin's avatar
Nick Piggin committed
541
static inline void __free_one_page(struct page *page,
542
543
		struct zone *zone, unsigned int order,
		int migratetype)
Linus Torvalds's avatar
Linus Torvalds committed
544
545
{
	unsigned long page_idx;
546
	unsigned long combined_idx;
547
	unsigned long uninitialized_var(buddy_idx);
548
	struct page *buddy;
Linus Torvalds's avatar
Linus Torvalds committed
549

550
551
	VM_BUG_ON(!zone_is_initialized(zone));

552
	if (unlikely(PageCompound(page)))
553
554
		if (unlikely(destroy_compound_page(page, order)))
			return;
Linus Torvalds's avatar
Linus Torvalds committed
555

556
557
	VM_BUG_ON(migratetype == -1);

Linus Torvalds's avatar
Linus Torvalds committed
558
559
	page_idx = page_to_pfn(page) & ((1 << MAX_ORDER) - 1);

560
	VM_BUG_ON(page_idx & ((1 << order) - 1));
Nick Piggin's avatar
Nick Piggin committed
561
	VM_BUG_ON(bad_range(zone, page));
Linus Torvalds's avatar
Linus Torvalds committed
562
563

	while (order < MAX_ORDER-1) {
564
565
		buddy_idx = __find_buddy_index(page_idx, order);
		buddy = page + (buddy_idx - page_idx);
566
		if (!page_is_buddy(page, buddy, order))
567
			break;
568
569
570
571
572
573
574
		/*
		 * 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);
575
576
			__mod_zone_freepage_state(zone, 1 << order,
						  migratetype);
577
578
579
580
581
		} else {
			list_del(&buddy->lru);
			zone->free_area[order].nr_free--;
			rmv_page_order(buddy);
		}
582
		combined_idx = buddy_idx & page_idx;
Linus Torvalds's avatar
Linus Torvalds committed
583
584
585
586
587
		page = page + (combined_idx - page_idx);
		page_idx = combined_idx;
		order++;
	}
	set_page_order(page, order);
588
589
590
591
592
593
594
595
596

	/*
	 * 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
	 */
597
	if ((order < MAX_ORDER-2) && pfn_valid_within(page_to_pfn(buddy))) {
598
		struct page *higher_page, *higher_buddy;
599
600
601
		combined_idx = buddy_idx & page_idx;
		higher_page = page + (combined_idx - page_idx);
		buddy_idx = __find_buddy_index(combined_idx, order + 1);
602
		higher_buddy = higher_page + (buddy_idx - combined_idx);
603
604
605
606
607
608
609
610
611
		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:
Linus Torvalds's avatar
Linus Torvalds committed
612
613
614
	zone->free_area[order].nr_free++;
}

615
static inline int free_pages_check(struct page *page)
Linus Torvalds's avatar
Linus Torvalds committed
616
{
Nick Piggin's avatar
Nick Piggin committed
617
618
	if (unlikely(page_mapcount(page) |
		(page->mapping != NULL)  |
619
		(atomic_read(&page->_count) != 0) |
620
621
		(page->flags & PAGE_FLAGS_CHECK_AT_FREE) |
		(mem_cgroup_bad_page_check(page)))) {
622
		bad_page(page);
623
		return 1;
624
	}
625
	page_nid_reset_last(page);
626
627
628
	if (page->flags & PAGE_FLAGS_CHECK_AT_PREP)
		page->flags &= ~PAGE_FLAGS_CHECK_AT_PREP;
	return 0;
Linus Torvalds's avatar
Linus Torvalds committed
629
630
631
}

/*
632
 * Frees a number of pages from the PCP lists
Linus Torvalds's avatar
Linus Torvalds committed
633
 * Assumes all pages on list are in same zone, and of same order.
634
 * count is the number of pages to free.
Linus Torvalds's avatar
Linus Torvalds committed
635
636
637
638
639
640
641
 *
 * 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.
 */
642
643
static void free_pcppages_bulk(struct zone *zone, int count,
					struct per_cpu_pages *pcp)
Linus Torvalds's avatar
Linus Torvalds committed
644
{
645
	int migratetype = 0;
646
	int batch_free = 0;
647
	int to_free = count;
648

Nick Piggin's avatar
Nick Piggin committed
649
	spin_lock(&zone->lock);
650
	zone->all_unreclaimable = 0;
Linus Torvalds's avatar
Linus Torvalds committed
651
	zone->pages_scanned = 0;
652

653
	while (to_free) {
Nick Piggin's avatar
Nick Piggin committed
654
		struct page *page;
655
656
657
		struct list_head *list;

		/*
658
659
660
661
662
		 * 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
663
664
		 */
		do {
665
			batch_free++;
666
667
668
669
			if (++migratetype == MIGRATE_PCPTYPES)
				migratetype = 0;
			list = &pcp->lists[migratetype];
		} while (list_empty(list));
Nick Piggin's avatar
Nick Piggin committed
670

671
672
673
674
		/* This is the only non-empty list. Free them all. */
		if (batch_free == MIGRATE_PCPTYPES)
			batch_free = to_free;

675
		do {
676
677
			int mt;	/* migratetype of the to-be-freed page */

678
679
680
			page = list_entry(list->prev, struct page, lru);
			/* must delete as __free_one_page list manipulates */
			list_del(&page->lru);
681
			mt = get_freepage_migratetype(page);
682
			/* MIGRATE_MOVABLE list may include MIGRATE_RESERVEs */
683
684
			__free_one_page(page, zone, 0, mt);
			trace_mm_page_pcpu_drain(page, 0, mt);
685
			if (likely(!is_migrate_isolate_page(page))) {
686
687
688
689
				__mod_zone_page_state(zone, NR_FREE_PAGES, 1);
				if (is_migrate_cma(mt))
					__mod_zone_page_state(zone, NR_FREE_CMA_PAGES, 1);
			}
690
		} while (--to_free && --batch_free && !list_empty(list));
Linus Torvalds's avatar
Linus Torvalds committed
691
	}
Nick Piggin's avatar
Nick Piggin committed
692
	spin_unlock(&zone->lock);
Linus Torvalds's avatar
Linus Torvalds committed
693
694
}

695
696
static void free_one_page(struct zone *zone, struct page *page, int order,
				int migratetype)
Linus Torvalds's avatar
Linus Torvalds committed
697
{
698
	spin_lock(&zone->lock);
699
	zone->all_unreclaimable = 0;
700
	zone->pages_scanned = 0;
701

702
	__free_one_page(page, zone, order, migratetype);
703
	if (unlikely(!is_migrate_isolate(migratetype)))
704
		__mod_zone_freepage_state(zone, 1 << order, migratetype);
705
	spin_unlock(&zone->lock);
Nick Piggin's avatar
Nick Piggin committed
706
707
}

708
static bool free_pages_prepare(struct page *page, unsigned int order)
Nick Piggin's avatar
Nick Piggin committed
709
{
Linus Torvalds's avatar
Linus Torvalds committed
710
	int i;
711
	int bad = 0;
Linus Torvalds's avatar
Linus Torvalds committed
712

713
	trace_mm_page_free(page, order);
714
715
	kmemcheck_free_shadow(page, order);

Andrea Arcangeli's avatar
Andrea Arcangeli committed
716
717
718
719
	if (PageAnon(page))
		page->mapping = NULL;
	for (i = 0; i < (1 << order); i++)
		bad += free_pages_check(page + i);
720
	if (bad)
721
		return false;
722

723
	if (!PageHighMem(page)) {
Nick Piggin's avatar
Nick Piggin committed
724
		debug_check_no_locks_freed(page_address(page),PAGE_SIZE<<order);
725
726
727
		debug_check_no_obj_freed(page_address(page),
					   PAGE_SIZE << order);
	}
Nick Piggin's avatar
Nick Piggin committed
728
	arch_free_page(page, order);
Nick Piggin's avatar
Nick Piggin committed
729
	kernel_map_pages(page, 1 << order, 0);
Nick Piggin's avatar
Nick Piggin committed
730

731
732
733
734
735
736
	return true;
}

static void __free_pages_ok(struct page *page, unsigned int order)
{
	unsigned long flags;
737
	int migratetype;
738
739
740
741

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

Nick Piggin's avatar
Nick Piggin committed
742
	local_irq_save(flags);
743
	__count_vm_events(PGFREE, 1 << order);
744
745
746
	migratetype = get_pageblock_migratetype(page);
	set_freepage_migratetype(page, migratetype);
	free_one_page(page_zone(page), page, order, migratetype);
Nick Piggin's avatar
Nick Piggin committed
747
	local_irq_restore(flags);
Linus Torvalds's avatar
Linus Torvalds committed
748
749
}

750
void __init __free_pages_bootmem(struct page *page, unsigned int order)
751
{
752
753
	unsigned int nr_pages = 1 << order;
	unsigned int loop;
754

755
756
757
758
759
760
761
762
	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);
763
	}
764

765
	page_zone(page)->managed_pages += 1 << order;
766
767
	set_page_refcounted(page);
	__free_pages(page, order);
768
769
}

770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
#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);
785
	adjust_managed_page_count(page, pageblock_nr_pages);
786
787
}
#endif
Linus Torvalds's avatar
Linus Torvalds committed
788
789
790
791
792
793
794
795
796
797
798
799
800

/*
 * 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.
 *
801
 * -- nyc
Linus Torvalds's avatar
Linus Torvalds committed
802
 */
Nick Piggin's avatar
Nick Piggin committed
803
static inline void expand(struct zone *zone, struct page *page,
804
805
	int low, int high, struct free_area *area,
	int migratetype)
Linus Torvalds's avatar
Linus Torvalds committed
806
807
808
809
810
811
812
{
	unsigned long size = 1 << high;

	while (high > low) {
		area--;
		high--;
		size >>= 1;
Nick Piggin's avatar
Nick Piggin committed
813
		VM_BUG_ON(bad_range(zone, &page[size]));
814
815
816
817
818
819
820
821
822
823
824
825
826

#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 */
827
828
			__mod_zone_freepage_state(zone, -(1 << high),
						  migratetype);
829
830
831
			continue;
		}
#endif
832
		list_add(&page[size].lru, &area->free_list[migratetype]);
Linus Torvalds's avatar
Linus Torvalds committed
833
834
835
836
837
838
839
840
		area->nr_free++;
		set_page_order(&page[size], high);
	}
}

/*
 * This page is about to be returned from the page allocator
 */
841
static inline int check_new_page(struct page *page)
Linus Torvalds's avatar
Linus Torvalds committed
842
{
Nick Piggin's avatar
Nick Piggin committed
843
844
	if (unlikely(page_mapcount(page) |
		(page->mapping != NULL)  |
845
		(atomic_read(&page->_count) != 0)  |
846
847
		(page->flags & PAGE_FLAGS_CHECK_AT_PREP) |
		(mem_cgroup_bad_page_check(page)))) {
848
		bad_page(page);
849
		return 1;
850
	}
851
852
853
854
855
856
857
858
859
860
861
862
	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;
	}
863

864
	set_page_private(page, 0);
865
	set_page_refcounted(page);
Nick Piggin's avatar
Nick Piggin committed
866
867

	arch_alloc_page(page, order);
Linus Torvalds's avatar
Linus Torvalds committed
868
	kernel_map_pages(page, 1 << order, 1);
Nick Piggin's avatar
Nick Piggin committed
869
870
871
872
873
874
875

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

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

876
	return 0;
Linus Torvalds's avatar
Linus Torvalds committed
877
878
}

879
880
881
882
/*
 * Go through the free lists for the given migratetype and remove
 * the smallest available page from the freelists
 */
883
884
static inline
struct page *__rmqueue_smallest(struct zone *zone, unsigned int order,
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
						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;
}


910
911
912
913
/*
 * This array describes the order lists are fallen back to when
 * the free lists for the desirable migrate type are depleted
 */
914
915
916
917
918
919
920
921
922
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
923
	[MIGRATE_RESERVE]     = { MIGRATE_RESERVE }, /* Never used */
924
#ifdef CONFIG_MEMORY_ISOLATION
925
	[MIGRATE_ISOLATE]     = { MIGRATE_RESERVE }, /* Never used */
926
#endif
927
928
};

929
930
/*
 * Move the free pages in a range to the free lists of the requested type.
931
 * Note that start_page and end_pages are not aligned on a pageblock
932
933
 * boundary. If alignment is required, use move_freepages_block()
 */
934
int move_freepages(struct zone *zone,
Adrian Bunk's avatar
Adrian Bunk committed
935
936
			  struct page *start_page, struct page *end_page,
			  int migratetype)
937
938
939
{
	struct page *page;
	unsigned long order;
940
	int pages_moved = 0;
941
942
943
944
945
946
947

#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
Mel Gorman's avatar
Mel Gorman committed
948
	 * grouping pages by mobility
949
950
951
952
953
	 */
	BUG_ON(page_zone(start_page) != page_zone(end_page));
#endif

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

957
958
959
960
961
962
963
964
965
966
967
		if (!pfn_valid_within(page_to_pfn(page))) {
			page++;
			continue;
		}

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

		order = page_order(page);
968
969
		list_move(&page->lru,
			  &zone->free_area[order].free_list[migratetype]);
970
		set_freepage_migratetype(page, migratetype);
971
		page += 1 << order;
972
		pages_moved += 1 << order;
973
974
	}

975
	return pages_moved;
976
977
}

978
int move_freepages_block(struct zone *zone, struct page *page,
979
				int migratetype)
980
981
982
983
984
{
	unsigned long start_pfn, end_pfn;
	struct page *start_page, *end_page;

	start_pfn = page_to_pfn(page);
985
	start_pfn = start_pfn & ~(pageblock_nr_pages-1);
986
	start_page = pfn_to_page(start_pfn);
987
988
	end_page = start_page + pageblock_nr_pages - 1;
	end_pfn = start_pfn + pageblock_nr_pages - 1;
989
990

	/* Do not cross zone boundaries */
991
	if (!zone_spans_pfn(zone, start_pfn))
992
		start_page = page;
993
	if (!zone_spans_pfn(zone, end_pfn))
994
995
996
997
998
		return 0;

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

999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
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;
	}
}