fs/btrfs/relocation.c

   1 /*
   2  * Copyright (C) 2009 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 <linux/sched.h>
  20 #include <linux/pagemap.h>
  21 #include <linux/writeback.h>
  22 #include <linux/blkdev.h>
  23 #include <linux/rbtree.h>
  24 #include <linux/slab.h>
  25 #include "ctree.h"
  26 #include "disk-io.h"
  27 #include "transaction.h"
  28 #include "volumes.h"
  29 #include "locking.h"
  30 #include "btrfs_inode.h"
  31 #include "async-thread.h"
  32 #include "free-space-cache.h"
  33 #include "inode-map.h"
  34
  35 /*
  36  * backref_node, mapping_node and tree_block start with this
  37  */
  38 struct tree_entry {
  39         struct rb_node rb_node;
  40         u64 bytenr;
  41 };
  42
  43 /*
  44  * present a tree block in the backref cache
  45  */
  46 struct backref_node {
  47         struct rb_node rb_node;
  48         u64 bytenr;
  49
  50         u64 new_bytenr;
  51         /* objectid of tree block owner, can be not uptodate */
  52         u64 owner;
  53         /* link to pending, changed or detached list */
  54         struct list_head list;
  55         /* list of upper level blocks reference this block */
  56         struct list_head upper;
  57         /* list of child blocks in the cache */
  58         struct list_head lower;
  59         /* NULL if this node is not tree root */
  60         struct btrfs_root *root;
  61         /* extent buffer got by COW the block */
  62         struct extent_buffer *eb;
  63         /* level of tree block */
  64         unsigned int level:8;
  65         /* is the block in non-reference counted tree */
  66         unsigned int cowonly:1;
  67         /* 1 if no child node in the cache */
  68         unsigned int lowest:1;
  69         /* is the extent buffer locked */
  70         unsigned int locked:1;
  71         /* has the block been processed */
  72         unsigned int processed:1;
  73         /* have backrefs of this block been checked */
  74         unsigned int checked:1;
  75         /*
  76          * 1 if corresponding block has been cowed but some upper
  77          * level block pointers may not point to the new location
  78          */
  79         unsigned int pending:1;
  80         /*
  81          * 1 if the backref node isn't connected to any other
  82          * backref node.
  83          */
  84         unsigned int detached:1;
  85 };
  86
  87 /*
  88  * present a block pointer in the backref cache
  89  */
  90 struct backref_edge {
  91         struct list_head list[2];
  92         struct backref_node *node[2];
  93 };
  94
  95 #define LOWER   0
  96 #define UPPER   1
  97 #define RELOCATION_RESERVED_NODES       256
  98
  99 struct backref_cache {
 100         /* red black tree of all backref nodes in the cache */
 101         struct rb_root rb_root;
 102         /* for passing backref nodes to btrfs_reloc_cow_block */
 103         struct backref_node *path[BTRFS_MAX_LEVEL];
 104         /*
 105          * list of blocks that have been cowed but some block
 106          * pointers in upper level blocks may not reflect the
 107          * new location
 108          */
 109         struct list_head pending[BTRFS_MAX_LEVEL];
 110         /* list of backref nodes with no child node */
 111         struct list_head leaves;
 112         /* list of blocks that have been cowed in current transaction */
 113         struct list_head changed;
 114         /* list of detached backref node. */
 115         struct list_head detached;
 116
 117         u64 last_trans;
 118
 119         int nr_nodes;
 120         int nr_edges;
 121 };
 122
 123 /*
 124  * map address of tree root to tree
 125  */
 126 struct mapping_node {
 127         struct rb_node rb_node;
 128         u64 bytenr;
 129         void *data;
 130 };
 131
 132 struct mapping_tree {
 133         struct rb_root rb_root;
 134         spinlock_t lock;
 135 };
 136
 137 /*
 138  * present a tree block to process
 139  */
 140 struct tree_block {
 141         struct rb_node rb_node;
 142         u64 bytenr;
 143         struct btrfs_key key;
 144         unsigned int level:8;
 145         unsigned int key_ready:1;
 146 };
 147
 148 #define MAX_EXTENTS 128
 149
 150 struct file_extent_cluster {
 151         u64 start;
 152         u64 end;
 153         u64 boundary[MAX_EXTENTS];
 154         unsigned int nr;
 155 };
 156
 157 struct reloc_control {
 158         /* block group to relocate */
 159         struct btrfs_block_group_cache *block_group;
 160         /* extent tree */
 161         struct btrfs_root *extent_root;
 162         /* inode for moving data */
 163         struct inode *data_inode;
 164
 165         struct btrfs_block_rsv *block_rsv;
 166
 167         struct backref_cache backref_cache;
 168
 169         struct file_extent_cluster cluster;
 170         /* tree blocks have been processed */
 171         struct extent_io_tree processed_blocks;
 172         /* map start of tree root to corresponding reloc tree */
 173         struct mapping_tree reloc_root_tree;
 174         /* list of reloc trees */
 175         struct list_head reloc_roots;
 176         /* size of metadata reservation for merging reloc trees */
 177         u64 merging_rsv_size;
 178         /* size of relocated tree nodes */
 179         u64 nodes_relocated;
 180         /* reserved size for block group relocation*/
 181         u64 reserved_bytes;
 182
 183         u64 search_start;
 184         u64 extents_found;
 185
 186         unsigned int stage:8;
 187         unsigned int create_reloc_tree:1;
 188         unsigned int merge_reloc_tree:1;
 189         unsigned int found_file_extent:1;
 190 };
 191
 192 /* stages of data relocation */
 193 #define MOVE_DATA_EXTENTS       0
 194 #define UPDATE_DATA_PTRS        1
 195
 196 static void remove_backref_node(struct backref_cache *cache,
 197                                 struct backref_node *node);
 198 static void __mark_block_processed(struct reloc_control *rc,
 199                                    struct backref_node *node);
 200
 201 static void mapping_tree_init(struct mapping_tree *tree)
 202 {
 203         tree->rb_root = RB_ROOT;
 204         spin_lock_init(&tree->lock);
 205 }
 206
 207 static void backref_cache_init(struct backref_cache *cache)
 208 {
 209         int i;
 210         cache->rb_root = RB_ROOT;
 211         for (i = 0; i < BTRFS_MAX_LEVEL; i++)
 212                 INIT_LIST_HEAD(&cache->pending[i]);
 213         INIT_LIST_HEAD(&cache->changed);
 214         INIT_LIST_HEAD(&cache->detached);
 215         INIT_LIST_HEAD(&cache->leaves);
 216 }
 217
 218 static void backref_cache_cleanup(struct backref_cache *cache)
 219 {
 220         struct backref_node *node;
 221         int i;
 222
 223         while (!list_empty(&cache->detached)) {
 224                 node = list_entry(cache->detached.next,
 225                                   struct backref_node, list);
 226                 remove_backref_node(cache, node);
 227         }
 228
 229         while (!list_empty(&cache->leaves)) {
 230                 node = list_entry(cache->leaves.next,
 231                                   struct backref_node, lower);
 232                 remove_backref_node(cache, node);
 233         }
 234
 235         cache->last_trans = 0;
 236
 237         for (i = 0; i < BTRFS_MAX_LEVEL; i++)
 238                 BUG_ON(!list_empty(&cache->pending[i]));
 239         BUG_ON(!list_empty(&cache->changed));
 240         BUG_ON(!list_empty(&cache->detached));
 241         BUG_ON(!RB_EMPTY_ROOT(&cache->rb_root));
 242         BUG_ON(cache->nr_nodes);
 243         BUG_ON(cache->nr_edges);
 244 }
 245
 246 static struct backref_node *alloc_backref_node(struct backref_cache *cache)
 247 {
 248         struct backref_node *node;
 249
 250         node = kzalloc(sizeof(*node), GFP_NOFS);
 251         if (node) {
 252                 INIT_LIST_HEAD(&node->list);
 253                 INIT_LIST_HEAD(&node->upper);
 254                 INIT_LIST_HEAD(&node->lower);
 255                 RB_CLEAR_NODE(&node->rb_node);
 256                 cache->nr_nodes++;
 257         }
 258         return node;
 259 }
 260
 261 static void free_backref_node(struct backref_cache *cache,
 262                               struct backref_node *node)
 263 {
 264         if (node) {
 265                 cache->nr_nodes--;
 266                 kfree(node);
 267         }
 268 }
 269
 270 static struct backref_edge *alloc_backref_edge(struct backref_cache *cache)
 271 {
 272         struct backref_edge *edge;
 273
 274         edge = kzalloc(sizeof(*edge), GFP_NOFS);
 275         if (edge)
 276                 cache->nr_edges++;
 277         return edge;
 278 }
 279
 280 static void free_backref_edge(struct backref_cache *cache,
 281                               struct backref_edge *edge)
 282 {
 283         if (edge) {
 284                 cache->nr_edges--;
 285                 kfree(edge);
 286         }
 287 }
 288
 289 static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr,
 290                                    struct rb_node *node)
 291 {
 292         struct rb_node **p = &root->rb_node;
 293         struct rb_node *parent = NULL;
 294         struct tree_entry *entry;
 295
 296         while (*p) {
 297                 parent = *p;
 298                 entry = rb_entry(parent, struct tree_entry, rb_node);
 299
 300                 if (bytenr < entry->bytenr)
 301                         p = &(*p)->rb_left;
 302                 else if (bytenr > entry->bytenr)
 303                         p = &(*p)->rb_right;
 304                 else
 305                         return parent;
 306         }
 307
 308         rb_link_node(node, parent, p);
 309         rb_insert_color(node, root);
 310         return NULL;
 311 }
 312
 313 static struct rb_node *tree_search(struct rb_root *root, u64 bytenr)
 314 {
 315         struct rb_node *n = root->rb_node;
 316         struct tree_entry *entry;
 317
 318         while (n) {
 319                 entry = rb_entry(n, struct tree_entry, rb_node);
 320
 321                 if (bytenr < entry->bytenr)
 322                         n = n->rb_left;
 323                 else if (bytenr > entry->bytenr)
 324                         n = n->rb_right;
 325                 else
 326                         return n;
 327         }
 328         return NULL;
 329 }
 330
 331 static void backref_tree_panic(struct rb_node *rb_node, int errno, u64 bytenr)
 332 {
 333
 334         struct btrfs_fs_info *fs_info = NULL;
 335         struct backref_node *bnode = rb_entry(rb_node, struct backref_node,
 336                                               rb_node);
 337         if (bnode->root)
 338                 fs_info = bnode->root->fs_info;
 339         btrfs_panic(fs_info, errno, "Inconsistency in backref cache "
 340                     "found at offset %llu", bytenr);
 341 }
 342
 343 /*
 344  * walk up backref nodes until reach node presents tree root
 345  */
 346 static struct backref_node *walk_up_backref(struct backref_node *node,
 347                                             struct backref_edge *edges[],
 348                                             int *index)
 349 {
 350         struct backref_edge *edge;
 351         int idx = *index;
 352
 353         while (!list_empty(&node->upper)) {
 354                 edge = list_entry(node->upper.next,
 355                                   struct backref_edge, list[LOWER]);
 356                 edges[idx++] = edge;
 357                 node = edge->node[UPPER];
 358         }
 359         BUG_ON(node->detached);
 360         *index = idx;
 361         return node;
 362 }
 363
 364 /*
 365  * walk down backref nodes to find start of next reference path
 366  */
 367 static struct backref_node *walk_down_backref(struct backref_edge *edges[],
 368                                               int *index)
 369 {
 370         struct backref_edge *edge;
 371         struct backref_node *lower;
 372         int idx = *index;
 373
 374         while (idx > 0) {
 375                 edge = edges[idx - 1];
 376                 lower = edge->node[LOWER];
 377                 if (list_is_last(&edge->list[LOWER], &lower->upper)) {
 378                         idx--;
 379                         continue;
 380                 }
 381                 edge = list_entry(edge->list[LOWER].next,
 382                                   struct backref_edge, list[LOWER]);
 383                 edges[idx - 1] = edge;
 384                 *index = idx;
 385                 return edge->node[UPPER];
 386         }
 387         *index = 0;
 388         return NULL;
 389 }
 390
 391 static void unlock_node_buffer(struct backref_node *node)
 392 {
 393         if (node->locked) {
 394                 btrfs_tree_unlock(node->eb);
 395                 node->locked = 0;
 396         }
 397 }
 398
 399 static void drop_node_buffer(struct backref_node *node)
 400 {
 401         if (node->eb) {
 402                 unlock_node_buffer(node);
 403                 free_extent_buffer(node->eb);
 404                 node->eb = NULL;
 405         }
 406 }
 407
 408 static void drop_backref_node(struct backref_cache *tree,
 409                               struct backref_node *node)
 410 {
 411         BUG_ON(!list_empty(&node->upper));
 412
 413         drop_node_buffer(node);
 414         list_del(&node->list);
 415         list_del(&node->lower);
 416         if (!RB_EMPTY_NODE(&node->rb_node))
 417                 rb_erase(&node->rb_node, &tree->rb_root);
 418         free_backref_node(tree, node);
 419 }
 420
 421 /*
 422  * remove a backref node from the backref cache
 423  */
 424 static void remove_backref_node(struct backref_cache *cache,
 425                                 struct backref_node *node)
 426 {
 427         struct backref_node *upper;
 428         struct backref_edge *edge;
 429
 430         if (!node)
 431                 return;
 432
 433         BUG_ON(!node->lowest && !node->detached);
 434         while (!list_empty(&node->upper)) {
 435                 edge = list_entry(node->upper.next, struct backref_edge,
 436                                   list[LOWER]);
 437                 upper = edge->node[UPPER];
 438                 list_del(&edge->list[LOWER]);
 439                 list_del(&edge->list[UPPER]);
 440                 free_backref_edge(cache, edge);
 441
 442                 if (RB_EMPTY_NODE(&upper->rb_node)) {
 443                         BUG_ON(!list_empty(&node->upper));
 444                         drop_backref_node(cache, node);
 445                         node = upper;
 446                         node->lowest = 1;
 447                         continue;
 448                 }
 449                 /*
 450                  * add the node to leaf node list if no other
 451                  * child block cached.
 452                  */
 453                 if (list_empty(&upper->lower)) {
 454                         list_add_tail(&upper->lower, &cache->leaves);
 455                         upper->lowest = 1;
 456                 }
 457         }
 458
 459         drop_backref_node(cache, node);
 460 }
 461
 462 static void update_backref_node(struct backref_cache *cache,
 463                                 struct backref_node *node, u64 bytenr)
 464 {
 465         struct rb_node *rb_node;
 466         rb_erase(&node->rb_node, &cache->rb_root);
 467         node->bytenr = bytenr;
 468         rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node);
 469         if (rb_node)
 470                 backref_tree_panic(rb_node, -EEXIST, bytenr);
 471 }
 472
 473 /*
 474  * update backref cache after a transaction commit
 475  */
 476 static int update_backref_cache(struct btrfs_trans_handle *trans,
 477                                 struct backref_cache *cache)
 478 {
 479         struct backref_node *node;
 480         int level = 0;
 481
 482         if (cache->last_trans == 0) {
 483                 cache->last_trans = trans->transid;
 484                 return 0;
 485         }
 486
 487         if (cache->last_trans == trans->transid)
 488                 return 0;
 489
 490         /*
 491          * detached nodes are used to avoid unnecessary backref
 492          * lookup. transaction commit changes the extent tree.
 493          * so the detached nodes are no longer useful.
 494          */
 495         while (!list_empty(&cache->detached)) {
 496                 node = list_entry(cache->detached.next,
 497                                   struct backref_node, list);
 498                 remove_backref_node(cache, node);
 499         }
 500
 501         while (!list_empty(&cache->changed)) {
 502                 node = list_entry(cache->changed.next,
 503                                   struct backref_node, list);
 504                 list_del_init(&node->list);
 505                 BUG_ON(node->pending);
 506                 update_backref_node(cache, node, node->new_bytenr);
 507         }
 508
 509         /*
 510          * some nodes can be left in the pending list if there were
 511          * errors during processing the pending nodes.
 512          */
 513         for (level = 0; level < BTRFS_MAX_LEVEL; level++) {
 514                 list_for_each_entry(node, &cache->pending[level], list) {
 515                         BUG_ON(!node->pending);
 516                         if (node->bytenr == node->new_bytenr)
 517                                 continue;
 518                         update_backref_node(cache, node, node->new_bytenr);
 519                 }
 520         }
 521
 522         cache->last_trans = 0;
 523         return 1;
 524 }
 525
 526
 527 static int should_ignore_root(struct btrfs_root *root)
 528 {
 529         struct btrfs_root *reloc_root;
 530
 531         if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state))
 532                 return 0;
 533
 534         reloc_root = root->reloc_root;
 535         if (!reloc_root)
 536                 return 0;
 537
 538         if (btrfs_root_last_snapshot(&reloc_root->root_item) ==
 539             root->fs_info->running_transaction->transid - 1)
 540                 return 0;
 541         /*
 542          * if there is reloc tree and it was created in previous
 543          * transaction backref lookup can find the reloc tree,
 544          * so backref node for the fs tree root is useless for
 545          * relocation.
 546          */
 547         return 1;
 548 }
 549 /*
 550  * find reloc tree by address of tree root
 551  */
 552 static struct btrfs_root *find_reloc_root(struct reloc_control *rc,
 553                                           u64 bytenr)
 554 {
 555         struct rb_node *rb_node;
 556         struct mapping_node *node;
 557         struct btrfs_root *root = NULL;
 558
 559         spin_lock(&rc->reloc_root_tree.lock);
 560         rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr);
 561         if (rb_node) {
 562                 node = rb_entry(rb_node, struct mapping_node, rb_node);
 563                 root = (struct btrfs_root *)node->data;
 564         }
 565         spin_unlock(&rc->reloc_root_tree.lock);
 566         return root;
 567 }
 568
 569 static int is_cowonly_root(u64 root_objectid)
 570 {
 571         if (root_objectid == BTRFS_ROOT_TREE_OBJECTID ||
 572             root_objectid == BTRFS_EXTENT_TREE_OBJECTID ||
 573             root_objectid == BTRFS_CHUNK_TREE_OBJECTID ||
 574             root_objectid == BTRFS_DEV_TREE_OBJECTID ||
 575             root_objectid == BTRFS_TREE_LOG_OBJECTID ||
 576             root_objectid == BTRFS_CSUM_TREE_OBJECTID ||
 577             root_objectid == BTRFS_UUID_TREE_OBJECTID ||
 578             root_objectid == BTRFS_QUOTA_TREE_OBJECTID)
 579                 return 1;
 580         return 0;
 581 }
 582
 583 static struct btrfs_root *read_fs_root(struct btrfs_fs_info *fs_info,
 584                                         u64 root_objectid)
 585 {
 586         struct btrfs_key key;
 587
 588         key.objectid = root_objectid;
 589         key.type = BTRFS_ROOT_ITEM_KEY;
 590         if (is_cowonly_root(root_objectid))
 591                 key.offset = 0;
 592         else
 593                 key.offset = (u64)-1;
 594
 595         return btrfs_get_fs_root(fs_info, &key, false);
 596 }
 597
 598 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
 599 static noinline_for_stack
 600 struct btrfs_root *find_tree_root(struct reloc_control *rc,
 601                                   struct extent_buffer *leaf,
 602                                   struct btrfs_extent_ref_v0 *ref0)
 603 {
 604         struct btrfs_root *root;
 605         u64 root_objectid = btrfs_ref_root_v0(leaf, ref0);
 606         u64 generation = btrfs_ref_generation_v0(leaf, ref0);
 607
 608         BUG_ON(root_objectid == BTRFS_TREE_RELOC_OBJECTID);
 609
 610         root = read_fs_root(rc->extent_root->fs_info, root_objectid);
 611         BUG_ON(IS_ERR(root));
 612
 613         if (test_bit(BTRFS_ROOT_REF_COWS, &root->state) &&
 614             generation != btrfs_root_generation(&root->root_item))
 615                 return NULL;
 616
 617         return root;
 618 }
 619 #endif
 620
 621 static noinline_for_stack
 622 int find_inline_backref(struct extent_buffer *leaf, int slot,
 623                         unsigned long *ptr, unsigned long *end)
 624 {
 625         struct btrfs_key key;
 626         struct btrfs_extent_item *ei;
 627         struct btrfs_tree_block_info *bi;
 628         u32 item_size;
 629
 630         btrfs_item_key_to_cpu(leaf, &key, slot);
 631
 632         item_size = btrfs_item_size_nr(leaf, slot);
 633 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
 634         if (item_size < sizeof(*ei)) {
 635                 WARN_ON(item_size != sizeof(struct btrfs_extent_item_v0));
 636                 return 1;
 637         }
 638 #endif
 639         ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item);
 640         WARN_ON(!(btrfs_extent_flags(leaf, ei) &
 641                   BTRFS_EXTENT_FLAG_TREE_BLOCK));
 642
 643         if (key.type == BTRFS_EXTENT_ITEM_KEY &&
 644             item_size <= sizeof(*ei) + sizeof(*bi)) {
 645                 WARN_ON(item_size < sizeof(*ei) + sizeof(*bi));
 646                 return 1;
 647         }
 648         if (key.type == BTRFS_METADATA_ITEM_KEY &&
 649             item_size <= sizeof(*ei)) {
 650                 WARN_ON(item_size < sizeof(*ei));
 651                 return 1;
 652         }
 653
 654         if (key.type == BTRFS_EXTENT_ITEM_KEY) {
 655                 bi = (struct btrfs_tree_block_info *)(ei + 1);
 656                 *ptr = (unsigned long)(bi + 1);
 657         } else {
 658                 *ptr = (unsigned long)(ei + 1);
 659         }
 660         *end = (unsigned long)ei + item_size;
 661         return 0;
 662 }
 663
 664 /*
 665  * build backref tree for a given tree block. root of the backref tree
 666  * corresponds the tree block, leaves of the backref tree correspond
 667  * roots of b-trees that reference the tree block.
 668  *
 669  * the basic idea of this function is check backrefs of a given block
 670  * to find upper level blocks that refernece the block, and then check
 671  * bakcrefs of these upper level blocks recursively. the recursion stop
 672  * when tree root is reached or backrefs for the block is cached.
 673  *
 674  * NOTE: if we find backrefs for a block are cached, we know backrefs
 675  * for all upper level blocks that directly/indirectly reference the
 676  * block are also cached.
 677  */
 678 static noinline_for_stack
 679 struct backref_node *build_backref_tree(struct reloc_control *rc,
 680                                         struct btrfs_key *node_key,
 681                                         int level, u64 bytenr)
 682 {
 683         struct backref_cache *cache = &rc->backref_cache;
 684         struct btrfs_path *path1;
 685         struct btrfs_path *path2;
 686         struct extent_buffer *eb;
 687         struct btrfs_root *root;
 688         struct backref_node *cur;
 689         struct backref_node *upper;
 690         struct backref_node *lower;
 691         struct backref_node *node = NULL;
 692         struct backref_node *exist = NULL;
 693         struct backref_edge *edge;
 694         struct rb_node *rb_node;
 695         struct btrfs_key key;
 696         unsigned long end;
 697         unsigned long ptr;
 698         LIST_HEAD(list);
 699         LIST_HEAD(useless);
 700         int cowonly;
 701         int ret;
 702         int err = 0;
 703         bool need_check = true;
 704
 705         path1 = btrfs_alloc_path();
 706         path2 = btrfs_alloc_path();
 707         if (!path1 || !path2) {
 708                 err = -ENOMEM;
 709                 goto out;
 710         }
 711         path1->reada = 1;
 712         path2->reada = 2;
 713
 714         node = alloc_backref_node(cache);
 715         if (!node) {
 716                 err = -ENOMEM;
 717                 goto out;
 718         }
 719
 720         node->bytenr = bytenr;
 721         node->level = level;
 722         node->lowest = 1;
 723         cur = node;
 724 again:
 725         end = 0;
 726         ptr = 0;
 727         key.objectid = cur->bytenr;
 728         key.type = BTRFS_METADATA_ITEM_KEY;
 729         key.offset = (u64)-1;
 730
 731         path1->search_commit_root = 1;
 732         path1->skip_locking = 1;
 733         ret = btrfs_search_slot(NULL, rc->extent_root, &key, path1,
 734                                 0, 0);
 735         if (ret < 0) {
 736                 err = ret;
 737                 goto out;
 738         }
 739         BUG_ON(!ret || !path1->slots[0]);
 740
 741         path1->slots[0]--;
 742
 743         WARN_ON(cur->checked);
 744         if (!list_empty(&cur->upper)) {
 745                 /*
 746                  * the backref was added previously when processing
 747                  * backref of type BTRFS_TREE_BLOCK_REF_KEY
 748                  */
 749                 BUG_ON(!list_is_singular(&cur->upper));
 750                 edge = list_entry(cur->upper.next, struct backref_edge,
 751                                   list[LOWER]);
 752                 BUG_ON(!list_empty(&edge->list[UPPER]));
 753                 exist = edge->node[UPPER];
 754                 /*
 755                  * add the upper level block to pending list if we need
 756                  * check its backrefs
 757                  */
 758                 if (!exist->checked)
 759                         list_add_tail(&edge->list[UPPER], &list);
 760         } else {
 761                 exist = NULL;
 762         }
 763
 764         while (1) {
 765                 cond_resched();
 766                 eb = path1->nodes[0];
 767
 768                 if (ptr >= end) {
 769                         if (path1->slots[0] >= btrfs_header_nritems(eb)) {
 770                                 ret = btrfs_next_leaf(rc->extent_root, path1);
 771                                 if (ret < 0) {
 772                                         err = ret;
 773                                         goto out;
 774                                 }
 775                                 if (ret > 0)
 776                                         break;
 777                                 eb = path1->nodes[0];
 778                         }
 779
 780                         btrfs_item_key_to_cpu(eb, &key, path1->slots[0]);
 781                         if (key.objectid != cur->bytenr) {
 782                                 WARN_ON(exist);
 783                                 break;
 784                         }
 785
 786                         if (key.type == BTRFS_EXTENT_ITEM_KEY ||
 787                             key.type == BTRFS_METADATA_ITEM_KEY) {
 788                                 ret = find_inline_backref(eb, path1->slots[0],
 789                                                           &ptr, &end);
 790                                 if (ret)
 791                                         goto next;
 792                         }
 793                 }
 794
 795                 if (ptr < end) {
 796                         /* update key for inline back ref */
 797                         struct btrfs_extent_inline_ref *iref;
 798                         iref = (struct btrfs_extent_inline_ref *)ptr;
 799                         key.type = btrfs_extent_inline_ref_type(eb, iref);
 800                         key.offset = btrfs_extent_inline_ref_offset(eb, iref);
 801                         WARN_ON(key.type != BTRFS_TREE_BLOCK_REF_KEY &&
 802                                 key.type != BTRFS_SHARED_BLOCK_REF_KEY);
 803                 }
 804
 805                 if (exist &&
 806                     ((key.type == BTRFS_TREE_BLOCK_REF_KEY &&
 807                       exist->owner == key.offset) ||
 808                      (key.type == BTRFS_SHARED_BLOCK_REF_KEY &&
 809                       exist->bytenr == key.offset))) {
 810                         exist = NULL;
 811                         goto next;
 812                 }
 813
 814 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
 815                 if (key.type == BTRFS_SHARED_BLOCK_REF_KEY ||
 816                     key.type == BTRFS_EXTENT_REF_V0_KEY) {
 817                         if (key.type == BTRFS_EXTENT_REF_V0_KEY) {
 818                                 struct btrfs_extent_ref_v0 *ref0;
 819                                 ref0 = btrfs_item_ptr(eb, path1->slots[0],
 820                                                 struct btrfs_extent_ref_v0);
 821                                 if (key.objectid == key.offset) {
 822                                         root = find_tree_root(rc, eb, ref0);
 823                                         if (root && !should_ignore_root(root))
 824                                                 cur->root = root;
 825                                         else
 826                                                 list_add(&cur->list, &useless);
 827                                         break;
 828                                 }
 829                                 if (is_cowonly_root(btrfs_ref_root_v0(eb,
 830                                                                       ref0)))
 831                                         cur->cowonly = 1;
 832                         }
 833 #else
 834                 BUG_ON(key.type == BTRFS_EXTENT_REF_V0_KEY);
 835                 if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) {
 836 #endif
 837                         if (key.objectid == key.offset) {
 838                                 /*
 839                                  * only root blocks of reloc trees use
 840                                  * backref of this type.
 841                                  */
 842                                 root = find_reloc_root(rc, cur->bytenr);
 843                                 BUG_ON(!root);
 844                                 cur->root = root;
 845                                 break;
 846                         }
 847
 848                         edge = alloc_backref_edge(cache);
 849                         if (!edge) {
 850                                 err = -ENOMEM;
 851                                 goto out;
 852                         }
 853                         rb_node = tree_search(&cache->rb_root, key.offset);
 854                         if (!rb_node) {
 855                                 upper = alloc_backref_node(cache);
 856                                 if (!upper) {
 857                                         free_backref_edge(cache, edge);
 858                                         err = -ENOMEM;
 859                                         goto out;
 860                                 }
 861                                 upper->bytenr = key.offset;
 862                                 upper->level = cur->level + 1;
 863                                 /*
 864                                  *  backrefs for the upper level block isn't
 865                                  *  cached, add the block to pending list
 866                                  */
 867                                 list_add_tail(&edge->list[UPPER], &list);
 868                         } else {
 869                                 upper = rb_entry(rb_node, struct backref_node,
 870                                                  rb_node);
 871                                 BUG_ON(!upper->checked);
 872                                 INIT_LIST_HEAD(&edge->list[UPPER]);
 873                         }
 874                         list_add_tail(&edge->list[LOWER], &cur->upper);
 875                         edge->node[LOWER] = cur;
 876                         edge->node[UPPER] = upper;
 877
 878                         goto next;
 879                 } else if (key.type != BTRFS_TREE_BLOCK_REF_KEY) {
 880                         goto next;
 881                 }
 882
 883                 /* key.type == BTRFS_TREE_BLOCK_REF_KEY */
 884                 root = read_fs_root(rc->extent_root->fs_info, key.offset);
 885                 if (IS_ERR(root)) {
 886                         err = PTR_ERR(root);
 887                         goto out;
 888                 }
 889
 890                 if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state))
 891                         cur->cowonly = 1;
 892
 893                 if (btrfs_root_level(&root->root_item) == cur->level) {
 894                         /* tree root */
 895                         BUG_ON(btrfs_root_bytenr(&root->root_item) !=
 896                                cur->bytenr);
 897                         if (should_ignore_root(root))
 898                                 list_add(&cur->list, &useless);
 899                         else
 900                                 cur->root = root;
 901                         break;
 902                 }
 903
 904                 level = cur->level + 1;
 905
 906                 /*
 907                  * searching the tree to find upper level blocks
 908                  * reference the block.
 909                  */
 910                 path2->search_commit_root = 1;
 911                 path2->skip_locking = 1;
 912                 path2->lowest_level = level;
 913                 ret = btrfs_search_slot(NULL, root, node_key, path2, 0, 0);
 914                 path2->lowest_level = 0;
 915                 if (ret < 0) {
 916                         err = ret;
 917                         goto out;
 918                 }
 919                 if (ret > 0 && path2->slots[level] > 0)
 920                         path2->slots[level]--;
 921
 922                 eb = path2->nodes[level];
 923                 WARN_ON(btrfs_node_blockptr(eb, path2->slots[level]) !=
 924                         cur->bytenr);
 925
 926                 lower = cur;
 927                 need_check = true;
 928                 for (; level < BTRFS_MAX_LEVEL; level++) {
 929                         if (!path2->nodes[level]) {
 930                                 BUG_ON(btrfs_root_bytenr(&root->root_item) !=
 931                                        lower->bytenr);
 932                                 if (should_ignore_root(root))
 933                                         list_add(&lower->list, &useless);
 934                                 else
 935                                         lower->root = root;
 936                                 break;
 937                         }
 938
 939                         edge = alloc_backref_edge(cache);
 940                         if (!edge) {
 941                                 err = -ENOMEM;
 942                                 goto out;
 943                         }
 944
 945                         eb = path2->nodes[level];
 946                         rb_node = tree_search(&cache->rb_root, eb->start);
 947                         if (!rb_node) {
 948                                 upper = alloc_backref_node(cache);
 949                                 if (!upper) {
 950                                         free_backref_edge(cache, edge);
 951                                         err = -ENOMEM;
 952                                         goto out;
 953                                 }
 954                                 upper->bytenr = eb->start;
 955                                 upper->owner = btrfs_header_owner(eb);
 956                                 upper->level = lower->level + 1;
 957                                 if (!test_bit(BTRFS_ROOT_REF_COWS,
 958                                               &root->state))
 959                                         upper->cowonly = 1;
 960
 961                                 /*
 962                                  * if we know the block isn't shared
 963                                  * we can void checking its backrefs.
 964                                  */
 965                                 if (btrfs_block_can_be_shared(root, eb))
 966                                         upper->checked = 0;
 967                                 else
 968                                         upper->checked = 1;
 969
 970                                 /*
 971                                  * add the block to pending list if we
 972                                  * need check its backrefs, we only do this once
 973                                  * while walking up a tree as we will catch
 974                                  * anything else later on.
 975                                  */
 976                                 if (!upper->checked && need_check) {
 977                                         need_check = false;
 978                                         list_add_tail(&edge->list[UPPER],
 979                                                       &list);
 980                                 } else
 981                                         INIT_LIST_HEAD(&edge->list[UPPER]);
 982                         } else {
 983                                 upper = rb_entry(rb_node, struct backref_node,
 984                                                  rb_node);
 985                                 BUG_ON(!upper->checked);
 986                                 INIT_LIST_HEAD(&edge->list[UPPER]);
 987                                 if (!upper->owner)
 988                                         upper->owner = btrfs_header_owner(eb);
 989                         }
 990                         list_add_tail(&edge->list[LOWER], &lower->upper);
 991                         edge->node[LOWER] = lower;
 992                         edge->node[UPPER] = upper;
 993
 994                         if (rb_node)
 995                                 break;
 996                         lower = upper;
 997                         upper = NULL;
 998                 }
 999                 btrfs_release_path(path2);
