btrfs-convert.c

   1 /*
   2  * Copyright (C) 2007 Oracle.  All rights reserved.
   3  *
   4  * This program is free software; you can redistribute it and/or
   5  * modify it under the terms of the GNU General Public
   6  * License v2 as published by the Free Software Foundation.
   7  *
   8  * This program is distributed in the hope that it will be useful,
   9  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  10  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  11  * General Public License for more details.
  12  *
  13  * You should have received a copy of the GNU General Public
  14  * License along with this program; if not, write to the
  15  * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  16  * Boston, MA 021110-1307, USA.
  17  */
  18
  19 #include "kerncompat.h"
  20
  21 #include <sys/ioctl.h>
  22 #include <sys/mount.h>
  23 #include <stdio.h>
  24 #include <stdlib.h>
  25 #include <sys/types.h>
  26 #include <sys/stat.h>
  27 #include <fcntl.h>
  28 #include <unistd.h>
  29 #include <uuid/uuid.h>
  30 #include <linux/limits.h>
  31 #include <getopt.h>
  32
  33 #include "ctree.h"
  34 #include "disk-io.h"
  35 #include "volumes.h"
  36 #include "transaction.h"
  37 #include "crc32c.h"
  38 #include "utils.h"
  39 #include "task-utils.h"
  40
  41 #if BTRFSCONVERT_EXT2
  42 #include <ext2fs/ext2_fs.h>
  43 #include <ext2fs/ext2fs.h>
  44 #include <ext2fs/ext2_ext_attr.h>
  45
  46 #define INO_OFFSET (BTRFS_FIRST_FREE_OBJECTID - EXT2_ROOT_INO)
  47
  48 /*
  49  * Compatibility code for e2fsprogs 1.41 which doesn't support RO compat flag
  50  * BIGALLOC.
  51  * Unlike normal RO compat flag, BIGALLOC affects how e2fsprogs check used
  52  * space, and btrfs-convert heavily relies on it.
  53  */
  54 #ifdef HAVE_OLD_E2FSPROGS
  55 #define EXT2FS_CLUSTER_RATIO(fs)        (1)
  56 #define EXT2_CLUSTERS_PER_GROUP(s)      (EXT2_BLOCKS_PER_GROUP(s))
  57 #define EXT2FS_B2C(fs, blk)             (blk)
  58 #endif
  59
  60 #endif
  61
  62 #define CONV_IMAGE_SUBVOL_OBJECTID BTRFS_FIRST_FREE_OBJECTID
  63
  64 struct task_ctx {
  65         uint32_t max_copy_inodes;
  66         uint32_t cur_copy_inodes;
  67         struct task_info *info;
  68 };
  69
  70 static void *print_copied_inodes(void *p)
  71 {
  72         struct task_ctx *priv = p;
  73         const char work_indicator[] = { '.', 'o', 'O', 'o' };
  74         uint32_t count = 0;
  75
  76         task_period_start(priv->info, 1000 /* 1s */);
  77         while (1) {
  78                 count++;
  79                 printf("copy inodes [%c] [%10d/%10d]\r",
  80                        work_indicator[count % 4], priv->cur_copy_inodes,
  81                        priv->max_copy_inodes);
  82                 fflush(stdout);
  83                 task_period_wait(priv->info);
  84         }
  85
  86         return NULL;
  87 }
  88
  89 static int after_copied_inodes(void *p)
  90 {
  91         printf("\n");
  92         fflush(stdout);
  93
  94         return 0;
  95 }
  96
  97 struct btrfs_convert_context;
  98 struct btrfs_convert_operations {
  99         const char *name;
 100         int (*open_fs)(struct btrfs_convert_context *cctx, const char *devname);
 101         int (*read_used_space)(struct btrfs_convert_context *cctx);
 102         int (*copy_inodes)(struct btrfs_convert_context *cctx,
 103                          struct btrfs_root *root, int datacsum,
 104                          int packing, int noxattr, struct task_ctx *p);
 105         void (*close_fs)(struct btrfs_convert_context *cctx);
 106         int (*check_state)(struct btrfs_convert_context *cctx);
 107 };
 108
 109 static void init_convert_context(struct btrfs_convert_context *cctx)
 110 {
 111         cache_tree_init(&cctx->used);
 112         cache_tree_init(&cctx->data_chunks);
 113         cache_tree_init(&cctx->free);
 114 }
 115
 116 static void clean_convert_context(struct btrfs_convert_context *cctx)
 117 {
 118         free_extent_cache_tree(&cctx->used);
 119         free_extent_cache_tree(&cctx->data_chunks);
 120         free_extent_cache_tree(&cctx->free);
 121 }
 122
 123 static inline int copy_inodes(struct btrfs_convert_context *cctx,
 124                               struct btrfs_root *root, int datacsum,
 125                               int packing, int noxattr, struct task_ctx *p)
 126 {
 127         return cctx->convert_ops->copy_inodes(cctx, root, datacsum, packing,
 128                                              noxattr, p);
 129 }
 130
 131 static inline void convert_close_fs(struct btrfs_convert_context *cctx)
 132 {
 133         cctx->convert_ops->close_fs(cctx);
 134 }
 135
 136 static inline int convert_check_state(struct btrfs_convert_context *cctx)
 137 {
 138         return cctx->convert_ops->check_state(cctx);
 139 }
 140
 141 static int intersect_with_sb(u64 bytenr, u64 num_bytes)
 142 {
 143         int i;
 144         u64 offset;
 145
 146         for (i = 0; i < BTRFS_SUPER_MIRROR_MAX; i++) {
 147                 offset = btrfs_sb_offset(i);
 148                 offset &= ~((u64)BTRFS_STRIPE_LEN - 1);
 149
 150                 if (bytenr < offset + BTRFS_STRIPE_LEN &&
 151                     bytenr + num_bytes > offset)
 152                         return 1;
 153         }
 154         return 0;
 155 }
 156
 157 static int convert_insert_dirent(struct btrfs_trans_handle *trans,
 158                                  struct btrfs_root *root,
 159                                  const char *name, size_t name_len,
 160                                  u64 dir, u64 objectid,
 161                                  u8 file_type, u64 index_cnt,
 162                                  struct btrfs_inode_item *inode)
 163 {
 164         int ret;
 165         u64 inode_size;
 166         struct btrfs_key location = {
 167                 .objectid = objectid,
 168                 .offset = 0,
 169                 .type = BTRFS_INODE_ITEM_KEY,
 170         };
 171
 172         ret = btrfs_insert_dir_item(trans, root, name, name_len,
 173                                     dir, &location, file_type, index_cnt);
 174         if (ret)
 175                 return ret;
 176         ret = btrfs_insert_inode_ref(trans, root, name, name_len,
 177                                      objectid, dir, index_cnt);
 178         if (ret)
 179                 return ret;
 180         inode_size = btrfs_stack_inode_size(inode) + name_len * 2;
 181         btrfs_set_stack_inode_size(inode, inode_size);
 182
 183         return 0;
 184 }
 185
 186 static int read_disk_extent(struct btrfs_root *root, u64 bytenr,
 187                             u32 num_bytes, char *buffer)
 188 {
 189         int ret;
 190         struct btrfs_fs_devices *fs_devs = root->fs_info->fs_devices;
 191
 192         ret = pread(fs_devs->latest_bdev, buffer, num_bytes, bytenr);
 193         if (ret != num_bytes)
 194                 goto fail;
 195         ret = 0;
 196 fail:
 197         if (ret > 0)
 198                 ret = -1;
 199         return ret;
 200 }
 201
 202 static int csum_disk_extent(struct btrfs_trans_handle *trans,
 203                             struct btrfs_root *root,
 204                             u64 disk_bytenr, u64 num_bytes)
 205 {
 206         u32 blocksize = root->sectorsize;
 207         u64 offset;
 208         char *buffer;
 209         int ret = 0;
 210
 211         buffer = malloc(blocksize);
 212         if (!buffer)
 213                 return -ENOMEM;
 214         for (offset = 0; offset < num_bytes; offset += blocksize) {
 215                 ret = read_disk_extent(root, disk_bytenr + offset,
 216                                         blocksize, buffer);
 217                 if (ret)
 218                         break;
 219                 ret = btrfs_csum_file_block(trans,
 220                                             root->fs_info->csum_root,
 221                                             disk_bytenr + num_bytes,
 222                                             disk_bytenr + offset,
 223                                             buffer, blocksize);
 224                 if (ret)
 225                         break;
 226         }
 227         free(buffer);
 228         return ret;
 229 }
 230
 231 struct blk_iterate_data {
 232         struct btrfs_trans_handle *trans;
 233         struct btrfs_root *root;
 234         struct btrfs_root *convert_root;
 235         struct btrfs_inode_item *inode;
 236         u64 convert_ino;
 237         u64 objectid;
 238         u64 first_block;
 239         u64 disk_block;
 240         u64 num_blocks;
 241         u64 boundary;
 242         int checksum;
 243         int errcode;
 244 };
 245
 246 static void init_blk_iterate_data(struct blk_iterate_data *data,
 247                                   struct btrfs_trans_handle *trans,
 248                                   struct btrfs_root *root,
 249                                   struct btrfs_inode_item *inode,
 250                                   u64 objectid, int checksum)
 251 {
 252         struct btrfs_key key;
 253
 254         data->trans             = trans;
 255         data->root              = root;
 256         data->inode             = inode;
 257         data->objectid          = objectid;
 258         data->first_block       = 0;
 259         data->disk_block        = 0;
 260         data->num_blocks        = 0;
 261         data->boundary          = (u64)-1;
 262         data->checksum          = checksum;
 263         data->errcode           = 0;
 264
 265         key.objectid = CONV_IMAGE_SUBVOL_OBJECTID;
 266         key.type = BTRFS_ROOT_ITEM_KEY;
 267         key.offset = (u64)-1;
 268         data->convert_root = btrfs_read_fs_root(root->fs_info, &key);
 269         /* Impossible as we just opened it before */
 270         BUG_ON(!data->convert_root || IS_ERR(data->convert_root));
 271         data->convert_ino = BTRFS_FIRST_FREE_OBJECTID + 1;
 272 }
 273
 274 /*
 275  * Record a file extent in original filesystem into btrfs one.
 276  * The special point is, old disk_block can point to a reserved range.
 277  * So here, we don't use disk_block directly but search convert_root
 278  * to get the real disk_bytenr.
 279  */
 280 static int record_file_blocks(struct blk_iterate_data *data,
 281                               u64 file_block, u64 disk_block, u64 num_blocks)
 282 {
 283         int ret = 0;
 284         struct btrfs_root *root = data->root;
 285         struct btrfs_root *convert_root = data->convert_root;
 286         struct btrfs_path path;
 287         u64 file_pos = file_block * root->sectorsize;
 288         u64 old_disk_bytenr = disk_block * root->sectorsize;
 289         u64 num_bytes = num_blocks * root->sectorsize;
 290         u64 cur_off = old_disk_bytenr;
 291
 292         /* Hole, pass it to record_file_extent directly */
 293         if (old_disk_bytenr == 0)
 294                 return btrfs_record_file_extent(data->trans, root,
 295                                 data->objectid, data->inode, file_pos, 0,
 296                                 num_bytes);
 297
 298         btrfs_init_path(&path);
 299
 300         /*
 301          * Search real disk bytenr from convert root
 302          */
 303         while (cur_off < old_disk_bytenr + num_bytes) {
 304                 struct btrfs_key key;
 305                 struct btrfs_file_extent_item *fi;
 306                 struct extent_buffer *node;
 307                 int slot;
 308                 u64 extent_disk_bytenr;
 309                 u64 extent_num_bytes;
 310                 u64 real_disk_bytenr;
 311                 u64 cur_len;
 312
 313                 key.objectid = data->convert_ino;
 314                 key.type = BTRFS_EXTENT_DATA_KEY;
 315                 key.offset = cur_off;
 316
 317                 ret = btrfs_search_slot(NULL, convert_root, &key, &path, 0, 0);
 318                 if (ret < 0)
 319                         break;
 320                 if (ret > 0) {
 321                         ret = btrfs_previous_item(convert_root, &path,
 322                                                   data->convert_ino,
 323                                                   BTRFS_EXTENT_DATA_KEY);
 324                         if (ret < 0)
 325                                 break;
 326                         if (ret > 0) {
 327                                 ret = -ENOENT;
 328                                 break;
 329                         }
 330                 }
 331                 node = path.nodes[0];
 332                 slot = path.slots[0];
 333                 btrfs_item_key_to_cpu(node, &key, slot);
 334                 BUG_ON(key.type != BTRFS_EXTENT_DATA_KEY ||
 335                        key.objectid != data->convert_ino ||
 336                        key.offset > cur_off);
 337                 fi = btrfs_item_ptr(node, slot, struct btrfs_file_extent_item);
 338                 extent_disk_bytenr = btrfs_file_extent_disk_bytenr(node, fi);
 339                 extent_num_bytes = btrfs_file_extent_disk_num_bytes(node, fi);
 340                 BUG_ON(cur_off - key.offset >= extent_num_bytes);
 341                 btrfs_release_path(&path);
 342
 343                 if (extent_disk_bytenr)
 344                         real_disk_bytenr = cur_off - key.offset +
 345                                            extent_disk_bytenr;
 346                 else
 347                         real_disk_bytenr = 0;
 348                 cur_len = min(key.offset + extent_num_bytes,
 349                               old_disk_bytenr + num_bytes) - cur_off;
 350                 ret = btrfs_record_file_extent(data->trans, data->root,
 351                                         data->objectid, data->inode, file_pos,
 352                                         real_disk_bytenr, cur_len);
 353                 if (ret < 0)
 354                         break;
 355                 cur_off += cur_len;
 356                 file_pos += cur_len;
 357
 358                 /*
 359                  * No need to care about csum
 360                  * As every byte of old fs image is calculated for csum, no
 361                  * need to waste CPU cycles now.
 362                  */
 363         }
 364         btrfs_release_path(&path);
 365         return ret;
 366 }
 367
 368 static int block_iterate_proc(u64 disk_block, u64 file_block,
 369                               struct blk_iterate_data *idata)
 370 {
 371         int ret = 0;
 372         int sb_region;
 373         int do_barrier;
 374         struct btrfs_root *root = idata->root;
 375         struct btrfs_block_group_cache *cache;
 376         u64 bytenr = disk_block * root->sectorsize;
 377
 378         sb_region = intersect_with_sb(bytenr, root->sectorsize);
 379         do_barrier = sb_region || disk_block >= idata->boundary;
 380         if ((idata->num_blocks > 0 && do_barrier) ||
 381             (file_block > idata->first_block + idata->num_blocks) ||
 382             (disk_block != idata->disk_block + idata->num_blocks)) {
 383                 if (idata->num_blocks > 0) {
 384                         ret = record_file_blocks(idata, idata->first_block,
 385                                                  idata->disk_block,
 386                                                  idata->num_blocks);
 387                         if (ret)
 388                                 goto fail;
 389                         idata->first_block += idata->num_blocks;
 390                         idata->num_blocks = 0;
 391                 }
 392                 if (file_block > idata->first_block) {
 393                         ret = record_file_blocks(idata, idata->first_block,
 394                                         0, file_block - idata->first_block);
 395                         if (ret)
 396                                 goto fail;
 397                 }
 398
 399                 if (sb_region) {
 400                         bytenr += BTRFS_STRIPE_LEN - 1;
 401                         bytenr &= ~((u64)BTRFS_STRIPE_LEN - 1);
 402                 } else {
 403                         cache = btrfs_lookup_block_group(root->fs_info, bytenr);
 404                         BUG_ON(!cache);
 405                         bytenr = cache->key.objectid + cache->key.offset;
 406                 }
 407
 408                 idata->first_block = file_block;
 409                 idata->disk_block = disk_block;
 410                 idata->boundary = bytenr / root->sectorsize;
 411         }
 412         idata->num_blocks++;
 413 fail:
 414         return ret;
 415 }
 416
 417 static int create_image_file_range(struct btrfs_trans_handle *trans,
 418                                       struct btrfs_root *root,
 419                                       struct cache_tree *used,
 420                                       struct btrfs_inode_item *inode,
 421                                       u64 ino, u64 bytenr, u64 *ret_len,
 422                                       int datacsum)
 423 {
 424         struct cache_extent *cache;
 425         struct btrfs_block_group_cache *bg_cache;
 426         u64 len = *ret_len;
 427         u64 disk_bytenr;
 428         int i;
 429         int ret;
 430
 431         if (bytenr != round_down(bytenr, root->sectorsize)) {
 432                 error("bytenr not sectorsize aligned: %llu",
 433                                 (unsigned long long)bytenr);
 434                 return -EINVAL;
 435         }
 436         if (len != round_down(len, root->sectorsize)) {
 437                 error("length not sectorsize aligned: %llu",
 438                                 (unsigned long long)len);
 439                 return -EINVAL;
 440         }
 441         len = min_t(u64, len, BTRFS_MAX_EXTENT_SIZE);
 442
 443         /*
 444          * Skip sb ranges first
 445          * [0, 1M), [sb_offset(1), +64K), [sb_offset(2), +64K].
 446          *
 447          * Or we will insert a hole into current image file, and later
 448          * migrate block will fail as there is already a file extent.
 449          */
 450         if (bytenr < 1024 * 1024) {
 451                 *ret_len = 1024 * 1024 - bytenr;
 452                 return 0;
 453         }
 454         for (i = 1; i < BTRFS_SUPER_MIRROR_MAX; i++) {
 455                 u64 cur = btrfs_sb_offset(i);
 456
 457                 if (bytenr >= cur && bytenr < cur + BTRFS_STRIPE_LEN) {
 458                         *ret_len = cur + BTRFS_STRIPE_LEN - bytenr;
 459                         return 0;
 460                 }
 461         }
 462         for (i = 1; i < BTRFS_SUPER_MIRROR_MAX; i++) {
 463                 u64 cur = btrfs_sb_offset(i);
 464
 465                 /*
 466                  *      |--reserved--|
 467                  * |----range-------|
 468                  * May still need to go through file extent inserts
 469                  */
 470                 if (bytenr < cur && bytenr + len >= cur) {
 471                         len = min_t(u64, len, cur - bytenr);
 472                         break;
 473                 }
 474                 /*
 475                  * |--reserved--|
 476                  *      |---range---|
 477                  * Drop out, no need to insert anything
 478                  */
 479                 if (bytenr >= cur && bytenr < cur + BTRFS_STRIPE_LEN) {
 480                         *ret_len = cur + BTRFS_STRIPE_LEN - bytenr;
 481                         return 0;
 482                 }
 483         }
 484
 485         cache = search_cache_extent(used, bytenr);
 486         if (cache) {
 487                 if (cache->start <= bytenr) {
 488                         /*
 489                          * |///////Used///////|
 490                          *      |<--insert--->|
 491                          *      bytenr
 492                          */
 493                         len = min_t(u64, len, cache->start + cache->size -
 494                                     bytenr);
 495                         disk_bytenr = bytenr;
 496                 } else {
 497                         /*
 498                          *              |//Used//|
 499                          *  |<-insert-->|
 500                          *  bytenr
 501                          */
 502                         len = min(len, cache->start - bytenr);
 503                         disk_bytenr = 0;
 504                         datacsum = 0;
 505                 }
 506         } else {
 507                 /*
 508                  * |//Used//|           |EOF
 509                  *          |<-insert-->|
 510                  *          bytenr
 511                  */
 512                 disk_bytenr = 0;
 513                 datacsum = 0;
 514         }
 515
 516         if (disk_bytenr) {
 517                 /* Check if the range is in a data block group */
 518                 bg_cache = btrfs_lookup_block_group(root->fs_info, bytenr);
 519                 if (!bg_cache)
 520                         return -ENOENT;
 521                 if (!(bg_cache->flags & BTRFS_BLOCK_GROUP_DATA))
 522                         return -EINVAL;
 523
 524                 /* The extent should never cross block group boundary */
 525                 len = min_t(u64, len, bg_cache->key.objectid +
 526                             bg_cache->key.offset - bytenr);
 527         }
 528
 529         if (len != round_down(len, root->sectorsize)) {
 530                 error("remaining length not sectorsize aligned: %llu",
 531                                 (unsigned long long)len);
 532                 return -EINVAL;
 533         }
 534         ret = btrfs_record_file_extent(trans, root, ino, inode, bytenr,
 535                                        disk_bytenr, len);
 536         if (ret < 0)
 537                 return ret;
 538
 539         if (datacsum)
 540                 ret = csum_disk_extent(trans, root, bytenr, len);
 541         *ret_len = len;
 542         return ret;
 543 }
 544
 545 /*
 546  * Relocate old fs data in one reserved ranges
 547  *
 548  * Since all old fs data in reserved range is not covered by any chunk nor
 549  * data extent, we don't need to handle any reference but add new
 550  * extent/reference, which makes codes more clear
 551  */
 552 static int migrate_one_reserved_range(struct btrfs_trans_handle *trans,
 553                                       struct btrfs_root *root,
 554                                       struct cache_tree *used,
 555                                       struct btrfs_inode_item *inode, int fd,
 556                                       u64 ino, u64 start, u64 len, int datacsum)
 557 {
 558         u64 cur_off = start;
 559         u64 cur_len = len;
 560         u64 hole_start = start;
 561         u64 hole_len;
 562         struct cache_extent *cache;
 563         struct btrfs_key key;
 564         struct extent_buffer *eb;
 565         int ret = 0;
 566
 567         while (cur_off < start + len) {
 568                 cache = lookup_cache_extent(used, cur_off, cur_len);
 569                 if (!cache)
 570                         break;
 571                 cur_off = max(cache->start, cur_off);
 572                 cur_len = min(cache->start + cache->size, start + len) -
 573                           cur_off;
 574                 BUG_ON(cur_len < root->sectorsize);
 575
 576                 /* reserve extent for the data */
 577                 ret = btrfs_reserve_extent(trans, root, cur_len, 0, 0, (u64)-1,
 578                                            &key, 1);
 579                 if (ret < 0)
 580                         break;
 581
 582                 eb = malloc(sizeof(*eb) + cur_len);
 583                 if (!eb) {
 584                         ret = -ENOMEM;
 585                         break;
 586                 }
 587
 588                 ret = pread(fd, eb->data, cur_len, cur_off);
 589                 if (ret < cur_len) {
 590                         ret = (ret < 0 ? ret : -EIO);
 591                         free(eb);
 592                         break;
 593                 }
 594                 eb->start = key.objectid;
 595                 eb->len = key.offset;
 596
 597                 /* Write the data */
 598                 ret = write_and_map_eb(trans, root, eb);
 599                 free(eb);
 600                 if (ret < 0)
 601                         break;
 602
 603                 /* Now handle extent item and file extent things */
 604                 ret = btrfs_record_file_extent(trans, root, ino, inode, cur_off,
 605                                                key.objectid, key.offset);
 606                 if (ret < 0)
 607                         break;
 608                 /* Finally, insert csum items */
 609                 if (datacsum)
 610                         ret = csum_disk_extent(trans, root, key.objectid,
 611                                                key.offset);
 612
 613                 /* Don't forget to insert hole */
 614                 hole_len = cur_off - hole_start;
 615                 if (hole_len) {
 616                         ret = btrfs_record_file_extent(trans, root, ino, inode,
 617                                         hole_start, 0, hole_len);
 618                         if (ret < 0)
 619                                 break;
 620                 }
 621
 622                 cur_off += key.offset;
 623                 hole_start = cur_off;
 624                 cur_len = start + len - cur_off;
 625         }
 626         /* Last hole */
 627         if (start + len - hole_start > 0)
 628                 ret = btrfs_record_file_extent(trans, root, ino, inode,
 629                                 hole_start, 0, start + len - hole_start);
 630         return ret;
 631 }
 632
 633 /*
 634  * Relocate the used ext2 data in reserved ranges
 635  * [0,1M)
 636  * [btrfs_sb_offset(1), +BTRFS_STRIPE_LEN)
 637  * [btrfs_sb_offset(2), +BTRFS_STRIPE_LEN)
 638  */
 639 static int migrate_reserved_ranges(struct btrfs_trans_handle *trans,
 640                                    struct btrfs_root *root,
 641                                    struct cache_tree *used,
 642                                    struct btrfs_inode_item *inode, int fd,
 643                                    u64 ino, u64 total_bytes, int datacsum)
 644 {
 645         u64 cur_off;
 646         u64 cur_len;
 647         int ret = 0;
 648
 649         /* 0 ~ 1M */
 650         cur_off = 0;
 651         cur_len = 1024 * 1024;
 652         ret = migrate_one_reserved_range(trans, root, used, inode, fd, ino,
 653                                          cur_off, cur_len, datacsum);
 654         if (ret < 0)
 655                 return ret;
 656
 657         /* second sb(fisrt sb is included in 0~1M) */
 658         cur_off = btrfs_sb_offset(1);
 659         cur_len = min(total_bytes, cur_off + BTRFS_STRIPE_LEN) - cur_off;
 660         if (cur_off > total_bytes)
 661                 return ret;
 662         ret = migrate_one_reserved_range(trans, root, used, inode, fd, ino,
 663                                          cur_off, cur_len, datacsum);
 664         if (ret < 0)
 665                 return ret;
 666
 667         /* Last sb */
 668         cur_off = btrfs_sb_offset(2);
 669         cur_len = min(total_bytes, cur_off + BTRFS_STRIPE_LEN) - cur_off;
 670         if (cur_off > total_bytes)
 671                 return ret;
 672         ret = migrate_one_reserved_range(trans, root, used, inode, fd, ino,
 673                                          cur_off, cur_len, datacsum);
 674         return ret;
 675 }
 676
 677 /*
 678  * Helper for expand and merge extent_cache for wipe_one_reserved_range() to
 679  * handle wiping a range that exists in cache.
 680  */
 681 static int _expand_extent_cache(struct cache_tree *tree,
 682                                 struct cache_extent *entry,
 683                                 u64 min_stripe_size, int backward)
 684 {
 685         struct cache_extent *ce;
 686         int diff;
 687
 688         if (entry->size >= min_stripe_size)
 689                 return 0;
 690         diff = min_stripe_size - entry->size;
 691
 692         if (backward) {
 693                 ce = prev_cache_extent(entry);
 694                 if (!ce)
 695                         goto expand_back;
 696                 if (ce->start + ce->size >= entry->start - diff) {
 697                         /* Directly merge with previous extent */
 698                         ce->size = entry->start + entry->size - ce->start;
 699                         remove_cache_extent(tree, entry);
 700                         free(entry);
 701                         return 0;
 702                 }
 703 expand_back:
 704                 /* No overlap, normal extent */
 705                 if (entry->start < diff) {
 706                         error("cannot find space for data chunk layout");
 707                         return -ENOSPC;
 708                 }
 709                 entry->start -= diff;
 710                 entry->size += diff;
 711                 return 0;
 712         }
 713         ce = next_cache_extent(entry);
 714         if (!ce)
 715                 goto expand_after;
 716         if (entry->start + entry->size + diff >= ce->start) {
 717                 /* Directly merge with next extent */
 718                 entry->size = ce->start + ce->size - entry->start;
 719                 remove_cache_extent(tree, ce);
 720                 free(ce);
 721                 return 0;
 722         }
 723 expand_after:
 724         entry->size += diff;
 725         return 0;
 726 }
 727
 728 /*
 729  * Remove one reserve range from given cache tree
 730  * if min_stripe_size is non-zero, it will ensure for split case,
 731  * all its split cache extent is no smaller than @min_strip_size / 2.
 732  */
 733 static int wipe_one_reserved_range(struct cache_tree *tree,
 734                                    u64 start, u64 len, u64 min_stripe_size,
 735                                    int ensure_size)
 736 {
 737         struct cache_extent *cache;
 738         int ret;
 739
 740         BUG_ON(ensure_size && min_stripe_size == 0);
 741         /*
 742          * The logical here is simplified to handle special cases only
 743          * So we don't need to consider merge case for ensure_size
 744          */
 745         BUG_ON(min_stripe_size && (min_stripe_size < len * 2 ||
 746                min_stripe_size / 2 < BTRFS_STRIPE_LEN));
 747
 748         /* Also, wipe range should already be aligned */
 749         BUG_ON(start != round_down(start, BTRFS_STRIPE_LEN) ||
 750                start + len != round_up(start + len, BTRFS_STRIPE_LEN));
 751
 752         min_stripe_size /= 2;
 753
 754         cache = lookup_cache_extent(tree, start, len);
 755         if (!cache)
 756                 return 0;
 757
 758         if (start <= cache->start) {
 759                 /*
 760                  *      |--------cache---------|
 761                  * |-wipe-|
 762                  */
 763                 BUG_ON(start + len <= cache->start);
 764
 765                 /*
 766                  * The wipe size is smaller than min_stripe_size / 2,
 767                  * so the result length should still meet min_stripe_size
 768                  * And no need to do alignment
 769                  */
 770                 cache->size -= (start + len - cache->start);
 771                 if (cache->size == 0) {
 772                         remove_cache_extent(tree, cache);
 773                         free(cache);
 774                         return 0;
 775                 }
 776
 777                 BUG_ON(ensure_size && cache->size < min_stripe_size);
 778
 779                 cache->start = start + len;
 780                 return 0;
 781         } else if (start > cache->start && start + len < cache->start +
 782                    cache->size) {
 783                 /*
 784                  * |-------cache-----|
 785                  *      |-wipe-|
 786                  */
 787                 u64 old_start = cache->start;
 788                 u64 old_len = cache->size;
 789                 u64 insert_start = start + len;
 790                 u64 insert_len;
 791
 792                 cache->size = start - cache->start;
 793                 /* Expand the leading half part if needed */
 794                 if (ensure_size && cache->size < min_stripe_size) {
 795                         ret = _expand_extent_cache(tree, cache,
 796                                         min_stripe_size, 1);
 797                         if (ret < 0)
 798                                 return ret;
 799                 }
 800
 801                 /* And insert the new one */
 802                 insert_len = old_start + old_len - start - len;
 803                 ret = add_merge_cache_extent(tree, insert_start, insert_len);
 804                 if (ret < 0)
 805                         return ret;
 806
 807                 /* Expand the last half part if needed */
 808                 if (ensure_size && insert_len < min_stripe_size) {
 809                         cache = lookup_cache_extent(tree, insert_start,
 810                                                     insert_len);
 811                         if (!cache || cache->start != insert_start ||
 812                             cache->size != insert_len)
 813                                 return -ENOENT;
 814                         ret = _expand_extent_cache(tree, cache,
 815                                         min_stripe_size, 0);
 816                 }
 817
 818                 return ret;
 819         }
 820         /*
 821          * |----cache-----|
 822          *              |--wipe-|
 823          * Wipe len should be small enough and no need to expand the
 824          * remaining extent
 825          */
 826         cache->size = start - cache->start;
 827         BUG_ON(ensure_size && cache->size < min_stripe_size);
 828         return 0;
 829 }
 830
 831 /*
 832  * Remove reserved ranges from given cache_tree
 833  *
 834  * It will remove the following ranges
 835  * 1) 0~1M
 836  * 2) 2nd superblock, +64K (make sure chunks are 64K aligned)
 837  * 3) 3rd superblock, +64K
 838  *
 839  * @min_stripe must be given for safety check
 840  * and if @ensure_size is given, it will ensure affected cache_extent will be
 841  * larger than min_stripe_size
 842  */
 843 static int wipe_reserved_ranges(struct cache_tree *tree, u64 min_stripe_size,
 844                                 int ensure_size)
 845 {
 846         int ret;
 847
 848         ret = wipe_one_reserved_range(tree, 0, 1024 * 1024, min_stripe_size,
 849                                       ensure_size);
 850         if (ret < 0)
 851                 return ret;
 852         ret = wipe_one_reserved_range(tree, btrfs_sb_offset(1),
 853                         BTRFS_STRIPE_LEN, min_stripe_size, ensure_size);
 854         if (ret < 0)
 855                 return ret;
 856         ret = wipe_one_reserved_range(tree, btrfs_sb_offset(2),
 857                         BTRFS_STRIPE_LEN, min_stripe_size, ensure_size);
 858         return ret;
 859 }
 860
 861 static int calculate_available_space(struct btrfs_convert_context *cctx)
 862 {
 863         struct cache_tree *used = &cctx->used;
 864         struct cache_tree *data_chunks = &cctx->data_chunks;
 865         struct cache_tree *free = &cctx->free;
 866         struct cache_extent *cache;
 867         u64 cur_off = 0;
 868         /*
 869          * Twice the minimal chunk size, to allow later wipe_reserved_ranges()
 870          * works without need to consider overlap
 871          */
 872         u64 min_stripe_size = 2 * 16 * 1024 * 1024;
 873         int ret;
 874
 875         /* Calculate data_chunks */
 876         for (cache = first_cache_extent(used); cache;
 877              cache = next_cache_extent(cache)) {
 878                 u64 cur_len;
 879
 880                 if (cache->start + cache->size < cur_off)
 881                         continue;
 882                 if (cache->start > cur_off + min_stripe_size)
 883                         cur_off = cache->start;
 884                 cur_len = max(cache->start + cache->size - cur_off,
 885                               min_stripe_size);
 886                 ret = add_merge_cache_extent(data_chunks, cur_off, cur_len);
 887                 if (ret < 0)
 888                         goto out;
 889                 cur_off += cur_len;
 890         }
 891         /*
 892          * remove reserved ranges, so we won't ever bother relocating an old
 893          * filesystem extent to other place.
 894          */
 895         ret = wipe_reserved_ranges(data_chunks, min_stripe_size, 1);
 896         if (ret < 0)
 897                 goto out;
 898
 899         cur_off = 0;
 900         /*
 901          * Calculate free space
 902          * Always round up the start bytenr, to avoid metadata extent corss
 903          * stripe boundary, as later mkfs_convert() won't have all the extent
 904          * allocation check
 905          */
 906         for (cache = first_cache_extent(data_chunks); cache;
 907              cache = next_cache_extent(cache)) {
 908                 if (cache->start < cur_off)
 909                         continue;
 910                 if (cache->start > cur_off) {
 911                         u64 insert_start;
 912                         u64 len;
 913
 914                         len = cache->start - round_up(cur_off,
 915                                                       BTRFS_STRIPE_LEN);
 916                         insert_start = round_up(cur_off, BTRFS_STRIPE_LEN);
 917
 918                         ret = add_merge_cache_extent(free, insert_start, len);
 919                         if (ret < 0)
 920                                 goto out;
 921                 }
 922                 cur_off = cache->start + cache->size;
 923         }
 924         /* Don't forget the last range */
 925         if (cctx->total_bytes > cur_off) {
 926                 u64 len = cctx->total_bytes - cur_off;
 927                 u64 insert_start;
 928
 929                 insert_start = round_up(cur_off, BTRFS_STRIPE_LEN);
 930
 931                 ret = add_merge_cache_extent(free, insert_start, len);
 932                 if (ret < 0)
 933                         goto out;
 934         }
 935
 936         /* Remove reserved bytes */
 937         ret = wipe_reserved_ranges(free, min_stripe_size, 0);
 938 out:
 939         return ret;
 940 }
 941
 942 /*
 943  * Read used space, and since we have the used space,
 944  * calcuate data_chunks and free for later mkfs
 945  */
 946 static int convert_read_used_space(struct btrfs_convert_context *cctx)
 947 {
 948         int ret;
 949
 950         ret = cctx->convert_ops->read_used_space(cctx);
 951         if (ret)
 952                 return ret;
 953
 954         ret = calculate_available_space(cctx);
 955         return ret;
 956 }
 957
 958 /*
 959  * Create the fs image file of old filesystem.
 960  *
 961  * This is completely fs independent as we have cctx->used, only
 962  * need to create file extents pointing to all the positions.
 963  */
 964 static int create_image(struct btrfs_root *root,
 965                            struct btrfs_mkfs_config *cfg,
 966                            struct btrfs_convert_context *cctx, int fd,
 967                            u64 size, char *name, int datacsum)
 968 {
 969         struct btrfs_inode_item buf;
 970         struct btrfs_trans_handle *trans;
 971         struct btrfs_path path;
 972         struct btrfs_key key;
 973         struct cache_extent *cache;
 974         struct cache_tree used_tmp;
 975         u64 cur;
 976         u64 ino;
 977         u64 flags = BTRFS_INODE_READONLY;
 978         int ret;
 979
 980         if (!datacsum)
 981                 flags |= BTRFS_INODE_NODATASUM;
 982
 983         trans = btrfs_start_transaction(root, 1);
 984         if (!trans)
 985                 return -ENOMEM;
 986
 987         cache_tree_init(&used_tmp);
 988         btrfs_init_path(&path);
 989
 990         ret = btrfs_find_free_objectid(trans, root, BTRFS_FIRST_FREE_OBJECTID,
 991                                        &ino);
 992         if (ret < 0)
 993                 goto out;
 994         ret = btrfs_new_inode(trans, root, ino, 0400 | S_IFREG);
 995         if (ret < 0)
 996                 goto out;
 997         ret = btrfs_change_inode_flags(trans, root, ino, flags);
 998         if (ret < 0)
 999                 goto out;
1000         ret = btrfs_add_link(trans, root, ino, BTRFS_FIRST_FREE_OBJECTID, name,
1001                              strlen(name), BTRFS_FT_REG_FILE, NULL, 1);
1002         if (ret < 0)
1003                 goto out;
1004
1005         key.objectid = ino;
1006         key.type = BTRFS_INODE_ITEM_KEY;
1007         key.offset = 0;
1008
1009         ret = btrfs_search_slot(trans, root, &key, &path, 0, 1);
1010         if (ret) {
1011                 ret = (ret > 0 ? -ENOENT : ret);
1012                 goto out;
1013         }
1014         read_extent_buffer(path.nodes[0], &buf,
1015                         btrfs_item_ptr_offset(path.nodes[0], path.slots[0]),
1016                         sizeof(buf));
1017         btrfs_release_path(&path);
1018
1019         /*
1020          * Create a new used space cache, which doesn't contain the reserved
1021          * range
1022          */
1023         for (cache = first_cache_extent(&cctx->used); cache;
1024              cache = next_cache_extent(cache)) {
1025                 ret = add_cache_extent(&used_tmp, cache->start, cache->size);
1026                 if (ret < 0)
1027                         goto out;
1028         }
1029         ret = wipe_reserved_ranges(&used_tmp, 0, 0);
1030         if (ret < 0)
1031                 goto out;
1032
1033         /*
1034          * Start from 1M, as 0~1M is reserved, and create_image_file_range()
1035          * can't handle bytenr 0(will consider it as a hole)
1036          */
1037         cur = 1024 * 1024;
1038         while (cur < size) {
1039                 u64 len = size - cur;
1040
1041                 ret = create_image_file_range(trans, root, &used_tmp,
1042                                                 &buf, ino, cur, &len, datacsum);
1043                 if (ret < 0)
1044                         goto out;
1045                 cur += len;
1046         }
1047         /* Handle the reserved ranges */
1048         ret = migrate_reserved_ranges(trans, root, &cctx->used, &buf, fd, ino,
1049                                       cfg->num_bytes, datacsum);
1050
1051
1052         key.objectid = ino;
1053         key.type = BTRFS_INODE_ITEM_KEY;
1054         key.offset = 0;
1055         ret = btrfs_search_slot(trans, root, &key, &path, 0, 1);
1056         if (ret) {
1057                 ret = (ret > 0 ? -ENOENT : ret);
1058                 goto out;
1059         }
1060         btrfs_set_stack_inode_size(&buf, cfg->num_bytes);
1061         write_extent_buffer(path.nodes[0], &buf,
1062                         btrfs_item_ptr_offset(path.nodes[0], path.slots[0]),
1063                         sizeof(buf));
1064 out:
1065         free_extent_cache_tree(&used_tmp);
1066         btrfs_release_path(&path);
1067         btrfs_commit_transaction(trans, root);
1068         return ret;
1069 }
1070
1071 static struct btrfs_root* link_subvol(struct btrfs_root *root,
1072                 const char *base, u64 root_objectid)
1073 {
1074         struct btrfs_trans_handle *trans;
1075         struct btrfs_fs_info *fs_info = root->fs_info;
1076         struct btrfs_root *tree_root = fs_info->tree_root;
1077         struct btrfs_root *new_root = NULL;
1078         struct btrfs_path *path;
1079         struct btrfs_inode_item *inode_item;
1080         struct extent_buffer *leaf;
1081         struct btrfs_key key;
1082         u64 dirid = btrfs_root_dirid(&root->root_item);
1083         u64 index = 2;
1084         char buf[BTRFS_NAME_LEN + 1]; /* for snprintf null */
1085         int len;
1086         int i;
1087         int ret;
1088
1089         len = strlen(base);
1090         if (len == 0 || len > BTRFS_NAME_LEN)
1091                 return NULL;
1092
1093         path = btrfs_alloc_path();
1094         if (!path)
1095                 return NULL;
1096
1097         key.objectid = dirid;
1098         key.type = BTRFS_DIR_INDEX_KEY;
1099         key.offset = (u64)-1;
1100
1101         ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
1102         if (ret <= 0) {
1103                 error("search for DIR_INDEX dirid %llu failed: %d",
1104                                 (unsigned long long)dirid, ret);
1105                 goto fail;
1106         }
1107
1108         if (path->slots[0] > 0) {
1109                 path->slots[0]--;
1110                 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
1111                 if (key.objectid == dirid && key.type == BTRFS_DIR_INDEX_KEY)
1112                         index = key.offset + 1;
1113         }
1114         btrfs_release_path(path);
1115
1116         trans = btrfs_start_transaction(root, 1);
1117         if (!trans) {
1118                 error("unable to start transaction");
1119                 goto fail;
1120         }
1121
1122         key.objectid = dirid;
1123         key.offset = 0;
1124         key.type =  BTRFS_INODE_ITEM_KEY;
1125
1126         ret = btrfs_lookup_inode(trans, root, path, &key, 1);
1127         if (ret) {
1128                 error("search for INODE_ITEM %llu failed: %d",
1129                                 (unsigned long long)dirid, ret);
1130                 goto fail;
1131         }
1132         leaf = path->nodes[0];
1133         inode_item = btrfs_item_ptr(leaf, path->slots[0],
1134                                     struct btrfs_inode_item);
1135
1136         key.objectid = root_objectid;
1137         key.offset = (u64)-1;
1138         key.type = BTRFS_ROOT_ITEM_KEY;
1139
1140         memcpy(buf, base, len);
1141         for (i = 0; i < 1024; i++) {
1142                 ret = btrfs_insert_dir_item(trans, root, buf, len,
1143                                             dirid, &key, BTRFS_FT_DIR, index);
1144                 if (ret != -EEXIST)
1145                         break;
1146                 len = snprintf(buf, ARRAY_SIZE(buf), "%s%d", base, i);
1147                 if (len < 1 || len > BTRFS_NAME_LEN) {
1148                         ret = -EINVAL;
1149                         break;
1150                 }
1151         }
1152         if (ret)
1153                 goto fail;
1154
1155         btrfs_set_inode_size(leaf, inode_item, len * 2 +
1156                              btrfs_inode_size(leaf, inode_item));
1157         btrfs_mark_buffer_dirty(leaf);
1158         btrfs_release_path(path);
1159
1160         /* add the backref first */
1161         ret = btrfs_add_root_ref(trans, tree_root, root_objectid,
1162                                  BTRFS_ROOT_BACKREF_KEY,
1163                                  root->root_key.objectid,
1164                                  dirid, index, buf, len);
1165         if (ret) {
1166                 error("unable to add root backref for %llu: %d",
1167                                 root->root_key.objectid, ret);
1168                 goto fail;
1169         }
1170
1171         /* now add the forward ref */
1172         ret = btrfs_add_root_ref(trans, tree_root, root->root_key.objectid,
1173                                  BTRFS_ROOT_REF_KEY, root_objectid,
1174                                  dirid, index, buf, len);
1175         if (ret) {
1176                 error("unable to add root ref for %llu: %d",
1177                                 root->root_key.objectid, ret);
1178                 goto fail;
1179         }
1180
1181         ret = btrfs_commit_transaction(trans, root);
1182         if (ret) {
1183                 error("transaction commit failed: %d", ret);
1184                 goto fail;
1185         }
1186
1187         new_root = btrfs_read_fs_root(fs_info, &key);
1188         if (IS_ERR(new_root)) {
1189                 error("unable to fs read root: %lu", PTR_ERR(new_root));
1190                 new_root = NULL;
1191         }
1192 fail:
1193         btrfs_free_path(path);
1194         return new_root;
1195 }
1196
1197 static int create_subvol(struct btrfs_trans_handle *trans,
1198                          struct btrfs_root *root, u64 root_objectid)
1199 {
1200         struct extent_buffer *tmp;
1201         struct btrfs_root *new_root;
1202         struct btrfs_key key;
1203         struct btrfs_root_item root_item;
1204         int ret;
1205
1206         ret = btrfs_copy_root(trans, root, root->node, &tmp,
1207                               root_objectid);
1208         if (ret)
1209                 return ret;
1210
1211         memcpy(&root_item, &root->root_item, sizeof(root_item));
1212         btrfs_set_root_bytenr(&root_item, tmp->start);
1213         btrfs_set_root_level(&root_item, btrfs_header_level(tmp));
1214         btrfs_set_root_generation(&root_item, trans->transid);
1215         free_extent_buffer(tmp);
1216
1217         key.objectid = root_objectid;
1218         key.type = BTRFS_ROOT_ITEM_KEY;
1219         key.offset = trans->transid;
1220         ret = btrfs_insert_root(trans, root->fs_info->tree_root,
1221                                 &key, &root_item);
1222
1223         key.offset = (u64)-1;
1224         new_root = btrfs_read_fs_root(root->fs_info, &key);
1225         if (!new_root || IS_ERR(new_root)) {
1226                 error("unable to fs read root: %lu", PTR_ERR(new_root));
1227                 return PTR_ERR(new_root);
1228         }
1229
1230         ret = btrfs_make_root_dir(trans, new_root, BTRFS_FIRST_FREE_OBJECTID);
1231
1232         return ret;
1233 }
1234
1235 /*
1236  * New make_btrfs() has handle system and meta chunks quite well.
1237  * So only need to add remaining data chunks.
1238  */
1239 static int make_convert_data_block_groups(struct btrfs_trans_handle *trans,
1240                                           struct btrfs_fs_info *fs_info,
1241                                           struct btrfs_mkfs_config *cfg,
1242                                           struct btrfs_convert_context *cctx)
1243 {
1244         struct btrfs_root *extent_root = fs_info->extent_root;
1245         struct cache_tree *data_chunks = &cctx->data_chunks;
1246         struct cache_extent *cache;
1247         u64 max_chunk_size;
1248         int ret = 0;
1249
1250         /*
1251          * Don't create data chunk over 10% of the convert device
1252          * And for single chunk, don't create chunk larger than 1G.
1253          */
1254         max_chunk_size = cfg->num_bytes / 10;
1255         max_chunk_size = min((u64)(1024 * 1024 * 1024), max_chunk_size);
1256         max_chunk_size = round_down(max_chunk_size, extent_root->sectorsize);
1257
1258         for (cache = first_cache_extent(data_chunks); cache;
1259              cache = next_cache_extent(cache)) {
1260                 u64 cur = cache->start;
1261
1262                 while (cur < cache->start + cache->size) {
1263                         u64 len;
1264                         u64 cur_backup = cur;
1265
1266                         len = min(max_chunk_size,
1267                                   cache->start + cache->size - cur);
1268                         ret = btrfs_alloc_data_chunk(trans, extent_root,
1269                                         &cur_backup, len,
1270                                         BTRFS_BLOCK_GROUP_DATA, 1);
1271                         if (ret < 0)
1272                                 break;
1273                         ret = btrfs_make_block_group(trans, extent_root, 0,
1274                                         BTRFS_BLOCK_GROUP_DATA,
1275                                         BTRFS_FIRST_CHUNK_TREE_OBJECTID,
1276                                         cur, len);
1277                         if (ret < 0)
1278                                 break;
1279                         cur += len;
1280                 }
1281         }
1282         return ret;
1283 }
1284
1285 /*
1286  * Init the temp btrfs to a operational status.
1287  *
1288  * It will fix the extent usage accounting(XXX: Do we really need?) and
1289  * insert needed data chunks, to ensure all old fs data extents are covered
1290  * by DATA chunks, preventing wrong chunks are allocated.
1291  *
1292  * And also create convert image subvolume and relocation tree.
1293  * (XXX: Not need again?)
1294  * But the convert image subvolume is *NOT* linked to fs tree yet.
1295  */
1296 static int init_btrfs(struct btrfs_mkfs_config *cfg, struct btrfs_root *root,
1297                          struct btrfs_convert_context *cctx, int datacsum,
1298                          int packing, int noxattr)
1299 {
1300         struct btrfs_key location;
1301         struct btrfs_trans_handle *trans;
1302         struct btrfs_fs_info *fs_info = root->fs_info;
1303         int ret;
1304
1305         /*
1306          * Don't alloc any metadata/system chunk, as we don't want
1307          * any meta/sys chunk allcated before all data chunks are inserted.
1308          * Or we screw up the chunk layout just like the old implement.
1309          */
1310         fs_info->avoid_sys_chunk_alloc = 1;
1311         fs_info->avoid_meta_chunk_alloc = 1;
1312         trans = btrfs_start_transaction(root, 1);
1313         if (!trans) {
1314                 error("unable to start transaction");
1315                 ret = -EINVAL;
1316                 goto err;
1317         }
1318         ret = btrfs_fix_block_accounting(trans, root);
1319         if (ret)
1320                 goto err;
1321         ret = make_convert_data_block_groups(trans, fs_info, cfg, cctx);
1322         if (ret)
1323                 goto err;
1324         ret = btrfs_make_root_dir(trans, fs_info->tree_root,
1325                                   BTRFS_ROOT_TREE_DIR_OBJECTID);
1326         if (ret)
1327                 goto err;
1328         memcpy(&location, &root->root_key, sizeof(location));
1329         location.offset = (u64)-1;
1330         ret = btrfs_insert_dir_item(trans, fs_info->tree_root, "default", 7,
1331                                 btrfs_super_root_dir(fs_info->super_copy),
1332                                 &location, BTRFS_FT_DIR, 0);
1333         if (ret)
1334                 goto err;
1335         ret = btrfs_insert_inode_ref(trans, fs_info->tree_root, "default", 7,
1336                                 location.objectid,
1337                                 btrfs_super_root_dir(fs_info->super_copy), 0);
1338         if (ret)
1339                 goto err;
1340         btrfs_set_root_dirid(&fs_info->fs_root->root_item,
1341                              BTRFS_FIRST_FREE_OBJECTID);
1342
1343         /* subvol for fs image file */
1344         ret = create_subvol(trans, root, CONV_IMAGE_SUBVOL_OBJECTID);
1345         if (ret < 0) {
1346                 error("failed to create subvolume image root: %d", ret);
1347                 goto err;
1348         }
1349         /* subvol for data relocation tree */
1350         ret = create_subvol(trans, root, BTRFS_DATA_RELOC_TREE_OBJECTID);
1351         if (ret < 0) {
1352                 error("failed to create DATA_RELOC root: %d", ret);
1353                 goto err;
1354         }
1355
1356         ret = btrfs_commit_transaction(trans, root);
1357         fs_info->avoid_sys_chunk_alloc = 0;
1358         fs_info->avoid_meta_chunk_alloc = 0;
1359 err:
1360         return ret;
1361 }
1362
1363 /*
1364  * Migrate super block to its default position and zero 0 ~ 16k
1365  */
1366 static int migrate_super_block(int fd, u64 old_bytenr, u32 sectorsize)
1367 {
1368         int ret;
1369         struct extent_buffer *buf;
1370         struct btrfs_super_block *super;
1371         u32 len;
1372         u32 bytenr;
1373
1374         buf = malloc(sizeof(*buf) + sectorsize);
1375         if (!buf)
1376                 return -ENOMEM;
1377
1378         buf->len = sectorsize;
1379         ret = pread(fd, buf->data, sectorsize, old_bytenr);
1380         if (ret != sectorsize)
1381                 goto fail;
1382
1383         super = (struct btrfs_super_block *)buf->data;
1384         BUG_ON(btrfs_super_bytenr(super) != old_bytenr);
1385         btrfs_set_super_bytenr(super, BTRFS_SUPER_INFO_OFFSET);
1386
1387         csum_tree_block_size(buf, BTRFS_CRC32_SIZE, 0);
1388         ret = pwrite(fd, buf->data, sectorsize, BTRFS_SUPER_INFO_OFFSET);
1389         if (ret != sectorsize)
1390                 goto fail;
1391
1392         ret = fsync(fd);
1393         if (ret)
1394                 goto fail;
1395
1396         memset(buf->data, 0, sectorsize);
1397         for (bytenr = 0; bytenr < BTRFS_SUPER_INFO_OFFSET; ) {
1398                 len = BTRFS_SUPER_INFO_OFFSET - bytenr;
1399                 if (len > sectorsize)
1400                         len = sectorsize;
1401                 ret = pwrite(fd, buf->data, len, bytenr);
1402                 if (ret != len) {
1403                         fprintf(stderr, "unable to zero fill device\n");
1404                         break;
1405                 }
1406                 bytenr += len;
1407         }
1408         ret = 0;
1409         fsync(fd);
1410 fail:
1411         free(buf);
1412         if (ret > 0)
1413                 ret = -1;
1414         return ret;
1415 }
1416
1417 static int prepare_system_chunk_sb(struct btrfs_super_block *super)
1418 {
1419         struct btrfs_chunk *chunk;
1420         struct btrfs_disk_key *key;
1421         u32 sectorsize = btrfs_super_sectorsize(super);
1422
1423         key = (struct btrfs_disk_key *)(super->sys_chunk_array);
1424         chunk = (struct btrfs_chunk *)(super->sys_chunk_array +
1425                                        sizeof(struct btrfs_disk_key));
1426
1427         btrfs_set_disk_key_objectid(key, BTRFS_FIRST_CHUNK_TREE_OBJECTID);
1428         btrfs_set_disk_key_type(key, BTRFS_CHUNK_ITEM_KEY);
1429         btrfs_set_disk_key_offset(key, 0);
1430
1431         btrfs_set_stack_chunk_length(chunk, btrfs_super_total_bytes(super));
1432         btrfs_set_stack_chunk_owner(chunk, BTRFS_EXTENT_TREE_OBJECTID);
1433         btrfs_set_stack_chunk_stripe_len(chunk, BTRFS_STRIPE_LEN);
1434         btrfs_set_stack_chunk_type(chunk, BTRFS_BLOCK_GROUP_SYSTEM);
1435         btrfs_set_stack_chunk_io_align(chunk, sectorsize);
1436         btrfs_set_stack_chunk_io_width(chunk, sectorsize);
1437         btrfs_set_stack_chunk_sector_size(chunk, sectorsize);
1438         btrfs_set_stack_chunk_num_stripes(chunk, 1);
1439         btrfs_set_stack_chunk_sub_stripes(chunk, 0);
1440         chunk->stripe.devid = super->dev_item.devid;
1441         btrfs_set_stack_stripe_offset(&chunk->stripe, 0);
1442         memcpy(chunk->stripe.dev_uuid, super->dev_item.uuid, BTRFS_UUID_SIZE);
1443         btrfs_set_super_sys_array_size(super, sizeof(*key) + sizeof(*chunk));
1444         return 0;
1445 }
1446
1447 #if BTRFSCONVERT_EXT2
1448
1449 /*
1450  * Open Ext2fs in readonly mode, read block allocation bitmap and
1451  * inode bitmap into memory.
1452  */
1453 static int ext2_open_fs(struct btrfs_convert_context *cctx, const char *name)
1454 {
1455         errcode_t ret;
1456         ext2_filsys ext2_fs;
1457         ext2_ino_t ino;
1458         u32 ro_feature;
1459
1460         ret = ext2fs_open(name, 0, 0, 0, unix_io_manager, &ext2_fs);
1461         if (ret) {
1462                 fprintf(stderr, "ext2fs_open: %s\n", error_message(ret));
1463                 return -1;
1464         }
1465         /*
1466          * We need to know exactly the used space, some RO compat flags like
1467          * BIGALLOC will affect how used space is present.
1468          * So we need manuall check any unsupported RO compat flags
1469          */
1470         ro_feature = ext2_fs->super->s_feature_ro_compat;
1471         if (ro_feature & ~EXT2_LIB_FEATURE_RO_COMPAT_SUPP) {
1472                 error(
1473 "unsupported RO features detected: %x, abort convert to avoid possible corruption",
1474                       ro_feature & ~EXT2_LIB_FEATURE_COMPAT_SUPP);
1475                 goto fail;
1476         }
1477         ret = ext2fs_read_inode_bitmap(ext2_fs);
1478         if (ret) {
1479                 fprintf(stderr, "ext2fs_read_inode_bitmap: %s\n",
1480                         error_message(ret));
1481                 goto fail;
1482         }
1483         ret = ext2fs_read_block_bitmap(ext2_fs);
1484         if (ret) {
1485                 fprintf(stderr, "ext2fs_read_block_bitmap: %s\n",
1486                         error_message(ret));
1487                 goto fail;
1488         }
1489         /*
1490          * search each block group for a free inode. this set up
1491          * uninit block/inode bitmaps appropriately.
1492          */
1493         ino = 1;
1494         while (ino <= ext2_fs->super->s_inodes_count) {
1495                 ext2_ino_t foo;
1496                 ext2fs_new_inode(ext2_fs, ino, 0, NULL, &foo);
1497                 ino += EXT2_INODES_PER_GROUP(ext2_fs->super);
1498         }
1499
1500         if (!(ext2_fs->super->s_feature_incompat &
1501               EXT2_FEATURE_INCOMPAT_FILETYPE)) {
1502                 error("filetype feature is missing");
1503                 goto fail;
1504         }
1505
1506         cctx->fs_data = ext2_fs;
1507         cctx->blocksize = ext2_fs->blocksize;
1508         cctx->block_count = ext2_fs->super->s_blocks_count;
1509         cctx->total_bytes = ext2_fs->blocksize * ext2_fs->super->s_blocks_count;
1510         cctx->volume_name = strndup(ext2_fs->super->s_volume_name, 16);
1511         cctx->first_data_block = ext2_fs->super->s_first_data_block;
1512         cctx->inodes_count = ext2_fs->super->s_inodes_count;
1513         cctx->free_inodes_count = ext2_fs->super->s_free_inodes_count;
1514         return 0;
1515 fail:
1516         ext2fs_close(ext2_fs);
1517         return -1;
1518 }
1519
1520 static int __ext2_add_one_block(ext2_filsys fs, char *bitmap,
1521                                 unsigned long group_nr, struct cache_tree *used)
1522 {
1523         unsigned long offset;
1524         unsigned i;
1525         int ret = 0;
1526
1527         offset = fs->super->s_first_data_block;
1528         offset /= EXT2FS_CLUSTER_RATIO(fs);
1529         offset += group_nr * EXT2_CLUSTERS_PER_GROUP(fs->super);
1530         for (i = 0; i < EXT2_CLUSTERS_PER_GROUP(fs->super); i++) {
1531                 if (ext2fs_test_bit(i, bitmap)) {
1532                         u64 start;
1533
1534                         start = (i + offset) * EXT2FS_CLUSTER_RATIO(fs);
1535                         start *= fs->blocksize;
1536                         ret = add_merge_cache_extent(used, start,
1537                                                      fs->blocksize);
1538                         if (ret < 0)
1539                                 break;
1540                 }
1541         }
1542         return ret;
1543 }
1544
1545 /*
1546  * Read all used ext2 space into cctx->used cache tree
1547  */
1548 static int ext2_read_used_space(struct btrfs_convert_context *cctx)
1549 {
1550         ext2_filsys fs = (ext2_filsys)cctx->fs_data;
1551         blk64_t blk_itr = EXT2FS_B2C(fs, fs->super->s_first_data_block);
1552         struct cache_tree *used_tree = &cctx->used;
1553         char *block_bitmap = NULL;
1554         unsigned long i;
1555         int block_nbytes;
1556         int ret = 0;
1557
1558         block_nbytes = EXT2_CLUSTERS_PER_GROUP(fs->super) / 8;
1559         /* Shouldn't happen */
1560         BUG_ON(!fs->block_map);
1561
1562         block_bitmap = malloc(block_nbytes);
1563         if (!block_bitmap)
1564                 return -ENOMEM;
1565
1566         for (i = 0; i < fs->group_desc_count; i++) {
1567                 ret = ext2fs_get_block_bitmap_range(fs->block_map, blk_itr,
1568                                                 block_nbytes * 8, block_bitmap);
1569                 if (ret) {
1570                         error("fail to get bitmap from ext2, %s",
1571                               strerror(-ret));
1572                         break;
1573                 }
1574                 ret = __ext2_add_one_block(fs, block_bitmap, i, used_tree);
1575                 if (ret < 0) {
1576                         error("fail to build used space tree, %s",
1577                               strerror(-ret));
1578                         break;
1579                 }
1580                 blk_itr += EXT2_CLUSTERS_PER_GROUP(fs->super);
1581         }
1582
1583         free(block_bitmap);
1584         return ret;
1585 }
1586
1587 static void ext2_close_fs(struct btrfs_convert_context *cctx)
1588 {
1589         if (cctx->volume_name) {
1590                 free(cctx->volume_name);
1591                 cctx->volume_name = NULL;
1592         }
1593         ext2fs_close(cctx->fs_data);
1594 }
1595
1596 struct dir_iterate_data {
1597         struct btrfs_trans_handle *trans;
1598         struct btrfs_root *root;
1599         struct btrfs_inode_item *inode;
1600         u64 objectid;
1601         u64 index_cnt;
1602         u64 parent;
1603         int errcode;
1604 };
1605
1606 static u8 ext2_filetype_conversion_table[EXT2_FT_MAX] = {
1607         [EXT2_FT_UNKNOWN]       = BTRFS_FT_UNKNOWN,
1608         [EXT2_FT_REG_FILE]      = BTRFS_FT_REG_FILE,
1609         [EXT2_FT_DIR]           = BTRFS_FT_DIR,
1610         [EXT2_FT_CHRDEV]        = BTRFS_FT_CHRDEV,
1611         [EXT2_FT_BLKDEV]        = BTRFS_FT_BLKDEV,
1612         [EXT2_FT_FIFO]          = BTRFS_FT_FIFO,
1613         [EXT2_FT_SOCK]          = BTRFS_FT_SOCK,
1614         [EXT2_FT_SYMLINK]       = BTRFS_FT_SYMLINK,
1615 };
1616
1617 static int ext2_dir_iterate_proc(ext2_ino_t dir, int entry,
1618                             struct ext2_dir_entry *dirent,
1619                             int offset, int blocksize,
1620                             char *buf,void *priv_data)
1621 {
1622         int ret;
1623         int file_type;
1624         u64 objectid;
1625         char dotdot[] = "..";
1626         struct dir_iterate_data *idata = (struct dir_iterate_data *)priv_data;
1627         int name_len;
1628
1629         name_len = dirent->name_len & 0xFF;
1630
1631         objectid = dirent->inode + INO_OFFSET;
1632         if (!strncmp(dirent->name, dotdot, name_len)) {
1633                 if (name_len == 2) {
1634                         BUG_ON(idata->parent != 0);
1635                         idata->parent = objectid;
1636                 }
1637                 return 0;
1638         }
1639         if (dirent->inode < EXT2_GOOD_OLD_FIRST_INO)
1640                 return 0;
1641
1642         file_type = dirent->name_len >> 8;
1643         BUG_ON(file_type > EXT2_FT_SYMLINK);
1644
1645         ret = convert_insert_dirent(idata->trans, idata->root, dirent->name,
1646                                     name_len, idata->objectid, objectid,
1647                                     ext2_filetype_conversion_table[file_type],
1648                                     idata->index_cnt, idata->inode);
1649         if (ret < 0) {
1650                 idata->errcode = ret;
1651                 return BLOCK_ABORT;
1652         }
1653
1654         idata->index_cnt++;
1655         return 0;
1656 }
1657
1658 static int ext2_create_dir_entries(struct btrfs_trans_handle *trans,
1659                               struct btrfs_root *root, u64 objectid,
1660                               struct btrfs_inode_item *btrfs_inode,
1661                               ext2_filsys ext2_fs, ext2_ino_t ext2_ino)
1662 {
1663         int ret;
1664         errcode_t err;
1665         struct dir_iterate_data data = {
1666                 .trans          = trans,
1667                 .root           = root,
1668                 .inode          = btrfs_inode,
1669                 .objectid       = objectid,
1670                 .index_cnt      = 2,
1671                 .parent         = 0,
1672                 .errcode        = 0,
1673         };
1674
1675         err = ext2fs_dir_iterate2(ext2_fs, ext2_ino, 0, NULL,
1676                                   ext2_dir_iterate_proc, &data);
1677         if (err)
1678                 goto error;
1679         ret = data.errcode;
1680         if (ret == 0 && data.parent == objectid) {
1681                 ret = btrfs_insert_inode_ref(trans, root, "..", 2,
1682                                              objectid, objectid, 0);
1683         }
1684         return ret;
1685 error:
1686         fprintf(stderr, "ext2fs_dir_iterate2: %s\n", error_message(err));
1687         return -1;
1688 }
1689
1690 static int ext2_block_iterate_proc(ext2_filsys fs, blk_t *blocknr,
1691                                 e2_blkcnt_t blockcnt, blk_t ref_block,
1692                                 int ref_offset, void *priv_data)
1693 {
1694         int ret;
1695         struct blk_iterate_data *idata;
1696         idata = (struct blk_iterate_data *)priv_data;
1697         ret = block_iterate_proc(*blocknr, blockcnt, idata);
1698         if (ret) {
1699                 idata->errcode = ret;
1700                 return BLOCK_ABORT;
1701         }
1702         return 0;
1703 }
1704
1705 /*
1706  * traverse file's data blocks, record these data blocks as file extents.
1707  */
1708 static int ext2_create_file_extents(struct btrfs_trans_handle *trans,
1709                                struct btrfs_root *root, u64 objectid,
1710                                struct btrfs_inode_item *btrfs_inode,
1711                                ext2_filsys ext2_fs, ext2_ino_t ext2_ino,
1712                                int datacsum, int packing)
1713 {
1714         int ret;
1715         char *buffer = NULL;
1716         errcode_t err;
1717         u32 last_block;
1718         u32 sectorsize = root->sectorsize;
1719         u64 inode_size = btrfs_stack_inode_size(btrfs_inode);
1720         struct blk_iterate_data data;
1721
1722         init_blk_iterate_data(&data, trans, root, btrfs_inode, objectid,
1723                               datacsum);
1724
1725         err = ext2fs_block_iterate2(ext2_fs, ext2_ino, BLOCK_FLAG_DATA_ONLY,
1726                                     NULL, ext2_block_iterate_proc, &data);
1727         if (err)
1728                 goto error;
1729         ret = data.errcode;
1730         if (ret)
1731                 goto fail;
1732         if (packing && data.first_block == 0 && data.num_blocks > 0 &&
1733             inode_size <= BTRFS_MAX_INLINE_DATA_SIZE(root)) {
1734                 u64 num_bytes = data.num_blocks * sectorsize;
1735                 u64 disk_bytenr = data.disk_block * sectorsize;
1736                 u64 nbytes;
1737
1738                 buffer = malloc(num_bytes);
1739                 if (!buffer)
1740                         return -ENOMEM;
1741                 ret = read_disk_extent(root, disk_bytenr, num_bytes, buffer);
1742                 if (ret)
1743                         goto fail;
1744                 if (num_bytes > inode_size)
1745                         num_bytes = inode_size;
1746                 ret = btrfs_insert_inline_extent(trans, root, objectid,
1747                                                  0, buffer, num_bytes);
1748                 if (ret)
1749                         goto fail;
1750                 nbytes = btrfs_stack_inode_nbytes(btrfs_inode) + num_bytes;
1751                 btrfs_set_stack_inode_nbytes(btrfs_inode, nbytes);
1752         } else if (data.num_blocks > 0) {
1753                 ret = record_file_blocks(&data, data.first_block,
1754                                          data.disk_block, data.num_blocks);
1755                 if (ret)
1756                         goto fail;
1757         }
1758         data.first_block += data.num_blocks;
1759         last_block = (inode_size + sectorsize - 1) / sectorsize;
1760         if (last_block > data.first_block) {
1761                 ret = record_file_blocks(&data, data.first_block, 0,
1762                                          last_block - data.first_block);
1763         }
1764 fail:
1765         free(buffer);
1766         return ret;
1767 error:
1768         fprintf(stderr, "ext2fs_block_iterate2: %s\n", error_message(err));
1769         return -1;
1770 }
1771
1772 static int ext2_create_symbol_link(struct btrfs_trans_handle *trans,
1773                               struct btrfs_root *root, u64 objectid,
1774                               struct btrfs_inode_item *btrfs_inode,
1775                               ext2_filsys ext2_fs, ext2_ino_t ext2_ino,
1776                               struct ext2_inode *ext2_inode)
1777 {
1778         int ret;
1779         char *pathname;
1780         u64 inode_size = btrfs_stack_inode_size(btrfs_inode);
1781         if (ext2fs_inode_data_blocks(ext2_fs, ext2_inode)) {
1782                 btrfs_set_stack_inode_size(btrfs_inode, inode_size + 1);
1783                 ret = ext2_create_file_extents(trans, root, objectid,
1784                                 btrfs_inode, ext2_fs, ext2_ino, 1, 1);
1785                 btrfs_set_stack_inode_size(btrfs_inode, inode_size);
1786                 return ret;
1787         }
1788
1789         pathname = (char *)&(ext2_inode->i_block[0]);
1790         BUG_ON(pathname[inode_size] != 0);
1791         ret = btrfs_insert_inline_extent(trans, root, objectid, 0,
1792                                          pathname, inode_size + 1);
1793         btrfs_set_stack_inode_nbytes(btrfs_inode, inode_size + 1);
1794         return ret;
1795 }
1796
1797 /*
1798  * Following xattr/acl related codes are based on codes in
1799  * fs/ext3/xattr.c and fs/ext3/acl.c
1800  */
1801 #define EXT2_XATTR_BHDR(ptr) ((struct ext2_ext_attr_header *)(ptr))
1802 #define EXT2_XATTR_BFIRST(ptr) \
1803         ((struct ext2_ext_attr_entry *)(EXT2_XATTR_BHDR(ptr) + 1))
1804 #define EXT2_XATTR_IHDR(inode) \
1805         ((struct ext2_ext_attr_header *) ((void *)(inode) + \
1806                 EXT2_GOOD_OLD_INODE_SIZE + (inode)->i_extra_isize))
1807 #define EXT2_XATTR_IFIRST(inode) \
1808         ((struct ext2_ext_attr_entry *) ((void *)EXT2_XATTR_IHDR(inode) + \
1809                 sizeof(EXT2_XATTR_IHDR(inode)->h_magic)))
1810
1811 static int ext2_xattr_check_names(struct ext2_ext_attr_entry *entry,
1812                                   const void *end)
1813 {
1814         struct ext2_ext_attr_entry *next;
1815
1816         while (!EXT2_EXT_IS_LAST_ENTRY(entry)) {
1817                 next = EXT2_EXT_ATTR_NEXT(entry);
1818                 if ((void *)next >= end)
1819                         return -EIO;
1820                 entry = next;
1821         }
1822         return 0;
1823 }
1824
1825 static int ext2_xattr_check_block(const char *buf, size_t size)
1826 {
1827         int error;
1828         struct ext2_ext_attr_header *header = EXT2_XATTR_BHDR(buf);
1829
1830         if (header->h_magic != EXT2_EXT_ATTR_MAGIC ||
1831             header->h_blocks != 1)
1832                 return -EIO;
1833         error = ext2_xattr_check_names(EXT2_XATTR_BFIRST(buf), buf + size);
1834         return error;
1835 }
1836
1837 static int ext2_xattr_check_entry(struct ext2_ext_attr_entry *entry,
1838                                   size_t size)
1839 {
1840         size_t value_size = entry->e_value_size;
1841
1842         if (entry->e_value_block != 0 || value_size > size ||
1843             entry->e_value_offs + value_size > size)
1844                 return -EIO;
1845         return 0;
1846 }
1847
1848 #define EXT2_ACL_VERSION        0x0001
1849
1850 /* 23.2.5 acl_tag_t values */
1851
1852 #define ACL_UNDEFINED_TAG       (0x00)
1853 #define ACL_USER_OBJ            (0x01)
1854 #define ACL_USER                (0x02)
1855 #define ACL_GROUP_OBJ           (0x04)
1856 #define ACL_GROUP               (0x08)
1857 #define ACL_MASK                (0x10)
1858 #define ACL_OTHER               (0x20)
1859
1860 /* 23.2.7 ACL qualifier constants */
1861
1862 #define ACL_UNDEFINED_ID        ((id_t)-1)
1863
1864 typedef struct {
1865         __le16          e_tag;
1866         __le16          e_perm;
1867         __le32          e_id;
1868 } ext2_acl_entry;
1869
1870 typedef struct {
1871         __le16          e_tag;
1872         __le16          e_perm;
1873 } ext2_acl_entry_short;
1874
1875 typedef struct {
1876         __le32          a_version;
1877 } ext2_acl_header;
1878
1879 static inline int ext2_acl_count(size_t size)
1880 {
1881         ssize_t s;
1882         size -= sizeof(ext2_acl_header);
1883         s = size - 4 * sizeof(ext2_acl_entry_short);
1884         if (s < 0) {
1885                 if (size % sizeof(ext2_acl_entry_short))
1886                         return -1;
1887                 return size / sizeof(ext2_acl_entry_short);
1888         } else {
1889                 if (s % sizeof(ext2_acl_entry))
1890                         return -1;
1891                 return s / sizeof(ext2_acl_entry) + 4;
1892         }
1893 }
1894
1895 #define ACL_EA_VERSION          0x0002
1896
1897 typedef struct {
1898         __le16          e_tag;
1899         __le16          e_perm;
1900         __le32          e_id;
1901 } acl_ea_entry;
1902
1903 typedef struct {
1904         __le32          a_version;
1905         acl_ea_entry    a_entries[0];
1906 } acl_ea_header;
1907
1908 static inline size_t acl_ea_size(int count)
1909 {
1910         return sizeof(acl_ea_header) + count * sizeof(acl_ea_entry);
1911 }
1912
1913 static int ext2_acl_to_xattr(void *dst, const void *src,
1914                              size_t dst_size, size_t src_size)
1915 {
1916         int i, count;
1917         const void *end = src + src_size;
1918         acl_ea_header *ext_acl = (acl_ea_header *)dst;
1919         acl_ea_entry *dst_entry = ext_acl->a_entries;
1920         ext2_acl_entry *src_entry;
1921
1922         if (src_size < sizeof(ext2_acl_header))
1923                 goto fail;
1924         if (((ext2_acl_header *)src)->a_version !=
1925             cpu_to_le32(EXT2_ACL_VERSION))
1926                 goto fail;
1927         src += sizeof(ext2_acl_header);
1928         count = ext2_acl_count(src_size);
1929         if (count <= 0)
1930                 goto fail;
1931
1932         BUG_ON(dst_size < acl_ea_size(count));
1933         ext_acl->a_version = cpu_to_le32(ACL_EA_VERSION);
1934         for (i = 0; i < count; i++, dst_entry++) {
1935                 src_entry = (ext2_acl_entry *)src;
1936                 if (src + sizeof(ext2_acl_entry_short) > end)
1937                         goto fail;
1938                 dst_entry->e_tag = src_entry->e_tag;
1939                 dst_entry->e_perm = src_entry->e_perm;
1940                 switch (le16_to_cpu(src_entry->e_tag)) {
1941                 case ACL_USER_OBJ:
1942                 case ACL_GROUP_OBJ:
1943                 case ACL_MASK:
1944                 case ACL_OTHER:
1945                         src += sizeof(ext2_acl_entry_short);
1946                         dst_entry->e_id = cpu_to_le32(ACL_UNDEFINED_ID);
1947                         break;
1948                 case ACL_USER:
1949                 case ACL_GROUP:
1950                         src += sizeof(ext2_acl_entry);
1951                         if (src > end)
1952                                 goto fail;
1953                         dst_entry->e_id = src_entry->e_id;
1954                         break;
1955                 default:
1956                         goto fail;
1957                 }
1958         }
1959         if (src != end)
1960                 goto fail;
1961         return 0;
1962 fail:
1963         return -EINVAL;
1964 }
1965
1966 static char *xattr_prefix_table[] = {
1967         [1] =   "user.",
1968         [2] =   "system.posix_acl_access",
1969         [3] =   "system.posix_acl_default",
1970         [4] =   "trusted.",
1971         [6] =   "security.",
1972 };
1973
1974 static int ext2_copy_single_xattr(struct btrfs_trans_handle *trans,
1975                              struct btrfs_root *root, u64 objectid,
1976                              struct ext2_ext_attr_entry *entry,
1977                              const void *data, u32 datalen)
1978 {
1979         int ret = 0;
1980         int name_len;
1981         int name_index;
1982         void *databuf = NULL;
1983         char namebuf[XATTR_NAME_MAX + 1];
1984
1985         name_index = entry->e_name_index;
1986         if (name_index >= ARRAY_SIZE(xattr_prefix_table) ||
1987             xattr_prefix_table[name_index] == NULL)
1988                 return -EOPNOTSUPP;
1989         name_len = strlen(xattr_prefix_table[name_index]) +
1990                    entry->e_name_len;
1991         if (name_len >= sizeof(namebuf))
1992                 return -ERANGE;
1993
1994         if (name_index == 2 || name_index == 3) {
1995                 size_t bufsize = acl_ea_size(ext2_acl_count(datalen));
1996                 databuf = malloc(bufsize);
1997                 if (!databuf)
1998                        return -ENOMEM;
1999                 ret = ext2_acl_to_xattr(databuf, data, bufsize, datalen);
2000                 if (ret)
2001                         goto out;
2002                 data = databuf;
2003                 datalen = bufsize;
2004         }
2005         strncpy(namebuf, xattr_prefix_table[name_index], XATTR_NAME_MAX);
2006         strncat(namebuf, EXT2_EXT_ATTR_NAME(entry), entry->e_name_len);
2007         if (name_len + datalen > BTRFS_LEAF_DATA_SIZE(root) -
2008             sizeof(struct btrfs_item) - sizeof(struct btrfs_dir_item)) {
2009                 fprintf(stderr, "skip large xattr on inode %Lu name %.*s\n",
2010                         objectid - INO_OFFSET, name_len, namebuf);
2011                 goto out;
2012         }
2013         ret = btrfs_insert_xattr_item(trans, root, namebuf, name_len,
2014                                       data, datalen, objectid);
2015 out:
2016         free(databuf);
2017         return ret;
2018 }
2019
2020 static int ext2_copy_extended_attrs(struct btrfs_trans_handle *trans,
2021                                struct btrfs_root *root, u64 objectid,
2022                                struct btrfs_inode_item *btrfs_inode,
2023                                ext2_filsys ext2_fs, ext2_ino_t ext2_ino)
2024 {
2025         int ret = 0;
2026         int inline_ea = 0;
2027         errcode_t err;
2028         u32 datalen;
2029         u32 block_size = ext2_fs->blocksize;
2030         u32 inode_size = EXT2_INODE_SIZE(ext2_fs->super);
2031         struct ext2_inode_large *ext2_inode;
2032         struct ext2_ext_attr_entry *entry;
2033         void *data;
2034         char *buffer = NULL;
2035         char inode_buf[EXT2_GOOD_OLD_INODE_SIZE];
2036
2037         if (inode_size <= EXT2_GOOD_OLD_INODE_SIZE) {
2038                 ext2_inode = (struct ext2_inode_large *)inode_buf;
2039         } else {
2040                 ext2_inode = (struct ext2_inode_large *)malloc(inode_size);
2041                 if (!ext2_inode)
2042                        return -ENOMEM;
2043         }
2044         err = ext2fs_read_inode_full(ext2_fs, ext2_ino, (void *)ext2_inode,
2045                                      inode_size);
2046         if (err) {
2047                 fprintf(stderr, "ext2fs_read_inode_full: %s\n",
2048                         error_message(err));
2049                 ret = -1;
2050                 goto out;
2051         }
2052
2053         if (ext2_ino > ext2_fs->super->s_first_ino &&
2054             inode_size > EXT2_GOOD_OLD_INODE_SIZE) {
2055                 if (EXT2_GOOD_OLD_INODE_SIZE +
2056                     ext2_inode->i_extra_isize > inode_size) {
2057                         ret = -EIO;
2058                         goto out;
2059                 }
2060                 if (ext2_inode->i_extra_isize != 0 &&
2061                     EXT2_XATTR_IHDR(ext2_inode)->h_magic ==
2062                     EXT2_EXT_ATTR_MAGIC) {
2063                         inline_ea = 1;
2064                 }
2065         }
2066         if (inline_ea) {
2067                 int total;
2068                 void *end = (void *)ext2_inode + inode_size;
2069                 entry = EXT2_XATTR_IFIRST(ext2_inode);
2070                 total = end - (void *)entry;
2071                 ret = ext2_xattr_check_names(entry, end);
2072                 if (ret)
2073                         goto out;
2074                 while (!EXT2_EXT_IS_LAST_ENTRY(entry)) {
2075                         ret = ext2_xattr_check_entry(entry, total);
2076                         if (ret)
2077                                 goto out;
2078                         data = (void *)EXT2_XATTR_IFIRST(ext2_inode) +
2079                                 entry->e_value_offs;
2080                         datalen = entry->e_value_size;
2081                         ret = ext2_copy_single_xattr(trans, root, objectid,
2082                                                 entry, data, datalen);
2083                         if (ret)
2084                                 goto out;
2085                         entry = EXT2_EXT_ATTR_NEXT(entry);
2086                 }
2087         }
2088
2089         if (ext2_inode->i_file_acl == 0)
2090                 goto out;
2091
2092         buffer = malloc(block_size);
2093         if (!buffer) {
2094                 ret = -ENOMEM;
2095                 goto out;
2096         }
2097         err = ext2fs_read_ext_attr(ext2_fs, ext2_inode->i_file_acl, buffer);
2098         if (err) {
2099                 fprintf(stderr, "ext2fs_read_ext_attr: %s\n",
2100                         error_message(err));
2101                 ret = -1;
2102                 goto out;
2103         }
2104         ret = ext2_xattr_check_block(buffer, block_size);
2105         if (ret)
2106                 goto out;
2107
2108         entry = EXT2_XATTR_BFIRST(buffer);
2109         while (!EXT2_EXT_IS_LAST_ENTRY(entry)) {
2110                 ret = ext2_xattr_check_entry(entry, block_size);
2111                 if (ret)
2112                         goto out;
2113                 data = buffer + entry->e_value_offs;
2114                 datalen = entry->e_value_size;
2115                 ret = ext2_copy_single_xattr(trans, root, objectid,
2116                                         entry, data, datalen);
2117                 if (ret)
2118                         goto out;
2119                 entry = EXT2_EXT_ATTR_NEXT(entry);
2120         }
2121 out:
2122         free(buffer);
2123         if ((void *)ext2_inode != inode_buf)
2124                 free(ext2_inode);
2125         return ret;
2126 }
2127 #define MINORBITS       20
2128 #define MKDEV(ma, mi)   (((ma) << MINORBITS) | (mi))
2129
2130 static inline dev_t old_decode_dev(u16 val)
2131 {
2132         return MKDEV((val >> 8) & 255, val & 255);
2133 }
2134
2135 static inline dev_t new_decode_dev(u32 dev)
2136 {
2137         unsigned major = (dev & 0xfff00) >> 8;
2138         unsigned minor = (dev & 0xff) | ((dev >> 12) & 0xfff00);
2139         return MKDEV(major, minor);
2140 }
2141
2142 static void ext2_copy_inode_item(struct btrfs_inode_item *dst,
2143                            struct ext2_inode *src, u32 blocksize)
2144 {
2145         btrfs_set_stack_inode_generation(dst, 1);
2146         btrfs_set_stack_inode_sequence(dst, 0);
2147         btrfs_set_stack_inode_transid(dst, 1);
2148         btrfs_set_stack_inode_size(dst, src->i_size);
2149         btrfs_set_stack_inode_nbytes(dst, 0);
2150         btrfs_set_stack_inode_block_group(dst, 0);
2151         btrfs_set_stack_inode_nlink(dst, src->i_links_count);
2152         btrfs_set_stack_inode_uid(dst, src->i_uid | (src->i_uid_high << 16));
2153         btrfs_set_stack_inode_gid(dst, src->i_gid | (src->i_gid_high << 16));
2154         btrfs_set_stack_inode_mode(dst, src->i_mode);
2155         btrfs_set_stack_inode_rdev(dst, 0);
2156         btrfs_set_stack_inode_flags(dst, 0);
2157         btrfs_set_stack_timespec_sec(&dst->atime, src->i_atime);
2158         btrfs_set_stack_timespec_nsec(&dst->atime, 0);
2159         btrfs_set_stack_timespec_sec(&dst->ctime, src->i_ctime);
2160         btrfs_set_stack_timespec_nsec(&dst->ctime, 0);
2161         btrfs_set_stack_timespec_sec(&dst->mtime, src->i_mtime);
2162         btrfs_set_stack_timespec_nsec(&dst->mtime, 0);
2163         btrfs_set_stack_timespec_sec(&dst->otime, 0);
2164         btrfs_set_stack_timespec_nsec(&dst->otime, 0);
2165
2166         if (S_ISDIR(src->i_mode)) {
2167                 btrfs_set_stack_inode_size(dst, 0);
2168                 btrfs_set_stack_inode_nlink(dst, 1);
2169         }
2170         if (S_ISREG(src->i_mode)) {
2171                 btrfs_set_stack_inode_size(dst, (u64)src->i_size_high << 32 |
2172                                            (u64)src->i_size);
2173         }
2174         if (!S_ISREG(src->i_mode) && !S_ISDIR(src->i_mode) &&
2175             !S_ISLNK(src->i_mode)) {
2176                 if (src->i_block[0]) {
2177                         btrfs_set_stack_inode_rdev(dst,
2178                                 old_decode_dev(src->i_block[0]));
2179                 } else {
2180                         btrfs_set_stack_inode_rdev(dst,
2181                                 new_decode_dev(src->i_block[1]));
2182                 }
2183         }
2184         memset(&dst->reserved, 0, sizeof(dst->reserved));
2185 }
2186 static int ext2_check_state(struct btrfs_convert_context *cctx)
2187 {
2188         ext2_filsys fs = cctx->fs_data;
2189
2190         if (!(fs->super->s_state & EXT2_VALID_FS))
2191                 return 1;
2192         else if (fs->super->s_state & EXT2_ERROR_FS)
2193                 return 1;
2194         else
2195                 return 0;
2196 }
2197
2198 /* EXT2_*_FL to BTRFS_INODE_FLAG_* stringification helper */
2199 #define COPY_ONE_EXT2_FLAG(flags, ext2_inode, name) ({                  \
2200         if (ext2_inode->i_flags & EXT2_##name##_FL)                     \
2201                 flags |= BTRFS_INODE_##name;                            \
2202 })
2203
2204 /*
2205  * Convert EXT2_*_FL to corresponding BTRFS_INODE_* flags
2206  *
2207  * Only a subset of EXT_*_FL is supported in btrfs.
2208  */
2209 static void ext2_convert_inode_flags(struct btrfs_inode_item *dst,
2210                                      struct ext2_inode *src)
2211 {
2212         u64 flags = 0;
2213
2214         COPY_ONE_EXT2_FLAG(flags, src, APPEND);
2215         COPY_ONE_EXT2_FLAG(flags, src, SYNC);
2216         COPY_ONE_EXT2_FLAG(flags, src, IMMUTABLE);
2217         COPY_ONE_EXT2_FLAG(flags, src, NODUMP);
2218         COPY_ONE_EXT2_FLAG(flags, src, NOATIME);
2219         COPY_ONE_EXT2_FLAG(flags, src, DIRSYNC);
2220         btrfs_set_stack_inode_flags(dst, flags);
2221 }
2222
2223 /*
2224  * copy a single inode. do all the required works, such as cloning
2225  * inode item, creating file extents and creating directory entries.
2226  */
2227 static int ext2_copy_single_inode(struct btrfs_trans_handle *trans,
2228                              struct btrfs_root *root, u64 objectid,
2229                              ext2_filsys ext2_fs, ext2_ino_t ext2_ino,
2230                              struct ext2_inode *ext2_inode,
2231                              int datacsum, int packing, int noxattr)
2232 {
2233         int ret;
2234         struct btrfs_inode_item btrfs_inode;
2235
2236         if (ext2_inode->i_links_count == 0)
2237                 return 0;
2238
2239         ext2_copy_inode_item(&btrfs_inode, ext2_inode, ext2_fs->blocksize);
2240         if (!datacsum && S_ISREG(ext2_inode->i_mode)) {
2241                 u32 flags = btrfs_stack_inode_flags(&btrfs_inode) |
2242                             BTRFS_INODE_NODATASUM;
2243                 btrfs_set_stack_inode_flags(&btrfs_inode, flags);
2244         }
2245         ext2_convert_inode_flags(&btrfs_inode, ext2_inode);
2246
2247         switch (ext2_inode->i_mode & S_IFMT) {
2248         case S_IFREG:
2249                 ret = ext2_create_file_extents(trans, root, objectid,
2250                         &btrfs_inode, ext2_fs, ext2_ino, datacsum, packing);
2251                 break;
2252         case S_IFDIR:
2253                 ret = ext2_create_dir_entries(trans, root, objectid,
2254                                 &btrfs_inode, ext2_fs, ext2_ino);
2255                 break;
2256         case S_IFLNK:
2257                 ret = ext2_create_symbol_link(trans, root, objectid,
2258                                 &btrfs_inode, ext2_fs, ext2_ino, ext2_inode);
2259                 break;
2260         default:
2261                 ret = 0;
2262                 break;
2263         }
2264         if (ret)
2265                 return ret;
2266
2267         if (!noxattr) {
2268                 ret = ext2_copy_extended_attrs(trans, root, objectid,
2269                                 &btrfs_inode, ext2_fs, ext2_ino);
2270                 if (ret)
2271                         return ret;
2272         }
2273         return btrfs_insert_inode(trans, root, objectid, &btrfs_inode);
2274 }
2275
2276 /*
2277  * scan ext2's inode bitmap and copy all used inodes.
2278  */
2279 static int ext2_copy_inodes(struct btrfs_convert_context *cctx,
2280                             struct btrfs_root *root,
2281                             int datacsum, int packing, int noxattr, struct task_ctx *p)
2282 {
2283         ext2_filsys ext2_fs = cctx->fs_data;
2284         int ret;
2285         errcode_t err;
2286         ext2_inode_scan ext2_scan;
2287         struct ext2_inode ext2_inode;
2288         ext2_ino_t ext2_ino;
2289         u64 objectid;
2290         struct btrfs_trans_handle *trans;
2291
2292         trans = btrfs_start_transaction(root, 1);
2293         if (!trans)
2294                 return -ENOMEM;
2295         err = ext2fs_open_inode_scan(ext2_fs, 0, &ext2_scan);
2296         if (err) {
2297                 fprintf(stderr, "ext2fs_open_inode_scan: %s\n", error_message(err));
2298                 return -1;
2299         }
2300         while (!(err = ext2fs_get_next_inode(ext2_scan, &ext2_ino,
2301                                              &ext2_inode))) {
2302                 /* no more inodes */
2303                 if (ext2_ino == 0)
2304                         break;
2305                 /* skip special inode in ext2fs */
2306                 if (ext2_ino < EXT2_GOOD_OLD_FIRST_INO &&
2307                     ext2_ino != EXT2_ROOT_INO)
2308                         continue;
2309                 objectid = ext2_ino + INO_OFFSET;
2310                 ret = ext2_copy_single_inode(trans, root,
2311                                         objectid, ext2_fs, ext2_ino,
2312                                         &ext2_inode, datacsum, packing,
2313                                         noxattr);
2314                 p->cur_copy_inodes++;
2315                 if (ret)
2316                         return ret;
2317                 if (trans->blocks_used >= 4096) {
2318                         ret = btrfs_commit_transaction(trans, root);
2319                         BUG_ON(ret);
2320                         trans = btrfs_start_transaction(root, 1);
2321                         BUG_ON(!trans);
2322                 }
2323         }
2324         if (err) {
2325                 fprintf(stderr, "ext2fs_get_next_inode: %s\n", error_message(err));
2326                 return -1;
2327         }
2328         ret = btrfs_commit_transaction(trans, root);
2329         BUG_ON(ret);
2330         ext2fs_close_inode_scan(ext2_scan);
2331
2332         return ret;
2333 }
2334
2335 static const struct btrfs_convert_operations ext2_convert_ops = {
2336         .name                   = "ext2",
2337         .open_fs                = ext2_open_fs,
2338         .read_used_space        = ext2_read_used_space,
2339         .copy_inodes            = ext2_copy_inodes,
2340         .close_fs               = ext2_close_fs,
2341         .check_state            = ext2_check_state,
2342 };
2343
2344 #endif
2345
2346 static const struct btrfs_convert_operations *convert_operations[] = {
2347 #if BTRFSCONVERT_EXT2
2348         &ext2_convert_ops,
2349 #endif
2350 };
2351
2352 static int convert_open_fs(const char *devname,
2353                            struct btrfs_convert_context *cctx)
2354 {
2355         int i;
2356
2357         memset(cctx, 0, sizeof(*cctx));
2358
2359         for (i = 0; i < ARRAY_SIZE(convert_operations); i++) {
2360                 int ret = convert_operations[i]->open_fs(cctx, devname);
2361
2362                 if (ret == 0) {
2363                         cctx->convert_ops = convert_operations[i];
2364                         return ret;
2365                 }
2366         }
2367
2368         error("no file system found to convert");
2369         return -1;
2370 }
2371
2372 static int do_convert(const char *devname, int datacsum, int packing,
2373                 int noxattr, u32 nodesize, int copylabel, const char *fslabel,
2374                 int progress, u64 features)
2375 {
2376         int ret;
2377         int fd = -1;
2378         u32 blocksize;
2379         u64 total_bytes;
2380         struct btrfs_root *root;
2381         struct btrfs_root *image_root;
2382         struct btrfs_convert_context cctx;
2383         struct btrfs_key key;
2384         char *subvol_name = NULL;
2385         struct task_ctx ctx;
2386         char features_buf[64];
2387         struct btrfs_mkfs_config mkfs_cfg;
2388
2389         init_convert_context(&cctx);
2390         ret = convert_open_fs(devname, &cctx);
2391         if (ret)
2392                 goto fail;
2393         ret = convert_check_state(&cctx);
2394         if (ret)
2395                 warning(
2396                 "source filesystem is not clean, running filesystem check is recommended");
2397         ret = convert_read_used_space(&cctx);
2398         if (ret)
2399                 goto fail;
2400
2401         blocksize = cctx.blocksize;
2402         total_bytes = (u64)blocksize * (u64)cctx.block_count;
2403         if (blocksize < 4096) {
2404                 error("block size is too small: %u < 4096", blocksize);
2405                 goto fail;
2406         }
2407         if (btrfs_check_nodesize(nodesize, blocksize, features))
2408                 goto fail;
2409         fd = open(devname, O_RDWR);
2410         if (fd < 0) {
2411                 error("unable to open %s: %s", devname, strerror(errno));
2412                 goto fail;
2413         }
2414         btrfs_parse_features_to_string(features_buf, features);
2415         if (features == BTRFS_MKFS_DEFAULT_FEATURES)
2416                 strcat(features_buf, " (default)");
2417
2418         printf("create btrfs filesystem:\n");
2419         printf("\tblocksize: %u\n", blocksize);
2420         printf("\tnodesize:  %u\n", nodesize);
2421         printf("\tfeatures:  %s\n", features_buf);
2422
2423         mkfs_cfg.label = cctx.volume_name;
2424         mkfs_cfg.num_bytes = total_bytes;
2425         mkfs_cfg.nodesize = nodesize;
2426         mkfs_cfg.sectorsize = blocksize;
2427         mkfs_cfg.stripesize = blocksize;
2428         mkfs_cfg.features = features;
2429         /* New convert need these space */
2430         memset(mkfs_cfg.chunk_uuid, 0, BTRFS_UUID_UNPARSED_SIZE);
2431         memset(mkfs_cfg.fs_uuid, 0, BTRFS_UUID_UNPARSED_SIZE);
2432
2433         ret = make_btrfs(fd, &mkfs_cfg, &cctx);
2434         if (ret) {
2435                 error("unable to create initial ctree: %s", strerror(-ret));
2436                 goto fail;
2437         }
2438
2439         root = open_ctree_fd(fd, devname, mkfs_cfg.super_bytenr,
2440                              OPEN_CTREE_WRITES | OPEN_CTREE_FS_PARTIAL);
2441         if (!root) {
2442                 error("unable to open ctree");
2443                 goto fail;
2444         }
2445         ret = init_btrfs(&mkfs_cfg, root, &cctx, datacsum, packing, noxattr);
2446         if (ret) {
2447                 error("unable to setup the root tree: %d", ret);
2448                 goto fail;
2449         }
2450
2451         printf("creating %s image file\n", cctx.convert_ops->name);
2452         ret = asprintf(&subvol_name, "%s_saved", cctx.convert_ops->name);
2453         if (ret < 0) {
2454                 error("memory allocation failure for subvolume name: %s_saved",
2455                         cctx.convert_ops->name);
2456                 goto fail;
2457         }
2458         key.objectid = CONV_IMAGE_SUBVOL_OBJECTID;
2459         key.offset = (u64)-1;
2460         key.type = BTRFS_ROOT_ITEM_KEY;
2461         image_root = btrfs_read_fs_root(root->fs_info, &key);
2462         if (!image_root) {
2463                 error("unable to create image subvolume");
2464                 goto fail;
2465         }
2466         ret = create_image(image_root, &mkfs_cfg, &cctx, fd,
2467                               mkfs_cfg.num_bytes, "image", datacsum);
2468         if (ret) {
2469                 error("failed to create %s/image: %d", subvol_name, ret);
2470                 goto fail;
2471         }
2472
2473         printf("creating btrfs metadata");
2474         ctx.max_copy_inodes = (cctx.inodes_count - cctx.free_inodes_count);
2475         ctx.cur_copy_inodes = 0;
2476
2477         if (progress) {
2478                 ctx.info = task_init(print_copied_inodes, after_copied_inodes,
2479                                      &ctx);
2480                 task_start(ctx.info);
2481         }
2482         ret = copy_inodes(&cctx, root, datacsum, packing, noxattr, &ctx);
2483         if (ret) {
2484                 error("error during copy_inodes %d", ret);
2485                 goto fail;
2486         }
2487         if (progress) {
2488                 task_stop(ctx.info);
2489                 task_deinit(ctx.info);
2490         }
2491
2492         image_root = link_subvol(root, subvol_name, CONV_IMAGE_SUBVOL_OBJECTID);
2493         if (!image_root) {
2494                 error("unable to link subvolume %s", subvol_name);
2495                 goto fail;
2496         }
2497
2498         free(subvol_name);
2499
2500         memset(root->fs_info->super_copy->label, 0, BTRFS_LABEL_SIZE);
2501         if (copylabel == 1) {
2502                 __strncpy_null(root->fs_info->super_copy->label,
2503                                 cctx.volume_name, BTRFS_LABEL_SIZE - 1);
2504                 printf("copy label '%s'\n", root->fs_info->super_copy->label);
2505         } else if (copylabel == -1) {
2506                 strcpy(root->fs_info->super_copy->label, fslabel);
2507                 printf("set label to '%s'\n", fslabel);
2508         }
2509
2510         ret = close_ctree(root);
2511         if (ret) {
2512                 error("close_ctree failed: %d", ret);
2513                 goto fail;
2514         }
2515         convert_close_fs(&cctx);
2516         clean_convert_context(&cctx);
2517
2518         /*
2519          * If this step succeed, we get a mountable btrfs. Otherwise
2520          * the source fs is left unchanged.
2521          */
2522         ret = migrate_super_block(fd, mkfs_cfg.super_bytenr, blocksize);
2523         if (ret) {
2524                 error("unable to migrate super block: %d", ret);
2525                 goto fail;
2526         }
2527
2528         root = open_ctree_fd(fd, devname, 0,
2529                         OPEN_CTREE_WRITES | OPEN_CTREE_FS_PARTIAL);
2530         if (!root) {
2531                 error("unable to open ctree for finalization");
2532                 goto fail;
2533         }
2534         root->fs_info->finalize_on_close = 1;
2535         close_ctree(root);
2536         close(fd);
2537
2538         printf("conversion complete");
2539         return 0;
2540 fail:
2541         clean_convert_context(&cctx);
2542         if (fd != -1)
2543                 close(fd);
2544         warning(
2545 "an error occurred during conversion, filesystem is partially created but not finalized and not mountable");
2546         return -1;
2547 }
2548
2549 /*
2550  * Check if a non 1:1 mapped chunk can be rolled back.
2551  * For new convert, it's OK while for old convert it's not.
2552  */
2553 static int may_rollback_chunk(struct btrfs_fs_info *fs_info, u64 bytenr)
2554 {
2555         struct btrfs_block_group_cache *bg;
2556         struct btrfs_key key;
2557         struct btrfs_path path;
2558         struct btrfs_root *extent_root = fs_info->extent_root;
2559         u64 bg_start;
2560         u64 bg_end;
2561         int ret;
2562
2563         bg = btrfs_lookup_first_block_group(fs_info, bytenr);
2564         if (!bg)
2565                 return -ENOENT;
2566         bg_start = bg->key.objectid;
2567         bg_end = bg->key.objectid + bg->key.offset;
2568
2569         key.objectid = bg_end;
2570         key.type = BTRFS_METADATA_ITEM_KEY;
2571         key.offset = 0;
2572         btrfs_init_path(&path);
2573
2574         ret = btrfs_search_slot(NULL, extent_root, &key, &path, 0, 0);
2575         if (ret < 0)
2576                 return ret;
2577
2578         while (1) {
2579                 struct btrfs_extent_item *ei;
2580
2581                 ret = btrfs_previous_extent_item(extent_root, &path, bg_start);
2582                 if (ret > 0) {
2583                         ret = 0;
2584                         break;
2585                 }
2586                 if (ret < 0)
2587                         break;
2588
2589                 btrfs_item_key_to_cpu(path.nodes[0], &key, path.slots[0]);
2590                 if (key.type == BTRFS_METADATA_ITEM_KEY)
2591                         continue;
2592                 /* Now it's EXTENT_ITEM_KEY only */
2593                 ei = btrfs_item_ptr(path.nodes[0], path.slots[0],
2594                                     struct btrfs_extent_item);
2595                 /*
2596                  * Found data extent, means this is old convert must follow 1:1
2597                  * mapping.
2598                  */
2599                 if (btrfs_extent_flags(path.nodes[0], ei)
2600                                 & BTRFS_EXTENT_FLAG_DATA) {
2601                         ret = -EINVAL;
2602                         break;
2603                 }
2604         }
2605         btrfs_release_path(&path);
2606         return ret;
2607 }
2608
2609 static int may_rollback(struct btrfs_root *root)
2610 {
2611         struct btrfs_fs_info *info = root->fs_info;
2612         struct btrfs_multi_bio *multi = NULL;
2613         u64 bytenr;
2614         u64 length;
2615         u64 physical;
2616         u64 total_bytes;
2617         int num_stripes;
2618         int ret;
2619
2620         if (btrfs_super_num_devices(info->super_copy) != 1)
2621                 goto fail;
2622
2623         bytenr = BTRFS_SUPER_INFO_OFFSET;
2624         total_bytes = btrfs_super_total_bytes(root->fs_info->super_copy);
2625
2626         while (1) {
2627                 ret = btrfs_map_block(&info->mapping_tree, WRITE, bytenr,
2628                                       &length, &multi, 0, NULL);
2629                 if (ret) {
2630                         if (ret == -ENOENT) {
2631                                 /* removed block group at the tail */
2632                                 if (length == (u64)-1)
2633                                         break;
2634
2635                                 /* removed block group in the middle */
2636                                 goto next;
2637                         }
2638                         goto fail;
2639                 }
2640
2641                 num_stripes = multi->num_stripes;
2642                 physical = multi->stripes[0].physical;
2643                 free(multi);
2644
2645                 if (num_stripes != 1) {
2646                         error("num stripes for bytenr %llu is not 1", bytenr);
2647                         goto fail;
2648                 }
2649
2650                 /*
2651                  * Extra check for new convert, as metadata chunk from new
2652                  * convert is much more free than old convert, it doesn't need
2653                  * to do 1:1 mapping.
2654                  */
2655                 if (physical != bytenr) {
2656                         /*
2657                          * Check if it's a metadata chunk and has only metadata
2658                          * extent.
2659                          */
2660                         ret = may_rollback_chunk(info, bytenr);
2661                         if (ret < 0)
2662                                 goto fail;
2663                 }
2664 next:
2665                 bytenr += length;
2666                 if (bytenr >= total_bytes)
2667                         break;
2668         }
2669         return 0;
2670 fail:
2671         return -1;
2672 }
2673
2674 static int do_rollback(const char *devname)
2675 {
2676         int fd = -1;
2677         int ret;
2678         int i;
2679         struct btrfs_root *root;
2680         struct btrfs_root *image_root;
2681         struct btrfs_root *chunk_root;
2682         struct btrfs_dir_item *dir;
2683         struct btrfs_inode_item *inode;
2684         struct btrfs_file_extent_item *fi;
2685         struct btrfs_trans_handle *trans;
2686         struct extent_buffer *leaf;
2687         struct btrfs_block_group_cache *cache1;
2688         struct btrfs_block_group_cache *cache2;
2689         struct btrfs_key key;
2690         struct btrfs_path path;
2691         struct extent_io_tree io_tree;
2692         char *buf = NULL;
2693         char *name;
2694         u64 bytenr;
2695         u64 num_bytes;
2696         u64 root_dir;
2697         u64 objectid;
2698         u64 offset;
2699         u64 start;
2700         u64 end;
2701         u64 sb_bytenr;
2702         u64 first_free;
2703         u64 total_bytes;
2704         u32 sectorsize;
2705
2706         extent_io_tree_init(&io_tree);
2707
2708         fd = open(devname, O_RDWR);
2709         if (fd < 0) {
2710                 error("unable to open %s: %s", devname, strerror(errno));
2711                 goto fail;
2712         }
2713         root = open_ctree_fd(fd, devname, 0, OPEN_CTREE_WRITES);
2714         if (!root) {
2715                 error("unable to open ctree");
2716                 goto fail;
2717         }
2718         ret = may_rollback(root);
2719         if (ret < 0) {
2720                 error("unable to do rollback: %d", ret);
2721                 goto fail;
2722         }
2723
2724         sectorsize = root->sectorsize;
2725         buf = malloc(sectorsize);
2726         if (!buf) {
2727                 error("unable to allocate memory");
2728                 goto fail;
2729         }
2730
2731         btrfs_init_path(&path);
2732
2733         key.objectid = CONV_IMAGE_SUBVOL_OBJECTID;
2734         key.type = BTRFS_ROOT_BACKREF_KEY;
2735         key.offset = BTRFS_FS_TREE_OBJECTID;
2736         ret = btrfs_search_slot(NULL, root->fs_info->tree_root, &key, &path, 0,
2737                                 0);
2738         btrfs_release_path(&path);
2739         if (ret > 0) {
2740                 error("unable to convert ext2 image subvolume, is it deleted?");
2741                 goto fail;
2742         } else if (ret < 0) {
2743                 error("unable to open ext2_saved, id %llu: %s",
2744                         (unsigned long long)key.objectid, strerror(-ret));
2745                 goto fail;
2746         }
2747
2748         key.objectid = CONV_IMAGE_SUBVOL_OBJECTID;
2749         key.type = BTRFS_ROOT_ITEM_KEY;
2750         key.offset = (u64)-1;
2751         image_root = btrfs_read_fs_root(root->fs_info, &key);
2752         if (!image_root || IS_ERR(image_root)) {
2753                 error("unable to open subvolume %llu: %ld",
2754                         (unsigned long long)key.objectid, PTR_ERR(image_root));
2755                 goto fail;
2756         }
2757
2758         name = "image";
2759         root_dir = btrfs_root_dirid(&root->root_item);
2760         dir = btrfs_lookup_dir_item(NULL, image_root, &path,
2761                                    root_dir, name, strlen(name), 0);
2762         if (!dir || IS_ERR(dir)) {
2763                 error("unable to find file %s: %ld", name, PTR_ERR(dir));
2764                 goto fail;
2765         }
2766         leaf = path.nodes[0];
2767         btrfs_dir_item_key_to_cpu(leaf, dir, &key);
2768         btrfs_release_path(&path);
2769
2770         objectid = key.objectid;
2771
2772         ret = btrfs_lookup_inode(NULL, image_root, &path, &key, 0);
2773         if (ret) {
2774                 error("unable to find inode item: %d", ret);
2775                 goto fail;
2776         }
2777         leaf = path.nodes[0];
2778         inode = btrfs_item_ptr(leaf, path.slots[0], struct btrfs_inode_item);
2779         total_bytes = btrfs_inode_size(leaf, inode);
2780         btrfs_release_path(&path);
2781
2782         key.objectid = objectid;
2783         key.offset = 0;
2784         key.type = BTRFS_EXTENT_DATA_KEY;
2785         ret = btrfs_search_slot(NULL, image_root, &key, &path, 0, 0);
2786         if (ret != 0) {
2787                 error("unable to find first file extent: %d", ret);
2788                 btrfs_release_path(&path);
2789                 goto fail;
2790         }
2791
2792         /* build mapping tree for the relocated blocks */
2793         for (offset = 0; offset < total_bytes; ) {
2794                 leaf = path.nodes[0];
2795                 if (path.slots[0] >= btrfs_header_nritems(leaf)) {
2796                         ret = btrfs_next_leaf(root, &path);
2797                         if (ret != 0)
2798                                 break;
2799                         continue;
2800                 }
2801
2802                 btrfs_item_key_to_cpu(leaf, &key, path.slots[0]);
2803                 if (key.objectid != objectid || key.offset != offset ||
2804                     key.type != BTRFS_EXTENT_DATA_KEY)
2805                         break;
2806
2807                 fi = btrfs_item_ptr(leaf, path.slots[0],
2808                                     struct btrfs_file_extent_item);
2809                 if (btrfs_file_extent_type(leaf, fi) != BTRFS_FILE_EXTENT_REG)
2810                         break;
2811                 if (btrfs_file_extent_compression(leaf, fi) ||
2812                     btrfs_file_extent_encryption(leaf, fi) ||
2813                     btrfs_file_extent_other_encoding(leaf, fi))
2814                         break;
2815
2816                 bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
2817                 /* skip holes and direct mapped extents */
2818                 if (bytenr == 0 || bytenr == offset)
2819                         goto next_extent;
2820
2821                 bytenr += btrfs_file_extent_offset(leaf, fi);
2822                 num_bytes = btrfs_file_extent_num_bytes(leaf, fi);
2823
2824                 cache1 = btrfs_lookup_block_group(root->fs_info, offset);
2825                 cache2 = btrfs_lookup_block_group(root->fs_info,
2826                                                   offset + num_bytes - 1);
2827                 /*
2828                  * Here we must take consideration of old and new convert
2829                  * behavior.
2830                  * For old convert case, sign, there is no consist chunk type
2831                  * that will cover the extent. META/DATA/SYS are all possible.
2832                  * Just ensure relocate one is in SYS chunk.
2833                  * For new convert case, they are all covered by DATA chunk.
2834                  *
2835                  * So, there is not valid chunk type check for it now.
2836                  */
2837                 if (cache1 != cache2)
2838                         break;
2839
2840                 set_extent_bits(&io_tree, offset, offset + num_bytes - 1,
2841                                 EXTENT_LOCKED, GFP_NOFS);
2842                 set_state_private(&io_tree, offset, bytenr);
2843 next_extent:
2844                 offset += btrfs_file_extent_num_bytes(leaf, fi);
2845                 path.slots[0]++;
2846         }
2847         btrfs_release_path(&path);
2848
2849         if (offset < total_bytes) {
2850                 error("unable to build extent mapping (offset %llu, total_bytes %llu)",
2851                                 (unsigned long long)offset,
2852                                 (unsigned long long)total_bytes);
2853                 error("converted filesystem after balance is unable to rollback");
2854                 goto fail;
2855         }
2856
2857         first_free = BTRFS_SUPER_INFO_OFFSET + 2 * sectorsize - 1;
2858         first_free &= ~((u64)sectorsize - 1);
2859         /* backup for extent #0 should exist */
2860         if(!test_range_bit(&io_tree, 0, first_free - 1, EXTENT_LOCKED, 1)) {
2861                 error("no backup for the first extent");
2862                 goto fail;
2863         }
2864         /* force no allocation from system block group */
2865         root->fs_info->system_allocs = -1;
2866         trans = btrfs_start_transaction(root, 1);
2867         if (!trans) {
2868                 error("unable to start transaction");
2869                 goto fail;
2870         }
2871         /*
2872          * recow the whole chunk tree, this will remove all chunk tree blocks
2873          * from system block group
2874          */
2875         chunk_root = root->fs_info->chunk_root;
2876         memset(&key, 0, sizeof(key));
2877         while (1) {
2878                 ret = btrfs_search_slot(trans, chunk_root, &key, &path, 0, 1);
2879                 if (ret < 0)
2880                         break;
2881
2882                 ret = btrfs_next_leaf(chunk_root, &path);
2883                 if (ret)
2884                         break;
2885
2886                 btrfs_item_key_to_cpu(path.nodes[0], &key, path.slots[0]);
2887                 btrfs_release_path(&path);
2888         }
2889         btrfs_release_path(&path);
2890
2891         offset = 0;
2892         num_bytes = 0;
2893         while(1) {
2894                 cache1 = btrfs_lookup_block_group(root->fs_info, offset);
2895                 if (!cache1)
2896                         break;
2897
2898                 if (cache1->flags & BTRFS_BLOCK_GROUP_SYSTEM)
2899                         num_bytes += btrfs_block_group_used(&cache1->item);
2900
2901                 offset = cache1->key.objectid + cache1->key.offset;
2902         }
2903         /* only extent #0 left in system block group? */
2904         if (num_bytes > first_free) {
2905                 error(
2906         "unable to empty system block group (num_bytes %llu, first_free %llu",
2907                                 (unsigned long long)num_bytes,
2908                                 (unsigned long long)first_free);
2909                 goto fail;
2910         }
2911         /* create a system chunk that maps the whole device */
2912         ret = prepare_system_chunk_sb(root->fs_info->super_copy);
2913         if (ret) {
2914                 error("unable to update system chunk: %d", ret);
2915                 goto fail;
2916         }
2917
2918         ret = btrfs_commit_transaction(trans, root);
2919         if (ret) {
2920                 error("transaction commit failed: %d", ret);
2921                 goto fail;
2922         }
2923
2924         ret = close_ctree(root);
2925         if (ret) {
2926                 error("close_ctree failed: %d", ret);
2927                 goto fail;
2928         }
2929
2930         /* zero btrfs super block mirrors */
2931         memset(buf, 0, sectorsize);
2932         for (i = 1 ; i < BTRFS_SUPER_MIRROR_MAX; i++) {
2933                 bytenr = btrfs_sb_offset(i);
2934                 if (bytenr >= total_bytes)
2935                         break;
2936                 ret = pwrite(fd, buf, sectorsize, bytenr);
2937                 if (ret != sectorsize) {
2938                         error("zeroing superblock mirror %d failed: %d",
2939                                         i, ret);
2940                         goto fail;
2941                 }
2942         }
2943
2944         sb_bytenr = (u64)-1;
2945         /* copy all relocated blocks back */
2946         while(1) {
2947                 ret = find_first_extent_bit(&io_tree, 0, &start, &end,
2948                                             EXTENT_LOCKED);
2949                 if (ret)
2950                         break;
2951
2952                 ret = get_state_private(&io_tree, start, &bytenr);
2953                 BUG_ON(ret);
2954
2955                 clear_extent_bits(&io_tree, start, end, EXTENT_LOCKED,
2956                                   GFP_NOFS);
2957
2958                 while (start <= end) {
2959                         if (start == BTRFS_SUPER_INFO_OFFSET) {
2960                                 sb_bytenr = bytenr;
2961                                 goto next_sector;
2962                         }
2963                         ret = pread(fd, buf, sectorsize, bytenr);
2964                         if (ret < 0) {
2965                                 error("reading superblock at %llu failed: %d",
2966                                                 (unsigned long long)bytenr, ret);
2967                                 goto fail;
2968                         }
2969                         BUG_ON(ret != sectorsize);
2970                         ret = pwrite(fd, buf, sectorsize, start);
2971                         if (ret < 0) {
2972                                 error("writing superblock at %llu failed: %d",
2973                                                 (unsigned long long)start, ret);
2974                                 goto fail;
2975                         }
2976                         BUG_ON(ret != sectorsize);
2977 next_sector:
2978                         start += sectorsize;
2979                         bytenr += sectorsize;
2980                 }
2981         }
2982
2983         ret = fsync(fd);
2984         if (ret < 0) {
2985                 error("fsync failed: %s", strerror(errno));
2986                 goto fail;
2987         }
2988         /*
2989          * finally, overwrite btrfs super block.
2990          */
2991         ret = pread(fd, buf, sectorsize, sb_bytenr);
2992         if (ret < 0) {
2993                 error("reading primary superblock failed: %s",
2994                                 strerror(errno));
2995                 goto fail;
2996         }
2997         BUG_ON(ret != sectorsize);
2998         ret = pwrite(fd, buf, sectorsize, BTRFS_SUPER_INFO_OFFSET);
2999         if (ret < 0) {
3000                 error("writing primary superblock failed: %s",
3001                                 strerror(errno));
3002                 goto fail;
3003         }
3004         BUG_ON(ret != sectorsize);
3005         ret = fsync(fd);
3006         if (ret < 0) {
3007                 error("fsync failed: %s", strerror(errno));
3008                 goto fail;
3009         }
3010
3011         close(fd);
3012         free(buf);
3013         extent_io_tree_cleanup(&io_tree);
3014         printf("rollback complete\n");
3015         return 0;
3016
3017 fail:
3018         if (fd != -1)
3019                 close(fd);
3020         free(buf);
3021         error("rollback aborted");
3022         return -1;
3023 }
3024
3025 static void print_usage(void)
3026 {
3027         printf("usage: btrfs-convert [options] device\n");
3028         printf("options:\n");
3029         printf("\t-d|--no-datasum        disable data checksum, sets NODATASUM\n");
3030         printf("\t-i|--no-xattr          ignore xattrs and ACLs\n");
3031         printf("\t-n|--no-inline         disable inlining of small files to metadata\n");
3032         printf("\t-N|--nodesize SIZE     set filesystem metadata nodesize\n");
3033         printf("\t-r|--rollback          roll back to the original filesystem\n");
3034         printf("\t-l|--label LABEL       set filesystem label\n");
3035         printf("\t-L|--copy-label        use label from converted filesystem\n");
3036         printf("\t-p|--progress          show converting progress (default)\n");
3037         printf("\t-O|--features LIST     comma separated list of filesystem features\n");
3038         printf("\t--no-progress          show only overview, not the detailed progress\n");
3039         printf("\n");
3040         printf("Supported filesystems:\n");
3041         printf("\text2/3/4: %s\n", BTRFSCONVERT_EXT2 ? "yes" : "no");
3042 }
3043
3044 int main(int argc, char *argv[])
3045 {
3046         int ret;
3047         int packing = 1;
3048         int noxattr = 0;
3049         int datacsum = 1;
3050         u32 nodesize = max_t(u32, sysconf(_SC_PAGESIZE),
3051                         BTRFS_MKFS_DEFAULT_NODE_SIZE);
3052         int rollback = 0;
3053         int copylabel = 0;
3054         int usage_error = 0;
3055         int progress = 1;
3056         char *file;
3057         char fslabel[BTRFS_LABEL_SIZE];
3058         u64 features = BTRFS_MKFS_DEFAULT_FEATURES;
3059
3060         while(1) {
3061                 enum { GETOPT_VAL_NO_PROGRESS = 256 };
3062                 static const struct option long_options[] = {
3063                         { "no-progress", no_argument, NULL,
3064                                 GETOPT_VAL_NO_PROGRESS },
3065                         { "no-datasum", no_argument, NULL, 'd' },
3066                         { "no-inline", no_argument, NULL, 'n' },
3067                         { "no-xattr", no_argument, NULL, 'i' },
3068                         { "rollback", no_argument, NULL, 'r' },
3069                         { "features", required_argument, NULL, 'O' },
3070                         { "progress", no_argument, NULL, 'p' },
3071                         { "label", required_argument, NULL, 'l' },
3072                         { "copy-label", no_argument, NULL, 'L' },
3073                         { "nodesize", required_argument, NULL, 'N' },
3074                         { "help", no_argument, NULL, GETOPT_VAL_HELP},
3075                         { NULL, 0, NULL, 0 }
3076                 };
3077                 int c = getopt_long(argc, argv, "dinN:rl:LpO:", long_options, NULL);
3078
3079                 if (c < 0)
3080                         break;
3081                 switch(c) {
3082                         case 'd':
3083                                 datacsum = 0;
3084                                 break;
3085                         case 'i':
3086                                 noxattr = 1;
3087                                 break;
3088                         case 'n':
3089                                 packing = 0;
3090                                 break;
3091                         case 'N':
3092                                 nodesize = parse_size(optarg);
3093                                 break;
3094                         case 'r':
3095                                 rollback = 1;
3096                                 break;
3097                         case 'l':
3098                                 copylabel = -1;
3099                                 if (strlen(optarg) >= BTRFS_LABEL_SIZE) {
3100                                         warning(
3101                                         "label too long, trimmed to %d bytes",
3102                                                 BTRFS_LABEL_SIZE - 1);
3103                                 }
3104                                 __strncpy_null(fslabel, optarg, BTRFS_LABEL_SIZE - 1);
3105                                 break;
3106                         case 'L':
3107                                 copylabel = 1;
3108                                 break;
3109                         case 'p':
3110                                 progress = 1;
3111                                 break;
3112                         case 'O': {
3113                                 char *orig = strdup(optarg);
3114                                 char *tmp = orig;
3115
3116                                 tmp = btrfs_parse_fs_features(tmp, &features);
3117                                 if (tmp) {
3118                                         error("unrecognized filesystem feature: %s",
3119                                                         tmp);
3120                                         free(orig);
3121                                         exit(1);
3122                                 }
3123                                 free(orig);
3124                                 if (features & BTRFS_FEATURE_LIST_ALL) {
3125                                         btrfs_list_all_fs_features(
3126                                                 ~BTRFS_CONVERT_ALLOWED_FEATURES);
3127                                         exit(0);
3128                                 }
3129                                 if (features & ~BTRFS_CONVERT_ALLOWED_FEATURES) {
3130                                         char buf[64];
3131
3132                                         btrfs_parse_features_to_string(buf,
3133                                                 features & ~BTRFS_CONVERT_ALLOWED_FEATURES);
3134                                         error("features not allowed for convert: %s",
3135                                                 buf);
3136                                         exit(1);
3137                                 }
3138
3139                                 break;
3140                                 }
3141                         case GETOPT_VAL_NO_PROGRESS:
3142                                 progress = 0;
3143                                 break;
3144                         case GETOPT_VAL_HELP:
3145                         default:
3146                                 print_usage();
3147                                 return c != GETOPT_VAL_HELP;
3148                 }
3149         }
3150         set_argv0(argv);
3151         if (check_argc_exact(argc - optind, 1)) {
3152                 print_usage();
3153                 return 1;
3154         }
3155
3156         if (rollback && (!datacsum || noxattr || !packing)) {
3157                 fprintf(stderr,
3158                         "Usage error: -d, -i, -n options do not apply to rollback\n");
3159                 usage_error++;
3160         }
3161
3162         if (usage_error) {
3163                 print_usage();
3164                 return 1;
3165         }
3166
3167         file = argv[optind];
3168         ret = check_mounted(file);
3169         if (ret < 0) {
3170                 error("could not check mount status: %s", strerror(-ret));
3171                 return 1;
3172         } else if (ret) {
3173                 error("%s is mounted", file);
3174                 return 1;
3175         }
3176
3177         if (rollback) {
3178                 ret = do_rollback(file);
3179         } else {
3180                 ret = do_convert(file, datacsum, packing, noxattr, nodesize,
3181                                 copylabel, fslabel, progress, features);
3182         }
3183         if (ret)
3184                 return 1;
3185         return 0;
3186 }