elevator.c 23.8 KB
Newer Older
Linus Torvalds's avatar
Linus Torvalds committed
1 2 3 4 5
/*
 *  Block device elevator/IO-scheduler.
 *
 *  Copyright (C) 2000 Andrea Arcangeli <andrea@suse.de> SuSE
 *
6
 * 30042000 Jens Axboe <axboe@kernel.dk> :
Linus Torvalds's avatar
Linus Torvalds committed
7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33
 *
 * Split the elevator a bit so that it is possible to choose a different
 * one or even write a new "plug in". There are three pieces:
 * - elevator_fn, inserts a new request in the queue list
 * - elevator_merge_fn, decides whether a new buffer can be merged with
 *   an existing request
 * - elevator_dequeue_fn, called when a request is taken off the active list
 *
 * 20082000 Dave Jones <davej@suse.de> :
 * Removed tests for max-bomb-segments, which was breaking elvtune
 *  when run without -bN
 *
 * Jens:
 * - Rework again to work with bio instead of buffer_heads
 * - loose bi_dev comparisons, partition handling is right now
 * - completely modularize elevator setup and teardown
 *
 */
#include <linux/kernel.h>
#include <linux/fs.h>
#include <linux/blkdev.h>
#include <linux/elevator.h>
#include <linux/bio.h>
#include <linux/module.h>
#include <linux/slab.h>
#include <linux/init.h>
#include <linux/compiler.h>
34
#include <linux/blktrace_api.h>
35
#include <linux/hash.h>
36
#include <linux/uaccess.h>
37
#include <linux/pm_runtime.h>
38
#include <linux/blk-cgroup.h>
Linus Torvalds's avatar
Linus Torvalds committed
39

40 41
#include <trace/events/block.h>

42 43
#include "blk.h"

Linus Torvalds's avatar
Linus Torvalds committed
44 45 46
static DEFINE_SPINLOCK(elv_list_lock);
static LIST_HEAD(elv_list);

47 48 49
/*
 * Merge hash stuff.
 */
50
#define rq_hash_key(rq)		(blk_rq_pos(rq) + blk_rq_sectors(rq))
51

52 53 54 55 56 57
/*
 * Query io scheduler to see if the current process issuing bio may be
 * merged with rq.
 */
static int elv_iosched_allow_merge(struct request *rq, struct bio *bio)
{
58
	struct request_queue *q = rq->q;
59
	struct elevator_queue *e = q->elevator;
60

61 62
	if (e->type->ops.elevator_allow_merge_fn)
		return e->type->ops.elevator_allow_merge_fn(q, rq, bio);
63 64 65 66

	return 1;
}

Linus Torvalds's avatar
Linus Torvalds committed
67 68 69
/*
 * can we safely merge with this request?
 */
70
bool elv_rq_merge_ok(struct request *rq, struct bio *bio)
Linus Torvalds's avatar
Linus Torvalds committed
71
{
72
	if (!blk_rq_merge_ok(rq, bio))
73 74
		return 0;

75 76
	if (!elv_iosched_allow_merge(rq, bio))
		return 0;
Linus Torvalds's avatar
Linus Torvalds committed
77

78
	return 1;
Linus Torvalds's avatar
Linus Torvalds committed
79 80 81 82 83
}
EXPORT_SYMBOL(elv_rq_merge_ok);

static struct elevator_type *elevator_find(const char *name)
{
84
	struct elevator_type *e;
Linus Torvalds's avatar
Linus Torvalds committed
85

86
	list_for_each_entry(e, &elv_list, list) {
87 88
		if (!strcmp(e->elevator_name, name))
			return e;
Linus Torvalds's avatar
Linus Torvalds committed
89 90
	}

91
	return NULL;
Linus Torvalds's avatar
Linus Torvalds committed
92 93 94 95 96 97 98
}

static void elevator_put(struct elevator_type *e)
{
	module_put(e->elevator_owner);
}

99
static struct elevator_type *elevator_get(const char *name, bool try_loading)
Linus Torvalds's avatar
Linus Torvalds committed
100
{
101
	struct elevator_type *e;
Linus Torvalds's avatar
Linus Torvalds committed
102

103
	spin_lock(&elv_list_lock);
104 105

	e = elevator_find(name);
106
	if (!e && try_loading) {
107
		spin_unlock(&elv_list_lock);
108
		request_module("%s-iosched", name);
109 110 111 112
		spin_lock(&elv_list_lock);
		e = elevator_find(name);
	}

113 114 115
	if (e && !try_module_get(e->elevator_owner))
		e = NULL;

116
	spin_unlock(&elv_list_lock);
Linus Torvalds's avatar
Linus Torvalds committed
117 118 119 120

	return e;
}

121
static char chosen_elevator[ELV_NAME_MAX];
Linus Torvalds's avatar
Linus Torvalds committed
122

123
static int __init elevator_setup(char *str)
Linus Torvalds's avatar
Linus Torvalds committed
124
{
125 126 127 128
	/*
	 * Be backwards-compatible with previous kernels, so users
	 * won't get the wrong elevator.
	 */
129
	strncpy(chosen_elevator, str, sizeof(chosen_elevator) - 1);
130
	return 1;
Linus Torvalds's avatar
Linus Torvalds committed
131 132 133 134
}

