cfq-iosched.c 104 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 "cfq.h"
Linus Torvalds's avatar
Linus Torvalds committed
18 19 20 21

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

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

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

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

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

56 57
#define RQ_CIC(rq)		\
	((struct cfq_io_context *) (rq)->elevator_private)
58
#define RQ_CFQQ(rq)		(struct cfq_queue *) ((rq)->elevator_private2)
59
#define RQ_CFQG(rq)		(struct cfq_group *) ((rq)->elevator_private3)
Linus Torvalds's avatar
Linus Torvalds committed
60

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

64
static DEFINE_PER_CPU(unsigned long, cfq_ioc_count);
65
static struct completion *ioc_gone;
66
static DEFINE_SPINLOCK(ioc_gone_lock);
67

68 69 70
static DEFINE_SPINLOCK(cic_index_lock);
static DEFINE_IDA(cic_index_ida);

71 72 73 74
#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)

75
#define sample_valid(samples)	((samples) > 80)
76
#define rb_entry_cfqg(node)	rb_entry((node), struct cfq_group, rb_node)
77

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

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

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

141 142
	pid_t pid;

143
	u32 seek_history;
144 145
	sector_t last_request_pos;

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

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

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

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

	/* group service_tree key */
	u64 vdisktime;
181
	unsigned int weight;
182 183 184 185

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

186
	/*
187 188 189 190 191 192 193 194 195 196 197 198
	 * Per group busy queus average. Useful for workload slice calc. We
	 * 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.
199 200 201 202
	 * Counts are embedded in the cfq_rb_root
	 */
	struct cfq_rb_root service_trees[2][3];
	struct cfq_rb_root service_tree_idle;
203 204 205 206

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

216 217 218
/*
 * Per block device queue structure
 */
Linus Torvalds's avatar
Linus Torvalds committed
219
struct cfq_data {
220
	struct request_queue *queue;
221 222
	/* Root service tree for cfq_groups */
	struct cfq_rb_root grp_service_tree;
223
	struct cfq_group root_group;
224

225 226
	/*
	 * The priority currently being served
227
	 */
228
	enum wl_prio_t serving_prio;
229 230
	enum wl_type_t serving_type;
	unsigned long workload_expires;
231
	struct cfq_group *serving_group;
232 233 234 235 236 237 238 239

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

240 241
	unsigned int busy_queues;

242 243
	int rq_in_driver;
	int rq_in_flight[2];
244 245 246 247 248

	/*
	 * queue-depth detection
	 */
	int rq_queued;
249
	int hw_tag;
250 251 252 253 254 255 256 257
	/*
	 * 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
258

259 260 261 262
	/*
	 * idle window management
	 */
	struct timer_list idle_slice_timer;
263
	struct work_struct unplug_work;
Linus Torvalds's avatar
Linus Torvalds committed
264

265 266 267
	struct cfq_queue *active_queue;
	struct cfq_io_context *active_cic;

268 269 270 271 272
	/*
	 * async queue for each priority case
	 */
	struct cfq_queue *async_cfqq[2][IOPRIO_BE_NR];
	struct cfq_queue *async_idle_cfqq;
273

Jens Axboe's avatar
Jens Axboe committed
274
	sector_t last_position;
Linus Torvalds's avatar
Linus Torvalds committed
275 276 277 278 279

	/*
	 * tunables, see top of file
	 */
	unsigned int cfq_quantum;
280
	unsigned int cfq_fifo_expire[2];
Linus Torvalds's avatar
Linus Torvalds committed
281 282
	unsigned int cfq_back_penalty;
	unsigned int cfq_back_max;
283 284 285
	unsigned int cfq_slice[2];
	unsigned int cfq_slice_async_rq;
	unsigned int cfq_slice_idle;
286
	unsigned int cfq_group_idle;
287
	unsigned int cfq_latency;
288
	unsigned int cfq_group_isolation;
289

290
	unsigned int cic_index;
291
	struct list_head cic_list;
Linus Torvalds's avatar
Linus Torvalds committed
292

293 294 295 296
	/*
	 * Fallback dummy cfqq for extreme OOM conditions
	 */
	struct cfq_queue oom_cfqq;
297

298
	unsigned long last_delayed_sync;
299 300 301

