cfq-iosched.c 76.5 KB
Newer Older
Linus Torvalds's avatar
Linus Torvalds committed
1 2 3 4 5 6
/*
 *  CFQ, or complete fairness queueing, disk scheduler.
 *
 *  Based on ideas from a previously unfinished io
 *  scheduler (round robin per-process disk scheduling) and Andrea Arcangeli.
 *
7
 *  Copyright (C) 2003 Jens Axboe <axboe@kernel.dk>
Linus Torvalds's avatar
Linus Torvalds committed
8 9
 */
#include <linux/module.h>
Al Viro's avatar
Al Viro committed
10 11
#include <linux/blkdev.h>
#include <linux/elevator.h>
Linus Torvalds's avatar
Linus Torvalds committed
12
#include <linux/rbtree.h>
13
#include <linux/ioprio.h>
14
#include <linux/blktrace_api.h>
Linus Torvalds's avatar
Linus Torvalds committed
15 16 17 18

/*
 * tunables
 */
19 20
/* max queue in one round of service */
static const int cfq_quantum = 4;
21
static const int cfq_fifo_expire[2] = { HZ / 4, HZ / 8 };
22 23 24 25
/* maximum backwards seek, in KiB */
static const int cfq_back_max = 16 * 1024;
/* penalty of a backwards seek */
static const int cfq_back_penalty = 2;
26
static const int cfq_slice_sync = HZ / 10;
Jens Axboe's avatar
Jens Axboe committed
27
static int cfq_slice_async = HZ / 25;
28
static const int cfq_slice_async_rq = 2;
29
static int cfq_slice_idle = HZ / 125;
30 31
static const int cfq_target_latency = HZ * 3/10; /* 300 ms */
static const int cfq_hist_divisor = 4;
32

33
/*
34
 * offset from end of service tree
35
 */
36
#define CFQ_IDLE_DELAY		(HZ / 5)
37 38 39 40 41 42

/*
 * below this threshold, we consider thinktime immediate
 */
#define CFQ_MIN_TT		(2)

43 44 45 46 47 48
/*
 * Allow merged cfqqs to perform this amount of seeky I/O before
 * deciding to break the queues up again.
 */
#define CFQQ_COOP_TOUT		(HZ)

49
#define CFQ_SLICE_SCALE		(5)
50
#define CFQ_HW_QUEUE_MIN	(5)
51

52 53
#define RQ_CIC(rq)		\
	((struct cfq_io_context *) (rq)->elevator_private)
54
#define RQ_CFQQ(rq)		(struct cfq_queue *) ((rq)->elevator_private2)
Linus Torvalds's avatar
Linus Torvalds committed
55

56 57
static struct kmem_cache *cfq_pool;
static struct kmem_cache *cfq_ioc_pool;
Linus Torvalds's avatar
Linus Torvalds committed
58

59
static DEFINE_PER_CPU(unsigned long, cfq_ioc_count);
60
static struct completion *ioc_gone;
61
static DEFINE_SPINLOCK(ioc_gone_lock);
62

63 64 65 66
#define CFQ_PRIO_LISTS		IOPRIO_BE_NR
#define cfq_class_idle(cfqq)	((cfqq)->ioprio_class == IOPRIO_CLASS_IDLE)
#define cfq_class_rt(cfqq)	((cfqq)->ioprio_class == IOPRIO_CLASS_RT)

67 68
#define sample_valid(samples)	((samples) > 80)

69 70 71 72 73 74 75 76 77
/*
 * Most of our rbtree usage is for sorting with min extraction, so
 * if we cache the leftmost node we don't have to walk down the tree
 * to find it. Idea borrowed from Ingo Molnars CFS scheduler. We should
 * move this into the elevator for the rq sorting as well.
 */
struct cfq_rb_root {
	struct rb_root rb;
	struct rb_node *left;
78
	unsigned count;
79
};
80
#define CFQ_RB_ROOT	(struct cfq_rb_root) { RB_ROOT, NULL, 0, }
81

82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123
/*
 * Per process-grouping structure
 */
struct cfq_queue {
	/* reference count */
	atomic_t ref;
	/* various state flags, see below */
	unsigned int flags;
	/* parent cfq_data */
	struct cfq_data *cfqd;
	/* service_tree member */
	struct rb_node rb_node;
	/* service_tree key */
	unsigned long rb_key;
	/* prio tree member */
	struct rb_node p_node;
	/* prio tree root we belong to, if any */
	struct rb_root *p_root;
	/* sorted list of pending requests */
	struct rb_root sort_list;
	/* if fifo isn't expired, next request to serve */
	struct request *next_rq;
	/* requests queued in sort_list */
	int queued[2];
	/* currently allocated requests */
	int allocated[2];
	/* fifo list of requests in sort_list */
	struct list_head fifo;

	unsigned long slice_end;
	long slice_resid;
	unsigned int slice_dispatch;

	/* pending metadata requests */
	int meta_pending;
	/* number of requests that are on the dispatch list or inside driver */
	int dispatched;

	/* io prio of this group */
	unsigned short ioprio, org_ioprio;
	unsigned short ioprio_class, org_ioprio_class;

124 125 126 127
	unsigned int seek_samples;
	u64 seek_total;
	sector_t seek_mean;
	sector_t last_request_pos;
128
	unsigned long seeky_start;
129

130
	pid_t pid;
Jeff Moyer's avatar
Jeff Moyer committed
131

132
	struct cfq_rb_root *service_tree;
Jeff Moyer's avatar
Jeff Moyer committed
133
	struct cfq_queue *new_cfqq;
134 135
};

