[linux-2.6-block.git] / block / noop-iosched.c

/*
 * elevator noop
 */
#include <linux/blkdev.h>
#include <linux/elevator.h>
#include <linux/bio.h>
#include <linux/module.h>
#include <linux/init.h>

struct noop_data {
	struct list_head queue;
};

static void noop_merged_requests(struct request_queue *q, struct request *rq,
				 struct request *next)
{
	list_del_init(&next->queuelist);
}

static int noop_dispatch(struct request_queue *q, int force)
{
	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;
}

static void noop_add_request(struct request_queue *q, struct request *rq)
{
	struct noop_data *nd = q->elevator->elevator_data;

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

static int noop_queue_empty(struct request_queue *q)
{
	struct noop_data *nd = q->elevator->elevator_data;

	return list_empty(&nd->queue);
}

static struct request *
noop_former_request(struct request_queue *q, struct request *rq)
{
	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 *
noop_latter_request(struct request_queue *q, struct request *rq)
{
	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);
}

static void *noop_init_queue(struct request_queue *q)
{
	struct noop_data *nd;

	nd = kmalloc_node(sizeof(*nd), GFP_KERNEL, q->node);
	if (!nd)
		return NULL;
	INIT_LIST_HEAD(&nd->queue);
	return nd;
}

static void noop_exit_queue(struct elevator_queue *e)
{
	struct noop_data *nd = e->elevator_data;

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

static struct elevator_type elevator_noop = {
	.ops = {
		.elevator_merge_req_fn		= noop_merged_requests,
		.elevator_dispatch_fn		= noop_dispatch,
		.elevator_add_req_fn		= noop_add_request,
		.elevator_queue_empty_fn	= noop_queue_empty,
		.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,
	},
	.elevator_name = "noop",
	.elevator_owner = THIS_MODULE,
};

static int __init noop_init(void)
{
	elv_register(&elevator_noop);

	return 0;
}

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");
Commit	Line	Data
1da177e4 LT	1	/*
	2	* elevator noop
	3	*/
	4	#include <linux/blkdev.h>
	5	#include <linux/elevator.h>
	6	#include <linux/bio.h>
	7	#include <linux/module.h>
	8	#include <linux/init.h>
	9
5a7c47ee TH	10	struct noop_data {
	11	struct list_head queue;
	12	};
	13
165125e1	14	static void noop_merged_requests(struct request_queue q, struct request rq,
5a7c47ee TH	15	struct request *next)
	16	{
	17	list_del_init(&next->queuelist);
	18	}
	19
165125e1	20	static int noop_dispatch(struct request_queue *q, int force)
5a7c47ee TH	21	{
	22	struct noop_data *nd = q->elevator->elevator_data;
	23
	24	if (!list_empty(&nd->queue)) {
	25	struct request *rq;
	26	rq = list_entry(nd->queue.next, struct request, queuelist);
	27	list_del_init(&rq->queuelist);
	28	elv_dispatch_sort(q, rq);
	29	return 1;
	30	}
	31	return 0;
	32	}
	33
165125e1	34	static void noop_add_request(struct request_queue q, struct request rq)
5a7c47ee TH	35	{
	36	struct noop_data *nd = q->elevator->elevator_data;
	37
	38	list_add_tail(&rq->queuelist, &nd->queue);
	39	}
	40
165125e1	41	static int noop_queue_empty(struct request_queue *q)
1da177e4	42	{
5a7c47ee TH	43	struct noop_data *nd = q->elevator->elevator_data;
	44
	45	return list_empty(&nd->queue);
	46	}
	47
	48	static struct request *
165125e1	49	noop_former_request(struct request_queue q, struct request rq)
5a7c47ee TH	50	{
	51	struct noop_data *nd = q->elevator->elevator_data;
	52
	53	if (rq->queuelist.prev == &nd->queue)
	54	return NULL;
	55	return list_entry(rq->queuelist.prev, struct request, queuelist);
	56	}
	57
	58	static struct request *
165125e1	59	noop_latter_request(struct request_queue q, struct request rq)
5a7c47ee TH	60	{
	61	struct noop_data *nd = q->elevator->elevator_data;
	62
	63	if (rq->queuelist.next == &nd->queue)
	64	return NULL;
	65	return list_entry(rq->queuelist.next, struct request, queuelist);
1da177e4 LT	66	}
1da177e4 LT	67
165125e1	68	static void noop_init_queue(struct request_queue q)
1da177e4	69	{
5a7c47ee TH	70	struct noop_data *nd;
5a7c47ee TH	71
b5deef90	72	nd = kmalloc_node(sizeof(*nd), GFP_KERNEL, q->node);
5a7c47ee	73	if (!nd)
bc1c1169	74	return NULL;
5a7c47ee	75	INIT_LIST_HEAD(&nd->queue);
bc1c1169	76	return nd;
1da177e4 LT	77	}
1da177e4 LT	78
b374d18a	79	static void noop_exit_queue(struct elevator_queue *e)
5a7c47ee TH	80	{
	81	struct noop_data *nd = e->elevator_data;
	82
	83	BUG_ON(!list_empty(&nd->queue));
	84	kfree(nd);
	85	}
	86
1da177e4 LT	87	static struct elevator_type elevator_noop = {
1da177e4 LT	88	.ops = {
5a7c47ee TH	89	.elevator_merge_req_fn = noop_merged_requests,
	90	.elevator_dispatch_fn = noop_dispatch,
	91	.elevator_add_req_fn = noop_add_request,
	92	.elevator_queue_empty_fn = noop_queue_empty,
	93	.elevator_former_req_fn = noop_former_request,
	94	.elevator_latter_req_fn = noop_latter_request,
	95	.elevator_init_fn = noop_init_queue,
	96	.elevator_exit_fn = noop_exit_queue,
1da177e4 LT	97	},
	98	.elevator_name = "noop",
	99	.elevator_owner = THIS_MODULE,
	100	};
	101
	102	static int __init noop_init(void)
	103	{
2fdd82bd AB	104	elv_register(&elevator_noop);
	105
	106	return 0;
1da177e4 LT	107	}
	108
	109	static void __exit noop_exit(void)
	110	{
	111	elv_unregister(&elevator_noop);
	112	}
	113
	114	module_init(noop_init);
	115	module_exit(noop_exit);
	116
	117
	118	MODULE_AUTHOR("Jens Axboe");
	119	MODULE_LICENSE("GPL");
	120	MODULE_DESCRIPTION("No-op IO scheduler");