md-linear.c 8.7 KB

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