	/* List of cfq groups being managed on this device*/
	struct hlist_head cfqg_list;
302
	struct rcu_head rcu;
Linus Torvalds's avatar
Linus Torvalds committed
303 304
};

305 306
static struct cfq_group *cfq_get_next_cfqg(struct cfq_data *cfqd);

307 308
static struct cfq_rb_root *service_tree_for(struct cfq_group *cfqg,
					    enum wl_prio_t prio,
309
					    enum wl_type_t type)
310
{
311 312 313
	if (!cfqg)
		return NULL;

314
	if (prio == IDLE_WORKLOAD)
315
		return &cfqg->service_tree_idle;
316

317
	return &cfqg->service_trees[prio][type];
318 319
}

Jens Axboe's avatar
Jens Axboe committed
320
enum cfqq_state_flags {
321 322
	CFQ_CFQQ_FLAG_on_rr = 0,	/* on round-robin busy list */
	CFQ_CFQQ_FLAG_wait_request,	/* waiting for a request */
323
	CFQ_CFQQ_FLAG_must_dispatch,	/* must be allowed a dispatch */
324 325 326 327
	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 */
328
	CFQ_CFQQ_FLAG_slice_new,	/* no requests dispatched in slice */
329
	CFQ_CFQQ_FLAG_sync,		/* synchronous queue */
330
	CFQ_CFQQ_FLAG_coop,		/* cfqq is shared */
331
	CFQ_CFQQ_FLAG_split_coop,	/* shared cfqq will be splitted */
332
	CFQ_CFQQ_FLAG_deep,		/* sync cfqq experienced large depth */
333
	CFQ_CFQQ_FLAG_wait_busy,	/* Waiting for next request */
Jens Axboe's avatar
Jens Axboe committed
334 335 336 337 338
};

