swap.c 20.4 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7
/*
 *  linux/mm/swap.c
 *
 *  Copyright (C) 1991, 1992, 1993, 1994  Linus Torvalds
 */

/*
S
Simon Arlott 已提交
8
 * This file contains the default values for the operation of the
L
Linus Torvalds 已提交
9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
 * Linux VM subsystem. Fine-tuning documentation can be found in
 * Documentation/sysctl/vm.txt.
 * Started 18.12.91
 * Swap aging added 23.2.95, Stephen Tweedie.
 * Buffermem limits added 12.3.98, Rik van Riel.
 */

#include <linux/mm.h>
#include <linux/sched.h>
#include <linux/kernel_stat.h>
#include <linux/swap.h>
#include <linux/mman.h>
#include <linux/pagemap.h>
#include <linux/pagevec.h>
#include <linux/init.h>
24
#include <linux/export.h>
L
Linus Torvalds 已提交
25 26 27 28 29 30
#include <linux/mm_inline.h>
#include <linux/buffer_head.h>	/* for try_to_release_page() */
#include <linux/percpu_counter.h>
#include <linux/percpu.h>
#include <linux/cpu.h>
#include <linux/notifier.h>
P
Peter Zijlstra 已提交
31
#include <linux/backing-dev.h>
32
#include <linux/memcontrol.h>
33
#include <linux/gfp.h>
L
Linus Torvalds 已提交
34

35 36
#include "internal.h"

L
Linus Torvalds 已提交
37 38 39
/* How many pages do we try to swap or page in/out together? */
int page_cluster;

40
static DEFINE_PER_CPU(struct pagevec[NR_LRU_LISTS], lru_add_pvecs);
41
static DEFINE_PER_CPU(struct pagevec, lru_rotate_pvecs);
M
Minchan Kim 已提交
42
static DEFINE_PER_CPU(struct pagevec, lru_deactivate_pvecs);
43

A
Adrian Bunk 已提交
44 45 46 47
/*
 * This path almost never happens for VM activity - pages are normally
 * freed via pagevecs.  But it gets used by networking.
 */
H
Harvey Harrison 已提交
48
static void __page_cache_release(struct page *page)
A
Adrian Bunk 已提交
49 50 51 52 53 54 55 56 57 58 59
{
	if (PageLRU(page)) {
		unsigned long flags;
		struct zone *zone = page_zone(page);

		spin_lock_irqsave(&zone->lru_lock, flags);
		VM_BUG_ON(!PageLRU(page));
		__ClearPageLRU(page);
		del_page_from_lru(zone, page);
		spin_unlock_irqrestore(&zone->lru_lock, flags);
	}
60 61 62 63 64
}

static void __put_single_page(struct page *page)
{
	__page_cache_release(page);
L
Li Hong 已提交
65
	free_hot_cold_page(page, 0);
A
Adrian Bunk 已提交
66 67
}

68
static void __put_compound_page(struct page *page)
L
Linus Torvalds 已提交
69
{
70
	compound_page_dtor *dtor;
L
Linus Torvalds 已提交
71

72 73 74 75 76 77 78 79 80
	__page_cache_release(page);
	dtor = get_compound_page_dtor(page);
	(*dtor)(page);
}

