[linux-2.6-block.git] / block / deadline-iosched.c

/*
 *  Deadline i/o scheduler.
 *
 *  Copyright (C) 2002 Jens Axboe <axboe@kernel.dk>
 */
#include <linux/kernel.h>
#include <linux/fs.h>
#include <linux/blkdev.h>
#include <linux/elevator.h>
#include <linux/bio.h>
#include <linux/module.h>
#include <linux/slab.h>
#include <linux/init.h>
#include <linux/compiler.h>
#include <linux/rbtree.h>

/*
 * See Documentation/block/deadline-iosched.txt
 */
static const int read_expire = HZ / 2;  /* max time before a read is submitted. */
static const int write_expire = 5 * HZ; /* ditto for writes, these limits are SOFT! */
static const int writes_starved = 2;    /* max times reads can starve a write */
static const int fifo_batch = 16;       /* # of sequential requests treated as one
				     by the above parameters. For throughput. */

struct deadline_data {
	/*
	 * run time data
	 */

	/*
	 * requests (deadline_rq s) are present on both sort_list and fifo_list
	 */
	struct rb_root sort_list[2];	
	struct list_head fifo_list[2];

	/*
	 * next in sort order. read, write or both are NULL
	 */
	struct request *next_rq[2];
	unsigned int batching;		/* number of sequential requests made */
	unsigned int starved;		/* times reads have starved writes */

	/*
	 * settings that change how the i/o scheduler behaves
	 */
	int fifo_expire[2];
	int fifo_batch;
	int writes_starved;
	int front_merges;
};

static void deadline_move_request(struct deadline_data *, struct request *);

static inline struct rb_root *
deadline_rb_root(struct deadline_data *dd, struct request *rq)
{
	return &dd->sort_list[rq_data_dir(rq)];
}

/*
 * get the request after `rq' in sector-sorted order
 */
static inline struct request *
deadline_latter_request(struct request *rq)
{
	struct rb_node *node = rb_next(&rq->rb_node);

	if (node)
		return rb_entry_rq(node);

	return NULL;
}

static void
deadline_add_rq_rb(struct deadline_data *dd, struct request *rq)
{
	struct rb_root *root = deadline_rb_root(dd, rq);

	elv_rb_add(root, rq);
}

static inline void
deadline_del_rq_rb(struct deadline_data *dd, struct request *rq)
{
	const int data_dir = rq_data_dir(rq);

	if (dd->next_rq[data_dir] == rq)
		dd->next_rq[data_dir] = deadline_latter_request(rq);

	elv_rb_del(deadline_rb_root(dd, rq), rq);
}

/*
 * add rq to rbtree and fifo
 */
static void
deadline_add_request(struct request_queue *q, struct request *rq)
{
	struct deadline_data *dd = q->elevator->elevator_data;
	const int data_dir = rq_data_dir(rq);

	deadline_add_rq_rb(dd, rq);

	/*
	 * set expire time and add to fifo list
	 */
	rq->fifo_time = jiffies + dd->fifo_expire[data_dir];
	list_add_tail(&rq->queuelist, &dd->fifo_list[data_dir]);
}

/*
 * remove rq from rbtree and fifo.
 */
static void deadline_remove_request(struct request_queue *q, struct request *rq)
{
	struct deadline_data *dd = q->elevator->elevator_data;

	rq_fifo_clear(rq);
	deadline_del_rq_rb(dd, rq);
}

static int
deadline_merge(struct request_queue *q, struct request **req, struct bio *bio)
{
	struct deadline_data *dd = q->elevator->elevator_data;
	struct request *__rq;
	int ret;

	/*
	 * check for front merge
	 */
	if (dd->front_merges) {
		sector_t sector = bio_end_sector(bio);

		__rq = elv_rb_find(&dd->sort_list[bio_data_dir(bio)], sector);
		if (__rq) {
			BUG_ON(sector != blk_rq_pos(__rq));

			if (elv_bio_merge_ok(__rq, bio)) {
				ret = ELEVATOR_FRONT_MERGE;
				goto out;
			}
		}
	}

	return ELEVATOR_NO_MERGE;
out:
	*req = __rq;
	return ret;
}

static void deadline_merged_request(struct request_queue *q,
				    struct request *req, int type)
{
	struct deadline_data *dd = q->elevator->elevator_data;

