]>
Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
1da177e4 LT |
2 | * CFQ, or complete fairness queueing, disk scheduler. |
3 | * | |
4 | * Based on ideas from a previously unfinished io | |
5 | * scheduler (round robin per-process disk scheduling) and Andrea Arcangeli. | |
6 | * | |
0fe23479 | 7 | * Copyright (C) 2003 Jens Axboe <axboe@kernel.dk> |
1da177e4 | 8 | */ |
1da177e4 | 9 | #include <linux/module.h> |
1cc9be68 AV |
10 | #include <linux/blkdev.h> |
11 | #include <linux/elevator.h> | |
1da177e4 | 12 | #include <linux/rbtree.h> |
22e2c507 | 13 | #include <linux/ioprio.h> |
7b679138 | 14 | #include <linux/blktrace_api.h> |
1da177e4 LT |
15 | |
16 | /* | |
17 | * tunables | |
18 | */ | |
fe094d98 JA |
19 | /* max queue in one round of service */ |
20 | static const int cfq_quantum = 4; | |
64100099 | 21 | static const int cfq_fifo_expire[2] = { HZ / 4, HZ / 8 }; |
fe094d98 JA |
22 | /* maximum backwards seek, in KiB */ |
23 | static const int cfq_back_max = 16 * 1024; | |
24 | /* penalty of a backwards seek */ | |
25 | static const int cfq_back_penalty = 2; | |
64100099 | 26 | static const int cfq_slice_sync = HZ / 10; |
3b18152c | 27 | static int cfq_slice_async = HZ / 25; |
64100099 | 28 | static const int cfq_slice_async_rq = 2; |
caaa5f9f | 29 | static int cfq_slice_idle = HZ / 125; |
22e2c507 | 30 | |
d9e7620e | 31 | /* |
0871714e | 32 | * offset from end of service tree |
d9e7620e | 33 | */ |
0871714e | 34 | #define CFQ_IDLE_DELAY (HZ / 5) |
d9e7620e JA |
35 | |
36 | /* | |
37 | * below this threshold, we consider thinktime immediate | |
38 | */ | |
39 | #define CFQ_MIN_TT (2) | |
40 | ||
22e2c507 | 41 | #define CFQ_SLICE_SCALE (5) |
45333d5a | 42 | #define CFQ_HW_QUEUE_MIN (5) |
22e2c507 | 43 | |
fe094d98 JA |
44 | #define RQ_CIC(rq) \ |
45 | ((struct cfq_io_context *) (rq)->elevator_private) | |
7b679138 | 46 | #define RQ_CFQQ(rq) (struct cfq_queue *) ((rq)->elevator_private2) |
1da177e4 | 47 | |
e18b890b CL |
48 | static struct kmem_cache *cfq_pool; |
49 | static struct kmem_cache *cfq_ioc_pool; | |
1da177e4 | 50 | |
4050cf16 | 51 | static DEFINE_PER_CPU(unsigned long, ioc_count); |
334e94de | 52 | static struct completion *ioc_gone; |
9a11b4ed | 53 | static DEFINE_SPINLOCK(ioc_gone_lock); |
334e94de | 54 | |
22e2c507 JA |
55 | #define CFQ_PRIO_LISTS IOPRIO_BE_NR |
56 | #define cfq_class_idle(cfqq) ((cfqq)->ioprio_class == IOPRIO_CLASS_IDLE) | |
22e2c507 JA |
57 | #define cfq_class_rt(cfqq) ((cfqq)->ioprio_class == IOPRIO_CLASS_RT) |
58 | ||
206dc69b JA |
59 | #define sample_valid(samples) ((samples) > 80) |
60 | ||
cc09e299 JA |
61 | /* |
62 | * Most of our rbtree usage is for sorting with min extraction, so | |
63 | * if we cache the leftmost node we don't have to walk down the tree | |
64 | * to find it. Idea borrowed from Ingo Molnars CFS scheduler. We should | |
65 | * move this into the elevator for the rq sorting as well. | |
66 | */ | |
67 | struct cfq_rb_root { | |
68 | struct rb_root rb; | |
69 | struct rb_node *left; | |
70 | }; | |
71 | #define CFQ_RB_ROOT (struct cfq_rb_root) { RB_ROOT, NULL, } | |
72 | ||
22e2c507 JA |
73 | /* |
74 | * Per block device queue structure | |
75 | */ | |
1da177e4 | 76 | struct cfq_data { |
165125e1 | 77 | struct request_queue *queue; |
22e2c507 JA |
78 | |
79 | /* | |
80 | * rr list of queues with requests and the count of them | |
81 | */ | |
cc09e299 | 82 | struct cfq_rb_root service_tree; |
a36e71f9 JA |
83 | |
84 | /* | |
85 | * Each priority tree is sorted by next_request position. These | |
86 | * trees are used when determining if two or more queues are | |
87 | * interleaving requests (see cfq_close_cooperator). | |
88 | */ | |
89 | struct rb_root prio_trees[CFQ_PRIO_LISTS]; | |
90 | ||
22e2c507 | 91 | unsigned int busy_queues; |
3a9a3f6c DS |
92 | /* |
93 | * Used to track any pending rt requests so we can pre-empt current | |
94 | * non-RT cfqq in service when this value is non-zero. | |
95 | */ | |
96 | unsigned int busy_rt_queues; | |
22e2c507 | 97 | |
22e2c507 | 98 | int rq_in_driver; |
3ed9a296 | 99 | int sync_flight; |
45333d5a AC |
100 | |
101 | /* | |
102 | * queue-depth detection | |
103 | */ | |
104 | int rq_queued; | |
25776e35 | 105 | int hw_tag; |
45333d5a AC |
106 | int hw_tag_samples; |
107 | int rq_in_driver_peak; | |
1da177e4 | 108 | |
22e2c507 JA |
109 | /* |
110 | * idle window management | |
111 | */ | |
112 | struct timer_list idle_slice_timer; | |
113 | struct work_struct unplug_work; | |
1da177e4 | 114 | |
22e2c507 JA |
115 | struct cfq_queue *active_queue; |
116 | struct cfq_io_context *active_cic; | |
22e2c507 | 117 | |
c2dea2d1 VT |
118 | /* |
119 | * async queue for each priority case | |
120 | */ | |
121 | struct cfq_queue *async_cfqq[2][IOPRIO_BE_NR]; | |
122 | struct cfq_queue *async_idle_cfqq; | |
15c31be4 | 123 | |
6d048f53 | 124 | sector_t last_position; |
22e2c507 | 125 | unsigned long last_end_request; |
1da177e4 | 126 | |
1da177e4 LT |
127 | /* |
128 | * tunables, see top of file | |
129 | */ | |
130 | unsigned int cfq_quantum; | |
22e2c507 | 131 | unsigned int cfq_fifo_expire[2]; |
1da177e4 LT |
132 | unsigned int cfq_back_penalty; |
133 | unsigned int cfq_back_max; | |
22e2c507 JA |
134 | unsigned int cfq_slice[2]; |
135 | unsigned int cfq_slice_async_rq; | |
136 | unsigned int cfq_slice_idle; | |
d9ff4187 AV |
137 | |
138 | struct list_head cic_list; | |
1da177e4 LT |
139 | }; |
140 | ||
22e2c507 JA |
141 | /* |
142 | * Per process-grouping structure | |
143 | */ | |
1da177e4 LT |
144 | struct cfq_queue { |
145 | /* reference count */ | |
146 | atomic_t ref; | |
be754d2c RK |
147 | /* various state flags, see below */ |
148 | unsigned int flags; | |
1da177e4 LT |
149 | /* parent cfq_data */ |
150 | struct cfq_data *cfqd; | |
d9e7620e JA |
151 | /* service_tree member */ |
152 | struct rb_node rb_node; | |
153 | /* service_tree key */ | |
154 | unsigned long rb_key; | |
a36e71f9 JA |
155 | /* prio tree member */ |
156 | struct rb_node p_node; | |
1da177e4 LT |
157 | /* sorted list of pending requests */ |
158 | struct rb_root sort_list; | |
159 | /* if fifo isn't expired, next request to serve */ | |
5e705374 | 160 | struct request *next_rq; |
1da177e4 LT |
161 | /* requests queued in sort_list */ |
162 | int queued[2]; | |
163 | /* currently allocated requests */ | |
164 | int allocated[2]; | |
165 | /* fifo list of requests in sort_list */ | |
22e2c507 | 166 | struct list_head fifo; |
1da177e4 | 167 | |
22e2c507 | 168 | unsigned long slice_end; |
c5b680f3 | 169 | long slice_resid; |
2f5cb738 | 170 | unsigned int slice_dispatch; |
1da177e4 | 171 | |
be754d2c RK |
172 | /* pending metadata requests */ |
173 | int meta_pending; | |
6d048f53 JA |
174 | /* number of requests that are on the dispatch list or inside driver */ |
175 | int dispatched; | |
22e2c507 JA |
176 | |
177 | /* io prio of this group */ | |
178 | unsigned short ioprio, org_ioprio; | |
179 | unsigned short ioprio_class, org_ioprio_class; | |
180 | ||
7b679138 | 181 | pid_t pid; |
1da177e4 LT |
182 | }; |
183 | ||
3b18152c | 184 | enum cfqq_state_flags { |
b0b8d749 JA |
185 | CFQ_CFQQ_FLAG_on_rr = 0, /* on round-robin busy list */ |
186 | CFQ_CFQQ_FLAG_wait_request, /* waiting for a request */ | |
b029195d | 187 | CFQ_CFQQ_FLAG_must_dispatch, /* must be allowed a dispatch */ |
b0b8d749 JA |
188 | CFQ_CFQQ_FLAG_must_alloc, /* must be allowed rq alloc */ |
189 | CFQ_CFQQ_FLAG_must_alloc_slice, /* per-slice must_alloc flag */ | |
b0b8d749 JA |
190 | CFQ_CFQQ_FLAG_fifo_expire, /* FIFO checked in this slice */ |
191 | CFQ_CFQQ_FLAG_idle_window, /* slice idling enabled */ | |
192 | CFQ_CFQQ_FLAG_prio_changed, /* task priority has changed */ | |
44f7c160 | 193 | CFQ_CFQQ_FLAG_slice_new, /* no requests dispatched in slice */ |
91fac317 | 194 | CFQ_CFQQ_FLAG_sync, /* synchronous queue */ |
a36e71f9 | 195 | CFQ_CFQQ_FLAG_coop, /* has done a coop jump of the queue */ |
3b18152c JA |
196 | }; |
197 | ||
198 | #define CFQ_CFQQ_FNS(name) \ | |
199 | static inline void cfq_mark_cfqq_##name(struct cfq_queue *cfqq) \ | |
200 | { \ | |
fe094d98 | 201 | (cfqq)->flags |= (1 << CFQ_CFQQ_FLAG_##name); \ |
3b18152c JA |
202 | } \ |
203 | static inline void cfq_clear_cfqq_##name(struct cfq_queue *cfqq) \ | |
204 | { \ | |
fe094d98 | 205 | (cfqq)->flags &= ~(1 << CFQ_CFQQ_FLAG_##name); \ |
3b18152c JA |
206 | } \ |
207 | static inline int cfq_cfqq_##name(const struct cfq_queue *cfqq) \ | |
208 | { \ | |
fe094d98 | 209 | return ((cfqq)->flags & (1 << CFQ_CFQQ_FLAG_##name)) != 0; \ |
3b18152c JA |
210 | } |
211 | ||
212 | CFQ_CFQQ_FNS(on_rr); | |
213 | CFQ_CFQQ_FNS(wait_request); | |
b029195d | 214 | CFQ_CFQQ_FNS(must_dispatch); |
3b18152c JA |
215 | CFQ_CFQQ_FNS(must_alloc); |
216 | CFQ_CFQQ_FNS(must_alloc_slice); | |
3b18152c JA |
217 | CFQ_CFQQ_FNS(fifo_expire); |
218 | CFQ_CFQQ_FNS(idle_window); | |
219 | CFQ_CFQQ_FNS(prio_changed); | |
44f7c160 | 220 | CFQ_CFQQ_FNS(slice_new); |
91fac317 | 221 | CFQ_CFQQ_FNS(sync); |
a36e71f9 | 222 | CFQ_CFQQ_FNS(coop); |
3b18152c JA |
223 | #undef CFQ_CFQQ_FNS |
224 | ||
7b679138 JA |
225 | #define cfq_log_cfqq(cfqd, cfqq, fmt, args...) \ |
226 | blk_add_trace_msg((cfqd)->queue, "cfq%d " fmt, (cfqq)->pid, ##args) | |
227 | #define cfq_log(cfqd, fmt, args...) \ | |
228 | blk_add_trace_msg((cfqd)->queue, "cfq " fmt, ##args) | |
229 | ||
165125e1 | 230 | static void cfq_dispatch_insert(struct request_queue *, struct request *); |
91fac317 | 231 | static struct cfq_queue *cfq_get_queue(struct cfq_data *, int, |
fd0928df | 232 | struct io_context *, gfp_t); |
4ac845a2 | 233 | static struct cfq_io_context *cfq_cic_lookup(struct cfq_data *, |
91fac317 VT |
234 | struct io_context *); |
235 | ||
236 | static inline struct cfq_queue *cic_to_cfqq(struct cfq_io_context *cic, | |
237 | int is_sync) | |
238 | { | |
239 | return cic->cfqq[!!is_sync]; | |
240 | } | |
241 | ||
242 | static inline void cic_set_cfqq(struct cfq_io_context *cic, | |
243 | struct cfq_queue *cfqq, int is_sync) | |
244 | { | |
245 | cic->cfqq[!!is_sync] = cfqq; | |
246 | } | |
247 | ||
248 | /* | |
249 | * We regard a request as SYNC, if it's either a read or has the SYNC bit | |
250 | * set (in which case it could also be direct WRITE). | |
251 | */ | |
252 | static inline int cfq_bio_sync(struct bio *bio) | |
253 | { | |
254 | if (bio_data_dir(bio) == READ || bio_sync(bio)) | |
255 | return 1; | |
256 | ||
257 | return 0; | |
258 | } | |
1da177e4 | 259 | |
99f95e52 AM |
260 | /* |
261 | * scheduler run of queue, if there are requests pending and no one in the | |
262 | * driver that will restart queueing | |
263 | */ | |
264 | static inline void cfq_schedule_dispatch(struct cfq_data *cfqd) | |
265 | { | |
7b679138 JA |
266 | if (cfqd->busy_queues) { |
267 | cfq_log(cfqd, "schedule dispatch"); | |
18887ad9 | 268 | kblockd_schedule_work(cfqd->queue, &cfqd->unplug_work); |
7b679138 | 269 | } |
99f95e52 AM |
270 | } |
271 | ||
165125e1 | 272 | static int cfq_queue_empty(struct request_queue *q) |
99f95e52 AM |
273 | { |
274 | struct cfq_data *cfqd = q->elevator->elevator_data; | |
275 | ||
b4878f24 | 276 | return !cfqd->busy_queues; |
99f95e52 AM |
277 | } |
278 | ||
44f7c160 JA |
279 | /* |
280 | * Scale schedule slice based on io priority. Use the sync time slice only | |
281 | * if a queue is marked sync and has sync io queued. A sync queue with async | |
282 | * io only, should not get full sync slice length. | |
283 | */ | |
d9e7620e JA |
284 | static inline int cfq_prio_slice(struct cfq_data *cfqd, int sync, |
285 | unsigned short prio) | |
44f7c160 | 286 | { |
d9e7620e | 287 | const int base_slice = cfqd->cfq_slice[sync]; |
44f7c160 | 288 | |
d9e7620e JA |
289 | WARN_ON(prio >= IOPRIO_BE_NR); |
290 | ||
291 | return base_slice + (base_slice/CFQ_SLICE_SCALE * (4 - prio)); | |
292 | } | |
44f7c160 | 293 | |
d9e7620e JA |
294 | static inline int |
295 | cfq_prio_to_slice(struct cfq_data *cfqd, struct cfq_queue *cfqq) | |
296 | { | |
297 | return cfq_prio_slice(cfqd, cfq_cfqq_sync(cfqq), cfqq->ioprio); | |
44f7c160 JA |
298 | } |
299 | ||
300 | static inline void | |
301 | cfq_set_prio_slice(struct cfq_data *cfqd, struct cfq_queue *cfqq) | |
302 | { | |
303 | cfqq->slice_end = cfq_prio_to_slice(cfqd, cfqq) + jiffies; | |
7b679138 | 304 | cfq_log_cfqq(cfqd, cfqq, "set_slice=%lu", cfqq->slice_end - jiffies); |
44f7c160 JA |
305 | } |
306 | ||
307 | /* | |
308 | * We need to wrap this check in cfq_cfqq_slice_new(), since ->slice_end | |
309 | * isn't valid until the first request from the dispatch is activated | |
310 | * and the slice time set. | |
311 | */ | |
312 | static inline int cfq_slice_used(struct cfq_queue *cfqq) | |
313 | { | |
314 | if (cfq_cfqq_slice_new(cfqq)) | |
315 | return 0; | |
316 | if (time_before(jiffies, cfqq->slice_end)) | |
317 | return 0; | |
318 | ||
319 | return 1; | |
320 | } | |
321 | ||
1da177e4 | 322 | /* |
5e705374 | 323 | * Lifted from AS - choose which of rq1 and rq2 that is best served now. |
1da177e4 | 324 | * We choose the request that is closest to the head right now. Distance |
e8a99053 | 325 | * behind the head is penalized and only allowed to a certain extent. |
1da177e4 | 326 | */ |
5e705374 JA |
327 | static struct request * |
328 | cfq_choose_req(struct cfq_data *cfqd, struct request *rq1, struct request *rq2) | |
1da177e4 LT |
329 | { |
330 | sector_t last, s1, s2, d1 = 0, d2 = 0; | |
1da177e4 | 331 | unsigned long back_max; |
e8a99053 AM |
332 | #define CFQ_RQ1_WRAP 0x01 /* request 1 wraps */ |
333 | #define CFQ_RQ2_WRAP 0x02 /* request 2 wraps */ | |
334 | unsigned wrap = 0; /* bit mask: requests behind the disk head? */ | |
1da177e4 | 335 | |
5e705374 JA |
336 | if (rq1 == NULL || rq1 == rq2) |
337 | return rq2; | |
338 | if (rq2 == NULL) | |
339 | return rq1; | |
9c2c38a1 | 340 | |
5e705374 JA |
341 | if (rq_is_sync(rq1) && !rq_is_sync(rq2)) |
342 | return rq1; | |
343 | else if (rq_is_sync(rq2) && !rq_is_sync(rq1)) | |
344 | return rq2; | |
374f84ac JA |
345 | if (rq_is_meta(rq1) && !rq_is_meta(rq2)) |
346 | return rq1; | |
347 | else if (rq_is_meta(rq2) && !rq_is_meta(rq1)) | |
348 | return rq2; | |
1da177e4 | 349 | |
5e705374 JA |
350 | s1 = rq1->sector; |
351 | s2 = rq2->sector; | |
1da177e4 | 352 | |
6d048f53 | 353 | last = cfqd->last_position; |
1da177e4 | 354 | |
1da177e4 LT |
355 | /* |
356 | * by definition, 1KiB is 2 sectors | |
357 | */ | |
358 | back_max = cfqd->cfq_back_max * 2; | |
359 | ||
360 | /* | |
361 | * Strict one way elevator _except_ in the case where we allow | |
362 | * short backward seeks which are biased as twice the cost of a | |
363 | * similar forward seek. | |
364 | */ | |
365 | if (s1 >= last) | |
366 | d1 = s1 - last; | |
367 | else if (s1 + back_max >= last) | |
368 | d1 = (last - s1) * cfqd->cfq_back_penalty; | |
369 | else | |
e8a99053 | 370 | wrap |= CFQ_RQ1_WRAP; |
1da177e4 LT |
371 | |
372 | if (s2 >= last) | |
373 | d2 = s2 - last; | |
374 | else if (s2 + back_max >= last) | |
375 | d2 = (last - s2) * cfqd->cfq_back_penalty; | |
376 | else | |
e8a99053 | 377 | wrap |= CFQ_RQ2_WRAP; |
1da177e4 LT |
378 | |
379 | /* Found required data */ | |
e8a99053 AM |
380 | |
381 | /* | |
382 | * By doing switch() on the bit mask "wrap" we avoid having to | |
383 | * check two variables for all permutations: --> faster! | |
384 | */ | |
385 | switch (wrap) { | |
5e705374 | 386 | case 0: /* common case for CFQ: rq1 and rq2 not wrapped */ |
e8a99053 | 387 | if (d1 < d2) |
5e705374 | 388 | return rq1; |
e8a99053 | 389 | else if (d2 < d1) |
5e705374 | 390 | return rq2; |
e8a99053 AM |
391 | else { |
392 | if (s1 >= s2) | |
5e705374 | 393 | return rq1; |
e8a99053 | 394 | else |
5e705374 | 395 | return rq2; |
e8a99053 | 396 | } |
1da177e4 | 397 | |
e8a99053 | 398 | case CFQ_RQ2_WRAP: |
5e705374 | 399 | return rq1; |
e8a99053 | 400 | case CFQ_RQ1_WRAP: |
5e705374 JA |
401 | return rq2; |
402 | case (CFQ_RQ1_WRAP|CFQ_RQ2_WRAP): /* both rqs wrapped */ | |
e8a99053 AM |
403 | default: |
404 | /* | |
405 | * Since both rqs are wrapped, | |
406 | * start with the one that's further behind head | |
407 | * (--> only *one* back seek required), | |
408 | * since back seek takes more time than forward. | |
409 | */ | |
410 | if (s1 <= s2) | |
5e705374 | 411 | return rq1; |
1da177e4 | 412 | else |
5e705374 | 413 | return rq2; |
1da177e4 LT |
414 | } |
415 | } | |
416 | ||
498d3aa2 JA |
417 | /* |
418 | * The below is leftmost cache rbtree addon | |
419 | */ | |
0871714e | 420 | static struct cfq_queue *cfq_rb_first(struct cfq_rb_root *root) |
cc09e299 JA |
421 | { |
422 | if (!root->left) | |
423 | root->left = rb_first(&root->rb); | |
424 | ||
0871714e JA |
425 | if (root->left) |
426 | return rb_entry(root->left, struct cfq_queue, rb_node); | |
427 | ||
428 | return NULL; | |
cc09e299 JA |
429 | } |
430 | ||
a36e71f9 JA |
431 | static void rb_erase_init(struct rb_node *n, struct rb_root *root) |
432 | { | |
433 | rb_erase(n, root); | |
434 | RB_CLEAR_NODE(n); | |
435 | } | |
436 | ||
cc09e299 JA |
437 | static void cfq_rb_erase(struct rb_node *n, struct cfq_rb_root *root) |
438 | { | |
439 | if (root->left == n) | |
440 | root->left = NULL; | |
a36e71f9 | 441 | rb_erase_init(n, &root->rb); |
cc09e299 JA |
442 | } |
443 | ||
1da177e4 LT |
444 | /* |
445 | * would be nice to take fifo expire time into account as well | |
446 | */ | |
5e705374 JA |
447 | static struct request * |
448 | cfq_find_next_rq(struct cfq_data *cfqd, struct cfq_queue *cfqq, | |
449 | struct request *last) | |
1da177e4 | 450 | { |
21183b07 JA |
451 | struct rb_node *rbnext = rb_next(&last->rb_node); |
452 | struct rb_node *rbprev = rb_prev(&last->rb_node); | |
5e705374 | 453 | struct request *next = NULL, *prev = NULL; |
1da177e4 | 454 | |
21183b07 | 455 | BUG_ON(RB_EMPTY_NODE(&last->rb_node)); |
1da177e4 LT |
456 | |
457 | if (rbprev) | |
5e705374 | 458 | prev = rb_entry_rq(rbprev); |
1da177e4 | 459 | |
21183b07 | 460 | if (rbnext) |
5e705374 | 461 | next = rb_entry_rq(rbnext); |
21183b07 JA |
462 | else { |
463 | rbnext = rb_first(&cfqq->sort_list); | |
464 | if (rbnext && rbnext != &last->rb_node) | |
5e705374 | 465 | next = rb_entry_rq(rbnext); |
21183b07 | 466 | } |
1da177e4 | 467 | |
21183b07 | 468 | return cfq_choose_req(cfqd, next, prev); |
1da177e4 LT |
469 | } |
470 | ||
d9e7620e JA |
471 | static unsigned long cfq_slice_offset(struct cfq_data *cfqd, |
472 | struct cfq_queue *cfqq) | |
1da177e4 | 473 | { |
d9e7620e JA |
474 | /* |
475 | * just an approximation, should be ok. | |
476 | */ | |
67e6b49e JA |
477 | return (cfqd->busy_queues - 1) * (cfq_prio_slice(cfqd, 1, 0) - |
478 | cfq_prio_slice(cfqd, cfq_cfqq_sync(cfqq), cfqq->ioprio)); | |
d9e7620e JA |
479 | } |
480 | ||
498d3aa2 JA |
481 | /* |
482 | * The cfqd->service_tree holds all pending cfq_queue's that have | |
483 | * requests waiting to be processed. It is sorted in the order that | |
484 | * we will service the queues. | |
485 | */ | |
a36e71f9 JA |
486 | static void cfq_service_tree_add(struct cfq_data *cfqd, struct cfq_queue *cfqq, |
487 | int add_front) | |
d9e7620e | 488 | { |
0871714e JA |
489 | struct rb_node **p, *parent; |
490 | struct cfq_queue *__cfqq; | |
d9e7620e | 491 | unsigned long rb_key; |
498d3aa2 | 492 | int left; |
d9e7620e | 493 | |
0871714e JA |
494 | if (cfq_class_idle(cfqq)) { |
495 | rb_key = CFQ_IDLE_DELAY; | |
496 | parent = rb_last(&cfqd->service_tree.rb); | |
497 | if (parent && parent != &cfqq->rb_node) { | |
498 | __cfqq = rb_entry(parent, struct cfq_queue, rb_node); | |
499 | rb_key += __cfqq->rb_key; | |
500 | } else | |
501 | rb_key += jiffies; | |
502 | } else if (!add_front) { | |
edd75ffd JA |
503 | rb_key = cfq_slice_offset(cfqd, cfqq) + jiffies; |
504 | rb_key += cfqq->slice_resid; | |
505 | cfqq->slice_resid = 0; | |
506 | } else | |
507 | rb_key = 0; | |
1da177e4 | 508 | |
d9e7620e | 509 | if (!RB_EMPTY_NODE(&cfqq->rb_node)) { |
99f9628a | 510 | /* |
d9e7620e | 511 | * same position, nothing more to do |
99f9628a | 512 | */ |
d9e7620e JA |
513 | if (rb_key == cfqq->rb_key) |
514 | return; | |
1da177e4 | 515 | |
cc09e299 | 516 | cfq_rb_erase(&cfqq->rb_node, &cfqd->service_tree); |
1da177e4 | 517 | } |
d9e7620e | 518 | |
498d3aa2 | 519 | left = 1; |
0871714e JA |
520 | parent = NULL; |
521 | p = &cfqd->service_tree.rb.rb_node; | |
d9e7620e | 522 | while (*p) { |
67060e37 | 523 | struct rb_node **n; |
cc09e299 | 524 | |
d9e7620e JA |
525 | parent = *p; |
526 | __cfqq = rb_entry(parent, struct cfq_queue, rb_node); | |
527 | ||
0c534e0a JA |
528 | /* |
529 | * sort RT queues first, we always want to give | |
67060e37 JA |
530 | * preference to them. IDLE queues goes to the back. |
531 | * after that, sort on the next service time. | |
0c534e0a JA |
532 | */ |
533 | if (cfq_class_rt(cfqq) > cfq_class_rt(__cfqq)) | |
67060e37 | 534 | n = &(*p)->rb_left; |
0c534e0a | 535 | else if (cfq_class_rt(cfqq) < cfq_class_rt(__cfqq)) |
67060e37 JA |
536 | n = &(*p)->rb_right; |
537 | else if (cfq_class_idle(cfqq) < cfq_class_idle(__cfqq)) | |
538 | n = &(*p)->rb_left; | |
539 | else if (cfq_class_idle(cfqq) > cfq_class_idle(__cfqq)) | |
540 | n = &(*p)->rb_right; | |
0c534e0a | 541 | else if (rb_key < __cfqq->rb_key) |
67060e37 JA |
542 | n = &(*p)->rb_left; |
543 | else | |
544 | n = &(*p)->rb_right; | |
545 | ||
546 | if (n == &(*p)->rb_right) | |
cc09e299 | 547 | left = 0; |
67060e37 JA |
548 | |
549 | p = n; | |
d9e7620e JA |
550 | } |
551 | ||
cc09e299 JA |
552 | if (left) |
553 | cfqd->service_tree.left = &cfqq->rb_node; | |
554 | ||
d9e7620e JA |
555 | cfqq->rb_key = rb_key; |
556 | rb_link_node(&cfqq->rb_node, parent, p); | |
cc09e299 | 557 | rb_insert_color(&cfqq->rb_node, &cfqd->service_tree.rb); |
1da177e4 LT |
558 | } |
559 | ||
a36e71f9 JA |
560 | static struct cfq_queue * |
561 | cfq_prio_tree_lookup(struct cfq_data *cfqd, int ioprio, sector_t sector, | |
562 | struct rb_node **ret_parent, struct rb_node ***rb_link) | |
563 | { | |
564 | struct rb_root *root = &cfqd->prio_trees[ioprio]; | |
565 | struct rb_node **p, *parent; | |
566 | struct cfq_queue *cfqq = NULL; | |
567 | ||
568 | parent = NULL; | |
569 | p = &root->rb_node; | |
570 | while (*p) { | |
571 | struct rb_node **n; | |
572 | ||
573 | parent = *p; | |
574 | cfqq = rb_entry(parent, struct cfq_queue, p_node); | |
575 | ||
576 | /* | |
577 | * Sort strictly based on sector. Smallest to the left, | |
578 | * largest to the right. | |
579 | */ | |
580 | if (sector > cfqq->next_rq->sector) | |
581 | n = &(*p)->rb_right; | |
582 | else if (sector < cfqq->next_rq->sector) | |
583 | n = &(*p)->rb_left; | |
584 | else | |
585 | break; | |
586 | p = n; | |
587 | } | |
588 | ||
589 | *ret_parent = parent; | |
590 | if (rb_link) | |
591 | *rb_link = p; | |
592 | return NULL; | |
593 | } | |
594 | ||
595 | static void cfq_prio_tree_add(struct cfq_data *cfqd, struct cfq_queue *cfqq) | |
596 | { | |
597 | struct rb_root *root = &cfqd->prio_trees[cfqq->ioprio]; | |
598 | struct rb_node **p, *parent; | |
599 | struct cfq_queue *__cfqq; | |
600 | ||
601 | if (!RB_EMPTY_NODE(&cfqq->p_node)) | |
602 | rb_erase_init(&cfqq->p_node, root); | |
603 | ||
604 | if (cfq_class_idle(cfqq)) | |
605 | return; | |
606 | if (!cfqq->next_rq) | |
607 | return; | |
608 | ||
609 | __cfqq = cfq_prio_tree_lookup(cfqd, cfqq->ioprio, cfqq->next_rq->sector, | |
610 | &parent, &p); | |
611 | BUG_ON(__cfqq); | |
612 | ||
613 | rb_link_node(&cfqq->p_node, parent, p); | |
614 | rb_insert_color(&cfqq->p_node, root); | |
615 | } | |
616 | ||
498d3aa2 JA |
617 | /* |
618 | * Update cfqq's position in the service tree. | |
619 | */ | |
edd75ffd | 620 | static void cfq_resort_rr_list(struct cfq_data *cfqd, struct cfq_queue *cfqq) |
6d048f53 | 621 | { |
6d048f53 JA |
622 | /* |
623 | * Resorting requires the cfqq to be on the RR list already. | |
624 | */ | |
a36e71f9 | 625 | if (cfq_cfqq_on_rr(cfqq)) { |
edd75ffd | 626 | cfq_service_tree_add(cfqd, cfqq, 0); |
a36e71f9 JA |
627 | cfq_prio_tree_add(cfqd, cfqq); |
628 | } | |
6d048f53 JA |
629 | } |
630 | ||
1da177e4 LT |
631 | /* |
632 | * add to busy list of queues for service, trying to be fair in ordering | |
22e2c507 | 633 | * the pending list according to last request service |
1da177e4 | 634 | */ |
febffd61 | 635 | static void cfq_add_cfqq_rr(struct cfq_data *cfqd, struct cfq_queue *cfqq) |
1da177e4 | 636 | { |
7b679138 | 637 | cfq_log_cfqq(cfqd, cfqq, "add_to_rr"); |
3b18152c JA |
638 | BUG_ON(cfq_cfqq_on_rr(cfqq)); |
639 | cfq_mark_cfqq_on_rr(cfqq); | |
1da177e4 | 640 | cfqd->busy_queues++; |
3a9a3f6c DS |
641 | if (cfq_class_rt(cfqq)) |
642 | cfqd->busy_rt_queues++; | |
1da177e4 | 643 | |
edd75ffd | 644 | cfq_resort_rr_list(cfqd, cfqq); |
1da177e4 LT |
645 | } |
646 | ||
498d3aa2 JA |
647 | /* |
648 | * Called when the cfqq no longer has requests pending, remove it from | |
649 | * the service tree. | |
650 | */ | |
febffd61 | 651 | static void cfq_del_cfqq_rr(struct cfq_data *cfqd, struct cfq_queue *cfqq) |
1da177e4 | 652 | { |
7b679138 | 653 | cfq_log_cfqq(cfqd, cfqq, "del_from_rr"); |
3b18152c JA |
654 | BUG_ON(!cfq_cfqq_on_rr(cfqq)); |
655 | cfq_clear_cfqq_on_rr(cfqq); | |
1da177e4 | 656 | |
cc09e299 JA |
657 | if (!RB_EMPTY_NODE(&cfqq->rb_node)) |
658 | cfq_rb_erase(&cfqq->rb_node, &cfqd->service_tree); | |
a36e71f9 JA |
659 | if (!RB_EMPTY_NODE(&cfqq->p_node)) |
660 | rb_erase_init(&cfqq->p_node, &cfqd->prio_trees[cfqq->ioprio]); | |
d9e7620e | 661 | |
1da177e4 LT |
662 | BUG_ON(!cfqd->busy_queues); |
663 | cfqd->busy_queues--; | |
3a9a3f6c DS |
664 | if (cfq_class_rt(cfqq)) |
665 | cfqd->busy_rt_queues--; | |
1da177e4 LT |
666 | } |
667 | ||
668 | /* | |
669 | * rb tree support functions | |
670 | */ | |
febffd61 | 671 | static void cfq_del_rq_rb(struct request *rq) |
1da177e4 | 672 | { |
5e705374 | 673 | struct cfq_queue *cfqq = RQ_CFQQ(rq); |
b4878f24 | 674 | struct cfq_data *cfqd = cfqq->cfqd; |
5e705374 | 675 | const int sync = rq_is_sync(rq); |
1da177e4 | 676 | |
b4878f24 JA |
677 | BUG_ON(!cfqq->queued[sync]); |
678 | cfqq->queued[sync]--; | |
1da177e4 | 679 | |
5e705374 | 680 | elv_rb_del(&cfqq->sort_list, rq); |
1da177e4 | 681 | |
dd67d051 | 682 | if (cfq_cfqq_on_rr(cfqq) && RB_EMPTY_ROOT(&cfqq->sort_list)) |
b4878f24 | 683 | cfq_del_cfqq_rr(cfqd, cfqq); |
1da177e4 LT |
684 | } |
685 | ||
5e705374 | 686 | static void cfq_add_rq_rb(struct request *rq) |
1da177e4 | 687 | { |
5e705374 | 688 | struct cfq_queue *cfqq = RQ_CFQQ(rq); |
1da177e4 | 689 | struct cfq_data *cfqd = cfqq->cfqd; |
a36e71f9 | 690 | struct request *__alias, *prev; |
1da177e4 | 691 | |
5380a101 | 692 | cfqq->queued[rq_is_sync(rq)]++; |
1da177e4 LT |
693 | |
694 | /* | |
695 | * looks a little odd, but the first insert might return an alias. | |
696 | * if that happens, put the alias on the dispatch list | |
697 | */ | |
21183b07 | 698 | while ((__alias = elv_rb_add(&cfqq->sort_list, rq)) != NULL) |
5e705374 | 699 | cfq_dispatch_insert(cfqd->queue, __alias); |
5fccbf61 JA |
700 | |
701 | if (!cfq_cfqq_on_rr(cfqq)) | |
702 | cfq_add_cfqq_rr(cfqd, cfqq); | |
5044eed4 JA |
703 | |
704 | /* | |
705 | * check if this request is a better next-serve candidate | |
706 | */ | |
a36e71f9 | 707 | prev = cfqq->next_rq; |
5044eed4 | 708 | cfqq->next_rq = cfq_choose_req(cfqd, cfqq->next_rq, rq); |
a36e71f9 JA |
709 | |
710 | /* | |
711 | * adjust priority tree position, if ->next_rq changes | |
712 | */ | |
713 | if (prev != cfqq->next_rq) | |
714 | cfq_prio_tree_add(cfqd, cfqq); | |
715 | ||
5044eed4 | 716 | BUG_ON(!cfqq->next_rq); |
1da177e4 LT |
717 | } |
718 | ||
febffd61 | 719 | static void cfq_reposition_rq_rb(struct cfq_queue *cfqq, struct request *rq) |
1da177e4 | 720 | { |
5380a101 JA |
721 | elv_rb_del(&cfqq->sort_list, rq); |
722 | cfqq->queued[rq_is_sync(rq)]--; | |
5e705374 | 723 | cfq_add_rq_rb(rq); |
1da177e4 LT |
724 | } |
725 | ||
206dc69b JA |
726 | static struct request * |
727 | cfq_find_rq_fmerge(struct cfq_data *cfqd, struct bio *bio) | |
1da177e4 | 728 | { |
206dc69b | 729 | struct task_struct *tsk = current; |
91fac317 | 730 | struct cfq_io_context *cic; |
206dc69b | 731 | struct cfq_queue *cfqq; |
1da177e4 | 732 | |
4ac845a2 | 733 | cic = cfq_cic_lookup(cfqd, tsk->io_context); |
91fac317 VT |
734 | if (!cic) |
735 | return NULL; | |
736 | ||
737 | cfqq = cic_to_cfqq(cic, cfq_bio_sync(bio)); | |
89850f7e JA |
738 | if (cfqq) { |
739 | sector_t sector = bio->bi_sector + bio_sectors(bio); | |
740 | ||
21183b07 | 741 | return elv_rb_find(&cfqq->sort_list, sector); |
89850f7e | 742 | } |
1da177e4 | 743 | |
1da177e4 LT |
744 | return NULL; |
745 | } | |
746 | ||
165125e1 | 747 | static void cfq_activate_request(struct request_queue *q, struct request *rq) |
1da177e4 | 748 | { |
22e2c507 | 749 | struct cfq_data *cfqd = q->elevator->elevator_data; |
3b18152c | 750 | |
b4878f24 | 751 | cfqd->rq_in_driver++; |
7b679138 JA |
752 | cfq_log_cfqq(cfqd, RQ_CFQQ(rq), "activate rq, drv=%d", |
753 | cfqd->rq_in_driver); | |
25776e35 | 754 | |
6d048f53 | 755 | cfqd->last_position = rq->hard_sector + rq->hard_nr_sectors; |
1da177e4 LT |
756 | } |
757 | ||
165125e1 | 758 | static void cfq_deactivate_request(struct request_queue *q, struct request *rq) |
1da177e4 | 759 | { |
b4878f24 JA |
760 | struct cfq_data *cfqd = q->elevator->elevator_data; |
761 | ||
762 | WARN_ON(!cfqd->rq_in_driver); | |
763 | cfqd->rq_in_driver--; | |
7b679138 JA |
764 | cfq_log_cfqq(cfqd, RQ_CFQQ(rq), "deactivate rq, drv=%d", |
765 | cfqd->rq_in_driver); | |
1da177e4 LT |
766 | } |
767 | ||
b4878f24 | 768 | static void cfq_remove_request(struct request *rq) |
1da177e4 | 769 | { |
5e705374 | 770 | struct cfq_queue *cfqq = RQ_CFQQ(rq); |
21183b07 | 771 | |
5e705374 JA |
772 | if (cfqq->next_rq == rq) |
773 | cfqq->next_rq = cfq_find_next_rq(cfqq->cfqd, cfqq, rq); | |
1da177e4 | 774 | |
b4878f24 | 775 | list_del_init(&rq->queuelist); |
5e705374 | 776 | cfq_del_rq_rb(rq); |
374f84ac | 777 | |
45333d5a | 778 | cfqq->cfqd->rq_queued--; |
374f84ac JA |
779 | if (rq_is_meta(rq)) { |
780 | WARN_ON(!cfqq->meta_pending); | |
781 | cfqq->meta_pending--; | |
782 | } | |
1da177e4 LT |
783 | } |
784 | ||
165125e1 JA |
785 | static int cfq_merge(struct request_queue *q, struct request **req, |
786 | struct bio *bio) | |
1da177e4 LT |
787 | { |
788 | struct cfq_data *cfqd = q->elevator->elevator_data; | |
789 | struct request *__rq; | |
1da177e4 | 790 | |
206dc69b | 791 | __rq = cfq_find_rq_fmerge(cfqd, bio); |
22e2c507 | 792 | if (__rq && elv_rq_merge_ok(__rq, bio)) { |
9817064b JA |
793 | *req = __rq; |
794 | return ELEVATOR_FRONT_MERGE; | |
1da177e4 LT |
795 | } |
796 | ||
797 | return ELEVATOR_NO_MERGE; | |
1da177e4 LT |
798 | } |
799 | ||
165125e1 | 800 | static void cfq_merged_request(struct request_queue *q, struct request *req, |
21183b07 | 801 | int type) |
1da177e4 | 802 | { |
21183b07 | 803 | if (type == ELEVATOR_FRONT_MERGE) { |
5e705374 | 804 | struct cfq_queue *cfqq = RQ_CFQQ(req); |
1da177e4 | 805 | |
5e705374 | 806 | cfq_reposition_rq_rb(cfqq, req); |
1da177e4 | 807 | } |
1da177e4 LT |
808 | } |
809 | ||
810 | static void | |
165125e1 | 811 | cfq_merged_requests(struct request_queue *q, struct request *rq, |
1da177e4 LT |
812 | struct request *next) |
813 | { | |
22e2c507 JA |
814 | /* |
815 | * reposition in fifo if next is older than rq | |
816 | */ | |
817 | if (!list_empty(&rq->queuelist) && !list_empty(&next->queuelist) && | |
818 | time_before(next->start_time, rq->start_time)) | |
819 | list_move(&rq->queuelist, &next->queuelist); | |
820 | ||
b4878f24 | 821 | cfq_remove_request(next); |
22e2c507 JA |
822 | } |
823 | ||
165125e1 | 824 | static int cfq_allow_merge(struct request_queue *q, struct request *rq, |
da775265 JA |
825 | struct bio *bio) |
826 | { | |
827 | struct cfq_data *cfqd = q->elevator->elevator_data; | |
91fac317 | 828 | struct cfq_io_context *cic; |
da775265 | 829 | struct cfq_queue *cfqq; |
da775265 JA |
830 | |
831 | /* | |
ec8acb69 | 832 | * Disallow merge of a sync bio into an async request. |
da775265 | 833 | */ |
91fac317 | 834 | if (cfq_bio_sync(bio) && !rq_is_sync(rq)) |
da775265 JA |
835 | return 0; |
836 | ||
837 | /* | |
719d3402 JA |
838 | * Lookup the cfqq that this bio will be queued with. Allow |
839 | * merge only if rq is queued there. | |
da775265 | 840 | */ |
4ac845a2 | 841 | cic = cfq_cic_lookup(cfqd, current->io_context); |
91fac317 VT |
842 | if (!cic) |
843 | return 0; | |
719d3402 | 844 | |
91fac317 | 845 | cfqq = cic_to_cfqq(cic, cfq_bio_sync(bio)); |
719d3402 JA |
846 | if (cfqq == RQ_CFQQ(rq)) |
847 | return 1; | |
da775265 | 848 | |
ec8acb69 | 849 | return 0; |
da775265 JA |
850 | } |
851 | ||
febffd61 JA |
852 | static void __cfq_set_active_queue(struct cfq_data *cfqd, |
853 | struct cfq_queue *cfqq) | |
22e2c507 JA |
854 | { |
855 | if (cfqq) { | |
7b679138 | 856 | cfq_log_cfqq(cfqd, cfqq, "set_active"); |
22e2c507 | 857 | cfqq->slice_end = 0; |
2f5cb738 JA |
858 | cfqq->slice_dispatch = 0; |
859 | ||
2f5cb738 | 860 | cfq_clear_cfqq_wait_request(cfqq); |
b029195d | 861 | cfq_clear_cfqq_must_dispatch(cfqq); |
3b18152c JA |
862 | cfq_clear_cfqq_must_alloc_slice(cfqq); |
863 | cfq_clear_cfqq_fifo_expire(cfqq); | |
44f7c160 | 864 | cfq_mark_cfqq_slice_new(cfqq); |
2f5cb738 JA |
865 | |
866 | del_timer(&cfqd->idle_slice_timer); | |
22e2c507 JA |
867 | } |
868 | ||
869 | cfqd->active_queue = cfqq; | |
870 | } | |
871 | ||
7b14e3b5 JA |
872 | /* |
873 | * current cfqq expired its slice (or was too idle), select new one | |
874 | */ | |
875 | static void | |
876 | __cfq_slice_expired(struct cfq_data *cfqd, struct cfq_queue *cfqq, | |
6084cdda | 877 | int timed_out) |
7b14e3b5 | 878 | { |
7b679138 JA |
879 | cfq_log_cfqq(cfqd, cfqq, "slice expired t=%d", timed_out); |
880 | ||
7b14e3b5 JA |
881 | if (cfq_cfqq_wait_request(cfqq)) |
882 | del_timer(&cfqd->idle_slice_timer); | |
883 | ||
7b14e3b5 JA |
884 | cfq_clear_cfqq_wait_request(cfqq); |
885 | ||
886 | /* | |
6084cdda | 887 | * store what was left of this slice, if the queue idled/timed out |
7b14e3b5 | 888 | */ |
7b679138 | 889 | if (timed_out && !cfq_cfqq_slice_new(cfqq)) { |
c5b680f3 | 890 | cfqq->slice_resid = cfqq->slice_end - jiffies; |
7b679138 JA |
891 | cfq_log_cfqq(cfqd, cfqq, "resid=%ld", cfqq->slice_resid); |
892 | } | |
7b14e3b5 | 893 | |
edd75ffd | 894 | cfq_resort_rr_list(cfqd, cfqq); |
7b14e3b5 JA |
895 | |
896 | if (cfqq == cfqd->active_queue) | |
897 | cfqd->active_queue = NULL; | |
898 | ||
899 | if (cfqd->active_cic) { | |
900 | put_io_context(cfqd->active_cic->ioc); | |
901 | cfqd->active_cic = NULL; | |
902 | } | |
7b14e3b5 JA |
903 | } |
904 | ||
6084cdda | 905 | static inline void cfq_slice_expired(struct cfq_data *cfqd, int timed_out) |
7b14e3b5 JA |
906 | { |
907 | struct cfq_queue *cfqq = cfqd->active_queue; | |
908 | ||
909 | if (cfqq) | |
6084cdda | 910 | __cfq_slice_expired(cfqd, cfqq, timed_out); |
7b14e3b5 JA |
911 | } |
912 | ||
498d3aa2 JA |
913 | /* |
914 | * Get next queue for service. Unless we have a queue preemption, | |
915 | * we'll simply select the first cfqq in the service tree. | |
916 | */ | |
6d048f53 | 917 | static struct cfq_queue *cfq_get_next_queue(struct cfq_data *cfqd) |
22e2c507 | 918 | { |
edd75ffd JA |
919 | if (RB_EMPTY_ROOT(&cfqd->service_tree.rb)) |
920 | return NULL; | |
d9e7620e | 921 | |
0871714e | 922 | return cfq_rb_first(&cfqd->service_tree); |
6d048f53 JA |
923 | } |
924 | ||
498d3aa2 JA |
925 | /* |
926 | * Get and set a new active queue for service. | |
927 | */ | |
a36e71f9 JA |
928 | static struct cfq_queue *cfq_set_active_queue(struct cfq_data *cfqd, |
929 | struct cfq_queue *cfqq) | |
6d048f53 | 930 | { |
a36e71f9 JA |
931 | if (!cfqq) { |
932 | cfqq = cfq_get_next_queue(cfqd); | |
933 | if (cfqq) | |
934 | cfq_clear_cfqq_coop(cfqq); | |
935 | } | |
6d048f53 | 936 | |
22e2c507 | 937 | __cfq_set_active_queue(cfqd, cfqq); |
3b18152c | 938 | return cfqq; |
22e2c507 JA |
939 | } |
940 | ||
d9e7620e JA |
941 | static inline sector_t cfq_dist_from_last(struct cfq_data *cfqd, |
942 | struct request *rq) | |
943 | { | |
944 | if (rq->sector >= cfqd->last_position) | |
945 | return rq->sector - cfqd->last_position; | |
946 | else | |
947 | return cfqd->last_position - rq->sector; | |
948 | } | |
949 | ||
04dc6e71 JM |
950 | #define CIC_SEEK_THR 8 * 1024 |
951 | #define CIC_SEEKY(cic) ((cic)->seek_mean > CIC_SEEK_THR) | |
952 | ||
6d048f53 JA |
953 | static inline int cfq_rq_close(struct cfq_data *cfqd, struct request *rq) |
954 | { | |
955 | struct cfq_io_context *cic = cfqd->active_cic; | |
04dc6e71 | 956 | sector_t sdist = cic->seek_mean; |
6d048f53 JA |
957 | |
958 | if (!sample_valid(cic->seek_samples)) | |
04dc6e71 | 959 | sdist = CIC_SEEK_THR; |
6d048f53 | 960 | |
04dc6e71 | 961 | return cfq_dist_from_last(cfqd, rq) <= sdist; |
6d048f53 JA |
962 | } |
963 | ||
a36e71f9 JA |
964 | static struct cfq_queue *cfqq_close(struct cfq_data *cfqd, |
965 | struct cfq_queue *cur_cfqq) | |
966 | { | |
967 | struct rb_root *root = &cfqd->prio_trees[cur_cfqq->ioprio]; | |
968 | struct rb_node *parent, *node; | |
969 | struct cfq_queue *__cfqq; | |
970 | sector_t sector = cfqd->last_position; | |
971 | ||
972 | if (RB_EMPTY_ROOT(root)) | |
973 | return NULL; | |
974 | ||
975 | /* | |
976 | * First, if we find a request starting at the end of the last | |
977 | * request, choose it. | |
978 | */ | |
979 | __cfqq = cfq_prio_tree_lookup(cfqd, cur_cfqq->ioprio, | |
980 | sector, &parent, NULL); | |
981 | if (__cfqq) | |
982 | return __cfqq; | |
983 | ||
984 | /* | |
985 | * If the exact sector wasn't found, the parent of the NULL leaf | |
986 | * will contain the closest sector. | |
987 | */ | |
988 | __cfqq = rb_entry(parent, struct cfq_queue, p_node); | |
989 | if (cfq_rq_close(cfqd, __cfqq->next_rq)) | |
990 | return __cfqq; | |
991 | ||
992 | if (__cfqq->next_rq->sector < sector) | |
993 | node = rb_next(&__cfqq->p_node); | |
994 | else | |
995 | node = rb_prev(&__cfqq->p_node); | |
996 | if (!node) | |
997 | return NULL; | |
998 | ||
999 | __cfqq = rb_entry(node, struct cfq_queue, p_node); | |
1000 | if (cfq_rq_close(cfqd, __cfqq->next_rq)) | |
1001 | return __cfqq; | |
1002 | ||
1003 | return NULL; | |
1004 | } | |
1005 | ||
1006 | /* | |
1007 | * cfqd - obvious | |
1008 | * cur_cfqq - passed in so that we don't decide that the current queue is | |
1009 | * closely cooperating with itself. | |
1010 | * | |
1011 | * So, basically we're assuming that that cur_cfqq has dispatched at least | |
1012 | * one request, and that cfqd->last_position reflects a position on the disk | |
1013 | * associated with the I/O issued by cur_cfqq. I'm not sure this is a valid | |
1014 | * assumption. | |
1015 | */ | |
1016 | static struct cfq_queue *cfq_close_cooperator(struct cfq_data *cfqd, | |
1017 | struct cfq_queue *cur_cfqq, | |
1018 | int probe) | |
6d048f53 | 1019 | { |
a36e71f9 JA |
1020 | struct cfq_queue *cfqq; |
1021 | ||
1022 | /* | |
1023 | * A valid cfq_io_context is necessary to compare requests against | |
1024 | * the seek_mean of the current cfqq. | |
1025 | */ | |
1026 | if (!cfqd->active_cic) | |
1027 | return NULL; | |
1028 | ||
6d048f53 | 1029 | /* |
d9e7620e JA |
1030 | * We should notice if some of the queues are cooperating, eg |
1031 | * working closely on the same area of the disk. In that case, | |
1032 | * we can group them together and don't waste time idling. | |
6d048f53 | 1033 | */ |
a36e71f9 JA |
1034 | cfqq = cfqq_close(cfqd, cur_cfqq); |
1035 | if (!cfqq) | |
1036 | return NULL; | |
1037 | ||
1038 | if (cfq_cfqq_coop(cfqq)) | |
1039 | return NULL; | |
1040 | ||
1041 | if (!probe) | |
1042 | cfq_mark_cfqq_coop(cfqq); | |
1043 | return cfqq; | |
6d048f53 JA |
1044 | } |
1045 | ||
6d048f53 | 1046 | static void cfq_arm_slice_timer(struct cfq_data *cfqd) |
22e2c507 | 1047 | { |
1792669c | 1048 | struct cfq_queue *cfqq = cfqd->active_queue; |
206dc69b | 1049 | struct cfq_io_context *cic; |
7b14e3b5 JA |
1050 | unsigned long sl; |
1051 | ||
a68bbddb | 1052 | /* |
f7d7b7a7 JA |
1053 | * SSD device without seek penalty, disable idling. But only do so |
1054 | * for devices that support queuing, otherwise we still have a problem | |
1055 | * with sync vs async workloads. | |
a68bbddb | 1056 | */ |
f7d7b7a7 | 1057 | if (blk_queue_nonrot(cfqd->queue) && cfqd->hw_tag) |
a68bbddb JA |
1058 | return; |
1059 | ||
dd67d051 | 1060 | WARN_ON(!RB_EMPTY_ROOT(&cfqq->sort_list)); |
6d048f53 | 1061 | WARN_ON(cfq_cfqq_slice_new(cfqq)); |
22e2c507 JA |
1062 | |
1063 | /* | |
1064 | * idle is disabled, either manually or by past process history | |
1065 | */ | |
6d048f53 JA |
1066 | if (!cfqd->cfq_slice_idle || !cfq_cfqq_idle_window(cfqq)) |
1067 | return; | |
1068 | ||
7b679138 JA |
1069 | /* |
1070 | * still requests with the driver, don't idle | |
1071 | */ | |
1072 | if (cfqd->rq_in_driver) | |
1073 | return; | |
1074 | ||
22e2c507 JA |
1075 | /* |
1076 | * task has exited, don't wait | |
1077 | */ | |
206dc69b | 1078 | cic = cfqd->active_cic; |
66dac98e | 1079 | if (!cic || !atomic_read(&cic->ioc->nr_tasks)) |
6d048f53 JA |
1080 | return; |
1081 | ||
3b18152c | 1082 | cfq_mark_cfqq_wait_request(cfqq); |
22e2c507 | 1083 | |
206dc69b JA |
1084 | /* |
1085 | * we don't want to idle for seeks, but we do want to allow | |
1086 | * fair distribution of slice time for a process doing back-to-back | |
1087 | * seeks. so allow a little bit of time for him to submit a new rq | |
1088 | */ | |
6d048f53 | 1089 | sl = cfqd->cfq_slice_idle; |
caaa5f9f | 1090 | if (sample_valid(cic->seek_samples) && CIC_SEEKY(cic)) |
d9e7620e | 1091 | sl = min(sl, msecs_to_jiffies(CFQ_MIN_TT)); |
206dc69b | 1092 | |
7b14e3b5 | 1093 | mod_timer(&cfqd->idle_slice_timer, jiffies + sl); |
9481ffdc | 1094 | cfq_log_cfqq(cfqd, cfqq, "arm_idle: %lu", sl); |
1da177e4 LT |
1095 | } |
1096 | ||
498d3aa2 JA |
1097 | /* |
1098 | * Move request from internal lists to the request queue dispatch list. | |
1099 | */ | |
165125e1 | 1100 | static void cfq_dispatch_insert(struct request_queue *q, struct request *rq) |
1da177e4 | 1101 | { |
3ed9a296 | 1102 | struct cfq_data *cfqd = q->elevator->elevator_data; |
5e705374 | 1103 | struct cfq_queue *cfqq = RQ_CFQQ(rq); |
22e2c507 | 1104 | |
7b679138 JA |
1105 | cfq_log_cfqq(cfqd, cfqq, "dispatch_insert"); |
1106 | ||
5380a101 | 1107 | cfq_remove_request(rq); |
6d048f53 | 1108 | cfqq->dispatched++; |
5380a101 | 1109 | elv_dispatch_sort(q, rq); |
3ed9a296 JA |
1110 | |
1111 | if (cfq_cfqq_sync(cfqq)) | |
1112 | cfqd->sync_flight++; | |
1da177e4 LT |
1113 | } |
1114 | ||
1115 | /* | |
1116 | * return expired entry, or NULL to just start from scratch in rbtree | |
1117 | */ | |
febffd61 | 1118 | static struct request *cfq_check_fifo(struct cfq_queue *cfqq) |
1da177e4 LT |
1119 | { |
1120 | struct cfq_data *cfqd = cfqq->cfqd; | |
22e2c507 | 1121 | struct request *rq; |
89850f7e | 1122 | int fifo; |
1da177e4 | 1123 | |
3b18152c | 1124 | if (cfq_cfqq_fifo_expire(cfqq)) |
1da177e4 | 1125 | return NULL; |
cb887411 JA |
1126 | |
1127 | cfq_mark_cfqq_fifo_expire(cfqq); | |
1128 | ||
89850f7e JA |
1129 | if (list_empty(&cfqq->fifo)) |
1130 | return NULL; | |
1da177e4 | 1131 | |
6d048f53 | 1132 | fifo = cfq_cfqq_sync(cfqq); |
89850f7e | 1133 | rq = rq_entry_fifo(cfqq->fifo.next); |
1da177e4 | 1134 | |
6d048f53 | 1135 | if (time_before(jiffies, rq->start_time + cfqd->cfq_fifo_expire[fifo])) |
7b679138 | 1136 | rq = NULL; |
1da177e4 | 1137 | |
7b679138 | 1138 | cfq_log_cfqq(cfqd, cfqq, "fifo=%p", rq); |
6d048f53 | 1139 | return rq; |
1da177e4 LT |
1140 | } |
1141 | ||
22e2c507 JA |
1142 | static inline int |
1143 | cfq_prio_to_maxrq(struct cfq_data *cfqd, struct cfq_queue *cfqq) | |
1144 | { | |
1145 | const int base_rq = cfqd->cfq_slice_async_rq; | |
1da177e4 | 1146 | |
22e2c507 | 1147 | WARN_ON(cfqq->ioprio >= IOPRIO_BE_NR); |
1da177e4 | 1148 | |
22e2c507 | 1149 | return 2 * (base_rq + base_rq * (CFQ_PRIO_LISTS - 1 - cfqq->ioprio)); |
1da177e4 LT |
1150 | } |
1151 | ||
22e2c507 | 1152 | /* |
498d3aa2 JA |
1153 | * Select a queue for service. If we have a current active queue, |
1154 | * check whether to continue servicing it, or retrieve and set a new one. | |
22e2c507 | 1155 | */ |
1b5ed5e1 | 1156 | static struct cfq_queue *cfq_select_queue(struct cfq_data *cfqd) |
1da177e4 | 1157 | { |
a36e71f9 | 1158 | struct cfq_queue *cfqq, *new_cfqq = NULL; |
1da177e4 | 1159 | |
22e2c507 JA |
1160 | cfqq = cfqd->active_queue; |
1161 | if (!cfqq) | |
1162 | goto new_queue; | |
1da177e4 | 1163 | |
22e2c507 | 1164 | /* |
6d048f53 | 1165 | * The active queue has run out of time, expire it and select new. |
22e2c507 | 1166 | */ |
b029195d | 1167 | if (cfq_slice_used(cfqq) && !cfq_cfqq_must_dispatch(cfqq)) |
3b18152c | 1168 | goto expire; |
1da177e4 | 1169 | |
3a9a3f6c DS |
1170 | /* |
1171 | * If we have a RT cfqq waiting, then we pre-empt the current non-rt | |
1172 | * cfqq. | |
1173 | */ | |
1174 | if (!cfq_class_rt(cfqq) && cfqd->busy_rt_queues) { | |
1175 | /* | |
1176 | * We simulate this as cfqq timed out so that it gets to bank | |
1177 | * the remaining of its time slice. | |
1178 | */ | |
1179 | cfq_log_cfqq(cfqd, cfqq, "preempt"); | |
1180 | cfq_slice_expired(cfqd, 1); | |
1181 | goto new_queue; | |
1182 | } | |
1183 | ||
22e2c507 | 1184 | /* |
6d048f53 JA |
1185 | * The active queue has requests and isn't expired, allow it to |
1186 | * dispatch. | |
22e2c507 | 1187 | */ |
dd67d051 | 1188 | if (!RB_EMPTY_ROOT(&cfqq->sort_list)) |
22e2c507 | 1189 | goto keep_queue; |
6d048f53 | 1190 | |
a36e71f9 JA |
1191 | /* |
1192 | * If another queue has a request waiting within our mean seek | |
1193 | * distance, let it run. The expire code will check for close | |
1194 | * cooperators and put the close queue at the front of the service | |
1195 | * tree. | |
1196 | */ | |
1197 | new_cfqq = cfq_close_cooperator(cfqd, cfqq, 0); | |
1198 | if (new_cfqq) | |
1199 | goto expire; | |
1200 | ||
6d048f53 JA |
1201 | /* |
1202 | * No requests pending. If the active queue still has requests in | |
1203 | * flight or is idling for a new request, allow either of these | |
1204 | * conditions to happen (or time out) before selecting a new queue. | |
1205 | */ | |
cc197479 JA |
1206 | if (timer_pending(&cfqd->idle_slice_timer) || |
1207 | (cfqq->dispatched && cfq_cfqq_idle_window(cfqq))) { | |
caaa5f9f JA |
1208 | cfqq = NULL; |
1209 | goto keep_queue; | |
22e2c507 JA |
1210 | } |
1211 | ||
3b18152c | 1212 | expire: |
6084cdda | 1213 | cfq_slice_expired(cfqd, 0); |
3b18152c | 1214 | new_queue: |
a36e71f9 | 1215 | cfqq = cfq_set_active_queue(cfqd, new_cfqq); |
22e2c507 | 1216 | keep_queue: |
3b18152c | 1217 | return cfqq; |
22e2c507 JA |
1218 | } |
1219 | ||
febffd61 | 1220 | static int __cfq_forced_dispatch_cfqq(struct cfq_queue *cfqq) |
d9e7620e JA |
1221 | { |
1222 | int dispatched = 0; | |
1223 | ||
1224 | while (cfqq->next_rq) { | |
1225 | cfq_dispatch_insert(cfqq->cfqd->queue, cfqq->next_rq); | |
1226 | dispatched++; | |
1227 | } | |
1228 | ||
1229 | BUG_ON(!list_empty(&cfqq->fifo)); | |
1230 | return dispatched; | |
1231 | } | |
1232 | ||
498d3aa2 JA |
1233 | /* |
1234 | * Drain our current requests. Used for barriers and when switching | |
1235 | * io schedulers on-the-fly. | |
1236 | */ | |
d9e7620e | 1237 | static int cfq_forced_dispatch(struct cfq_data *cfqd) |
1b5ed5e1 | 1238 | { |
0871714e | 1239 | struct cfq_queue *cfqq; |
d9e7620e | 1240 | int dispatched = 0; |
1b5ed5e1 | 1241 | |
0871714e | 1242 | while ((cfqq = cfq_rb_first(&cfqd->service_tree)) != NULL) |
d9e7620e | 1243 | dispatched += __cfq_forced_dispatch_cfqq(cfqq); |
1b5ed5e1 | 1244 | |
6084cdda | 1245 | cfq_slice_expired(cfqd, 0); |
1b5ed5e1 TH |
1246 | |
1247 | BUG_ON(cfqd->busy_queues); | |
1248 | ||
7b679138 | 1249 | cfq_log(cfqd, "forced_dispatch=%d\n", dispatched); |
1b5ed5e1 TH |
1250 | return dispatched; |
1251 | } | |
1252 | ||
2f5cb738 JA |
1253 | /* |
1254 | * Dispatch a request from cfqq, moving them to the request queue | |
1255 | * dispatch list. | |
1256 | */ | |
1257 | static void cfq_dispatch_request(struct cfq_data *cfqd, struct cfq_queue *cfqq) | |
1258 | { | |
1259 | struct request *rq; | |
1260 | ||
1261 | BUG_ON(RB_EMPTY_ROOT(&cfqq->sort_list)); | |
1262 | ||
1263 | /* | |
1264 | * follow expired path, else get first next available | |
1265 | */ | |
1266 | rq = cfq_check_fifo(cfqq); | |
1267 | if (!rq) | |
1268 | rq = cfqq->next_rq; | |
1269 | ||
1270 | /* | |
1271 | * insert request into driver dispatch list | |
1272 | */ | |
1273 | cfq_dispatch_insert(cfqd->queue, rq); | |
1274 | ||
1275 | if (!cfqd->active_cic) { | |
1276 | struct cfq_io_context *cic = RQ_CIC(rq); | |
1277 | ||
1278 | atomic_inc(&cic->ioc->refcount); | |
1279 | cfqd->active_cic = cic; | |
1280 | } | |
1281 | } | |
1282 | ||
1283 | /* | |
1284 | * Find the cfqq that we need to service and move a request from that to the | |
1285 | * dispatch list | |
1286 | */ | |
165125e1 | 1287 | static int cfq_dispatch_requests(struct request_queue *q, int force) |
22e2c507 JA |
1288 | { |
1289 | struct cfq_data *cfqd = q->elevator->elevator_data; | |
6d048f53 | 1290 | struct cfq_queue *cfqq; |
2f5cb738 | 1291 | unsigned int max_dispatch; |
22e2c507 JA |
1292 | |
1293 | if (!cfqd->busy_queues) | |
1294 | return 0; | |
1295 | ||
1b5ed5e1 TH |
1296 | if (unlikely(force)) |
1297 | return cfq_forced_dispatch(cfqd); | |
1298 | ||
2f5cb738 JA |
1299 | cfqq = cfq_select_queue(cfqd); |
1300 | if (!cfqq) | |
1301 | return 0; | |
1302 | ||
1303 | /* | |
1304 | * If this is an async queue and we have sync IO in flight, let it wait | |
1305 | */ | |
1306 | if (cfqd->sync_flight && !cfq_cfqq_sync(cfqq)) | |
1307 | return 0; | |
1308 | ||
1309 | max_dispatch = cfqd->cfq_quantum; | |
1310 | if (cfq_class_idle(cfqq)) | |
1311 | max_dispatch = 1; | |
b4878f24 | 1312 | |
2f5cb738 JA |
1313 | /* |
1314 | * Does this cfqq already have too much IO in flight? | |
1315 | */ | |
1316 | if (cfqq->dispatched >= max_dispatch) { | |
1317 | /* | |
1318 | * idle queue must always only have a single IO in flight | |
1319 | */ | |
3ed9a296 | 1320 | if (cfq_class_idle(cfqq)) |
2f5cb738 | 1321 | return 0; |
3ed9a296 | 1322 | |
2f5cb738 JA |
1323 | /* |
1324 | * We have other queues, don't allow more IO from this one | |
1325 | */ | |
1326 | if (cfqd->busy_queues > 1) | |
1327 | return 0; | |
9ede209e | 1328 | |
2f5cb738 JA |
1329 | /* |
1330 | * we are the only queue, allow up to 4 times of 'quantum' | |
1331 | */ | |
1332 | if (cfqq->dispatched >= 4 * max_dispatch) | |
1333 | return 0; | |
1334 | } | |
3ed9a296 | 1335 | |
2f5cb738 JA |
1336 | /* |
1337 | * Dispatch a request from this cfqq | |
1338 | */ | |
1339 | cfq_dispatch_request(cfqd, cfqq); | |
1340 | cfqq->slice_dispatch++; | |
b029195d | 1341 | cfq_clear_cfqq_must_dispatch(cfqq); |
22e2c507 | 1342 | |
2f5cb738 JA |
1343 | /* |
1344 | * expire an async queue immediately if it has used up its slice. idle | |
1345 | * queue always expire after 1 dispatch round. | |
1346 | */ | |
1347 | if (cfqd->busy_queues > 1 && ((!cfq_cfqq_sync(cfqq) && | |
1348 | cfqq->slice_dispatch >= cfq_prio_to_maxrq(cfqd, cfqq)) || | |
1349 | cfq_class_idle(cfqq))) { | |
1350 | cfqq->slice_end = jiffies + 1; | |
1351 | cfq_slice_expired(cfqd, 0); | |
1da177e4 LT |
1352 | } |
1353 | ||
2f5cb738 JA |
1354 | cfq_log(cfqd, "dispatched a request"); |
1355 | return 1; | |
1da177e4 LT |
1356 | } |
1357 | ||
1da177e4 | 1358 | /* |
5e705374 JA |
1359 | * task holds one reference to the queue, dropped when task exits. each rq |
1360 | * in-flight on this queue also holds a reference, dropped when rq is freed. | |
1da177e4 LT |
1361 | * |
1362 | * queue lock must be held here. | |
1363 | */ | |
1364 | static void cfq_put_queue(struct cfq_queue *cfqq) | |
1365 | { | |
22e2c507 JA |
1366 | struct cfq_data *cfqd = cfqq->cfqd; |
1367 | ||
1368 | BUG_ON(atomic_read(&cfqq->ref) <= 0); | |
1da177e4 LT |
1369 | |
1370 | if (!atomic_dec_and_test(&cfqq->ref)) | |
1371 | return; | |
1372 | ||
7b679138 | 1373 | cfq_log_cfqq(cfqd, cfqq, "put_queue"); |
1da177e4 | 1374 | BUG_ON(rb_first(&cfqq->sort_list)); |
22e2c507 | 1375 | BUG_ON(cfqq->allocated[READ] + cfqq->allocated[WRITE]); |
3b18152c | 1376 | BUG_ON(cfq_cfqq_on_rr(cfqq)); |
1da177e4 | 1377 | |
28f95cbc | 1378 | if (unlikely(cfqd->active_queue == cfqq)) { |
6084cdda | 1379 | __cfq_slice_expired(cfqd, cfqq, 0); |
28f95cbc JA |
1380 | cfq_schedule_dispatch(cfqd); |
1381 | } | |
22e2c507 | 1382 | |
1da177e4 LT |
1383 | kmem_cache_free(cfq_pool, cfqq); |
1384 | } | |
1385 | ||
d6de8be7 JA |
1386 | /* |
1387 | * Must always be called with the rcu_read_lock() held | |
1388 | */ | |
07416d29 JA |
1389 | static void |
1390 | __call_for_each_cic(struct io_context *ioc, | |
1391 | void (*func)(struct io_context *, struct cfq_io_context *)) | |
1392 | { | |
1393 | struct cfq_io_context *cic; | |
1394 | struct hlist_node *n; | |
1395 | ||
1396 | hlist_for_each_entry_rcu(cic, n, &ioc->cic_list, cic_list) | |
1397 | func(ioc, cic); | |
1398 | } | |
1399 | ||
4ac845a2 | 1400 | /* |
34e6bbf2 | 1401 | * Call func for each cic attached to this ioc. |
4ac845a2 | 1402 | */ |
34e6bbf2 | 1403 | static void |
4ac845a2 JA |
1404 | call_for_each_cic(struct io_context *ioc, |
1405 | void (*func)(struct io_context *, struct cfq_io_context *)) | |
1da177e4 | 1406 | { |
4ac845a2 | 1407 | rcu_read_lock(); |
07416d29 | 1408 | __call_for_each_cic(ioc, func); |
4ac845a2 | 1409 | rcu_read_unlock(); |
34e6bbf2 FC |
1410 | } |
1411 | ||
1412 | static void cfq_cic_free_rcu(struct rcu_head *head) | |
1413 | { | |
1414 | struct cfq_io_context *cic; | |
1415 | ||
1416 | cic = container_of(head, struct cfq_io_context, rcu_head); | |
1417 | ||
1418 | kmem_cache_free(cfq_ioc_pool, cic); | |
1419 | elv_ioc_count_dec(ioc_count); | |
1420 | ||
9a11b4ed JA |
1421 | if (ioc_gone) { |
1422 | /* | |
1423 | * CFQ scheduler is exiting, grab exit lock and check | |
1424 | * the pending io context count. If it hits zero, | |
1425 | * complete ioc_gone and set it back to NULL | |
1426 | */ | |
1427 | spin_lock(&ioc_gone_lock); | |
1428 | if (ioc_gone && !elv_ioc_count_read(ioc_count)) { | |
1429 | complete(ioc_gone); | |
1430 | ioc_gone = NULL; | |
1431 | } | |
1432 | spin_unlock(&ioc_gone_lock); | |
1433 | } | |
34e6bbf2 | 1434 | } |
4ac845a2 | 1435 | |
34e6bbf2 FC |
1436 | static void cfq_cic_free(struct cfq_io_context *cic) |
1437 | { | |
1438 | call_rcu(&cic->rcu_head, cfq_cic_free_rcu); | |
4ac845a2 JA |
1439 | } |
1440 | ||
1441 | static void cic_free_func(struct io_context *ioc, struct cfq_io_context *cic) | |
1442 | { | |
1443 | unsigned long flags; | |
1444 | ||
1445 | BUG_ON(!cic->dead_key); | |
1446 | ||
1447 | spin_lock_irqsave(&ioc->lock, flags); | |
1448 | radix_tree_delete(&ioc->radix_root, cic->dead_key); | |
ffc4e759 | 1449 | hlist_del_rcu(&cic->cic_list); |
4ac845a2 JA |
1450 | spin_unlock_irqrestore(&ioc->lock, flags); |
1451 | ||
34e6bbf2 | 1452 | cfq_cic_free(cic); |
4ac845a2 JA |
1453 | } |
1454 | ||
d6de8be7 JA |
1455 | /* |
1456 | * Must be called with rcu_read_lock() held or preemption otherwise disabled. | |
1457 | * Only two callers of this - ->dtor() which is called with the rcu_read_lock(), | |
1458 | * and ->trim() which is called with the task lock held | |
1459 | */ | |
4ac845a2 JA |
1460 | static void cfq_free_io_context(struct io_context *ioc) |
1461 | { | |
4ac845a2 | 1462 | /* |
34e6bbf2 FC |
1463 | * ioc->refcount is zero here, or we are called from elv_unregister(), |
1464 | * so no more cic's are allowed to be linked into this ioc. So it | |
1465 | * should be ok to iterate over the known list, we will see all cic's | |
1466 | * since no new ones are added. | |
4ac845a2 | 1467 | */ |
07416d29 | 1468 | __call_for_each_cic(ioc, cic_free_func); |
1da177e4 LT |
1469 | } |
1470 | ||
89850f7e | 1471 | static void cfq_exit_cfqq(struct cfq_data *cfqd, struct cfq_queue *cfqq) |
1da177e4 | 1472 | { |
28f95cbc | 1473 | if (unlikely(cfqq == cfqd->active_queue)) { |
6084cdda | 1474 | __cfq_slice_expired(cfqd, cfqq, 0); |
28f95cbc JA |
1475 | cfq_schedule_dispatch(cfqd); |
1476 | } | |
22e2c507 | 1477 | |
89850f7e JA |
1478 | cfq_put_queue(cfqq); |
1479 | } | |
22e2c507 | 1480 | |
89850f7e JA |
1481 | static void __cfq_exit_single_io_context(struct cfq_data *cfqd, |
1482 | struct cfq_io_context *cic) | |
1483 | { | |
4faa3c81 FC |
1484 | struct io_context *ioc = cic->ioc; |
1485 | ||
fc46379d | 1486 | list_del_init(&cic->queue_list); |
4ac845a2 JA |
1487 | |
1488 | /* | |
1489 | * Make sure key == NULL is seen for dead queues | |
1490 | */ | |
fc46379d | 1491 | smp_wmb(); |
4ac845a2 | 1492 | cic->dead_key = (unsigned long) cic->key; |
fc46379d JA |
1493 | cic->key = NULL; |
1494 | ||
4faa3c81 FC |
1495 | if (ioc->ioc_data == cic) |
1496 | rcu_assign_pointer(ioc->ioc_data, NULL); | |
1497 | ||
ff6657c6 JA |
1498 | if (cic->cfqq[BLK_RW_ASYNC]) { |
1499 | cfq_exit_cfqq(cfqd, cic->cfqq[BLK_RW_ASYNC]); | |
1500 | cic->cfqq[BLK_RW_ASYNC] = NULL; | |
12a05732 AV |
1501 | } |
1502 | ||
ff6657c6 JA |
1503 | if (cic->cfqq[BLK_RW_SYNC]) { |
1504 | cfq_exit_cfqq(cfqd, cic->cfqq[BLK_RW_SYNC]); | |
1505 | cic->cfqq[BLK_RW_SYNC] = NULL; | |
12a05732 | 1506 | } |
89850f7e JA |
1507 | } |
1508 | ||
4ac845a2 JA |
1509 | static void cfq_exit_single_io_context(struct io_context *ioc, |
1510 | struct cfq_io_context *cic) | |
89850f7e JA |
1511 | { |
1512 | struct cfq_data *cfqd = cic->key; | |
1513 | ||
89850f7e | 1514 | if (cfqd) { |
165125e1 | 1515 | struct request_queue *q = cfqd->queue; |
4ac845a2 | 1516 | unsigned long flags; |
89850f7e | 1517 | |
4ac845a2 | 1518 | spin_lock_irqsave(q->queue_lock, flags); |
62c1fe9d JA |
1519 | |
1520 | /* | |
1521 | * Ensure we get a fresh copy of the ->key to prevent | |
1522 | * race between exiting task and queue | |
1523 | */ | |
1524 | smp_read_barrier_depends(); | |
1525 | if (cic->key) | |
1526 | __cfq_exit_single_io_context(cfqd, cic); | |
1527 | ||
4ac845a2 | 1528 | spin_unlock_irqrestore(q->queue_lock, flags); |
89850f7e | 1529 | } |
1da177e4 LT |
1530 | } |
1531 | ||
498d3aa2 JA |
1532 | /* |
1533 | * The process that ioc belongs to has exited, we need to clean up | |
1534 | * and put the internal structures we have that belongs to that process. | |
1535 | */ | |
e2d74ac0 | 1536 | static void cfq_exit_io_context(struct io_context *ioc) |
1da177e4 | 1537 | { |
4ac845a2 | 1538 | call_for_each_cic(ioc, cfq_exit_single_io_context); |
1da177e4 LT |
1539 | } |
1540 | ||
22e2c507 | 1541 | static struct cfq_io_context * |
8267e268 | 1542 | cfq_alloc_io_context(struct cfq_data *cfqd, gfp_t gfp_mask) |
1da177e4 | 1543 | { |
b5deef90 | 1544 | struct cfq_io_context *cic; |
1da177e4 | 1545 | |
94f6030c CL |
1546 | cic = kmem_cache_alloc_node(cfq_ioc_pool, gfp_mask | __GFP_ZERO, |
1547 | cfqd->queue->node); | |
1da177e4 | 1548 | if (cic) { |
22e2c507 | 1549 | cic->last_end_request = jiffies; |
553698f9 | 1550 | INIT_LIST_HEAD(&cic->queue_list); |
ffc4e759 | 1551 | INIT_HLIST_NODE(&cic->cic_list); |
22e2c507 JA |
1552 | cic->dtor = cfq_free_io_context; |
1553 | cic->exit = cfq_exit_io_context; | |
4050cf16 | 1554 | elv_ioc_count_inc(ioc_count); |
1da177e4 LT |
1555 | } |
1556 | ||
1557 | return cic; | |
1558 | } | |
1559 | ||
fd0928df | 1560 | static void cfq_init_prio_data(struct cfq_queue *cfqq, struct io_context *ioc) |
22e2c507 JA |
1561 | { |
1562 | struct task_struct *tsk = current; | |
1563 | int ioprio_class; | |
1564 | ||
3b18152c | 1565 | if (!cfq_cfqq_prio_changed(cfqq)) |
22e2c507 JA |
1566 | return; |
1567 | ||
fd0928df | 1568 | ioprio_class = IOPRIO_PRIO_CLASS(ioc->ioprio); |
22e2c507 | 1569 | switch (ioprio_class) { |
fe094d98 JA |
1570 | default: |
1571 | printk(KERN_ERR "cfq: bad prio %x\n", ioprio_class); | |
1572 | case IOPRIO_CLASS_NONE: | |
1573 | /* | |
6d63c275 | 1574 | * no prio set, inherit CPU scheduling settings |
fe094d98 JA |
1575 | */ |
1576 | cfqq->ioprio = task_nice_ioprio(tsk); | |
6d63c275 | 1577 | cfqq->ioprio_class = task_nice_ioclass(tsk); |
fe094d98 JA |
1578 | break; |
1579 | case IOPRIO_CLASS_RT: | |
1580 | cfqq->ioprio = task_ioprio(ioc); | |
1581 | cfqq->ioprio_class = IOPRIO_CLASS_RT; | |
1582 | break; | |
1583 | case IOPRIO_CLASS_BE: | |
1584 | cfqq->ioprio = task_ioprio(ioc); | |
1585 | cfqq->ioprio_class = IOPRIO_CLASS_BE; | |
1586 | break; | |
1587 | case IOPRIO_CLASS_IDLE: | |
1588 | cfqq->ioprio_class = IOPRIO_CLASS_IDLE; | |
1589 | cfqq->ioprio = 7; | |
1590 | cfq_clear_cfqq_idle_window(cfqq); | |
1591 | break; | |
22e2c507 JA |
1592 | } |
1593 | ||
1594 | /* | |
1595 | * keep track of original prio settings in case we have to temporarily | |
1596 | * elevate the priority of this queue | |
1597 | */ | |
1598 | cfqq->org_ioprio = cfqq->ioprio; | |
1599 | cfqq->org_ioprio_class = cfqq->ioprio_class; | |
3b18152c | 1600 | cfq_clear_cfqq_prio_changed(cfqq); |
22e2c507 JA |
1601 | } |
1602 | ||
febffd61 | 1603 | static void changed_ioprio(struct io_context *ioc, struct cfq_io_context *cic) |
22e2c507 | 1604 | { |
478a82b0 AV |
1605 | struct cfq_data *cfqd = cic->key; |
1606 | struct cfq_queue *cfqq; | |
c1b707d2 | 1607 | unsigned long flags; |
35e6077c | 1608 | |
caaa5f9f JA |
1609 | if (unlikely(!cfqd)) |
1610 | return; | |
1611 | ||
c1b707d2 | 1612 | spin_lock_irqsave(cfqd->queue->queue_lock, flags); |
caaa5f9f | 1613 | |
ff6657c6 | 1614 | cfqq = cic->cfqq[BLK_RW_ASYNC]; |
caaa5f9f JA |
1615 | if (cfqq) { |
1616 | struct cfq_queue *new_cfqq; | |
ff6657c6 JA |
1617 | new_cfqq = cfq_get_queue(cfqd, BLK_RW_ASYNC, cic->ioc, |
1618 | GFP_ATOMIC); | |
caaa5f9f | 1619 | if (new_cfqq) { |
ff6657c6 | 1620 | cic->cfqq[BLK_RW_ASYNC] = new_cfqq; |
caaa5f9f JA |
1621 | cfq_put_queue(cfqq); |
1622 | } | |
22e2c507 | 1623 | } |
caaa5f9f | 1624 | |
ff6657c6 | 1625 | cfqq = cic->cfqq[BLK_RW_SYNC]; |
caaa5f9f JA |
1626 | if (cfqq) |
1627 | cfq_mark_cfqq_prio_changed(cfqq); | |
1628 | ||
c1b707d2 | 1629 | spin_unlock_irqrestore(cfqd->queue->queue_lock, flags); |
22e2c507 JA |
1630 | } |
1631 | ||
fc46379d | 1632 | static void cfq_ioc_set_ioprio(struct io_context *ioc) |
22e2c507 | 1633 | { |
4ac845a2 | 1634 | call_for_each_cic(ioc, changed_ioprio); |
fc46379d | 1635 | ioc->ioprio_changed = 0; |
22e2c507 JA |
1636 | } |
1637 | ||
1638 | static struct cfq_queue * | |
15c31be4 | 1639 | cfq_find_alloc_queue(struct cfq_data *cfqd, int is_sync, |
fd0928df | 1640 | struct io_context *ioc, gfp_t gfp_mask) |
22e2c507 | 1641 | { |
22e2c507 | 1642 | struct cfq_queue *cfqq, *new_cfqq = NULL; |
91fac317 | 1643 | struct cfq_io_context *cic; |
22e2c507 JA |
1644 | |
1645 | retry: | |
4ac845a2 | 1646 | cic = cfq_cic_lookup(cfqd, ioc); |
91fac317 VT |
1647 | /* cic always exists here */ |
1648 | cfqq = cic_to_cfqq(cic, is_sync); | |
22e2c507 JA |
1649 | |
1650 | if (!cfqq) { | |
1651 | if (new_cfqq) { | |
1652 | cfqq = new_cfqq; | |
1653 | new_cfqq = NULL; | |
1654 | } else if (gfp_mask & __GFP_WAIT) { | |
89850f7e JA |
1655 | /* |
1656 | * Inform the allocator of the fact that we will | |
1657 | * just repeat this allocation if it fails, to allow | |
1658 | * the allocator to do whatever it needs to attempt to | |
1659 | * free memory. | |
1660 | */ | |
22e2c507 | 1661 | spin_unlock_irq(cfqd->queue->queue_lock); |
94f6030c CL |
1662 | new_cfqq = kmem_cache_alloc_node(cfq_pool, |
1663 | gfp_mask | __GFP_NOFAIL | __GFP_ZERO, | |
1664 | cfqd->queue->node); | |
22e2c507 JA |
1665 | spin_lock_irq(cfqd->queue->queue_lock); |
1666 | goto retry; | |
1667 | } else { | |
94f6030c CL |
1668 | cfqq = kmem_cache_alloc_node(cfq_pool, |
1669 | gfp_mask | __GFP_ZERO, | |
1670 | cfqd->queue->node); | |
22e2c507 JA |
1671 | if (!cfqq) |
1672 | goto out; | |
1673 | } | |
1674 | ||
d9e7620e | 1675 | RB_CLEAR_NODE(&cfqq->rb_node); |
a36e71f9 | 1676 | RB_CLEAR_NODE(&cfqq->p_node); |
22e2c507 JA |
1677 | INIT_LIST_HEAD(&cfqq->fifo); |
1678 | ||
22e2c507 JA |
1679 | atomic_set(&cfqq->ref, 0); |
1680 | cfqq->cfqd = cfqd; | |
c5b680f3 | 1681 | |
3b18152c | 1682 | cfq_mark_cfqq_prio_changed(cfqq); |
91fac317 | 1683 | |
fd0928df | 1684 | cfq_init_prio_data(cfqq, ioc); |
0871714e JA |
1685 | |
1686 | if (is_sync) { | |
1687 | if (!cfq_class_idle(cfqq)) | |
1688 | cfq_mark_cfqq_idle_window(cfqq); | |
1689 | cfq_mark_cfqq_sync(cfqq); | |
1690 | } | |
7b679138 JA |
1691 | cfqq->pid = current->pid; |
1692 | cfq_log_cfqq(cfqd, cfqq, "alloced"); | |
22e2c507 JA |
1693 | } |
1694 | ||
1695 | if (new_cfqq) | |
1696 | kmem_cache_free(cfq_pool, new_cfqq); | |
1697 | ||
22e2c507 JA |
1698 | out: |
1699 | WARN_ON((gfp_mask & __GFP_WAIT) && !cfqq); | |
1700 | return cfqq; | |
1701 | } | |
1702 | ||
c2dea2d1 VT |
1703 | static struct cfq_queue ** |
1704 | cfq_async_queue_prio(struct cfq_data *cfqd, int ioprio_class, int ioprio) | |
1705 | { | |
fe094d98 | 1706 | switch (ioprio_class) { |
c2dea2d1 VT |
1707 | case IOPRIO_CLASS_RT: |
1708 | return &cfqd->async_cfqq[0][ioprio]; | |
1709 | case IOPRIO_CLASS_BE: | |
1710 | return &cfqd->async_cfqq[1][ioprio]; | |
1711 | case IOPRIO_CLASS_IDLE: | |
1712 | return &cfqd->async_idle_cfqq; | |
1713 | default: | |
1714 | BUG(); | |
1715 | } | |
1716 | } | |
1717 | ||
15c31be4 | 1718 | static struct cfq_queue * |
fd0928df | 1719 | cfq_get_queue(struct cfq_data *cfqd, int is_sync, struct io_context *ioc, |
15c31be4 JA |
1720 | gfp_t gfp_mask) |
1721 | { | |
fd0928df JA |
1722 | const int ioprio = task_ioprio(ioc); |
1723 | const int ioprio_class = task_ioprio_class(ioc); | |
c2dea2d1 | 1724 | struct cfq_queue **async_cfqq = NULL; |
15c31be4 JA |
1725 | struct cfq_queue *cfqq = NULL; |
1726 | ||
c2dea2d1 VT |
1727 | if (!is_sync) { |
1728 | async_cfqq = cfq_async_queue_prio(cfqd, ioprio_class, ioprio); | |
1729 | cfqq = *async_cfqq; | |
1730 | } | |
1731 | ||
0a0836a0 | 1732 | if (!cfqq) { |
fd0928df | 1733 | cfqq = cfq_find_alloc_queue(cfqd, is_sync, ioc, gfp_mask); |
0a0836a0 ON |
1734 | if (!cfqq) |
1735 | return NULL; | |
1736 | } | |
15c31be4 JA |
1737 | |
1738 | /* | |
1739 | * pin the queue now that it's allocated, scheduler exit will prune it | |
1740 | */ | |
c2dea2d1 | 1741 | if (!is_sync && !(*async_cfqq)) { |
15c31be4 | 1742 | atomic_inc(&cfqq->ref); |
c2dea2d1 | 1743 | *async_cfqq = cfqq; |
15c31be4 JA |
1744 | } |
1745 | ||
1746 | atomic_inc(&cfqq->ref); | |
1747 | return cfqq; | |
1748 | } | |
1749 | ||
498d3aa2 JA |
1750 | /* |
1751 | * We drop cfq io contexts lazily, so we may find a dead one. | |
1752 | */ | |
dbecf3ab | 1753 | static void |
4ac845a2 JA |
1754 | cfq_drop_dead_cic(struct cfq_data *cfqd, struct io_context *ioc, |
1755 | struct cfq_io_context *cic) | |
dbecf3ab | 1756 | { |
4ac845a2 JA |
1757 | unsigned long flags; |
1758 | ||
fc46379d | 1759 | WARN_ON(!list_empty(&cic->queue_list)); |
597bc485 | 1760 | |
4ac845a2 JA |
1761 | spin_lock_irqsave(&ioc->lock, flags); |
1762 | ||
4faa3c81 | 1763 | BUG_ON(ioc->ioc_data == cic); |
597bc485 | 1764 | |
4ac845a2 | 1765 | radix_tree_delete(&ioc->radix_root, (unsigned long) cfqd); |
ffc4e759 | 1766 | hlist_del_rcu(&cic->cic_list); |
4ac845a2 JA |
1767 | spin_unlock_irqrestore(&ioc->lock, flags); |
1768 | ||
1769 | cfq_cic_free(cic); | |
dbecf3ab OH |
1770 | } |
1771 | ||
e2d74ac0 | 1772 | static struct cfq_io_context * |
4ac845a2 | 1773 | cfq_cic_lookup(struct cfq_data *cfqd, struct io_context *ioc) |
e2d74ac0 | 1774 | { |
e2d74ac0 | 1775 | struct cfq_io_context *cic; |
d6de8be7 | 1776 | unsigned long flags; |
4ac845a2 | 1777 | void *k; |
e2d74ac0 | 1778 | |
91fac317 VT |
1779 | if (unlikely(!ioc)) |
1780 | return NULL; | |
1781 | ||
d6de8be7 JA |
1782 | rcu_read_lock(); |
1783 | ||
597bc485 JA |
1784 | /* |
1785 | * we maintain a last-hit cache, to avoid browsing over the tree | |
1786 | */ | |
4ac845a2 | 1787 | cic = rcu_dereference(ioc->ioc_data); |
d6de8be7 JA |
1788 | if (cic && cic->key == cfqd) { |
1789 | rcu_read_unlock(); | |
597bc485 | 1790 | return cic; |
d6de8be7 | 1791 | } |
597bc485 | 1792 | |
4ac845a2 | 1793 | do { |
4ac845a2 JA |
1794 | cic = radix_tree_lookup(&ioc->radix_root, (unsigned long) cfqd); |
1795 | rcu_read_unlock(); | |
1796 | if (!cic) | |
1797 | break; | |
be3b0753 OH |
1798 | /* ->key must be copied to avoid race with cfq_exit_queue() */ |
1799 | k = cic->key; | |
1800 | if (unlikely(!k)) { | |
4ac845a2 | 1801 | cfq_drop_dead_cic(cfqd, ioc, cic); |
d6de8be7 | 1802 | rcu_read_lock(); |
4ac845a2 | 1803 | continue; |
dbecf3ab | 1804 | } |
e2d74ac0 | 1805 | |
d6de8be7 | 1806 | spin_lock_irqsave(&ioc->lock, flags); |
4ac845a2 | 1807 | rcu_assign_pointer(ioc->ioc_data, cic); |
d6de8be7 | 1808 | spin_unlock_irqrestore(&ioc->lock, flags); |
4ac845a2 JA |
1809 | break; |
1810 | } while (1); | |
e2d74ac0 | 1811 | |
4ac845a2 | 1812 | return cic; |
e2d74ac0 JA |
1813 | } |
1814 | ||
4ac845a2 JA |
1815 | /* |
1816 | * Add cic into ioc, using cfqd as the search key. This enables us to lookup | |
1817 | * the process specific cfq io context when entered from the block layer. | |
1818 | * Also adds the cic to a per-cfqd list, used when this queue is removed. | |
1819 | */ | |
febffd61 JA |
1820 | static int cfq_cic_link(struct cfq_data *cfqd, struct io_context *ioc, |
1821 | struct cfq_io_context *cic, gfp_t gfp_mask) | |
e2d74ac0 | 1822 | { |
0261d688 | 1823 | unsigned long flags; |
4ac845a2 | 1824 | int ret; |
e2d74ac0 | 1825 | |
4ac845a2 JA |
1826 | ret = radix_tree_preload(gfp_mask); |
1827 | if (!ret) { | |
1828 | cic->ioc = ioc; | |
1829 | cic->key = cfqd; | |
e2d74ac0 | 1830 | |
4ac845a2 JA |
1831 | spin_lock_irqsave(&ioc->lock, flags); |
1832 | ret = radix_tree_insert(&ioc->radix_root, | |
1833 | (unsigned long) cfqd, cic); | |
ffc4e759 JA |
1834 | if (!ret) |
1835 | hlist_add_head_rcu(&cic->cic_list, &ioc->cic_list); | |
4ac845a2 | 1836 | spin_unlock_irqrestore(&ioc->lock, flags); |
e2d74ac0 | 1837 | |
4ac845a2 JA |
1838 | radix_tree_preload_end(); |
1839 | ||
1840 | if (!ret) { | |
1841 | spin_lock_irqsave(cfqd->queue->queue_lock, flags); | |
1842 | list_add(&cic->queue_list, &cfqd->cic_list); | |
1843 | spin_unlock_irqrestore(cfqd->queue->queue_lock, flags); | |
1844 | } | |
e2d74ac0 JA |
1845 | } |
1846 | ||
4ac845a2 JA |
1847 | if (ret) |
1848 | printk(KERN_ERR "cfq: cic link failed!\n"); | |
fc46379d | 1849 | |
4ac845a2 | 1850 | return ret; |
e2d74ac0 JA |
1851 | } |
1852 | ||
1da177e4 LT |
1853 | /* |
1854 | * Setup general io context and cfq io context. There can be several cfq | |
1855 | * io contexts per general io context, if this process is doing io to more | |
e2d74ac0 | 1856 | * than one device managed by cfq. |
1da177e4 LT |
1857 | */ |
1858 | static struct cfq_io_context * | |
e2d74ac0 | 1859 | cfq_get_io_context(struct cfq_data *cfqd, gfp_t gfp_mask) |
1da177e4 | 1860 | { |
22e2c507 | 1861 | struct io_context *ioc = NULL; |
1da177e4 | 1862 | struct cfq_io_context *cic; |
1da177e4 | 1863 | |
22e2c507 | 1864 | might_sleep_if(gfp_mask & __GFP_WAIT); |
1da177e4 | 1865 | |
b5deef90 | 1866 | ioc = get_io_context(gfp_mask, cfqd->queue->node); |
1da177e4 LT |
1867 | if (!ioc) |
1868 | return NULL; | |
1869 | ||
4ac845a2 | 1870 | cic = cfq_cic_lookup(cfqd, ioc); |
e2d74ac0 JA |
1871 | if (cic) |
1872 | goto out; | |
1da177e4 | 1873 | |
e2d74ac0 JA |
1874 | cic = cfq_alloc_io_context(cfqd, gfp_mask); |
1875 | if (cic == NULL) | |
1876 | goto err; | |
1da177e4 | 1877 | |
4ac845a2 JA |
1878 | if (cfq_cic_link(cfqd, ioc, cic, gfp_mask)) |
1879 | goto err_free; | |
1880 | ||
1da177e4 | 1881 | out: |
fc46379d JA |
1882 | smp_read_barrier_depends(); |
1883 | if (unlikely(ioc->ioprio_changed)) | |
1884 | cfq_ioc_set_ioprio(ioc); | |
1885 | ||
1da177e4 | 1886 | return cic; |
4ac845a2 JA |
1887 | err_free: |
1888 | cfq_cic_free(cic); | |
1da177e4 LT |
1889 | err: |
1890 | put_io_context(ioc); | |
1891 | return NULL; | |
1892 | } | |
1893 | ||
22e2c507 JA |
1894 | static void |
1895 | cfq_update_io_thinktime(struct cfq_data *cfqd, struct cfq_io_context *cic) | |
1da177e4 | 1896 | { |
aaf1228d JA |
1897 | unsigned long elapsed = jiffies - cic->last_end_request; |
1898 | unsigned long ttime = min(elapsed, 2UL * cfqd->cfq_slice_idle); | |
db3b5848 | 1899 | |
22e2c507 JA |
1900 | cic->ttime_samples = (7*cic->ttime_samples + 256) / 8; |
1901 | cic->ttime_total = (7*cic->ttime_total + 256*ttime) / 8; | |
1902 | cic->ttime_mean = (cic->ttime_total + 128) / cic->ttime_samples; | |
1903 | } | |
1da177e4 | 1904 | |
206dc69b | 1905 | static void |
6d048f53 JA |
1906 | cfq_update_io_seektime(struct cfq_data *cfqd, struct cfq_io_context *cic, |
1907 | struct request *rq) | |
206dc69b JA |
1908 | { |
1909 | sector_t sdist; | |
1910 | u64 total; | |
1911 | ||
4d00aa47 JM |
1912 | if (!cic->last_request_pos) |
1913 | sdist = 0; | |
1914 | else if (cic->last_request_pos < rq->sector) | |
5e705374 | 1915 | sdist = rq->sector - cic->last_request_pos; |
206dc69b | 1916 | else |
5e705374 | 1917 | sdist = cic->last_request_pos - rq->sector; |
206dc69b JA |
1918 | |
1919 | /* | |
1920 | * Don't allow the seek distance to get too large from the | |
1921 | * odd fragment, pagein, etc | |
1922 | */ | |
1923 | if (cic->seek_samples <= 60) /* second&third seek */ | |
1924 | sdist = min(sdist, (cic->seek_mean * 4) + 2*1024*1024); | |
1925 | else | |
1926 | sdist = min(sdist, (cic->seek_mean * 4) + 2*1024*64); | |
1927 | ||
1928 | cic->seek_samples = (7*cic->seek_samples + 256) / 8; | |
1929 | cic->seek_total = (7*cic->seek_total + (u64)256*sdist) / 8; | |
1930 | total = cic->seek_total + (cic->seek_samples/2); | |
1931 | do_div(total, cic->seek_samples); | |
1932 | cic->seek_mean = (sector_t)total; | |
1933 | } | |
1da177e4 | 1934 | |
22e2c507 JA |
1935 | /* |
1936 | * Disable idle window if the process thinks too long or seeks so much that | |
1937 | * it doesn't matter | |
1938 | */ | |
1939 | static void | |
1940 | cfq_update_idle_window(struct cfq_data *cfqd, struct cfq_queue *cfqq, | |
1941 | struct cfq_io_context *cic) | |
1942 | { | |
7b679138 | 1943 | int old_idle, enable_idle; |
1be92f2f | 1944 | |
0871714e JA |
1945 | /* |
1946 | * Don't idle for async or idle io prio class | |
1947 | */ | |
1948 | if (!cfq_cfqq_sync(cfqq) || cfq_class_idle(cfqq)) | |
1be92f2f JA |
1949 | return; |
1950 | ||
c265a7f4 | 1951 | enable_idle = old_idle = cfq_cfqq_idle_window(cfqq); |
1da177e4 | 1952 | |
66dac98e | 1953 | if (!atomic_read(&cic->ioc->nr_tasks) || !cfqd->cfq_slice_idle || |
caaa5f9f | 1954 | (cfqd->hw_tag && CIC_SEEKY(cic))) |
22e2c507 JA |
1955 | enable_idle = 0; |
1956 | else if (sample_valid(cic->ttime_samples)) { | |
1957 | if (cic->ttime_mean > cfqd->cfq_slice_idle) | |
1958 | enable_idle = 0; | |
1959 | else | |
1960 | enable_idle = 1; | |
1da177e4 LT |
1961 | } |
1962 | ||
7b679138 JA |
1963 | if (old_idle != enable_idle) { |
1964 | cfq_log_cfqq(cfqd, cfqq, "idle=%d", enable_idle); | |
1965 | if (enable_idle) | |
1966 | cfq_mark_cfqq_idle_window(cfqq); | |
1967 | else | |
1968 | cfq_clear_cfqq_idle_window(cfqq); | |
1969 | } | |
22e2c507 | 1970 | } |
1da177e4 | 1971 | |
22e2c507 JA |
1972 | /* |
1973 | * Check if new_cfqq should preempt the currently active queue. Return 0 for | |
1974 | * no or if we aren't sure, a 1 will cause a preempt. | |
1975 | */ | |
1976 | static int | |
1977 | cfq_should_preempt(struct cfq_data *cfqd, struct cfq_queue *new_cfqq, | |
5e705374 | 1978 | struct request *rq) |
22e2c507 | 1979 | { |
6d048f53 | 1980 | struct cfq_queue *cfqq; |
22e2c507 | 1981 | |
6d048f53 JA |
1982 | cfqq = cfqd->active_queue; |
1983 | if (!cfqq) | |
22e2c507 JA |
1984 | return 0; |
1985 | ||
6d048f53 JA |
1986 | if (cfq_slice_used(cfqq)) |
1987 | return 1; | |
1988 | ||
1989 | if (cfq_class_idle(new_cfqq)) | |
caaa5f9f | 1990 | return 0; |
22e2c507 JA |
1991 | |
1992 | if (cfq_class_idle(cfqq)) | |
1993 | return 1; | |
1e3335de | 1994 | |
374f84ac JA |
1995 | /* |
1996 | * if the new request is sync, but the currently running queue is | |
1997 | * not, let the sync request have priority. | |
1998 | */ | |
5e705374 | 1999 | if (rq_is_sync(rq) && !cfq_cfqq_sync(cfqq)) |
22e2c507 | 2000 | return 1; |
1e3335de | 2001 | |
374f84ac JA |
2002 | /* |
2003 | * So both queues are sync. Let the new request get disk time if | |
2004 | * it's a metadata request and the current queue is doing regular IO. | |
2005 | */ | |
2006 | if (rq_is_meta(rq) && !cfqq->meta_pending) | |
2007 | return 1; | |
22e2c507 | 2008 | |
3a9a3f6c DS |
2009 | /* |
2010 | * Allow an RT request to pre-empt an ongoing non-RT cfqq timeslice. | |
2011 | */ | |
2012 | if (cfq_class_rt(new_cfqq) && !cfq_class_rt(cfqq)) | |
2013 | return 1; | |
2014 | ||
1e3335de JA |
2015 | if (!cfqd->active_cic || !cfq_cfqq_wait_request(cfqq)) |
2016 | return 0; | |
2017 | ||
2018 | /* | |
2019 | * if this request is as-good as one we would expect from the | |
2020 | * current cfqq, let it preempt | |
2021 | */ | |
6d048f53 | 2022 | if (cfq_rq_close(cfqd, rq)) |
1e3335de JA |
2023 | return 1; |
2024 | ||
22e2c507 JA |
2025 | return 0; |
2026 | } | |
2027 | ||
2028 | /* | |
2029 | * cfqq preempts the active queue. if we allowed preempt with no slice left, | |
2030 | * let it have half of its nominal slice. | |
2031 | */ | |
2032 | static void cfq_preempt_queue(struct cfq_data *cfqd, struct cfq_queue *cfqq) | |
2033 | { | |
7b679138 | 2034 | cfq_log_cfqq(cfqd, cfqq, "preempt"); |
6084cdda | 2035 | cfq_slice_expired(cfqd, 1); |
22e2c507 | 2036 | |
bf572256 JA |
2037 | /* |
2038 | * Put the new queue at the front of the of the current list, | |
2039 | * so we know that it will be selected next. | |
2040 | */ | |
2041 | BUG_ON(!cfq_cfqq_on_rr(cfqq)); | |
edd75ffd JA |
2042 | |
2043 | cfq_service_tree_add(cfqd, cfqq, 1); | |
bf572256 | 2044 | |
44f7c160 JA |
2045 | cfqq->slice_end = 0; |
2046 | cfq_mark_cfqq_slice_new(cfqq); | |
22e2c507 JA |
2047 | } |
2048 | ||
22e2c507 | 2049 | /* |
5e705374 | 2050 | * Called when a new fs request (rq) is added (to cfqq). Check if there's |
22e2c507 JA |
2051 | * something we should do about it |
2052 | */ | |
2053 | static void | |
5e705374 JA |
2054 | cfq_rq_enqueued(struct cfq_data *cfqd, struct cfq_queue *cfqq, |
2055 | struct request *rq) | |
22e2c507 | 2056 | { |
5e705374 | 2057 | struct cfq_io_context *cic = RQ_CIC(rq); |
12e9fddd | 2058 | |
45333d5a | 2059 | cfqd->rq_queued++; |
374f84ac JA |
2060 | if (rq_is_meta(rq)) |
2061 | cfqq->meta_pending++; | |
2062 | ||
9c2c38a1 | 2063 | cfq_update_io_thinktime(cfqd, cic); |
6d048f53 | 2064 | cfq_update_io_seektime(cfqd, cic, rq); |
9c2c38a1 JA |
2065 | cfq_update_idle_window(cfqd, cfqq, cic); |
2066 | ||
5e705374 | 2067 | cic->last_request_pos = rq->sector + rq->nr_sectors; |
22e2c507 JA |
2068 | |
2069 | if (cfqq == cfqd->active_queue) { | |
2070 | /* | |
b029195d JA |
2071 | * Remember that we saw a request from this process, but |
2072 | * don't start queuing just yet. Otherwise we risk seeing lots | |
2073 | * of tiny requests, because we disrupt the normal plugging | |
d6ceb25e JA |
2074 | * and merging. If the request is already larger than a single |
2075 | * page, let it rip immediately. For that case we assume that | |
2d870722 JA |
2076 | * merging is already done. Ditto for a busy system that |
2077 | * has other work pending, don't risk delaying until the | |
2078 | * idle timer unplug to continue working. | |
22e2c507 | 2079 | */ |
d6ceb25e | 2080 | if (cfq_cfqq_wait_request(cfqq)) { |
2d870722 JA |
2081 | if (blk_rq_bytes(rq) > PAGE_CACHE_SIZE || |
2082 | cfqd->busy_queues > 1) { | |
d6ceb25e JA |
2083 | del_timer(&cfqd->idle_slice_timer); |
2084 | blk_start_queueing(cfqd->queue); | |
2085 | } | |
b029195d | 2086 | cfq_mark_cfqq_must_dispatch(cfqq); |
d6ceb25e | 2087 | } |
5e705374 | 2088 | } else if (cfq_should_preempt(cfqd, cfqq, rq)) { |
22e2c507 JA |
2089 | /* |
2090 | * not the active queue - expire current slice if it is | |
2091 | * idle and has expired it's mean thinktime or this new queue | |
3a9a3f6c DS |
2092 | * has some old slice time left and is of higher priority or |
2093 | * this new queue is RT and the current one is BE | |
22e2c507 JA |
2094 | */ |
2095 | cfq_preempt_queue(cfqd, cfqq); | |
dc72ef4a | 2096 | blk_start_queueing(cfqd->queue); |
22e2c507 | 2097 | } |
1da177e4 LT |
2098 | } |
2099 | ||
165125e1 | 2100 | static void cfq_insert_request(struct request_queue *q, struct request *rq) |
1da177e4 | 2101 | { |
b4878f24 | 2102 | struct cfq_data *cfqd = q->elevator->elevator_data; |
5e705374 | 2103 | struct cfq_queue *cfqq = RQ_CFQQ(rq); |
22e2c507 | 2104 | |
7b679138 | 2105 | cfq_log_cfqq(cfqd, cfqq, "insert_request"); |
fd0928df | 2106 | cfq_init_prio_data(cfqq, RQ_CIC(rq)->ioc); |
1da177e4 | 2107 | |
5e705374 | 2108 | cfq_add_rq_rb(rq); |
1da177e4 | 2109 | |
22e2c507 JA |
2110 | list_add_tail(&rq->queuelist, &cfqq->fifo); |
2111 | ||
5e705374 | 2112 | cfq_rq_enqueued(cfqd, cfqq, rq); |
1da177e4 LT |
2113 | } |
2114 | ||
45333d5a AC |
2115 | /* |
2116 | * Update hw_tag based on peak queue depth over 50 samples under | |
2117 | * sufficient load. | |
2118 | */ | |
2119 | static void cfq_update_hw_tag(struct cfq_data *cfqd) | |
2120 | { | |
2121 | if (cfqd->rq_in_driver > cfqd->rq_in_driver_peak) | |
2122 | cfqd->rq_in_driver_peak = cfqd->rq_in_driver; | |
2123 | ||
2124 | if (cfqd->rq_queued <= CFQ_HW_QUEUE_MIN && | |
2125 | cfqd->rq_in_driver <= CFQ_HW_QUEUE_MIN) | |
2126 | return; | |
2127 | ||
2128 | if (cfqd->hw_tag_samples++ < 50) | |
2129 | return; | |
2130 | ||
2131 | if (cfqd->rq_in_driver_peak >= CFQ_HW_QUEUE_MIN) | |
2132 | cfqd->hw_tag = 1; | |
2133 | else | |
2134 | cfqd->hw_tag = 0; | |
2135 | ||
2136 | cfqd->hw_tag_samples = 0; | |
2137 | cfqd->rq_in_driver_peak = 0; | |
2138 | } | |
2139 | ||
165125e1 | 2140 | static void cfq_completed_request(struct request_queue *q, struct request *rq) |
1da177e4 | 2141 | { |
5e705374 | 2142 | struct cfq_queue *cfqq = RQ_CFQQ(rq); |
b4878f24 | 2143 | struct cfq_data *cfqd = cfqq->cfqd; |
5380a101 | 2144 | const int sync = rq_is_sync(rq); |
b4878f24 | 2145 | unsigned long now; |
1da177e4 | 2146 | |
b4878f24 | 2147 | now = jiffies; |
7b679138 | 2148 | cfq_log_cfqq(cfqd, cfqq, "complete"); |
1da177e4 | 2149 | |
45333d5a AC |
2150 | cfq_update_hw_tag(cfqd); |
2151 | ||
b4878f24 | 2152 | WARN_ON(!cfqd->rq_in_driver); |
6d048f53 | 2153 | WARN_ON(!cfqq->dispatched); |
b4878f24 | 2154 | cfqd->rq_in_driver--; |
6d048f53 | 2155 | cfqq->dispatched--; |
1da177e4 | 2156 | |
3ed9a296 JA |
2157 | if (cfq_cfqq_sync(cfqq)) |
2158 | cfqd->sync_flight--; | |
2159 | ||
b4878f24 JA |
2160 | if (!cfq_class_idle(cfqq)) |
2161 | cfqd->last_end_request = now; | |
3b18152c | 2162 | |
caaa5f9f | 2163 | if (sync) |
5e705374 | 2164 | RQ_CIC(rq)->last_end_request = now; |
caaa5f9f JA |
2165 | |
2166 | /* | |
2167 | * If this is the active queue, check if it needs to be expired, | |
2168 | * or if we want to idle in case it has no pending requests. | |
2169 | */ | |
2170 | if (cfqd->active_queue == cfqq) { | |
a36e71f9 JA |
2171 | const bool cfqq_empty = RB_EMPTY_ROOT(&cfqq->sort_list); |
2172 | ||
44f7c160 JA |
2173 | if (cfq_cfqq_slice_new(cfqq)) { |
2174 | cfq_set_prio_slice(cfqd, cfqq); | |
2175 | cfq_clear_cfqq_slice_new(cfqq); | |
2176 | } | |
a36e71f9 JA |
2177 | /* |
2178 | * If there are no requests waiting in this queue, and | |
2179 | * there are other queues ready to issue requests, AND | |
2180 | * those other queues are issuing requests within our | |
2181 | * mean seek distance, give them a chance to run instead | |
2182 | * of idling. | |
2183 | */ | |
0871714e | 2184 | if (cfq_slice_used(cfqq) || cfq_class_idle(cfqq)) |
6084cdda | 2185 | cfq_slice_expired(cfqd, 1); |
a36e71f9 JA |
2186 | else if (cfqq_empty && !cfq_close_cooperator(cfqd, cfqq, 1) && |
2187 | sync && !rq_noidle(rq)) | |
6d048f53 | 2188 | cfq_arm_slice_timer(cfqd); |
caaa5f9f | 2189 | } |
6d048f53 JA |
2190 | |
2191 | if (!cfqd->rq_in_driver) | |
2192 | cfq_schedule_dispatch(cfqd); | |
1da177e4 LT |
2193 | } |
2194 | ||
22e2c507 JA |
2195 | /* |
2196 | * we temporarily boost lower priority queues if they are holding fs exclusive | |
2197 | * resources. they are boosted to normal prio (CLASS_BE/4) | |
2198 | */ | |
2199 | static void cfq_prio_boost(struct cfq_queue *cfqq) | |
1da177e4 | 2200 | { |
22e2c507 JA |
2201 | if (has_fs_excl()) { |
2202 | /* | |
2203 | * boost idle prio on transactions that would lock out other | |
2204 | * users of the filesystem | |
2205 | */ | |
2206 | if (cfq_class_idle(cfqq)) | |
2207 | cfqq->ioprio_class = IOPRIO_CLASS_BE; | |
2208 | if (cfqq->ioprio > IOPRIO_NORM) | |
2209 | cfqq->ioprio = IOPRIO_NORM; | |
2210 | } else { | |
2211 | /* | |
2212 | * check if we need to unboost the queue | |
2213 | */ | |
2214 | if (cfqq->ioprio_class != cfqq->org_ioprio_class) | |
2215 | cfqq->ioprio_class = cfqq->org_ioprio_class; | |
2216 | if (cfqq->ioprio != cfqq->org_ioprio) | |
2217 | cfqq->ioprio = cfqq->org_ioprio; | |
2218 | } | |
22e2c507 | 2219 | } |
1da177e4 | 2220 | |
89850f7e | 2221 | static inline int __cfq_may_queue(struct cfq_queue *cfqq) |
22e2c507 | 2222 | { |
3b18152c | 2223 | if ((cfq_cfqq_wait_request(cfqq) || cfq_cfqq_must_alloc(cfqq)) && |
99f95e52 | 2224 | !cfq_cfqq_must_alloc_slice(cfqq)) { |
3b18152c | 2225 | cfq_mark_cfqq_must_alloc_slice(cfqq); |
22e2c507 | 2226 | return ELV_MQUEUE_MUST; |
3b18152c | 2227 | } |
1da177e4 | 2228 | |
22e2c507 | 2229 | return ELV_MQUEUE_MAY; |
22e2c507 JA |
2230 | } |
2231 | ||
165125e1 | 2232 | static int cfq_may_queue(struct request_queue *q, int rw) |
22e2c507 JA |
2233 | { |
2234 | struct cfq_data *cfqd = q->elevator->elevator_data; | |
2235 | struct task_struct *tsk = current; | |
91fac317 | 2236 | struct cfq_io_context *cic; |
22e2c507 JA |
2237 | struct cfq_queue *cfqq; |
2238 | ||
2239 | /* | |
2240 | * don't force setup of a queue from here, as a call to may_queue | |
2241 | * does not necessarily imply that a request actually will be queued. | |
2242 | * so just lookup a possibly existing queue, or return 'may queue' | |
2243 | * if that fails | |
2244 | */ | |
4ac845a2 | 2245 | cic = cfq_cic_lookup(cfqd, tsk->io_context); |
91fac317 VT |
2246 | if (!cic) |
2247 | return ELV_MQUEUE_MAY; | |
2248 | ||
b0b78f81 | 2249 | cfqq = cic_to_cfqq(cic, rw_is_sync(rw)); |
22e2c507 | 2250 | if (cfqq) { |
fd0928df | 2251 | cfq_init_prio_data(cfqq, cic->ioc); |
22e2c507 JA |
2252 | cfq_prio_boost(cfqq); |
2253 | ||
89850f7e | 2254 | return __cfq_may_queue(cfqq); |
22e2c507 JA |
2255 | } |
2256 | ||
2257 | return ELV_MQUEUE_MAY; | |
1da177e4 LT |
2258 | } |
2259 | ||
1da177e4 LT |
2260 | /* |
2261 | * queue lock held here | |
2262 | */ | |
bb37b94c | 2263 | static void cfq_put_request(struct request *rq) |
1da177e4 | 2264 | { |
5e705374 | 2265 | struct cfq_queue *cfqq = RQ_CFQQ(rq); |
1da177e4 | 2266 | |
5e705374 | 2267 | if (cfqq) { |
22e2c507 | 2268 | const int rw = rq_data_dir(rq); |
1da177e4 | 2269 | |
22e2c507 JA |
2270 | BUG_ON(!cfqq->allocated[rw]); |
2271 | cfqq->allocated[rw]--; | |
1da177e4 | 2272 | |
5e705374 | 2273 | put_io_context(RQ_CIC(rq)->ioc); |
1da177e4 | 2274 | |
1da177e4 | 2275 | rq->elevator_private = NULL; |
5e705374 | 2276 | rq->elevator_private2 = NULL; |
1da177e4 | 2277 | |
1da177e4 LT |
2278 | cfq_put_queue(cfqq); |
2279 | } | |
2280 | } | |
2281 | ||
2282 | /* | |
22e2c507 | 2283 | * Allocate cfq data structures associated with this request. |
1da177e4 | 2284 | */ |
22e2c507 | 2285 | static int |
165125e1 | 2286 | cfq_set_request(struct request_queue *q, struct request *rq, gfp_t gfp_mask) |
1da177e4 LT |
2287 | { |
2288 | struct cfq_data *cfqd = q->elevator->elevator_data; | |
2289 | struct cfq_io_context *cic; | |
2290 | const int rw = rq_data_dir(rq); | |
7749a8d4 | 2291 | const int is_sync = rq_is_sync(rq); |
22e2c507 | 2292 | struct cfq_queue *cfqq; |
1da177e4 LT |
2293 | unsigned long flags; |
2294 | ||
2295 | might_sleep_if(gfp_mask & __GFP_WAIT); | |
2296 | ||
e2d74ac0 | 2297 | cic = cfq_get_io_context(cfqd, gfp_mask); |
22e2c507 | 2298 | |
1da177e4 LT |
2299 | spin_lock_irqsave(q->queue_lock, flags); |
2300 | ||
22e2c507 JA |
2301 | if (!cic) |
2302 | goto queue_fail; | |
2303 | ||
91fac317 VT |
2304 | cfqq = cic_to_cfqq(cic, is_sync); |
2305 | if (!cfqq) { | |
fd0928df | 2306 | cfqq = cfq_get_queue(cfqd, is_sync, cic->ioc, gfp_mask); |
91fac317 | 2307 | |
22e2c507 JA |
2308 | if (!cfqq) |
2309 | goto queue_fail; | |
1da177e4 | 2310 | |
91fac317 VT |
2311 | cic_set_cfqq(cic, cfqq, is_sync); |
2312 | } | |
1da177e4 LT |
2313 | |
2314 | cfqq->allocated[rw]++; | |
3b18152c | 2315 | cfq_clear_cfqq_must_alloc(cfqq); |
22e2c507 | 2316 | atomic_inc(&cfqq->ref); |
1da177e4 | 2317 | |
5e705374 | 2318 | spin_unlock_irqrestore(q->queue_lock, flags); |
3b18152c | 2319 | |
5e705374 JA |
2320 | rq->elevator_private = cic; |
2321 | rq->elevator_private2 = cfqq; | |
2322 | return 0; | |
1da177e4 | 2323 | |
22e2c507 JA |
2324 | queue_fail: |
2325 | if (cic) | |
2326 | put_io_context(cic->ioc); | |
89850f7e | 2327 | |
3b18152c | 2328 | cfq_schedule_dispatch(cfqd); |
1da177e4 | 2329 | spin_unlock_irqrestore(q->queue_lock, flags); |
7b679138 | 2330 | cfq_log(cfqd, "set_request fail"); |
1da177e4 LT |
2331 | return 1; |
2332 | } | |
2333 | ||
65f27f38 | 2334 | static void cfq_kick_queue(struct work_struct *work) |
22e2c507 | 2335 | { |
65f27f38 DH |
2336 | struct cfq_data *cfqd = |
2337 | container_of(work, struct cfq_data, unplug_work); | |
165125e1 | 2338 | struct request_queue *q = cfqd->queue; |
22e2c507 | 2339 | |
40bb54d1 | 2340 | spin_lock_irq(q->queue_lock); |
dc72ef4a | 2341 | blk_start_queueing(q); |
40bb54d1 | 2342 | spin_unlock_irq(q->queue_lock); |
22e2c507 JA |
2343 | } |
2344 | ||
2345 | /* | |
2346 | * Timer running if the active_queue is currently idling inside its time slice | |
2347 | */ | |
2348 | static void cfq_idle_slice_timer(unsigned long data) | |
2349 | { | |
2350 | struct cfq_data *cfqd = (struct cfq_data *) data; | |
2351 | struct cfq_queue *cfqq; | |
2352 | unsigned long flags; | |
3c6bd2f8 | 2353 | int timed_out = 1; |
22e2c507 | 2354 | |
7b679138 JA |
2355 | cfq_log(cfqd, "idle timer fired"); |
2356 | ||
22e2c507 JA |
2357 | spin_lock_irqsave(cfqd->queue->queue_lock, flags); |
2358 | ||
fe094d98 JA |
2359 | cfqq = cfqd->active_queue; |
2360 | if (cfqq) { | |
3c6bd2f8 JA |
2361 | timed_out = 0; |
2362 | ||
b029195d JA |
2363 | /* |
2364 | * We saw a request before the queue expired, let it through | |
2365 | */ | |
2366 | if (cfq_cfqq_must_dispatch(cfqq)) | |
2367 | goto out_kick; | |
2368 | ||
22e2c507 JA |
2369 | /* |
2370 | * expired | |
2371 | */ | |
44f7c160 | 2372 | if (cfq_slice_used(cfqq)) |
22e2c507 JA |
2373 | goto expire; |
2374 | ||
2375 | /* | |
2376 | * only expire and reinvoke request handler, if there are | |
2377 | * other queues with pending requests | |
2378 | */ | |
caaa5f9f | 2379 | if (!cfqd->busy_queues) |
22e2c507 | 2380 | goto out_cont; |
22e2c507 JA |
2381 | |
2382 | /* | |
2383 | * not expired and it has a request pending, let it dispatch | |
2384 | */ | |
75e50984 | 2385 | if (!RB_EMPTY_ROOT(&cfqq->sort_list)) |
22e2c507 | 2386 | goto out_kick; |
22e2c507 JA |
2387 | } |
2388 | expire: | |
6084cdda | 2389 | cfq_slice_expired(cfqd, timed_out); |
22e2c507 | 2390 | out_kick: |
3b18152c | 2391 | cfq_schedule_dispatch(cfqd); |
22e2c507 JA |
2392 | out_cont: |
2393 | spin_unlock_irqrestore(cfqd->queue->queue_lock, flags); | |
2394 | } | |
2395 | ||
3b18152c JA |
2396 | static void cfq_shutdown_timer_wq(struct cfq_data *cfqd) |
2397 | { | |
2398 | del_timer_sync(&cfqd->idle_slice_timer); | |
64d01dc9 | 2399 | cancel_work_sync(&cfqd->unplug_work); |
3b18152c | 2400 | } |
22e2c507 | 2401 | |
c2dea2d1 VT |
2402 | static void cfq_put_async_queues(struct cfq_data *cfqd) |
2403 | { | |
2404 | int i; | |
2405 | ||
2406 | for (i = 0; i < IOPRIO_BE_NR; i++) { | |
2407 | if (cfqd->async_cfqq[0][i]) | |
2408 | cfq_put_queue(cfqd->async_cfqq[0][i]); | |
2409 | if (cfqd->async_cfqq[1][i]) | |
2410 | cfq_put_queue(cfqd->async_cfqq[1][i]); | |
c2dea2d1 | 2411 | } |
2389d1ef ON |
2412 | |
2413 | if (cfqd->async_idle_cfqq) | |
2414 | cfq_put_queue(cfqd->async_idle_cfqq); | |
c2dea2d1 VT |
2415 | } |
2416 | ||
b374d18a | 2417 | static void cfq_exit_queue(struct elevator_queue *e) |
1da177e4 | 2418 | { |
22e2c507 | 2419 | struct cfq_data *cfqd = e->elevator_data; |
165125e1 | 2420 | struct request_queue *q = cfqd->queue; |
22e2c507 | 2421 | |
3b18152c | 2422 | cfq_shutdown_timer_wq(cfqd); |
e2d74ac0 | 2423 | |
d9ff4187 | 2424 | spin_lock_irq(q->queue_lock); |
e2d74ac0 | 2425 | |
d9ff4187 | 2426 | if (cfqd->active_queue) |
6084cdda | 2427 | __cfq_slice_expired(cfqd, cfqd->active_queue, 0); |
e2d74ac0 JA |
2428 | |
2429 | while (!list_empty(&cfqd->cic_list)) { | |
d9ff4187 AV |
2430 | struct cfq_io_context *cic = list_entry(cfqd->cic_list.next, |
2431 | struct cfq_io_context, | |
2432 | queue_list); | |
89850f7e JA |
2433 | |
2434 | __cfq_exit_single_io_context(cfqd, cic); | |
d9ff4187 | 2435 | } |
e2d74ac0 | 2436 | |
c2dea2d1 | 2437 | cfq_put_async_queues(cfqd); |
15c31be4 | 2438 | |
d9ff4187 | 2439 | spin_unlock_irq(q->queue_lock); |
a90d742e AV |
2440 | |
2441 | cfq_shutdown_timer_wq(cfqd); | |
2442 | ||
a90d742e | 2443 | kfree(cfqd); |
1da177e4 LT |
2444 | } |
2445 | ||
165125e1 | 2446 | static void *cfq_init_queue(struct request_queue *q) |
1da177e4 LT |
2447 | { |
2448 | struct cfq_data *cfqd; | |
26a2ac00 | 2449 | int i; |
1da177e4 | 2450 | |
94f6030c | 2451 | cfqd = kmalloc_node(sizeof(*cfqd), GFP_KERNEL | __GFP_ZERO, q->node); |
1da177e4 | 2452 | if (!cfqd) |
bc1c1169 | 2453 | return NULL; |
1da177e4 | 2454 | |
cc09e299 | 2455 | cfqd->service_tree = CFQ_RB_ROOT; |
26a2ac00 JA |
2456 | |
2457 | /* | |
2458 | * Not strictly needed (since RB_ROOT just clears the node and we | |
2459 | * zeroed cfqd on alloc), but better be safe in case someone decides | |
2460 | * to add magic to the rb code | |
2461 | */ | |
2462 | for (i = 0; i < CFQ_PRIO_LISTS; i++) | |
2463 | cfqd->prio_trees[i] = RB_ROOT; | |
2464 | ||
d9ff4187 | 2465 | INIT_LIST_HEAD(&cfqd->cic_list); |
1da177e4 | 2466 | |
1da177e4 | 2467 | cfqd->queue = q; |
1da177e4 | 2468 | |
22e2c507 JA |
2469 | init_timer(&cfqd->idle_slice_timer); |
2470 | cfqd->idle_slice_timer.function = cfq_idle_slice_timer; | |
2471 | cfqd->idle_slice_timer.data = (unsigned long) cfqd; | |
2472 | ||
65f27f38 | 2473 | INIT_WORK(&cfqd->unplug_work, cfq_kick_queue); |
22e2c507 | 2474 | |
b70c864d | 2475 | cfqd->last_end_request = jiffies; |
1da177e4 | 2476 | cfqd->cfq_quantum = cfq_quantum; |
22e2c507 JA |
2477 | cfqd->cfq_fifo_expire[0] = cfq_fifo_expire[0]; |
2478 | cfqd->cfq_fifo_expire[1] = cfq_fifo_expire[1]; | |
1da177e4 LT |
2479 | cfqd->cfq_back_max = cfq_back_max; |
2480 | cfqd->cfq_back_penalty = cfq_back_penalty; | |
22e2c507 JA |
2481 | cfqd->cfq_slice[0] = cfq_slice_async; |
2482 | cfqd->cfq_slice[1] = cfq_slice_sync; | |
2483 | cfqd->cfq_slice_async_rq = cfq_slice_async_rq; | |
2484 | cfqd->cfq_slice_idle = cfq_slice_idle; | |
45333d5a | 2485 | cfqd->hw_tag = 1; |
3b18152c | 2486 | |
bc1c1169 | 2487 | return cfqd; |
1da177e4 LT |
2488 | } |
2489 | ||
2490 | static void cfq_slab_kill(void) | |
2491 | { | |
d6de8be7 JA |
2492 | /* |
2493 | * Caller already ensured that pending RCU callbacks are completed, | |
2494 | * so we should have no busy allocations at this point. | |
2495 | */ | |
1da177e4 LT |
2496 | if (cfq_pool) |
2497 | kmem_cache_destroy(cfq_pool); | |
2498 | if (cfq_ioc_pool) | |
2499 | kmem_cache_destroy(cfq_ioc_pool); | |
2500 | } | |
2501 | ||
2502 | static int __init cfq_slab_setup(void) | |
2503 | { | |
0a31bd5f | 2504 | cfq_pool = KMEM_CACHE(cfq_queue, 0); |
1da177e4 LT |
2505 | if (!cfq_pool) |
2506 | goto fail; | |
2507 | ||
34e6bbf2 | 2508 | cfq_ioc_pool = KMEM_CACHE(cfq_io_context, 0); |
1da177e4 LT |
2509 | if (!cfq_ioc_pool) |
2510 | goto fail; | |
2511 | ||
2512 | return 0; | |
2513 | fail: | |
2514 | cfq_slab_kill(); | |
2515 | return -ENOMEM; | |
2516 | } | |
2517 | ||
1da177e4 LT |
2518 | /* |
2519 | * sysfs parts below --> | |
2520 | */ | |
1da177e4 LT |
2521 | static ssize_t |
2522 | cfq_var_show(unsigned int var, char *page) | |
2523 | { | |
2524 | return sprintf(page, "%d\n", var); | |
2525 | } | |
2526 | ||
2527 | static ssize_t | |
2528 | cfq_var_store(unsigned int *var, const char *page, size_t count) | |
2529 | { | |
2530 | char *p = (char *) page; | |
2531 | ||
2532 | *var = simple_strtoul(p, &p, 10); | |
2533 | return count; | |
2534 | } | |
2535 | ||
1da177e4 | 2536 | #define SHOW_FUNCTION(__FUNC, __VAR, __CONV) \ |
b374d18a | 2537 | static ssize_t __FUNC(struct elevator_queue *e, char *page) \ |
1da177e4 | 2538 | { \ |
3d1ab40f | 2539 | struct cfq_data *cfqd = e->elevator_data; \ |
1da177e4 LT |
2540 | unsigned int __data = __VAR; \ |
2541 | if (__CONV) \ | |
2542 | __data = jiffies_to_msecs(__data); \ | |
2543 | return cfq_var_show(__data, (page)); \ | |
2544 | } | |
2545 | SHOW_FUNCTION(cfq_quantum_show, cfqd->cfq_quantum, 0); | |
22e2c507 JA |
2546 | SHOW_FUNCTION(cfq_fifo_expire_sync_show, cfqd->cfq_fifo_expire[1], 1); |
2547 | SHOW_FUNCTION(cfq_fifo_expire_async_show, cfqd->cfq_fifo_expire[0], 1); | |
e572ec7e AV |
2548 | SHOW_FUNCTION(cfq_back_seek_max_show, cfqd->cfq_back_max, 0); |
2549 | SHOW_FUNCTION(cfq_back_seek_penalty_show, cfqd->cfq_back_penalty, 0); | |
22e2c507 JA |
2550 | SHOW_FUNCTION(cfq_slice_idle_show, cfqd->cfq_slice_idle, 1); |
2551 | SHOW_FUNCTION(cfq_slice_sync_show, cfqd->cfq_slice[1], 1); | |
2552 | SHOW_FUNCTION(cfq_slice_async_show, cfqd->cfq_slice[0], 1); | |
2553 | SHOW_FUNCTION(cfq_slice_async_rq_show, cfqd->cfq_slice_async_rq, 0); | |
1da177e4 LT |
2554 | #undef SHOW_FUNCTION |
2555 | ||
2556 | #define STORE_FUNCTION(__FUNC, __PTR, MIN, MAX, __CONV) \ | |
b374d18a | 2557 | static ssize_t __FUNC(struct elevator_queue *e, const char *page, size_t count) \ |
1da177e4 | 2558 | { \ |
3d1ab40f | 2559 | struct cfq_data *cfqd = e->elevator_data; \ |
1da177e4 LT |
2560 | unsigned int __data; \ |
2561 | int ret = cfq_var_store(&__data, (page), count); \ | |
2562 | if (__data < (MIN)) \ | |
2563 | __data = (MIN); \ | |
2564 | else if (__data > (MAX)) \ | |
2565 | __data = (MAX); \ | |
2566 | if (__CONV) \ | |
2567 | *(__PTR) = msecs_to_jiffies(__data); \ | |
2568 | else \ | |
2569 | *(__PTR) = __data; \ | |
2570 | return ret; \ | |
2571 | } | |
2572 | STORE_FUNCTION(cfq_quantum_store, &cfqd->cfq_quantum, 1, UINT_MAX, 0); | |
fe094d98 JA |
2573 | STORE_FUNCTION(cfq_fifo_expire_sync_store, &cfqd->cfq_fifo_expire[1], 1, |
2574 | UINT_MAX, 1); | |
2575 | STORE_FUNCTION(cfq_fifo_expire_async_store, &cfqd->cfq_fifo_expire[0], 1, | |
2576 | UINT_MAX, 1); | |
e572ec7e | 2577 | STORE_FUNCTION(cfq_back_seek_max_store, &cfqd->cfq_back_max, 0, UINT_MAX, 0); |
fe094d98 JA |
2578 | STORE_FUNCTION(cfq_back_seek_penalty_store, &cfqd->cfq_back_penalty, 1, |
2579 | UINT_MAX, 0); | |
22e2c507 JA |
2580 | STORE_FUNCTION(cfq_slice_idle_store, &cfqd->cfq_slice_idle, 0, UINT_MAX, 1); |
2581 | STORE_FUNCTION(cfq_slice_sync_store, &cfqd->cfq_slice[1], 1, UINT_MAX, 1); | |
2582 | STORE_FUNCTION(cfq_slice_async_store, &cfqd->cfq_slice[0], 1, UINT_MAX, 1); | |
fe094d98 JA |
2583 | STORE_FUNCTION(cfq_slice_async_rq_store, &cfqd->cfq_slice_async_rq, 1, |
2584 | UINT_MAX, 0); | |
1da177e4 LT |
2585 | #undef STORE_FUNCTION |
2586 | ||
e572ec7e AV |
2587 | #define CFQ_ATTR(name) \ |
2588 | __ATTR(name, S_IRUGO|S_IWUSR, cfq_##name##_show, cfq_##name##_store) | |
2589 | ||
2590 | static struct elv_fs_entry cfq_attrs[] = { | |
2591 | CFQ_ATTR(quantum), | |
e572ec7e AV |
2592 | CFQ_ATTR(fifo_expire_sync), |
2593 | CFQ_ATTR(fifo_expire_async), | |
2594 | CFQ_ATTR(back_seek_max), | |
2595 | CFQ_ATTR(back_seek_penalty), | |
2596 | CFQ_ATTR(slice_sync), | |
2597 | CFQ_ATTR(slice_async), | |
2598 | CFQ_ATTR(slice_async_rq), | |
2599 | CFQ_ATTR(slice_idle), | |
e572ec7e | 2600 | __ATTR_NULL |
1da177e4 LT |
2601 | }; |
2602 | ||
1da177e4 LT |
2603 | static struct elevator_type iosched_cfq = { |
2604 | .ops = { | |
2605 | .elevator_merge_fn = cfq_merge, | |
2606 | .elevator_merged_fn = cfq_merged_request, | |
2607 | .elevator_merge_req_fn = cfq_merged_requests, | |
da775265 | 2608 | .elevator_allow_merge_fn = cfq_allow_merge, |
b4878f24 | 2609 | .elevator_dispatch_fn = cfq_dispatch_requests, |
1da177e4 | 2610 | .elevator_add_req_fn = cfq_insert_request, |
b4878f24 | 2611 | .elevator_activate_req_fn = cfq_activate_request, |
1da177e4 LT |
2612 | .elevator_deactivate_req_fn = cfq_deactivate_request, |
2613 | .elevator_queue_empty_fn = cfq_queue_empty, | |
2614 | .elevator_completed_req_fn = cfq_completed_request, | |
21183b07 JA |
2615 | .elevator_former_req_fn = elv_rb_former_request, |
2616 | .elevator_latter_req_fn = elv_rb_latter_request, | |
1da177e4 LT |
2617 | .elevator_set_req_fn = cfq_set_request, |
2618 | .elevator_put_req_fn = cfq_put_request, | |
2619 | .elevator_may_queue_fn = cfq_may_queue, | |
2620 | .elevator_init_fn = cfq_init_queue, | |
2621 | .elevator_exit_fn = cfq_exit_queue, | |
fc46379d | 2622 | .trim = cfq_free_io_context, |
1da177e4 | 2623 | }, |
3d1ab40f | 2624 | .elevator_attrs = cfq_attrs, |
1da177e4 LT |
2625 | .elevator_name = "cfq", |
2626 | .elevator_owner = THIS_MODULE, | |
2627 | }; | |
2628 | ||
2629 | static int __init cfq_init(void) | |
2630 | { | |
22e2c507 JA |
2631 | /* |
2632 | * could be 0 on HZ < 1000 setups | |
2633 | */ | |
2634 | if (!cfq_slice_async) | |
2635 | cfq_slice_async = 1; | |
2636 | if (!cfq_slice_idle) | |
2637 | cfq_slice_idle = 1; | |
2638 | ||
1da177e4 LT |
2639 | if (cfq_slab_setup()) |
2640 | return -ENOMEM; | |
2641 | ||
2fdd82bd | 2642 | elv_register(&iosched_cfq); |
1da177e4 | 2643 | |
2fdd82bd | 2644 | return 0; |
1da177e4 LT |
2645 | } |
2646 | ||
2647 | static void __exit cfq_exit(void) | |
2648 | { | |
6e9a4738 | 2649 | DECLARE_COMPLETION_ONSTACK(all_gone); |
1da177e4 | 2650 | elv_unregister(&iosched_cfq); |
334e94de | 2651 | ioc_gone = &all_gone; |
fba82272 OH |
2652 | /* ioc_gone's update must be visible before reading ioc_count */ |
2653 | smp_wmb(); | |
d6de8be7 JA |
2654 | |
2655 | /* | |
2656 | * this also protects us from entering cfq_slab_kill() with | |
2657 | * pending RCU callbacks | |
2658 | */ | |
4050cf16 | 2659 | if (elv_ioc_count_read(ioc_count)) |
9a11b4ed | 2660 | wait_for_completion(&all_gone); |
83521d3e | 2661 | cfq_slab_kill(); |
1da177e4 LT |
2662 | } |
2663 | ||
2664 | module_init(cfq_init); | |
2665 | module_exit(cfq_exit); | |
2666 | ||
2667 | MODULE_AUTHOR("Jens Axboe"); | |
2668 | MODULE_LICENSE("GPL"); | |
2669 | MODULE_DESCRIPTION("Completely Fair Queueing IO scheduler"); |