#define CFQ_CFQQ_FNS(name)						\
static inline void cfq_mark_cfqq_##name(struct cfq_queue *cfqq)		\
{									\
339
	(cfqq)->flags |= (1 << CFQ_CFQQ_FLAG_##name);			\
Jens Axboe's avatar
Jens Axboe committed
340 341 342
}									\
static inline void cfq_clear_cfqq_##name(struct cfq_queue *cfqq)	\
{									\
343
	(cfqq)->flags &= ~(1 << CFQ_CFQQ_FLAG_##name);			\
Jens Axboe's avatar
Jens Axboe committed
344 345 346
}									\
static inline int cfq_cfqq_##name(const struct cfq_queue *cfqq)		\
{									\
347
	return ((cfqq)->flags & (1 << CFQ_CFQQ_FLAG_##name)) != 0;	\
Jens Axboe's avatar
Jens Axboe committed
348 349 350 351
}

CFQ_CFQQ_FNS(on_rr);
CFQ_CFQQ_FNS(wait_request);
352
CFQ_CFQQ_FNS(must_dispatch);
Jens Axboe's avatar
Jens Axboe committed
353 354 355 356
CFQ_CFQQ_FNS(must_alloc_slice);
CFQ_CFQQ_FNS(fifo_expire);
CFQ_CFQQ_FNS(idle_window);
CFQ_CFQQ_FNS(prio_changed);
357
CFQ_CFQQ_FNS(slice_new);
358
CFQ_CFQQ_FNS(sync);
359
CFQ_CFQQ_FNS(coop);
360
CFQ_CFQQ_FNS(split_coop);
361
CFQ_CFQQ_FNS(deep);
362
CFQ_CFQQ_FNS(wait_busy);
Jens Axboe's avatar
Jens Axboe committed
363 364
#undef CFQ_CFQQ_FNS

365
#ifdef CONFIG_CFQ_GROUP_IOSCHED
366 367 368 369 370 371 372 373 374 375
#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', \
			blkg_path(&(cfqq)->cfqg->blkg), ##args);

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

#else
376 377
#define cfq_log_cfqq(cfqd, cfqq, fmt, args...)	\
	blk_add_trace_msg((cfqd)->queue, "cfq%d " fmt, (cfqq)->pid, ##args)
378 379
#define cfq_log_cfqg(cfqd, cfqg, fmt, args...)		do {} while (0);
#endif
380 381 382
#define cfq_log(cfqd, fmt, args...)	\
	blk_add_trace_msg((cfqd)->queue, "cfq " fmt, ##args)

383 384 385 386 387 388 389 390 391 392 393
/* 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) \


394 395 396 397 398 399 400 401 402 403 404 405 406 407 408
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;
}

409 410 411 412 413 414 415 416 417
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;
}

418 419 420 421 422 423 424 425 426 427

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

428 429 430
static inline int cfq_group_busy_queues_wl(enum wl_prio_t wl,
					struct cfq_data *cfqd,
					struct cfq_group *cfqg)
431 432
{
	if (wl == IDLE_WORKLOAD)
433
		return cfqg->service_tree_idle.count;
434

435 436 437
	return cfqg->service_trees[wl][ASYNC_WORKLOAD].count
		+ cfqg->service_trees[wl][SYNC_NOIDLE_WORKLOAD].count
		+ cfqg->service_trees[wl][SYNC_WORKLOAD].count;
438 439
}

440 441 442 443 444 445 446
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;
}

447
static void cfq_dispatch_insert(struct request_queue *, struct request *);
448
static struct cfq_queue *cfq_get_queue(struct cfq_data *, bool,
449
				       struct io_context *, gfp_t);
450
static struct cfq_io_context *cfq_cic_lookup(struct cfq_data *,
451 452 453
						struct io_context *);

static inline struct cfq_queue *cic_to_cfqq(struct cfq_io_context *cic,
454
					    bool is_sync)
455
{
456
	return cic->cfqq[is_sync];
457 458 459
}

static inline void cic_set_cfqq(struct cfq_io_context *cic,
460
				struct cfq_queue *cfqq, bool is_sync)
461
{
462
	cic->cfqq[is_sync] = cfqq;
463 464
}

465
#define CIC_DEAD_KEY	1ul
466
#define CIC_DEAD_INDEX_SHIFT	1
467 468 469

static inline void *cfqd_dead_key(struct cfq_data *cfqd)
{
470
	return (void *)(cfqd->cic_index << CIC_DEAD_INDEX_SHIFT | CIC_DEAD_KEY);
471 472 473 474 475 476 477 478 479 480 481 482
}

static inline struct cfq_data *cic_to_cfqd(struct cfq_io_context *cic)
{
	struct cfq_data *cfqd = cic->key;

	if (unlikely((unsigned long) cfqd & CIC_DEAD_KEY))
		return NULL;

	return cfqd;
}

483 484 485 486
/*
 * 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).
 */
487
static inline bool cfq_bio_sync(struct bio *bio)
488
{
489
	return bio_data_dir(bio) == READ || (bio->bi_rw & REQ_SYNC);
490
}
Linus Torvalds's avatar
Linus Torvalds committed
491

Andrew Morton's avatar
Andrew Morton committed
492 493 494 495
/*
 * scheduler run of queue, if there are requests pending and no one in the
 * driver that will restart queueing
 */
496
static inline void cfq_schedule_dispatch(struct cfq_data *cfqd)
Andrew Morton's avatar
Andrew Morton committed
497
{
498 499
	if (cfqd->busy_queues) {
		cfq_log(cfqd, "schedule dispatch");
500
		kblockd_schedule_work(cfqd->queue, &cfqd->unplug_work);
501
	}
Andrew Morton's avatar
Andrew Morton committed
502 503
}

504
static int cfq_queue_empty(struct request_queue *q)
Andrew Morton's avatar
Andrew Morton committed
505 506 507
{
	struct cfq_data *cfqd = q->elevator->elevator_data;

508
	return !cfqd->rq_queued;
Andrew Morton's avatar
Andrew Morton committed
509 510
}

511 512 513 514 515
/*
 * 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.
 */
516
static inline int cfq_prio_slice(struct cfq_data *cfqd, bool sync,
517
				 unsigned short prio)
518
{
519
	const int base_slice = cfqd->cfq_slice[sync];
520

521 522 523 524
	WARN_ON(prio >= IOPRIO_BE_NR);

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

526 527 528 529
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);
530 531
}

532 533 534 535 536 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)
{
	u64 vdisktime = st->min_vdisktime;
	struct cfq_group *cfqg;

	if (st->left) {
		cfqg = rb_entry_cfqg(st->left);
		vdisktime = min_vdisktime(vdisktime, cfqg->vdisktime);
	}

	st->min_vdisktime = max_vdisktime(st->min_vdisktime, vdisktime);
}

572 573 574 575 576 577
/*
 * 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
 */

578 579
static inline unsigned cfq_group_get_avg_queues(struct cfq_data *cfqd,
					struct cfq_group *cfqg, bool rt)
580
{
581 582 583
	unsigned min_q, max_q;
	unsigned mult  = cfq_hist_divisor - 1;
	unsigned round = cfq_hist_divisor / 2;
584
	unsigned busy = cfq_group_busy_queues_wl(rt, cfqd, cfqg);
585

586 587 588
	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) /
589
		cfq_hist_divisor;
590 591 592 593 594 595 596 597 598
	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;
599 600
}

601 602 603
static inline void
cfq_set_prio_slice(struct cfq_data *cfqd, struct cfq_queue *cfqq)
{
604 605
	unsigned slice = cfq_prio_to_slice(cfqd, cfqq);
	if (cfqd->cfq_latency) {
606 607 608 609 610 611
		/*
		 * 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));
612 613
		unsigned sync_slice = cfqd->cfq_slice[1];
		unsigned expect_latency = sync_slice * iq;
614 615 616
		unsigned group_slice = cfq_group_slice(cfqd, cfqq->cfqg);

		if (expect_latency > group_slice) {
617 618 619 620 621 622 623
			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 */
624
			slice = max(slice * group_slice / expect_latency,
625 626 627
				    low_slice);
		}
	}
628
	cfqq->slice_start = jiffies;
629
	cfqq->slice_end = jiffies + slice;
630
	cfqq->allocated_slice = slice;
631
	cfq_log_cfqq(cfqd, cfqq, "set_slice=%lu", cfqq->slice_end - jiffies);
632 633 634 635 636 637 638
}

/*
 * 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.
 */
639
static inline bool cfq_slice_used(struct cfq_queue *cfqq)
640 641
{
	if (cfq_cfqq_slice_new(cfqq))
Shaohua Li's avatar
Shaohua Li committed
642
		return false;
643
	if (time_before(jiffies, cfqq->slice_end))
Shaohua Li's avatar
Shaohua Li committed
644
		return false;
645

Shaohua Li's avatar
Shaohua Li committed
646
	return true;
647 648
}

Linus Torvalds's avatar
Linus Torvalds committed
649
/*
Jens Axboe's avatar
Jens Axboe committed
650
 * Lifted from AS - choose which of rq1 and rq2 that is best served now.
Linus Torvalds's avatar
Linus Torvalds committed
651
 * We choose the request that is closest to the head right now. Distance
652
 * behind the head is penalized and only allowed to a certain extent.
Linus Torvalds's avatar
Linus Torvalds committed
653
 */
Jens Axboe's avatar
Jens Axboe committed
654
static struct request *
655
cfq_choose_req(struct cfq_data *cfqd, struct request *rq1, struct request *rq2, sector_t last)
Linus Torvalds's avatar
Linus Torvalds committed
656
{
657
	sector_t s1, s2, d1 = 0, d2 = 0;
Linus Torvalds's avatar
Linus Torvalds committed
658
	unsigned long back_max;
659 660 661
#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
662

Jens Axboe's avatar
Jens Axboe committed
663 664 665 666
	if (rq1 == NULL || rq1 == rq2)
		return rq2;
	if (rq2 == NULL)
		return rq1;
667

Jens Axboe's avatar
Jens Axboe committed
668 669 670 671
	if (rq_is_sync(rq1) && !rq_is_sync(rq2))
		return rq1;
	else if (rq_is_sync(rq2) && !rq_is_sync(rq1))
		return rq2;
672
	if ((rq1->cmd_flags & REQ_META) && !(rq2->cmd_flags & REQ_META))
673
		return rq1;
674 675
	else if ((rq2->cmd_flags & REQ_META) &&
		 !(rq1->cmd_flags & REQ_META))
676
		return rq2;
Linus Torvalds's avatar
Linus Torvalds committed
677

678 679
	s1 = blk_rq_pos(rq1);
	s2 = blk_rq_pos(rq2);
Linus Torvalds's avatar
Linus Torvalds committed
680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695

	/*
	 * 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
696
		wrap |= CFQ_RQ1_WRAP;
Linus Torvalds's avatar
Linus Torvalds committed
697 698 699 700 701 702

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

	/* Found required data */
706 707 708 709 710 711

	/*
	 * 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
712
	case 0: /* common case for CFQ: rq1 and rq2 not wrapped */
713
		if (d1 < d2)
Jens Axboe's avatar
Jens Axboe committed
714
			return rq1;
715
		else if (d2 < d1)
Jens Axboe's avatar
Jens Axboe committed
716
			return rq2;
717 718
		else {
			if (s1 >= s2)
Jens Axboe's avatar
Jens Axboe committed
719
				return rq1;
720
			else
Jens Axboe's avatar
Jens Axboe committed
721
				return rq2;
722
		}
Linus Torvalds's avatar
Linus Torvalds committed
723

724
	case CFQ_RQ2_WRAP:
Jens Axboe's avatar
Jens Axboe committed
725
		return rq1;
726
	case CFQ_RQ1_WRAP:
Jens Axboe's avatar
Jens Axboe committed
727 728
		return rq2;
	case (CFQ_RQ1_WRAP|CFQ_RQ2_WRAP): /* both rqs wrapped */
729 730 731 732 733 734 735 736
	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
737
			return rq1;
Linus Torvalds's avatar
Linus Torvalds committed
738
		else
Jens Axboe's avatar
Jens Axboe committed
739
			return rq2;
Linus Torvalds's avatar
Linus Torvalds committed
740 741 742
	}
}

743 744 745
/*
 * The below is leftmost cache rbtree addon
 */
746
static struct cfq_queue *cfq_rb_first(struct cfq_rb_root *root)
747
{
748 749 750 751
	/* Service tree is empty */
	if (!root->count)
		return NULL;

752 753 754
	if (!root->left)
		root->left = rb_first(&root->rb);

755 756 757 758
	if (root->left)
		return rb_entry(root->left, struct cfq_queue, rb_node);

	return NULL;
759 760
}

761 762 763 764 765 766 767 768 769 770 771
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;
}

