page_alloc.c 157 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/oom.h>
Linus Torvalds's avatar
Linus Torvalds committed
34 35 36 37 38
#include <linux/notifier.h>
#include <linux/topology.h>
#include <linux/sysctl.h>
#include <linux/cpu.h>
#include <linux/cpuset.h>
39
#include <linux/memory_hotplug.h>
Linus Torvalds's avatar
Linus Torvalds committed
40 41
#include <linux/nodemask.h>
#include <linux/vmalloc.h>
42
#include <linux/mempolicy.h>
43
#include <linux/stop_machine.h>
44 45
#include <linux/sort.h>
#include <linux/pfn.h>
46
#include <linux/backing-dev.h>
47
#include <linux/fault-inject.h>
48
#include <linux/page-isolation.h>
49
#include <linux/page_cgroup.h>
50
#include <linux/debugobjects.h>
51
#include <linux/kmemleak.h>
52
#include <linux/memory.h>
53
#include <linux/compaction.h>
54
#include <trace/events/kmem.h>
55
#include <linux/ftrace_event.h>
56
#include <linux/memcontrol.h>
Linus Torvalds's avatar
Linus Torvalds committed
57 58

#include <asm/tlbflush.h>
59
#include <asm/div64.h>
Linus Torvalds's avatar
Linus Torvalds committed
60 61
#include "internal.h"

62 63 64 65 66
#ifdef CONFIG_USE_PERCPU_NUMA_NODE_ID
DEFINE_PER_CPU(int, numa_node);
EXPORT_PER_CPU_SYMBOL(numa_node);
#endif

67 68 69 70 71 72 73 74 75 76 77
#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
78
/*
79
 * Array of node states.
Linus Torvalds's avatar
Linus Torvalds committed
80
 */
81 82 83 84 85 86 87 88 89 90 91 92 93
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 } },
#endif
	[N_CPU] = { { [0] = 1UL } },
#endif	/* NUMA */
};
EXPORT_SYMBOL(node_states);

94
unsigned long totalram_pages __read_mostly;
95
unsigned long totalreserve_pages __read_mostly;
96
int percpu_pagelist_fraction;
97
gfp_t gfp_allowed_mask __read_mostly = GFP_BOOT_MASK;
Linus Torvalds's avatar
Linus Torvalds committed
98

99 100 101 102 103 104 105 106 107
#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).
 */
108 109 110 111

static gfp_t saved_gfp_mask;

void pm_restore_gfp_mask(void)
112 113
{
	WARN_ON(!mutex_is_locked(&pm_mutex));
114 115 116 117
	if (saved_gfp_mask) {
		gfp_allowed_mask = saved_gfp_mask;
		saved_gfp_mask = 0;
	}
118 119
}

120
void pm_restrict_gfp_mask(void)
121 122
{
	WARN_ON(!mutex_is_locked(&pm_mutex));
123 124 125
	WARN_ON(saved_gfp_mask);
	saved_gfp_mask = gfp_allowed_mask;
	gfp_allowed_mask &= ~GFP_IOFS;
126 127 128
}
#endif /* CONFIG_PM_SLEEP */

129 130 131 132
#ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
int pageblock_order __read_mostly;
#endif

133
static void __free_pages_ok(struct page *page, unsigned int order);
134

Linus Torvalds's avatar
Linus Torvalds committed
135 136 137 138 139 140 141
/*
 * 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
142 143 144
 *
 * 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
145
 */
146
int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES-1] = {
147
#ifdef CONFIG_ZONE_DMA
148
	 256,
149
#endif
150
#ifdef CONFIG_ZONE_DMA32
151
	 256,
152
#endif
153
#ifdef CONFIG_HIGHMEM
Mel Gorman's avatar
Mel Gorman committed
154
	 32,
155
#endif
Mel Gorman's avatar
Mel Gorman committed
156
	 32,
157
};
Linus Torvalds's avatar
Linus Torvalds committed
158 159 160

