dm-stripe.c 7.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344
  1. /*
  2. * Copyright (C) 2001-2003 Sistina Software (UK) Limited.
  3. *
  4. * This file is released under the GPL.
  5. */
  6. #include "dm.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. /* The size of this target / num. stripes */
  23. sector_t stripe_width;
  24. /* stripe chunk size */
  25. uint32_t chunk_shift;
  26. sector_t chunk_mask;
  27. /* Needed for handling events */
  28. struct dm_target *ti;
  29. /* Work struct used for triggering events*/
  30. struct work_struct kstriped_ws;
  31. struct stripe stripe[0];
  32. };
  33. static struct workqueue_struct *kstriped;
  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, kstriped_ws);
  41. dm_table_event(sc->ti->table);
  42. }
  43. static inline struct stripe_c *alloc_context(unsigned int stripes)
  44. {
  45. size_t len;
  46. if (array_too_big(sizeof(struct stripe_c), sizeof(struct stripe),
  47. stripes))
  48. return NULL;
  49. len = sizeof(struct stripe_c) + (sizeof(struct stripe) * stripes);
  50. return kmalloc(len, GFP_KERNEL);
  51. }
  52. /*
  53. * Parse a single <dev> <sector> pair
  54. */
  55. static int get_stripe(struct dm_target *ti, struct stripe_c *sc,
  56. unsigned int stripe, char **argv)
  57. {
  58. unsigned long long start;
  59. if (sscanf(argv[1], "%llu", &start) != 1)
  60. return -EINVAL;
  61. if (dm_get_device(ti, argv[0], start, sc->stripe_width,
  62. dm_table_get_mode(ti->table),
  63. &sc->stripe[stripe].dev))
  64. return -ENXIO;
  65. sc->stripe[stripe].physical_start = start;
  66. return 0;
  67. }
  68. /*
  69. * Construct a striped mapping.
  70. * <number of stripes> <chunk size (2^^n)> [<dev_path> <offset>]+
  71. */
  72. static int stripe_ctr(struct dm_target *ti, unsigned int argc, char **argv)
  73. {
  74. struct stripe_c *sc;
  75. sector_t width;
  76. uint32_t stripes;
  77. uint32_t chunk_size;
  78. char *end;
  79. int r;
  80. unsigned int i;
  81. if (argc < 2) {
  82. ti->error = "Not enough arguments";
  83. return -EINVAL;
  84. }
  85. stripes = simple_strtoul(argv[0], &end, 10);
  86. if (*end) {
  87. ti->error = "Invalid stripe count";
  88. return -EINVAL;
  89. }
  90. chunk_size = simple_strtoul(argv[1], &end, 10);
  91. if (*end) {
  92. ti->error = "Invalid chunk_size";
  93. return -EINVAL;
  94. }
  95. /*
  96. * chunk_size is a power of two
  97. */
  98. if (!is_power_of_2(chunk_size) ||
  99. (chunk_size < (PAGE_SIZE >> SECTOR_SHIFT))) {
  100. ti->error = "Invalid chunk size";
  101. return -EINVAL;
  102. }
  103. if (ti->len & (chunk_size - 1)) {
  104. ti->error = "Target length not divisible by "
  105. "chunk size";
  106. return -EINVAL;
  107. }
  108. width = ti->len;
  109. if (sector_div(width, stripes)) {
  110. ti->error = "Target length not divisible by "
  111. "number of stripes";
  112. return -EINVAL;
  113. }
  114. /*
  115. * Do we have enough arguments for that many stripes ?
  116. */
  117. if (argc != (2 + 2 * stripes)) {
  118. ti->error = "Not enough destinations "
  119. "specified";
  120. return -EINVAL;
  121. }
  122. sc = alloc_context(stripes);
  123. if (!sc) {
  124. ti->error = "Memory allocation for striped context "
  125. "failed";
  126. return -ENOMEM;
  127. }
  128. INIT_WORK(&sc->kstriped_ws, trigger_event);
  129. /* Set pointer to dm target; used in trigger_event */
  130. sc->ti = ti;
  131. sc->stripes = stripes;
  132. sc->stripe_width = width;
  133. ti->split_io = chunk_size;
  134. sc->chunk_mask = ((sector_t) chunk_size) - 1;
  135. for (sc->chunk_shift = 0; chunk_size; sc->chunk_shift++)
  136. chunk_size >>= 1;
  137. sc->chunk_shift--;
  138. /*
  139. * Get the stripe destinations.
  140. */
  141. for (i = 0; i < stripes; i++) {
  142. argv += 2;
  143. r = get_stripe(ti, sc, i, argv);
  144. if (r < 0) {
  145. ti->error = "Couldn't parse stripe destination";
  146. while (i--)
  147. dm_put_device(ti, sc->stripe[i].dev);
  148. kfree(sc);
  149. return r;
  150. }
  151. atomic_set(&(sc->stripe[i].error_count), 0);
  152. }
  153. ti->private = sc;
  154. return 0;
  155. }
  156. static void stripe_dtr(struct dm_target *ti)
  157. {
  158. unsigned int i;
  159. struct stripe_c *sc = (struct stripe_c *) ti->private;
  160. for (i = 0; i < sc->stripes; i++)
  161. dm_put_device(ti, sc->stripe[i].dev);
  162. flush_workqueue(kstriped);
  163. kfree(sc);
  164. }
  165. static int stripe_map(struct dm_target *ti, struct bio *bio,
  166. union map_info *map_context)
  167. {
  168. struct stripe_c *sc = (struct stripe_c *) ti->private;
  169. sector_t offset = bio->bi_sector - ti->begin;
  170. sector_t chunk = offset >> sc->chunk_shift;
  171. uint32_t stripe = sector_div(chunk, sc->stripes);
  172. bio->bi_bdev = sc->stripe[stripe].dev->bdev;
  173. bio->bi_sector = sc->stripe[stripe].physical_start +
  174. (chunk << sc->chunk_shift) + (offset & sc->chunk_mask);
  175. return DM_MAPIO_REMAPPED;
  176. }
  177. /*
  178. * Stripe status:
  179. *
  180. * INFO
  181. * #stripes [stripe_name <stripe_name>] [group word count]
  182. * [error count 'A|D' <error count 'A|D'>]
  183. *
  184. * TABLE
  185. * #stripes [stripe chunk size]
  186. * [stripe_name physical_start <stripe_name physical_start>]
  187. *
  188. */
  189. static int stripe_status(struct dm_target *ti,
  190. status_type_t type, char *result, unsigned int maxlen)
  191. {
  192. struct stripe_c *sc = (struct stripe_c *) ti->private;
  193. char buffer[sc->stripes + 1];
  194. unsigned int sz = 0;
  195. unsigned int i;
  196. switch (type) {
  197. case STATUSTYPE_INFO:
  198. DMEMIT("%d ", sc->stripes);
  199. for (i = 0; i < sc->stripes; i++) {
  200. DMEMIT("%s ", sc->stripe[i].dev->name);
  201. buffer[i] = atomic_read(&(sc->stripe[i].error_count)) ?
  202. 'D' : 'A';
  203. }
  204. buffer[i] = '\0';
  205. DMEMIT("1 %s", buffer);
  206. break;
  207. case STATUSTYPE_TABLE:
  208. DMEMIT("%d %llu", sc->stripes,
  209. (unsigned long long)sc->chunk_mask + 1);
  210. for (i = 0; i < sc->stripes; i++)
  211. DMEMIT(" %s %llu", sc->stripe[i].dev->name,
  212. (unsigned long long)sc->stripe[i].physical_start);
  213. break;
  214. }
  215. return 0;
  216. }
  217. static int stripe_end_io(struct dm_target *ti, struct bio *bio,
  218. int error, union map_info *map_context)
  219. {
  220. unsigned i;
  221. char major_minor[16];
  222. struct stripe_c *sc = ti->private;
  223. if (!error)
  224. return 0; /* I/O complete */
  225. if ((error == -EWOULDBLOCK) && bio_rw_ahead(bio))
  226. return error;
  227. if (error == -EOPNOTSUPP)
  228. return error;
  229. memset(major_minor, 0, sizeof(major_minor));
  230. sprintf(major_minor, "%d:%d",
  231. MAJOR(disk_devt(bio->bi_bdev->bd_disk)),
  232. MINOR(disk_devt(bio->bi_bdev->bd_disk)));
  233. /*
  234. * Test to see which stripe drive triggered the event
  235. * and increment error count for all stripes on that device.
  236. * If the error count for a given device exceeds the threshold
  237. * value we will no longer trigger any further events.
  238. */
  239. for (i = 0; i < sc->stripes; i++)
  240. if (!strcmp(sc->stripe[i].dev->name, major_minor)) {
  241. atomic_inc(&(sc->stripe[i].error_count));
  242. if (atomic_read(&(sc->stripe[i].error_count)) <
  243. DM_IO_ERROR_THRESHOLD)
  244. queue_work(kstriped, &sc->kstriped_ws);
  245. }
  246. return error;
  247. }
  248. static struct target_type stripe_target = {
  249. .name = "striped",
  250. .version = {1, 1, 0},
  251. .module = THIS_MODULE,
  252. .ctr = stripe_ctr,
  253. .dtr = stripe_dtr,
  254. .map = stripe_map,
  255. .end_io = stripe_end_io,
  256. .status = stripe_status,
  257. };
  258. int __init dm_stripe_init(void)
  259. {
  260. int r;
  261. r = dm_register_target(&stripe_target);
  262. if (r < 0)
  263. DMWARN("target registration failed");
  264. kstriped = create_singlethread_workqueue("kstriped");
  265. if (!kstriped) {
  266. DMERR("failed to create workqueue kstriped");
  267. dm_unregister_target(&stripe_target);
  268. return -ENOMEM;
  269. }
  270. return r;
  271. }
  272. void dm_stripe_exit(void)
  273. {
  274. if (dm_unregister_target(&stripe_target))
  275. DMWARN("target unregistration failed");
  276. destroy_workqueue(kstriped);
  277. return;
  278. }