__setup("elevator=", elevator_setup);

135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150
/* called during boot to load the elevator chosen by the elevator param */
void __init load_default_elevator_module(void)
{
	struct elevator_type *e;

	if (!chosen_elevator[0])
		return;

	spin_lock(&elv_list_lock);
	e = elevator_find(chosen_elevator);
	spin_unlock(&elv_list_lock);

	if (!e)
		request_module("%s-iosched", chosen_elevator);
}

151 152
static struct kobj_type elv_ktype;

153
struct elevator_queue *elevator_alloc(struct request_queue *q,
154
				  struct elevator_type *e)
155
{
156
	struct elevator_queue *eq;
157

158
	eq = kzalloc_node(sizeof(*eq), GFP_KERNEL, q->node);
159
	if (unlikely(!eq))
160
		return NULL;
161

162
	eq->type = e;
163
	kobject_init(&eq->kobj, &elv_ktype);
164
	mutex_init(&eq->sysfs_lock);
165
	hash_init(eq->hash);
166

167 168
	return eq;
}
169
EXPORT_SYMBOL(elevator_alloc);
170 171 172

static void elevator_release(struct kobject *kobj)
{
173
	struct elevator_queue *e;
174

175
	e = container_of(kobj, struct elevator_queue, kobj);
176
	elevator_put(e->type);
177 178 179
	kfree(e);
}

180
int elevator_init(struct request_queue *q, char *name)
Linus Torvalds's avatar
Linus Torvalds committed
181 182
{
	struct elevator_type *e = NULL;
183
	int err;
Linus Torvalds's avatar
Linus Torvalds committed
184

185 186 187 188 189 190
	/*
	 * q->sysfs_lock must be held to provide mutual exclusion between
	 * elevator_switch() and here.
	 */
	lockdep_assert_held(&q->sysfs_lock);

191 192 193
	if (unlikely(q->elevator))
		return 0;

194 195 196 197 198
	INIT_LIST_HEAD(&q->queue_head);
	q->last_merge = NULL;
	q->end_sector = 0;
	q->boundary_rq = NULL;

199
	if (name) {
200
		e = elevator_get(name, true);
201 202 203
		if (!e)
			return -EINVAL;
	}
Linus Torvalds's avatar
Linus Torvalds committed
204

205 206 207 208 209
	/*
	 * Use the default elevator specified by config boot param or
	 * config option.  Don't try to load modules as we could be running
	 * off async and request_module() isn't allowed from async.
	 */
210
	if (!e && *chosen_elevator) {
211
		e = elevator_get(chosen_elevator, false);
212 213 214 215
		if (!e)
			printk(KERN_ERR "I/O scheduler %s not found\n",
							chosen_elevator);
	}
216

217
	if (!e) {
218
		e = elevator_get(CONFIG_DEFAULT_IOSCHED, false);
219 220 221 222
		if (!e) {
			printk(KERN_ERR
				"Default I/O scheduler not found. " \
				"Using noop.\n");
223
			e = elevator_get("noop", false);
224
		}
225 226
	}

227
	err = e->ops.elevator_init_fn(q, e);
228 229 230
	if (err)
		elevator_put(e);
	return err;
Linus Torvalds's avatar
Linus Torvalds committed
231
}
232 233
EXPORT_SYMBOL(elevator_init);

234
void elevator_exit(struct elevator_queue *e)
Linus Torvalds's avatar
Linus Torvalds committed
235
{
236
	mutex_lock(&e->sysfs_lock);
237 238
	if (e->type->ops.elevator_exit_fn)
		e->type->ops.elevator_exit_fn(e);
239
	mutex_unlock(&e->sysfs_lock);
Linus Torvalds's avatar
Linus Torvalds committed
240

241
	kobject_put(&e->kobj);
Linus Torvalds's avatar
Linus Torvalds committed
242
}
243 244
EXPORT_SYMBOL(elevator_exit);

245 246
static inline void __elv_rqhash_del(struct request *rq)
{
247
	hash_del(&rq->hash);
248
	rq->cmd_flags &= ~REQ_HASHED;
249 250
}

251
static void elv_rqhash_del(struct request_queue *q, struct request *rq)
252 253 254 255 256
{
	if (ELV_ON_HASH(rq))
		__elv_rqhash_del(rq);
}

257
static void elv_rqhash_add(struct request_queue *q, struct request *rq)
258
{
259
	struct elevator_queue *e = q->elevator;
260 261

	BUG_ON(ELV_ON_HASH(rq));
262
	hash_add(e->hash, &rq->hash, rq_hash_key(rq));
263
	rq->cmd_flags |= REQ_HASHED;
264 265
}

266
static void elv_rqhash_reposition(struct request_queue *q, struct request *rq)
267 268 269 270 271
{
	__elv_rqhash_del(rq);
	elv_rqhash_add(q, rq);
}

272
static struct request *elv_rqhash_find(struct request_queue *q, sector_t offset)
273
{
274
	struct elevator_queue *e = q->elevator;
275
	struct hlist_node *next;
276 277
	struct request *rq;

278
	hash_for_each_possible_safe(e->hash, rq, next, hash, offset) {
279 280 281 282 283 284 285 286 287 288 289 290 291 292
		BUG_ON(!ELV_ON_HASH(rq));

		if (unlikely(!rq_mergeable(rq))) {
			__elv_rqhash_del(rq);
			continue;
		}

		if (rq_hash_key(rq) == offset)
			return rq;
	}

	return NULL;
}