EXPORT_SYMBOL(totalram_pages);

161
static char * const zone_names[MAX_NR_ZONES] = {
162
#ifdef CONFIG_ZONE_DMA
163
	 "DMA",
164
#endif
165
#ifdef CONFIG_ZONE_DMA32
166
	 "DMA32",
167
#endif
168
	 "Normal",
169
#ifdef CONFIG_HIGHMEM
Mel Gorman's avatar
Mel Gorman committed
170
	 "HighMem",
171
#endif
Mel Gorman's avatar
Mel Gorman committed
172
	 "Movable",
173 174
};

Linus Torvalds's avatar
Linus Torvalds committed
175 176
int min_free_kbytes = 1024;

177 178
static unsigned long __meminitdata nr_kernel_pages;
static unsigned long __meminitdata nr_all_pages;
179
static unsigned long __meminitdata dma_reserve;
Linus Torvalds's avatar
Linus Torvalds committed
180

181 182
#ifdef CONFIG_ARCH_POPULATES_NODE_MAP
  /*
Simon Arlott's avatar
Simon Arlott committed
183
   * MAX_ACTIVE_REGIONS determines the maximum number of distinct
184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201
   * ranges of memory (RAM) that may be registered with add_active_range().
   * Ranges passed to add_active_range() will be merged if possible
   * so the number of times add_active_range() can be called is
   * related to the number of nodes and the number of holes
   */
  #ifdef CONFIG_MAX_ACTIVE_REGIONS
    /* Allow an architecture to set MAX_ACTIVE_REGIONS to save memory */
    #define MAX_ACTIVE_REGIONS CONFIG_MAX_ACTIVE_REGIONS
  #else
    #if MAX_NUMNODES >= 32
      /* If there can be many nodes, allow up to 50 holes per node */
      #define MAX_ACTIVE_REGIONS (MAX_NUMNODES*50)
    #else
      /* By default, allow up to 256 distinct regions */
      #define MAX_ACTIVE_REGIONS 256
    #endif
  #endif

202 203 204 205
  static struct node_active_region __meminitdata early_node_map[MAX_ACTIVE_REGIONS];
  static int __meminitdata nr_nodemap_entries;
  static unsigned long __meminitdata arch_zone_lowest_possible_pfn[MAX_NR_ZONES];
  static unsigned long __meminitdata arch_zone_highest_possible_pfn[MAX_NR_ZONES];
Adrian Bunk's avatar
Adrian Bunk committed
206
  static unsigned long __initdata required_kernelcore;
207
  static unsigned long __initdata required_movablecore;
Adrian Bunk's avatar
Adrian Bunk committed
208
  static unsigned long __meminitdata zone_movable_pfn[MAX_NUMNODES];
Mel Gorman's avatar
Mel Gorman committed
209 210 211 212

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

Miklos Szeredi's avatar
Miklos Szeredi committed
215 216
#if MAX_NUMNODES > 1
int nr_node_ids __read_mostly = MAX_NUMNODES;
217
int nr_online_nodes __read_mostly = 1;
Miklos Szeredi's avatar
Miklos Szeredi committed
218
EXPORT_SYMBOL(nr_node_ids);
219
EXPORT_SYMBOL(nr_online_nodes);
Miklos Szeredi's avatar
Miklos Szeredi committed
220 221
#endif

222 223
int page_group_by_mobility_disabled __read_mostly;

224 225
static void set_pageblock_migratetype(struct page *page, int migratetype)
{
226 227 228 229

	if (unlikely(page_group_by_mobility_disabled))
		migratetype = MIGRATE_UNMOVABLE;

230 231 232 233
	set_pageblock_flags_group(page, (unsigned long)migratetype,
					PB_migrate, PB_migrate_end);
}

234 235
bool oom_killer_disabled __read_mostly;

