dm-transaction-manager.c 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400
  1. /*
  2. * Copyright (C) 2011 Red Hat, Inc.
  3. *
  4. * This file is released under the GPL.
  5. */
  6. #include "dm-transaction-manager.h"
  7. #include "dm-space-map.h"
  8. #include "dm-space-map-checker.h"
  9. #include "dm-space-map-disk.h"
  10. #include "dm-space-map-metadata.h"
  11. #include "dm-persistent-data-internal.h"
  12. #include <linux/export.h>
  13. #include <linux/slab.h>
  14. #include <linux/device-mapper.h>
  15. #define DM_MSG_PREFIX "transaction manager"
  16. /*----------------------------------------------------------------*/
  17. struct shadow_info {
  18. struct hlist_node hlist;
  19. dm_block_t where;
  20. };
  21. /*
  22. * It would be nice if we scaled with the size of transaction.
  23. */
  24. #define HASH_SIZE 256
  25. #define HASH_MASK (HASH_SIZE - 1)
  26. struct dm_transaction_manager {
  27. int is_clone;
  28. struct dm_transaction_manager *real;
  29. struct dm_block_manager *bm;
  30. struct dm_space_map *sm;
  31. spinlock_t lock;
  32. struct hlist_head buckets[HASH_SIZE];
  33. };
  34. /*----------------------------------------------------------------*/
  35. static int is_shadow(struct dm_transaction_manager *tm, dm_block_t b)
  36. {
  37. int r = 0;
  38. unsigned bucket = dm_hash_block(b, HASH_MASK);
  39. struct shadow_info *si;
  40. struct hlist_node *n;
  41. spin_lock(&tm->lock);
  42. hlist_for_each_entry(si, n, tm->buckets + bucket, hlist)
  43. if (si->where == b) {
  44. r = 1;
  45. break;
  46. }
  47. spin_unlock(&tm->lock);
  48. return r;
  49. }
  50. /*
  51. * This can silently fail if there's no memory. We're ok with this since
  52. * creating redundant shadows causes no harm.
  53. */
  54. static void insert_shadow(struct dm_transaction_manager *tm, dm_block_t b)
  55. {
  56. unsigned bucket;
  57. struct shadow_info *si;
  58. si = kmalloc(sizeof(*si), GFP_NOIO);
  59. if (si) {
  60. si->where = b;
  61. bucket = dm_hash_block(b, HASH_MASK);
  62. spin_lock(&tm->lock);
  63. hlist_add_head(&si->hlist, tm->buckets + bucket);
  64. spin_unlock(&tm->lock);
  65. }
  66. }
  67. static void wipe_shadow_table(struct dm_transaction_manager *tm)
  68. {
  69. struct shadow_info *si;
  70. struct hlist_node *n, *tmp;
  71. struct hlist_head *bucket;
  72. int i;
  73. spin_lock(&tm->lock);
  74. for (i = 0; i < HASH_SIZE; i++) {
  75. bucket = tm->buckets + i;
  76. hlist_for_each_entry_safe(si, n, tmp, bucket, hlist)
  77. kfree(si);
  78. INIT_HLIST_HEAD(bucket);
  79. }
  80. spin_unlock(&tm->lock);
  81. }
  82. /*----------------------------------------------------------------*/
  83. static struct dm_transaction_manager *dm_tm_create(struct dm_block_manager *bm,
  84. struct dm_space_map *sm)
  85. {
  86. int i;
  87. struct dm_transaction_manager *tm;
  88. tm = kmalloc(sizeof(*tm), GFP_KERNEL);
  89. if (!tm)
  90. return ERR_PTR(-ENOMEM);
  91. tm->is_clone = 0;
  92. tm->real = NULL;
  93. tm->bm = bm;
  94. tm->sm = sm;
  95. spin_lock_init(&tm->lock);
  96. for (i = 0; i < HASH_SIZE; i++)
  97. INIT_HLIST_HEAD(tm->buckets + i);
  98. return tm;
  99. }
  100. struct dm_transaction_manager *dm_tm_create_non_blocking_clone(struct dm_transaction_manager *real)
  101. {
  102. struct dm_transaction_manager *tm;
  103. tm = kmalloc(sizeof(*tm), GFP_KERNEL);
  104. if (tm) {
  105. tm->is_clone = 1;
  106. tm->real = real;
  107. }
  108. return tm;
  109. }
  110. EXPORT_SYMBOL_GPL(dm_tm_create_non_blocking_clone);
  111. void dm_tm_destroy(struct dm_transaction_manager *tm)
  112. {
  113. kfree(tm);
  114. }
  115. EXPORT_SYMBOL_GPL(dm_tm_destroy);
  116. int dm_tm_pre_commit(struct dm_transaction_manager *tm)
  117. {
  118. int r;
  119. if (tm->is_clone)
  120. return -EWOULDBLOCK;
  121. r = dm_sm_commit(tm->sm);
  122. if (r < 0)
  123. return r;
  124. return 0;
  125. }
  126. EXPORT_SYMBOL_GPL(dm_tm_pre_commit);
  127. int dm_tm_commit(struct dm_transaction_manager *tm, struct dm_block *root)
  128. {
  129. if (tm->is_clone)
  130. return -EWOULDBLOCK;
  131. wipe_shadow_table(tm);
  132. return dm_bm_flush_and_unlock(tm->bm, root);
  133. }
  134. EXPORT_SYMBOL_GPL(dm_tm_commit);
  135. int dm_tm_new_block(struct dm_transaction_manager *tm,
  136. struct dm_block_validator *v,
  137. struct dm_block **result)
  138. {
  139. int r;
  140. dm_block_t new_block;
  141. if (tm->is_clone)
  142. return -EWOULDBLOCK;
  143. r = dm_sm_new_block(tm->sm, &new_block);
  144. if (r < 0)
  145. return r;
  146. r = dm_bm_write_lock_zero(tm->bm, new_block, v, result);
  147. if (r < 0) {
  148. dm_sm_dec_block(tm->sm, new_block);
  149. return r;
  150. }
  151. /*
  152. * New blocks count as shadows in that they don't need to be
  153. * shadowed again.
  154. */
  155. insert_shadow(tm, new_block);
  156. return 0;
  157. }
  158. static int __shadow_block(struct dm_transaction_manager *tm, dm_block_t orig,
  159. struct dm_block_validator *v,
  160. struct dm_block **result)
  161. {
  162. int r;
  163. dm_block_t new;
  164. struct dm_block *orig_block;
  165. r = dm_sm_new_block(tm->sm, &new);
  166. if (r < 0)
  167. return r;
  168. r = dm_sm_dec_block(tm->sm, orig);
  169. if (r < 0)
  170. return r;
  171. r = dm_bm_read_lock(tm->bm, orig, v, &orig_block);
  172. if (r < 0)
  173. return r;
  174. r = dm_bm_unlock_move(orig_block, new);
  175. if (r < 0) {
  176. dm_bm_unlock(orig_block);
  177. return r;
  178. }
  179. return dm_bm_write_lock(tm->bm, new, v, result);
  180. }
  181. int dm_tm_shadow_block(struct dm_transaction_manager *tm, dm_block_t orig,
  182. struct dm_block_validator *v, struct dm_block **result,
  183. int *inc_children)
  184. {
  185. int r;
  186. if (tm->is_clone)
  187. return -EWOULDBLOCK;
  188. r = dm_sm_count_is_more_than_one(tm->sm, orig, inc_children);
  189. if (r < 0)
  190. return r;
  191. if (is_shadow(tm, orig) && !*inc_children)
  192. return dm_bm_write_lock(tm->bm, orig, v, result);
  193. r = __shadow_block(tm, orig, v, result);
  194. if (r < 0)
  195. return r;
  196. insert_shadow(tm, dm_block_location(*result));
  197. return r;
  198. }
  199. int dm_tm_read_lock(struct dm_transaction_manager *tm, dm_block_t b,
  200. struct dm_block_validator *v,
  201. struct dm_block **blk)
  202. {
  203. if (tm->is_clone)
  204. return dm_bm_read_try_lock(tm->real->bm, b, v, blk);
  205. return dm_bm_read_lock(tm->bm, b, v, blk);
  206. }
  207. int dm_tm_unlock(struct dm_transaction_manager *tm, struct dm_block *b)
  208. {
  209. return dm_bm_unlock(b);
  210. }
  211. EXPORT_SYMBOL_GPL(dm_tm_unlock);
  212. void dm_tm_inc(struct dm_transaction_manager *tm, dm_block_t b)
  213. {
  214. /*
  215. * The non-blocking clone doesn't support this.
  216. */
  217. BUG_ON(tm->is_clone);
  218. dm_sm_inc_block(tm->sm, b);
  219. }
  220. EXPORT_SYMBOL_GPL(dm_tm_inc);
  221. void dm_tm_dec(struct dm_transaction_manager *tm, dm_block_t b)
  222. {
  223. /*
  224. * The non-blocking clone doesn't support this.
  225. */
  226. BUG_ON(tm->is_clone);
  227. dm_sm_dec_block(tm->sm, b);
  228. }
  229. EXPORT_SYMBOL_GPL(dm_tm_dec);
  230. int dm_tm_ref(struct dm_transaction_manager *tm, dm_block_t b,
  231. uint32_t *result)
  232. {
  233. if (tm->is_clone)
  234. return -EWOULDBLOCK;
  235. return dm_sm_get_count(tm->sm, b, result);
  236. }
  237. struct dm_block_manager *dm_tm_get_bm(struct dm_transaction_manager *tm)
  238. {
  239. return tm->bm;
  240. }
  241. /*----------------------------------------------------------------*/
  242. static int dm_tm_create_internal(struct dm_block_manager *bm,
  243. dm_block_t sb_location,
  244. struct dm_block_validator *sb_validator,
  245. size_t root_offset, size_t root_max_len,
  246. struct dm_transaction_manager **tm,
  247. struct dm_space_map **sm,
  248. struct dm_block **sblock,
  249. int create)
  250. {
  251. int r;
  252. struct dm_space_map *inner;
  253. inner = dm_sm_metadata_init();
  254. if (IS_ERR(inner))
  255. return PTR_ERR(inner);
  256. *tm = dm_tm_create(bm, inner);
  257. if (IS_ERR(*tm)) {
  258. dm_sm_destroy(inner);
  259. return PTR_ERR(*tm);
  260. }
  261. if (create) {
  262. r = dm_bm_write_lock_zero(dm_tm_get_bm(*tm), sb_location,
  263. sb_validator, sblock);
  264. if (r < 0) {
  265. DMERR("couldn't lock superblock");
  266. goto bad1;
  267. }
  268. r = dm_sm_metadata_create(inner, *tm, dm_bm_nr_blocks(bm),
  269. sb_location);
  270. if (r) {
  271. DMERR("couldn't create metadata space map");
  272. goto bad2;
  273. }
  274. *sm = dm_sm_checker_create(inner);
  275. if (!*sm)
  276. goto bad2;
  277. } else {
  278. r = dm_bm_write_lock(dm_tm_get_bm(*tm), sb_location,
  279. sb_validator, sblock);
  280. if (r < 0) {
  281. DMERR("couldn't lock superblock");
  282. goto bad1;
  283. }
  284. r = dm_sm_metadata_open(inner, *tm,
  285. dm_block_data(*sblock) + root_offset,
  286. root_max_len);
  287. if (r) {
  288. DMERR("couldn't open metadata space map");
  289. goto bad2;
  290. }
  291. *sm = dm_sm_checker_create(inner);
  292. if (!*sm)
  293. goto bad2;
  294. }
  295. return 0;
  296. bad2:
  297. dm_tm_unlock(*tm, *sblock);
  298. bad1:
  299. dm_tm_destroy(*tm);
  300. dm_sm_destroy(inner);
  301. return r;
  302. }
  303. int dm_tm_create_with_sm(struct dm_block_manager *bm, dm_block_t sb_location,
  304. struct dm_block_validator *sb_validator,
  305. struct dm_transaction_manager **tm,
  306. struct dm_space_map **sm, struct dm_block **sblock)
  307. {
  308. return dm_tm_create_internal(bm, sb_location, sb_validator,
  309. 0, 0, tm, sm, sblock, 1);
  310. }
  311. EXPORT_SYMBOL_GPL(dm_tm_create_with_sm);
  312. int dm_tm_open_with_sm(struct dm_block_manager *bm, dm_block_t sb_location,
  313. struct dm_block_validator *sb_validator,
  314. size_t root_offset, size_t root_max_len,
  315. struct dm_transaction_manager **tm,
  316. struct dm_space_map **sm, struct dm_block **sblock)
  317. {
  318. return dm_tm_create_internal(bm, sb_location, sb_validator, root_offset,
  319. root_max_len, tm, sm, sblock, 0);
  320. }
  321. EXPORT_SYMBOL_GPL(dm_tm_open_with_sm);
  322. /*----------------------------------------------------------------*/