md-linear.c 8.7 KB
Newer Older
1
// SPDX-License-Identifier: GPL-2.0-or-later
L
Linus Torvalds 已提交
2 3 4 5 6 7 8 9 10 11
/*
   linear.c : Multiple Devices driver for Linux
	      Copyright (C) 1994-96 Marc ZYNGIER
	      <zyngier@ufr-info-p7.ibp.fr> or
	      <maz@gloups.fdn.fr>

   Linear mode management functions.

*/

12 13 14
#include <linux/blkdev.h>
#include <linux/raid/md_u.h>
#include <linux/seq_file.h>
15
#include <linux/module.h>
16
#include <linux/slab.h>
17
#include <trace/events/block.h>
18
#include "md.h"
19
#include "md-linear.h"
L
Linus Torvalds 已提交
20 21

/*
22
 * find which device holds a particular offset
L
Linus Torvalds 已提交
23
 */
24
static inline struct dev_info *which_dev(struct mddev *mddev, sector_t sector)
L
Linus Torvalds 已提交
25
{
26
	int lo, mid, hi;
27
	struct linear_conf *conf;
L
Linus Torvalds 已提交
28

29 30
	lo = 0;
	hi = mddev->raid_disks - 1;
31
	conf = mddev->private;
L
Linus Torvalds 已提交
32

33 34 35 36 37 38 39 40 41 42 43 44 45 46
	/*
	 * Binary Search
	 */

	while (hi > lo) {

		mid = (hi + lo) / 2;
		if (sector < conf->disks[mid].end_sector)
			hi = mid;
		else
			lo = mid + 1;
	}

	return conf->disks + lo;
L
Linus Torvalds 已提交
47 48
}

49 50 51 52 53 54
/*
 * In linear_congested() conf->raid_disks is used as a copy of
 * mddev->raid_disks to iterate conf->disks[], because conf->raid_disks
 * and conf->disks[] are created in linear_conf(), they are always
 * consitent with each other, but mddev->raid_disks does not.
 */
55
static int linear_congested(struct mddev *mddev, int bits)
56
{
57
	struct linear_conf *conf;
58 59
	int i, ret = 0;

60 61
	rcu_read_lock();
	conf = rcu_dereference(mddev->private);
62

63
	for (i = 0; i < conf->raid_disks && !ret ; i++) {
64
		struct request_queue *q = bdev_get_queue(conf->disks[i].rdev->bdev);
65
		ret |= bdi_congested(q->backing_dev_info, bits);
66
	}
67

68
	rcu_read_unlock();
69 70 71
	return ret;
}

72
static sector_t linear_size(struct mddev *mddev, sector_t sectors, int raid_disks)
73
{
74
	struct linear_conf *conf;
75
	sector_t array_sectors;
76

77
	conf = mddev->private;
78 79
	WARN_ONCE(sectors || raid_disks,
		  "%s does not support generic reshape\n", __func__);
80
	array_sectors = conf->array_sectors;
81

82
	return array_sectors;
83 84
}

85
static struct linear_conf *linear_conf(struct mddev *mddev, int raid_disks)
L
Linus Torvalds 已提交
86
{
87
	struct linear_conf *conf;
88
	struct md_rdev *rdev;
89
	int i, cnt;
S
Shaohua Li 已提交
90
	bool discard_supported = false;
L
Linus Torvalds 已提交
91

92
	conf = kzalloc(struct_size(conf, disks, raid_disks), GFP_KERNEL);
L
Linus Torvalds 已提交
93
	if (!conf)
94 95
		return NULL;

L
Linus Torvalds 已提交
96
	cnt = 0;
97
	conf->array_sectors = 0;
L
Linus Torvalds 已提交
98

N
NeilBrown 已提交
99
	rdev_for_each(rdev, mddev) {
L
Linus Torvalds 已提交
100
		int j = rdev->raid_disk;
101
		struct dev_info *disk = conf->disks + j;
102
		sector_t sectors;
L
Linus Torvalds 已提交
103

104
		if (j < 0 || j >= raid_disks || disk->rdev) {
105 106
			pr_warn("md/linear:%s: disk numbering problem. Aborting!\n",
				mdname(mddev));
L
Linus Torvalds 已提交
107 108 109 110
			goto out;
		}

		disk->rdev = rdev;
111 112 113 114 115
		if (mddev->chunk_sectors) {
			sectors = rdev->sectors;
			sector_div(sectors, mddev->chunk_sectors);
			rdev->sectors = sectors * mddev->chunk_sectors;
		}
L
Linus Torvalds 已提交
116

117 118
		disk_stack_limits(mddev->gendisk, rdev->bdev,
				  rdev->data_offset << 9);
L
Linus Torvalds 已提交
119

120
		conf->array_sectors += rdev->sectors;
L
Linus Torvalds 已提交
121
		cnt++;
122

S
Shaohua Li 已提交
123 124
		if (blk_queue_discard(bdev_get_queue(rdev->bdev)))
			discard_supported = true;
L
Linus Torvalds 已提交
125
	}
126
	if (cnt != raid_disks) {
127 128
		pr_warn("md/linear:%s: not enough drives present. Aborting!\n",
			mdname(mddev));
L
Linus Torvalds 已提交
129 130 131
		goto out;
	}

S
Shaohua Li 已提交
132
	if (!discard_supported)
133
		blk_queue_flag_clear(QUEUE_FLAG_DISCARD, mddev->queue);
S
Shaohua Li 已提交
134
	else
135
		blk_queue_flag_set(QUEUE_FLAG_DISCARD, mddev->queue);
S
Shaohua Li 已提交
136

L
Linus Torvalds 已提交
137
	/*
138
	 * Here we calculate the device offsets.
L
Linus Torvalds 已提交
139
	 */
140 141
	conf->disks[0].end_sector = conf->disks[0].rdev->sectors;

142
	for (i = 1; i < raid_disks; i++)
143 144 145
		conf->disks[i].end_sector =
			conf->disks[i-1].end_sector +
			conf->disks[i].rdev->sectors;
146

147 148 149 150 151 152 153 154 155 156 157 158 159
	/*
	 * conf->raid_disks is copy of mddev->raid_disks. The reason to
	 * keep a copy of mddev->raid_disks in struct linear_conf is,
	 * mddev->raid_disks may not be consistent with pointers number of
	 * conf->disks[] when it is updated in linear_add() and used to
	 * iterate old conf->disks[] earray in linear_congested().
	 * Here conf->raid_disks is always consitent with number of
	 * pointers in conf->disks[] array, and mddev->private is updated
	 * with rcu_assign_pointer() in linear_addr(), such race can be
	 * avoided.
	 */
	conf->raid_disks = raid_disks;

160 161 162 163 164 165 166
	return conf;

out:
	kfree(conf);
	return NULL;
}