772 773 774 775 776 777
static void rb_erase_init(struct rb_node *n, struct rb_root *root)
{
	rb_erase(n, root);
	RB_CLEAR_NODE(n);
}

778 779 780 781
static void cfq_rb_erase(struct rb_node *n, struct cfq_rb_root *root)
{
	if (root->left == n)
		root->left = NULL;
782
	rb_erase_init(n, &root->rb);
783
	--root->count;
784 785
}

Linus Torvalds's avatar
Linus Torvalds committed
786 787 788
/*
 * would be nice to take fifo expire time into account as well
 */
Jens Axboe's avatar
Jens Axboe committed
789 790 791
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
792
{
793 794
	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
795
	struct request *next = NULL, *prev = NULL;
Linus Torvalds's avatar
Linus Torvalds committed
796

797
	BUG_ON(RB_EMPTY_NODE(&last->rb_node));
Linus Torvalds's avatar
Linus Torvalds committed
798 799

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

802
	if (rbnext)
Jens Axboe's avatar
Jens Axboe committed
803
		next = rb_entry_rq(rbnext);
804 805 806
	else {
		rbnext = rb_first(&cfqq->sort_list);
		if (rbnext && rbnext != &last->rb_node)
Jens Axboe's avatar
Jens Axboe committed
807
			next = rb_entry_rq(rbnext);
808
	}
Linus Torvalds's avatar
Linus Torvalds committed
809

810
	return cfq_choose_req(cfqd, next, prev, blk_rq_pos(last));
Linus Torvalds's avatar
Linus Torvalds committed
811 812
}

