page_alloc.c 88.6 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 22 23
/*
 *  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>
#include <linux/bootmem.h>
#include <linux/compiler.h>
24
#include <linux/kernel.h>
Linus Torvalds's avatar
Linus Torvalds committed
25 26 27 28 29 30 31 32 33 34
#include <linux/module.h>
#include <linux/suspend.h>
#include <linux/pagevec.h>
#include <linux/blkdev.h>
#include <linux/slab.h>
#include <linux/notifier.h>
#include <linux/topology.h>
#include <linux/sysctl.h>
#include <linux/cpu.h>
#include <linux/cpuset.h>
35
#include <linux/memory_hotplug.h>
Linus Torvalds's avatar
Linus Torvalds committed
36 37
#include <linux/nodemask.h>
#include <linux/vmalloc.h>
38
#include <linux/mempolicy.h>
39
#include <linux/stop_machine.h>
40 41
#include <linux/sort.h>
#include <linux/pfn.h>
42
#include <linux/backing-dev.h>
Linus Torvalds's avatar
Linus Torvalds committed
43 44

#include <asm/tlbflush.h>
45
#include <asm/div64.h>
Linus Torvalds's avatar
Linus Torvalds committed
46 47 48 49 50 51
#include "internal.h"

/*
 * MCD - HACK: Find somewhere to initialize this EARLY, or make this
 * initializer cleaner
 */
52
nodemask_t node_online_map __read_mostly = { { [0] = 1UL } };
53
EXPORT_SYMBOL(node_online_map);
54
nodemask_t node_possible_map __read_mostly = NODE_MASK_ALL;
55
EXPORT_SYMBOL(node_possible_map);
56
unsigned long totalram_pages __read_mostly;
57
unsigned long totalreserve_pages __read_mostly;
Linus Torvalds's avatar
Linus Torvalds committed
58
long nr_swap_pages;
59
int percpu_pagelist_fraction;
Linus Torvalds's avatar
Linus Torvalds committed
60

61
static void __free_pages_ok(struct page *page, unsigned int order);
62

Linus Torvalds's avatar
Linus Torvalds committed
63 64 65 66 67 68 69
/*
 * 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
70 71 72
 *
 * 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
73
 */
74 75
int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES-1] = {
	 256,
76
#ifdef CONFIG_ZONE_DMA32
77
	 256,
78
#endif
79
#ifdef CONFIG_HIGHMEM
80
	 32
81
#endif
82
};
Linus Torvalds's avatar
Linus Torvalds committed
83 84 85

EXPORT_SYMBOL(totalram_pages);

86
static char * const zone_names[MAX_NR_ZONES] = {
87
	 "DMA",
88
#ifdef CONFIG_ZONE_DMA32
89
	 "DMA32",
90
#endif
91
	 "Normal",
92
#ifdef CONFIG_HIGHMEM
93
	 "HighMem"
94
#endif
95 96
};

Linus Torvalds's avatar
Linus Torvalds committed
97 98
int min_free_kbytes = 1024;

99 100
unsigned long __meminitdata nr_kernel_pages;
unsigned long __meminitdata nr_all_pages;
101
static unsigned long __initdata dma_reserve;
Linus Torvalds's avatar
Linus Torvalds committed
102

103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127
#ifdef CONFIG_ARCH_POPULATES_NODE_MAP
  /*
   * MAX_ACTIVE_REGIONS determines the maxmimum number of distinct
   * 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

  struct node_active_region __initdata early_node_map[MAX_ACTIVE_REGIONS];
  int __initdata nr_nodemap_entries;
  unsigned long __initdata arch_zone_lowest_possible_pfn[MAX_NR_ZONES];
  unsigned long __initdata arch_zone_highest_possible_pfn[MAX_NR_ZONES];
128 129 130 131
#ifdef CONFIG_MEMORY_HOTPLUG_RESERVE
  unsigned long __initdata node_boundary_start_pfn[MAX_NUMNODES];
  unsigned long __initdata node_boundary_end_pfn[MAX_NUMNODES];
#endif /* CONFIG_MEMORY_HOTPLUG_RESERVE */
132 133
#endif /* CONFIG_ARCH_POPULATES_NODE_MAP */

Nick Piggin's avatar
Nick Piggin committed
134
#ifdef CONFIG_DEBUG_VM
135
static int page_outside_zone_boundaries(struct zone *zone, struct page *page)
Linus Torvalds's avatar
Linus Torvalds committed
136
{
137 138 139
	int ret = 0;
	unsigned seq;
	unsigned long pfn = page_to_pfn(page);
140

141 142 143 144 145 146 147 148 149
	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;
150 151 152 153
}

static int page_is_consistent(struct zone *zone, struct page *page)
{
Linus Torvalds's avatar
Linus Torvalds committed
154 155
#ifdef CONFIG_HOLES_IN_ZONE
	if (!pfn_valid(page_to_pfn(page)))
156
		return 0;
Linus Torvalds's avatar
Linus Torvalds committed
157 158
#endif
	if (zone != page_zone(page))
159 160 161 162 163 164 165 166 167 168
		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
169
		return 1;
170 171 172
	if (!page_is_consistent(zone, page))
		return 1;

Linus Torvalds's avatar
Linus Torvalds committed
173 174
	return 0;
}
Nick Piggin's avatar
Nick Piggin committed
175 176 177 178 179 180 181
#else
static inline int bad_range(struct zone *zone, struct page *page)
{
	return 0;
}
#endif

