page_alloc.c 133 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 24
#include <linux/bootmem.h>
#include <linux/compiler.h>
25
#include <linux/kernel.h>
Linus Torvalds's avatar
Linus Torvalds committed
26 27 28 29 30
#include <linux/module.h>
#include <linux/suspend.h>
#include <linux/pagevec.h>
#include <linux/blkdev.h>
#include <linux/slab.h>
31
#include <linux/oom.h>
Linus Torvalds's avatar
Linus Torvalds committed
32 33 34 35 36
#include <linux/notifier.h>
#include <linux/topology.h>
#include <linux/sysctl.h>
#include <linux/cpu.h>
#include <linux/cpuset.h>
37
#include <linux/memory_hotplug.h>
Linus Torvalds's avatar
Linus Torvalds committed
38 39
#include <linux/nodemask.h>
#include <linux/vmalloc.h>
40
#include <linux/mempolicy.h>
41
#include <linux/stop_machine.h>
42 43
#include <linux/sort.h>
#include <linux/pfn.h>
44
#include <linux/backing-dev.h>
45
#include <linux/fault-inject.h>
46
#include <linux/page-isolation.h>
47
#include <linux/page_cgroup.h>
48
#include <linux/debugobjects.h>
49
#include <linux/kmemleak.h>
Linus Torvalds's avatar
Linus Torvalds committed
50 51

#include <asm/tlbflush.h>
52
#include <asm/div64.h>
Linus Torvalds's avatar
Linus Torvalds committed
53 54 55
#include "internal.h"

/*
56
 * Array of node states.
Linus Torvalds's avatar
Linus Torvalds committed
57
 */
58 59 60 61 62 63 64 65 66 67 68 69 70
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);

71
unsigned long totalram_pages __read_mostly;
72
unsigned long totalreserve_pages __read_mostly;
73
unsigned long highest_memmap_pfn __read_mostly;
74
int percpu_pagelist_fraction;
Linus Torvalds's avatar
Linus Torvalds committed
75

76 77 78 79
#ifdef CONFIG_HUGETLB_PAGE_SIZE_VARIABLE
int pageblock_order __read_mostly;
#endif

80
static void __free_pages_ok(struct page *page, unsigned int order);
81

Linus Torvalds's avatar
Linus Torvalds committed
82 83 84 85 86 87 88
/*
 * 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
89 90 91
 *
 * 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
92
 */
93
int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES-1] = {
94
#ifdef CONFIG_ZONE_DMA
95
	 256,
96
#endif
97
#ifdef CONFIG_ZONE_DMA32
98
	 256,
99
#endif
100
#ifdef CONFIG_HIGHMEM
Mel Gorman's avatar
Mel Gorman committed
101
	 32,
102
#endif
Mel Gorman's avatar
Mel Gorman committed
103
	 32,
104
};
Linus Torvalds's avatar
Linus Torvalds committed
105 106 107

EXPORT_SYMBOL(totalram_pages);

108
static char * const zone_names[MAX_NR_ZONES] = {
109
#ifdef CONFIG_ZONE_DMA
110
	 "DMA",
111
#endif
112
#ifdef CONFIG_ZONE_DMA32
113
	 "DMA32",
114
#endif
115
	 "Normal",
116
#ifdef CONFIG_HIGHMEM
Mel Gorman's avatar
Mel Gorman committed
117
	 "HighMem",
118
#endif
Mel Gorman's avatar
Mel Gorman committed
119
	 "Movable",
120 121
};

Linus Torvalds's avatar
Linus Torvalds committed
122 123
int min_free_kbytes = 1024;

124 125
unsigned long __meminitdata nr_kernel_pages;
unsigned long __meminitdata nr_all_pages;
126
static unsigned long __meminitdata dma_reserve;
Linus Torvalds's avatar
Linus Torvalds committed
127