167
static int linear_run (struct mddev *mddev)
168
{
169
	struct linear_conf *conf;
170
	int ret;
171

172 173
	if (md_check_no_bitmap(mddev))
		return -EINVAL;
174 175 176 177 178
	conf = linear_conf(mddev, mddev->raid_disks);

	if (!conf)
		return 1;
	mddev->private = conf;
179
	md_set_array_sectors(mddev, linear_size(mddev, 0, 0));
180

181 182 183 184 185 186
	ret =  md_integrity_register(mddev);
	if (ret) {
		kfree(conf);
		mddev->private = NULL;
	}
	return ret;
187
}
L
Linus Torvalds 已提交
188

189
static int linear_add(struct mddev *mddev, struct md_rdev *rdev)
190 191 192 193 194 195 196 197 198
{
	/* Adding a drive to a linear array allows the array to grow.
	 * It is permitted if the new drive has a matching superblock
	 * already on it, with raid_disk equal to raid_disks.
	 * It is achieved by creating a new linear_private_data structure
	 * and swapping it in in-place of the current one.
	 * The current one is never freed until the array is stopped.
	 * This avoids races.
	 */
199
	struct linear_conf *newconf, *oldconf;
200

201
	if (rdev->saved_raid_disk != mddev->raid_disks)
202 203
		return -EINVAL;

204
	rdev->raid_disk = rdev->saved_raid_disk;
205
	rdev->saved_raid_disk = -1;
206

207 208 209 210 211
	newconf = linear_conf(mddev,mddev->raid_disks+1);

	if (!newconf)
		return -ENOMEM;

212 213 214 215 216 217
	/* newconf->raid_disks already keeps a copy of * the increased
	 * value of mddev->raid_disks, WARN_ONCE() is just used to make
	 * sure of this. It is possible that oldconf is still referenced
	 * in linear_congested(), therefore kfree_rcu() is used to free
	 * oldconf until no one uses it anymore.
	 */
218
	mddev_suspend(mddev);
S
Shaohua Li 已提交
219 220
	oldconf = rcu_dereference_protected(mddev->private,
			lockdep_is_held(&mddev->reconfig_mutex));
221
	mddev->raid_disks++;
222 223 224
	WARN_ONCE(mddev->raid_disks != newconf->raid_disks,
		"copied raid_disks doesn't match mddev->raid_disks");
	rcu_assign_pointer(mddev->private, newconf);
225
	md_set_array_sectors(mddev, linear_size(mddev, 0, 0));
226
	set_capacity(mddev->gendisk, mddev->array_sectors);
227
	mddev_resume(mddev);
228
	revalidate_disk(mddev->gendisk);
229
	kfree_rcu(oldconf, rcu);
230
	return 0;
L
Linus Torvalds 已提交
231 232
}

N
NeilBrown 已提交
233
static void linear_free(struct mddev *mddev, void *priv)
L
Linus Torvalds 已提交
234
{
N
NeilBrown 已提交
235
	struct linear_conf *conf = priv;
236

237
	kfree(conf);
L
Linus Torvalds 已提交
238 239
}