182
static void bad_page(struct page *page)
Linus Torvalds's avatar
Linus Torvalds committed
183
{
184
	printk(KERN_EMERG "Bad page state in process '%s'\n"
185 186 187
		KERN_EMERG "page:%p flags:0x%0*lx mapping:%p mapcount:%d count:%d\n"
		KERN_EMERG "Trying to fix it up, but a reboot is needed\n"
		KERN_EMERG "Backtrace:\n",
188 189 190
		current->comm, page, (int)(2*sizeof(unsigned long)),
		(unsigned long)page->flags, page->mapping,
		page_mapcount(page), page_count(page));
Linus Torvalds's avatar
Linus Torvalds committed
191
	dump_stack();
192 193
	page->flags &= ~(1 << PG_lru	|
			1 << PG_private |
Linus Torvalds's avatar
Linus Torvalds committed
194 195 196
			1 << PG_locked	|
			1 << PG_active	|
			1 << PG_dirty	|
197 198
			1 << PG_reclaim |
			1 << PG_slab    |
Linus Torvalds's avatar
Linus Torvalds committed
199
			1 << PG_swapcache |
200 201
			1 << PG_writeback |
			1 << PG_buddy );
Linus Torvalds's avatar
Linus Torvalds committed
202 203 204
	set_page_count(page, 0);
	reset_page_mapcount(page);
	page->mapping = NULL;
205
	add_taint(TAINT_BAD_PAGE);
Linus Torvalds's avatar
Linus Torvalds committed
206 207 208 209 210 211 212 213 214 215 216 217
}

/*
 * 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).
 *
218 219 220
 * 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
221
 */
222 223 224 225 226 227

static void free_compound_page(struct page *page)
{
	__free_pages_ok(page, (unsigned long)page[1].lru.prev);
}

Linus Torvalds's avatar
Linus Torvalds committed
228 229 230 231 232
static void prep_compound_page(struct page *page, unsigned long order)
{
	int i;
	int nr_pages = 1 << order;

233
	set_compound_page_dtor(page, free_compound_page);
234
	page[1].lru.prev = (void *)order;
Linus Torvalds's avatar
Linus Torvalds committed
235 236 237
	for (i = 0; i < nr_pages; i++) {
		struct page *p = page + i;

238
		__SetPageCompound(p);
239
		set_page_private(p, (unsigned long)page);
Linus Torvalds's avatar
Linus Torvalds committed
240 241 242 243 244 245 246 247
	}
}

static void destroy_compound_page(struct page *page, unsigned long order)
{
	int i;
	int nr_pages = 1 << order;

248
	if (unlikely((unsigned long)page[1].lru.prev != order))
249
		bad_page(page);
Linus Torvalds's avatar
Linus Torvalds committed
250 251 252 253

	for (i = 0; i < nr_pages; i++) {
		struct page *p = page + i;

254 255 256
		if (unlikely(!PageCompound(p) |
				(page_private(p) != (unsigned long)page)))
			bad_page(page);
257
		__ClearPageCompound(p);
Linus Torvalds's avatar
Linus Torvalds committed
258 259 260
	}
}

