[linux-2.6-block.git] / mm / swap.c

/*
 *  linux/mm/swap.c
 *
 *  Copyright (C) 1991, 1992, 1993, 1994  Linus Torvalds
 */

/*
 * This file contains the default values for the operation of the
 * 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>
#include <linux/module.h>
#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>
#include <linux/backing-dev.h>
#include <linux/memcontrol.h>

/* How many pages do we try to swap or page in/out together? */
int page_cluster;

static DEFINE_PER_CPU(struct pagevec, lru_add_pvecs) = { 0, };
static DEFINE_PER_CPU(struct pagevec, lru_add_active_pvecs) = { 0, };
static DEFINE_PER_CPU(struct pagevec, lru_rotate_pvecs) = { 0, };

/*
 * This path almost never happens for VM activity - pages are normally
 * freed via pagevecs.  But it gets used by networking.
 */
static void __page_cache_release(struct page *page)
{
	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);
	}
	free_hot_page(page);
}

static void put_compound_page(struct page *page)
{
	page = compound_head(page);
	if (put_page_testzero(page)) {
		compound_page_dtor *dtor;

		dtor = get_compound_page_dtor(page);
		(*dtor)(page);
	}
}

void put_page(struct page *page)
{
	if (unlikely(PageCompound(page)))
		put_compound_page(page);
	else if (put_page_testzero(page))
		__page_cache_release(page);
}
EXPORT_SYMBOL(put_page);

/**
 * put_pages_list() - release a list of pages
 * @pages: list of pages threaded on page->lru
 *
 * 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);

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

	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)
				spin_unlock(&zone->lru_lock);
			zone = pagezone;
			spin_lock(&zone->lru_lock);
		}
		if (PageLRU(page) && !PageActive(page)) {
			list_move_tail(&page->lru, &zone->inactive_list);
			pgmoved++;
		}
	}
	if (zone)
		spin_unlock(&zone->lru_lock);
	__count_vm_events(PGROTATED, pgmoved);
	release_pages(pvec->pages, pvec->nr, pvec->cold);
	pagevec_reinit(pvec);
}

/*
 * 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
 * inactive list.
 */
void  rotate_reclaimable_page(struct page *page)
{
	if (!PageLocked(page) && !PageDirty(page) && !PageActive(page) &&
	    PageLRU(page)) {
		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);
	}
}

/*
 * FIXME: speed this up?
 */
void activate_page(struct page *page)
{
	struct zone *zone = page_zone(page);

	spin_lock_irq(&zone->lru_lock);
	if (PageLRU(page) && !PageActive(page)) {
		del_page_from_inactive_list(zone, page);
		SetPageActive(page);
		add_page_to_active_list(zone, page);
		__count_vm_event(PGACTIVATE);
		mem_cgroup_move_lists(page, true);
	}
	spin_unlock_irq(&zone->lru_lock);
}

/*
 * Mark a page as having seen activity.
 *
 * inactive,unreferenced	->	inactive,referenced
 * inactive,referenced		->	active,unreferenced
 * active,unreferenced		->	active,referenced
 */
void mark_page_accessed(struct page *page)
{
	if (!PageActive(page) && PageReferenced(page) && PageLRU(page)) {
		activate_page(page);
		ClearPageReferenced(page);
	} else if (!PageReferenced(page)) {
		SetPageReferenced(page);
	}
}

EXPORT_SYMBOL(mark_page_accessed);

/**
 * lru_cache_add: add a page to the page lists
 * @page: the page to add
 */
void lru_cache_add(struct page *page)
{
	struct pagevec *pvec = &get_cpu_var(lru_add_pvecs);

	page_cache_get(page);
	if (!pagevec_add(pvec, page))
		__pagevec_lru_add(pvec);
	put_cpu_var(lru_add_pvecs);
}

void lru_cache_add_active(struct page *page)
{
	struct pagevec *pvec = &get_cpu_var(lru_add_active_pvecs);

	page_cache_get(page);
	if (!pagevec_add(pvec, page))
		__pagevec_lru_add_active(pvec);
	put_cpu_var(lru_add_active_pvecs);
}

