1
2
3
4
5
6
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
|
/*
* linux/drivers/block/elevator.c
*
* Block device elevator/IO-scheduler.
*
* Copyright (C) 2000 Andrea Arcangeli <andrea@suse.de> SuSE
*
* 30042000 Jens Axboe <axboe@suse.de> :
*
* 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
*
*/
#include <linux/fs.h>
#include <linux/blkdev.h>
#include <linux/elevator.h>
#include <linux/blk.h>
#include <asm/uaccess.h>
/*
* Order ascending, but only allow a request to be skipped a certain
* number of times
*/
void elevator_linus(struct request *req, elevator_t *elevator,
struct list_head *real_head,
struct list_head *head, int orig_latency)
{
struct list_head *entry = real_head;
struct request *tmp;
req->elevator_sequence = orig_latency;
while ((entry = entry->prev) != head) {
tmp = blkdev_entry_to_request(entry);
if (IN_ORDER(tmp, req))
break;
if (!tmp->elevator_sequence)
break;
tmp->elevator_sequence--;
}
list_add(&req->queue, entry);
}
int elevator_linus_merge(request_queue_t *q, struct request **req,
struct buffer_head *bh, int rw,
int *max_sectors, int *max_segments)
{
struct list_head *entry, *head = &q->queue_head;
unsigned int count = bh->b_size >> 9, ret = ELEVATOR_NO_MERGE;
entry = head;
if (q->head_active && !q->plugged)
head = head->next;
while ((entry = entry->prev) != head) {
struct request *__rq = *req = blkdev_entry_to_request(entry);
if (__rq->sem)
continue;
if (__rq->cmd != rw)
continue;
if (__rq->nr_sectors + count > *max_sectors)
continue;
if (__rq->rq_dev != bh->b_rdev)
continue;
if (__rq->sector + __rq->nr_sectors == bh->b_rsector) {
ret = ELEVATOR_BACK_MERGE;
break;
}
if (!__rq->elevator_sequence)
break;
if (__rq->sector - count == bh->b_rsector) {
__rq->elevator_sequence--;
ret = ELEVATOR_FRONT_MERGE;
break;
}
}
/*
* second pass scan of requests that got passed over, if any
*/
if (ret != ELEVATOR_NO_MERGE && *req) {
while ((entry = entry->next) != &q->queue_head) {
struct request *tmp = blkdev_entry_to_request(entry);
tmp->elevator_sequence--;
}
}
return ret;
}
/*
* No request sorting, just add it to the back of the list
*/
void elevator_noop(struct request *req, elevator_t *elevator,
struct list_head *real_head, struct list_head *head,
int orig_latency)
{
list_add_tail(&req->queue, real_head);
}
/*
* See if we can find a request that is buffer can be coalesced with.
*/
int elevator_noop_merge(request_queue_t *q, struct request **req,
struct buffer_head *bh, int rw,
int *max_sectors, int *max_segments)
{
struct list_head *entry, *head = &q->queue_head;
unsigned int count = bh->b_size >> 9;
if (q->head_active && !q->plugged)
head = head->next;
entry = head;
while ((entry = entry->prev) != head) {
struct request *__rq = *req = blkdev_entry_to_request(entry);
if (__rq->sem)
continue;
if (__rq->cmd != rw)
continue;
if (__rq->nr_sectors + count > *max_sectors)
continue;
if (__rq->rq_dev != bh->b_rdev)
continue;
if (__rq->sector + __rq->nr_sectors == bh->b_rsector)
return ELEVATOR_BACK_MERGE;
if (__rq->sector - count == bh->b_rsector)
return ELEVATOR_FRONT_MERGE;
}
return ELEVATOR_NO_MERGE;
}
/*
* The noop "elevator" does not do any accounting
*/
void elevator_noop_dequeue(struct request *req) {}
int blkelvget_ioctl(elevator_t * elevator, blkelv_ioctl_arg_t * arg)
{
blkelv_ioctl_arg_t output;
output.queue_ID = elevator->queue_ID;
output.read_latency = elevator->read_latency;
output.write_latency = elevator->write_latency;
output.max_bomb_segments = 0;
if (copy_to_user(arg, &output, sizeof(blkelv_ioctl_arg_t)))
return -EFAULT;
return 0;
}
int blkelvset_ioctl(elevator_t * elevator, const blkelv_ioctl_arg_t * arg)
{
blkelv_ioctl_arg_t input;
if (copy_from_user(&input, arg, sizeof(blkelv_ioctl_arg_t)))
return -EFAULT;
if (input.read_latency < 0)
return -EINVAL;
if (input.write_latency < 0)
return -EINVAL;
elevator->read_latency = input.read_latency;
elevator->write_latency = input.write_latency;
return 0;
}
void elevator_init(elevator_t * elevator, elevator_t type)
{
static unsigned int queue_ID;
*elevator = type;
elevator->queue_ID = queue_ID++;
}
|
