blob: fa7d577f3d1257a6a029ae897702d74853d54919 [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.
NeilBrownf72ffdd2014-09-30 14:23:59 +100013
Linus Torvalds1da177e2005-04-16 15:20:36 -070014 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
NeilBrownf72ffdd2014-09-30 14:23:59 +100016 Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
Linus Torvalds1da177e2005-04-16 15:20:36 -070017*/
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>
Paul Gortmaker056075c2011-07-03 13:58:33 -040022#include <linux/module.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090023#include <linux/slab.h>
NeilBrown43b2e5d2009-03-31 14:33:13 +110024#include "md.h"
Christoph Hellwigef740c32009-03-31 14:27:03 +110025#include "linear.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070026
Linus Torvalds1da177e2005-04-16 15:20:36 -070027/*
NeilBrownf72ffdd2014-09-30 14:23:59 +100028 * find which device holds a particular offset
Linus Torvalds1da177e2005-04-16 15:20:36 -070029 */
NeilBrowna7120772011-10-11 16:48:49 +110030static inline struct dev_info *which_dev(struct mddev *mddev, sector_t sector)
Linus Torvalds1da177e2005-04-16 15:20:36 -070031{
Sandeep K Sinhaaece3d12009-06-16 16:57:08 +100032 int lo, mid, hi;
NeilBrowne849b932011-10-11 16:48:54 +110033 struct linear_conf *conf;
Linus Torvalds1da177e2005-04-16 15:20:36 -070034
Sandeep K Sinhaaece3d12009-06-16 16:57:08 +100035 lo = 0;
36 hi = mddev->raid_disks - 1;
NeilBrown3be260c2014-12-15 12:56:57 +110037 conf = mddev->private;
Linus Torvalds1da177e2005-04-16 15:20:36 -070038
Sandeep K Sinhaaece3d12009-06-16 16:57:08 +100039 /*
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;
Linus Torvalds1da177e2005-04-16 15:20:36 -070053}
54
55/**
NeilBrown15945fe2005-09-09 16:23:47 -070056 * linear_mergeable_bvec -- tell bio layer if two requests can be merged
Linus Torvalds1da177e2005-04-16 15:20:36 -070057 * @q: request queue
Alasdair G Kergoncc371e62008-07-03 09:53:43 +020058 * @bvm: properties of new bio
Linus Torvalds1da177e2005-04-16 15:20:36 -070059 * @biovec: the request that could be merged to it.
60 *
61 * Return amount of bytes we can take at this offset
62 */
NeilBrown64590f42014-12-15 12:56:57 +110063static int linear_mergeable_bvec(struct mddev *mddev,
Alasdair G Kergoncc371e62008-07-03 09:53:43 +020064 struct bvec_merge_data *bvm,
65 struct bio_vec *biovec)
Linus Torvalds1da177e2005-04-16 15:20:36 -070066{
NeilBrowna7120772011-10-11 16:48:49 +110067 struct dev_info *dev0;
Alasdair G Kergoncc371e62008-07-03 09:53:43 +020068 unsigned long maxsectors, bio_sectors = bvm->bi_size >> 9;
69 sector_t sector = bvm->bi_sector + get_start_sect(bvm->bi_bdev);
NeilBrownba13da42012-03-19 12:46:39 +110070 int maxbytes = biovec->bv_len;
71 struct request_queue *subq;
Linus Torvalds1da177e2005-04-16 15:20:36 -070072
73 dev0 = which_dev(mddev, sector);
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +100074 maxsectors = dev0->end_sector - sector;
NeilBrownba13da42012-03-19 12:46:39 +110075 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 }
Linus Torvalds1da177e2005-04-16 15:20:36 -070082
83 if (maxsectors < bio_sectors)
84 maxsectors = 0;
85 else
86 maxsectors -= bio_sectors;
87
88 if (maxsectors <= (PAGE_SIZE >> 9 ) && bio_sectors == 0)
NeilBrownba13da42012-03-19 12:46:39 +110089 return maxbytes;
90
91 if (maxsectors > (maxbytes >> 9))
92 return maxbytes;
93 else
94 return maxsectors << 9;
Linus Torvalds1da177e2005-04-16 15:20:36 -070095}
96
NeilBrown5c675f82014-12-15 12:56:56 +110097static int linear_congested(struct mddev *mddev, int bits)
NeilBrown26be34d2006-10-03 01:15:53 -070098{
NeilBrowne849b932011-10-11 16:48:54 +110099 struct linear_conf *conf;
NeilBrown26be34d2006-10-03 01:15:53 -0700100 int i, ret = 0;
101
NeilBrown3be260c2014-12-15 12:56:57 +1100102 conf = mddev->private;
SandeepKsinhaaf11c392009-06-18 08:49:35 +1000103
NeilBrown26be34d2006-10-03 01:15:53 -0700104 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 }
SandeepKsinhaaf11c392009-06-18 08:49:35 +1000108
NeilBrown26be34d2006-10-03 01:15:53 -0700109 return ret;
110}
111
NeilBrownfd01b882011-10-11 16:47:53 +1100112static sector_t linear_size(struct mddev *mddev, sector_t sectors, int raid_disks)
Dan Williams80c3a6c2009-03-17 18:10:40 -0700113{
NeilBrowne849b932011-10-11 16:48:54 +1100114 struct linear_conf *conf;
SandeepKsinhaaf11c392009-06-18 08:49:35 +1000115 sector_t array_sectors;
Dan Williams80c3a6c2009-03-17 18:10:40 -0700116
NeilBrown3be260c2014-12-15 12:56:57 +1100117 conf = mddev->private;
Dan Williams80c3a6c2009-03-17 18:10:40 -0700118 WARN_ONCE(sectors || raid_disks,
119 "%s does not support generic reshape\n", __func__);
SandeepKsinhaaf11c392009-06-18 08:49:35 +1000120 array_sectors = conf->array_sectors;
Dan Williams80c3a6c2009-03-17 18:10:40 -0700121
SandeepKsinhaaf11c392009-06-18 08:49:35 +1000122 return array_sectors;
Dan Williams80c3a6c2009-03-17 18:10:40 -0700123}
124
NeilBrowne849b932011-10-11 16:48:54 +1100125static struct linear_conf *linear_conf(struct mddev *mddev, int raid_disks)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700126{
NeilBrowne849b932011-10-11 16:48:54 +1100127 struct linear_conf *conf;
NeilBrown3cb03002011-10-11 16:45:26 +1100128 struct md_rdev *rdev;
Sandeep K Sinha45d45822009-06-16 16:55:26 +1000129 int i, cnt;
Shaohua Lif1cad2b2012-10-11 13:08:44 +1100130 bool discard_supported = false;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700131
NeilBrowna7120772011-10-11 16:48:49 +1100132 conf = kzalloc (sizeof (*conf) + raid_disks*sizeof(struct dev_info),
Linus Torvalds1da177e2005-04-16 15:20:36 -0700133 GFP_KERNEL);
134 if (!conf)
NeilBrown7c7546c2006-06-26 00:27:41 -0700135 return NULL;
136
Linus Torvalds1da177e2005-04-16 15:20:36 -0700137 cnt = 0;
Andre Nolld6e22152008-07-21 17:05:25 +1000138 conf->array_sectors = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700139
NeilBrowndafb20f2012-03-19 12:46:39 +1100140 rdev_for_each(rdev, mddev) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700141 int j = rdev->raid_disk;
NeilBrowna7120772011-10-11 16:48:49 +1100142 struct dev_info *disk = conf->disks + j;
NeilBrown13f26822009-06-18 08:48:55 +1000143 sector_t sectors;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700144
Nikanth Karthikesan13864512008-06-28 08:31:19 +1000145 if (j < 0 || j >= raid_disks || disk->rdev) {
NeilBrown2dc40f82010-05-03 15:12:04 +1000146 printk(KERN_ERR "md/linear:%s: disk numbering problem. Aborting!\n",
147 mdname(mddev));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700148 goto out;
149 }
150
151 disk->rdev = rdev;
NeilBrown13f26822009-06-18 08:48:55 +1000152 if (mddev->chunk_sectors) {
153 sectors = rdev->sectors;
154 sector_div(sectors, mddev->chunk_sectors);
155 rdev->sectors = sectors * mddev->chunk_sectors;
156 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700157
Martin K. Petersen8f6c2e42009-07-01 11:13:45 +1000158 disk_stack_limits(mddev->gendisk, rdev->bdev,
159 rdev->data_offset << 9);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700160
Andre Nolldd8ac332009-03-31 14:33:13 +1100161 conf->array_sectors += rdev->sectors;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700162 cnt++;
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000163
Shaohua Lif1cad2b2012-10-11 13:08:44 +1100164 if (blk_queue_discard(bdev_get_queue(rdev->bdev)))
165 discard_supported = true;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700166 }
NeilBrown7c7546c2006-06-26 00:27:41 -0700167 if (cnt != raid_disks) {
NeilBrown2dc40f82010-05-03 15:12:04 +1000168 printk(KERN_ERR "md/linear:%s: not enough drives present. Aborting!\n",
169 mdname(mddev));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700170 goto out;
171 }
172
Shaohua Lif1cad2b2012-10-11 13:08:44 +1100173 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
Linus Torvalds1da177e2005-04-16 15:20:36 -0700178 /*
Sandeep K Sinha45d45822009-06-16 16:55:26 +1000179 * Here we calculate the device offsets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700180 */
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000181 conf->disks[0].end_sector = conf->disks[0].rdev->sectors;
182
NeilBrowna778b732007-05-23 13:58:10 -0700183 for (i = 1; i < raid_disks; i++)
Sandeep K Sinha4db7cdc2009-06-16 16:56:13 +1000184 conf->disks[i].end_sector =
185 conf->disks[i-1].end_sector +
186 conf->disks[i].rdev->sectors;
NeilBrown15945fe2005-09-09 16:23:47 -0700187
NeilBrown7c7546c2006-06-26 00:27:41 -0700188 return conf;
189
190out:
191 kfree(conf);
192 return NULL;
193}
194
NeilBrownfd01b882011-10-11 16:47:53 +1100195static int linear_run (struct mddev *mddev)
NeilBrown7c7546c2006-06-26 00:27:41 -0700196{
NeilBrowne849b932011-10-11 16:48:54 +1100197 struct linear_conf *conf;
majianpeng98d55612012-04-02 09:48:37 +1000198 int ret;
NeilBrown7c7546c2006-06-26 00:27:41 -0700199
Andre Noll0894cc32009-06-18 08:49:23 +1000200 if (md_check_no_bitmap(mddev))
201 return -EINVAL;
NeilBrown7c7546c2006-06-26 00:27:41 -0700202 conf = linear_conf(mddev, mddev->raid_disks);
203
204 if (!conf)
205 return 1;
206 mddev->private = conf;
Dan Williams1f403622009-03-31 14:59:03 +1100207 md_set_array_sectors(mddev, linear_size(mddev, 0, 0));
NeilBrown7c7546c2006-06-26 00:27:41 -0700208
majianpeng98d55612012-04-02 09:48:37 +1000209 ret = md_integrity_register(mddev);
210 if (ret) {
211 kfree(conf);
212 mddev->private = NULL;
213 }
214 return ret;
NeilBrown7c7546c2006-06-26 00:27:41 -0700215}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700216
NeilBrownfd01b882011-10-11 16:47:53 +1100217static int linear_add(struct mddev *mddev, struct md_rdev *rdev)
NeilBrown7c7546c2006-06-26 00:27:41 -0700218{
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 */
NeilBrowne849b932011-10-11 16:48:54 +1100227 struct linear_conf *newconf, *oldconf;
NeilBrown7c7546c2006-06-26 00:27:41 -0700228
NeilBrowna778b732007-05-23 13:58:10 -0700229 if (rdev->saved_raid_disk != mddev->raid_disks)
NeilBrown7c7546c2006-06-26 00:27:41 -0700230 return -EINVAL;
231
NeilBrowna778b732007-05-23 13:58:10 -0700232 rdev->raid_disk = rdev->saved_raid_disk;
NeilBrown09cd9272011-12-23 09:56:55 +1100233 rdev->saved_raid_disk = -1;
NeilBrowna778b732007-05-23 13:58:10 -0700234
NeilBrown7c7546c2006-06-26 00:27:41 -0700235 newconf = linear_conf(mddev,mddev->raid_disks+1);
236
237 if (!newconf)
238 return -ENOMEM;
239
NeilBrown3be260c2014-12-15 12:56:57 +1100240 mddev_suspend(mddev);
241 oldconf = mddev->private;
NeilBrown7c7546c2006-06-26 00:27:41 -0700242 mddev->raid_disks++;
NeilBrown3be260c2014-12-15 12:56:57 +1100243 mddev->private = newconf;
Dan Williams1f403622009-03-31 14:59:03 +1100244 md_set_array_sectors(mddev, linear_size(mddev, 0, 0));
Andre Nollf233ea52008-07-21 17:05:22 +1000245 set_capacity(mddev->gendisk, mddev->array_sectors);
NeilBrown3be260c2014-12-15 12:56:57 +1100246 mddev_resume(mddev);
NeilBrown449aad32009-08-03 10:59:58 +1000247 revalidate_disk(mddev->gendisk);
NeilBrown3be260c2014-12-15 12:56:57 +1100248 kfree(oldconf);
NeilBrown7c7546c2006-06-26 00:27:41 -0700249 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700250}
251
NeilBrownafa0f552014-12-15 12:56:58 +1100252static void linear_free(struct mddev *mddev, void *priv)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700253{
NeilBrownafa0f552014-12-15 12:56:58 +1100254 struct linear_conf *conf = priv;
SandeepKsinhaaf11c392009-06-18 08:49:35 +1000255
NeilBrown495d3572009-06-18 08:49:42 +1000256 kfree(conf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700257}
258
Linus Torvaldsb4fdcb02011-11-04 17:06:58 -0700259static void linear_make_request(struct mddev *mddev, struct bio *bio)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260{
Kent Overstreet20d01892013-11-23 18:21:01 -0800261 char b[BDEVNAME_SIZE];
NeilBrowna7120772011-10-11 16:48:49 +1100262 struct dev_info *tmp_dev;
Kent Overstreet20d01892013-11-23 18:21:01 -0800263 struct bio *split;
264 sector_t start_sector, end_sector, data_offset;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700265
Tejun Heoe9c74692010-09-03 11:56:18 +0200266 if (unlikely(bio->bi_rw & REQ_FLUSH)) {
267 md_flush_request(mddev, bio);
Christoph Hellwig5a7bbad2011-09-12 12:12:01 +0200268 return;
NeilBrowne5dcdd82005-09-09 16:23:41 -0700269 }
270
Kent Overstreet20d01892013-11-23 18:21:01 -0800271 do {
Kent Overstreet20d01892013-11-23 18:21:01 -0800272 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;
Andre Noll62838152008-10-13 11:55:12 +1100277
Kent Overstreet20d01892013-11-23 18:21:01 -0800278 if (unlikely(bio->bi_iter.bi_sector >= end_sector ||
279 bio->bi_iter.bi_sector < start_sector))
280 goto out_of_bounds;
Andre Noll62838152008-10-13 11:55:12 +1100281
Kent Overstreet20d01892013-11-23 18:21:01 -0800282 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 }
Shaohua Lif1cad2b2012-10-11 13:08:44 +1100293
Kent Overstreet20d01892013-11-23 18:21:01 -0800294 split->bi_iter.bi_sector = split->bi_iter.bi_sector -
295 start_sector + data_offset;
Shaohua Lif1cad2b2012-10-11 13:08:44 +1100296
Kent Overstreet20d01892013-11-23 18:21:01 -0800297 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
306out_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);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700316}
317
NeilBrownfd01b882011-10-11 16:47:53 +1100318static void linear_status (struct seq_file *seq, struct mddev *mddev)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700319{
320
Andre Noll9d8f0362009-06-18 08:45:01 +1000321 seq_printf(seq, " %dk rounding", mddev->chunk_sectors / 2);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700322}
323
NeilBrown3be260c2014-12-15 12:56:57 +1100324static void linear_quiesce(struct mddev *mddev, int state)
325{
326}
327
NeilBrown84fc4b52011-10-11 16:49:58 +1100328static struct md_personality linear_personality =
Linus Torvalds1da177e2005-04-16 15:20:36 -0700329{
330 .name = "linear",
NeilBrown2604b702006-01-06 00:20:36 -0800331 .level = LEVEL_LINEAR,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700332 .owner = THIS_MODULE,
333 .make_request = linear_make_request,
334 .run = linear_run,
NeilBrownafa0f552014-12-15 12:56:58 +1100335 .free = linear_free,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700336 .status = linear_status,
NeilBrown7c7546c2006-06-26 00:27:41 -0700337 .hot_add_disk = linear_add,
Dan Williams80c3a6c2009-03-17 18:10:40 -0700338 .size = linear_size,
NeilBrown3be260c2014-12-15 12:56:57 +1100339 .quiesce = linear_quiesce,
NeilBrown5c675f82014-12-15 12:56:56 +1100340 .congested = linear_congested,
NeilBrown64590f42014-12-15 12:56:57 +1100341 .mergeable_bvec = linear_mergeable_bvec,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700342};
343
344static int __init linear_init (void)
345{
NeilBrown2604b702006-01-06 00:20:36 -0800346 return register_md_personality (&linear_personality);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700347}
348
349static void linear_exit (void)
350{
NeilBrown2604b702006-01-06 00:20:36 -0800351 unregister_md_personality (&linear_personality);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700352}
353
Linus Torvalds1da177e2005-04-16 15:20:36 -0700354module_init(linear_init);
355module_exit(linear_exit);
356MODULE_LICENSE("GPL");
NeilBrown0efb9e62009-12-14 12:49:58 +1100357MODULE_DESCRIPTION("Linear device concatenation personality for MD");
NeilBrownd9d166c2006-01-06 00:20:51 -0800358MODULE_ALIAS("md-personality-1"); /* LINEAR - deprecated*/
359MODULE_ALIAS("md-linear");
NeilBrown2604b702006-01-06 00:20:36 -0800360MODULE_ALIAS("md-level--1");