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