Files
linux-apfs/block/noop-iosched.c
T

125 lines
2.6 KiB
C
Raw Normal View History

2005-04-16 15:20:36 -07:00
/*
* elevator noop
*/
#include <linux/blkdev.h>
#include <linux/elevator.h>
#include <linux/bio.h>
#include <linux/module.h>
#include <linux/slab.h>
2005-04-16 15:20:36 -07:00
#include <linux/init.h>
struct noop_data {
struct list_head queue;
};
2007-07-24 09:28:11 +02:00
static void noop_merged_requests(struct request_queue *q, struct request *rq,
struct request *next)
2005-04-16 15:20:36 -07:00
{
list_del_init(&next->queuelist);
2005-04-16 15:20:36 -07:00
}
2007-07-24 09:28:11 +02:00
static int noop_dispatch(struct request_queue *q, int force)
2005-04-16 15:20:36 -07:00
{
struct noop_data *nd = q->elevator->elevator_data;
2015-11-16 23:30:00 +08:00
struct request *rq;
2015-11-16 23:30:00 +08:00
rq = list_first_entry_or_null(&nd->queue, struct request, queuelist);
if (rq) {
list_del_init(&rq->queuelist);
elv_dispatch_sort(q, rq);
return 1;
}
return 0;
2005-04-16 15:20:36 -07:00
}
2007-07-24 09:28:11 +02:00
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 struct request *
2007-07-24 09:28:11 +02:00
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;
2015-11-16 23:30:00 +08:00
return list_prev_entry(rq, queuelist);
}
static struct request *
2007-07-24 09:28:11 +02:00
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;
2015-11-16 23:30:00 +08:00
return list_next_entry(rq, queuelist);
}
2013-07-03 13:25:24 +02:00
static int noop_init_queue(struct request_queue *q, struct elevator_type *e)
{
struct noop_data *nd;
2013-07-03 13:25:24 +02:00
struct elevator_queue *eq;
2013-07-03 13:25:24 +02:00
eq = elevator_alloc(q, e);
if (!eq)
return -ENOMEM;
2013-07-03 13:25:24 +02:00
nd = kmalloc_node(sizeof(*nd), GFP_KERNEL, q->node);
if (!nd) {
kobject_put(&eq->kobj);
return -ENOMEM;
}
eq->elevator_data = nd;
INIT_LIST_HEAD(&nd->queue);
2013-07-03 13:25:24 +02:00
spin_lock_irq(q->queue_lock);
q->elevator = eq;
spin_unlock_irq(q->queue_lock);
return 0;
}
2008-10-31 10:05:07 +01:00
static void noop_exit_queue(struct elevator_queue *e)
{
struct noop_data *nd = e->elevator_data;
BUG_ON(!list_empty(&nd->queue));
kfree(nd);
}
2005-04-16 15:20:36 -07:00
static struct elevator_type elevator_noop = {
2016-12-10 15:13:59 -07:00
.ops.sq = {
.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,
2005-04-16 15:20:36 -07:00
},
.elevator_name = "noop",
.elevator_owner = THIS_MODULE,
};
static int __init noop_init(void)
{
return elv_register(&elevator_noop);
2005-04-16 15:20:36 -07:00
}
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");