Nick Piggin's avatar
Nick Piggin committed
261 262 263 264
static inline void prep_zero_page(struct page *page, int order, gfp_t gfp_flags)
{
	int i;

Nick Piggin's avatar
Nick Piggin committed
265
	VM_BUG_ON((gfp_flags & (__GFP_WAIT | __GFP_HIGHMEM)) == __GFP_HIGHMEM);
266 267 268 269
	/*
	 * 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
270
	VM_BUG_ON((gfp_flags & __GFP_HIGHMEM) && in_interrupt());
Nick Piggin's avatar
Nick Piggin committed
271 272 273 274
	for (i = 0; i < (1 << order); i++)
		clear_highpage(page + i);
}

Linus Torvalds's avatar
Linus Torvalds committed
275 276 277 278 279
/*
 * function for dealing with page's order in buddy system.
 * zone->lock is already acquired when we use these.
 * So, we don't need atomic page->flags operations here.
 */
280 281
static inline unsigned long page_order(struct page *page)
{
282
	return page_private(page);
Linus Torvalds's avatar
Linus Torvalds committed
283 284
}

285 286
static inline void set_page_order(struct page *page, int order)
{
287
	set_page_private(page, order);
288
	__SetPageBuddy(page);
Linus Torvalds's avatar
Linus Torvalds committed
289 290 291 292
}

static inline void rmv_page_order(struct page *page)
{
293
	__ClearPageBuddy(page);
294
	set_page_private(page, 0);
Linus Torvalds's avatar
Linus Torvalds committed
295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311
}

/*
 * 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
312
 * Assumption: *_mem_map is contiguous at least up to MAX_ORDER
Linus Torvalds's avatar
Linus Torvalds committed
313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330
 */
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
331
 * (a) the buddy is not in a hole &&
332
 * (b) the buddy is in the buddy system &&
333 334
 * (c) a page and its buddy have the same order &&
 * (d) a page and its buddy are in the same zone.
335 336 337
 *
 * 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
338
 *
339
 * For recording page's order, we use page_private(page).
Linus Torvalds's avatar
Linus Torvalds committed
340
 */
341 342
static inline int page_is_buddy(struct page *page, struct page *buddy,
								int order)
Linus Torvalds's avatar
Linus Torvalds committed
343
{
Nick Piggin's avatar
Nick Piggin committed
344
#ifdef CONFIG_HOLES_IN_ZONE
345
	if (!pfn_valid(page_to_pfn(buddy)))
Nick Piggin's avatar
Nick Piggin committed
346 347 348
		return 0;
#endif

349 350 351 352 353
	if (page_zone_id(page) != page_zone_id(buddy))
		return 0;

	if (PageBuddy(buddy) && page_order(buddy) == order) {
		BUG_ON(page_count(buddy) != 0);
354
		return 1;
355
	}
356
	return 0;
Linus Torvalds's avatar
Linus Torvalds committed
357 358 359 360 361 362 363 364 365 366 367 368 369 370 371
}

/*
 * 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
372
 * free pages of length of (1 << order) and marked with PG_buddy. Page's
373
 * order is recorded in page_private(page) field.
Linus Torvalds's avatar
Linus Torvalds committed
374 375 376 377 378 379 380 381 382
 * 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
383
static inline void __free_one_page(struct page *page,
Linus Torvalds's avatar
Linus Torvalds committed
384 385 386 387 388
		struct zone *zone, unsigned int order)
{
	unsigned long page_idx;
	int order_size = 1 << order;

389
	if (unlikely(PageCompound(page)))
Linus Torvalds's avatar
Linus Torvalds committed
390 391 392 393
		destroy_compound_page(page, order);

	page_idx = page_to_pfn(page) & ((1 << MAX_ORDER) - 1);

Nick Piggin's avatar
Nick Piggin committed
394 395
	VM_BUG_ON(page_idx & (order_size - 1));
	VM_BUG_ON(bad_range(zone, page));
Linus Torvalds's avatar
Linus Torvalds committed
396 397 398 399 400 401 402 403

	zone->free_pages += order_size;
	while (order < MAX_ORDER-1) {
		unsigned long combined_idx;
		struct free_area *area;
		struct page *buddy;

		buddy = __page_find_buddy(page, page_idx, order);
404
		if (!page_is_buddy(page, buddy, order))
Linus Torvalds's avatar
Linus Torvalds committed
405
			break;		/* Move the buddy up one level. */
Nick Piggin's avatar
Nick Piggin committed
406

Linus Torvalds's avatar
Linus Torvalds committed
407 408 409 410
		list_del(&buddy->lru);
		area = zone->free_area + order;
		area->nr_free--;
		rmv_page_order(buddy);
Nick Piggin's avatar
Nick Piggin committed
411
		combined_idx = __find_combined_index(page_idx, order);
Linus Torvalds's avatar
Linus Torvalds committed
412 413 414 415 416 417 418 419 420
		page = page + (combined_idx - page_idx);
		page_idx = combined_idx;
		order++;
	}
	set_page_order(page, order);
	list_add(&page->lru, &zone->free_area[order].free_list);
	zone->free_area[order].nr_free++;
}

421
static inline int free_pages_check(struct page *page)
Linus Torvalds's avatar
Linus Torvalds committed
422
{
Nick Piggin's avatar
Nick Piggin committed
423 424 425
	if (unlikely(page_mapcount(page) |
		(page->mapping != NULL)  |
		(page_count(page) != 0)  |
Linus Torvalds's avatar
Linus Torvalds committed
426 427 428 429 430 431 432 433
		(page->flags & (
			1 << PG_lru	|
			1 << PG_private |
			1 << PG_locked	|
			1 << PG_active	|
			1 << PG_reclaim	|
			1 << PG_slab	|
			1 << PG_swapcache |
Nick Piggin's avatar
Nick Piggin committed
434
			1 << PG_writeback |
435 436
			1 << PG_reserved |
			1 << PG_buddy ))))
437
		bad_page(page);
Linus Torvalds's avatar
Linus Torvalds committed
438
	if (PageDirty(page))
Nick Piggin's avatar
Nick Piggin committed
439
		__ClearPageDirty(page);
440 441 442 443 444 445
	/*
	 * For now, we report if PG_reserved was found set, but do not
	 * clear it, and do not free the page.  But we shall soon need
	 * to do more, for when the ZERO_PAGE count wraps negative.
	 */
	return PageReserved(page);
Linus Torvalds's avatar
Linus Torvalds committed
446 447 448 449 450
}