/*
 * 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)
{
	struct pagevec *pvec;

	pvec = &per_cpu(lru_add_pvecs, cpu);
	if (pagevec_count(pvec))
		__pagevec_lru_add(pvec);

	pvec = &per_cpu(lru_add_active_pvecs, cpu);
	if (pagevec_count(pvec))
		__pagevec_lru_add_active(pvec);

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

void lru_add_drain(void)
{
	drain_cpu_pagevecs(get_cpu());
	put_cpu();
}

#ifdef CONFIG_NUMA
static void lru_add_drain_per_cpu(struct work_struct *dummy)
{
	lru_add_drain();
}

/*
 * Returns 0 for success
 */
int lru_add_drain_all(void)
{
	return schedule_on_each_cpu(lru_add_drain_per_cpu);
}

#else

/*
 * Returns 0 for success
 */
int lru_add_drain_all(void)
{
	lru_add_drain();
	return 0;
}
#endif

/*
 * 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.
 *
 * The locking in this function is against shrink_cache(): we recheck the
 * page count inside the lock to see whether shrink_cache grabbed the page
 * via the LRU.  If it did, give up: shrink_cache will free it.
 */
void release_pages(struct page **pages, int nr, int cold)
{
	int i;
	struct pagevec pages_to_free;
	struct zone *zone = NULL;
	unsigned long uninitialized_var(flags);

	pagevec_init(&pages_to_free, cold);
	for (i = 0; i < nr; i++) {
		struct page *page = pages[i];

		if (unlikely(PageCompound(page))) {
			if (zone) {
				spin_unlock_irqrestore(&zone->lru_lock, flags);
				zone = NULL;
			}
			put_compound_page(page);
			continue;
		}

		if (!put_page_testzero(page))
			continue;

		if (PageLRU(page)) {
			struct zone *pagezone = page_zone(page);
			if (pagezone != zone) {
				if (zone)
					spin_unlock_irqrestore(&zone->lru_lock,
									flags);
				zone = pagezone;
				spin_lock_irqsave(&zone->lru_lock, flags);
			}
			VM_BUG_ON(!PageLRU(page));
			__ClearPageLRU(page);
			del_page_from_lru(zone, page);
		}

		if (!pagevec_add(&pages_to_free, page)) {
			if (zone) {
				spin_unlock_irqrestore(&zone->lru_lock, flags);
				zone = NULL;
			}
			__pagevec_free(&pages_to_free);
			pagevec_reinit(&pages_to_free);
  		}
	}
	if (zone)
		spin_unlock_irqrestore(&zone->lru_lock, flags);

	pagevec_free(&pages_to_free);
}

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

EXPORT_SYMBOL(__pagevec_release);

/*
 * pagevec_release() for pages which are known to not be on the LRU
 *
 * This function reinitialises the caller's pagevec.
 */
void __pagevec_release_nonlru(struct pagevec *pvec)
{
	int i;
	struct pagevec pages_to_free;

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

		VM_BUG_ON(PageLRU(page));
		if (put_page_testzero(page))
			pagevec_add(&pages_to_free, page);
	}
	pagevec_free(&pages_to_free);
	pagevec_reinit(pvec);
}

/*
 * Add the passed pages to the LRU, then drop the caller's refcount
 * on them.  Reinitialises the caller's pagevec.
 */
void __pagevec_lru_add(struct pagevec *pvec)
{
	int i;
	struct zone *zone = NULL;

	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)
				spin_unlock_irq(&zone->lru_lock);
			zone = pagezone;
			spin_lock_irq(&zone->lru_lock);
		}
		VM_BUG_ON(PageLRU(page));
		SetPageLRU(page);
		add_page_to_inactive_list(zone, page);
	}
	if (zone)
		spin_unlock_irq(&zone->lru_lock);
	release_pages(pvec->pages, pvec->nr, pvec->cold);
	pagevec_reinit(pvec);
}

EXPORT_SYMBOL(__pagevec_lru_add);