136
/*
137
 * First index in the service_trees.
138 139 140 141 142 143 144 145
 * IDLE is handled separately, so it has negative index
 */
enum wl_prio_t {
	IDLE_WORKLOAD = -1,
	BE_WORKLOAD = 0,
	RT_WORKLOAD = 1
};

146 147 148 149 150 151 152 153 154 155
/*
 * Second index in the service_trees.
 */
enum wl_type_t {
	ASYNC_WORKLOAD = 0,
	SYNC_NOIDLE_WORKLOAD = 1,
	SYNC_WORKLOAD = 2
};


156 157 158
/*
 * Per block device queue structure
 */
Linus Torvalds's avatar
Linus Torvalds committed
159
struct cfq_data {
160
	struct request_queue *queue;
161 162

	/*
163 164 165
	 * rr lists of queues with requests, onle rr for each priority class.
	 * Counts are embedded in the cfq_rb_root
	 */
166
	struct cfq_rb_root service_trees[2][3];
167 168 169
	struct cfq_rb_root service_tree_idle;
	/*
	 * The priority currently being served
170
	 */
171
	enum wl_prio_t serving_prio;
172 173
	enum wl_type_t serving_type;
	unsigned long workload_expires;
174 175 176 177 178 179 180 181

	/*
	 * Each priority tree is sorted by next_request position.  These
	 * trees are used when determining if two or more queues are
	 * interleaving requests (see cfq_close_cooperator).
	 */
	struct rb_root prio_trees[CFQ_PRIO_LISTS];

182
	unsigned int busy_queues;
183
	unsigned int busy_queues_avg[2];
184

185
	int rq_in_driver[2];
186
	int sync_flight;
187 188 189 190 191

	/*
	 * queue-depth detection
	 */
	int rq_queued;
192
	int hw_tag;
193 194
	int hw_tag_samples;
	int rq_in_driver_peak;
Linus Torvalds's avatar
Linus Torvalds committed
195

196 197 198 199
	/*
	 * idle window management
	 */
	struct timer_list idle_slice_timer;
200
	struct work_struct unplug_work;
Linus Torvalds's avatar
Linus Torvalds committed
201

202 203 204
	struct cfq_queue *active_queue;
	struct cfq_io_context *active_cic;

205 206 207 208 209
	/*
	 * async queue for each priority case
	 */
	struct cfq_queue *async_cfqq[2][IOPRIO_BE_NR];
	struct cfq_queue *async_idle_cfqq;
210

Jens Axboe's avatar
Jens Axboe committed
211
	sector_t last_position;
Linus Torvalds's avatar
Linus Torvalds committed
212 213 214 215 216

	/*
	 * tunables, see top of file
	 */
	unsigned int cfq_quantum;
217
	unsigned int cfq_fifo_expire[2];
Linus Torvalds's avatar
Linus Torvalds committed
218 219
	unsigned int cfq_back_penalty;
	unsigned int cfq_back_max;
220 221 222
	unsigned int cfq_slice[2];
	unsigned int cfq_slice_async_rq;
	unsigned int cfq_slice_idle;
223
	unsigned int cfq_latency;
224 225

	struct list_head cic_list;
Linus Torvalds's avatar
Linus Torvalds committed
226

227 228 229 230
	/*
	 * Fallback dummy cfqq for extreme OOM conditions
	 */
	struct cfq_queue oom_cfqq;
231 232

	unsigned long last_end_sync_rq;
Linus Torvalds's avatar
Linus Torvalds committed
233 234
};

235
static struct cfq_rb_root *service_tree_for(enum wl_prio_t prio,
236
					    enum wl_type_t type,
237 238 239 240 241
					    struct cfq_data *cfqd)
{
	if (prio == IDLE_WORKLOAD)
		return &cfqd->service_tree_idle;

242
	return &cfqd->service_trees[prio][type];
243 244
}

Jens Axboe's avatar
Jens Axboe committed
245
enum cfqq_state_flags {
246 247
	CFQ_CFQQ_FLAG_on_rr = 0,	/* on round-robin busy list */
	CFQ_CFQQ_FLAG_wait_request,	/* waiting for a request */
248
	CFQ_CFQQ_FLAG_must_dispatch,	/* must be allowed a dispatch */
249 250 251 252
	CFQ_CFQQ_FLAG_must_alloc_slice,	/* per-slice must_alloc flag */
	CFQ_CFQQ_FLAG_fifo_expire,	/* FIFO checked in this slice */
	CFQ_CFQQ_FLAG_idle_window,	/* slice idling enabled */
	CFQ_CFQQ_FLAG_prio_changed,	/* task priority has changed */
253
	CFQ_CFQQ_FLAG_slice_new,	/* no requests dispatched in slice */
254
	CFQ_CFQQ_FLAG_sync,		/* synchronous queue */
255
	CFQ_CFQQ_FLAG_coop,		/* cfqq is shared */
Jens Axboe's avatar
Jens Axboe committed
256 257 258 259 260
};

