dm-stripe.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * Copyright (C) 2001-2003 Sistina Software (UK) Limited.
  4. *
  5. * This file is released under the GPL.
  6. */
  7. #include "dm.h"
  8. #include <linux/device-mapper.h>
  9. #include <linux/module.h>
  10. #include <linux/init.h>
  11. #include <linux/blkdev.h>
  12. #include <linux/bio.h>
  13. #include <linux/dax.h>
  14. #include <linux/slab.h>
  15. #include <linux/log2.h>
  16. static struct workqueue_struct *dm_stripe_wq;
  17. #define DM_MSG_PREFIX "striped"
  18. #define DM_IO_ERROR_THRESHOLD 15
  19. struct stripe {
  20. struct dm_dev *dev;
  21. sector_t physical_start;
  22. atomic_t error_count;
  23. };
  24. struct stripe_c {
  25. uint32_t stripes;
  26. int stripes_shift;
  27. /* The size of this target / num. stripes */
  28. sector_t stripe_width;
  29. uint32_t chunk_size;
  30. int chunk_size_shift;
  31. /* Needed for handling events */
  32. struct dm_target *ti;
  33. /* Work struct used for triggering events*/
  34. struct work_struct trigger_event;
  35. struct stripe stripe[] __counted_by(stripes);
  36. };
  37. /*
  38. * An event is triggered whenever a drive
  39. * drops out of a stripe volume.
  40. */
  41. static void trigger_event(struct work_struct *work)
  42. {
  43. struct stripe_c *sc = container_of(work, struct stripe_c,
  44. trigger_event);
  45. dm_table_event(sc->ti->table);
  46. }
  47. /*
  48. * Parse a single <dev> <sector> pair
  49. */
  50. static int get_stripe(struct dm_target *ti, struct stripe_c *sc,
  51. unsigned int stripe, char **argv)
  52. {
  53. unsigned long long start;
  54. char dummy;
  55. int ret;
  56. if (sscanf(argv[1], "%llu%c", &start, &dummy) != 1)
  57. return -EINVAL;
  58. ret = dm_get_device(ti, argv[0], dm_table_get_mode(ti->table),
  59. &sc->stripe[stripe].dev);
  60. if (ret)
  61. return ret;
  62. sc->stripe[stripe].physical_start = start;
  63. return 0;
  64. }
  65. /*
  66. * Construct a striped mapping.
  67. * <number of stripes> <chunk size> [<dev_path> <offset>]+
  68. */
  69. static int stripe_ctr(struct dm_target *ti, unsigned int argc, char **argv)
  70. {
  71. struct stripe_c *sc;
  72. sector_t width, tmp_len;
  73. uint32_t stripes;
  74. uint32_t chunk_size;
  75. int r;
  76. unsigned int i;
  77. if (argc < 2) {
  78. ti->error = "Not enough arguments";
  79. return -EINVAL;
  80. }
  81. if (kstrtouint(argv[0], 10, &stripes) || !stripes) {
  82. ti->error = "Invalid stripe count";
  83. return -EINVAL;
  84. }
  85. if (kstrtouint(argv[1], 10, &chunk_size) || !chunk_size) {
  86. ti->error = "Invalid chunk_size";
  87. return -EINVAL;
  88. }
  89. width = ti->len;
  90. if (sector_div(width, stripes)) {
  91. ti->error = "Target length not divisible by number of stripes";
  92. return -EINVAL;
  93. }
  94. tmp_len = width;
  95. if (sector_div(tmp_len, chunk_size)) {
  96. ti->error = "Target length not divisible by chunk size";
  97. return -EINVAL;
  98. }
  99. /*
  100. * Do we have enough arguments for that many stripes ?
  101. */
  102. if (argc != (2 + 2 * stripes)) {
  103. ti->error = "Not enough destinations specified";
  104. return -EINVAL;
  105. }
  106. sc = kmalloc_flex(*sc, stripe, stripes);
  107. if (!sc) {
  108. ti->error = "Memory allocation for striped context failed";
  109. return -ENOMEM;
  110. }
  111. INIT_WORK(&sc->trigger_event, trigger_event);
  112. /* Set pointer to dm target; used in trigger_event */
  113. sc->ti = ti;
  114. sc->stripes = stripes;
  115. sc->stripe_width = width;
  116. if (stripes & (stripes - 1))
  117. sc->stripes_shift = -1;
  118. else
  119. sc->stripes_shift = __ffs(stripes);
  120. r = dm_set_target_max_io_len(ti, chunk_size);
  121. if (r) {
  122. kfree(sc);
  123. return r;
  124. }
  125. ti->num_flush_bios = stripes;
  126. ti->num_discard_bios = stripes;
  127. ti->num_secure_erase_bios = stripes;
  128. ti->num_write_zeroes_bios = stripes;
  129. ti->flush_bypasses_map = true;
  130. sc->chunk_size = chunk_size;
  131. if (chunk_size & (chunk_size - 1))
  132. sc->chunk_size_shift = -1;
  133. else
  134. sc->chunk_size_shift = __ffs(chunk_size);
  135. /*
  136. * Get the stripe destinations.
  137. */
  138. for (i = 0; i < stripes; i++) {
  139. argv += 2;
  140. r = get_stripe(ti, sc, i, argv);
  141. if (r < 0) {
  142. ti->error = "Couldn't parse stripe destination";
  143. while (i--)
  144. dm_put_device(ti, sc->stripe[i].dev);
  145. kfree(sc);
  146. return r;
  147. }
  148. atomic_set(&(sc->stripe[i].error_count), 0);
  149. }
  150. ti->private = sc;
  151. return 0;
  152. }
  153. static void stripe_dtr(struct dm_target *ti)
  154. {
  155. unsigned int i;
  156. struct stripe_c *sc = ti->private;
  157. for (i = 0; i < sc->stripes; i++)
  158. dm_put_device(ti, sc->stripe[i].dev);
  159. flush_work(&sc->trigger_event);
  160. kfree(sc);
  161. }
  162. static void stripe_map_sector(struct stripe_c *sc, sector_t sector,
  163. uint32_t *stripe, sector_t *result)
  164. {
  165. sector_t chunk = dm_target_offset(sc->ti, sector);
  166. sector_t chunk_offset;
  167. if (sc->chunk_size_shift < 0)
  168. chunk_offset = sector_div(chunk, sc->chunk_size);
  169. else {
  170. chunk_offset = chunk & (sc->chunk_size - 1);
  171. chunk >>= sc->chunk_size_shift;
  172. }
  173. if (sc->stripes_shift < 0)
  174. *stripe = sector_div(chunk, sc->stripes);
  175. else {
  176. *stripe = chunk & (sc->stripes - 1);
  177. chunk >>= sc->stripes_shift;
  178. }
  179. if (sc->chunk_size_shift < 0)
  180. chunk *= sc->chunk_size;
  181. else
  182. chunk <<= sc->chunk_size_shift;
  183. *result = chunk + chunk_offset;
  184. }
  185. static void stripe_map_range_sector(struct stripe_c *sc, sector_t sector,
  186. uint32_t target_stripe, sector_t *result)
  187. {
  188. uint32_t stripe;
  189. stripe_map_sector(sc, sector, &stripe, result);
  190. if (stripe == target_stripe)
  191. return;
  192. /* round down */
  193. sector = *result;
  194. if (sc->chunk_size_shift < 0)
  195. *result -= sector_div(sector, sc->chunk_size);
  196. else
  197. *result = sector & ~(sector_t)(sc->chunk_size - 1);
  198. if (target_stripe < stripe)
  199. *result += sc->chunk_size; /* next chunk */
  200. }
  201. static int stripe_map_range(struct stripe_c *sc, struct bio *bio,
  202. uint32_t target_stripe)
  203. {
  204. sector_t begin, end;
  205. stripe_map_range_sector(sc, bio->bi_iter.bi_sector,
  206. target_stripe, &begin);
  207. stripe_map_range_sector(sc, bio_end_sector(bio),
  208. target_stripe, &end);
  209. if (begin < end) {
  210. bio_set_dev(bio, sc->stripe[target_stripe].dev->bdev);
  211. bio->bi_iter.bi_sector = begin +
  212. sc->stripe[target_stripe].physical_start;
  213. bio->bi_iter.bi_size = to_bytes(end - begin);
  214. return DM_MAPIO_REMAPPED;
  215. }
  216. /* The range doesn't map to the target stripe */
  217. bio_endio(bio);
  218. return DM_MAPIO_SUBMITTED;
  219. }
  220. int stripe_map(struct dm_target *ti, struct bio *bio)
  221. {
  222. struct stripe_c *sc = ti->private;
  223. uint32_t stripe;
  224. unsigned int target_bio_nr;
  225. if (bio->bi_opf & REQ_PREFLUSH) {
  226. target_bio_nr = dm_bio_get_target_bio_nr(bio);
  227. BUG_ON(target_bio_nr >= sc->stripes);
  228. bio_set_dev(bio, sc->stripe[target_bio_nr].dev->bdev);
  229. return DM_MAPIO_REMAPPED;
  230. }
  231. if (unlikely(bio_op(bio) == REQ_OP_DISCARD) ||
  232. unlikely(bio_op(bio) == REQ_OP_SECURE_ERASE) ||
  233. unlikely(bio_op(bio) == REQ_OP_WRITE_ZEROES)) {
  234. target_bio_nr = dm_bio_get_target_bio_nr(bio);
  235. BUG_ON(target_bio_nr >= sc->stripes);
  236. return stripe_map_range(sc, bio, target_bio_nr);
  237. }
  238. stripe_map_sector(sc, bio->bi_iter.bi_sector,
  239. &stripe, &bio->bi_iter.bi_sector);
  240. bio->bi_iter.bi_sector += sc->stripe[stripe].physical_start;
  241. bio_set_dev(bio, sc->stripe[stripe].dev->bdev);
  242. return DM_MAPIO_REMAPPED;
  243. }
  244. #if IS_ENABLED(CONFIG_FS_DAX)
  245. static struct dax_device *stripe_dax_pgoff(struct dm_target *ti, pgoff_t *pgoff)
  246. {
  247. struct stripe_c *sc = ti->private;
  248. struct block_device *bdev;
  249. sector_t dev_sector;
  250. uint32_t stripe;
  251. stripe_map_sector(sc, *pgoff * PAGE_SECTORS, &stripe, &dev_sector);
  252. dev_sector += sc->stripe[stripe].physical_start;
  253. bdev = sc->stripe[stripe].dev->bdev;
  254. *pgoff = (get_start_sect(bdev) + dev_sector) >> PAGE_SECTORS_SHIFT;
  255. return sc->stripe[stripe].dev->dax_dev;
  256. }
  257. static long stripe_dax_direct_access(struct dm_target *ti, pgoff_t pgoff,
  258. long nr_pages, enum dax_access_mode mode, void **kaddr,
  259. unsigned long *pfn)
  260. {
  261. struct dax_device *dax_dev = stripe_dax_pgoff(ti, &pgoff);
  262. return dax_direct_access(dax_dev, pgoff, nr_pages, mode, kaddr, pfn);
  263. }
  264. static int stripe_dax_zero_page_range(struct dm_target *ti, pgoff_t pgoff,
  265. size_t nr_pages)
  266. {
  267. struct dax_device *dax_dev = stripe_dax_pgoff(ti, &pgoff);
  268. return dax_zero_page_range(dax_dev, pgoff, nr_pages);
  269. }
  270. static size_t stripe_dax_recovery_write(struct dm_target *ti, pgoff_t pgoff,
  271. void *addr, size_t bytes, struct iov_iter *i)
  272. {
  273. struct dax_device *dax_dev = stripe_dax_pgoff(ti, &pgoff);
  274. return dax_recovery_write(dax_dev, pgoff, addr, bytes, i);
  275. }
  276. #else
  277. #define stripe_dax_direct_access NULL
  278. #define stripe_dax_zero_page_range NULL
  279. #define stripe_dax_recovery_write NULL
  280. #endif
  281. /*
  282. * Stripe status:
  283. *
  284. * INFO
  285. * #stripes [stripe_name <stripe_name>] [group word count]
  286. * [error count 'A|D' <error count 'A|D'>]
  287. *
  288. * TABLE
  289. * #stripes [stripe chunk size]
  290. * [stripe_name physical_start <stripe_name physical_start>]
  291. *
  292. */
  293. static void stripe_status(struct dm_target *ti, status_type_t type,
  294. unsigned int status_flags, char *result, unsigned int maxlen)
  295. {
  296. struct stripe_c *sc = ti->private;
  297. unsigned int sz = 0;
  298. unsigned int i;
  299. switch (type) {
  300. case STATUSTYPE_INFO:
  301. DMEMIT("%d ", sc->stripes);
  302. for (i = 0; i < sc->stripes; i++)
  303. DMEMIT("%s ", sc->stripe[i].dev->name);
  304. DMEMIT("1 ");
  305. for (i = 0; i < sc->stripes; i++)
  306. DMEMIT("%c", atomic_read(&(sc->stripe[i].error_count)) ? 'D' : 'A');
  307. break;
  308. case STATUSTYPE_TABLE:
  309. DMEMIT("%d %llu", sc->stripes,
  310. (unsigned long long)sc->chunk_size);
  311. for (i = 0; i < sc->stripes; i++)
  312. DMEMIT(" %s %llu", sc->stripe[i].dev->name,
  313. (unsigned long long)sc->stripe[i].physical_start);
  314. break;
  315. case STATUSTYPE_IMA:
  316. DMEMIT_TARGET_NAME_VERSION(ti->type);
  317. DMEMIT(",stripes=%d,chunk_size=%llu", sc->stripes,
  318. (unsigned long long)sc->chunk_size);
  319. for (i = 0; i < sc->stripes; i++) {
  320. DMEMIT(",stripe_%d_device_name=%s", i, sc->stripe[i].dev->name);
  321. DMEMIT(",stripe_%d_physical_start=%llu", i,
  322. (unsigned long long)sc->stripe[i].physical_start);
  323. DMEMIT(",stripe_%d_status=%c", i,
  324. atomic_read(&(sc->stripe[i].error_count)) ? 'D' : 'A');
  325. }
  326. DMEMIT(";");
  327. break;
  328. }
  329. }
  330. static int stripe_end_io(struct dm_target *ti, struct bio *bio,
  331. blk_status_t *error)
  332. {
  333. unsigned int i;
  334. char major_minor[22];
  335. struct stripe_c *sc = ti->private;
  336. if (!*error)
  337. return DM_ENDIO_DONE; /* I/O complete */
  338. if (bio->bi_opf & REQ_RAHEAD)
  339. return DM_ENDIO_DONE;
  340. if (*error == BLK_STS_NOTSUPP)
  341. return DM_ENDIO_DONE;
  342. format_dev_t(major_minor, bio_dev(bio));
  343. /*
  344. * Test to see which stripe drive triggered the event
  345. * and increment error count for all stripes on that device.
  346. * If the error count for a given device exceeds the threshold
  347. * value we will no longer trigger any further events.
  348. */
  349. for (i = 0; i < sc->stripes; i++)
  350. if (!strcmp(sc->stripe[i].dev->name, major_minor)) {
  351. atomic_inc(&(sc->stripe[i].error_count));
  352. if (atomic_read(&(sc->stripe[i].error_count)) <
  353. DM_IO_ERROR_THRESHOLD)
  354. queue_work(dm_stripe_wq, &sc->trigger_event);
  355. }
  356. return DM_ENDIO_DONE;
  357. }
  358. static int stripe_iterate_devices(struct dm_target *ti,
  359. iterate_devices_callout_fn fn, void *data)
  360. {
  361. struct stripe_c *sc = ti->private;
  362. int ret = 0;
  363. unsigned int i = 0;
  364. do {
  365. ret = fn(ti, sc->stripe[i].dev,
  366. sc->stripe[i].physical_start,
  367. sc->stripe_width, data);
  368. } while (!ret && ++i < sc->stripes);
  369. return ret;
  370. }
  371. static void stripe_io_hints(struct dm_target *ti,
  372. struct queue_limits *limits)
  373. {
  374. struct stripe_c *sc = ti->private;
  375. unsigned int io_min, io_opt, max_hw_discard_sectors = limits->max_hw_discard_sectors;
  376. limits->chunk_sectors = sc->chunk_size;
  377. if (!check_shl_overflow(sc->chunk_size, SECTOR_SHIFT, &io_min) &&
  378. !check_mul_overflow(io_min, sc->stripes, &io_opt)) {
  379. limits->io_min = io_min;
  380. limits->io_opt = io_opt;
  381. }
  382. if (max_hw_discard_sectors >= sc->chunk_size) {
  383. if (!check_mul_overflow(max_hw_discard_sectors, sc->stripes, &max_hw_discard_sectors)) {
  384. max_hw_discard_sectors = rounddown(max_hw_discard_sectors,
  385. sc->chunk_size * sc->stripes);
  386. limits->max_hw_discard_sectors = max_hw_discard_sectors;
  387. } else
  388. limits->max_hw_discard_sectors = UINT_MAX >> SECTOR_SHIFT;
  389. }
  390. }
  391. static struct target_type stripe_target = {
  392. .name = "striped",
  393. .version = {1, 7, 0},
  394. .features = DM_TARGET_PASSES_INTEGRITY | DM_TARGET_NOWAIT |
  395. DM_TARGET_ATOMIC_WRITES | DM_TARGET_PASSES_CRYPTO,
  396. .module = THIS_MODULE,
  397. .ctr = stripe_ctr,
  398. .dtr = stripe_dtr,
  399. .map = stripe_map,
  400. .end_io = stripe_end_io,
  401. .status = stripe_status,
  402. .iterate_devices = stripe_iterate_devices,
  403. .io_hints = stripe_io_hints,
  404. .direct_access = stripe_dax_direct_access,
  405. .dax_zero_page_range = stripe_dax_zero_page_range,
  406. .dax_recovery_write = stripe_dax_recovery_write,
  407. };
  408. int __init dm_stripe_init(void)
  409. {
  410. int r;
  411. dm_stripe_wq = alloc_workqueue("dm_stripe_wq", WQ_PERCPU, 0);
  412. if (!dm_stripe_wq)
  413. return -ENOMEM;
  414. r = dm_register_target(&stripe_target);
  415. if (r < 0) {
  416. destroy_workqueue(dm_stripe_wq);
  417. DMWARN("target registration failed");
  418. }
  419. return r;
  420. }
  421. void dm_stripe_exit(void)
  422. {
  423. dm_unregister_target(&stripe_target);
  424. destroy_workqueue(dm_stripe_wq);
  425. }