blob: 342448c3d2ddf20432410b121ef3060859c998d3 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07002 * Deadline i/o scheduler.
3 *
Jens Axboe0fe23472006-09-04 15:41:16 +02004 * Copyright (C) 2002 Jens Axboe <axboe@kernel.dk>
Linus Torvalds1da177e2005-04-16 15:20:36 -07005 */
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>
Linus Torvalds1da177e2005-04-16 15:20:36 -070011#include <linux/module.h>
12#include <linux/slab.h>
13#include <linux/init.h>
14#include <linux/compiler.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070015#include <linux/rbtree.h>
16
17/*
18 * See Documentation/block/deadline-iosched.txt
19 */
Arjan van de Ven64100092006-01-06 09:46:02 +010020static const int read_expire = HZ / 2; /* max time before a read is submitted. */
21static const int write_expire = 5 * HZ; /* ditto for writes, these limits are SOFT! */
22static const int writes_starved = 2; /* max times reads can starve a write */
23static const int fifo_batch = 16; /* # of sequential requests treated as one
Linus Torvalds1da177e2005-04-16 15:20:36 -070024 by the above parameters. For throughput. */
25
Linus Torvalds1da177e2005-04-16 15:20:36 -070026struct 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];
36
37 /*
38 * next in sort order. read, write or both are NULL
39 */
Jens Axboe8840faa2006-07-13 12:36:41 +020040 struct request *next_rq[2];
Linus Torvalds1da177e2005-04-16 15:20:36 -070041 unsigned int batching; /* number of sequential requests made */
42 sector_t last_sector; /* head position */
43 unsigned int starved; /* times reads have starved writes */
44
45 /*
46 * settings that change how the i/o scheduler behaves
47 */
48 int fifo_expire[2];
49 int fifo_batch;
50 int writes_starved;
51 int front_merges;
Linus Torvalds1da177e2005-04-16 15:20:36 -070052};
53
Jens Axboe8840faa2006-07-13 12:36:41 +020054static void deadline_move_request(struct deadline_data *, struct request *);
Linus Torvalds1da177e2005-04-16 15:20:36 -070055
Jens Axboeb8aca352006-07-13 12:34:24 +020056#define RQ_RB_ROOT(dd, rq) (&(dd)->sort_list[rq_data_dir((rq))])
Linus Torvalds1da177e2005-04-16 15:20:36 -070057
Aaron Carroll5d1a5362007-10-30 10:40:12 +010058/*
59 * get the request after `rq' in sector-sorted order
60 */
61static inline struct request *
62deadline_latter_request(struct request *rq)
63{
64 struct rb_node *node = rb_next(&rq->rb_node);
65
66 if (node)
67 return rb_entry_rq(node);
68
69 return NULL;
70}
71
Linus Torvalds1da177e2005-04-16 15:20:36 -070072static void
Jens Axboe8840faa2006-07-13 12:36:41 +020073deadline_add_rq_rb(struct deadline_data *dd, struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -070074{
Jens Axboeb8aca352006-07-13 12:34:24 +020075 struct rb_root *root = RQ_RB_ROOT(dd, rq);
76 struct request *__alias;
Linus Torvalds1da177e2005-04-16 15:20:36 -070077
78retry:
Jens Axboeb8aca352006-07-13 12:34:24 +020079 __alias = elv_rb_add(root, rq);
80 if (unlikely(__alias)) {
Jens Axboe8840faa2006-07-13 12:36:41 +020081 deadline_move_request(dd, __alias);
Jens Axboeb8aca352006-07-13 12:34:24 +020082 goto retry;
Linus Torvalds1da177e2005-04-16 15:20:36 -070083 }
Linus Torvalds1da177e2005-04-16 15:20:36 -070084}
85
86static inline void
Jens Axboe8840faa2006-07-13 12:36:41 +020087deadline_del_rq_rb(struct deadline_data *dd, struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -070088{
Jens Axboeb8aca352006-07-13 12:34:24 +020089 const int data_dir = rq_data_dir(rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -070090
Aaron Carroll5d1a5362007-10-30 10:40:12 +010091 if (dd->next_rq[data_dir] == rq)
92 dd->next_rq[data_dir] = deadline_latter_request(rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -070093
Jens Axboeb8aca352006-07-13 12:34:24 +020094 elv_rb_del(RQ_RB_ROOT(dd, rq), rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -070095}
96
97/*
Jens Axboe8840faa2006-07-13 12:36:41 +020098 * add rq to rbtree and fifo
Linus Torvalds1da177e2005-04-16 15:20:36 -070099 */
Jens Axboeb4878f22005-10-20 16:42:29 +0200100static void
Linus Torvalds1da177e2005-04-16 15:20:36 -0700101deadline_add_request(struct request_queue *q, struct request *rq)
102{
103 struct deadline_data *dd = q->elevator->elevator_data;
Jens Axboe8840faa2006-07-13 12:36:41 +0200104 const int data_dir = rq_data_dir(rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700105
Jens Axboe8840faa2006-07-13 12:36:41 +0200106 deadline_add_rq_rb(dd, rq);
Jens Axboe98170642006-07-28 09:23:08 +0200107
Linus Torvalds1da177e2005-04-16 15:20:36 -0700108 /*
109 * set expire time (only used for reads) and add to fifo list
110 */
Jens Axboe8840faa2006-07-13 12:36:41 +0200111 rq_set_fifo_time(rq, jiffies + dd->fifo_expire[data_dir]);
112 list_add_tail(&rq->queuelist, &dd->fifo_list[data_dir]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700113}
114
115/*
Jens Axboe98170642006-07-28 09:23:08 +0200116 * remove rq from rbtree and fifo.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700117 */
Jens Axboe165125e2007-07-24 09:28:11 +0200118static void deadline_remove_request(struct request_queue *q, struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700119{
Jens Axboeb4878f22005-10-20 16:42:29 +0200120 struct deadline_data *dd = q->elevator->elevator_data;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700121
Jens Axboe8840faa2006-07-13 12:36:41 +0200122 rq_fifo_clear(rq);
123 deadline_del_rq_rb(dd, rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124}
125
126static int
Jens Axboe165125e2007-07-24 09:28:11 +0200127deadline_merge(struct request_queue *q, struct request **req, struct bio *bio)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700128{
129 struct deadline_data *dd = q->elevator->elevator_data;
130 struct request *__rq;
131 int ret;
132
133 /*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700134 * check for front merge
135 */
136 if (dd->front_merges) {
Jens Axboeb8aca352006-07-13 12:34:24 +0200137 sector_t sector = bio->bi_sector + bio_sectors(bio);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700138
Jens Axboeb8aca352006-07-13 12:34:24 +0200139 __rq = elv_rb_find(&dd->sort_list[bio_data_dir(bio)], sector);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700140 if (__rq) {
Jens Axboeb8aca352006-07-13 12:34:24 +0200141 BUG_ON(sector != __rq->sector);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700142
143 if (elv_rq_merge_ok(__rq, bio)) {
144 ret = ELEVATOR_FRONT_MERGE;
145 goto out;
146 }
147 }
148 }
149
150 return ELEVATOR_NO_MERGE;
151out:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700152 *req = __rq;
153 return ret;
154}
155
Jens Axboe165125e2007-07-24 09:28:11 +0200156static void deadline_merged_request(struct request_queue *q,
157 struct request *req, int type)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700158{
159 struct deadline_data *dd = q->elevator->elevator_data;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700160
161 /*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700162 * if the merge was a front merge, we need to reposition request
163 */
Jens Axboeb8aca352006-07-13 12:34:24 +0200164 if (type == ELEVATOR_FRONT_MERGE) {
165 elv_rb_del(RQ_RB_ROOT(dd, req), req);
Jens Axboe8840faa2006-07-13 12:36:41 +0200166 deadline_add_rq_rb(dd, req);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700167 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700168}
169
170static void
Jens Axboe165125e2007-07-24 09:28:11 +0200171deadline_merged_requests(struct request_queue *q, struct request *req,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700172 struct request *next)
173{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700174 /*
Jens Axboe8840faa2006-07-13 12:36:41 +0200175 * if next expires before rq, assign its expire time to rq
176 * and move into next position (next will be deleted) in fifo
Linus Torvalds1da177e2005-04-16 15:20:36 -0700177 */
Jens Axboe8840faa2006-07-13 12:36:41 +0200178 if (!list_empty(&req->queuelist) && !list_empty(&next->queuelist)) {
179 if (time_before(rq_fifo_time(next), rq_fifo_time(req))) {
180 list_move(&req->queuelist, &next->queuelist);
181 rq_set_fifo_time(req, rq_fifo_time(next));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700182 }
183 }
184
185 /*
186 * kill knowledge of next, this one is a goner
187 */
188 deadline_remove_request(q, next);
189}
190
191/*
192 * move request from sort list to dispatch queue.
193 */
194static inline void
Jens Axboe8840faa2006-07-13 12:36:41 +0200195deadline_move_to_dispatch(struct deadline_data *dd, struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700196{
Jens Axboe165125e2007-07-24 09:28:11 +0200197 struct request_queue *q = rq->q;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700198
Jens Axboe8840faa2006-07-13 12:36:41 +0200199 deadline_remove_request(q, rq);
200 elv_dispatch_add_tail(q, rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700201}
202
203/*
204 * move an entry to dispatch queue
205 */
206static void
Jens Axboe8840faa2006-07-13 12:36:41 +0200207deadline_move_request(struct deadline_data *dd, struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700208{
Jens Axboeb8aca352006-07-13 12:34:24 +0200209 const int data_dir = rq_data_dir(rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700210
Jens Axboe8840faa2006-07-13 12:36:41 +0200211 dd->next_rq[READ] = NULL;
212 dd->next_rq[WRITE] = NULL;
Aaron Carroll5d1a5362007-10-30 10:40:12 +0100213 dd->next_rq[data_dir] = deadline_latter_request(rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700214
Jens Axboe8840faa2006-07-13 12:36:41 +0200215 dd->last_sector = rq->sector + rq->nr_sectors;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700216
217 /*
218 * take it off the sort and fifo list, move
219 * to dispatch queue
220 */
Jens Axboe8840faa2006-07-13 12:36:41 +0200221 deadline_move_to_dispatch(dd, rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700222}
223
Linus Torvalds1da177e2005-04-16 15:20:36 -0700224/*
225 * deadline_check_fifo returns 0 if there are no expired reads on the fifo,
226 * 1 otherwise. Requires !list_empty(&dd->fifo_list[data_dir])
227 */
228static inline int deadline_check_fifo(struct deadline_data *dd, int ddir)
229{
Jens Axboe8840faa2006-07-13 12:36:41 +0200230 struct request *rq = rq_entry_fifo(dd->fifo_list[ddir].next);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700231
232 /*
Jens Axboe8840faa2006-07-13 12:36:41 +0200233 * rq is expired!
Linus Torvalds1da177e2005-04-16 15:20:36 -0700234 */
Jens Axboe8840faa2006-07-13 12:36:41 +0200235 if (time_after(jiffies, rq_fifo_time(rq)))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700236 return 1;
237
238 return 0;
239}
240
241/*
242 * deadline_dispatch_requests selects the best request according to
243 * read/write expire, fifo_batch, etc
244 */
Jens Axboe165125e2007-07-24 09:28:11 +0200245static int deadline_dispatch_requests(struct request_queue *q, int force)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700246{
Jens Axboeb4878f22005-10-20 16:42:29 +0200247 struct deadline_data *dd = q->elevator->elevator_data;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700248 const int reads = !list_empty(&dd->fifo_list[READ]);
249 const int writes = !list_empty(&dd->fifo_list[WRITE]);
Jens Axboe8840faa2006-07-13 12:36:41 +0200250 struct request *rq;
Nikita Danilov4b0dc072005-09-06 15:17:20 -0700251 int data_dir;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700252
253 /*
254 * batches are currently reads XOR writes
255 */
Jens Axboe8840faa2006-07-13 12:36:41 +0200256 if (dd->next_rq[WRITE])
257 rq = dd->next_rq[WRITE];
Andrew Morton9d5c1e12005-09-09 13:02:12 -0700258 else
Jens Axboe8840faa2006-07-13 12:36:41 +0200259 rq = dd->next_rq[READ];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260
Jens Axboe8840faa2006-07-13 12:36:41 +0200261 if (rq) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700262 /* we have a "next request" */
263
Jens Axboe8840faa2006-07-13 12:36:41 +0200264 if (dd->last_sector != rq->sector)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700265 /* end the batch on a non sequential request */
266 dd->batching += dd->fifo_batch;
267
268 if (dd->batching < dd->fifo_batch)
269 /* we are still entitled to batch */
270 goto dispatch_request;
271 }
272
273 /*
274 * at this point we are not running a batch. select the appropriate
275 * data direction (read / write)
276 */
277
278 if (reads) {
Jens Axboedd67d052006-06-21 09:36:18 +0200279 BUG_ON(RB_EMPTY_ROOT(&dd->sort_list[READ]));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700280
281 if (writes && (dd->starved++ >= dd->writes_starved))
282 goto dispatch_writes;
283
284 data_dir = READ;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700285
286 goto dispatch_find_request;
287 }
288
289 /*
290 * there are either no reads or writes have been starved
291 */
292
293 if (writes) {
294dispatch_writes:
Jens Axboedd67d052006-06-21 09:36:18 +0200295 BUG_ON(RB_EMPTY_ROOT(&dd->sort_list[WRITE]));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700296
297 dd->starved = 0;
298
299 data_dir = WRITE;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700300
301 goto dispatch_find_request;
302 }
303
304 return 0;
305
306dispatch_find_request:
307 /*
308 * we are not running a batch, find best request for selected data_dir
309 */
Aaron Carroll6f5d8aa2007-10-30 10:40:13 +0100310 if (deadline_check_fifo(dd, data_dir) || !dd->next_rq[data_dir]) {
311 /*
312 * A deadline has expired, the last request was in the other
313 * direction, or we have run out of higher-sectored requests.
314 * Start again from the request with the earliest expiry time.
315 */
Jens Axboe8840faa2006-07-13 12:36:41 +0200316 rq = rq_entry_fifo(dd->fifo_list[data_dir].next);
Aaron Carroll6f5d8aa2007-10-30 10:40:13 +0100317 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700318 /*
319 * The last req was the same dir and we have a next request in
320 * sort order. No expired requests so continue on from here.
321 */
Jens Axboe8840faa2006-07-13 12:36:41 +0200322 rq = dd->next_rq[data_dir];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700323 }
324
Aaron Carrolldfb3d722007-10-30 10:40:13 +0100325 dd->batching = 0;
326
Linus Torvalds1da177e2005-04-16 15:20:36 -0700327dispatch_request:
328 /*
Jens Axboe8840faa2006-07-13 12:36:41 +0200329 * rq is the selected appropriate request.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700330 */
331 dd->batching++;
Jens Axboe8840faa2006-07-13 12:36:41 +0200332 deadline_move_request(dd, rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700333
334 return 1;
335}
336
Jens Axboe165125e2007-07-24 09:28:11 +0200337static int deadline_queue_empty(struct request_queue *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700338{
339 struct deadline_data *dd = q->elevator->elevator_data;
340
Jens Axboeb4878f22005-10-20 16:42:29 +0200341 return list_empty(&dd->fifo_list[WRITE])
342 && list_empty(&dd->fifo_list[READ]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700343}
344
Linus Torvalds1da177e2005-04-16 15:20:36 -0700345static void deadline_exit_queue(elevator_t *e)
346{
347 struct deadline_data *dd = e->elevator_data;
348
349 BUG_ON(!list_empty(&dd->fifo_list[READ]));
350 BUG_ON(!list_empty(&dd->fifo_list[WRITE]));
351
Linus Torvalds1da177e2005-04-16 15:20:36 -0700352 kfree(dd);
353}
354
355/*
Jens Axboe8840faa2006-07-13 12:36:41 +0200356 * initialize elevator private data (deadline_data).
Linus Torvalds1da177e2005-04-16 15:20:36 -0700357 */
Jens Axboe165125e2007-07-24 09:28:11 +0200358static void *deadline_init_queue(struct request_queue *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700359{
360 struct deadline_data *dd;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700361
Christoph Lameter94f60302007-07-17 04:03:29 -0700362 dd = kmalloc_node(sizeof(*dd), GFP_KERNEL | __GFP_ZERO, q->node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700363 if (!dd)
Jens Axboebc1c1162006-06-08 08:49:06 +0200364 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700365
Linus Torvalds1da177e2005-04-16 15:20:36 -0700366 INIT_LIST_HEAD(&dd->fifo_list[READ]);
367 INIT_LIST_HEAD(&dd->fifo_list[WRITE]);
368 dd->sort_list[READ] = RB_ROOT;
369 dd->sort_list[WRITE] = RB_ROOT;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700370 dd->fifo_expire[READ] = read_expire;
371 dd->fifo_expire[WRITE] = write_expire;
372 dd->writes_starved = writes_starved;
373 dd->front_merges = 1;
374 dd->fifo_batch = fifo_batch;
Jens Axboebc1c1162006-06-08 08:49:06 +0200375 return dd;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700376}
377
Linus Torvalds1da177e2005-04-16 15:20:36 -0700378/*
379 * sysfs parts below
380 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700381
382static ssize_t
383deadline_var_show(int var, char *page)
384{
385 return sprintf(page, "%d\n", var);
386}
387
388static ssize_t
389deadline_var_store(int *var, const char *page, size_t count)
390{
391 char *p = (char *) page;
392
393 *var = simple_strtol(p, &p, 10);
394 return count;
395}
396
397#define SHOW_FUNCTION(__FUNC, __VAR, __CONV) \
Al Viro3d1ab402006-03-18 18:35:43 -0500398static ssize_t __FUNC(elevator_t *e, char *page) \
Linus Torvalds1da177e2005-04-16 15:20:36 -0700399{ \
Al Viro3d1ab402006-03-18 18:35:43 -0500400 struct deadline_data *dd = e->elevator_data; \
401 int __data = __VAR; \
Linus Torvalds1da177e2005-04-16 15:20:36 -0700402 if (__CONV) \
403 __data = jiffies_to_msecs(__data); \
404 return deadline_var_show(__data, (page)); \
405}
Al Viroe572ec72006-03-18 22:27:18 -0500406SHOW_FUNCTION(deadline_read_expire_show, dd->fifo_expire[READ], 1);
407SHOW_FUNCTION(deadline_write_expire_show, dd->fifo_expire[WRITE], 1);
408SHOW_FUNCTION(deadline_writes_starved_show, dd->writes_starved, 0);
409SHOW_FUNCTION(deadline_front_merges_show, dd->front_merges, 0);
410SHOW_FUNCTION(deadline_fifo_batch_show, dd->fifo_batch, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700411#undef SHOW_FUNCTION
412
413#define STORE_FUNCTION(__FUNC, __PTR, MIN, MAX, __CONV) \
Al Viro3d1ab402006-03-18 18:35:43 -0500414static ssize_t __FUNC(elevator_t *e, const char *page, size_t count) \
Linus Torvalds1da177e2005-04-16 15:20:36 -0700415{ \
Al Viro3d1ab402006-03-18 18:35:43 -0500416 struct deadline_data *dd = e->elevator_data; \
Linus Torvalds1da177e2005-04-16 15:20:36 -0700417 int __data; \
418 int ret = deadline_var_store(&__data, (page), count); \
419 if (__data < (MIN)) \
420 __data = (MIN); \
421 else if (__data > (MAX)) \
422 __data = (MAX); \
423 if (__CONV) \
424 *(__PTR) = msecs_to_jiffies(__data); \
425 else \
426 *(__PTR) = __data; \
427 return ret; \
428}
Al Viroe572ec72006-03-18 22:27:18 -0500429STORE_FUNCTION(deadline_read_expire_store, &dd->fifo_expire[READ], 0, INT_MAX, 1);
430STORE_FUNCTION(deadline_write_expire_store, &dd->fifo_expire[WRITE], 0, INT_MAX, 1);
431STORE_FUNCTION(deadline_writes_starved_store, &dd->writes_starved, INT_MIN, INT_MAX, 0);
432STORE_FUNCTION(deadline_front_merges_store, &dd->front_merges, 0, 1, 0);
433STORE_FUNCTION(deadline_fifo_batch_store, &dd->fifo_batch, 0, INT_MAX, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700434#undef STORE_FUNCTION
435
Al Viroe572ec72006-03-18 22:27:18 -0500436#define DD_ATTR(name) \
437 __ATTR(name, S_IRUGO|S_IWUSR, deadline_##name##_show, \
438 deadline_##name##_store)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700439
Al Viroe572ec72006-03-18 22:27:18 -0500440static struct elv_fs_entry deadline_attrs[] = {
441 DD_ATTR(read_expire),
442 DD_ATTR(write_expire),
443 DD_ATTR(writes_starved),
444 DD_ATTR(front_merges),
445 DD_ATTR(fifo_batch),
446 __ATTR_NULL
Linus Torvalds1da177e2005-04-16 15:20:36 -0700447};
448
Linus Torvalds1da177e2005-04-16 15:20:36 -0700449static struct elevator_type iosched_deadline = {
450 .ops = {
451 .elevator_merge_fn = deadline_merge,
452 .elevator_merged_fn = deadline_merged_request,
453 .elevator_merge_req_fn = deadline_merged_requests,
Jens Axboeb4878f22005-10-20 16:42:29 +0200454 .elevator_dispatch_fn = deadline_dispatch_requests,
455 .elevator_add_req_fn = deadline_add_request,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700456 .elevator_queue_empty_fn = deadline_queue_empty,
Jens Axboeb8aca352006-07-13 12:34:24 +0200457 .elevator_former_req_fn = elv_rb_former_request,
458 .elevator_latter_req_fn = elv_rb_latter_request,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700459 .elevator_init_fn = deadline_init_queue,
460 .elevator_exit_fn = deadline_exit_queue,
461 },
462
Al Viro3d1ab402006-03-18 18:35:43 -0500463 .elevator_attrs = deadline_attrs,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700464 .elevator_name = "deadline",
465 .elevator_owner = THIS_MODULE,
466};
467
468static int __init deadline_init(void)
469{
Adrian Bunk2fdd82b2007-12-12 18:51:56 +0100470 elv_register(&iosched_deadline);
471
472 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700473}
474
475static void __exit deadline_exit(void)
476{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700477 elv_unregister(&iosched_deadline);
478}
479
480module_init(deadline_init);
481module_exit(deadline_exit);
482
483MODULE_AUTHOR("Jens Axboe");
484MODULE_LICENSE("GPL");
485MODULE_DESCRIPTION("deadline IO scheduler");