/*
 * Frees a list of pages. 
 * Assumes all pages on list are in same zone, and of same order.
451
 * count is the number of pages to free.
Linus Torvalds's avatar
Linus Torvalds committed
452 453 454 455 456 457 458
 *
 * 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
459 460
static void free_pages_bulk(struct zone *zone, int count,
					struct list_head *list, int order)
Linus Torvalds's avatar
Linus Torvalds committed
461
{
Nick Piggin's avatar
Nick Piggin committed
462
	spin_lock(&zone->lock);
Linus Torvalds's avatar
Linus Torvalds committed
463 464
	zone->all_unreclaimable = 0;
	zone->pages_scanned = 0;
Nick Piggin's avatar
Nick Piggin committed
465 466 467
	while (count--) {
		struct page *page;

Nick Piggin's avatar
Nick Piggin committed
468
		VM_BUG_ON(list_empty(list));
Linus Torvalds's avatar
Linus Torvalds committed
469
		page = list_entry(list->prev, struct page, lru);
Nick Piggin's avatar
Nick Piggin committed
470
		/* have to delete it as __free_one_page list manipulates */
Linus Torvalds's avatar
Linus Torvalds committed
471
		list_del(&page->lru);
Nick Piggin's avatar
Nick Piggin committed
472
		__free_one_page(page, zone, order);
Linus Torvalds's avatar
Linus Torvalds committed
473
	}
Nick Piggin's avatar
Nick Piggin committed
474
	spin_unlock(&zone->lock);
Linus Torvalds's avatar
Linus Torvalds committed
475 476
}

Nick Piggin's avatar
Nick Piggin committed
477
static void free_one_page(struct zone *zone, struct page *page, int order)
Linus Torvalds's avatar
Linus Torvalds committed
478
{
479 480 481
	spin_lock(&zone->lock);
	zone->all_unreclaimable = 0;
	zone->pages_scanned = 0;
482
	__free_one_page(page, zone, order);
483
	spin_unlock(&zone->lock);
Nick Piggin's avatar
Nick Piggin committed
484 485 486 487 488
}

static void __free_pages_ok(struct page *page, unsigned int order)
{
	unsigned long flags;
Linus Torvalds's avatar
Linus Torvalds committed
489
	int i;
490
	int reserved = 0;
Linus Torvalds's avatar
Linus Torvalds committed
491 492

	for (i = 0 ; i < (1 << order) ; ++i)
493
		reserved += free_pages_check(page + i);
494 495 496
	if (reserved)
		return;

Nick Piggin's avatar
Nick Piggin committed
497 498
	if (!PageHighMem(page))
		debug_check_no_locks_freed(page_address(page),PAGE_SIZE<<order);
Nick Piggin's avatar
Nick Piggin committed
499
	arch_free_page(page, order);
Nick Piggin's avatar
Nick Piggin committed
500
	kernel_map_pages(page, 1 << order, 0);
Nick Piggin's avatar
Nick Piggin committed
501

Nick Piggin's avatar
Nick Piggin committed
502
	local_irq_save(flags);
503
	__count_vm_events(PGFREE, 1 << order);
Nick Piggin's avatar
Nick Piggin committed
504
	free_one_page(page_zone(page), page, order);
Nick Piggin's avatar
Nick Piggin committed
505
	local_irq_restore(flags);
Linus Torvalds's avatar
Linus Torvalds committed
506 507
}

508 509 510 511 512 513 514 515
/*
 * permit the bootmem allocator to evade page validation on high-order frees
 */
void fastcall __init __free_pages_bootmem(struct page *page, unsigned int order)
{
	if (order == 0) {
		__ClearPageReserved(page);
		set_page_count(page, 0);
516
		set_page_refcounted(page);
Nick Piggin's avatar
Nick Piggin committed
517
		__free_page(page);
518 519 520
	} else {
		int loop;

Nick Piggin's avatar
Nick Piggin committed
521
		prefetchw(page);
522 523 524
		for (loop = 0; loop < BITS_PER_LONG; loop++) {
			struct page *p = &page[loop];

Nick Piggin's avatar
Nick Piggin committed
525 526
			if (loop + 1 < BITS_PER_LONG)
				prefetchw(p + 1);
527 528 529 530
			__ClearPageReserved(p);
			set_page_count(p, 0);
		}

531
		set_page_refcounted(page);
Nick Piggin's avatar
Nick Piggin committed
532
		__free_pages(page, order);
533 534 535
	}
}

Linus Torvalds's avatar
Linus Torvalds committed
536 537 538 539 540 541 542 543 544 545 546 547 548 549 550