void __pagevec_lru_add_active(struct pagevec *pvec)
{
	int i;
	struct zone *zone = NULL;

	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)
				spin_unlock_irq(&zone->lru_lock);
			zone = pagezone;
			spin_lock_irq(&zone->lru_lock);
		}
		VM_BUG_ON(PageLRU(page));
		SetPageLRU(page);
		VM_BUG_ON(PageActive(page));
		SetPageActive(page);
		add_page_to_active_list(zone, page);
	}
	if (zone)
		spin_unlock_irq(&zone->lru_lock);
	release_pages(pvec->pages, pvec->nr, pvec->cold);
	pagevec_reinit(pvec);
}

/*
 * 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];

		if (PagePrivate(page) && !TestSetPageLocked(page)) {
			if (PagePrivate(page))
				try_to_release_page(page, 0);
			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);
}

EXPORT_SYMBOL(pagevec_lookup);

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

EXPORT_SYMBOL(pagevec_lookup_tag);

#ifdef CONFIG_SMP
/*
 * We tolerate a little inaccuracy to avoid ping-ponging the counter between
 * CPUs
 */
#define ACCT_THRESHOLD	max(16, NR_CPUS * 2)

static DEFINE_PER_CPU(long, committed_space) = 0;

void vm_acct_memory(long pages)
{
	long *local;

	preempt_disable();
	local = &__get_cpu_var(committed_space);
	*local += pages;
	if (*local > ACCT_THRESHOLD || *local < -ACCT_THRESHOLD) {
		atomic_long_add(*local, &vm_committed_space);
		*local = 0;
	}
	preempt_enable();
}

#ifdef CONFIG_HOTPLUG_CPU

/* Drop the CPU's cached committed space back into the central pool. */
static int cpu_swap_callback(struct notifier_block *nfb,
			     unsigned long action,
			     void *hcpu)
{
	long *committed;

	committed = &per_cpu(committed_space, (long)hcpu);
	if (action == CPU_DEAD || action == CPU_DEAD_FROZEN) {
		atomic_long_add(*committed, &vm_committed_space);
		*committed = 0;
		drain_cpu_pagevecs((long)hcpu);
	}
	return NOTIFY_OK;
}
#endif /* CONFIG_HOTPLUG_CPU */
#endif /* CONFIG_SMP */

/*
 * Perform any setup for the swap system
 */
void __init swap_setup(void)
{
	unsigned long megs = num_physpages >> (20 - PAGE_SHIFT);

#ifdef CONFIG_SWAP
	bdi_init(swapper_space.backing_dev_info);
#endif

	/* 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
	 */
#ifdef CONFIG_HOTPLUG_CPU
	hotcpu_notifier(cpu_swap_callback, 0);
#endif
}
Commit	Line	Data
1da177e4 LT	1	/*
	2	* linux/mm/swap.c
	3	*
	4	* Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds
	5	*/
	6
	7	/*
183ff22b	8	* This file contains the default values for the operation of the
1da177e4 LT	9	* Linux VM subsystem. Fine-tuning documentation can be found in
	10	* Documentation/sysctl/vm.txt.
	11	* Started 18.12.91
	12	* Swap aging added 23.2.95, Stephen Tweedie.
	13	* Buffermem limits added 12.3.98, Rik van Riel.
	14	*/
	15
	16	#include <linux/mm.h>
	17	#include <linux/sched.h>
	18	#include <linux/kernel_stat.h>
	19	#include <linux/swap.h>
	20	#include <linux/mman.h>
	21	#include <linux/pagemap.h>
	22	#include <linux/pagevec.h>
	23	#include <linux/init.h>
	24	#include <linux/module.h>
	25	#include <linux/mm_inline.h>
	26	#include <linux/buffer_head.h> /* for try_to_release_page() */
1da177e4 LT	27	#include <linux/percpu_counter.h>
	28	#include <linux/percpu.h>
	29	#include <linux/cpu.h>
	30	#include <linux/notifier.h>
e0bf68dd	31	#include <linux/backing-dev.h>
66e1707b	32	#include <linux/memcontrol.h>
1da177e4 LT	33
	34	/* How many pages do we try to swap or page in/out together? */
	35	int page_cluster;
	36
