]>
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 | ||
14 | static void noop_merged_requests(request_queue_t *q, struct request *rq, | |
15 | struct request *next) | |
16 | { | |
17 | list_del_init(&next->queuelist); | |
18 | } | |
19 | ||
20 | static int noop_dispatch(request_queue_t *q, int force) | |
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 | ||
34 | static void noop_add_request(request_queue_t *q, struct request *rq) | |
35 | { | |
36 | struct noop_data *nd = q->elevator->elevator_data; | |
37 | ||
38 | list_add_tail(&rq->queuelist, &nd->queue); | |
39 | } | |
40 | ||
41 | static int noop_queue_empty(request_queue_t *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 * | |
49 | noop_former_request(request_queue_t *q, struct request *rq) | |
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 * | |
59 | noop_latter_request(request_queue_t *q, struct request *rq) | |
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 | } |
67 | ||
bc1c1169 | 68 | static void *noop_init_queue(request_queue_t *q, elevator_t *e) |
1da177e4 | 69 | { |
5a7c47ee TH |
70 | struct noop_data *nd; |
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 | } |
78 | ||
5a7c47ee TH |
79 | static void noop_exit_queue(elevator_t *e) |
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 = { |
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 | { | |
104 | return elv_register(&elevator_noop); | |
105 | } | |
106 | ||
107 | static void __exit noop_exit(void) | |
108 | { | |
109 | elv_unregister(&elevator_noop); | |
110 | } | |
111 | ||
112 | module_init(noop_init); | |
113 | module_exit(noop_exit); | |
114 | ||
115 | ||
116 | MODULE_AUTHOR("Jens Axboe"); | |
117 | MODULE_LICENSE("GPL"); | |
118 | MODULE_DESCRIPTION("No-op IO scheduler"); |