	/*
	 * if the merge was a front merge, we need to reposition request
	 */
	if (type == ELEVATOR_FRONT_MERGE) {
		elv_rb_del(deadline_rb_root(dd, req), req);
		deadline_add_rq_rb(dd, req);
	}
}

static void
deadline_merged_requests(struct request_queue *q, struct request *req,
			 struct request *next)
{
	/*
	 * if next expires before rq, assign its expire time to rq
	 * and move into next position (next will be deleted) in fifo
	 */
	if (!list_empty(&req->queuelist) && !list_empty(&next->queuelist)) {
		if (time_before((unsigned long)next->fifo_time,
				(unsigned long)req->fifo_time)) {
			list_move(&req->queuelist, &next->queuelist);
			req->fifo_time = next->fifo_time;
		}
	}

	/*
	 * kill knowledge of next, this one is a goner
	 */
	deadline_remove_request(q, next);
}

/*
 * move request from sort list to dispatch queue.
 */
static inline void
deadline_move_to_dispatch(struct deadline_data *dd, struct request *rq)
{
	struct request_queue *q = rq->q;

	deadline_remove_request(q, rq);
	elv_dispatch_add_tail(q, rq);
}

/*
 * move an entry to dispatch queue
 */
static void
deadline_move_request(struct deadline_data *dd, struct request *rq)
{
	const int data_dir = rq_data_dir(rq);

	dd->next_rq[READ] = NULL;
	dd->next_rq[WRITE] = NULL;
	dd->next_rq[data_dir] = deadline_latter_request(rq);

	/*
	 * take it off the sort and fifo list, move
	 * to dispatch queue
	 */
	deadline_move_to_dispatch(dd, rq);
}

/*
 * deadline_check_fifo returns 0 if there are no expired requests on the fifo,
 * 1 otherwise. Requires !list_empty(&dd->fifo_list[data_dir])
 */
static inline int deadline_check_fifo(struct deadline_data *dd, int ddir)
{
	struct request *rq = rq_entry_fifo(dd->fifo_list[ddir].next);

	/*
	 * rq is expired!
	 */
	if (time_after_eq(jiffies, (unsigned long)rq->fifo_time))
		return 1;

	return 0;
}

/*
 * deadline_dispatch_requests selects the best request according to
 * read/write expire, fifo_batch, etc
 */
static int deadline_dispatch_requests(struct request_queue *q, int force)
{
	struct deadline_data *dd = q->elevator->elevator_data;
	const int reads = !list_empty(&dd->fifo_list[READ]);
	const int writes = !list_empty(&dd->fifo_list[WRITE]);
	struct request *rq;
	int data_dir;

	/*
	 * batches are currently reads XOR writes
	 */
	if (dd->next_rq[WRITE])
		rq = dd->next_rq[WRITE];
	else
		rq = dd->next_rq[READ];

	if (rq && dd->batching < dd->fifo_batch)
		/* we have a next request are still entitled to batch */
		goto dispatch_request;

	/*
	 * at this point we are not running a batch. select the appropriate
	 * data direction (read / write)
	 */

	if (reads) {
		BUG_ON(RB_EMPTY_ROOT(&dd->sort_list[READ]));

		if (writes && (dd->starved++ >= dd->writes_starved))
			goto dispatch_writes;

		data_dir = READ;

		goto dispatch_find_request;
	}

	/*
	 * there are either no reads or writes have been starved
	 */

	if (writes) {
dispatch_writes:
		BUG_ON(RB_EMPTY_ROOT(&dd->sort_list[WRITE]));

		dd->starved = 0;

		data_dir = WRITE;

		goto dispatch_find_request;
	}

	return 0;

dispatch_find_request:
	/*
	 * we are not running a batch, find best request for selected data_dir
	 */
	if (deadline_check_fifo(dd, data_dir) || !dd->next_rq[data_dir]) {
		/*
		 * A deadline has expired, the last request was in the other
		 * direction, or we have run out of higher-sectored requests.
		 * Start again from the request with the earliest expiry time.
		 */
		rq = rq_entry_fifo(dd->fifo_list[data_dir].next);
	} else {
		/*
		 * The last req was the same dir and we have a next request in
		 * sort order. No expired requests so continue on from here.
		 */
		rq = dd->next_rq[data_dir];
	}

	dd->batching = 0;

dispatch_request:
	/*
	 * rq is the selected appropriate request.
	 */
	dd->batching++;
	deadline_move_request(dd, rq);

	return 1;
}