Nick Piggin's avatar
Nick Piggin committed
236
#ifdef CONFIG_DEBUG_VM
237
static int page_outside_zone_boundaries(struct zone *zone, struct page *page)
Linus Torvalds's avatar
Linus Torvalds committed
238
{
239 240 241
	int ret = 0;
	unsigned seq;
	unsigned long pfn = page_to_pfn(page);
242

243 244 245 246 247 248 249 250 251
	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;
252 253 254 255
}

static int page_is_consistent(struct zone *zone, struct page *page)
{
256
	if (!pfn_valid_within(page_to_pfn(page)))
257
		return 0;
Linus Torvalds's avatar
Linus Torvalds committed
258
	if (zone != page_zone(page))
259 260 261 262 263 264 265 266 267 268
		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
269
		return 1;
270 271 272
	if (!page_is_consistent(zone, page))
		return 1;

Linus Torvalds's avatar
Linus Torvalds committed
273 274
	return 0;
}
Nick Piggin's avatar
Nick Piggin committed
275 276 277 278 279 280 281
#else
static inline int bad_range(struct zone *zone, struct page *page)
{
	return 0;
}
#endif

282
static void bad_page(struct page *page)
Linus Torvalds's avatar
Linus Torvalds committed
283
{
284 285 286 287
	static unsigned long resume;
	static unsigned long nr_shown;
	static unsigned long nr_unshown;

288 289
	/* Don't complain about poisoned pages */
	if (PageHWPoison(page)) {
290
		reset_page_mapcount(page); /* remove PageBuddy */
291 292 293
		return;
	}

294 295 296 297 298 299 300 301 302 303
	/*
	 * 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) {
304 305
			printk(KERN_ALERT
			      "BUG: Bad page state: %lu messages suppressed\n",
306 307 308 309 310 311 312 313
				nr_unshown);
			nr_unshown = 0;
		}
		nr_shown = 0;
	}
	if (nr_shown++ == 0)
		resume = jiffies + 60 * HZ;

314
	printk(KERN_ALERT "BUG: Bad page state in process %s  pfn:%05lx\n",
315
		current->comm, page_to_pfn(page));
316
	dump_page(page);
317

Linus Torvalds's avatar
Linus Torvalds committed
318
	dump_stack();
319
out:
320
	/* Leave bad fields for debug, except PageBuddy could make trouble */
321
	reset_page_mapcount(page); /* remove PageBuddy */
322
	add_taint(TAINT_BAD_PAGE);
Linus Torvalds's avatar
Linus Torvalds committed
323 324 325 326 327 328 329 330 331 332 333 334
}

/*
 * 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".
 *
 * All pages have PG_compound set.  All pages have their ->private pointing at
 * the head page (even the head page has this).
 *
335 336 337
 * 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
338
 */
339 340 341

static void free_compound_page(struct page *page)
{
342
	__free_pages_ok(page, compound_order(page));
343 344
}

345
void prep_compound_page(struct page *page, unsigned long order)
346 347 348 349 350 351 352 353 354 355 356 357 358 359 360
{
	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);
		p->first_page = page;
	}
}

361
/* update __split_huge_page_refcount if you change this function */
362
static int destroy_compound_page(struct page *page, unsigned long order)
Linus Torvalds's avatar
Linus Torvalds committed
363 364 365
{
	int i;
	int nr_pages = 1 << order;
366
	int bad = 0;
Linus Torvalds's avatar
Linus Torvalds committed
367

368 369
	if (unlikely(compound_order(page) != order) ||
	    unlikely(!PageHead(page))) {
370
		bad_page(page);
371 372
		bad++;
	}
Linus Torvalds's avatar
Linus Torvalds committed
373

374
	__ClearPageHead(page);
375

376 377
	for (i = 1; i < nr_pages; i++) {
		struct page *p = page + i;
Linus Torvalds's avatar
Linus Torvalds committed
378

379
		if (unlikely(!PageTail(p) || (p->first_page != page))) {
380
			bad_page(page);
381 382
			bad++;
		}
383
		__ClearPageTail(p);
Linus Torvalds's avatar
Linus Torvalds committed
384
	}
385 386

	return bad;
Linus Torvalds's avatar
Linus Torvalds committed
387 388
}