293 294 295 296
/*
 * RB-tree support functions for inserting/lookup/removal of requests
 * in a sorted RB tree.
 */
297
void elv_rb_add(struct rb_root *root, struct request *rq)
298 299 300 301 302 303 304 305 306
{
	struct rb_node **p = &root->rb_node;
	struct rb_node *parent = NULL;
	struct request *__rq;

	while (*p) {
		parent = *p;
		__rq = rb_entry(parent, struct request, rb_node);

307
		if (blk_rq_pos(rq) < blk_rq_pos(__rq))
308
			p = &(*p)->rb_left;
309
		else if (blk_rq_pos(rq) >= blk_rq_pos(__rq))
310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333
			p = &(*p)->rb_right;
	}

	rb_link_node(&rq->rb_node, parent, p);
	rb_insert_color(&rq->rb_node, root);
}
EXPORT_SYMBOL(elv_rb_add);

void elv_rb_del(struct rb_root *root, struct request *rq)
{
	BUG_ON(RB_EMPTY_NODE(&rq->rb_node));
	rb_erase(&rq->rb_node, root);
	RB_CLEAR_NODE(&rq->rb_node);
}
EXPORT_SYMBOL(elv_rb_del);

struct request *elv_rb_find(struct rb_root *root, sector_t sector)
{
	struct rb_node *n = root->rb_node;
	struct request *rq;

	while (n) {
		rq = rb_entry(n, struct request, rb_node);

334
		if (sector < blk_rq_pos(rq))
335
			n = n->rb_left;
336
		else if (sector > blk_rq_pos(rq))
337 338 339 340 341 342 343 344 345
			n = n->rb_right;
		else
			return rq;
	}

	return NULL;
}
EXPORT_SYMBOL(elv_rb_find);

346 347
/*
 * Insert rq into dispatch queue of q.  Queue lock must be held on
348
 * entry.  rq is sort instead into the dispatch queue. To be used by
349
 * specific elevators.
350
 */
351
void elv_dispatch_sort(struct request_queue *q, struct request *rq)
352 353 354
{
	sector_t boundary;
	struct list_head *entry;
355
	int stop_flags;
356

357 358
	if (q->last_merge == rq)
		q->last_merge = NULL;
359 360 361

	elv_rqhash_del(q, rq);

362
	q->nr_sorted--;
363

Jens Axboe's avatar
Jens Axboe committed
364
	boundary = q->end_sector;
365
	stop_flags = REQ_SOFTBARRIER | REQ_STARTED;
366 367 368
	list_for_each_prev(entry, &q->queue_head) {
		struct request *pos = list_entry_rq(entry);

369 370
		if ((rq->cmd_flags & REQ_DISCARD) !=
		    (pos->cmd_flags & REQ_DISCARD))
371
			break;
372 373
		if (rq_data_dir(rq) != rq_data_dir(pos))
			break;
374
		if (pos->cmd_flags & stop_flags)
375
			break;
376 377
		if (blk_rq_pos(rq) >= boundary) {
			if (blk_rq_pos(pos) < boundary)
378 379
				continue;
		} else {
380
			if (blk_rq_pos(pos) >= boundary)
381 382
				break;
		}
383
		if (blk_rq_pos(rq) >= blk_rq_pos(pos))
384 385 386 387 388
			break;
	}

	list_add(&rq->queuelist, entry);
}
389 390
EXPORT_SYMBOL(elv_dispatch_sort);

391
/*
392 393 394
 * Insert rq into dispatch queue of q.  Queue lock must be held on
 * entry.  rq is added to the back of the dispatch queue. To be used by
 * specific elevators.
395 396 397 398 399 400 401 402 403 404 405 406 407 408
 */
void elv_dispatch_add_tail(struct request_queue *q, struct request *rq)
{
	if (q->last_merge == rq)
		q->last_merge = NULL;

	elv_rqhash_del(q, rq);

	q->nr_sorted--;

	q->end_sector = rq_end_sector(rq);
	q->boundary_rq = rq;
	list_add_tail(&rq->queuelist, &q->queue_head);
}
409 410
EXPORT_SYMBOL(elv_dispatch_add_tail);