128 129
#ifdef CONFIG_ARCH_POPULATES_NODE_MAP
  /*
Simon Arlott's avatar
Simon Arlott committed
130
   * MAX_ACTIVE_REGIONS determines the maximum number of distinct
131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148
   * 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

149 150 151 152
  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
153
  static unsigned long __initdata required_kernelcore;
154
  static unsigned long __initdata required_movablecore;
Adrian Bunk's avatar
Adrian Bunk committed
155
  static unsigned long __meminitdata zone_movable_pfn[MAX_NUMNODES];
Mel Gorman's avatar
Mel Gorman committed
156 157 158 159

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

Miklos Szeredi's avatar
Miklos Szeredi committed
162 163 164 165 166
#if MAX_NUMNODES > 1
int nr_node_ids __read_mostly = MAX_NUMNODES;
EXPORT_SYMBOL(nr_node_ids);
#endif

167 168
int page_group_by_mobility_disabled __read_mostly;

169 170
static void set_pageblock_migratetype(struct page *page, int migratetype)
{
171 172 173 174

	if (unlikely(page_group_by_mobility_disabled))
		migratetype = MIGRATE_UNMOVABLE;

175 176 177 178
	set_pageblock_flags_group(page, (unsigned long)migratetype,
					PB_migrate, PB_migrate_end);
}

Nick Piggin's avatar
Nick Piggin committed
179
#ifdef CONFIG_DEBUG_VM
180
static int page_outside_zone_boundaries(struct zone *zone, struct page *page)
Linus Torvalds's avatar
Linus Torvalds committed
181
{
182 183 184
	int ret = 0;
	unsigned seq;
	unsigned long pfn = page_to_pfn(page);
185

186 187 188 189 190 191 192 193 194
	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;
195 196 197 198
}

static int page_is_consistent(struct zone *zone, struct page *page)
{
199
	if (!pfn_valid_within(page_to_pfn(page)))
200
		return 0;
Linus Torvalds's avatar
Linus Torvalds committed
201
	if (zone != page_zone(page))
202 203 204 205 206 207 208 209 210 211
		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
212
		return 1;
213 214 215
	if (!page_is_consistent(zone, page))
		return 1;

Linus Torvalds's avatar
Linus Torvalds committed
216 217
	return 0;
}
Nick Piggin's avatar
Nick Piggin committed
218 219 220 221 222 223 224
#else
static inline int bad_range(struct zone *zone, struct page *page)
{
	return 0;
}
#endif

225
static void bad_page(struct page *page)
Linus Torvalds's avatar
Linus Torvalds committed
226
{
227 228 229 230 231 232 233 234 235 236 237 238 239 240
	static unsigned long resume;
	static unsigned long nr_shown;
	static unsigned long nr_unshown;

	/*
	 * 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) {
241 242
			printk(KERN_ALERT
			      "BUG: Bad page state: %lu messages suppressed\n",
243 244 245 246 247 248 249 250
				nr_unshown);
			nr_unshown = 0;
		}
		nr_shown = 0;
	}
	if (nr_shown++ == 0)
		resume = jiffies + 60 * HZ;

251
	printk(KERN_ALERT "BUG: Bad page state in process %s  pfn:%05lx\n",
252
		current->comm, page_to_pfn(page));
253
	printk(KERN_ALERT
254 255 256 257
		"page:%p flags:%p count:%d mapcount:%d mapping:%p index:%lx\n",
		page, (void *)page->flags, page_count(page),
		page_mapcount(page), page->mapping, page->index);

Linus Torvalds's avatar
Linus Torvalds committed
258
	dump_stack();
259
out:
260 261
	/* Leave bad fields for debug, except PageBuddy could make trouble */
	__ClearPageBuddy(page);
262
	add_taint(TAINT_BAD_PAGE);
Linus Torvalds's avatar
Linus Torvalds committed
263 264 265 266 267 268 269 270 271 272 273 274
}

/*
 * 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).
 *
275 276 277
 * 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
278
 */
279 280 281

static void free_compound_page(struct page *page)
{
282
	__free_pages_ok(page, compound_order(page));
283 284
}

285
void prep_compound_page(struct page *page, unsigned long order)
286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302
{
	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;
	}
}

#ifdef CONFIG_HUGETLBFS
void prep_compound_gigantic_page(struct page *page, unsigned long order)
Linus Torvalds's avatar
Linus Torvalds committed
303 304 305
{
	int i;
	int nr_pages = 1 << order;
306
	struct page *p = page + 1;
Linus Torvalds's avatar
Linus Torvalds committed
307

308
	set_compound_page_dtor(page, free_compound_page);
309
	set_compound_order(page, order);
310
	__SetPageHead(page);
311
	for (i = 1; i < nr_pages; i++, p = mem_map_next(p, page, i)) {
312 313
		__SetPageTail(p);
		p->first_page = page;
Linus Torvalds's avatar
Linus Torvalds committed
314 315
	}
}
316
#endif
Linus Torvalds's avatar
Linus Torvalds committed
317

