cfq-iosched.c 105 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>
10
#include <linux/slab.h>
Al Viro's avatar
Al Viro committed
11 12
#include <linux/blkdev.h>
#include <linux/elevator.h>
Randy Dunlap's avatar
Randy Dunlap committed
13
#include <linux/jiffies.h>
Linus Torvalds's avatar
Linus Torvalds committed
14
#include <linux/rbtree.h>
15
#include <linux/ioprio.h>
16
#include <linux/blktrace_api.h>
17
#include "blk.h"
18
#include "cfq.h"
Linus Torvalds's avatar
Linus Torvalds committed
19 20 21 22

/*
 * tunables
 */
23
/* max queue in one round of service */
Shaohua Li's avatar
Shaohua Li committed
24
static const int cfq_quantum = 8;
25
static const int cfq_fifo_expire[2] = { HZ / 4, HZ / 8 };
26 27 28 29
/* 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;
30
static const int cfq_slice_sync = HZ / 10;
Jens Axboe's avatar
Jens Axboe committed
31
static int cfq_slice_async = HZ / 25;
32
static const int cfq_slice_async_rq = 2;
33
static int cfq_slice_idle = HZ / 125;
34
static int cfq_group_idle = HZ / 125;
35 36
static const int cfq_target_latency = HZ * 3/10; /* 300 ms */
static const int cfq_hist_divisor = 4;
37

38
/*
39
 * offset from end of service tree
40
 */
41
#define CFQ_IDLE_DELAY		(HZ / 5)
42 43 44 45 46 47

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

48
#define CFQ_SLICE_SCALE		(5)
49
#define CFQ_HW_QUEUE_MIN	(5)
50
#define CFQ_SERVICE_SHIFT       12
51

52
#define CFQQ_SEEK_THR		(sector_t)(8 * 100)
53
#define CFQQ_CLOSE_THR		(sector_t)(8 * 1024)
54
#define CFQQ_SECT_THR_NONROT	(sector_t)(2 * 32)
55
#define CFQQ_SEEKY(cfqq)	(hweight32(cfqq->seek_history) > 32/8)
56

57
#define RQ_CIC(rq)		icq_to_cic((rq)->elevator_private[0])
58 59
#define RQ_CFQQ(rq)		(struct cfq_queue *) ((rq)->elevator_private[1])
#define RQ_CFQG(rq)		(struct cfq_group *) ((rq)->elevator_private[2])
Linus Torvalds's avatar
Linus Torvalds committed
60

61
static struct kmem_cache *cfq_pool;
62
static struct kmem_cache *cfq_icq_pool;
Linus Torvalds's avatar
Linus Torvalds committed
63

64 65 66 67
#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)

68
#define sample_valid(samples)	((samples) > 80)
69
#define rb_entry_cfqg(node)	rb_entry((node), struct cfq_group, rb_node)
70

71 72 73 74 75 76 77 78
struct cfq_ttime {
	unsigned long last_end_request;

	unsigned long ttime_total;
	unsigned long ttime_samples;
	unsigned long ttime_mean;
};

79 80 81 82 83 84 85 86 87
/*
 * 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;
88
	unsigned count;
89
	unsigned total_weight;
90
	u64 min_vdisktime;
91
	struct cfq_ttime ttime;
92
};
93 94
#define CFQ_RB_ROOT	(struct cfq_rb_root) { .rb = RB_ROOT, \
			.ttime = {.last_end_request = jiffies,},}
95

96 97 98 99 100
/*
 * Per process-grouping structure
 */
struct cfq_queue {
	/* reference count */
101
	int ref;
102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124
	/* 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;

125 126
	/* time when queue got scheduled in to dispatch first request. */
	unsigned long dispatch_start;
127
	unsigned int allocated_slice;
128
	unsigned int slice_dispatch;
129 130
	/* time when first request from queue completed and slice started. */
	unsigned long slice_start;
131 132 133
	unsigned long slice_end;
	long slice_resid;

134 135
	/* pending priority requests */
	int prio_pending;
136 137 138 139 140
	/* number of requests that are on the dispatch list or inside driver */
	int dispatched;

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

143 144
	pid_t pid;

145
	u32 seek_history;
146 147
	sector_t last_request_pos;

148
	struct cfq_rb_root *service_tree;
Jeff Moyer's avatar
Jeff Moyer committed
149
	struct cfq_queue *new_cfqq;
150
	struct cfq_group *cfqg;
151 152
	/* Number of sectors dispatched from queue in single dispatch round */
	unsigned long nr_sectors;
153 154
};

155
/*
156
 * First index in the service_trees.
157 158 159 160
 * IDLE is handled separately, so it has negative index
 */
enum wl_prio_t {
	BE_WORKLOAD = 0,
161 162
	RT_WORKLOAD = 1,
	IDLE_WORKLOAD = 2,
163
	CFQ_PRIO_NR,
164 165
};