902aaed0 HH	37	static DEFINE_PER_CPU(struct pagevec, lru_add_pvecs) = { 0, };
	38	static DEFINE_PER_CPU(struct pagevec, lru_add_active_pvecs) = { 0, };
	39	static DEFINE_PER_CPU(struct pagevec, lru_rotate_pvecs) = { 0, };
	40
b221385b AB	41	/*
	42	* This path almost never happens for VM activity - pages are normally
	43	* freed via pagevecs. But it gets used by networking.
	44	*/
920c7a5d	45	static void __page_cache_release(struct page *page)
b221385b AB	46	{
	47	if (PageLRU(page)) {
	48	unsigned long flags;
	49	struct zone *zone = page_zone(page);
	50
	51	spin_lock_irqsave(&zone->lru_lock, flags);
	52	VM_BUG_ON(!PageLRU(page));
	53	__ClearPageLRU(page);
	54	del_page_from_lru(zone, page);
	55	spin_unlock_irqrestore(&zone->lru_lock, flags);
	56	}
	57	free_hot_page(page);
	58	}
	59
8519fb30	60	static void put_compound_page(struct page *page)
1da177e4	61	{
d85f3385	62	page = compound_head(page);
8519fb30	63	if (put_page_testzero(page)) {
33f2ef89	64	compound_page_dtor *dtor;
1da177e4	65
33f2ef89	66	dtor = get_compound_page_dtor(page);
8519fb30	67	(*dtor)(page);
1da177e4	68	}
8519fb30 NP	69	}
	70
	71	void put_page(struct page *page)
	72	{
	73	if (unlikely(PageCompound(page)))
	74	put_compound_page(page);
	75	else if (put_page_testzero(page))
1da177e4 LT	76	__page_cache_release(page);
	77	}
	78	EXPORT_SYMBOL(put_page);
1da177e4	79
1d7ea732	80	/**
7682486b RD	81	* put_pages_list() - release a list of pages
7682486b RD	82	* @pages: list of pages threaded on page->lru
1d7ea732 AZ	83	*
	84	* Release a list of pages which are strung together on page.lru. Currently
	85	* used by read_cache_pages() and related error recovery code.
1d7ea732 AZ	86	*/
	87	void put_pages_list(struct list_head *pages)
	88	{
	89	while (!list_empty(pages)) {
	90	struct page *victim;
	91
	92	victim = list_entry(pages->prev, struct page, lru);
	93	list_del(&victim->lru);
	94	page_cache_release(victim);
	95	}
	96	}
	97	EXPORT_SYMBOL(put_pages_list);
	98
902aaed0 HH	99	/*
	100	* pagevec_move_tail() must be called with IRQ disabled.
	101	* Otherwise this may cause nasty races.
	102	*/
	103	static void pagevec_move_tail(struct pagevec *pvec)
	104	{
	105	int i;
	106	int pgmoved = 0;
	107	struct zone *zone = NULL;
	108
	109	for (i = 0; i < pagevec_count(pvec); i++) {
	110	struct page *page = pvec->pages[i];
	111	struct zone *pagezone = page_zone(page);
	112
	113	if (pagezone != zone) {
	114	if (zone)
	115	spin_unlock(&zone->lru_lock);
	116	zone = pagezone;
	117	spin_lock(&zone->lru_lock);
	118	}
	119	if (PageLRU(page) && !PageActive(page)) {
	120	list_move_tail(&page->lru, &zone->inactive_list);
	121	pgmoved++;
	122	}
	123	}
	124	if (zone)
	125	spin_unlock(&zone->lru_lock);
	126	__count_vm_events(PGROTATED, pgmoved);
	127	release_pages(pvec->pages, pvec->nr, pvec->cold);
	128	pagevec_reinit(pvec);
	129	}
	130
1da177e4 LT	131	/*
	132	* Writeback is about to end against a page which has been marked for immediate
	133	* reclaim. If it still appears to be reclaimable, move it to the tail of the
902aaed0	134	* inactive list.
1da177e4	135	*/
ac6aadb2	136	void rotate_reclaimable_page(struct page *page)
1da177e4	137	{
ac6aadb2 MS	138	if (!PageLocked(page) && !PageDirty(page) && !PageActive(page) &&
	139	PageLRU(page)) {
	140	struct pagevec *pvec;
	141	unsigned long flags;
	142
	143	page_cache_get(page);
	144	local_irq_save(flags);
	145	pvec = &__get_cpu_var(lru_rotate_pvecs);
	146	if (!pagevec_add(pvec, page))
	147	pagevec_move_tail(pvec);
	148	local_irq_restore(flags);
	149	}
1da177e4 LT	150	}
	151
	152	/*
	153	* FIXME: speed this up?
	154	*/