static void put_compound_page(struct page *page)
{
	if (unlikely(PageTail(page))) {
		/* __split_huge_page_refcount can run under us */
81 82 83 84
		struct page *page_head = compound_trans_head(page);

		if (likely(page != page_head &&
			   get_page_unless_zero(page_head))) {
85 86
			unsigned long flags;
			/*
87 88 89 90
			 * page_head wasn't a dangling pointer but it
			 * may not be a head page anymore by the time
			 * we obtain the lock. That is ok as long as it
			 * can't be freed from under us.
91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106
			 */
			flags = compound_lock_irqsave(page_head);
			if (unlikely(!PageTail(page))) {
				/* __split_huge_page_refcount run before us */
				compound_unlock_irqrestore(page_head, flags);
				VM_BUG_ON(PageHead(page_head));
				if (put_page_testzero(page_head))
					__put_single_page(page_head);
			out_put_single:
				if (put_page_testzero(page))
					__put_single_page(page);
				return;
			}
			VM_BUG_ON(page_head != page->first_page);
			/*
			 * We can release the refcount taken by
107 108 109
			 * get_page_unless_zero() now that
			 * __split_huge_page_refcount() is blocked on
			 * the compound_lock.
110 111 112 113
			 */
			if (put_page_testzero(page_head))
				VM_BUG_ON(1);
			/* __split_huge_page_refcount will wait now */
114 115
			VM_BUG_ON(page_mapcount(page) <= 0);
			atomic_dec(&page->_mapcount);
116
			VM_BUG_ON(atomic_read(&page_head->_count) <= 0);
117
			VM_BUG_ON(atomic_read(&page->_count) != 0);
118
			compound_unlock_irqrestore(page_head, flags);
119 120 121 122 123 124
			if (put_page_testzero(page_head)) {
				if (PageHead(page_head))
					__put_compound_page(page_head);
				else
					__put_single_page(page_head);
			}
125 126 127 128 129 130 131 132 133 134
		} else {
			/* page_head is a dangling pointer */
			VM_BUG_ON(PageTail(page));
			goto out_put_single;
		}
	} else if (put_page_testzero(page)) {
		if (PageHead(page))
			__put_compound_page(page);
		else
			__put_single_page(page);
L
Linus Torvalds 已提交
135
	}
N
Nick Piggin 已提交
136 137 138 139 140 141 142
}

void put_page(struct page *page)
{
	if (unlikely(PageCompound(page)))
		put_compound_page(page);
	else if (put_page_testzero(page))
143
		__put_single_page(page);
L
Linus Torvalds 已提交
144 145 146
}
EXPORT_SYMBOL(put_page);

147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185
/*
 * This function is exported but must not be called by anything other
 * than get_page(). It implements the slow path of get_page().
 */
bool __get_page_tail(struct page *page)
{
	/*
	 * This takes care of get_page() if run on a tail page
	 * returned by one of the get_user_pages/follow_page variants.
	 * get_user_pages/follow_page itself doesn't need the compound
	 * lock because it runs __get_page_tail_foll() under the
	 * proper PT lock that already serializes against
	 * split_huge_page().
	 */
	unsigned long flags;
	bool got = false;
	struct page *page_head = compound_trans_head(page);

	if (likely(page != page_head && get_page_unless_zero(page_head))) {
		/*
		 * page_head wasn't a dangling pointer but it
		 * may not be a head page anymore by the time
		 * we obtain the lock. That is ok as long as it
		 * can't be freed from under us.
		 */
		flags = compound_lock_irqsave(page_head);
		/* here __split_huge_page_refcount won't run anymore */
		if (likely(PageTail(page))) {
			__get_page_tail_foll(page, false);
			got = true;
		}
		compound_unlock_irqrestore(page_head, flags);
		if (unlikely(!got))
			put_page(page_head);
	}
	return got;
}
EXPORT_SYMBOL(__get_page_tail);

186
/**
187 188
 * put_pages_list() - release a list of pages
 * @pages: list of pages threaded on page->lru
189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204
 *
 * Release a list of pages which are strung together on page.lru.  Currently
 * used by read_cache_pages() and related error recovery code.
 */
void put_pages_list(struct list_head *pages)
{
	while (!list_empty(pages)) {
		struct page *victim;

		victim = list_entry(pages->prev, struct page, lru);
		list_del(&victim->lru);
		page_cache_release(victim);
	}
}
EXPORT_SYMBOL(put_pages_list);

S
Shaohua Li 已提交
205 206 207
static void pagevec_lru_move_fn(struct pagevec *pvec,
				void (*move_fn)(struct page *page, void *arg),
				void *arg)