411
int elv_merge(struct request_queue *q, struct request **req, struct bio *bio)
Linus Torvalds's avatar
Linus Torvalds committed
412
{
413
	struct elevator_queue *e = q->elevator;
414
	struct request *__rq;
415 416
	int ret;

417 418 419 420 421 422
	/*
	 * Levels of merges:
	 * 	nomerges:  No merges at all attempted
	 * 	noxmerges: Only simple one-hit cache try
	 * 	merges:	   All merge tries attempted
	 */
423
	if (blk_queue_nomerges(q) || !bio_mergeable(bio))
424 425
		return ELEVATOR_NO_MERGE;

426 427 428
	/*
	 * First try one-hit cache.
	 */
429 430
	if (q->last_merge && elv_rq_merge_ok(q->last_merge, bio)) {
		ret = blk_try_merge(q->last_merge, bio);
431 432 433 434 435
		if (ret != ELEVATOR_NO_MERGE) {
			*req = q->last_merge;
			return ret;
		}
	}
Linus Torvalds's avatar
Linus Torvalds committed
436

437
	if (blk_queue_noxmerges(q))
438 439
		return ELEVATOR_NO_MERGE;

440 441 442
	/*
	 * See if our hash lookup can find a potential backmerge.
	 */
443
	__rq = elv_rqhash_find(q, bio->bi_iter.bi_sector);
444 445 446 447 448
	if (__rq && elv_rq_merge_ok(__rq, bio)) {
		*req = __rq;
		return ELEVATOR_BACK_MERGE;
	}

449 450
	if (e->type->ops.elevator_merge_fn)
		return e->type->ops.elevator_merge_fn(q, req, bio);
Linus Torvalds's avatar
Linus Torvalds committed
451 452 453 454

	return ELEVATOR_NO_MERGE;
}

455 456 457 458 459 460 461 462 463 464 465
/*
 * Attempt to do an insertion back merge. Only check for the case where
 * we can append 'rq' to an existing request, so we can throw 'rq' away
 * afterwards.
 *
 * Returns true if we merged, false otherwise
 */
static bool elv_attempt_insert_merge(struct request_queue *q,
				     struct request *rq)
{
	struct request *__rq;
Shaohua Li's avatar
Shaohua Li committed
466
	bool ret;
467 468 469 470 471 472 473 474 475 476 477 478 479

	if (blk_queue_nomerges(q))
		return false;

	/*
	 * First try one-hit cache.
	 */
	if (q->last_merge && blk_attempt_req_merge(q, q->last_merge, rq))
		return true;

	if (blk_queue_noxmerges(q))
		return false;

Shaohua Li's avatar
Shaohua Li committed
480
	ret = false;
481 482 483
	/*
	 * See if our hash lookup can find a potential backmerge.
	 */
Shaohua Li's avatar
Shaohua Li committed
484 485 486 487 488 489 490 491 492
	while (1) {
		__rq = elv_rqhash_find(q, blk_rq_pos(rq));
		if (!__rq || !blk_attempt_req_merge(q, __rq, rq))
			break;

		/* The merged request could be merged with others, try again */
		ret = true;
		rq = __rq;
	}
Shaohua Li's avatar
Shaohua Li committed
493

Shaohua Li's avatar
Shaohua Li committed
494
	return ret;
495 496
}

497
void elv_merged_request(struct request_queue *q, struct request *rq, int type)
Linus Torvalds's avatar
Linus Torvalds committed
498
{
499
	struct elevator_queue *e = q->elevator;
Linus Torvalds's avatar
Linus Torvalds committed
500

501 502
	if (e->type->ops.elevator_merged_fn)
		e->type->ops.elevator_merged_fn(q, rq, type);
503

504 505
	if (type == ELEVATOR_BACK_MERGE)
		elv_rqhash_reposition(q, rq);
506

507
	q->last_merge = rq;
Linus Torvalds's avatar
Linus Torvalds committed
508 509
}

510
void elv_merge_requests(struct request_queue *q, struct request *rq,
Linus Torvalds's avatar
Linus Torvalds committed
511 512
			     struct request *next)
{
513
	struct elevator_queue *e = q->elevator;
514
	const int next_sorted = next->cmd_flags & REQ_SORTED;
Linus Torvalds's avatar
Linus Torvalds committed
515

516 517
	if (next_sorted && e->type->ops.elevator_merge_req_fn)
		e->type->ops.elevator_merge_req_fn(q, rq, next);
518

519 520
	elv_rqhash_reposition(q, rq);

521 522 523 524 525
	if (next_sorted) {
		elv_rqhash_del(q, next);
		q->nr_sorted--;
	}

526
	q->last_merge = rq;
Linus Torvalds's avatar
Linus Torvalds committed
527 528
}

Divyesh Shah's avatar
Divyesh Shah committed
529 530 531 532 533
void elv_bio_merged(struct request_queue *q, struct request *rq,
			struct bio *bio)
{
	struct elevator_queue *e = q->elevator;

534 535
	if (e->type->ops.elevator_bio_merged_fn)
		e->type->ops.elevator_bio_merged_fn(q, rq, bio);
Divyesh Shah's avatar
Divyesh Shah committed
536 537
}

538
#ifdef CONFIG_PM
539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558
static void blk_pm_requeue_request(struct request *rq)
{
	if (rq->q->dev && !(rq->cmd_flags & REQ_PM))
		rq->q->nr_pending--;
}

static void blk_pm_add_request(struct request_queue *q, struct request *rq)
{
	if (q->dev && !(rq->cmd_flags & REQ_PM) && q->nr_pending++ == 0 &&
	    (q->rpm_status == RPM_SUSPENDED || q->rpm_status == RPM_SUSPENDING))
		pm_request_resume(q->dev);
}
#else
static inline void blk_pm_requeue_request(struct request *rq) {}
static inline void blk_pm_add_request(struct request_queue *q,
				      struct request *rq)
{
}
#endif