920c7a5d	155	void activate_page(struct page *page)
1da177e4 LT	156	{
	157	struct zone *zone = page_zone(page);
	158
	159	spin_lock_irq(&zone->lru_lock);
	160	if (PageLRU(page) && !PageActive(page)) {
	161	del_page_from_inactive_list(zone, page);
	162	SetPageActive(page);
	163	add_page_to_active_list(zone, page);
f8891e5e	164	__count_vm_event(PGACTIVATE);
427d5416	165	mem_cgroup_move_lists(page, true);
1da177e4 LT	166	}
	167	spin_unlock_irq(&zone->lru_lock);
	168	}
	169
	170	/*
	171	* Mark a page as having seen activity.
	172	*
	173	* inactive,unreferenced -> inactive,referenced
	174	* inactive,referenced -> active,unreferenced
	175	* active,unreferenced -> active,referenced
	176	*/
920c7a5d	177	void mark_page_accessed(struct page *page)
1da177e4 LT	178	{
	179	if (!PageActive(page) && PageReferenced(page) && PageLRU(page)) {
	180	activate_page(page);
	181	ClearPageReferenced(page);
	182	} else if (!PageReferenced(page)) {
	183	SetPageReferenced(page);
	184	}
	185	}
	186
	187	EXPORT_SYMBOL(mark_page_accessed);
	188
	189	/**
	190	* lru_cache_add: add a page to the page lists
	191	* @page: the page to add
	192	*/
920c7a5d	193	void lru_cache_add(struct page *page)
1da177e4 LT	194	{
	195	struct pagevec *pvec = &get_cpu_var(lru_add_pvecs);
	196
	197	page_cache_get(page);
	198	if (!pagevec_add(pvec, page))
	199	__pagevec_lru_add(pvec);
	200	put_cpu_var(lru_add_pvecs);
	201	}
	202
920c7a5d	203	void lru_cache_add_active(struct page *page)
1da177e4 LT	204	{
	205	struct pagevec *pvec = &get_cpu_var(lru_add_active_pvecs);
	206
	207	page_cache_get(page);
	208	if (!pagevec_add(pvec, page))
	209	__pagevec_lru_add_active(pvec);
	210	put_cpu_var(lru_add_active_pvecs);
	211	}
	212
902aaed0 HH	213	/*
	214	* Drain pages out of the cpu's pagevecs.
	215	* Either "cpu" is the current CPU, and preemption has already been
	216	* disabled; or "cpu" is being hot-unplugged, and is already dead.
	217	*/
	218	static void drain_cpu_pagevecs(int cpu)
1da177e4	219	{
902aaed0	220	struct pagevec *pvec;
1da177e4	221
902aaed0	222	pvec = &per_cpu(lru_add_pvecs, cpu);
1da177e4 LT	223	if (pagevec_count(pvec))
1da177e4 LT	224	__pagevec_lru_add(pvec);
902aaed0	225
80bfed90	226	pvec = &per_cpu(lru_add_active_pvecs, cpu);
1da177e4 LT	227	if (pagevec_count(pvec))
1da177e4 LT	228	__pagevec_lru_add_active(pvec);
902aaed0 HH	229
	230	pvec = &per_cpu(lru_rotate_pvecs, cpu);
	231	if (pagevec_count(pvec)) {
	232	unsigned long flags;
	233
	234	/* No harm done if a racing interrupt already did this */
	235	local_irq_save(flags);
	236	pagevec_move_tail(pvec);
	237	local_irq_restore(flags);
	238	}
80bfed90 AM	239	}
	240
	241	void lru_add_drain(void)
	242	{
902aaed0	243	drain_cpu_pagevecs(get_cpu());
80bfed90	244	put_cpu();
1da177e4 LT	245	}
1da177e4 LT	246
053837fc	247	#ifdef CONFIG_NUMA
c4028958	248	static void lru_add_drain_per_cpu(struct work_struct *dummy)
053837fc NP	249	{
	250	lru_add_drain();
	251	}
	252
	253	/*
	254	* Returns 0 for success
	255	*/
	256	int lru_add_drain_all(void)
	257	{
c4028958	258	return schedule_on_each_cpu(lru_add_drain_per_cpu);
053837fc NP	259	}
	260
	261	#else
	262
	263	/*
	264	* Returns 0 for success
	265	*/
	266	int lru_add_drain_all(void)
	267	{
	268	lru_add_drain();
	269	return 0;
	270	}
	271	#endif
	272