166 167 168 169 170 171 172 173 174
/*
 * Second index in the service_trees.
 */
enum wl_type_t {
	ASYNC_WORKLOAD = 0,
	SYNC_NOIDLE_WORKLOAD = 1,
	SYNC_WORKLOAD = 2
};

175 176
/* This is per cgroup per device grouping structure */
struct cfq_group {
177 178 179 180 181
	/* group service_tree member */
	struct rb_node rb_node;

	/* group service_tree key */
	u64 vdisktime;
182
	unsigned int weight;
183 184
	unsigned int new_weight;
	bool needs_update;
185 186 187 188

	/* number of cfqq currently on this group */
	int nr_cfqq;

189
	/*
190
	 * Per group busy queues average. Useful for workload slice calc. We
191 192 193 194 195 196 197 198 199 200 201
	 * create the array for each prio class but at run time it is used
	 * only for RT and BE class and slot for IDLE class remains unused.
	 * This is primarily done to avoid confusion and a gcc warning.
	 */
	unsigned int busy_queues_avg[CFQ_PRIO_NR];
	/*
	 * rr lists of queues with requests. We maintain service trees for
	 * RT and BE classes. These trees are subdivided in subclasses
	 * of SYNC, SYNC_NOIDLE and ASYNC based on workload type. For IDLE
	 * class there is no subclassification and all the cfq queues go on
	 * a single tree service_tree_idle.
202 203 204 205
	 * Counts are embedded in the cfq_rb_root
	 */
	struct cfq_rb_root service_trees[2][3];
	struct cfq_rb_root service_tree_idle;
206 207 208 209

	unsigned long saved_workload_slice;
	enum wl_type_t saved_workload;
	enum wl_prio_t saved_serving_prio;
210 211 212
	struct blkio_group blkg;
#ifdef CONFIG_CFQ_GROUP_IOSCHED
	struct hlist_node cfqd_node;
213
	int ref;
214
#endif
215 216
	/* number of requests that are on the dispatch list or inside driver */
	int dispatched;
217
	struct cfq_ttime ttime;
218
};
219

220 221 222 223 224 225
struct cfq_io_cq {
	struct io_cq		icq;		/* must be the first member */
	struct cfq_queue	*cfqq[2];
	struct cfq_ttime	ttime;
};

226 227 228
/*
 * Per block device queue structure
 */
Linus Torvalds's avatar
Linus Torvalds committed
229
struct cfq_data {
230
	struct request_queue *queue;
231 232
	/* Root service tree for cfq_groups */
	struct cfq_rb_root grp_service_tree;
233
	struct cfq_group root_group;
234

235 236
	/*
	 * The priority currently being served
237
	 */
238
	enum wl_prio_t serving_prio;
239 240
	enum wl_type_t serving_type;
	unsigned long workload_expires;
241
	struct cfq_group *serving_group;
242 243 244 245 246 247 248 249

	/*
	 * 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];

250
	unsigned int busy_queues;
251
	unsigned int busy_sync_queues;
252

253 254
	int rq_in_driver;
	int rq_in_flight[2];
255 256 257 258 259

	/*
	 * queue-depth detection
	 */
	int rq_queued;
260
	int hw_tag;
261 262 263 264 265 266 267 268
	/*
	 * hw_tag can be
	 * -1 => indeterminate, (cfq will behave as if NCQ is present, to allow better detection)
	 *  1 => NCQ is present (hw_tag_est_depth is the estimated max depth)
	 *  0 => no NCQ
	 */
	int hw_tag_est_depth;
	unsigned int hw_tag_samples;
Linus Torvalds's avatar
Linus Torvalds committed
269

270 271 272 273
	/*
	 * idle window management
	 */
	struct timer_list idle_slice_timer;
274
	struct work_struct unplug_work;
Linus Torvalds's avatar
Linus Torvalds committed
275

276
	struct cfq_queue *active_queue;
277
	struct cfq_io_cq *active_cic;
278

279 280 281 282 283
	/*
	 * async queue for each priority case
	 */
	struct cfq_queue *async_cfqq[2][IOPRIO_BE_NR];
	struct cfq_queue *async_idle_cfqq;
284

Jens Axboe's avatar
Jens Axboe committed
285
	sector_t last_position;
Linus Torvalds's avatar
Linus Torvalds committed
286 287 288 289 290

	/*
	 * tunables, see top of file
	 */
	unsigned int cfq_quantum;
291
	unsigned int cfq_fifo_expire[2];
Linus Torvalds's avatar
Linus Torvalds committed
292 293
	unsigned int cfq_back_penalty;
	unsigned int cfq_back_max;
294 295 296
	unsigned int cfq_slice[2];
	unsigned int cfq_slice_async_rq;
	unsigned int cfq_slice_idle;
297
	unsigned int cfq_group_idle;
298
	unsigned int cfq_latency;
299

300
	struct list_head icq_list;
Linus Torvalds's avatar
Linus Torvalds committed
301

302 303 304 305
	/*
	 * Fallback dummy cfqq for extreme OOM conditions
	 */
	struct cfq_queue oom_cfqq;
306

307
	unsigned long last_delayed_sync;
308 309 310