208 209 210
{
	int i;
	struct zone *zone = NULL;
S
Shaohua Li 已提交
211
	unsigned long flags = 0;
212 213 214 215 216 217 218

	for (i = 0; i < pagevec_count(pvec); i++) {
		struct page *page = pvec->pages[i];
		struct zone *pagezone = page_zone(page);

		if (pagezone != zone) {
			if (zone)
S
Shaohua Li 已提交
219
				spin_unlock_irqrestore(&zone->lru_lock, flags);
220
			zone = pagezone;
S
Shaohua Li 已提交
221
			spin_lock_irqsave(&zone->lru_lock, flags);
222
		}
S
Shaohua Li 已提交
223 224

		(*move_fn)(page, arg);
225 226
	}
	if (zone)
S
Shaohua Li 已提交
227
		spin_unlock_irqrestore(&zone->lru_lock, flags);
228 229
	release_pages(pvec->pages, pvec->nr, pvec->cold);
	pagevec_reinit(pvec);
S
Shaohua Li 已提交
230 231
}

S
Shaohua Li 已提交
232 233 234 235 236 237 238
static void pagevec_move_tail_fn(struct page *page, void *arg)
{
	int *pgmoved = arg;
	struct zone *zone = page_zone(page);

	if (PageLRU(page) && !PageActive(page) && !PageUnevictable(page)) {
		enum lru_list lru = page_lru_base_type(page);
239
		list_move_tail(&page->lru, &zone->lruvec.lists[lru]);
S
Shaohua Li 已提交
240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256
		mem_cgroup_rotate_reclaimable_page(page);
		(*pgmoved)++;
	}
}

/*
 * pagevec_move_tail() must be called with IRQ disabled.
 * Otherwise this may cause nasty races.
 */
static void pagevec_move_tail(struct pagevec *pvec)
{
	int pgmoved = 0;

	pagevec_lru_move_fn(pvec, pagevec_move_tail_fn, &pgmoved);
	__count_vm_events(PGROTATED, pgmoved);
}

L
Linus Torvalds 已提交
257 258 259
/*
 * Writeback is about to end against a page which has been marked for immediate
 * reclaim.  If it still appears to be reclaimable, move it to the tail of the
260
 * inactive list.
L
Linus Torvalds 已提交
261
 */
S
Shaohua Li 已提交
262
void rotate_reclaimable_page(struct page *page)
L
Linus Torvalds 已提交
263
{
264
	if (!PageLocked(page) && !PageDirty(page) && !PageActive(page) &&
L
Lee Schermerhorn 已提交
265
	    !PageUnevictable(page) && PageLRU(page)) {
266 267 268 269 270 271 272 273 274 275
		struct pagevec *pvec;
		unsigned long flags;

		page_cache_get(page);
		local_irq_save(flags);
		pvec = &__get_cpu_var(lru_rotate_pvecs);
		if (!pagevec_add(pvec, page))
			pagevec_move_tail(pvec);
		local_irq_restore(flags);
	}
L
Linus Torvalds 已提交
276 277
}

K
KOSAKI Motohiro 已提交
278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297
static void update_page_reclaim_stat(struct zone *zone, struct page *page,
				     int file, int rotated)
{
	struct zone_reclaim_stat *reclaim_stat = &zone->reclaim_stat;
	struct zone_reclaim_stat *memcg_reclaim_stat;

	memcg_reclaim_stat = mem_cgroup_get_reclaim_stat_from_page(page);

	reclaim_stat->recent_scanned[file]++;
	if (rotated)
		reclaim_stat->recent_rotated[file]++;

	if (!memcg_reclaim_stat)
		return;

	memcg_reclaim_stat->recent_scanned[file]++;
	if (rotated)
		memcg_reclaim_stat->recent_rotated[file]++;
}