1da177e4 LT	273	/*
	274	* Batched page_cache_release(). Decrement the reference count on all the
	275	* passed pages. If it fell to zero then remove the page from the LRU and
	276	* free it.
	277	*
	278	* Avoid taking zone->lru_lock if possible, but if it is taken, retain it
	279	* for the remainder of the operation.
	280	*
	281	* The locking in this function is against shrink_cache(): we recheck the
	282	* page count inside the lock to see whether shrink_cache grabbed the page
	283	* via the LRU. If it did, give up: shrink_cache will free it.
	284	*/
	285	void release_pages(struct page **pages, int nr, int cold)
	286	{
	287	int i;
	288	struct pagevec pages_to_free;
	289	struct zone *zone = NULL;
902aaed0	290	unsigned long uninitialized_var(flags);
1da177e4 LT	291
	292	pagevec_init(&pages_to_free, cold);
	293	for (i = 0; i < nr; i++) {
	294	struct page *page = pages[i];
1da177e4	295
8519fb30 NP	296	if (unlikely(PageCompound(page))) {
8519fb30 NP	297	if (zone) {
902aaed0	298	spin_unlock_irqrestore(&zone->lru_lock, flags);
8519fb30 NP	299	zone = NULL;
	300	}
	301	put_compound_page(page);
	302	continue;
	303	}
	304
b5810039	305	if (!put_page_testzero(page))
1da177e4 LT	306	continue;
1da177e4 LT	307
46453a6e NP	308	if (PageLRU(page)) {
	309	struct zone *pagezone = page_zone(page);
	310	if (pagezone != zone) {
	311	if (zone)
902aaed0 HH	312	spin_unlock_irqrestore(&zone->lru_lock,
902aaed0 HH	313	flags);
46453a6e	314	zone = pagezone;
902aaed0	315	spin_lock_irqsave(&zone->lru_lock, flags);
46453a6e	316	}
725d704e	317	VM_BUG_ON(!PageLRU(page));
67453911	318	__ClearPageLRU(page);
1da177e4	319	del_page_from_lru(zone, page);
46453a6e NP	320	}
	321
	322	if (!pagevec_add(&pages_to_free, page)) {
	323	if (zone) {
902aaed0	324	spin_unlock_irqrestore(&zone->lru_lock, flags);
46453a6e	325	zone = NULL;
1da177e4	326	}
46453a6e NP	327	__pagevec_free(&pages_to_free);
	328	pagevec_reinit(&pages_to_free);
	329	}
1da177e4 LT	330	}
1da177e4 LT	331	if (zone)
902aaed0	332	spin_unlock_irqrestore(&zone->lru_lock, flags);
1da177e4 LT	333
	334	pagevec_free(&pages_to_free);
	335	}
	336
	337	/*
	338	* The pages which we're about to release may be in the deferred lru-addition
	339	* queues. That would prevent them from really being freed right now. That's
	340	* OK from a correctness point of view but is inefficient - those pages may be
	341	* cache-warm and we want to give them back to the page allocator ASAP.
	342	*
	343	* So __pagevec_release() will drain those queues here. __pagevec_lru_add()
	344	* and __pagevec_lru_add_active() call release_pages() directly to avoid
	345	* mutual recursion.
	346	*/
	347	void __pagevec_release(struct pagevec *pvec)
	348	{
	349	lru_add_drain();
	350	release_pages(pvec->pages, pagevec_count(pvec), pvec->cold);
	351	pagevec_reinit(pvec);
	352	}
	353