813 814
static unsigned long cfq_slice_offset(struct cfq_data *cfqd,
				      struct cfq_queue *cfqq)
Linus Torvalds's avatar
Linus Torvalds committed
815
{
816 817 818
	/*
	 * just an approximation, should be ok.
	 */
819
	return (cfqq->cfqg->nr_cfqq - 1) * (cfq_prio_slice(cfqd, 1, 0) -
820
		       cfq_prio_slice(cfqd, cfq_cfqq_sync(cfqq), cfqq->ioprio));
821 822
}

823 824 825 826 827 828 829 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
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
cfq_group_service_tree_add(struct cfq_data *cfqd, struct cfq_group *cfqg)
{
	struct cfq_rb_root *st = &cfqd->grp_service_tree;
	struct cfq_group *__cfqg;
	struct rb_node *n;

	cfqg->nr_cfqq++;
865
	if (!RB_EMPTY_NODE(&cfqg->rb_node))
866 867 868 869 870 871 872 873 874 875 876 877 878 879 880
		return;

	/*
	 * Currently put the group at the end. Later implement something
	 * so that groups get lesser vtime based on their weights, so that
	 * if group does not loose all if it was not continously backlogged.
	 */
	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;

	__cfq_group_service_tree_add(st, cfqg);
881
	st->total_weight += cfqg->weight;
882 883 884 885 886 887 888 889 890
}

