blob: ec585c9554d33c04b973537f9ac3216e332afa50 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07002 * Block device elevator/IO-scheduler.
3 *
4 * Copyright (C) 2000 Andrea Arcangeli <andrea@suse.de> SuSE
5 *
Jens Axboe0fe23472006-09-04 15:41:16 +02006 * 30042000 Jens Axboe <axboe@kernel.dk> :
Linus Torvalds1da177e2005-04-16 15:20:36 -07007 *
8 * Split the elevator a bit so that it is possible to choose a different
9 * one or even write a new "plug in". There are three pieces:
10 * - elevator_fn, inserts a new request in the queue list
11 * - elevator_merge_fn, decides whether a new buffer can be merged with
12 * an existing request
13 * - elevator_dequeue_fn, called when a request is taken off the active list
14 *
15 * 20082000 Dave Jones <davej@suse.de> :
16 * Removed tests for max-bomb-segments, which was breaking elvtune
17 * when run without -bN
18 *
19 * Jens:
20 * - Rework again to work with bio instead of buffer_heads
21 * - loose bi_dev comparisons, partition handling is right now
22 * - completely modularize elevator setup and teardown
23 *
24 */
25#include <linux/kernel.h>
26#include <linux/fs.h>
27#include <linux/blkdev.h>
28#include <linux/elevator.h>
29#include <linux/bio.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070030#include <linux/module.h>
31#include <linux/slab.h>
32#include <linux/init.h>
33#include <linux/compiler.h>
Tejun Heocb98fc82005-10-28 08:29:39 +020034#include <linux/delay.h>
Jens Axboe2056a782006-03-23 20:00:26 +010035#include <linux/blktrace_api.h>
Jens Axboe98170642006-07-28 09:23:08 +020036#include <linux/hash.h>
Jens Axboe0835da62008-08-26 09:15:47 +020037#include <linux/uaccess.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070038
Li Zefan55782132009-06-09 13:43:05 +080039#include <trace/events/block.h>
40
Jens Axboe242f9dc2008-09-14 05:55:09 -070041#include "blk.h"
42
Linus Torvalds1da177e2005-04-16 15:20:36 -070043static DEFINE_SPINLOCK(elv_list_lock);
44static LIST_HEAD(elv_list);
45
46/*
Jens Axboe98170642006-07-28 09:23:08 +020047 * Merge hash stuff.
48 */
49static const int elv_hash_shift = 6;
50#define ELV_HASH_BLOCK(sec) ((sec) >> 3)
Jens Axboe4eb166d2008-02-01 00:37:27 +010051#define ELV_HASH_FN(sec) \
52 (hash_long(ELV_HASH_BLOCK((sec)), elv_hash_shift))
Jens Axboe98170642006-07-28 09:23:08 +020053#define ELV_HASH_ENTRIES (1 << elv_hash_shift)
Tejun Heo83096eb2009-05-07 22:24:39 +090054#define rq_hash_key(rq) (blk_rq_pos(rq) + blk_rq_sectors(rq))
Jens Axboe98170642006-07-28 09:23:08 +020055
56/*
Jens Axboeda775262006-12-20 11:04:12 +010057 * Query io scheduler to see if the current process issuing bio may be
58 * merged with rq.
59 */
60static int elv_iosched_allow_merge(struct request *rq, struct bio *bio)
61{
Jens Axboe165125e2007-07-24 09:28:11 +020062 struct request_queue *q = rq->q;
Jens Axboeb374d182008-10-31 10:05:07 +010063 struct elevator_queue *e = q->elevator;
Jens Axboeda775262006-12-20 11:04:12 +010064
65 if (e->ops->elevator_allow_merge_fn)
66 return e->ops->elevator_allow_merge_fn(q, rq, bio);
67
68 return 1;
69}
70
71/*
Linus Torvalds1da177e2005-04-16 15:20:36 -070072 * can we safely merge with this request?
73 */
Adrian Bunk72ed0bf2008-04-29 09:49:05 +020074int elv_rq_merge_ok(struct request *rq, struct bio *bio)
Linus Torvalds1da177e2005-04-16 15:20:36 -070075{
76 if (!rq_mergeable(rq))
77 return 0;
78
79 /*
David Woodhousee17fc0a2008-08-09 16:42:20 +010080 * Don't merge file system requests and discard requests
81 */
Christoph Hellwig7b6d91d2010-08-07 18:20:39 +020082 if ((bio->bi_rw & REQ_DISCARD) != (rq->bio->bi_rw & REQ_DISCARD))
David Woodhousee17fc0a2008-08-09 16:42:20 +010083 return 0;
84
85 /*
Adrian Hunter8d57a982010-08-11 14:17:49 -070086 * Don't merge discard requests and secure discard requests
87 */
88 if ((bio->bi_rw & REQ_SECURE) != (rq->bio->bi_rw & REQ_SECURE))
89 return 0;
90
91 /*
Linus Torvalds1da177e2005-04-16 15:20:36 -070092 * different data direction or already started, don't merge
93 */
94 if (bio_data_dir(bio) != rq_data_dir(rq))
95 return 0;
96
97 /*
Jens Axboeda775262006-12-20 11:04:12 +010098 * must be same device and not a special request
Linus Torvalds1da177e2005-04-16 15:20:36 -070099 */
Jens Axboebb4067e2006-12-21 21:20:01 +0100100 if (rq->rq_disk != bio->bi_bdev->bd_disk || rq->special)
Jens Axboeda775262006-12-20 11:04:12 +0100101 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700102
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200103 /*
104 * only merge integrity protected bio into ditto rq
105 */
106 if (bio_integrity(bio) != blk_integrity_rq(rq))
107 return 0;
108
Jens Axboeda775262006-12-20 11:04:12 +0100109 if (!elv_iosched_allow_merge(rq, bio))
110 return 0;
111
112 return 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700113}
114EXPORT_SYMBOL(elv_rq_merge_ok);
115
Coywolf Qi Hunt769db452005-12-28 10:55:49 +0100116static inline int elv_try_merge(struct request *__rq, struct bio *bio)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700117{
118 int ret = ELEVATOR_NO_MERGE;
119
120 /*
121 * we can merge and sequence is ok, check if it's possible
122 */
123 if (elv_rq_merge_ok(__rq, bio)) {
Tejun Heo83096eb2009-05-07 22:24:39 +0900124 if (blk_rq_pos(__rq) + blk_rq_sectors(__rq) == bio->bi_sector)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700125 ret = ELEVATOR_BACK_MERGE;
Tejun Heo83096eb2009-05-07 22:24:39 +0900126 else if (blk_rq_pos(__rq) - bio_sectors(bio) == bio->bi_sector)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700127 ret = ELEVATOR_FRONT_MERGE;
128 }
129
130 return ret;
131}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700132
Linus Torvalds1da177e2005-04-16 15:20:36 -0700133static struct elevator_type *elevator_find(const char *name)
134{
Vasily Tarasova22b1692006-10-11 09:24:27 +0200135 struct elevator_type *e;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700136
Matthias Kaehlcke70cee262007-07-10 12:26:24 +0200137 list_for_each_entry(e, &elv_list, list) {
Vasily Tarasova22b1692006-10-11 09:24:27 +0200138 if (!strcmp(e->elevator_name, name))
139 return e;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700140 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700141
Vasily Tarasova22b1692006-10-11 09:24:27 +0200142 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700143}
144
145static void elevator_put(struct elevator_type *e)
146{
147 module_put(e->elevator_owner);
148}
149
150static struct elevator_type *elevator_get(const char *name)
151{
Tejun Heo2824bc932005-10-20 10:56:41 +0200152 struct elevator_type *e;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700153
Jens Axboe2a12dcd2007-04-26 14:41:53 +0200154 spin_lock(&elv_list_lock);
Tejun Heo2824bc932005-10-20 10:56:41 +0200155
156 e = elevator_find(name);
Jens Axboee1640942008-02-19 10:20:37 +0100157 if (!e) {
158 char elv[ELV_NAME_MAX + strlen("-iosched")];
159
160 spin_unlock(&elv_list_lock);
161
wzt.wzt@gmail.coma506aed2010-04-02 08:41:14 +0200162 snprintf(elv, sizeof(elv), "%s-iosched", name);
Jens Axboee1640942008-02-19 10:20:37 +0100163
maximilian attemse180f592008-07-01 09:42:47 +0200164 request_module("%s", elv);
Jens Axboee1640942008-02-19 10:20:37 +0100165 spin_lock(&elv_list_lock);
166 e = elevator_find(name);
167 }
168
Tejun Heo2824bc932005-10-20 10:56:41 +0200169 if (e && !try_module_get(e->elevator_owner))
170 e = NULL;
171
Jens Axboe2a12dcd2007-04-26 14:41:53 +0200172 spin_unlock(&elv_list_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700173
174 return e;
175}
176
Jens Axboe165125e2007-07-24 09:28:11 +0200177static void *elevator_init_queue(struct request_queue *q,
178 struct elevator_queue *eq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700179{
Jens Axboebb37b942006-12-01 10:42:33 +0100180 return eq->ops->elevator_init_fn(q);
Jens Axboebc1c1162006-06-08 08:49:06 +0200181}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700182
Jens Axboe165125e2007-07-24 09:28:11 +0200183static void elevator_attach(struct request_queue *q, struct elevator_queue *eq,
Jens Axboebc1c1162006-06-08 08:49:06 +0200184 void *data)
185{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700186 q->elevator = eq;
Jens Axboebc1c1162006-06-08 08:49:06 +0200187 eq->elevator_data = data;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700188}
189
190static char chosen_elevator[16];
191
Nate Diller5f003972006-01-24 10:07:58 +0100192static int __init elevator_setup(char *str)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700193{
Chuck Ebbert752a3b72006-01-16 09:47:37 +0100194 /*
195 * Be backwards-compatible with previous kernels, so users
196 * won't get the wrong elevator.
197 */
Jens Axboe492af632009-10-03 09:37:51 +0200198 strncpy(chosen_elevator, str, sizeof(chosen_elevator) - 1);
OGAWA Hirofumi9b410462006-03-31 02:30:33 -0800199 return 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700200}
201
202__setup("elevator=", elevator_setup);
203
Al Viro3d1ab402006-03-18 18:35:43 -0500204static struct kobj_type elv_ktype;
205
Jens Axboeb374d182008-10-31 10:05:07 +0100206static struct elevator_queue *elevator_alloc(struct request_queue *q,
Jens Axboe165125e2007-07-24 09:28:11 +0200207 struct elevator_type *e)
Al Viro3d1ab402006-03-18 18:35:43 -0500208{
Jens Axboeb374d182008-10-31 10:05:07 +0100209 struct elevator_queue *eq;
Jens Axboe98170642006-07-28 09:23:08 +0200210 int i;
211
Jens Axboeb374d182008-10-31 10:05:07 +0100212 eq = kmalloc_node(sizeof(*eq), GFP_KERNEL | __GFP_ZERO, q->node);
Jens Axboe98170642006-07-28 09:23:08 +0200213 if (unlikely(!eq))
214 goto err;
215
Jens Axboe98170642006-07-28 09:23:08 +0200216 eq->ops = &e->ops;
217 eq->elevator_type = e;
Greg Kroah-Hartmanf9cb0742007-12-17 23:05:35 -0700218 kobject_init(&eq->kobj, &elv_ktype);
Jens Axboe98170642006-07-28 09:23:08 +0200219 mutex_init(&eq->sysfs_lock);
220
Jens Axboeb5deef92006-07-19 23:39:40 +0200221 eq->hash = kmalloc_node(sizeof(struct hlist_head) * ELV_HASH_ENTRIES,
222 GFP_KERNEL, q->node);
Jens Axboe98170642006-07-28 09:23:08 +0200223 if (!eq->hash)
224 goto err;
225
226 for (i = 0; i < ELV_HASH_ENTRIES; i++)
227 INIT_HLIST_HEAD(&eq->hash[i]);
228
Al Viro3d1ab402006-03-18 18:35:43 -0500229 return eq;
Jens Axboe98170642006-07-28 09:23:08 +0200230err:
231 kfree(eq);
232 elevator_put(e);
233 return NULL;
Al Viro3d1ab402006-03-18 18:35:43 -0500234}
235
236static void elevator_release(struct kobject *kobj)
237{
Jens Axboeb374d182008-10-31 10:05:07 +0100238 struct elevator_queue *e;
Jens Axboe98170642006-07-28 09:23:08 +0200239
Jens Axboeb374d182008-10-31 10:05:07 +0100240 e = container_of(kobj, struct elevator_queue, kobj);
Al Viro3d1ab402006-03-18 18:35:43 -0500241 elevator_put(e->elevator_type);
Jens Axboe98170642006-07-28 09:23:08 +0200242 kfree(e->hash);
Al Viro3d1ab402006-03-18 18:35:43 -0500243 kfree(e);
244}
245
Jens Axboe165125e2007-07-24 09:28:11 +0200246int elevator_init(struct request_queue *q, char *name)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700247{
248 struct elevator_type *e = NULL;
249 struct elevator_queue *eq;
Jens Axboebc1c1162006-06-08 08:49:06 +0200250 void *data;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700251
Mike Snitzer1abec4f2010-05-25 13:15:15 -0400252 if (unlikely(q->elevator))
253 return 0;
254
Tejun Heocb98fc82005-10-28 08:29:39 +0200255 INIT_LIST_HEAD(&q->queue_head);
256 q->last_merge = NULL;
257 q->end_sector = 0;
258 q->boundary_rq = NULL;
Tejun Heocb98fc82005-10-28 08:29:39 +0200259
Jens Axboe4eb166d2008-02-01 00:37:27 +0100260 if (name) {
261 e = elevator_get(name);
262 if (!e)
263 return -EINVAL;
264 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700265
Jens Axboe4eb166d2008-02-01 00:37:27 +0100266 if (!e && *chosen_elevator) {
267 e = elevator_get(chosen_elevator);
268 if (!e)
269 printk(KERN_ERR "I/O scheduler %s not found\n",
270 chosen_elevator);
271 }
Nate Diller248d5ca2006-01-24 10:09:14 +0100272
Jens Axboe4eb166d2008-02-01 00:37:27 +0100273 if (!e) {
274 e = elevator_get(CONFIG_DEFAULT_IOSCHED);
275 if (!e) {
276 printk(KERN_ERR
277 "Default I/O scheduler not found. " \
278 "Using noop.\n");
279 e = elevator_get("noop");
280 }
Nate Diller5f003972006-01-24 10:07:58 +0100281 }
282
Jens Axboeb5deef92006-07-19 23:39:40 +0200283 eq = elevator_alloc(q, e);
Al Viro3d1ab402006-03-18 18:35:43 -0500284 if (!eq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700285 return -ENOMEM;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700286
Jens Axboebc1c1162006-06-08 08:49:06 +0200287 data = elevator_init_queue(q, eq);
288 if (!data) {
Al Viro3d1ab402006-03-18 18:35:43 -0500289 kobject_put(&eq->kobj);
Jens Axboebc1c1162006-06-08 08:49:06 +0200290 return -ENOMEM;
291 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700292
Jens Axboebc1c1162006-06-08 08:49:06 +0200293 elevator_attach(q, eq, data);
Mike Snitzer1abec4f2010-05-25 13:15:15 -0400294 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700295}
Jens Axboe2e662b62006-07-13 11:55:04 +0200296EXPORT_SYMBOL(elevator_init);
297
Jens Axboeb374d182008-10-31 10:05:07 +0100298void elevator_exit(struct elevator_queue *e)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700299{
Al Viro3d1ab402006-03-18 18:35:43 -0500300 mutex_lock(&e->sysfs_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700301 if (e->ops->elevator_exit_fn)
302 e->ops->elevator_exit_fn(e);
Al Viro3d1ab402006-03-18 18:35:43 -0500303 e->ops = NULL;
304 mutex_unlock(&e->sysfs_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700305
Al Viro3d1ab402006-03-18 18:35:43 -0500306 kobject_put(&e->kobj);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700307}
Jens Axboe2e662b62006-07-13 11:55:04 +0200308EXPORT_SYMBOL(elevator_exit);
309
Jens Axboe98170642006-07-28 09:23:08 +0200310static inline void __elv_rqhash_del(struct request *rq)
311{
312 hlist_del_init(&rq->hash);
313}
314
Jens Axboe165125e2007-07-24 09:28:11 +0200315static void elv_rqhash_del(struct request_queue *q, struct request *rq)
Jens Axboe98170642006-07-28 09:23:08 +0200316{
317 if (ELV_ON_HASH(rq))
318 __elv_rqhash_del(rq);
319}
320
Jens Axboe165125e2007-07-24 09:28:11 +0200321static void elv_rqhash_add(struct request_queue *q, struct request *rq)
Jens Axboe98170642006-07-28 09:23:08 +0200322{
Jens Axboeb374d182008-10-31 10:05:07 +0100323 struct elevator_queue *e = q->elevator;
Jens Axboe98170642006-07-28 09:23:08 +0200324
325 BUG_ON(ELV_ON_HASH(rq));
326 hlist_add_head(&rq->hash, &e->hash[ELV_HASH_FN(rq_hash_key(rq))]);
327}
328
Jens Axboe165125e2007-07-24 09:28:11 +0200329static void elv_rqhash_reposition(struct request_queue *q, struct request *rq)
Jens Axboe98170642006-07-28 09:23:08 +0200330{
331 __elv_rqhash_del(rq);
332 elv_rqhash_add(q, rq);
333}
334
Jens Axboe165125e2007-07-24 09:28:11 +0200335static struct request *elv_rqhash_find(struct request_queue *q, sector_t offset)
Jens Axboe98170642006-07-28 09:23:08 +0200336{
Jens Axboeb374d182008-10-31 10:05:07 +0100337 struct elevator_queue *e = q->elevator;
Jens Axboe98170642006-07-28 09:23:08 +0200338 struct hlist_head *hash_list = &e->hash[ELV_HASH_FN(offset)];
339 struct hlist_node *entry, *next;
340 struct request *rq;
341
342 hlist_for_each_entry_safe(rq, entry, next, hash_list, hash) {
343 BUG_ON(!ELV_ON_HASH(rq));
344
345 if (unlikely(!rq_mergeable(rq))) {
346 __elv_rqhash_del(rq);
347 continue;
348 }
349
350 if (rq_hash_key(rq) == offset)
351 return rq;
352 }
353
354 return NULL;
355}
356
Tejun Heo8922e162005-10-20 16:23:44 +0200357/*
Jens Axboe2e662b62006-07-13 11:55:04 +0200358 * RB-tree support functions for inserting/lookup/removal of requests
359 * in a sorted RB tree.
360 */
361struct request *elv_rb_add(struct rb_root *root, struct request *rq)
362{
363 struct rb_node **p = &root->rb_node;
364 struct rb_node *parent = NULL;
365 struct request *__rq;
366
367 while (*p) {
368 parent = *p;
369 __rq = rb_entry(parent, struct request, rb_node);
370
Tejun Heo83096eb2009-05-07 22:24:39 +0900371 if (blk_rq_pos(rq) < blk_rq_pos(__rq))
Jens Axboe2e662b62006-07-13 11:55:04 +0200372 p = &(*p)->rb_left;
Tejun Heo83096eb2009-05-07 22:24:39 +0900373 else if (blk_rq_pos(rq) > blk_rq_pos(__rq))
Jens Axboe2e662b62006-07-13 11:55:04 +0200374 p = &(*p)->rb_right;
375 else
376 return __rq;
377 }
378
379 rb_link_node(&rq->rb_node, parent, p);
380 rb_insert_color(&rq->rb_node, root);
381 return NULL;
382}
Jens Axboe2e662b62006-07-13 11:55:04 +0200383EXPORT_SYMBOL(elv_rb_add);
384
385void elv_rb_del(struct rb_root *root, struct request *rq)
386{
387 BUG_ON(RB_EMPTY_NODE(&rq->rb_node));
388 rb_erase(&rq->rb_node, root);
389 RB_CLEAR_NODE(&rq->rb_node);
390}
Jens Axboe2e662b62006-07-13 11:55:04 +0200391EXPORT_SYMBOL(elv_rb_del);
392
393struct request *elv_rb_find(struct rb_root *root, sector_t sector)
394{
395 struct rb_node *n = root->rb_node;
396 struct request *rq;
397
398 while (n) {
399 rq = rb_entry(n, struct request, rb_node);
400
Tejun Heo83096eb2009-05-07 22:24:39 +0900401 if (sector < blk_rq_pos(rq))
Jens Axboe2e662b62006-07-13 11:55:04 +0200402 n = n->rb_left;
Tejun Heo83096eb2009-05-07 22:24:39 +0900403 else if (sector > blk_rq_pos(rq))
Jens Axboe2e662b62006-07-13 11:55:04 +0200404 n = n->rb_right;
405 else
406 return rq;
407 }
408
409 return NULL;
410}
Jens Axboe2e662b62006-07-13 11:55:04 +0200411EXPORT_SYMBOL(elv_rb_find);
412
413/*
Tejun Heo8922e162005-10-20 16:23:44 +0200414 * Insert rq into dispatch queue of q. Queue lock must be held on
Uwe Kleine-Königdbe7f762007-10-20 01:55:04 +0200415 * entry. rq is sort instead into the dispatch queue. To be used by
Jens Axboe2e662b62006-07-13 11:55:04 +0200416 * specific elevators.
Tejun Heo8922e162005-10-20 16:23:44 +0200417 */
Jens Axboe165125e2007-07-24 09:28:11 +0200418void elv_dispatch_sort(struct request_queue *q, struct request *rq)
Tejun Heo8922e162005-10-20 16:23:44 +0200419{
420 sector_t boundary;
Tejun Heo8922e162005-10-20 16:23:44 +0200421 struct list_head *entry;
Jens Axboe4eb166d2008-02-01 00:37:27 +0100422 int stop_flags;
Tejun Heo8922e162005-10-20 16:23:44 +0200423
Tejun Heo06b86242005-10-20 16:46:23 +0200424 if (q->last_merge == rq)
425 q->last_merge = NULL;
Jens Axboe98170642006-07-28 09:23:08 +0200426
427 elv_rqhash_del(q, rq);
428
Tejun Heo15853af2005-11-10 08:52:05 +0100429 q->nr_sorted--;
Tejun Heo06b86242005-10-20 16:46:23 +0200430
Jens Axboe1b47f532005-10-20 16:37:00 +0200431 boundary = q->end_sector;
Jens Axboe4eb166d2008-02-01 00:37:27 +0100432 stop_flags = REQ_SOFTBARRIER | REQ_HARDBARRIER | REQ_STARTED;
Tejun Heo8922e162005-10-20 16:23:44 +0200433 list_for_each_prev(entry, &q->queue_head) {
434 struct request *pos = list_entry_rq(entry);
435
Christoph Hellwig33659eb2010-08-07 18:17:56 +0200436 if ((rq->cmd_flags & REQ_DISCARD) !=
437 (pos->cmd_flags & REQ_DISCARD))
David Woodhousee17fc0a2008-08-09 16:42:20 +0100438 break;
Jens Axboe783660b2007-01-19 11:27:47 +1100439 if (rq_data_dir(rq) != rq_data_dir(pos))
440 break;
Jens Axboe4eb166d2008-02-01 00:37:27 +0100441 if (pos->cmd_flags & stop_flags)
Tejun Heo8922e162005-10-20 16:23:44 +0200442 break;
Tejun Heo83096eb2009-05-07 22:24:39 +0900443 if (blk_rq_pos(rq) >= boundary) {
444 if (blk_rq_pos(pos) < boundary)
Tejun Heo8922e162005-10-20 16:23:44 +0200445 continue;
446 } else {
Tejun Heo83096eb2009-05-07 22:24:39 +0900447 if (blk_rq_pos(pos) >= boundary)
Tejun Heo8922e162005-10-20 16:23:44 +0200448 break;
449 }
Tejun Heo83096eb2009-05-07 22:24:39 +0900450 if (blk_rq_pos(rq) >= blk_rq_pos(pos))
Tejun Heo8922e162005-10-20 16:23:44 +0200451 break;
452 }
453
454 list_add(&rq->queuelist, entry);
455}
Jens Axboe2e662b62006-07-13 11:55:04 +0200456EXPORT_SYMBOL(elv_dispatch_sort);
457
Jens Axboe98170642006-07-28 09:23:08 +0200458/*
Jens Axboe2e662b62006-07-13 11:55:04 +0200459 * Insert rq into dispatch queue of q. Queue lock must be held on
460 * entry. rq is added to the back of the dispatch queue. To be used by
461 * specific elevators.
Jens Axboe98170642006-07-28 09:23:08 +0200462 */
463void elv_dispatch_add_tail(struct request_queue *q, struct request *rq)
464{
465 if (q->last_merge == rq)
466 q->last_merge = NULL;
467
468 elv_rqhash_del(q, rq);
469
470 q->nr_sorted--;
471
472 q->end_sector = rq_end_sector(rq);
473 q->boundary_rq = rq;
474 list_add_tail(&rq->queuelist, &q->queue_head);
475}
Jens Axboe2e662b62006-07-13 11:55:04 +0200476EXPORT_SYMBOL(elv_dispatch_add_tail);
477
Jens Axboe165125e2007-07-24 09:28:11 +0200478int elv_merge(struct request_queue *q, struct request **req, struct bio *bio)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700479{
Jens Axboeb374d182008-10-31 10:05:07 +0100480 struct elevator_queue *e = q->elevator;
Jens Axboe98170642006-07-28 09:23:08 +0200481 struct request *__rq;
Tejun Heo06b86242005-10-20 16:46:23 +0200482 int ret;
483
Jens Axboe98170642006-07-28 09:23:08 +0200484 /*
Alan D. Brunelle488991e2010-01-29 09:04:08 +0100485 * Levels of merges:
486 * nomerges: No merges at all attempted
487 * noxmerges: Only simple one-hit cache try
488 * merges: All merge tries attempted
489 */
490 if (blk_queue_nomerges(q))
491 return ELEVATOR_NO_MERGE;
492
493 /*
Jens Axboe98170642006-07-28 09:23:08 +0200494 * First try one-hit cache.
495 */
Tejun Heo06b86242005-10-20 16:46:23 +0200496 if (q->last_merge) {
497 ret = elv_try_merge(q->last_merge, bio);
498 if (ret != ELEVATOR_NO_MERGE) {
499 *req = q->last_merge;
500 return ret;
501 }
502 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700503
Alan D. Brunelle488991e2010-01-29 09:04:08 +0100504 if (blk_queue_noxmerges(q))
Alan D. Brunelleac9fafa2008-04-29 14:44:19 +0200505 return ELEVATOR_NO_MERGE;
506
Jens Axboe98170642006-07-28 09:23:08 +0200507 /*
508 * See if our hash lookup can find a potential backmerge.
509 */
510 __rq = elv_rqhash_find(q, bio->bi_sector);
511 if (__rq && elv_rq_merge_ok(__rq, bio)) {
512 *req = __rq;
513 return ELEVATOR_BACK_MERGE;
514 }
515
Linus Torvalds1da177e2005-04-16 15:20:36 -0700516 if (e->ops->elevator_merge_fn)
517 return e->ops->elevator_merge_fn(q, req, bio);
518
519 return ELEVATOR_NO_MERGE;
520}
521
Jens Axboe165125e2007-07-24 09:28:11 +0200522void elv_merged_request(struct request_queue *q, struct request *rq, int type)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700523{
Jens Axboeb374d182008-10-31 10:05:07 +0100524 struct elevator_queue *e = q->elevator;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700525
526 if (e->ops->elevator_merged_fn)
Jens Axboe2e662b62006-07-13 11:55:04 +0200527 e->ops->elevator_merged_fn(q, rq, type);
Tejun Heo06b86242005-10-20 16:46:23 +0200528
Jens Axboe2e662b62006-07-13 11:55:04 +0200529 if (type == ELEVATOR_BACK_MERGE)
530 elv_rqhash_reposition(q, rq);
Jens Axboe98170642006-07-28 09:23:08 +0200531
Tejun Heo06b86242005-10-20 16:46:23 +0200532 q->last_merge = rq;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700533}
534
Jens Axboe165125e2007-07-24 09:28:11 +0200535void elv_merge_requests(struct request_queue *q, struct request *rq,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700536 struct request *next)
537{
Jens Axboeb374d182008-10-31 10:05:07 +0100538 struct elevator_queue *e = q->elevator;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700539
Linus Torvalds1da177e2005-04-16 15:20:36 -0700540 if (e->ops->elevator_merge_req_fn)
541 e->ops->elevator_merge_req_fn(q, rq, next);
Tejun Heo06b86242005-10-20 16:46:23 +0200542
Jens Axboe98170642006-07-28 09:23:08 +0200543 elv_rqhash_reposition(q, rq);
544 elv_rqhash_del(q, next);
545
546 q->nr_sorted--;
Tejun Heo06b86242005-10-20 16:46:23 +0200547 q->last_merge = rq;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700548}
549
Divyesh Shah812d4022010-04-08 21:14:23 -0700550void elv_bio_merged(struct request_queue *q, struct request *rq,
551 struct bio *bio)
552{
553 struct elevator_queue *e = q->elevator;
554
555 if (e->ops->elevator_bio_merged_fn)
556 e->ops->elevator_bio_merged_fn(q, rq, bio);
557}
558
Jens Axboe165125e2007-07-24 09:28:11 +0200559void elv_requeue_request(struct request_queue *q, struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700560{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700561 /*
562 * it already went through dequeue, we need to decrement the
563 * in_flight count again
564 */
Tejun Heo8922e162005-10-20 16:23:44 +0200565 if (blk_account_rq(rq)) {
Jens Axboe0a7ae2f2009-05-20 08:54:31 +0200566 q->in_flight[rq_is_sync(rq)]--;
Christoph Hellwig33659eb2010-08-07 18:17:56 +0200567 if (rq->cmd_flags & REQ_SORTED)
Jens Axboecad97512007-01-14 22:26:09 +1100568 elv_deactivate_rq(q, rq);
Tejun Heo8922e162005-10-20 16:23:44 +0200569 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700570
Jens Axboe4aff5e22006-08-10 08:44:47 +0200571 rq->cmd_flags &= ~REQ_STARTED;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700572
Tejun Heo30e96562006-02-08 01:01:31 -0800573 elv_insert(q, rq, ELEVATOR_INSERT_REQUEUE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700574}
575
Jerome Marchand26308ea2009-03-27 10:31:51 +0100576void elv_drain_elevator(struct request_queue *q)
Tejun Heo15853af2005-11-10 08:52:05 +0100577{
578 static int printed;
579 while (q->elevator->ops->elevator_dispatch_fn(q, 1))
580 ;
581 if (q->nr_sorted == 0)
582 return;
583 if (printed++ < 10) {
584 printk(KERN_ERR "%s: forced dispatching is broken "
585 "(nr_sorted=%u), please report this\n",
586 q->elevator->elevator_type->elevator_name, q->nr_sorted);
587 }
588}
589
Jens Axboe6c7e8ce2009-03-27 10:30:47 +0100590/*
591 * Call with queue lock held, interrupts disabled
592 */
Jens Axboef600abe2009-04-08 14:22:01 +0200593void elv_quiesce_start(struct request_queue *q)
Jens Axboe6c7e8ce2009-03-27 10:30:47 +0100594{
Martin K. Petersencd43e262009-05-22 17:17:52 -0400595 if (!q->elevator)
596 return;
597
Jens Axboe6c7e8ce2009-03-27 10:30:47 +0100598 queue_flag_set(QUEUE_FLAG_ELVSWITCH, q);
599
600 /*
601 * make sure we don't have any requests in flight
602 */
603 elv_drain_elevator(q);
604 while (q->rq.elvpriv) {
Tejun Heoa7f55792009-04-23 11:05:17 +0900605 __blk_run_queue(q);
Jens Axboe6c7e8ce2009-03-27 10:30:47 +0100606 spin_unlock_irq(q->queue_lock);
607 msleep(10);
608 spin_lock_irq(q->queue_lock);
609 elv_drain_elevator(q);
610 }
611}
612
Jens Axboef600abe2009-04-08 14:22:01 +0200613void elv_quiesce_end(struct request_queue *q)
Jens Axboe6c7e8ce2009-03-27 10:30:47 +0100614{
615 queue_flag_clear(QUEUE_FLAG_ELVSWITCH, q);
616}
617
Jens Axboe165125e2007-07-24 09:28:11 +0200618void elv_insert(struct request_queue *q, struct request *rq, int where)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700619{
Tejun Heo797e7db2006-01-06 09:51:03 +0100620 struct list_head *pos;
621 unsigned ordseq;
Jens Axboedac07ec2006-05-11 08:20:16 +0200622 int unplug_it = 1;
Tejun Heo797e7db2006-01-06 09:51:03 +0100623
Arnaldo Carvalho de Melo5f3ea372008-10-30 08:34:33 +0100624 trace_block_rq_insert(q, rq);
Jens Axboe2056a782006-03-23 20:00:26 +0100625
Linus Torvalds1da177e2005-04-16 15:20:36 -0700626 rq->q = q;
627
Tejun Heo8922e162005-10-20 16:23:44 +0200628 switch (where) {
629 case ELEVATOR_INSERT_FRONT:
Jens Axboe4aff5e22006-08-10 08:44:47 +0200630 rq->cmd_flags |= REQ_SOFTBARRIER;
Tejun Heo8922e162005-10-20 16:23:44 +0200631
632 list_add(&rq->queuelist, &q->queue_head);
633 break;
634
635 case ELEVATOR_INSERT_BACK:
Jens Axboe4aff5e22006-08-10 08:44:47 +0200636 rq->cmd_flags |= REQ_SOFTBARRIER;
Tejun Heo15853af2005-11-10 08:52:05 +0100637 elv_drain_elevator(q);
Tejun Heo8922e162005-10-20 16:23:44 +0200638 list_add_tail(&rq->queuelist, &q->queue_head);
639 /*
640 * We kick the queue here for the following reasons.
641 * - The elevator might have returned NULL previously
642 * to delay requests and returned them now. As the
643 * queue wasn't empty before this request, ll_rw_blk
644 * won't run the queue on return, resulting in hang.
645 * - Usually, back inserted requests won't be merged
646 * with anything. There's no point in delaying queue
647 * processing.
648 */
Tejun Heoa7f55792009-04-23 11:05:17 +0900649 __blk_run_queue(q);
Tejun Heo8922e162005-10-20 16:23:44 +0200650 break;
651
652 case ELEVATOR_INSERT_SORT:
Christoph Hellwig33659eb2010-08-07 18:17:56 +0200653 BUG_ON(rq->cmd_type != REQ_TYPE_FS &&
654 !(rq->cmd_flags & REQ_DISCARD));
Jens Axboe4aff5e22006-08-10 08:44:47 +0200655 rq->cmd_flags |= REQ_SORTED;
Tejun Heo15853af2005-11-10 08:52:05 +0100656 q->nr_sorted++;
Jens Axboe98170642006-07-28 09:23:08 +0200657 if (rq_mergeable(rq)) {
658 elv_rqhash_add(q, rq);
659 if (!q->last_merge)
660 q->last_merge = rq;
661 }
662
Tejun Heoca235092005-11-01 17:23:49 +0900663 /*
664 * Some ioscheds (cfq) run q->request_fn directly, so
665 * rq cannot be accessed after calling
666 * elevator_add_req_fn.
667 */
668 q->elevator->ops->elevator_add_req_fn(q, rq);
Tejun Heo8922e162005-10-20 16:23:44 +0200669 break;
670
Tejun Heo797e7db2006-01-06 09:51:03 +0100671 case ELEVATOR_INSERT_REQUEUE:
672 /*
673 * If ordered flush isn't in progress, we do front
674 * insertion; otherwise, requests should be requeued
675 * in ordseq order.
676 */
Jens Axboe4aff5e22006-08-10 08:44:47 +0200677 rq->cmd_flags |= REQ_SOFTBARRIER;
Tejun Heo797e7db2006-01-06 09:51:03 +0100678
Linas Vepstas95543172007-01-23 19:40:54 +0100679 /*
680 * Most requeues happen because of a busy condition,
681 * don't force unplug of the queue for that case.
682 */
683 unplug_it = 0;
684
Tejun Heo797e7db2006-01-06 09:51:03 +0100685 if (q->ordseq == 0) {
686 list_add(&rq->queuelist, &q->queue_head);
687 break;
688 }
689
690 ordseq = blk_ordered_req_seq(rq);
691
692 list_for_each(pos, &q->queue_head) {
693 struct request *pos_rq = list_entry_rq(pos);
694 if (ordseq <= blk_ordered_req_seq(pos_rq))
695 break;
696 }
697
698 list_add_tail(&rq->queuelist, pos);
699 break;
700
Tejun Heo8922e162005-10-20 16:23:44 +0200701 default:
702 printk(KERN_ERR "%s: bad insertion point %d\n",
Harvey Harrison24c03d42008-05-01 04:35:17 -0700703 __func__, where);
Tejun Heo8922e162005-10-20 16:23:44 +0200704 BUG();
705 }
706
Jens Axboedac07ec2006-05-11 08:20:16 +0200707 if (unplug_it && blk_queue_plugged(q)) {
Jens Axboe1faa16d2009-04-06 14:48:01 +0200708 int nrq = q->rq.count[BLK_RW_SYNC] + q->rq.count[BLK_RW_ASYNC]
Jens Axboe0a7ae2f2009-05-20 08:54:31 +0200709 - queue_in_flight(q);
Tejun Heo8922e162005-10-20 16:23:44 +0200710
711 if (nrq >= q->unplug_thresh)
712 __generic_unplug_device(q);
713 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700714}
715
Jens Axboe165125e2007-07-24 09:28:11 +0200716void __elv_add_request(struct request_queue *q, struct request *rq, int where,
Tejun Heo30e96562006-02-08 01:01:31 -0800717 int plug)
718{
719 if (q->ordcolor)
Jens Axboe4aff5e22006-08-10 08:44:47 +0200720 rq->cmd_flags |= REQ_ORDERED_COLOR;
Tejun Heo30e96562006-02-08 01:01:31 -0800721
Jens Axboe4aff5e22006-08-10 08:44:47 +0200722 if (rq->cmd_flags & (REQ_SOFTBARRIER | REQ_HARDBARRIER)) {
Tejun Heo30e96562006-02-08 01:01:31 -0800723 /*
724 * toggle ordered color
725 */
Christoph Hellwig33659eb2010-08-07 18:17:56 +0200726 if (rq->cmd_flags & REQ_HARDBARRIER)
Tejun Heo30e96562006-02-08 01:01:31 -0800727 q->ordcolor ^= 1;
728
729 /*
730 * barriers implicitly indicate back insertion
731 */
732 if (where == ELEVATOR_INSERT_SORT)
733 where = ELEVATOR_INSERT_BACK;
734
735 /*
736 * this request is scheduling boundary, update
737 * end_sector
738 */
Christoph Hellwig33659eb2010-08-07 18:17:56 +0200739 if (rq->cmd_type == REQ_TYPE_FS ||
740 (rq->cmd_flags & REQ_DISCARD)) {
Tejun Heo30e96562006-02-08 01:01:31 -0800741 q->end_sector = rq_end_sector(rq);
742 q->boundary_rq = rq;
743 }
Jens Axboe4eb166d2008-02-01 00:37:27 +0100744 } else if (!(rq->cmd_flags & REQ_ELVPRIV) &&
745 where == ELEVATOR_INSERT_SORT)
Tejun Heo30e96562006-02-08 01:01:31 -0800746 where = ELEVATOR_INSERT_BACK;
747
748 if (plug)
749 blk_plug_device(q);
750
751 elv_insert(q, rq, where);
752}
Jens Axboe2e662b62006-07-13 11:55:04 +0200753EXPORT_SYMBOL(__elv_add_request);
754
Jens Axboe165125e2007-07-24 09:28:11 +0200755void elv_add_request(struct request_queue *q, struct request *rq, int where,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700756 int plug)
757{
758 unsigned long flags;
759
760 spin_lock_irqsave(q->queue_lock, flags);
761 __elv_add_request(q, rq, where, plug);
762 spin_unlock_irqrestore(q->queue_lock, flags);
763}
Jens Axboe2e662b62006-07-13 11:55:04 +0200764EXPORT_SYMBOL(elv_add_request);
765
Jens Axboe165125e2007-07-24 09:28:11 +0200766int elv_queue_empty(struct request_queue *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700767{
Jens Axboeb374d182008-10-31 10:05:07 +0100768 struct elevator_queue *e = q->elevator;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700769
Tejun Heo8922e162005-10-20 16:23:44 +0200770 if (!list_empty(&q->queue_head))
771 return 0;
772
Linus Torvalds1da177e2005-04-16 15:20:36 -0700773 if (e->ops->elevator_queue_empty_fn)
774 return e->ops->elevator_queue_empty_fn(q);
775
Tejun Heo8922e162005-10-20 16:23:44 +0200776 return 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700777}
Jens Axboe2e662b62006-07-13 11:55:04 +0200778EXPORT_SYMBOL(elv_queue_empty);
779
Jens Axboe165125e2007-07-24 09:28:11 +0200780struct request *elv_latter_request(struct request_queue *q, struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700781{
Jens Axboeb374d182008-10-31 10:05:07 +0100782 struct elevator_queue *e = q->elevator;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700783
784 if (e->ops->elevator_latter_req_fn)
785 return e->ops->elevator_latter_req_fn(q, rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700786 return NULL;
787}
788
Jens Axboe165125e2007-07-24 09:28:11 +0200789struct request *elv_former_request(struct request_queue *q, struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700790{
Jens Axboeb374d182008-10-31 10:05:07 +0100791 struct elevator_queue *e = q->elevator;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700792
793 if (e->ops->elevator_former_req_fn)
794 return e->ops->elevator_former_req_fn(q, rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700795 return NULL;
796}
797
Jens Axboe165125e2007-07-24 09:28:11 +0200798int elv_set_request(struct request_queue *q, struct request *rq, gfp_t gfp_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700799{
Jens Axboeb374d182008-10-31 10:05:07 +0100800 struct elevator_queue *e = q->elevator;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700801
802 if (e->ops->elevator_set_req_fn)
Jens Axboecb78b282006-07-28 09:32:57 +0200803 return e->ops->elevator_set_req_fn(q, rq, gfp_mask);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700804
805 rq->elevator_private = NULL;
806 return 0;
807}
808
Jens Axboe165125e2007-07-24 09:28:11 +0200809void elv_put_request(struct request_queue *q, struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700810{
Jens Axboeb374d182008-10-31 10:05:07 +0100811 struct elevator_queue *e = q->elevator;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700812
813 if (e->ops->elevator_put_req_fn)
Jens Axboebb37b942006-12-01 10:42:33 +0100814 e->ops->elevator_put_req_fn(rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700815}
816
Jens Axboe165125e2007-07-24 09:28:11 +0200817int elv_may_queue(struct request_queue *q, int rw)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700818{
Jens Axboeb374d182008-10-31 10:05:07 +0100819 struct elevator_queue *e = q->elevator;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700820
821 if (e->ops->elevator_may_queue_fn)
Jens Axboecb78b282006-07-28 09:32:57 +0200822 return e->ops->elevator_may_queue_fn(q, rw);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700823
824 return ELV_MQUEUE_MAY;
825}
826
Mike Anderson11914a52008-09-13 20:31:27 +0200827void elv_abort_queue(struct request_queue *q)
828{
829 struct request *rq;
830
831 while (!list_empty(&q->queue_head)) {
832 rq = list_entry_rq(q->queue_head.next);
833 rq->cmd_flags |= REQ_QUIET;
Arnaldo Carvalho de Melo5f3ea372008-10-30 08:34:33 +0100834 trace_block_rq_abort(q, rq);
Kiyoshi Ueda53c663c2009-06-02 08:44:01 +0200835 /*
836 * Mark this request as started so we don't trigger
837 * any debug logic in the end I/O path.
838 */
839 blk_start_request(rq);
Tejun Heo40cbbb72009-04-23 11:05:19 +0900840 __blk_end_request_all(rq, -EIO);
Mike Anderson11914a52008-09-13 20:31:27 +0200841 }
842}
843EXPORT_SYMBOL(elv_abort_queue);
844
Jens Axboe165125e2007-07-24 09:28:11 +0200845void elv_completed_request(struct request_queue *q, struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700846{
Jens Axboeb374d182008-10-31 10:05:07 +0100847 struct elevator_queue *e = q->elevator;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700848
849 /*
850 * request is released from the driver, io must be done
851 */
Tejun Heo8922e162005-10-20 16:23:44 +0200852 if (blk_account_rq(rq)) {
Jens Axboe0a7ae2f2009-05-20 08:54:31 +0200853 q->in_flight[rq_is_sync(rq)]--;
Christoph Hellwig33659eb2010-08-07 18:17:56 +0200854 if ((rq->cmd_flags & REQ_SORTED) &&
855 e->ops->elevator_completed_req_fn)
Tejun Heo1bc691d2006-01-12 15:39:26 +0100856 e->ops->elevator_completed_req_fn(q, rq);
857 }
Tejun Heo797e7db2006-01-06 09:51:03 +0100858
Tejun Heo1bc691d2006-01-12 15:39:26 +0100859 /*
860 * Check if the queue is waiting for fs requests to be
861 * drained for flush sequence.
862 */
863 if (unlikely(q->ordseq)) {
Tejun Heo8f11b3e2008-11-28 13:32:05 +0900864 struct request *next = NULL;
865
866 if (!list_empty(&q->queue_head))
867 next = list_entry_rq(q->queue_head.next);
868
Jens Axboe0a7ae2f2009-05-20 08:54:31 +0200869 if (!queue_in_flight(q) &&
Tejun Heo797e7db2006-01-06 09:51:03 +0100870 blk_ordered_cur_seq(q) == QUEUE_ORDSEQ_DRAIN &&
Tejun Heo8f11b3e2008-11-28 13:32:05 +0900871 (!next || blk_ordered_req_seq(next) > QUEUE_ORDSEQ_DRAIN)) {
Tejun Heo797e7db2006-01-06 09:51:03 +0100872 blk_ordered_complete_seq(q, QUEUE_ORDSEQ_DRAIN, 0);
Tejun Heoa7f55792009-04-23 11:05:17 +0900873 __blk_run_queue(q);
Tejun Heo797e7db2006-01-06 09:51:03 +0100874 }
Tejun Heo8922e162005-10-20 16:23:44 +0200875 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700876}
877
Al Viro3d1ab402006-03-18 18:35:43 -0500878#define to_elv(atr) container_of((atr), struct elv_fs_entry, attr)
879
880static ssize_t
881elv_attr_show(struct kobject *kobj, struct attribute *attr, char *page)
882{
Al Viro3d1ab402006-03-18 18:35:43 -0500883 struct elv_fs_entry *entry = to_elv(attr);
Jens Axboeb374d182008-10-31 10:05:07 +0100884 struct elevator_queue *e;
Al Viro3d1ab402006-03-18 18:35:43 -0500885 ssize_t error;
886
887 if (!entry->show)
888 return -EIO;
889
Jens Axboeb374d182008-10-31 10:05:07 +0100890 e = container_of(kobj, struct elevator_queue, kobj);
Al Viro3d1ab402006-03-18 18:35:43 -0500891 mutex_lock(&e->sysfs_lock);
892 error = e->ops ? entry->show(e, page) : -ENOENT;
893 mutex_unlock(&e->sysfs_lock);
894 return error;
895}
896
897static ssize_t
898elv_attr_store(struct kobject *kobj, struct attribute *attr,
899 const char *page, size_t length)
900{
Al Viro3d1ab402006-03-18 18:35:43 -0500901 struct elv_fs_entry *entry = to_elv(attr);
Jens Axboeb374d182008-10-31 10:05:07 +0100902 struct elevator_queue *e;
Al Viro3d1ab402006-03-18 18:35:43 -0500903 ssize_t error;
904
905 if (!entry->store)
906 return -EIO;
907
Jens Axboeb374d182008-10-31 10:05:07 +0100908 e = container_of(kobj, struct elevator_queue, kobj);
Al Viro3d1ab402006-03-18 18:35:43 -0500909 mutex_lock(&e->sysfs_lock);
910 error = e->ops ? entry->store(e, page, length) : -ENOENT;
911 mutex_unlock(&e->sysfs_lock);
912 return error;
913}
914
Emese Revfy52cf25d2010-01-19 02:58:23 +0100915static const struct sysfs_ops elv_sysfs_ops = {
Al Viro3d1ab402006-03-18 18:35:43 -0500916 .show = elv_attr_show,
917 .store = elv_attr_store,
918};
919
920static struct kobj_type elv_ktype = {
921 .sysfs_ops = &elv_sysfs_ops,
922 .release = elevator_release,
923};
924
Linus Torvalds1da177e2005-04-16 15:20:36 -0700925int elv_register_queue(struct request_queue *q)
926{
Jens Axboeb374d182008-10-31 10:05:07 +0100927 struct elevator_queue *e = q->elevator;
Al Viro3d1ab402006-03-18 18:35:43 -0500928 int error;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700929
Greg Kroah-Hartmanb2d6db52007-12-17 23:05:35 -0700930 error = kobject_add(&e->kobj, &q->kobj, "%s", "iosched");
Al Viro3d1ab402006-03-18 18:35:43 -0500931 if (!error) {
Al Viroe572ec72006-03-18 22:27:18 -0500932 struct elv_fs_entry *attr = e->elevator_type->elevator_attrs;
Al Viro3d1ab402006-03-18 18:35:43 -0500933 if (attr) {
Al Viroe572ec72006-03-18 22:27:18 -0500934 while (attr->attr.name) {
935 if (sysfs_create_file(&e->kobj, &attr->attr))
Al Viro3d1ab402006-03-18 18:35:43 -0500936 break;
Al Viroe572ec72006-03-18 22:27:18 -0500937 attr++;
Al Viro3d1ab402006-03-18 18:35:43 -0500938 }
939 }
940 kobject_uevent(&e->kobj, KOBJ_ADD);
941 }
942 return error;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700943}
Mike Snitzer01effb02010-05-11 08:57:42 +0200944EXPORT_SYMBOL(elv_register_queue);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700945
Jens Axboeb374d182008-10-31 10:05:07 +0100946static void __elv_unregister_queue(struct elevator_queue *e)
Jens Axboebc1c1162006-06-08 08:49:06 +0200947{
948 kobject_uevent(&e->kobj, KOBJ_REMOVE);
949 kobject_del(&e->kobj);
950}
951
Linus Torvalds1da177e2005-04-16 15:20:36 -0700952void elv_unregister_queue(struct request_queue *q)
953{
Jens Axboebc1c1162006-06-08 08:49:06 +0200954 if (q)
955 __elv_unregister_queue(q->elevator);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700956}
Mike Snitzer01effb02010-05-11 08:57:42 +0200957EXPORT_SYMBOL(elv_unregister_queue);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700958
Adrian Bunk2fdd82b2007-12-12 18:51:56 +0100959void elv_register(struct elevator_type *e)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700960{
Thibaut VARENE1ffb96c2007-03-15 12:59:19 +0100961 char *def = "";
Jens Axboe2a12dcd2007-04-26 14:41:53 +0200962
963 spin_lock(&elv_list_lock);
Eric Sesterhennce524492006-03-24 18:43:26 +0100964 BUG_ON(elevator_find(e->elevator_name));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700965 list_add_tail(&e->list, &elv_list);
Jens Axboe2a12dcd2007-04-26 14:41:53 +0200966 spin_unlock(&elv_list_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700967
Nate Diller5f003972006-01-24 10:07:58 +0100968 if (!strcmp(e->elevator_name, chosen_elevator) ||
969 (!*chosen_elevator &&
970 !strcmp(e->elevator_name, CONFIG_DEFAULT_IOSCHED)))
Thibaut VARENE1ffb96c2007-03-15 12:59:19 +0100971 def = " (default)";
972
Jens Axboe4eb166d2008-02-01 00:37:27 +0100973 printk(KERN_INFO "io scheduler %s registered%s\n", e->elevator_name,
974 def);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700975}
976EXPORT_SYMBOL_GPL(elv_register);
977
978void elv_unregister(struct elevator_type *e)
979{
Christoph Hellwig83521d32005-10-30 15:01:39 -0800980 struct task_struct *g, *p;
981
982 /*
983 * Iterate every thread in the process to remove the io contexts.
984 */
Al Viroe17a9482006-03-18 13:21:20 -0500985 if (e->ops.trim) {
986 read_lock(&tasklist_lock);
987 do_each_thread(g, p) {
988 task_lock(p);
Oleg Nesterov2d8f6132006-08-22 21:22:13 +0400989 if (p->io_context)
990 e->ops.trim(p->io_context);
Al Viroe17a9482006-03-18 13:21:20 -0500991 task_unlock(p);
992 } while_each_thread(g, p);
993 read_unlock(&tasklist_lock);
994 }
Christoph Hellwig83521d32005-10-30 15:01:39 -0800995
Jens Axboe2a12dcd2007-04-26 14:41:53 +0200996 spin_lock(&elv_list_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700997 list_del_init(&e->list);
Jens Axboe2a12dcd2007-04-26 14:41:53 +0200998 spin_unlock(&elv_list_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700999}
1000EXPORT_SYMBOL_GPL(elv_unregister);
1001
1002/*
1003 * switch to new_e io scheduler. be careful not to introduce deadlocks -
1004 * we don't free the old io scheduler, before we have allocated what we
1005 * need for the new one. this way we have a chance of going back to the old
Tejun Heocb98fc82005-10-28 08:29:39 +02001006 * one, if the new one fails init for some reason.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001007 */
Jens Axboe165125e2007-07-24 09:28:11 +02001008static int elevator_switch(struct request_queue *q, struct elevator_type *new_e)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001009{
Jens Axboeb374d182008-10-31 10:05:07 +01001010 struct elevator_queue *old_elevator, *e;
Jens Axboebc1c1162006-06-08 08:49:06 +02001011 void *data;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001012
Tejun Heocb98fc82005-10-28 08:29:39 +02001013 /*
1014 * Allocate new elevator
1015 */
Jens Axboeb5deef92006-07-19 23:39:40 +02001016 e = elevator_alloc(q, new_e);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001017 if (!e)
Al Viro3d1ab402006-03-18 18:35:43 -05001018 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001019
Jens Axboebc1c1162006-06-08 08:49:06 +02001020 data = elevator_init_queue(q, e);
1021 if (!data) {
1022 kobject_put(&e->kobj);
1023 return 0;
1024 }
1025
Linus Torvalds1da177e2005-04-16 15:20:36 -07001026 /*
Tejun Heocb98fc82005-10-28 08:29:39 +02001027 * Turn on BYPASS and drain all requests w/ elevator private data
Linus Torvalds1da177e2005-04-16 15:20:36 -07001028 */
Tejun Heocb98fc82005-10-28 08:29:39 +02001029 spin_lock_irq(q->queue_lock);
Jens Axboef600abe2009-04-08 14:22:01 +02001030 elv_quiesce_start(q);
Tejun Heocb98fc82005-10-28 08:29:39 +02001031
Linus Torvalds1da177e2005-04-16 15:20:36 -07001032 /*
Jens Axboebc1c1162006-06-08 08:49:06 +02001033 * Remember old elevator.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001034 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001035 old_elevator = q->elevator;
1036
1037 /*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001038 * attach and start new elevator
1039 */
Jens Axboebc1c1162006-06-08 08:49:06 +02001040 elevator_attach(q, e, data);
1041
1042 spin_unlock_irq(q->queue_lock);
1043
1044 __elv_unregister_queue(old_elevator);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001045
1046 if (elv_register_queue(q))
1047 goto fail_register;
1048
1049 /*
Tejun Heocb98fc82005-10-28 08:29:39 +02001050 * finally exit old elevator and turn off BYPASS.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001051 */
1052 elevator_exit(old_elevator);
Nick Piggin75ad23b2008-04-29 14:48:33 +02001053 spin_lock_irq(q->queue_lock);
Jens Axboef600abe2009-04-08 14:22:01 +02001054 elv_quiesce_end(q);
Nick Piggin75ad23b2008-04-29 14:48:33 +02001055 spin_unlock_irq(q->queue_lock);
1056
Alan D. Brunelle4722dc52008-05-27 14:55:00 +02001057 blk_add_trace_msg(q, "elv switch: %s", e->elevator_type->elevator_name);
1058
Al Viro3d1ab402006-03-18 18:35:43 -05001059 return 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001060
1061fail_register:
1062 /*
1063 * switch failed, exit the new io scheduler and reattach the old
1064 * one again (along with re-adding the sysfs dir)
1065 */
1066 elevator_exit(e);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001067 q->elevator = old_elevator;
1068 elv_register_queue(q);
Nick Piggin75ad23b2008-04-29 14:48:33 +02001069
1070 spin_lock_irq(q->queue_lock);
1071 queue_flag_clear(QUEUE_FLAG_ELVSWITCH, q);
1072 spin_unlock_irq(q->queue_lock);
1073
Al Viro3d1ab402006-03-18 18:35:43 -05001074 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001075}
1076
Jens Axboe165125e2007-07-24 09:28:11 +02001077ssize_t elv_iosched_store(struct request_queue *q, const char *name,
1078 size_t count)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001079{
1080 char elevator_name[ELV_NAME_MAX];
1081 struct elevator_type *e;
1082
Martin K. Petersencd43e262009-05-22 17:17:52 -04001083 if (!q->elevator)
1084 return count;
1085
Li Zefanee2e9922008-10-14 08:49:56 +02001086 strlcpy(elevator_name, name, sizeof(elevator_name));
KOSAKI Motohiro8c279592009-10-09 08:48:08 +02001087 e = elevator_get(strstrip(elevator_name));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001088 if (!e) {
1089 printk(KERN_ERR "elevator: type %s not found\n", elevator_name);
1090 return -EINVAL;
1091 }
1092
Nate Diller2ca7d932005-10-30 15:02:24 -08001093 if (!strcmp(elevator_name, q->elevator->elevator_type->elevator_name)) {
1094 elevator_put(e);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001095 return count;
Nate Diller2ca7d932005-10-30 15:02:24 -08001096 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001097
Al Viro3d1ab402006-03-18 18:35:43 -05001098 if (!elevator_switch(q, e))
Jens Axboe4eb166d2008-02-01 00:37:27 +01001099 printk(KERN_ERR "elevator: switch to %s failed\n",
1100 elevator_name);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001101 return count;
1102}
1103
Jens Axboe165125e2007-07-24 09:28:11 +02001104ssize_t elv_iosched_show(struct request_queue *q, char *name)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001105{
Jens Axboeb374d182008-10-31 10:05:07 +01001106 struct elevator_queue *e = q->elevator;
Martin K. Petersencd43e262009-05-22 17:17:52 -04001107 struct elevator_type *elv;
Matthias Kaehlcke70cee262007-07-10 12:26:24 +02001108 struct elevator_type *__e;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001109 int len = 0;
1110
Mike Snitzere36f7242010-05-24 09:07:32 +02001111 if (!q->elevator || !blk_queue_stackable(q))
Martin K. Petersencd43e262009-05-22 17:17:52 -04001112 return sprintf(name, "none\n");
1113
1114 elv = e->elevator_type;
1115
Jens Axboe2a12dcd2007-04-26 14:41:53 +02001116 spin_lock(&elv_list_lock);
Matthias Kaehlcke70cee262007-07-10 12:26:24 +02001117 list_for_each_entry(__e, &elv_list, list) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001118 if (!strcmp(elv->elevator_name, __e->elevator_name))
1119 len += sprintf(name+len, "[%s] ", elv->elevator_name);
1120 else
1121 len += sprintf(name+len, "%s ", __e->elevator_name);
1122 }
Jens Axboe2a12dcd2007-04-26 14:41:53 +02001123 spin_unlock(&elv_list_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001124
1125 len += sprintf(len+name, "\n");
1126 return len;
1127}
1128
Jens Axboe165125e2007-07-24 09:28:11 +02001129struct request *elv_rb_former_request(struct request_queue *q,
1130 struct request *rq)
Jens Axboe2e662b62006-07-13 11:55:04 +02001131{
1132 struct rb_node *rbprev = rb_prev(&rq->rb_node);
1133
1134 if (rbprev)
1135 return rb_entry_rq(rbprev);
1136
1137 return NULL;
1138}
Jens Axboe2e662b62006-07-13 11:55:04 +02001139EXPORT_SYMBOL(elv_rb_former_request);
1140
Jens Axboe165125e2007-07-24 09:28:11 +02001141struct request *elv_rb_latter_request(struct request_queue *q,
1142 struct request *rq)
Jens Axboe2e662b62006-07-13 11:55:04 +02001143{
1144 struct rb_node *rbnext = rb_next(&rq->rb_node);
1145
1146 if (rbnext)
1147 return rb_entry_rq(rbnext);
1148
1149 return NULL;
1150}
Jens Axboe2e662b62006-07-13 11:55:04 +02001151EXPORT_SYMBOL(elv_rb_latter_request);