318
static int destroy_compound_page(struct page *page, unsigned long order)
Linus Torvalds's avatar
Linus Torvalds committed
319 320 321
{
	int i;
	int nr_pages = 1 << order;
322
	int bad = 0;
Linus Torvalds's avatar
Linus Torvalds committed
323

324 325
	if (unlikely(compound_order(page) != order) ||
	    unlikely(!PageHead(page))) {
326
		bad_page(page);
327 328
		bad++;
	}
Linus Torvalds's avatar
Linus Torvalds committed
329

330
	__ClearPageHead(page);
331

332 333
	for (i = 1; i < nr_pages; i++) {
		struct page *p = page + i;
Linus Torvalds's avatar
Linus Torvalds committed
334

335
		if (unlikely(!PageTail(p) || (p->first_page != page))) {
336
			bad_page(page);
337 338
			bad++;
		}
339
		__ClearPageTail(p);
Linus Torvalds's avatar
Linus Torvalds committed
340
	}
341 342

	return bad;
Linus Torvalds's avatar
Linus Torvalds committed
343 344
}

Nick Piggin's avatar
Nick Piggin committed
345 346 347 348
static inline void prep_zero_page(struct page *page, int order, gfp_t gfp_flags)
{
	int i;

349 350 351 352
	/*
	 * 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
353
	VM_BUG_ON((gfp_flags & __GFP_HIGHMEM) && in_interrupt());
Nick Piggin's avatar
Nick Piggin committed
354 355 356 357
	for (i = 0; i < (1 << order); i++)
		clear_highpage(page + i);
}

358 359
static inline void set_page_order(struct page *page, int order)
{
360
	set_page_private(page, order);
361
	__SetPageBuddy(page);
Linus Torvalds's avatar
Linus Torvalds committed
362 363 364 365
}

static inline void rmv_page_order(struct page *page)
{
366
	__ClearPageBuddy(page);
367
	set_page_private(page, 0);
Linus Torvalds's avatar
Linus Torvalds committed
368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384
}

/*
 * 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
385
 * Assumption: *_mem_map is contiguous at least up to MAX_ORDER
Linus Torvalds's avatar
Linus Torvalds committed
386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403
 */
static inline struct page *
__page_find_buddy(struct page *page, unsigned long page_idx, unsigned int order)
{
	unsigned long buddy_idx = page_idx ^ (1 << order);

	return page + (buddy_idx - page_idx);
}

static inline unsigned long
__find_combined_index(unsigned long page_idx, unsigned int order)
{
	return (page_idx & ~(1 << order));
}

/*
 * 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
404
 * (a) the buddy is not in a hole &&
405
 * (b) the buddy is in the buddy system &&
406 407
 * (c) a page and its buddy have the same order &&
 * (d) a page and its buddy are in the same zone.
408 409 410
 *
 * For recording whether a page is in the buddy system, we use PG_buddy.
 * Setting, clearing, and testing PG_buddy is serialized by zone->lock.
Linus Torvalds's avatar
Linus Torvalds committed
411
 *
412
 * For recording page's order, we use page_private(page).
Linus Torvalds's avatar
Linus Torvalds committed
413
 */
414 415
static inline int page_is_buddy(struct page *page, struct page *buddy,
								int order)
Linus Torvalds's avatar
Linus Torvalds committed
416
{
417
	if (!pfn_valid_within(page_to_pfn(buddy)))
Nick Piggin's avatar
Nick Piggin committed
418 419
		return 0;

420 421 422 423
	if (page_zone_id(page) != page_zone_id(buddy))
		return 0;

	if (PageBuddy(buddy) && page_order(buddy) == order) {
424
		VM_BUG_ON(page_count(buddy) != 0);
425
		return 1;
426
	}
427
	return 0;
Linus Torvalds's avatar
Linus Torvalds committed
428 429 430 431 432 433 434 435 436 437 438 439 440 441 442
}

/*
 * 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
443
 * free pages of length of (1 << order) and marked with PG_buddy. Page's
444
 * order is recorded in page_private(page) field.
Linus Torvalds's avatar
Linus Torvalds committed
445 446 447 448 449 450 451 452 453
 * 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
454
static inline void __free_one_page(struct page *page,
455 456
		struct zone *zone, unsigned int order,
		int migratetype)
Linus Torvalds's avatar
Linus Torvalds committed
457 458 459
{
	unsigned long page_idx;

460
	if (unlikely(PageCompound(page)))
461 462
		if (unlikely(destroy_compound_page(page, order)))
			return;
Linus Torvalds's avatar
Linus Torvalds committed
463

464 465
	VM_BUG_ON(migratetype == -1);

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

468
	VM_BUG_ON(page_idx & ((1 << order) - 1));
Nick Piggin's avatar
Nick Piggin committed
469
	VM_BUG_ON(bad_range(zone, page));
Linus Torvalds's avatar
Linus Torvalds committed
470 471 472 473 474 475

	while (order < MAX_ORDER-1) {
		unsigned long combined_idx;
		struct page *buddy;

		buddy = __page_find_buddy(page, page_idx, order);
476
		if (!page_is_buddy(page, buddy, order))
477
			break;
Nick Piggin's avatar
Nick Piggin committed
478

479
		/* Our buddy is free, merge with it and move up one order. */
Linus Torvalds's avatar
Linus Torvalds committed
480
		list_del(&buddy->lru);
481
		zone->free_area[order].nr_free--;
Linus Torvalds's avatar
Linus Torvalds committed
482
		rmv_page_order(buddy);
Nick Piggin's avatar
Nick Piggin committed
483
		combined_idx = __find_combined_index(page_idx, order);
Linus Torvalds's avatar
Linus Torvalds committed
484 485 486 487 488
		page = page + (combined_idx - page_idx);
		page_idx = combined_idx;
		order++;
	}
	set_page_order(page, order);
