dm-transaction-manager.c 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408
  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. if (!tm->is_clone)
  114. wipe_shadow_table(tm);
  115. kfree(tm);
  116. }
  117. EXPORT_SYMBOL_GPL(dm_tm_destroy);
  118. int dm_tm_pre_commit(struct dm_transaction_manager *tm)
  119. {
  120. int r;
  121. if (tm->is_clone)
  122. return -EWOULDBLOCK;
  123. r = dm_sm_commit(tm->sm);
  124. if (r < 0)
  125. return r;
  126. return 0;
  127. }
  128. EXPORT_SYMBOL_GPL(dm_tm_pre_commit);
  129. int dm_tm_commit(struct dm_transaction_manager *tm, struct dm_block *root)
  130. {
  131. if (tm->is_clone)
  132. return -EWOULDBLOCK;
  133. wipe_shadow_table(tm);
  134. return dm_bm_flush_and_unlock(tm->bm, root);
  135. }
  136. EXPORT_SYMBOL_GPL(dm_tm_commit);
  137. int dm_tm_new_block(struct dm_transaction_manager *tm,
  138. struct dm_block_validator *v,
  139. struct dm_block **result)
  140. {
  141. int r;
  142. dm_block_t new_block;
  143. if (tm->is_clone)
  144. return -EWOULDBLOCK;
  145. r = dm_sm_new_block(tm->sm, &new_block);
  146. if (r < 0)
  147. return r;
  148. r = dm_bm_write_lock_zero(tm->bm, new_block, v, result);
  149. if (r < 0) {
  150. dm_sm_dec_block(tm->sm, new_block);
  151. return r;
  152. }
  153. /*
  154. * New blocks count as shadows in that they don't need to be
  155. * shadowed again.
  156. */
  157. insert_shadow(tm, new_block);
  158. return 0;
  159. }
  160. static int __shadow_block(struct dm_transaction_manager *tm, dm_block_t orig,
  161. struct dm_block_validator *v,
  162. struct dm_block **result)
  163. {
  164. int r;
  165. dm_block_t new;
  166. struct dm_block *orig_block;
  167. r = dm_sm_new_block(tm->sm, &new);
  168. if (r < 0)
  169. return r;
  170. r = dm_sm_dec_block(tm->sm, orig);
  171. if (r < 0)
  172. return r;
  173. r = dm_bm_read_lock(tm->bm, orig, v, &orig_block);
  174. if (r < 0)
  175. return r;
  176. r = dm_bm_unlock_move(orig_block, new);
  177. if (r < 0) {
  178. dm_bm_unlock(orig_block);
  179. return r;
  180. }
  181. return dm_bm_write_lock(tm->bm, new, v, result);
  182. }
  183. int dm_tm_shadow_block(struct dm_transaction_manager *tm, dm_block_t orig,
  184. struct dm_block_validator *v, struct dm_block **result,
  185. int *inc_children)
  186. {
  187. int r;
  188. if (tm->is_clone)
  189. return -EWOULDBLOCK;
  190. r = dm_sm_count_is_more_than_one(tm->sm, orig, inc_children);
  191. if (r < 0)
  192. return r;
  193. if (is_shadow(tm, orig) && !*inc_children)
  194. return dm_bm_write_lock(tm->bm, orig, v, result);
  195. r = __shadow_block(tm, orig, v, result);
  196. if (r < 0)
  197. return r;
  198. insert_shadow(tm, dm_block_location(*result));
  199. return r;
  200. }
  201. int dm_tm_read_lock(struct dm_transaction_manager *tm, dm_block_t b,
  202. struct dm_block_validator *v,
  203. struct dm_block **blk)
  204. {
  205. if (tm->is_clone)
  206. return dm_bm_read_try_lock(tm->real->bm, b, v, blk);
  207. return dm_bm_read_lock(tm->bm, b, v, blk);
  208. }
  209. int dm_tm_unlock(struct dm_transaction_manager *tm, struct dm_block *b)
  210. {
  211. return dm_bm_unlock(b);
  212. }
  213. EXPORT_SYMBOL_GPL(dm_tm_unlock);
  214. void dm_tm_inc(struct dm_transaction_manager *tm, dm_block_t b)
  215. {
  216. /*
  217. * The non-blocking clone doesn't support this.
  218. */
  219. BUG_ON(tm->is_clone);
  220. dm_sm_inc_block(tm->sm, b);
  221. }
  222. EXPORT_SYMBOL_GPL(dm_tm_inc);
  223. void dm_tm_dec(struct dm_transaction_manager *tm, dm_block_t b)
  224. {
  225. /*
  226. * The non-blocking clone doesn't support this.
  227. */
  228. BUG_ON(tm->is_clone);
  229. dm_sm_dec_block(tm->sm, b);
  230. }
  231. EXPORT_SYMBOL_GPL(dm_tm_dec);
  232. int dm_tm_ref(struct dm_transaction_manager *tm, dm_block_t b,
  233. uint32_t *result)
  234. {
  235. if (tm->is_clone)
  236. return -EWOULDBLOCK;
  237. return dm_sm_get_count(tm->sm, b, result);
  238. }
  239. struct dm_block_manager *dm_tm_get_bm(struct dm_transaction_manager *tm)
  240. {
  241. return tm->bm;
  242. }
  243. /*----------------------------------------------------------------*/
  244. static int dm_tm_create_internal(struct dm_block_manager *bm,
  245. dm_block_t sb_location,
  246. struct dm_block_validator *sb_validator,
  247. size_t root_offset, size_t root_max_len,
  248. struct dm_transaction_manager **tm,
  249. struct dm_space_map **sm,
  250. struct dm_block **sblock,
  251. int create)
  252. {
  253. int r;
  254. struct dm_space_map *inner;
  255. inner = dm_sm_metadata_init();
  256. if (IS_ERR(inner))
  257. return PTR_ERR(inner);
  258. *tm = dm_tm_create(bm, inner);
  259. if (IS_ERR(*tm)) {
  260. dm_sm_destroy(inner);
  261. return PTR_ERR(*tm);
  262. }
  263. if (create) {
  264. r = dm_bm_write_lock_zero(dm_tm_get_bm(*tm), sb_location,
  265. sb_validator, sblock);
  266. if (r < 0) {
  267. DMERR("couldn't lock superblock");
  268. goto bad1;
  269. }
  270. r = dm_sm_metadata_create(inner, *tm, dm_bm_nr_blocks(bm),
  271. sb_location);
  272. if (r) {
  273. DMERR("couldn't create metadata space map");
  274. goto bad2;
  275. }
  276. *sm = dm_sm_checker_create(inner);
  277. if (IS_ERR(*sm)) {
  278. r = PTR_ERR(*sm);
  279. goto bad2;
  280. }
  281. } else {
  282. r = dm_bm_write_lock(dm_tm_get_bm(*tm), sb_location,
  283. sb_validator, sblock);
  284. if (r < 0) {
  285. DMERR("couldn't lock superblock");
  286. goto bad1;
  287. }
  288. r = dm_sm_metadata_open(inner, *tm,
  289. dm_block_data(*sblock) + root_offset,
  290. root_max_len);
  291. if (r) {
  292. DMERR("couldn't open metadata space map");
  293. goto bad2;
  294. }
  295. *sm = dm_sm_checker_create(inner);
  296. if (IS_ERR(*sm)) {
  297. r = PTR_ERR(*sm);
  298. goto bad2;
  299. }
  300. }
  301. return 0;
  302. bad2:
  303. dm_tm_unlock(*tm, *sblock);
  304. bad1:
  305. dm_tm_destroy(*tm);
  306. dm_sm_destroy(inner);
  307. return r;
  308. }
  309. int dm_tm_create_with_sm(struct dm_block_manager *bm, dm_block_t sb_location,
  310. struct dm_block_validator *sb_validator,
  311. struct dm_transaction_manager **tm,
  312. struct dm_space_map **sm, struct dm_block **sblock)
  313. {
  314. return dm_tm_create_internal(bm, sb_location, sb_validator,
  315. 0, 0, tm, sm, sblock, 1);
  316. }
  317. EXPORT_SYMBOL_GPL(dm_tm_create_with_sm);
  318. int dm_tm_open_with_sm(struct dm_block_manager *bm, dm_block_t sb_location,
  319. struct dm_block_validator *sb_validator,
  320. size_t root_offset, size_t root_max_len,
  321. struct dm_transaction_manager **tm,
  322. struct dm_space_map **sm, struct dm_block **sblock)
  323. {
  324. return dm_tm_create_internal(bm, sb_location, sb_validator, root_offset,
  325. root_max_len, tm, sm, sblock, 0);
  326. }
  327. EXPORT_SYMBOL_GPL(dm_tm_open_with_sm);
  328. /*----------------------------------------------------------------*/