blob: 564c390f8a1b8127a7cda1efb35b9b25c846b397 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
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.
13
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
16 Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
17*/
18
NeilBrownbff61972009-03-31 14:33:13 +110019#include <linux/blkdev.h>
20#include <linux/raid/md_u.h>
NeilBrownbff61972009-03-31 14:33:13 +110021#include <linux/seq_file.h>
NeilBrown43b2e5d2009-03-31 14:33:13 +110022#include "md.h"
Christoph Hellwigef740c32009-03-31 14:27:03 +110023#include "linear.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070024
Linus Torvalds1da177e2005-04-16 15:20:36 -070025/*
26 * find which device holds a particular offset
27 */
28static inline dev_info_t *which_dev(mddev_t *mddev, sector_t sector)
29{
Sandeep K Sinhaaece3d12009-06-16 16:57:08 +100030 int lo, mid, hi;
NeilBrown070ec552009-06-16 16:54:21 +100031 linear_conf_t *conf = mddev->private;
Linus Torvalds1da177e2005-04-16 15:20:36 -070032
Sandeep K Sinhaaece3d12009-06-16 16:57:08 +100033 lo = 0;
34 hi = mddev->raid_disks - 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -070035
Sandeep K Sinhaaece3d12009-06-16 16:57:08 +100036 /*
37 * Binary Search
38 */
39
40 while (hi > lo) {
41
42 mid = (hi + lo) / 2;
43 if (sector < conf->disks[mid].end_sector)
44 hi = mid;
45 else
46 lo = mid + 1;
47 }
48
49 return conf->disks + lo;
Linus Torvalds1da177e2005-04-16 15:20:36 -070050}
51
52/**
NeilBrown15945fe2005-09-09 16:23:47 -070053 * linear_mergeable_bvec -- tell bio layer if two requests can be merged
Linus Torvalds1da177e2005-04-16 15:20:36 -070054 * @q: request queue
Alasdair G Kergoncc371e62008-07-03 09:53:43 +020055 * @bvm: properties of new bio
Linus Torvalds1da177e2005-04-16 15:20:36 -070056 * @biovec: the request that could be merged to it.
57 *
58 * Return amount of bytes we can take at this offset
59 */
Alasdair G Kergoncc371e62008-07-03 09:53:43 +020060static int linear_mergeable_bvec(struct request_queue *q,
61 struct bvec_merge_data *bvm,
62 struct bio_vec *biovec)
Linus Torvalds1da177e2005-04-16 15:20:36 -070063{
64 mddev_t *mddev = q->queuedata;
65 dev_info_t *dev0;
Alasdair G Kergoncc371e62008-07-03 09:53:43 +020066 unsigned long maxsectors, bio_sectors = bvm->bi_size >> 9;
67 sector_t sector = bvm->bi_sector + get_start_sect(bvm->bi_bdev);
Linus Torvalds1da177e2005-04-16 15:20:36 -070068
69 dev0 = which_dev(mddev, sector);
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +100070 maxsectors = dev0->end_sector - sector;
Linus Torvalds1da177e2005-04-16 15:20:36 -070071
72 if (maxsectors < bio_sectors)
73 maxsectors = 0;
74 else
75 maxsectors -= bio_sectors;
76
77 if (maxsectors <= (PAGE_SIZE >> 9 ) && bio_sectors == 0)
78 return biovec->bv_len;
79 /* The bytes available at this offset could be really big,
80 * so we cap at 2^31 to avoid overflow */
81 if (maxsectors > (1 << (31-9)))
82 return 1<<31;
83 return maxsectors << 9;
84}
85
Jens Axboe165125e2007-07-24 09:28:11 +020086static void linear_unplug(struct request_queue *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -070087{
88 mddev_t *mddev = q->queuedata;
NeilBrown070ec552009-06-16 16:54:21 +100089 linear_conf_t *conf = mddev->private;
Linus Torvalds1da177e2005-04-16 15:20:36 -070090 int i;
91
92 for (i=0; i < mddev->raid_disks; i++) {
Jens Axboe165125e2007-07-24 09:28:11 +020093 struct request_queue *r_queue = bdev_get_queue(conf->disks[i].rdev->bdev);
Alan D. Brunelle2ad8b1e2007-11-07 14:26:56 -050094 blk_unplug(r_queue);
Linus Torvalds1da177e2005-04-16 15:20:36 -070095 }
96}
97
NeilBrown26be34d2006-10-03 01:15:53 -070098static int linear_congested(void *data, int bits)
99{
100 mddev_t *mddev = data;
NeilBrown070ec552009-06-16 16:54:21 +1000101 linear_conf_t *conf = mddev->private;
NeilBrown26be34d2006-10-03 01:15:53 -0700102 int i, ret = 0;
103
104 for (i = 0; i < mddev->raid_disks && !ret ; i++) {
Jens Axboe165125e2007-07-24 09:28:11 +0200105 struct request_queue *q = bdev_get_queue(conf->disks[i].rdev->bdev);
NeilBrown26be34d2006-10-03 01:15:53 -0700106 ret |= bdi_congested(&q->backing_dev_info, bits);
107 }
108 return ret;
109}
110
Dan Williams80c3a6c2009-03-17 18:10:40 -0700111static sector_t linear_size(mddev_t *mddev, sector_t sectors, int raid_disks)
112{
NeilBrown070ec552009-06-16 16:54:21 +1000113 linear_conf_t *conf = mddev->private;
Dan Williams80c3a6c2009-03-17 18:10:40 -0700114
115 WARN_ONCE(sectors || raid_disks,
116 "%s does not support generic reshape\n", __func__);
117
118 return conf->array_sectors;
119}
120
NeilBrown7c7546c2006-06-26 00:27:41 -0700121static linear_conf_t *linear_conf(mddev_t *mddev, int raid_disks)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700122{
123 linear_conf_t *conf;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124 mdk_rdev_t *rdev;
Sandeep K Sinha45d45822009-06-16 16:55:26 +1000125 int i, cnt;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700126
NeilBrown7c7546c2006-06-26 00:27:41 -0700127 conf = kzalloc (sizeof (*conf) + raid_disks*sizeof(dev_info_t),
Linus Torvalds1da177e2005-04-16 15:20:36 -0700128 GFP_KERNEL);
129 if (!conf)
NeilBrown7c7546c2006-06-26 00:27:41 -0700130 return NULL;
131
Linus Torvalds1da177e2005-04-16 15:20:36 -0700132 cnt = 0;
Andre Nolld6e22152008-07-21 17:05:25 +1000133 conf->array_sectors = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700134
Cheng Renquan159ec1f2009-01-09 08:31:08 +1100135 list_for_each_entry(rdev, &mddev->disks, same_set) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700136 int j = rdev->raid_disk;
137 dev_info_t *disk = conf->disks + j;
NeilBrown13f26822009-06-18 08:48:55 +1000138 sector_t sectors;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700139
Nikanth Karthikesan13864512008-06-28 08:31:19 +1000140 if (j < 0 || j >= raid_disks || disk->rdev) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700141 printk("linear: disk numbering problem. Aborting!\n");
142 goto out;
143 }
144
145 disk->rdev = rdev;
NeilBrown13f26822009-06-18 08:48:55 +1000146 if (mddev->chunk_sectors) {
147 sectors = rdev->sectors;
148 sector_div(sectors, mddev->chunk_sectors);
149 rdev->sectors = sectors * mddev->chunk_sectors;
150 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151
152 blk_queue_stack_limits(mddev->queue,
153 rdev->bdev->bd_disk->queue);
154 /* as we don't honour merge_bvec_fn, we must never risk
155 * violating it, so limit ->max_sector to one PAGE, as
156 * a one page request is never in violation.
157 */
158 if (rdev->bdev->bd_disk->queue->merge_bvec_fn &&
Martin K. Petersenae03bf62009-05-22 17:17:50 -0400159 queue_max_sectors(mddev->queue) > (PAGE_SIZE>>9))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700160 blk_queue_max_sectors(mddev->queue, PAGE_SIZE>>9);
161
Andre Nolldd8ac332009-03-31 14:33:13 +1100162 conf->array_sectors += rdev->sectors;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700163 cnt++;
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000164
Linus Torvalds1da177e2005-04-16 15:20:36 -0700165 }
NeilBrown7c7546c2006-06-26 00:27:41 -0700166 if (cnt != raid_disks) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700167 printk("linear: not enough drives present. Aborting!\n");
168 goto out;
169 }
170
171 /*
Sandeep K Sinha45d45822009-06-16 16:55:26 +1000172 * Here we calculate the device offsets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700173 */
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000174 conf->disks[0].end_sector = conf->disks[0].rdev->sectors;
175
NeilBrowna778b732007-05-23 13:58:10 -0700176 for (i = 1; i < raid_disks; i++)
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000177 conf->disks[i].end_sector =
178 conf->disks[i-1].end_sector +
179 conf->disks[i].rdev->sectors;
NeilBrown15945fe2005-09-09 16:23:47 -0700180
NeilBrown7c7546c2006-06-26 00:27:41 -0700181 return conf;
182
183out:
184 kfree(conf);
185 return NULL;
186}
187
188static int linear_run (mddev_t *mddev)
189{
190 linear_conf_t *conf;
191
Andre Noll0894cc32009-06-18 08:49:23 +1000192 if (md_check_no_bitmap(mddev))
193 return -EINVAL;
Neil Browne7e72bf2008-05-14 16:05:54 -0700194 mddev->queue->queue_lock = &mddev->queue->__queue_lock;
NeilBrown7c7546c2006-06-26 00:27:41 -0700195 conf = linear_conf(mddev, mddev->raid_disks);
196
197 if (!conf)
198 return 1;
199 mddev->private = conf;
Dan Williams1f403622009-03-31 14:59:03 +1100200 md_set_array_sectors(mddev, linear_size(mddev, 0, 0));
NeilBrown7c7546c2006-06-26 00:27:41 -0700201
Linus Torvalds1da177e2005-04-16 15:20:36 -0700202 blk_queue_merge_bvec(mddev->queue, linear_mergeable_bvec);
203 mddev->queue->unplug_fn = linear_unplug;
NeilBrown26be34d2006-10-03 01:15:53 -0700204 mddev->queue->backing_dev_info.congested_fn = linear_congested;
205 mddev->queue->backing_dev_info.congested_data = mddev;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700206 return 0;
NeilBrown7c7546c2006-06-26 00:27:41 -0700207}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700208
NeilBrown7c7546c2006-06-26 00:27:41 -0700209static int linear_add(mddev_t *mddev, mdk_rdev_t *rdev)
210{
211 /* Adding a drive to a linear array allows the array to grow.
212 * It is permitted if the new drive has a matching superblock
213 * already on it, with raid_disk equal to raid_disks.
214 * It is achieved by creating a new linear_private_data structure
215 * and swapping it in in-place of the current one.
216 * The current one is never freed until the array is stopped.
217 * This avoids races.
218 */
219 linear_conf_t *newconf;
220
NeilBrowna778b732007-05-23 13:58:10 -0700221 if (rdev->saved_raid_disk != mddev->raid_disks)
NeilBrown7c7546c2006-06-26 00:27:41 -0700222 return -EINVAL;
223
NeilBrowna778b732007-05-23 13:58:10 -0700224 rdev->raid_disk = rdev->saved_raid_disk;
225
NeilBrown7c7546c2006-06-26 00:27:41 -0700226 newconf = linear_conf(mddev,mddev->raid_disks+1);
227
228 if (!newconf)
229 return -ENOMEM;
230
NeilBrown070ec552009-06-16 16:54:21 +1000231 newconf->prev = mddev->private;
NeilBrown7c7546c2006-06-26 00:27:41 -0700232 mddev->private = newconf;
233 mddev->raid_disks++;
Dan Williams1f403622009-03-31 14:59:03 +1100234 md_set_array_sectors(mddev, linear_size(mddev, 0, 0));
Andre Nollf233ea52008-07-21 17:05:22 +1000235 set_capacity(mddev->gendisk, mddev->array_sectors);
NeilBrown7c7546c2006-06-26 00:27:41 -0700236 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700237}
238
239static int linear_stop (mddev_t *mddev)
240{
NeilBrown070ec552009-06-16 16:54:21 +1000241 linear_conf_t *conf = mddev->private;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700242
243 blk_sync_queue(mddev->queue); /* the unplug fn references 'conf'*/
NeilBrown7c7546c2006-06-26 00:27:41 -0700244 do {
245 linear_conf_t *t = conf->prev;
NeilBrown7c7546c2006-06-26 00:27:41 -0700246 kfree(conf);
247 conf = t;
248 } while (conf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700249
250 return 0;
251}
252
Jens Axboe165125e2007-07-24 09:28:11 +0200253static int linear_make_request (struct request_queue *q, struct bio *bio)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700254{
Jens Axboea3623572005-11-01 09:26:16 +0100255 const int rw = bio_data_dir(bio);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700256 mddev_t *mddev = q->queuedata;
257 dev_info_t *tmp_dev;
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000258 sector_t start_sector;
Tejun Heoc9959052008-08-25 19:47:21 +0900259 int cpu;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260
NeilBrowne5dcdd82005-09-09 16:23:41 -0700261 if (unlikely(bio_barrier(bio))) {
NeilBrown6712ecf2007-09-27 12:47:43 +0200262 bio_endio(bio, -EOPNOTSUPP);
NeilBrowne5dcdd82005-09-09 16:23:41 -0700263 return 0;
264 }
265
Tejun Heo074a7ac2008-08-25 19:56:14 +0900266 cpu = part_stat_lock();
267 part_stat_inc(cpu, &mddev->gendisk->part0, ios[rw]);
268 part_stat_add(cpu, &mddev->gendisk->part0, sectors[rw],
269 bio_sectors(bio));
270 part_stat_unlock();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700271
272 tmp_dev = which_dev(mddev, bio->bi_sector);
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000273 start_sector = tmp_dev->end_sector - tmp_dev->rdev->sectors;
274
275 if (unlikely(bio->bi_sector >= (tmp_dev->end_sector)
276 || (bio->bi_sector < start_sector))) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700277 char b[BDEVNAME_SIZE];
278
Andre Noll62838152008-10-13 11:55:12 +1100279 printk("linear_make_request: Sector %llu out of bounds on "
280 "dev %s: %llu sectors, offset %llu\n",
281 (unsigned long long)bio->bi_sector,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700282 bdevname(tmp_dev->rdev->bdev, b),
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000283 (unsigned long long)tmp_dev->rdev->sectors,
284 (unsigned long long)start_sector);
NeilBrown6712ecf2007-09-27 12:47:43 +0200285 bio_io_error(bio);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700286 return 0;
287 }
288 if (unlikely(bio->bi_sector + (bio->bi_size >> 9) >
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000289 tmp_dev->end_sector)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700290 /* This bio crosses a device boundary, so we have to
291 * split it.
292 */
293 struct bio_pair *bp;
Andre Noll62838152008-10-13 11:55:12 +1100294
Denis ChengRq6feef532008-10-09 08:57:05 +0200295 bp = bio_split(bio,
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000296 tmp_dev->end_sector - bio->bi_sector);
Andre Noll62838152008-10-13 11:55:12 +1100297
Linus Torvalds1da177e2005-04-16 15:20:36 -0700298 if (linear_make_request(q, &bp->bio1))
299 generic_make_request(&bp->bio1);
300 if (linear_make_request(q, &bp->bio2))
301 generic_make_request(&bp->bio2);
302 bio_pair_release(bp);
303 return 0;
304 }
305
306 bio->bi_bdev = tmp_dev->rdev->bdev;
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000307 bio->bi_sector = bio->bi_sector - start_sector
Andre Noll62838152008-10-13 11:55:12 +1100308 + tmp_dev->rdev->data_offset;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700309
310 return 1;
311}
312
313static void linear_status (struct seq_file *seq, mddev_t *mddev)
314{
315
Andre Noll9d8f0362009-06-18 08:45:01 +1000316 seq_printf(seq, " %dk rounding", mddev->chunk_sectors / 2);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700317}
318
319
NeilBrown2604b702006-01-06 00:20:36 -0800320static struct mdk_personality linear_personality =
Linus Torvalds1da177e2005-04-16 15:20:36 -0700321{
322 .name = "linear",
NeilBrown2604b702006-01-06 00:20:36 -0800323 .level = LEVEL_LINEAR,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700324 .owner = THIS_MODULE,
325 .make_request = linear_make_request,
326 .run = linear_run,
327 .stop = linear_stop,
328 .status = linear_status,
NeilBrown7c7546c2006-06-26 00:27:41 -0700329 .hot_add_disk = linear_add,
Dan Williams80c3a6c2009-03-17 18:10:40 -0700330 .size = linear_size,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700331};
332
333static int __init linear_init (void)
334{
NeilBrown2604b702006-01-06 00:20:36 -0800335 return register_md_personality (&linear_personality);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700336}
337
338static void linear_exit (void)
339{
NeilBrown2604b702006-01-06 00:20:36 -0800340 unregister_md_personality (&linear_personality);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700341}
342
343
344module_init(linear_init);
345module_exit(linear_exit);
346MODULE_LICENSE("GPL");
NeilBrownd9d166c2006-01-06 00:20:51 -0800347MODULE_ALIAS("md-personality-1"); /* LINEAR - deprecated*/
348MODULE_ALIAS("md-linear");
NeilBrown2604b702006-01-06 00:20:36 -0800349MODULE_ALIAS("md-level--1");