489 490
	list_add(&page->lru,
		&zone->free_area[order].free_list[migratetype]);
Linus Torvalds's avatar
Linus Torvalds committed
491 492 493
	zone->free_area[order].nr_free++;
}

494
static inline int free_pages_check(struct page *page)
Linus Torvalds's avatar
Linus Torvalds committed
495
{
Nick Piggin's avatar
Nick Piggin committed
496 497
	if (unlikely(page_mapcount(page) |
		(page->mapping != NULL)  |
498
		(atomic_read(&page->_count) != 0) |
499
		(page->flags & PAGE_FLAGS_CHECK_AT_FREE))) {
500
		bad_page(page);
501
		return 1;
502
	}
503 504 505
	if (page->flags & PAGE_FLAGS_CHECK_AT_PREP)
		page->flags &= ~PAGE_FLAGS_CHECK_AT_PREP;
	return 0;
Linus Torvalds's avatar
Linus Torvalds committed
506 507 508 509 510
}

/*
 * Frees a list of pages. 
 * Assumes all pages on list are in same zone, and of same order.
511
 * count is the number of pages to free.
Linus Torvalds's avatar
Linus Torvalds committed
512 513 514 515 516 517 518
 *
 * 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.
 */
Nick Piggin's avatar
Nick Piggin committed
519 520
static void free_pages_bulk(struct zone *zone, int count,
					struct list_head *list, int order)
Linus Torvalds's avatar
Linus Torvalds committed
521
{
Nick Piggin's avatar
Nick Piggin committed
522
	spin_lock(&zone->lock);
523
	zone_clear_flag(zone, ZONE_ALL_UNRECLAIMABLE);
Linus Torvalds's avatar
Linus Torvalds committed
524
	zone->pages_scanned = 0;
525 526

	__mod_zone_page_state(zone, NR_FREE_PAGES, count << order);
Nick Piggin's avatar
Nick Piggin committed
527 528 529
	while (count--) {
		struct page *page;

Nick Piggin's avatar
Nick Piggin committed
530
		VM_BUG_ON(list_empty(list));
Linus Torvalds's avatar
Linus Torvalds committed
531
		page = list_entry(list->prev, struct page, lru);
Nick Piggin's avatar
Nick Piggin committed
532
		/* have to delete it as __free_one_page list manipulates */
Linus Torvalds's avatar
Linus Torvalds committed
533
		list_del(&page->lru);
534
		__free_one_page(page, zone, order, page_private(page));
Linus Torvalds's avatar
Linus Torvalds committed
535
	}
Nick Piggin's avatar
Nick Piggin committed
536
	spin_unlock(&zone->lock);
Linus Torvalds's avatar
Linus Torvalds committed
537 538
}

539 540
static void free_one_page(struct zone *zone, struct page *page, int order,
				int migratetype)
