dm-stripe.c 10 KB

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