Nick Piggin's avatar
Nick Piggin committed
389 390 391 392
static inline void prep_zero_page(struct page *page, int order, gfp_t gfp_flags)
{
	int i;

393 394 395 396
	/*
	 * 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
397
	VM_BUG_ON((gfp_flags & __GFP_HIGHMEM) && in_interrupt());
Nick Piggin's avatar
Nick Piggin committed
398 399 400 401
	for (i = 0; i < (1 << order); i++)
		clear_highpage(page + i);
}

402 403
static inline void set_page_order(struct page *page, int order)
{
404
	set_page_private(page, order);
405
	__SetPageBuddy(page);
Linus Torvalds's avatar
Linus Torvalds committed
406 407 408 409
}

static inline void rmv_page_order(struct page *page)
{
410
	__ClearPageBuddy(page);
411
	set_page_private(page, 0);
Linus Torvalds's avatar
Linus Torvalds committed
412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428
}

/*
 * 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
429
 * Assumption: *_mem_map is contiguous at least up to MAX_ORDER
Linus Torvalds's avatar
Linus Torvalds committed
430 431
 */
static inline unsigned long
432
__find_buddy_index(unsigned long page_idx, unsigned int order)
Linus Torvalds's avatar
Linus Torvalds committed
433
{
434
	return page_idx ^ (1 << order);
Linus Torvalds's avatar
Linus Torvalds committed
435 436 437 438 439
}

/*
 * 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
440
 * (a) the buddy is not in a hole &&
441
 * (b) the buddy is in the buddy system &&
442 443
 * (c) a page and its buddy have the same order &&
 * (d) a page and its buddy are in the same zone.
444
 *
Andrea Arcangeli's avatar
Andrea Arcangeli committed
445 446
 * 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
447
 *
448
 * For recording page's order, we use page_private(page).
Linus Torvalds's avatar
Linus Torvalds committed
449
 */
450 451
static inline int page_is_buddy(struct page *page, struct page *buddy,
								int order)
Linus Torvalds's avatar
Linus Torvalds committed
452
{
453
	if (!pfn_valid_within(page_to_pfn(buddy)))
Nick Piggin's avatar
Nick Piggin committed
454 455
		return 0;

456 457 458 459
	if (page_zone_id(page) != page_zone_id(buddy))
		return 0;

	if (PageBuddy(buddy) && page_order(buddy) == order) {
460
		VM_BUG_ON(page_count(buddy) != 0);
461
		return 1;
462
	}
463
	return 0;
Linus Torvalds's avatar
Linus Torvalds committed
464 465 466 467 468 469 470 471 472 473 474 475 476 477 478
}

/*
 * 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
479
 * free pages of length of (1 << order) and marked with _mapcount -2. Page's
480
 * order is recorded in page_private(page) field.
Linus Torvalds's avatar
Linus Torvalds committed
481 482 483 484 485 486 487 488 489
 * So when we are allocating or freeing one, we can derive the state of the
 * other.  That is, if we allocate a small block, and both were   
 * free, the remainder of the region must be split into blocks.   
 * If a block is freed, and its buddy is also free, then this
 * triggers coalescing into a block of larger size.            
 *
 * -- wli
 */

Nick Piggin's avatar
Nick Piggin committed
490
static inline void __free_one_page(struct page *page,
491 492
		struct zone *zone, unsigned int order,
		int migratetype)
Linus Torvalds's avatar
Linus Torvalds committed
493 494
{
	unsigned long page_idx;
495
	unsigned long combined_idx;
496
	unsigned long uninitialized_var(buddy_idx);
497
	struct page *buddy;
Linus Torvalds's avatar
Linus Torvalds committed
498

499
	if (unlikely(PageCompound(page)))
500 501
		if (unlikely(destroy_compound_page(page, order)))
			return;
Linus Torvalds's avatar
Linus Torvalds committed
502

503 504
	VM_BUG_ON(migratetype == -1);

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

507
	VM_BUG_ON(page_idx & ((1 << order) - 1));
Nick Piggin's avatar
Nick Piggin committed
508
	VM_BUG_ON(bad_range(zone, page));
Linus Torvalds's avatar
Linus Torvalds committed
509 510

	while (order < MAX_ORDER-1) {
511 512
		buddy_idx = __find_buddy_index(page_idx, order);
		buddy = page + (buddy_idx - page_idx);
513
		if (!page_is_buddy(page, buddy, order))
514
			break;
Nick Piggin's avatar
Nick Piggin committed
515

516
		/* Our buddy is free, merge with it and move up one order. */
Linus Torvalds's avatar
Linus Torvalds committed
517
		list_del(&buddy->lru);
518
		zone->free_area[order].nr_free--;
Linus Torvalds's avatar
Linus Torvalds committed
519
		rmv_page_order(buddy);
520
		combined_idx = buddy_idx & page_idx;
Linus Torvalds's avatar
Linus Torvalds committed
521 522 523 524 525
		page = page + (combined_idx - page_idx);
		page_idx = combined_idx;
		order++;
	}
	set_page_order(page, order);
526 527 528 529 530 531 532 533 534

	/*
	 * 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
	 */
535
	if ((order < MAX_ORDER-2) && pfn_valid_within(page_to_pfn(buddy))) {
536
		struct page *higher_page, *higher_buddy;
537 538 539 540
		combined_idx = buddy_idx & page_idx;
		higher_page = page + (combined_idx - page_idx);
		buddy_idx = __find_buddy_index(combined_idx, order + 1);
		higher_buddy = page + (buddy_idx - combined_idx);
541 542 543 544 545 546 547 548 549
		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
550 551 552
	zone->free_area[order].nr_free++;
}

553 554 555 556 557 558 559 560 561 562 563
/*
 * free_page_mlock() -- clean up attempts to free and mlocked() page.
 * Page should not be on lru, so no need to fix that up.
 * free_pages_check() will verify...
 */
static inline void free_page_mlock(struct page *page)
{
	__dec_zone_page_state(page, NR_MLOCK);
	__count_vm_event(UNEVICTABLE_MLOCKFREED);
}

564
static inline int free_pages_check(struct page *page)
Linus Torvalds's avatar
Linus Torvalds committed
565
{
Nick Piggin's avatar
Nick Piggin committed
566 567
	if (unlikely(page_mapcount(page) |
		(page->mapping != NULL)  |
568
		(atomic_read(&page->_count) != 0) |
569 570
		(page->flags & PAGE_FLAGS_CHECK_AT_FREE) |
		(mem_cgroup_bad_page_check(page)))) {
571
		bad_page(page);
572
		return 1;
573
	}
574 575 576
	if (page->flags & PAGE_FLAGS_CHECK_AT_PREP)
		page->flags &= ~PAGE_FLAGS_CHECK_AT_PREP;
	return 0;
Linus Torvalds's avatar
Linus Torvalds committed
577 578 579
}

/*
580
 * Frees a number of pages from the PCP lists
Linus Torvalds's avatar
Linus Torvalds committed
581
 * Assumes all pages on list are in same zone, and of same order.
582
 * count is the number of pages to free.
Linus Torvalds's avatar
Linus Torvalds committed
583 584 585 586 587 588 589
 *
 * 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.
 */
590 591
static void free_pcppages_bulk(struct zone *zone, int count,
					struct per_cpu_pages *pcp)
Linus Torvalds's avatar
Linus Torvalds committed
592
{
593
	int migratetype = 0;
594
	int batch_free = 0;
595
	int to_free = count;
596

Nick Piggin's avatar
Nick Piggin committed
597
	spin_lock(&zone->lock);
598
	zone->all_unreclaimable = 0;
Linus Torvalds's avatar
Linus Torvalds committed
599
	zone->pages_scanned = 0;
600

601
	while (to_free) {
Nick Piggin's avatar
Nick Piggin committed
602
		struct page *page;
603 604 605
		struct list_head *list;

		/*
606 607 608 609 610
		 * 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
611 612
		 */
		do {
613
			batch_free++;
614 615 616 617
			if (++migratetype == MIGRATE_PCPTYPES)
				migratetype = 0;
			list = &pcp->lists[migratetype];
		} while (list_empty(list));
Nick Piggin's avatar
Nick Piggin committed
618

619 620 621 622
		/* This is the only non-empty list. Free them all. */
		if (batch_free == MIGRATE_PCPTYPES)
			batch_free = to_free;

623 624 625 626
		do {
			page = list_entry(list->prev, struct page, lru);
			/* must delete as __free_one_page list manipulates */
			list_del(&page->lru);
627 628 629
			/* MIGRATE_MOVABLE list may include MIGRATE_RESERVEs */
			__free_one_page(page, zone, 0, page_private(page));
			trace_mm_page_pcpu_drain(page, 0, page_private(page));
630
		} while (--to_free && --batch_free && !list_empty(list));
Linus Torvalds's avatar
Linus Torvalds committed
631
	}
632
	__mod_zone_page_state(zone, NR_FREE_PAGES, count);
Nick Piggin's avatar
Nick Piggin committed
633
	spin_unlock(&zone->lock);
Linus Torvalds's avatar
Linus Torvalds committed
634 635
}

636 637
static void free_one_page(struct zone *zone, struct page *page, int order,
				int migratetype)
Linus Torvalds's avatar
Linus Torvalds committed
638
{
639
	spin_lock(&zone->lock);
640
	zone->all_unreclaimable = 0;
641
	zone->pages_scanned = 0;
642

643
	__free_one_page(page, zone, order, migratetype);
644
	__mod_zone_page_state(zone, NR_FREE_PAGES, 1 << order);
645
	spin_unlock(&zone->lock);
Nick Piggin's avatar
Nick Piggin committed
646 647
}

648
static bool free_pages_prepare(struct page *page, unsigned int order)
Nick Piggin's avatar
Nick Piggin committed
649
{
Linus Torvalds's avatar
Linus Torvalds committed
650
	int i;
651
	int bad = 0;
Linus Torvalds's avatar
Linus Torvalds committed
652

653
	trace_mm_page_free_direct(page, order);
654 655
	kmemcheck_free_shadow(page, order);

Andrea Arcangeli's avatar
Andrea Arcangeli committed
656 657 658 659
	if (PageAnon(page))
		page->mapping = NULL;
	for (i = 0; i < (1 << order); i++)
		bad += free_pages_check(page + i);
660
	if (bad)
661
		return false;
662

663
	if (!PageHighMem(page)) {
Nick Piggin's avatar
Nick Piggin committed
664
		debug_check_no_locks_freed(page_address(page),PAGE_SIZE<<order);
665 666 667
		debug_check_no_obj_freed(page_address(page),
					   PAGE_SIZE << order);
	}
Nick Piggin's avatar
Nick Piggin committed
668
	arch_free_page(page, order);
Nick Piggin's avatar
Nick Piggin committed
669
	kernel_map_pages(page, 1 << order, 0);
Nick Piggin's avatar
Nick Piggin committed
670

671 672 673 674 675 676 677 678 679 680 681
	return true;
}

static void __free_pages_ok(struct page *page, unsigned int order)
{
	unsigned long flags;
	int wasMlocked = __TestClearPageMlocked(page);

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

Nick Piggin's avatar
Nick Piggin committed
682
	local_irq_save(flags);
683
	if (unlikely(wasMlocked))
684
		free_page_mlock(page);
685
	__count_vm_events(PGFREE, 1 << order);
686 687
	free_one_page(page_zone(page), page, order,
					get_pageblock_migratetype(page));
Nick Piggin's avatar
Nick Piggin committed
688
	local_irq_restore(flags);
Linus Torvalds's avatar
Linus Torvalds committed
689 690
}

691 692 693
/*
 * permit the bootmem allocator to evade page validation on high-order frees
 */
694
void __meminit __free_pages_bootmem(struct page *page, unsigned int order)
695 696 697 698
{
	if (order == 0) {
		__ClearPageReserved(page);
		set_page_count(page, 0);
699
		set_page_refcounted(page);
Nick Piggin's avatar
Nick Piggin committed
700
		__free_page(page);
701 702 703
	} else {
		int loop;

Nick Piggin's avatar
Nick Piggin committed
704
		prefetchw(page);
705 706 707
		for (loop = 0; loop < BITS_PER_LONG; loop++) {
			struct page *p = &page[loop];

Nick Piggin's avatar
Nick Piggin committed
708 709
			if (loop + 1 < BITS_PER_LONG)
				prefetchw(p + 1);
710 711 712 713
			__ClearPageReserved(p);
			set_page_count(p, 0);
		}

714
		set_page_refcounted(page);
Nick Piggin's avatar
Nick Piggin committed
715
		__free_pages(page, order);
716 717 718
	}
}

Linus Torvalds's avatar
Linus Torvalds committed
719 720 721 722 723 724 725 726 727 728 729 730 731 732 733

/*
 * 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.
 *
 * -- wli
 */
Nick Piggin's avatar
Nick Piggin committed
734
static inline void expand(struct zone *zone, struct page *page,
735 736
	int low, int high, struct free_area *area,
	int migratetype)
Linus Torvalds's avatar
Linus Torvalds committed
737 738 739 740 741 742 743
{
	unsigned long size = 1 << high;

	while (high > low) {
		area--;
		high--;
		size >>= 1;
Nick Piggin's avatar
Nick Piggin committed
744
		VM_BUG_ON(bad_range(zone, &page[size]));
745
		list_add(&page[size].lru, &area->free_list[migratetype]);
Linus Torvalds's avatar
Linus Torvalds committed
746 747 748 749 750 751 752 753
		area->nr_free++;
		set_page_order(&page[size], high);
	}
}

/*
 * This page is about to be returned from the page allocator
 */
754
static inline int check_new_page(struct page *page)
Linus Torvalds's avatar
Linus Torvalds committed
755
{
Nick Piggin's avatar
Nick Piggin committed
756 757
	if (unlikely(page_mapcount(page) |
		(page->mapping != NULL)  |
758
		(atomic_read(&page->_count) != 0)  |
759 760
		(page->flags & PAGE_FLAGS_CHECK_AT_PREP) |
		(mem_cgroup_bad_page_check(page)))) {
761
		bad_page(page);
762
		return 1;
763
	}
764 765 766 767 768 769 770 771 772 773 774 775
	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;
	}
776

777
	set_page_private(page, 0);
778
	set_page_refcounted(page);
Nick Piggin's avatar
Nick Piggin committed
779 780

	arch_alloc_page(page, order);
Linus Torvalds's avatar
Linus Torvalds committed
781
	kernel_map_pages(page, 1 << order, 1);
Nick Piggin's avatar
Nick Piggin committed
782 783 784 785 786 787 788

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

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

789
	return 0;
Linus Torvalds's avatar
Linus Torvalds committed
790 791
}

792 793 794 795
/*
 * Go through the free lists for the given migratetype and remove
 * the smallest available page from the freelists
 */
796 797
static inline
struct page *__rmqueue_smallest(struct zone *zone, unsigned int order,
798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822
						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;
}


823 824 825 826 827
/*
 * This array describes the order lists are fallen back to when
 * the free lists for the desirable migrate type are depleted
 */
static int fallbacks[MIGRATE_TYPES][MIGRATE_TYPES-1] = {
828 829 830 831
	[MIGRATE_UNMOVABLE]   = { MIGRATE_RECLAIMABLE, MIGRATE_MOVABLE,   MIGRATE_RESERVE },
	[MIGRATE_RECLAIMABLE] = { MIGRATE_UNMOVABLE,   MIGRATE_MOVABLE,   MIGRATE_RESERVE },
	[MIGRATE_MOVABLE]     = { MIGRATE_RECLAIMABLE, MIGRATE_UNMOVABLE, MIGRATE_RESERVE },
	[MIGRATE_RESERVE]     = { MIGRATE_RESERVE,     MIGRATE_RESERVE,   MIGRATE_RESERVE }, /* Never used */
832 833
};

834 835
/*
 * Move the free pages in a range to the free lists of the requested type.
836
 * Note that start_page and end_pages are not aligned on a pageblock
837 838
 * boundary. If alignment is required, use move_freepages_block()
 */
Adrian Bunk's avatar
Adrian Bunk committed
839 840 841
static int move_freepages(struct zone *zone,
			  struct page *start_page, struct page *end_page,
			  int migratetype)
842 843 844
{
	struct page *page;
	unsigned long order;
845
	int pages_moved = 0;
846 847 848 849 850 851 852

#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
853
	 * grouping pages by mobility
854 855 856 857 858
	 */
	BUG_ON(page_zone(start_page) != page_zone(end_page));
#endif

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

862 863 864 865 866 867 868 869 870 871 872
		if (!pfn_valid_within(page_to_pfn(page))) {
			page++;
			continue;
		}

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

		order = page_order(page);
873 874
		list_move(&page->lru,
			  &zone->free_area[order].free_list[migratetype]);
875
		page += 1 << order;
876
		pages_moved += 1 << order;
877 878
	}

879
	return pages_moved;
880 881
}