298
static void __activate_page(struct page *page, void *arg)
L
Linus Torvalds 已提交
299 300
{
	struct zone *zone = page_zone(page);
301 302

	if (PageLRU(page) && !PageActive(page) && !PageUnevictable(page)) {
303 304 305
		int file = page_is_file_cache(page);
		int lru = page_lru_base_type(page);
		del_page_from_lru_list(zone, page, lru);
306

307 308 309 310
		SetPageActive(page);
		lru += LRU_ACTIVE;
		add_page_to_lru_list(zone, page, lru);
		__count_vm_event(PGACTIVATE);
311

312
		update_page_reclaim_stat(zone, page, file, 1);
L
Linus Torvalds 已提交
313
	}
314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349
}

#ifdef CONFIG_SMP
static DEFINE_PER_CPU(struct pagevec, activate_page_pvecs);

static void activate_page_drain(int cpu)
{
	struct pagevec *pvec = &per_cpu(activate_page_pvecs, cpu);

	if (pagevec_count(pvec))
		pagevec_lru_move_fn(pvec, __activate_page, NULL);
}

void activate_page(struct page *page)
{
	if (PageLRU(page) && !PageActive(page) && !PageUnevictable(page)) {
		struct pagevec *pvec = &get_cpu_var(activate_page_pvecs);

		page_cache_get(page);
		if (!pagevec_add(pvec, page))
			pagevec_lru_move_fn(pvec, __activate_page, NULL);
		put_cpu_var(activate_page_pvecs);
	}
}

#else
static inline void activate_page_drain(int cpu)
{
}

void activate_page(struct page *page)
{
	struct zone *zone = page_zone(page);

	spin_lock_irq(&zone->lru_lock);
	__activate_page(page, NULL);
L
Linus Torvalds 已提交
350 351
	spin_unlock_irq(&zone->lru_lock);
}
352
#endif
L
Linus Torvalds 已提交
353 354 355 356 357 358 359 360

/*
 * Mark a page as having seen activity.
 *
 * inactive,unreferenced	->	inactive,referenced
 * inactive,referenced		->	active,unreferenced
 * active,unreferenced		->	active,referenced
 */
H
Harvey Harrison 已提交
361
void mark_page_accessed(struct page *page)
L
Linus Torvalds 已提交
362
{
L
Lee Schermerhorn 已提交
363 364
	if (!PageActive(page) && !PageUnevictable(page) &&
			PageReferenced(page) && PageLRU(page)) {
L
Linus Torvalds 已提交
365 366 367 368 369 370 371 372 373
		activate_page(page);
		ClearPageReferenced(page);
	} else if (!PageReferenced(page)) {
		SetPageReferenced(page);
	}
}

EXPORT_SYMBOL(mark_page_accessed);

374
void __lru_cache_add(struct page *page, enum lru_list lru)
L
Linus Torvalds 已提交
375
{
376
	struct pagevec *pvec = &get_cpu_var(lru_add_pvecs)[lru];
L
Linus Torvalds 已提交
377 378 379

	page_cache_get(page);
	if (!pagevec_add(pvec, page))
380
		____pagevec_lru_add(pvec, lru);
L
Linus Torvalds 已提交
381 382
	put_cpu_var(lru_add_pvecs);
}
383
EXPORT_SYMBOL(__lru_cache_add);
L
Linus Torvalds 已提交
384

385 386 387 388 389 390
/**
 * lru_cache_add_lru - add a page to a page list
 * @page: the page to be added to the LRU.
 * @lru: the LRU list to which the page is added.
 */
void lru_cache_add_lru(struct page *page, enum lru_list lru)
L
Linus Torvalds 已提交
391
{
392
	if (PageActive(page)) {
L
Lee Schermerhorn 已提交
393
		VM_BUG_ON(PageUnevictable(page));
394
		ClearPageActive(page);
L
Lee Schermerhorn 已提交
395 396 397
	} else if (PageUnevictable(page)) {
		VM_BUG_ON(PageActive(page));
		ClearPageUnevictable(page);
398
	}
L
Linus Torvalds 已提交
399

L
Lee Schermerhorn 已提交
400
	VM_BUG_ON(PageLRU(page) || PageActive(page) || PageUnevictable(page));
401
	__lru_cache_add(page, lru);
L
Linus Torvalds 已提交
402 403
}