static void deadline_exit_queue(struct elevator_queue *e)
{
	struct deadline_data *dd = e->elevator_data;

	BUG_ON(!list_empty(&dd->fifo_list[READ]));
	BUG_ON(!list_empty(&dd->fifo_list[WRITE]));

	kfree(dd);
}

/*
 * initialize elevator private data (deadline_data).
 */
static int deadline_init_queue(struct request_queue *q, struct elevator_type *e)
{
	struct deadline_data *dd;
	struct elevator_queue *eq;

	eq = elevator_alloc(q, e);
	if (!eq)
		return -ENOMEM;

	dd = kzalloc_node(sizeof(*dd), GFP_KERNEL, q->node);
	if (!dd) {
		kobject_put(&eq->kobj);
		return -ENOMEM;
	}
	eq->elevator_data = dd;

	INIT_LIST_HEAD(&dd->fifo_list[READ]);
	INIT_LIST_HEAD(&dd->fifo_list[WRITE]);
	dd->sort_list[READ] = RB_ROOT;
	dd->sort_list[WRITE] = RB_ROOT;
	dd->fifo_expire[READ] = read_expire;
	dd->fifo_expire[WRITE] = write_expire;
	dd->writes_starved = writes_starved;
	dd->front_merges = 1;
	dd->fifo_batch = fifo_batch;

	spin_lock_irq(q->queue_lock);
	q->elevator = eq;
	spin_unlock_irq(q->queue_lock);
	return 0;
}

/*
 * sysfs parts below
 */

static ssize_t
deadline_var_show(int var, char *page)
{
	return sprintf(page, "%d\n", var);
}

static ssize_t
deadline_var_store(int *var, const char *page, size_t count)
{
	char *p = (char *) page;

	*var = simple_strtol(p, &p, 10);
	return count;
}

#define SHOW_FUNCTION(__FUNC, __VAR, __CONV)				\
static ssize_t __FUNC(struct elevator_queue *e, char *page)		\
{									\
	struct deadline_data *dd = e->elevator_data;			\
	int __data = __VAR;						\
	if (__CONV)							\
		__data = jiffies_to_msecs(__data);			\
	return deadline_var_show(__data, (page));			\
}
SHOW_FUNCTION(deadline_read_expire_show, dd->fifo_expire[READ], 1);
SHOW_FUNCTION(deadline_write_expire_show, dd->fifo_expire[WRITE], 1);
SHOW_FUNCTION(deadline_writes_starved_show, dd->writes_starved, 0);
SHOW_FUNCTION(deadline_front_merges_show, dd->front_merges, 0);
SHOW_FUNCTION(deadline_fifo_batch_show, dd->fifo_batch, 0);
#undef SHOW_FUNCTION

#define STORE_FUNCTION(__FUNC, __PTR, MIN, MAX, __CONV)			\
static ssize_t __FUNC(struct elevator_queue *e, const char *page, size_t count)	\
{									\
	struct deadline_data *dd = e->elevator_data;			\
	int __data;							\
	int ret = deadline_var_store(&__data, (page), count);		\
	if (__data < (MIN))						\
		__data = (MIN);						\
	else if (__data > (MAX))					\
		__data = (MAX);						\
	if (__CONV)							\
		*(__PTR) = msecs_to_jiffies(__data);			\
	else								\
		*(__PTR) = __data;					\
	return ret;							\
}
STORE_FUNCTION(deadline_read_expire_store, &dd->fifo_expire[READ], 0, INT_MAX, 1);
STORE_FUNCTION(deadline_write_expire_store, &dd->fifo_expire[WRITE], 0, INT_MAX, 1);
STORE_FUNCTION(deadline_writes_starved_store, &dd->writes_starved, INT_MIN, INT_MAX, 0);
STORE_FUNCTION(deadline_front_merges_store, &dd->front_merges, 0, 1, 0);
STORE_FUNCTION(deadline_fifo_batch_store, &dd->fifo_batch, 0, INT_MAX, 0);
#undef STORE_FUNCTION

