dm-space-map-common.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733
  1. /*
  2. * Copyright (C) 2011 Red Hat, Inc.
  3. *
  4. * This file is released under the GPL.
  5. */
  6. #include "dm-space-map-common.h"
  7. #include "dm-transaction-manager.h"
  8. #include <linux/bitops.h>
  9. #include <linux/device-mapper.h>
  10. #define DM_MSG_PREFIX "space map common"
  11. /*----------------------------------------------------------------*/
  12. /*
  13. * Index validator.
  14. */
  15. #define INDEX_CSUM_XOR 160478
  16. static void index_prepare_for_write(struct dm_block_validator *v,
  17. struct dm_block *b,
  18. size_t block_size)
  19. {
  20. struct disk_metadata_index *mi_le = dm_block_data(b);
  21. mi_le->blocknr = cpu_to_le64(dm_block_location(b));
  22. mi_le->csum = cpu_to_le32(dm_bm_checksum(&mi_le->padding,
  23. block_size - sizeof(__le32),
  24. INDEX_CSUM_XOR));
  25. }
  26. static int index_check(struct dm_block_validator *v,
  27. struct dm_block *b,
  28. size_t block_size)
  29. {
  30. struct disk_metadata_index *mi_le = dm_block_data(b);
  31. __le32 csum_disk;
  32. if (dm_block_location(b) != le64_to_cpu(mi_le->blocknr)) {
  33. DMERR_LIMIT("index_check failed: blocknr %llu != wanted %llu",
  34. le64_to_cpu(mi_le->blocknr), dm_block_location(b));
  35. return -ENOTBLK;
  36. }
  37. csum_disk = cpu_to_le32(dm_bm_checksum(&mi_le->padding,
  38. block_size - sizeof(__le32),
  39. INDEX_CSUM_XOR));
  40. if (csum_disk != mi_le->csum) {
  41. DMERR_LIMIT("index_check failed: csum %u != wanted %u",
  42. le32_to_cpu(csum_disk), le32_to_cpu(mi_le->csum));
  43. return -EILSEQ;
  44. }
  45. return 0;
  46. }
  47. static struct dm_block_validator index_validator = {
  48. .name = "index",
  49. .prepare_for_write = index_prepare_for_write,
  50. .check = index_check
  51. };
  52. /*----------------------------------------------------------------*/
  53. /*
  54. * Bitmap validator
  55. */
  56. #define BITMAP_CSUM_XOR 240779
  57. static void bitmap_prepare_for_write(struct dm_block_validator *v,
  58. struct dm_block *b,
  59. size_t block_size)
  60. {
  61. struct disk_bitmap_header *disk_header = dm_block_data(b);
  62. disk_header->blocknr = cpu_to_le64(dm_block_location(b));
  63. disk_header->csum = cpu_to_le32(dm_bm_checksum(&disk_header->not_used,
  64. block_size - sizeof(__le32),
  65. BITMAP_CSUM_XOR));
  66. }
  67. static int bitmap_check(struct dm_block_validator *v,
  68. struct dm_block *b,
  69. size_t block_size)
  70. {
  71. struct disk_bitmap_header *disk_header = dm_block_data(b);
  72. __le32 csum_disk;
  73. if (dm_block_location(b) != le64_to_cpu(disk_header->blocknr)) {
  74. DMERR_LIMIT("bitmap check failed: blocknr %llu != wanted %llu",
  75. le64_to_cpu(disk_header->blocknr), dm_block_location(b));
  76. return -ENOTBLK;
  77. }
  78. csum_disk = cpu_to_le32(dm_bm_checksum(&disk_header->not_used,
  79. block_size - sizeof(__le32),
  80. BITMAP_CSUM_XOR));
  81. if (csum_disk != disk_header->csum) {
  82. DMERR_LIMIT("bitmap check failed: csum %u != wanted %u",
  83. le32_to_cpu(csum_disk), le32_to_cpu(disk_header->csum));
  84. return -EILSEQ;
  85. }
  86. return 0;
  87. }
  88. static struct dm_block_validator dm_sm_bitmap_validator = {
  89. .name = "sm_bitmap",
  90. .prepare_for_write = bitmap_prepare_for_write,
  91. .check = bitmap_check
  92. };
  93. /*----------------------------------------------------------------*/
  94. #define ENTRIES_PER_WORD 32
  95. #define ENTRIES_SHIFT 5
  96. static void *dm_bitmap_data(struct dm_block *b)
  97. {
  98. return dm_block_data(b) + sizeof(struct disk_bitmap_header);
  99. }
  100. #define WORD_MASK_HIGH 0xAAAAAAAAAAAAAAAAULL
  101. static unsigned bitmap_word_used(void *addr, unsigned b)
  102. {
  103. __le64 *words_le = addr;
  104. __le64 *w_le = words_le + (b >> ENTRIES_SHIFT);
  105. uint64_t bits = le64_to_cpu(*w_le);
  106. uint64_t mask = (bits + WORD_MASK_HIGH + 1) & WORD_MASK_HIGH;
  107. return !(~bits & mask);
  108. }
  109. static unsigned sm_lookup_bitmap(void *addr, unsigned b)
  110. {
  111. __le64 *words_le = addr;
  112. __le64 *w_le = words_le + (b >> ENTRIES_SHIFT);
  113. unsigned hi, lo;
  114. b = (b & (ENTRIES_PER_WORD - 1)) << 1;
  115. hi = !!test_bit_le(b, (void *) w_le);
  116. lo = !!test_bit_le(b + 1, (void *) w_le);
  117. return (hi << 1) | lo;
  118. }
  119. static void sm_set_bitmap(void *addr, unsigned b, unsigned val)
  120. {
  121. __le64 *words_le = addr;
  122. __le64 *w_le = words_le + (b >> ENTRIES_SHIFT);
  123. b = (b & (ENTRIES_PER_WORD - 1)) << 1;
  124. if (val & 2)
  125. __set_bit_le(b, (void *) w_le);
  126. else
  127. __clear_bit_le(b, (void *) w_le);
  128. if (val & 1)
  129. __set_bit_le(b + 1, (void *) w_le);
  130. else
  131. __clear_bit_le(b + 1, (void *) w_le);
  132. }
  133. static int sm_find_free(void *addr, unsigned begin, unsigned end,
  134. unsigned *result)
  135. {
  136. while (begin < end) {
  137. if (!(begin & (ENTRIES_PER_WORD - 1)) &&
  138. bitmap_word_used(addr, begin)) {
  139. begin += ENTRIES_PER_WORD;
  140. continue;
  141. }
  142. if (!sm_lookup_bitmap(addr, begin)) {
  143. *result = begin;
  144. return 0;
  145. }
  146. begin++;
  147. }
  148. return -ENOSPC;
  149. }
  150. /*----------------------------------------------------------------*/
  151. static int sm_ll_init(struct ll_disk *ll, struct dm_transaction_manager *tm)
  152. {
  153. ll->tm = tm;
  154. ll->bitmap_info.tm = tm;
  155. ll->bitmap_info.levels = 1;
  156. /*
  157. * Because the new bitmap blocks are created via a shadow
  158. * operation, the old entry has already had its reference count
  159. * decremented and we don't need the btree to do any bookkeeping.
  160. */
  161. ll->bitmap_info.value_type.size = sizeof(struct disk_index_entry);
  162. ll->bitmap_info.value_type.inc = NULL;
  163. ll->bitmap_info.value_type.dec = NULL;
  164. ll->bitmap_info.value_type.equal = NULL;
  165. ll->ref_count_info.tm = tm;
  166. ll->ref_count_info.levels = 1;
  167. ll->ref_count_info.value_type.size = sizeof(uint32_t);
  168. ll->ref_count_info.value_type.inc = NULL;
  169. ll->ref_count_info.value_type.dec = NULL;
  170. ll->ref_count_info.value_type.equal = NULL;
  171. ll->block_size = dm_bm_block_size(dm_tm_get_bm(tm));
  172. if (ll->block_size > (1 << 30)) {
  173. DMERR("block size too big to hold bitmaps");
  174. return -EINVAL;
  175. }
  176. ll->entries_per_block = (ll->block_size - sizeof(struct disk_bitmap_header)) *
  177. ENTRIES_PER_BYTE;
  178. ll->nr_blocks = 0;
  179. ll->bitmap_root = 0;
  180. ll->ref_count_root = 0;
  181. ll->bitmap_index_changed = false;
  182. return 0;
  183. }
  184. int sm_ll_extend(struct ll_disk *ll, dm_block_t extra_blocks)
  185. {
  186. int r;
  187. dm_block_t i, nr_blocks, nr_indexes;
  188. unsigned old_blocks, blocks;
  189. nr_blocks = ll->nr_blocks + extra_blocks;
  190. old_blocks = dm_sector_div_up(ll->nr_blocks, ll->entries_per_block);
  191. blocks = dm_sector_div_up(nr_blocks, ll->entries_per_block);
  192. nr_indexes = dm_sector_div_up(nr_blocks, ll->entries_per_block);
  193. if (nr_indexes > ll->max_entries(ll)) {
  194. DMERR("space map too large");
  195. return -EINVAL;
  196. }
  197. for (i = old_blocks; i < blocks; i++) {
  198. struct dm_block *b;
  199. struct disk_index_entry idx;
  200. r = dm_tm_new_block(ll->tm, &dm_sm_bitmap_validator, &b);
  201. if (r < 0)
  202. return r;
  203. idx.blocknr = cpu_to_le64(dm_block_location(b));
  204. r = dm_tm_unlock(ll->tm, b);
  205. if (r < 0)
  206. return r;
  207. idx.nr_free = cpu_to_le32(ll->entries_per_block);
  208. idx.none_free_before = 0;
  209. r = ll->save_ie(ll, i, &idx);
  210. if (r < 0)
  211. return r;
  212. }
  213. ll->nr_blocks = nr_blocks;
  214. return 0;
  215. }
  216. int sm_ll_lookup_bitmap(struct ll_disk *ll, dm_block_t b, uint32_t *result)
  217. {
  218. int r;
  219. dm_block_t index = b;
  220. struct disk_index_entry ie_disk;
  221. struct dm_block *blk;
  222. b = do_div(index, ll->entries_per_block);
  223. r = ll->load_ie(ll, index, &ie_disk);
  224. if (r < 0)
  225. return r;
  226. r = dm_tm_read_lock(ll->tm, le64_to_cpu(ie_disk.blocknr),
  227. &dm_sm_bitmap_validator, &blk);
  228. if (r < 0)
  229. return r;
  230. *result = sm_lookup_bitmap(dm_bitmap_data(blk), b);
  231. return dm_tm_unlock(ll->tm, blk);
  232. }
  233. static int sm_ll_lookup_big_ref_count(struct ll_disk *ll, dm_block_t b,
  234. uint32_t *result)
  235. {
  236. __le32 le_rc;
  237. int r;
  238. r = dm_btree_lookup(&ll->ref_count_info, ll->ref_count_root, &b, &le_rc);
  239. if (r < 0)
  240. return r;
  241. *result = le32_to_cpu(le_rc);
  242. return r;
  243. }
  244. int sm_ll_lookup(struct ll_disk *ll, dm_block_t b, uint32_t *result)
  245. {
  246. int r = sm_ll_lookup_bitmap(ll, b, result);
  247. if (r)
  248. return r;
  249. if (*result != 3)
  250. return r;
  251. return sm_ll_lookup_big_ref_count(ll, b, result);
  252. }
  253. int sm_ll_find_free_block(struct ll_disk *ll, dm_block_t begin,
  254. dm_block_t end, dm_block_t *result)
  255. {
  256. int r;
  257. struct disk_index_entry ie_disk;
  258. dm_block_t i, index_begin = begin;
  259. dm_block_t index_end = dm_sector_div_up(end, ll->entries_per_block);
  260. /*
  261. * FIXME: Use shifts
  262. */
  263. begin = do_div(index_begin, ll->entries_per_block);
  264. end = do_div(end, ll->entries_per_block);
  265. for (i = index_begin; i < index_end; i++, begin = 0) {
  266. struct dm_block *blk;
  267. unsigned position;
  268. uint32_t bit_end;
  269. r = ll->load_ie(ll, i, &ie_disk);
  270. if (r < 0)
  271. return r;
  272. if (le32_to_cpu(ie_disk.nr_free) == 0)
  273. continue;
  274. r = dm_tm_read_lock(ll->tm, le64_to_cpu(ie_disk.blocknr),
  275. &dm_sm_bitmap_validator, &blk);
  276. if (r < 0)
  277. return r;
  278. bit_end = (i == index_end - 1) ? end : ll->entries_per_block;
  279. r = sm_find_free(dm_bitmap_data(blk),
  280. max_t(unsigned, begin, le32_to_cpu(ie_disk.none_free_before)),
  281. bit_end, &position);
  282. if (r == -ENOSPC) {
  283. /*
  284. * This might happen because we started searching
  285. * part way through the bitmap.
  286. */
  287. dm_tm_unlock(ll->tm, blk);
  288. continue;
  289. } else if (r < 0) {
  290. dm_tm_unlock(ll->tm, blk);
  291. return r;
  292. }
  293. r = dm_tm_unlock(ll->tm, blk);
  294. if (r < 0)
  295. return r;
  296. *result = i * ll->entries_per_block + (dm_block_t) position;
  297. return 0;
  298. }
  299. return -ENOSPC;
  300. }
  301. static int sm_ll_mutate(struct ll_disk *ll, dm_block_t b,
  302. uint32_t (*mutator)(void *context, uint32_t old),
  303. void *context, enum allocation_event *ev)
  304. {
  305. int r;
  306. uint32_t bit, old, ref_count;
  307. struct dm_block *nb;
  308. dm_block_t index = b;
  309. struct disk_index_entry ie_disk;
  310. void *bm_le;
  311. int inc;
  312. bit = do_div(index, ll->entries_per_block);
  313. r = ll->load_ie(ll, index, &ie_disk);
  314. if (r < 0)
  315. return r;
  316. r = dm_tm_shadow_block(ll->tm, le64_to_cpu(ie_disk.blocknr),
  317. &dm_sm_bitmap_validator, &nb, &inc);
  318. if (r < 0) {
  319. DMERR("dm_tm_shadow_block() failed");
  320. return r;
  321. }
  322. ie_disk.blocknr = cpu_to_le64(dm_block_location(nb));
  323. bm_le = dm_bitmap_data(nb);
  324. old = sm_lookup_bitmap(bm_le, bit);
  325. if (old > 2) {
  326. r = sm_ll_lookup_big_ref_count(ll, b, &old);
  327. if (r < 0)
  328. return r;
  329. }
  330. ref_count = mutator(context, old);
  331. if (ref_count <= 2) {
  332. sm_set_bitmap(bm_le, bit, ref_count);
  333. r = dm_tm_unlock(ll->tm, nb);
  334. if (r < 0)
  335. return r;
  336. if (old > 2) {
  337. r = dm_btree_remove(&ll->ref_count_info,
  338. ll->ref_count_root,
  339. &b, &ll->ref_count_root);
  340. if (r)
  341. return r;
  342. }
  343. } else {
  344. __le32 le_rc = cpu_to_le32(ref_count);
  345. sm_set_bitmap(bm_le, bit, 3);
  346. r = dm_tm_unlock(ll->tm, nb);
  347. if (r < 0)
  348. return r;
  349. __dm_bless_for_disk(&le_rc);
  350. r = dm_btree_insert(&ll->ref_count_info, ll->ref_count_root,
  351. &b, &le_rc, &ll->ref_count_root);
  352. if (r < 0) {
  353. DMERR("ref count insert failed");
  354. return r;
  355. }
  356. }
  357. if (ref_count && !old) {
  358. *ev = SM_ALLOC;
  359. ll->nr_allocated++;
  360. le32_add_cpu(&ie_disk.nr_free, -1);
  361. if (le32_to_cpu(ie_disk.none_free_before) == bit)
  362. ie_disk.none_free_before = cpu_to_le32(bit + 1);
  363. } else if (old && !ref_count) {
  364. *ev = SM_FREE;
  365. ll->nr_allocated--;
  366. le32_add_cpu(&ie_disk.nr_free, 1);
  367. ie_disk.none_free_before = cpu_to_le32(min(le32_to_cpu(ie_disk.none_free_before), bit));
  368. }
  369. return ll->save_ie(ll, index, &ie_disk);
  370. }
  371. static uint32_t set_ref_count(void *context, uint32_t old)
  372. {
  373. return *((uint32_t *) context);
  374. }
  375. int sm_ll_insert(struct ll_disk *ll, dm_block_t b,
  376. uint32_t ref_count, enum allocation_event *ev)
  377. {
  378. return sm_ll_mutate(ll, b, set_ref_count, &ref_count, ev);
  379. }
  380. static uint32_t inc_ref_count(void *context, uint32_t old)
  381. {
  382. return old + 1;
  383. }
  384. int sm_ll_inc(struct ll_disk *ll, dm_block_t b, enum allocation_event *ev)
  385. {
  386. return sm_ll_mutate(ll, b, inc_ref_count, NULL, ev);
  387. }
  388. static uint32_t dec_ref_count(void *context, uint32_t old)
  389. {
  390. return old - 1;
  391. }
  392. int sm_ll_dec(struct ll_disk *ll, dm_block_t b, enum allocation_event *ev)
  393. {
  394. return sm_ll_mutate(ll, b, dec_ref_count, NULL, ev);
  395. }
  396. int sm_ll_commit(struct ll_disk *ll)
  397. {
  398. int r = 0;
  399. if (ll->bitmap_index_changed) {
  400. r = ll->commit(ll);
  401. if (!r)
  402. ll->bitmap_index_changed = false;
  403. }
  404. return r;
  405. }
  406. /*----------------------------------------------------------------*/
  407. static int metadata_ll_load_ie(struct ll_disk *ll, dm_block_t index,
  408. struct disk_index_entry *ie)
  409. {
  410. memcpy(ie, ll->mi_le.index + index, sizeof(*ie));
  411. return 0;
  412. }
  413. static int metadata_ll_save_ie(struct ll_disk *ll, dm_block_t index,
  414. struct disk_index_entry *ie)
  415. {
  416. ll->bitmap_index_changed = true;
  417. memcpy(ll->mi_le.index + index, ie, sizeof(*ie));
  418. return 0;
  419. }
  420. static int metadata_ll_init_index(struct ll_disk *ll)
  421. {
  422. int r;
  423. struct dm_block *b;
  424. r = dm_tm_new_block(ll->tm, &index_validator, &b);
  425. if (r < 0)
  426. return r;
  427. memcpy(dm_block_data(b), &ll->mi_le, sizeof(ll->mi_le));
  428. ll->bitmap_root = dm_block_location(b);
  429. return dm_tm_unlock(ll->tm, b);
  430. }
  431. static int metadata_ll_open(struct ll_disk *ll)
  432. {
  433. int r;
  434. struct dm_block *block;
  435. r = dm_tm_read_lock(ll->tm, ll->bitmap_root,
  436. &index_validator, &block);
  437. if (r)
  438. return r;
  439. memcpy(&ll->mi_le, dm_block_data(block), sizeof(ll->mi_le));
  440. return dm_tm_unlock(ll->tm, block);
  441. }
  442. static dm_block_t metadata_ll_max_entries(struct ll_disk *ll)
  443. {
  444. return MAX_METADATA_BITMAPS;
  445. }
  446. static int metadata_ll_commit(struct ll_disk *ll)
  447. {
  448. int r, inc;
  449. struct dm_block *b;
  450. r = dm_tm_shadow_block(ll->tm, ll->bitmap_root, &index_validator, &b, &inc);
  451. if (r)
  452. return r;
  453. memcpy(dm_block_data(b), &ll->mi_le, sizeof(ll->mi_le));
  454. ll->bitmap_root = dm_block_location(b);
  455. return dm_tm_unlock(ll->tm, b);
  456. }
  457. int sm_ll_new_metadata(struct ll_disk *ll, struct dm_transaction_manager *tm)
  458. {
  459. int r;
  460. r = sm_ll_init(ll, tm);
  461. if (r < 0)
  462. return r;
  463. ll->load_ie = metadata_ll_load_ie;
  464. ll->save_ie = metadata_ll_save_ie;
  465. ll->init_index = metadata_ll_init_index;
  466. ll->open_index = metadata_ll_open;
  467. ll->max_entries = metadata_ll_max_entries;
  468. ll->commit = metadata_ll_commit;
  469. ll->nr_blocks = 0;
  470. ll->nr_allocated = 0;
  471. r = ll->init_index(ll);
  472. if (r < 0)
  473. return r;
  474. r = dm_btree_empty(&ll->ref_count_info, &ll->ref_count_root);
  475. if (r < 0)
  476. return r;
  477. return 0;
  478. }
  479. int sm_ll_open_metadata(struct ll_disk *ll, struct dm_transaction_manager *tm,
  480. void *root_le, size_t len)
  481. {
  482. int r;
  483. struct disk_sm_root *smr = root_le;
  484. if (len < sizeof(struct disk_sm_root)) {
  485. DMERR("sm_metadata root too small");
  486. return -ENOMEM;
  487. }
  488. r = sm_ll_init(ll, tm);
  489. if (r < 0)
  490. return r;
  491. ll->load_ie = metadata_ll_load_ie;
  492. ll->save_ie = metadata_ll_save_ie;
  493. ll->init_index = metadata_ll_init_index;
  494. ll->open_index = metadata_ll_open;
  495. ll->max_entries = metadata_ll_max_entries;
  496. ll->commit = metadata_ll_commit;
  497. ll->nr_blocks = le64_to_cpu(smr->nr_blocks);
  498. ll->nr_allocated = le64_to_cpu(smr->nr_allocated);
  499. ll->bitmap_root = le64_to_cpu(smr->bitmap_root);
  500. ll->ref_count_root = le64_to_cpu(smr->ref_count_root);
  501. return ll->open_index(ll);
  502. }
  503. /*----------------------------------------------------------------*/
  504. static int disk_ll_load_ie(struct ll_disk *ll, dm_block_t index,
  505. struct disk_index_entry *ie)
  506. {
  507. return dm_btree_lookup(&ll->bitmap_info, ll->bitmap_root, &index, ie);
  508. }
  509. static int disk_ll_save_ie(struct ll_disk *ll, dm_block_t index,
  510. struct disk_index_entry *ie)
  511. {
  512. __dm_bless_for_disk(ie);
  513. return dm_btree_insert(&ll->bitmap_info, ll->bitmap_root,
  514. &index, ie, &ll->bitmap_root);
  515. }
  516. static int disk_ll_init_index(struct ll_disk *ll)
  517. {
  518. return dm_btree_empty(&ll->bitmap_info, &ll->bitmap_root);
  519. }
  520. static int disk_ll_open(struct ll_disk *ll)
  521. {
  522. /* nothing to do */
  523. return 0;
  524. }
  525. static dm_block_t disk_ll_max_entries(struct ll_disk *ll)
  526. {
  527. return -1ULL;
  528. }
  529. static int disk_ll_commit(struct ll_disk *ll)
  530. {
  531. return 0;
  532. }
  533. int sm_ll_new_disk(struct ll_disk *ll, struct dm_transaction_manager *tm)
  534. {
  535. int r;
  536. r = sm_ll_init(ll, tm);
  537. if (r < 0)
  538. return r;
  539. ll->load_ie = disk_ll_load_ie;
  540. ll->save_ie = disk_ll_save_ie;
  541. ll->init_index = disk_ll_init_index;
  542. ll->open_index = disk_ll_open;
  543. ll->max_entries = disk_ll_max_entries;
  544. ll->commit = disk_ll_commit;
  545. ll->nr_blocks = 0;
  546. ll->nr_allocated = 0;
  547. r = ll->init_index(ll);
  548. if (r < 0)
  549. return r;
  550. r = dm_btree_empty(&ll->ref_count_info, &ll->ref_count_root);
  551. if (r < 0)
  552. return r;
  553. return 0;
  554. }
  555. int sm_ll_open_disk(struct ll_disk *ll, struct dm_transaction_manager *tm,
  556. void *root_le, size_t len)
  557. {
  558. int r;
  559. struct disk_sm_root *smr = root_le;
  560. if (len < sizeof(struct disk_sm_root)) {
  561. DMERR("sm_metadata root too small");
  562. return -ENOMEM;
  563. }
  564. r = sm_ll_init(ll, tm);
  565. if (r < 0)
  566. return r;
  567. ll->load_ie = disk_ll_load_ie;
  568. ll->save_ie = disk_ll_save_ie;
  569. ll->init_index = disk_ll_init_index;
  570. ll->open_index = disk_ll_open;
  571. ll->max_entries = disk_ll_max_entries;
  572. ll->commit = disk_ll_commit;
  573. ll->nr_blocks = le64_to_cpu(smr->nr_blocks);
  574. ll->nr_allocated = le64_to_cpu(smr->nr_allocated);
  575. ll->bitmap_root = le64_to_cpu(smr->bitmap_root);
  576. ll->ref_count_root = le64_to_cpu(smr->ref_count_root);
  577. return ll->open_index(ll);
  578. }
  579. /*----------------------------------------------------------------*/