1000 next:
1001                 if (ptr < end) {
1002                         ptr += btrfs_extent_inline_ref_size(key.type);
1003                         if (ptr >= end) {
1004                                 WARN_ON(ptr > end);
1005                                 ptr = 0;
1006                                 end = 0;
1007                         }
1008                 }
1009                 if (ptr >= end)
1010                         path1->slots[0]++;
1011         }
1012         btrfs_release_path(path1);
1013
1014         cur->checked = 1;
1015         WARN_ON(exist);
1016
1017         /* the pending list isn't empty, take the first block to process */
1018         if (!list_empty(&list)) {
1019                 edge = list_entry(list.next, struct backref_edge, list[UPPER]);
1020                 list_del_init(&edge->list[UPPER]);
1021                 cur = edge->node[UPPER];
1022                 goto again;
1023         }
1024
1025         /*
1026          * everything goes well, connect backref nodes and insert backref nodes
1027          * into the cache.
1028          */
1029         BUG_ON(!node->checked);
1030         cowonly = node->cowonly;
1031         if (!cowonly) {
1032                 rb_node = tree_insert(&cache->rb_root, node->bytenr,
1033                                       &node->rb_node);
1034                 if (rb_node)
1035                         backref_tree_panic(rb_node, -EEXIST, node->bytenr);
1036                 list_add_tail(&node->lower, &cache->leaves);
1037         }
1038
1039         list_for_each_entry(edge, &node->upper, list[LOWER])
1040                 list_add_tail(&edge->list[UPPER], &list);
1041
1042         while (!list_empty(&list)) {
1043                 edge = list_entry(list.next, struct backref_edge, list[UPPER]);
1044                 list_del_init(&edge->list[UPPER]);
1045                 upper = edge->node[UPPER];
1046                 if (upper->detached) {
1047                         list_del(&edge->list[LOWER]);
1048                         lower = edge->node[LOWER];
1049                         free_backref_edge(cache, edge);
1050                         if (list_empty(&lower->upper))
1051                                 list_add(&lower->list, &useless);
1052                         continue;
1053                 }
1054
1055                 if (!RB_EMPTY_NODE(&upper->rb_node)) {
1056                         if (upper->lowest) {
1057                                 list_del_init(&upper->lower);
1058                                 upper->lowest = 0;
1059                         }
1060
1061                         list_add_tail(&edge->list[UPPER], &upper->lower);
1062                         continue;
1063                 }
1064
1065                 BUG_ON(!upper->checked);
1066                 BUG_ON(cowonly != upper->cowonly);
1067                 if (!cowonly) {
1068                         rb_node = tree_insert(&cache->rb_root, upper->bytenr,
1069                                               &upper->rb_node);
1070                         if (rb_node)
1071                                 backref_tree_panic(rb_node, -EEXIST,
1072                                                    upper->bytenr);
1073                 }
1074
1075                 list_add_tail(&edge->list[UPPER], &upper->lower);
1076
1077                 list_for_each_entry(edge, &upper->upper, list[LOWER])
1078                         list_add_tail(&edge->list[UPPER], &list);
1079         }
1080         /*
1081          * process useless backref nodes. backref nodes for tree leaves
1082          * are deleted from the cache. backref nodes for upper level
1083          * tree blocks are left in the cache to avoid unnecessary backref
1084          * lookup.
1085          */
1086         while (!list_empty(&useless)) {
1087                 upper = list_entry(useless.next, struct backref_node, list);
1088                 list_del_init(&upper->list);
1089                 BUG_ON(!list_empty(&upper->upper));
1090                 if (upper == node)
1091                         node = NULL;
1092                 if (upper->lowest) {
1093                         list_del_init(&upper->lower);
1094                         upper->lowest = 0;
1095                 }
1096                 while (!list_empty(&upper->lower)) {
1097                         edge = list_entry(upper->lower.next,
1098                                           struct backref_edge, list[UPPER]);
1099                         list_del(&edge->list[UPPER]);
1100                         list_del(&edge->list[LOWER]);
1101                         lower = edge->node[LOWER];
1102                         free_backref_edge(cache, edge);
1103
1104                         if (list_empty(&lower->upper))
1105                                 list_add(&lower->list, &useless);
1106                 }
1107                 __mark_block_processed(rc, upper);
1108                 if (upper->level > 0) {
1109                         list_add(&upper->list, &cache->detached);
1110                         upper->detached = 1;
1111                 } else {
1112                         rb_erase(&upper->rb_node, &cache->rb_root);
1113                         free_backref_node(cache, upper);
1114                 }
1115         }
1116 out:
1117         btrfs_free_path(path1);
1118         btrfs_free_path(path2);
1119         if (err) {
1120                 while (!list_empty(&useless)) {
1121                         lower = list_entry(useless.next,
1122                                            struct backref_node, upper);
1123                         list_del_init(&lower->upper);
1124                 }
1125                 upper = node;
1126                 INIT_LIST_HEAD(&list);
1127                 while (upper) {
1128                         if (RB_EMPTY_NODE(&upper->rb_node)) {
1129                                 list_splice_tail(&upper->upper, &list);
1130                                 free_backref_node(cache, upper);
1131                         }
1132
1133                         if (list_empty(&list))
1134                                 break;
1135
1136                         edge = list_entry(list.next, struct backref_edge,
1137                                           list[LOWER]);
1138                         list_del(&edge->list[LOWER]);
1139                         upper = edge->node[UPPER];
1140                         free_backref_edge(cache, edge);
1141                 }
1142                 return ERR_PTR(err);
1143         }
1144         BUG_ON(node && node->detached);
1145         return node;
1146 }
1147
1148 /*
1149  * helper to add backref node for the newly created snapshot.
1150  * the backref node is created by cloning backref node that
1151  * corresponds to root of source tree
1152  */
1153 static int clone_backref_node(struct btrfs_trans_handle *trans,
1154                               struct reloc_control *rc,
1155                               struct btrfs_root *src,
1156                               struct btrfs_root *dest)
1157 {
1158         struct btrfs_root *reloc_root = src->reloc_root;
1159         struct backref_cache *cache = &rc->backref_cache;
1160         struct backref_node *node = NULL;
1161         struct backref_node *new_node;
1162         struct backref_edge *edge;
1163         struct backref_edge *new_edge;
1164         struct rb_node *rb_node;
1165
1166         if (cache->last_trans > 0)
1167                 update_backref_cache(trans, cache);
1168
1169         rb_node = tree_search(&cache->rb_root, src->commit_root->start);
1170         if (rb_node) {
1171                 node = rb_entry(rb_node, struct backref_node, rb_node);
1172                 if (node->detached)
1173                         node = NULL;
1174                 else
1175                         BUG_ON(node->new_bytenr != reloc_root->node->start);
1176         }
1177
1178         if (!node) {
1179                 rb_node = tree_search(&cache->rb_root,
1180                                       reloc_root->commit_root->start);
1181                 if (rb_node) {
1182                         node = rb_entry(rb_node, struct backref_node,
1183                                         rb_node);
1184                         BUG_ON(node->detached);
1185                 }
1186         }
1187
1188         if (!node)
1189                 return 0;
1190
1191         new_node = alloc_backref_node(cache);
1192         if (!new_node)
1193                 return -ENOMEM;
1194
1195         new_node->bytenr = dest->node->start;
1196         new_node->level = node->level;
1197         new_node->lowest = node->lowest;
1198         new_node->checked = 1;
1199         new_node->root = dest;
1200
1201         if (!node->lowest) {
1202                 list_for_each_entry(edge, &node->lower, list[UPPER]) {
1203                         new_edge = alloc_backref_edge(cache);
1204                         if (!new_edge)
1205                                 goto fail;
1206
1207                         new_edge->node[UPPER] = new_node;
1208                         new_edge->node[LOWER] = edge->node[LOWER];
1209                         list_add_tail(&new_edge->list[UPPER],
1210                                       &new_node->lower);
1211                 }
1212         } else {
1213                 list_add_tail(&new_node->lower, &cache->leaves);
1214         }
1215
1216         rb_node = tree_insert(&cache->rb_root, new_node->bytenr,
1217                               &new_node->rb_node);
1218         if (rb_node)
1219                 backref_tree_panic(rb_node, -EEXIST, new_node->bytenr);
1220
1221         if (!new_node->lowest) {
1222                 list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) {
1223                         list_add_tail(&new_edge->list[LOWER],
1224                                       &new_edge->node[LOWER]->upper);
1225                 }
1226         }
1227         return 0;
1228 fail:
1229         while (!list_empty(&new_node->lower)) {
1230                 new_edge = list_entry(new_node->lower.next,
1231                                       struct backref_edge, list[UPPER]);
1232                 list_del(&new_edge->list[UPPER]);
1233                 free_backref_edge(cache, new_edge);
1234         }
1235         free_backref_node(cache, new_node);
1236         return -ENOMEM;
1237 }
1238
1239 /*
1240  * helper to add 'address of tree root -> reloc tree' mapping
1241  */
1242 static int __must_check __add_reloc_root(struct btrfs_root *root)
1243 {
1244         struct rb_node *rb_node;
1245         struct mapping_node *node;
1246         struct reloc_control *rc = root->fs_info->reloc_ctl;
1247
1248         node = kmalloc(sizeof(*node), GFP_NOFS);
1249         if (!node)
1250                 return -ENOMEM;
1251
1252         node->bytenr = root->node->start;
1253         node->data = root;
1254
1255         spin_lock(&rc->reloc_root_tree.lock);
1256         rb_node = tree_insert(&rc->reloc_root_tree.rb_root,
1257                               node->bytenr, &node->rb_node);
1258         spin_unlock(&rc->reloc_root_tree.lock);
1259         if (rb_node) {
1260                 btrfs_panic(root->fs_info, -EEXIST, "Duplicate root found "
1261                             "for start=%llu while inserting into relocation "
1262                             "tree", node->bytenr);
1263                 kfree(node);
1264                 return -EEXIST;
1265         }
1266
1267         list_add_tail(&root->root_list, &rc->reloc_roots);
1268         return 0;
1269 }
1270
1271 /*
1272  * helper to delete the 'address of tree root -> reloc tree'
1273  * mapping
1274  */
1275 static void __del_reloc_root(struct btrfs_root *root)
1276 {
1277         struct rb_node *rb_node;
1278         struct mapping_node *node = NULL;
1279         struct reloc_control *rc = root->fs_info->reloc_ctl;
1280
1281         spin_lock(&rc->reloc_root_tree.lock);
1282         rb_node = tree_search(&rc->reloc_root_tree.rb_root,
1283                               root->node->start);
1284         if (rb_node) {
1285                 node = rb_entry(rb_node, struct mapping_node, rb_node);
1286                 rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root);
1287         }
1288         spin_unlock(&rc->reloc_root_tree.lock);
1289
1290         if (!node)
1291                 return;
1292         BUG_ON((struct btrfs_root *)node->data != root);
1293
1294         spin_lock(&root->fs_info->trans_lock);
1295         list_del_init(&root->root_list);
1296         spin_unlock(&root->fs_info->trans_lock);
1297         kfree(node);
1298 }
1299
1300 /*
1301  * helper to update the 'address of tree root -> reloc tree'
1302  * mapping
1303  */
1304 static int __update_reloc_root(struct btrfs_root *root, u64 new_bytenr)
1305 {
1306         struct rb_node *rb_node;
1307         struct mapping_node *node = NULL;
1308         struct reloc_control *rc = root->fs_info->reloc_ctl;
1309
1310         spin_lock(&rc->reloc_root_tree.lock);
1311         rb_node = tree_search(&rc->reloc_root_tree.rb_root,
1312                               root->node->start);
1313         if (rb_node) {
1314                 node = rb_entry(rb_node, struct mapping_node, rb_node);
1315                 rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root);
1316         }
1317         spin_unlock(&rc->reloc_root_tree.lock);
1318
1319         if (!node)
1320                 return 0;
1321         BUG_ON((struct btrfs_root *)node->data != root);
1322
1323         spin_lock(&rc->reloc_root_tree.lock);
1324         node->bytenr = new_bytenr;
1325         rb_node = tree_insert(&rc->reloc_root_tree.rb_root,
1326                               node->bytenr, &node->rb_node);
1327         spin_unlock(&rc->reloc_root_tree.lock);
1328         if (rb_node)
1329                 backref_tree_panic(rb_node, -EEXIST, node->bytenr);
1330         return 0;
1331 }
1332
1333 static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans,
1334                                         struct btrfs_root *root, u64 objectid)
1335 {
1336         struct btrfs_root *reloc_root;
1337         struct extent_buffer *eb;
1338         struct btrfs_root_item *root_item;
1339         struct btrfs_key root_key;
1340         u64 last_snap = 0;
1341         int ret;
1342
1343         root_item = kmalloc(sizeof(*root_item), GFP_NOFS);
1344         BUG_ON(!root_item);
1345
1346         root_key.objectid = BTRFS_TREE_RELOC_OBJECTID;
1347         root_key.type = BTRFS_ROOT_ITEM_KEY;
1348         root_key.offset = objectid;
1349
1350         if (root->root_key.objectid == objectid) {
1351                 /* called by btrfs_init_reloc_root */
1352                 ret = btrfs_copy_root(trans, root, root->commit_root, &eb,
1353                                       BTRFS_TREE_RELOC_OBJECTID);
1354                 BUG_ON(ret);
1355
1356                 last_snap = btrfs_root_last_snapshot(&root->root_item);
1357                 btrfs_set_root_last_snapshot(&root->root_item,
1358                                              trans->transid - 1);
1359         } else {
1360                 /*
1361                  * called by btrfs_reloc_post_snapshot_hook.
1362                  * the source tree is a reloc tree, all tree blocks
1363                  * modified after it was created have RELOC flag
1364                  * set in their headers. so it's OK to not update
1365                  * the 'last_snapshot'.
1366                  */
1367                 ret = btrfs_copy_root(trans, root, root->node, &eb,
1368                                       BTRFS_TREE_RELOC_OBJECTID);
1369                 BUG_ON(ret);
1370         }
1371
1372         memcpy(root_item, &root->root_item, sizeof(*root_item));
1373         btrfs_set_root_bytenr(root_item, eb->start);
1374         btrfs_set_root_level(root_item, btrfs_header_level(eb));
1375         btrfs_set_root_generation(root_item, trans->transid);
1376
1377         if (root->root_key.objectid == objectid) {
1378                 btrfs_set_root_refs(root_item, 0);
1379                 memset(&root_item->drop_progress, 0,
1380                        sizeof(struct btrfs_disk_key));
1381                 root_item->drop_level = 0;
1382                 /*
1383                  * abuse rtransid, it is safe because it is impossible to
1384                  * receive data into a relocation tree.
1385                  */
1386                 btrfs_set_root_rtransid(root_item, last_snap);
1387                 btrfs_set_root_otransid(root_item, trans->transid);
1388         }
1389
1390         btrfs_tree_unlock(eb);
1391         free_extent_buffer(eb);
1392
1393         ret = btrfs_insert_root(trans, root->fs_info->tree_root,
1394                                 &root_key, root_item);
1395         BUG_ON(ret);
1396         kfree(root_item);
1397
1398         reloc_root = btrfs_read_fs_root(root->fs_info->tree_root, &root_key);
1399         BUG_ON(IS_ERR(reloc_root));
1400         reloc_root->last_trans = trans->transid;
1401         return reloc_root;
1402 }
1403
1404 /*
1405  * create reloc tree for a given fs tree. reloc tree is just a
1406  * snapshot of the fs tree with special root objectid.
1407  */
1408 int btrfs_init_reloc_root(struct btrfs_trans_handle *trans,
1409                           struct btrfs_root *root)
1410 {
1411         struct btrfs_root *reloc_root;
1412         struct reloc_control *rc = root->fs_info->reloc_ctl;
1413         struct btrfs_block_rsv *rsv;
1414         int clear_rsv = 0;
1415         int ret;
1416
1417         if (root->reloc_root) {
1418                 reloc_root = root->reloc_root;
1419                 reloc_root->last_trans = trans->transid;
1420                 return 0;
1421         }
1422
1423         if (!rc || !rc->create_reloc_tree ||
1424             root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID)
1425                 return 0;
1426
1427         if (!trans->reloc_reserved) {
1428                 rsv = trans->block_rsv;
1429                 trans->block_rsv = rc->block_rsv;
1430                 clear_rsv = 1;
1431         }
1432         reloc_root = create_reloc_root(trans, root, root->root_key.objectid);
1433         if (clear_rsv)
1434                 trans->block_rsv = rsv;
1435
1436         ret = __add_reloc_root(reloc_root);
1437         BUG_ON(ret < 0);
1438         root->reloc_root = reloc_root;
1439         return 0;
1440 }
1441
1442 /*
1443  * update root item of reloc tree
1444  */
1445 int btrfs_update_reloc_root(struct btrfs_trans_handle *trans,
1446                             struct btrfs_root *root)
1447 {
1448         struct btrfs_root *reloc_root;
1449         struct btrfs_root_item *root_item;
1450         int ret;
1451
1452         if (!root->reloc_root)
1453                 goto out;
1454
1455         reloc_root = root->reloc_root;
1456         root_item = &reloc_root->root_item;
1457
1458         if (root->fs_info->reloc_ctl->merge_reloc_tree &&
1459             btrfs_root_refs(root_item) == 0) {
1460                 root->reloc_root = NULL;
1461                 __del_reloc_root(reloc_root);
1462         }
1463
1464         if (reloc_root->commit_root != reloc_root->node) {
1465                 btrfs_set_root_node(root_item, reloc_root->node);
1466                 free_extent_buffer(reloc_root->commit_root);
1467                 reloc_root->commit_root = btrfs_root_node(reloc_root);
1468         }
1469
1470         ret = btrfs_update_root(trans, root->fs_info->tree_root,
1471                                 &reloc_root->root_key, root_item);
1472         BUG_ON(ret);
1473
1474 out:
1475         return 0;
1476 }
1477
1478 /*
1479  * helper to find first cached inode with inode number >= objectid
1480  * in a subvolume
1481  */
1482 static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid)
1483 {
1484         struct rb_node *node;
1485         struct rb_node *prev;
1486         struct btrfs_inode *entry;
1487         struct inode *inode;
1488
1489         spin_lock(&root->inode_lock);
1490 again:
1491         node = root->inode_tree.rb_node;
1492         prev = NULL;
1493         while (node) {
1494                 prev = node;
1495                 entry = rb_entry(node, struct btrfs_inode, rb_node);
1496
1497                 if (objectid < btrfs_ino(&entry->vfs_inode))
1498                         node = node->rb_left;
1499                 else if (objectid > btrfs_ino(&entry->vfs_inode))
1500                         node = node->rb_right;
1501                 else
1502                         break;
1503         }
1504         if (!node) {
1505                 while (prev) {
1506                         entry = rb_entry(prev, struct btrfs_inode, rb_node);
1507                         if (objectid <= btrfs_ino(&entry->vfs_inode)) {
1508                                 node = prev;
1509                                 break;
1510                         }
1511                         prev = rb_next(prev);
1512                 }
1513         }
1514         while (node) {
1515                 entry = rb_entry(node, struct btrfs_inode, rb_node);
1516                 inode = igrab(&entry->vfs_inode);
1517                 if (inode) {
1518                         spin_unlock(&root->inode_lock);
1519                         return inode;
1520                 }
1521
1522                 objectid = btrfs_ino(&entry->vfs_inode) + 1;
1523                 if (cond_resched_lock(&root->inode_lock))
1524                         goto again;
1525
1526                 node = rb_next(node);
1527         }
1528         spin_unlock(&root->inode_lock);
1529         return NULL;
1530 }
1531
1532 static int in_block_group(u64 bytenr,
1533                           struct btrfs_block_group_cache *block_group)
1534 {
1535         if (bytenr >= block_group->key.objectid &&
1536             bytenr < block_group->key.objectid + block_group->key.offset)
1537                 return 1;
1538         return 0;
1539 }
1540
1541 /*
1542  * get new location of data
1543  */
1544 static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr,
1545                             u64 bytenr, u64 num_bytes)
1546 {
1547         struct btrfs_root *root = BTRFS_I(reloc_inode)->root;
1548         struct btrfs_path *path;
1549         struct btrfs_file_extent_item *fi;
1550         struct extent_buffer *leaf;
1551         int ret;
1552
1553         path = btrfs_alloc_path();
1554         if (!path)
1555                 return -ENOMEM;
1556
1557         bytenr -= BTRFS_I(reloc_inode)->index_cnt;
1558         ret = btrfs_lookup_file_extent(NULL, root, path, btrfs_ino(reloc_inode),
1559                                        bytenr, 0);
1560         if (ret < 0)
1561                 goto out;
1562         if (ret > 0) {
1563                 ret = -ENOENT;
1564                 goto out;
1565         }
1566
1567         leaf = path->nodes[0];
1568         fi = btrfs_item_ptr(leaf, path->slots[0],
1569                             struct btrfs_file_extent_item);
1570
1571         BUG_ON(btrfs_file_extent_offset(leaf, fi) ||
1572                btrfs_file_extent_compression(leaf, fi) ||
1573                btrfs_file_extent_encryption(leaf, fi) ||
1574                btrfs_file_extent_other_encoding(leaf, fi));
1575
1576         if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) {
1577                 ret = -EINVAL;
1578                 goto out;
1579         }
1580
1581         *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
1582         ret = 0;
1583 out:
1584         btrfs_free_path(path);
1585         return ret;
1586 }
1587
1588 /*
1589  * update file extent items in the tree leaf to point to
1590  * the new locations.
1591  */
1592 static noinline_for_stack
1593 int replace_file_extents(struct btrfs_trans_handle *trans,
1594                          struct reloc_control *rc,
1595                          struct btrfs_root *root,
1596                          struct extent_buffer *leaf)
1597 {
1598         struct btrfs_key key;
1599         struct btrfs_file_extent_item *fi;
1600         struct inode *inode = NULL;
1601         u64 parent;
1602         u64 bytenr;
1603         u64 new_bytenr = 0;
1604         u64 num_bytes;
1605         u64 end;
1606         u32 nritems;
1607         u32 i;
1608         int ret = 0;
1609         int first = 1;
1610         int dirty = 0;
1611
1612         if (rc->stage != UPDATE_DATA_PTRS)
1613                 return 0;
1614
1615         /* reloc trees always use full backref */
1616         if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID)
1617                 parent = leaf->start;
1618         else
1619                 parent = 0;
1620
1621         nritems = btrfs_header_nritems(leaf);
1622         for (i = 0; i < nritems; i++) {
1623                 cond_resched();
1624                 btrfs_item_key_to_cpu(leaf, &key, i);
1625                 if (key.type != BTRFS_EXTENT_DATA_KEY)
1626                         continue;
1627                 fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item);
1628                 if (btrfs_file_extent_type(leaf, fi) ==
1629                     BTRFS_FILE_EXTENT_INLINE)
1630                         continue;
1631                 bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
1632                 num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi);
1633                 if (bytenr == 0)
1634                         continue;
1635                 if (!in_block_group(bytenr, rc->block_group))
1636                         continue;
1637
1638                 /*
1639                  * if we are modifying block in fs tree, wait for readpage
1640                  * to complete and drop the extent cache
1641                  */
1642                 if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) {
1643                         if (first) {
1644                                 inode = find_next_inode(root, key.objectid);
1645                                 first = 0;
1646                         } else if (inode && btrfs_ino(inode) < key.objectid) {
1647                                 btrfs_add_delayed_iput(inode);
1648                                 inode = find_next_inode(root, key.objectid);
1649                         }
1650                         if (inode && btrfs_ino(inode) == key.objectid) {
1651                                 end = key.offset +
1652                                       btrfs_file_extent_num_bytes(leaf, fi);
1653                                 WARN_ON(!IS_ALIGNED(key.offset,
1654                                                     root->sectorsize));
1655                                 WARN_ON(!IS_ALIGNED(end, root->sectorsize));
1656                                 end--;
1657                                 ret = try_lock_extent(&BTRFS_I(inode)->io_tree,
1658                                                       key.offset, end);
1659                                 if (!ret)
1660                                         continue;
1661
1662                                 btrfs_drop_extent_cache(inode, key.offset, end,
1663                                                         1);
1664                                 unlock_extent(&BTRFS_I(inode)->io_tree,
1665                                               key.offset, end);
1666                         }
1667                 }
1668
1669                 ret = get_new_location(rc->data_inode, &new_bytenr,
1670                                        bytenr, num_bytes);
1671                 if (ret) {
1672                         /*
1673                          * Don't have to abort since we've not changed anything
1674                          * in the file extent yet.
1675                          */
1676                         break;
1677                 }
1678
1679                 btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr);
1680                 dirty = 1;
1681
1682                 key.offset -= btrfs_file_extent_offset(leaf, fi);
1683                 ret = btrfs_inc_extent_ref(trans, root, new_bytenr,
1684                                            num_bytes, parent,
1685                                            btrfs_header_owner(leaf),
1686                                            key.objectid, key.offset, 1);
1687                 if (ret) {
1688                         btrfs_abort_transaction(trans, root, ret);
1689                         break;
1690                 }
1691
1692                 ret = btrfs_free_extent(trans, root, bytenr, num_bytes,
1693                                         parent, btrfs_header_owner(leaf),
1694                                         key.objectid, key.offset, 1);
1695                 if (ret) {
1696                         btrfs_abort_transaction(trans, root, ret);
1697                         break;
1698                 }
1699         }
1700         if (dirty)
1701                 btrfs_mark_buffer_dirty(leaf);
1702         if (inode)
1703                 btrfs_add_delayed_iput(inode);
1704         return ret;
1705 }
1706
1707 static noinline_for_stack
1708 int memcmp_node_keys(struct extent_buffer *eb, int slot,
1709                      struct btrfs_path *path, int level)
1710 {
1711         struct btrfs_disk_key key1;
1712         struct btrfs_disk_key key2;
1713         btrfs_node_key(eb, &key1, slot);
1714         btrfs_node_key(path->nodes[level], &key2, path->slots[level]);
1715         return memcmp(&key1, &key2, sizeof(key1));
1716 }
1717
1718 /*
1719  * try to replace tree blocks in fs tree with the new blocks
1720  * in reloc tree. tree blocks haven't been modified since the
1721  * reloc tree was create can be replaced.
1722  *
1723  * if a block was replaced, level of the block + 1 is returned.
1724  * if no block got replaced, 0 is returned. if there are other
1725  * errors, a negative error number is returned.
1726  */
1727 static noinline_for_stack
1728 int replace_path(struct btrfs_trans_handle *trans,
1729                  struct btrfs_root *dest, struct btrfs_root *src,
1730                  struct btrfs_path *path, struct btrfs_key *next_key,
1731                  int lowest_level, int max_level)
1732 {
1733         struct extent_buffer *eb;
1734         struct extent_buffer *parent;
1735         struct btrfs_key key;
1736         u64 old_bytenr;
1737         u64 new_bytenr;
1738         u64 old_ptr_gen;
1739         u64 new_ptr_gen;
1740         u64 last_snapshot;
1741         u32 blocksize;
1742         int cow = 0;
1743         int level;
1744         int ret;
1745         int slot;
1746
1747         BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID);
1748         BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID);
1749
1750         last_snapshot = btrfs_root_last_snapshot(&src->root_item);
1751 again:
1752         slot = path->slots[lowest_level];
1753         btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot);
1754
1755         eb = btrfs_lock_root_node(dest);
1756         btrfs_set_lock_blocking(eb);
1757         level = btrfs_header_level(eb);
1758
1759         if (level < lowest_level) {
1760                 btrfs_tree_unlock(eb);
1761                 free_extent_buffer(eb);
1762                 return 0;
1763         }
1764
1765         if (cow) {
1766                 ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb);
1767                 BUG_ON(ret);
1768         }
1769         btrfs_set_lock_blocking(eb);
1770
1771         if (next_key) {
1772                 next_key->objectid = (u64)-1;
1773                 next_key->type = (u8)-1;
1774                 next_key->offset = (u64)-1;
1775         }
1776
1777         parent = eb;
1778         while (1) {
1779                 level = btrfs_header_level(parent);
1780                 BUG_ON(level < lowest_level);
1781
1782                 ret = btrfs_bin_search(parent, &key, level, &slot);
1783                 if (ret && slot > 0)
1784                         slot--;
1785
1786                 if (next_key && slot + 1 < btrfs_header_nritems(parent))
1787                         btrfs_node_key_to_cpu(parent, next_key, slot + 1);
1788
1789                 old_bytenr = btrfs_node_blockptr(parent, slot);
1790                 blocksize = dest->nodesize;
1791                 old_ptr_gen = btrfs_node_ptr_generation(parent, slot);
1792
1793                 if (level <= max_level) {
1794                         eb = path->nodes[level];
1795                         new_bytenr = btrfs_node_blockptr(eb,
1796                                                         path->slots[level]);
1797                         new_ptr_gen = btrfs_node_ptr_generation(eb,
1798                                                         path->slots[level]);
1799                 } else {
1800                         new_bytenr = 0;
1801                         new_ptr_gen = 0;
1802                 }
1803
1804                 if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) {
1805                         ret = level;
1806                         break;
1807                 }
1808
1809                 if (new_bytenr == 0 || old_ptr_gen > last_snapshot ||
1810                     memcmp_node_keys(parent, slot, path, level)) {
1811                         if (level <= lowest_level) {
1812                                 ret = 0;
1813                                 break;
1814                         }
1815
1816                         eb = read_tree_block(dest, old_bytenr, blocksize,
1817                                              old_ptr_gen);
1818                         if (!eb || !extent_buffer_uptodate(eb)) {
1819                                 ret = (!eb) ? -ENOMEM : -EIO;
1820                                 free_extent_buffer(eb);
1821                                 break;
1822                         }
1823                         btrfs_tree_lock(eb);
1824                         if (cow) {
1825                                 ret = btrfs_cow_block(trans, dest, eb, parent,
1826                                                       slot, &eb);
1827                                 BUG_ON(ret);
1828                         }
1829                         btrfs_set_lock_blocking(eb);
1830
1831                         btrfs_tree_unlock(parent);
1832                         free_extent_buffer(parent);
1833
1834                         parent = eb;
1835                         continue;
1836                 }
1837
1838                 if (!cow) {
1839                         btrfs_tree_unlock(parent);
1840                         free_extent_buffer(parent);
1841                         cow = 1;
1842                         goto again;
1843                 }
1844
1845                 btrfs_node_key_to_cpu(path->nodes[level], &key,
1846                                       path->slots[level]);
1847                 btrfs_release_path(path);
1848
1849                 path->lowest_level = level;
1850                 ret = btrfs_search_slot(trans, src, &key, path, 0, 1);
1851                 path->lowest_level = 0;
1852                 BUG_ON(ret);
1853
1854                 /*
1855                  * swap blocks in fs tree and reloc tree.
1856                  */
1857                 btrfs_set_node_blockptr(parent, slot, new_bytenr);
1858                 btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen);
1859                 btrfs_mark_buffer_dirty(parent);
1860
1861                 btrfs_set_node_blockptr(path->nodes[level],
1862                                         path->slots[level], old_bytenr);
1863                 btrfs_set_node_ptr_generation(path->nodes[level],
1864                                               path->slots[level], old_ptr_gen);
1865                 btrfs_mark_buffer_dirty(path->nodes[level]);
1866
1867                 ret = btrfs_inc_extent_ref(trans, src, old_bytenr, blocksize,
1868                                         path->nodes[level]->start,
1869                                         src->root_key.objectid, level - 1, 0,
1870                                         1);
1871                 BUG_ON(ret);
1872                 ret = btrfs_inc_extent_ref(trans, dest, new_bytenr, blocksize,
1873                                         0, dest->root_key.objectid, level - 1,
1874                                         0, 1);
1875                 BUG_ON(ret);
1876
1877                 ret = btrfs_free_extent(trans, src, new_bytenr, blocksize,
1878                                         path->nodes[level]->start,
1879                                         src->root_key.objectid, level - 1, 0,
1880                                         1);
1881                 BUG_ON(ret);
1882
1883                 ret = btrfs_free_extent(trans, dest, old_bytenr, blocksize,
1884                                         0, dest->root_key.objectid, level - 1,
1885                                         0, 1);
1886                 BUG_ON(ret);
1887
1888                 btrfs_unlock_up_safe(path, 0);
1889
1890                 ret = level;
1891                 break;
1892         }
1893         btrfs_tree_unlock(parent);
1894         free_extent_buffer(parent);
1895         return ret;
1896 }
1897
1898 /*
1899  * helper to find next relocated block in reloc tree
1900  */
1901 static noinline_for_stack
1902 int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path,
1903                        int *level)
1904 {
1905         struct extent_buffer *eb;
1906         int i;
1907         u64 last_snapshot;
1908         u32 nritems;
1909
1910         last_snapshot = btrfs_root_last_snapshot(&root->root_item);
1911
1912         for (i = 0; i < *level; i++) {
1913                 free_extent_buffer(path->nodes[i]);
1914                 path->nodes[i] = NULL;
1915         }
1916
1917         for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) {
1918                 eb = path->nodes[i];
1919                 nritems = btrfs_header_nritems(eb);
1920                 while (path->slots[i] + 1 < nritems) {
1921                         path->slots[i]++;
1922                         if (btrfs_node_ptr_generation(eb, path->slots[i]) <=
1923                             last_snapshot)
1924                                 continue;
1925
1926                         *level = i;
1927                         return 0;
1928                 }
1929                 free_extent_buffer(path->nodes[i]);
1930                 path->nodes[i] = NULL;
1931         }
1932         return 1;
1933 }
1934
1935 /*
1936  * walk down reloc tree to find relocated block of lowest level
1937  */
1938 static noinline_for_stack
1939 int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path,
1940                          int *level)
1941 {
1942         struct extent_buffer *eb = NULL;
1943         int i;
1944         u64 bytenr;
1945         u64 ptr_gen = 0;
1946         u64 last_snapshot;
1947         u32 blocksize;
1948         u32 nritems;
1949
1950         last_snapshot = btrfs_root_last_snapshot(&root->root_item);
1951
1952         for (i = *level; i > 0; i--) {
1953                 eb = path->nodes[i];
1954                 nritems = btrfs_header_nritems(eb);
1955                 while (path->slots[i] < nritems) {
1956                         ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]);
1957                         if (ptr_gen > last_snapshot)
1958                                 break;
1959                         path->slots[i]++;
1960                 }
1961                 if (path->slots[i] >= nritems) {
1962                         if (i == *level)
1963                                 break;
1964                         *level = i + 1;
1965                         return 0;
1966                 }
1967                 if (i == 1) {
1968                         *level = i;
1969                         return 0;
1970                 }
1971
1972                 bytenr = btrfs_node_blockptr(eb, path->slots[i]);
1973                 blocksize = root->nodesize;
1974                 eb = read_tree_block(root, bytenr, blocksize, ptr_gen);
1975                 if (!eb || !extent_buffer_uptodate(eb)) {
1976                         free_extent_buffer(eb);
1977                         return -EIO;
1978                 }
1979                 BUG_ON(btrfs_header_level(eb) != i - 1);
1980                 path->nodes[i - 1] = eb;
1981                 path->slots[i - 1] = 0;
1982         }
1983         return 1;
1984 }
1985
1986 /*
1987  * invalidate extent cache for file extents whose key in range of
1988  * [min_key, max_key)
1989  */
1990 static int invalidate_extent_cache(struct btrfs_root *root,
1991                                    struct btrfs_key *min_key,
1992                                    struct btrfs_key *max_key)
1993 {
1994         struct inode *inode = NULL;
1995         u64 objectid;
1996         u64 start, end;
1997         u64 ino;
1998
1999         objectid = min_key->objectid;
2000         while (1) {
2001                 cond_resched();
2002                 iput(inode);
2003
2004                 if (objectid > max_key->objectid)
2005                         break;
2006
2007                 inode = find_next_inode(root, objectid);
2008                 if (!inode)
2009                         break;
2010                 ino = btrfs_ino(inode);
2011
2012                 if (ino > max_key->objectid) {
2013                         iput(inode);
2014                         break;
2015                 }
2016
2017                 objectid = ino + 1;
2018                 if (!S_ISREG(inode->i_mode))
2019                         continue;
2020
2021                 if (unlikely(min_key->objectid == ino)) {
2022                         if (min_key->type > BTRFS_EXTENT_DATA_KEY)
2023                                 continue;
2024                         if (min_key->type < BTRFS_EXTENT_DATA_KEY)
2025                                 start = 0;
2026                         else {
2027                                 start = min_key->offset;
2028                                 WARN_ON(!IS_ALIGNED(start, root->sectorsize));
2029                         }
2030                 } else {
2031                         start = 0;
2032                 }
2033
2034                 if (unlikely(max_key->objectid == ino)) {
2035                         if (max_key->type < BTRFS_EXTENT_DATA_KEY)
2036                                 continue;
2037                         if (max_key->type > BTRFS_EXTENT_DATA_KEY) {
2038                                 end = (u64)-1;
2039                         } else {
2040                                 if (max_key->offset == 0)
2041                                         continue;
2042                                 end = max_key->offset;
2043                                 WARN_ON(!IS_ALIGNED(end, root->sectorsize));
2044                                 end--;
2045                         }
2046                 } else {
2047                         end = (u64)-1;
2048                 }
2049
2050                 /* the lock_extent waits for readpage to complete */
2051                 lock_extent(&BTRFS_I(inode)->io_tree, start, end);
2052                 btrfs_drop_extent_cache(inode, start, end, 1);
2053                 unlock_extent(&BTRFS_I(inode)->io_tree, start, end);
2054         }
2055         return 0;
2056 }
2057
2058 static int find_next_key(struct btrfs_path *path, int level,
2059                          struct btrfs_key *key)
2060
2061 {
2062         while (level < BTRFS_MAX_LEVEL) {
2063                 if (!path->nodes[level])
2064                         break;
2065                 if (path->slots[level] + 1 <
2066                     btrfs_header_nritems(path->nodes[level])) {
2067                         btrfs_node_key_to_cpu(path->nodes[level], key,
2068                                               path->slots[level] + 1);
2069                         return 0;
2070                 }
2071                 level++;
2072         }
2073         return 1;
2074 }
2075
2076 /*
2077  * merge the relocated tree blocks in reloc tree with corresponding
2078  * fs tree.
2079  */
2080 static noinline_for_stack int merge_reloc_root(struct reloc_control *rc,
2081                                                struct btrfs_root *root)
2082 {
2083         LIST_HEAD(inode_list);
2084         struct btrfs_key key;
2085         struct btrfs_key next_key;
2086         struct btrfs_trans_handle *trans = NULL;
2087         struct btrfs_root *reloc_root;
2088         struct btrfs_root_item *root_item;
2089         struct btrfs_path *path;
2090         struct extent_buffer *leaf;
2091         int level;
2092         int max_level;
2093         int replaced = 0;
2094         int ret;
2095         int err = 0;
2096         u32 min_reserved;
2097
2098         path = btrfs_alloc_path();
2099         if (!path)
2100                 return -ENOMEM;
2101         path->reada = 1;
2102
2103         reloc_root = root->reloc_root;
2104         root_item = &reloc_root->root_item;
2105
2106         if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) {
2107                 level = btrfs_root_level(root_item);
2108                 extent_buffer_get(reloc_root->node);
2109                 path->nodes[level] = reloc_root->node;
2110                 path->slots[level] = 0;
2111         } else {
2112                 btrfs_disk_key_to_cpu(&key, &root_item->drop_progress);
2113
2114                 level = root_item->drop_level;
2115                 BUG_ON(level == 0);
2116                 path->lowest_level = level;
2117                 ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0);
2118                 path->lowest_level = 0;
2119                 if (ret < 0) {
2120                         btrfs_free_path(path);
2121                         return ret;
2122                 }
2123
2124                 btrfs_node_key_to_cpu(path->nodes[level], &next_key,
2125                                       path->slots[level]);
2126                 WARN_ON(memcmp(&key, &next_key, sizeof(key)));
2127
2128                 btrfs_unlock_up_safe(path, 0);
2129         }
2130
2131         min_reserved = root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2;
2132         memset(&next_key, 0, sizeof(next_key));
2133
2134         while (1) {
2135                 ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved,
2136                                              BTRFS_RESERVE_FLUSH_ALL);
2137                 if (ret) {
2138                         err = ret;
2139                         goto out;
2140                 }
2141                 trans = btrfs_start_transaction(root, 0);
2142                 if (IS_ERR(trans)) {
2143                         err = PTR_ERR(trans);
2144                         trans = NULL;
2145                         goto out;
2146                 }
2147                 trans->block_rsv = rc->block_rsv;
2148
2149                 replaced = 0;
2150                 max_level = level;
2151
2152                 ret = walk_down_reloc_tree(reloc_root, path, &level);
2153                 if (ret < 0) {
2154                         err = ret;
2155                         goto out;
2156                 }
2157                 if (ret > 0)
2158                         break;
2159
2160                 if (!find_next_key(path, level, &key) &&
2161                     btrfs_comp_cpu_keys(&next_key, &key) >= 0) {
2162                         ret = 0;
2163                 } else {
2164                         ret = replace_path(trans, root, reloc_root, path,
2165                                            &next_key, level, max_level);
2166                 }
2167                 if (ret < 0) {
2168                         err = ret;
2169                         goto out;
2170                 }
2171
2172                 if (ret > 0) {
2173                         level = ret;
2174                         btrfs_node_key_to_cpu(path->nodes[level], &key,
2175                                               path->slots[level]);
2176                         replaced = 1;
2177                 }
2178
2179                 ret = walk_up_reloc_tree(reloc_root, path, &level);
2180                 if (ret > 0)
2181                         break;
2182
2183                 BUG_ON(level == 0);
2184                 /*
2185                  * save the merging progress in the drop_progress.
2186                  * this is OK since root refs == 1 in this case.
2187                  */
2188                 btrfs_node_key(path->nodes[level], &root_item->drop_progress,
2189                                path->slots[level]);
2190                 root_item->drop_level = level;
2191
2192                 btrfs_end_transaction_throttle(trans, root);
2193                 trans = NULL;
2194
2195                 btrfs_btree_balance_dirty(root);
2196
2197                 if (replaced && rc->stage == UPDATE_DATA_PTRS)
2198                         invalidate_extent_cache(root, &key, &next_key);
2199         }
2200
2201         /*
2202          * handle the case only one block in the fs tree need to be
2203          * relocated and the block is tree root.
2204          */
2205         leaf = btrfs_lock_root_node(root);
2206         ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf);
2207         btrfs_tree_unlock(leaf);
2208         free_extent_buffer(leaf);
2209         if (ret < 0)
2210                 err = ret;
2211 out:
2212         btrfs_free_path(path);
2213
2214         if (err == 0) {
2215                 memset(&root_item->drop_progress, 0,
2216                        sizeof(root_item->drop_progress));
2217                 root_item->drop_level = 0;
2218                 btrfs_set_root_refs(root_item, 0);
2219                 btrfs_update_reloc_root(trans, root);
2220         }
2221
2222         if (trans)
2223                 btrfs_end_transaction_throttle(trans, root);
2224
2225         btrfs_btree_balance_dirty(root);
2226
2227         if (replaced && rc->stage == UPDATE_DATA_PTRS)
2228                 invalidate_extent_cache(root, &key, &next_key);
2229
2230         return err;
2231 }
2232
2233 static noinline_for_stack
2234 int prepare_to_merge(struct reloc_control *rc, int err)
2235 {
2236         struct btrfs_root *root = rc->extent_root;
2237         struct btrfs_root *reloc_root;
2238         struct btrfs_trans_handle *trans;
2239         LIST_HEAD(reloc_roots);
2240         u64 num_bytes = 0;
2241         int ret;
2242
2243         mutex_lock(&root->fs_info->reloc_mutex);
2244         rc->merging_rsv_size += root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2;
2245         rc->merging_rsv_size += rc->nodes_relocated * 2;
2246         mutex_unlock(&root->fs_info->reloc_mutex);
2247
2248 again:
2249         if (!err) {
2250                 num_bytes = rc->merging_rsv_size;
2251                 ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes,
2252                                           BTRFS_RESERVE_FLUSH_ALL);
2253                 if (ret)
2254                         err = ret;
2255         }
2256
2257         trans = btrfs_join_transaction(rc->extent_root);
2258         if (IS_ERR(trans)) {
2259                 if (!err)
2260                         btrfs_block_rsv_release(rc->extent_root,
2261                                                 rc->block_rsv, num_bytes);
2262                 return PTR_ERR(trans);
2263         }
2264
2265         if (!err) {
2266                 if (num_bytes != rc->merging_rsv_size) {
2267                         btrfs_end_transaction(trans, rc->extent_root);
2268                         btrfs_block_rsv_release(rc->extent_root,
2269                                                 rc->block_rsv, num_bytes);
2270                         goto again;
2271                 }
2272         }
2273
2274         rc->merge_reloc_tree = 1;
2275
2276         while (!list_empty(&rc->reloc_roots)) {
2277                 reloc_root = list_entry(rc->reloc_roots.next,
2278                                         struct btrfs_root, root_list);
2279                 list_del_init(&reloc_root->root_list);
2280
2281                 root = read_fs_root(reloc_root->fs_info,
2282                                     reloc_root->root_key.offset);
2283                 BUG_ON(IS_ERR(root));
2284                 BUG_ON(root->reloc_root != reloc_root);
2285
2286                 /*
2287                  * set reference count to 1, so btrfs_recover_relocation
2288                  * knows it should resumes merging
2289                  */
2290                 if (!err)
2291                         btrfs_set_root_refs(&reloc_root->root_item, 1);
2292                 btrfs_update_reloc_root(trans, root);
2293
2294                 list_add(&reloc_root->root_list, &reloc_roots);
2295         }
2296
2297         list_splice(&reloc_roots, &rc->reloc_roots);
2298
2299         if (!err)
2300                 btrfs_commit_transaction(trans, rc->extent_root);
2301         else
2302                 btrfs_end_transaction(trans, rc->extent_root);
2303         return err;
2304 }
2305
2306 static noinline_for_stack
2307 void free_reloc_roots(struct list_head *list)
2308 {
2309         struct btrfs_root *reloc_root;
2310
2311         while (!list_empty(list)) {
2312                 reloc_root = list_entry(list->next, struct btrfs_root,
2313                                         root_list);
2314                 __del_reloc_root(reloc_root);
2315         }
2316 }
2317
2318 static noinline_for_stack
2319 int merge_reloc_roots(struct reloc_control *rc)
2320 {
2321         struct btrfs_root *root;
2322         struct btrfs_root *reloc_root;
2323         u64 last_snap;
2324         u64 otransid;
2325         u64 objectid;
2326         LIST_HEAD(reloc_roots);
2327         int found = 0;
2328         int ret = 0;
2329 again:
2330         root = rc->extent_root;
2331
2332         /*
2333          * this serializes us with btrfs_record_root_in_transaction,
2334          * we have to make sure nobody is in the middle of
2335          * adding their roots to the list while we are
2336          * doing this splice
2337          */
2338         mutex_lock(&root->fs_info->reloc_mutex);
2339         list_splice_init(&rc->reloc_roots, &reloc_roots);
2340         mutex_unlock(&root->fs_info->reloc_mutex);
2341
2342         while (!list_empty(&reloc_roots)) {
2343                 found = 1;
2344                 reloc_root = list_entry(reloc_roots.next,
2345                                         struct btrfs_root, root_list);
2346
2347                 if (btrfs_root_refs(&reloc_root->root_item) > 0) {
2348                         root = read_fs_root(reloc_root->fs_info,
2349                                             reloc_root->root_key.offset);
2350                         BUG_ON(IS_ERR(root));
2351                         BUG_ON(root->reloc_root != reloc_root);
2352
2353                         ret = merge_reloc_root(rc, root);
2354                         if (ret) {
2355                                 if (list_empty(&reloc_root->root_list))
2356                                         list_add_tail(&reloc_root->root_list,
2357                                                       &reloc_roots);
2358                                 goto out;
2359                         }
2360                 } else {
2361                         list_del_init(&reloc_root->root_list);
2362                 }
2363
2364                 /*
2365                  * we keep the old last snapshod transid in rtranid when we
2366                  * created the relocation tree.
2367                  */
2368                 last_snap = btrfs_root_rtransid(&reloc_root->root_item);
2369                 otransid = btrfs_root_otransid(&reloc_root->root_item);
2370                 objectid = reloc_root->root_key.offset;
2371
2372                 ret = btrfs_drop_snapshot(reloc_root, rc->block_rsv, 0, 1);
2373                 if (ret < 0) {
2374                         if (list_empty(&reloc_root->root_list))
2375                                 list_add_tail(&reloc_root->root_list,
2376                                               &reloc_roots);
2377                         goto out;
2378                 }
2379         }
2380
2381         if (found) {
2382                 found = 0;
2383                 goto again;
2384         }
2385 out:
2386         if (ret) {
2387                 btrfs_std_error(root->fs_info, ret);
2388                 if (!list_empty(&reloc_roots))
2389                         free_reloc_roots(&reloc_roots);
2390
2391                 /* new reloc root may be added */
2392                 mutex_lock(&root->fs_info->reloc_mutex);
2393                 list_splice_init(&rc->reloc_roots, &reloc_roots);
2394                 mutex_unlock(&root->fs_info->reloc_mutex);
2395                 if (!list_empty(&reloc_roots))
2396                         free_reloc_roots(&reloc_roots);
2397         }
2398
2399         BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root));
2400         return ret;
2401 }
2402
2403 static void free_block_list(struct rb_root *blocks)
2404 {
2405         struct tree_block *block;
2406         struct rb_node *rb_node;
2407         while ((rb_node = rb_first(blocks))) {
2408                 block = rb_entry(rb_node, struct tree_block, rb_node);
2409                 rb_erase(rb_node, blocks);
2410                 kfree(block);
2411         }
2412 }
2413
2414 static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans,
2415                                       struct btrfs_root *reloc_root)
2416 {
2417         struct btrfs_root *root;
2418
2419         if (reloc_root->last_trans == trans->transid)
2420                 return 0;
2421
2422         root = read_fs_root(reloc_root->fs_info, reloc_root->root_key.offset);
2423         BUG_ON(IS_ERR(root));
2424         BUG_ON(root->reloc_root != reloc_root);
2425
2426         return btrfs_record_root_in_trans(trans, root);
2427 }
2428
2429 static noinline_for_stack
2430 struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans,
2431                                      struct reloc_control *rc,
2432                                      struct backref_node *node,
2433                                      struct backref_edge *edges[])
2434 {
2435         struct backref_node *next;
2436         struct btrfs_root *root;
2437         int index = 0;
2438
2439         next = node;
2440         while (1) {
2441                 cond_resched();
2442                 next = walk_up_backref(next, edges, &index);
2443                 root = next->root;
2444                 BUG_ON(!root);
2445                 BUG_ON(!test_bit(BTRFS_ROOT_REF_COWS, &root->state));
2446
2447                 if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) {
2448                         record_reloc_root_in_trans(trans, root);
2449                         break;
2450                 }
2451
2452                 btrfs_record_root_in_trans(trans, root);
2453                 root = root->reloc_root;
2454
2455                 if (next->new_bytenr != root->node->start) {
2456                         BUG_ON(next->new_bytenr);
2457                         BUG_ON(!list_empty(&next->list));
2458                         next->new_bytenr = root->node->start;
2459                         next->root = root;
2460                         list_add_tail(&next->list,
2461                                       &rc->backref_cache.changed);
2462                         __mark_block_processed(rc, next);
2463                         break;
2464                 }
2465
2466                 WARN_ON(1);
2467                 root = NULL;
2468                 next = walk_down_backref(edges, &index);
2469                 if (!next || next->level <= node->level)
2470                         break;
2471         }
2472         if (!root)
2473                 return NULL;
2474
2475         next = node;
2476         /* setup backref node path for btrfs_reloc_cow_block */
2477         while (1) {
2478                 rc->backref_cache.path[next->level] = next;
2479                 if (--index < 0)
2480                         break;
2481                 next = edges[index]->node[UPPER];
2482         }
2483         return root;
2484 }
2485
2486 /*
2487  * select a tree root for relocation. return NULL if the block
2488  * is reference counted. we should use do_relocation() in this
2489  * case. return a tree root pointer if the block isn't reference
2490  * counted. return -ENOENT if the block is root of reloc tree.
2491  */
2492 static noinline_for_stack
2493 struct btrfs_root *select_one_root(struct btrfs_trans_handle *trans,
2494                                    struct backref_node *node)
2495 {
2496         struct backref_node *next;
2497         struct btrfs_root *root;
2498         struct btrfs_root *fs_root = NULL;
2499         struct backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2500         int index = 0;
2501
2502         next = node;
2503         while (1) {
2504                 cond_resched();
2505                 next = walk_up_backref(next, edges, &index);
2506                 root = next->root;
2507                 BUG_ON(!root);
2508
2509                 /* no other choice for non-references counted tree */
2510                 if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state))
2511                         return root;
2512
2513                 if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID)
2514                         fs_root = root;
2515
2516                 if (next != node)
2517                         return NULL;
2518
2519                 next = walk_down_backref(edges, &index);
2520                 if (!next || next->level <= node->level)
2521                         break;
2522         }
2523
2524         if (!fs_root)
2525                 return ERR_PTR(-ENOENT);
2526         return fs_root;
2527 }
2528
2529 static noinline_for_stack
2530 u64 calcu_metadata_size(struct reloc_control *rc,
2531                         struct backref_node *node, int reserve)
2532 {
2533         struct backref_node *next = node;
2534         struct backref_edge *edge;
2535         struct backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2536         u64 num_bytes = 0;
2537         int index = 0;
2538
2539         BUG_ON(reserve && node->processed);
2540
2541         while (next) {
2542                 cond_resched();
2543                 while (1) {
2544                         if (next->processed && (reserve || next != node))
2545                                 break;
2546
2547                         num_bytes += rc->extent_root->nodesize;
2548
2549                         if (list_empty(&next->upper))
2550                                 break;
2551
2552                         edge = list_entry(next->upper.next,
2553                                           struct backref_edge, list[LOWER]);
2554                         edges[index++] = edge;
2555                         next = edge->node[UPPER];
2556                 }
2557                 next = walk_down_backref(edges, &index);
2558         }
2559         return num_bytes;
2560 }
2561
2562 static int reserve_metadata_space(struct btrfs_trans_handle *trans,
2563                                   struct reloc_control *rc,
2564                                   struct backref_node *node)
2565 {
2566         struct btrfs_root *root = rc->extent_root;
2567         u64 num_bytes;
2568         int ret;
2569         u64 tmp;
2570
2571         num_bytes = calcu_metadata_size(rc, node, 1) * 2;
2572
2573         trans->block_rsv = rc->block_rsv;
2574         rc->reserved_bytes += num_bytes;
2575         ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes,
2576                                 BTRFS_RESERVE_FLUSH_ALL);
2577         if (ret) {
2578                 if (ret == -EAGAIN) {
2579                         tmp = rc->extent_root->nodesize *
2580                                 RELOCATION_RESERVED_NODES;
2581                         while (tmp <= rc->reserved_bytes)
2582                                 tmp <<= 1;
2583                         /*
2584                          * only one thread can access block_rsv at this point,
2585                          * so we don't need hold lock to protect block_rsv.
2586                          * we expand more reservation size here to allow enough
2587                          * space for relocation and we will return eailer in
2588                          * enospc case.
2589                          */
2590                         rc->block_rsv->size = tmp + rc->extent_root->nodesize *
2591                                               RELOCATION_RESERVED_NODES;
2592                 }
2593                 return ret;
2594         }
2595
2596         return 0;
2597 }
2598
2599 /*
2600  * relocate a block tree, and then update pointers in upper level
2601  * blocks that reference the block to point to the new location.
2602  *
2603  * if called by link_to_upper, the block has already been relocated.
2604  * in that case this function just updates pointers.
2605  */
2606 static int do_relocation(struct btrfs_trans_handle *trans,
2607                          struct reloc_control *rc,
2608                          struct backref_node *node,
2609                          struct btrfs_key *key,
2610                          struct btrfs_path *path, int lowest)
2611 {
2612         struct backref_node *upper;
2613         struct backref_edge *edge;
2614         struct backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2615         struct btrfs_root *root;
2616         struct extent_buffer *eb;
2617         u32 blocksize;
2618         u64 bytenr;
2619         u64 generation;
2620         int slot;
2621         int ret;
2622         int err = 0;
2623
2624         BUG_ON(lowest && node->eb);
2625
2626         path->lowest_level = node->level + 1;
2627         rc->backref_cache.path[node->level] = node;
2628         list_for_each_entry(edge, &node->upper, list[LOWER]) {
2629                 cond_resched();
2630
2631                 upper = edge->node[UPPER];
2632                 root = select_reloc_root(trans, rc, upper, edges);
2633                 BUG_ON(!root);
2634
2635                 if (upper->eb && !upper->locked) {
2636                         if (!lowest) {
2637                                 ret = btrfs_bin_search(upper->eb, key,
2638                                                        upper->level, &slot);
2639                                 BUG_ON(ret);
2640                                 bytenr = btrfs_node_blockptr(upper->eb, slot);
2641                                 if (node->eb->start == bytenr)
2642                                         goto next;
2643                         }
2644                         drop_node_buffer(upper);
2645                 }
2646
2647                 if (!upper->eb) {
2648                         ret = btrfs_search_slot(trans, root, key, path, 0, 1);
2649                         if (ret < 0) {
2650                                 err = ret;
2651                                 break;
2652                         }
2653                         BUG_ON(ret > 0);
2654
2655                         if (!upper->eb) {
2656                                 upper->eb = path->nodes[upper->level];
2657                                 path->nodes[upper->level] = NULL;
2658                         } else {
2659                                 BUG_ON(upper->eb != path->nodes[upper->level]);
2660                         }
2661
2662                         upper->locked = 1;
2663                         path->locks[upper->level] = 0;
2664
2665                         slot = path->slots[upper->level];
2666                         btrfs_release_path(path);
2667                 } else {
2668                         ret = btrfs_bin_search(upper->eb, key, upper->level,
2669                                                &slot);
2670                         BUG_ON(ret);
2671                 }
2672
2673                 bytenr = btrfs_node_blockptr(upper->eb, slot);
2674                 if (lowest) {
2675                         BUG_ON(bytenr != node->bytenr);
2676                 } else {
2677                         if (node->eb->start == bytenr)
2678                                 goto next;
2679                 }
2680
2681                 blocksize = root->nodesize;
2682                 generation = btrfs_node_ptr_generation(upper->eb, slot);
2683                 eb = read_tree_block(root, bytenr, blocksize, generation);
2684                 if (!eb || !extent_buffer_uptodate(eb)) {
2685                         free_extent_buffer(eb);
2686                         err = -EIO;
2687                         goto next;
2688                 }
2689                 btrfs_tree_lock(eb);
2690                 btrfs_set_lock_blocking(eb);
2691
2692                 if (!node->eb) {
2693                         ret = btrfs_cow_block(trans, root, eb, upper->eb,
2694                                               slot, &eb);
2695                         btrfs_tree_unlock(eb);
2696                         free_extent_buffer(eb);
2697                         if (ret < 0) {
2698                                 err = ret;
2699                                 goto next;
2700                         }
2701                         BUG_ON(node->eb != eb);
2702                 } else {
2703                         btrfs_set_node_blockptr(upper->eb, slot,
2704                                                 node->eb->start);
2705                         btrfs_set_node_ptr_generation(upper->eb, slot,
2706                                                       trans->transid);
2707                         btrfs_mark_buffer_dirty(upper->eb);
2708
2709                         ret = btrfs_inc_extent_ref(trans, root,
2710                                                 node->eb->start, blocksize,
2711                                                 upper->eb->start,
2712                                                 btrfs_header_owner(upper->eb),
2713                                                 node->level, 0, 1);
2714                         BUG_ON(ret);
2715
2716                         ret = btrfs_drop_subtree(trans, root, eb, upper->eb);
2717                         BUG_ON(ret);
2718                 }
2719 next:
2720                 if (!upper->pending)
2721                         drop_node_buffer(upper);
2722                 else
2723                         unlock_node_buffer(upper);
2724                 if (err)
2725                         break;
2726         }
2727
2728         if (!err && node->pending) {
2729                 drop_node_buffer(node);
2730                 list_move_tail(&node->list, &rc->backref_cache.changed);
2731                 node->pending = 0;
2732         }
2733
2734         path->lowest_level = 0;
2735         BUG_ON(err == -ENOSPC);
2736         return err;
2737 }
2738
2739 static int link_to_upper(struct btrfs_trans_handle *trans,
2740                          struct reloc_control *rc,
2741                          struct backref_node *node,
2742                          struct btrfs_path *path)
2743 {
2744         struct btrfs_key key;
2745
2746         btrfs_node_key_to_cpu(node->eb, &key, 0);
2747         return do_relocation(trans, rc, node, &key, path, 0);
2748 }
2749
2750 static int finish_pending_nodes(struct btrfs_trans_handle *trans,
2751                                 struct reloc_control *rc,
2752                                 struct btrfs_path *path, int err)
2753 {
2754         LIST_HEAD(list);
2755         struct backref_cache *cache = &rc->backref_cache;
2756         struct backref_node *node;
2757         int level;
2758         int ret;
2759
2760         for (level = 0; level < BTRFS_MAX_LEVEL; level++) {
2761                 while (!list_empty(&cache->pending[level])) {
2762                         node = list_entry(cache->pending[level].next,
2763                                           struct backref_node, list);
2764                         list_move_tail(&node->list, &list);
2765                         BUG_ON(!node->pending);
2766
2767                         if (!err) {
2768                                 ret = link_to_upper(trans, rc, node, path);
2769                                 if (ret < 0)
2770                                         err = ret;
2771                         }
2772                 }
2773                 list_splice_init(&list, &cache->pending[level]);
2774         }
2775         return err;
2776 }
2777
2778 static void mark_block_processed(struct reloc_control *rc,
2779                                  u64 bytenr, u32 blocksize)
2780 {
2781         set_extent_bits(&rc->processed_blocks, bytenr, bytenr + blocksize - 1,
2782                         EXTENT_DIRTY, GFP_NOFS);
2783 }
2784
2785 static void __mark_block_processed(struct reloc_control *rc,
2786                                    struct backref_node *node)
2787 {
2788         u32 blocksize;
2789         if (node->level == 0 ||
2790             in_block_group(node->bytenr, rc->block_group)) {
2791                 blocksize = rc->extent_root->nodesize;
2792                 mark_block_processed(rc, node->bytenr, blocksize);
2793         }
2794         node->processed = 1;
2795 }
2796
2797 /*
2798  * mark a block and all blocks directly/indirectly reference the block
2799  * as processed.
2800  */
2801 static void update_processed_blocks(struct reloc_control *rc,
2802                                     struct backref_node *node)
2803 {
2804         struct backref_node *next = node;
2805         struct backref_edge *edge;
2806         struct backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2807         int index = 0;
2808
2809         while (next) {
2810                 cond_resched();
2811                 while (1) {
2812                         if (next->processed)
2813                                 break;
2814
2815                         __mark_block_processed(rc, next);
2816
2817                         if (list_empty(&next->upper))
2818                                 break;
2819
2820                         edge = list_entry(next->upper.next,
2821                                           struct backref_edge, list[LOWER]);
2822                         edges[index++] = edge;
2823                         next = edge->node[UPPER];
2824                 }
2825                 next = walk_down_backref(edges, &index);
2826         }
2827 }
2828
2829 static int tree_block_processed(u64 bytenr, u32 blocksize,
2830                                 struct reloc_control *rc)
2831 {
2832         if (test_range_bit(&rc->processed_blocks, bytenr,
2833                            bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL))
2834                 return 1;
2835         return 0;
2836 }
2837
2838 static int get_tree_block_key(struct reloc_control *rc,
2839                               struct tree_block *block)
2840 {
2841         struct extent_buffer *eb;
2842
2843         BUG_ON(block->key_ready);
2844         eb = read_tree_block(rc->extent_root, block->bytenr,
2845                              block->key.objectid, block->key.offset);
2846         if (!eb || !extent_buffer_uptodate(eb)) {
2847                 free_extent_buffer(eb);
2848                 return -EIO;
2849         }
2850         WARN_ON(btrfs_header_level(eb) != block->level);
2851         if (block->level == 0)
2852                 btrfs_item_key_to_cpu(eb, &block->key, 0);
2853         else
2854                 btrfs_node_key_to_cpu(eb, &block->key, 0);
2855         free_extent_buffer(eb);
2856         block->key_ready = 1;
2857         return 0;
2858 }
2859
2860 /*
2861  * helper function to relocate a tree block
2862  */
2863 static int relocate_tree_block(struct btrfs_trans_handle *trans,
2864                                 struct reloc_control *rc,
2865                                 struct backref_node *node,
2866                                 struct btrfs_key *key,
2867                                 struct btrfs_path *path)
2868 {
2869         struct btrfs_root *root;
2870         int ret = 0;
2871
2872         if (!node)
2873                 return 0;
2874
2875         BUG_ON(node->processed);
2876         root = select_one_root(trans, node);
2877         if (root == ERR_PTR(-ENOENT)) {
2878                 update_processed_blocks(rc, node);
2879                 goto out;
2880         }
2881
2882         if (!root || test_bit(BTRFS_ROOT_REF_COWS, &root->state)) {
2883                 ret = reserve_metadata_space(trans, rc, node);
2884                 if (ret)
2885                         goto out;
2886         }
2887
2888         if (root) {
2889                 if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) {
2890                         BUG_ON(node->new_bytenr);
2891                         BUG_ON(!list_empty(&node->list));
2892                         btrfs_record_root_in_trans(trans, root);
2893                         root = root->reloc_root;
2894                         node->new_bytenr = root->node->start;
2895                         node->root = root;
2896                         list_add_tail(&node->list, &rc->backref_cache.changed);
2897                 } else {
2898                         path->lowest_level = node->level;
2899                         ret = btrfs_search_slot(trans, root, key, path, 0, 1);
2900                         btrfs_release_path(path);
2901                         if (ret > 0)
2902                                 ret = 0;
2903                 }
2904                 if (!ret)
2905                         update_processed_blocks(rc, node);
2906         } else {
2907                 ret = do_relocation(trans, rc, node, key, path, 1);
2908         }
2909 out:
2910         if (ret || node->level == 0 || node->cowonly)
2911                 remove_backref_node(&rc->backref_cache, node);
2912         return ret;
2913 }
2914
2915 /*
2916  * relocate a list of blocks
2917  */
2918 static noinline_for_stack
2919 int relocate_tree_blocks(struct btrfs_trans_handle *trans,
2920                          struct reloc_control *rc, struct rb_root *blocks)
2921 {
2922         struct backref_node *node;
2923         struct btrfs_path *path;
2924         struct tree_block *block;
2925         struct rb_node *rb_node;
2926         int ret;
2927         int err = 0;
2928
2929         path = btrfs_alloc_path();
2930         if (!path) {
2931                 err = -ENOMEM;
2932                 goto out_free_blocks;
2933         }
2934
2935         rb_node = rb_first(blocks);
2936         while (rb_node) {
2937                 block = rb_entry(rb_node, struct tree_block, rb_node);
2938                 if (!block->key_ready)
2939                         readahead_tree_block(rc->extent_root, block->bytenr,
2940                                         block->key.objectid);
2941                 rb_node = rb_next(rb_node);
2942         }
2943
2944         rb_node = rb_first(blocks);
2945         while (rb_node) {
2946                 block = rb_entry(rb_node, struct tree_block, rb_node);
2947                 if (!block->key_ready) {
2948                         err = get_tree_block_key(rc, block);
2949                         if (err)
2950                                 goto out_free_path;
2951                 }
2952                 rb_node = rb_next(rb_node);
2953         }
2954
2955         rb_node = rb_first(blocks);
2956         while (rb_node) {
2957                 block = rb_entry(rb_node, struct tree_block, rb_node);
2958
2959                 node = build_backref_tree(rc, &block->key,
2960                                           block->level, block->bytenr);
2961                 if (IS_ERR(node)) {
2962                         err = PTR_ERR(node);
2963                         goto out;
2964                 }
2965
2966                 ret = relocate_tree_block(trans, rc, node, &block->key,
2967                                           path);
2968                 if (ret < 0) {
2969                         if (ret != -EAGAIN || rb_node == rb_first(blocks))
2970                                 err = ret;
2971                         goto out;
2972                 }
2973                 rb_node = rb_next(rb_node);
2974         }
2975 out:
2976         err = finish_pending_nodes(trans, rc, path, err);
2977
2978 out_free_path:
2979         btrfs_free_path(path);
2980 out_free_blocks:
2981         free_block_list(blocks);
2982         return err;
2983 }
2984
2985 static noinline_for_stack
2986 int prealloc_file_extent_cluster(struct inode *inode,
2987                                  struct file_extent_cluster *cluster)
2988 {
2989         u64 alloc_hint = 0;
2990         u64 start;
2991         u64 end;
2992         u64 offset = BTRFS_I(inode)->index_cnt;
2993         u64 num_bytes;
2994         int nr = 0;
2995         int ret = 0;
2996
2997         BUG_ON(cluster->start != cluster->boundary[0]);
2998         mutex_lock(&inode->i_mutex);
2999
3000         ret = btrfs_check_data_free_space(inode, cluster->end +
3001                                           1 - cluster->start);
3002         if (ret)
3003                 goto out;
3004
3005         while (nr < cluster->nr) {
3006                 start = cluster->boundary[nr] - offset;
3007                 if (nr + 1 < cluster->nr)
3008                         end = cluster->boundary[nr + 1] - 1 - offset;
3009                 else
3010                         end = cluster->end - offset;
3011
3012                 lock_extent(&BTRFS_I(inode)->io_tree, start, end);
3013                 num_bytes = end + 1 - start;
3014                 ret = btrfs_prealloc_file_range(inode, 0, start,
3015                                                 num_bytes, num_bytes,
3016                                                 end + 1, &alloc_hint);
3017                 unlock_extent(&BTRFS_I(inode)->io_tree, start, end);
3018                 if (ret)
3019                         break;
3020                 nr++;
3021         }
3022         btrfs_free_reserved_data_space(inode, cluster->end +
3023                                        1 - cluster->start);
3024 out:
3025         mutex_unlock(&inode->i_mutex);
3026         return ret;
3027 }
3028
3029 static noinline_for_stack
3030 int setup_extent_mapping(struct inode *inode, u64 start, u64 end,
3031                          u64 block_start)
3032 {
3033         struct btrfs_root *root = BTRFS_I(inode)->root;
3034         struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
3035         struct extent_map *em;
3036         int ret = 0;
3037
3038         em = alloc_extent_map();
3039         if (!em)
3040                 return -ENOMEM;
3041
3042         em->start = start;
3043         em->len = end + 1 - start;
3044         em->block_len = em->len;
3045         em->block_start = block_start;
3046         em->bdev = root->fs_info->fs_devices->latest_bdev;
3047         set_bit(EXTENT_FLAG_PINNED, &em->flags);
3048
3049         lock_extent(&BTRFS_I(inode)->io_tree, start, end);
3050         while (1) {
3051                 write_lock(&em_tree->lock);
3052                 ret = add_extent_mapping(em_tree, em, 0);
3053                 write_unlock(&em_tree->lock);
3054                 if (ret != -EEXIST) {
3055                         free_extent_map(em);
3056                         break;
3057                 }
3058                 btrfs_drop_extent_cache(inode, start, end, 0);
3059         }
3060         unlock_extent(&BTRFS_I(inode)->io_tree, start, end);
3061         return ret;
3062 }
3063
3064 static int relocate_file_extent_cluster(struct inode *inode,
3065                                         struct file_extent_cluster *cluster)
3066 {
3067         u64 page_start;
3068         u64 page_end;
3069         u64 offset = BTRFS_I(inode)->index_cnt;
3070         unsigned long index;
3071         unsigned long last_index;
3072         struct page *page;
3073         struct file_ra_state *ra;
3074         gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping);
3075         int nr = 0;
3076         int ret = 0;
3077
3078         if (!cluster->nr)
3079                 return 0;
3080
3081         ra = kzalloc(sizeof(*ra), GFP_NOFS);
3082         if (!ra)
3083                 return -ENOMEM;
3084
3085         ret = prealloc_file_extent_cluster(inode, cluster);
3086         if (ret)
3087                 goto out;
3088
3089         file_ra_state_init(ra, inode->i_mapping);
3090
3091         ret = setup_extent_mapping(inode, cluster->start - offset,
3092                                    cluster->end - offset, cluster->start);
3093         if (ret)
3094                 goto out;
3095
3096         index = (cluster->start - offset) >> PAGE_CACHE_SHIFT;
3097         last_index = (cluster->end - offset) >> PAGE_CACHE_SHIFT;
3098         while (index <= last_index) {
3099                 ret = btrfs_delalloc_reserve_metadata(inode, PAGE_CACHE_SIZE);
3100                 if (ret)
3101                         goto out;
3102
3103                 page = find_lock_page(inode->i_mapping, index);
3104                 if (!page) {
3105                         page_cache_sync_readahead(inode->i_mapping,
3106                                                   ra, NULL, index,
3107                                                   last_index + 1 - index);
3108                         page = find_or_create_page(inode->i_mapping, index,
3109                                                    mask);
3110                         if (!page) {
3111                                 btrfs_delalloc_release_metadata(inode,
3112                                                         PAGE_CACHE_SIZE);
3113                                 ret = -ENOMEM;
3114                                 goto out;
3115                         }
3116                 }
3117
3118                 if (PageReadahead(page)) {
3119                         page_cache_async_readahead(inode->i_mapping,
3120                                                    ra, NULL, page, index,
3121                                                    last_index + 1 - index);
3122                 }
3123
3124                 if (!PageUptodate(page)) {
3125                         btrfs_readpage(NULL, page);
3126                         lock_page(page);
3127                         if (!PageUptodate(page)) {
3128                                 unlock_page(page);
3129                                 page_cache_release(page);
3130                                 btrfs_delalloc_release_metadata(inode,
3131                                                         PAGE_CACHE_SIZE);
3132                                 ret = -EIO;
3133                                 goto out;
3134                         }
3135                 }
3136
3137                 page_start = page_offset(page);
3138                 page_end = page_start + PAGE_CACHE_SIZE - 1;
3139
3140                 lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end);
3141
3142                 set_page_extent_mapped(page);
3143
3144                 if (nr < cluster->nr &&
3145                     page_start + offset == cluster->boundary[nr]) {
3146                         set_extent_bits(&BTRFS_I(inode)->io_tree,
3147                                         page_start, page_end,
3148                                         EXTENT_BOUNDARY, GFP_NOFS);
3149                         nr++;
3150                 }
3151
3152                 btrfs_set_extent_delalloc(inode, page_start, page_end, NULL);
3153                 set_page_dirty(page);
3154
3155                 unlock_extent(&BTRFS_I(inode)->io_tree,
3156                               page_start, page_end);
3157                 unlock_page(page);
3158                 page_cache_release(page);
3159
3160                 index++;
3161                 balance_dirty_pages_ratelimited(inode->i_mapping);
3162                 btrfs_throttle(BTRFS_I(inode)->root);
3163         }
3164         WARN_ON(nr != cluster->nr);
3165 out:
3166         kfree(ra);
3167         return ret;
3168 }
3169
3170 static noinline_for_stack
3171 int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key,
3172                          struct file_extent_cluster *cluster)
3173 {
3174         int ret;
3175
3176         if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) {
3177                 ret = relocate_file_extent_cluster(inode, cluster);
3178                 if (ret)
3179                         return ret;
3180                 cluster->nr = 0;
3181         }
3182
3183         if (!cluster->nr)
3184                 cluster->start = extent_key->objectid;
3185         else
3186                 BUG_ON(cluster->nr >= MAX_EXTENTS);
3187         cluster->end = extent_key->objectid + extent_key->offset - 1;
3188         cluster->boundary[cluster->nr] = extent_key->objectid;
3189         cluster->nr++;
3190
3191         if (cluster->nr >= MAX_EXTENTS) {
3192                 ret = relocate_file_extent_cluster(inode, cluster);
3193                 if (ret)
3194                         return ret;
3195                 cluster->nr = 0;
3196         }
3197         return 0;
3198 }
3199
3200 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
3201 static int get_ref_objectid_v0(struct reloc_control *rc,
3202                                struct btrfs_path *path,
3203                                struct btrfs_key *extent_key,
3204                                u64 *ref_objectid, int *path_change)
3205 {
3206         struct btrfs_key key;
3207         struct extent_buffer *leaf;
3208         struct btrfs_extent_ref_v0 *ref0;
3209         int ret;
3210         int slot;
3211
3212         leaf = path->nodes[0];
3213         slot = path->slots[0];
3214         while (1) {
3215                 if (slot >= btrfs_header_nritems(leaf)) {
3216                         ret = btrfs_next_leaf(rc->extent_root, path);
3217                         if (ret < 0)
3218                                 return ret;
3219                         BUG_ON(ret > 0);
3220                         leaf = path->nodes[0];
3221                         slot = path->slots[0];
3222                         if (path_change)
3223                                 *path_change = 1;
3224                 }
3225                 btrfs_item_key_to_cpu(leaf, &key, slot);
3226                 if (key.objectid != extent_key->objectid)
3227                         return -ENOENT;
3228
3229                 if (key.type != BTRFS_EXTENT_REF_V0_KEY) {
3230                         slot++;
3231                         continue;
3232                 }
3233                 ref0 = btrfs_item_ptr(leaf, slot,
3234                                 struct btrfs_extent_ref_v0);
3235                 *ref_objectid = btrfs_ref_objectid_v0(leaf, ref0);
3236                 break;
3237         }
3238         return 0;
3239 }
3240 #endif
3241
3242 /*
3243  * helper to add a tree block to the list.
3244  * the major work is getting the generation and level of the block
3245  */
3246 static int add_tree_block(struct reloc_control *rc,
3247                           struct btrfs_key *extent_key,
3248                           struct btrfs_path *path,
3249                           struct rb_root *blocks)
3250 {
3251         struct extent_buffer *eb;
3252         struct btrfs_extent_item *ei;
3253         struct btrfs_tree_block_info *bi;
3254         struct tree_block *block;
3255         struct rb_node *rb_node;
3256         u32 item_size;
3257         int level = -1;
3258         u64 generation;
3259
3260         eb =  path->nodes[0];
3261         item_size = btrfs_item_size_nr(eb, path->slots[0]);
3262
3263         if (extent_key->type == BTRFS_METADATA_ITEM_KEY ||
3264             item_size >= sizeof(*ei) + sizeof(*bi)) {
3265                 ei = btrfs_item_ptr(eb, path->slots[0],
3266                                 struct btrfs_extent_item);
3267                 if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) {
3268                         bi = (struct btrfs_tree_block_info *)(ei + 1);
3269                         level = btrfs_tree_block_level(eb, bi);
3270                 } else {
3271                         level = (int)extent_key->offset;
3272                 }
3273                 generation = btrfs_extent_generation(eb, ei);
3274         } else {
3275 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
3276                 u64 ref_owner;
3277                 int ret;
3278
3279                 BUG_ON(item_size != sizeof(struct btrfs_extent_item_v0));
3280                 ret = get_ref_objectid_v0(rc, path, extent_key,
3281                                           &ref_owner, NULL);
3282                 if (ret < 0)
3283                         return ret;
3284                 BUG_ON(ref_owner >= BTRFS_MAX_LEVEL);
3285                 level = (int)ref_owner;
3286                 /* FIXME: get real generation */
3287                 generation = 0;
3288 #else
3289                 BUG();
3290 #endif
3291         }
3292
3293         btrfs_release_path(path);
3294
3295         BUG_ON(level == -1);
3296
3297         block = kmalloc(sizeof(*block), GFP_NOFS);
3298         if (!block)
3299                 return -ENOMEM;
3300
3301         block->bytenr = extent_key->objectid;
3302         block->key.objectid = rc->extent_root->nodesize;
3303         block->key.offset = generation;
3304         block->level = level;
3305         block->key_ready = 0;
3306
3307         rb_node = tree_insert(blocks, block->bytenr, &block->rb_node);
3308         if (rb_node)
3309                 backref_tree_panic(rb_node, -EEXIST, block->bytenr);
3310
3311         return 0;
3312 }
3313
3314 /*
3315  * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY
3316  */
3317 static int __add_tree_block(struct reloc_control *rc,
3318                             u64 bytenr, u32 blocksize,
3319                             struct rb_root *blocks)
3320 {
3321         struct btrfs_path *path;
3322         struct btrfs_key key;
3323         int ret;
3324         bool skinny = btrfs_fs_incompat(rc->extent_root->fs_info,
3325                                         SKINNY_METADATA);
3326
3327         if (tree_block_processed(bytenr, blocksize, rc))
3328                 return 0;
3329
3330         if (tree_search(blocks, bytenr))
3331                 return 0;
3332
3333         path = btrfs_alloc_path();
3334         if (!path)
3335                 return -ENOMEM;
3336 again:
3337         key.objectid = bytenr;
3338         if (skinny) {
3339                 key.type = BTRFS_METADATA_ITEM_KEY;
3340                 key.offset = (u64)-1;
3341         } else {
3342                 key.type = BTRFS_EXTENT_ITEM_KEY;
3343                 key.offset = blocksize;
3344         }
3345
3346         path->search_commit_root = 1;
3347         path->skip_locking = 1;
3348         ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0);
3349         if (ret < 0)
3350                 goto out;
3351
3352         if (ret > 0 && skinny) {
3353                 if (path->slots[0]) {
3354                         path->slots[0]--;
3355                         btrfs_item_key_to_cpu(path->nodes[0], &key,
3356                                               path->slots[0]);
3357                         if (key.objectid == bytenr &&
3358                             (key.type == BTRFS_METADATA_ITEM_KEY ||
3359                              (key.type == BTRFS_EXTENT_ITEM_KEY &&
3360                               key.offset == blocksize)))
3361                                 ret = 0;
3362                 }
3363
3364                 if (ret) {
3365                         skinny = false;
3366                         btrfs_release_path(path);
3367                         goto again;
3368                 }
3369         }
3370         BUG_ON(ret);
3371
3372         ret = add_tree_block(rc, &key, path, blocks);
3373 out:
3374         btrfs_free_path(path);
3375         return ret;
3376 }
3377
3378 /*
3379  * helper to check if the block use full backrefs for pointers in it
3380  */
3381 static int block_use_full_backref(struct reloc_control *rc,
3382                                   struct extent_buffer *eb)
3383 {
3384         u64 flags;
3385         int ret;
3386
3387         if (btrfs_header_flag(eb, BTRFS_HEADER_FLAG_RELOC) ||
3388             btrfs_header_backref_rev(eb) < BTRFS_MIXED_BACKREF_REV)
3389                 return 1;
3390
3391         ret = btrfs_lookup_extent_info(NULL, rc->extent_root,
3392                                        eb->start, btrfs_header_level(eb), 1,
3393                                        NULL, &flags);
3394         BUG_ON(ret);
3395
3396         if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)
3397                 ret = 1;
3398         else
3399                 ret = 0;
3400         return ret;
3401 }
3402
3403 static int delete_block_group_cache(struct btrfs_fs_info *fs_info,
3404                                     struct inode *inode, u64 ino)
3405 {
3406         struct btrfs_key key;
3407         struct btrfs_root *root = fs_info->tree_root;
3408         struct btrfs_trans_handle *trans;
3409         int ret = 0;
3410
3411         if (inode)
3412                 goto truncate;
3413
3414         key.objectid = ino;
3415         key.type = BTRFS_INODE_ITEM_KEY;
3416         key.offset = 0;
3417
3418         inode = btrfs_iget(fs_info->sb, &key, root, NULL);
3419         if (IS_ERR(inode) || is_bad_inode(inode)) {
3420                 if (!IS_ERR(inode))
3421                         iput(inode);
3422                 return -ENOENT;
3423         }
3424
3425 truncate:
3426         ret = btrfs_check_trunc_cache_free_space(root,
3427                                                  &fs_info->global_block_rsv);
3428         if (ret)
3429                 goto out;
3430
3431         trans = btrfs_join_transaction(root);
3432         if (IS_ERR(trans)) {
3433                 ret = PTR_ERR(trans);
3434                 goto out;
3435         }
3436
3437         ret = btrfs_truncate_free_space_cache(root, trans, inode);
3438
3439         btrfs_end_transaction(trans, root);
3440         btrfs_btree_balance_dirty(root);
3441 out:
3442         iput(inode);
3443         return ret;
3444 }
3445
3446 /*
3447  * helper to add tree blocks for backref of type BTRFS_EXTENT_DATA_REF_KEY
3448  * this function scans fs tree to find blocks reference the data extent
3449  */
3450 static int find_data_references(struct reloc_control *rc,
3451                                 struct btrfs_key *extent_key,
3452                                 struct extent_buffer *leaf,
3453                                 struct btrfs_extent_data_ref *ref,
3454                                 struct rb_root *blocks)
3455 {
3456         struct btrfs_path *path;
3457         struct tree_block *block;
3458         struct btrfs_root *root;
3459         struct btrfs_file_extent_item *fi;
3460         struct rb_node *rb_node;
3461         struct btrfs_key key;
3462         u64 ref_root;
3463         u64 ref_objectid;
3464         u64 ref_offset;
3465         u32 ref_count;
3466         u32 nritems;
3467         int err = 0;
3468         int added = 0;
3469         int counted;
3470         int ret;
3471
3472         ref_root = btrfs_extent_data_ref_root(leaf, ref);
3473         ref_objectid = btrfs_extent_data_ref_objectid(leaf, ref);
3474         ref_offset = btrfs_extent_data_ref_offset(leaf, ref);
3475         ref_count = btrfs_extent_data_ref_count(leaf, ref);
3476
3477         /*
3478          * This is an extent belonging to the free space cache, lets just delete
3479          * it and redo the search.
3480          */
3481         if (ref_root == BTRFS_ROOT_TREE_OBJECTID) {
3482                 ret = delete_block_group_cache(rc->extent_root->fs_info,
3483                                                NULL, ref_objectid);
3484                 if (ret != -ENOENT)
3485                         return ret;
3486                 ret = 0;
3487         }
3488
3489         path = btrfs_alloc_path();
3490         if (!path)
3491                 return -ENOMEM;
3492         path->reada = 1;
3493
3494         root = read_fs_root(rc->extent_root->fs_info, ref_root);
3495         if (IS_ERR(root)) {
3496                 err = PTR_ERR(root);
3497                 goto out;
3498         }
3499
3500         key.objectid = ref_objectid;
3501         key.type = BTRFS_EXTENT_DATA_KEY;
3502         if (ref_offset > ((u64)-1 << 32))
3503                 key.offset = 0;
3504         else
3505                 key.offset = ref_offset;
3506
3507         path->search_commit_root = 1;
3508         path->skip_locking = 1;
3509         ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
3510         if (ret < 0) {
3511                 err = ret;
3512                 goto out;
3513         }
3514
3515         leaf = path->nodes[0];
3516         nritems = btrfs_header_nritems(leaf);
3517         /*
3518          * the references in tree blocks that use full backrefs
3519          * are not counted in
3520          */
3521         if (block_use_full_backref(rc, leaf))
3522                 counted = 0;
3523         else
3524                 counted = 1;
3525         rb_node = tree_search(blocks, leaf->start);
3526         if (rb_node) {
3527                 if (counted)
3528                         added = 1;
3529                 else
3530                         path->slots[0] = nritems;
3531         }
3532
3533         while (ref_count > 0) {
3534                 while (path->slots[0] >= nritems) {
3535                         ret = btrfs_next_leaf(root, path);
3536                         if (ret < 0) {
3537                                 err = ret;
3538                                 goto out;
3539                         }
3540                         if (WARN_ON(ret > 0))
3541                                 goto out;
3542
3543                         leaf = path->nodes[0];
3544                         nritems = btrfs_header_nritems(leaf);
3545                         added = 0;
3546
3547                         if (block_use_full_backref(rc, leaf))
3548                                 counted = 0;
3549                         else
3550                                 counted = 1;
3551                         rb_node = tree_search(blocks, leaf->start);
3552                         if (rb_node) {
3553                                 if (counted)
3554                                         added = 1;
3555                                 else
3556                                         path->slots[0] = nritems;
3557                         }
3558                 }
3559
3560                 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
3561                 if (WARN_ON(key.objectid != ref_objectid ||
3562                     key.type != BTRFS_EXTENT_DATA_KEY))
3563                         break;
3564
3565                 fi = btrfs_item_ptr(leaf, path->slots[0],
3566                                     struct btrfs_file_extent_item);
3567
3568                 if (btrfs_file_extent_type(leaf, fi) ==
3569                     BTRFS_FILE_EXTENT_INLINE)
3570                         goto next;
3571
3572                 if (btrfs_file_extent_disk_bytenr(leaf, fi) !=
3573                     extent_key->objectid)
3574                         goto next;
3575
3576                 key.offset -= btrfs_file_extent_offset(leaf, fi);
3577                 if (key.offset != ref_offset)
3578                         goto next;
3579
3580                 if (counted)
3581                         ref_count--;
3582                 if (added)
3583                         goto next;
3584
3585                 if (!tree_block_processed(leaf->start, leaf->len, rc)) {
3586                         block = kmalloc(sizeof(*block), GFP_NOFS);
3587                         if (!block) {
3588                                 err = -ENOMEM;
3589                                 break;
3590                         }
3591                         block->bytenr = leaf->start;
3592                         btrfs_item_key_to_cpu(leaf, &block->key, 0);
3593                         block->level = 0;
3594                         block->key_ready = 1;
3595                         rb_node = tree_insert(blocks, block->bytenr,
3596                                               &block->rb_node);
3597                         if (rb_node)
3598                                 backref_tree_panic(rb_node, -EEXIST,
3599                                                    block->bytenr);
3600                 }
3601                 if (counted)
3602                         added = 1;
3603                 else
3604                         path->slots[0] = nritems;
3605 next:
3606                 path->slots[0]++;
3607
3608         }
3609 out:
3610         btrfs_free_path(path);
3611         return err;
3612 }
3613
3614 /*
3615  * helper to find all tree blocks that reference a given data extent
3616  */
3617 static noinline_for_stack
3618 int add_data_references(struct reloc_control *rc,
3619                         struct btrfs_key *extent_key,
3620                         struct btrfs_path *path,
3621                         struct rb_root *blocks)
3622 {
3623         struct btrfs_key key;
3624         struct extent_buffer *eb;
3625         struct btrfs_extent_data_ref *dref;
3626         struct btrfs_extent_inline_ref *iref;
3627         unsigned long ptr;
3628         unsigned long end;
3629         u32 blocksize = rc->extent_root->nodesize;
3630         int ret = 0;
3631         int err = 0;
3632
3633         eb = path->nodes[0];
3634         ptr = btrfs_item_ptr_offset(eb, path->slots[0]);
3635         end = ptr + btrfs_item_size_nr(eb, path->slots[0]);
3636 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
3637         if (ptr + sizeof(struct btrfs_extent_item_v0) == end)
3638                 ptr = end;
3639         else
3640 #endif
3641                 ptr += sizeof(struct btrfs_extent_item);
3642
3643         while (ptr < end) {
3644                 iref = (struct btrfs_extent_inline_ref *)ptr;
3645                 key.type = btrfs_extent_inline_ref_type(eb, iref);
3646                 if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
3647                         key.offset = btrfs_extent_inline_ref_offset(eb, iref);
3648                         ret = __add_tree_block(rc, key.offset, blocksize,
3649                                                blocks);
3650                 } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
3651                         dref = (struct btrfs_extent_data_ref *)(&iref->offset);
3652                         ret = find_data_references(rc, extent_key,
3653                                                    eb, dref, blocks);
3654                 } else {
3655                         BUG();
3656                 }
3657                 if (ret) {
3658                         err = ret;
3659                         goto out;
3660                 }
3661                 ptr += btrfs_extent_inline_ref_size(key.type);
3662         }
3663         WARN_ON(ptr > end);
3664
3665         while (1) {
3666                 cond_resched();
3667                 eb = path->nodes[0];
3668                 if (path->slots[0] >= btrfs_header_nritems(eb)) {
3669                         ret = btrfs_next_leaf(rc->extent_root, path);
3670                         if (ret < 0) {
3671                                 err = ret;
3672                                 break;
3673                         }
3674                         if (ret > 0)
3675                                 break;
3676                         eb = path->nodes[0];
3677                 }
3678
3679                 btrfs_item_key_to_cpu(eb, &key, path->slots[0]);
3680                 if (key.objectid != extent_key->objectid)
3681                         break;
3682
3683 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
3684                 if (key.type == BTRFS_SHARED_DATA_REF_KEY ||
3685                     key.type == BTRFS_EXTENT_REF_V0_KEY) {
3686 #else
3687                 BUG_ON(key.type == BTRFS_EXTENT_REF_V0_KEY);
3688                 if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
3689 #endif
3690                         ret = __add_tree_block(rc, key.offset, blocksize,
3691                                                blocks);
3692                 } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
3693                         dref = btrfs_item_ptr(eb, path->slots[0],
3694                                               struct btrfs_extent_data_ref);
3695                         ret = find_data_references(rc, extent_key,
3696                                                    eb, dref, blocks);
3697                 } else {
3698                         ret = 0;
3699                 }
3700                 if (ret) {
3701                         err = ret;
3702                         break;
3703                 }
3704                 path->slots[0]++;
3705         }
3706 out:
3707         btrfs_release_path(path);
3708         if (err)
3709                 free_block_list(blocks);
3710         return err;
3711 }
3712
3713 /*
3714  * helper to find next unprocessed extent
3715  */
3716 static noinline_for_stack
3717 int find_next_extent(struct btrfs_trans_handle *trans,
3718                      struct reloc_control *rc, struct btrfs_path *path,
3719                      struct btrfs_key *extent_key)
3720 {
3721         struct btrfs_key key;
3722         struct extent_buffer *leaf;
3723         u64 start, end, last;
3724         int ret;
3725
3726         last = rc->block_group->key.objectid + rc->block_group->key.offset;
3727         while (1) {
3728                 cond_resched();
3729                 if (rc->search_start >= last) {
3730                         ret = 1;
3731                         break;
3732                 }
3733
3734                 key.objectid = rc->search_start;
3735                 key.type = BTRFS_EXTENT_ITEM_KEY;
3736                 key.offset = 0;
3737
3738                 path->search_commit_root = 1;
3739                 path->skip_locking = 1;
3740                 ret = btrfs_search_slot(NULL, rc->extent_root, &key, path,
3741                                         0, 0);
3742                 if (ret < 0)
3743                         break;
3744 next:
3745                 leaf = path->nodes[0];
3746                 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
3747                         ret = btrfs_next_leaf(rc->extent_root, path);
3748                         if (ret != 0)
3749                                 break;
3750                         leaf = path->nodes[0];
3751                 }
3752
3753                 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
3754                 if (key.objectid >= last) {
3755                         ret = 1;
3756                         break;
3757                 }
3758
3759                 if (key.type != BTRFS_EXTENT_ITEM_KEY &&
3760                     key.type != BTRFS_METADATA_ITEM_KEY) {
3761                         path->slots[0]++;
3762                         goto next;
3763                 }
3764
3765                 if (key.type == BTRFS_EXTENT_ITEM_KEY &&
3766                     key.objectid + key.offset <= rc->search_start) {
3767                         path->slots[0]++;
3768                         goto next;
3769                 }
3770
3771                 if (key.type == BTRFS_METADATA_ITEM_KEY &&
3772                     key.objectid + rc->extent_root->nodesize <=
3773                     rc->search_start) {
3774                         path->slots[0]++;
3775                         goto next;
3776                 }
3777
3778                 ret = find_first_extent_bit(&rc->processed_blocks,
3779                                             key.objectid, &start, &end,
3780                                             EXTENT_DIRTY, NULL);
3781
3782                 if (ret == 0 && start <= key.objectid) {
3783                         btrfs_release_path(path);
3784                         rc->search_start = end + 1;
3785                 } else {
3786                         if (key.type == BTRFS_EXTENT_ITEM_KEY)
3787                                 rc->search_start = key.objectid + key.offset;
3788                         else
3789                                 rc->search_start = key.objectid +
3790                                         rc->extent_root->nodesize;
3791                         memcpy(extent_key, &key, sizeof(key));
3792                         return 0;
3793                 }
3794         }
3795         btrfs_release_path(path);
3796         return ret;
3797 }
3798
3799 static void set_reloc_control(struct reloc_control *rc)
3800 {
3801         struct btrfs_fs_info *fs_info = rc->extent_root->fs_info;
3802
3803         mutex_lock(&fs_info->reloc_mutex);
3804         fs_info->reloc_ctl = rc;
3805         mutex_unlock(&fs_info->reloc_mutex);
3806 }
3807
3808 static void unset_reloc_control(struct reloc_control *rc)
3809 {
3810         struct btrfs_fs_info *fs_info = rc->extent_root->fs_info;
3811
3812         mutex_lock(&fs_info->reloc_mutex);
3813         fs_info->reloc_ctl = NULL;
3814         mutex_unlock(&fs_info->reloc_mutex);
3815 }
3816
3817 static int check_extent_flags(u64 flags)
3818 {
3819         if ((flags & BTRFS_EXTENT_FLAG_DATA) &&
3820             (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK))
3821                 return 1;
3822         if (!(flags & BTRFS_EXTENT_FLAG_DATA) &&
3823             !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK))
3824                 return 1;
3825         if ((flags & BTRFS_EXTENT_FLAG_DATA) &&
3826             (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF))
3827                 return 1;
3828         return 0;
3829 }
3830
3831 static noinline_for_stack
3832 int prepare_to_relocate(struct reloc_control *rc)
3833 {
3834         struct btrfs_trans_handle *trans;
3835
3836         rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root,
3837                                               BTRFS_BLOCK_RSV_TEMP);
3838         if (!rc->block_rsv)
3839                 return -ENOMEM;
3840
3841         memset(&rc->cluster, 0, sizeof(rc->cluster));
3842         rc->search_start = rc->block_group->key.objectid;
3843         rc->extents_found = 0;
3844         rc->nodes_relocated = 0;
3845         rc->merging_rsv_size = 0;
3846         rc->reserved_bytes = 0;
3847         rc->block_rsv->size = rc->extent_root->nodesize *
3848                               RELOCATION_RESERVED_NODES;
3849
3850         rc->create_reloc_tree = 1;
3851         set_reloc_control(rc);
3852
3853         trans = btrfs_join_transaction(rc->extent_root);
3854         if (IS_ERR(trans)) {
3855                 unset_reloc_control(rc);
3856                 /*
3857                  * extent tree is not a ref_cow tree and has no reloc_root to
3858                  * cleanup.  And callers are responsible to free the above
3859                  * block rsv.
3860                  */
3861                 return PTR_ERR(trans);
3862         }
3863         btrfs_commit_transaction(trans, rc->extent_root);
3864         return 0;
3865 }
3866
3867 static noinline_for_stack int relocate_block_group(struct reloc_control *rc)
3868 {
3869         struct rb_root blocks = RB_ROOT;
3870         struct btrfs_key key;
3871         struct btrfs_trans_handle *trans = NULL;
3872         struct btrfs_path *path;
3873         struct btrfs_extent_item *ei;
3874         u64 flags;
3875         u32 item_size;
3876         int ret;
3877         int err = 0;
3878         int progress = 0;
3879
3880         path = btrfs_alloc_path();
3881         if (!path)
3882                 return -ENOMEM;
3883         path->reada = 1;
3884
3885         ret = prepare_to_relocate(rc);
3886         if (ret) {
3887                 err = ret;
3888                 goto out_free;
3889         }
3890
3891         while (1) {
3892                 rc->reserved_bytes = 0;
3893                 ret = btrfs_block_rsv_refill(rc->extent_root,
3894                                         rc->block_rsv, rc->block_rsv->size,
3895                                         BTRFS_RESERVE_FLUSH_ALL);
3896                 if (ret) {
3897                         err = ret;
3898                         break;
3899                 }
3900                 progress++;
3901                 trans = btrfs_start_transaction(rc->extent_root, 0);
3902                 if (IS_ERR(trans)) {
3903                         err = PTR_ERR(trans);
3904                         trans = NULL;
3905                         break;
3906                 }
3907 restart:
3908                 if (update_backref_cache(trans, &rc->backref_cache)) {
3909                         btrfs_end_transaction(trans, rc->extent_root);
3910                         continue;
3911                 }
3912
3913                 ret = find_next_extent(trans, rc, path, &key);
3914                 if (ret < 0)
3915                         err = ret;
3916                 if (ret != 0)
3917                         break;
3918
3919                 rc->extents_found++;
3920
3921                 ei = btrfs_item_ptr(path->nodes[0], path->slots[0],
3922                                     struct btrfs_extent_item);
3923                 item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]);
3924                 if (item_size >= sizeof(*ei)) {
3925                         flags = btrfs_extent_flags(path->nodes[0], ei);
3926                         ret = check_extent_flags(flags);
3927                         BUG_ON(ret);
3928
3929                 } else {
3930 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
3931                         u64 ref_owner;
3932                         int path_change = 0;
3933
3934                         BUG_ON(item_size !=
3935                                sizeof(struct btrfs_extent_item_v0));
3936                         ret = get_ref_objectid_v0(rc, path, &key, &ref_owner,
3937                                                   &path_change);
3938                         if (ref_owner < BTRFS_FIRST_FREE_OBJECTID)
3939                                 flags = BTRFS_EXTENT_FLAG_TREE_BLOCK;
3940                         else
3941                                 flags = BTRFS_EXTENT_FLAG_DATA;
3942
3943                         if (path_change) {
3944                                 btrfs_release_path(path);
3945
3946                                 path->search_commit_root = 1;
3947                                 path->skip_locking = 1;
3948                                 ret = btrfs_search_slot(NULL, rc->extent_root,
3949                                                         &key, path, 0, 0);
3950                                 if (ret < 0) {
3951                                         err = ret;
3952                                         break;
3953                                 }
3954                                 BUG_ON(ret > 0);
3955                         }
3956 #else
3957                         BUG();
3958 #endif
3959                 }
3960
3961                 if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
3962                         ret = add_tree_block(rc, &key, path, &blocks);
3963                 } else if (rc->stage == UPDATE_DATA_PTRS &&
3964                            (flags & BTRFS_EXTENT_FLAG_DATA)) {
3965                         ret = add_data_references(rc, &key, path, &blocks);
3966                 } else {
3967                         btrfs_release_path(path);
3968                         ret = 0;
3969                 }
3970                 if (ret < 0) {
3971                         err = ret;
3972                         break;
3973                 }
3974
3975                 if (!RB_EMPTY_ROOT(&blocks)) {
3976                         ret = relocate_tree_blocks(trans, rc, &blocks);
3977                         if (ret < 0) {
3978                                 /*
3979                                  * if we fail to relocate tree blocks, force to update
3980                                  * backref cache when committing transaction.
3981                                  */
3982                                 rc->backref_cache.last_trans = trans->transid - 1;
3983
3984                                 if (ret != -EAGAIN) {
3985                                         err = ret;
3986                                         break;
3987                                 }
3988                                 rc->extents_found--;
3989                                 rc->search_start = key.objectid;
3990                         }
3991                 }
3992
3993                 btrfs_end_transaction_throttle(trans, rc->extent_root);
3994                 btrfs_btree_balance_dirty(rc->extent_root);
3995                 trans = NULL;
3996
3997                 if (rc->stage == MOVE_DATA_EXTENTS &&
3998                     (flags & BTRFS_EXTENT_FLAG_DATA)) {
3999                         rc->found_file_extent = 1;
4000                         ret = relocate_data_extent(rc->data_inode,
4001                                                    &key, &rc->cluster);
4002                         if (ret < 0) {
4003                                 err = ret;
4004                                 break;
4005                         }
4006                 }
4007         }
4008         if (trans && progress && err == -ENOSPC) {
4009                 ret = btrfs_force_chunk_alloc(trans, rc->extent_root,
4010                                               rc->block_group->flags);
4011                 if (ret == 0) {
4012                         err = 0;
4013                         progress = 0;
4014                         goto restart;
4015                 }
4016         }
4017
4018         btrfs_release_path(path);
4019         clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY,
4020                           GFP_NOFS);
4021
4022         if (trans) {
4023                 btrfs_end_transaction_throttle(trans, rc->extent_root);
4024                 btrfs_btree_balance_dirty(rc->extent_root);
4025         }
4026
4027         if (!err) {
4028                 ret = relocate_file_extent_cluster(rc->data_inode,
4029                                                    &rc->cluster);
4030                 if (ret < 0)
4031                         err = ret;
4032         }
4033
4034         rc->create_reloc_tree = 0;
4035         set_reloc_control(rc);
4036
4037         backref_cache_cleanup(&rc->backref_cache);
4038         btrfs_block_rsv_release(rc->extent_root, rc->block_rsv, (u64)-1);
4039
4040         err = prepare_to_merge(rc, err);
4041
4042         merge_reloc_roots(rc);
4043
4044         rc->merge_reloc_tree = 0;
4045         unset_reloc_control(rc);
4046         btrfs_block_rsv_release(rc->extent_root, rc->block_rsv, (u64)-1);
4047
4048         /* get rid of pinned extents */
4049         trans = btrfs_join_transaction(rc->extent_root);
4050         if (IS_ERR(trans))
4051                 err = PTR_ERR(trans);
4052         else
4053                 btrfs_commit_transaction(trans, rc->extent_root);
4054 out_free:
4055         btrfs_free_block_rsv(rc->extent_root, rc->block_rsv);
4056         btrfs_free_path(path);
4057         return err;
4058 }
4059
4060 static int __insert_orphan_inode(struct btrfs_trans_handle *trans,
4061                                  struct btrfs_root *root, u64 objectid)
4062 {
4063         struct btrfs_path *path;
4064         struct btrfs_inode_item *item;
4065         struct extent_buffer *leaf;
4066         int ret;
4067
4068         path = btrfs_alloc_path();
4069         if (!path)
4070                 return -ENOMEM;
4071
4072         ret = btrfs_insert_empty_inode(trans, root, path, objectid);
4073         if (ret)
4074                 goto out;
4075
4076         leaf = path->nodes[0];
4077         item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item);
4078         memset_extent_buffer(leaf, 0, (unsigned long)item, sizeof(*item));
4079         btrfs_set_inode_generation(leaf, item, 1);
4080         btrfs_set_inode_size(leaf, item, 0);
4081         btrfs_set_inode_mode(leaf, item, S_IFREG | 0600);
4082         btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS |
4083                                           BTRFS_INODE_PREALLOC);
4084         btrfs_mark_buffer_dirty(leaf);
4085 out:
4086         btrfs_free_path(path);
4087         return ret;
4088 }
4089
4090 /*
4091  * helper to create inode for data relocation.
4092  * the inode is in data relocation tree and its link count is 0
4093  */
4094 static noinline_for_stack
4095 struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info,
4096                                  struct btrfs_block_group_cache *group)
4097 {
4098         struct inode *inode = NULL;
4099         struct btrfs_trans_handle *trans;
4100         struct btrfs_root *root;
4101         struct btrfs_key key;
4102         u64 objectid = BTRFS_FIRST_FREE_OBJECTID;
4103         int err = 0;
4104
4105         root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID);
4106         if (IS_ERR(root))
4107                 return ERR_CAST(root);
4108
4109         trans = btrfs_start_transaction(root, 6);
4110         if (IS_ERR(trans))
4111                 return ERR_CAST(trans);
4112
4113         err = btrfs_find_free_objectid(root, &objectid);
4114         if (err)
4115                 goto out;
4116
4117         err = __insert_orphan_inode(trans, root, objectid);
4118         BUG_ON(err);
4119
4120         key.objectid = objectid;
4121         key.type = BTRFS_INODE_ITEM_KEY;
4122         key.offset = 0;
4123         inode = btrfs_iget(root->fs_info->sb, &key, root, NULL);
4124         BUG_ON(IS_ERR(inode) || is_bad_inode(inode));
4125         BTRFS_I(inode)->index_cnt = group->key.objectid;
4126
4127         err = btrfs_orphan_add(trans, inode);
4128 out:
4129         btrfs_end_transaction(trans, root);
4130         btrfs_btree_balance_dirty(root);
4131         if (err) {
4132                 if (inode)
4133                         iput(inode);
4134                 inode = ERR_PTR(err);
4135         }
4136         return inode;
4137 }
4138
4139 static struct reloc_control *alloc_reloc_control(struct btrfs_fs_info *fs_info)
4140 {
4141         struct reloc_control *rc;
4142
4143         rc = kzalloc(sizeof(*rc), GFP_NOFS);
4144         if (!rc)
4145                 return NULL;
4146
4147         INIT_LIST_HEAD(&rc->reloc_roots);
4148         backref_cache_init(&rc->backref_cache);
4149         mapping_tree_init(&rc->reloc_root_tree);
4150         extent_io_tree_init(&rc->processed_blocks,
4151                             fs_info->btree_inode->i_mapping);
4152         return rc;
4153 }
4154
4155 /*
4156  * function to relocate all extents in a block group.
4157  */
4158 int btrfs_relocate_block_group(struct btrfs_root *extent_root, u64 group_start)
4159 {
4160         struct btrfs_fs_info *fs_info = extent_root->fs_info;
4161         struct reloc_control *rc;
4162         struct inode *inode;
4163         struct btrfs_path *path;
4164         int ret;
4165         int rw = 0;
4166         int err = 0;
4167
4168         rc = alloc_reloc_control(fs_info);
4169         if (!rc)
4170                 return -ENOMEM;
4171
4172         rc->extent_root = extent_root;
4173
4174         rc->block_group = btrfs_lookup_block_group(fs_info, group_start);
4175         BUG_ON(!rc->block_group);
4176
4177         if (!rc->block_group->ro) {
4178                 ret = btrfs_set_block_group_ro(extent_root, rc->block_group);
4179                 if (ret) {
4180                         err = ret;
4181                         goto out;
4182                 }
4183                 rw = 1;
4184         }
4185
4186         path = btrfs_alloc_path();
4187         if (!path) {
4188                 err = -ENOMEM;
4189                 goto out;
4190         }
4191
4192         inode = lookup_free_space_inode(fs_info->tree_root, rc->block_group,
4193                                         path);
4194         btrfs_free_path(path);
4195
4196         if (!IS_ERR(inode))
4197                 ret = delete_block_group_cache(fs_info, inode, 0);
4198         else
4199                 ret = PTR_ERR(inode);
4200
4201         if (ret && ret != -ENOENT) {
4202                 err = ret;
4203                 goto out;
4204         }
4205
4206         rc->data_inode = create_reloc_inode(fs_info, rc->block_group);
4207         if (IS_ERR(rc->data_inode)) {
4208                 err = PTR_ERR(rc->data_inode);
4209                 rc->data_inode = NULL;
4210                 goto out;
4211         }
4212
4213         btrfs_info(extent_root->fs_info, "relocating block group %llu flags %llu",
4214                rc->block_group->key.objectid, rc->block_group->flags);
4215
4216         ret = btrfs_start_delalloc_roots(fs_info, 0, -1);
4217         if (ret < 0) {
4218                 err = ret;
4219                 goto out;
4220         }
4221         btrfs_wait_ordered_roots(fs_info, -1);
4222
4223         while (1) {
4224                 mutex_lock(&fs_info->cleaner_mutex);
4225                 ret = relocate_block_group(rc);
4226                 mutex_unlock(&fs_info->cleaner_mutex);
4227                 if (ret < 0) {
4228                         err = ret;
4229                         goto out;
4230                 }
4231
4232                 if (rc->extents_found == 0)
4233                         break;
4234
4235                 btrfs_info(extent_root->fs_info, "found %llu extents",
4236                         rc->extents_found);
4237
4238                 if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) {
4239                         ret = btrfs_wait_ordered_range(rc->data_inode, 0,
4240                                                        (u64)-1);
4241                         if (ret) {
4242                                 err = ret;
4243                                 goto out;
4244                         }
4245                         invalidate_mapping_pages(rc->data_inode->i_mapping,
4246                                                  0, -1);
4247                         rc->stage = UPDATE_DATA_PTRS;
4248                 }
4249         }
4250
4251         WARN_ON(rc->block_group->pinned > 0);
4252         WARN_ON(rc->block_group->reserved > 0);
4253         WARN_ON(btrfs_block_group_used(&rc->block_group->item) > 0);
4254 out:
4255         if (err && rw)
4256                 btrfs_set_block_group_rw(extent_root, rc->block_group);
4257         iput(rc->data_inode);
4258         btrfs_put_block_group(rc->block_group);
4259         kfree(rc);
4260         return err;
4261 }
4262
4263 static noinline_for_stack int mark_garbage_root(struct btrfs_root *root)
4264 {
4265         struct btrfs_trans_handle *trans;
4266         int ret, err;
4267
4268         trans = btrfs_start_transaction(root->fs_info->tree_root, 0);
4269         if (IS_ERR(trans))
4270                 return PTR_ERR(trans);
4271
4272         memset(&root->root_item.drop_progress, 0,
4273                 sizeof(root->root_item.drop_progress));
4274         root->root_item.drop_level = 0;
4275         btrfs_set_root_refs(&root->root_item, 0);
4276         ret = btrfs_update_root(trans, root->fs_info->tree_root,
4277                                 &root->root_key, &root->root_item);
4278
4279         err = btrfs_end_transaction(trans, root->fs_info->tree_root);
4280         if (err)
4281                 return err;
4282         return ret;
4283 }
4284
4285 /*
4286  * recover relocation interrupted by system crash.
4287  *
4288  * this function resumes merging reloc trees with corresponding fs trees.
4289  * this is important for keeping the sharing of tree blocks
4290  */
4291 int btrfs_recover_relocation(struct btrfs_root *root)
4292 {
4293         LIST_HEAD(reloc_roots);
4294         struct btrfs_key key;
4295         struct btrfs_root *fs_root;
4296         struct btrfs_root *reloc_root;
4297         struct btrfs_path *path;
4298         struct extent_buffer *leaf;
4299         struct reloc_control *rc = NULL;
4300         struct btrfs_trans_handle *trans;
4301         int ret;
4302         int err = 0;
4303
4304         path = btrfs_alloc_path();
4305         if (!path)
4306                 return -ENOMEM;
4307         path->reada = -1;
4308
4309         key.objectid = BTRFS_TREE_RELOC_OBJECTID;
4310         key.type = BTRFS_ROOT_ITEM_KEY;
4311         key.offset = (u64)-1;
4312
4313         while (1) {
4314                 ret = btrfs_search_slot(NULL, root->fs_info->tree_root, &key,
4315                                         path, 0, 0);
4316                 if (ret < 0) {
4317                         err = ret;
4318                         goto out;
4319                 }
4320                 if (ret > 0) {
4321                         if (path->slots[0] == 0)
4322                                 break;
4323                         path->slots[0]--;
4324                 }
4325                 leaf = path->nodes[0];
4326                 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
4327                 btrfs_release_path(path);
4328
4329                 if (key.objectid != BTRFS_TREE_RELOC_OBJECTID ||
4330                     key.type != BTRFS_ROOT_ITEM_KEY)
4331                         break;
4332
4333                 reloc_root = btrfs_read_fs_root(root, &key);
4334                 if (IS_ERR(reloc_root)) {
4335                         err = PTR_ERR(reloc_root);
4336                         goto out;
4337                 }
4338
4339                 list_add(&reloc_root->root_list, &reloc_roots);
4340
4341                 if (btrfs_root_refs(&reloc_root->root_item) > 0) {
4342                         fs_root = read_fs_root(root->fs_info,
4343                                                reloc_root->root_key.offset);
4344                         if (IS_ERR(fs_root)) {
4345                                 ret = PTR_ERR(fs_root);
4346                                 if (ret != -ENOENT) {
4347                                         err = ret;
4348                                         goto out;
4349                                 }
4350                                 ret = mark_garbage_root(reloc_root);
4351                                 if (ret < 0) {
4352                                         err = ret;
4353                                         goto out;
4354                                 }
4355                         }
4356                 }
4357
4358                 if (key.offset == 0)
4359                         break;
4360
4361                 key.offset--;
4362         }
4363         btrfs_release_path(path);
4364
4365         if (list_empty(&reloc_roots))
4366                 goto out;
4367
4368         rc = alloc_reloc_control(root->fs_info);
4369         if (!rc) {
4370                 err = -ENOMEM;
4371                 goto out;
4372         }
4373
4374         rc->extent_root = root->fs_info->extent_root;
4375
4376         set_reloc_control(rc);
4377
4378         trans = btrfs_join_transaction(rc->extent_root);
4379         if (IS_ERR(trans)) {
4380                 unset_reloc_control(rc);
4381                 err = PTR_ERR(trans);
4382                 goto out_free;
4383         }
4384
4385         rc->merge_reloc_tree = 1;
4386
4387         while (!list_empty(&reloc_roots)) {
4388                 reloc_root = list_entry(reloc_roots.next,
4389                                         struct btrfs_root, root_list);
4390                 list_del(&reloc_root->root_list);
4391
4392                 if (btrfs_root_refs(&reloc_root->root_item) == 0) {
4393                         list_add_tail(&reloc_root->root_list,
4394                                       &rc->reloc_roots);
4395                         continue;
4396                 }
4397
4398                 fs_root = read_fs_root(root->fs_info,
4399                                        reloc_root->root_key.offset);
4400                 if (IS_ERR(fs_root)) {
4401                         err = PTR_ERR(fs_root);
4402                         goto out_free;
4403                 }
4404
4405                 err = __add_reloc_root(reloc_root);
4406                 BUG_ON(err < 0); /* -ENOMEM or logic error */
4407                 fs_root->reloc_root = reloc_root;
4408         }
4409
4410         err = btrfs_commit_transaction(trans, rc->extent_root);
4411         if (err)
4412                 goto out_free;
4413
4414         merge_reloc_roots(rc);
4415
4416         unset_reloc_control(rc);
4417
4418         trans = btrfs_join_transaction(rc->extent_root);
4419         if (IS_ERR(trans))
4420                 err = PTR_ERR(trans);
4421         else
4422                 err = btrfs_commit_transaction(trans, rc->extent_root);
4423 out_free:
4424         kfree(rc);
4425 out:
4426         if (!list_empty(&reloc_roots))
4427                 free_reloc_roots(&reloc_roots);
4428
4429         btrfs_free_path(path);
4430
4431         if (err == 0) {
4432                 /* cleanup orphan inode in data relocation tree */
4433                 fs_root = read_fs_root(root->fs_info,
4434                                        BTRFS_DATA_RELOC_TREE_OBJECTID);
4435                 if (IS_ERR(fs_root))
4436                         err = PTR_ERR(fs_root);
4437                 else
4438                         err = btrfs_orphan_cleanup(fs_root);
4439         }
4440         return err;
4441 }
4442
4443 /*
4444  * helper to add ordered checksum for data relocation.
4445  *
4446  * cloning checksum properly handles the nodatasum extents.
4447  * it also saves CPU time to re-calculate the checksum.
4448  */
4449 int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len)
4450 {
4451         struct btrfs_ordered_sum *sums;
4452         struct btrfs_ordered_extent *ordered;
4453         struct btrfs_root *root = BTRFS_I(inode)->root;
4454         int ret;
4455         u64 disk_bytenr;
4456         u64 new_bytenr;
4457         LIST_HEAD(list);
4458
4459         ordered = btrfs_lookup_ordered_extent(inode, file_pos);
4460         BUG_ON(ordered->file_offset != file_pos || ordered->len != len);
4461
4462         disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt;
4463         ret = btrfs_lookup_csums_range(root->fs_info->csum_root, disk_bytenr,
4464                                        disk_bytenr + len - 1, &list, 0);
4465         if (ret)
4466                 goto out;
4467
4468         while (!list_empty(&list)) {
4469                 sums = list_entry(list.next, struct btrfs_ordered_sum, list);
4470                 list_del_init(&sums->list);
4471
4472                 /*
4473                  * We need to offset the new_bytenr based on where the csum is.
4474                  * We need to do this because we will read in entire prealloc
4475                  * extents but we may have written to say the middle of the
4476                  * prealloc extent, so we need to make sure the csum goes with
4477                  * the right disk offset.
4478                  *
4479                  * We can do this because the data reloc inode refers strictly
4480                  * to the on disk bytes, so we don't have to worry about
4481                  * disk_len vs real len like with real inodes since it's all
4482                  * disk length.
4483                  */
4484                 new_bytenr = ordered->start + (sums->bytenr - disk_bytenr);
4485                 sums->bytenr = new_bytenr;
4486
4487                 btrfs_add_ordered_sum(inode, ordered, sums);
4488         }
4489 out:
4490         btrfs_put_ordered_extent(ordered);
4491         return ret;
4492 }
4493
4494 int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans,
4495                           struct btrfs_root *root, struct extent_buffer *buf,
4496                           struct extent_buffer *cow)
4497 {
4498         struct reloc_control *rc;
4499         struct backref_node *node;
4500         int first_cow = 0;
4501         int level;
4502         int ret = 0;
4503
4504         rc = root->fs_info->reloc_ctl;
4505         if (!rc)
4506                 return 0;
4507
4508         BUG_ON(rc->stage == UPDATE_DATA_PTRS &&
4509                root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID);
4510
4511         if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) {
4512                 if (buf == root->node)
4513                         __update_reloc_root(root, cow->start);
4514         }
4515
4516         level = btrfs_header_level(buf);
4517         if (btrfs_header_generation(buf) <=
4518             btrfs_root_last_snapshot(&root->root_item))
4519                 first_cow = 1;
4520
4521         if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID &&
4522             rc->create_reloc_tree) {
4523                 WARN_ON(!first_cow && level == 0);
4524
4525                 node = rc->backref_cache.path[level];
4526                 BUG_ON(node->bytenr != buf->start &&
4527                        node->new_bytenr != buf->start);
4528
4529                 drop_node_buffer(node);
4530                 extent_buffer_get(cow);
4531                 node->eb = cow;
4532                 node->new_bytenr = cow->start;
4533
4534                 if (!node->pending) {
4535                         list_move_tail(&node->list,
4536                                        &rc->backref_cache.pending[level]);
4537                         node->pending = 1;
4538                 }
4539
4540                 if (first_cow)
4541                         __mark_block_processed(rc, node);
4542
4543                 if (first_cow && level > 0)
4544                         rc->nodes_relocated += buf->len;
4545         }
4546
4547         if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS)
4548                 ret = replace_file_extents(trans, rc, root, cow);
4549         return ret;
4550 }
4551
4552 /*
4553  * called before creating snapshot. it calculates metadata reservation
4554  * requried for relocating tree blocks in the snapshot
4555  */
4556 void btrfs_reloc_pre_snapshot(struct btrfs_trans_handle *trans,
4557                               struct btrfs_pending_snapshot *pending,
4558                               u64 *bytes_to_reserve)
4559 {
4560         struct btrfs_root *root;
4561         struct reloc_control *rc;
4562
4563         root = pending->root;
4564         if (!root->reloc_root)
4565                 return;
4566
4567         rc = root->fs_info->reloc_ctl;
4568         if (!rc->merge_reloc_tree)
4569                 return;
4570
4571         root = root->reloc_root;
4572         BUG_ON(btrfs_root_refs(&root->root_item) == 0);
4573         /*
4574          * relocation is in the stage of merging trees. the space
4575          * used by merging a reloc tree is twice the size of
4576          * relocated tree nodes in the worst case. half for cowing
4577          * the reloc tree, half for cowing the fs tree. the space
4578          * used by cowing the reloc tree will be freed after the
4579          * tree is dropped. if we create snapshot, cowing the fs
4580          * tree may use more space than it frees. so we need
4581          * reserve extra space.
4582          */
4583         *bytes_to_reserve += rc->nodes_relocated;
4584 }
4585
4586 /*
4587  * called after snapshot is created. migrate block reservation
4588  * and create reloc root for the newly created snapshot
4589  */
4590 int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans,
4591                                struct btrfs_pending_snapshot *pending)
4592 {
4593         struct btrfs_root *root = pending->root;
4594         struct btrfs_root *reloc_root;
4595         struct btrfs_root *new_root;
4596         struct reloc_control *rc;
4597         int ret;
4598
4599         if (!root->reloc_root)
4600                 return 0;
4601
4602         rc = root->fs_info->reloc_ctl;
4603         rc->merging_rsv_size += rc->nodes_relocated;
4604
4605         if (rc->merge_reloc_tree) {
4606                 ret = btrfs_block_rsv_migrate(&pending->block_rsv,
4607                                               rc->block_rsv,
4608                                               rc->nodes_relocated);
4609                 if (ret)
4610                         return ret;
4611         }
4612
4613         new_root = pending->snap;
4614         reloc_root = create_reloc_root(trans, root->reloc_root,
4615                                        new_root->root_key.objectid);
4616         if (IS_ERR(reloc_root))
4617                 return PTR_ERR(reloc_root);
4618
4619         ret = __add_reloc_root(reloc_root);
4620         BUG_ON(ret < 0);
4621         new_root->reloc_root = reloc_root;
4622
4623         if (rc->create_reloc_tree)
4624                 ret = clone_backref_node(trans, rc, root, reloc_root);
4625         return ret;
4626 }