static void
cfq_group_service_tree_del(struct cfq_data *cfqd, struct cfq_group *cfqg)
{
	struct cfq_rb_root *st = &cfqd->grp_service_tree;

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

892 893 894 895
	/* If there are other cfq queues under this group, don't delete it */
	if (cfqg->nr_cfqq)
		return;

896
	cfq_log_cfqg(cfqd, cfqg, "del_from_rr group");
897
	st->total_weight -= cfqg->weight;
898 899
	if (!RB_EMPTY_NODE(&cfqg->rb_node))
		cfq_rb_erase(&cfqg->rb_node, st);
900
	cfqg->saved_workload_slice = 0;
901
	cfq_blkiocg_update_dequeue_stats(&cfqg->blkg, 1);
902 903 904 905
}

static inline unsigned int cfq_cfqq_slice_usage(struct cfq_queue *cfqq)
{
906
	unsigned int slice_used;
907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922

	/*
	 * 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;
923 924
		if (slice_used > cfqq->allocated_slice)
			slice_used = cfqq->allocated_slice;
925 926 927 928 929 930
	}

	return slice_used;
}

static void cfq_group_served(struct cfq_data *cfqd, struct cfq_group *cfqg,
931
				struct cfq_queue *cfqq)
932 933
{
	struct cfq_rb_root *st = &cfqd->grp_service_tree;
934
	unsigned int used_sl, charge;
935 936 937 938
	int nr_sync = cfqg->nr_cfqq - cfqg_busy_async_queues(cfqd, cfqg)
			- cfqg->service_tree_idle.count;

	BUG_ON(nr_sync < 0);
939
	used_sl = charge = cfq_cfqq_slice_usage(cfqq);
940

941 942 943 944
	if (iops_mode(cfqd))
		charge = cfqq->slice_dispatch;
	else if (!cfq_cfqq_sync(cfqq) && !nr_sync)
		charge = cfqq->allocated_slice;
945 946 947

	/* Can't update vdisktime while group is on service tree */
	cfq_rb_erase(&cfqg->rb_node, st);
948
	cfqg->vdisktime += cfq_scale_slice(charge, cfqg);
949 950 951 952 953 954 955 956 957 958
	__cfq_group_service_tree_add(st, cfqg);

	/* 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;
959 960 961

	cfq_log_cfqg(cfqd, cfqg, "served: vt=%llu min_vt=%llu", cfqg->vdisktime,
					st->min_vdisktime);
962 963 964
	cfq_log_cfqq(cfqq->cfqd, cfqq, "sl_used=%u disp=%u charge=%u iops=%u"
			" sect=%u", used_sl, cfqq->slice_dispatch, charge,
			iops_mode(cfqd), cfqq->nr_sectors);
965 966
	cfq_blkiocg_update_timeslice_used(&cfqg->blkg, used_sl);
	cfq_blkiocg_set_start_empty_time(&cfqg->blkg);
967 968
}

969 970 971 972 973 974 975 976
#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;
}

977 978
void cfq_update_blkio_group_weight(void *key, struct blkio_group *blkg,
					unsigned int weight)
979 980 981 982
{
	cfqg_of_blkg(blkg)->weight = weight;
}

983 984 985 986 987 988 989 990
static struct cfq_group *
cfq_find_alloc_cfqg(struct cfq_data *cfqd, struct cgroup *cgroup, int create)
{
	struct blkio_cgroup *blkcg = cgroup_to_blkio_cgroup(cgroup);
	struct cfq_group *cfqg = NULL;
	void *key = cfqd;
	int i, j;
	struct cfq_rb_root *st;
991 992
	struct backing_dev_info *bdi = &cfqd->queue->backing_dev_info;
	unsigned int major, minor;
993 994

	cfqg = cfqg_of_blkg(blkiocg_lookup_group(blkcg, key));
995 996 997 998 999
	if (cfqg && !cfqg->blkg.dev && bdi->dev && dev_name(bdi->dev)) {
		sscanf(dev_name(bdi->dev), "%u:%u", &major, &minor);
		cfqg->blkg.dev = MKDEV(major, minor);
		goto done;
	}
1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010
	if (cfqg || !create)
		goto done;

	cfqg = kzalloc_node(sizeof(*cfqg), GFP_ATOMIC, cfqd->queue->node);
	if (!cfqg)
		goto done;

	for_each_cfqg_st(cfqg, i, j, st)
		*st = CFQ_RB_ROOT;
	RB_CLEAR_NODE(&cfqg->rb_node);

1011 1012 1013 1014 1015 1016 1017 1018
	/*
	 * Take the initial reference that will be released on destroy
	 * This can be thought of a joint reference by cgroup and
	 * elevator which will be dropped by either elevator exit
	 * or cgroup deletion path depending on who is exiting first.
	 */
	atomic_set(&cfqg->ref, 1);

1019 1020 1021 1022 1023 1024 1025 1026 1027
	/*
	 * Add group onto cgroup list. It might happen that bdi->dev is
	 * not initiliazed yet. Initialize this new group without major
	 * and minor info and this info will be filled in once a new thread
	 * comes for IO. See code above.
	 */
	if (bdi->dev) {
		sscanf(dev_name(bdi->dev), "%u:%u", &major, &minor);
		cfq_blkiocg_add_blkio_group(blkcg, &cfqg->blkg, (void *)cfqd,
1028
					MKDEV(major, minor));
1029 1030 1031 1032
	} else
		cfq_blkiocg_add_blkio_group(blkcg, &cfqg->blkg, (void *)cfqd,
					0);

1033
	cfqg->weight = blkcg_get_weight(blkcg, cfqg->blkg.dev);
1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059

	/* Add group on cfqd list */
	hlist_add_head(&cfqg->cfqd_node, &cfqd->cfqg_list);

done:
	return cfqg;
}