Linus Torvalds's avatar
Linus Torvalds committed
541
{
542
	spin_lock(&zone->lock);
543
	zone_clear_flag(zone, ZONE_ALL_UNRECLAIMABLE);
544
	zone->pages_scanned = 0;
545 546

	__mod_zone_page_state(zone, NR_FREE_PAGES, 1 << order);
547
	__free_one_page(page, zone, order, migratetype);
548
	spin_unlock(&zone->lock);
Nick Piggin's avatar
Nick Piggin committed
549 550 551 552 553
}

static void __free_pages_ok(struct page *page, unsigned int order)
{
	unsigned long flags;
Linus Torvalds's avatar
Linus Torvalds committed
554
	int i;
555
	int bad = 0;
556
	int clearMlocked = PageMlocked(page);
Linus Torvalds's avatar
Linus Torvalds committed
557 558

	for (i = 0 ; i < (1 << order) ; ++i)
559 560
		bad += free_pages_check(page + i);
	if (bad)
561 562
		return;

563
	if (!PageHighMem(page)) {
Nick Piggin's avatar
Nick Piggin committed
564
		debug_check_no_locks_freed(page_address(page),PAGE_SIZE<<order);
565 566 567
		debug_check_no_obj_freed(page_address(page),
					   PAGE_SIZE << order);
	}
Nick Piggin's avatar
Nick Piggin committed
568
	arch_free_page(page, order);
Nick Piggin's avatar
Nick Piggin committed
569
	kernel_map_pages(page, 1 << order, 0);
Nick Piggin's avatar
Nick Piggin committed
570

Nick Piggin's avatar
Nick Piggin committed
571
	local_irq_save(flags);
572 573
	if (unlikely(clearMlocked))
		free_page_mlock(page);
574
	__count_vm_events(PGFREE, 1 << order);
575 576
	free_one_page(page_zone(page), page, order,
					get_pageblock_migratetype(page));
Nick Piggin's avatar
Nick Piggin committed
577
	local_irq_restore(flags);
Linus Torvalds's avatar
Linus Torvalds committed
578 579
}

580 581 582
/*
 * permit the bootmem allocator to evade page validation on high-order frees
 */
583
void __meminit __free_pages_bootmem(struct page *page, unsigned int order)
584 585 586 587
{
	if (order == 0) {
		__ClearPageReserved(page);
		set_page_count(page, 0);
588
		set_page_refcounted(page);
Nick Piggin's avatar
Nick Piggin committed
589
		__free_page(page);
590 591 592
	} else {
		int loop;

Nick Piggin's avatar
Nick Piggin committed
593
		prefetchw(page);
594 595 596
		for (loop = 0; loop < BITS_PER_LONG; loop++) {
			struct page *p = &page[loop];

Nick Piggin's avatar
Nick Piggin committed
597 598
			if (loop + 1 < BITS_PER_LONG)
				prefetchw(p + 1);
599 600 601 602
			__ClearPageReserved(p);
			set_page_count(p, 0);
		}

603
		set_page_refcounted(page);
Nick Piggin's avatar
Nick Piggin committed
604
		__free_pages(page, order);
605 606 607
	}
}

Linus Torvalds's avatar
Linus Torvalds committed
608 609 610 611 612 613 614 615 616 617 618 619 620 621 622

/*
 * 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
623
static inline void expand(struct zone *zone, struct page *page,
624 625
	int low, int high, struct free_area *area,
	int migratetype)
Linus Torvalds's avatar
Linus Torvalds committed
626 627 628 629 630 631 632
{
	unsigned long size = 1 << high;

	while (high > low) {
		area--;
		high--;
		size >>= 1;
Nick Piggin's avatar
Nick Piggin committed
633
		VM_BUG_ON(bad_range(zone, &page[size]));
634
		list_add(&page[size].lru, &area->free_list[migratetype]);
Linus Torvalds's avatar
Linus Torvalds committed
635 636 637 638 639 640 641 642
		area->nr_free++;
		set_page_order(&page[size], high);
	}
}

/*
 * This page is about to be returned from the page allocator
 */
