blob: 529a3d37e3fec7216773cfa4d89b33b4f6ecea38 [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{
30 dev_info_t *hash;
NeilBrown070ec552009-06-16 16:54:21 +100031 linear_conf_t *conf = mddev->private;
Linus Torvalds1da177e2005-04-16 15:20:36 -070032
Sandeep K Sinha45d45822009-06-16 16:55:26 +100033 hash = conf->disks;
Linus Torvalds1da177e2005-04-16 15:20:36 -070034
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +100035 while (sector >= hash->end_sector)
Linus Torvalds1da177e2005-04-16 15:20:36 -070036 hash++;
37 return hash;
38}
39
40/**
NeilBrown15945fe2005-09-09 16:23:47 -070041 * linear_mergeable_bvec -- tell bio layer if two requests can be merged
Linus Torvalds1da177e2005-04-16 15:20:36 -070042 * @q: request queue
Alasdair G Kergoncc371e62008-07-03 09:53:43 +020043 * @bvm: properties of new bio
Linus Torvalds1da177e2005-04-16 15:20:36 -070044 * @biovec: the request that could be merged to it.
45 *
46 * Return amount of bytes we can take at this offset
47 */
Alasdair G Kergoncc371e62008-07-03 09:53:43 +020048static int linear_mergeable_bvec(struct request_queue *q,
49 struct bvec_merge_data *bvm,
50 struct bio_vec *biovec)
Linus Torvalds1da177e2005-04-16 15:20:36 -070051{
52 mddev_t *mddev = q->queuedata;
53 dev_info_t *dev0;
Alasdair G Kergoncc371e62008-07-03 09:53:43 +020054 unsigned long maxsectors, bio_sectors = bvm->bi_size >> 9;
55 sector_t sector = bvm->bi_sector + get_start_sect(bvm->bi_bdev);
Linus Torvalds1da177e2005-04-16 15:20:36 -070056
57 dev0 = which_dev(mddev, sector);
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +100058 maxsectors = dev0->end_sector - sector;
Linus Torvalds1da177e2005-04-16 15:20:36 -070059
60 if (maxsectors < bio_sectors)
61 maxsectors = 0;
62 else
63 maxsectors -= bio_sectors;
64
65 if (maxsectors <= (PAGE_SIZE >> 9 ) && bio_sectors == 0)
66 return biovec->bv_len;
67 /* The bytes available at this offset could be really big,
68 * so we cap at 2^31 to avoid overflow */
69 if (maxsectors > (1 << (31-9)))
70 return 1<<31;
71 return maxsectors << 9;
72}
73
Jens Axboe165125e2007-07-24 09:28:11 +020074static void linear_unplug(struct request_queue *q)
Linus Torvalds1da177e2005-04-16 15:20:36 -070075{
76 mddev_t *mddev = q->queuedata;
NeilBrown070ec552009-06-16 16:54:21 +100077 linear_conf_t *conf = mddev->private;
Linus Torvalds1da177e2005-04-16 15:20:36 -070078 int i;
79
80 for (i=0; i < mddev->raid_disks; i++) {
Jens Axboe165125e2007-07-24 09:28:11 +020081 struct request_queue *r_queue = bdev_get_queue(conf->disks[i].rdev->bdev);
Alan D. Brunelle2ad8b1e2007-11-07 14:26:56 -050082 blk_unplug(r_queue);
Linus Torvalds1da177e2005-04-16 15:20:36 -070083 }
84}
85
NeilBrown26be34d2006-10-03 01:15:53 -070086static int linear_congested(void *data, int bits)
87{
88 mddev_t *mddev = data;
NeilBrown070ec552009-06-16 16:54:21 +100089 linear_conf_t *conf = mddev->private;
NeilBrown26be34d2006-10-03 01:15:53 -070090 int i, ret = 0;
91
92 for (i = 0; i < mddev->raid_disks && !ret ; i++) {
Jens Axboe165125e2007-07-24 09:28:11 +020093 struct request_queue *q = bdev_get_queue(conf->disks[i].rdev->bdev);
NeilBrown26be34d2006-10-03 01:15:53 -070094 ret |= bdi_congested(&q->backing_dev_info, bits);
95 }
96 return ret;
97}
98
Dan Williams80c3a6c2009-03-17 18:10:40 -070099static sector_t linear_size(mddev_t *mddev, sector_t sectors, int raid_disks)
100{
NeilBrown070ec552009-06-16 16:54:21 +1000101 linear_conf_t *conf = mddev->private;
Dan Williams80c3a6c2009-03-17 18:10:40 -0700102
103 WARN_ONCE(sectors || raid_disks,
104 "%s does not support generic reshape\n", __func__);
105
106 return conf->array_sectors;
107}
108
NeilBrown7c7546c2006-06-26 00:27:41 -0700109static linear_conf_t *linear_conf(mddev_t *mddev, int raid_disks)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700110{
111 linear_conf_t *conf;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700112 mdk_rdev_t *rdev;
Sandeep K Sinha45d45822009-06-16 16:55:26 +1000113 int i, cnt;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700114
NeilBrown7c7546c2006-06-26 00:27:41 -0700115 conf = kzalloc (sizeof (*conf) + raid_disks*sizeof(dev_info_t),
Linus Torvalds1da177e2005-04-16 15:20:36 -0700116 GFP_KERNEL);
117 if (!conf)
NeilBrown7c7546c2006-06-26 00:27:41 -0700118 return NULL;
119
Linus Torvalds1da177e2005-04-16 15:20:36 -0700120 cnt = 0;
Andre Nolld6e22152008-07-21 17:05:25 +1000121 conf->array_sectors = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700122
Cheng Renquan159ec1f2009-01-09 08:31:08 +1100123 list_for_each_entry(rdev, &mddev->disks, same_set) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124 int j = rdev->raid_disk;
125 dev_info_t *disk = conf->disks + j;
126
Nikanth Karthikesan13864512008-06-28 08:31:19 +1000127 if (j < 0 || j >= raid_disks || disk->rdev) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700128 printk("linear: disk numbering problem. Aborting!\n");
129 goto out;
130 }
131
132 disk->rdev = rdev;
133
134 blk_queue_stack_limits(mddev->queue,
135 rdev->bdev->bd_disk->queue);
136 /* as we don't honour merge_bvec_fn, we must never risk
137 * violating it, so limit ->max_sector to one PAGE, as
138 * a one page request is never in violation.
139 */
140 if (rdev->bdev->bd_disk->queue->merge_bvec_fn &&
Martin K. Petersenae03bf62009-05-22 17:17:50 -0400141 queue_max_sectors(mddev->queue) > (PAGE_SIZE>>9))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700142 blk_queue_max_sectors(mddev->queue, PAGE_SIZE>>9);
143
Andre Nolldd8ac332009-03-31 14:33:13 +1100144 conf->array_sectors += rdev->sectors;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700145 cnt++;
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000146
Linus Torvalds1da177e2005-04-16 15:20:36 -0700147 }
NeilBrown7c7546c2006-06-26 00:27:41 -0700148 if (cnt != raid_disks) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700149 printk("linear: not enough drives present. Aborting!\n");
150 goto out;
151 }
152
153 /*
Sandeep K Sinha45d45822009-06-16 16:55:26 +1000154 * Here we calculate the device offsets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700155 */
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000156 conf->disks[0].end_sector = conf->disks[0].rdev->sectors;
157
NeilBrowna778b732007-05-23 13:58:10 -0700158 for (i = 1; i < raid_disks; i++)
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000159 conf->disks[i].end_sector =
160 conf->disks[i-1].end_sector +
161 conf->disks[i].rdev->sectors;
NeilBrown15945fe2005-09-09 16:23:47 -0700162
NeilBrown7c7546c2006-06-26 00:27:41 -0700163 return conf;
164
165out:
166 kfree(conf);
167 return NULL;
168}
169
170static int linear_run (mddev_t *mddev)
171{
172 linear_conf_t *conf;
173
Neil Browne7e72bf2008-05-14 16:05:54 -0700174 mddev->queue->queue_lock = &mddev->queue->__queue_lock;
NeilBrown7c7546c2006-06-26 00:27:41 -0700175 conf = linear_conf(mddev, mddev->raid_disks);
176
177 if (!conf)
178 return 1;
179 mddev->private = conf;
Dan Williams1f403622009-03-31 14:59:03 +1100180 md_set_array_sectors(mddev, linear_size(mddev, 0, 0));
NeilBrown7c7546c2006-06-26 00:27:41 -0700181
Linus Torvalds1da177e2005-04-16 15:20:36 -0700182 blk_queue_merge_bvec(mddev->queue, linear_mergeable_bvec);
183 mddev->queue->unplug_fn = linear_unplug;
NeilBrown26be34d2006-10-03 01:15:53 -0700184 mddev->queue->backing_dev_info.congested_fn = linear_congested;
185 mddev->queue->backing_dev_info.congested_data = mddev;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700186 return 0;
NeilBrown7c7546c2006-06-26 00:27:41 -0700187}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700188
NeilBrown7c7546c2006-06-26 00:27:41 -0700189static int linear_add(mddev_t *mddev, mdk_rdev_t *rdev)
190{
191 /* Adding a drive to a linear array allows the array to grow.
192 * It is permitted if the new drive has a matching superblock
193 * already on it, with raid_disk equal to raid_disks.
194 * It is achieved by creating a new linear_private_data structure
195 * and swapping it in in-place of the current one.
196 * The current one is never freed until the array is stopped.
197 * This avoids races.
198 */
199 linear_conf_t *newconf;
200
NeilBrowna778b732007-05-23 13:58:10 -0700201 if (rdev->saved_raid_disk != mddev->raid_disks)
NeilBrown7c7546c2006-06-26 00:27:41 -0700202 return -EINVAL;
203
NeilBrowna778b732007-05-23 13:58:10 -0700204 rdev->raid_disk = rdev->saved_raid_disk;
205
NeilBrown7c7546c2006-06-26 00:27:41 -0700206 newconf = linear_conf(mddev,mddev->raid_disks+1);
207
208 if (!newconf)
209 return -ENOMEM;
210
NeilBrown070ec552009-06-16 16:54:21 +1000211 newconf->prev = mddev->private;
NeilBrown7c7546c2006-06-26 00:27:41 -0700212 mddev->private = newconf;
213 mddev->raid_disks++;
Dan Williams1f403622009-03-31 14:59:03 +1100214 md_set_array_sectors(mddev, linear_size(mddev, 0, 0));
Andre Nollf233ea52008-07-21 17:05:22 +1000215 set_capacity(mddev->gendisk, mddev->array_sectors);
NeilBrown7c7546c2006-06-26 00:27:41 -0700216 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700217}
218
219static int linear_stop (mddev_t *mddev)
220{
NeilBrown070ec552009-06-16 16:54:21 +1000221 linear_conf_t *conf = mddev->private;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700222
223 blk_sync_queue(mddev->queue); /* the unplug fn references 'conf'*/
NeilBrown7c7546c2006-06-26 00:27:41 -0700224 do {
225 linear_conf_t *t = conf->prev;
NeilBrown7c7546c2006-06-26 00:27:41 -0700226 kfree(conf);
227 conf = t;
228 } while (conf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700229
230 return 0;
231}
232
Jens Axboe165125e2007-07-24 09:28:11 +0200233static int linear_make_request (struct request_queue *q, struct bio *bio)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700234{
Jens Axboea3623572005-11-01 09:26:16 +0100235 const int rw = bio_data_dir(bio);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700236 mddev_t *mddev = q->queuedata;
237 dev_info_t *tmp_dev;
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000238 sector_t start_sector;
Tejun Heoc9959052008-08-25 19:47:21 +0900239 int cpu;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700240
NeilBrowne5dcdd82005-09-09 16:23:41 -0700241 if (unlikely(bio_barrier(bio))) {
NeilBrown6712ecf2007-09-27 12:47:43 +0200242 bio_endio(bio, -EOPNOTSUPP);
NeilBrowne5dcdd82005-09-09 16:23:41 -0700243 return 0;
244 }
245
Tejun Heo074a7ac2008-08-25 19:56:14 +0900246 cpu = part_stat_lock();
247 part_stat_inc(cpu, &mddev->gendisk->part0, ios[rw]);
248 part_stat_add(cpu, &mddev->gendisk->part0, sectors[rw],
249 bio_sectors(bio));
250 part_stat_unlock();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700251
252 tmp_dev = which_dev(mddev, bio->bi_sector);
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000253 start_sector = tmp_dev->end_sector - tmp_dev->rdev->sectors;
254
255 if (unlikely(bio->bi_sector >= (tmp_dev->end_sector)
256 || (bio->bi_sector < start_sector))) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700257 char b[BDEVNAME_SIZE];
258
Andre Noll62838152008-10-13 11:55:12 +1100259 printk("linear_make_request: Sector %llu out of bounds on "
260 "dev %s: %llu sectors, offset %llu\n",
261 (unsigned long long)bio->bi_sector,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700262 bdevname(tmp_dev->rdev->bdev, b),
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000263 (unsigned long long)tmp_dev->rdev->sectors,
264 (unsigned long long)start_sector);
NeilBrown6712ecf2007-09-27 12:47:43 +0200265 bio_io_error(bio);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700266 return 0;
267 }
268 if (unlikely(bio->bi_sector + (bio->bi_size >> 9) >
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000269 tmp_dev->end_sector)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700270 /* This bio crosses a device boundary, so we have to
271 * split it.
272 */
273 struct bio_pair *bp;
Andre Noll62838152008-10-13 11:55:12 +1100274
Denis ChengRq6feef532008-10-09 08:57:05 +0200275 bp = bio_split(bio,
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000276 tmp_dev->end_sector - bio->bi_sector);
Andre Noll62838152008-10-13 11:55:12 +1100277
Linus Torvalds1da177e2005-04-16 15:20:36 -0700278 if (linear_make_request(q, &bp->bio1))
279 generic_make_request(&bp->bio1);
280 if (linear_make_request(q, &bp->bio2))
281 generic_make_request(&bp->bio2);
282 bio_pair_release(bp);
283 return 0;
284 }
285
286 bio->bi_bdev = tmp_dev->rdev->bdev;
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000287 bio->bi_sector = bio->bi_sector - start_sector
Andre Noll62838152008-10-13 11:55:12 +1100288 + tmp_dev->rdev->data_offset;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700289
290 return 1;
291}
292
293static void linear_status (struct seq_file *seq, mddev_t *mddev)
294{
295
Linus Torvalds1da177e2005-04-16 15:20:36 -0700296 seq_printf(seq, " %dk rounding", mddev->chunk_size/1024);
297}
298
299
NeilBrown2604b702006-01-06 00:20:36 -0800300static struct mdk_personality linear_personality =
Linus Torvalds1da177e2005-04-16 15:20:36 -0700301{
302 .name = "linear",
NeilBrown2604b702006-01-06 00:20:36 -0800303 .level = LEVEL_LINEAR,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700304 .owner = THIS_MODULE,
305 .make_request = linear_make_request,
306 .run = linear_run,
307 .stop = linear_stop,
308 .status = linear_status,
NeilBrown7c7546c2006-06-26 00:27:41 -0700309 .hot_add_disk = linear_add,
Dan Williams80c3a6c2009-03-17 18:10:40 -0700310 .size = linear_size,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700311};
312
313static int __init linear_init (void)
314{
NeilBrown2604b702006-01-06 00:20:36 -0800315 return register_md_personality (&linear_personality);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700316}
317
318static void linear_exit (void)
319{
NeilBrown2604b702006-01-06 00:20:36 -0800320 unregister_md_personality (&linear_personality);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700321}
322
323
324module_init(linear_init);
325module_exit(linear_exit);
326MODULE_LICENSE("GPL");
NeilBrownd9d166c2006-01-06 00:20:51 -0800327MODULE_ALIAS("md-personality-1"); /* LINEAR - deprecated*/
328MODULE_ALIAS("md-linear");
NeilBrown2604b702006-01-06 00:20:36 -0800329MODULE_ALIAS("md-level--1");