]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | linear.c : Multiple Devices driver for Linux | |
3 | Copyright (C) 1994-96 Marc ZYNGIER | |
4 | <zyngier@ufr-info-p7.ibp.fr> or | |
5 | <maz@gloups.fdn.fr> | |
6 | ||
7 | Linear mode management functions. | |
8 | ||
9 | This program is free software; you can redistribute it and/or modify | |
10 | it under the terms of the GNU General Public License as published by | |
11 | the Free Software Foundation; either version 2, or (at your option) | |
12 | any later version. | |
f72ffdd6 | 13 | |
1da177e4 LT |
14 | You should have received a copy of the GNU General Public License |
15 | (for example /usr/src/linux/COPYING); if not, write to the Free | |
f72ffdd6 | 16 | Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
1da177e4 LT |
17 | */ |
18 | ||
bff61975 N |
19 | #include <linux/blkdev.h> |
20 | #include <linux/raid/md_u.h> | |
bff61975 | 21 | #include <linux/seq_file.h> |
056075c7 | 22 | #include <linux/module.h> |
5a0e3ad6 | 23 | #include <linux/slab.h> |
43b2e5d8 | 24 | #include "md.h" |
ef740c37 | 25 | #include "linear.h" |
1da177e4 | 26 | |
1da177e4 | 27 | /* |
f72ffdd6 | 28 | * find which device holds a particular offset |
1da177e4 | 29 | */ |
a7120771 | 30 | static inline struct dev_info *which_dev(struct mddev *mddev, sector_t sector) |
1da177e4 | 31 | { |
aece3d1f | 32 | int lo, mid, hi; |
e849b938 | 33 | struct linear_conf *conf; |
1da177e4 | 34 | |
aece3d1f SS |
35 | lo = 0; |
36 | hi = mddev->raid_disks - 1; | |
3be260cc | 37 | conf = mddev->private; |
1da177e4 | 38 | |
aece3d1f SS |
39 | /* |
40 | * Binary Search | |
41 | */ | |
42 | ||
43 | while (hi > lo) { | |
44 | ||
45 | mid = (hi + lo) / 2; | |
46 | if (sector < conf->disks[mid].end_sector) | |
47 | hi = mid; | |
48 | else | |
49 | lo = mid + 1; | |
50 | } | |
51 | ||
52 | return conf->disks + lo; | |
1da177e4 LT |
53 | } |
54 | ||
55 | /** | |
15945fee | 56 | * linear_mergeable_bvec -- tell bio layer if two requests can be merged |
1da177e4 | 57 | * @q: request queue |
cc371e66 | 58 | * @bvm: properties of new bio |
1da177e4 LT |
59 | * @biovec: the request that could be merged to it. |
60 | * | |
61 | * Return amount of bytes we can take at this offset | |
62 | */ | |
64590f45 | 63 | static int linear_mergeable_bvec(struct mddev *mddev, |
cc371e66 AK |
64 | struct bvec_merge_data *bvm, |
65 | struct bio_vec *biovec) | |
1da177e4 | 66 | { |
a7120771 | 67 | struct dev_info *dev0; |
cc371e66 AK |
68 | unsigned long maxsectors, bio_sectors = bvm->bi_size >> 9; |
69 | sector_t sector = bvm->bi_sector + get_start_sect(bvm->bi_bdev); | |
ba13da47 N |
70 | int maxbytes = biovec->bv_len; |
71 | struct request_queue *subq; | |
1da177e4 LT |
72 | |
73 | dev0 = which_dev(mddev, sector); | |
4db7cdc8 | 74 | maxsectors = dev0->end_sector - sector; |
ba13da47 N |
75 | subq = bdev_get_queue(dev0->rdev->bdev); |
76 | if (subq->merge_bvec_fn) { | |
77 | bvm->bi_bdev = dev0->rdev->bdev; | |
78 | bvm->bi_sector -= dev0->end_sector - dev0->rdev->sectors; | |
79 | maxbytes = min(maxbytes, subq->merge_bvec_fn(subq, bvm, | |
80 | biovec)); | |
81 | } | |
1da177e4 LT |
82 | |
83 | if (maxsectors < bio_sectors) | |
84 | maxsectors = 0; | |
85 | else | |
86 | maxsectors -= bio_sectors; | |
87 | ||
88 | if (maxsectors <= (PAGE_SIZE >> 9 ) && bio_sectors == 0) | |
ba13da47 N |
89 | return maxbytes; |
90 | ||
91 | if (maxsectors > (maxbytes >> 9)) | |
92 | return maxbytes; | |
93 | else | |
94 | return maxsectors << 9; | |
1da177e4 LT |
95 | } |
96 | ||
5c675f83 | 97 | static int linear_congested(struct mddev *mddev, int bits) |
26be34dc | 98 | { |
e849b938 | 99 | struct linear_conf *conf; |
26be34dc N |
100 | int i, ret = 0; |
101 | ||
3be260cc | 102 | conf = mddev->private; |
af11c397 | 103 | |
26be34dc | 104 | for (i = 0; i < mddev->raid_disks && !ret ; i++) { |
165125e1 | 105 | struct request_queue *q = bdev_get_queue(conf->disks[i].rdev->bdev); |
26be34dc N |
106 | ret |= bdi_congested(&q->backing_dev_info, bits); |
107 | } | |
af11c397 | 108 | |
26be34dc N |
109 | return ret; |
110 | } | |
111 | ||
fd01b88c | 112 | static sector_t linear_size(struct mddev *mddev, sector_t sectors, int raid_disks) |
80c3a6ce | 113 | { |
e849b938 | 114 | struct linear_conf *conf; |
af11c397 | 115 | sector_t array_sectors; |
80c3a6ce | 116 | |
3be260cc | 117 | conf = mddev->private; |
80c3a6ce DW |
118 | WARN_ONCE(sectors || raid_disks, |
119 | "%s does not support generic reshape\n", __func__); | |
af11c397 | 120 | array_sectors = conf->array_sectors; |
80c3a6ce | 121 | |
af11c397 | 122 | return array_sectors; |
80c3a6ce DW |
123 | } |
124 | ||
e849b938 | 125 | static struct linear_conf *linear_conf(struct mddev *mddev, int raid_disks) |
1da177e4 | 126 | { |
e849b938 | 127 | struct linear_conf *conf; |
3cb03002 | 128 | struct md_rdev *rdev; |
45d4582f | 129 | int i, cnt; |
f1cad2b6 | 130 | bool discard_supported = false; |
1da177e4 | 131 | |
a7120771 | 132 | conf = kzalloc (sizeof (*conf) + raid_disks*sizeof(struct dev_info), |
1da177e4 LT |
133 | GFP_KERNEL); |
134 | if (!conf) | |
7c7546cc N |
135 | return NULL; |
136 | ||
1da177e4 | 137 | cnt = 0; |
d6e22150 | 138 | conf->array_sectors = 0; |
1da177e4 | 139 | |
dafb20fa | 140 | rdev_for_each(rdev, mddev) { |
1da177e4 | 141 | int j = rdev->raid_disk; |
a7120771 | 142 | struct dev_info *disk = conf->disks + j; |
13f2682b | 143 | sector_t sectors; |
1da177e4 | 144 | |
13864515 | 145 | if (j < 0 || j >= raid_disks || disk->rdev) { |
2dc40f80 N |
146 | printk(KERN_ERR "md/linear:%s: disk numbering problem. Aborting!\n", |
147 | mdname(mddev)); | |
1da177e4 LT |
148 | goto out; |
149 | } | |
150 | ||
151 | disk->rdev = rdev; | |
13f2682b N |
152 | if (mddev->chunk_sectors) { |
153 | sectors = rdev->sectors; | |
154 | sector_div(sectors, mddev->chunk_sectors); | |
155 | rdev->sectors = sectors * mddev->chunk_sectors; | |
156 | } | |
1da177e4 | 157 | |
8f6c2e4b MP |
158 | disk_stack_limits(mddev->gendisk, rdev->bdev, |
159 | rdev->data_offset << 9); | |
1da177e4 | 160 | |
dd8ac336 | 161 | conf->array_sectors += rdev->sectors; |
1da177e4 | 162 | cnt++; |
4db7cdc8 | 163 | |
f1cad2b6 SL |
164 | if (blk_queue_discard(bdev_get_queue(rdev->bdev))) |
165 | discard_supported = true; | |
1da177e4 | 166 | } |
7c7546cc | 167 | if (cnt != raid_disks) { |
2dc40f80 N |
168 | printk(KERN_ERR "md/linear:%s: not enough drives present. Aborting!\n", |
169 | mdname(mddev)); | |
1da177e4 LT |
170 | goto out; |
171 | } | |
172 | ||
f1cad2b6 SL |
173 | if (!discard_supported) |
174 | queue_flag_clear_unlocked(QUEUE_FLAG_DISCARD, mddev->queue); | |
175 | else | |
176 | queue_flag_set_unlocked(QUEUE_FLAG_DISCARD, mddev->queue); | |
177 | ||
1da177e4 | 178 | /* |
45d4582f | 179 | * Here we calculate the device offsets. |
1da177e4 | 180 | */ |
4db7cdc8 SS |
181 | conf->disks[0].end_sector = conf->disks[0].rdev->sectors; |
182 | ||
a778b73f | 183 | for (i = 1; i < raid_disks; i++) |
4db7cdc8 SS |
184 | conf->disks[i].end_sector = |
185 | conf->disks[i-1].end_sector + | |
186 | conf->disks[i].rdev->sectors; | |
15945fee | 187 | |
7c7546cc N |
188 | return conf; |
189 | ||
190 | out: | |
191 | kfree(conf); | |
192 | return NULL; | |
193 | } | |
194 | ||
fd01b88c | 195 | static int linear_run (struct mddev *mddev) |
7c7546cc | 196 | { |
e849b938 | 197 | struct linear_conf *conf; |
98d5561b | 198 | int ret; |
7c7546cc | 199 | |
0894cc30 AN |
200 | if (md_check_no_bitmap(mddev)) |
201 | return -EINVAL; | |
7c7546cc N |
202 | conf = linear_conf(mddev, mddev->raid_disks); |
203 | ||
204 | if (!conf) | |
205 | return 1; | |
206 | mddev->private = conf; | |
1f403624 | 207 | md_set_array_sectors(mddev, linear_size(mddev, 0, 0)); |
7c7546cc | 208 | |
98d5561b | 209 | ret = md_integrity_register(mddev); |
210 | if (ret) { | |
211 | kfree(conf); | |
212 | mddev->private = NULL; | |
213 | } | |
214 | return ret; | |
7c7546cc | 215 | } |
1da177e4 | 216 | |
fd01b88c | 217 | static int linear_add(struct mddev *mddev, struct md_rdev *rdev) |
7c7546cc N |
218 | { |
219 | /* Adding a drive to a linear array allows the array to grow. | |
220 | * It is permitted if the new drive has a matching superblock | |
221 | * already on it, with raid_disk equal to raid_disks. | |
222 | * It is achieved by creating a new linear_private_data structure | |
223 | * and swapping it in in-place of the current one. | |
224 | * The current one is never freed until the array is stopped. | |
225 | * This avoids races. | |
226 | */ | |
e849b938 | 227 | struct linear_conf *newconf, *oldconf; |
7c7546cc | 228 | |
a778b73f | 229 | if (rdev->saved_raid_disk != mddev->raid_disks) |
7c7546cc N |
230 | return -EINVAL; |
231 | ||
a778b73f | 232 | rdev->raid_disk = rdev->saved_raid_disk; |
09cd9270 | 233 | rdev->saved_raid_disk = -1; |
a778b73f | 234 | |
7c7546cc N |
235 | newconf = linear_conf(mddev,mddev->raid_disks+1); |
236 | ||
237 | if (!newconf) | |
238 | return -ENOMEM; | |
239 | ||
3be260cc N |
240 | mddev_suspend(mddev); |
241 | oldconf = mddev->private; | |
7c7546cc | 242 | mddev->raid_disks++; |
3be260cc | 243 | mddev->private = newconf; |
1f403624 | 244 | md_set_array_sectors(mddev, linear_size(mddev, 0, 0)); |
f233ea5c | 245 | set_capacity(mddev->gendisk, mddev->array_sectors); |
3be260cc | 246 | mddev_resume(mddev); |
449aad3e | 247 | revalidate_disk(mddev->gendisk); |
3be260cc | 248 | kfree(oldconf); |
7c7546cc | 249 | return 0; |
1da177e4 LT |
250 | } |
251 | ||
afa0f557 | 252 | static void linear_free(struct mddev *mddev, void *priv) |
1da177e4 | 253 | { |
afa0f557 | 254 | struct linear_conf *conf = priv; |
af11c397 | 255 | |
495d3573 | 256 | kfree(conf); |
1da177e4 LT |
257 | } |
258 | ||
b4fdcb02 | 259 | static void linear_make_request(struct mddev *mddev, struct bio *bio) |
1da177e4 | 260 | { |
20d0189b | 261 | char b[BDEVNAME_SIZE]; |
a7120771 | 262 | struct dev_info *tmp_dev; |
20d0189b KO |
263 | struct bio *split; |
264 | sector_t start_sector, end_sector, data_offset; | |
1da177e4 | 265 | |
e9c7469b TH |
266 | if (unlikely(bio->bi_rw & REQ_FLUSH)) { |
267 | md_flush_request(mddev, bio); | |
5a7bbad2 | 268 | return; |
e5dcdd80 N |
269 | } |
270 | ||
20d0189b | 271 | do { |
20d0189b KO |
272 | tmp_dev = which_dev(mddev, bio->bi_iter.bi_sector); |
273 | start_sector = tmp_dev->end_sector - tmp_dev->rdev->sectors; | |
274 | end_sector = tmp_dev->end_sector; | |
275 | data_offset = tmp_dev->rdev->data_offset; | |
276 | bio->bi_bdev = tmp_dev->rdev->bdev; | |
6283815d | 277 | |
20d0189b KO |
278 | if (unlikely(bio->bi_iter.bi_sector >= end_sector || |
279 | bio->bi_iter.bi_sector < start_sector)) | |
280 | goto out_of_bounds; | |
281 | ||
282 | if (unlikely(bio_end_sector(bio) > end_sector)) { | |
283 | /* This bio crosses a device boundary, so we have to | |
284 | * split it. | |
285 | */ | |
286 | split = bio_split(bio, end_sector - | |
287 | bio->bi_iter.bi_sector, | |
288 | GFP_NOIO, fs_bio_set); | |
289 | bio_chain(split, bio); | |
290 | } else { | |
291 | split = bio; | |
292 | } | |
f1cad2b6 | 293 | |
20d0189b KO |
294 | split->bi_iter.bi_sector = split->bi_iter.bi_sector - |
295 | start_sector + data_offset; | |
296 | ||
297 | if (unlikely((split->bi_rw & REQ_DISCARD) && | |
298 | !blk_queue_discard(bdev_get_queue(split->bi_bdev)))) { | |
299 | /* Just ignore it */ | |
300 | bio_endio(split, 0); | |
301 | } else | |
302 | generic_make_request(split); | |
303 | } while (split != bio); | |
304 | return; | |
305 | ||
306 | out_of_bounds: | |
307 | printk(KERN_ERR | |
308 | "md/linear:%s: make_request: Sector %llu out of bounds on " | |
309 | "dev %s: %llu sectors, offset %llu\n", | |
310 | mdname(mddev), | |
311 | (unsigned long long)bio->bi_iter.bi_sector, | |
312 | bdevname(tmp_dev->rdev->bdev, b), | |
313 | (unsigned long long)tmp_dev->rdev->sectors, | |
314 | (unsigned long long)start_sector); | |
315 | bio_io_error(bio); | |
1da177e4 LT |
316 | } |
317 | ||
fd01b88c | 318 | static void linear_status (struct seq_file *seq, struct mddev *mddev) |
1da177e4 LT |
319 | { |
320 | ||
9d8f0363 | 321 | seq_printf(seq, " %dk rounding", mddev->chunk_sectors / 2); |
1da177e4 LT |
322 | } |
323 | ||
3be260cc N |
324 | static void linear_quiesce(struct mddev *mddev, int state) |
325 | { | |
326 | } | |
327 | ||
84fc4b56 | 328 | static struct md_personality linear_personality = |
1da177e4 LT |
329 | { |
330 | .name = "linear", | |
2604b703 | 331 | .level = LEVEL_LINEAR, |
1da177e4 LT |
332 | .owner = THIS_MODULE, |
333 | .make_request = linear_make_request, | |
334 | .run = linear_run, | |
afa0f557 | 335 | .free = linear_free, |
1da177e4 | 336 | .status = linear_status, |
7c7546cc | 337 | .hot_add_disk = linear_add, |
80c3a6ce | 338 | .size = linear_size, |
3be260cc | 339 | .quiesce = linear_quiesce, |
5c675f83 | 340 | .congested = linear_congested, |
64590f45 | 341 | .mergeable_bvec = linear_mergeable_bvec, |
1da177e4 LT |
342 | }; |
343 | ||
344 | static int __init linear_init (void) | |
345 | { | |
2604b703 | 346 | return register_md_personality (&linear_personality); |
1da177e4 LT |
347 | } |
348 | ||
349 | static void linear_exit (void) | |
350 | { | |
2604b703 | 351 | unregister_md_personality (&linear_personality); |
1da177e4 LT |
352 | } |
353 | ||
1da177e4 LT |
354 | module_init(linear_init); |
355 | module_exit(linear_exit); | |
356 | MODULE_LICENSE("GPL"); | |
0efb9e61 | 357 | MODULE_DESCRIPTION("Linear device concatenation personality for MD"); |
d9d166c2 N |
358 | MODULE_ALIAS("md-personality-1"); /* LINEAR - deprecated*/ |
359 | MODULE_ALIAS("md-linear"); | |
2604b703 | 360 | MODULE_ALIAS("md-level--1"); |