	/* List of cfq groups being managed on this device*/
	struct hlist_head cfqg_list;
311 312 313

	/* Number of groups which are on blkcg->blkg_list */
	unsigned int nr_blkcg_linked_grps;
Linus Torvalds's avatar
Linus Torvalds committed
314 315
};

316 317
static struct cfq_group *cfq_get_next_cfqg(struct cfq_data *cfqd);

318 319
static struct cfq_rb_root *service_tree_for(struct cfq_group *cfqg,
					    enum wl_prio_t prio,
320
					    enum wl_type_t type)
321
{
322 323 324
	if (!cfqg)
		return NULL;

325
	if (prio == IDLE_WORKLOAD)
326
		return &cfqg->service_tree_idle;
327

328
	return &cfqg->service_trees[prio][type];
329 330
}

Jens Axboe's avatar
Jens Axboe committed
331
enum cfqq_state_flags {
332 333
	CFQ_CFQQ_FLAG_on_rr = 0,	/* on round-robin busy list */
	CFQ_CFQQ_FLAG_wait_request,	/* waiting for a request */
334
	CFQ_CFQQ_FLAG_must_dispatch,	/* must be allowed a dispatch */
335 336 337 338
	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 */
339
	CFQ_CFQQ_FLAG_slice_new,	/* no requests dispatched in slice */
340
	CFQ_CFQQ_FLAG_sync,		/* synchronous queue */
341
	CFQ_CFQQ_FLAG_coop,		/* cfqq is shared */
342
	CFQ_CFQQ_FLAG_split_coop,	/* shared cfqq will be splitted */
343
	CFQ_CFQQ_FLAG_deep,		/* sync cfqq experienced large depth */
344
	CFQ_CFQQ_FLAG_wait_busy,	/* Waiting for next request */
Jens Axboe's avatar
Jens Axboe committed
345 346 347 348 349
};