7f285701 SF	354	EXPORT_SYMBOL(__pagevec_release);
7f285701 SF	355
1da177e4 LT	356	/*
	357	* pagevec_release() for pages which are known to not be on the LRU
	358	*
	359	* This function reinitialises the caller's pagevec.
	360	*/
	361	void __pagevec_release_nonlru(struct pagevec *pvec)
	362	{
	363	int i;
	364	struct pagevec pages_to_free;
	365
	366	pagevec_init(&pages_to_free, pvec->cold);
1da177e4 LT	367	for (i = 0; i < pagevec_count(pvec); i++) {
	368	struct page *page = pvec->pages[i];
	369
725d704e	370	VM_BUG_ON(PageLRU(page));
1da177e4 LT	371	if (put_page_testzero(page))
	372	pagevec_add(&pages_to_free, page);
	373	}
	374	pagevec_free(&pages_to_free);
	375	pagevec_reinit(pvec);
	376	}
	377
	378	/*
	379	* Add the passed pages to the LRU, then drop the caller's refcount
	380	* on them. Reinitialises the caller's pagevec.
	381	*/
	382	void __pagevec_lru_add(struct pagevec *pvec)
	383	{
	384	int i;
	385	struct zone *zone = NULL;
	386
	387	for (i = 0; i < pagevec_count(pvec); i++) {
	388	struct page *page = pvec->pages[i];
	389	struct zone *pagezone = page_zone(page);
	390
	391	if (pagezone != zone) {
	392	if (zone)
	393	spin_unlock_irq(&zone->lru_lock);
	394	zone = pagezone;
	395	spin_lock_irq(&zone->lru_lock);
	396	}
725d704e	397	VM_BUG_ON(PageLRU(page));
8d438f96	398	SetPageLRU(page);
1da177e4 LT	399	add_page_to_inactive_list(zone, page);
	400	}
	401	if (zone)
	402	spin_unlock_irq(&zone->lru_lock);
	403	release_pages(pvec->pages, pvec->nr, pvec->cold);
	404	pagevec_reinit(pvec);
	405	}
	406
	407	EXPORT_SYMBOL(__pagevec_lru_add);
	408
	409	void __pagevec_lru_add_active(struct pagevec *pvec)
	410	{
	411	int i;
	412	struct zone *zone = NULL;
	413
	414	for (i = 0; i < pagevec_count(pvec); i++) {
	415	struct page *page = pvec->pages[i];
	416	struct zone *pagezone = page_zone(page);
	417
	418	if (pagezone != zone) {
	419	if (zone)
	420	spin_unlock_irq(&zone->lru_lock);
	421	zone = pagezone;
	422	spin_lock_irq(&zone->lru_lock);
	423	}
725d704e	424	VM_BUG_ON(PageLRU(page));
8d438f96	425	SetPageLRU(page);
725d704e	426	VM_BUG_ON(PageActive(page));
4c84cacf	427	SetPageActive(page);
1da177e4 LT	428	add_page_to_active_list(zone, page);
	429	}
	430	if (zone)
	431	spin_unlock_irq(&zone->lru_lock);
	432	release_pages(pvec->pages, pvec->nr, pvec->cold);
	433	pagevec_reinit(pvec);
	434	}
	435
	436	/*
	437	* Try to drop buffers from the pages in a pagevec
	438	*/
	439	void pagevec_strip(struct pagevec *pvec)
	440	{
	441	int i;
	442
	443	for (i = 0; i < pagevec_count(pvec); i++) {
	444	struct page *page = pvec->pages[i];
	445
	446	if (PagePrivate(page) && !TestSetPageLocked(page)) {
5b40dc78 CL	447	if (PagePrivate(page))
5b40dc78 CL	448	try_to_release_page(page, 0);
1da177e4 LT	449	unlock_page(page);
	450	}
	451	}
	452	}
	453
	454	/**
	455	* pagevec_lookup - gang pagecache lookup
	456	* @pvec: Where the resulting pages are placed
	457	* @mapping: The address_space to search
	458	* @start: The starting page index
	459	* @nr_pages: The maximum number of pages
	460	*
	461	* pagevec_lookup() will search for and return a group of up to @nr_pages pages
	462	* in the mapping. The pages are placed in @pvec. pagevec_lookup() takes a
	463	* reference against the pages in @pvec.
	464	*
	465	* The search returns a group of mapping-contiguous pages with ascending
	466	* indexes. There may be holes in the indices due to not-present pages.
	467	*
	468	* pagevec_lookup() returns the number of pages which were found.
	469	*/
	470	unsigned pagevec_lookup(struct pagevec pvec, struct address_space mapping,
	471	pgoff_t start, unsigned nr_pages)
	472	{
	473	pvec->nr = find_get_pages(mapping, start, nr_pages, pvec->pages);
	474	return pagevec_count(pvec);
	475	}
	476