559
void elv_requeue_request(struct request_queue *q, struct request *rq)
Linus Torvalds's avatar
Linus Torvalds committed
560 561 562 563 564
{
	/*
	 * it already went through dequeue, we need to decrement the
	 * in_flight count again
	 */
565
	if (blk_account_rq(rq)) {
566
		q->in_flight[rq_is_sync(rq)]--;
567
		if (rq->cmd_flags & REQ_SORTED)
568
			elv_deactivate_rq(q, rq);
569
	}
Linus Torvalds's avatar
Linus Torvalds committed
570

571
	rq->cmd_flags &= ~REQ_STARTED;
Linus Torvalds's avatar
Linus Torvalds committed
572

573 574
	blk_pm_requeue_request(rq);

575
	__elv_add_request(q, rq, ELEVATOR_INSERT_REQUEUE);
Linus Torvalds's avatar
Linus Torvalds committed
576 577
}

578
void elv_drain_elevator(struct request_queue *q)
579 580
{
	static int printed;
Tejun Heo's avatar
Tejun Heo committed
581 582 583

	lockdep_assert_held(q->queue_lock);

584
	while (q->elevator->type->ops.elevator_dispatch_fn(q, 1))
585
		;
Tejun Heo's avatar
Tejun Heo committed
586
	if (q->nr_sorted && printed++ < 10) {
587 588
		printk(KERN_ERR "%s: forced dispatching is broken "
		       "(nr_sorted=%u), please report this\n",
589
		       q->elevator->type->elevator_name, q->nr_sorted);
590 591 592
	}
}

593
void __elv_add_request(struct request_queue *q, struct request *rq, int where)
Linus Torvalds's avatar
Linus Torvalds committed
594
{
595
	trace_block_rq_insert(q, rq);
596

597 598
	blk_pm_add_request(q, rq);

Linus Torvalds's avatar
Linus Torvalds committed
599 600
	rq->q = q;

601 602
	if (rq->cmd_flags & REQ_SOFTBARRIER) {
		/* barriers are scheduling boundary, update end_sector */
603
		if (rq->cmd_type == REQ_TYPE_FS) {
604 605 606 607
			q->end_sector = rq_end_sector(rq);
			q->boundary_rq = rq;
		}
	} else if (!(rq->cmd_flags & REQ_ELVPRIV) &&
608 609
		    (where == ELEVATOR_INSERT_SORT ||
		     where == ELEVATOR_INSERT_SORT_MERGE))
610 611
		where = ELEVATOR_INSERT_BACK;

612
	switch (where) {
613
	case ELEVATOR_INSERT_REQUEUE:
614
	case ELEVATOR_INSERT_FRONT:
615
		rq->cmd_flags |= REQ_SOFTBARRIER;
616 617 618 619
		list_add(&rq->queuelist, &q->queue_head);
		break;

	case ELEVATOR_INSERT_BACK:
620
		rq->cmd_flags |= REQ_SOFTBARRIER;
621
		elv_drain_elevator(q);
622 623 624 625 626 627 628 629 630 631 632
		list_add_tail(&rq->queuelist, &q->queue_head);
		/*
		 * We kick the queue here for the following reasons.
		 * - The elevator might have returned NULL previously
		 *   to delay requests and returned them now.  As the
		 *   queue wasn't empty before this request, ll_rw_blk
		 *   won't run the queue on return, resulting in hang.
		 * - Usually, back inserted requests won't be merged
		 *   with anything.  There's no point in delaying queue
		 *   processing.
		 */
633
		__blk_run_queue(q);
634 635
		break;

636 637 638 639 640 641 642 643
	case ELEVATOR_INSERT_SORT_MERGE:
		/*
		 * If we succeed in merging this request with one in the
		 * queue already, we are done - rq has now been freed,
		 * so no need to do anything further.
		 */
		if (elv_attempt_insert_merge(q, rq))
			break;
644
	case ELEVATOR_INSERT_SORT:
645
		BUG_ON(rq->cmd_type != REQ_TYPE_FS);
646
		rq->cmd_flags |= REQ_SORTED;
647
		q->nr_sorted++;
648 649 650 651 652 653
		if (rq_mergeable(rq)) {
			elv_rqhash_add(q, rq);
			if (!q->last_merge)
				q->last_merge = rq;
		}

654 655 656 657 658
		/*
		 * Some ioscheds (cfq) run q->request_fn directly, so
		 * rq cannot be accessed after calling
		 * elevator_add_req_fn.
		 */
659
		q->elevator->type->ops.elevator_add_req_fn(q, rq);
660 661
		break;

662 663 664 665
	case ELEVATOR_INSERT_FLUSH:
		rq->cmd_flags |= REQ_SOFTBARRIER;
		blk_insert_flush(rq);
		break;
666 667
	default:
		printk(KERN_ERR "%s: bad insertion point %d\n",
668
		       __func__, where);
669 670
		BUG();
	}
Linus Torvalds's avatar
Linus Torvalds committed
671
}
672 673
EXPORT_SYMBOL(__elv_add_request);

674
void elv_add_request(struct request_queue *q, struct request *rq, int where)
Linus Torvalds's avatar
Linus Torvalds committed
675 676 677 678
{
	unsigned long flags;

	spin_lock_irqsave(q->queue_lock, flags);
679
	__elv_add_request(q, rq, where);
Linus Torvalds's avatar
Linus Torvalds committed
680 681
	spin_unlock_irqrestore(q->queue_lock, flags);
}
682 683
EXPORT_SYMBOL(elv_add_request);

