drivers/md/persistent-data/dm-space-map-common.c

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