/*
 * 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
551
static inline void expand(struct zone *zone, struct page *page,
Linus Torvalds's avatar
Linus Torvalds committed
552 553 554 555 556 557 558 559
 	int low, int high, struct free_area *area)
{
	unsigned long size = 1 << high;

	while (high > low) {
		area--;
		high--;
		size >>= 1;
Nick Piggin's avatar
Nick Piggin committed
560
		VM_BUG_ON(bad_range(zone, &page[size]));
Linus Torvalds's avatar
Linus Torvalds committed
561 562 563 564 565 566 567 568 569
		list_add(&page[size].lru, &area->free_list);
		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
570
static int prep_new_page(struct page *page, int order, gfp_t gfp_flags)
Linus Torvalds's avatar
Linus Torvalds committed
571
{
Nick Piggin's avatar
Nick Piggin committed
572 573 574
	if (unlikely(page_mapcount(page) |
		(page->mapping != NULL)  |
		(page_count(page) != 0)  |
575 576
		(page->flags & (
			1 << PG_lru	|
Linus Torvalds's avatar
Linus Torvalds committed
577 578 579 580 581
			1 << PG_private	|
			1 << PG_locked	|
			1 << PG_active	|
			1 << PG_dirty	|
			1 << PG_reclaim	|
582
			1 << PG_slab    |
Linus Torvalds's avatar
Linus Torvalds committed
583
			1 << PG_swapcache |
Nick Piggin's avatar
Nick Piggin committed
584
			1 << PG_writeback |
585 586
			1 << PG_reserved |
			1 << PG_buddy ))))
587
		bad_page(page);
Linus Torvalds's avatar
Linus Torvalds committed
588

589 590 591 592 593 594 595
	/*
	 * For now, we report if PG_reserved was found set, but do not
	 * clear it, and do not allocate the page: as a safety net.
	 */
	if (PageReserved(page))
		return 1;

Linus Torvalds's avatar
Linus Torvalds committed
596 597 598
	page->flags &= ~(1 << PG_uptodate | 1 << PG_error |
			1 << PG_referenced | 1 << PG_arch_1 |
			1 << PG_checked | 1 << PG_mappedtodisk);
599
	set_page_private(page, 0);
600
	set_page_refcounted(page);
Nick Piggin's avatar
Nick Piggin committed
601 602

	arch_alloc_page(page, order);
Linus Torvalds's avatar
Linus Torvalds committed
603
	kernel_map_pages(page, 1 << order, 1);
Nick Piggin's avatar
Nick Piggin committed
604 605 606 607 608 609 610

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

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

611
	return 0;
Linus Torvalds's avatar
Linus Torvalds committed
612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633
}

/* 
 * Do the hard work of removing an element from the buddy allocator.
 * Call me with the zone->lock already held.
 */
static struct page *__rmqueue(struct zone *zone, unsigned int order)
{
	struct free_area * area;
	unsigned int current_order;
	struct page *page;

	for (current_order = order; current_order < MAX_ORDER; ++current_order) {
		area = zone->free_area + current_order;
		if (list_empty(&area->free_list))
			continue;

		page = list_entry(area->free_list.next, struct page, lru);
		list_del(&page->lru);
		rmv_page_order(page);
		area->nr_free--;
		zone->free_pages -= 1UL << order;
Nick Piggin's avatar
Nick Piggin committed
634 635
		expand(zone, page, order, current_order, area);
		return page;
Linus Torvalds's avatar
Linus Torvalds committed
636 637 638 639 640 641 642 643 644 645 646 647 648 649 650
	}

	return NULL;
}

/* 
 * 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, 
			unsigned long count, struct list_head *list)
{
	int i;
	
Nick Piggin's avatar
Nick Piggin committed
651
	spin_lock(&zone->lock);
Linus Torvalds's avatar
Linus Torvalds committed
652
	for (i = 0; i < count; ++i) {
Nick Piggin's avatar
Nick Piggin committed
653 654
		struct page *page = __rmqueue(zone, order);
		if (unlikely(page == NULL))
Linus Torvalds's avatar
Linus Torvalds committed
655 656 657
			break;
		list_add_tail(&page->lru, list);
	}
Nick Piggin's avatar
Nick Piggin committed
658
	spin_unlock(&zone->lock);
Nick Piggin's avatar
Nick Piggin committed
659
	return i;
Linus Torvalds's avatar
Linus Torvalds committed
660 661
}

662
#ifdef CONFIG_NUMA
663 664
/*
 * Called from the slab reaper to drain pagesets on a particular node that
665
 * belongs to the currently executing processor.
666 667
 * Note that this function must be called with the thread pinned to
 * a single processor.
668 669
 */
void drain_node_pages(int nodeid)
670
{
671 672
	int i;
	enum zone_type z;
673 674
	unsigned long flags;

675 676
	for (z = 0; z < MAX_NR_ZONES; z++) {
		struct zone *zone = NODE_DATA(nodeid)->node_zones + z;
677 678
		struct per_cpu_pageset *pset;

679 680 681
		if (!populated_zone(zone))
			continue;

Nick Piggin's avatar
Nick Piggin committed
682
		pset = zone_pcp(zone, smp_processor_id());
683 684 685 686
		for (i = 0; i < ARRAY_SIZE(pset->pcp); i++) {
			struct per_cpu_pages *pcp;

			pcp = &pset->pcp[i];
687
			if (pcp->count) {
688 689
				int to_drain;

690
				local_irq_save(flags);
691 692 693 694 695 696
				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;
697 698
				local_irq_restore(flags);
			}
699 700 701 702 703
		}
	}
}
#endif