#define DD_ATTR(name) \
	__ATTR(name, S_IRUGO|S_IWUSR, deadline_##name##_show, \
				      deadline_##name##_store)

static struct elv_fs_entry deadline_attrs[] = {
	DD_ATTR(read_expire),
	DD_ATTR(write_expire),
	DD_ATTR(writes_starved),
	DD_ATTR(front_merges),
	DD_ATTR(fifo_batch),
	__ATTR_NULL
};

static struct elevator_type iosched_deadline = {
	.ops = {
		.elevator_merge_fn = 		deadline_merge,
		.elevator_merged_fn =		deadline_merged_request,
		.elevator_merge_req_fn =	deadline_merged_requests,
		.elevator_dispatch_fn =		deadline_dispatch_requests,
		.elevator_add_req_fn =		deadline_add_request,
		.elevator_former_req_fn =	elv_rb_former_request,
		.elevator_latter_req_fn =	elv_rb_latter_request,
		.elevator_init_fn =		deadline_init_queue,
		.elevator_exit_fn =		deadline_exit_queue,
	},

	.elevator_attrs = deadline_attrs,
	.elevator_name = "deadline",
	.elevator_owner = THIS_MODULE,
};

static int __init deadline_init(void)
{
	return elv_register(&iosched_deadline);
}

static void __exit deadline_exit(void)
{
	elv_unregister(&iosched_deadline);
}

module_init(deadline_init);
module_exit(deadline_exit);

MODULE_AUTHOR("Jens Axboe");
MODULE_LICENSE("GPL");
MODULE_DESCRIPTION("deadline IO scheduler");
Commit	Line	Data
1da177e4	1	/*
1da177e4 LT	2	* Deadline i/o scheduler.
1da177e4 LT	3	*
0fe23479	4	* Copyright (C) 2002 Jens Axboe <axboe@kernel.dk>
1da177e4 LT	5	*/
	6	#include <linux/kernel.h>
	7	#include <linux/fs.h>
	8	#include <linux/blkdev.h>
	9	#include <linux/elevator.h>
	10	#include <linux/bio.h>
1da177e4 LT	11	#include <linux/module.h>
	12	#include <linux/slab.h>
	13	#include <linux/init.h>
	14	#include <linux/compiler.h>
1da177e4 LT	15	#include <linux/rbtree.h>
	16
	17	/*
	18	* See Documentation/block/deadline-iosched.txt
	19	*/
64100099 AV	20	static const int read_expire = HZ / 2; /* max time before a read is submitted. */
	21	static const int write_expire = 5 * HZ; /* ditto for writes, these limits are SOFT! */
	22	static const int writes_starved = 2; /* max times reads can starve a write */
	23	static const int fifo_batch = 16; /* # of sequential requests treated as one
1da177e4 LT	24	by the above parameters. For throughput. */
1da177e4 LT	25
1da177e4 LT	26	struct deadline_data {
	27	/*
	28	* run time data
	29	*/
	30
	31	/*
	32	* requests (deadline_rq s) are present on both sort_list and fifo_list
	33	*/
	34	struct rb_root sort_list[2];
	35	struct list_head fifo_list[2];
4fb72f76	36
1da177e4 LT	37	/*
	38	* next in sort order. read, write or both are NULL
	39	*/
8840faa1	40	struct request *next_rq[2];
1da177e4	41	unsigned int batching; /* number of sequential requests made */
1da177e4 LT	42	unsigned int starved; /* times reads have starved writes */
	43
	44	/*
	45	* settings that change how the i/o scheduler behaves
	46	*/
	47	int fifo_expire[2];
	48	int fifo_batch;
	49	int writes_starved;
	50	int front_merges;
1da177e4 LT	51	};
1da177e4 LT	52
8840faa1	53	static void deadline_move_request(struct deadline_data , struct request );
1da177e4	54
4fb72f76 AC	55	static inline struct rb_root *
	56	deadline_rb_root(struct deadline_data dd, struct request rq)
	57	{
	58	return &dd->sort_list[rq_data_dir(rq)];
	59	}
1da177e4	60
5d1a5366 AC	61	/*
	62	* get the request after `rq' in sector-sorted order
	63	*/
	64	static inline struct request *
	65	deadline_latter_request(struct request *rq)
	66	{
	67	struct rb_node *node = rb_next(&rq->rb_node);
	68
	69	if (node)
	70	return rb_entry_rq(node);
	71
	72	return NULL;
	73	}
	74
1da177e4	75	static void
8840faa1	76	deadline_add_rq_rb(struct deadline_data dd, struct request rq)
1da177e4	77	{
4fb72f76	78	struct rb_root *root = deadline_rb_root(dd, rq);
1da177e4	79
796d5116	80	elv_rb_add(root, rq);
1da177e4 LT	81	}
	82
	83	static inline void
8840faa1	84	deadline_del_rq_rb(struct deadline_data dd, struct request rq)
1da177e4	85	{
b8aca35a	86	const int data_dir = rq_data_dir(rq);
1da177e4	87
5d1a5366 AC	88	if (dd->next_rq[data_dir] == rq)
5d1a5366 AC	89	dd->next_rq[data_dir] = deadline_latter_request(rq);
1da177e4	90
4fb72f76	91	elv_rb_del(deadline_rb_root(dd, rq), rq);
1da177e4 LT	92	}
	93
	94	/*
8840faa1	95	* add rq to rbtree and fifo
1da177e4	96	*/
b4878f24	97	static void
1da177e4 LT	98	deadline_add_request(struct request_queue q, struct request rq)
	99	{
	100	struct deadline_data *dd = q->elevator->elevator_data;
8840faa1	101	const int data_dir = rq_data_dir(rq);
1da177e4	102
8840faa1	103	deadline_add_rq_rb(dd, rq);
9817064b	104
1da177e4	105	/*
4fb72f76	106	* set expire time and add to fifo list
1da177e4	107	*/
8b4922d3	108	rq->fifo_time = jiffies + dd->fifo_expire[data_dir];
8840faa1	109	list_add_tail(&rq->queuelist, &dd->fifo_list[data_dir]);
1da177e4 LT	110	}
	111
	112	/*
9817064b	113	* remove rq from rbtree and fifo.
1da177e4	114	*/
165125e1	115	static void deadline_remove_request(struct request_queue q, struct request rq)
1da177e4	116	{
b4878f24	117	struct deadline_data *dd = q->elevator->elevator_data;
1da177e4	118
8840faa1 JA	119	rq_fifo_clear(rq);
8840faa1 JA	120	deadline_del_rq_rb(dd, rq);
1da177e4 LT	121	}
	122
	123	static int
165125e1	124	deadline_merge(struct request_queue q, struct request req, struct bio bio)
1da177e4 LT	125	{
	126	struct deadline_data *dd = q->elevator->elevator_data;
	127	struct request *__rq;
	128	int ret;
	129
1da177e4 LT	130	/*
	131	* check for front merge
	132	*/
	133	if (dd->front_merges) {
f73a1c7d	134	sector_t sector = bio_end_sector(bio);
1da177e4	135
b8aca35a	136	__rq = elv_rb_find(&dd->sort_list[bio_data_dir(bio)], sector);
1da177e4	137	if (__rq) {
83096ebf	138	BUG_ON(sector != blk_rq_pos(__rq));
1da177e4	139
72ef799b	140	if (elv_bio_merge_ok(__rq, bio)) {
1da177e4 LT	141	ret = ELEVATOR_FRONT_MERGE;
	142	goto out;
	143	}
	144	}
	145	}
	146
	147	return ELEVATOR_NO_MERGE;
	148	out:
1da177e4 LT	149	*req = __rq;
	150	return ret;
	151	}
	152
165125e1 JA	153	static void deadline_merged_request(struct request_queue *q,
165125e1 JA	154	struct request *req, int type)
1da177e4 LT	155	{
1da177e4 LT	156	struct deadline_data *dd = q->elevator->elevator_data;
1da177e4	157
1da177e4 LT	158	/*
	159	* if the merge was a front merge, we need to reposition request
	160	*/
b8aca35a	161	if (type == ELEVATOR_FRONT_MERGE) {
4fb72f76	162	elv_rb_del(deadline_rb_root(dd, req), req);
8840faa1	163	deadline_add_rq_rb(dd, req);
1da177e4	164	}
1da177e4 LT	165	}
	166
	167	static void
165125e1	168	deadline_merged_requests(struct request_queue q, struct request req,
1da177e4 LT	169	struct request *next)
1da177e4 LT	170	{
1da177e4	171	/*
8840faa1 JA	172	* if next expires before rq, assign its expire time to rq
8840faa1 JA	173	* and move into next position (next will be deleted) in fifo
1da177e4	174	*/
8840faa1	175	if (!list_empty(&req->queuelist) && !list_empty(&next->queuelist)) {
9828c2c6 JK	176	if (time_before((unsigned long)next->fifo_time,
9828c2c6 JK	177	(unsigned long)req->fifo_time)) {
8840faa1	178	list_move(&req->queuelist, &next->queuelist);
8b4922d3	179	req->fifo_time = next->fifo_time;
1da177e4 LT	180	}
	181	}
	182
	183	/*
	184	* kill knowledge of next, this one is a goner
	185	*/
	186	deadline_remove_request(q, next);
	187	}
	188
	189	/*
	190	* move request from sort list to dispatch queue.
	191	*/
	192	static inline void
8840faa1	193	deadline_move_to_dispatch(struct deadline_data dd, struct request rq)
1da177e4	194	{
165125e1	195	struct request_queue *q = rq->q;
1da177e4	196
8840faa1 JA	197	deadline_remove_request(q, rq);
8840faa1 JA	198	elv_dispatch_add_tail(q, rq);
1da177e4 LT	199	}
	200
	201	/*
	202	* move an entry to dispatch queue
	203	*/
	204	static void
8840faa1	205	deadline_move_request(struct deadline_data dd, struct request rq)
1da177e4	206	{
b8aca35a	207	const int data_dir = rq_data_dir(rq);
1da177e4	208
8840faa1 JA	209	dd->next_rq[READ] = NULL;
8840faa1 JA	210	dd->next_rq[WRITE] = NULL;
5d1a5366	211	dd->next_rq[data_dir] = deadline_latter_request(rq);
1da177e4	212
1da177e4 LT	213	/*
	214	* take it off the sort and fifo list, move
	215	* to dispatch queue
	216	*/
8840faa1	217	deadline_move_to_dispatch(dd, rq);
1da177e4 LT	218	}
1da177e4 LT	219
1da177e4	220	/*
4fb72f76	221	* deadline_check_fifo returns 0 if there are no expired requests on the fifo,
1da177e4 LT	222	* 1 otherwise. Requires !list_empty(&dd->fifo_list[data_dir])
	223	*/
	224	static inline int deadline_check_fifo(struct deadline_data *dd, int ddir)
	225	{
8840faa1	226	struct request *rq = rq_entry_fifo(dd->fifo_list[ddir].next);
1da177e4 LT	227
1da177e4 LT	228	/*
8840faa1	229	* rq is expired!
1da177e4	230	*/
9828c2c6	231	if (time_after_eq(jiffies, (unsigned long)rq->fifo_time))
1da177e4 LT	232	return 1;
	233
	234	return 0;
	235	}
	236
	237	/*
	238	* deadline_dispatch_requests selects the best request according to
	239	* read/write expire, fifo_batch, etc
	240	*/
165125e1	241	static int deadline_dispatch_requests(struct request_queue *q, int force)
1da177e4	242	{
b4878f24	243	struct deadline_data *dd = q->elevator->elevator_data;
1da177e4 LT	244	const int reads = !list_empty(&dd->fifo_list[READ]);
1da177e4 LT	245	const int writes = !list_empty(&dd->fifo_list[WRITE]);
8840faa1	246	struct request *rq;
4b0dc07e	247	int data_dir;
1da177e4 LT	248
	249	/*
	250	* batches are currently reads XOR writes
	251	*/
8840faa1 JA	252	if (dd->next_rq[WRITE])
8840faa1 JA	253	rq = dd->next_rq[WRITE];
9d5c1e1b	254	else
8840faa1	255	rq = dd->next_rq[READ];
1da177e4	256
63de428b AC	257	if (rq && dd->batching < dd->fifo_batch)
	258	/* we have a next request are still entitled to batch */
	259	goto dispatch_request;
1da177e4 LT	260
	261	/*
	262	* at this point we are not running a batch. select the appropriate
	263	* data direction (read / write)
	264	*/
	265
	266	if (reads) {
dd67d051	267	BUG_ON(RB_EMPTY_ROOT(&dd->sort_list[READ]));
1da177e4 LT	268
	269	if (writes && (dd->starved++ >= dd->writes_starved))
	270	goto dispatch_writes;
	271
	272	data_dir = READ;
1da177e4 LT	273
	274	goto dispatch_find_request;
	275	}
	276
	277	/*
	278	* there are either no reads or writes have been starved
	279	*/
	280
	281	if (writes) {
	282	dispatch_writes:
dd67d051	283	BUG_ON(RB_EMPTY_ROOT(&dd->sort_list[WRITE]));
1da177e4 LT	284
	285	dd->starved = 0;
	286
	287	data_dir = WRITE;
1da177e4 LT	288
	289	goto dispatch_find_request;
	290	}
	291
	292	return 0;
	293
	294	dispatch_find_request:
	295	/*
	296	* we are not running a batch, find best request for selected data_dir
	297	*/
6f5d8aa6 AC	298	if (deadline_check_fifo(dd, data_dir) \|\| !dd->next_rq[data_dir]) {
	299	/*
	300	* A deadline has expired, the last request was in the other
	301	* direction, or we have run out of higher-sectored requests.
	302	* Start again from the request with the earliest expiry time.
	303	*/
8840faa1	304	rq = rq_entry_fifo(dd->fifo_list[data_dir].next);
6f5d8aa6	305	} else {
1da177e4 LT	306	/*
	307	* The last req was the same dir and we have a next request in
	308	* sort order. No expired requests so continue on from here.
	309	*/
8840faa1	310	rq = dd->next_rq[data_dir];
1da177e4 LT	311	}
1da177e4 LT	312
dfb3d72a AC	313	dd->batching = 0;
dfb3d72a AC	314
1da177e4 LT	315	dispatch_request:
1da177e4 LT	316	/*
8840faa1	317	* rq is the selected appropriate request.
1da177e4 LT	318	*/
1da177e4 LT	319	dd->batching++;
8840faa1	320	deadline_move_request(dd, rq);
1da177e4 LT	321
	322	return 1;
	323	}
	324
b374d18a	325	static void deadline_exit_queue(struct elevator_queue *e)
1da177e4 LT	326	{
	327	struct deadline_data *dd = e->elevator_data;
	328
	329	BUG_ON(!list_empty(&dd->fifo_list[READ]));
	330	BUG_ON(!list_empty(&dd->fifo_list[WRITE]));
	331
1da177e4 LT	332	kfree(dd);
	333	}
	334
	335	/*
8840faa1	336	* initialize elevator private data (deadline_data).
1da177e4	337	*/
d50235b7	338	static int deadline_init_queue(struct request_queue q, struct elevator_type e)
1da177e4 LT	339	{
1da177e4 LT	340	struct deadline_data *dd;
d50235b7 JM	341	struct elevator_queue *eq;
	342
	343	eq = elevator_alloc(q, e);
	344	if (!eq)
	345	return -ENOMEM;
1da177e4	346
c1b511eb	347	dd = kzalloc_node(sizeof(*dd), GFP_KERNEL, q->node);
d50235b7 JM	348	if (!dd) {
d50235b7 JM	349	kobject_put(&eq->kobj);
b2fab5ac	350	return -ENOMEM;
d50235b7 JM	351	}
d50235b7 JM	352	eq->elevator_data = dd;
1da177e4	353
1da177e4 LT	354	INIT_LIST_HEAD(&dd->fifo_list[READ]);
	355	INIT_LIST_HEAD(&dd->fifo_list[WRITE]);
	356	dd->sort_list[READ] = RB_ROOT;
	357	dd->sort_list[WRITE] = RB_ROOT;
1da177e4 LT	358	dd->fifo_expire[READ] = read_expire;
	359	dd->fifo_expire[WRITE] = write_expire;
	360	dd->writes_starved = writes_starved;
	361	dd->front_merges = 1;
	362	dd->fifo_batch = fifo_batch;
b2fab5ac	363
d50235b7 JM	364	spin_lock_irq(q->queue_lock);
	365	q->elevator = eq;
	366	spin_unlock_irq(q->queue_lock);
b2fab5ac	367	return 0;
1da177e4 LT	368	}
1da177e4 LT	369
1da177e4 LT	370	/*
	371	* sysfs parts below
	372	*/
1da177e4 LT	373
	374	static ssize_t
	375	deadline_var_show(int var, char *page)
	376	{
	377	return sprintf(page, "%d\n", var);
	378	}
	379
	380	static ssize_t
	381	deadline_var_store(int var, const char page, size_t count)
	382	{
	383	char p = (char ) page;
	384
	385	*var = simple_strtol(p, &p, 10);
	386	return count;
	387	}
	388
	389	#define SHOW_FUNCTION(__FUNC, __VAR, __CONV) \
b374d18a	390	static ssize_t __FUNC(struct elevator_queue e, char page) \
1da177e4	391	{ \
3d1ab40f AV	392	struct deadline_data *dd = e->elevator_data; \
3d1ab40f AV	393	int __data = __VAR; \
1da177e4 LT	394	if (__CONV) \
	395	__data = jiffies_to_msecs(__data); \
	396	return deadline_var_show(__data, (page)); \
	397	}
e572ec7e AV	398	SHOW_FUNCTION(deadline_read_expire_show, dd->fifo_expire[READ], 1);
	399	SHOW_FUNCTION(deadline_write_expire_show, dd->fifo_expire[WRITE], 1);
	400	SHOW_FUNCTION(deadline_writes_starved_show, dd->writes_starved, 0);
	401	SHOW_FUNCTION(deadline_front_merges_show, dd->front_merges, 0);
	402	SHOW_FUNCTION(deadline_fifo_batch_show, dd->fifo_batch, 0);
1da177e4 LT	403	#undef SHOW_FUNCTION
	404
	405	#define STORE_FUNCTION(__FUNC, __PTR, MIN, MAX, __CONV) \
b374d18a	406	static ssize_t __FUNC(struct elevator_queue e, const char page, size_t count) \
1da177e4	407	{ \
3d1ab40f	408	struct deadline_data *dd = e->elevator_data; \
1da177e4 LT	409	int __data; \
	410	int ret = deadline_var_store(&__data, (page), count); \
	411	if (__data < (MIN)) \
	412	__data = (MIN); \
	413	else if (__data > (MAX)) \
	414	__data = (MAX); \
	415	if (__CONV) \
	416	*(__PTR) = msecs_to_jiffies(__data); \
	417	else \
	418	*(__PTR) = __data; \
	419	return ret; \
	420	}
e572ec7e AV	421	STORE_FUNCTION(deadline_read_expire_store, &dd->fifo_expire[READ], 0, INT_MAX, 1);
	422	STORE_FUNCTION(deadline_write_expire_store, &dd->fifo_expire[WRITE], 0, INT_MAX, 1);
	423	STORE_FUNCTION(deadline_writes_starved_store, &dd->writes_starved, INT_MIN, INT_MAX, 0);
	424	STORE_FUNCTION(deadline_front_merges_store, &dd->front_merges, 0, 1, 0);
	425	STORE_FUNCTION(deadline_fifo_batch_store, &dd->fifo_batch, 0, INT_MAX, 0);
1da177e4 LT	426	#undef STORE_FUNCTION
1da177e4 LT	427
e572ec7e AV	428	#define DD_ATTR(name) \
	429	__ATTR(name, S_IRUGO\|S_IWUSR, deadline_##name##_show, \
	430	deadline_##name##_store)
	431
	432	static struct elv_fs_entry deadline_attrs[] = {
	433	DD_ATTR(read_expire),
	434	DD_ATTR(write_expire),
	435	DD_ATTR(writes_starved),
	436	DD_ATTR(front_merges),
	437	DD_ATTR(fifo_batch),
	438	__ATTR_NULL
1da177e4 LT	439	};
1da177e4 LT	440
1da177e4 LT	441	static struct elevator_type iosched_deadline = {
	442	.ops = {
	443	.elevator_merge_fn = deadline_merge,
	444	.elevator_merged_fn = deadline_merged_request,
	445	.elevator_merge_req_fn = deadline_merged_requests,
b4878f24 JA	446	.elevator_dispatch_fn = deadline_dispatch_requests,
b4878f24 JA	447	.elevator_add_req_fn = deadline_add_request,
b8aca35a JA	448	.elevator_former_req_fn = elv_rb_former_request,
b8aca35a JA	449	.elevator_latter_req_fn = elv_rb_latter_request,
1da177e4 LT	450	.elevator_init_fn = deadline_init_queue,
	451	.elevator_exit_fn = deadline_exit_queue,
	452	},
	453
3d1ab40f	454	.elevator_attrs = deadline_attrs,
1da177e4 LT	455	.elevator_name = "deadline",
	456	.elevator_owner = THIS_MODULE,
	457	};
	458
	459	static int __init deadline_init(void)
	460	{
3d3c2379	461	return elv_register(&iosched_deadline);
1da177e4 LT	462	}
	463
	464	static void __exit deadline_exit(void)
	465	{
1da177e4 LT	466	elv_unregister(&iosched_deadline);
	467	}
	468
	469	module_init(deadline_init);
	470	module_exit(deadline_exit);
	471
	472	MODULE_AUTHOR("Jens Axboe");
	473	MODULE_LICENSE("GPL");
	474	MODULE_DESCRIPTION("deadline IO scheduler");