78539fdf CH	477	EXPORT_SYMBOL(pagevec_lookup);
78539fdf CH	478
1da177e4 LT	479	unsigned pagevec_lookup_tag(struct pagevec pvec, struct address_space mapping,
	480	pgoff_t *index, int tag, unsigned nr_pages)
	481	{
	482	pvec->nr = find_get_pages_tag(mapping, index, tag,
	483	nr_pages, pvec->pages);
	484	return pagevec_count(pvec);
	485	}
	486
7f285701	487	EXPORT_SYMBOL(pagevec_lookup_tag);
1da177e4 LT	488
	489	#ifdef CONFIG_SMP
	490	/*
	491	* We tolerate a little inaccuracy to avoid ping-ponging the counter between
	492	* CPUs
	493	*/
	494	#define ACCT_THRESHOLD max(16, NR_CPUS * 2)
	495
	496	static DEFINE_PER_CPU(long, committed_space) = 0;
	497
	498	void vm_acct_memory(long pages)
	499	{
	500	long *local;
	501
	502	preempt_disable();
	503	local = &__get_cpu_var(committed_space);
	504	*local += pages;
	505	if (local > ACCT_THRESHOLD \|\| local < -ACCT_THRESHOLD) {
80119ef5	506	atomic_long_add(*local, &vm_committed_space);
1da177e4 LT	507	*local = 0;
	508	}
	509	preempt_enable();
	510	}
1da177e4 LT	511
1da177e4 LT	512	#ifdef CONFIG_HOTPLUG_CPU
1da177e4 LT	513
	514	/* Drop the CPU's cached committed space back into the central pool. */
	515	static int cpu_swap_callback(struct notifier_block *nfb,
	516	unsigned long action,
	517	void *hcpu)
	518	{
	519	long *committed;
	520
	521	committed = &per_cpu(committed_space, (long)hcpu);
8bb78442	522	if (action == CPU_DEAD \|\| action == CPU_DEAD_FROZEN) {
80119ef5	523	atomic_long_add(*committed, &vm_committed_space);
1da177e4	524	*committed = 0;
902aaed0	525	drain_cpu_pagevecs((long)hcpu);
1da177e4 LT	526	}
	527	return NOTIFY_OK;
	528	}
	529	#endif /* CONFIG_HOTPLUG_CPU */
	530	#endif /* CONFIG_SMP */
	531
1da177e4 LT	532	/*
	533	* Perform any setup for the swap system
	534	*/
	535	void __init swap_setup(void)
	536	{
	537	unsigned long megs = num_physpages >> (20 - PAGE_SHIFT);
	538
e0bf68dd PZ	539	#ifdef CONFIG_SWAP
	540	bdi_init(swapper_space.backing_dev_info);
	541	#endif
	542
1da177e4 LT	543	/* Use a smaller cluster for small-memory machines */
	544	if (megs < 16)
	545	page_cluster = 2;
	546	else
	547	page_cluster = 3;
	548	/*
	549	* Right now other parts of the system means that we
	550	* _really_ don't want to cluster much more
	551	*/
02316067	552	#ifdef CONFIG_HOTPLUG_CPU
1da177e4	553	hotcpu_notifier(cpu_swap_callback, 0);
02316067	554	#endif
1da177e4	555	}