Nick Piggin's avatar
Nick Piggin committed
643
static int prep_new_page(struct page *page, int order, gfp_t gfp_flags)
Linus Torvalds's avatar
Linus Torvalds committed
644
{
Nick Piggin's avatar
Nick Piggin committed
645 646
	if (unlikely(page_mapcount(page) |
		(page->mapping != NULL)  |
647
		(atomic_read(&page->_count) != 0)  |
648
		(page->flags & PAGE_FLAGS_CHECK_AT_PREP))) {
649
		bad_page(page);
650
		return 1;
651
	}
652

653
	set_page_private(page, 0);
654
	set_page_refcounted(page);
Nick Piggin's avatar
Nick Piggin committed
655 656

	arch_alloc_page(page, order);
Linus Torvalds's avatar
Linus Torvalds committed
657
	kernel_map_pages(page, 1 << order, 1);
Nick Piggin's avatar
Nick Piggin committed
658 659 660 661 662 663 664

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

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

665
	return 0;
Linus Torvalds's avatar
Linus Torvalds committed
666 667
}

668 669 670 671
/*
 * Go through the free lists for the given migratetype and remove
 * the smallest available page from the freelists
 */
672 673
static inline
struct page *__rmqueue_smallest(struct zone *zone, unsigned int order,
674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698
						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;
}


699 700 701 702 703
/*
 * 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] = {
704 705 706 707
	[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 */
708 709
};

710 711
/*
 * Move the free pages in a range to the free lists of the requested type.
712
 * Note that start_page and end_pages are not aligned on a pageblock
713 714
 * boundary. If alignment is required, use move_freepages_block()
 */
Adrian Bunk's avatar
Adrian Bunk committed
715 716 717
static int move_freepages(struct zone *zone,
			  struct page *start_page, struct page *end_page,
			  int migratetype)
718 719 720
{
	struct page *page;
	unsigned long order;
721
	int pages_moved = 0;
722 723 724 725 726 727 728

#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
729
	 * grouping pages by mobility
730 731 732 733 734
	 */
	BUG_ON(page_zone(start_page) != page_zone(end_page));
#endif

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

738 739 740 741 742 743 744 745 746 747 748 749 750 751 752
		if (!pfn_valid_within(page_to_pfn(page))) {
			page++;
			continue;
		}

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

		order = page_order(page);
		list_del(&page->lru);
		list_add(&page->lru,
			&zone->free_area[order].free_list[migratetype]);
		page += 1 << order;
753
		pages_moved += 1 << order;
754 755
	}

756
	return pages_moved;
757 758
}

Adrian Bunk's avatar
Adrian Bunk committed
759 760
static int move_freepages_block(struct zone *zone, struct page *page,
				int migratetype)
761 762 763 764 765
{
	unsigned long start_pfn, end_pfn;
	struct page *start_page, *end_page;

	start_pfn = page_to_pfn(page);
766
	start_pfn = start_pfn & ~(pageblock_nr_pages-1);
767
	start_page = pfn_to_page(start_pfn);
768 769
	end_page = start_page + pageblock_nr_pages - 1;
	end_pfn = start_pfn + pageblock_nr_pages - 1;
770 771 772 773 774 775 776 777 778 779

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

780
/* Remove an element from the buddy allocator from the fallback list */
781 782
static inline struct page *
__rmqueue_fallback(struct zone *zone, int order, int start_migratetype)
783 784 785 786 787 788 789 790 791 792 793 794
{
	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];

795 796 797
			/* MIGRATE_RESERVE handled later if necessary */
			if (migratetype == MIGRATE_RESERVE)
				continue;
798

799 800 801 802 803 804 805 806 807
			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--;

			/*
808
			 * If breaking a large block of pages, move all free
809 810 811
			 * pages to the preferred allocation list. If falling
			 * back for a reclaimable kernel allocation, be more
			 * agressive about taking ownership of free pages
812
			 */
813
			if (unlikely(current_order >= (pageblock_order >> 1)) ||
814 815 816 817 818 819
					start_migratetype == MIGRATE_RECLAIMABLE) {
				unsigned long pages;
				pages = move_freepages_block(zone, page,
								start_migratetype);

				/* Claim the whole block if over half of it is free */
820
				if (pages >= (1 << (pageblock_order-1)))
821 822 823
					set_pageblock_migratetype(page,
								start_migratetype);

824
				migratetype = start_migratetype;
825
			}
826 827 828 829 830

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

831
			if (current_order == pageblock_order)
832 833 834 835 836 837 838 839
				set_pageblock_migratetype(page,
							start_migratetype);

			expand(zone, page, order, current_order, area, migratetype);
			return page;
		}
	}

