Blame view
block/elevator.c
24.3 KB
1da177e4c
|
1 |
/* |
1da177e4c
|
2 3 4 5 |
* Block device elevator/IO-scheduler. * * Copyright (C) 2000 Andrea Arcangeli <andrea@suse.de> SuSE * |
0fe234795
|
6 |
* 30042000 Jens Axboe <axboe@kernel.dk> : |
1da177e4c
|
7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 |
* * Split the elevator a bit so that it is possible to choose a different * one or even write a new "plug in". There are three pieces: * - elevator_fn, inserts a new request in the queue list * - elevator_merge_fn, decides whether a new buffer can be merged with * an existing request * - elevator_dequeue_fn, called when a request is taken off the active list * * 20082000 Dave Jones <davej@suse.de> : * Removed tests for max-bomb-segments, which was breaking elvtune * when run without -bN * * Jens: * - Rework again to work with bio instead of buffer_heads * - loose bi_dev comparisons, partition handling is right now * - completely modularize elevator setup and teardown * */ #include <linux/kernel.h> #include <linux/fs.h> #include <linux/blkdev.h> #include <linux/elevator.h> #include <linux/bio.h> |
1da177e4c
|
30 31 32 33 |
#include <linux/module.h> #include <linux/slab.h> #include <linux/init.h> #include <linux/compiler.h> |
cb98fc8bb
|
34 |
#include <linux/delay.h> |
2056a782f
|
35 |
#include <linux/blktrace_api.h> |
9817064b6
|
36 |
#include <linux/hash.h> |
0835da67c
|
37 |
#include <linux/uaccess.h> |
1da177e4c
|
38 |
|
55782138e
|
39 |
#include <trace/events/block.h> |
242f9dcb8
|
40 |
#include "blk.h" |
1da177e4c
|
41 42 43 44 |
static DEFINE_SPINLOCK(elv_list_lock); static LIST_HEAD(elv_list); /* |
9817064b6
|
45 46 47 48 |
* Merge hash stuff. */ static const int elv_hash_shift = 6; #define ELV_HASH_BLOCK(sec) ((sec) >> 3) |
4eb166d98
|
49 50 |
#define ELV_HASH_FN(sec) \ (hash_long(ELV_HASH_BLOCK((sec)), elv_hash_shift)) |
9817064b6
|
51 |
#define ELV_HASH_ENTRIES (1 << elv_hash_shift) |
83096ebf1
|
52 |
#define rq_hash_key(rq) (blk_rq_pos(rq) + blk_rq_sectors(rq)) |
9817064b6
|
53 54 |
/* |
da7752650
|
55 56 57 58 59 |
* Query io scheduler to see if the current process issuing bio may be * merged with rq. */ static int elv_iosched_allow_merge(struct request *rq, struct bio *bio) { |
165125e1e
|
60 |
struct request_queue *q = rq->q; |
b374d18a4
|
61 |
struct elevator_queue *e = q->elevator; |
da7752650
|
62 63 64 65 66 67 68 69 |
if (e->ops->elevator_allow_merge_fn) return e->ops->elevator_allow_merge_fn(q, rq, bio); return 1; } /* |
1da177e4c
|
70 71 |
* can we safely merge with this request? */ |
72ed0bf60
|
72 |
int elv_rq_merge_ok(struct request *rq, struct bio *bio) |
1da177e4c
|
73 74 75 76 77 |
{ if (!rq_mergeable(rq)) return 0; /* |
e17fc0a1c
|
78 79 |
* Don't merge file system requests and discard requests */ |
1f98a13f6
|
80 81 |
if (bio_rw_flagged(bio, BIO_RW_DISCARD) != bio_rw_flagged(rq->bio, BIO_RW_DISCARD)) |
e17fc0a1c
|
82 83 84 |
return 0; /* |
1da177e4c
|
85 86 87 88 89 90 |
* different data direction or already started, don't merge */ if (bio_data_dir(bio) != rq_data_dir(rq)) return 0; /* |
da7752650
|
91 |
* must be same device and not a special request |
1da177e4c
|
92 |
*/ |
bb4067e34
|
93 |
if (rq->rq_disk != bio->bi_bdev->bd_disk || rq->special) |
da7752650
|
94 |
return 0; |
7ba1ba12e
|
95 96 97 98 99 |
/* * only merge integrity protected bio into ditto rq */ if (bio_integrity(bio) != blk_integrity_rq(rq)) return 0; |
da7752650
|
100 101 |
if (!elv_iosched_allow_merge(rq, bio)) return 0; |
1da177e4c
|
102 |
|
da7752650
|
103 |
return 1; |
1da177e4c
|
104 105 |
} EXPORT_SYMBOL(elv_rq_merge_ok); |
769db45b7
|
106 |
static inline int elv_try_merge(struct request *__rq, struct bio *bio) |
1da177e4c
|
107 108 109 110 111 112 113 |
{ int ret = ELEVATOR_NO_MERGE; /* * we can merge and sequence is ok, check if it's possible */ if (elv_rq_merge_ok(__rq, bio)) { |
83096ebf1
|
114 |
if (blk_rq_pos(__rq) + blk_rq_sectors(__rq) == bio->bi_sector) |
1da177e4c
|
115 |
ret = ELEVATOR_BACK_MERGE; |
83096ebf1
|
116 |
else if (blk_rq_pos(__rq) - bio_sectors(bio) == bio->bi_sector) |
1da177e4c
|
117 118 119 120 121 |
ret = ELEVATOR_FRONT_MERGE; } return ret; } |
1da177e4c
|
122 |
|
1da177e4c
|
123 124 |
static struct elevator_type *elevator_find(const char *name) { |
a22b169df
|
125 |
struct elevator_type *e; |
1da177e4c
|
126 |
|
70cee26e0
|
127 |
list_for_each_entry(e, &elv_list, list) { |
a22b169df
|
128 129 |
if (!strcmp(e->elevator_name, name)) return e; |
1da177e4c
|
130 |
} |
1da177e4c
|
131 |
|
a22b169df
|
132 |
return NULL; |
1da177e4c
|
133 134 135 136 137 138 139 140 141 |
} static void elevator_put(struct elevator_type *e) { module_put(e->elevator_owner); } static struct elevator_type *elevator_get(const char *name) { |
2824bc932
|
142 |
struct elevator_type *e; |
1da177e4c
|
143 |
|
2a12dcd71
|
144 |
spin_lock(&elv_list_lock); |
2824bc932
|
145 146 |
e = elevator_find(name); |
e16409496
|
147 148 149 150 |
if (!e) { char elv[ELV_NAME_MAX + strlen("-iosched")]; spin_unlock(&elv_list_lock); |
492af6350
|
151 |
sprintf(elv, "%s-iosched", name); |
e16409496
|
152 |
|
e180f5949
|
153 |
request_module("%s", elv); |
e16409496
|
154 155 156 |
spin_lock(&elv_list_lock); e = elevator_find(name); } |
2824bc932
|
157 158 |
if (e && !try_module_get(e->elevator_owner)) e = NULL; |
2a12dcd71
|
159 |
spin_unlock(&elv_list_lock); |
1da177e4c
|
160 161 162 |
return e; } |
165125e1e
|
163 164 |
static void *elevator_init_queue(struct request_queue *q, struct elevator_queue *eq) |
1da177e4c
|
165 |
{ |
bb37b94c6
|
166 |
return eq->ops->elevator_init_fn(q); |
bc1c11697
|
167 |
} |
1da177e4c
|
168 |
|
165125e1e
|
169 |
static void elevator_attach(struct request_queue *q, struct elevator_queue *eq, |
bc1c11697
|
170 171 |
void *data) { |
1da177e4c
|
172 |
q->elevator = eq; |
bc1c11697
|
173 |
eq->elevator_data = data; |
1da177e4c
|
174 175 176 |
} static char chosen_elevator[16]; |
5f0039764
|
177 |
static int __init elevator_setup(char *str) |
1da177e4c
|
178 |
{ |
752a3b796
|
179 180 181 182 |
/* * Be backwards-compatible with previous kernels, so users * won't get the wrong elevator. */ |
492af6350
|
183 |
strncpy(chosen_elevator, str, sizeof(chosen_elevator) - 1); |
9b41046cd
|
184 |
return 1; |
1da177e4c
|
185 186 187 |
} __setup("elevator=", elevator_setup); |
3d1ab40f4
|
188 |
static struct kobj_type elv_ktype; |
b374d18a4
|
189 |
static struct elevator_queue *elevator_alloc(struct request_queue *q, |
165125e1e
|
190 |
struct elevator_type *e) |
3d1ab40f4
|
191 |
{ |
b374d18a4
|
192 |
struct elevator_queue *eq; |
9817064b6
|
193 |
int i; |
b374d18a4
|
194 |
eq = kmalloc_node(sizeof(*eq), GFP_KERNEL | __GFP_ZERO, q->node); |
9817064b6
|
195 196 |
if (unlikely(!eq)) goto err; |
9817064b6
|
197 198 |
eq->ops = &e->ops; eq->elevator_type = e; |
f9cb074bf
|
199 |
kobject_init(&eq->kobj, &elv_ktype); |
9817064b6
|
200 |
mutex_init(&eq->sysfs_lock); |
b5deef901
|
201 202 |
eq->hash = kmalloc_node(sizeof(struct hlist_head) * ELV_HASH_ENTRIES, GFP_KERNEL, q->node); |
9817064b6
|
203 204 205 206 207 |
if (!eq->hash) goto err; for (i = 0; i < ELV_HASH_ENTRIES; i++) INIT_HLIST_HEAD(&eq->hash[i]); |
3d1ab40f4
|
208 |
return eq; |
9817064b6
|
209 210 211 212 |
err: kfree(eq); elevator_put(e); return NULL; |
3d1ab40f4
|
213 214 215 216 |
} static void elevator_release(struct kobject *kobj) { |
b374d18a4
|
217 |
struct elevator_queue *e; |
9817064b6
|
218 |
|
b374d18a4
|
219 |
e = container_of(kobj, struct elevator_queue, kobj); |
3d1ab40f4
|
220 |
elevator_put(e->elevator_type); |
9817064b6
|
221 |
kfree(e->hash); |
3d1ab40f4
|
222 223 |
kfree(e); } |
165125e1e
|
224 |
int elevator_init(struct request_queue *q, char *name) |
1da177e4c
|
225 226 227 228 |
{ struct elevator_type *e = NULL; struct elevator_queue *eq; int ret = 0; |
bc1c11697
|
229 |
void *data; |
1da177e4c
|
230 |
|
cb98fc8bb
|
231 232 233 234 |
INIT_LIST_HEAD(&q->queue_head); q->last_merge = NULL; q->end_sector = 0; q->boundary_rq = NULL; |
cb98fc8bb
|
235 |
|
4eb166d98
|
236 237 238 239 240 |
if (name) { e = elevator_get(name); if (!e) return -EINVAL; } |
1da177e4c
|
241 |
|
4eb166d98
|
242 243 244 245 246 247 248 |
if (!e && *chosen_elevator) { e = elevator_get(chosen_elevator); if (!e) printk(KERN_ERR "I/O scheduler %s not found ", chosen_elevator); } |
248d5ca5e
|
249 |
|
4eb166d98
|
250 251 252 253 254 255 256 257 258 |
if (!e) { e = elevator_get(CONFIG_DEFAULT_IOSCHED); if (!e) { printk(KERN_ERR "Default I/O scheduler not found. " \ "Using noop. "); e = elevator_get("noop"); } |
5f0039764
|
259 |
} |
b5deef901
|
260 |
eq = elevator_alloc(q, e); |
3d1ab40f4
|
261 |
if (!eq) |
1da177e4c
|
262 |
return -ENOMEM; |
1da177e4c
|
263 |
|
bc1c11697
|
264 265 |
data = elevator_init_queue(q, eq); if (!data) { |
3d1ab40f4
|
266 |
kobject_put(&eq->kobj); |
bc1c11697
|
267 268 |
return -ENOMEM; } |
1da177e4c
|
269 |
|
bc1c11697
|
270 |
elevator_attach(q, eq, data); |
1da177e4c
|
271 272 |
return ret; } |
2e662b65f
|
273 |
EXPORT_SYMBOL(elevator_init); |
b374d18a4
|
274 |
void elevator_exit(struct elevator_queue *e) |
1da177e4c
|
275 |
{ |
3d1ab40f4
|
276 |
mutex_lock(&e->sysfs_lock); |
1da177e4c
|
277 278 |
if (e->ops->elevator_exit_fn) e->ops->elevator_exit_fn(e); |
3d1ab40f4
|
279 280 |
e->ops = NULL; mutex_unlock(&e->sysfs_lock); |
1da177e4c
|
281 |
|
3d1ab40f4
|
282 |
kobject_put(&e->kobj); |
1da177e4c
|
283 |
} |
2e662b65f
|
284 |
EXPORT_SYMBOL(elevator_exit); |
9817064b6
|
285 286 287 288 |
static inline void __elv_rqhash_del(struct request *rq) { hlist_del_init(&rq->hash); } |
165125e1e
|
289 |
static void elv_rqhash_del(struct request_queue *q, struct request *rq) |
9817064b6
|
290 291 292 293 |
{ if (ELV_ON_HASH(rq)) __elv_rqhash_del(rq); } |
165125e1e
|
294 |
static void elv_rqhash_add(struct request_queue *q, struct request *rq) |
9817064b6
|
295 |
{ |
b374d18a4
|
296 |
struct elevator_queue *e = q->elevator; |
9817064b6
|
297 298 299 300 |
BUG_ON(ELV_ON_HASH(rq)); hlist_add_head(&rq->hash, &e->hash[ELV_HASH_FN(rq_hash_key(rq))]); } |
165125e1e
|
301 |
static void elv_rqhash_reposition(struct request_queue *q, struct request *rq) |
9817064b6
|
302 303 304 305 |
{ __elv_rqhash_del(rq); elv_rqhash_add(q, rq); } |
165125e1e
|
306 |
static struct request *elv_rqhash_find(struct request_queue *q, sector_t offset) |
9817064b6
|
307 |
{ |
b374d18a4
|
308 |
struct elevator_queue *e = q->elevator; |
9817064b6
|
309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 |
struct hlist_head *hash_list = &e->hash[ELV_HASH_FN(offset)]; struct hlist_node *entry, *next; struct request *rq; hlist_for_each_entry_safe(rq, entry, next, hash_list, hash) { BUG_ON(!ELV_ON_HASH(rq)); if (unlikely(!rq_mergeable(rq))) { __elv_rqhash_del(rq); continue; } if (rq_hash_key(rq) == offset) return rq; } return NULL; } |
8922e16cf
|
327 |
/* |
2e662b65f
|
328 329 330 331 332 333 334 335 336 337 338 339 |
* RB-tree support functions for inserting/lookup/removal of requests * in a sorted RB tree. */ struct request *elv_rb_add(struct rb_root *root, struct request *rq) { struct rb_node **p = &root->rb_node; struct rb_node *parent = NULL; struct request *__rq; while (*p) { parent = *p; __rq = rb_entry(parent, struct request, rb_node); |
83096ebf1
|
340 |
if (blk_rq_pos(rq) < blk_rq_pos(__rq)) |
2e662b65f
|
341 |
p = &(*p)->rb_left; |
83096ebf1
|
342 |
else if (blk_rq_pos(rq) > blk_rq_pos(__rq)) |
2e662b65f
|
343 344 345 346 347 348 349 350 351 |
p = &(*p)->rb_right; else return __rq; } rb_link_node(&rq->rb_node, parent, p); rb_insert_color(&rq->rb_node, root); return NULL; } |
2e662b65f
|
352 353 354 355 356 357 358 359 |
EXPORT_SYMBOL(elv_rb_add); void elv_rb_del(struct rb_root *root, struct request *rq) { BUG_ON(RB_EMPTY_NODE(&rq->rb_node)); rb_erase(&rq->rb_node, root); RB_CLEAR_NODE(&rq->rb_node); } |
2e662b65f
|
360 361 362 363 364 365 366 367 368 |
EXPORT_SYMBOL(elv_rb_del); struct request *elv_rb_find(struct rb_root *root, sector_t sector) { struct rb_node *n = root->rb_node; struct request *rq; while (n) { rq = rb_entry(n, struct request, rb_node); |
83096ebf1
|
369 |
if (sector < blk_rq_pos(rq)) |
2e662b65f
|
370 |
n = n->rb_left; |
83096ebf1
|
371 |
else if (sector > blk_rq_pos(rq)) |
2e662b65f
|
372 373 374 375 376 377 378 |
n = n->rb_right; else return rq; } return NULL; } |
2e662b65f
|
379 380 381 |
EXPORT_SYMBOL(elv_rb_find); /* |
8922e16cf
|
382 |
* Insert rq into dispatch queue of q. Queue lock must be held on |
dbe7f76dd
|
383 |
* entry. rq is sort instead into the dispatch queue. To be used by |
2e662b65f
|
384 |
* specific elevators. |
8922e16cf
|
385 |
*/ |
165125e1e
|
386 |
void elv_dispatch_sort(struct request_queue *q, struct request *rq) |
8922e16cf
|
387 388 |
{ sector_t boundary; |
8922e16cf
|
389 |
struct list_head *entry; |
4eb166d98
|
390 |
int stop_flags; |
8922e16cf
|
391 |
|
06b86245c
|
392 393 |
if (q->last_merge == rq) q->last_merge = NULL; |
9817064b6
|
394 395 |
elv_rqhash_del(q, rq); |
15853af9f
|
396 |
q->nr_sorted--; |
06b86245c
|
397 |
|
1b47f531e
|
398 |
boundary = q->end_sector; |
4eb166d98
|
399 |
stop_flags = REQ_SOFTBARRIER | REQ_HARDBARRIER | REQ_STARTED; |
8922e16cf
|
400 401 |
list_for_each_prev(entry, &q->queue_head) { struct request *pos = list_entry_rq(entry); |
e17fc0a1c
|
402 403 |
if (blk_discard_rq(rq) != blk_discard_rq(pos)) break; |
783660b2f
|
404 405 |
if (rq_data_dir(rq) != rq_data_dir(pos)) break; |
4eb166d98
|
406 |
if (pos->cmd_flags & stop_flags) |
8922e16cf
|
407 |
break; |
83096ebf1
|
408 409 |
if (blk_rq_pos(rq) >= boundary) { if (blk_rq_pos(pos) < boundary) |
8922e16cf
|
410 411 |
continue; } else { |
83096ebf1
|
412 |
if (blk_rq_pos(pos) >= boundary) |
8922e16cf
|
413 414 |
break; } |
83096ebf1
|
415 |
if (blk_rq_pos(rq) >= blk_rq_pos(pos)) |
8922e16cf
|
416 417 418 419 420 |
break; } list_add(&rq->queuelist, entry); } |
2e662b65f
|
421 |
EXPORT_SYMBOL(elv_dispatch_sort); |
9817064b6
|
422 |
/* |
2e662b65f
|
423 424 425 |
* Insert rq into dispatch queue of q. Queue lock must be held on * entry. rq is added to the back of the dispatch queue. To be used by * specific elevators. |
9817064b6
|
426 427 428 429 430 431 432 433 434 435 436 437 438 439 |
*/ void elv_dispatch_add_tail(struct request_queue *q, struct request *rq) { if (q->last_merge == rq) q->last_merge = NULL; elv_rqhash_del(q, rq); q->nr_sorted--; q->end_sector = rq_end_sector(rq); q->boundary_rq = rq; list_add_tail(&rq->queuelist, &q->queue_head); } |
2e662b65f
|
440 |
EXPORT_SYMBOL(elv_dispatch_add_tail); |
165125e1e
|
441 |
int elv_merge(struct request_queue *q, struct request **req, struct bio *bio) |
1da177e4c
|
442 |
{ |
b374d18a4
|
443 |
struct elevator_queue *e = q->elevator; |
9817064b6
|
444 |
struct request *__rq; |
06b86245c
|
445 |
int ret; |
9817064b6
|
446 447 448 |
/* * First try one-hit cache. */ |
06b86245c
|
449 450 451 452 453 454 455 |
if (q->last_merge) { ret = elv_try_merge(q->last_merge, bio); if (ret != ELEVATOR_NO_MERGE) { *req = q->last_merge; return ret; } } |
1da177e4c
|
456 |
|
ac9fafa12
|
457 458 |
if (blk_queue_nomerges(q)) return ELEVATOR_NO_MERGE; |
9817064b6
|
459 460 461 462 463 464 465 466 |
/* * See if our hash lookup can find a potential backmerge. */ __rq = elv_rqhash_find(q, bio->bi_sector); if (__rq && elv_rq_merge_ok(__rq, bio)) { *req = __rq; return ELEVATOR_BACK_MERGE; } |
1da177e4c
|
467 468 469 470 471 |
if (e->ops->elevator_merge_fn) return e->ops->elevator_merge_fn(q, req, bio); return ELEVATOR_NO_MERGE; } |
165125e1e
|
472 |
void elv_merged_request(struct request_queue *q, struct request *rq, int type) |
1da177e4c
|
473 |
{ |
b374d18a4
|
474 |
struct elevator_queue *e = q->elevator; |
1da177e4c
|
475 476 |
if (e->ops->elevator_merged_fn) |
2e662b65f
|
477 |
e->ops->elevator_merged_fn(q, rq, type); |
06b86245c
|
478 |
|
2e662b65f
|
479 480 |
if (type == ELEVATOR_BACK_MERGE) elv_rqhash_reposition(q, rq); |
9817064b6
|
481 |
|
06b86245c
|
482 |
q->last_merge = rq; |
1da177e4c
|
483 |
} |
165125e1e
|
484 |
void elv_merge_requests(struct request_queue *q, struct request *rq, |
1da177e4c
|
485 486 |
struct request *next) { |
b374d18a4
|
487 |
struct elevator_queue *e = q->elevator; |
1da177e4c
|
488 |
|
1da177e4c
|
489 490 |
if (e->ops->elevator_merge_req_fn) e->ops->elevator_merge_req_fn(q, rq, next); |
06b86245c
|
491 |
|
9817064b6
|
492 493 494 495 |
elv_rqhash_reposition(q, rq); elv_rqhash_del(q, next); q->nr_sorted--; |
06b86245c
|
496 |
q->last_merge = rq; |
1da177e4c
|
497 |
} |
165125e1e
|
498 |
void elv_requeue_request(struct request_queue *q, struct request *rq) |
1da177e4c
|
499 |
{ |
1da177e4c
|
500 501 502 503 |
/* * it already went through dequeue, we need to decrement the * in_flight count again */ |
8922e16cf
|
504 |
if (blk_account_rq(rq)) { |
0a7ae2ff0
|
505 |
q->in_flight[rq_is_sync(rq)]--; |
cad975164
|
506 507 |
if (blk_sorted_rq(rq)) elv_deactivate_rq(q, rq); |
8922e16cf
|
508 |
} |
1da177e4c
|
509 |
|
4aff5e233
|
510 |
rq->cmd_flags &= ~REQ_STARTED; |
1da177e4c
|
511 |
|
30e9656cc
|
512 |
elv_insert(q, rq, ELEVATOR_INSERT_REQUEUE); |
1da177e4c
|
513 |
} |
26308eab6
|
514 |
void elv_drain_elevator(struct request_queue *q) |
15853af9f
|
515 516 517 518 519 520 521 522 523 524 525 526 527 |
{ static int printed; while (q->elevator->ops->elevator_dispatch_fn(q, 1)) ; if (q->nr_sorted == 0) return; if (printed++ < 10) { printk(KERN_ERR "%s: forced dispatching is broken " "(nr_sorted=%u), please report this ", q->elevator->elevator_type->elevator_name, q->nr_sorted); } } |
6c7e8cee6
|
528 529 530 |
/* * Call with queue lock held, interrupts disabled */ |
f600abe2d
|
531 |
void elv_quiesce_start(struct request_queue *q) |
6c7e8cee6
|
532 |
{ |
cd43e26f0
|
533 534 |
if (!q->elevator) return; |
6c7e8cee6
|
535 536 537 538 539 540 541 |
queue_flag_set(QUEUE_FLAG_ELVSWITCH, q); /* * make sure we don't have any requests in flight */ elv_drain_elevator(q); while (q->rq.elvpriv) { |
a7f557923
|
542 |
__blk_run_queue(q); |
6c7e8cee6
|
543 544 545 546 547 548 |
spin_unlock_irq(q->queue_lock); msleep(10); spin_lock_irq(q->queue_lock); elv_drain_elevator(q); } } |
f600abe2d
|
549 |
void elv_quiesce_end(struct request_queue *q) |
6c7e8cee6
|
550 551 552 |
{ queue_flag_clear(QUEUE_FLAG_ELVSWITCH, q); } |
165125e1e
|
553 |
void elv_insert(struct request_queue *q, struct request *rq, int where) |
1da177e4c
|
554 |
{ |
797e7dbbe
|
555 556 |
struct list_head *pos; unsigned ordseq; |
dac07ec12
|
557 |
int unplug_it = 1; |
797e7dbbe
|
558 |
|
5f3ea37c7
|
559 |
trace_block_rq_insert(q, rq); |
2056a782f
|
560 |
|
1da177e4c
|
561 |
rq->q = q; |
8922e16cf
|
562 563 |
switch (where) { case ELEVATOR_INSERT_FRONT: |
4aff5e233
|
564 |
rq->cmd_flags |= REQ_SOFTBARRIER; |
8922e16cf
|
565 566 567 568 569 |
list_add(&rq->queuelist, &q->queue_head); break; case ELEVATOR_INSERT_BACK: |
4aff5e233
|
570 |
rq->cmd_flags |= REQ_SOFTBARRIER; |
15853af9f
|
571 |
elv_drain_elevator(q); |
8922e16cf
|
572 573 574 575 576 577 578 579 580 581 582 |
list_add_tail(&rq->queuelist, &q->queue_head); /* * We kick the queue here for the following reasons. * - The elevator might have returned NULL previously * to delay requests and returned them now. As the * queue wasn't empty before this request, ll_rw_blk * won't run the queue on return, resulting in hang. * - Usually, back inserted requests won't be merged * with anything. There's no point in delaying queue * processing. */ |
a7f557923
|
583 |
__blk_run_queue(q); |
8922e16cf
|
584 585 586 |
break; case ELEVATOR_INSERT_SORT: |
e17fc0a1c
|
587 |
BUG_ON(!blk_fs_request(rq) && !blk_discard_rq(rq)); |
4aff5e233
|
588 |
rq->cmd_flags |= REQ_SORTED; |
15853af9f
|
589 |
q->nr_sorted++; |
9817064b6
|
590 591 592 593 594 |
if (rq_mergeable(rq)) { elv_rqhash_add(q, rq); if (!q->last_merge) q->last_merge = rq; } |
ca23509fb
|
595 596 597 598 599 600 |
/* * Some ioscheds (cfq) run q->request_fn directly, so * rq cannot be accessed after calling * elevator_add_req_fn. */ q->elevator->ops->elevator_add_req_fn(q, rq); |
8922e16cf
|
601 |
break; |
797e7dbbe
|
602 603 604 605 606 607 |
case ELEVATOR_INSERT_REQUEUE: /* * If ordered flush isn't in progress, we do front * insertion; otherwise, requests should be requeued * in ordseq order. */ |
4aff5e233
|
608 |
rq->cmd_flags |= REQ_SOFTBARRIER; |
797e7dbbe
|
609 |
|
95543179f
|
610 611 612 613 614 |
/* * Most requeues happen because of a busy condition, * don't force unplug of the queue for that case. */ unplug_it = 0; |
797e7dbbe
|
615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 |
if (q->ordseq == 0) { list_add(&rq->queuelist, &q->queue_head); break; } ordseq = blk_ordered_req_seq(rq); list_for_each(pos, &q->queue_head) { struct request *pos_rq = list_entry_rq(pos); if (ordseq <= blk_ordered_req_seq(pos_rq)) break; } list_add_tail(&rq->queuelist, pos); break; |
8922e16cf
|
630 631 632 |
default: printk(KERN_ERR "%s: bad insertion point %d ", |
24c03d47d
|
633 |
__func__, where); |
8922e16cf
|
634 635 |
BUG(); } |
dac07ec12
|
636 |
if (unplug_it && blk_queue_plugged(q)) { |
1faa16d22
|
637 |
int nrq = q->rq.count[BLK_RW_SYNC] + q->rq.count[BLK_RW_ASYNC] |
0a7ae2ff0
|
638 |
- queue_in_flight(q); |
8922e16cf
|
639 640 641 642 |
if (nrq >= q->unplug_thresh) __generic_unplug_device(q); } |
1da177e4c
|
643 |
} |
165125e1e
|
644 |
void __elv_add_request(struct request_queue *q, struct request *rq, int where, |
30e9656cc
|
645 646 647 |
int plug) { if (q->ordcolor) |
4aff5e233
|
648 |
rq->cmd_flags |= REQ_ORDERED_COLOR; |
30e9656cc
|
649 |
|
4aff5e233
|
650 |
if (rq->cmd_flags & (REQ_SOFTBARRIER | REQ_HARDBARRIER)) { |
30e9656cc
|
651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 |
/* * toggle ordered color */ if (blk_barrier_rq(rq)) q->ordcolor ^= 1; /* * barriers implicitly indicate back insertion */ if (where == ELEVATOR_INSERT_SORT) where = ELEVATOR_INSERT_BACK; /* * this request is scheduling boundary, update * end_sector */ |
e17fc0a1c
|
667 |
if (blk_fs_request(rq) || blk_discard_rq(rq)) { |
30e9656cc
|
668 669 670 |
q->end_sector = rq_end_sector(rq); q->boundary_rq = rq; } |
4eb166d98
|
671 672 |
} else if (!(rq->cmd_flags & REQ_ELVPRIV) && where == ELEVATOR_INSERT_SORT) |
30e9656cc
|
673 674 675 676 677 678 679 |
where = ELEVATOR_INSERT_BACK; if (plug) blk_plug_device(q); elv_insert(q, rq, where); } |
2e662b65f
|
680 |
EXPORT_SYMBOL(__elv_add_request); |
165125e1e
|
681 |
void elv_add_request(struct request_queue *q, struct request *rq, int where, |
1da177e4c
|
682 683 684 685 686 687 688 689 |
int plug) { unsigned long flags; spin_lock_irqsave(q->queue_lock, flags); __elv_add_request(q, rq, where, plug); spin_unlock_irqrestore(q->queue_lock, flags); } |
2e662b65f
|
690 |
EXPORT_SYMBOL(elv_add_request); |
165125e1e
|
691 |
int elv_queue_empty(struct request_queue *q) |
1da177e4c
|
692 |
{ |
b374d18a4
|
693 |
struct elevator_queue *e = q->elevator; |
1da177e4c
|
694 |
|
8922e16cf
|
695 696 |
if (!list_empty(&q->queue_head)) return 0; |
1da177e4c
|
697 698 |
if (e->ops->elevator_queue_empty_fn) return e->ops->elevator_queue_empty_fn(q); |
8922e16cf
|
699 |
return 1; |
1da177e4c
|
700 |
} |
2e662b65f
|
701 |
EXPORT_SYMBOL(elv_queue_empty); |
165125e1e
|
702 |
struct request *elv_latter_request(struct request_queue *q, struct request *rq) |
1da177e4c
|
703 |
{ |
b374d18a4
|
704 |
struct elevator_queue *e = q->elevator; |
1da177e4c
|
705 706 707 |
if (e->ops->elevator_latter_req_fn) return e->ops->elevator_latter_req_fn(q, rq); |
1da177e4c
|
708 709 |
return NULL; } |
165125e1e
|
710 |
struct request *elv_former_request(struct request_queue *q, struct request *rq) |
1da177e4c
|
711 |
{ |
b374d18a4
|
712 |
struct elevator_queue *e = q->elevator; |
1da177e4c
|
713 714 715 |
if (e->ops->elevator_former_req_fn) return e->ops->elevator_former_req_fn(q, rq); |
1da177e4c
|
716 717 |
return NULL; } |
165125e1e
|
718 |
int elv_set_request(struct request_queue *q, struct request *rq, gfp_t gfp_mask) |
1da177e4c
|
719 |
{ |
b374d18a4
|
720 |
struct elevator_queue *e = q->elevator; |
1da177e4c
|
721 722 |
if (e->ops->elevator_set_req_fn) |
cb78b285c
|
723 |
return e->ops->elevator_set_req_fn(q, rq, gfp_mask); |
1da177e4c
|
724 725 726 727 |
rq->elevator_private = NULL; return 0; } |
165125e1e
|
728 |
void elv_put_request(struct request_queue *q, struct request *rq) |
1da177e4c
|
729 |
{ |
b374d18a4
|
730 |
struct elevator_queue *e = q->elevator; |
1da177e4c
|
731 732 |
if (e->ops->elevator_put_req_fn) |
bb37b94c6
|
733 |
e->ops->elevator_put_req_fn(rq); |
1da177e4c
|
734 |
} |
165125e1e
|
735 |
int elv_may_queue(struct request_queue *q, int rw) |
1da177e4c
|
736 |
{ |
b374d18a4
|
737 |
struct elevator_queue *e = q->elevator; |
1da177e4c
|
738 739 |
if (e->ops->elevator_may_queue_fn) |
cb78b285c
|
740 |
return e->ops->elevator_may_queue_fn(q, rw); |
1da177e4c
|
741 742 743 |
return ELV_MQUEUE_MAY; } |
11914a53d
|
744 745 746 747 748 749 750 |
void elv_abort_queue(struct request_queue *q) { struct request *rq; while (!list_empty(&q->queue_head)) { rq = list_entry_rq(q->queue_head.next); rq->cmd_flags |= REQ_QUIET; |
5f3ea37c7
|
751 |
trace_block_rq_abort(q, rq); |
53c663ce0
|
752 753 754 755 756 |
/* * Mark this request as started so we don't trigger * any debug logic in the end I/O path. */ blk_start_request(rq); |
40cbbb781
|
757 |
__blk_end_request_all(rq, -EIO); |
11914a53d
|
758 759 760 |
} } EXPORT_SYMBOL(elv_abort_queue); |
165125e1e
|
761 |
void elv_completed_request(struct request_queue *q, struct request *rq) |
1da177e4c
|
762 |
{ |
b374d18a4
|
763 |
struct elevator_queue *e = q->elevator; |
1da177e4c
|
764 765 766 767 |
/* * request is released from the driver, io must be done */ |
8922e16cf
|
768 |
if (blk_account_rq(rq)) { |
0a7ae2ff0
|
769 |
q->in_flight[rq_is_sync(rq)]--; |
1bc691d35
|
770 771 772 |
if (blk_sorted_rq(rq) && e->ops->elevator_completed_req_fn) e->ops->elevator_completed_req_fn(q, rq); } |
797e7dbbe
|
773 |
|
1bc691d35
|
774 775 776 777 778 |
/* * Check if the queue is waiting for fs requests to be * drained for flush sequence. */ if (unlikely(q->ordseq)) { |
8f11b3e99
|
779 780 781 782 |
struct request *next = NULL; if (!list_empty(&q->queue_head)) next = list_entry_rq(q->queue_head.next); |
0a7ae2ff0
|
783 |
if (!queue_in_flight(q) && |
797e7dbbe
|
784 |
blk_ordered_cur_seq(q) == QUEUE_ORDSEQ_DRAIN && |
8f11b3e99
|
785 |
(!next || blk_ordered_req_seq(next) > QUEUE_ORDSEQ_DRAIN)) { |
797e7dbbe
|
786 |
blk_ordered_complete_seq(q, QUEUE_ORDSEQ_DRAIN, 0); |
a7f557923
|
787 |
__blk_run_queue(q); |
797e7dbbe
|
788 |
} |
8922e16cf
|
789 |
} |
1da177e4c
|
790 |
} |
3d1ab40f4
|
791 792 793 794 |
#define to_elv(atr) container_of((atr), struct elv_fs_entry, attr) static ssize_t elv_attr_show(struct kobject *kobj, struct attribute *attr, char *page) |
1da177e4c
|
795 |
{ |
3d1ab40f4
|
796 |
struct elv_fs_entry *entry = to_elv(attr); |
b374d18a4
|
797 |
struct elevator_queue *e; |
3d1ab40f4
|
798 799 800 801 |
ssize_t error; if (!entry->show) return -EIO; |
b374d18a4
|
802 |
e = container_of(kobj, struct elevator_queue, kobj); |
3d1ab40f4
|
803 804 805 806 807 |
mutex_lock(&e->sysfs_lock); error = e->ops ? entry->show(e, page) : -ENOENT; mutex_unlock(&e->sysfs_lock); return error; } |
1da177e4c
|
808 |
|
3d1ab40f4
|
809 810 811 812 |
static ssize_t elv_attr_store(struct kobject *kobj, struct attribute *attr, const char *page, size_t length) { |
3d1ab40f4
|
813 |
struct elv_fs_entry *entry = to_elv(attr); |
b374d18a4
|
814 |
struct elevator_queue *e; |
3d1ab40f4
|
815 |
ssize_t error; |
1da177e4c
|
816 |
|
3d1ab40f4
|
817 818 |
if (!entry->store) return -EIO; |
1da177e4c
|
819 |
|
b374d18a4
|
820 |
e = container_of(kobj, struct elevator_queue, kobj); |
3d1ab40f4
|
821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 |
mutex_lock(&e->sysfs_lock); error = e->ops ? entry->store(e, page, length) : -ENOENT; mutex_unlock(&e->sysfs_lock); return error; } static struct sysfs_ops elv_sysfs_ops = { .show = elv_attr_show, .store = elv_attr_store, }; static struct kobj_type elv_ktype = { .sysfs_ops = &elv_sysfs_ops, .release = elevator_release, }; int elv_register_queue(struct request_queue *q) { |
b374d18a4
|
839 |
struct elevator_queue *e = q->elevator; |
3d1ab40f4
|
840 |
int error; |
b2d6db587
|
841 |
error = kobject_add(&e->kobj, &q->kobj, "%s", "iosched"); |
3d1ab40f4
|
842 |
if (!error) { |
e572ec7e4
|
843 |
struct elv_fs_entry *attr = e->elevator_type->elevator_attrs; |
3d1ab40f4
|
844 |
if (attr) { |
e572ec7e4
|
845 846 |
while (attr->attr.name) { if (sysfs_create_file(&e->kobj, &attr->attr)) |
3d1ab40f4
|
847 |
break; |
e572ec7e4
|
848 |
attr++; |
3d1ab40f4
|
849 850 851 852 853 |
} } kobject_uevent(&e->kobj, KOBJ_ADD); } return error; |
1da177e4c
|
854 |
} |
b374d18a4
|
855 |
static void __elv_unregister_queue(struct elevator_queue *e) |
bc1c11697
|
856 857 858 859 |
{ kobject_uevent(&e->kobj, KOBJ_REMOVE); kobject_del(&e->kobj); } |
1da177e4c
|
860 861 |
void elv_unregister_queue(struct request_queue *q) { |
bc1c11697
|
862 863 |
if (q) __elv_unregister_queue(q->elevator); |
1da177e4c
|
864 |
} |
2fdd82bd8
|
865 |
void elv_register(struct elevator_type *e) |
1da177e4c
|
866 |
{ |
1ffb96c58
|
867 |
char *def = ""; |
2a12dcd71
|
868 869 |
spin_lock(&elv_list_lock); |
ce5244974
|
870 |
BUG_ON(elevator_find(e->elevator_name)); |
1da177e4c
|
871 |
list_add_tail(&e->list, &elv_list); |
2a12dcd71
|
872 |
spin_unlock(&elv_list_lock); |
1da177e4c
|
873 |
|
5f0039764
|
874 875 876 |
if (!strcmp(e->elevator_name, chosen_elevator) || (!*chosen_elevator && !strcmp(e->elevator_name, CONFIG_DEFAULT_IOSCHED))) |
1ffb96c58
|
877 |
def = " (default)"; |
4eb166d98
|
878 879 880 |
printk(KERN_INFO "io scheduler %s registered%s ", e->elevator_name, def); |
1da177e4c
|
881 882 883 884 885 |
} EXPORT_SYMBOL_GPL(elv_register); void elv_unregister(struct elevator_type *e) { |
83521d3eb
|
886 887 888 889 890 |
struct task_struct *g, *p; /* * Iterate every thread in the process to remove the io contexts. */ |
e17a9489b
|
891 892 893 894 |
if (e->ops.trim) { read_lock(&tasklist_lock); do_each_thread(g, p) { task_lock(p); |
2d8f61316
|
895 896 |
if (p->io_context) e->ops.trim(p->io_context); |
e17a9489b
|
897 898 899 900 |
task_unlock(p); } while_each_thread(g, p); read_unlock(&tasklist_lock); } |
83521d3eb
|
901 |
|
2a12dcd71
|
902 |
spin_lock(&elv_list_lock); |
1da177e4c
|
903 |
list_del_init(&e->list); |
2a12dcd71
|
904 |
spin_unlock(&elv_list_lock); |
1da177e4c
|
905 906 907 908 909 910 911 |
} EXPORT_SYMBOL_GPL(elv_unregister); /* * switch to new_e io scheduler. be careful not to introduce deadlocks - * we don't free the old io scheduler, before we have allocated what we * need for the new one. this way we have a chance of going back to the old |
cb98fc8bb
|
912 |
* one, if the new one fails init for some reason. |
1da177e4c
|
913 |
*/ |
165125e1e
|
914 |
static int elevator_switch(struct request_queue *q, struct elevator_type *new_e) |
1da177e4c
|
915 |
{ |
b374d18a4
|
916 |
struct elevator_queue *old_elevator, *e; |
bc1c11697
|
917 |
void *data; |
1da177e4c
|
918 |
|
cb98fc8bb
|
919 920 921 |
/* * Allocate new elevator */ |
b5deef901
|
922 |
e = elevator_alloc(q, new_e); |
1da177e4c
|
923 |
if (!e) |
3d1ab40f4
|
924 |
return 0; |
1da177e4c
|
925 |
|
bc1c11697
|
926 927 928 929 930 |
data = elevator_init_queue(q, e); if (!data) { kobject_put(&e->kobj); return 0; } |
1da177e4c
|
931 |
/* |
cb98fc8bb
|
932 |
* Turn on BYPASS and drain all requests w/ elevator private data |
1da177e4c
|
933 |
*/ |
cb98fc8bb
|
934 |
spin_lock_irq(q->queue_lock); |
f600abe2d
|
935 |
elv_quiesce_start(q); |
cb98fc8bb
|
936 |
|
1da177e4c
|
937 |
/* |
bc1c11697
|
938 |
* Remember old elevator. |
1da177e4c
|
939 |
*/ |
1da177e4c
|
940 941 942 |
old_elevator = q->elevator; /* |
1da177e4c
|
943 944 |
* attach and start new elevator */ |
bc1c11697
|
945 946 947 948 949 |
elevator_attach(q, e, data); spin_unlock_irq(q->queue_lock); __elv_unregister_queue(old_elevator); |
1da177e4c
|
950 951 952 953 954 |
if (elv_register_queue(q)) goto fail_register; /* |
cb98fc8bb
|
955 |
* finally exit old elevator and turn off BYPASS. |
1da177e4c
|
956 957 |
*/ elevator_exit(old_elevator); |
75ad23bc0
|
958 |
spin_lock_irq(q->queue_lock); |
f600abe2d
|
959 |
elv_quiesce_end(q); |
75ad23bc0
|
960 |
spin_unlock_irq(q->queue_lock); |
4722dc52a
|
961 |
blk_add_trace_msg(q, "elv switch: %s", e->elevator_type->elevator_name); |
3d1ab40f4
|
962 |
return 1; |
1da177e4c
|
963 964 965 966 967 968 969 |
fail_register: /* * switch failed, exit the new io scheduler and reattach the old * one again (along with re-adding the sysfs dir) */ elevator_exit(e); |
1da177e4c
|
970 971 |
q->elevator = old_elevator; elv_register_queue(q); |
75ad23bc0
|
972 973 974 975 |
spin_lock_irq(q->queue_lock); queue_flag_clear(QUEUE_FLAG_ELVSWITCH, q); spin_unlock_irq(q->queue_lock); |
3d1ab40f4
|
976 |
return 0; |
1da177e4c
|
977 |
} |
165125e1e
|
978 979 |
ssize_t elv_iosched_store(struct request_queue *q, const char *name, size_t count) |
1da177e4c
|
980 981 982 |
{ char elevator_name[ELV_NAME_MAX]; struct elevator_type *e; |
cd43e26f0
|
983 984 |
if (!q->elevator) return count; |
ee2e992cc
|
985 |
strlcpy(elevator_name, name, sizeof(elevator_name)); |
8c2795985
|
986 |
e = elevator_get(strstrip(elevator_name)); |
1da177e4c
|
987 988 989 990 991 |
if (!e) { printk(KERN_ERR "elevator: type %s not found ", elevator_name); return -EINVAL; } |
2ca7d93bb
|
992 993 |
if (!strcmp(elevator_name, q->elevator->elevator_type->elevator_name)) { elevator_put(e); |
1da177e4c
|
994 |
return count; |
2ca7d93bb
|
995 |
} |
1da177e4c
|
996 |
|
3d1ab40f4
|
997 |
if (!elevator_switch(q, e)) |
4eb166d98
|
998 999 1000 |
printk(KERN_ERR "elevator: switch to %s failed ", elevator_name); |
1da177e4c
|
1001 1002 |
return count; } |
165125e1e
|
1003 |
ssize_t elv_iosched_show(struct request_queue *q, char *name) |
1da177e4c
|
1004 |
{ |
b374d18a4
|
1005 |
struct elevator_queue *e = q->elevator; |
cd43e26f0
|
1006 |
struct elevator_type *elv; |
70cee26e0
|
1007 |
struct elevator_type *__e; |
1da177e4c
|
1008 |
int len = 0; |
cd43e26f0
|
1009 1010 1011 1012 1013 |
if (!q->elevator) return sprintf(name, "none "); elv = e->elevator_type; |
2a12dcd71
|
1014 |
spin_lock(&elv_list_lock); |
70cee26e0
|
1015 |
list_for_each_entry(__e, &elv_list, list) { |
1da177e4c
|
1016 1017 1018 1019 1020 |
if (!strcmp(elv->elevator_name, __e->elevator_name)) len += sprintf(name+len, "[%s] ", elv->elevator_name); else len += sprintf(name+len, "%s ", __e->elevator_name); } |
2a12dcd71
|
1021 |
spin_unlock(&elv_list_lock); |
1da177e4c
|
1022 1023 1024 1025 1026 |
len += sprintf(len+name, " "); return len; } |
165125e1e
|
1027 1028 |
struct request *elv_rb_former_request(struct request_queue *q, struct request *rq) |
2e662b65f
|
1029 1030 1031 1032 1033 1034 1035 1036 |
{ struct rb_node *rbprev = rb_prev(&rq->rb_node); if (rbprev) return rb_entry_rq(rbprev); return NULL; } |
2e662b65f
|
1037 |
EXPORT_SYMBOL(elv_rb_former_request); |
165125e1e
|
1038 1039 |
struct request *elv_rb_latter_request(struct request_queue *q, struct request *rq) |
2e662b65f
|
1040 1041 1042 1043 1044 1045 1046 1047 |
{ struct rb_node *rbnext = rb_next(&rq->rb_node); if (rbnext) return rb_entry_rq(rbnext); return NULL; } |
2e662b65f
|
1048 |
EXPORT_SYMBOL(elv_rb_latter_request); |