684
struct request *elv_latter_request(struct request_queue *q, struct request *rq)
Linus Torvalds's avatar
Linus Torvalds committed
685
{
686
	struct elevator_queue *e = q->elevator;
Linus Torvalds's avatar
Linus Torvalds committed
687

688 689
	if (e->type->ops.elevator_latter_req_fn)
		return e->type->ops.elevator_latter_req_fn(q, rq);
Linus Torvalds's avatar
Linus Torvalds committed
690 691 692
	return NULL;
}

693
struct request *elv_former_request(struct request_queue *q, struct request *rq)
Linus Torvalds's avatar
Linus Torvalds committed
694
{
695
	struct elevator_queue *e = q->elevator;
Linus Torvalds's avatar
Linus Torvalds committed
696

697 698
	if (e->type->ops.elevator_former_req_fn)
		return e->type->ops.elevator_former_req_fn(q, rq);
Linus Torvalds's avatar
Linus Torvalds committed
699 700 701
	return NULL;
}

702 703
int elv_set_request(struct request_queue *q, struct request *rq,
		    struct bio *bio, gfp_t gfp_mask)
Linus Torvalds's avatar
Linus Torvalds committed
704
{
705
	struct elevator_queue *e = q->elevator;
Linus Torvalds's avatar
Linus Torvalds committed
706

707
	if (e->type->ops.elevator_set_req_fn)
708
		return e->type->ops.elevator_set_req_fn(q, rq, bio, gfp_mask);
Linus Torvalds's avatar
Linus Torvalds committed
709 710 711
	return 0;
}

712
void elv_put_request(struct request_queue *q, struct request *rq)
Linus Torvalds's avatar
Linus Torvalds committed
713
{
714
	struct elevator_queue *e = q->elevator;
Linus Torvalds's avatar
Linus Torvalds committed
715

716 717
	if (e->type->ops.elevator_put_req_fn)
		e->type->ops.elevator_put_req_fn(rq);
Linus Torvalds's avatar
Linus Torvalds committed
718 719
}

720
int elv_may_queue(struct request_queue *q, int rw)
Linus Torvalds's avatar
Linus Torvalds committed
721
{
722
	struct elevator_queue *e = q->elevator;
Linus Torvalds's avatar
Linus Torvalds committed
723

724 725
	if (e->type->ops.elevator_may_queue_fn)
		return e->type->ops.elevator_may_queue_fn(q, rw);
Linus Torvalds's avatar
Linus Torvalds committed
726 727 728 729

	return ELV_MQUEUE_MAY;
}

730
void elv_completed_request(struct request_queue *q, struct request *rq)
Linus Torvalds's avatar
Linus Torvalds committed
731
{
732
	struct elevator_queue *e = q->elevator;
Linus Torvalds's avatar
Linus Torvalds committed
733 734 735 736

	/*
	 * request is released from the driver, io must be done
	 */
737
	if (blk_account_rq(rq)) {
738
		q->in_flight[rq_is_sync(rq)]--;
739
		if ((rq->cmd_flags & REQ_SORTED) &&
740 741
		    e->type->ops.elevator_completed_req_fn)
			e->type->ops.elevator_completed_req_fn(q, rq);
742
	}
Linus Torvalds's avatar
Linus Torvalds committed
743 744
}

745 746 747 748
#define to_elv(atr) container_of((atr), struct elv_fs_entry, attr)

static ssize_t
elv_attr_show(struct kobject *kobj, struct attribute *attr, char *page)
Linus Torvalds's avatar
Linus Torvalds committed
749
{
750
	struct elv_fs_entry *entry = to_elv(attr);
751
	struct elevator_queue *e;
752 753 754 755 756
	ssize_t error;

	if (!entry->show)
		return -EIO;

757
	e = container_of(kobj, struct elevator_queue, kobj);
758
	mutex_lock(&e->sysfs_lock);
759
	error = e->type ? entry->show(e, page) : -ENOENT;
760 761 762
	mutex_unlock(&e->sysfs_lock);
	return error;
}
Linus Torvalds's avatar
Linus Torvalds committed
763

764 765 766 767 768
static ssize_t
elv_attr_store(struct kobject *kobj, struct attribute *attr,
	       const char *page, size_t length)
{
	struct elv_fs_entry *entry = to_elv(attr);
769
	struct elevator_queue *e;
770
	ssize_t error;
Linus Torvalds's avatar
Linus Torvalds committed
771

772 773
	if (!entry->store)
		return -EIO;
Linus Torvalds's avatar
Linus Torvalds committed
774

775
	e = container_of(kobj, struct elevator_queue, kobj);
776
	mutex_lock(&e->sysfs_lock);
777
	error = e->type ? entry->store(e, page, length) : -ENOENT;
778 779 780 781
	mutex_unlock(&e->sysfs_lock);
	return error;
}

782
static const struct sysfs_ops elv_sysfs_ops = {
783 784 785 786 787 788 789 790 791
	.show	= elv_attr_show,
	.store	= elv_attr_store,
};

static struct kobj_type elv_ktype = {
	.sysfs_ops	= &elv_sysfs_ops,
	.release	= elevator_release,
};

