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

/*
 * mm/thrash.c
 *
 * Copyright (C) 2004, Red Hat, Inc.
 * Copyright (C) 2004, Rik van Riel <riel@redhat.com>
 * Released under the GPL, see the file COPYING for details.
 *
 * Simple token based thrashing protection, using the algorithm
 * described in:  http://www.cs.wm.edu/~sjiang/token.pdf
 *
 * Sep 2006, Ashwin Chaugule <ashwin.chaugule@celunite.com>
 * Improved algorithm to pass token:
 * Each task has a priority which is incremented if it contended
 * for the token in an interval less than its previous attempt.
 * If the token is acquired, that task's priority is boosted to prevent
 * the token from bouncing around too often and to let the task make
 * some progress in its execution.
 */

#include <linux/jiffies.h>
#include <linux/mm.h>
#include <linux/sched.h>
#include <linux/swap.h>

static DEFINE_SPINLOCK(swap_token_lock);
struct mm_struct *swap_token_mm;
unsigned int global_faults;

void grab_swap_token(void)
{
	int current_interval;

	global_faults++;

	current_interval = global_faults - current->mm->faultstamp;

	if (!spin_trylock(&swap_token_lock))
		return;

	/* First come first served */
	if (swap_token_mm == NULL) {
		current->mm->token_priority = current->mm->token_priority + 2;
		swap_token_mm = current->mm;
		goto out;
	}

	if (current->mm != swap_token_mm) {
		if (current_interval < current->mm->last_interval)
			current->mm->token_priority++;
		else {
			current->mm->token_priority--;
			if (unlikely(current->mm->token_priority < 0))
				current->mm->token_priority = 0;
		}
		/* Check if we deserve the token */
		if (current->mm->token_priority >
				swap_token_mm->token_priority) {
			current->mm->token_priority += 2;
			swap_token_mm = current->mm;
		}
	} else {
		/* Token holder came in again! */
		current->mm->token_priority += 2;
	}

out:
	current->mm->faultstamp = global_faults;
	current->mm->last_interval = current_interval;
	spin_unlock(&swap_token_lock);
return;
}

/* Called on process exit. */
void __put_swap_token(struct mm_struct *mm)
{
	spin_lock(&swap_token_lock);
	if (likely(mm == swap_token_mm))
		swap_token_mm = NULL;
	spin_unlock(&swap_token_lock);
}
Commit	Line	Data
1da177e4 LT	1	/*
	2	* mm/thrash.c
	3	*
	4	* Copyright (C) 2004, Red Hat, Inc.
	5	* Copyright (C) 2004, Rik van Riel <riel@redhat.com>
	6	* Released under the GPL, see the file COPYING for details.
	7	*
	8	* Simple token based thrashing protection, using the algorithm
	9	* described in: http://www.cs.wm.edu/~sjiang/token.pdf
7602bdf2 AC	10	*
	11	* Sep 2006, Ashwin Chaugule <ashwin.chaugule@celunite.com>
	12	* Improved algorithm to pass token:
	13	* Each task has a priority which is incremented if it contended
	14	* for the token in an interval less than its previous attempt.
	15	* If the token is acquired, that task's priority is boosted to prevent
	16	* the token from bouncing around too often and to let the task make
	17	* some progress in its execution.
1da177e4	18	*/
7602bdf2	19
1da177e4 LT	20	#include <linux/jiffies.h>
	21	#include <linux/mm.h>
	22	#include <linux/sched.h>
	23	#include <linux/swap.h>
	24
	25	static DEFINE_SPINLOCK(swap_token_lock);
7602bdf2 AC	26	struct mm_struct *swap_token_mm;
7602bdf2 AC	27	unsigned int global_faults;
1da177e4	28
1da177e4 LT	29	void grab_swap_token(void)
1da177e4 LT	30	{
7602bdf2	31	int current_interval;
1da177e4	32
7602bdf2	33	global_faults++;
1da177e4	34
7602bdf2	35	current_interval = global_faults - current->mm->faultstamp;
1da177e4	36
7602bdf2 AC	37	if (!spin_trylock(&swap_token_lock))
7602bdf2 AC	38	return;
1da177e4	39
7602bdf2 AC	40	/* First come first served */
	41	if (swap_token_mm == NULL) {
	42	current->mm->token_priority = current->mm->token_priority + 2;
	43	swap_token_mm = current->mm;
	44	goto out;
	45	}
1da177e4	46
7602bdf2 AC	47	if (current->mm != swap_token_mm) {
	48	if (current_interval < current->mm->last_interval)
	49	current->mm->token_priority++;
	50	else {
	51	current->mm->token_priority--;
	52	if (unlikely(current->mm->token_priority < 0))
	53	current->mm->token_priority = 0;
	54	}
	55	/* Check if we deserve the token */
	56	if (current->mm->token_priority >
	57	swap_token_mm->token_priority) {
	58	current->mm->token_priority += 2;
1da177e4 LT	59	swap_token_mm = current->mm;
1da177e4 LT	60	}
7602bdf2 AC	61	} else {
	62	/* Token holder came in again! */
	63	current->mm->token_priority += 2;
1da177e4	64	}
7602bdf2 AC	65
	66	out:
	67	current->mm->faultstamp = global_faults;
	68	current->mm->last_interval = current_interval;
	69	spin_unlock(&swap_token_lock);
	70	return;
1da177e4 LT	71	}
	72
	73	/* Called on process exit. */
	74	void __put_swap_token(struct mm_struct *mm)
	75	{
	76	spin_lock(&swap_token_lock);
7602bdf2 AC	77	if (likely(mm == swap_token_mm))
7602bdf2 AC	78	swap_token_mm = NULL;
1da177e4 LT	79	spin_unlock(&swap_token_lock);
1da177e4 LT	80	}