#define CFQ_CFQQ_FNS(name)						\
static inline void cfq_mark_cfqq_##name(struct cfq_queue *cfqq)		\
{									\
350
	(cfqq)->flags |= (1 << CFQ_CFQQ_FLAG_##name);			\
Jens Axboe's avatar
Jens Axboe committed
351 352 353
}									\
static inline void cfq_clear_cfqq_##name(struct cfq_queue *cfqq)	\
{									\
354
	(cfqq)->flags &= ~(1 << CFQ_CFQQ_FLAG_##name);			\
Jens Axboe's avatar
Jens Axboe committed
355 356 357
}									\
static inline int cfq_cfqq_##name(const struct cfq_queue *cfqq)		\
{									\
358
	return ((cfqq)->flags & (1 << CFQ_CFQQ_FLAG_##name)) != 0;	\
Jens Axboe's avatar
Jens Axboe committed
359 360 361 362
}

CFQ_CFQQ_FNS(on_rr);
CFQ_CFQQ_FNS(wait_request);
363
CFQ_CFQQ_FNS(must_dispatch);
Jens Axboe's avatar
Jens Axboe committed
364 365 366 367
CFQ_CFQQ_FNS(must_alloc_slice);
CFQ_CFQQ_FNS(fifo_expire);
CFQ_CFQQ_FNS(idle_window);
CFQ_CFQQ_FNS(prio_changed);
368
CFQ_CFQQ_FNS(slice_new);
369
CFQ_CFQQ_FNS(sync);
370
CFQ_CFQQ_FNS(coop);
371
CFQ_CFQQ_FNS(split_coop);
372
CFQ_CFQQ_FNS(deep);
373
CFQ_CFQQ_FNS(wait_busy);
Jens Axboe's avatar
Jens Axboe committed
374 375
#undef CFQ_CFQQ_FNS

376
#ifdef CONFIG_CFQ_GROUP_IOSCHED
377 378 379
#define cfq_log_cfqq(cfqd, cfqq, fmt, args...)	\
	blk_add_trace_msg((cfqd)->queue, "cfq%d%c %s " fmt, (cfqq)->pid, \
			cfq_cfqq_sync((cfqq)) ? 'S' : 'A', \
380
			blkg_path(&(cfqq)->cfqg->blkg), ##args)
381 382 383

#define cfq_log_cfqg(cfqd, cfqg, fmt, args...)				\
	blk_add_trace_msg((cfqd)->queue, "%s " fmt,			\
384
				blkg_path(&(cfqg)->blkg), ##args)       \
385 386

#else
387 388
#define cfq_log_cfqq(cfqd, cfqq, fmt, args...)	\
	blk_add_trace_msg((cfqd)->queue, "cfq%d " fmt, (cfqq)->pid, ##args)
389
#define cfq_log_cfqg(cfqd, cfqg, fmt, args...)		do {} while (0)
390
#endif
391 392 393
#define cfq_log(cfqd, fmt, args...)	\
	blk_add_trace_msg((cfqd)->queue, "cfq " fmt, ##args)

394 395 396 397 398 399 400 401 402 403
/* Traverses through cfq group service trees */
#define for_each_cfqg_st(cfqg, i, j, st) \
	for (i = 0; i <= IDLE_WORKLOAD; i++) \
		for (j = 0, st = i < IDLE_WORKLOAD ? &cfqg->service_trees[i][j]\
			: &cfqg->service_tree_idle; \
			(i < IDLE_WORKLOAD && j <= SYNC_WORKLOAD) || \
			(i == IDLE_WORKLOAD && j == 0); \
			j++, st = i < IDLE_WORKLOAD ? \
			&cfqg->service_trees[i][j]: NULL) \

404 405 406 407 408 409 410 411 412 413 414 415
static inline bool cfq_io_thinktime_big(struct cfq_data *cfqd,
	struct cfq_ttime *ttime, bool group_idle)
{
	unsigned long slice;
	if (!sample_valid(ttime->ttime_samples))
		return false;
	if (group_idle)
		slice = cfqd->cfq_group_idle;
	else
		slice = cfqd->cfq_slice_idle;
	return ttime->ttime_mean > slice;
}
416

417 418 419 420 421 422 423 424 425 426 427 428 429 430 431
static inline bool iops_mode(struct cfq_data *cfqd)
{
	/*
	 * If we are not idling on queues and it is a NCQ drive, parallel
	 * execution of requests is on and measuring time is not possible
	 * in most of the cases until and unless we drive shallower queue
	 * depths and that becomes a performance bottleneck. In such cases
	 * switch to start providing fairness in terms of number of IOs.
	 */
	if (!cfqd->cfq_slice_idle && cfqd->hw_tag)
		return true;
	else
		return false;
}

432 433 434 435 436 437 438 439 440
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;
}

441 442 443 444 445 446 447 448 449 450

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;
}

451 452 453
static inline int cfq_group_busy_queues_wl(enum wl_prio_t wl,
					struct cfq_data *cfqd,
					struct cfq_group *cfqg)
454 455
{
	if (wl == IDLE_WORKLOAD)
456
		return cfqg->service_tree_idle.count;
457

458 459 460
	return cfqg->service_trees[wl][ASYNC_WORKLOAD].count
		+ cfqg->service_trees[wl][SYNC_NOIDLE_WORKLOAD].count
		+ cfqg->service_trees[wl][SYNC_WORKLOAD].count;
461 462
}

463 464 465 466 467 468 469
static inline int cfqg_busy_async_queues(struct cfq_data *cfqd,
					struct cfq_group *cfqg)
{
	return cfqg->service_trees[RT_WORKLOAD][ASYNC_WORKLOAD].count
		+ cfqg->service_trees[BE_WORKLOAD][ASYNC_WORKLOAD].count;
}

470
static void cfq_dispatch_insert(struct request_queue *, struct request *);
471
static struct cfq_queue *cfq_get_queue(struct cfq_data *, bool,
472
				       struct io_context *, gfp_t);
473
static struct cfq_io_cq *cfq_cic_lookup(struct cfq_data *, struct io_context *);
474

475 476 477 478 479 480 481
static inline struct cfq_io_cq *icq_to_cic(struct io_cq *icq)
{
	/* cic->icq is the first member, %NULL will convert to %NULL */
	return container_of(icq, struct cfq_io_cq, icq);
}

static inline struct cfq_queue *cic_to_cfqq(struct cfq_io_cq *cic, bool is_sync)
482
{
483
	return cic->cfqq[is_sync];
484 485
}

486 487
static inline void cic_set_cfqq(struct cfq_io_cq *cic, struct cfq_queue *cfqq,
				bool is_sync)
488
{
489
	cic->cfqq[is_sync] = cfqq;
490 491
}

492
static inline struct cfq_data *cic_to_cfqd(struct cfq_io_cq *cic)
493
{
494
	return cic->icq.q->elevator->elevator_data;
495 496
}

497 498 499 500
/*
 * 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).
 */
501
static inline bool cfq_bio_sync(struct bio *bio)
502
{
503
	return bio_data_dir(bio) == READ || (bio->bi_rw & REQ_SYNC);
504
}
Linus Torvalds's avatar
Linus Torvalds committed
505

Andrew Morton's avatar
Andrew Morton committed
506 507 508 509
/*
 * scheduler run of queue, if there are requests pending and no one in the
 * driver that will restart queueing
 */
510
static inline void cfq_schedule_dispatch(struct cfq_data *cfqd)
Andrew Morton's avatar
Andrew Morton committed
511
{
512 513
	if (cfqd->busy_queues) {
		cfq_log(cfqd, "schedule dispatch");
514
		kblockd_schedule_work(cfqd->queue, &cfqd->unplug_work);
515
	}
Andrew Morton's avatar
Andrew Morton committed
516 517
}

518 519 520 521 522
/*
 * 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.
 */
523
static inline int cfq_prio_slice(struct cfq_data *cfqd, bool sync,
524
				 unsigned short prio)
525
{
526
	const int base_slice = cfqd->cfq_slice[sync];
527

528 529 530 531
	WARN_ON(prio >= IOPRIO_BE_NR);

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

533 534 535 536
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);
537 538
}

539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571
static inline u64 cfq_scale_slice(unsigned long delta, struct cfq_group *cfqg)
{
	u64 d = delta << CFQ_SERVICE_SHIFT;

	d = d * BLKIO_WEIGHT_DEFAULT;
	do_div(d, cfqg->weight);
	return d;
}

static inline u64 max_vdisktime(u64 min_vdisktime, u64 vdisktime)
{
	s64 delta = (s64)(vdisktime - min_vdisktime);
	if (delta > 0)
		min_vdisktime = vdisktime;

	return min_vdisktime;
}

static inline u64 min_vdisktime(u64 min_vdisktime, u64 vdisktime)
{
	s64 delta = (s64)(vdisktime - min_vdisktime);
	if (delta < 0)
		min_vdisktime = vdisktime;

	return min_vdisktime;
}

static void update_min_vdisktime(struct cfq_rb_root *st)
{
	struct cfq_group *cfqg;

	if (st->left) {
		cfqg = rb_entry_cfqg(st->left);
572 573
		st->min_vdisktime = max_vdisktime(st->min_vdisktime,
						  cfqg->vdisktime);
574 575 576
	}
}

577 578 579 580 581 582
/*
 * 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
 */

583 584
static inline unsigned cfq_group_get_avg_queues(struct cfq_data *cfqd,
					struct cfq_group *cfqg, bool rt)
585
{
586 587 588
	unsigned min_q, max_q;
	unsigned mult  = cfq_hist_divisor - 1;
	unsigned round = cfq_hist_divisor / 2;
589
	unsigned busy = cfq_group_busy_queues_wl(rt, cfqd, cfqg);
590

591 592 593
	min_q = min(cfqg->busy_queues_avg[rt], busy);
	max_q = max(cfqg->busy_queues_avg[rt], busy);
	cfqg->busy_queues_avg[rt] = (mult * max_q + min_q + round) /
594
		cfq_hist_divisor;
595 596 597 598 599 600 601 602 603
	return cfqg->busy_queues_avg[rt];
}

static inline unsigned
cfq_group_slice(struct cfq_data *cfqd, struct cfq_group *cfqg)
{
	struct cfq_rb_root *st = &cfqd->grp_service_tree;

	return cfq_target_latency * cfqg->weight / st->total_weight;
604 605
}

606
static inline unsigned
607
cfq_scaled_cfqq_slice(struct cfq_data *cfqd, struct cfq_queue *cfqq)
608
{
609 610
	unsigned slice = cfq_prio_to_slice(cfqd, cfqq);
	if (cfqd->cfq_latency) {
611 612 613 614 615 616
		/*
		 * interested queues (we consider only the ones with the same
		 * priority class in the cfq group)
		 */
		unsigned iq = cfq_group_get_avg_queues(cfqd, cfqq->cfqg,
						cfq_class_rt(cfqq));
617 618
		unsigned sync_slice = cfqd->cfq_slice[1];
		unsigned expect_latency = sync_slice * iq;
619 620 621
		unsigned group_slice = cfq_group_slice(cfqd, cfqq->cfqg);

		if (expect_latency > group_slice) {
622 623 624 625 626 627 628
			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 */
629
			slice = max(slice * group_slice / expect_latency,
630 631 632
				    low_slice);
		}
	}
633 634 635 636 637 638
	return slice;
}

static inline void
cfq_set_prio_slice(struct cfq_data *cfqd, struct cfq_queue *cfqq)
{
639
	unsigned slice = cfq_scaled_cfqq_slice(cfqd, cfqq);
640

641
	cfqq->slice_start = jiffies;
642
	cfqq->slice_end = jiffies + slice;
643
	cfqq->allocated_slice = slice;
644
	cfq_log_cfqq(cfqd, cfqq, "set_slice=%lu", cfqq->slice_end - jiffies);
645 646 647 648 649 650 651
}

/*
 * 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.
 */
652
static inline bool cfq_slice_used(struct cfq_queue *cfqq)
653 654
{
	if (cfq_cfqq_slice_new(cfqq))
Shaohua Li's avatar
Shaohua Li committed
655
		return false;
656
	if (time_before(jiffies, cfqq->slice_end))
Shaohua Li's avatar
Shaohua Li committed
657
		return false;
658

Shaohua Li's avatar
Shaohua Li committed
659
	return true;
660 661
}

Linus Torvalds's avatar
Linus Torvalds committed
662
/*
Jens Axboe's avatar
Jens Axboe committed
663
 * Lifted from AS - choose which of rq1 and rq2 that is best served now.
Linus Torvalds's avatar
Linus Torvalds committed
664
 * We choose the request that is closest to the head right now. Distance
665
 * behind the head is penalized and only allowed to a certain extent.
Linus Torvalds's avatar
Linus Torvalds committed
666
 */
Jens Axboe's avatar
Jens Axboe committed
667
static struct request *
668
cfq_choose_req(struct cfq_data *cfqd, struct request *rq1, struct request *rq2, sector_t last)
Linus Torvalds's avatar
Linus Torvalds committed
669
{
670
	sector_t s1, s2, d1 = 0, d2 = 0;
Linus Torvalds's avatar
Linus Torvalds committed
671
	unsigned long back_max;
672 673 674
#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
675

Jens Axboe's avatar
Jens Axboe committed
676 677 678 679
	if (rq1 == NULL || rq1 == rq2)
		return rq2;
	if (rq2 == NULL)
		return rq1;
680

681 682 683
	if (rq_is_sync(rq1) != rq_is_sync(rq2))
		return rq_is_sync(rq1) ? rq1 : rq2;

684 685
	if ((rq1->cmd_flags ^ rq2->cmd_flags) & REQ_PRIO)
		return rq1->cmd_flags & REQ_PRIO ? rq1 : rq2;
686

687 688
	s1 = blk_rq_pos(rq1);
	s2 = blk_rq_pos(rq2);
Linus Torvalds's avatar
Linus Torvalds committed
689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704

	/*
	 * 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
705
		wrap |= CFQ_RQ1_WRAP;
Linus Torvalds's avatar
Linus Torvalds committed
706 707 708 709 710 711

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

	/* Found required data */
715 716 717 718 719 720

	/*
	 * 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
721
	case 0: /* common case for CFQ: rq1 and rq2 not wrapped */
722
		if (d1 < d2)
Jens Axboe's avatar
Jens Axboe committed
723
			return rq1;
724
		else if (d2 < d1)
Jens Axboe's avatar
Jens Axboe committed
725
			return rq2;
726 727
		else {
			if (s1 >= s2)
Jens Axboe's avatar
Jens Axboe committed
728
				return rq1;
729
			else
Jens Axboe's avatar
Jens Axboe committed
730
				return rq2;
731
		}
Linus Torvalds's avatar
Linus Torvalds committed
732

733
	case CFQ_RQ2_WRAP:
Jens Axboe's avatar
Jens Axboe committed
734
		return rq1;
735
	case CFQ_RQ1_WRAP:
Jens Axboe's avatar
Jens Axboe committed
736 737
		return rq2;
	case (CFQ_RQ1_WRAP|CFQ_RQ2_WRAP): /* both rqs wrapped */
738 739 740 741 742 743 744 745
	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
746
			return rq1;
Linus Torvalds's avatar
Linus Torvalds committed
747
		else
Jens Axboe's avatar
Jens Axboe committed
748
			return rq2;
Linus Torvalds's avatar
Linus Torvalds committed
749 750 751
	}
}

752 753 754
/*
 * The below is leftmost cache rbtree addon
 */
755
static struct cfq_queue *cfq_rb_first(struct cfq_rb_root *root)
756
{
757 758 759 760
	/* Service tree is empty */
	if (!root->count)
		return NULL;

761 762 763
	if (!root->left)
		root->left = rb_first(&root->rb);

764 765 766 767
	if (root->left)
		return rb_entry(root->left, struct cfq_queue, rb_node);

	return NULL;
768 769
}

770 771 772 773 774 775 776 777 778 779 780
static struct cfq_group *cfq_rb_first_group(struct cfq_rb_root *root)
{
	if (!root->left)
		root->left = rb_first(&root->rb);

	if (root->left)
		return rb_entry_cfqg(root->left);

	return NULL;
}

781 782 783 784 785 786
static void rb_erase_init(struct rb_node *n, struct rb_root *root)
{
	rb_erase(n, root);
	RB_CLEAR_NODE(n);
}

787 788 789 790
static void cfq_rb_erase(struct rb_node *n, struct cfq_rb_root *root)
{
	if (root->left == n)
		root->left = NULL;
791
	rb_erase_init(n, &root->rb);
792
	--root->count;
793 794
}

Linus Torvalds's avatar
Linus Torvalds committed
795 796 797
/*
 * would be nice to take fifo expire time into account as well
 */
Jens Axboe's avatar
Jens Axboe committed
798 799 800
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
801
{
802 803
	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
804
	struct request *next = NULL, *prev = NULL;
Linus Torvalds's avatar
Linus Torvalds committed
805

806
	BUG_ON(RB_EMPTY_NODE(&last->rb_node));
Linus Torvalds's avatar
Linus Torvalds committed
807 808

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

811
	if (rbnext)
Jens Axboe's avatar
Jens Axboe committed
812
		next = rb_entry_rq(rbnext);
813 814 815
	else {
		rbnext = rb_first(&cfqq->sort_list);
		if (rbnext && rbnext != &last->rb_node)
Jens Axboe's avatar
Jens Axboe committed
816
			next = rb_entry_rq(rbnext);
817
	}
Linus Torvalds's avatar
Linus Torvalds committed
818

819
	return cfq_choose_req(cfqd, next, prev, blk_rq_pos(last));
Linus Torvalds's avatar
Linus Torvalds committed
820 821
}

822 823
static unsigned long cfq_slice_offset(struct cfq_data *cfqd,
				      struct cfq_queue *cfqq)
Linus Torvalds's avatar
Linus Torvalds committed
824
{
825 826 827
	/*
	 * just an approximation, should be ok.
	 */
828
	return (cfqq->cfqg->nr_cfqq - 1) * (cfq_prio_slice(cfqd, 1, 0) -
829
		       cfq_prio_slice(cfqd, cfq_cfqq_sync(cfqq), cfqq->ioprio));
830 831
}

832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866
static inline s64
cfqg_key(struct cfq_rb_root *st, struct cfq_group *cfqg)
{
	return cfqg->vdisktime - st->min_vdisktime;
}

static void
__cfq_group_service_tree_add(struct cfq_rb_root *st, struct cfq_group *cfqg)
{
	struct rb_node **node = &st->rb.rb_node;
	struct rb_node *parent = NULL;
	struct cfq_group *__cfqg;
	s64 key = cfqg_key(st, cfqg);
	int left = 1;

	while (*node != NULL) {
		parent = *node;
		__cfqg = rb_entry_cfqg(parent);

		if (key < cfqg_key(st, __cfqg))
			node = &parent->rb_left;
		else {
			node = &parent->rb_right;
			left = 0;
		}
	}

	if (left)
		st->left = &cfqg->rb_node;

	rb_link_node(&cfqg->rb_node, parent, node);
	rb_insert_color(&cfqg->rb_node, &st->rb);
}

static void
867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887
cfq_update_group_weight(struct cfq_group *cfqg)
{
	BUG_ON(!RB_EMPTY_NODE(&cfqg->rb_node));
	if (cfqg->needs_update) {
		cfqg->weight = cfqg->new_weight;
		cfqg->needs_update = false;
	}
}

static void
cfq_group_service_tree_add(struct cfq_rb_root *st, struct cfq_group *cfqg)
{
	BUG_ON(!RB_EMPTY_NODE(&cfqg->rb_node));

	cfq_update_group_weight(cfqg);
	__cfq_group_service_tree_add(st, cfqg);
	st->total_weight += cfqg->weight;
}

static void
cfq_group_notify_queue_add(struct cfq_data *cfqd, struct cfq_group *cfqg)
888 889 890 891 892 893
{
	struct cfq_rb_root *st = &cfqd->grp_service_tree;
	struct cfq_group *__cfqg;
	struct rb_node *n;

	cfqg->nr_cfqq++;
894
	if (!RB_EMPTY_NODE(&cfqg->rb_node))
895 896 897 898 899
		return;

	/*
	 * Currently put the group at the end. Later implement something
	 * so that groups get lesser vtime based on their weights, so that
Lucas De Marchi's avatar
Lucas De Marchi committed
900
	 * if group does not loose all if it was not continuously backlogged.
901 902 903 904 905 906 907
	 */
	n = rb_last(&st->rb);
	if (n) {
		__cfqg = rb_entry_cfqg(n);
		cfqg->vdisktime = __cfqg->vdisktime + CFQ_IDLE_DELAY;
	} else
		cfqg->vdisktime = st->min_vdisktime;
908 909
	cfq_group_service_tree_add(st, cfqg);
}
910

911 912 913 914 915 916
static void
cfq_group_service_tree_del(struct cfq_rb_root *st, struct cfq_group *cfqg)
{
	st->total_weight -= cfqg->weight;
	if (!RB_EMPTY_NODE(&cfqg->rb_node))
		cfq_rb_erase(&cfqg->rb_node, st);
917 918 919
}

static void
920
cfq_group_notify_queue_del(struct cfq_data *cfqd, struct cfq_group *cfqg)
921 922 923 924 925
{
	struct cfq_rb_root *st = &cfqd->grp_service_tree;

	BUG_ON(cfqg->nr_cfqq < 1);
	cfqg->nr_cfqq--;
926

927 928 929 930
	/* If there are other cfq queues under this group, don't delete it */
	if (cfqg->nr_cfqq)
		return;

931
	cfq_log_cfqg(cfqd, cfqg, "del_from_rr group");
932
	cfq_group_service_tree_del(st, cfqg);
933
	cfqg->saved_workload_slice = 0;
934
	cfq_blkiocg_update_dequeue_stats(&cfqg->blkg, 1);
935 936
}

937 938
static inline unsigned int cfq_cfqq_slice_usage(struct cfq_queue *cfqq,
						unsigned int *unaccounted_time)
939
{
940
	unsigned int slice_used;
941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956

	/*
	 * Queue got expired before even a single request completed or
	 * got expired immediately after first request completion.
	 */
	if (!cfqq->slice_start || cfqq->slice_start == jiffies) {
		/*
		 * Also charge the seek time incurred to the group, otherwise
		 * if there are mutiple queues in the group, each can dispatch
		 * a single request on seeky media and cause lots of seek time
		 * and group will never know it.
		 */
		slice_used = max_t(unsigned, (jiffies - cfqq->dispatch_start),
					1);
	} else {
		slice_used = jiffies - cfqq->slice_start;
957 958
		if (slice_used > cfqq->allocated_slice) {
			*unaccounted_time = slice_used - cfqq->allocated_slice;
959
			slice_used = cfqq->allocated_slice;
960 961 962 963
		}
		if (time_after(cfqq->slice_start, cfqq->dispatch_start))
			*unaccounted_time += cfqq->slice_start -
					cfqq->dispatch_start;
964 965 966 967 968 969
	}

	return slice_used;
}

static void cfq_group_served(struct cfq_data *cfqd, struct cfq_group *cfqg,
970
				struct cfq_queue *cfqq)
971 972
{
	struct cfq_rb_root *st = &cfqd->grp_service_tree;
973
	unsigned int used_sl, charge, unaccounted_sl = 0;
974 975 976 977
	int nr_sync = cfqg->nr_cfqq - cfqg_busy_async_queues(cfqd, cfqg)
			- cfqg->service_tree_idle.count;

	BUG_ON(nr_sync < 0);
978
	used_sl = charge = cfq_cfqq_slice_usage(cfqq, &unaccounted_sl);
979

980 981 982 983
	if (iops_mode(cfqd))
		charge = cfqq->slice_dispatch;
	else if (!cfq_cfqq_sync(cfqq) && !nr_sync)
		charge = cfqq->allocated_slice;
984 985

	/* Can't update vdisktime while group is on service tree */
986
	cfq_group_service_tree_del(st, cfqg);
987
	cfqg->vdisktime += cfq_scale_slice(charge, cfqg);
988 989
	/* If a new weight was requested, update now, off tree */
	cfq_group_service_tree_add(st, cfqg);
990 991 992 993 994 995 996 997 998

	/* This group is being expired. Save the context */
	if (time_after(cfqd->workload_expires, jiffies)) {
		cfqg->saved_workload_slice = cfqd->workload_expires
						- jiffies;
		cfqg->saved_workload = cfqd->serving_type;
		cfqg->saved_serving_prio = cfqd->serving_prio;
	} else
		cfqg->saved_workload_slice = 0;
999 1000 1001

	cfq_log_cfqg(cfqd, cfqg, "served: vt=%llu min_vt=%llu", cfqg->vdisktime,
					st->min_vdisktime);
1002 1003 1004 1005
	cfq_log_cfqq(cfqq->cfqd, cfqq,
		     "sl_used=%u disp=%u charge=%u iops=%u sect=%lu",
		     used_sl, cfqq->slice_dispatch, charge,
		     iops_mode(cfqd), cfqq->nr_sectors);
1006 1007
	cfq_blkiocg_update_timeslice_used(&cfqg->blkg, used_sl,
					  unaccounted_sl);
1008
	cfq_blkiocg_set_start_empty_time(&cfqg->blkg);
1009 1010
}

1011 1012 1013 1014 1015 1016 1017 1018
#ifdef CONFIG_CFQ_GROUP_IOSCHED
static inline struct cfq_group *cfqg_of_blkg(struct blkio_group *blkg)
{
	if (blkg)
		return container_of(blkg, struct cfq_group, blkg);
	return NULL;
}

Paul Bolle's avatar
Paul Bolle committed
1019 1020
static void cfq_update_blkio_group_weight(void *key, struct blkio_group *blkg,
					  unsigned int weight)
1021
{
1022 1023 1024
	struct cfq_group *cfqg = cfqg_of_blkg(blkg);
	cfqg->new_weight = weight;
	cfqg->needs_update = true;
1025 1026
}

1027 1028
static void cfq_init_add_cfqg_lists(struct cfq_data *cfqd,
			struct cfq_group *cfqg, struct blkio_cgroup *blkcg)
1029
{
1030 1031
	struct backing_dev_info *bdi = &cfqd->queue->backing_dev_info;
	unsigned int major, minor;
1032