Linux kernel mirror (for testing)
git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
kernel
os
linux
1// SPDX-License-Identifier: GPL-2.0-or-later
2/*
3 * linear.c : Multiple Devices driver for Linux Copyright (C) 1994-96 Marc
4 * ZYNGIER <zyngier@ufr-info-p7.ibp.fr> or <maz@gloups.fdn.fr>
5 */
6
7#include <linux/blkdev.h>
8#include <linux/seq_file.h>
9#include <linux/module.h>
10#include <linux/slab.h>
11#include <trace/events/block.h>
12#include "md.h"
13
14struct dev_info {
15 struct md_rdev *rdev;
16 sector_t end_sector;
17};
18
19struct linear_conf {
20 struct rcu_head rcu;
21 sector_t array_sectors;
22 /* a copy of mddev->raid_disks */
23 int raid_disks;
24 struct dev_info disks[] __counted_by(raid_disks);
25};
26
27/*
28 * find which device holds a particular offset
29 */
30static inline struct dev_info *which_dev(struct mddev *mddev, sector_t sector)
31{
32 int lo, mid, hi;
33 struct linear_conf *conf;
34
35 lo = 0;
36 hi = mddev->raid_disks - 1;
37 conf = mddev->private;
38
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;
53}
54
55static sector_t linear_size(struct mddev *mddev, sector_t sectors, int raid_disks)
56{
57 struct linear_conf *conf;
58 sector_t array_sectors;
59
60 conf = mddev->private;
61 WARN_ONCE(sectors || raid_disks,
62 "%s does not support generic reshape\n", __func__);
63 array_sectors = conf->array_sectors;
64
65 return array_sectors;
66}
67
68static int linear_set_limits(struct mddev *mddev)
69{
70 struct queue_limits lim;
71 int err;
72
73 md_init_stacking_limits(&lim);
74 lim.max_hw_sectors = mddev->chunk_sectors;
75 lim.max_write_zeroes_sectors = mddev->chunk_sectors;
76 lim.max_hw_wzeroes_unmap_sectors = mddev->chunk_sectors;
77 lim.io_min = mddev->chunk_sectors << 9;
78 err = mddev_stack_rdev_limits(mddev, &lim, MDDEV_STACK_INTEGRITY);
79 if (err)
80 return err;
81
82 return queue_limits_set(mddev->gendisk->queue, &lim);
83}
84
85static struct linear_conf *linear_conf(struct mddev *mddev, int raid_disks)
86{
87 struct linear_conf *conf;
88 struct md_rdev *rdev;
89 int ret = -EINVAL;
90 int cnt;
91 int i;
92
93 conf = kzalloc(struct_size(conf, disks, raid_disks), GFP_KERNEL);
94 if (!conf)
95 return ERR_PTR(-ENOMEM);
96
97 /*
98 * conf->raid_disks is copy of mddev->raid_disks. The reason to
99 * keep a copy of mddev->raid_disks in struct linear_conf is,
100 * mddev->raid_disks may not be consistent with pointers number of
101 * conf->disks[] when it is updated in linear_add() and used to
102 * iterate old conf->disks[] earray in linear_congested().
103 * Here conf->raid_disks is always consitent with number of
104 * pointers in conf->disks[] array, and mddev->private is updated
105 * with rcu_assign_pointer() in linear_addr(), such race can be
106 * avoided.
107 */
108 conf->raid_disks = raid_disks;
109
110 cnt = 0;
111 conf->array_sectors = 0;
112
113 rdev_for_each(rdev, mddev) {
114 int j = rdev->raid_disk;
115 struct dev_info *disk = conf->disks + j;
116 sector_t sectors;
117
118 if (j < 0 || j >= raid_disks || disk->rdev) {
119 pr_warn("md/linear:%s: disk numbering problem. Aborting!\n",
120 mdname(mddev));
121 goto out;
122 }
123
124 disk->rdev = rdev;
125 if (mddev->chunk_sectors) {
126 sectors = rdev->sectors;
127 sector_div(sectors, mddev->chunk_sectors);
128 rdev->sectors = sectors * mddev->chunk_sectors;
129 }
130
131 conf->array_sectors += rdev->sectors;
132 cnt++;
133 }
134 if (cnt != raid_disks) {
135 pr_warn("md/linear:%s: not enough drives present. Aborting!\n",
136 mdname(mddev));
137 goto out;
138 }
139
140 /*
141 * Here we calculate the device offsets.
142 */
143 conf->disks[0].end_sector = conf->disks[0].rdev->sectors;
144
145 for (i = 1; i < raid_disks; i++)
146 conf->disks[i].end_sector =
147 conf->disks[i-1].end_sector +
148 conf->disks[i].rdev->sectors;
149
150 if (!mddev_is_dm(mddev)) {
151 ret = linear_set_limits(mddev);
152 if (ret)
153 goto out;
154 }
155
156 return conf;
157
158out:
159 kfree(conf);
160 return ERR_PTR(ret);
161}
162
163static int linear_run(struct mddev *mddev)
164{
165 struct linear_conf *conf;
166 int ret;
167
168 if (md_check_no_bitmap(mddev))
169 return -EINVAL;
170
171 conf = linear_conf(mddev, mddev->raid_disks);
172 if (IS_ERR(conf))
173 return PTR_ERR(conf);
174
175 mddev->private = conf;
176 md_set_array_sectors(mddev, linear_size(mddev, 0, 0));
177
178 ret = md_integrity_register(mddev);
179 if (ret) {
180 kfree(conf);
181 mddev->private = NULL;
182 }
183 return ret;
184}
185
186static int linear_add(struct mddev *mddev, struct md_rdev *rdev)
187{
188 /* Adding a drive to a linear array allows the array to grow.
189 * It is permitted if the new drive has a matching superblock
190 * already on it, with raid_disk equal to raid_disks.
191 * It is achieved by creating a new linear_private_data structure
192 * and swapping it in in-place of the current one.
193 * The current one is never freed until the array is stopped.
194 * This avoids races.
195 */
196 struct linear_conf *newconf, *oldconf;
197
198 if (rdev->saved_raid_disk != mddev->raid_disks)
199 return -EINVAL;
200
201 rdev->raid_disk = rdev->saved_raid_disk;
202 rdev->saved_raid_disk = -1;
203
204 newconf = linear_conf(mddev, mddev->raid_disks + 1);
205 if (IS_ERR(newconf))
206 return PTR_ERR(newconf);
207
208 /* newconf->raid_disks already keeps a copy of * the increased
209 * value of mddev->raid_disks, WARN_ONCE() is just used to make
210 * sure of this. It is possible that oldconf is still referenced
211 * in linear_congested(), therefore kfree_rcu() is used to free
212 * oldconf until no one uses it anymore.
213 */
214 oldconf = rcu_dereference_protected(mddev->private,
215 lockdep_is_held(&mddev->reconfig_mutex));
216 mddev->raid_disks++;
217 WARN_ONCE(mddev->raid_disks != newconf->raid_disks,
218 "copied raid_disks doesn't match mddev->raid_disks");
219 rcu_assign_pointer(mddev->private, newconf);
220 md_set_array_sectors(mddev, linear_size(mddev, 0, 0));
221 set_capacity_and_notify(mddev->gendisk, mddev->array_sectors);
222 kfree_rcu(oldconf, rcu);
223 return 0;
224}
225
226static void linear_free(struct mddev *mddev, void *priv)
227{
228 struct linear_conf *conf = priv;
229
230 kfree(conf);
231}
232
233static bool linear_make_request(struct mddev *mddev, struct bio *bio)
234{
235 struct dev_info *tmp_dev;
236 sector_t start_sector, end_sector, data_offset;
237 sector_t bio_sector = bio->bi_iter.bi_sector;
238
239 if (unlikely(bio->bi_opf & REQ_PREFLUSH)
240 && md_flush_request(mddev, bio))
241 return true;
242
243 tmp_dev = which_dev(mddev, bio_sector);
244 start_sector = tmp_dev->end_sector - tmp_dev->rdev->sectors;
245 end_sector = tmp_dev->end_sector;
246 data_offset = tmp_dev->rdev->data_offset;
247
248 if (unlikely(bio_sector >= end_sector ||
249 bio_sector < start_sector))
250 goto out_of_bounds;
251
252 if (unlikely(is_rdev_broken(tmp_dev->rdev))) {
253 md_error(mddev, tmp_dev->rdev);
254 bio_io_error(bio);
255 return true;
256 }
257
258 if (unlikely(bio_end_sector(bio) > end_sector)) {
259 /* This bio crosses a device boundary, so we have to split it */
260 bio = bio_submit_split_bioset(bio, end_sector - bio_sector,
261 &mddev->bio_set);
262 if (!bio)
263 return true;
264 }
265
266 md_account_bio(mddev, &bio);
267 bio_set_dev(bio, tmp_dev->rdev->bdev);
268 bio->bi_iter.bi_sector = bio->bi_iter.bi_sector -
269 start_sector + data_offset;
270
271 if (unlikely((bio_op(bio) == REQ_OP_DISCARD) &&
272 !bdev_max_discard_sectors(bio->bi_bdev))) {
273 /* Just ignore it */
274 bio_endio(bio);
275 } else {
276 if (mddev->gendisk)
277 trace_block_bio_remap(bio, disk_devt(mddev->gendisk),
278 bio_sector);
279 mddev_check_write_zeroes(mddev, bio);
280 submit_bio_noacct(bio);
281 }
282 return true;
283
284out_of_bounds:
285 pr_err("md/linear:%s: make_request: Sector %llu out of bounds on dev %pg: %llu sectors, offset %llu\n",
286 mdname(mddev),
287 (unsigned long long)bio->bi_iter.bi_sector,
288 tmp_dev->rdev->bdev,
289 (unsigned long long)tmp_dev->rdev->sectors,
290 (unsigned long long)start_sector);
291 bio_io_error(bio);
292 return true;
293}
294
295static void linear_status(struct seq_file *seq, struct mddev *mddev)
296{
297 seq_printf(seq, " %dk rounding", mddev->chunk_sectors / 2);
298}
299
300static void linear_error(struct mddev *mddev, struct md_rdev *rdev)
301{
302 if (!test_and_set_bit(MD_BROKEN, &mddev->flags)) {
303 char *md_name = mdname(mddev);
304
305 pr_crit("md/linear%s: Disk failure on %pg detected, failing array.\n",
306 md_name, rdev->bdev);
307 }
308}
309
310static void linear_quiesce(struct mddev *mddev, int state)
311{
312}
313
314static struct md_personality linear_personality = {
315 .head = {
316 .type = MD_PERSONALITY,
317 .id = ID_LINEAR,
318 .name = "linear",
319 .owner = THIS_MODULE,
320 },
321
322 .make_request = linear_make_request,
323 .run = linear_run,
324 .free = linear_free,
325 .status = linear_status,
326 .hot_add_disk = linear_add,
327 .size = linear_size,
328 .quiesce = linear_quiesce,
329 .error_handler = linear_error,
330};
331
332static int __init linear_init(void)
333{
334 return register_md_submodule(&linear_personality.head);
335}
336
337static void linear_exit(void)
338{
339 unregister_md_submodule(&linear_personality.head);
340}
341
342module_init(linear_init);
343module_exit(linear_exit);
344MODULE_LICENSE("GPL");
345MODULE_DESCRIPTION("Linear device concatenation personality for MD (deprecated)");
346MODULE_ALIAS("md-personality-1"); /* LINEAR - deprecated*/
347MODULE_ALIAS("md-linear");
348MODULE_ALIAS("md-level--1");