792
int elv_register_queue(struct request_queue *q)
793
{
794
	struct elevator_queue *e = q->elevator;
795 796
	int error;

797
	error = kobject_add(&e->kobj, &q->kobj, "%s", "iosched");
798
	if (!error) {
799
		struct elv_fs_entry *attr = e->type->elevator_attrs;
800
		if (attr) {
801 802
			while (attr->attr.name) {
				if (sysfs_create_file(&e->kobj, &attr->attr))
803
					break;
804
				attr++;
805 806 807
			}
		}
		kobject_uevent(&e->kobj, KOBJ_ADD);
808
		e->registered = 1;
809 810
		if (e->type->ops.elevator_registered_fn)
			e->type->ops.elevator_registered_fn(q);
811 812
	}
	return error;
Linus Torvalds's avatar
Linus Torvalds committed
813
}
814
EXPORT_SYMBOL(elv_register_queue);
Jens Axboe's avatar
Jens Axboe committed
815

Linus Torvalds's avatar
Linus Torvalds committed
816 817
void elv_unregister_queue(struct request_queue *q)
{
818 819 820 821 822 823 824
	if (q) {
		struct elevator_queue *e = q->elevator;

		kobject_uevent(&e->kobj, KOBJ_REMOVE);
		kobject_del(&e->kobj);
		e->registered = 0;
	}
Linus Torvalds's avatar
Linus Torvalds committed
825
}
826
EXPORT_SYMBOL(elv_unregister_queue);
Linus Torvalds's avatar
Linus Torvalds committed
827

828
int elv_register(struct elevator_type *e)
Linus Torvalds's avatar
Linus Torvalds committed
829
{
830
	char *def = "";
831

832 833 834 835 836 837 838 839 840 841 842 843 844 845 846
	/* create icq_cache if requested */
	if (e->icq_size) {
		if (WARN_ON(e->icq_size < sizeof(struct io_cq)) ||
		    WARN_ON(e->icq_align < __alignof__(struct io_cq)))
			return -EINVAL;

		snprintf(e->icq_cache_name, sizeof(e->icq_cache_name),
			 "%s_io_cq", e->elevator_name);
		e->icq_cache = kmem_cache_create(e->icq_cache_name, e->icq_size,
						 e->icq_align, 0, NULL);
		if (!e->icq_cache)
			return -ENOMEM;
	}

	/* register, don't allow duplicate names */
847
	spin_lock(&elv_list_lock);
848 849 850 851 852 853
	if (elevator_find(e->elevator_name)) {
		spin_unlock(&elv_list_lock);
		if (e->icq_cache)
			kmem_cache_destroy(e->icq_cache);
		return -EBUSY;
	}
Linus Torvalds's avatar
Linus Torvalds committed
854
	list_add_tail(&e->list, &elv_list);
855
	spin_unlock(&elv_list_lock);
Linus Torvalds's avatar
Linus Torvalds committed
856

857
	/* print pretty message */
858 859 860
	if (!strcmp(e->elevator_name, chosen_elevator) ||
			(!*chosen_elevator &&
			 !strcmp(e->elevator_name, CONFIG_DEFAULT_IOSCHED)))
861 862
				def = " (default)";

863 864
	printk(KERN_INFO "io scheduler %s registered%s\n", e->elevator_name,
								def);
865
	return 0;
Linus Torvalds's avatar
Linus Torvalds committed
866 867 868 869 870
}
EXPORT_SYMBOL_GPL(elv_register);

void elv_unregister(struct elevator_type *e)
{
871
	/* unregister */
872
	spin_lock(&elv_list_lock);
Linus Torvalds's avatar
Linus Torvalds committed
873
	list_del_init(&e->list);
874
	spin_unlock(&elv_list_lock);
875 876 877 878 879 880 881 882 883 884

	/*
	 * Destroy icq_cache if it exists.  icq's are RCU managed.  Make
	 * sure all RCU operations are complete before proceeding.
	 */
	if (e->icq_cache) {
		rcu_barrier();
		kmem_cache_destroy(e->icq_cache);
		e->icq_cache = NULL;
	}
Linus Torvalds's avatar
Linus Torvalds committed
885 886 887 888 889 890 891
}
EXPORT_SYMBOL_GPL(elv_unregister);

/*
 * switch to new_e io scheduler. be careful not to introduce deadlocks -
 * we don't free the old io scheduler, before we have allocated what we
 * need for the new one. this way we have a chance of going back to the old
892
 * one, if the new one fails init for some reason.
Linus Torvalds's avatar
Linus Torvalds committed
893
 */
