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