Linus Torvalds's avatar
Linus Torvalds committed
704 705
static void __drain_pages(unsigned int cpu)
{
Nick Piggin's avatar
Nick Piggin committed
706
	unsigned long flags;
Linus Torvalds's avatar
Linus Torvalds committed
707 708 709 710 711 712
	struct zone *zone;
	int i;

	for_each_zone(zone) {
		struct per_cpu_pageset *pset;

713
		pset = zone_pcp(zone, cpu);
Linus Torvalds's avatar
Linus Torvalds committed
714 715 716 717
		for (i = 0; i < ARRAY_SIZE(pset->pcp); i++) {
			struct per_cpu_pages *pcp;

			pcp = &pset->pcp[i];
Nick Piggin's avatar
Nick Piggin committed
718
			local_irq_save(flags);
Nick Piggin's avatar
Nick Piggin committed
719 720
			free_pages_bulk(zone, pcp->count, &pcp->list, 0);
			pcp->count = 0;
Nick Piggin's avatar
Nick Piggin committed
721
			local_irq_restore(flags);
Linus Torvalds's avatar
Linus Torvalds committed
722 723 724 725 726 727 728 729
		}
	}
}

#ifdef CONFIG_PM

void mark_free_pages(struct zone *zone)
{
730 731
	unsigned long pfn, max_zone_pfn;
	unsigned long flags;
Linus Torvalds's avatar
Linus Torvalds committed
732 733 734 735 736 737 738
	int order;
	struct list_head *curr;

	if (!zone->spanned_pages)
		return;

	spin_lock_irqsave(&zone->lock, flags);
739 740 741 742 743 744 745 746 747

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

			if (!PageNosave(page))
				ClearPageNosaveFree(page);
		}
Linus Torvalds's avatar
Linus Torvalds committed
748 749 750

	for (order = MAX_ORDER - 1; order >= 0; --order)
		list_for_each(curr, &zone->free_area[order].free_list) {
751
			unsigned long i;
Linus Torvalds's avatar
Linus Torvalds committed
752

753 754 755 756
			pfn = page_to_pfn(list_entry(curr, struct page, lru));
			for (i = 0; i < (1UL << order); i++)
				SetPageNosaveFree(pfn_to_page(pfn + i));
		}
Linus Torvalds's avatar
Linus Torvalds committed
757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784

	spin_unlock_irqrestore(&zone->lock, flags);
}

/*
 * Spill all of this CPU's per-cpu pages back into the buddy allocator.
 */
void drain_local_pages(void)
{
	unsigned long flags;

	local_irq_save(flags);	
	__drain_pages(smp_processor_id());
	local_irq_restore(flags);	
}
#endif /* CONFIG_PM */

/*
 * Free a 0-order page
 */
static void fastcall free_hot_cold_page(struct page *page, int cold)
{
	struct zone *zone = page_zone(page);
	struct per_cpu_pages *pcp;
	unsigned long flags;

	if (PageAnon(page))
		page->mapping = NULL;
785
	if (free_pages_check(page))
786 787
		return;

Nick Piggin's avatar
Nick Piggin committed
788 789
	if (!PageHighMem(page))
		debug_check_no_locks_freed(page_address(page), PAGE_SIZE);
Nick Piggin's avatar
Nick Piggin committed
790
	arch_free_page(page, 0);
791 792
	kernel_map_pages(page, 1, 0);

793
	pcp = &zone_pcp(zone, get_cpu())->pcp[cold];
Linus Torvalds's avatar
Linus Torvalds committed
794
	local_irq_save(flags);
795
	__count_vm_event(PGFREE);
Linus Torvalds's avatar
Linus Torvalds committed
796 797
	list_add(&page->lru, &pcp->list);
	pcp->count++;
Nick Piggin's avatar
Nick Piggin committed
798 799 800 801
	if (pcp->count >= pcp->high) {
		free_pages_bulk(zone, pcp->batch, &pcp->list, 0);
		pcp->count -= pcp->batch;
	}
Linus Torvalds's avatar
Linus Torvalds committed
802 803 804 805 806 807 808 809 810 811 812 813 814 815
	local_irq_restore(flags);
	put_cpu();
}

void fastcall free_hot_page(struct page *page)
{
	free_hot_cold_page(page, 0);
}
	
void fastcall free_cold_page(struct page *page)
{
	free_hot_cold_page(page, 1);
}

816 817 818 819 820 821 822 823 824 825 826 827
/*
 * split_page takes a non-compound higher-order page, and splits it into
 * n (1<<order) sub-pages: page[0..n]
 * Each sub-page must be freed individually.
 *
 * Note: this is probably too low level an operation for use in drivers.
 * Please consult with lkml before using this in your driver.
 */
void split_page(struct page *page, unsigned int order)
{
	int i;

Nick Piggin's avatar
Nick Piggin committed
828 829
	VM_BUG_ON(PageCompound(page));
	VM_BUG_ON(!page_count(page));
830 831
	for (i = 1; i < (1 << order); i++)
		set_page_refcounted(page + i);
832 833
}