894
static int elevator_switch(struct request_queue *q, struct elevator_type *new_e)
Linus Torvalds's avatar
Linus Torvalds committed
895
{
896 897
	struct elevator_queue *old = q->elevator;
	bool registered = old->registered;
898
	int err;
Linus Torvalds's avatar
Linus Torvalds committed
899

900 901 902 903 904 905 906
	/*
	 * Turn on BYPASS and drain all requests w/ elevator private data.
	 * Block layer doesn't call into a quiesced elevator - all requests
	 * are directly put on the dispatch list without elevator data
	 * using INSERT_BACK.  All requests have SOFTBARRIER set and no
	 * merge happens either.
	 */
907
	blk_queue_bypass_start(q);
908

909 910
	/* unregister and clear all auxiliary data of the old elevator */
	if (registered)
911
		elv_unregister_queue(q);
Linus Torvalds's avatar
Linus Torvalds committed
912

913
	spin_lock_irq(q->queue_lock);
914
	ioc_clear_queue(q);
915 916
	spin_unlock_irq(q->queue_lock);

917
	/* allocate, init and register new elevator */
918 919
	err = new_e->ops.elevator_init_fn(q, new_e);
	if (err)
920 921 922 923 924 925 926 927 928 929
		goto fail_init;

	if (registered) {
		err = elv_register_queue(q);
		if (err)
			goto fail_register;
	}

	/* done, kill the old one and finish */
	elevator_exit(old);
930
	blk_queue_bypass_end(q);
931

932
	blk_add_trace_msg(q, "elv switch: %s", new_e->elevator_name);
933

934
	return 0;
Linus Torvalds's avatar
Linus Torvalds committed
935 936

fail_register:
937 938 939 940
	elevator_exit(q->elevator);
fail_init:
	/* switch failed, restore and re-register old elevator */
	q->elevator = old;
Linus Torvalds's avatar
Linus Torvalds committed
941
	elv_register_queue(q);
942
	blk_queue_bypass_end(q);
943

944
	return err;
Linus Torvalds's avatar
Linus Torvalds committed
945 946
}

947 948 949
/*
 * Switch this queue to the given IO scheduler.
 */
950
static int __elevator_change(struct request_queue *q, const char *name)
Linus Torvalds's avatar
Linus Torvalds committed
951 952 953 954
{
	char elevator_name[ELV_NAME_MAX];
	struct elevator_type *e;

955
	if (!q->elevator)
956
		return -ENXIO;
957

958
	strlcpy(elevator_name, name, sizeof(elevator_name));
959
	e = elevator_get(strstrip(elevator_name), true);
Linus Torvalds's avatar
Linus Torvalds committed
960 961 962 963 964
	if (!e) {
		printk(KERN_ERR "elevator: type %s not found\n", elevator_name);
		return -EINVAL;
	}

965
	if (!strcmp(elevator_name, q->elevator->type->elevator_name)) {
966
		elevator_put(e);
967
		return 0;
968
	}
Linus Torvalds's avatar
Linus Torvalds committed
969

970 971
	return elevator_switch(q, e);
}
972 973 974 975 976 977 978 979 980 981 982 983

int elevator_change(struct request_queue *q, const char *name)
{
	int ret;

	/* Protect q->elevator from elevator_init() */
	mutex_lock(&q->sysfs_lock);
	ret = __elevator_change(q, name);
	mutex_unlock(&q->sysfs_lock);

	return ret;
}
984 985 986 987 988 989 990 991 992 993
EXPORT_SYMBOL(elevator_change);

ssize_t elv_iosched_store(struct request_queue *q, const char *name,
			  size_t count)
{
	int ret;

	if (!q->elevator)
		return count;

994
	ret = __elevator_change(q, name);
995 996 997 998 999
	if (!ret)
		return count;

	printk(KERN_ERR "elevator: switch to %s failed\n", name);
	return ret;
Linus Torvalds's avatar
Linus Torvalds committed
1000 1001
}

1002
ssize_t elv_iosched_show(struct request_queue *q, char *name)
Linus Torvalds's avatar
Linus Torvalds committed
1003
{
1004
	struct elevator_queue *e = q->elevator;
1005
	struct elevator_type *elv;
1006
	struct elevator_type *__e;
Linus Torvalds's avatar
Linus Torvalds committed
1007 1008
	int len = 0;

1009
	if (!q->elevator || !blk_queue_stackable(q))
1010 1011
		return sprintf(name, "none\n");

1012
	elv = e->type;
1013

1014
	spin_lock(&elv_list_lock);
1015
	list_for_each_entry(__e, &elv_list, list) {
Linus Torvalds's avatar
Linus Torvalds committed
1016 1017 1018 1019 1020
		if (!strcmp(elv->elevator_name, __e->elevator_name))
			len += sprintf(name+len, "[%s] ", elv->elevator_name);
		else
			len += sprintf(name+len, "%s ", __e->elevator_name);
	}
1021
	spin_unlock(&elv_list_lock);
Linus Torvalds's avatar
Linus Torvalds committed
1022 1023 1024 1025 1026

	len += sprintf(len+name, "\n");
	return len;
}

1027 1028
struct request *elv_rb_former_request(struct request_queue *q,
				      struct request *rq)
1029 1030 1031 1032 1033 1034 1035 1036 1037 1038
{
	struct rb_node *rbprev = rb_prev(&rq->rb_node);

	if (rbprev)
		return rb_entry_rq(rbprev);

	return NULL;
}
EXPORT_SYMBOL(elv_rb_former_request);

1039 1040
struct request *elv_rb_latter_request(struct request_queue *q,
				      struct request *rq)
1041 1042 1043 1044 1045 1046 1047 1048 1049
{
	struct rb_node *rbnext = rb_next(&rq->rb_node);

	if (rbnext)
		return rb_entry_rq(rbnext);

	return NULL;
}
EXPORT_SYMBOL(elv_rb_latter_request);