noop-iosched.c 2.5 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7
/*
 * elevator noop
 */
#include <linux/blkdev.h>
#include <linux/elevator.h>
#include <linux/bio.h>
#include <linux/module.h>
8
#include <linux/slab.h>
L
Linus Torvalds 已提交
9 10
#include <linux/init.h>

11 12 13 14
struct noop_data {
	struct list_head queue;
};

15
static void noop_merged_requests(struct request_queue *q, struct request *rq,
16 17 18 19 20
				 struct request *next)
{
	list_del_init(&next->queuelist);
}

21
static int noop_dispatch(struct request_queue *q, int force)
22 23 24 25 26 27 28 29 30 31 32 33 34
{
	struct noop_data *nd = q->elevator->elevator_data;

	if (!list_empty(&nd->queue)) {
		struct request *rq;
		rq = list_entry(nd->queue.next, struct request, queuelist);
		list_del_init(&rq->queuelist);
		elv_dispatch_sort(q, rq);
		return 1;
	}
	return 0;
}

35
static void noop_add_request(struct request_queue *q, struct request *rq)
36 37 38 39 40 41 42
{
	struct noop_data *nd = q->elevator->elevator_data;

	list_add_tail(&rq->queuelist, &nd->queue);
}

static struct request *
43
noop_former_request(struct request_queue *q, struct request *rq)
44 45 46 47 48 49 50 51 52
{
	struct noop_data *nd = q->elevator->elevator_data;

	if (rq->queuelist.prev == &nd->queue)
		return NULL;
	return list_entry(rq->queuelist.prev, struct request, queuelist);
}

static struct request *
53
noop_latter_request(struct request_queue *q, struct request *rq)
54 55 56 57 58 59
{
	struct noop_data *nd = q->elevator->elevator_data;

	if (rq->queuelist.next == &nd->queue)
		return NULL;
	return list_entry(rq->queuelist.next, struct request, queuelist);
L
Linus Torvalds 已提交
60 61
}

62
static int noop_init_queue(struct request_queue *q)
L
Linus Torvalds 已提交
63
{
64 65
	struct noop_data *nd;

66
	nd = kmalloc_node(sizeof(*nd), GFP_KERNEL, q->node);
67
	if (!nd)
68 69
		return -ENOMEM;

70
	INIT_LIST_HEAD(&nd->queue);
71 72
	q->elevator->elevator_data = nd;
	return 0;
L
Linus Torvalds 已提交
73 74
}

J
Jens Axboe 已提交
75
static void noop_exit_queue(struct elevator_queue *e)
76 77 78 79 80 81 82
{
	struct noop_data *nd = e->elevator_data;

	BUG_ON(!list_empty(&nd->queue));
	kfree(nd);
}

L
Linus Torvalds 已提交
83 84
static struct elevator_type elevator_noop = {
	.ops = {
85 86 87 88 89 90 91
		.elevator_merge_req_fn		= noop_merged_requests,
		.elevator_dispatch_fn		= noop_dispatch,
		.elevator_add_req_fn		= noop_add_request,
		.elevator_former_req_fn		= noop_former_request,
		.elevator_latter_req_fn		= noop_latter_request,
		.elevator_init_fn		= noop_init_queue,
		.elevator_exit_fn		= noop_exit_queue,
L
Linus Torvalds 已提交
92 93 94 95 96 97 98
	},
	.elevator_name = "noop",
	.elevator_owner = THIS_MODULE,
};

static int __init noop_init(void)
{
99
	return elv_register(&elevator_noop);
L
Linus Torvalds 已提交
100 101 102 103 104 105 106 107 108 109 110 111 112 113
}

static void __exit noop_exit(void)
{
	elv_unregister(&elevator_noop);
}

module_init(noop_init);
module_exit(noop_exit);


MODULE_AUTHOR("Jens Axboe");
MODULE_LICENSE("GPL");
MODULE_DESCRIPTION("No-op IO scheduler");