240
static bool linear_make_request(struct mddev *mddev, struct bio *bio)
L
Linus Torvalds 已提交
241
{
K
Kent Overstreet 已提交
242
	char b[BDEVNAME_SIZE];
243
	struct dev_info *tmp_dev;
K
Kent Overstreet 已提交
244
	sector_t start_sector, end_sector, data_offset;
N
NeilBrown 已提交
245
	sector_t bio_sector = bio->bi_iter.bi_sector;
L
Linus Torvalds 已提交
246

J
Jens Axboe 已提交
247
	if (unlikely(bio->bi_opf & REQ_PREFLUSH)) {
T
Tejun Heo 已提交
248
		md_flush_request(mddev, bio);
249
		return true;
250 251
	}

N
NeilBrown 已提交
252 253 254 255 256 257 258 259 260
	tmp_dev = which_dev(mddev, bio_sector);
	start_sector = tmp_dev->end_sector - tmp_dev->rdev->sectors;
	end_sector = tmp_dev->end_sector;
	data_offset = tmp_dev->rdev->data_offset;

	if (unlikely(bio_sector >= end_sector ||
		     bio_sector < start_sector))
		goto out_of_bounds;

261 262 263 264 265
	if (unlikely(is_mddev_broken(tmp_dev->rdev, "linear"))) {
		bio_io_error(bio);
		return true;
	}

N
NeilBrown 已提交
266 267 268
	if (unlikely(bio_end_sector(bio) > end_sector)) {
		/* This bio crosses a device boundary, so we have to split it */
		struct bio *split = bio_split(bio, end_sector - bio_sector,
269
					      GFP_NOIO, &mddev->bio_set);
N
NeilBrown 已提交
270 271 272 273
		bio_chain(split, bio);
		generic_make_request(bio);
		bio = split;
	}
S
Shaohua Li 已提交
274

275
	bio_set_dev(bio, tmp_dev->rdev->bdev);
N
NeilBrown 已提交
276 277 278 279
	bio->bi_iter.bi_sector = bio->bi_iter.bi_sector -
		start_sector + data_offset;

	if (unlikely((bio_op(bio) == REQ_OP_DISCARD) &&
280
		     !blk_queue_discard(bio->bi_disk->queue))) {
N
NeilBrown 已提交
281 282 283 284
		/* Just ignore it */
		bio_endio(bio);
	} else {
		if (mddev->gendisk)
285
			trace_block_bio_remap(bio->bi_disk->queue,
N
NeilBrown 已提交
286 287 288
					      bio, disk_devt(mddev->gendisk),
					      bio_sector);
		mddev_check_writesame(mddev, bio);
289
		mddev_check_write_zeroes(mddev, bio);
N
NeilBrown 已提交
290 291
		generic_make_request(bio);
	}
292
	return true;
K
Kent Overstreet 已提交
293 294

out_of_bounds:
295
	pr_err("md/linear:%s: make_request: Sector %llu out of bounds on dev %s: %llu sectors, offset %llu\n",
K
Kent Overstreet 已提交
296 297 298 299 300 301
	       mdname(mddev),
	       (unsigned long long)bio->bi_iter.bi_sector,
	       bdevname(tmp_dev->rdev->bdev, b),
	       (unsigned long long)tmp_dev->rdev->sectors,
	       (unsigned long long)start_sector);
	bio_io_error(bio);
302
	return true;
L
Linus Torvalds 已提交
303 304
}

305
static void linear_status (struct seq_file *seq, struct mddev *mddev)
L
Linus Torvalds 已提交
306
{
307
	seq_printf(seq, " %dk rounding", mddev->chunk_sectors / 2);
L
Linus Torvalds 已提交
308 309
}

310 311 312 313
static void linear_quiesce(struct mddev *mddev, int state)
{
}

314
static struct md_personality linear_personality =
L
Linus Torvalds 已提交
315 316
{
	.name		= "linear",
317
	.level		= LEVEL_LINEAR,
L
Linus Torvalds 已提交
318 319 320
	.owner		= THIS_MODULE,
	.make_request	= linear_make_request,
	.run		= linear_run,
N
NeilBrown 已提交
321
	.free		= linear_free,
L
Linus Torvalds 已提交
322
	.status		= linear_status,
323
	.hot_add_disk	= linear_add,
324
	.size		= linear_size,
325
	.quiesce	= linear_quiesce,
326
	.congested	= linear_congested,
L
Linus Torvalds 已提交
327 328 329 330
};

static int __init linear_init (void)
{
331
	return register_md_personality (&linear_personality);
L
Linus Torvalds 已提交
332 333 334 335
}

static void linear_exit (void)
{
336
	unregister_md_personality (&linear_personality);
L
Linus Torvalds 已提交
337 338 339 340 341
}

module_init(linear_init);
module_exit(linear_exit);
MODULE_LICENSE("GPL");
342
MODULE_DESCRIPTION("Linear device concatenation personality for MD");
343 344
MODULE_ALIAS("md-personality-1"); /* LINEAR - deprecated*/
MODULE_ALIAS("md-linear");
345
MODULE_ALIAS("md-level--1");