Linus Torvalds's avatar
Linus Torvalds committed
834 835 836 837 838
/*
 * Really, prep_compound_page() should be called from __rmqueue_bulk().  But
 * we cheat by calling it from here, in the order > 0 path.  Saves a branch
 * or two.
 */
Nick Piggin's avatar
Nick Piggin committed
839 840
static struct page *buffered_rmqueue(struct zonelist *zonelist,
			struct zone *zone, int order, gfp_t gfp_flags)
Linus Torvalds's avatar
Linus Torvalds committed
841 842
{
	unsigned long flags;
843
	struct page *page;
Linus Torvalds's avatar
Linus Torvalds committed
844
	int cold = !!(gfp_flags & __GFP_COLD);
Nick Piggin's avatar
Nick Piggin committed
845
	int cpu;
Linus Torvalds's avatar
Linus Torvalds committed
846

847
again:
Nick Piggin's avatar
Nick Piggin committed
848
	cpu  = get_cpu();
Nick Piggin's avatar
Nick Piggin committed
849
	if (likely(order == 0)) {
Linus Torvalds's avatar
Linus Torvalds committed
850 851
		struct per_cpu_pages *pcp;

Nick Piggin's avatar
Nick Piggin committed
852
		pcp = &zone_pcp(zone, cpu)->pcp[cold];
Linus Torvalds's avatar
Linus Torvalds committed
853
		local_irq_save(flags);
Nick Piggin's avatar
Nick Piggin committed
854
		if (!pcp->count) {
855
			pcp->count = rmqueue_bulk(zone, 0,
Linus Torvalds's avatar
Linus Torvalds committed
856
						pcp->batch, &pcp->list);
Nick Piggin's avatar
Nick Piggin committed
857 858
			if (unlikely(!pcp->count))
				goto failed;
Linus Torvalds's avatar
Linus Torvalds committed
859
		}
Nick Piggin's avatar
Nick Piggin committed
860 861 862
		page = list_entry(pcp->list.next, struct page, lru);
		list_del(&page->lru);
		pcp->count--;
Rohit Seth's avatar
Rohit Seth committed
863
	} else {
Linus Torvalds's avatar
Linus Torvalds committed
864 865
		spin_lock_irqsave(&zone->lock, flags);
		page = __rmqueue(zone, order);
Nick Piggin's avatar
Nick Piggin committed
866 867 868
		spin_unlock(&zone->lock);
		if (!page)
			goto failed;
Linus Torvalds's avatar
Linus Torvalds committed
869 870
	}

871
	__count_zone_vm_events(PGALLOC, zone, 1 << order);
872
	zone_statistics(zonelist, zone);
Nick Piggin's avatar
Nick Piggin committed
873 874
	local_irq_restore(flags);
	put_cpu();
Linus Torvalds's avatar
Linus Torvalds committed
875

Nick Piggin's avatar
Nick Piggin committed
876
	VM_BUG_ON(bad_range(zone, page));
Nick Piggin's avatar
Nick Piggin committed
877
	if (prep_new_page(page, order, gfp_flags))
Nick Piggin's avatar
Nick Piggin committed
878
		goto again;
Linus Torvalds's avatar
Linus Torvalds committed
879
	return page;
Nick Piggin's avatar
Nick Piggin committed
880 881 882 883 884

failed:
	local_irq_restore(flags);
	put_cpu();
	return NULL;
Linus Torvalds's avatar
Linus Torvalds committed
885 886
}

Rohit Seth's avatar
Rohit Seth committed
887
#define ALLOC_NO_WATERMARKS	0x01 /* don't check watermarks at all */
888 889 890 891 892 893
#define ALLOC_WMARK_MIN		0x02 /* use pages_min watermark */
#define ALLOC_WMARK_LOW		0x04 /* use pages_low watermark */
#define ALLOC_WMARK_HIGH	0x08 /* use pages_high watermark */
#define ALLOC_HARDER		0x10 /* try to alloc harder */
#define ALLOC_HIGH		0x20 /* __GFP_HIGH set */
#define ALLOC_CPUSET		0x40 /* check for correct cpuset */
Rohit Seth's avatar
Rohit Seth committed
894

Linus Torvalds's avatar
Linus Torvalds committed
895 896 897 898 899
/*
 * Return 1 if free pages are above 'mark'. This takes into account the order
 * of the allocation.
 */
int zone_watermark_ok(struct zone *z, int order, unsigned long mark,
Rohit Seth's avatar
Rohit Seth committed
900
		      int classzone_idx, int alloc_flags)
Linus Torvalds's avatar
Linus Torvalds committed
901 902
{
	/* free_pages my go negative - that's OK */
903 904
	unsigned long min = mark;
	long free_pages = z->free_pages - (1 << order) + 1;
Linus Torvalds's avatar
Linus Torvalds committed
905 906
	int o;

Rohit Seth's avatar
Rohit Seth committed
907
	if (alloc_flags & ALLOC_HIGH)
Linus Torvalds's avatar
Linus Torvalds committed
908
		min -= min / 2;
Rohit Seth's avatar
Rohit Seth committed
909
	if (alloc_flags & ALLOC_HARDER)
Linus Torvalds's avatar
Linus Torvalds committed
910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926
		min -= min / 4;

	if (free_pages <= min + z->lowmem_reserve[classzone_idx])
		return 0;
	for (o = 0; o < order; o++) {
		/* At the next order, this order's pages become unavailable */
		free_pages -= z->free_area[o].nr_free << o;

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

		if (free_pages <= min)
			return 0;
	}
	return 1;
}