#define CFQ_CFQQ_FNS(name)						\
static inline void cfq_mark_cfqq_##name(struct cfq_queue *cfqq)		\
{									\
261
	(cfqq)->flags |= (1 << CFQ_CFQQ_FLAG_##name);			\
Jens Axboe's avatar
Jens Axboe committed
262 263 264
}									\
static inline void cfq_clear_cfqq_##name(struct cfq_queue *cfqq)	\
{									\
265
	(cfqq)->flags &= ~(1 << CFQ_CFQQ_FLAG_##name);			\
Jens Axboe's avatar
Jens Axboe committed
266 267 268
}									\
static inline int cfq_cfqq_##name(const struct cfq_queue *cfqq)		\
{									\
269
	return ((cfqq)->flags & (1 << CFQ_CFQQ_FLAG_##name)) != 0;	\
Jens Axboe's avatar
Jens Axboe committed
270 271 272 273
}

CFQ_CFQQ_FNS(on_rr);
CFQ_CFQQ_FNS(wait_request);
274
CFQ_CFQQ_FNS(must_dispatch);
Jens Axboe's avatar
Jens Axboe committed
275 276 277 278
CFQ_CFQQ_FNS(must_alloc_slice);
CFQ_CFQQ_FNS(fifo_expire);
CFQ_CFQQ_FNS(idle_window);
CFQ_CFQQ_FNS(prio_changed);
279
CFQ_CFQQ_FNS(slice_new);
280
CFQ_CFQQ_FNS(sync);
281
CFQ_CFQQ_FNS(coop);
Jens Axboe's avatar
Jens Axboe committed
282 283
#undef CFQ_CFQQ_FNS

284 285 286 287 288
#define cfq_log_cfqq(cfqd, cfqq, fmt, args...)	\
	blk_add_trace_msg((cfqd)->queue, "cfq%d " fmt, (cfqq)->pid, ##args)
#define cfq_log(cfqd, fmt, args...)	\
	blk_add_trace_msg((cfqd)->queue, "cfq " fmt, ##args)

289 290 291 292 293 294 295 296 297
static inline enum wl_prio_t cfqq_prio(struct cfq_queue *cfqq)
{
	if (cfq_class_idle(cfqq))
		return IDLE_WORKLOAD;
	if (cfq_class_rt(cfqq))
		return RT_WORKLOAD;
	return BE_WORKLOAD;
}

298 299 300 301 302 303 304 305 306 307

static enum wl_type_t cfqq_type(struct cfq_queue *cfqq)
{
	if (!cfq_cfqq_sync(cfqq))
		return ASYNC_WORKLOAD;
	if (!cfq_cfqq_idle_window(cfqq))
		return SYNC_NOIDLE_WORKLOAD;
	return SYNC_WORKLOAD;
}

308 309 310 311 312
static inline int cfq_busy_queues_wl(enum wl_prio_t wl, struct cfq_data *cfqd)
{
	if (wl == IDLE_WORKLOAD)
		return cfqd->service_tree_idle.count;

313 314 315
	return cfqd->service_trees[wl][ASYNC_WORKLOAD].count
		+ cfqd->service_trees[wl][SYNC_NOIDLE_WORKLOAD].count
		+ cfqd->service_trees[wl][SYNC_WORKLOAD].count;
316 317
}

318
static void cfq_dispatch_insert(struct request_queue *, struct request *);
319
static struct cfq_queue *cfq_get_queue(struct cfq_data *, bool,
320
				       struct io_context *, gfp_t);
321
static struct cfq_io_context *cfq_cic_lookup(struct cfq_data *,
322 323
						struct io_context *);

324 325 326 327 328
static inline int rq_in_driver(struct cfq_data *cfqd)
{
	return cfqd->rq_in_driver[0] + cfqd->rq_in_driver[1];
}

329
static inline struct cfq_queue *cic_to_cfqq(struct cfq_io_context *cic,
330
					    bool is_sync)
331
{
332
	return cic->cfqq[is_sync];
333 334 335
}

static inline void cic_set_cfqq(struct cfq_io_context *cic,
336
				struct cfq_queue *cfqq, bool is_sync)
337
{
338
	cic->cfqq[is_sync] = cfqq;
339 340 341 342 343 344
}

/*
 * We regard a request as SYNC, if it's either a read or has the SYNC bit
 * set (in which case it could also be direct WRITE).
 */
345
static inline bool cfq_bio_sync(struct bio *bio)
346
{
347
	return bio_data_dir(bio) == READ || bio_rw_flagged(bio, BIO_RW_SYNCIO);
348
}
Linus Torvalds's avatar
Linus Torvalds committed
349

Andrew Morton's avatar
Andrew Morton committed
350 351 352 353
/*
 * scheduler run of queue, if there are requests pending and no one in the
 * driver that will restart queueing
 */
354
static inline void cfq_schedule_dispatch(struct cfq_data *cfqd)
Andrew Morton's avatar
Andrew Morton committed
355
{
356 357
	if (cfqd->busy_queues) {
		cfq_log(cfqd, "schedule dispatch");
358
		kblockd_schedule_work(cfqd->queue, &cfqd->unplug_work);
359
	}
Andrew Morton's avatar
Andrew Morton committed
360 361
}

362
static int cfq_queue_empty(struct request_queue *q)
Andrew Morton's avatar
Andrew Morton committed
363 364 365
{
	struct cfq_data *cfqd = q->elevator->elevator_data;

366
	return !cfqd->busy_queues;
Andrew Morton's avatar
Andrew Morton committed
367 368
}

369 370 371 372 373
/*
 * Scale schedule slice based on io priority. Use the sync time slice only
 * if a queue is marked sync and has sync io queued. A sync queue with async
 * io only, should not get full sync slice length.
 */
374
static inline int cfq_prio_slice(struct cfq_data *cfqd, bool sync,
375
				 unsigned short prio)
376
{
377
	const int base_slice = cfqd->cfq_slice[sync];
378

379 380 381 382
	WARN_ON(prio >= IOPRIO_BE_NR);

	return base_slice + (base_slice/CFQ_SLICE_SCALE * (4 - prio));
}
383

384 385 386 387
static inline int
cfq_prio_to_slice(struct cfq_data *cfqd, struct cfq_queue *cfqq)
{
	return cfq_prio_slice(cfqd, cfq_cfqq_sync(cfqq), cfqq->ioprio);
388 389
}

390 391 392 393 394 395
/*
 * get averaged number of queues of RT/BE priority.
 * average is updated, with a formula that gives more weight to higher numbers,
 * to quickly follows sudden increases and decrease slowly
 */

396 397
static inline unsigned cfq_get_avg_queues(struct cfq_data *cfqd, bool rt)
{
398 399 400
	unsigned min_q, max_q;
	unsigned mult  = cfq_hist_divisor - 1;
	unsigned round = cfq_hist_divisor / 2;
401
	unsigned busy = cfq_busy_queues_wl(rt, cfqd);
402 403 404 405 406 407 408 409

	min_q = min(cfqd->busy_queues_avg[rt], busy);
	max_q = max(cfqd->busy_queues_avg[rt], busy);
	cfqd->busy_queues_avg[rt] = (mult * max_q + min_q + round) /
		cfq_hist_divisor;
	return cfqd->busy_queues_avg[rt];
}

410 411 412
static inline void
cfq_set_prio_slice(struct cfq_data *cfqd, struct cfq_queue *cfqq)
{
413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432
	unsigned slice = cfq_prio_to_slice(cfqd, cfqq);
	if (cfqd->cfq_latency) {
		/* interested queues (we consider only the ones with the same
		 * priority class) */
		unsigned iq = cfq_get_avg_queues(cfqd, cfq_class_rt(cfqq));
		unsigned sync_slice = cfqd->cfq_slice[1];
		unsigned expect_latency = sync_slice * iq;
		if (expect_latency > cfq_target_latency) {
			unsigned base_low_slice = 2 * cfqd->cfq_slice_idle;
			/* scale low_slice according to IO priority
			 * and sync vs async */
			unsigned low_slice =
				min(slice, base_low_slice * slice / sync_slice);
			/* the adapted slice value is scaled to fit all iqs
			 * into the target latency */
			slice = max(slice * cfq_target_latency / expect_latency,
				    low_slice);
		}
	}
	cfqq->slice_end = jiffies + slice;
433
	cfq_log_cfqq(cfqd, cfqq, "set_slice=%lu", cfqq->slice_end - jiffies);
434 435 436 437 438 439 440
}

/*
 * We need to wrap this check in cfq_cfqq_slice_new(), since ->slice_end
 * isn't valid until the first request from the dispatch is activated
 * and the slice time set.
 */
441
static inline bool cfq_slice_used(struct cfq_queue *cfqq)
442 443 444 445 446 447 448 449 450
{
	if (cfq_cfqq_slice_new(cfqq))
		return 0;
	if (time_before(jiffies, cfqq->slice_end))
		return 0;

	return 1;
}

Linus Torvalds's avatar
Linus Torvalds committed
451
/*
Jens Axboe's avatar
Jens Axboe committed
452
 * Lifted from AS - choose which of rq1 and rq2 that is best served now.
Linus Torvalds's avatar
Linus Torvalds committed
453
 * We choose the request that is closest to the head right now. Distance
454
 * behind the head is penalized and only allowed to a certain extent.
Linus Torvalds's avatar
Linus Torvalds committed
455
 */
Jens Axboe's avatar
Jens Axboe committed
456
static struct request *
457
cfq_choose_req(struct cfq_data *cfqd, struct request *rq1, struct request *rq2, sector_t last)
Linus Torvalds's avatar
Linus Torvalds committed
458
{
459
	sector_t s1, s2, d1 = 0, d2 = 0;
Linus Torvalds's avatar
Linus Torvalds committed
460
	unsigned long back_max;
461 462 463
#define CFQ_RQ1_WRAP	0x01 /* request 1 wraps */
#define CFQ_RQ2_WRAP	0x02 /* request 2 wraps */
	unsigned wrap = 0; /* bit mask: requests behind the disk head? */
Linus Torvalds's avatar
Linus Torvalds committed
464

Jens Axboe's avatar
Jens Axboe committed
465 466 467 468
	if (rq1 == NULL || rq1 == rq2)
		return rq2;
	if (rq2 == NULL)
		return rq1;
469

Jens Axboe's avatar
Jens Axboe committed
470 471 472 473
	if (rq_is_sync(rq1) && !rq_is_sync(rq2))
		return rq1;
	else if (rq_is_sync(rq2) && !rq_is_sync(rq1))
		return rq2;
474 475 476 477
	if (rq_is_meta(rq1) && !rq_is_meta(rq2))
		return rq1;
	else if (rq_is_meta(rq2) && !rq_is_meta(rq1))
		return rq2;
Linus Torvalds's avatar
Linus Torvalds committed
478

479 480
	s1 = blk_rq_pos(rq1);
	s2 = blk_rq_pos(rq2);
Linus Torvalds's avatar
Linus Torvalds committed
481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496

	/*
	 * by definition, 1KiB is 2 sectors
	 */
	back_max = cfqd->cfq_back_max * 2;

	/*
	 * Strict one way elevator _except_ in the case where we allow
	 * short backward seeks which are biased as twice the cost of a
	 * similar forward seek.
	 */
	if (s1 >= last)
		d1 = s1 - last;
	else if (s1 + back_max >= last)
		d1 = (last - s1) * cfqd->cfq_back_penalty;
	else
497
		wrap |= CFQ_RQ1_WRAP;
Linus Torvalds's avatar
Linus Torvalds committed
498 499 500 501 502 503

	if (s2 >= last)
		d2 = s2 - last;
	else if (s2 + back_max >= last)
		d2 = (last - s2) * cfqd->cfq_back_penalty;
	else
504
		wrap |= CFQ_RQ2_WRAP;
Linus Torvalds's avatar
Linus Torvalds committed
505 506

	/* Found required data */
507 508 509 510 511 512

	/*
	 * By doing switch() on the bit mask "wrap" we avoid having to
	 * check two variables for all permutations: --> faster!
	 */
	switch (wrap) {
Jens Axboe's avatar
Jens Axboe committed
513
	case 0: /* common case for CFQ: rq1 and rq2 not wrapped */
514
		if (d1 < d2)
Jens Axboe's avatar
Jens Axboe committed
515
			return rq1;
516
		else if (d2 < d1)
Jens Axboe's avatar
Jens Axboe committed
517
			return rq2;
518 519
		else {
			if (s1 >= s2)
Jens Axboe's avatar
Jens Axboe committed
520
				return rq1;
521
			else
Jens Axboe's avatar
Jens Axboe committed
522
				return rq2;
523
		}
Linus Torvalds's avatar
Linus Torvalds committed
524

525
	case CFQ_RQ2_WRAP:
Jens Axboe's avatar
Jens Axboe committed
526
		return rq1;
527
	case CFQ_RQ1_WRAP:
Jens Axboe's avatar
Jens Axboe committed
528 529
		return rq2;
	case (CFQ_RQ1_WRAP|CFQ_RQ2_WRAP): /* both rqs wrapped */
530 531 532 533 534 535 536 537
	default:
		/*
		 * Since both rqs are wrapped,
		 * start with the one that's further behind head
		 * (--> only *one* back seek required),
		 * since back seek takes more time than forward.
		 */
		if (s1 <= s2)
Jens Axboe's avatar
Jens Axboe committed
538
			return rq1;
Linus Torvalds's avatar
Linus Torvalds committed
539
		else
Jens Axboe's avatar
Jens Axboe committed
540
			return rq2;
Linus Torvalds's avatar
Linus Torvalds committed
541 542 543
	}
}

544 545 546
/*
 * The below is leftmost cache rbtree addon
 */
547
static struct cfq_queue *cfq_rb_first(struct cfq_rb_root *root)
548 549 550 551
{
	if (!root->left)
		root->left = rb_first(&root->rb);

552 553 554 555
	if (root->left)
		return rb_entry(root->left, struct cfq_queue, rb_node);

	return NULL;
556 557
}

558 559 560 561 562 563
static void rb_erase_init(struct rb_node *n, struct rb_root *root)
{
	rb_erase(n, root);
	RB_CLEAR_NODE(n);
}

564 565 566 567
static void cfq_rb_erase(struct rb_node *n, struct cfq_rb_root *root)
{
	if (root->left == n)
		root->left = NULL;
568
	rb_erase_init(n, &root->rb);
569
	--root->count;
570 571
}

Linus Torvalds's avatar
Linus Torvalds committed
572 573 574
/*
 * would be nice to take fifo expire time into account as well
 */
Jens Axboe's avatar
Jens Axboe committed
575 576 577
static struct request *
cfq_find_next_rq(struct cfq_data *cfqd, struct cfq_queue *cfqq,
		  struct request *last)
Linus Torvalds's avatar
Linus Torvalds committed
578
{
579 580
	struct rb_node *rbnext = rb_next(&last->rb_node);
	struct rb_node *rbprev = rb_prev(&last->rb_node);
Jens Axboe's avatar
Jens Axboe committed
581
	struct request *next = NULL, *prev = NULL;
Linus Torvalds's avatar
Linus Torvalds committed
582

583
	BUG_ON(RB_EMPTY_NODE(&last->rb_node));
Linus Torvalds's avatar
Linus Torvalds committed
584 585

	if (rbprev)
Jens Axboe's avatar
Jens Axboe committed
586
		prev = rb_entry_rq(rbprev);
Linus Torvalds's avatar
Linus Torvalds committed
587

588
	if (rbnext)
Jens Axboe's avatar
Jens Axboe committed
589
		next = rb_entry_rq(rbnext);
590 591 592
	else {
		rbnext = rb_first(&cfqq->sort_list);
		if (rbnext && rbnext != &last->rb_node)
Jens Axboe's avatar
Jens Axboe committed
593
			next = rb_entry_rq(rbnext);
594
	}
Linus Torvalds's avatar
Linus Torvalds committed
595

596
	return cfq_choose_req(cfqd, next, prev, blk_rq_pos(last));
Linus Torvalds's avatar
Linus Torvalds committed
597 598
}

599 600
static unsigned long cfq_slice_offset(struct cfq_data *cfqd,
				      struct cfq_queue *cfqq)
Linus Torvalds's avatar
Linus Torvalds committed
601
{
602 603 604
	/*
	 * just an approximation, should be ok.
	 */
605 606
	return (cfqd->busy_queues - 1) * (cfq_prio_slice(cfqd, 1, 0) -
		       cfq_prio_slice(cfqd, cfq_cfqq_sync(cfqq), cfqq->ioprio));
607 608
}

609
/*
610
 * The cfqd->service_trees holds all pending cfq_queue's that have
611 612 613
 * requests waiting to be processed. It is sorted in the order that
 * we will service the queues.
 */
614
static void cfq_service_tree_add(struct cfq_data *cfqd, struct cfq_queue *cfqq,
615
				 bool add_front)
616
{
617 618
	struct rb_node **p, *parent;
	struct cfq_queue *__cfqq;
619
	unsigned long rb_key;
620
	struct cfq_rb_root *service_tree;
621
	int left;
622

623
	service_tree = service_tree_for(cfqq_prio(cfqq), cfqq_type(cfqq), cfqd);
624 625
	if (cfq_class_idle(cfqq)) {
		rb_key = CFQ_IDLE_DELAY;
626
		parent = rb_last(&service_tree->rb);
627 628 629 630 631 632
		if (parent && parent != &cfqq->rb_node) {
			__cfqq = rb_entry(parent, struct cfq_queue, rb_node);
			rb_key += __cfqq->rb_key;
		} else
			rb_key += jiffies;
	} else if (!add_front) {
633 634 635 636 637 638
		/*
		 * Get our rb key offset. Subtract any residual slice
		 * value carried from last service. A negative resid
		 * count indicates slice overrun, and this should position
		 * the next service time further away in the tree.
		 */
639
		rb_key = cfq_slice_offset(cfqd, cfqq) + jiffies;
640
		rb_key -= cfqq->slice_resid;
641
		cfqq->slice_resid = 0;
642 643
	} else {
		rb_key = -HZ;
644
		__cfqq = cfq_rb_first(service_tree);
645 646
		rb_key += __cfqq ? __cfqq->rb_key : jiffies;
	}
Linus Torvalds's avatar
Linus Torvalds committed
647

648
	if (!RB_EMPTY_NODE(&cfqq->rb_node)) {
649
		/*
650
		 * same position, nothing more to do
651
		 */
652 653
		if (rb_key == cfqq->rb_key &&
		    cfqq->service_tree == service_tree)
654
			return;
Linus Torvalds's avatar
Linus Torvalds committed
655

656 657
		cfq_rb_erase(&cfqq->rb_node, cfqq->service_tree);
		cfqq->service_tree = NULL;
Linus Torvalds's avatar
Linus Torvalds committed
658
	}
659

660
	left = 1;
661
	parent = NULL;
662 663
	cfqq->service_tree = service_tree;
	p = &service_tree->rb.rb_node;
664
	while (*p) {
665
		struct rb_node **n;
666

667 668 669
		parent = *p;
		__cfqq = rb_entry(parent, struct cfq_queue, rb_node);

670
		/*
671
		 * sort by key, that represents service time.
672
		 */
673
		if (time_before(rb_key, __cfqq->rb_key))
674
			n = &(*p)->rb_left;
675
		else {
676
			n = &(*p)->rb_right;
677
			left = 0;
678
		}
679 680

		p = n;
681 682
	}

683
	if (left)
684
		service_tree->left = &cfqq->rb_node;
685

686 687
	cfqq->rb_key = rb_key;
	rb_link_node(&cfqq->rb_node, parent, p);
688 689
	rb_insert_color(&cfqq->rb_node, &service_tree->rb);
	service_tree->count++;
Linus Torvalds's avatar
Linus Torvalds committed
690 691
}

692
static struct cfq_queue *
693 694 695
cfq_prio_tree_lookup(struct cfq_data *cfqd, struct rb_root *root,
		     sector_t sector, struct rb_node **ret_parent,
		     struct rb_node ***rb_link)
696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711
{
	struct rb_node **p, *parent;
	struct cfq_queue *cfqq = NULL;

	parent = NULL;
	p = &root->rb_node;
	while (*p) {
		struct rb_node **n;

		parent = *p;
		cfqq = rb_entry(parent, struct cfq_queue, p_node);

		/*
		 * Sort strictly based on sector.  Smallest to the left,
		 * largest to the right.
		 */
712
		if (sector > blk_rq_pos(cfqq->next_rq))
713
			n = &(*p)->rb_right;
714
		else if (sector < blk_rq_pos(cfqq->next_rq))
715 716 717 718
			n = &(*p)->rb_left;
		else
			break;
		p = n;
719
		cfqq = NULL;
720 721 722 723 724
	}

	*ret_parent = parent;
	if (rb_link)
		*rb_link = p;
725
	return cfqq;
726 727 728 729 730 731 732
}

static void cfq_prio_tree_add(struct cfq_data *cfqd, struct cfq_queue *cfqq)
{
	struct rb_node **p, *parent;
	struct cfq_queue *__cfqq;

733 734 735 736
	if (cfqq->p_root) {
		rb_erase(&cfqq->p_node, cfqq->p_root);
		cfqq->p_root = NULL;
	}
737 738 739 740 741 742

	if (cfq_class_idle(cfqq))
		return;
	if (!cfqq->next_rq)
		return;

743
	cfqq->p_root = &cfqd->prio_trees[cfqq->org_ioprio];
744 745
	__cfqq = cfq_prio_tree_lookup(cfqd, cfqq->p_root,
				      blk_rq_pos(cfqq->next_rq), &parent, &p);
746 747
	if (!__cfqq) {
		rb_link_node(&cfqq->p_node, parent, p);
748 749 750
		rb_insert_color(&cfqq->p_node, cfqq->p_root);
	} else
		cfqq->p_root = NULL;
751 752
}

753 754 755
/*
 * Update cfqq's position in the service tree.
 */
756
static void cfq_resort_rr_list(struct cfq_data *cfqd, struct cfq_queue *cfqq)
Jens Axboe's avatar
Jens Axboe committed
757 758 759 760
{
	/*
	 * Resorting requires the cfqq to be on the RR list already.
	 */
761
	if (cfq_cfqq_on_rr(cfqq)) {
762
		cfq_service_tree_add(cfqd, cfqq, 0);
763 764
		cfq_prio_tree_add(cfqd, cfqq);
	}
Jens Axboe's avatar
Jens Axboe committed
765 766
}

Linus Torvalds's avatar
Linus Torvalds committed
767 768
/*
 * add to busy list of queues for service, trying to be fair in ordering
769
 * the pending list according to last request service
Linus Torvalds's avatar
Linus Torvalds committed
770
 */
771
static void cfq_add_cfqq_rr(struct cfq_data *cfqd, struct cfq_queue *cfqq)
Linus Torvalds's avatar
Linus Torvalds committed
772
{
773
	cfq_log_cfqq(cfqd, cfqq, "add_to_rr");
Jens Axboe's avatar
Jens Axboe committed
774 775
	BUG_ON(cfq_cfqq_on_rr(cfqq));
	cfq_mark_cfqq_on_rr(cfqq);
Linus Torvalds's avatar
Linus Torvalds committed
776 777
	cfqd->busy_queues++;

778
	cfq_resort_rr_list(cfqd, cfqq);
Linus Torvalds's avatar
Linus Torvalds committed
779 780
}

781 782 783 784
/*
 * Called when the cfqq no longer has requests pending, remove it from
 * the service tree.
 */
785
static void cfq_del_cfqq_rr(struct cfq_data *cfqd, struct cfq_queue *cfqq)
Linus Torvalds's avatar
Linus Torvalds committed
786
{
787
	cfq_log_cfqq(cfqd, cfqq, "del_from_rr");
Jens Axboe's avatar
Jens Axboe committed
788 789
	BUG_ON(!cfq_cfqq_on_rr(cfqq));
	cfq_clear_cfqq_on_rr(cfqq);
Linus Torvalds's avatar
Linus Torvalds committed
790

791 792 793 794
	if (!RB_EMPTY_NODE(&cfqq->rb_node)) {
		cfq_rb_erase(&cfqq->rb_node, cfqq->service_tree);
		cfqq->service_tree = NULL;
	}
795 796 797 798
	if (cfqq->p_root) {
		rb_erase(&cfqq->p_node, cfqq->p_root);
		cfqq->p_root = NULL;
	}
799

Linus Torvalds's avatar
Linus Torvalds committed
800 801 802 803 804 805 806
	BUG_ON(!cfqd->busy_queues);
	cfqd->busy_queues--;
}

/*
 * rb tree support functions
 */
807
static void cfq_del_rq_rb(struct request *rq)
Linus Torvalds's avatar
Linus Torvalds committed
808
{
Jens Axboe's avatar
Jens Axboe committed
809
	struct cfq_queue *cfqq = RQ_CFQQ(rq);
810
	struct cfq_data *cfqd = cfqq->cfqd;
Jens Axboe's avatar
Jens Axboe committed
811
	const int sync = rq_is_sync(rq);
Linus Torvalds's avatar
Linus Torvalds committed
812

813 814
	BUG_ON(!cfqq->queued[sync]);
	cfqq->queued[sync]--;
Linus Torvalds's avatar
Linus Torvalds committed
815

Jens Axboe's avatar
Jens Axboe committed
816
	elv_rb_del(&cfqq->sort_list, rq);
Linus Torvalds's avatar
Linus Torvalds committed
817

818
	if (cfq_cfqq_on_rr(cfqq) && RB_EMPTY_ROOT(&cfqq->sort_list))
819
		cfq_del_cfqq_rr(cfqd, cfqq);
Linus Torvalds's avatar
Linus Torvalds committed
820 821
}

Jens Axboe's avatar
Jens Axboe committed
822
static void cfq_add_rq_rb(struct request *rq)
Linus Torvalds's avatar
Linus Torvalds committed
823
{
Jens Axboe's avatar
Jens Axboe committed
824
	struct cfq_queue *cfqq = RQ_CFQQ(rq);
Linus Torvalds's avatar
Linus Torvalds committed
825
	struct cfq_data *cfqd = cfqq->cfqd;
826
	struct request *__alias, *prev;
Linus Torvalds's avatar
Linus Torvalds committed
827

828
	cfqq->queued[rq_is_sync(rq)]++;
Linus Torvalds's avatar
Linus Torvalds committed
829 830 831 832 833

	/*
	 * looks a little odd, but the first insert might return an alias.
	 * if that happens, put the alias on the dispatch list
	 */
834
	while ((__alias = elv_rb_add(&cfqq->sort_list, rq)) != NULL)
Jens Axboe's avatar
Jens Axboe committed
835
		cfq_dispatch_insert(cfqd->queue, __alias);
836 837 838

	if (!cfq_cfqq_on_rr(cfqq))
		cfq_add_cfqq_rr(cfqd, cfqq);
839 840 841 842

	/*
	 * check if this request is a better next-serve candidate
	 */
843
	prev = cfqq->next_rq;
844
	cfqq->next_rq = cfq_choose_req(cfqd, cfqq->next_rq, rq, cfqd->last_position);
845 846 847 848 849 850 851

	/*
	 * adjust priority tree position, if ->next_rq changes
	 */
	if (prev != cfqq->next_rq)
		cfq_prio_tree_add(cfqd, cfqq);

852
	BUG_ON(!cfqq->next_rq);
Linus Torvalds's avatar
Linus Torvalds committed
853 854
}

855
static void cfq_reposition_rq_rb(struct cfq_queue *cfqq, struct request *rq)
Linus Torvalds's avatar
Linus Torvalds committed
856
{
857 858
	elv_rb_del(&cfqq->sort_list, rq);
	cfqq->queued[rq_is_sync(rq)]--;
Jens Axboe's avatar
Jens Axboe committed
859
	cfq_add_rq_rb(rq);
Linus Torvalds's avatar
Linus Torvalds committed
860 861
}

862 863
static struct request *
cfq_find_rq_fmerge(struct cfq_data *cfqd, struct bio *bio)
Linus Torvalds's avatar
Linus Torvalds committed
864
{
865
	struct task_struct *tsk = current;
866
	struct cfq_io_context *cic;
867
	struct cfq_queue *cfqq;
Linus Torvalds's avatar
Linus Torvalds committed
868

869
	cic = cfq_cic_lookup(cfqd, tsk->io_context);
870 871 872 873
	if (!cic)
		return NULL;

	cfqq = cic_to_cfqq(cic, cfq_bio_sync(bio));
874 875 876
	if (cfqq) {
		sector_t sector = bio->bi_sector + bio_sectors(bio);

877
		return elv_rb_find(&cfqq->sort_list, sector);
878
	}
Linus Torvalds's avatar
Linus Torvalds committed
879 880 881 882

	return NULL;
}

883
static void cfq_activate_request(struct request_queue *q, struct request *rq)
Linus Torvalds's avatar
Linus Torvalds committed
884
{
885
	struct cfq_data *cfqd = q->elevator->elevator_data;
Jens Axboe's avatar
Jens Axboe committed
886

887
	cfqd->rq_in_driver[rq_is_sync(rq)]++;
888
	cfq_log_cfqq(cfqd, RQ_CFQQ(rq), "activate rq, drv=%d",
889
						rq_in_driver(cfqd));
890

891
	cfqd->last_position = blk_rq_pos(rq) + blk_rq_sectors(rq);
Linus Torvalds's avatar
Linus Torvalds committed
892 893
}

894
static void cfq_deactivate_request(struct request_queue *q, struct request *rq)
Linus Torvalds's avatar
Linus Torvalds committed
895
{
896
	struct cfq_data *cfqd = q->elevator->elevator_data;
897
	const int sync = rq_is_sync(rq);
898

899 900
	WARN_ON(!cfqd->rq_in_driver[sync]);
	cfqd->rq_in_driver[sync]--;
901
	cfq_log_cfqq(cfqd, RQ_CFQQ(rq), "deactivate rq, drv=%d",
902
						rq_in_driver(cfqd));
Linus Torvalds's avatar
Linus Torvalds committed
903 904
}

905
static void cfq_remove_request(struct request *rq)
Linus Torvalds's avatar
Linus Torvalds committed
906
{
Jens Axboe's avatar
Jens Axboe committed
907
	struct cfq_queue *cfqq = RQ_CFQQ(rq);
908

Jens Axboe's avatar
Jens Axboe committed
909 910
	if (cfqq->next_rq == rq)
		cfqq->next_rq = cfq_find_next_rq(cfqq->cfqd, cfqq, rq);
Linus Torvalds's avatar
Linus Torvalds committed
911

912
	list_del_init(&rq->queuelist);
Jens Axboe's avatar
Jens Axboe committed
913
	cfq_del_rq_rb(rq);
914

915
	cfqq->cfqd->rq_queued--;
916 917 918 919
	if (rq_is_meta(rq)) {
		WARN_ON(!cfqq->meta_pending);
		cfqq->meta_pending--;
	}
Linus Torvalds's avatar
Linus Torvalds committed
920 921
}

922 923
static int cfq_merge(struct request_queue *q, struct request **req,
		     struct bio *bio)
Linus Torvalds's avatar
Linus Torvalds committed
924 925 926 927
{
	struct cfq_data *cfqd = q->elevator->elevator_data;
	struct request *__rq;

928
	__rq = cfq_find_rq_fmerge(cfqd, bio);
929
	if (__rq && elv_rq_merge_ok(__rq, bio)) {
930 931
		*req = __rq;
		return ELEVATOR_FRONT_MERGE;
Linus Torvalds's avatar
Linus Torvalds committed
932 933 934 935 936
	}

	return ELEVATOR_NO_MERGE;
}

937
static void cfq_merged_request(struct request_queue *q, struct request *req,
938
			       int type)
Linus Torvalds's avatar
Linus Torvalds committed
939
{
940
	if (type == ELEVATOR_FRONT_MERGE) {
Jens Axboe's avatar
Jens Axboe committed
941
		struct cfq_queue *cfqq = RQ_CFQQ(req);
Linus Torvalds's avatar
Linus Torvalds committed
942

Jens Axboe's avatar
Jens Axboe committed
943
		cfq_reposition_rq_rb(cfqq, req);
Linus Torvalds's avatar
Linus Torvalds committed
944 945 946 947
	}
}

static void
948
cfq_merged_requests(struct request_queue *q, struct request *rq,
Linus Torvalds's avatar
Linus Torvalds committed
949 950
		    struct request *next)
{
951
	struct cfq_queue *cfqq = RQ_CFQQ(rq);
952 953 954 955
	/*
	 * reposition in fifo if next is older than rq
	 */
	if (!list_empty(&rq->queuelist) && !list_empty(&next->queuelist) &&
956
	    time_before(rq_fifo_time(next), rq_fifo_time(rq))) {
957
		list_move(&