Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
1da177e4 LT |
2 | * Block device elevator/IO-scheduler. |
3 | * | |
4 | * Copyright (C) 2000 Andrea Arcangeli <andrea@suse.de> SuSE | |
5 | * | |
0fe23479 | 6 | * 30042000 Jens Axboe <axboe@kernel.dk> : |
1da177e4 LT |
7 | * |
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> | |
1da177e4 LT |
30 | #include <linux/module.h> |
31 | #include <linux/slab.h> | |
32 | #include <linux/init.h> | |
33 | #include <linux/compiler.h> | |
2056a782 | 34 | #include <linux/blktrace_api.h> |
9817064b | 35 | #include <linux/hash.h> |
0835da67 | 36 | #include <linux/uaccess.h> |
c8158819 | 37 | #include <linux/pm_runtime.h> |
eea8f41c | 38 | #include <linux/blk-cgroup.h> |
1da177e4 | 39 | |
55782138 LZ |
40 | #include <trace/events/block.h> |
41 | ||
242f9dcb JA |
42 | #include "blk.h" |
43 | ||
1da177e4 LT |
44 | static DEFINE_SPINLOCK(elv_list_lock); |
45 | static LIST_HEAD(elv_list); | |
46 | ||
9817064b JA |
47 | /* |
48 | * Merge hash stuff. | |
49 | */ | |
83096ebf | 50 | #define rq_hash_key(rq) (blk_rq_pos(rq) + blk_rq_sectors(rq)) |
9817064b | 51 | |
da775265 JA |
52 | /* |
53 | * Query io scheduler to see if the current process issuing bio may be | |
54 | * merged with rq. | |
55 | */ | |
56 | static int elv_iosched_allow_merge(struct request *rq, struct bio *bio) | |
57 | { | |
165125e1 | 58 | struct request_queue *q = rq->q; |
b374d18a | 59 | struct elevator_queue *e = q->elevator; |
da775265 | 60 | |
22f746e2 TH |
61 | if (e->type->ops.elevator_allow_merge_fn) |
62 | return e->type->ops.elevator_allow_merge_fn(q, rq, bio); | |
da775265 JA |
63 | |
64 | return 1; | |
65 | } | |
66 | ||
1da177e4 LT |
67 | /* |
68 | * can we safely merge with this request? | |
69 | */ | |
050c8ea8 | 70 | bool elv_rq_merge_ok(struct request *rq, struct bio *bio) |
1da177e4 | 71 | { |
050c8ea8 | 72 | if (!blk_rq_merge_ok(rq, bio)) |
7ba1ba12 MP |
73 | return 0; |
74 | ||
da775265 JA |
75 | if (!elv_iosched_allow_merge(rq, bio)) |
76 | return 0; | |
1da177e4 | 77 | |
da775265 | 78 | return 1; |
1da177e4 LT |
79 | } |
80 | EXPORT_SYMBOL(elv_rq_merge_ok); | |
81 | ||
1da177e4 LT |
82 | static struct elevator_type *elevator_find(const char *name) |
83 | { | |
a22b169d | 84 | struct elevator_type *e; |
1da177e4 | 85 | |
70cee26e | 86 | list_for_each_entry(e, &elv_list, list) { |
a22b169d VT |
87 | if (!strcmp(e->elevator_name, name)) |
88 | return e; | |
1da177e4 | 89 | } |
1da177e4 | 90 | |
a22b169d | 91 | return NULL; |
1da177e4 LT |
92 | } |
93 | ||
94 | static void elevator_put(struct elevator_type *e) | |
95 | { | |
96 | module_put(e->elevator_owner); | |
97 | } | |
98 | ||
21c3c5d2 | 99 | static struct elevator_type *elevator_get(const char *name, bool try_loading) |
1da177e4 | 100 | { |
2824bc93 | 101 | struct elevator_type *e; |
1da177e4 | 102 | |
2a12dcd7 | 103 | spin_lock(&elv_list_lock); |
2824bc93 TH |
104 | |
105 | e = elevator_find(name); | |
21c3c5d2 | 106 | if (!e && try_loading) { |
e1640949 | 107 | spin_unlock(&elv_list_lock); |
490b94be | 108 | request_module("%s-iosched", name); |
e1640949 JA |
109 | spin_lock(&elv_list_lock); |
110 | e = elevator_find(name); | |
111 | } | |
112 | ||
2824bc93 TH |
113 | if (e && !try_module_get(e->elevator_owner)) |
114 | e = NULL; | |
115 | ||
2a12dcd7 | 116 | spin_unlock(&elv_list_lock); |
1da177e4 LT |
117 | |
118 | return e; | |
119 | } | |
120 | ||
484fc254 | 121 | static char chosen_elevator[ELV_NAME_MAX]; |
1da177e4 | 122 | |
5f003976 | 123 | static int __init elevator_setup(char *str) |
1da177e4 | 124 | { |
752a3b79 CE |
125 | /* |
126 | * Be backwards-compatible with previous kernels, so users | |
127 | * won't get the wrong elevator. | |
128 | */ | |
492af635 | 129 | strncpy(chosen_elevator, str, sizeof(chosen_elevator) - 1); |
9b41046c | 130 | return 1; |
1da177e4 LT |
131 | } |
132 | ||
133 | __setup("elevator=", elevator_setup); | |
134 | ||
bb813f4c TH |
135 | /* called during boot to load the elevator chosen by the elevator param */ |
136 | void __init load_default_elevator_module(void) | |
137 | { | |
138 | struct elevator_type *e; | |
139 | ||
140 | if (!chosen_elevator[0]) | |
141 | return; | |
142 | ||
143 | spin_lock(&elv_list_lock); | |
144 | e = elevator_find(chosen_elevator); | |
145 | spin_unlock(&elv_list_lock); | |
146 | ||
147 | if (!e) | |
148 | request_module("%s-iosched", chosen_elevator); | |
149 | } | |
150 | ||
3d1ab40f AV |
151 | static struct kobj_type elv_ktype; |
152 | ||
d50235b7 | 153 | struct elevator_queue *elevator_alloc(struct request_queue *q, |
165125e1 | 154 | struct elevator_type *e) |
3d1ab40f | 155 | { |
b374d18a | 156 | struct elevator_queue *eq; |
9817064b | 157 | |
c1b511eb | 158 | eq = kzalloc_node(sizeof(*eq), GFP_KERNEL, q->node); |
9817064b | 159 | if (unlikely(!eq)) |
8406a4d5 | 160 | return NULL; |
9817064b | 161 | |
22f746e2 | 162 | eq->type = e; |
f9cb074b | 163 | kobject_init(&eq->kobj, &elv_ktype); |
9817064b | 164 | mutex_init(&eq->sysfs_lock); |
242d98f0 | 165 | hash_init(eq->hash); |
9817064b | 166 | |
3d1ab40f AV |
167 | return eq; |
168 | } | |
d50235b7 | 169 | EXPORT_SYMBOL(elevator_alloc); |
3d1ab40f AV |
170 | |
171 | static void elevator_release(struct kobject *kobj) | |
172 | { | |
b374d18a | 173 | struct elevator_queue *e; |
9817064b | 174 | |
b374d18a | 175 | e = container_of(kobj, struct elevator_queue, kobj); |
22f746e2 | 176 | elevator_put(e->type); |
3d1ab40f AV |
177 | kfree(e); |
178 | } | |
179 | ||
165125e1 | 180 | int elevator_init(struct request_queue *q, char *name) |
1da177e4 LT |
181 | { |
182 | struct elevator_type *e = NULL; | |
f8fc877d | 183 | int err; |
1da177e4 | 184 | |
eb1c160b TS |
185 | /* |
186 | * q->sysfs_lock must be held to provide mutual exclusion between | |
187 | * elevator_switch() and here. | |
188 | */ | |
189 | lockdep_assert_held(&q->sysfs_lock); | |
190 | ||
1abec4fd MS |
191 | if (unlikely(q->elevator)) |
192 | return 0; | |
193 | ||
cb98fc8b TH |
194 | INIT_LIST_HEAD(&q->queue_head); |
195 | q->last_merge = NULL; | |
196 | q->end_sector = 0; | |
197 | q->boundary_rq = NULL; | |
cb98fc8b | 198 | |
4eb166d9 | 199 | if (name) { |
21c3c5d2 | 200 | e = elevator_get(name, true); |
4eb166d9 JA |
201 | if (!e) |
202 | return -EINVAL; | |
203 | } | |
1da177e4 | 204 | |
21c3c5d2 TH |
205 | /* |
206 | * Use the default elevator specified by config boot param or | |
207 | * config option. Don't try to load modules as we could be running | |
208 | * off async and request_module() isn't allowed from async. | |
209 | */ | |
4eb166d9 | 210 | if (!e && *chosen_elevator) { |
21c3c5d2 | 211 | e = elevator_get(chosen_elevator, false); |
4eb166d9 JA |
212 | if (!e) |
213 | printk(KERN_ERR "I/O scheduler %s not found\n", | |
214 | chosen_elevator); | |
215 | } | |
248d5ca5 | 216 | |
4eb166d9 | 217 | if (!e) { |
21c3c5d2 | 218 | e = elevator_get(CONFIG_DEFAULT_IOSCHED, false); |
4eb166d9 JA |
219 | if (!e) { |
220 | printk(KERN_ERR | |
221 | "Default I/O scheduler not found. " \ | |
222 | "Using noop.\n"); | |
21c3c5d2 | 223 | e = elevator_get("noop", false); |
4eb166d9 | 224 | } |
5f003976 ND |
225 | } |
226 | ||
d50235b7 | 227 | err = e->ops.elevator_init_fn(q, e); |
d32f6b57 SM |
228 | if (err) |
229 | elevator_put(e); | |
230 | return err; | |
1da177e4 | 231 | } |
2e662b65 JA |
232 | EXPORT_SYMBOL(elevator_init); |
233 | ||
b374d18a | 234 | void elevator_exit(struct elevator_queue *e) |
1da177e4 | 235 | { |
3d1ab40f | 236 | mutex_lock(&e->sysfs_lock); |
22f746e2 TH |
237 | if (e->type->ops.elevator_exit_fn) |
238 | e->type->ops.elevator_exit_fn(e); | |
3d1ab40f | 239 | mutex_unlock(&e->sysfs_lock); |
1da177e4 | 240 | |
3d1ab40f | 241 | kobject_put(&e->kobj); |
1da177e4 | 242 | } |
2e662b65 JA |
243 | EXPORT_SYMBOL(elevator_exit); |
244 | ||
9817064b JA |
245 | static inline void __elv_rqhash_del(struct request *rq) |
246 | { | |
242d98f0 | 247 | hash_del(&rq->hash); |
360f92c2 | 248 | rq->cmd_flags &= ~REQ_HASHED; |
9817064b JA |
249 | } |
250 | ||
165125e1 | 251 | static void elv_rqhash_del(struct request_queue *q, struct request *rq) |
9817064b JA |
252 | { |
253 | if (ELV_ON_HASH(rq)) | |
254 | __elv_rqhash_del(rq); | |
255 | } | |
256 | ||
165125e1 | 257 | static void elv_rqhash_add(struct request_queue *q, struct request *rq) |
9817064b | 258 | { |
b374d18a | 259 | struct elevator_queue *e = q->elevator; |
9817064b JA |
260 | |
261 | BUG_ON(ELV_ON_HASH(rq)); | |
242d98f0 | 262 | hash_add(e->hash, &rq->hash, rq_hash_key(rq)); |
360f92c2 | 263 | rq->cmd_flags |= REQ_HASHED; |
9817064b JA |
264 | } |
265 | ||
165125e1 | 266 | static void elv_rqhash_reposition(struct request_queue *q, struct request *rq) |
9817064b JA |
267 | { |
268 | __elv_rqhash_del(rq); | |
269 | elv_rqhash_add(q, rq); | |
270 | } | |
271 | ||
165125e1 | 272 | static struct request *elv_rqhash_find(struct request_queue *q, sector_t offset) |
9817064b | 273 | { |
b374d18a | 274 | struct elevator_queue *e = q->elevator; |
b67bfe0d | 275 | struct hlist_node *next; |
9817064b JA |
276 | struct request *rq; |
277 | ||
ee89f812 | 278 | hash_for_each_possible_safe(e->hash, rq, next, hash, offset) { |
9817064b JA |
279 | BUG_ON(!ELV_ON_HASH(rq)); |
280 | ||
281 | if (unlikely(!rq_mergeable(rq))) { | |
282 | __elv_rqhash_del(rq); | |
283 | continue; | |
284 | } | |
285 | ||
286 | if (rq_hash_key(rq) == offset) | |
287 | return rq; | |
288 | } | |
289 | ||
290 | return NULL; | |
291 | } | |
292 | ||
2e662b65 JA |
293 | /* |
294 | * RB-tree support functions for inserting/lookup/removal of requests | |
295 | * in a sorted RB tree. | |
296 | */ | |
796d5116 | 297 | void elv_rb_add(struct rb_root *root, struct request *rq) |
2e662b65 JA |
298 | { |
299 | struct rb_node **p = &root->rb_node; | |
300 | struct rb_node *parent = NULL; | |
301 | struct request *__rq; | |
302 | ||
303 | while (*p) { | |
304 | parent = *p; | |
305 | __rq = rb_entry(parent, struct request, rb_node); | |
306 | ||
83096ebf | 307 | if (blk_rq_pos(rq) < blk_rq_pos(__rq)) |
2e662b65 | 308 | p = &(*p)->rb_left; |
796d5116 | 309 | else if (blk_rq_pos(rq) >= blk_rq_pos(__rq)) |
2e662b65 | 310 | p = &(*p)->rb_right; |
2e662b65 JA |
311 | } |
312 | ||
313 | rb_link_node(&rq->rb_node, parent, p); | |
314 | rb_insert_color(&rq->rb_node, root); | |
2e662b65 | 315 | } |
2e662b65 JA |
316 | EXPORT_SYMBOL(elv_rb_add); |
317 | ||
318 | void elv_rb_del(struct rb_root *root, struct request *rq) | |
319 | { | |
320 | BUG_ON(RB_EMPTY_NODE(&rq->rb_node)); | |
321 | rb_erase(&rq->rb_node, root); | |
322 | RB_CLEAR_NODE(&rq->rb_node); | |
323 | } | |
2e662b65 JA |
324 | EXPORT_SYMBOL(elv_rb_del); |
325 | ||
326 | struct request *elv_rb_find(struct rb_root *root, sector_t sector) | |
327 | { | |
328 | struct rb_node *n = root->rb_node; | |
329 | struct request *rq; | |
330 | ||
331 | while (n) { | |
332 | rq = rb_entry(n, struct request, rb_node); | |
333 | ||
83096ebf | 334 | if (sector < blk_rq_pos(rq)) |
2e662b65 | 335 | n = n->rb_left; |
83096ebf | 336 | else if (sector > blk_rq_pos(rq)) |
2e662b65 JA |
337 | n = n->rb_right; |
338 | else | |
339 | return rq; | |
340 | } | |
341 | ||
342 | return NULL; | |
343 | } | |
2e662b65 JA |
344 | EXPORT_SYMBOL(elv_rb_find); |
345 | ||
8922e16c TH |
346 | /* |
347 | * Insert rq into dispatch queue of q. Queue lock must be held on | |
dbe7f76d | 348 | * entry. rq is sort instead into the dispatch queue. To be used by |
2e662b65 | 349 | * specific elevators. |
8922e16c | 350 | */ |
165125e1 | 351 | void elv_dispatch_sort(struct request_queue *q, struct request *rq) |
8922e16c TH |
352 | { |
353 | sector_t boundary; | |
8922e16c | 354 | struct list_head *entry; |
4eb166d9 | 355 | int stop_flags; |
8922e16c | 356 | |
06b86245 TH |
357 | if (q->last_merge == rq) |
358 | q->last_merge = NULL; | |
9817064b JA |
359 | |
360 | elv_rqhash_del(q, rq); | |
361 | ||
15853af9 | 362 | q->nr_sorted--; |
06b86245 | 363 | |
1b47f531 | 364 | boundary = q->end_sector; |
02e031cb | 365 | stop_flags = REQ_SOFTBARRIER | REQ_STARTED; |
8922e16c TH |
366 | list_for_each_prev(entry, &q->queue_head) { |
367 | struct request *pos = list_entry_rq(entry); | |
368 | ||
33659ebb CH |
369 | if ((rq->cmd_flags & REQ_DISCARD) != |
370 | (pos->cmd_flags & REQ_DISCARD)) | |
e17fc0a1 | 371 | break; |
783660b2 JA |
372 | if (rq_data_dir(rq) != rq_data_dir(pos)) |
373 | break; | |
4eb166d9 | 374 | if (pos->cmd_flags & stop_flags) |
8922e16c | 375 | break; |
83096ebf TH |
376 | if (blk_rq_pos(rq) >= boundary) { |
377 | if (blk_rq_pos(pos) < boundary) | |
8922e16c TH |
378 | continue; |
379 | } else { | |
83096ebf | 380 | if (blk_rq_pos(pos) >= boundary) |
8922e16c TH |
381 | break; |
382 | } | |
83096ebf | 383 | if (blk_rq_pos(rq) >= blk_rq_pos(pos)) |
8922e16c TH |
384 | break; |
385 | } | |
386 | ||
387 | list_add(&rq->queuelist, entry); | |
388 | } | |
2e662b65 JA |
389 | EXPORT_SYMBOL(elv_dispatch_sort); |
390 | ||
9817064b | 391 | /* |
2e662b65 JA |
392 | * Insert rq into dispatch queue of q. Queue lock must be held on |
393 | * entry. rq is added to the back of the dispatch queue. To be used by | |
394 | * specific elevators. | |
9817064b JA |
395 | */ |
396 | void elv_dispatch_add_tail(struct request_queue *q, struct request *rq) | |
397 | { | |
398 | if (q->last_merge == rq) | |
399 | q->last_merge = NULL; | |
400 | ||
401 | elv_rqhash_del(q, rq); | |
402 | ||
403 | q->nr_sorted--; | |
404 | ||
405 | q->end_sector = rq_end_sector(rq); | |
406 | q->boundary_rq = rq; | |
407 | list_add_tail(&rq->queuelist, &q->queue_head); | |
408 | } | |
2e662b65 JA |
409 | EXPORT_SYMBOL(elv_dispatch_add_tail); |
410 | ||
165125e1 | 411 | int elv_merge(struct request_queue *q, struct request **req, struct bio *bio) |
1da177e4 | 412 | { |
b374d18a | 413 | struct elevator_queue *e = q->elevator; |
9817064b | 414 | struct request *__rq; |
06b86245 TH |
415 | int ret; |
416 | ||
488991e2 AB |
417 | /* |
418 | * Levels of merges: | |
419 | * nomerges: No merges at all attempted | |
420 | * noxmerges: Only simple one-hit cache try | |
421 | * merges: All merge tries attempted | |
422 | */ | |
423 | if (blk_queue_nomerges(q)) | |
424 | return ELEVATOR_NO_MERGE; | |
425 | ||
9817064b JA |
426 | /* |
427 | * First try one-hit cache. | |
428 | */ | |
050c8ea8 TH |
429 | if (q->last_merge && elv_rq_merge_ok(q->last_merge, bio)) { |
430 | ret = blk_try_merge(q->last_merge, bio); | |
06b86245 TH |
431 | if (ret != ELEVATOR_NO_MERGE) { |
432 | *req = q->last_merge; | |
433 | return ret; | |
434 | } | |
435 | } | |
1da177e4 | 436 | |
488991e2 | 437 | if (blk_queue_noxmerges(q)) |
ac9fafa1 AB |
438 | return ELEVATOR_NO_MERGE; |
439 | ||
9817064b JA |
440 | /* |
441 | * See if our hash lookup can find a potential backmerge. | |
442 | */ | |
4f024f37 | 443 | __rq = elv_rqhash_find(q, bio->bi_iter.bi_sector); |
9817064b JA |
444 | if (__rq && elv_rq_merge_ok(__rq, bio)) { |
445 | *req = __rq; | |
446 | return ELEVATOR_BACK_MERGE; | |
447 | } | |
448 | ||
22f746e2 TH |
449 | if (e->type->ops.elevator_merge_fn) |
450 | return e->type->ops.elevator_merge_fn(q, req, bio); | |
1da177e4 LT |
451 | |
452 | return ELEVATOR_NO_MERGE; | |
453 | } | |
454 | ||
5e84ea3a JA |
455 | /* |
456 | * Attempt to do an insertion back merge. Only check for the case where | |
457 | * we can append 'rq' to an existing request, so we can throw 'rq' away | |
458 | * afterwards. | |
459 | * | |
460 | * Returns true if we merged, false otherwise | |
461 | */ | |
462 | static bool elv_attempt_insert_merge(struct request_queue *q, | |
463 | struct request *rq) | |
464 | { | |
465 | struct request *__rq; | |
bee0393c | 466 | bool ret; |
5e84ea3a JA |
467 | |
468 | if (blk_queue_nomerges(q)) | |
469 | return false; | |
470 | ||
471 | /* | |
472 | * First try one-hit cache. | |
473 | */ | |
474 | if (q->last_merge && blk_attempt_req_merge(q, q->last_merge, rq)) | |
475 | return true; | |
476 | ||
477 | if (blk_queue_noxmerges(q)) | |
478 | return false; | |
479 | ||
bee0393c | 480 | ret = false; |
5e84ea3a JA |
481 | /* |
482 | * See if our hash lookup can find a potential backmerge. | |
483 | */ | |
bee0393c SL |
484 | while (1) { |
485 | __rq = elv_rqhash_find(q, blk_rq_pos(rq)); | |
486 | if (!__rq || !blk_attempt_req_merge(q, __rq, rq)) | |
487 | break; | |
488 | ||
489 | /* The merged request could be merged with others, try again */ | |
490 | ret = true; | |
491 | rq = __rq; | |
492 | } | |
27419322 | 493 | |
bee0393c | 494 | return ret; |
5e84ea3a JA |
495 | } |
496 | ||
165125e1 | 497 | void elv_merged_request(struct request_queue *q, struct request *rq, int type) |
1da177e4 | 498 | { |
b374d18a | 499 | struct elevator_queue *e = q->elevator; |
1da177e4 | 500 | |
22f746e2 TH |
501 | if (e->type->ops.elevator_merged_fn) |
502 | e->type->ops.elevator_merged_fn(q, rq, type); | |
06b86245 | 503 | |
2e662b65 JA |
504 | if (type == ELEVATOR_BACK_MERGE) |
505 | elv_rqhash_reposition(q, rq); | |
9817064b | 506 | |
06b86245 | 507 | q->last_merge = rq; |
1da177e4 LT |
508 | } |
509 | ||
165125e1 | 510 | void elv_merge_requests(struct request_queue *q, struct request *rq, |
1da177e4 LT |
511 | struct request *next) |
512 | { | |
b374d18a | 513 | struct elevator_queue *e = q->elevator; |
5e84ea3a | 514 | const int next_sorted = next->cmd_flags & REQ_SORTED; |
1da177e4 | 515 | |
22f746e2 TH |
516 | if (next_sorted && e->type->ops.elevator_merge_req_fn) |
517 | e->type->ops.elevator_merge_req_fn(q, rq, next); | |
06b86245 | 518 | |
9817064b | 519 | elv_rqhash_reposition(q, rq); |
9817064b | 520 | |
5e84ea3a JA |
521 | if (next_sorted) { |
522 | elv_rqhash_del(q, next); | |
523 | q->nr_sorted--; | |
524 | } | |
525 | ||
06b86245 | 526 | q->last_merge = rq; |
1da177e4 LT |
527 | } |
528 | ||
812d4026 DS |
529 | void elv_bio_merged(struct request_queue *q, struct request *rq, |
530 | struct bio *bio) | |
531 | { | |
532 | struct elevator_queue *e = q->elevator; | |
533 | ||
22f746e2 TH |
534 | if (e->type->ops.elevator_bio_merged_fn) |
535 | e->type->ops.elevator_bio_merged_fn(q, rq, bio); | |
812d4026 DS |
536 | } |
537 | ||
47fafbc7 | 538 | #ifdef CONFIG_PM |
c8158819 LM |
539 | static void blk_pm_requeue_request(struct request *rq) |
540 | { | |
541 | if (rq->q->dev && !(rq->cmd_flags & REQ_PM)) | |
542 | rq->q->nr_pending--; | |
543 | } | |
544 | ||
545 | static void blk_pm_add_request(struct request_queue *q, struct request *rq) | |
546 | { | |
547 | if (q->dev && !(rq->cmd_flags & REQ_PM) && q->nr_pending++ == 0 && | |
548 | (q->rpm_status == RPM_SUSPENDED || q->rpm_status == RPM_SUSPENDING)) | |
549 | pm_request_resume(q->dev); | |
550 | } | |
551 | #else | |
552 | static inline void blk_pm_requeue_request(struct request *rq) {} | |
553 | static inline void blk_pm_add_request(struct request_queue *q, | |
554 | struct request *rq) | |
555 | { | |
556 | } | |
557 | #endif | |
558 | ||
165125e1 | 559 | void elv_requeue_request(struct request_queue *q, struct request *rq) |
1da177e4 | 560 | { |
1da177e4 LT |
561 | /* |
562 | * it already went through dequeue, we need to decrement the | |
563 | * in_flight count again | |
564 | */ | |
8922e16c | 565 | if (blk_account_rq(rq)) { |
0a7ae2ff | 566 | q->in_flight[rq_is_sync(rq)]--; |
33659ebb | 567 | if (rq->cmd_flags & REQ_SORTED) |
cad97516 | 568 | elv_deactivate_rq(q, rq); |
8922e16c | 569 | } |
1da177e4 | 570 | |
4aff5e23 | 571 | rq->cmd_flags &= ~REQ_STARTED; |
1da177e4 | 572 | |
c8158819 LM |
573 | blk_pm_requeue_request(rq); |
574 | ||
b710a480 | 575 | __elv_add_request(q, rq, ELEVATOR_INSERT_REQUEUE); |
1da177e4 LT |
576 | } |
577 | ||
26308eab | 578 | void elv_drain_elevator(struct request_queue *q) |
15853af9 TH |
579 | { |
580 | static int printed; | |
e3c78ca5 TH |
581 | |
582 | lockdep_assert_held(q->queue_lock); | |
583 | ||
22f746e2 | 584 | while (q->elevator->type->ops.elevator_dispatch_fn(q, 1)) |
15853af9 | 585 | ; |
e3c78ca5 | 586 | if (q->nr_sorted && printed++ < 10) { |
15853af9 TH |
587 | printk(KERN_ERR "%s: forced dispatching is broken " |
588 | "(nr_sorted=%u), please report this\n", | |
22f746e2 | 589 | q->elevator->type->elevator_name, q->nr_sorted); |
15853af9 TH |
590 | } |
591 | } | |
592 | ||
b710a480 | 593 | void __elv_add_request(struct request_queue *q, struct request *rq, int where) |
1da177e4 | 594 | { |
5f3ea37c | 595 | trace_block_rq_insert(q, rq); |
2056a782 | 596 | |
c8158819 LM |
597 | blk_pm_add_request(q, rq); |
598 | ||
1da177e4 LT |
599 | rq->q = q; |
600 | ||
b710a480 JA |
601 | if (rq->cmd_flags & REQ_SOFTBARRIER) { |
602 | /* barriers are scheduling boundary, update end_sector */ | |
e2a60da7 | 603 | if (rq->cmd_type == REQ_TYPE_FS) { |
b710a480 JA |
604 | q->end_sector = rq_end_sector(rq); |
605 | q->boundary_rq = rq; | |
606 | } | |
607 | } else if (!(rq->cmd_flags & REQ_ELVPRIV) && | |
3aa72873 JA |
608 | (where == ELEVATOR_INSERT_SORT || |
609 | where == ELEVATOR_INSERT_SORT_MERGE)) | |
b710a480 JA |
610 | where = ELEVATOR_INSERT_BACK; |
611 | ||
8922e16c | 612 | switch (where) { |
28e7d184 | 613 | case ELEVATOR_INSERT_REQUEUE: |
8922e16c | 614 | case ELEVATOR_INSERT_FRONT: |
4aff5e23 | 615 | rq->cmd_flags |= REQ_SOFTBARRIER; |
8922e16c TH |
616 | list_add(&rq->queuelist, &q->queue_head); |
617 | break; | |
618 | ||
619 | case ELEVATOR_INSERT_BACK: | |
4aff5e23 | 620 | rq->cmd_flags |= REQ_SOFTBARRIER; |
15853af9 | 621 | elv_drain_elevator(q); |
8922e16c TH |
622 | list_add_tail(&rq->queuelist, &q->queue_head); |
623 | /* | |
624 | * We kick the queue here for the following reasons. | |
625 | * - The elevator might have returned NULL previously | |
626 | * to delay requests and returned them now. As the | |
627 | * queue wasn't empty before this request, ll_rw_blk | |
628 | * won't run the queue on return, resulting in hang. | |
629 | * - Usually, back inserted requests won't be merged | |
630 | * with anything. There's no point in delaying queue | |
631 | * processing. | |
632 | */ | |
24ecfbe2 | 633 | __blk_run_queue(q); |
8922e16c TH |
634 | break; |
635 | ||
5e84ea3a JA |
636 | case ELEVATOR_INSERT_SORT_MERGE: |
637 | /* | |
638 | * If we succeed in merging this request with one in the | |
639 | * queue already, we are done - rq has now been freed, | |
640 | * so no need to do anything further. | |
641 | */ | |
642 | if (elv_attempt_insert_merge(q, rq)) | |
643 | break; | |
8922e16c | 644 | case ELEVATOR_INSERT_SORT: |
e2a60da7 | 645 | BUG_ON(rq->cmd_type != REQ_TYPE_FS); |
4aff5e23 | 646 | rq->cmd_flags |= REQ_SORTED; |
15853af9 | 647 | q->nr_sorted++; |
9817064b JA |
648 | if (rq_mergeable(rq)) { |
649 | elv_rqhash_add(q, rq); | |
650 | if (!q->last_merge) | |
651 | q->last_merge = rq; | |
652 | } | |
653 | ||
ca23509f TH |
654 | /* |
655 | * Some ioscheds (cfq) run q->request_fn directly, so | |
656 | * rq cannot be accessed after calling | |
657 | * elevator_add_req_fn. | |
658 | */ | |
22f746e2 | 659 | q->elevator->type->ops.elevator_add_req_fn(q, rq); |
8922e16c TH |
660 | break; |
661 | ||
ae1b1539 TH |
662 | case ELEVATOR_INSERT_FLUSH: |
663 | rq->cmd_flags |= REQ_SOFTBARRIER; | |
664 | blk_insert_flush(rq); | |
665 | break; | |
8922e16c TH |
666 | default: |
667 | printk(KERN_ERR "%s: bad insertion point %d\n", | |
24c03d47 | 668 | __func__, where); |
8922e16c TH |
669 | BUG(); |
670 | } | |
1da177e4 | 671 | } |
2e662b65 JA |
672 | EXPORT_SYMBOL(__elv_add_request); |
673 | ||
7eaceacc | 674 | void elv_add_request(struct request_queue *q, struct request *rq, int where) |
1da177e4 LT |
675 | { |
676 | unsigned long flags; | |
677 | ||
678 | spin_lock_irqsave(q->queue_lock, flags); | |
7eaceacc | 679 | __elv_add_request(q, rq, where); |
1da177e4 LT |
680 | spin_unlock_irqrestore(q->queue_lock, flags); |
681 | } | |
2e662b65 JA |
682 | EXPORT_SYMBOL(elv_add_request); |
683 | ||
165125e1 | 684 | struct request *elv_latter_request(struct request_queue *q, struct request *rq) |
1da177e4 | 685 | { |
b374d18a | 686 | struct elevator_queue *e = q->elevator; |
1da177e4 | 687 | |
22f746e2 TH |
688 | if (e->type->ops.elevator_latter_req_fn) |
689 | return e->type->ops.elevator_latter_req_fn(q, rq); | |
1da177e4 LT |
690 | return NULL; |
691 | } | |
692 | ||
165125e1 | 693 | struct request *elv_former_request(struct request_queue *q, struct request *rq) |
1da177e4 | 694 | { |
b374d18a | 695 | struct elevator_queue *e = q->elevator; |
1da177e4 | 696 | |
22f746e2 TH |
697 | if (e->type->ops.elevator_former_req_fn) |
698 | return e->type->ops.elevator_former_req_fn(q, rq); | |
1da177e4 LT |
699 | return NULL; |
700 | } | |
701 | ||
852c788f TH |
702 | int elv_set_request(struct request_queue *q, struct request *rq, |
703 | struct bio *bio, gfp_t gfp_mask) | |
1da177e4 | 704 | { |
b374d18a | 705 | struct elevator_queue *e = q->elevator; |
1da177e4 | 706 | |
22f746e2 | 707 | if (e->type->ops.elevator_set_req_fn) |
852c788f | 708 | return e->type->ops.elevator_set_req_fn(q, rq, bio, gfp_mask); |
1da177e4 LT |
709 | return 0; |
710 | } | |
711 | ||
165125e1 | 712 | void elv_put_request(struct request_queue *q, struct request *rq) |
1da177e4 | 713 | { |
b374d18a | 714 | struct elevator_queue *e = q->elevator; |
1da177e4 | 715 | |
22f746e2 TH |
716 | if (e->type->ops.elevator_put_req_fn) |
717 | e->type->ops.elevator_put_req_fn(rq); | |
1da177e4 LT |
718 | } |
719 | ||
165125e1 | 720 | int elv_may_queue(struct request_queue *q, int rw) |
1da177e4 | 721 | { |
b374d18a | 722 | struct elevator_queue *e = q->elevator; |
1da177e4 | 723 | |
22f746e2 TH |
724 | if (e->type->ops.elevator_may_queue_fn) |
725 | return e->type->ops.elevator_may_queue_fn(q, rw); | |
1da177e4 LT |
726 | |
727 | return ELV_MQUEUE_MAY; | |
728 | } | |
729 | ||
165125e1 | 730 | void elv_completed_request(struct request_queue *q, struct request *rq) |
1da177e4 | 731 | { |
b374d18a | 732 | struct elevator_queue *e = q->elevator; |
1da177e4 LT |
733 | |
734 | /* | |
735 | * request is released from the driver, io must be done | |
736 | */ | |
8922e16c | 737 | if (blk_account_rq(rq)) { |
0a7ae2ff | 738 | q->in_flight[rq_is_sync(rq)]--; |
33659ebb | 739 | if ((rq->cmd_flags & REQ_SORTED) && |
22f746e2 TH |
740 | e->type->ops.elevator_completed_req_fn) |
741 | e->type->ops.elevator_completed_req_fn(q, rq); | |
1bc691d3 | 742 | } |
1da177e4 LT |
743 | } |
744 | ||
3d1ab40f AV |
745 | #define to_elv(atr) container_of((atr), struct elv_fs_entry, attr) |
746 | ||
747 | static ssize_t | |
748 | elv_attr_show(struct kobject *kobj, struct attribute *attr, char *page) | |
1da177e4 | 749 | { |
3d1ab40f | 750 | struct elv_fs_entry *entry = to_elv(attr); |
b374d18a | 751 | struct elevator_queue *e; |
3d1ab40f AV |
752 | ssize_t error; |
753 | ||
754 | if (!entry->show) | |
755 | return -EIO; | |
756 | ||
b374d18a | 757 | e = container_of(kobj, struct elevator_queue, kobj); |
3d1ab40f | 758 | mutex_lock(&e->sysfs_lock); |
22f746e2 | 759 | error = e->type ? entry->show(e, page) : -ENOENT; |
3d1ab40f AV |
760 | mutex_unlock(&e->sysfs_lock); |
761 | return error; | |
762 | } | |
1da177e4 | 763 | |
3d1ab40f AV |
764 | static ssize_t |
765 | elv_attr_store(struct kobject *kobj, struct attribute *attr, | |
766 | const char *page, size_t length) | |
767 | { | |
3d1ab40f | 768 | struct elv_fs_entry *entry = to_elv(attr); |
b374d18a | 769 | struct elevator_queue *e; |
3d1ab40f | 770 | ssize_t error; |
1da177e4 | 771 | |
3d1ab40f AV |
772 | if (!entry->store) |
773 | return -EIO; | |
1da177e4 | 774 | |
b374d18a | 775 | e = container_of(kobj, struct elevator_queue, kobj); |
3d1ab40f | 776 | mutex_lock(&e->sysfs_lock); |
22f746e2 | 777 | error = e->type ? entry->store(e, page, length) : -ENOENT; |
3d1ab40f AV |
778 | mutex_unlock(&e->sysfs_lock); |
779 | return error; | |
780 | } | |
781 | ||
52cf25d0 | 782 | static const struct sysfs_ops elv_sysfs_ops = { |
3d1ab40f AV |
783 | .show = elv_attr_show, |
784 | .store = elv_attr_store, | |
785 | }; | |
786 | ||
787 | static struct kobj_type elv_ktype = { | |
788 | .sysfs_ops = &elv_sysfs_ops, | |
789 | .release = elevator_release, | |
790 | }; | |
791 | ||
5a5bafdc | 792 | int elv_register_queue(struct request_queue *q) |
3d1ab40f | 793 | { |
5a5bafdc | 794 | struct elevator_queue *e = q->elevator; |
3d1ab40f AV |
795 | int error; |
796 | ||
b2d6db58 | 797 | error = kobject_add(&e->kobj, &q->kobj, "%s", "iosched"); |
3d1ab40f | 798 | if (!error) { |
22f746e2 | 799 | struct elv_fs_entry *attr = e->type->elevator_attrs; |
3d1ab40f | 800 | if (attr) { |
e572ec7e AV |
801 | while (attr->attr.name) { |
802 | if (sysfs_create_file(&e->kobj, &attr->attr)) | |
3d1ab40f | 803 | break; |
e572ec7e | 804 | attr++; |
3d1ab40f AV |
805 | } |
806 | } | |
807 | kobject_uevent(&e->kobj, KOBJ_ADD); | |
430c62fb | 808 | e->registered = 1; |
0bb97947 JA |
809 | if (e->type->ops.elevator_registered_fn) |
810 | e->type->ops.elevator_registered_fn(q); | |
3d1ab40f AV |
811 | } |
812 | return error; | |
1da177e4 | 813 | } |
f8fc877d | 814 | EXPORT_SYMBOL(elv_register_queue); |
bc1c1169 | 815 | |
1da177e4 LT |
816 | void elv_unregister_queue(struct request_queue *q) |
817 | { | |
f8fc877d TH |
818 | if (q) { |
819 | struct elevator_queue *e = q->elevator; | |
820 | ||
821 | kobject_uevent(&e->kobj, KOBJ_REMOVE); | |
822 | kobject_del(&e->kobj); | |
823 | e->registered = 0; | |
824 | } | |
1da177e4 | 825 | } |
01effb0d | 826 | EXPORT_SYMBOL(elv_unregister_queue); |
1da177e4 | 827 | |
e567bf71 | 828 | int elv_register(struct elevator_type *e) |
1da177e4 | 829 | { |
1ffb96c5 | 830 | char *def = ""; |
2a12dcd7 | 831 | |
3d3c2379 TH |
832 | /* create icq_cache if requested */ |
833 | if (e->icq_size) { | |
834 | if (WARN_ON(e->icq_size < sizeof(struct io_cq)) || | |
835 | WARN_ON(e->icq_align < __alignof__(struct io_cq))) | |
836 | return -EINVAL; | |
837 | ||
838 | snprintf(e->icq_cache_name, sizeof(e->icq_cache_name), | |
839 | "%s_io_cq", e->elevator_name); | |
840 | e->icq_cache = kmem_cache_create(e->icq_cache_name, e->icq_size, | |
841 | e->icq_align, 0, NULL); | |
842 | if (!e->icq_cache) | |
843 | return -ENOMEM; | |
844 | } | |
845 | ||
846 | /* register, don't allow duplicate names */ | |
2a12dcd7 | 847 | spin_lock(&elv_list_lock); |
3d3c2379 TH |
848 | if (elevator_find(e->elevator_name)) { |
849 | spin_unlock(&elv_list_lock); | |
850 | if (e->icq_cache) | |
851 | kmem_cache_destroy(e->icq_cache); | |
852 | return -EBUSY; | |
853 | } | |
1da177e4 | 854 | list_add_tail(&e->list, &elv_list); |
2a12dcd7 | 855 | spin_unlock(&elv_list_lock); |
1da177e4 | 856 | |
3d3c2379 | 857 | /* print pretty message */ |
5f003976 ND |
858 | if (!strcmp(e->elevator_name, chosen_elevator) || |
859 | (!*chosen_elevator && | |
860 | !strcmp(e->elevator_name, CONFIG_DEFAULT_IOSCHED))) | |
1ffb96c5 TV |
861 | def = " (default)"; |
862 | ||
4eb166d9 JA |
863 | printk(KERN_INFO "io scheduler %s registered%s\n", e->elevator_name, |
864 | def); | |
3d3c2379 | 865 | return 0; |
1da177e4 LT |
866 | } |
867 | EXPORT_SYMBOL_GPL(elv_register); | |
868 | ||
869 | void elv_unregister(struct elevator_type *e) | |
870 | { | |
3d3c2379 | 871 | /* unregister */ |
2a12dcd7 | 872 | spin_lock(&elv_list_lock); |
1da177e4 | 873 | list_del_init(&e->list); |
2a12dcd7 | 874 | spin_unlock(&elv_list_lock); |
3d3c2379 TH |
875 | |
876 | /* | |
877 | * Destroy icq_cache if it exists. icq's are RCU managed. Make | |
878 | * sure all RCU operations are complete before proceeding. | |
879 | */ | |
880 | if (e->icq_cache) { | |
881 | rcu_barrier(); | |
882 | kmem_cache_destroy(e->icq_cache); | |
883 | e->icq_cache = NULL; | |
884 | } | |
1da177e4 LT |
885 | } |
886 | EXPORT_SYMBOL_GPL(elv_unregister); | |
887 | ||
888 | /* | |
889 | * switch to new_e io scheduler. be careful not to introduce deadlocks - | |
890 | * we don't free the old io scheduler, before we have allocated what we | |
891 | * need for the new one. this way we have a chance of going back to the old | |
cb98fc8b | 892 | * one, if the new one fails init for some reason. |
1da177e4 | 893 | */ |
165125e1 | 894 | static int elevator_switch(struct request_queue *q, struct elevator_type *new_e) |
1da177e4 | 895 | { |
5a5bafdc TH |
896 | struct elevator_queue *old = q->elevator; |
897 | bool registered = old->registered; | |
e8989fae | 898 | int err; |
1da177e4 | 899 | |
5a5bafdc TH |
900 | /* |
901 | * Turn on BYPASS and drain all requests w/ elevator private data. | |
902 | * Block layer doesn't call into a quiesced elevator - all requests | |
903 | * are directly put on the dispatch list without elevator data | |
904 | * using INSERT_BACK. All requests have SOFTBARRIER set and no | |
905 | * merge happens either. | |
906 | */ | |
d732580b | 907 | blk_queue_bypass_start(q); |
cb98fc8b | 908 | |
5a5bafdc TH |
909 | /* unregister and clear all auxiliary data of the old elevator */ |
910 | if (registered) | |
f8fc877d | 911 | elv_unregister_queue(q); |
1da177e4 | 912 | |
f8fc877d | 913 | spin_lock_irq(q->queue_lock); |
7e5a8794 | 914 | ioc_clear_queue(q); |
f8fc877d TH |
915 | spin_unlock_irq(q->queue_lock); |
916 | ||
5a5bafdc | 917 | /* allocate, init and register new elevator */ |
d50235b7 JM |
918 | err = new_e->ops.elevator_init_fn(q, new_e); |
919 | if (err) | |
5a5bafdc TH |
920 | goto fail_init; |
921 | ||
5a5bafdc TH |
922 | if (registered) { |
923 | err = elv_register_queue(q); | |
924 | if (err) | |
925 | goto fail_register; | |
926 | } | |
927 | ||
928 | /* done, kill the old one and finish */ | |
929 | elevator_exit(old); | |
d732580b | 930 | blk_queue_bypass_end(q); |
75ad23bc | 931 | |
5a5bafdc | 932 | blk_add_trace_msg(q, "elv switch: %s", new_e->elevator_name); |
4722dc52 | 933 | |
5dd531a0 | 934 | return 0; |
1da177e4 LT |
935 | |
936 | fail_register: | |
5a5bafdc TH |
937 | elevator_exit(q->elevator); |
938 | fail_init: | |
939 | /* switch failed, restore and re-register old elevator */ | |
940 | q->elevator = old; | |
1da177e4 | 941 | elv_register_queue(q); |
d732580b | 942 | blk_queue_bypass_end(q); |
75ad23bc | 943 | |
5dd531a0 | 944 | return err; |
1da177e4 LT |
945 | } |
946 | ||
5dd531a0 JA |
947 | /* |
948 | * Switch this queue to the given IO scheduler. | |
949 | */ | |
7c8a3679 | 950 | static int __elevator_change(struct request_queue *q, const char *name) |
1da177e4 LT |
951 | { |
952 | char elevator_name[ELV_NAME_MAX]; | |
953 | struct elevator_type *e; | |
954 | ||
cd43e26f | 955 | if (!q->elevator) |
5dd531a0 | 956 | return -ENXIO; |
cd43e26f | 957 | |
ee2e992c | 958 | strlcpy(elevator_name, name, sizeof(elevator_name)); |
21c3c5d2 | 959 | e = elevator_get(strstrip(elevator_name), true); |
1da177e4 LT |
960 | if (!e) { |
961 | printk(KERN_ERR "elevator: type %s not found\n", elevator_name); | |
962 | return -EINVAL; | |
963 | } | |
964 | ||
22f746e2 | 965 | if (!strcmp(elevator_name, q->elevator->type->elevator_name)) { |
2ca7d93b | 966 | elevator_put(e); |
5dd531a0 | 967 | return 0; |
2ca7d93b | 968 | } |
1da177e4 | 969 | |
5dd531a0 JA |
970 | return elevator_switch(q, e); |
971 | } | |
7c8a3679 TS |
972 | |
973 | int elevator_change(struct request_queue *q, const char *name) | |
974 | { | |
975 | int ret; | |
976 | ||
977 | /* Protect q->elevator from elevator_init() */ | |
978 | mutex_lock(&q->sysfs_lock); | |
979 | ret = __elevator_change(q, name); | |
980 | mutex_unlock(&q->sysfs_lock); | |
981 | ||
982 | return ret; | |
983 | } | |
5dd531a0 JA |
984 | EXPORT_SYMBOL(elevator_change); |
985 | ||
986 | ssize_t elv_iosched_store(struct request_queue *q, const char *name, | |
987 | size_t count) | |
988 | { | |
989 | int ret; | |
990 | ||
991 | if (!q->elevator) | |
992 | return count; | |
993 | ||
7c8a3679 | 994 | ret = __elevator_change(q, name); |
5dd531a0 JA |
995 | if (!ret) |
996 | return count; | |
997 | ||
998 | printk(KERN_ERR "elevator: switch to %s failed\n", name); | |
999 | return ret; | |
1da177e4 LT |
1000 | } |
1001 | ||
165125e1 | 1002 | ssize_t elv_iosched_show(struct request_queue *q, char *name) |
1da177e4 | 1003 | { |
b374d18a | 1004 | struct elevator_queue *e = q->elevator; |
cd43e26f | 1005 | struct elevator_type *elv; |
70cee26e | 1006 | struct elevator_type *__e; |
1da177e4 LT |
1007 | int len = 0; |
1008 | ||
e36f724b | 1009 | if (!q->elevator || !blk_queue_stackable(q)) |
cd43e26f MP |
1010 | return sprintf(name, "none\n"); |
1011 | ||
22f746e2 | 1012 | elv = e->type; |
cd43e26f | 1013 | |
2a12dcd7 | 1014 | spin_lock(&elv_list_lock); |
70cee26e | 1015 | list_for_each_entry(__e, &elv_list, list) { |
1da177e4 LT |
1016 | if (!strcmp(elv->elevator_name, __e->elevator_name)) |
1017 | len += sprintf(name+len, "[%s] ", elv->elevator_name); | |
1018 | else | |
1019 | len += sprintf(name+len, "%s ", __e->elevator_name); | |
1020 | } | |
2a12dcd7 | 1021 | spin_unlock(&elv_list_lock); |
1da177e4 LT |
1022 | |
1023 | len += sprintf(len+name, "\n"); | |
1024 | return len; | |
1025 | } | |
1026 | ||
165125e1 JA |
1027 | struct request *elv_rb_former_request(struct request_queue *q, |
1028 | struct request *rq) | |
2e662b65 JA |
1029 | { |
1030 | struct rb_node *rbprev = rb_prev(&rq->rb_node); | |
1031 | ||
1032 | if (rbprev) | |
1033 | return rb_entry_rq(rbprev); | |
1034 | ||
1035 | return NULL; | |
1036 | } | |
2e662b65 JA |
1037 | EXPORT_SYMBOL(elv_rb_former_request); |
1038 | ||
165125e1 JA |
1039 | struct request *elv_rb_latter_request(struct request_queue *q, |
1040 | struct request *rq) | |
2e662b65 JA |
1041 | { |
1042 | struct rb_node *rbnext = rb_next(&rq->rb_node); | |
1043 | ||
1044 | if (rbnext) | |
1045 | return rb_entry_rq(rbnext); | |
1046 | ||
1047 | return NULL; | |
1048 | } | |
2e662b65 | 1049 | EXPORT_SYMBOL(elv_rb_latter_request); |