L
Lee Schermerhorn 已提交
404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424
/**
 * add_page_to_unevictable_list - add a page to the unevictable list
 * @page:  the page to be added to the unevictable list
 *
 * Add page directly to its zone's unevictable list.  To avoid races with
 * tasks that might be making the page evictable, through eg. munlock,
 * munmap or exit, while it's not on the lru, we want to add the page
 * while it's locked or otherwise "invisible" to other tasks.  This is
 * difficult to do when using the pagevec cache, so bypass that.
 */
void add_page_to_unevictable_list(struct page *page)
{
	struct zone *zone = page_zone(page);

	spin_lock_irq(&zone->lru_lock);
	SetPageUnevictable(page);
	SetPageLRU(page);
	add_page_to_lru_list(zone, page, LRU_UNEVICTABLE);
	spin_unlock_irq(&zone->lru_lock);
}

M
Minchan Kim 已提交
425 426 427 428 429 430
/*
 * If the page can not be invalidated, it is moved to the
 * inactive list to speed up its reclaim.  It is moved to the
 * head of the list, rather than the tail, to give the flusher
 * threads some time to write it out, as this is much more
 * effective than the single-page writeout from reclaim.
M
Minchan Kim 已提交
431 432 433 434 435 436 437 438 439 440 441 442 443 444
 *
 * If the page isn't page_mapped and dirty/writeback, the page
 * could reclaim asap using PG_reclaim.
 *
 * 1. active, mapped page -> none
 * 2. active, dirty/writeback page -> inactive, head, PG_reclaim
 * 3. inactive, mapped page -> none
 * 4. inactive, dirty/writeback page -> inactive, head, PG_reclaim
 * 5. inactive, clean -> inactive, tail
 * 6. Others -> none
 *
 * In 4, why it moves inactive's head, the VM expects the page would
 * be write it out by flusher threads as this is much more effective
 * than the single-page writeout from reclaim.
M
Minchan Kim 已提交
445
 */
S
Shaohua Li 已提交
446
static void lru_deactivate_fn(struct page *page, void *arg)
M
Minchan Kim 已提交
447 448
{
	int lru, file;
M
Minchan Kim 已提交
449
	bool active;
S
Shaohua Li 已提交
450
	struct zone *zone = page_zone(page);
M
Minchan Kim 已提交
451

M
Minchan Kim 已提交
452
	if (!PageLRU(page))
M
Minchan Kim 已提交
453 454
		return;

455 456 457
	if (PageUnevictable(page))
		return;

M
Minchan Kim 已提交
458 459 460 461
	/* Some processes are using the page */
	if (page_mapped(page))
		return;

M
Minchan Kim 已提交
462 463
	active = PageActive(page);

M
Minchan Kim 已提交
464 465
	file = page_is_file_cache(page);
	lru = page_lru_base_type(page);
M
Minchan Kim 已提交
466
	del_page_from_lru_list(zone, page, lru + active);
M
Minchan Kim 已提交
467 468 469 470
	ClearPageActive(page);
	ClearPageReferenced(page);
	add_page_to_lru_list(zone, page, lru);

M
Minchan Kim 已提交
471 472 473 474 475 476 477 478 479 480 481 482
	if (PageWriteback(page) || PageDirty(page)) {
		/*
		 * PG_reclaim could be raced with end_page_writeback
		 * It can make readahead confusing.  But race window
		 * is _really_ small and  it's non-critical problem.
		 */
		SetPageReclaim(page);
	} else {
		/*
		 * The page's writeback ends up during pagevec
		 * We moves tha page into tail of inactive.
		 */
483
		list_move_tail(&page->lru, &zone->lruvec.lists[lru]);
M
Minchan Kim 已提交
484 485 486 487 488 489
		mem_cgroup_rotate_reclaimable_page(page);
		__count_vm_event(PGROTATED);
	}

	if (active)
		__count_vm_event(PGDEACTIVATE);
M
Minchan Kim 已提交
490 491 492
	update_page_reclaim_stat(zone, page, file, 0);
}