/*
 * Search for the cfq group current task belongs to. If create = 1, then also
 * create the cfq group if it does not exist. request_queue lock must be held.
 */
static struct cfq_group *cfq_get_cfqg(struct cfq_data *cfqd, int create)
{
	struct cgroup *cgroup;
	struct cfq_group *cfqg = NULL;

	rcu_read_lock();
	cgroup = task_cgroup(current, blkio_subsys_id);
	cfqg = cfq_find_alloc_cfqg(cfqd, cgroup, create);
	if (!cfqg && create)
		cfqg = &cfqd->root_group;
	rcu_read_unlock();
	return cfqg;
}

1060 1061 1062 1063 1064 1065
static inline struct cfq_group *cfq_ref_get_cfqg(struct cfq_group *cfqg)
{
	atomic_inc(&cfqg->ref);
	return cfqg;
}

1066 1067 1068 1069 1070 1071 1072
static void cfq_link_cfqq_cfqg(struct cfq_queue *cfqq, struct cfq_group *cfqg)
{
	/* Currently, all async queues are mapped to root group */
	if (!cfq_cfqq_sync(cfqq))
		cfqg = &cfqq->cfqd->root_group;

	cfqq->cfqg = cfqg;
1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085
	/* cfqq reference on cfqg */
	atomic_inc(&cfqq->cfqg->ref);
}

static void cfq_put_cfqg(struct cfq_group *cfqg)
{
	struct cfq_rb_root *st;
	int i, j;

	BUG_ON(atomic_read(&cfqg->ref) <= 0);
	if (!atomic_dec_and_test(&cfqg->ref))
		return;
	for_each_cfqg_st(cfqg, i, j, st)
1086
		BUG_ON(!RB_EMPTY_ROOT(&st->rb));
1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111