dm-stripe.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446
  1. /*
  2. * Copyright (C) 2001-2003 Sistina Software (UK) Limited.
  3. *
  4. * This file is released under the GPL.
  5. */
  6. #include <linux/device-mapper.h>
  7. #include <linux/module.h>
  8. #include <linux/init.h>
  9. #include <linux/blkdev.h>
  10. #include <linux/bio.h>
  11. #include <linux/slab.h>
  12. #include <linux/log2.h>
  13. #define DM_MSG_PREFIX "striped"
  14. #define DM_IO_ERROR_THRESHOLD 15
  15. struct stripe {
  16. struct dm_dev *dev;
  17. sector_t physical_start;
  18. atomic_t error_count;
  19. };
  20. struct stripe_c {
  21. uint32_t stripes;
  22. int stripes_shift;
  23. /* The size of this target / num. stripes */
  24. sector_t stripe_width;
  25. /* stripe chunk size */
  26. uint32_t chunk_shift;
  27. sector_t chunk_mask;
  28. /* Needed for handling events */
  29. struct dm_target *ti;
  30. /* Work struct used for triggering events*/
  31. struct work_struct trigger_event;
  32. struct stripe stripe[0];
  33. };
  34. /*
  35. * An event is triggered whenever a drive
  36. * drops out of a stripe volume.
  37. */
  38. static void trigger_event(struct work_struct *work)
  39. {
  40. struct stripe_c *sc = container_of(work, struct stripe_c,
  41. trigger_event);
  42. dm_table_event(sc->ti->table);
  43. }
  44. static inline struct stripe_c *alloc_context(unsigned int stripes)
  45. {
  46. size_t len;
  47. if (dm_array_too_big(sizeof(struct stripe_c), sizeof(struct stripe),
  48. stripes))
  49. return NULL;
  50. len = sizeof(struct stripe_c) + (sizeof(struct stripe) * stripes);
  51. return kmalloc(len, GFP_KERNEL);
  52. }
  53. /*
  54. * Parse a single <dev> <sector> pair
  55. */
  56. static int get_stripe(struct dm_target *ti, struct stripe_c *sc,
  57. unsigned int stripe, char **argv)
  58. {
  59. unsigned long long start;
  60. char dummy;
  61. if (sscanf(argv[1], "%llu%c", &start, &dummy) != 1)
  62. return -EINVAL;
  63. if (dm_get_device(ti, argv[0], dm_table_get_mode(ti->table),
  64. &sc->stripe[stripe].dev))
  65. return -ENXIO;
  66. sc->stripe[stripe].physical_start = start;
  67. return 0;
  68. }
  69. /*
  70. * Construct a striped mapping.
  71. * <number of stripes> <chunk size (2^^n)> [<dev_path> <offset>]+
  72. */
  73. static int stripe_ctr(struct dm_target *ti, unsigned int argc, char **argv)
  74. {
  75. struct stripe_c *sc;
  76. sector_t width;
  77. uint32_t stripes;
  78. uint32_t chunk_size;
  79. int r;
  80. unsigned int i;
  81. if (argc < 2) {
  82. ti->error = "Not enough arguments";
  83. return -EINVAL;
  84. }
  85. if (kstrtouint(argv[0], 10, &stripes) || !stripes) {
  86. ti->error = "Invalid stripe count";
  87. return -EINVAL;
  88. }
  89. if (kstrtouint(argv[1], 10, &chunk_size)) {
  90. ti->error = "Invalid chunk_size";
  91. return -EINVAL;
  92. }
  93. /*
  94. * chunk_size is a power of two
  95. */
  96. if (!is_power_of_2(chunk_size) ||
  97. (chunk_size < (PAGE_SIZE >> SECTOR_SHIFT))) {
  98. ti->error = "Invalid chunk size";
  99. return -EINVAL;
  100. }
  101. if (ti->len & (chunk_size - 1)) {
  102. ti->error = "Target length not divisible by "
  103. "chunk size";
  104. return -EINVAL;
  105. }
  106. if (sector_div(width, stripes)) {
  107. ti->error = "Target length not divisible by "
  108. "number of stripes";
  109. return -EINVAL;
  110. }
  111. /*
  112. * Do we have enough arguments for that many stripes ?
  113. */
  114. if (argc != (2 + 2 * stripes)) {
  115. ti->error = "Not enough destinations "
  116. "specified";
  117. return -EINVAL;
  118. }
  119. sc = alloc_context(stripes);
  120. if (!sc) {
  121. ti->error = "Memory allocation for striped context "
  122. "failed";
  123. return -ENOMEM;
  124. }
  125. INIT_WORK(&sc->trigger_event, trigger_event);
  126. /* Set pointer to dm target; used in trigger_event */
  127. sc->ti = ti;
  128. sc->stripes = stripes;
  129. sc->stripe_width = width;
  130. if (stripes & (stripes - 1))
  131. sc->stripes_shift = -1;
  132. else
  133. sc->stripes_shift = __ffs(stripes);
  134. r = dm_set_target_max_io_len(ti, chunk_size);
  135. if (r)
  136. return r;
  137. ti->num_flush_requests = stripes;
  138. ti->num_discard_requests = stripes;
  139. sc->chunk_shift = ffs(chunk_size) - 1;
  140. sc->chunk_mask = ((sector_t) chunk_size) - 1;
  141. /*
  142. * Get the stripe destinations.
  143. */
  144. for (i = 0; i < stripes; i++) {
  145. argv += 2;
  146. r = get_stripe(ti, sc, i, argv);
  147. if (r < 0) {
  148. ti->error = "Couldn't parse stripe destination";
  149. while (i--)
  150. dm_put_device(ti, sc->stripe[i].dev);
  151. kfree(sc);
  152. return r;
  153. }
  154. atomic_set(&(sc->stripe[i].error_count), 0);
  155. }
  156. ti->private = sc;
  157. return 0;
  158. }
  159. static void stripe_dtr(struct dm_target *ti)
  160. {
  161. unsigned int i;
  162. struct stripe_c *sc = (struct stripe_c *) ti->private;
  163. for (i = 0; i < sc->stripes; i++)
  164. dm_put_device(ti, sc->stripe[i].dev);
  165. flush_work_sync(&sc->trigger_event);
  166. kfree(sc);
  167. }
  168. static void stripe_map_sector(struct stripe_c *sc, sector_t sector,
  169. uint32_t *stripe, sector_t *result)
  170. {
  171. sector_t offset = dm_target_offset(sc->ti, sector);
  172. sector_t chunk = offset >> sc->chunk_shift;
  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. *result = (chunk << sc->chunk_shift) | (offset & sc->chunk_mask);
  180. }
  181. static void stripe_map_range_sector(struct stripe_c *sc, sector_t sector,
  182. uint32_t target_stripe, sector_t *result)
  183. {
  184. uint32_t stripe;
  185. stripe_map_sector(sc, sector, &stripe, result);
  186. if (stripe == target_stripe)
  187. return;
  188. *result &= ~sc->chunk_mask; /* round down */
  189. if (target_stripe < stripe)
  190. *result += sc->chunk_mask + 1; /* next chunk */
  191. }
  192. static int stripe_map_discard(struct stripe_c *sc, struct bio *bio,
  193. uint32_t target_stripe)
  194. {
  195. sector_t begin, end;
  196. stripe_map_range_sector(sc, bio->bi_sector, target_stripe, &begin);
  197. stripe_map_range_sector(sc, bio->bi_sector + bio_sectors(bio),
  198. target_stripe, &end);
  199. if (begin < end) {
  200. bio->bi_bdev = sc->stripe[target_stripe].dev->bdev;
  201. bio->bi_sector = begin + sc->stripe[target_stripe].physical_start;
  202. bio->bi_size = to_bytes(end - begin);
  203. return DM_MAPIO_REMAPPED;
  204. } else {
  205. /* The range doesn't map to the target stripe */
  206. bio_endio(bio, 0);
  207. return DM_MAPIO_SUBMITTED;
  208. }
  209. }
  210. static int stripe_map(struct dm_target *ti, struct bio *bio,
  211. union map_info *map_context)
  212. {
  213. struct stripe_c *sc = ti->private;
  214. uint32_t stripe;
  215. unsigned target_request_nr;
  216. if (bio->bi_rw & REQ_FLUSH) {
  217. target_request_nr = map_context->target_request_nr;
  218. BUG_ON(target_request_nr >= sc->stripes);
  219. bio->bi_bdev = sc->stripe[target_request_nr].dev->bdev;
  220. return DM_MAPIO_REMAPPED;
  221. }
  222. if (unlikely(bio->bi_rw & REQ_DISCARD)) {
  223. target_request_nr = map_context->target_request_nr;
  224. BUG_ON(target_request_nr >= sc->stripes);
  225. return stripe_map_discard(sc, bio, target_request_nr);
  226. }
  227. stripe_map_sector(sc, bio->bi_sector, &stripe, &bio->bi_sector);
  228. bio->bi_sector += sc->stripe[stripe].physical_start;
  229. bio->bi_bdev = sc->stripe[stripe].dev->bdev;
  230. return DM_MAPIO_REMAPPED;
  231. }
  232. /*
  233. * Stripe status:
  234. *
  235. * INFO
  236. * #stripes [stripe_name <stripe_name>] [group word count]
  237. * [error count 'A|D' <error count 'A|D'>]
  238. *
  239. * TABLE
  240. * #stripes [stripe chunk size]
  241. * [stripe_name physical_start <stripe_name physical_start>]
  242. *
  243. */
  244. static int stripe_status(struct dm_target *ti,
  245. status_type_t type, char *result, unsigned int maxlen)
  246. {
  247. struct stripe_c *sc = (struct stripe_c *) ti->private;
  248. char buffer[sc->stripes + 1];
  249. unsigned int sz = 0;
  250. unsigned int i;
  251. switch (type) {
  252. case STATUSTYPE_INFO:
  253. DMEMIT("%d ", sc->stripes);
  254. for (i = 0; i < sc->stripes; i++) {
  255. DMEMIT("%s ", sc->stripe[i].dev->name);
  256. buffer[i] = atomic_read(&(sc->stripe[i].error_count)) ?
  257. 'D' : 'A';
  258. }
  259. buffer[i] = '\0';
  260. DMEMIT("1 %s", buffer);
  261. break;
  262. case STATUSTYPE_TABLE:
  263. DMEMIT("%d %llu", sc->stripes,
  264. (unsigned long long)sc->chunk_mask + 1);
  265. for (i = 0; i < sc->stripes; i++)
  266. DMEMIT(" %s %llu", sc->stripe[i].dev->name,
  267. (unsigned long long)sc->stripe[i].physical_start);
  268. break;
  269. }
  270. return 0;
  271. }
  272. static int stripe_end_io(struct dm_target *ti, struct bio *bio,
  273. int error, union map_info *map_context)
  274. {
  275. unsigned i;
  276. char major_minor[16];
  277. struct stripe_c *sc = ti->private;
  278. if (!error)
  279. return 0; /* I/O complete */
  280. if ((error == -EWOULDBLOCK) && (bio->bi_rw & REQ_RAHEAD))
  281. return error;
  282. if (error == -EOPNOTSUPP)
  283. return error;
  284. memset(major_minor, 0, sizeof(major_minor));
  285. sprintf(major_minor, "%d:%d",
  286. MAJOR(disk_devt(bio->bi_bdev->bd_disk)),
  287. MINOR(disk_devt(bio->bi_bdev->bd_disk)));
  288. /*
  289. * Test to see which stripe drive triggered the event
  290. * and increment error count for all stripes on that device.
  291. * If the error count for a given device exceeds the threshold
  292. * value we will no longer trigger any further events.
  293. */
  294. for (i = 0; i < sc->stripes; i++)
  295. if (!strcmp(sc->stripe[i].dev->name, major_minor)) {
  296. atomic_inc(&(sc->stripe[i].error_count));
  297. if (atomic_read(&(sc->stripe[i].error_count)) <
  298. DM_IO_ERROR_THRESHOLD)
  299. schedule_work(&sc->trigger_event);
  300. }
  301. return error;
  302. }
  303. static int stripe_iterate_devices(struct dm_target *ti,
  304. iterate_devices_callout_fn fn, void *data)
  305. {
  306. struct stripe_c *sc = ti->private;
  307. int ret = 0;
  308. unsigned i = 0;
  309. do {
  310. ret = fn(ti, sc->stripe[i].dev,
  311. sc->stripe[i].physical_start,
  312. sc->stripe_width, data);
  313. } while (!ret && ++i < sc->stripes);
  314. return ret;
  315. }
  316. static void stripe_io_hints(struct dm_target *ti,
  317. struct queue_limits *limits)
  318. {
  319. struct stripe_c *sc = ti->private;
  320. unsigned chunk_size = (sc->chunk_mask + 1) << 9;
  321. blk_limits_io_min(limits, chunk_size);
  322. blk_limits_io_opt(limits, chunk_size * sc->stripes);
  323. }
  324. static int stripe_merge(struct dm_target *ti, struct bvec_merge_data *bvm,
  325. struct bio_vec *biovec, int max_size)
  326. {
  327. struct stripe_c *sc = ti->private;
  328. sector_t bvm_sector = bvm->bi_sector;
  329. uint32_t stripe;
  330. struct request_queue *q;
  331. stripe_map_sector(sc, bvm_sector, &stripe, &bvm_sector);
  332. q = bdev_get_queue(sc->stripe[stripe].dev->bdev);
  333. if (!q->merge_bvec_fn)
  334. return max_size;
  335. bvm->bi_bdev = sc->stripe[stripe].dev->bdev;
  336. bvm->bi_sector = sc->stripe[stripe].physical_start + bvm_sector;
  337. return min(max_size, q->merge_bvec_fn(q, bvm, biovec));
  338. }
  339. static struct target_type stripe_target = {
  340. .name = "striped",
  341. .version = {1, 4, 0},
  342. .module = THIS_MODULE,
  343. .ctr = stripe_ctr,
  344. .dtr = stripe_dtr,
  345. .map = stripe_map,
  346. .end_io = stripe_end_io,
  347. .status = stripe_status,
  348. .iterate_devices = stripe_iterate_devices,
  349. .io_hints = stripe_io_hints,
  350. .merge = stripe_merge,
  351. };
  352. int __init dm_stripe_init(void)
  353. {
  354. int r;
  355. r = dm_register_target(&stripe_target);
  356. if (r < 0) {
  357. DMWARN("target registration failed");
  358. return r;
  359. }
  360. return r;
  361. }
  362. void dm_stripe_exit(void)
  363. {
  364. dm_unregister_target(&stripe_target);
  365. }