493 494 495 496 497 498
/*
 * Drain pages out of the cpu's pagevecs.
 * Either "cpu" is the current CPU, and preemption has already been
 * disabled; or "cpu" is being hot-unplugged, and is already dead.
 */
static void drain_cpu_pagevecs(int cpu)
L
Linus Torvalds 已提交
499
{
500
	struct pagevec *pvecs = per_cpu(lru_add_pvecs, cpu);
501
	struct pagevec *pvec;
502
	int lru;
L
Linus Torvalds 已提交
503

504 505 506 507 508
	for_each_lru(lru) {
		pvec = &pvecs[lru - LRU_BASE];
		if (pagevec_count(pvec))
			____pagevec_lru_add(pvec, lru);
	}
509 510 511 512 513 514 515 516 517 518

	pvec = &per_cpu(lru_rotate_pvecs, cpu);
	if (pagevec_count(pvec)) {
		unsigned long flags;

		/* No harm done if a racing interrupt already did this */
		local_irq_save(flags);
		pagevec_move_tail(pvec);
		local_irq_restore(flags);
	}
M
Minchan Kim 已提交
519 520 521

	pvec = &per_cpu(lru_deactivate_pvecs, cpu);
	if (pagevec_count(pvec))
S
Shaohua Li 已提交
522
		pagevec_lru_move_fn(pvec, lru_deactivate_fn, NULL);
523 524

	activate_page_drain(cpu);
M
Minchan Kim 已提交
525 526 527 528 529 530 531 532 533 534 535 536
}

/**
 * deactivate_page - forcefully deactivate a page
 * @page: page to deactivate
 *
 * This function hints the VM that @page is a good reclaim candidate,
 * for example if its invalidation fails due to the page being dirty
 * or under writeback.
 */
void deactivate_page(struct page *page)
{
537 538 539 540 541 542 543
	/*
	 * In a workload with many unevictable page such as mprotect, unevictable
	 * page deactivation for accelerating reclaim is pointless.
	 */
	if (PageUnevictable(page))
		return;

M
Minchan Kim 已提交
544 545 546 547
	if (likely(get_page_unless_zero(page))) {
		struct pagevec *pvec = &get_cpu_var(lru_deactivate_pvecs);

		if (!pagevec_add(pvec, page))
S
Shaohua Li 已提交
548
			pagevec_lru_move_fn(pvec, lru_deactivate_fn, NULL);
M
Minchan Kim 已提交
549 550
		put_cpu_var(lru_deactivate_pvecs);
	}
551 552 553 554
}

void lru_add_drain(void)
{
555
	drain_cpu_pagevecs(get_cpu());
556
	put_cpu();
L
Linus Torvalds 已提交
557 558
}

D
David Howells 已提交
559
static void lru_add_drain_per_cpu(struct work_struct *dummy)
560 561 562 563 564 565 566 567 568
{
	lru_add_drain();
}

/*
 * Returns 0 for success
 */
int lru_add_drain_all(void)
{
D
David Howells 已提交
569
	return schedule_on_each_cpu(lru_add_drain_per_cpu);
570 571
}

L
Linus Torvalds 已提交
572 573 574 575 576 577 578 579
/*
 * Batched page_cache_release().  Decrement the reference count on all the
 * passed pages.  If it fell to zero then remove the page from the LRU and
 * free it.
 *
 * Avoid taking zone->lru_lock if possible, but if it is taken, retain it
 * for the remainder of the operation.
 *
580 581 582 583
 * The locking in this function is against shrink_inactive_list(): we recheck
 * the page count inside the lock to see whether shrink_inactive_list()
 * grabbed the page via the LRU.  If it did, give up: shrink_inactive_list()
 * will free it.
L
Linus Torvalds 已提交
584 585 586 587
 */
