blob: 039b38cf805c51cc012cc732cde8e48ed67ea1ee [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07002 * 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 *
Jens Axboe0fe23472006-09-04 15:41:16 +02007 * Copyright (C) 2003 Jens Axboe <axboe@kernel.dk>
Linus Torvalds1da177e2005-04-16 15:20:36 -07008 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07009#include <linux/module.h>
Al Viro1cc9be62006-03-18 12:29:52 -050010#include <linux/blkdev.h>
11#include <linux/elevator.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070012#include <linux/hash.h>
13#include <linux/rbtree.h>
Jens Axboe22e2c502005-06-27 10:55:12 +020014#include <linux/ioprio.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070015
16/*
17 * tunables
18 */
Arjan van de Ven64100092006-01-06 09:46:02 +010019static const int cfq_quantum = 4; /* max queue in one round of service */
Arjan van de Ven64100092006-01-06 09:46:02 +010020static const int cfq_fifo_expire[2] = { HZ / 4, HZ / 8 };
21static const int cfq_back_max = 16 * 1024; /* maximum backwards seek, in KiB */
22static const int cfq_back_penalty = 2; /* penalty of a backwards seek */
Linus Torvalds1da177e2005-04-16 15:20:36 -070023
Arjan van de Ven64100092006-01-06 09:46:02 +010024static const int cfq_slice_sync = HZ / 10;
Jens Axboe3b181522005-06-27 10:56:24 +020025static int cfq_slice_async = HZ / 25;
Arjan van de Ven64100092006-01-06 09:46:02 +010026static const int cfq_slice_async_rq = 2;
Jens Axboecaaa5f92006-06-16 11:23:00 +020027static int cfq_slice_idle = HZ / 125;
Jens Axboe22e2c502005-06-27 10:55:12 +020028
29#define CFQ_IDLE_GRACE (HZ / 10)
30#define CFQ_SLICE_SCALE (5)
31
32#define CFQ_KEY_ASYNC (0)
Jens Axboe22e2c502005-06-27 10:55:12 +020033
Linus Torvalds1da177e2005-04-16 15:20:36 -070034/*
35 * for the hash of cfqq inside the cfqd
36 */
37#define CFQ_QHASH_SHIFT 6
38#define CFQ_QHASH_ENTRIES (1 << CFQ_QHASH_SHIFT)
39#define list_entry_qhash(entry) hlist_entry((entry), struct cfq_queue, cfq_hash)
40
Linus Torvalds1da177e2005-04-16 15:20:36 -070041#define list_entry_cfqq(ptr) list_entry((ptr), struct cfq_queue, cfq_list)
42
Jens Axboe5e705372006-07-13 12:39:25 +020043#define RQ_CIC(rq) ((struct cfq_io_context*)(rq)->elevator_private)
44#define RQ_CFQQ(rq) ((rq)->elevator_private2)
Linus Torvalds1da177e2005-04-16 15:20:36 -070045
Christoph Lametere18b8902006-12-06 20:33:20 -080046static struct kmem_cache *cfq_pool;
47static struct kmem_cache *cfq_ioc_pool;
Linus Torvalds1da177e2005-04-16 15:20:36 -070048
Jens Axboe4050cf12006-07-19 05:07:12 +020049static DEFINE_PER_CPU(unsigned long, ioc_count);
Al Viro334e94d2006-03-18 15:05:53 -050050static struct completion *ioc_gone;
51
Jens Axboe22e2c502005-06-27 10:55:12 +020052#define CFQ_PRIO_LISTS IOPRIO_BE_NR
53#define cfq_class_idle(cfqq) ((cfqq)->ioprio_class == IOPRIO_CLASS_IDLE)
Jens Axboe22e2c502005-06-27 10:55:12 +020054#define cfq_class_rt(cfqq) ((cfqq)->ioprio_class == IOPRIO_CLASS_RT)
55
Jens Axboe3b181522005-06-27 10:56:24 +020056#define ASYNC (0)
57#define SYNC (1)
58
59#define cfq_cfqq_dispatched(cfqq) \
60 ((cfqq)->on_dispatch[ASYNC] + (cfqq)->on_dispatch[SYNC])
61
62#define cfq_cfqq_class_sync(cfqq) ((cfqq)->key != CFQ_KEY_ASYNC)
63
64#define cfq_cfqq_sync(cfqq) \
65 (cfq_cfqq_class_sync(cfqq) || (cfqq)->on_dispatch[SYNC])
Jens Axboe22e2c502005-06-27 10:55:12 +020066
Jens Axboe206dc692006-03-28 13:03:44 +020067#define sample_valid(samples) ((samples) > 80)
68
Jens Axboe22e2c502005-06-27 10:55:12 +020069/*
70 * Per block device queue structure
71 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070072struct cfq_data {
Jens Axboe22e2c502005-06-27 10:55:12 +020073 request_queue_t *queue;
74
75 /*
76 * rr list of queues with requests and the count of them
77 */
78 struct list_head rr_list[CFQ_PRIO_LISTS];
79 struct list_head busy_rr;
80 struct list_head cur_rr;
81 struct list_head idle_rr;
82 unsigned int busy_queues;
83
84 /*
Jens Axboe22e2c502005-06-27 10:55:12 +020085 * cfqq lookup hash
86 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070087 struct hlist_head *cfq_hash;
Linus Torvalds1da177e2005-04-16 15:20:36 -070088
Jens Axboe22e2c502005-06-27 10:55:12 +020089 int rq_in_driver;
Jens Axboe25776e32006-06-01 10:12:26 +020090 int hw_tag;
Jens Axboe22e2c502005-06-27 10:55:12 +020091
92 /*
Jens Axboe22e2c502005-06-27 10:55:12 +020093 * idle window management
94 */
95 struct timer_list idle_slice_timer;
96 struct work_struct unplug_work;
97
98 struct cfq_queue *active_queue;
99 struct cfq_io_context *active_cic;
100 int cur_prio, cur_end_prio;
101 unsigned int dispatch_slice;
102
103 struct timer_list idle_class_timer;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700104
105 sector_t last_sector;
Jens Axboe22e2c502005-06-27 10:55:12 +0200106 unsigned long last_end_request;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700107
Linus Torvalds1da177e2005-04-16 15:20:36 -0700108 /*
109 * tunables, see top of file
110 */
111 unsigned int cfq_quantum;
Jens Axboe22e2c502005-06-27 10:55:12 +0200112 unsigned int cfq_fifo_expire[2];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700113 unsigned int cfq_back_penalty;
114 unsigned int cfq_back_max;
Jens Axboe22e2c502005-06-27 10:55:12 +0200115 unsigned int cfq_slice[2];
116 unsigned int cfq_slice_async_rq;
117 unsigned int cfq_slice_idle;
Al Virod9ff4182006-03-18 13:51:22 -0500118
119 struct list_head cic_list;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700120};
121
Jens Axboe22e2c502005-06-27 10:55:12 +0200122/*
123 * Per process-grouping structure
124 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700125struct cfq_queue {
126 /* reference count */
127 atomic_t ref;
128 /* parent cfq_data */
129 struct cfq_data *cfqd;
Jens Axboe22e2c502005-06-27 10:55:12 +0200130 /* cfqq lookup hash */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700131 struct hlist_node cfq_hash;
132 /* hash key */
Jens Axboe22e2c502005-06-27 10:55:12 +0200133 unsigned int key;
Jens Axboe981a7972006-07-19 14:56:28 +0200134 /* member of the rr/busy/cur/idle cfqd list */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700135 struct list_head cfq_list;
136 /* sorted list of pending requests */
137 struct rb_root sort_list;
138 /* if fifo isn't expired, next request to serve */
Jens Axboe5e705372006-07-13 12:39:25 +0200139 struct request *next_rq;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700140 /* requests queued in sort_list */
141 int queued[2];
142 /* currently allocated requests */
143 int allocated[2];
Jens Axboe374f84a2006-07-23 01:42:19 +0200144 /* pending metadata requests */
145 int meta_pending;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700146 /* fifo list of requests in sort_list */
Jens Axboe22e2c502005-06-27 10:55:12 +0200147 struct list_head fifo;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700148
Jens Axboe22e2c502005-06-27 10:55:12 +0200149 unsigned long slice_end;
Jens Axboe99f96282007-02-05 11:56:25 +0100150 unsigned long service_last;
Jens Axboec5b680f2007-01-19 11:56:49 +1100151 long slice_resid;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700152
Jens Axboe3b181522005-06-27 10:56:24 +0200153 /* number of requests that are on the dispatch list */
154 int on_dispatch[2];
Jens Axboe22e2c502005-06-27 10:55:12 +0200155
156 /* io prio of this group */
157 unsigned short ioprio, org_ioprio;
158 unsigned short ioprio_class, org_ioprio_class;
159
Jens Axboe3b181522005-06-27 10:56:24 +0200160 /* various state flags, see below */
161 unsigned int flags;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700162};
163
Jens Axboe3b181522005-06-27 10:56:24 +0200164enum cfqq_state_flags {
Jens Axboeb0b8d7492007-01-19 11:35:30 +1100165 CFQ_CFQQ_FLAG_on_rr = 0, /* on round-robin busy list */
166 CFQ_CFQQ_FLAG_wait_request, /* waiting for a request */
167 CFQ_CFQQ_FLAG_must_alloc, /* must be allowed rq alloc */
168 CFQ_CFQQ_FLAG_must_alloc_slice, /* per-slice must_alloc flag */
169 CFQ_CFQQ_FLAG_must_dispatch, /* must dispatch, even if expired */
170 CFQ_CFQQ_FLAG_fifo_expire, /* FIFO checked in this slice */
171 CFQ_CFQQ_FLAG_idle_window, /* slice idling enabled */
172 CFQ_CFQQ_FLAG_prio_changed, /* task priority has changed */
173 CFQ_CFQQ_FLAG_queue_new, /* queue never been serviced */
Jens Axboe44f7c162007-01-19 11:51:58 +1100174 CFQ_CFQQ_FLAG_slice_new, /* no requests dispatched in slice */
Jens Axboe3b181522005-06-27 10:56:24 +0200175};
176
177#define CFQ_CFQQ_FNS(name) \
178static inline void cfq_mark_cfqq_##name(struct cfq_queue *cfqq) \
179{ \
180 cfqq->flags |= (1 << CFQ_CFQQ_FLAG_##name); \
181} \
182static inline void cfq_clear_cfqq_##name(struct cfq_queue *cfqq) \
183{ \
184 cfqq->flags &= ~(1 << CFQ_CFQQ_FLAG_##name); \
185} \
186static inline int cfq_cfqq_##name(const struct cfq_queue *cfqq) \
187{ \
188 return (cfqq->flags & (1 << CFQ_CFQQ_FLAG_##name)) != 0; \
189}
190
191CFQ_CFQQ_FNS(on_rr);
192CFQ_CFQQ_FNS(wait_request);
193CFQ_CFQQ_FNS(must_alloc);
194CFQ_CFQQ_FNS(must_alloc_slice);
195CFQ_CFQQ_FNS(must_dispatch);
196CFQ_CFQQ_FNS(fifo_expire);
197CFQ_CFQQ_FNS(idle_window);
198CFQ_CFQQ_FNS(prio_changed);
Jens Axboe53b037442006-07-28 09:48:51 +0200199CFQ_CFQQ_FNS(queue_new);
Jens Axboe44f7c162007-01-19 11:51:58 +1100200CFQ_CFQQ_FNS(slice_new);
Jens Axboe3b181522005-06-27 10:56:24 +0200201#undef CFQ_CFQQ_FNS
202
Jens Axboe3b181522005-06-27 10:56:24 +0200203static struct cfq_queue *cfq_find_cfq_hash(struct cfq_data *, unsigned int, unsigned short);
Jens Axboe5e705372006-07-13 12:39:25 +0200204static void cfq_dispatch_insert(request_queue_t *, struct request *);
Al Viro6f325a12006-03-18 14:58:37 -0500205static struct cfq_queue *cfq_get_queue(struct cfq_data *cfqd, unsigned int key, struct task_struct *tsk, gfp_t gfp_mask);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700206
Linus Torvalds1da177e2005-04-16 15:20:36 -0700207/*
Andrew Morton99f95e52005-06-27 20:14:05 -0700208 * scheduler run of queue, if there are requests pending and no one in the
209 * driver that will restart queueing
210 */
211static inline void cfq_schedule_dispatch(struct cfq_data *cfqd)
212{
Jens Axboe7b14e3b2006-02-28 09:35:11 +0100213 if (cfqd->busy_queues)
Andrew Morton99f95e52005-06-27 20:14:05 -0700214 kblockd_schedule_work(&cfqd->unplug_work);
215}
216
217static int cfq_queue_empty(request_queue_t *q)
218{
219 struct cfq_data *cfqd = q->elevator->elevator_data;
220
Jens Axboeb4878f22005-10-20 16:42:29 +0200221 return !cfqd->busy_queues;
Andrew Morton99f95e52005-06-27 20:14:05 -0700222}
223
Jens Axboe7749a8d2006-12-13 13:02:26 +0100224static inline pid_t cfq_queue_pid(struct task_struct *task, int rw, int is_sync)
Jens Axboe206dc692006-03-28 13:03:44 +0200225{
Jens Axboe7749a8d2006-12-13 13:02:26 +0100226 /*
227 * Use the per-process queue, for read requests and syncronous writes
228 */
229 if (!(rw & REQ_RW) || is_sync)
Jens Axboe206dc692006-03-28 13:03:44 +0200230 return task->pid;
231
232 return CFQ_KEY_ASYNC;
233}
234
Linus Torvalds1da177e2005-04-16 15:20:36 -0700235/*
Jens Axboe44f7c162007-01-19 11:51:58 +1100236 * Scale schedule slice based on io priority. Use the sync time slice only
237 * if a queue is marked sync and has sync io queued. A sync queue with async
238 * io only, should not get full sync slice length.
239 */
240static inline int
241cfq_prio_to_slice(struct cfq_data *cfqd, struct cfq_queue *cfqq)
242{
243 const int base_slice = cfqd->cfq_slice[cfq_cfqq_sync(cfqq)];
244
245 WARN_ON(cfqq->ioprio >= IOPRIO_BE_NR);
246
247 return base_slice + (base_slice/CFQ_SLICE_SCALE * (4 - cfqq->ioprio));
248}
249
250static inline void
251cfq_set_prio_slice(struct cfq_data *cfqd, struct cfq_queue *cfqq)
252{
253 cfqq->slice_end = cfq_prio_to_slice(cfqd, cfqq) + jiffies;
Jens Axboec5b680f2007-01-19 11:56:49 +1100254 cfqq->slice_end += cfqq->slice_resid;
255
256 /*
257 * Don't carry over residual for more than one slice, we only want
258 * to slightly correct the fairness. Carrying over forever would
259 * easily introduce oscillations.
260 */
261 cfqq->slice_resid = 0;
Jens Axboe44f7c162007-01-19 11:51:58 +1100262}
263
264/*
265 * We need to wrap this check in cfq_cfqq_slice_new(), since ->slice_end
266 * isn't valid until the first request from the dispatch is activated
267 * and the slice time set.
268 */
269static inline int cfq_slice_used(struct cfq_queue *cfqq)
270{
271 if (cfq_cfqq_slice_new(cfqq))
272 return 0;
273 if (time_before(jiffies, cfqq->slice_end))
274 return 0;
275
276 return 1;
277}
278
279/*
Jens Axboe5e705372006-07-13 12:39:25 +0200280 * Lifted from AS - choose which of rq1 and rq2 that is best served now.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700281 * We choose the request that is closest to the head right now. Distance
Andreas Mohre8a99052006-03-28 08:59:49 +0200282 * behind the head is penalized and only allowed to a certain extent.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700283 */
Jens Axboe5e705372006-07-13 12:39:25 +0200284static struct request *
285cfq_choose_req(struct cfq_data *cfqd, struct request *rq1, struct request *rq2)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700286{
287 sector_t last, s1, s2, d1 = 0, d2 = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700288 unsigned long back_max;
Andreas Mohre8a99052006-03-28 08:59:49 +0200289#define CFQ_RQ1_WRAP 0x01 /* request 1 wraps */
290#define CFQ_RQ2_WRAP 0x02 /* request 2 wraps */
291 unsigned wrap = 0; /* bit mask: requests behind the disk head? */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700292
Jens Axboe5e705372006-07-13 12:39:25 +0200293 if (rq1 == NULL || rq1 == rq2)
294 return rq2;
295 if (rq2 == NULL)
296 return rq1;
Jens Axboe9c2c38a2005-08-24 14:57:54 +0200297
Jens Axboe5e705372006-07-13 12:39:25 +0200298 if (rq_is_sync(rq1) && !rq_is_sync(rq2))
299 return rq1;
300 else if (rq_is_sync(rq2) && !rq_is_sync(rq1))
301 return rq2;
Jens Axboe374f84a2006-07-23 01:42:19 +0200302 if (rq_is_meta(rq1) && !rq_is_meta(rq2))
303 return rq1;
304 else if (rq_is_meta(rq2) && !rq_is_meta(rq1))
305 return rq2;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700306
Jens Axboe5e705372006-07-13 12:39:25 +0200307 s1 = rq1->sector;
308 s2 = rq2->sector;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700309
310 last = cfqd->last_sector;
311
Linus Torvalds1da177e2005-04-16 15:20:36 -0700312 /*
313 * by definition, 1KiB is 2 sectors
314 */
315 back_max = cfqd->cfq_back_max * 2;
316
317 /*
318 * Strict one way elevator _except_ in the case where we allow
319 * short backward seeks which are biased as twice the cost of a
320 * similar forward seek.
321 */
322 if (s1 >= last)
323 d1 = s1 - last;
324 else if (s1 + back_max >= last)
325 d1 = (last - s1) * cfqd->cfq_back_penalty;
326 else
Andreas Mohre8a99052006-03-28 08:59:49 +0200327 wrap |= CFQ_RQ1_WRAP;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700328
329 if (s2 >= last)
330 d2 = s2 - last;
331 else if (s2 + back_max >= last)
332 d2 = (last - s2) * cfqd->cfq_back_penalty;
333 else
Andreas Mohre8a99052006-03-28 08:59:49 +0200334 wrap |= CFQ_RQ2_WRAP;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700335
336 /* Found required data */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700337
Andreas Mohre8a99052006-03-28 08:59:49 +0200338 /*
339 * By doing switch() on the bit mask "wrap" we avoid having to
340 * check two variables for all permutations: --> faster!
341 */
342 switch (wrap) {
Jens Axboe5e705372006-07-13 12:39:25 +0200343 case 0: /* common case for CFQ: rq1 and rq2 not wrapped */
Andreas Mohre8a99052006-03-28 08:59:49 +0200344 if (d1 < d2)
Jens Axboe5e705372006-07-13 12:39:25 +0200345 return rq1;
Andreas Mohre8a99052006-03-28 08:59:49 +0200346 else if (d2 < d1)
Jens Axboe5e705372006-07-13 12:39:25 +0200347 return rq2;
Andreas Mohre8a99052006-03-28 08:59:49 +0200348 else {
349 if (s1 >= s2)
Jens Axboe5e705372006-07-13 12:39:25 +0200350 return rq1;
Andreas Mohre8a99052006-03-28 08:59:49 +0200351 else
Jens Axboe5e705372006-07-13 12:39:25 +0200352 return rq2;
Andreas Mohre8a99052006-03-28 08:59:49 +0200353 }
354
355 case CFQ_RQ2_WRAP:
Jens Axboe5e705372006-07-13 12:39:25 +0200356 return rq1;
Andreas Mohre8a99052006-03-28 08:59:49 +0200357 case CFQ_RQ1_WRAP:
Jens Axboe5e705372006-07-13 12:39:25 +0200358 return rq2;
359 case (CFQ_RQ1_WRAP|CFQ_RQ2_WRAP): /* both rqs wrapped */
Andreas Mohre8a99052006-03-28 08:59:49 +0200360 default:
361 /*
362 * Since both rqs are wrapped,
363 * start with the one that's further behind head
364 * (--> only *one* back seek required),
365 * since back seek takes more time than forward.
366 */
367 if (s1 <= s2)
Jens Axboe5e705372006-07-13 12:39:25 +0200368 return rq1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700369 else
Jens Axboe5e705372006-07-13 12:39:25 +0200370 return rq2;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700371 }
372}
373
374/*
375 * would be nice to take fifo expire time into account as well
376 */
Jens Axboe5e705372006-07-13 12:39:25 +0200377static struct request *
378cfq_find_next_rq(struct cfq_data *cfqd, struct cfq_queue *cfqq,
379 struct request *last)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700380{
Jens Axboe21183b02006-07-13 12:33:14 +0200381 struct rb_node *rbnext = rb_next(&last->rb_node);
382 struct rb_node *rbprev = rb_prev(&last->rb_node);
Jens Axboe5e705372006-07-13 12:39:25 +0200383 struct request *next = NULL, *prev = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700384
Jens Axboe21183b02006-07-13 12:33:14 +0200385 BUG_ON(RB_EMPTY_NODE(&last->rb_node));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700386
387 if (rbprev)
Jens Axboe5e705372006-07-13 12:39:25 +0200388 prev = rb_entry_rq(rbprev);
Jens Axboe21183b02006-07-13 12:33:14 +0200389
Linus Torvalds1da177e2005-04-16 15:20:36 -0700390 if (rbnext)
Jens Axboe5e705372006-07-13 12:39:25 +0200391 next = rb_entry_rq(rbnext);
Jens Axboe21183b02006-07-13 12:33:14 +0200392 else {
393 rbnext = rb_first(&cfqq->sort_list);
394 if (rbnext && rbnext != &last->rb_node)
Jens Axboe5e705372006-07-13 12:39:25 +0200395 next = rb_entry_rq(rbnext);
Jens Axboe21183b02006-07-13 12:33:14 +0200396 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700397
Jens Axboe21183b02006-07-13 12:33:14 +0200398 return cfq_choose_req(cfqd, next, prev);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700399}
400
Jens Axboe22e2c502005-06-27 10:55:12 +0200401static void cfq_resort_rr_list(struct cfq_queue *cfqq, int preempted)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700402{
Jens Axboe22e2c502005-06-27 10:55:12 +0200403 struct cfq_data *cfqd = cfqq->cfqd;
Jens Axboe99f96282007-02-05 11:56:25 +0100404 struct list_head *list, *n;
405 struct cfq_queue *__cfqq;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700406
Jens Axboe98e41c72007-02-05 11:55:35 +0100407 /*
408 * Resorting requires the cfqq to be on the RR list already.
409 */
410 if (!cfq_cfqq_on_rr(cfqq))
411 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700412
413 list_del(&cfqq->cfq_list);
414
Jens Axboe22e2c502005-06-27 10:55:12 +0200415 if (cfq_class_rt(cfqq))
416 list = &cfqd->cur_rr;
417 else if (cfq_class_idle(cfqq))
418 list = &cfqd->idle_rr;
419 else {
420 /*
421 * if cfqq has requests in flight, don't allow it to be
422 * found in cfq_set_active_queue before it has finished them.
423 * this is done to increase fairness between a process that
424 * has lots of io pending vs one that only generates one
425 * sporadically or synchronously
426 */
Jens Axboe3b181522005-06-27 10:56:24 +0200427 if (cfq_cfqq_dispatched(cfqq))
Jens Axboe22e2c502005-06-27 10:55:12 +0200428 list = &cfqd->busy_rr;
429 else
430 list = &cfqd->rr_list[cfqq->ioprio];
431 }
432
Jens Axboe53b037442006-07-28 09:48:51 +0200433 if (preempted || cfq_cfqq_queue_new(cfqq)) {
Jens Axboe99f96282007-02-05 11:56:25 +0100434 /*
435 * If this queue was preempted or is new (never been serviced),
436 * let it be added first for fairness but beind other new
437 * queues.
438 */
439 n = list;
Jens Axboe53b037442006-07-28 09:48:51 +0200440 while (n->next != list) {
441 __cfqq = list_entry_cfqq(n->next);
442 if (!cfq_cfqq_queue_new(__cfqq))
443 break;
444
445 n = n->next;
446 }
Jens Axboe99f96282007-02-05 11:56:25 +0100447 list_add_tail(&cfqq->cfq_list, n);
448 } else if (!cfq_cfqq_class_sync(cfqq)) {
449 /*
450 * async queue always goes to the end. this wont be overly
451 * unfair to writes, as the sort of the sync queue wont be
452 * allowed to pass the async queue again.
453 */
454 list_add_tail(&cfqq->cfq_list, list);
455 } else {
456 /*
457 * sort by last service, but don't cross a new or async
458 * queue. we don't cross a new queue because it hasn't been
459 * service before, and we don't cross an async queue because
460 * it gets added to the end on expire.
461 */
462 n = list;
463 while ((n = n->prev) != list) {
464 struct cfq_queue *__cfqq = list_entry_cfqq(n);
Jens Axboe53b037442006-07-28 09:48:51 +0200465
Jens Axboe99f96282007-02-05 11:56:25 +0100466 if (!cfq_cfqq_class_sync(cfqq) || !__cfqq->service_last)
467 break;
468 if (time_before(__cfqq->service_last, cfqq->service_last))
469 break;
470 }
471 list_add(&cfqq->cfq_list, n);
Jens Axboe22e2c502005-06-27 10:55:12 +0200472 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700473}
474
475/*
476 * add to busy list of queues for service, trying to be fair in ordering
Jens Axboe22e2c502005-06-27 10:55:12 +0200477 * the pending list according to last request service
Linus Torvalds1da177e2005-04-16 15:20:36 -0700478 */
479static inline void
Jens Axboeb4878f22005-10-20 16:42:29 +0200480cfq_add_cfqq_rr(struct cfq_data *cfqd, struct cfq_queue *cfqq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700481{
Jens Axboe3b181522005-06-27 10:56:24 +0200482 BUG_ON(cfq_cfqq_on_rr(cfqq));
483 cfq_mark_cfqq_on_rr(cfqq);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700484 cfqd->busy_queues++;
485
Jens Axboeb4878f22005-10-20 16:42:29 +0200486 cfq_resort_rr_list(cfqq, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700487}
488
489static inline void
490cfq_del_cfqq_rr(struct cfq_data *cfqd, struct cfq_queue *cfqq)
491{
Jens Axboe3b181522005-06-27 10:56:24 +0200492 BUG_ON(!cfq_cfqq_on_rr(cfqq));
493 cfq_clear_cfqq_on_rr(cfqq);
Jens Axboe981a7972006-07-19 14:56:28 +0200494 list_del_init(&cfqq->cfq_list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700495
496 BUG_ON(!cfqd->busy_queues);
497 cfqd->busy_queues--;
498}
499
500/*
501 * rb tree support functions
502 */
Jens Axboe5e705372006-07-13 12:39:25 +0200503static inline void cfq_del_rq_rb(struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700504{
Jens Axboe5e705372006-07-13 12:39:25 +0200505 struct cfq_queue *cfqq = RQ_CFQQ(rq);
Jens Axboeb4878f22005-10-20 16:42:29 +0200506 struct cfq_data *cfqd = cfqq->cfqd;
Jens Axboe5e705372006-07-13 12:39:25 +0200507 const int sync = rq_is_sync(rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700508
Jens Axboeb4878f22005-10-20 16:42:29 +0200509 BUG_ON(!cfqq->queued[sync]);
510 cfqq->queued[sync]--;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700511
Jens Axboe5e705372006-07-13 12:39:25 +0200512 elv_rb_del(&cfqq->sort_list, rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700513
Jens Axboedd67d052006-06-21 09:36:18 +0200514 if (cfq_cfqq_on_rr(cfqq) && RB_EMPTY_ROOT(&cfqq->sort_list))
Jens Axboeb4878f22005-10-20 16:42:29 +0200515 cfq_del_cfqq_rr(cfqd, cfqq);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700516}
517
Jens Axboe5e705372006-07-13 12:39:25 +0200518static void cfq_add_rq_rb(struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700519{
Jens Axboe5e705372006-07-13 12:39:25 +0200520 struct cfq_queue *cfqq = RQ_CFQQ(rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700521 struct cfq_data *cfqd = cfqq->cfqd;
Jens Axboe21183b02006-07-13 12:33:14 +0200522 struct request *__alias;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700523
Jens Axboe5380a102006-07-13 12:37:56 +0200524 cfqq->queued[rq_is_sync(rq)]++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700525
526 /*
527 * looks a little odd, but the first insert might return an alias.
528 * if that happens, put the alias on the dispatch list
529 */
Jens Axboe21183b02006-07-13 12:33:14 +0200530 while ((__alias = elv_rb_add(&cfqq->sort_list, rq)) != NULL)
Jens Axboe5e705372006-07-13 12:39:25 +0200531 cfq_dispatch_insert(cfqd->queue, __alias);
Jens Axboe5fccbf62006-10-31 14:21:55 +0100532
533 if (!cfq_cfqq_on_rr(cfqq))
534 cfq_add_cfqq_rr(cfqd, cfqq);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700535}
536
537static inline void
Jens Axboe5e705372006-07-13 12:39:25 +0200538cfq_reposition_rq_rb(struct cfq_queue *cfqq, struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700539{
Jens Axboe5380a102006-07-13 12:37:56 +0200540 elv_rb_del(&cfqq->sort_list, rq);
541 cfqq->queued[rq_is_sync(rq)]--;
Jens Axboe5e705372006-07-13 12:39:25 +0200542 cfq_add_rq_rb(rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700543}
544
Jens Axboe206dc692006-03-28 13:03:44 +0200545static struct request *
546cfq_find_rq_fmerge(struct cfq_data *cfqd, struct bio *bio)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700547{
Jens Axboe206dc692006-03-28 13:03:44 +0200548 struct task_struct *tsk = current;
Jens Axboe7749a8d2006-12-13 13:02:26 +0100549 pid_t key = cfq_queue_pid(tsk, bio_data_dir(bio), bio_sync(bio));
Jens Axboe206dc692006-03-28 13:03:44 +0200550 struct cfq_queue *cfqq;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700551
Jens Axboe206dc692006-03-28 13:03:44 +0200552 cfqq = cfq_find_cfq_hash(cfqd, key, tsk->ioprio);
Jens Axboe89850f72006-07-22 16:48:31 +0200553 if (cfqq) {
554 sector_t sector = bio->bi_sector + bio_sectors(bio);
555
Jens Axboe21183b02006-07-13 12:33:14 +0200556 return elv_rb_find(&cfqq->sort_list, sector);
Jens Axboe89850f72006-07-22 16:48:31 +0200557 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700558
Linus Torvalds1da177e2005-04-16 15:20:36 -0700559 return NULL;
560}
561
Jens Axboeb4878f22005-10-20 16:42:29 +0200562static void cfq_activate_request(request_queue_t *q, struct request *rq)
563{
564 struct cfq_data *cfqd = q->elevator->elevator_data;
565
566 cfqd->rq_in_driver++;
Jens Axboe25776e32006-06-01 10:12:26 +0200567
568 /*
569 * If the depth is larger 1, it really could be queueing. But lets
570 * make the mark a little higher - idling could still be good for
571 * low queueing, and a low queueing number could also just indicate
572 * a SCSI mid layer like behaviour where limit+1 is often seen.
573 */
574 if (!cfqd->hw_tag && cfqd->rq_in_driver > 4)
575 cfqd->hw_tag = 1;
Jens Axboeb4878f22005-10-20 16:42:29 +0200576}
577
Linus Torvalds1da177e2005-04-16 15:20:36 -0700578static void cfq_deactivate_request(request_queue_t *q, struct request *rq)
579{
Jens Axboe22e2c502005-06-27 10:55:12 +0200580 struct cfq_data *cfqd = q->elevator->elevator_data;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700581
Jens Axboeb4878f22005-10-20 16:42:29 +0200582 WARN_ON(!cfqd->rq_in_driver);
583 cfqd->rq_in_driver--;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700584}
585
Jens Axboeb4878f22005-10-20 16:42:29 +0200586static void cfq_remove_request(struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700587{
Jens Axboe5e705372006-07-13 12:39:25 +0200588 struct cfq_queue *cfqq = RQ_CFQQ(rq);
Jens Axboe21183b02006-07-13 12:33:14 +0200589
Jens Axboe5e705372006-07-13 12:39:25 +0200590 if (cfqq->next_rq == rq)
591 cfqq->next_rq = cfq_find_next_rq(cfqq->cfqd, cfqq, rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700592
Jens Axboeb4878f22005-10-20 16:42:29 +0200593 list_del_init(&rq->queuelist);
Jens Axboe5e705372006-07-13 12:39:25 +0200594 cfq_del_rq_rb(rq);
Jens Axboe374f84a2006-07-23 01:42:19 +0200595
596 if (rq_is_meta(rq)) {
597 WARN_ON(!cfqq->meta_pending);
598 cfqq->meta_pending--;
599 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700600}
601
602static int
603cfq_merge(request_queue_t *q, struct request **req, struct bio *bio)
604{
605 struct cfq_data *cfqd = q->elevator->elevator_data;
606 struct request *__rq;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700607
Jens Axboe206dc692006-03-28 13:03:44 +0200608 __rq = cfq_find_rq_fmerge(cfqd, bio);
Jens Axboe22e2c502005-06-27 10:55:12 +0200609 if (__rq && elv_rq_merge_ok(__rq, bio)) {
Jens Axboe98170642006-07-28 09:23:08 +0200610 *req = __rq;
611 return ELEVATOR_FRONT_MERGE;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700612 }
613
614 return ELEVATOR_NO_MERGE;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700615}
616
Jens Axboe21183b02006-07-13 12:33:14 +0200617static void cfq_merged_request(request_queue_t *q, struct request *req,
618 int type)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700619{
Jens Axboe21183b02006-07-13 12:33:14 +0200620 if (type == ELEVATOR_FRONT_MERGE) {
Jens Axboe5e705372006-07-13 12:39:25 +0200621 struct cfq_queue *cfqq = RQ_CFQQ(req);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700622
Jens Axboe5e705372006-07-13 12:39:25 +0200623 cfq_reposition_rq_rb(cfqq, req);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700624 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700625}
626
627static void
628cfq_merged_requests(request_queue_t *q, struct request *rq,
629 struct request *next)
630{
Jens Axboe22e2c502005-06-27 10:55:12 +0200631 /*
632 * reposition in fifo if next is older than rq
633 */
634 if (!list_empty(&rq->queuelist) && !list_empty(&next->queuelist) &&
635 time_before(next->start_time, rq->start_time))
636 list_move(&rq->queuelist, &next->queuelist);
637
Jens Axboeb4878f22005-10-20 16:42:29 +0200638 cfq_remove_request(next);
Jens Axboe22e2c502005-06-27 10:55:12 +0200639}
640
Jens Axboeda775262006-12-20 11:04:12 +0100641static int cfq_allow_merge(request_queue_t *q, struct request *rq,
642 struct bio *bio)
643{
644 struct cfq_data *cfqd = q->elevator->elevator_data;
645 const int rw = bio_data_dir(bio);
646 struct cfq_queue *cfqq;
647 pid_t key;
648
649 /*
Jens Axboeec8acb62007-01-02 18:32:11 +0100650 * Disallow merge of a sync bio into an async request.
Jens Axboeda775262006-12-20 11:04:12 +0100651 */
Jens Axboeec8acb62007-01-02 18:32:11 +0100652 if ((bio_data_dir(bio) == READ || bio_sync(bio)) && !rq_is_sync(rq))
Jens Axboeda775262006-12-20 11:04:12 +0100653 return 0;
654
655 /*
Jens Axboe719d3402006-12-22 09:38:53 +0100656 * Lookup the cfqq that this bio will be queued with. Allow
657 * merge only if rq is queued there.
Jens Axboeda775262006-12-20 11:04:12 +0100658 */
Jens Axboe719d3402006-12-22 09:38:53 +0100659 key = cfq_queue_pid(current, rw, bio_sync(bio));
Jens Axboeda775262006-12-20 11:04:12 +0100660 cfqq = cfq_find_cfq_hash(cfqd, key, current->ioprio);
Jens Axboe719d3402006-12-22 09:38:53 +0100661
662 if (cfqq == RQ_CFQQ(rq))
663 return 1;
Jens Axboeda775262006-12-20 11:04:12 +0100664
Jens Axboeec8acb62007-01-02 18:32:11 +0100665 return 0;
Jens Axboeda775262006-12-20 11:04:12 +0100666}
667
Jens Axboe22e2c502005-06-27 10:55:12 +0200668static inline void
669__cfq_set_active_queue(struct cfq_data *cfqd, struct cfq_queue *cfqq)
670{
671 if (cfqq) {
672 /*
673 * stop potential idle class queues waiting service
674 */
675 del_timer(&cfqd->idle_class_timer);
676
Jens Axboe22e2c502005-06-27 10:55:12 +0200677 cfqq->slice_end = 0;
Jens Axboe3b181522005-06-27 10:56:24 +0200678 cfq_clear_cfqq_must_alloc_slice(cfqq);
679 cfq_clear_cfqq_fifo_expire(cfqq);
Jens Axboe44f7c162007-01-19 11:51:58 +1100680 cfq_mark_cfqq_slice_new(cfqq);
Jens Axboe22e2c502005-06-27 10:55:12 +0200681 }
682
683 cfqd->active_queue = cfqq;
684}
685
686/*
Jens Axboe7b14e3b2006-02-28 09:35:11 +0100687 * current cfqq expired its slice (or was too idle), select new one
688 */
689static void
690__cfq_slice_expired(struct cfq_data *cfqd, struct cfq_queue *cfqq,
691 int preempted)
692{
Jens Axboe7b14e3b2006-02-28 09:35:11 +0100693 if (cfq_cfqq_wait_request(cfqq))
694 del_timer(&cfqd->idle_slice_timer);
695
Jens Axboe53b037442006-07-28 09:48:51 +0200696 if (!preempted && !cfq_cfqq_dispatched(cfqq))
Jens Axboe7b14e3b2006-02-28 09:35:11 +0100697 cfq_schedule_dispatch(cfqd);
Jens Axboe7b14e3b2006-02-28 09:35:11 +0100698
699 cfq_clear_cfqq_must_dispatch(cfqq);
700 cfq_clear_cfqq_wait_request(cfqq);
Jens Axboe53b037442006-07-28 09:48:51 +0200701 cfq_clear_cfqq_queue_new(cfqq);
Jens Axboe7b14e3b2006-02-28 09:35:11 +0100702
703 /*
704 * store what was left of this slice, if the queue idled out
705 * or was preempted
706 */
Jens Axboec5b680f2007-01-19 11:56:49 +1100707 if (!cfq_cfqq_slice_new(cfqq))
708 cfqq->slice_resid = cfqq->slice_end - jiffies;
Jens Axboe7b14e3b2006-02-28 09:35:11 +0100709
Jens Axboe98e41c72007-02-05 11:55:35 +0100710 cfq_resort_rr_list(cfqq, preempted);
Jens Axboe7b14e3b2006-02-28 09:35:11 +0100711
712 if (cfqq == cfqd->active_queue)
713 cfqd->active_queue = NULL;
714
715 if (cfqd->active_cic) {
716 put_io_context(cfqd->active_cic->ioc);
717 cfqd->active_cic = NULL;
718 }
719
720 cfqd->dispatch_slice = 0;
721}
722
723static inline void cfq_slice_expired(struct cfq_data *cfqd, int preempted)
724{
725 struct cfq_queue *cfqq = cfqd->active_queue;
726
727 if (cfqq)
728 __cfq_slice_expired(cfqd, cfqq, preempted);
729}
730
731/*
Jens Axboe22e2c502005-06-27 10:55:12 +0200732 * 0
733 * 0,1
734 * 0,1,2
735 * 0,1,2,3
736 * 0,1,2,3,4
737 * 0,1,2,3,4,5
738 * 0,1,2,3,4,5,6
739 * 0,1,2,3,4,5,6,7
740 */
741static int cfq_get_next_prio_level(struct cfq_data *cfqd)
742{
743 int prio, wrap;
744
745 prio = -1;
746 wrap = 0;
747 do {
748 int p;
749
750 for (p = cfqd->cur_prio; p <= cfqd->cur_end_prio; p++) {
751 if (!list_empty(&cfqd->rr_list[p])) {
752 prio = p;
753 break;
754 }
755 }
756
757 if (prio != -1)
758 break;
759 cfqd->cur_prio = 0;
760 if (++cfqd->cur_end_prio == CFQ_PRIO_LISTS) {
761 cfqd->cur_end_prio = 0;
762 if (wrap)
763 break;
764 wrap = 1;
765 }
766 } while (1);
767
768 if (unlikely(prio == -1))
769 return -1;
770
771 BUG_ON(prio >= CFQ_PRIO_LISTS);
772
773 list_splice_init(&cfqd->rr_list[prio], &cfqd->cur_rr);
774
775 cfqd->cur_prio = prio + 1;
776 if (cfqd->cur_prio > cfqd->cur_end_prio) {
777 cfqd->cur_end_prio = cfqd->cur_prio;
778 cfqd->cur_prio = 0;
779 }
780 if (cfqd->cur_end_prio == CFQ_PRIO_LISTS) {
781 cfqd->cur_prio = 0;
782 cfqd->cur_end_prio = 0;
783 }
784
785 return prio;
786}
787
Jens Axboe3b181522005-06-27 10:56:24 +0200788static struct cfq_queue *cfq_set_active_queue(struct cfq_data *cfqd)
Jens Axboe22e2c502005-06-27 10:55:12 +0200789{
Jens Axboe7b14e3b2006-02-28 09:35:11 +0100790 struct cfq_queue *cfqq = NULL;
Jens Axboe22e2c502005-06-27 10:55:12 +0200791
Jens Axboe89850f72006-07-22 16:48:31 +0200792 if (!list_empty(&cfqd->cur_rr) || cfq_get_next_prio_level(cfqd) != -1) {
793 /*
794 * if current list is non-empty, grab first entry. if it is
795 * empty, get next prio level and grab first entry then if any
796 * are spliced
797 */
Jens Axboe22e2c502005-06-27 10:55:12 +0200798 cfqq = list_entry_cfqq(cfqd->cur_rr.next);
Jens Axboe89850f72006-07-22 16:48:31 +0200799 } else if (!list_empty(&cfqd->busy_rr)) {
800 /*
801 * If no new queues are available, check if the busy list has
802 * some before falling back to idle io.
803 */
Jens Axboee0de0202006-06-01 10:07:26 +0200804 cfqq = list_entry_cfqq(cfqd->busy_rr.next);
Jens Axboe89850f72006-07-22 16:48:31 +0200805 } else if (!list_empty(&cfqd->idle_rr)) {
806 /*
807 * if we have idle queues and no rt or be queues had pending
808 * requests, either allow immediate service if the grace period
809 * has passed or arm the idle grace timer
810 */
Jens Axboe22e2c502005-06-27 10:55:12 +0200811 unsigned long end = cfqd->last_end_request + CFQ_IDLE_GRACE;
812
813 if (time_after_eq(jiffies, end))
814 cfqq = list_entry_cfqq(cfqd->idle_rr.next);
815 else
816 mod_timer(&cfqd->idle_class_timer, end);
817 }
818
819 __cfq_set_active_queue(cfqd, cfqq);
Jens Axboe3b181522005-06-27 10:56:24 +0200820 return cfqq;
Jens Axboe22e2c502005-06-27 10:55:12 +0200821}
822
Jens Axboecaaa5f92006-06-16 11:23:00 +0200823#define CIC_SEEKY(cic) ((cic)->seek_mean > (128 * 1024))
824
Jens Axboe22e2c502005-06-27 10:55:12 +0200825static int cfq_arm_slice_timer(struct cfq_data *cfqd, struct cfq_queue *cfqq)
826
827{
Jens Axboe206dc692006-03-28 13:03:44 +0200828 struct cfq_io_context *cic;
Jens Axboe7b14e3b2006-02-28 09:35:11 +0100829 unsigned long sl;
830
Jens Axboedd67d052006-06-21 09:36:18 +0200831 WARN_ON(!RB_EMPTY_ROOT(&cfqq->sort_list));
Jens Axboe22e2c502005-06-27 10:55:12 +0200832 WARN_ON(cfqq != cfqd->active_queue);
833
834 /*
835 * idle is disabled, either manually or by past process history
836 */
837 if (!cfqd->cfq_slice_idle)
838 return 0;
Jens Axboe3b181522005-06-27 10:56:24 +0200839 if (!cfq_cfqq_idle_window(cfqq))
Jens Axboe22e2c502005-06-27 10:55:12 +0200840 return 0;
841 /*
842 * task has exited, don't wait
843 */
Jens Axboe206dc692006-03-28 13:03:44 +0200844 cic = cfqd->active_cic;
845 if (!cic || !cic->ioc->task)
Jens Axboe22e2c502005-06-27 10:55:12 +0200846 return 0;
847
Jens Axboe3b181522005-06-27 10:56:24 +0200848 cfq_mark_cfqq_must_dispatch(cfqq);
849 cfq_mark_cfqq_wait_request(cfqq);
Jens Axboe22e2c502005-06-27 10:55:12 +0200850
Jens Axboe7b14e3b2006-02-28 09:35:11 +0100851 sl = min(cfqq->slice_end - 1, (unsigned long) cfqd->cfq_slice_idle);
Jens Axboe206dc692006-03-28 13:03:44 +0200852
853 /*
854 * we don't want to idle for seeks, but we do want to allow
855 * fair distribution of slice time for a process doing back-to-back
856 * seeks. so allow a little bit of time for him to submit a new rq
857 */
Jens Axboecaaa5f92006-06-16 11:23:00 +0200858 if (sample_valid(cic->seek_samples) && CIC_SEEKY(cic))
Jens Axboe44eb1232006-07-25 15:05:21 +0200859 sl = min(sl, msecs_to_jiffies(2));
Jens Axboe206dc692006-03-28 13:03:44 +0200860
Jens Axboe7b14e3b2006-02-28 09:35:11 +0100861 mod_timer(&cfqd->idle_slice_timer, jiffies + sl);
Jens Axboe22e2c502005-06-27 10:55:12 +0200862 return 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700863}
864
Jens Axboe5e705372006-07-13 12:39:25 +0200865static void cfq_dispatch_insert(request_queue_t *q, struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700866{
867 struct cfq_data *cfqd = q->elevator->elevator_data;
Jens Axboe5e705372006-07-13 12:39:25 +0200868 struct cfq_queue *cfqq = RQ_CFQQ(rq);
Jens Axboe22e2c502005-06-27 10:55:12 +0200869
Jens Axboe5380a102006-07-13 12:37:56 +0200870 cfq_remove_request(rq);
871 cfqq->on_dispatch[rq_is_sync(rq)]++;
872 elv_dispatch_sort(q, rq);
Jens Axboefd61af02006-06-16 15:35:39 +0200873
874 rq = list_entry(q->queue_head.prev, struct request, queuelist);
875 cfqd->last_sector = rq->sector + rq->nr_sectors;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700876}
877
878/*
879 * return expired entry, or NULL to just start from scratch in rbtree
880 */
Jens Axboe5e705372006-07-13 12:39:25 +0200881static inline struct request *cfq_check_fifo(struct cfq_queue *cfqq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700882{
883 struct cfq_data *cfqd = cfqq->cfqd;
Jens Axboe22e2c502005-06-27 10:55:12 +0200884 struct request *rq;
Jens Axboe89850f72006-07-22 16:48:31 +0200885 int fifo;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700886
Jens Axboe3b181522005-06-27 10:56:24 +0200887 if (cfq_cfqq_fifo_expire(cfqq))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700888 return NULL;
Jens Axboe89850f72006-07-22 16:48:31 +0200889 if (list_empty(&cfqq->fifo))
890 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700891
Jens Axboe89850f72006-07-22 16:48:31 +0200892 fifo = cfq_cfqq_class_sync(cfqq);
893 rq = rq_entry_fifo(cfqq->fifo.next);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700894
Jens Axboe89850f72006-07-22 16:48:31 +0200895 if (time_after(jiffies, rq->start_time + cfqd->cfq_fifo_expire[fifo])) {
896 cfq_mark_cfqq_fifo_expire(cfqq);
897 return rq;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700898 }
899
900 return NULL;
901}
902
Jens Axboe22e2c502005-06-27 10:55:12 +0200903static inline int
904cfq_prio_to_maxrq(struct cfq_data *cfqd, struct cfq_queue *cfqq)
905{
906 const int base_rq = cfqd->cfq_slice_async_rq;
907
908 WARN_ON(cfqq->ioprio >= IOPRIO_BE_NR);
909
910 return 2 * (base_rq + base_rq * (CFQ_PRIO_LISTS - 1 - cfqq->ioprio));
911}
912
913/*
914 * get next queue for service
915 */
Tejun Heo1b5ed5e12005-11-10 08:49:19 +0100916static struct cfq_queue *cfq_select_queue(struct cfq_data *cfqd)
Jens Axboe22e2c502005-06-27 10:55:12 +0200917{
Jens Axboe22e2c502005-06-27 10:55:12 +0200918 struct cfq_queue *cfqq;
919
920 cfqq = cfqd->active_queue;
921 if (!cfqq)
922 goto new_queue;
923
924 /*
925 * slice has expired
926 */
Jens Axboe44f7c162007-01-19 11:51:58 +1100927 if (!cfq_cfqq_must_dispatch(cfqq) && cfq_slice_used(cfqq))
Jens Axboe3b181522005-06-27 10:56:24 +0200928 goto expire;
Jens Axboe22e2c502005-06-27 10:55:12 +0200929
930 /*
931 * if queue has requests, dispatch one. if not, check if
932 * enough slice is left to wait for one
933 */
Jens Axboedd67d052006-06-21 09:36:18 +0200934 if (!RB_EMPTY_ROOT(&cfqq->sort_list))
Jens Axboe22e2c502005-06-27 10:55:12 +0200935 goto keep_queue;
Jens Axboe44f7c162007-01-19 11:51:58 +1100936 else if (cfq_cfqq_slice_new(cfqq) || cfq_cfqq_dispatched(cfqq)) {
Jens Axboecaaa5f92006-06-16 11:23:00 +0200937 cfqq = NULL;
938 goto keep_queue;
939 } else if (cfq_cfqq_class_sync(cfqq)) {
Jens Axboe22e2c502005-06-27 10:55:12 +0200940 if (cfq_arm_slice_timer(cfqd, cfqq))
941 return NULL;
942 }
943
Jens Axboe3b181522005-06-27 10:56:24 +0200944expire:
Jens Axboe22e2c502005-06-27 10:55:12 +0200945 cfq_slice_expired(cfqd, 0);
Jens Axboe3b181522005-06-27 10:56:24 +0200946new_queue:
947 cfqq = cfq_set_active_queue(cfqd);
Jens Axboe22e2c502005-06-27 10:55:12 +0200948keep_queue:
Jens Axboe3b181522005-06-27 10:56:24 +0200949 return cfqq;
Jens Axboe22e2c502005-06-27 10:55:12 +0200950}
951
952static int
953__cfq_dispatch_requests(struct cfq_data *cfqd, struct cfq_queue *cfqq,
954 int max_dispatch)
955{
956 int dispatched = 0;
957
Jens Axboedd67d052006-06-21 09:36:18 +0200958 BUG_ON(RB_EMPTY_ROOT(&cfqq->sort_list));
Jens Axboe22e2c502005-06-27 10:55:12 +0200959
960 do {
Jens Axboe5e705372006-07-13 12:39:25 +0200961 struct request *rq;
Jens Axboe22e2c502005-06-27 10:55:12 +0200962
963 /*
964 * follow expired path, else get first next available
965 */
Jens Axboe5e705372006-07-13 12:39:25 +0200966 if ((rq = cfq_check_fifo(cfqq)) == NULL)
967 rq = cfqq->next_rq;
Jens Axboe22e2c502005-06-27 10:55:12 +0200968
969 /*
970 * finally, insert request into driver dispatch list
971 */
Jens Axboe5e705372006-07-13 12:39:25 +0200972 cfq_dispatch_insert(cfqd->queue, rq);
Jens Axboe22e2c502005-06-27 10:55:12 +0200973
974 cfqd->dispatch_slice++;
975 dispatched++;
976
977 if (!cfqd->active_cic) {
Jens Axboe5e705372006-07-13 12:39:25 +0200978 atomic_inc(&RQ_CIC(rq)->ioc->refcount);
979 cfqd->active_cic = RQ_CIC(rq);
Jens Axboe22e2c502005-06-27 10:55:12 +0200980 }
981
Jens Axboedd67d052006-06-21 09:36:18 +0200982 if (RB_EMPTY_ROOT(&cfqq->sort_list))
Jens Axboe22e2c502005-06-27 10:55:12 +0200983 break;
984
985 } while (dispatched < max_dispatch);
986
987 /*
Jens Axboe22e2c502005-06-27 10:55:12 +0200988 * expire an async queue immediately if it has used up its slice. idle
989 * queue always expire after 1 dispatch round.
990 */
991 if ((!cfq_cfqq_sync(cfqq) &&
992 cfqd->dispatch_slice >= cfq_prio_to_maxrq(cfqd, cfqq)) ||
Jens Axboe44f7c162007-01-19 11:51:58 +1100993 cfq_class_idle(cfqq)) {
994 cfqq->slice_end = jiffies + 1;
Jens Axboe22e2c502005-06-27 10:55:12 +0200995 cfq_slice_expired(cfqd, 0);
Jens Axboe44f7c162007-01-19 11:51:58 +1100996 }
Jens Axboe22e2c502005-06-27 10:55:12 +0200997
998 return dispatched;
999}
1000
1001static int
Tejun Heo1b5ed5e12005-11-10 08:49:19 +01001002cfq_forced_dispatch_cfqqs(struct list_head *list)
1003{
Tejun Heo1b5ed5e12005-11-10 08:49:19 +01001004 struct cfq_queue *cfqq, *next;
Jens Axboecaaa5f92006-06-16 11:23:00 +02001005 int dispatched;
Tejun Heo1b5ed5e12005-11-10 08:49:19 +01001006
Jens Axboecaaa5f92006-06-16 11:23:00 +02001007 dispatched = 0;
Tejun Heo1b5ed5e12005-11-10 08:49:19 +01001008 list_for_each_entry_safe(cfqq, next, list, cfq_list) {
Jens Axboe5e705372006-07-13 12:39:25 +02001009 while (cfqq->next_rq) {
1010 cfq_dispatch_insert(cfqq->cfqd->queue, cfqq->next_rq);
Tejun Heo1b5ed5e12005-11-10 08:49:19 +01001011 dispatched++;
1012 }
1013 BUG_ON(!list_empty(&cfqq->fifo));
1014 }
Jens Axboecaaa5f92006-06-16 11:23:00 +02001015
Tejun Heo1b5ed5e12005-11-10 08:49:19 +01001016 return dispatched;
1017}
1018
1019static int
1020cfq_forced_dispatch(struct cfq_data *cfqd)
1021{
1022 int i, dispatched = 0;
1023
1024 for (i = 0; i < CFQ_PRIO_LISTS; i++)
1025 dispatched += cfq_forced_dispatch_cfqqs(&cfqd->rr_list[i]);
1026
1027 dispatched += cfq_forced_dispatch_cfqqs(&cfqd->busy_rr);
1028 dispatched += cfq_forced_dispatch_cfqqs(&cfqd->cur_rr);
1029 dispatched += cfq_forced_dispatch_cfqqs(&cfqd->idle_rr);
1030
1031 cfq_slice_expired(cfqd, 0);
1032
1033 BUG_ON(cfqd->busy_queues);
1034
1035 return dispatched;
1036}
1037
1038static int
Jens Axboeb4878f22005-10-20 16:42:29 +02001039cfq_dispatch_requests(request_queue_t *q, int force)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001040{
1041 struct cfq_data *cfqd = q->elevator->elevator_data;
Jens Axboecaaa5f92006-06-16 11:23:00 +02001042 struct cfq_queue *cfqq, *prev_cfqq;
1043 int dispatched;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001044
Jens Axboe22e2c502005-06-27 10:55:12 +02001045 if (!cfqd->busy_queues)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001046 return 0;
1047
Tejun Heo1b5ed5e12005-11-10 08:49:19 +01001048 if (unlikely(force))
1049 return cfq_forced_dispatch(cfqd);
1050
Jens Axboecaaa5f92006-06-16 11:23:00 +02001051 dispatched = 0;
1052 prev_cfqq = NULL;
1053 while ((cfqq = cfq_select_queue(cfqd)) != NULL) {
Jens Axboeb4878f22005-10-20 16:42:29 +02001054 int max_dispatch;
1055
Jens Axboecaaa5f92006-06-16 11:23:00 +02001056 /*
1057 * Don't repeat dispatch from the previous queue.
1058 */
1059 if (prev_cfqq == cfqq)
1060 break;
1061
Jens Axboe3b181522005-06-27 10:56:24 +02001062 cfq_clear_cfqq_must_dispatch(cfqq);
1063 cfq_clear_cfqq_wait_request(cfqq);
Jens Axboe22e2c502005-06-27 10:55:12 +02001064 del_timer(&cfqd->idle_slice_timer);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001065
Tejun Heo1b5ed5e12005-11-10 08:49:19 +01001066 max_dispatch = cfqd->cfq_quantum;
1067 if (cfq_class_idle(cfqq))
1068 max_dispatch = 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001069
Jens Axboecaaa5f92006-06-16 11:23:00 +02001070 dispatched += __cfq_dispatch_requests(cfqd, cfqq, max_dispatch);
1071
1072 /*
1073 * If the dispatch cfqq has idling enabled and is still
1074 * the active queue, break out.
1075 */
1076 if (cfq_cfqq_idle_window(cfqq) && cfqd->active_queue)
1077 break;
1078
1079 prev_cfqq = cfqq;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001080 }
1081
Jens Axboecaaa5f92006-06-16 11:23:00 +02001082 return dispatched;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001083}
1084
Linus Torvalds1da177e2005-04-16 15:20:36 -07001085/*
Jens Axboe5e705372006-07-13 12:39:25 +02001086 * task holds one reference to the queue, dropped when task exits. each rq
1087 * in-flight on this queue also holds a reference, dropped when rq is freed.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001088 *
1089 * queue lock must be held here.
1090 */
1091static void cfq_put_queue(struct cfq_queue *cfqq)
1092{
Jens Axboe22e2c502005-06-27 10:55:12 +02001093 struct cfq_data *cfqd = cfqq->cfqd;
1094
1095 BUG_ON(atomic_read(&cfqq->ref) <= 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001096
1097 if (!atomic_dec_and_test(&cfqq->ref))
1098 return;
1099
1100 BUG_ON(rb_first(&cfqq->sort_list));
Jens Axboe22e2c502005-06-27 10:55:12 +02001101 BUG_ON(cfqq->allocated[READ] + cfqq->allocated[WRITE]);
Jens Axboe3b181522005-06-27 10:56:24 +02001102 BUG_ON(cfq_cfqq_on_rr(cfqq));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001103
Jens Axboe7b14e3b2006-02-28 09:35:11 +01001104 if (unlikely(cfqd->active_queue == cfqq))
Jens Axboe3b181522005-06-27 10:56:24 +02001105 __cfq_slice_expired(cfqd, cfqq, 0);
Jens Axboe22e2c502005-06-27 10:55:12 +02001106
Linus Torvalds1da177e2005-04-16 15:20:36 -07001107 /*
1108 * it's on the empty list and still hashed
1109 */
1110 list_del(&cfqq->cfq_list);
1111 hlist_del(&cfqq->cfq_hash);
1112 kmem_cache_free(cfq_pool, cfqq);
1113}
1114
Jens Axboe1ea25ecb2006-07-18 22:24:11 +02001115static struct cfq_queue *
Jens Axboe3b181522005-06-27 10:56:24 +02001116__cfq_find_cfq_hash(struct cfq_data *cfqd, unsigned int key, unsigned int prio,
1117 const int hashval)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001118{
1119 struct hlist_head *hash_list = &cfqd->cfq_hash[hashval];
Jens Axboe206dc692006-03-28 13:03:44 +02001120 struct hlist_node *entry;
1121 struct cfq_queue *__cfqq;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001122
Jens Axboe206dc692006-03-28 13:03:44 +02001123 hlist_for_each_entry(__cfqq, entry, hash_list, cfq_hash) {
Al Virob0a69162006-03-14 15:32:50 -05001124 const unsigned short __p = IOPRIO_PRIO_VALUE(__cfqq->org_ioprio_class, __cfqq->org_ioprio);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001125
Jens Axboe206dc692006-03-28 13:03:44 +02001126 if (__cfqq->key == key && (__p == prio || !prio))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001127 return __cfqq;
1128 }
1129
1130 return NULL;
1131}
1132
1133static struct cfq_queue *
Jens Axboe3b181522005-06-27 10:56:24 +02001134cfq_find_cfq_hash(struct cfq_data *cfqd, unsigned int key, unsigned short prio)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001135{
Jens Axboe3b181522005-06-27 10:56:24 +02001136 return __cfq_find_cfq_hash(cfqd, key, prio, hash_long(key, CFQ_QHASH_SHIFT));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001137}
1138
Jens Axboee2d74ac2006-03-28 08:59:01 +02001139static void cfq_free_io_context(struct io_context *ioc)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001140{
Jens Axboe22e2c502005-06-27 10:55:12 +02001141 struct cfq_io_context *__cic;
Jens Axboee2d74ac2006-03-28 08:59:01 +02001142 struct rb_node *n;
1143 int freed = 0;
Jens Axboe22e2c502005-06-27 10:55:12 +02001144
Jens Axboee2d74ac2006-03-28 08:59:01 +02001145 while ((n = rb_first(&ioc->cic_root)) != NULL) {
1146 __cic = rb_entry(n, struct cfq_io_context, rb_node);
1147 rb_erase(&__cic->rb_node, &ioc->cic_root);
Jens Axboe22e2c502005-06-27 10:55:12 +02001148 kmem_cache_free(cfq_ioc_pool, __cic);
Al Viro334e94d2006-03-18 15:05:53 -05001149 freed++;
Jens Axboe22e2c502005-06-27 10:55:12 +02001150 }
1151
Jens Axboe4050cf12006-07-19 05:07:12 +02001152 elv_ioc_count_mod(ioc_count, -freed);
1153
1154 if (ioc_gone && !elv_ioc_count_read(ioc_count))
Al Viro334e94d2006-03-18 15:05:53 -05001155 complete(ioc_gone);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001156}
1157
Jens Axboe89850f72006-07-22 16:48:31 +02001158static void cfq_exit_cfqq(struct cfq_data *cfqd, struct cfq_queue *cfqq)
1159{
1160 if (unlikely(cfqq == cfqd->active_queue))
1161 __cfq_slice_expired(cfqd, cfqq, 0);
1162
1163 cfq_put_queue(cfqq);
1164}
1165
1166static void __cfq_exit_single_io_context(struct cfq_data *cfqd,
1167 struct cfq_io_context *cic)
1168{
Jens Axboefc463792006-08-29 09:05:44 +02001169 list_del_init(&cic->queue_list);
1170 smp_wmb();
1171 cic->key = NULL;
1172
Jens Axboe89850f72006-07-22 16:48:31 +02001173 if (cic->cfqq[ASYNC]) {
1174 cfq_exit_cfqq(cfqd, cic->cfqq[ASYNC]);
1175 cic->cfqq[ASYNC] = NULL;
1176 }
1177
1178 if (cic->cfqq[SYNC]) {
1179 cfq_exit_cfqq(cfqd, cic->cfqq[SYNC]);
1180 cic->cfqq[SYNC] = NULL;
1181 }
Jens Axboe89850f72006-07-22 16:48:31 +02001182}
1183
1184
Linus Torvalds1da177e2005-04-16 15:20:36 -07001185/*
Jens Axboe22e2c502005-06-27 10:55:12 +02001186 * Called with interrupts disabled
1187 */
1188static void cfq_exit_single_io_context(struct cfq_io_context *cic)
1189{
Al Viro478a82b2006-03-18 13:25:24 -05001190 struct cfq_data *cfqd = cic->key;
Jens Axboe22e2c502005-06-27 10:55:12 +02001191
Jens Axboe89850f72006-07-22 16:48:31 +02001192 if (cfqd) {
1193 request_queue_t *q = cfqd->queue;
Jens Axboe22e2c502005-06-27 10:55:12 +02001194
Jens Axboefc463792006-08-29 09:05:44 +02001195 spin_lock_irq(q->queue_lock);
Jens Axboe89850f72006-07-22 16:48:31 +02001196 __cfq_exit_single_io_context(cfqd, cic);
Jens Axboefc463792006-08-29 09:05:44 +02001197 spin_unlock_irq(q->queue_lock);
Al Viro12a05732006-03-18 13:38:01 -05001198 }
Jens Axboe22e2c502005-06-27 10:55:12 +02001199}
1200
Jens Axboee2d74ac2006-03-28 08:59:01 +02001201static void cfq_exit_io_context(struct io_context *ioc)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001202{
Jens Axboe22e2c502005-06-27 10:55:12 +02001203 struct cfq_io_context *__cic;
Jens Axboee2d74ac2006-03-28 08:59:01 +02001204 struct rb_node *n;
Jens Axboe22e2c502005-06-27 10:55:12 +02001205
Linus Torvalds1da177e2005-04-16 15:20:36 -07001206 /*
1207 * put the reference this task is holding to the various queues
1208 */
Jens Axboee2d74ac2006-03-28 08:59:01 +02001209
1210 n = rb_first(&ioc->cic_root);
1211 while (n != NULL) {
1212 __cic = rb_entry(n, struct cfq_io_context, rb_node);
1213
Jens Axboe22e2c502005-06-27 10:55:12 +02001214 cfq_exit_single_io_context(__cic);
Jens Axboee2d74ac2006-03-28 08:59:01 +02001215 n = rb_next(n);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001216 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001217}
1218
Jens Axboe22e2c502005-06-27 10:55:12 +02001219static struct cfq_io_context *
Al Viro8267e262005-10-21 03:20:53 -04001220cfq_alloc_io_context(struct cfq_data *cfqd, gfp_t gfp_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001221{
Jens Axboeb5deef92006-07-19 23:39:40 +02001222 struct cfq_io_context *cic;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001223
Jens Axboeb5deef92006-07-19 23:39:40 +02001224 cic = kmem_cache_alloc_node(cfq_ioc_pool, gfp_mask, cfqd->queue->node);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001225 if (cic) {
Jens Axboe553698f2006-06-14 19:11:57 +02001226 memset(cic, 0, sizeof(*cic));
Jens Axboe22e2c502005-06-27 10:55:12 +02001227 cic->last_end_request = jiffies;
Jens Axboe553698f2006-06-14 19:11:57 +02001228 INIT_LIST_HEAD(&cic->queue_list);
Jens Axboe22e2c502005-06-27 10:55:12 +02001229 cic->dtor = cfq_free_io_context;
1230 cic->exit = cfq_exit_io_context;
Jens Axboe4050cf12006-07-19 05:07:12 +02001231 elv_ioc_count_inc(ioc_count);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001232 }
1233
1234 return cic;
1235}
1236
Jens Axboe22e2c502005-06-27 10:55:12 +02001237static void cfq_init_prio_data(struct cfq_queue *cfqq)
1238{
1239 struct task_struct *tsk = current;
1240 int ioprio_class;
1241
Jens Axboe3b181522005-06-27 10:56:24 +02001242 if (!cfq_cfqq_prio_changed(cfqq))
Jens Axboe22e2c502005-06-27 10:55:12 +02001243 return;
1244
1245 ioprio_class = IOPRIO_PRIO_CLASS(tsk->ioprio);
1246 switch (ioprio_class) {
1247 default:
1248 printk(KERN_ERR "cfq: bad prio %x\n", ioprio_class);
1249 case IOPRIO_CLASS_NONE:
1250 /*
1251 * no prio set, place us in the middle of the BE classes
1252 */
1253 cfqq->ioprio = task_nice_ioprio(tsk);
1254 cfqq->ioprio_class = IOPRIO_CLASS_BE;
1255 break;
1256 case IOPRIO_CLASS_RT:
1257 cfqq->ioprio = task_ioprio(tsk);
1258 cfqq->ioprio_class = IOPRIO_CLASS_RT;
1259 break;
1260 case IOPRIO_CLASS_BE:
1261 cfqq->ioprio = task_ioprio(tsk);
1262 cfqq->ioprio_class = IOPRIO_CLASS_BE;
1263 break;
1264 case IOPRIO_CLASS_IDLE:
1265 cfqq->ioprio_class = IOPRIO_CLASS_IDLE;
1266 cfqq->ioprio = 7;
Jens Axboe3b181522005-06-27 10:56:24 +02001267 cfq_clear_cfqq_idle_window(cfqq);
Jens Axboe22e2c502005-06-27 10:55:12 +02001268 break;
1269 }
1270
1271 /*
1272 * keep track of original prio settings in case we have to temporarily
1273 * elevate the priority of this queue
1274 */
1275 cfqq->org_ioprio = cfqq->ioprio;
1276 cfqq->org_ioprio_class = cfqq->ioprio_class;
1277
Jens Axboe98e41c72007-02-05 11:55:35 +01001278 cfq_resort_rr_list(cfqq, 0);
Jens Axboe3b181522005-06-27 10:56:24 +02001279 cfq_clear_cfqq_prio_changed(cfqq);
Jens Axboe22e2c502005-06-27 10:55:12 +02001280}
1281
Al Viro478a82b2006-03-18 13:25:24 -05001282static inline void changed_ioprio(struct cfq_io_context *cic)
Jens Axboe22e2c502005-06-27 10:55:12 +02001283{
Al Viro478a82b2006-03-18 13:25:24 -05001284 struct cfq_data *cfqd = cic->key;
1285 struct cfq_queue *cfqq;
Jens Axboec1b707d2006-10-30 19:54:23 +01001286 unsigned long flags;
Jens Axboe35e60772006-06-14 09:10:45 +02001287
Jens Axboecaaa5f92006-06-16 11:23:00 +02001288 if (unlikely(!cfqd))
1289 return;
1290
Jens Axboec1b707d2006-10-30 19:54:23 +01001291 spin_lock_irqsave(cfqd->queue->queue_lock, flags);
Jens Axboecaaa5f92006-06-16 11:23:00 +02001292
1293 cfqq = cic->cfqq[ASYNC];
1294 if (cfqq) {
1295 struct cfq_queue *new_cfqq;
1296 new_cfqq = cfq_get_queue(cfqd, CFQ_KEY_ASYNC, cic->ioc->task,
1297 GFP_ATOMIC);
1298 if (new_cfqq) {
1299 cic->cfqq[ASYNC] = new_cfqq;
1300 cfq_put_queue(cfqq);
1301 }
Jens Axboe22e2c502005-06-27 10:55:12 +02001302 }
Jens Axboecaaa5f92006-06-16 11:23:00 +02001303
1304 cfqq = cic->cfqq[SYNC];
1305 if (cfqq)
1306 cfq_mark_cfqq_prio_changed(cfqq);
1307
Jens Axboec1b707d2006-10-30 19:54:23 +01001308 spin_unlock_irqrestore(cfqd->queue->queue_lock, flags);
Jens Axboe22e2c502005-06-27 10:55:12 +02001309}
1310
Jens Axboefc463792006-08-29 09:05:44 +02001311static void cfq_ioc_set_ioprio(struct io_context *ioc)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001312{
Al Viroa6a07632006-03-18 13:26:44 -05001313 struct cfq_io_context *cic;
Jens Axboee2d74ac2006-03-28 08:59:01 +02001314 struct rb_node *n;
Al Viroa6a07632006-03-18 13:26:44 -05001315
Jens Axboefc463792006-08-29 09:05:44 +02001316 ioc->ioprio_changed = 0;
Al Viroa6a07632006-03-18 13:26:44 -05001317
Jens Axboee2d74ac2006-03-28 08:59:01 +02001318 n = rb_first(&ioc->cic_root);
1319 while (n != NULL) {
1320 cic = rb_entry(n, struct cfq_io_context, rb_node);
Jens Axboe3793c652006-05-30 21:11:04 +02001321
Al Viro478a82b2006-03-18 13:25:24 -05001322 changed_ioprio(cic);
Jens Axboee2d74ac2006-03-28 08:59:01 +02001323 n = rb_next(n);
1324 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001325}
1326
1327static struct cfq_queue *
Al Viro6f325a12006-03-18 14:58:37 -05001328cfq_get_queue(struct cfq_data *cfqd, unsigned int key, struct task_struct *tsk,
Al Viro8267e262005-10-21 03:20:53 -04001329 gfp_t gfp_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001330{
1331 const int hashval = hash_long(key, CFQ_QHASH_SHIFT);
1332 struct cfq_queue *cfqq, *new_cfqq = NULL;
Al Viro6f325a12006-03-18 14:58:37 -05001333 unsigned short ioprio;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001334
1335retry:
Al Viro6f325a12006-03-18 14:58:37 -05001336 ioprio = tsk->ioprio;
Jens Axboe3b181522005-06-27 10:56:24 +02001337 cfqq = __cfq_find_cfq_hash(cfqd, key, ioprio, hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001338
1339 if (!cfqq) {
1340 if (new_cfqq) {
1341 cfqq = new_cfqq;
1342 new_cfqq = NULL;
Jens Axboe22e2c502005-06-27 10:55:12 +02001343 } else if (gfp_mask & __GFP_WAIT) {
Jens Axboe89850f72006-07-22 16:48:31 +02001344 /*
1345 * Inform the allocator of the fact that we will
1346 * just repeat this allocation if it fails, to allow
1347 * the allocator to do whatever it needs to attempt to
1348 * free memory.
1349 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001350 spin_unlock_irq(cfqd->queue->queue_lock);
Jens Axboeb5deef92006-07-19 23:39:40 +02001351 new_cfqq = kmem_cache_alloc_node(cfq_pool, gfp_mask|__GFP_NOFAIL, cfqd->queue->node);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001352 spin_lock_irq(cfqd->queue->queue_lock);
1353 goto retry;
Jens Axboe22e2c502005-06-27 10:55:12 +02001354 } else {
Jens Axboeb5deef92006-07-19 23:39:40 +02001355 cfqq = kmem_cache_alloc_node(cfq_pool, gfp_mask, cfqd->queue->node);
Jens Axboe22e2c502005-06-27 10:55:12 +02001356 if (!cfqq)
1357 goto out;
Kiyoshi Ueda db3b5842005-06-17 16:15:10 +02001358 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001359
1360 memset(cfqq, 0, sizeof(*cfqq));
1361
1362 INIT_HLIST_NODE(&cfqq->cfq_hash);
1363 INIT_LIST_HEAD(&cfqq->cfq_list);
Jens Axboe22e2c502005-06-27 10:55:12 +02001364 INIT_LIST_HEAD(&cfqq->fifo);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001365
1366 cfqq->key = key;
1367 hlist_add_head(&cfqq->cfq_hash, &cfqd->cfq_hash[hashval]);
1368 atomic_set(&cfqq->ref, 0);
1369 cfqq->cfqd = cfqd;
Jens Axboec5b680f2007-01-19 11:56:49 +11001370
Jens Axboecaaa5f92006-06-16 11:23:00 +02001371 cfq_mark_cfqq_idle_window(cfqq);
Jens Axboe3b181522005-06-27 10:56:24 +02001372 cfq_mark_cfqq_prio_changed(cfqq);
Jens Axboe53b037442006-07-28 09:48:51 +02001373 cfq_mark_cfqq_queue_new(cfqq);
Jens Axboe3b181522005-06-27 10:56:24 +02001374 cfq_init_prio_data(cfqq);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001375 }
1376
1377 if (new_cfqq)
1378 kmem_cache_free(cfq_pool, new_cfqq);
1379
1380 atomic_inc(&cfqq->ref);
1381out:
1382 WARN_ON((gfp_mask & __GFP_WAIT) && !cfqq);
1383 return cfqq;
1384}
1385
OGAWA Hirofumidbecf3a2006-04-18 09:45:18 +02001386static void
1387cfq_drop_dead_cic(struct io_context *ioc, struct cfq_io_context *cic)
1388{
Jens Axboefc463792006-08-29 09:05:44 +02001389 WARN_ON(!list_empty(&cic->queue_list));
OGAWA Hirofumidbecf3a2006-04-18 09:45:18 +02001390 rb_erase(&cic->rb_node, &ioc->cic_root);
OGAWA Hirofumidbecf3a2006-04-18 09:45:18 +02001391 kmem_cache_free(cfq_ioc_pool, cic);
Jens Axboe4050cf12006-07-19 05:07:12 +02001392 elv_ioc_count_dec(ioc_count);
OGAWA Hirofumidbecf3a2006-04-18 09:45:18 +02001393}
1394
Jens Axboee2d74ac2006-03-28 08:59:01 +02001395static struct cfq_io_context *
1396cfq_cic_rb_lookup(struct cfq_data *cfqd, struct io_context *ioc)
1397{
OGAWA Hirofumidbecf3a2006-04-18 09:45:18 +02001398 struct rb_node *n;
Jens Axboee2d74ac2006-03-28 08:59:01 +02001399 struct cfq_io_context *cic;
OGAWA Hirofumibe3b0752006-04-18 19:18:31 +02001400 void *k, *key = cfqd;
Jens Axboee2d74ac2006-03-28 08:59:01 +02001401
OGAWA Hirofumidbecf3a2006-04-18 09:45:18 +02001402restart:
1403 n = ioc->cic_root.rb_node;
Jens Axboee2d74ac2006-03-28 08:59:01 +02001404 while (n) {
1405 cic = rb_entry(n, struct cfq_io_context, rb_node);
OGAWA Hirofumibe3b0752006-04-18 19:18:31 +02001406 /* ->key must be copied to avoid race with cfq_exit_queue() */
1407 k = cic->key;
1408 if (unlikely(!k)) {
OGAWA Hirofumidbecf3a2006-04-18 09:45:18 +02001409 cfq_drop_dead_cic(ioc, cic);
1410 goto restart;
1411 }
Jens Axboee2d74ac2006-03-28 08:59:01 +02001412
OGAWA Hirofumibe3b0752006-04-18 19:18:31 +02001413 if (key < k)
Jens Axboee2d74ac2006-03-28 08:59:01 +02001414 n = n->rb_left;
OGAWA Hirofumibe3b0752006-04-18 19:18:31 +02001415 else if (key > k)
Jens Axboee2d74ac2006-03-28 08:59:01 +02001416 n = n->rb_right;
1417 else
1418 return cic;
1419 }
1420
1421 return NULL;
1422}
1423
1424static inline void
1425cfq_cic_link(struct cfq_data *cfqd, struct io_context *ioc,
1426 struct cfq_io_context *cic)
1427{
OGAWA Hirofumidbecf3a2006-04-18 09:45:18 +02001428 struct rb_node **p;
1429 struct rb_node *parent;
Jens Axboee2d74ac2006-03-28 08:59:01 +02001430 struct cfq_io_context *__cic;
Jens Axboe0261d682006-10-30 19:07:48 +01001431 unsigned long flags;
OGAWA Hirofumibe3b0752006-04-18 19:18:31 +02001432 void *k;
Jens Axboee2d74ac2006-03-28 08:59:01 +02001433
Jens Axboee2d74ac2006-03-28 08:59:01 +02001434 cic->ioc = ioc;
1435 cic->key = cfqd;
1436
OGAWA Hirofumidbecf3a2006-04-18 09:45:18 +02001437restart:
1438 parent = NULL;
1439 p = &ioc->cic_root.rb_node;
Jens Axboee2d74ac2006-03-28 08:59:01 +02001440 while (*p) {
1441 parent = *p;
1442 __cic = rb_entry(parent, struct cfq_io_context, rb_node);
OGAWA Hirofumibe3b0752006-04-18 19:18:31 +02001443 /* ->key must be copied to avoid race with cfq_exit_queue() */
1444 k = __cic->key;
1445 if (unlikely(!k)) {
Oleg Nesterovbe33c3a2006-08-21 08:36:12 +02001446 cfq_drop_dead_cic(ioc, __cic);
OGAWA Hirofumidbecf3a2006-04-18 09:45:18 +02001447 goto restart;
1448 }
Jens Axboee2d74ac2006-03-28 08:59:01 +02001449
OGAWA Hirofumibe3b0752006-04-18 19:18:31 +02001450 if (cic->key < k)
Jens Axboee2d74ac2006-03-28 08:59:01 +02001451 p = &(*p)->rb_left;
OGAWA Hirofumibe3b0752006-04-18 19:18:31 +02001452 else if (cic->key > k)
Jens Axboee2d74ac2006-03-28 08:59:01 +02001453 p = &(*p)->rb_right;
1454 else
1455 BUG();
1456 }
1457
1458 rb_link_node(&cic->rb_node, parent, p);
1459 rb_insert_color(&cic->rb_node, &ioc->cic_root);
Jens Axboefc463792006-08-29 09:05:44 +02001460
Jens Axboe0261d682006-10-30 19:07:48 +01001461 spin_lock_irqsave(cfqd->queue->queue_lock, flags);
Jens Axboee2d74ac2006-03-28 08:59:01 +02001462 list_add(&cic->queue_list, &cfqd->cic_list);
Jens Axboe0261d682006-10-30 19:07:48 +01001463 spin_unlock_irqrestore(cfqd->queue->queue_lock, flags);
Jens Axboee2d74ac2006-03-28 08:59:01 +02001464}
1465
Jens Axboe22e2c502005-06-27 10:55:12 +02001466/*
1467 * Setup general io context and cfq io context. There can be several cfq
1468 * io contexts per general io context, if this process is doing io to more
Jens Axboee2d74ac2006-03-28 08:59:01 +02001469 * than one device managed by cfq.
Jens Axboe22e2c502005-06-27 10:55:12 +02001470 */
1471static struct cfq_io_context *
Jens Axboee2d74ac2006-03-28 08:59:01 +02001472cfq_get_io_context(struct cfq_data *cfqd, gfp_t gfp_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001473{
Jens Axboe22e2c502005-06-27 10:55:12 +02001474 struct io_context *ioc = NULL;
1475 struct cfq_io_context *cic;
1476
1477 might_sleep_if(gfp_mask & __GFP_WAIT);
1478
Jens Axboeb5deef92006-07-19 23:39:40 +02001479 ioc = get_io_context(gfp_mask, cfqd->queue->node);
Jens Axboe22e2c502005-06-27 10:55:12 +02001480 if (!ioc)
1481 return NULL;
1482
Jens Axboee2d74ac2006-03-28 08:59:01 +02001483 cic = cfq_cic_rb_lookup(cfqd, ioc);
1484 if (cic)
1485 goto out;
Jens Axboe22e2c502005-06-27 10:55:12 +02001486
Jens Axboee2d74ac2006-03-28 08:59:01 +02001487 cic = cfq_alloc_io_context(cfqd, gfp_mask);
1488 if (cic == NULL)
1489 goto err;
Jens Axboe22e2c502005-06-27 10:55:12 +02001490
Jens Axboee2d74ac2006-03-28 08:59:01 +02001491 cfq_cic_link(cfqd, ioc, cic);
Jens Axboe22e2c502005-06-27 10:55:12 +02001492out:
Jens Axboefc463792006-08-29 09:05:44 +02001493 smp_read_barrier_depends();
1494 if (unlikely(ioc->ioprio_changed))
1495 cfq_ioc_set_ioprio(ioc);
1496
Jens Axboe22e2c502005-06-27 10:55:12 +02001497 return cic;
1498err:
1499 put_io_context(ioc);
1500 return NULL;
1501}
1502
1503static void
1504cfq_update_io_thinktime(struct cfq_data *cfqd, struct cfq_io_context *cic)
1505{
Jens Axboeaaf12282007-01-19 11:30:16 +11001506 unsigned long elapsed = jiffies - cic->last_end_request;
1507 unsigned long ttime = min(elapsed, 2UL * cfqd->cfq_slice_idle);
Jens Axboe22e2c502005-06-27 10:55:12 +02001508
1509 cic->ttime_samples = (7*cic->ttime_samples + 256) / 8;
1510 cic->ttime_total = (7*cic->ttime_total + 256*ttime) / 8;
1511 cic->ttime_mean = (cic->ttime_total + 128) / cic->ttime_samples;
1512}
1513
Jens Axboe206dc692006-03-28 13:03:44 +02001514static void
Jens Axboebb37b942006-12-01 10:42:33 +01001515cfq_update_io_seektime(struct cfq_io_context *cic, struct request *rq)
Jens Axboe206dc692006-03-28 13:03:44 +02001516{
1517 sector_t sdist;
1518 u64 total;
1519
Jens Axboe5e705372006-07-13 12:39:25 +02001520 if (cic->last_request_pos < rq->sector)
1521 sdist = rq->sector - cic->last_request_pos;
Jens Axboe206dc692006-03-28 13:03:44 +02001522 else
Jens Axboe5e705372006-07-13 12:39:25 +02001523 sdist = cic->last_request_pos - rq->sector;
Jens Axboe206dc692006-03-28 13:03:44 +02001524
1525 /*
1526 * Don't allow the seek distance to get too large from the
1527 * odd fragment, pagein, etc
1528 */
1529 if (cic->seek_samples <= 60) /* second&third seek */
1530 sdist = min(sdist, (cic->seek_mean * 4) + 2*1024*1024);
1531 else
1532 sdist = min(sdist, (cic->seek_mean * 4) + 2*1024*64);
1533
1534 cic->seek_samples = (7*cic->seek_samples + 256) / 8;
1535 cic->seek_total = (7*cic->seek_total + (u64)256*sdist) / 8;
1536 total = cic->seek_total + (cic->seek_samples/2);
1537 do_div(total, cic->seek_samples);
1538 cic->seek_mean = (sector_t)total;
1539}
Jens Axboe22e2c502005-06-27 10:55:12 +02001540
1541/*
1542 * Disable idle window if the process thinks too long or seeks so much that
1543 * it doesn't matter
1544 */
1545static void
1546cfq_update_idle_window(struct cfq_data *cfqd, struct cfq_queue *cfqq,
1547 struct cfq_io_context *cic)
1548{
Jens Axboe3b181522005-06-27 10:56:24 +02001549 int enable_idle = cfq_cfqq_idle_window(cfqq);
Jens Axboe22e2c502005-06-27 10:55:12 +02001550
Jens Axboecaaa5f92006-06-16 11:23:00 +02001551 if (!cic->ioc->task || !cfqd->cfq_slice_idle ||
1552 (cfqd->hw_tag && CIC_SEEKY(cic)))
Jens Axboe22e2c502005-06-27 10:55:12 +02001553 enable_idle = 0;
1554 else if (sample_valid(cic->ttime_samples)) {
1555 if (cic->ttime_mean > cfqd->cfq_slice_idle)
1556 enable_idle = 0;
1557 else
1558 enable_idle = 1;
1559 }
1560
Jens Axboe3b181522005-06-27 10:56:24 +02001561 if (enable_idle)
1562 cfq_mark_cfqq_idle_window(cfqq);
1563 else
1564 cfq_clear_cfqq_idle_window(cfqq);
Jens Axboe22e2c502005-06-27 10:55:12 +02001565}
1566
1567
1568/*
1569 * Check if new_cfqq should preempt the currently active queue. Return 0 for
1570 * no or if we aren't sure, a 1 will cause a preempt.
1571 */
1572static int
1573cfq_should_preempt(struct cfq_data *cfqd, struct cfq_queue *new_cfqq,
Jens Axboe5e705372006-07-13 12:39:25 +02001574 struct request *rq)
Jens Axboe22e2c502005-06-27 10:55:12 +02001575{
1576 struct cfq_queue *cfqq = cfqd->active_queue;
1577
1578 if (cfq_class_idle(new_cfqq))
1579 return 0;
1580
1581 if (!cfqq)
Jens Axboecaaa5f92006-06-16 11:23:00 +02001582 return 0;
Jens Axboe22e2c502005-06-27 10:55:12 +02001583
1584 if (cfq_class_idle(cfqq))
1585 return 1;
Jens Axboe3b181522005-06-27 10:56:24 +02001586 if (!cfq_cfqq_wait_request(new_cfqq))
Jens Axboe22e2c502005-06-27 10:55:12 +02001587 return 0;
1588 /*
Jens Axboe374f84a2006-07-23 01:42:19 +02001589 * if the new request is sync, but the currently running queue is
1590 * not, let the sync request have priority.
1591 */
Jens Axboe5e705372006-07-13 12:39:25 +02001592 if (rq_is_sync(rq) && !cfq_cfqq_sync(cfqq))
Jens Axboe22e2c502005-06-27 10:55:12 +02001593 return 1;
Jens Axboe374f84a2006-07-23 01:42:19 +02001594 /*
1595 * So both queues are sync. Let the new request get disk time if
1596 * it's a metadata request and the current queue is doing regular IO.
1597 */
1598 if (rq_is_meta(rq) && !cfqq->meta_pending)
1599 return 1;
Jens Axboe22e2c502005-06-27 10:55:12 +02001600
1601 return 0;
1602}
1603
1604/*
1605 * cfqq preempts the active queue. if we allowed preempt with no slice left,
1606 * let it have half of its nominal slice.
1607 */
1608static void cfq_preempt_queue(struct cfq_data *cfqd, struct cfq_queue *cfqq)
1609{
Jens Axboebf572252006-07-19 20:29:12 +02001610 cfq_slice_expired(cfqd, 1);
Jens Axboe22e2c502005-06-27 10:55:12 +02001611
Jens Axboebf572252006-07-19 20:29:12 +02001612 /*
1613 * Put the new queue at the front of the of the current list,
1614 * so we know that it will be selected next.
1615 */
1616 BUG_ON(!cfq_cfqq_on_rr(cfqq));
1617 list_move(&cfqq->cfq_list, &cfqd->cur_rr);
1618
Jens Axboe44f7c162007-01-19 11:51:58 +11001619 cfqq->slice_end = 0;
1620 cfq_mark_cfqq_slice_new(cfqq);
Jens Axboe22e2c502005-06-27 10:55:12 +02001621}
1622
1623/*
Jens Axboe5e705372006-07-13 12:39:25 +02001624 * Called when a new fs request (rq) is added (to cfqq). Check if there's
Jens Axboe22e2c502005-06-27 10:55:12 +02001625 * something we should do about it
1626 */
1627static void
Jens Axboe5e705372006-07-13 12:39:25 +02001628cfq_rq_enqueued(struct cfq_data *cfqd, struct cfq_queue *cfqq,
1629 struct request *rq)
Jens Axboe22e2c502005-06-27 10:55:12 +02001630{
Jens Axboe5e705372006-07-13 12:39:25 +02001631 struct cfq_io_context *cic = RQ_CIC(rq);
Jens Axboe12e9fdd2006-06-01 10:09:56 +02001632
Jens Axboe374f84a2006-07-23 01:42:19 +02001633 if (rq_is_meta(rq))
1634 cfqq->meta_pending++;
1635
Jens Axboe9c2c38a2005-08-24 14:57:54 +02001636 /*
Jens Axboe5380a102006-07-13 12:37:56 +02001637 * check if this request is a better next-serve candidate)) {
Jens Axboe21183b02006-07-13 12:33:14 +02001638 */
Jens Axboe5e705372006-07-13 12:39:25 +02001639 cfqq->next_rq = cfq_choose_req(cfqd, cfqq->next_rq, rq);
1640 BUG_ON(!cfqq->next_rq);
Jens Axboe21183b02006-07-13 12:33:14 +02001641
1642 /*
Jens Axboe9c2c38a2005-08-24 14:57:54 +02001643 * we never wait for an async request and we don't allow preemption
1644 * of an async request. so just return early
1645 */
Jens Axboe5e705372006-07-13 12:39:25 +02001646 if (!rq_is_sync(rq)) {
Jens Axboe12e9fdd2006-06-01 10:09:56 +02001647 /*
1648 * sync process issued an async request, if it's waiting
1649 * then expire it and kick rq handling.
1650 */
1651 if (cic == cfqd->active_cic &&
1652 del_timer(&cfqd->idle_slice_timer)) {
1653 cfq_slice_expired(cfqd, 0);
Jens Axboedc72ef42006-07-20 14:54:05 +02001654 blk_start_queueing(cfqd->queue);
Jens Axboe12e9fdd2006-06-01 10:09:56 +02001655 }
Jens Axboe9c2c38a2005-08-24 14:57:54 +02001656 return;
Jens Axboe12e9fdd2006-06-01 10:09:56 +02001657 }
Jens Axboe22e2c502005-06-27 10:55:12 +02001658
Jens Axboe9c2c38a2005-08-24 14:57:54 +02001659 cfq_update_io_thinktime(cfqd, cic);
Jens Axboebb37b942006-12-01 10:42:33 +01001660 cfq_update_io_seektime(cic, rq);
Jens Axboe9c2c38a2005-08-24 14:57:54 +02001661 cfq_update_idle_window(cfqd, cfqq, cic);
1662
Jens Axboe5e705372006-07-13 12:39:25 +02001663 cic->last_request_pos = rq->sector + rq->nr_sectors;
Jens Axboe22e2c502005-06-27 10:55:12 +02001664
1665 if (cfqq == cfqd->active_queue) {
1666 /*
1667 * if we are waiting for a request for this queue, let it rip
1668 * immediately and flag that we must not expire this queue
1669 * just now
1670 */
Jens Axboe3b181522005-06-27 10:56:24 +02001671 if (cfq_cfqq_wait_request(cfqq)) {
1672 cfq_mark_cfqq_must_dispatch(cfqq);
Jens Axboe22e2c502005-06-27 10:55:12 +02001673 del_timer(&cfqd->idle_slice_timer);
Jens Axboedc72ef42006-07-20 14:54:05 +02001674 blk_start_queueing(cfqd->queue);
Jens Axboe22e2c502005-06-27 10:55:12 +02001675 }
Jens Axboe5e705372006-07-13 12:39:25 +02001676 } else if (cfq_should_preempt(cfqd, cfqq, rq)) {
Jens Axboe22e2c502005-06-27 10:55:12 +02001677 /*
1678 * not the active queue - expire current slice if it is
1679 * idle and has expired it's mean thinktime or this new queue
1680 * has some old slice time left and is of higher priority
1681 */
1682 cfq_preempt_queue(cfqd, cfqq);
Jens Axboe3b181522005-06-27 10:56:24 +02001683 cfq_mark_cfqq_must_dispatch(cfqq);
Jens Axboedc72ef42006-07-20 14:54:05 +02001684 blk_start_queueing(cfqd->queue);
Jens Axboe22e2c502005-06-27 10:55:12 +02001685 }
1686}
1687
Jens Axboeb4878f22005-10-20 16:42:29 +02001688static void cfq_insert_request(request_queue_t *q, struct request *rq)
Jens Axboe22e2c502005-06-27 10:55:12 +02001689{
Jens Axboeb4878f22005-10-20 16:42:29 +02001690 struct cfq_data *cfqd = q->elevator->elevator_data;
Jens Axboe5e705372006-07-13 12:39:25 +02001691 struct cfq_queue *cfqq = RQ_CFQQ(rq);
Jens Axboe22e2c502005-06-27 10:55:12 +02001692
1693 cfq_init_prio_data(cfqq);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001694
Jens Axboe5e705372006-07-13 12:39:25 +02001695 cfq_add_rq_rb(rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001696
Jens Axboe22e2c502005-06-27 10:55:12 +02001697 list_add_tail(&rq->queuelist, &cfqq->fifo);
1698
Jens Axboe5e705372006-07-13 12:39:25 +02001699 cfq_rq_enqueued(cfqd, cfqq, rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001700}
1701
Linus Torvalds1da177e2005-04-16 15:20:36 -07001702static void cfq_completed_request(request_queue_t *q, struct request *rq)
1703{
Jens Axboe5e705372006-07-13 12:39:25 +02001704 struct cfq_queue *cfqq = RQ_CFQQ(rq);
Jens Axboeb4878f22005-10-20 16:42:29 +02001705 struct cfq_data *cfqd = cfqq->cfqd;
Jens Axboe5380a102006-07-13 12:37:56 +02001706 const int sync = rq_is_sync(rq);
Jens Axboeb4878f22005-10-20 16:42:29 +02001707 unsigned long now;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001708
Jens Axboeb4878f22005-10-20 16:42:29 +02001709 now = jiffies;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001710
Jens Axboeb4878f22005-10-20 16:42:29 +02001711 WARN_ON(!cfqd->rq_in_driver);
1712 WARN_ON(!cfqq->on_dispatch[sync]);
1713 cfqd->rq_in_driver--;
1714 cfqq->on_dispatch[sync]--;
Jens Axboe99f96282007-02-05 11:56:25 +01001715 cfqq->service_last = now;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001716
Jens Axboeb4878f22005-10-20 16:42:29 +02001717 if (!cfq_class_idle(cfqq))
1718 cfqd->last_end_request = now;
Jens Axboe3b181522005-06-27 10:56:24 +02001719
Jens Axboe98e41c72007-02-05 11:55:35 +01001720 cfq_resort_rr_list(cfqq, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001721
Jens Axboecaaa5f92006-06-16 11:23:00 +02001722 if (sync)
Jens Axboe5e705372006-07-13 12:39:25 +02001723 RQ_CIC(rq)->last_end_request = now;
Jens Axboecaaa5f92006-06-16 11:23:00 +02001724
1725 /*
1726 * If this is the active queue, check if it needs to be expired,
1727 * or if we want to idle in case it has no pending requests.
1728 */
1729 if (cfqd->active_queue == cfqq) {
Jens Axboe44f7c162007-01-19 11:51:58 +11001730 if (cfq_cfqq_slice_new(cfqq)) {
1731 cfq_set_prio_slice(cfqd, cfqq);
1732 cfq_clear_cfqq_slice_new(cfqq);
1733 }
1734 if (cfq_slice_used(cfqq))
Jens Axboecaaa5f92006-06-16 11:23:00 +02001735 cfq_slice_expired(cfqd, 0);
Jens Axboedd67d052006-06-21 09:36:18 +02001736 else if (sync && RB_EMPTY_ROOT(&cfqq->sort_list)) {
Jens Axboecaaa5f92006-06-16 11:23:00 +02001737 if (!cfq_arm_slice_timer(cfqd, cfqq))
1738 cfq_schedule_dispatch(cfqd);
1739 }
1740 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001741}
1742
Jens Axboe22e2c502005-06-27 10:55:12 +02001743/*
1744 * we temporarily boost lower priority queues if they are holding fs exclusive
1745 * resources. they are boosted to normal prio (CLASS_BE/4)
1746 */
1747static void cfq_prio_boost(struct cfq_queue *cfqq)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001748{
Jens Axboe22e2c502005-06-27 10:55:12 +02001749 const int ioprio_class = cfqq->ioprio_class;
1750 const int ioprio = cfqq->ioprio;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001751
Jens Axboe22e2c502005-06-27 10:55:12 +02001752 if (has_fs_excl()) {
1753 /*
1754 * boost idle prio on transactions that would lock out other
1755 * users of the filesystem
1756 */
1757 if (cfq_class_idle(cfqq))
1758 cfqq->ioprio_class = IOPRIO_CLASS_BE;
1759 if (cfqq->ioprio > IOPRIO_NORM)
1760 cfqq->ioprio = IOPRIO_NORM;
1761 } else {
1762 /*
1763 * check if we need to unboost the queue
1764 */
1765 if (cfqq->ioprio_class != cfqq->org_ioprio_class)
1766 cfqq->ioprio_class = cfqq->org_ioprio_class;
1767 if (cfqq->ioprio != cfqq->org_ioprio)
1768 cfqq->ioprio = cfqq->org_ioprio;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001769 }
1770
Jens Axboe22e2c502005-06-27 10:55:12 +02001771 /*
1772 * refile between round-robin lists if we moved the priority class
1773 */
Jens Axboe98e41c72007-02-05 11:55:35 +01001774 if ((ioprio_class != cfqq->ioprio_class || ioprio != cfqq->ioprio))
Jens Axboe22e2c502005-06-27 10:55:12 +02001775 cfq_resort_rr_list(cfqq, 0);
1776}
1777
Jens Axboe89850f72006-07-22 16:48:31 +02001778static inline int __cfq_may_queue(struct cfq_queue *cfqq)
Jens Axboe22e2c502005-06-27 10:55:12 +02001779{
Jens Axboe3b181522005-06-27 10:56:24 +02001780 if ((cfq_cfqq_wait_request(cfqq) || cfq_cfqq_must_alloc(cfqq)) &&
Andrew Morton99f95e52005-06-27 20:14:05 -07001781 !cfq_cfqq_must_alloc_slice(cfqq)) {
Jens Axboe3b181522005-06-27 10:56:24 +02001782 cfq_mark_cfqq_must_alloc_slice(cfqq);
Jens Axboe22e2c502005-06-27 10:55:12 +02001783 return ELV_MQUEUE_MUST;
Jens Axboe3b181522005-06-27 10:56:24 +02001784 }
Jens Axboe22e2c502005-06-27 10:55:12 +02001785
1786 return ELV_MQUEUE_MAY;
Jens Axboe22e2c502005-06-27 10:55:12 +02001787}
1788
Jens Axboecb78b282006-07-28 09:32:57 +02001789static int cfq_may_queue(request_queue_t *q, int rw)
Jens Axboe22e2c502005-06-27 10:55:12 +02001790{
1791 struct cfq_data *cfqd = q->elevator->elevator_data;
1792 struct task_struct *tsk = current;
1793 struct cfq_queue *cfqq;
Jens Axboe7749a8d2006-12-13 13:02:26 +01001794 unsigned int key;
1795
1796 key = cfq_queue_pid(tsk, rw, rw & REQ_RW_SYNC);
Jens Axboe22e2c502005-06-27 10:55:12 +02001797
1798 /*
1799 * don't force setup of a queue from here, as a call to may_queue
1800 * does not necessarily imply that a request actually will be queued.
1801 * so just lookup a possibly existing queue, or return 'may queue'
1802 * if that fails
1803 */
Jens Axboe7749a8d2006-12-13 13:02:26 +01001804 cfqq = cfq_find_cfq_hash(cfqd, key, tsk->ioprio);
Jens Axboe22e2c502005-06-27 10:55:12 +02001805 if (cfqq) {
1806 cfq_init_prio_data(cfqq);
1807 cfq_prio_boost(cfqq);
1808
Jens Axboe89850f72006-07-22 16:48:31 +02001809 return __cfq_may_queue(cfqq);
Jens Axboe22e2c502005-06-27 10:55:12 +02001810 }
1811
1812 return ELV_MQUEUE_MAY;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001813}
1814
Linus Torvalds1da177e2005-04-16 15:20:36 -07001815/*
1816 * queue lock held here
1817 */
Jens Axboebb37b942006-12-01 10:42:33 +01001818static void cfq_put_request(struct request *rq)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001819{
Jens Axboe5e705372006-07-13 12:39:25 +02001820 struct cfq_queue *cfqq = RQ_CFQQ(rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001821
Jens Axboe5e705372006-07-13 12:39:25 +02001822 if (cfqq) {
Jens Axboe22e2c502005-06-27 10:55:12 +02001823 const int rw = rq_data_dir(rq);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001824
Jens Axboe22e2c502005-06-27 10:55:12 +02001825 BUG_ON(!cfqq->allocated[rw]);
1826 cfqq->allocated[rw]--;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001827
Jens Axboe5e705372006-07-13 12:39:25 +02001828 put_io_context(RQ_CIC(rq)->ioc);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001829
Linus Torvalds1da177e2005-04-16 15:20:36 -07001830 rq->elevator_private = NULL;
Jens Axboe5e705372006-07-13 12:39:25 +02001831 rq->elevator_private2 = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001832
Linus Torvalds1da177e2005-04-16 15:20:36 -07001833 cfq_put_queue(cfqq);
1834 }
1835}
1836
1837/*
Jens Axboe22e2c502005-06-27 10:55:12 +02001838 * Allocate cfq data structures associated with this request.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001839 */
Jens Axboe22e2c502005-06-27 10:55:12 +02001840static int
Jens Axboecb78b282006-07-28 09:32:57 +02001841cfq_set_request(request_queue_t *q, struct request *rq, gfp_t gfp_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001842{
1843 struct cfq_data *cfqd = q->elevator->elevator_data;
Jens Axboe3b181522005-06-27 10:56:24 +02001844 struct task_struct *tsk = current;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001845 struct cfq_io_context *cic;
1846 const int rw = rq_data_dir(rq);
Jens Axboe7749a8d2006-12-13 13:02:26 +01001847 const int is_sync = rq_is_sync(rq);
1848 pid_t key = cfq_queue_pid(tsk, rw, is_sync);
Jens Axboe22e2c502005-06-27 10:55:12 +02001849 struct cfq_queue *cfqq;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001850 unsigned long flags;
1851
1852 might_sleep_if(gfp_mask & __GFP_WAIT);
1853
Jens Axboee2d74ac2006-03-28 08:59:01 +02001854 cic = cfq_get_io_context(cfqd, gfp_mask);
Jens Axboe22e2c502005-06-27 10:55:12 +02001855
Linus Torvalds1da177e2005-04-16 15:20:36 -07001856 spin_lock_irqsave(q->queue_lock, flags);
1857
Jens Axboe22e2c502005-06-27 10:55:12 +02001858 if (!cic)
1859 goto queue_fail;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001860
Al Viro12a05732006-03-18 13:38:01 -05001861 if (!cic->cfqq[is_sync]) {
Al Viro6f325a12006-03-18 14:58:37 -05001862 cfqq = cfq_get_queue(cfqd, key, tsk, gfp_mask);
Jens Axboe22e2c502005-06-27 10:55:12 +02001863 if (!cfqq)
1864 goto queue_fail;
1865
Al Viro12a05732006-03-18 13:38:01 -05001866 cic->cfqq[is_sync] = cfqq;
Jens Axboe22e2c502005-06-27 10:55:12 +02001867 } else
Al Viro12a05732006-03-18 13:38:01 -05001868 cfqq = cic->cfqq[is_sync];
Linus Torvalds1da177e2005-04-16 15:20:36 -07001869
1870 cfqq->allocated[rw]++;
Jens Axboe3b181522005-06-27 10:56:24 +02001871 cfq_clear_cfqq_must_alloc(cfqq);
Jens Axboe22e2c502005-06-27 10:55:12 +02001872 atomic_inc(&cfqq->ref);
Jens Axboe5e705372006-07-13 12:39:25 +02001873
Linus Torvalds1da177e2005-04-16 15:20:36 -07001874 spin_unlock_irqrestore(q->queue_lock, flags);
1875
Jens Axboe5e705372006-07-13 12:39:25 +02001876 rq->elevator_private = cic;
1877 rq->elevator_private2 = cfqq;
1878 return 0;
Jens Axboe3b181522005-06-27 10:56:24 +02001879
Jens Axboe22e2c502005-06-27 10:55:12 +02001880queue_fail:
1881 if (cic)
1882 put_io_context(cic->ioc);
Jens Axboe89850f72006-07-22 16:48:31 +02001883
Jens Axboe3b181522005-06-27 10:56:24 +02001884 cfq_schedule_dispatch(cfqd);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001885 spin_unlock_irqrestore(q->queue_lock, flags);
1886 return 1;
1887}
1888
David Howells65f27f32006-11-22 14:55:48 +00001889static void cfq_kick_queue(struct work_struct *work)
Jens Axboe22e2c502005-06-27 10:55:12 +02001890{
David Howells65f27f32006-11-22 14:55:48 +00001891 struct cfq_data *cfqd =
1892 container_of(work, struct cfq_data, unplug_work);
1893 request_queue_t *q = cfqd->queue;
Jens Axboe22e2c502005-06-27 10:55:12 +02001894 unsigned long flags;
1895
1896 spin_lock_irqsave(q->queue_lock, flags);
Jens Axboedc72ef42006-07-20 14:54:05 +02001897 blk_start_queueing(q);
Jens Axboe22e2c502005-06-27 10:55:12 +02001898 spin_unlock_irqrestore(q->queue_lock, flags);
1899}
1900
1901/*
1902 * Timer running if the active_queue is currently idling inside its time slice
1903 */
1904static void cfq_idle_slice_timer(unsigned long data)
1905{
1906 struct cfq_data *cfqd = (struct cfq_data *) data;
1907 struct cfq_queue *cfqq;
1908 unsigned long flags;
1909
1910 spin_lock_irqsave(cfqd->queue->queue_lock, flags);
1911
1912 if ((cfqq = cfqd->active_queue) != NULL) {
Jens Axboe22e2c502005-06-27 10:55:12 +02001913 /*
1914 * expired
1915 */
Jens Axboe44f7c162007-01-19 11:51:58 +11001916 if (cfq_slice_used(cfqq))
Jens Axboe22e2c502005-06-27 10:55:12 +02001917 goto expire;
1918
1919 /*
1920 * only expire and reinvoke request handler, if there are
1921 * other queues with pending requests
1922 */
Jens Axboecaaa5f92006-06-16 11:23:00 +02001923 if (!cfqd->busy_queues)
Jens Axboe22e2c502005-06-27 10:55:12 +02001924 goto out_cont;
Jens Axboe22e2c502005-06-27 10:55:12 +02001925
1926 /*
1927 * not expired and it has a request pending, let it dispatch
1928 */
Jens Axboedd67d052006-06-21 09:36:18 +02001929 if (!RB_EMPTY_ROOT(&cfqq->sort_list)) {
Jens Axboe3b181522005-06-27 10:56:24 +02001930 cfq_mark_cfqq_must_dispatch(cfqq);
Jens Axboe22e2c502005-06-27 10:55:12 +02001931 goto out_kick;
1932 }
1933 }
1934expire:
1935 cfq_slice_expired(cfqd, 0);
1936out_kick:
Jens Axboe3b181522005-06-27 10:56:24 +02001937 cfq_schedule_dispatch(cfqd);
Jens Axboe22e2c502005-06-27 10:55:12 +02001938out_cont:
1939 spin_unlock_irqrestore(cfqd->queue->queue_lock, flags);
1940}
1941
1942/*
1943 * Timer running if an idle class queue is waiting for service
1944 */
1945static void cfq_idle_class_timer(unsigned long data)
1946{
1947 struct cfq_data *cfqd = (struct cfq_data *) data;
1948 unsigned long flags, end;
1949
1950 spin_lock_irqsave(cfqd->queue->queue_lock, flags);
1951
1952 /*
1953 * race with a non-idle queue, reset timer
1954 */
1955 end = cfqd->last_end_request + CFQ_IDLE_GRACE;
Jens Axboeae818a32006-06-01 10:13:43 +02001956 if (!time_after_eq(jiffies, end))
1957 mod_timer(&cfqd->idle_class_timer, end);
1958 else
Jens Axboe3b181522005-06-27 10:56:24 +02001959 cfq_schedule_dispatch(cfqd);
Jens Axboe22e2c502005-06-27 10:55:12 +02001960
1961 spin_unlock_irqrestore(cfqd->queue->queue_lock, flags);
1962}
1963
Jens Axboe3b181522005-06-27 10:56:24 +02001964static void cfq_shutdown_timer_wq(struct cfq_data *cfqd)
1965{
1966 del_timer_sync(&cfqd->idle_slice_timer);
1967 del_timer_sync(&cfqd->idle_class_timer);
1968 blk_sync_queue(cfqd->queue);
1969}
Jens Axboe22e2c502005-06-27 10:55:12 +02001970
Linus Torvalds1da177e2005-04-16 15:20:36 -07001971static void cfq_exit_queue(elevator_t *e)
1972{
Jens Axboe22e2c502005-06-27 10:55:12 +02001973 struct cfq_data *cfqd = e->elevator_data;
Al Virod9ff4182006-03-18 13:51:22 -05001974 request_queue_t *q = cfqd->queue;
Jens Axboe22e2c502005-06-27 10:55:12 +02001975
Jens Axboe3b181522005-06-27 10:56:24 +02001976 cfq_shutdown_timer_wq(cfqd);
Jens Axboee2d74ac2006-03-28 08:59:01 +02001977
Al Virod9ff4182006-03-18 13:51:22 -05001978 spin_lock_irq(q->queue_lock);
Jens Axboee2d74ac2006-03-28 08:59:01 +02001979
Al Virod9ff4182006-03-18 13:51:22 -05001980 if (cfqd->active_queue)
1981 __cfq_slice_expired(cfqd, cfqd->active_queue, 0);
Jens Axboee2d74ac2006-03-28 08:59:01 +02001982
1983 while (!list_empty(&cfqd->cic_list)) {
Al Virod9ff4182006-03-18 13:51:22 -05001984 struct cfq_io_context *cic = list_entry(cfqd->cic_list.next,
1985 struct cfq_io_context,
1986 queue_list);
Jens Axboe89850f72006-07-22 16:48:31 +02001987
1988 __cfq_exit_single_io_context(cfqd, cic);
Al Virod9ff4182006-03-18 13:51:22 -05001989 }
Jens Axboee2d74ac2006-03-28 08:59:01 +02001990
Al Virod9ff4182006-03-18 13:51:22 -05001991 spin_unlock_irq(q->queue_lock);
Al Viroa90d7422006-03-18 12:05:37 -05001992
1993 cfq_shutdown_timer_wq(cfqd);
1994
Al Viroa90d7422006-03-18 12:05:37 -05001995 kfree(cfqd->cfq_hash);
1996 kfree(cfqd);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001997}
1998
Jens Axboebb37b942006-12-01 10:42:33 +01001999static void *cfq_init_queue(request_queue_t *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002000{
2001 struct cfq_data *cfqd;
2002 int i;
2003
Jens Axboeb5deef92006-07-19 23:39:40 +02002004 cfqd = kmalloc_node(sizeof(*cfqd), GFP_KERNEL, q->node);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002005 if (!cfqd)
Jens Axboebc1c1162006-06-08 08:49:06 +02002006 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002007
2008 memset(cfqd, 0, sizeof(*cfqd));
Jens Axboe22e2c502005-06-27 10:55:12 +02002009
2010 for (i = 0; i < CFQ_PRIO_LISTS; i++)
2011 INIT_LIST_HEAD(&cfqd->rr_list[i]);
2012
2013 INIT_LIST_HEAD(&cfqd->busy_rr);
2014 INIT_LIST_HEAD(&cfqd->cur_rr);
2015 INIT_LIST_HEAD(&cfqd->idle_rr);
Al Virod9ff4182006-03-18 13:51:22 -05002016 INIT_LIST_HEAD(&cfqd->cic_list);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002017
Jens Axboeb5deef92006-07-19 23:39:40 +02002018 cfqd->cfq_hash = kmalloc_node(sizeof(struct hlist_head) * CFQ_QHASH_ENTRIES, GFP_KERNEL, q->node);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002019 if (!cfqd->cfq_hash)
Jens Axboe5e705372006-07-13 12:39:25 +02002020 goto out_free;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002021
Linus Torvalds1da177e2005-04-16 15:20:36 -07002022 for (i = 0; i < CFQ_QHASH_ENTRIES; i++)
2023 INIT_HLIST_HEAD(&cfqd->cfq_hash[i]);
2024
Linus Torvalds1da177e2005-04-16 15:20:36 -07002025 cfqd->queue = q;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002026
Jens Axboe22e2c502005-06-27 10:55:12 +02002027 init_timer(&cfqd->idle_slice_timer);
2028 cfqd->idle_slice_timer.function = cfq_idle_slice_timer;
2029 cfqd->idle_slice_timer.data = (unsigned long) cfqd;
2030
2031 init_timer(&cfqd->idle_class_timer);
2032 cfqd->idle_class_timer.function = cfq_idle_class_timer;
2033 cfqd->idle_class_timer.data = (unsigned long) cfqd;
2034
David Howells65f27f32006-11-22 14:55:48 +00002035 INIT_WORK(&cfqd->unplug_work, cfq_kick_queue);
Jens Axboe22e2c502005-06-27 10:55:12 +02002036
Linus Torvalds1da177e2005-04-16 15:20:36 -07002037 cfqd->cfq_quantum = cfq_quantum;
Jens Axboe22e2c502005-06-27 10:55:12 +02002038 cfqd->cfq_fifo_expire[0] = cfq_fifo_expire[0];
2039 cfqd->cfq_fifo_expire[1] = cfq_fifo_expire[1];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002040 cfqd->cfq_back_max = cfq_back_max;
2041 cfqd->cfq_back_penalty = cfq_back_penalty;
Jens Axboe22e2c502005-06-27 10:55:12 +02002042 cfqd->cfq_slice[0] = cfq_slice_async;
2043 cfqd->cfq_slice[1] = cfq_slice_sync;
2044 cfqd->cfq_slice_async_rq = cfq_slice_async_rq;
2045 cfqd->cfq_slice_idle = cfq_slice_idle;
Jens Axboe3b181522005-06-27 10:56:24 +02002046
Jens Axboebc1c1162006-06-08 08:49:06 +02002047 return cfqd;
Jens Axboe5e705372006-07-13 12:39:25 +02002048out_free:
Linus Torvalds1da177e2005-04-16 15:20:36 -07002049 kfree(cfqd);
Jens Axboebc1c1162006-06-08 08:49:06 +02002050 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002051}
2052
2053static void cfq_slab_kill(void)
2054{
Linus Torvalds1da177e2005-04-16 15:20:36 -07002055 if (cfq_pool)
2056 kmem_cache_destroy(cfq_pool);
2057 if (cfq_ioc_pool)
2058 kmem_cache_destroy(cfq_ioc_pool);
2059}
2060
2061static int __init cfq_slab_setup(void)
2062{
Linus Torvalds1da177e2005-04-16 15:20:36 -07002063 cfq_pool = kmem_cache_create("cfq_pool", sizeof(struct cfq_queue), 0, 0,
2064 NULL, NULL);
2065 if (!cfq_pool)
2066 goto fail;
2067
2068 cfq_ioc_pool = kmem_cache_create("cfq_ioc_pool",
2069 sizeof(struct cfq_io_context), 0, 0, NULL, NULL);
2070 if (!cfq_ioc_pool)
2071 goto fail;
2072
2073 return 0;
2074fail:
2075 cfq_slab_kill();
2076 return -ENOMEM;
2077}
2078
Linus Torvalds1da177e2005-04-16 15:20:36 -07002079/*
2080 * sysfs parts below -->
2081 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07002082
2083static ssize_t
2084cfq_var_show(unsigned int var, char *page)
2085{
2086 return sprintf(page, "%d\n", var);
2087}
2088
2089static ssize_t
2090cfq_var_store(unsigned int *var, const char *page, size_t count)
2091{
2092 char *p = (char *) page;
2093
2094 *var = simple_strtoul(p, &p, 10);
2095 return count;
2096}
2097
Linus Torvalds1da177e2005-04-16 15:20:36 -07002098#define SHOW_FUNCTION(__FUNC, __VAR, __CONV) \
Al Viro3d1ab402006-03-18 18:35:43 -05002099static ssize_t __FUNC(elevator_t *e, char *page) \
Linus Torvalds1da177e2005-04-16 15:20:36 -07002100{ \
Al Viro3d1ab402006-03-18 18:35:43 -05002101 struct cfq_data *cfqd = e->elevator_data; \
Linus Torvalds1da177e2005-04-16 15:20:36 -07002102 unsigned int __data = __VAR; \
2103 if (__CONV) \
2104 __data = jiffies_to_msecs(__data); \
2105 return cfq_var_show(__data, (page)); \
2106}
2107SHOW_FUNCTION(cfq_quantum_show, cfqd->cfq_quantum, 0);
Jens Axboe22e2c502005-06-27 10:55:12 +02002108SHOW_FUNCTION(cfq_fifo_expire_sync_show, cfqd->cfq_fifo_expire[1], 1);
2109SHOW_FUNCTION(cfq_fifo_expire_async_show, cfqd->cfq_fifo_expire[0], 1);
Al Viroe572ec72006-03-18 22:27:18 -05002110SHOW_FUNCTION(cfq_back_seek_max_show, cfqd->cfq_back_max, 0);
2111SHOW_FUNCTION(cfq_back_seek_penalty_show, cfqd->cfq_back_penalty, 0);
Jens Axboe22e2c502005-06-27 10:55:12 +02002112SHOW_FUNCTION(cfq_slice_idle_show, cfqd->cfq_slice_idle, 1);
2113SHOW_FUNCTION(cfq_slice_sync_show, cfqd->cfq_slice[1], 1);
2114SHOW_FUNCTION(cfq_slice_async_show, cfqd->cfq_slice[0], 1);
2115SHOW_FUNCTION(cfq_slice_async_rq_show, cfqd->cfq_slice_async_rq, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002116#undef SHOW_FUNCTION
2117
2118#define STORE_FUNCTION(__FUNC, __PTR, MIN, MAX, __CONV) \
Al Viro3d1ab402006-03-18 18:35:43 -05002119static ssize_t __FUNC(elevator_t *e, const char *page, size_t count) \
Linus Torvalds1da177e2005-04-16 15:20:36 -07002120{ \
Al Viro3d1ab402006-03-18 18:35:43 -05002121 struct cfq_data *cfqd = e->elevator_data; \
Linus Torvalds1da177e2005-04-16 15:20:36 -07002122 unsigned int __data; \
2123 int ret = cfq_var_store(&__data, (page), count); \
2124 if (__data < (MIN)) \
2125 __data = (MIN); \
2126 else if (__data > (MAX)) \
2127 __data = (MAX); \
2128 if (__CONV) \
2129 *(__PTR) = msecs_to_jiffies(__data); \
2130 else \
2131 *(__PTR) = __data; \
2132 return ret; \
2133}
2134STORE_FUNCTION(cfq_quantum_store, &cfqd->cfq_quantum, 1, UINT_MAX, 0);
Jens Axboe22e2c502005-06-27 10:55:12 +02002135STORE_FUNCTION(cfq_fifo_expire_sync_store, &cfqd->cfq_fifo_expire[1], 1, UINT_MAX, 1);
2136STORE_FUNCTION(cfq_fifo_expire_async_store, &cfqd->cfq_fifo_expire[0], 1, UINT_MAX, 1);
Al Viroe572ec72006-03-18 22:27:18 -05002137STORE_FUNCTION(cfq_back_seek_max_store, &cfqd->cfq_back_max, 0, UINT_MAX, 0);
2138STORE_FUNCTION(cfq_back_seek_penalty_store, &cfqd->cfq_back_penalty, 1, UINT_MAX, 0);
Jens Axboe22e2c502005-06-27 10:55:12 +02002139STORE_FUNCTION(cfq_slice_idle_store, &cfqd->cfq_slice_idle, 0, UINT_MAX, 1);
2140STORE_FUNCTION(cfq_slice_sync_store, &cfqd->cfq_slice[1], 1, UINT_MAX, 1);
2141STORE_FUNCTION(cfq_slice_async_store, &cfqd->cfq_slice[0], 1, UINT_MAX, 1);
2142STORE_FUNCTION(cfq_slice_async_rq_store, &cfqd->cfq_slice_async_rq, 1, UINT_MAX, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002143#undef STORE_FUNCTION
2144
Al Viroe572ec72006-03-18 22:27:18 -05002145#define CFQ_ATTR(name) \
2146 __ATTR(name, S_IRUGO|S_IWUSR, cfq_##name##_show, cfq_##name##_store)
Jens Axboe3b181522005-06-27 10:56:24 +02002147
Al Viroe572ec72006-03-18 22:27:18 -05002148static struct elv_fs_entry cfq_attrs[] = {
2149 CFQ_ATTR(quantum),
Al Viroe572ec72006-03-18 22:27:18 -05002150 CFQ_ATTR(fifo_expire_sync),
2151 CFQ_ATTR(fifo_expire_async),
2152 CFQ_ATTR(back_seek_max),
2153 CFQ_ATTR(back_seek_penalty),
2154 CFQ_ATTR(slice_sync),
2155 CFQ_ATTR(slice_async),
2156 CFQ_ATTR(slice_async_rq),
2157 CFQ_ATTR(slice_idle),
Al Viroe572ec72006-03-18 22:27:18 -05002158 __ATTR_NULL
Linus Torvalds1da177e2005-04-16 15:20:36 -07002159};
2160
Linus Torvalds1da177e2005-04-16 15:20:36 -07002161static struct elevator_type iosched_cfq = {
2162 .ops = {
2163 .elevator_merge_fn = cfq_merge,
2164 .elevator_merged_fn = cfq_merged_request,
2165 .elevator_merge_req_fn = cfq_merged_requests,
Jens Axboeda775262006-12-20 11:04:12 +01002166 .elevator_allow_merge_fn = cfq_allow_merge,
Jens Axboeb4878f22005-10-20 16:42:29 +02002167 .elevator_dispatch_fn = cfq_dispatch_requests,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002168 .elevator_add_req_fn = cfq_insert_request,
Jens Axboeb4878f22005-10-20 16:42:29 +02002169 .elevator_activate_req_fn = cfq_activate_request,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002170 .elevator_deactivate_req_fn = cfq_deactivate_request,
2171 .elevator_queue_empty_fn = cfq_queue_empty,
2172 .elevator_completed_req_fn = cfq_completed_request,
Jens Axboe21183b02006-07-13 12:33:14 +02002173 .elevator_former_req_fn = elv_rb_former_request,
2174 .elevator_latter_req_fn = elv_rb_latter_request,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002175 .elevator_set_req_fn = cfq_set_request,
2176 .elevator_put_req_fn = cfq_put_request,
2177 .elevator_may_queue_fn = cfq_may_queue,
2178 .elevator_init_fn = cfq_init_queue,
2179 .elevator_exit_fn = cfq_exit_queue,
Jens Axboefc463792006-08-29 09:05:44 +02002180 .trim = cfq_free_io_context,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002181 },
Al Viro3d1ab402006-03-18 18:35:43 -05002182 .elevator_attrs = cfq_attrs,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002183 .elevator_name = "cfq",
2184 .elevator_owner = THIS_MODULE,
2185};
2186
2187static int __init cfq_init(void)
2188{
2189 int ret;
2190
Jens Axboe22e2c502005-06-27 10:55:12 +02002191 /*
2192 * could be 0 on HZ < 1000 setups
2193 */
2194 if (!cfq_slice_async)
2195 cfq_slice_async = 1;
2196 if (!cfq_slice_idle)
2197 cfq_slice_idle = 1;
2198
Linus Torvalds1da177e2005-04-16 15:20:36 -07002199 if (cfq_slab_setup())
2200 return -ENOMEM;
2201
2202 ret = elv_register(&iosched_cfq);
Jens Axboe22e2c502005-06-27 10:55:12 +02002203 if (ret)
2204 cfq_slab_kill();
Linus Torvalds1da177e2005-04-16 15:20:36 -07002205
Linus Torvalds1da177e2005-04-16 15:20:36 -07002206 return ret;
2207}
2208
2209static void __exit cfq_exit(void)
2210{
Peter Zijlstra6e9a4732006-09-30 23:28:10 -07002211 DECLARE_COMPLETION_ONSTACK(all_gone);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002212 elv_unregister(&iosched_cfq);
Al Viro334e94d2006-03-18 15:05:53 -05002213 ioc_gone = &all_gone;
OGAWA Hirofumifba82272006-04-18 09:44:06 +02002214 /* ioc_gone's update must be visible before reading ioc_count */
2215 smp_wmb();
Jens Axboe4050cf12006-07-19 05:07:12 +02002216 if (elv_ioc_count_read(ioc_count))
OGAWA Hirofumifba82272006-04-18 09:44:06 +02002217 wait_for_completion(ioc_gone);
Al Viro334e94d2006-03-18 15:05:53 -05002218 synchronize_rcu();
Christoph Hellwig83521d32005-10-30 15:01:39 -08002219 cfq_slab_kill();
Linus Torvalds1da177e2005-04-16 15:20:36 -07002220}
2221
2222module_init(cfq_init);
2223module_exit(cfq_exit);
2224
2225MODULE_AUTHOR("Jens Axboe");
2226MODULE_LICENSE("GPL");
2227MODULE_DESCRIPTION("Completely Fair Queueing IO scheduler");