840
	return NULL;
841 842
}

843
/*
Linus Torvalds's avatar
Linus Torvalds committed
844 845 846
 * Do the hard work of removing an element from the buddy allocator.
 * Call me with the zone->lock already held.
 */
847 848
static struct page *__rmqueue(struct zone *zone, unsigned int order,
						int migratetype)
Linus Torvalds's avatar
Linus Torvalds committed
849 850 851
{
	struct page *page;

852
retry_reserve:
853
	page = __rmqueue_smallest(zone, order, migratetype);
854

855
	if (unlikely(!page) && migratetype != MIGRATE_RESERVE) {
856
		page = __rmqueue_fallback(zone, order, migratetype);
857

858 859 860 861 862 863 864 865 866 867 868
		/*
		 * 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;
		}
	}

869
	return page;
Linus Torvalds's avatar
Linus Torvalds committed
870 871 872 873 874 875 876 877
}

/* 
 * 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.
 */
static int rmqueue_bulk(struct zone *zone, unsigned int order, 
878 879
			unsigned long count, struct list_head *list,
			int migratetype)
Linus Torvalds's avatar
Linus Torvalds committed
880 881 882
{
	int i;
	
Nick Piggin's avatar
Nick Piggin committed
883
	spin_lock(&zone->lock);
Linus Torvalds's avatar
Linus Torvalds committed
884
	for (i = 0; i < count; ++i) {
885
		struct page *page = __rmqueue(zone, order, migratetype);
Nick Piggin's avatar
Nick Piggin committed
886
		if (unlikely(page == NULL))
Linus Torvalds's avatar
Linus Torvalds committed
887
			break;
888 889 890 891 892 893 894 895 896 897

		/*
		 * 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.
		 */
898 899
		list_add(&page->lru, list);
		set_page_private(page, migratetype);
900
		list = &page->lru;
Linus Torvalds's avatar
Linus Torvalds committed
901
	}
902
	__mod_zone_page_state(zone, NR_FREE_PAGES, -(i << order));
Nick Piggin's avatar
Nick Piggin committed
903
	spin_unlock(&zone->lock);
Nick Piggin's avatar
Nick Piggin committed
904
	return i;
Linus Torvalds's avatar
Linus Torvalds committed
905 906
}

907
#ifdef CONFIG_NUMA
908
/*
909 910 911 912
 * Called from the vmstat counter updater to drain pagesets of this
 * currently executing processor on remote nodes after they have
 * expired.
 *
913 914
 * Note that this function must be called with the thread pinned to
 * a single processor.
915
 */
916
void drain_zone_pages(struct zone *zone, struct per_cpu_pages *pcp)
917 918
{
	unsigned long flags;
919
	int to_drain;
920

921 922 923 924 925 926 927 928
	local_irq_save(flags);
	if (pcp->count >= pcp->batch)
		to_drain = pcp->batch;
	else
		to_drain = pcp->count;
	free_pages_bulk(zone, to_drain, &pcp->list, 0);
	pcp->count -= to_drain;
	local_irq_restore(flags);
929 930 931
}
#endif

932 933 934 935 936 937 938 939
/*
 * 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)
Linus Torvalds's avatar
Linus Torvalds committed
940
{
Nick Piggin's avatar
Nick Piggin committed
941
	unsigned long flags;
Linus Torvalds's avatar
Linus Torvalds committed
942 943
	struct zone *zone;

944
	for_each_populated_zone(zone) {
Linus Torvalds's avatar
Linus Torvalds committed
945
		struct per_cpu_pageset *pset;
946
		struct per_cpu_pages *pcp;
Linus Torvalds's avatar
Linus Torvalds committed
947

948
		pset = zone_pcp(zone, cpu);
949 950 951 952 953 954

		pcp = &pset->pcp;
		local_irq_save(flags);
		free_pages_bulk(zone, pcp->count, &pcp->list, 0);
		pcp->count = 0;
		local_irq_restore(flags);
Linus Torvalds's avatar
Linus Torvalds committed
955 956 957
	}
}

958 959 960 961 962 963 964 965 966 967 968 969 970
/*
 * 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());
}

/*
 * Spill all the per-cpu pages from all CPUs back into the buddy allocator
 */
void drain_all_pages(void)
{
971
	on_each_cpu(drain_local_pages, NULL, 1);
972 973
}

974
#ifdef CONFIG_HIBERNATION