Lines Matching +full:root +full:- +full:node
1 // SPDX-License-Identifier: GPL-2.0
12 #include <linux/error-injection.h>
14 #include "disk-io.h"
19 #include "async-thread.h"
20 #include "free-space-cache.h"
21 #include "inode-map.h"
23 #include "print-tree.h"
24 #include "delalloc-space.h"
25 #include "block-group.h"
40 * ------------------------------------------------------------------
47 * 1. Mark the target block group read-only
78 * map address of tree root to tree
130 /* map start of tree root to corresponding reloc tree */
157 struct btrfs_backref_node *node) in mark_block_processed() argument
161 if (node->level == 0 || in mark_block_processed()
162 in_range(node->bytenr, rc->block_group->start, in mark_block_processed()
163 rc->block_group->length)) { in mark_block_processed()
164 blocksize = rc->extent_root->fs_info->nodesize; in mark_block_processed()
165 set_extent_bits(&rc->processed_blocks, node->bytenr, in mark_block_processed()
166 node->bytenr + blocksize - 1, EXTENT_DIRTY); in mark_block_processed()
168 node->processed = 1; in mark_block_processed()
174 tree->rb_root = RB_ROOT; in mapping_tree_init()
175 spin_lock_init(&tree->lock); in mapping_tree_init()
179 * walk up backref nodes until reach node presents tree root
182 struct btrfs_backref_node *node, in walk_up_backref() argument
188 while (!list_empty(&node->upper)) { in walk_up_backref()
189 edge = list_entry(node->upper.next, in walk_up_backref()
192 node = edge->node[UPPER]; in walk_up_backref()
194 BUG_ON(node->detached); in walk_up_backref()
196 return node; in walk_up_backref()
210 edge = edges[idx - 1]; in walk_down_backref()
211 lower = edge->node[LOWER]; in walk_down_backref()
212 if (list_is_last(&edge->list[LOWER], &lower->upper)) { in walk_down_backref()
213 idx--; in walk_down_backref()
216 edge = list_entry(edge->list[LOWER].next, in walk_down_backref()
218 edges[idx - 1] = edge; in walk_down_backref()
220 return edge->node[UPPER]; in walk_down_backref()
227 struct btrfs_backref_node *node, u64 bytenr) in update_backref_node() argument
230 rb_erase(&node->rb_node, &cache->rb_root); in update_backref_node()
231 node->bytenr = bytenr; in update_backref_node()
232 rb_node = rb_simple_insert(&cache->rb_root, node->bytenr, &node->rb_node); in update_backref_node()
234 btrfs_backref_panic(cache->fs_info, bytenr, -EEXIST); in update_backref_node()
243 struct btrfs_backref_node *node; in update_backref_cache() local
246 if (cache->last_trans == 0) { in update_backref_cache()
247 cache->last_trans = trans->transid; in update_backref_cache()
251 if (cache->last_trans == trans->transid) in update_backref_cache()
259 while (!list_empty(&cache->detached)) { in update_backref_cache()
260 node = list_entry(cache->detached.next, in update_backref_cache()
262 btrfs_backref_cleanup_node(cache, node); in update_backref_cache()
265 while (!list_empty(&cache->changed)) { in update_backref_cache()
266 node = list_entry(cache->changed.next, in update_backref_cache()
268 list_del_init(&node->list); in update_backref_cache()
269 BUG_ON(node->pending); in update_backref_cache()
270 update_backref_node(cache, node, node->new_bytenr); in update_backref_cache()
278 list_for_each_entry(node, &cache->pending[level], list) { in update_backref_cache()
279 BUG_ON(!node->pending); in update_backref_cache()
280 if (node->bytenr == node->new_bytenr) in update_backref_cache()
282 update_backref_node(cache, node, node->new_bytenr); in update_backref_cache()
286 cache->last_trans = 0; in update_backref_cache()
290 static bool reloc_root_is_dead(struct btrfs_root *root) in reloc_root_is_dead() argument
298 if (test_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state)) in reloc_root_is_dead()
307 * This is enough for most callers, as they don't distinguish dead reloc root
308 * from no reloc root. But btrfs_should_ignore_reloc_root() below is a
311 static bool have_reloc_root(struct btrfs_root *root) in have_reloc_root() argument
313 if (reloc_root_is_dead(root)) in have_reloc_root()
315 if (!root->reloc_root) in have_reloc_root()
320 int btrfs_should_ignore_reloc_root(struct btrfs_root *root) in btrfs_should_ignore_reloc_root() argument
324 if (!test_bit(BTRFS_ROOT_SHAREABLE, &root->state)) in btrfs_should_ignore_reloc_root()
327 /* This root has been merged with its reloc tree, we can ignore it */ in btrfs_should_ignore_reloc_root()
328 if (reloc_root_is_dead(root)) in btrfs_should_ignore_reloc_root()
331 reloc_root = root->reloc_root; in btrfs_should_ignore_reloc_root()
335 if (btrfs_header_generation(reloc_root->commit_root) == in btrfs_should_ignore_reloc_root()
336 root->fs_info->running_transaction->transid) in btrfs_should_ignore_reloc_root()
341 * so backref node for the fs tree root is useless for in btrfs_should_ignore_reloc_root()
348 * find reloc tree by address of tree root
352 struct reloc_control *rc = fs_info->reloc_ctl; in find_reloc_root()
354 struct mapping_node *node; in find_reloc_root() local
355 struct btrfs_root *root = NULL; in find_reloc_root() local
358 spin_lock(&rc->reloc_root_tree.lock); in find_reloc_root()
359 rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root, bytenr); in find_reloc_root()
361 node = rb_entry(rb_node, struct mapping_node, rb_node); in find_reloc_root()
362 root = (struct btrfs_root *)node->data; in find_reloc_root()
364 spin_unlock(&rc->reloc_root_tree.lock); in find_reloc_root()
365 return btrfs_grab_root(root); in find_reloc_root()
371 * - Cleanup the children edges and nodes
372 * If child node is also orphan (no parent) during cleanup, then the child
373 * node will also be cleaned up.
375 * - Freeing up leaves (level 0), keeps nodes detached
376 * For nodes, the node is still cached as "detached"
378 * Return false if @node is not in the @useless_nodes list.
379 * Return true if @node is in the @useless_nodes list.
382 struct btrfs_backref_node *node) in handle_useless_nodes() argument
384 struct btrfs_backref_cache *cache = &rc->backref_cache; in handle_useless_nodes()
385 struct list_head *useless_node = &cache->useless_node; in handle_useless_nodes()
393 list_del_init(&cur->list); in handle_useless_nodes()
395 /* Only tree root nodes can be added to @useless_nodes */ in handle_useless_nodes()
396 ASSERT(list_empty(&cur->upper)); in handle_useless_nodes()
398 if (cur == node) in handle_useless_nodes()
401 /* The node is the lowest node */ in handle_useless_nodes()
402 if (cur->lowest) { in handle_useless_nodes()
403 list_del_init(&cur->lower); in handle_useless_nodes()
404 cur->lowest = 0; in handle_useless_nodes()
408 while (!list_empty(&cur->lower)) { in handle_useless_nodes()
412 edge = list_entry(cur->lower.next, in handle_useless_nodes()
414 list_del(&edge->list[UPPER]); in handle_useless_nodes()
415 list_del(&edge->list[LOWER]); in handle_useless_nodes()
416 lower = edge->node[LOWER]; in handle_useless_nodes()
419 /* Child node is also orphan, queue for cleanup */ in handle_useless_nodes()
420 if (list_empty(&lower->upper)) in handle_useless_nodes()
421 list_add(&lower->list, useless_node); in handle_useless_nodes()
431 if (cur->level > 0) { in handle_useless_nodes()
432 list_add(&cur->list, &cache->detached); in handle_useless_nodes()
433 cur->detached = 1; in handle_useless_nodes()
435 rb_erase(&cur->rb_node, &cache->rb_root); in handle_useless_nodes()
443 * Build backref tree for a given tree block. Root of the backref tree
445 * b-trees that reference the tree block.
449 * these upper level blocks recursively. The recursion stops when tree root is
461 struct btrfs_backref_cache *cache = &rc->backref_cache; in build_backref_tree()
465 struct btrfs_backref_node *node = NULL; in build_backref_tree() local
470 iter = btrfs_backref_iter_alloc(rc->extent_root->fs_info, GFP_NOFS); in build_backref_tree()
472 return ERR_PTR(-ENOMEM); in build_backref_tree()
475 err = -ENOMEM; in build_backref_tree()
479 node = btrfs_backref_alloc_node(cache, bytenr, level); in build_backref_tree()
480 if (!node) { in build_backref_tree()
481 err = -ENOMEM; in build_backref_tree()
485 node->lowest = 1; in build_backref_tree()
486 cur = node; in build_backref_tree()
488 /* Breadth-first search to build backref cache */ in build_backref_tree()
496 edge = list_first_entry_or_null(&cache->pending_edge, in build_backref_tree()
503 list_del_init(&edge->list[UPPER]); in build_backref_tree()
504 cur = edge->node[UPPER]; in build_backref_tree()
509 ret = btrfs_backref_finish_upper_links(cache, node); in build_backref_tree()
515 if (handle_useless_nodes(rc, node)) in build_backref_tree()
516 node = NULL; in build_backref_tree()
521 btrfs_backref_error_cleanup(cache, node); in build_backref_tree()
524 ASSERT(!node || !node->detached); in build_backref_tree()
525 ASSERT(list_empty(&cache->useless_node) && in build_backref_tree()
526 list_empty(&cache->pending_edge)); in build_backref_tree()
527 return node; in build_backref_tree()
531 * helper to add backref node for the newly created snapshot.
532 * the backref node is created by cloning backref node that
533 * corresponds to root of source tree
540 struct btrfs_root *reloc_root = src->reloc_root; in clone_backref_node()
541 struct btrfs_backref_cache *cache = &rc->backref_cache; in clone_backref_node()
542 struct btrfs_backref_node *node = NULL; in clone_backref_node() local
548 if (cache->last_trans > 0) in clone_backref_node()
551 rb_node = rb_simple_search(&cache->rb_root, src->commit_root->start); in clone_backref_node()
553 node = rb_entry(rb_node, struct btrfs_backref_node, rb_node); in clone_backref_node()
554 if (node->detached) in clone_backref_node()
555 node = NULL; in clone_backref_node()
557 BUG_ON(node->new_bytenr != reloc_root->node->start); in clone_backref_node()
560 if (!node) { in clone_backref_node()
561 rb_node = rb_simple_search(&cache->rb_root, in clone_backref_node()
562 reloc_root->commit_root->start); in clone_backref_node()
564 node = rb_entry(rb_node, struct btrfs_backref_node, in clone_backref_node()
566 BUG_ON(node->detached); in clone_backref_node()
570 if (!node) in clone_backref_node()
573 new_node = btrfs_backref_alloc_node(cache, dest->node->start, in clone_backref_node()
574 node->level); in clone_backref_node()
576 return -ENOMEM; in clone_backref_node()
578 new_node->lowest = node->lowest; in clone_backref_node()
579 new_node->checked = 1; in clone_backref_node()
580 new_node->root = btrfs_grab_root(dest); in clone_backref_node()
581 ASSERT(new_node->root); in clone_backref_node()
583 if (!node->lowest) { in clone_backref_node()
584 list_for_each_entry(edge, &node->lower, list[UPPER]) { in clone_backref_node()
589 btrfs_backref_link_edge(new_edge, edge->node[LOWER], in clone_backref_node()
593 list_add_tail(&new_node->lower, &cache->leaves); in clone_backref_node()
596 rb_node = rb_simple_insert(&cache->rb_root, new_node->bytenr, in clone_backref_node()
597 &new_node->rb_node); in clone_backref_node()
599 btrfs_backref_panic(trans->fs_info, new_node->bytenr, -EEXIST); in clone_backref_node()
601 if (!new_node->lowest) { in clone_backref_node()
602 list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { in clone_backref_node()
603 list_add_tail(&new_edge->list[LOWER], in clone_backref_node()
604 &new_edge->node[LOWER]->upper); in clone_backref_node()
609 while (!list_empty(&new_node->lower)) { in clone_backref_node()
610 new_edge = list_entry(new_node->lower.next, in clone_backref_node()
612 list_del(&new_edge->list[UPPER]); in clone_backref_node()
616 return -ENOMEM; in clone_backref_node()
620 * helper to add 'address of tree root -> reloc tree' mapping
622 static int __must_check __add_reloc_root(struct btrfs_root *root) in __add_reloc_root() argument
624 struct btrfs_fs_info *fs_info = root->fs_info; in __add_reloc_root()
626 struct mapping_node *node; in __add_reloc_root() local
627 struct reloc_control *rc = fs_info->reloc_ctl; in __add_reloc_root()
629 node = kmalloc(sizeof(*node), GFP_NOFS); in __add_reloc_root()
630 if (!node) in __add_reloc_root()
631 return -ENOMEM; in __add_reloc_root()
633 node->bytenr = root->commit_root->start; in __add_reloc_root()
634 node->data = root; in __add_reloc_root()
636 spin_lock(&rc->reloc_root_tree.lock); in __add_reloc_root()
637 rb_node = rb_simple_insert(&rc->reloc_root_tree.rb_root, in __add_reloc_root()
638 node->bytenr, &node->rb_node); in __add_reloc_root()
639 spin_unlock(&rc->reloc_root_tree.lock); in __add_reloc_root()
641 btrfs_panic(fs_info, -EEXIST, in __add_reloc_root()
642 "Duplicate root found for start=%llu while inserting into relocation tree", in __add_reloc_root()
643 node->bytenr); in __add_reloc_root()
646 list_add_tail(&root->root_list, &rc->reloc_roots); in __add_reloc_root()
651 * helper to delete the 'address of tree root -> reloc tree'
654 static void __del_reloc_root(struct btrfs_root *root) in __del_reloc_root() argument
656 struct btrfs_fs_info *fs_info = root->fs_info; in __del_reloc_root()
658 struct mapping_node *node = NULL; in __del_reloc_root() local
659 struct reloc_control *rc = fs_info->reloc_ctl; in __del_reloc_root()
662 if (rc && root->node) { in __del_reloc_root()
663 spin_lock(&rc->reloc_root_tree.lock); in __del_reloc_root()
664 rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root, in __del_reloc_root()
665 root->commit_root->start); in __del_reloc_root()
667 node = rb_entry(rb_node, struct mapping_node, rb_node); in __del_reloc_root()
668 rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); in __del_reloc_root()
669 RB_CLEAR_NODE(&node->rb_node); in __del_reloc_root()
671 spin_unlock(&rc->reloc_root_tree.lock); in __del_reloc_root()
672 ASSERT(!node || (struct btrfs_root *)node->data == root); in __del_reloc_root()
676 * We only put the reloc root here if it's on the list. There's a lot in __del_reloc_root()
677 * of places where the pattern is to splice the rc->reloc_roots, process in __del_reloc_root()
678 * the reloc roots, and then add the reloc root back onto in __del_reloc_root()
679 * rc->reloc_roots. If we call __del_reloc_root while it's off of the in __del_reloc_root()
683 spin_lock(&fs_info->trans_lock); in __del_reloc_root()
684 if (!list_empty(&root->root_list)) { in __del_reloc_root()
686 list_del_init(&root->root_list); in __del_reloc_root()
688 spin_unlock(&fs_info->trans_lock); in __del_reloc_root()
690 btrfs_put_root(root); in __del_reloc_root()
691 kfree(node); in __del_reloc_root()
695 * helper to update the 'address of tree root -> reloc tree'
698 static int __update_reloc_root(struct btrfs_root *root) in __update_reloc_root() argument
700 struct btrfs_fs_info *fs_info = root->fs_info; in __update_reloc_root()
702 struct mapping_node *node = NULL; in __update_reloc_root() local
703 struct reloc_control *rc = fs_info->reloc_ctl; in __update_reloc_root()
705 spin_lock(&rc->reloc_root_tree.lock); in __update_reloc_root()
706 rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root, in __update_reloc_root()
707 root->commit_root->start); in __update_reloc_root()
709 node = rb_entry(rb_node, struct mapping_node, rb_node); in __update_reloc_root()
710 rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); in __update_reloc_root()
712 spin_unlock(&rc->reloc_root_tree.lock); in __update_reloc_root()
714 if (!node) in __update_reloc_root()
716 BUG_ON((struct btrfs_root *)node->data != root); in __update_reloc_root()
718 spin_lock(&rc->reloc_root_tree.lock); in __update_reloc_root()
719 node->bytenr = root->node->start; in __update_reloc_root()
720 rb_node = rb_simple_insert(&rc->reloc_root_tree.rb_root, in __update_reloc_root()
721 node->bytenr, &node->rb_node); in __update_reloc_root()
722 spin_unlock(&rc->reloc_root_tree.lock); in __update_reloc_root()
724 btrfs_backref_panic(fs_info, node->bytenr, -EEXIST); in __update_reloc_root()
729 struct btrfs_root *root, u64 objectid) in create_reloc_root() argument
731 struct btrfs_fs_info *fs_info = root->fs_info; in create_reloc_root()
741 return ERR_PTR(-ENOMEM); in create_reloc_root()
747 if (root->root_key.objectid == objectid) { in create_reloc_root()
751 ret = btrfs_copy_root(trans, root, root->commit_root, &eb, in create_reloc_root()
758 * root - like this ctree.c:btrfs_block_can_be_shared() behaves in create_reloc_root()
759 * correctly (returns true) when the relocation root is created in create_reloc_root()
764 commit_root_gen = btrfs_header_generation(root->commit_root); in create_reloc_root()
765 btrfs_set_root_last_snapshot(&root->root_item, commit_root_gen); in create_reloc_root()
774 ret = btrfs_copy_root(trans, root, root->node, &eb, in create_reloc_root()
786 memcpy(root_item, &root->root_item, sizeof(*root_item)); in create_reloc_root()
787 btrfs_set_root_bytenr(root_item, eb->start); in create_reloc_root()
789 btrfs_set_root_generation(root_item, trans->transid); in create_reloc_root()
791 if (root->root_key.objectid == objectid) { in create_reloc_root()
793 memset(&root_item->drop_progress, 0, in create_reloc_root()
795 root_item->drop_level = 0; in create_reloc_root()
801 ret = btrfs_insert_root(trans, fs_info->tree_root, in create_reloc_root()
808 reloc_root = btrfs_read_tree_root(fs_info->tree_root, &root_key); in create_reloc_root()
813 set_bit(BTRFS_ROOT_SHAREABLE, &reloc_root->state); in create_reloc_root()
814 reloc_root->last_trans = trans->transid; in create_reloc_root()
826 * snapshot of the fs tree with special root objectid.
829 * root->reloc_root, and another for being on the rc->reloc_roots list.
832 struct btrfs_root *root) in btrfs_init_reloc_root() argument
834 struct btrfs_fs_info *fs_info = root->fs_info; in btrfs_init_reloc_root()
836 struct reloc_control *rc = fs_info->reloc_ctl; in btrfs_init_reloc_root()
848 if (reloc_root_is_dead(root)) in btrfs_init_reloc_root()
854 * corresponding fs root, and then here we update the last trans for the in btrfs_init_reloc_root()
855 * reloc root. This means that we have to do this for the entire life in btrfs_init_reloc_root()
856 * of the reloc root, regardless of which stage of the relocation we are in btrfs_init_reloc_root()
859 if (root->reloc_root) { in btrfs_init_reloc_root()
860 reloc_root = root->reloc_root; in btrfs_init_reloc_root()
861 reloc_root->last_trans = trans->transid; in btrfs_init_reloc_root()
869 if (!rc->create_reloc_tree || in btrfs_init_reloc_root()
870 root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) in btrfs_init_reloc_root()
873 if (!trans->reloc_reserved) { in btrfs_init_reloc_root()
874 rsv = trans->block_rsv; in btrfs_init_reloc_root()
875 trans->block_rsv = rc->block_rsv; in btrfs_init_reloc_root()
878 reloc_root = create_reloc_root(trans, root, root->root_key.objectid); in btrfs_init_reloc_root()
880 trans->block_rsv = rsv; in btrfs_init_reloc_root()
884 root->reloc_root = btrfs_grab_root(reloc_root); in btrfs_init_reloc_root()
889 * update root item of reloc tree
892 struct btrfs_root *root) in btrfs_update_reloc_root() argument
894 struct btrfs_fs_info *fs_info = root->fs_info; in btrfs_update_reloc_root()
899 if (!have_reloc_root(root)) in btrfs_update_reloc_root()
902 reloc_root = root->reloc_root; in btrfs_update_reloc_root()
903 root_item = &reloc_root->root_item; in btrfs_update_reloc_root()
907 * the root. We have the ref for root->reloc_root, but just in case in btrfs_update_reloc_root()
908 * hold it while we update the reloc root. in btrfs_update_reloc_root()
912 /* root->reloc_root will stay until current relocation finished */ in btrfs_update_reloc_root()
913 if (fs_info->reloc_ctl->merge_reloc_tree && in btrfs_update_reloc_root()
915 set_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); in btrfs_update_reloc_root()
924 if (reloc_root->commit_root != reloc_root->node) { in btrfs_update_reloc_root()
926 btrfs_set_root_node(root_item, reloc_root->node); in btrfs_update_reloc_root()
927 free_extent_buffer(reloc_root->commit_root); in btrfs_update_reloc_root()
928 reloc_root->commit_root = btrfs_root_node(reloc_root); in btrfs_update_reloc_root()
931 ret = btrfs_update_root(trans, fs_info->tree_root, in btrfs_update_reloc_root()
932 &reloc_root->root_key, root_item); in btrfs_update_reloc_root()
941 static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) in find_next_inode() argument
943 struct rb_node *node; in find_next_inode() local
948 spin_lock(&root->inode_lock); in find_next_inode()
950 node = root->inode_tree.rb_node; in find_next_inode()
952 while (node) { in find_next_inode()
953 prev = node; in find_next_inode()
954 entry = rb_entry(node, struct btrfs_inode, rb_node); in find_next_inode()
957 node = node->rb_left; in find_next_inode()
959 node = node->rb_right; in find_next_inode()
963 if (!node) { in find_next_inode()
967 node = prev; in find_next_inode()
973 while (node) { in find_next_inode()
974 entry = rb_entry(node, struct btrfs_inode, rb_node); in find_next_inode()
975 inode = igrab(&entry->vfs_inode); in find_next_inode()
977 spin_unlock(&root->inode_lock); in find_next_inode()
982 if (cond_resched_lock(&root->inode_lock)) in find_next_inode()
985 node = rb_next(node); in find_next_inode()
987 spin_unlock(&root->inode_lock); in find_next_inode()
997 struct btrfs_root *root = BTRFS_I(reloc_inode)->root; in get_new_location() local
1005 return -ENOMEM; in get_new_location()
1007 bytenr -= BTRFS_I(reloc_inode)->index_cnt; in get_new_location()
1008 ret = btrfs_lookup_file_extent(NULL, root, path, in get_new_location()
1013 ret = -ENOENT; in get_new_location()
1017 leaf = path->nodes[0]; in get_new_location()
1018 fi = btrfs_item_ptr(leaf, path->slots[0], in get_new_location()
1027 ret = -EINVAL; in get_new_location()
1045 struct btrfs_root *root, in replace_file_extents() argument
1048 struct btrfs_fs_info *fs_info = root->fs_info; in replace_file_extents()
1063 if (rc->stage != UPDATE_DATA_PTRS) in replace_file_extents()
1067 if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) in replace_file_extents()
1068 parent = leaf->start; in replace_file_extents()
1088 if (!in_range(bytenr, rc->block_group->start, in replace_file_extents()
1089 rc->block_group->length)) in replace_file_extents()
1096 if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { in replace_file_extents()
1098 inode = find_next_inode(root, key.objectid); in replace_file_extents()
1102 inode = find_next_inode(root, key.objectid); in replace_file_extents()
1108 fs_info->sectorsize)); in replace_file_extents()
1109 WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); in replace_file_extents()
1110 end--; in replace_file_extents()
1111 ret = try_lock_extent(&BTRFS_I(inode)->io_tree, in replace_file_extents()
1118 unlock_extent(&BTRFS_I(inode)->io_tree, in replace_file_extents()
1123 ret = get_new_location(rc->data_inode, &new_bytenr, in replace_file_extents()
1136 key.offset -= btrfs_file_extent_offset(leaf, fi); in replace_file_extents()
1139 ref.real_root = root->root_key.objectid; in replace_file_extents()
1150 ref.real_root = root->root_key.objectid; in replace_file_extents()
1173 btrfs_node_key(path->nodes[level], &key2, path->slots[level]); in memcmp_node_keys()
1192 struct btrfs_fs_info *fs_info = dest->fs_info; in replace_path()
1208 ASSERT(src->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); in replace_path()
1209 ASSERT(dest->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); in replace_path()
1211 last_snapshot = btrfs_root_last_snapshot(&src->root_item); in replace_path()
1213 slot = path->slots[lowest_level]; in replace_path()
1214 btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); in replace_path()
1234 next_key->objectid = (u64)-1; in replace_path()
1235 next_key->type = (u8)-1; in replace_path()
1236 next_key->offset = (u64)-1; in replace_path()
1250 slot--; in replace_path()
1256 blocksize = fs_info->nodesize; in replace_path()
1261 eb = path->nodes[level]; in replace_path()
1263 path->slots[level]); in replace_path()
1265 path->slots[level]); in replace_path()
1284 level - 1, &first_key); in replace_path()
1289 ret = -EIO; in replace_path()
1316 btrfs_node_key_to_cpu(path->nodes[level], &key, in replace_path()
1317 path->slots[level]); in replace_path()
1320 path->lowest_level = level; in replace_path()
1322 path->lowest_level = 0; in replace_path()
1337 * CoW on the subtree root node before transaction commit. in replace_path()
1340 rc->block_group, parent, slot, in replace_path()
1341 path->nodes[level], path->slots[level], in replace_path()
1352 btrfs_set_node_blockptr(path->nodes[level], in replace_path()
1353 path->slots[level], old_bytenr); in replace_path()
1354 btrfs_set_node_ptr_generation(path->nodes[level], in replace_path()
1355 path->slots[level], old_ptr_gen); in replace_path()
1356 btrfs_mark_buffer_dirty(path->nodes[level]); in replace_path()
1359 blocksize, path->nodes[level]->start); in replace_path()
1361 btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); in replace_path()
1367 btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); in replace_path()
1372 blocksize, path->nodes[level]->start); in replace_path()
1373 btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); in replace_path()
1380 btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); in replace_path()
1399 int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, in walk_up_reloc_tree() argument
1407 last_snapshot = btrfs_root_last_snapshot(&root->root_item); in walk_up_reloc_tree()
1410 free_extent_buffer(path->nodes[i]); in walk_up_reloc_tree()
1411 path->nodes[i] = NULL; in walk_up_reloc_tree()
1414 for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in walk_up_reloc_tree()
1415 eb = path->nodes[i]; in walk_up_reloc_tree()
1417 while (path->slots[i] + 1 < nritems) { in walk_up_reloc_tree()
1418 path->slots[i]++; in walk_up_reloc_tree()
1419 if (btrfs_node_ptr_generation(eb, path->slots[i]) <= in walk_up_reloc_tree()
1426 free_extent_buffer(path->nodes[i]); in walk_up_reloc_tree()
1427 path->nodes[i] = NULL; in walk_up_reloc_tree()
1436 int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, in walk_down_reloc_tree() argument
1439 struct btrfs_fs_info *fs_info = root->fs_info; in walk_down_reloc_tree()
1447 last_snapshot = btrfs_root_last_snapshot(&root->root_item); in walk_down_reloc_tree()
1449 for (i = *level; i > 0; i--) { in walk_down_reloc_tree()
1452 eb = path->nodes[i]; in walk_down_reloc_tree()
1454 while (path->slots[i] < nritems) { in walk_down_reloc_tree()
1455 ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); in walk_down_reloc_tree()
1458 path->slots[i]++; in walk_down_reloc_tree()
1460 if (path->slots[i] >= nritems) { in walk_down_reloc_tree()
1471 bytenr = btrfs_node_blockptr(eb, path->slots[i]); in walk_down_reloc_tree()
1472 btrfs_node_key_to_cpu(eb, &first_key, path->slots[i]); in walk_down_reloc_tree()
1473 eb = read_tree_block(fs_info, bytenr, ptr_gen, i - 1, in walk_down_reloc_tree()
1479 return -EIO; in walk_down_reloc_tree()
1481 BUG_ON(btrfs_header_level(eb) != i - 1); in walk_down_reloc_tree()
1482 path->nodes[i - 1] = eb; in walk_down_reloc_tree()
1483 path->slots[i - 1] = 0; in walk_down_reloc_tree()
1492 static int invalidate_extent_cache(struct btrfs_root *root, in invalidate_extent_cache() argument
1496 struct btrfs_fs_info *fs_info = root->fs_info; in invalidate_extent_cache()
1502 objectid = min_key->objectid; in invalidate_extent_cache()
1507 if (objectid > max_key->objectid) in invalidate_extent_cache()
1510 inode = find_next_inode(root, objectid); in invalidate_extent_cache()
1515 if (ino > max_key->objectid) { in invalidate_extent_cache()
1521 if (!S_ISREG(inode->i_mode)) in invalidate_extent_cache()
1524 if (unlikely(min_key->objectid == ino)) { in invalidate_extent_cache()
1525 if (min_key->type > BTRFS_EXTENT_DATA_KEY) in invalidate_extent_cache()
1527 if (min_key->type < BTRFS_EXTENT_DATA_KEY) in invalidate_extent_cache()
1530 start = min_key->offset; in invalidate_extent_cache()
1531 WARN_ON(!IS_ALIGNED(start, fs_info->sectorsize)); in invalidate_extent_cache()
1537 if (unlikely(max_key->objectid == ino)) { in invalidate_extent_cache()
1538 if (max_key->type < BTRFS_EXTENT_DATA_KEY) in invalidate_extent_cache()
1540 if (max_key->type > BTRFS_EXTENT_DATA_KEY) { in invalidate_extent_cache()
1541 end = (u64)-1; in invalidate_extent_cache()
1543 if (max_key->offset == 0) in invalidate_extent_cache()
1545 end = max_key->offset; in invalidate_extent_cache()
1546 WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); in invalidate_extent_cache()
1547 end--; in invalidate_extent_cache()
1550 end = (u64)-1; in invalidate_extent_cache()
1554 lock_extent(&BTRFS_I(inode)->io_tree, start, end); in invalidate_extent_cache()
1556 unlock_extent(&BTRFS_I(inode)->io_tree, start, end); in invalidate_extent_cache()
1566 if (!path->nodes[level]) in find_next_key()
1568 if (path->slots[level] + 1 < in find_next_key()
1569 btrfs_header_nritems(path->nodes[level])) { in find_next_key()
1570 btrfs_node_key_to_cpu(path->nodes[level], key, in find_next_key()
1571 path->slots[level] + 1); in find_next_key()
1584 struct btrfs_root *root) in insert_dirty_subvol() argument
1586 struct btrfs_root *reloc_root = root->reloc_root; in insert_dirty_subvol()
1589 /* @root must be a subvolume tree root with a valid reloc tree */ in insert_dirty_subvol()
1590 ASSERT(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); in insert_dirty_subvol()
1593 reloc_root_item = &reloc_root->root_item; in insert_dirty_subvol()
1594 memset(&reloc_root_item->drop_progress, 0, in insert_dirty_subvol()
1595 sizeof(reloc_root_item->drop_progress)); in insert_dirty_subvol()
1596 reloc_root_item->drop_level = 0; in insert_dirty_subvol()
1598 btrfs_update_reloc_root(trans, root); in insert_dirty_subvol()
1600 if (list_empty(&root->reloc_dirty_list)) { in insert_dirty_subvol()
1601 btrfs_grab_root(root); in insert_dirty_subvol()
1602 list_add_tail(&root->reloc_dirty_list, &rc->dirty_subvol_roots); in insert_dirty_subvol()
1608 struct btrfs_root *root; in clean_dirty_subvols() local
1613 list_for_each_entry_safe(root, next, &rc->dirty_subvol_roots, in clean_dirty_subvols()
1615 if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { in clean_dirty_subvols()
1616 /* Merged subvolume, cleanup its reloc root */ in clean_dirty_subvols()
1617 struct btrfs_root *reloc_root = root->reloc_root; in clean_dirty_subvols()
1619 list_del_init(&root->reloc_dirty_list); in clean_dirty_subvols()
1620 root->reloc_root = NULL; in clean_dirty_subvols()
1623 * root->reloc_root = NULL. Pairs with have_reloc_root. in clean_dirty_subvols()
1626 clear_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); in clean_dirty_subvols()
1630 * ->reloc_root. If it fails however we must in clean_dirty_subvols()
1640 btrfs_put_root(root); in clean_dirty_subvols()
1643 ret2 = btrfs_drop_snapshot(root, 0, 1); in clean_dirty_subvols()
1645 btrfs_put_root(root); in clean_dirty_subvols()
1659 struct btrfs_root *root) in merge_reloc_root() argument
1661 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; in merge_reloc_root()
1679 return -ENOMEM; in merge_reloc_root()
1680 path->reada = READA_FORWARD; in merge_reloc_root()
1682 reloc_root = root->reloc_root; in merge_reloc_root()
1683 root_item = &reloc_root->root_item; in merge_reloc_root()
1685 if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { in merge_reloc_root()
1687 atomic_inc(&reloc_root->node->refs); in merge_reloc_root()
1688 path->nodes[level] = reloc_root->node; in merge_reloc_root()
1689 path->slots[level] = 0; in merge_reloc_root()
1691 btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); in merge_reloc_root()
1693 level = root_item->drop_level; in merge_reloc_root()
1695 path->lowest_level = level; in merge_reloc_root()
1697 path->lowest_level = 0; in merge_reloc_root()
1703 btrfs_node_key_to_cpu(path->nodes[level], &next_key, in merge_reloc_root()
1704 path->slots[level]); in merge_reloc_root()
1713 * block COW, we COW at most from level 1 to root level for each tree. in merge_reloc_root()
1719 min_reserved = fs_info->nodesize * reserve_level * 2; in merge_reloc_root()
1723 ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, in merge_reloc_root()
1729 trans = btrfs_start_transaction(root, 0); in merge_reloc_root()
1743 * btrfs_update_reloc_root() and update our root item in merge_reloc_root()
1746 reloc_root->last_trans = trans->transid; in merge_reloc_root()
1747 trans->block_rsv = rc->block_rsv; in merge_reloc_root()
1764 ret = replace_path(trans, rc, root, reloc_root, path, in merge_reloc_root()
1774 btrfs_node_key_to_cpu(path->nodes[level], &key, in merge_reloc_root()
1775 path->slots[level]); in merge_reloc_root()
1786 * this is OK since root refs == 1 in this case. in merge_reloc_root()
1788 btrfs_node_key(path->nodes[level], &root_item->drop_progress, in merge_reloc_root()
1789 path->slots[level]); in merge_reloc_root()
1790 root_item->drop_level = level; in merge_reloc_root()
1797 if (replaced && rc->stage == UPDATE_DATA_PTRS) in merge_reloc_root()
1798 invalidate_extent_cache(root, &key, &next_key); in merge_reloc_root()
1803 * relocated and the block is tree root. in merge_reloc_root()
1805 leaf = btrfs_lock_root_node(root); in merge_reloc_root()
1806 ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf, in merge_reloc_root()
1816 insert_dirty_subvol(trans, rc, root); in merge_reloc_root()
1823 if (replaced && rc->stage == UPDATE_DATA_PTRS) in merge_reloc_root()
1824 invalidate_extent_cache(root, &key, &next_key); in merge_reloc_root()
1832 struct btrfs_root *root = rc->extent_root; in prepare_to_merge() local
1833 struct btrfs_fs_info *fs_info = root->fs_info; in prepare_to_merge()
1840 mutex_lock(&fs_info->reloc_mutex); in prepare_to_merge()
1841 rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; in prepare_to_merge()
1842 rc->merging_rsv_size += rc->nodes_relocated * 2; in prepare_to_merge()
1843 mutex_unlock(&fs_info->reloc_mutex); in prepare_to_merge()
1847 num_bytes = rc->merging_rsv_size; in prepare_to_merge()
1848 ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, in prepare_to_merge()
1854 trans = btrfs_join_transaction(rc->extent_root); in prepare_to_merge()
1857 btrfs_block_rsv_release(fs_info, rc->block_rsv, in prepare_to_merge()
1863 if (num_bytes != rc->merging_rsv_size) { in prepare_to_merge()
1865 btrfs_block_rsv_release(fs_info, rc->block_rsv, in prepare_to_merge()
1871 rc->merge_reloc_tree = 1; in prepare_to_merge()
1873 while (!list_empty(&rc->reloc_roots)) { in prepare_to_merge()
1874 reloc_root = list_entry(rc->reloc_roots.next, in prepare_to_merge()
1876 list_del_init(&reloc_root->root_list); in prepare_to_merge()
1878 root = btrfs_get_fs_root(fs_info, reloc_root->root_key.offset, in prepare_to_merge()
1880 BUG_ON(IS_ERR(root)); in prepare_to_merge()
1881 BUG_ON(root->reloc_root != reloc_root); in prepare_to_merge()
1888 btrfs_set_root_refs(&reloc_root->root_item, 1); in prepare_to_merge()
1889 btrfs_update_reloc_root(trans, root); in prepare_to_merge()
1891 list_add(&reloc_root->root_list, &reloc_roots); in prepare_to_merge()
1892 btrfs_put_root(root); in prepare_to_merge()
1895 list_splice(&reloc_roots, &rc->reloc_roots); in prepare_to_merge()
1916 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; in merge_reloc_roots()
1917 struct btrfs_root *root; in merge_reloc_roots() local
1923 root = rc->extent_root; in merge_reloc_roots()
1931 mutex_lock(&fs_info->reloc_mutex); in merge_reloc_roots()
1932 list_splice_init(&rc->reloc_roots, &reloc_roots); in merge_reloc_roots()
1933 mutex_unlock(&fs_info->reloc_mutex); in merge_reloc_roots()
1940 root = btrfs_get_fs_root(fs_info, reloc_root->root_key.offset, in merge_reloc_roots()
1942 if (btrfs_root_refs(&reloc_root->root_item) > 0) { in merge_reloc_roots()
1943 BUG_ON(IS_ERR(root)); in merge_reloc_roots()
1944 BUG_ON(root->reloc_root != reloc_root); in merge_reloc_roots()
1945 ret = merge_reloc_root(rc, root); in merge_reloc_roots()
1946 btrfs_put_root(root); in merge_reloc_roots()
1948 if (list_empty(&reloc_root->root_list)) in merge_reloc_roots()
1949 list_add_tail(&reloc_root->root_list, in merge_reloc_roots()
1954 if (!IS_ERR(root)) { in merge_reloc_roots()
1955 if (root->reloc_root == reloc_root) { in merge_reloc_roots()
1956 root->reloc_root = NULL; in merge_reloc_roots()
1960 &root->state); in merge_reloc_roots()
1961 btrfs_put_root(root); in merge_reloc_roots()
1964 list_del_init(&reloc_root->root_list); in merge_reloc_roots()
1965 /* Don't forget to queue this reloc root for cleanup */ in merge_reloc_roots()
1966 list_add_tail(&reloc_root->reloc_dirty_list, in merge_reloc_roots()
1967 &rc->dirty_subvol_roots); in merge_reloc_roots()
1980 /* new reloc root may be added */ in merge_reloc_roots()
1981 mutex_lock(&fs_info->reloc_mutex); in merge_reloc_roots()
1982 list_splice_init(&rc->reloc_roots, &reloc_roots); in merge_reloc_roots()
1983 mutex_unlock(&fs_info->reloc_mutex); in merge_reloc_roots()
1990 * BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); in merge_reloc_roots()
1995 * fine because we're bailing here, and we hold a reference on the root in merge_reloc_roots()
1997 * do the reloc_dirty_list afterwards. Meanwhile the root->reloc_root in merge_reloc_roots()
2018 struct btrfs_fs_info *fs_info = reloc_root->fs_info; in record_reloc_root_in_trans()
2019 struct btrfs_root *root; in record_reloc_root_in_trans() local
2022 if (reloc_root->last_trans == trans->transid) in record_reloc_root_in_trans()
2025 root = btrfs_get_fs_root(fs_info, reloc_root->root_key.offset, false); in record_reloc_root_in_trans()
2026 BUG_ON(IS_ERR(root)); in record_reloc_root_in_trans()
2027 BUG_ON(root->reloc_root != reloc_root); in record_reloc_root_in_trans()
2028 ret = btrfs_record_root_in_trans(trans, root); in record_reloc_root_in_trans()
2029 btrfs_put_root(root); in record_reloc_root_in_trans()
2037 struct btrfs_backref_node *node, in select_reloc_root() argument
2041 struct btrfs_root *root; in select_reloc_root() local
2044 next = node; in select_reloc_root()
2048 root = next->root; in select_reloc_root()
2049 BUG_ON(!root); in select_reloc_root()
2050 BUG_ON(!test_bit(BTRFS_ROOT_SHAREABLE, &root->state)); in select_reloc_root()
2052 if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { in select_reloc_root()
2053 record_reloc_root_in_trans(trans, root); in select_reloc_root()
2057 btrfs_record_root_in_trans(trans, root); in select_reloc_root()
2058 root = root->reloc_root; in select_reloc_root()
2060 if (next->new_bytenr != root->node->start) { in select_reloc_root()
2061 BUG_ON(next->new_bytenr); in select_reloc_root()
2062 BUG_ON(!list_empty(&next->list)); in select_reloc_root()
2063 next->new_bytenr = root->node->start; in select_reloc_root()
2064 btrfs_put_root(next->root); in select_reloc_root()
2065 next->root = btrfs_grab_root(root); in select_reloc_root()
2066 ASSERT(next->root); in select_reloc_root()
2067 list_add_tail(&next->list, in select_reloc_root()
2068 &rc->backref_cache.changed); in select_reloc_root()
2074 root = NULL; in select_reloc_root()
2076 if (!next || next->level <= node->level) in select_reloc_root()
2079 if (!root) in select_reloc_root()
2082 next = node; in select_reloc_root()
2083 /* setup backref node path for btrfs_reloc_cow_block */ in select_reloc_root()
2085 rc->backref_cache.path[next->level] = next; in select_reloc_root()
2086 if (--index < 0) in select_reloc_root()
2088 next = edges[index]->node[UPPER]; in select_reloc_root()
2090 return root; in select_reloc_root()
2094 * Select a tree root for relocation.
2099 * Return a tree root pointer if the block is shareable.
2100 * Return -ENOENT if the block is root of reloc tree.
2103 struct btrfs_root *select_one_root(struct btrfs_backref_node *node) in select_one_root() argument
2106 struct btrfs_root *root; in select_one_root() local
2108 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in select_one_root()
2111 next = node; in select_one_root()
2115 root = next->root; in select_one_root()
2116 BUG_ON(!root); in select_one_root()
2118 /* No other choice for non-shareable tree */ in select_one_root()
2119 if (!test_bit(BTRFS_ROOT_SHAREABLE, &root->state)) in select_one_root()
2120 return root; in select_one_root()
2122 if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) in select_one_root()
2123 fs_root = root; in select_one_root()
2125 if (next != node) in select_one_root()
2129 if (!next || next->level <= node->level) in select_one_root()
2134 return ERR_PTR(-ENOENT); in select_one_root()
2140 struct btrfs_backref_node *node, int reserve) in calcu_metadata_size() argument
2142 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; in calcu_metadata_size()
2143 struct btrfs_backref_node *next = node; in calcu_metadata_size()
2145 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in calcu_metadata_size()
2149 BUG_ON(reserve && node->processed); in calcu_metadata_size()
2154 if (next->processed && (reserve || next != node)) in calcu_metadata_size()
2157 num_bytes += fs_info->nodesize; in calcu_metadata_size()
2159 if (list_empty(&next->upper)) in calcu_metadata_size()
2162 edge = list_entry(next->upper.next, in calcu_metadata_size()
2165 next = edge->node[UPPER]; in calcu_metadata_size()
2174 struct btrfs_backref_node *node) in reserve_metadata_space() argument
2176 struct btrfs_root *root = rc->extent_root; in reserve_metadata_space() local
2177 struct btrfs_fs_info *fs_info = root->fs_info; in reserve_metadata_space()
2182 num_bytes = calcu_metadata_size(rc, node, 1) * 2; in reserve_metadata_space()
2184 trans->block_rsv = rc->block_rsv; in reserve_metadata_space()
2185 rc->reserved_bytes += num_bytes; in reserve_metadata_space()
2189 * If we get an enospc just kick back -EAGAIN so we know to drop the in reserve_metadata_space()
2192 ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes, in reserve_metadata_space()
2195 tmp = fs_info->nodesize * RELOCATION_RESERVED_NODES; in reserve_metadata_space()
2196 while (tmp <= rc->reserved_bytes) in reserve_metadata_space()
2205 rc->block_rsv->size = tmp + fs_info->nodesize * in reserve_metadata_space()
2207 return -EAGAIN; in reserve_metadata_space()
2222 struct btrfs_backref_node *node, in do_relocation() argument
2226 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; in do_relocation()
2229 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in do_relocation()
2230 struct btrfs_root *root; in do_relocation() local
2239 BUG_ON(lowest && node->eb); in do_relocation()
2241 path->lowest_level = node->level + 1; in do_relocation()
2242 rc->backref_cache.path[node->level] = node; in do_relocation()
2243 list_for_each_entry(edge, &node->upper, list[LOWER]) { in do_relocation()
2249 upper = edge->node[UPPER]; in do_relocation()
2250 root = select_reloc_root(trans, rc, upper, edges); in do_relocation()
2251 BUG_ON(!root); in do_relocation()
2253 if (upper->eb && !upper->locked) { in do_relocation()
2255 ret = btrfs_bin_search(upper->eb, key, &slot); in do_relocation()
2261 bytenr = btrfs_node_blockptr(upper->eb, slot); in do_relocation()
2262 if (node->eb->start == bytenr) in do_relocation()
2268 if (!upper->eb) { in do_relocation()
2269 ret = btrfs_search_slot(trans, root, key, path, 0, 1); in do_relocation()
2274 err = -ENOENT; in do_relocation()
2280 if (!upper->eb) { in do_relocation()
2281 upper->eb = path->nodes[upper->level]; in do_relocation()
2282 path->nodes[upper->level] = NULL; in do_relocation()
2284 BUG_ON(upper->eb != path->nodes[upper->level]); in do_relocation()
2287 upper->locked = 1; in do_relocation()
2288 path->locks[upper->level] = 0; in do_relocation()
2290 slot = path->slots[upper->level]; in do_relocation()
2293 ret = btrfs_bin_search(upper->eb, key, &slot); in do_relocation()
2301 bytenr = btrfs_node_blockptr(upper->eb, slot); in do_relocation()
2303 if (bytenr != node->bytenr) { in do_relocation()
2304 btrfs_err(root->fs_info, in do_relocation()
2305 "lowest leaf/node mismatch: bytenr %llu node->bytenr %llu slot %d upper %llu", in do_relocation()
2306 bytenr, node->bytenr, slot, in do_relocation()
2307 upper->eb->start); in do_relocation()
2308 err = -EIO; in do_relocation()
2312 if (node->eb->start == bytenr) in do_relocation()
2316 blocksize = root->fs_info->nodesize; in do_relocation()
2317 generation = btrfs_node_ptr_generation(upper->eb, slot); in do_relocation()
2318 btrfs_node_key_to_cpu(upper->eb, &first_key, slot); in do_relocation()
2320 upper->level - 1, &first_key); in do_relocation()
2326 err = -EIO; in do_relocation()
2332 if (!node->eb) { in do_relocation()
2333 ret = btrfs_cow_block(trans, root, eb, upper->eb, in do_relocation()
2341 BUG_ON(node->eb != eb); in do_relocation()
2343 btrfs_set_node_blockptr(upper->eb, slot, in do_relocation()
2344 node->eb->start); in do_relocation()
2345 btrfs_set_node_ptr_generation(upper->eb, slot, in do_relocation()
2346 trans->transid); in do_relocation()
2347 btrfs_mark_buffer_dirty(upper->eb); in do_relocation()
2350 node->eb->start, blocksize, in do_relocation()
2351 upper->eb->start); in do_relocation()
2352 ref.real_root = root->root_key.objectid; in do_relocation()
2353 btrfs_init_tree_ref(&ref, node->level, in do_relocation()
2354 btrfs_header_owner(upper->eb)); in do_relocation()
2358 ret = btrfs_drop_subtree(trans, root, eb, upper->eb); in do_relocation()
2362 if (!upper->pending) in do_relocation()
2370 if (!err && node->pending) { in do_relocation()
2371 btrfs_backref_drop_node_buffer(node); in do_relocation()
2372 list_move_tail(&node->list, &rc->backref_cache.changed); in do_relocation()
2373 node->pending = 0; in do_relocation()
2376 path->lowest_level = 0; in do_relocation()
2377 BUG_ON(err == -ENOSPC); in do_relocation()
2383 struct btrfs_backref_node *node, in link_to_upper() argument
2388 btrfs_node_key_to_cpu(node->eb, &key, 0); in link_to_upper()
2389 return do_relocation(trans, rc, node, &key, path, 0); in link_to_upper()
2397 struct btrfs_backref_cache *cache = &rc->backref_cache; in finish_pending_nodes()
2398 struct btrfs_backref_node *node; in finish_pending_nodes() local
2403 while (!list_empty(&cache->pending[level])) { in finish_pending_nodes()
2404 node = list_entry(cache->pending[level].next, in finish_pending_nodes()
2406 list_move_tail(&node->list, &list); in finish_pending_nodes()
2407 BUG_ON(!node->pending); in finish_pending_nodes()
2410 ret = link_to_upper(trans, rc, node, path); in finish_pending_nodes()
2415 list_splice_init(&list, &cache->pending[level]); in finish_pending_nodes()
2425 struct btrfs_backref_node *node) in update_processed_blocks() argument
2427 struct btrfs_backref_node *next = node; in update_processed_blocks()
2429 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in update_processed_blocks()
2435 if (next->processed) in update_processed_blocks()
2440 if (list_empty(&next->upper)) in update_processed_blocks()
2443 edge = list_entry(next->upper.next, in update_processed_blocks()
2446 next = edge->node[UPPER]; in update_processed_blocks()
2454 u32 blocksize = rc->extent_root->fs_info->nodesize; in tree_block_processed()
2456 if (test_range_bit(&rc->processed_blocks, bytenr, in tree_block_processed()
2457 bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) in tree_block_processed()
2467 eb = read_tree_block(fs_info, block->bytenr, block->key.offset, in get_tree_block_key()
2468 block->level, NULL); in get_tree_block_key()
2473 return -EIO; in get_tree_block_key()
2475 if (block->level == 0) in get_tree_block_key()
2476 btrfs_item_key_to_cpu(eb, &block->key, 0); in get_tree_block_key()
2478 btrfs_node_key_to_cpu(eb, &block->key, 0); in get_tree_block_key()
2480 block->key_ready = 1; in get_tree_block_key()
2489 struct btrfs_backref_node *node, in relocate_tree_block() argument
2493 struct btrfs_root *root; in relocate_tree_block() local
2496 if (!node) in relocate_tree_block()
2503 ret = reserve_metadata_space(trans, rc, node); in relocate_tree_block()
2507 BUG_ON(node->processed); in relocate_tree_block()
2508 root = select_one_root(node); in relocate_tree_block()
2509 if (root == ERR_PTR(-ENOENT)) { in relocate_tree_block()
2510 update_processed_blocks(rc, node); in relocate_tree_block()
2514 if (root) { in relocate_tree_block()
2515 if (test_bit(BTRFS_ROOT_SHAREABLE, &root->state)) { in relocate_tree_block()
2516 BUG_ON(node->new_bytenr); in relocate_tree_block()
2517 BUG_ON(!list_empty(&node->list)); in relocate_tree_block()
2518 btrfs_record_root_in_trans(trans, root); in relocate_tree_block()
2519 root = root->reloc_root; in relocate_tree_block()
2520 node->new_bytenr = root->node->start; in relocate_tree_block()
2521 btrfs_put_root(node->root); in relocate_tree_block()
2522 node->root = btrfs_grab_root(root); in relocate_tree_block()
2523 ASSERT(node->root); in relocate_tree_block()
2524 list_add_tail(&node->list, &rc->backref_cache.changed); in relocate_tree_block()
2526 path->lowest_level = node->level; in relocate_tree_block()
2527 ret = btrfs_search_slot(trans, root, key, path, 0, 1); in relocate_tree_block()
2533 update_processed_blocks(rc, node); in relocate_tree_block()
2535 ret = do_relocation(trans, rc, node, key, path, 1); in relocate_tree_block()
2538 if (ret || node->level == 0 || node->cowonly) in relocate_tree_block()
2539 btrfs_backref_cleanup_node(&rc->backref_cache, node); in relocate_tree_block()
2550 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; in relocate_tree_blocks()
2551 struct btrfs_backref_node *node; in relocate_tree_blocks() local
2560 err = -ENOMEM; in relocate_tree_blocks()
2566 if (!block->key_ready) in relocate_tree_blocks()
2567 readahead_tree_block(fs_info, block->bytenr); in relocate_tree_blocks()
2572 if (!block->key_ready) { in relocate_tree_blocks()
2581 node = build_backref_tree(rc, &block->key, in relocate_tree_blocks()
2582 block->level, block->bytenr); in relocate_tree_blocks()
2583 if (IS_ERR(node)) { in relocate_tree_blocks()
2584 err = PTR_ERR(node); in relocate_tree_blocks()
2588 ret = relocate_tree_block(trans, rc, node, &block->key, in relocate_tree_blocks()
2612 u64 offset = inode->index_cnt; in prealloc_file_extent_cluster()
2616 u64 prealloc_start = cluster->start - offset; in prealloc_file_extent_cluster()
2617 u64 prealloc_end = cluster->end - offset; in prealloc_file_extent_cluster()
2620 BUG_ON(cluster->start != cluster->boundary[0]); in prealloc_file_extent_cluster()
2622 prealloc_end + 1 - prealloc_start); in prealloc_file_extent_cluster()
2626 inode_lock(&inode->vfs_inode); in prealloc_file_extent_cluster()
2627 for (nr = 0; nr < cluster->nr; nr++) { in prealloc_file_extent_cluster()
2628 start = cluster->boundary[nr] - offset; in prealloc_file_extent_cluster()
2629 if (nr + 1 < cluster->nr) in prealloc_file_extent_cluster()
2630 end = cluster->boundary[nr + 1] - 1 - offset; in prealloc_file_extent_cluster()
2632 end = cluster->end - offset; in prealloc_file_extent_cluster()
2634 lock_extent(&inode->io_tree, start, end); in prealloc_file_extent_cluster()
2635 num_bytes = end + 1 - start; in prealloc_file_extent_cluster()
2636 ret = btrfs_prealloc_file_range(&inode->vfs_inode, 0, start, in prealloc_file_extent_cluster()
2640 unlock_extent(&inode->io_tree, start, end); in prealloc_file_extent_cluster()
2644 inode_unlock(&inode->vfs_inode); in prealloc_file_extent_cluster()
2647 btrfs_free_reserved_data_space_noquota(inode->root->fs_info, in prealloc_file_extent_cluster()
2648 prealloc_end + 1 - cur_offset); in prealloc_file_extent_cluster()
2656 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; in setup_extent_mapping()
2662 return -ENOMEM; in setup_extent_mapping()
2664 em->start = start; in setup_extent_mapping()
2665 em->len = end + 1 - start; in setup_extent_mapping()
2666 em->block_len = em->len; in setup_extent_mapping()
2667 em->block_start = block_start; in setup_extent_mapping()
2668 set_bit(EXTENT_FLAG_PINNED, &em->flags); in setup_extent_mapping()
2670 lock_extent(&BTRFS_I(inode)->io_tree, start, end); in setup_extent_mapping()
2672 write_lock(&em_tree->lock); in setup_extent_mapping()
2674 write_unlock(&em_tree->lock); in setup_extent_mapping()
2675 if (ret != -EEXIST) { in setup_extent_mapping()
2681 unlock_extent(&BTRFS_I(inode)->io_tree, start, end); in setup_extent_mapping()
2690 return atomic_read(&fs_info->balance_cancel_req) || in btrfs_should_cancel_balance()
2698 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); in relocate_file_extent_cluster()
2701 u64 offset = BTRFS_I(inode)->index_cnt; in relocate_file_extent_cluster()
2706 gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); in relocate_file_extent_cluster()
2710 if (!cluster->nr) in relocate_file_extent_cluster()
2715 return -ENOMEM; in relocate_file_extent_cluster()
2721 file_ra_state_init(ra, inode->i_mapping); in relocate_file_extent_cluster()
2723 ret = setup_extent_mapping(inode, cluster->start - offset, in relocate_file_extent_cluster()
2724 cluster->end - offset, cluster->start); in relocate_file_extent_cluster()
2728 index = (cluster->start - offset) >> PAGE_SHIFT; in relocate_file_extent_cluster()
2729 last_index = (cluster->end - offset) >> PAGE_SHIFT; in relocate_file_extent_cluster()
2736 page = find_lock_page(inode->i_mapping, index); in relocate_file_extent_cluster()
2738 page_cache_sync_readahead(inode->i_mapping, in relocate_file_extent_cluster()
2740 last_index + 1 - index); in relocate_file_extent_cluster()
2741 page = find_or_create_page(inode->i_mapping, index, in relocate_file_extent_cluster()
2748 ret = -ENOMEM; in relocate_file_extent_cluster()
2754 page_cache_async_readahead(inode->i_mapping, in relocate_file_extent_cluster()
2756 last_index + 1 - index); in relocate_file_extent_cluster()
2769 ret = -EIO; in relocate_file_extent_cluster()
2775 page_end = page_start + PAGE_SIZE - 1; in relocate_file_extent_cluster()
2777 lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); in relocate_file_extent_cluster()
2781 if (nr < cluster->nr && in relocate_file_extent_cluster()
2782 page_start + offset == cluster->boundary[nr]) { in relocate_file_extent_cluster()
2783 set_extent_bits(&BTRFS_I(inode)->io_tree, in relocate_file_extent_cluster()
2799 clear_extent_bits(&BTRFS_I(inode)->io_tree, in relocate_file_extent_cluster()
2807 unlock_extent(&BTRFS_I(inode)->io_tree, in relocate_file_extent_cluster()
2814 balance_dirty_pages_ratelimited(inode->i_mapping); in relocate_file_extent_cluster()
2817 ret = -ECANCELED; in relocate_file_extent_cluster()
2821 WARN_ON(nr != cluster->nr); in relocate_file_extent_cluster()
2833 if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { in relocate_data_extent()
2837 cluster->nr = 0; in relocate_data_extent()
2840 if (!cluster->nr) in relocate_data_extent()
2841 cluster->start = extent_key->objectid; in relocate_data_extent()
2843 BUG_ON(cluster->nr >= MAX_EXTENTS); in relocate_data_extent()
2844 cluster->end = extent_key->objectid + extent_key->offset - 1; in relocate_data_extent()
2845 cluster->boundary[cluster->nr] = extent_key->objectid; in relocate_data_extent()
2846 cluster->nr++; in relocate_data_extent()
2848 if (cluster->nr >= MAX_EXTENTS) { in relocate_data_extent()
2852 cluster->nr = 0; in relocate_data_extent()
2872 int level = -1; in add_tree_block()
2875 eb = path->nodes[0]; in add_tree_block()
2876 item_size = btrfs_item_size_nr(eb, path->slots[0]); in add_tree_block()
2878 if (extent_key->type == BTRFS_METADATA_ITEM_KEY || in add_tree_block()
2880 ei = btrfs_item_ptr(eb, path->slots[0], in add_tree_block()
2882 if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { in add_tree_block()
2886 level = (int)extent_key->offset; in add_tree_block()
2890 btrfs_print_v0_err(eb->fs_info); in add_tree_block()
2891 btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); in add_tree_block()
2892 return -EINVAL; in add_tree_block()
2899 BUG_ON(level == -1); in add_tree_block()
2903 return -ENOMEM; in add_tree_block()
2905 block->bytenr = extent_key->objectid; in add_tree_block()
2906 block->key.objectid = rc->extent_root->fs_info->nodesize; in add_tree_block()
2907 block->key.offset = generation; in add_tree_block()
2908 block->level = level; in add_tree_block()
2909 block->key_ready = 0; in add_tree_block()
2911 rb_node = rb_simple_insert(blocks, block->bytenr, &block->rb_node); in add_tree_block()
2913 btrfs_backref_panic(rc->extent_root->fs_info, block->bytenr, in add_tree_block()
2914 -EEXIST); in add_tree_block()
2926 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; in __add_tree_block()
2940 return -ENOMEM; in __add_tree_block()
2945 key.offset = (u64)-1; in __add_tree_block()
2951 path->search_commit_root = 1; in __add_tree_block()
2952 path->skip_locking = 1; in __add_tree_block()
2953 ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); in __add_tree_block()
2958 if (path->slots[0]) { in __add_tree_block()
2959 path->slots[0]--; in __add_tree_block()
2960 btrfs_item_key_to_cpu(path->nodes[0], &key, in __add_tree_block()
2961 path->slots[0]); in __add_tree_block()
2977 btrfs_print_leaf(path->nodes[0]); in __add_tree_block()
2982 ret = -EINVAL; in __add_tree_block()
2997 struct btrfs_root *root = fs_info->tree_root; in delete_block_group_cache() local
3004 inode = btrfs_iget(fs_info->sb, ino, root); in delete_block_group_cache()
3006 return -ENOENT; in delete_block_group_cache()
3010 &fs_info->global_block_rsv); in delete_block_group_cache()
3014 trans = btrfs_join_transaction(root); in delete_block_group_cache()
3030 * Locate the free space cache EXTENT_DATA in root tree leaf and delete the
3065 return -ENOENT; in delete_v1_space_cache()
3066 ret = delete_block_group_cache(leaf->fs_info, block_group, NULL, in delete_v1_space_cache()
3080 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; in add_data_references()
3084 const u32 blocksize = fs_info->nodesize; in add_data_references()
3088 ret = btrfs_find_all_leafs(NULL, fs_info, extent_key->objectid, in add_data_references()
3097 eb = read_tree_block(fs_info, ref_node->val, 0, 0, NULL); in add_data_references()
3102 ret = delete_v1_space_cache(eb, rc->block_group, in add_data_references()
3103 extent_key->objectid); in add_data_references()
3107 ret = __add_tree_block(rc, ref_node->val, blocksize, blocks); in add_data_references()
3124 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; in find_next_extent()
3130 last = rc->block_group->start + rc->block_group->length; in find_next_extent()
3133 if (rc->search_start >= last) { in find_next_extent()
3138 key.objectid = rc->search_start; in find_next_extent()
3142 path->search_commit_root = 1; in find_next_extent()
3143 path->skip_locking = 1; in find_next_extent()
3144 ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, in find_next_extent()
3149 leaf = path->nodes[0]; in find_next_extent()
3150 if (path->slots[0] >= btrfs_header_nritems(leaf)) { in find_next_extent()
3151 ret = btrfs_next_leaf(rc->extent_root, path); in find_next_extent()
3154 leaf = path->nodes[0]; in find_next_extent()
3157 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in find_next_extent()
3165 path->slots[0]++; in find_next_extent()
3170 key.objectid + key.offset <= rc->search_start) { in find_next_extent()
3171 path->slots[0]++; in find_next_extent()
3176 key.objectid + fs_info->nodesize <= in find_next_extent()
3177 rc->search_start) { in find_next_extent()
3178 path->slots[0]++; in find_next_extent()
3182 ret = find_first_extent_bit(&rc->processed_blocks, in find_next_extent()
3188 rc->search_start = end + 1; in find_next_extent()
3191 rc->search_start = key.objectid + key.offset; in find_next_extent()
3193 rc->search_start = key.objectid + in find_next_extent()
3194 fs_info->nodesize; in find_next_extent()
3205 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; in set_reloc_control()
3207 mutex_lock(&fs_info->reloc_mutex); in set_reloc_control()
3208 fs_info->reloc_ctl = rc; in set_reloc_control()
3209 mutex_unlock(&fs_info->reloc_mutex); in set_reloc_control()
3214 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; in unset_reloc_control()
3216 mutex_lock(&fs_info->reloc_mutex); in unset_reloc_control()
3217 fs_info->reloc_ctl = NULL; in unset_reloc_control()
3218 mutex_unlock(&fs_info->reloc_mutex); in unset_reloc_control()
3241 rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root->fs_info, in prepare_to_relocate()
3243 if (!rc->block_rsv) in prepare_to_relocate()
3244 return -ENOMEM; in prepare_to_relocate()
3246 memset(&rc->cluster, 0, sizeof(rc->cluster)); in prepare_to_relocate()
3247 rc->search_start = rc->block_group->start; in prepare_to_relocate()
3248 rc->extents_found = 0; in prepare_to_relocate()
3249 rc->nodes_relocated = 0; in prepare_to_relocate()
3250 rc->merging_rsv_size = 0; in prepare_to_relocate()
3251 rc->reserved_bytes = 0; in prepare_to_relocate()
3252 rc->block_rsv->size = rc->extent_root->fs_info->nodesize * in prepare_to_relocate()
3254 ret = btrfs_block_rsv_refill(rc->extent_root, in prepare_to_relocate()
3255 rc->block_rsv, rc->block_rsv->size, in prepare_to_relocate()
3260 rc->create_reloc_tree = 1; in prepare_to_relocate()
3263 trans = btrfs_join_transaction(rc->extent_root); in prepare_to_relocate()
3283 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; in relocate_block_group()
3297 return -ENOMEM; in relocate_block_group()
3298 path->reada = READA_FORWARD; in relocate_block_group()
3307 rc->reserved_bytes = 0; in relocate_block_group()
3308 ret = btrfs_block_rsv_refill(rc->extent_root, in relocate_block_group()
3309 rc->block_rsv, rc->block_rsv->size, in relocate_block_group()
3316 trans = btrfs_start_transaction(rc->extent_root, 0); in relocate_block_group()
3323 if (update_backref_cache(trans, &rc->backref_cache)) { in relocate_block_group()
3335 rc->extents_found++; in relocate_block_group()
3337 ei = btrfs_item_ptr(path->nodes[0], path->slots[0], in relocate_block_group()
3339 item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); in relocate_block_group()
3341 flags = btrfs_extent_flags(path->nodes[0], ei); in relocate_block_group()
3345 err = -EINVAL; in relocate_block_group()
3346 btrfs_print_v0_err(trans->fs_info); in relocate_block_group()
3355 } else if (rc->stage == UPDATE_DATA_PTRS && in relocate_block_group()
3370 if (ret != -EAGAIN) { in relocate_block_group()
3374 rc->extents_found--; in relocate_block_group()
3375 rc->search_start = key.objectid; in relocate_block_group()
3383 if (rc->stage == MOVE_DATA_EXTENTS && in relocate_block_group()
3385 rc->found_file_extent = 1; in relocate_block_group()
3386 ret = relocate_data_extent(rc->data_inode, in relocate_block_group()
3387 &key, &rc->cluster); in relocate_block_group()
3394 err = -ECANCELED; in relocate_block_group()
3398 if (trans && progress && err == -ENOSPC) { in relocate_block_group()
3399 ret = btrfs_force_chunk_alloc(trans, rc->block_group->flags); in relocate_block_group()
3408 clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY); in relocate_block_group()
3416 ret = relocate_file_extent_cluster(rc->data_inode, in relocate_block_group()
3417 &rc->cluster); in relocate_block_group()
3422 rc->create_reloc_tree = 0; in relocate_block_group()
3425 btrfs_backref_release_cache(&rc->backref_cache); in relocate_block_group()
3426 btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); in relocate_block_group()
3440 rc->merge_reloc_tree = 0; in relocate_block_group()
3442 btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); in relocate_block_group()
3445 trans = btrfs_join_transaction(rc->extent_root); in relocate_block_group()
3457 btrfs_free_block_rsv(fs_info, rc->block_rsv); in relocate_block_group()
3463 struct btrfs_root *root, u64 objectid) in __insert_orphan_inode() argument
3472 return -ENOMEM; in __insert_orphan_inode()
3474 ret = btrfs_insert_empty_inode(trans, root, path, objectid); in __insert_orphan_inode()
3478 leaf = path->nodes[0]; in __insert_orphan_inode()
3479 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); in __insert_orphan_inode()
3502 struct btrfs_root *root; in create_reloc_inode() local
3506 root = btrfs_grab_root(fs_info->data_reloc_root); in create_reloc_inode()
3507 trans = btrfs_start_transaction(root, 6); in create_reloc_inode()
3509 btrfs_put_root(root); in create_reloc_inode()
3513 err = btrfs_find_free_objectid(root, &objectid); in create_reloc_inode()
3517 err = __insert_orphan_inode(trans, root, objectid); in create_reloc_inode()
3520 inode = btrfs_iget(fs_info->sb, objectid, root); in create_reloc_inode()
3522 BTRFS_I(inode)->index_cnt = group->start; in create_reloc_inode()
3526 btrfs_put_root(root); in create_reloc_inode()
3545 INIT_LIST_HEAD(&rc->reloc_roots); in alloc_reloc_control()
3546 INIT_LIST_HEAD(&rc->dirty_subvol_roots); in alloc_reloc_control()
3547 btrfs_backref_init_cache(fs_info, &rc->backref_cache, 1); in alloc_reloc_control()
3548 mapping_tree_init(&rc->reloc_root_tree); in alloc_reloc_control()
3549 extent_io_tree_init(fs_info, &rc->processed_blocks, in alloc_reloc_control()
3556 struct mapping_node *node, *tmp; in free_reloc_control() local
3558 free_reloc_roots(&rc->reloc_roots); in free_reloc_control()
3559 rbtree_postorder_for_each_entry_safe(node, tmp, in free_reloc_control()
3560 &rc->reloc_root_tree.rb_root, rb_node) in free_reloc_control()
3561 kfree(node); in free_reloc_control()
3574 btrfs_describe_block_groups(block_group->flags, buf, sizeof(buf)); in describe_relocation()
3578 block_group->start, buf); in describe_relocation()
3596 struct btrfs_root *extent_root = fs_info->extent_root; in btrfs_relocate_block_group()
3606 return -ENOENT; in btrfs_relocate_block_group()
3610 return -ETXTBSY; in btrfs_relocate_block_group()
3616 return -ENOMEM; in btrfs_relocate_block_group()
3619 rc->extent_root = extent_root; in btrfs_relocate_block_group()
3620 rc->block_group = bg; in btrfs_relocate_block_group()
3622 ret = btrfs_inc_block_group_ro(rc->block_group, true); in btrfs_relocate_block_group()
3631 err = -ENOMEM; in btrfs_relocate_block_group()
3635 inode = lookup_free_space_inode(rc->block_group, path); in btrfs_relocate_block_group()
3639 ret = delete_block_group_cache(fs_info, rc->block_group, inode, 0); in btrfs_relocate_block_group()
3643 if (ret && ret != -ENOENT) { in btrfs_relocate_block_group()
3648 rc->data_inode = create_reloc_inode(fs_info, rc->block_group); in btrfs_relocate_block_group()
3649 if (IS_ERR(rc->data_inode)) { in btrfs_relocate_block_group()
3650 err = PTR_ERR(rc->data_inode); in btrfs_relocate_block_group()
3651 rc->data_inode = NULL; in btrfs_relocate_block_group()
3655 describe_relocation(fs_info, rc->block_group); in btrfs_relocate_block_group()
3657 btrfs_wait_block_group_reservations(rc->block_group); in btrfs_relocate_block_group()
3658 btrfs_wait_nocow_writers(rc->block_group); in btrfs_relocate_block_group()
3660 rc->block_group->start, in btrfs_relocate_block_group()
3661 rc->block_group->length); in btrfs_relocate_block_group()
3666 mutex_lock(&fs_info->cleaner_mutex); in btrfs_relocate_block_group()
3668 mutex_unlock(&fs_info->cleaner_mutex); in btrfs_relocate_block_group()
3672 finishes_stage = rc->stage; in btrfs_relocate_block_group()
3677 * BUG_ON(rc->stage == UPDATE_DATA_PTRS) in in btrfs_relocate_block_group()
3682 if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { in btrfs_relocate_block_group()
3683 ret = btrfs_wait_ordered_range(rc->data_inode, 0, in btrfs_relocate_block_group()
3684 (u64)-1); in btrfs_relocate_block_group()
3687 invalidate_mapping_pages(rc->data_inode->i_mapping, in btrfs_relocate_block_group()
3688 0, -1); in btrfs_relocate_block_group()
3689 rc->stage = UPDATE_DATA_PTRS; in btrfs_relocate_block_group()
3695 if (rc->extents_found == 0) in btrfs_relocate_block_group()
3699 rc->extents_found, stage_to_string(finishes_stage)); in btrfs_relocate_block_group()
3702 WARN_ON(rc->block_group->pinned > 0); in btrfs_relocate_block_group()
3703 WARN_ON(rc->block_group->reserved > 0); in btrfs_relocate_block_group()
3704 WARN_ON(rc->block_group->used > 0); in btrfs_relocate_block_group()
3707 btrfs_dec_block_group_ro(rc->block_group); in btrfs_relocate_block_group()
3708 iput(rc->data_inode); in btrfs_relocate_block_group()
3709 btrfs_put_block_group(rc->block_group); in btrfs_relocate_block_group()
3714 static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) in mark_garbage_root() argument
3716 struct btrfs_fs_info *fs_info = root->fs_info; in mark_garbage_root()
3720 trans = btrfs_start_transaction(fs_info->tree_root, 0); in mark_garbage_root()
3724 memset(&root->root_item.drop_progress, 0, in mark_garbage_root()
3725 sizeof(root->root_item.drop_progress)); in mark_garbage_root()
3726 root->root_item.drop_level = 0; in mark_garbage_root()
3727 btrfs_set_root_refs(&root->root_item, 0); in mark_garbage_root()
3728 ret = btrfs_update_root(trans, fs_info->tree_root, in mark_garbage_root()
3729 &root->root_key, &root->root_item); in mark_garbage_root()
3743 int btrfs_recover_relocation(struct btrfs_root *root) in btrfs_recover_relocation() argument
3745 struct btrfs_fs_info *fs_info = root->fs_info; in btrfs_recover_relocation()
3759 return -ENOMEM; in btrfs_recover_relocation()
3760 path->reada = READA_BACK; in btrfs_recover_relocation()
3764 key.offset = (u64)-1; in btrfs_recover_relocation()
3767 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, in btrfs_recover_relocation()
3774 if (path->slots[0] == 0) in btrfs_recover_relocation()
3776 path->slots[0]--; in btrfs_recover_relocation()
3778 leaf = path->nodes[0]; in btrfs_recover_relocation()
3779 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in btrfs_recover_relocation()
3786 reloc_root = btrfs_read_tree_root(root, &key); in btrfs_recover_relocation()
3792 set_bit(BTRFS_ROOT_SHAREABLE, &reloc_root->state); in btrfs_recover_relocation()
3793 list_add(&reloc_root->root_list, &reloc_roots); in btrfs_recover_relocation()
3795 if (btrfs_root_refs(&reloc_root->root_item) > 0) { in btrfs_recover_relocation()
3797 reloc_root->root_key.offset, false); in btrfs_recover_relocation()
3800 if (ret != -ENOENT) { in btrfs_recover_relocation()
3817 key.offset--; in btrfs_recover_relocation()
3826 err = -ENOMEM; in btrfs_recover_relocation()
3830 rc->extent_root = fs_info->extent_root; in btrfs_recover_relocation()
3834 trans = btrfs_join_transaction(rc->extent_root); in btrfs_recover_relocation()
3840 rc->merge_reloc_tree = 1; in btrfs_recover_relocation()
3845 list_del(&reloc_root->root_list); in btrfs_recover_relocation()
3847 if (btrfs_root_refs(&reloc_root->root_item) == 0) { in btrfs_recover_relocation()
3848 list_add_tail(&reloc_root->root_list, in btrfs_recover_relocation()
3849 &rc->reloc_roots); in btrfs_recover_relocation()
3853 fs_root = btrfs_get_fs_root(fs_info, reloc_root->root_key.offset, in btrfs_recover_relocation()
3857 list_add_tail(&reloc_root->root_list, &reloc_roots); in btrfs_recover_relocation()
3863 BUG_ON(err < 0); /* -ENOMEM or logic error */ in btrfs_recover_relocation()
3864 fs_root->reloc_root = btrfs_grab_root(reloc_root); in btrfs_recover_relocation()
3876 trans = btrfs_join_transaction(rc->extent_root); in btrfs_recover_relocation()
3896 fs_root = btrfs_grab_root(fs_info->data_reloc_root); in btrfs_recover_relocation()
3908 * it also saves CPU time to re-calculate the checksum.
3912 struct btrfs_fs_info *fs_info = inode->root->fs_info; in btrfs_reloc_clone_csums()
3921 BUG_ON(ordered->file_offset != file_pos || ordered->num_bytes != len); in btrfs_reloc_clone_csums()
3923 disk_bytenr = file_pos + inode->index_cnt; in btrfs_reloc_clone_csums()
3924 ret = btrfs_lookup_csums_range(fs_info->csum_root, disk_bytenr, in btrfs_reloc_clone_csums()
3925 disk_bytenr + len - 1, &list, 0); in btrfs_reloc_clone_csums()
3931 list_del_init(&sums->list); in btrfs_reloc_clone_csums()
3945 new_bytenr = ordered->disk_bytenr + sums->bytenr - disk_bytenr; in btrfs_reloc_clone_csums()
3946 sums->bytenr = new_bytenr; in btrfs_reloc_clone_csums()
3956 struct btrfs_root *root, struct extent_buffer *buf, in btrfs_reloc_cow_block() argument
3959 struct btrfs_fs_info *fs_info = root->fs_info; in btrfs_reloc_cow_block()
3961 struct btrfs_backref_node *node; in btrfs_reloc_cow_block() local
3966 rc = fs_info->reloc_ctl; in btrfs_reloc_cow_block()
3970 BUG_ON(rc->stage == UPDATE_DATA_PTRS && in btrfs_reloc_cow_block()
3971 root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); in btrfs_reloc_cow_block()
3975 btrfs_root_last_snapshot(&root->root_item)) in btrfs_reloc_cow_block()
3978 if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && in btrfs_reloc_cow_block()
3979 rc->create_reloc_tree) { in btrfs_reloc_cow_block()
3982 node = rc->backref_cache.path[level]; in btrfs_reloc_cow_block()
3983 BUG_ON(node->bytenr != buf->start && in btrfs_reloc_cow_block()
3984 node->new_bytenr != buf->start); in btrfs_reloc_cow_block()
3986 btrfs_backref_drop_node_buffer(node); in btrfs_reloc_cow_block()
3987 atomic_inc(&cow->refs); in btrfs_reloc_cow_block()
3988 node->eb = cow; in btrfs_reloc_cow_block()
3989 node->new_bytenr = cow->start; in btrfs_reloc_cow_block()
3991 if (!node->pending) { in btrfs_reloc_cow_block()
3992 list_move_tail(&node->list, in btrfs_reloc_cow_block()
3993 &rc->backref_cache.pending[level]); in btrfs_reloc_cow_block()
3994 node->pending = 1; in btrfs_reloc_cow_block()
3998 mark_block_processed(rc, node); in btrfs_reloc_cow_block()
4001 rc->nodes_relocated += buf->len; in btrfs_reloc_cow_block()
4004 if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) in btrfs_reloc_cow_block()
4005 ret = replace_file_extents(trans, rc, root, cow); in btrfs_reloc_cow_block()
4016 struct btrfs_root *root = pending->root; in btrfs_reloc_pre_snapshot() local
4017 struct reloc_control *rc = root->fs_info->reloc_ctl; in btrfs_reloc_pre_snapshot()
4019 if (!rc || !have_reloc_root(root)) in btrfs_reloc_pre_snapshot()
4022 if (!rc->merge_reloc_tree) in btrfs_reloc_pre_snapshot()
4025 root = root->reloc_root; in btrfs_reloc_pre_snapshot()
4026 BUG_ON(btrfs_root_refs(&root->root_item) == 0); in btrfs_reloc_pre_snapshot()
4037 *bytes_to_reserve += rc->nodes_relocated; in btrfs_reloc_pre_snapshot()
4042 * and create reloc root for the newly created snapshot
4045 * references held on the reloc_root, one for root->reloc_root and one for
4046 * rc->reloc_roots.
4051 struct btrfs_root *root = pending->root; in btrfs_reloc_post_snapshot() local
4054 struct reloc_control *rc = root->fs_info->reloc_ctl; in btrfs_reloc_post_snapshot()
4057 if (!rc || !have_reloc_root(root)) in btrfs_reloc_post_snapshot()
4060 rc = root->fs_info->reloc_ctl; in btrfs_reloc_post_snapshot()
4061 rc->merging_rsv_size += rc->nodes_relocated; in btrfs_reloc_post_snapshot()
4063 if (rc->merge_reloc_tree) { in btrfs_reloc_post_snapshot()
4064 ret = btrfs_block_rsv_migrate(&pending->block_rsv, in btrfs_reloc_post_snapshot()
4065 rc->block_rsv, in btrfs_reloc_post_snapshot()
4066 rc->nodes_relocated, true); in btrfs_reloc_post_snapshot()
4071 new_root = pending->snap; in btrfs_reloc_post_snapshot()
4072 reloc_root = create_reloc_root(trans, root->reloc_root, in btrfs_reloc_post_snapshot()
4073 new_root->root_key.objectid); in btrfs_reloc_post_snapshot()
4079 new_root->reloc_root = btrfs_grab_root(reloc_root); in btrfs_reloc_post_snapshot()
4081 if (rc->create_reloc_tree) in btrfs_reloc_post_snapshot()
4082 ret = clone_backref_node(trans, rc, root, reloc_root); in btrfs_reloc_post_snapshot()