void release_pages(struct page **pages, int nr, int cold)
{
	int i;
588
	LIST_HEAD(pages_to_free);
L
Linus Torvalds 已提交
589
	struct zone *zone = NULL;
590
	unsigned long uninitialized_var(flags);
L
Linus Torvalds 已提交
591 592 593 594

	for (i = 0; i < nr; i++) {
		struct page *page = pages[i];

N
Nick Piggin 已提交
595 596
		if (unlikely(PageCompound(page))) {
			if (zone) {
597
				spin_unlock_irqrestore(&zone->lru_lock, flags);
N
Nick Piggin 已提交
598 599 600 601 602 603
				zone = NULL;
			}
			put_compound_page(page);
			continue;
		}

N
Nick Piggin 已提交
604
		if (!put_page_testzero(page))
L
Linus Torvalds 已提交
605 606
			continue;

607 608
		if (PageLRU(page)) {
			struct zone *pagezone = page_zone(page);
L
Lee Schermerhorn 已提交
609

610 611
			if (pagezone != zone) {
				if (zone)
612 613
					spin_unlock_irqrestore(&zone->lru_lock,
									flags);
614
				zone = pagezone;
615
				spin_lock_irqsave(&zone->lru_lock, flags);
616
			}
N
Nick Piggin 已提交
617
			VM_BUG_ON(!PageLRU(page));
N
Nick Piggin 已提交
618
			__ClearPageLRU(page);
L
Linus Torvalds 已提交
619
			del_page_from_lru(zone, page);
620 621
		}

622
		list_add(&page->lru, &pages_to_free);
L
Linus Torvalds 已提交
623 624
	}
	if (zone)
625
		spin_unlock_irqrestore(&zone->lru_lock, flags);
L
Linus Torvalds 已提交
626

627
	free_hot_cold_page_list(&pages_to_free, cold);
L
Linus Torvalds 已提交
628
}
M
Miklos Szeredi 已提交
629
EXPORT_SYMBOL(release_pages);
L
Linus Torvalds 已提交
630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647

/*
 * The pages which we're about to release may be in the deferred lru-addition
 * queues.  That would prevent them from really being freed right now.  That's
 * OK from a correctness point of view but is inefficient - those pages may be
 * cache-warm and we want to give them back to the page allocator ASAP.
 *
 * So __pagevec_release() will drain those queues here.  __pagevec_lru_add()
 * and __pagevec_lru_add_active() call release_pages() directly to avoid
 * mutual recursion.
 */
void __pagevec_release(struct pagevec *pvec)
{
	lru_add_drain();
	release_pages(pvec->pages, pagevec_count(pvec), pvec->cold);
	pagevec_reinit(pvec);
}

648 649
EXPORT_SYMBOL(__pagevec_release);

650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675
/* used by __split_huge_page_refcount() */
void lru_add_page_tail(struct zone* zone,
		       struct page *page, struct page *page_tail)
{
	int active;
	enum lru_list lru;
	const int file = 0;

	VM_BUG_ON(!PageHead(page));
	VM_BUG_ON(PageCompound(page_tail));
	VM_BUG_ON(PageLRU(page_tail));
	VM_BUG_ON(!spin_is_locked(&zone->lru_lock));

	SetPageLRU(page_tail);

	if (page_evictable(page_tail, NULL)) {
		if (PageActive(page)) {
			SetPageActive(page_tail);
			active = 1;
			lru = LRU_ACTIVE_ANON;
		} else {
			active = 0;
			lru = LRU_INACTIVE_ANON;
		}
		update_page_reclaim_stat(zone, page_tail, file, active);
		if (likely(PageLRU(page)))
676 677
			__add_page_to_lru_list(zone, page_tail, lru,
					       page->lru.prev);
678
		else
679
			add_page_to_lru_list(zone, page_tail, lru);
680 681 682 683 684 685
	} else {
		SetPageUnevictable(page_tail);
		add_page_to_lru_list(zone, page_tail, LRU_UNEVICTABLE);
	}
}