927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046
#ifdef CONFIG_NUMA
/*
 * zlc_setup - Setup for "zonelist cache".  Uses cached zone data to
 * skip over zones that are not allowed by the cpuset, or that have
 * been recently (in last second) found to be nearly full.  See further
 * comments in mmzone.h.  Reduces cache footprint of zonelist scans
 * that have to skip over alot of full or unallowed zones.
 *
 * If the zonelist cache is present in the passed in zonelist, then
 * returns a pointer to the allowed node mask (either the current
 * tasks mems_allowed, or node_online_map.)
 *
 * If the zonelist cache is not available for this zonelist, does
 * nothing and returns NULL.
 *
 * If the fullzones BITMAP in the zonelist cache is stale (more than
 * a second since last zap'd) then we zap it out (clear its bits.)
 *
 * We hold off even calling zlc_setup, until after we've checked the
 * first zone in the zonelist, on the theory that most allocations will
 * be satisfied from that first zone, so best to examine that zone as
 * quickly as we can.
 */
static nodemask_t *zlc_setup(struct zonelist *zonelist, int alloc_flags)
{
	struct zonelist_cache *zlc;	/* cached zonelist speedup info */
	nodemask_t *allowednodes;	/* zonelist_cache approximation */

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

	if (jiffies - zlc->last_full_zap > 1 * HZ) {
		bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST);
		zlc->last_full_zap = jiffies;
	}

	allowednodes = !in_interrupt() && (alloc_flags & ALLOC_CPUSET) ?
					&cpuset_current_mems_allowed :
					&node_online_map;
	return allowednodes;
}

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

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

	i = z - zonelist->zones;
	n = zlc->z_to_n[i];

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

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

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

	i = z - zonelist->zones;

	set_bit(i, zlc->fullzones);
}

#else	/* CONFIG_NUMA */

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

static int zlc_zone_worth_trying(struct zonelist *zonelist, struct zone **z,
				nodemask_t *allowednodes)
{
	return 1;
}

static void zlc_mark_zone_full(struct zonelist *zonelist, struct zone **z)
{
}
#endif	/* CONFIG_NUMA */

Rohit Seth's avatar
Rohit Seth committed
1047
/*
1048
 * get_page_from_freelist goes through the zonelist trying to allocate
Rohit Seth's avatar
Rohit Seth committed
1049 1050 1051 1052 1053
 * a page.
 */
static struct page *
get_page_from_freelist(gfp_t gfp_mask, unsigned int order,
		struct zonelist *zonelist, int alloc_flags)
Martin Hicks's avatar
Martin Hicks committed
1054
{
1055
	struct zone **z;
Rohit Seth's avatar
Rohit Seth committed
1056
	struct page *page = NULL;
1057
	int classzone_idx = zone_idx(zonelist->zones[0]);
1058
	struct zone *zone;
1059 1060 1061
	nodemask_t *allowednodes = NULL;/* zonelist_cache approximation */
	int zlc_active = 0;		/* set if using zonelist_cache */
	int did_zlc_setup = 0;		/* just call zlc_setup() one time */
Rohit Seth's avatar
Rohit Seth committed
1062

1063
zonelist_scan:
Rohit Seth's avatar
Rohit Seth committed
1064
	/*
1065
	 * Scan zonelist, looking for a zone with enough free.
Rohit Seth's avatar
Rohit Seth committed
1066 1067
	 * See also cpuset_zone_allowed() comment in kernel/cpuset.c.
	 */
1068 1069
	z = zonelist->zones;

Rohit Seth's avatar
Rohit Seth committed
1070
	do {
1071 1072 1073
		if (NUMA_BUILD && zlc_active &&
			!zlc_zone_worth_trying(zonelist, z, allowednodes))
				continue;
1074
		zone = *z;
1075
		if (unlikely(NUMA_BUILD && (gfp_mask & __GFP_THISNODE) &&
1076
			zone->zone_pgdat != zonelist->zones[0]->zone_pgdat))
1077
				break;
Rohit Seth's avatar
Rohit Seth committed
1078
		if ((alloc_flags & ALLOC_CPUSET) &&
1079
			!cpuset_zone_allowed(zone, gfp_mask))
1080
				goto try_next_zone;
Rohit Seth's avatar
Rohit Seth committed
1081 1082

		if (!(alloc_flags & ALLOC_NO_WATERMARKS)) {
1083 1084
			unsigned long mark;
			if (alloc_flags & ALLOC_WMARK_MIN)
1085
				mark = zone->pages_min;
1086
			else if (alloc_flags & ALLOC_WMARK_LOW)
1087
				mark = zone->pages_low;