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