Adrian Bunk's avatar
Adrian Bunk committed
882 883
static int move_freepages_block(struct zone *zone, struct page *page,
				int migratetype)
884 885 886 887 888
{
	unsigned long start_pfn, end_pfn;
	struct page *start_page, *end_page;

	start_pfn = page_to_pfn(page);
889
	start_pfn = start_pfn & ~(pageblock_nr_pages-1);
890
	start_page = pfn_to_page(start_pfn);
891 892
	end_page = start_page + pageblock_nr_pages - 1;
	end_pfn = start_pfn + pageblock_nr_pages - 1;
893 894 895 896 897 898 899 900 901 902

	/* 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);
}

903 904 905 906 907 908 909 910 911 912 913
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;
	}
}

914
/* Remove an element from the buddy allocator from the fallback list */
915 916
static inline struct page *
__rmqueue_fallback(struct zone *zone, int order, int start_migratetype)
917 918 919 920 921 922 923 924 925 926 927 928
{
	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) {
		for (i = 0; i < MIGRATE_TYPES - 1; i++) {
			migratetype = fallbacks[start_migratetype][i];

929 930 931
			/* MIGRATE_RESERVE handled later if necessary */
			if (migratetype == MIGRATE_RESERVE)
				continue;
932

933 934 935 936 937 938 939 940 941
			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--;

			/*
942
			 * If breaking a large block of pages, move all free
943 944
			 * pages to the preferred allocation list. If falling
			 * back for a reclaimable kernel allocation, be more
Lucas De Marchi's avatar
Lucas De Marchi committed
945
			 * aggressive about taking ownership of free pages
946
			 */
947
			if (unlikely(current_order >= (pageblock_order >> 1)) ||
948 949
					start_migratetype == MIGRATE_RECLAIMABLE ||
					page_group_by_mobility_disabled) {
950 951 952 953 954
				unsigned long pages;
				pages = move_freepages_block(zone, page,
								start_migratetype);

				/* Claim the whole block if over half of it is free */
955 956
				if (pages >= (1 <<