S
Shaohua Li 已提交
686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703
static void ____pagevec_lru_add_fn(struct page *page, void *arg)
{
	enum lru_list lru = (enum lru_list)arg;
	struct zone *zone = page_zone(page);
	int file = is_file_lru(lru);
	int active = is_active_lru(lru);

	VM_BUG_ON(PageActive(page));
	VM_BUG_ON(PageUnevictable(page));
	VM_BUG_ON(PageLRU(page));

	SetPageLRU(page);
	if (active)
		SetPageActive(page);
	update_page_reclaim_stat(zone, page, file, active);
	add_page_to_lru_list(zone, page, lru);
}

L
Linus Torvalds 已提交
704 705 706 707
/*
 * Add the passed pages to the LRU, then drop the caller's refcount
 * on them.  Reinitialises the caller's pagevec.
 */
708
void ____pagevec_lru_add(struct pagevec *pvec, enum lru_list lru)
L
Linus Torvalds 已提交
709
{
L
Lee Schermerhorn 已提交
710
	VM_BUG_ON(is_unevictable_lru(lru));
L
Linus Torvalds 已提交
711

S
Shaohua Li 已提交
712
	pagevec_lru_move_fn(pvec, ____pagevec_lru_add_fn, (void *)lru);
L
Linus Torvalds 已提交
713 714
}

715
EXPORT_SYMBOL(____pagevec_lru_add);
L
Linus Torvalds 已提交
716 717 718 719 720 721 722 723 724 725 726

/*
 * Try to drop buffers from the pages in a pagevec
 */
void pagevec_strip(struct pagevec *pvec)
{
	int i;

	for (i = 0; i < pagevec_count(pvec); i++) {
		struct page *page = pvec->pages[i];

727 728
		if (page_has_private(page) && trylock_page(page)) {
			if (page_has_private(page))
729
				try_to_release_page(page, 0);
L
Linus Torvalds 已提交
730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757
			unlock_page(page);
		}
	}
}

/**
 * pagevec_lookup - gang pagecache lookup
 * @pvec:	Where the resulting pages are placed
 * @mapping:	The address_space to search
 * @start:	The starting page index
 * @nr_pages:	The maximum number of pages
 *
 * pagevec_lookup() will search for and return a group of up to @nr_pages pages
 * in the mapping.  The pages are placed in @pvec.  pagevec_lookup() takes a
 * reference against the pages in @pvec.
 *
 * The search returns a group of mapping-contiguous pages with ascending
 * indexes.  There may be holes in the indices due to not-present pages.
 *
 * pagevec_lookup() returns the number of pages which were found.
 */
unsigned pagevec_lookup(struct pagevec *pvec, struct address_space *mapping,
		pgoff_t start, unsigned nr_pages)
{
	pvec->nr = find_get_pages(mapping, start, nr_pages, pvec->pages);
	return pagevec_count(pvec);
}

758 759
EXPORT_SYMBOL(pagevec_lookup);

L
Linus Torvalds 已提交
760 761 762 763 764 765 766 767
unsigned pagevec_lookup_tag(struct pagevec *pvec, struct address_space *mapping,
		pgoff_t *index, int tag, unsigned nr_pages)
{
	pvec->nr = find_get_pages_tag(mapping, index, tag,
					nr_pages, pvec->pages);
	return pagevec_count(pvec);
}

768
EXPORT_SYMBOL(pagevec_lookup_tag);
L
Linus Torvalds 已提交
769 770 771 772 773 774

/*
 * Perform any setup for the swap system
 */
void __init swap_setup(void)
{
775
	unsigned long megs = totalram_pages >> (20 - PAGE_SHIFT);
L
Linus Torvalds 已提交
776

P
Peter Zijlstra 已提交
777 778 779 780
#ifdef CONFIG_SWAP
	bdi_init(swapper_space.backing_dev_info);
#endif

L
Linus Torvalds 已提交
781 782 783 784 785 786 787 788 789 790
	/* Use a smaller cluster for small-memory machines */
	if (megs < 16)
		page_cluster = 2;
	else
		page_cluster = 3;
	/*
	 * Right now other parts of the system means that we
	 * _really_ don't want to cluster much more
	 */
}